972.63 s
[regex-tdfa] No greencard found
972.63 s
[regex-tdfa] Using haddock version 2.30.0 found on system at:
972.63 s
[regex-tdfa] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
972.63 s
[regex-tdfa] No happy found
972.63 s
[regex-tdfa] Using haskell-suite found on system at: haskell-suite-dummy-location
972.63 s
[regex-tdfa] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
972.63 s
[regex-tdfa] No hmake found
972.63 s
[regex-tdfa] Using hpc version 0.69 found on system at:
972.63 s
[regex-tdfa] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
972.63 s
[regex-tdfa] Using hsc2hs version 0.68.10 found on system at:
972.63 s
[regex-tdfa] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
972.63 s
[regex-tdfa] Using hscolour version 1.25 found on system at:
972.63 s
[regex-tdfa] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
972.63 s
[regex-tdfa] No jhc found
972.63 s
[regex-tdfa] Using ld found on system at:
972.63 s
[semialign] include indexed-traversable-instances-0.1.2-Ir3T1QnJ6eVLrdWQiOT4vH
972.63 s
[semialign] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
972.63 s
[semialign] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
972.63 s
[semialign] include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
972.63 s
[semialign] include transformers-0.6.1.0-c3ec
972.63 s
[semialign] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
972.63 s
[semialign] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
972.64 s
[semialign] Data.Align=semialign-1.3.1-GjSyYQig4Ie64NgVCte6oq:Data.Align,Data.Crosswalk=semialign-1.3.1-GjSyYQig4Ie64NgVCte6oq:Data.Crosswalk,Data.Semialign=semialign-1.3.1-GjSyYQig4Ie64NgVCte6oq:Data.Semialign,Data.Semialign.Indexed=semialign-1.3.1-GjSyYQig4Ie64NgVCte6oq:Data.Semialign.Indexed,Data.Zip=semialign-1.3.1-GjSyYQig4Ie64NgVCte6oq:Data.Zip
972.64 s
[semialign] Ready component graph:
972.64 s
[semialign] definite semialign-1.3.1-GjSyYQig4Ie64NgVCte6oq
972.64 s
[semialign] depends base-4.19.0.0-b960
972.64 s
[semialign] depends containers-0.6.8-4775
972.64 s
[semialign] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
972.64 s
[semialign] depends indexed-traversable-0.1.4-HhvObHiiVRhC9VCRLqXs4g
972.64 s
[semialign] depends indexed-traversable-instances-0.1.2-Ir3T1QnJ6eVLrdWQiOT4vH
972.64 s
[semialign] depends semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
972.64 s
[semialign] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
972.64 s
[semialign] depends these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
972.64 s
[semialign] depends transformers-0.6.1.0-c3ec
972.64 s
[semialign] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
972.64 s
[semialign] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
972.64 s
[semialign] Using Cabal-3.10.2.0 compiled by ghc-9.8
972.64 s
[semialign] Using compiler: ghc-9.8.1
972.64 s
[semialign] Using install prefix:
972.64 s
[semialign] /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1
972.64 s
[semialign] Executables installed in:
972.64 s
[semialign] /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1/bin
972.64 s
[semialign] Libraries installed in:
972.64 s
[semialign] /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/semialign-1.3.1-GjSyYQig4Ie64NgVCte6oq
972.64 s
[semialign] Dynamic Libraries installed in:
972.64 s
[semialign] /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
972.64 s
[semialign] Private executables installed in:
972.64 s
[semialign] /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1/libexec/x86_64-linux-ghc-9.8.1/semialign-1.3.1
972.64 s
[semialign] Data files installed in:
972.64 s
[semialign] /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1/share/x86_64-linux-ghc-9.8.1/semialign-1.3.1
972.64 s
[semialign] Documentation installed in:
972.64 s
[semialign] /nix/store/080qjbwjddblbcpbbf6l3i53hph2rk60-semialign-1.3.1-doc/share/doc/semialign-1.3.1
972.64 s
[semialign] Configuration files installed in:
972.64 s
[semialign] /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1/etc
972.64 s
[semialign] No alex found
972.64 s
[semialign] Using ar found on system at:
972.64 s
[semialign] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
972.64 s
[semialign] No c2hs found
972.64 s
[semialign] No cpphs found
972.64 s
[semialign] No doctest found
972.64 s
[semialign] Using gcc version 14.3.0 given by user at:
972.64 s
[semialign] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
972.64 s
[semialign] Using ghc version 9.8.1 found on system at:
972.64 s
[semialign] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
972.64 s
[semialign] Using ghc-pkg version 9.8.1 found on system at:
972.64 s
[semialign] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
972.64 s
[semialign] No ghcjs found
972.64 s
[semialign] No ghcjs-pkg found
972.64 s
[semialign] No greencard found
972.64 s
[semialign] Using haddock version 2.30.0 found on system at:
972.64 s
[semialign] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
972.64 s
[semialign] No happy found
972.64 s
[semialign] Using haskell-suite found on system at: haskell-suite-dummy-location
972.64 s
[semialign] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
972.64 s
[semialign] No hmake found
972.64 s
[semialign] Using hpc version 0.69 found on system at:
972.64 s
[semialign] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
972.64 s
[semialign] Using hsc2hs version 0.68.10 found on system at:
972.64 s
[semialign] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
972.64 s
[semialign] Using hscolour version 1.25 found on system at:
972.64 s
[semialign] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
972.64 s
[semialign] No jhc found
972.64 s
[semialign] Using ld found on system at:
972.64 s
[semialign] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
972.64 s
[semialign] No pkg-config found
972.64 s
[semialign] Using runghc version 9.8.1 found on system at:
972.64 s
[semialign] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
972.64 s
[semialign] Using strip version 2.44 found on system at:
972.64 s
[semialign] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
972.64 s
[semialign] Using tar found on system at:
972.64 s
[trial-tomland] Phase: haddockPhase
972.64 s
[trial-tomland] Preprocessing library for trial-tomland-0.0.0.0..
972.64 s
[trial-tomland] Running Haddock on library for trial-tomland-0.0.0.0..
972.64 s
[trial-tomland] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
972.64 s
[trial-tomland] [1 of 1] Compiling Trial.Tomland
972.64 s
[trial-tomland] Haddock coverage:
972.64 s
[trial-tomland] 100% ( 8 / 8) in 'Trial.Tomland'
972.64 s
[witherable] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
972.64 s
[witherable] component witherable-0.5-4fUN7RryE5bFSuAGoMtqu8-witherable-tests
972.64 s
[witherable] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
972.64 s
[witherable] include base-4.19.0.0-b960
972.64 s
[witherable] include containers-0.6.8-4775
972.64 s
[witherable] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
972.64 s
[witherable] include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
972.64 s
[witherable] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
972.64 s
[witherable] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
972.64 s
[witherable] include transformers-0.6.1.0-c3ec
972.64 s
[witherable] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
972.64 s
[witherable] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
972.64 s
[witherable] include witherable-0.5-7zG28educK73JEyXcpqX0
972.64 s
[witherable] Linked component graph:
972.64 s
[witherable] unit witherable-0.5-7zG28educK73JEyXcpqX0
972.64 s
[witherable] include base-4.19.0.0-b960
972.64 s
[witherable] include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
972.64 s
[witherable] include containers-0.6.8-4775
972.64 s
[witherable] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
972.64 s
[witherable] include indexed-traversable-0.1.4-HhvObHiiVRhC9VCRLqXs4g
972.64 s
[witherable] include indexed-traversable-instances-0.1.2-Ir3T1QnJ6eVLrdWQiOT4vH
972.64 s
[witherable] include transformers-0.6.1.0-c3ec
972.64 s
[witherable] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
972.64 s
[witherable] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
972.64 s
[witherable] Witherable=witherable-0.5-7zG28educK73JEyXcpqX0:Witherable
972.64 s
[witherable] unit witherable-0.5-4fUN7RryE5bFSuAGoMtqu8-witherable-tests
972.64 s
[witherable] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
972.64 s
[witherable] include base-4.19.0.0-b960
972.64 s
[witherable] include containers-0.6.8-4775
972.64 s
[witherable] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
972.64 s
[witherable] include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
972.64 s
[witherable] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
972.64 s
[witherable] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
972.64 s
[witherable] include transformers-0.6.1.0-c3ec
972.64 s
[witherable] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
972.64 s
[witherable] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
972.64 s
[witherable] include witherable-0.5-7zG28educK73JEyXcpqX0
972.64 s
[witherable] Ready component graph:
972.64 s
[witherable] definite witherable-0.5-7zG28educK73JEyXcpqX0
972.64 s
[witherable] depends base-4.19.0.0-b960
972.64 s
[witherable] depends base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
972.64 s
[witherable] depends containers-0.6.8-4775
972.64 s
[witherable] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
972.64 s
[witherable] depends indexed-traversable-0.1.4-HhvObHiiVRhC9VCRLqXs4g
972.64 s
[witherable] depends indexed-traversable-instances-0.1.2-Ir3T1QnJ6eVLrdWQiOT4vH
972.64 s
[witherable] depends transformers-0.6.1.0-c3ec
972.64 s
[witherable] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
972.64 s
[witherable] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
972.64 s
[witherable] definite witherable-0.5-4fUN7RryE5bFSuAGoMtqu8-witherable-tests
972.64 s
[witherable] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
972.64 s
[witherable] depends base-4.19.0.0-b960
972.64 s
[witherable] depends containers-0.6.8-4775
972.64 s
[witherable] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
972.64 s
[witherable] depends quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
972.64 s
[witherable] depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
972.64 s
[witherable] depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
972.64 s
[witherable] depends transformers-0.6.1.0-c3ec
972.64 s
[witherable] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
972.64 s
[witherable] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
972.64 s
[witherable] depends witherable-0.5-7zG28educK73JEyXcpqX0
972.65 s
[witherable] Using Cabal-3.10.2.0 compiled by ghc-9.8
972.65 s
[witherable] Using compiler: ghc-9.8.1
972.65 s
[witherable] Using install prefix:
972.65 s
[witherable] /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5
972.65 s
[witherable] Executables installed in:
972.65 s
[witherable] /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5/bin
972.65 s
[witherable] Libraries installed in:
972.65 s
[witherable] /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/witherable-0.5-7zG28educK73JEyXcpqX0
972.65 s
[witherable] Dynamic Libraries installed in:
972.65 s
[witherable] /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
972.65 s
[witherable] Private executables installed in:
972.65 s
[witherable] /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5/libexec/x86_64-linux-ghc-9.8.1/witherable-0.5
972.65 s
[witherable] Data files installed in:
972.65 s
[witherable] /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5/share/x86_64-linux-ghc-9.8.1/witherable-0.5
972.65 s
[witherable] Documentation installed in:
972.65 s
[witherable] /nix/store/nj85ibdbnyzg3snfq2pn4py3xhnlkl03-witherable-0.5-doc/share/doc/witherable-0.5
972.65 s
[attoparsec] | ^^^^^^
972.65 s
[attoparsec]
972.65 s
[attoparsec] internal/Data/Attoparsec/ByteString/Buffer.hs:133:13: warning : [ GHC-68441 ] [ -Wdeprecations ]
972.65 s
[attoparsec] In the use of ‘memcpy’
972.65 s
[attoparsec] (imported from Data.ByteString.Internal, but defined in Data.ByteString.Internal.Type):
972.65 s
[attoparsec] Deprecated: "Use Foreign.Marshal.Utils.copyBytes instead"
972.65 s
[attoparsec] |
972.65 s
[attoparsec] 133 | memcpy (ptr `plusPtr` len0) (ptr1 `plusPtr` off1)
972.65 s
[attoparsec] | ^^^^^^
972.65 s
[attoparsec] [5 of 6] Compiling Data.Attoparsec.Text.Buffer ( internal/Data/Attoparsec/Text/Buffer.hs, dist/build/attoparsec-internal/Data/Attoparsec/Text/Buffer.o, dist/build/attoparsec-internal/Data/Attoparsec/Text/Buffer.dyn_o )
972.65 s
[attoparsec]
972.65 s
[attoparsec] internal/Data/Attoparsec/Text/Buffer.hs:44:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
972.65 s
[attoparsec] The import of ‘Data.Semigroup’ is redundant
972.65 s
[attoparsec] except perhaps to import instances from ‘Data.Semigroup’
972.65 s
[attoparsec] To import instances alone, use: import Data.Semigroup()
972.65 s
[attoparsec] |
972.65 s
[attoparsec] 44 | import Data.Semigroup (Semigroup(..))
972.65 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
972.65 s
[attoparsec] [6 of 6] Compiling Data.Attoparsec.Text.FastSet ( internal/Data/Attoparsec/Text/FastSet.hs, dist/build/attoparsec-internal/Data/Attoparsec/Text/FastSet.o, dist/build/attoparsec-internal/Data/Attoparsec/Text/FastSet.dyn_o )
972.65 s
[attoparsec] [1 of 6] Compiling Data.Attoparsec.ByteString.FastSet ( internal/Data/Attoparsec/ByteString/FastSet.hs, dist/build/attoparsec-internal/Data/Attoparsec/ByteString/FastSet.p_o )
972.65 s
[attoparsec]
972.65 s
[attoparsec] internal/Data/Attoparsec/ByteString/FastSet.hs:97:18: warning : [ GHC-68441 ] [ -Wdeprecations ]
972.65 s
[attoparsec] In the use of ‘memset’
972.65 s
[attoparsec] (imported from Data.ByteString.Internal, but defined in Data.ByteString.Internal.Type):
972.65 s
[attoparsec] Deprecated: "Use Foreign.Marshal.Utils.fillBytes instead"
972.65 s
[attoparsec] |
972.65 s
[attoparsec] 97 | _ <- I.memset t 0 32
972.65 s
[attoparsec] | ^^^^^^^^
972.65 s
[attoparsec] [2 of 6] Compiling Data.Attoparsec.Internal.Compat ( internal/Data/Attoparsec/Internal/Compat.hs, dist/build/attoparsec-internal/Data/Attoparsec/Internal/Compat.p_o )
972.65 s
[attoparsec] [3 of 6] Compiling Data.Attoparsec.Internal.Fhthagn ( internal/Data/Attoparsec/Internal/Fhthagn.hs, dist/build/attoparsec-internal/Data/Attoparsec/Internal/Fhthagn.p_o )
972.65 s
[attoparsec] [4 of 6] Compiling Data.Attoparsec.ByteString.Buffer ( internal/Data/Attoparsec/ByteString/Buffer.hs, dist/build/attoparsec-internal/Data/Attoparsec/ByteString/Buffer.p_o )
972.65 s
[attoparsec]
972.65 s
[attoparsec] internal/Data/Attoparsec/ByteString/Buffer.hs:62:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
972.65 s
[attoparsec] The import of ‘Data.Semigroup’ is redundant
972.65 s
[attoparsec] except perhaps to import instances from ‘Data.Semigroup’
972.65 s
[attoparsec] To import instances alone, use: import Data.Semigroup()
972.65 s
[attoparsec] |
972.65 s
[attoparsec] 62 | import Data.Semigroup (Semigroup(..))
972.65 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
972.65 s
[attoparsec]
972.65 s
[attoparsec] internal/Data/Attoparsec/ByteString/Buffer.hs:121:11: warning : [ GHC-68441 ] [ -Wdeprecations ]
972.65 s
[attoparsec] In the use of ‘memcpy’
972.65 s
[attoparsec] (imported from Data.ByteString.Internal, but defined in Data.ByteString.Internal.Type):
972.65 s
[attoparsec] Deprecated: "Use Foreign.Marshal.Utils.copyBytes instead"
972.65 s
[attoparsec] |
972.65 s
[attoparsec] 121 | memcpy (ptr0 `plusPtr` (off0+len0))
972.65 s
[attoparsec] | ^^^^^^
972.65 s
[attoparsec]
972.65 s
[attoparsec] internal/Data/Attoparsec/ByteString/Buffer.hs:132:13: warning : [ GHC-68441 ] [ -Wdeprecations ]
972.65 s
[extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
972.65 s
[extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
972.65 s
[extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
972.65 s
[extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
972.65 s
[extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
972.65 s
[extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
972.65 s
[extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
972.65 s
[extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
972.65 s
[extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
972.65 s
[extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
972.65 s
[extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
972.65 s
[extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
972.65 s
[extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
972.65 s
[extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
972.65 s
[extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
972.65 s
[extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing )
972.65 s
[extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
972.65 s
[extra] Haddock coverage:
972.65 s
[extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
972.65 s
[extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
972.65 s
[extra] 100% ( 28 / 28) in 'Data.Tuple.Extra'
972.65 s
[extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
972.65 s
[extra] 100% ( 7 / 7) in 'Numeric.Extra'
972.65 s
[extra] Warning: '(:)' is out of scope.
972.65 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
972.65 s
[extra] Warning: 'unzip' is ambiguous. It is defined
972.65 s
[extra] * in ‘Data.Functor’
972.65 s
[extra] * in ‘GHC.List’
972.65 s
[extra] You may be able to disambiguate the identifier by qualifying it or
972.65 s
[extra] by specifying the type/value namespace explicitly.
972.65 s
[extra] Defaulting to the one defined in ‘GHC.List’
972.65 s
[extra] Warning: 'firstJustM' is out of scope.
972.65 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
972.65 s
[extra] 100% ( 85 / 85) in 'Data.List.Extra'
972.65 s
[extra] Warning: 'Version' is ambiguous. It is defined
972.65 s
[extra] * in ‘Data.Version’
972.65 s
[extra] * in ‘Data.Version’
972.65 s
[extra] You may be able to disambiguate the identifier by qualifying it or
972.65 s
[extra] by specifying the type/value namespace explicitly.
972.65 s
[extra] Defaulting to the one defined in ‘Data.Version’
972.65 s
[extra] 100% ( 3 / 3) in 'Data.Version.Extra'
972.66 s
[extra] Warning: '(!?)' is ambiguous. It is defined
972.66 s
[extra] * in ‘GHC.List’
972.66 s
[extra] * at src/Data/List/NonEmpty/Extra.hs:48:1
972.66 s
[extra] You may be able to disambiguate the identifier by qualifying it or
972.66 s
[extra] by specifying the type/value namespace explicitly.
972.66 s
[extra] Defaulting to the one defined at src/Data/List/NonEmpty/Extra.hs:48:1
972.66 s
[extra] Warning: 'union' is ambiguous. It is defined
972.66 s
[extra] * in ‘Data.OldList’
972.66 s
[extra] * at src/Data/List/NonEmpty/Extra.hs:80:1
972.66 s
[extra] You may be able to disambiguate the identifier by qualifying it or
972.66 s
[extra] by specifying the type/value namespace explicitly.
972.66 s
[extra] Defaulting to the one defined at src/Data/List/NonEmpty/Extra.hs:80:1
972.66 s
[extra] 100% ( 22 / 22) in 'Data.List.NonEmpty.Extra'
972.66 s
[extra] Warning: 'fromJust' is out of scope.
972.66 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
972.66 s
[extra] 100% ( 11 / 11) in 'Data.Either.Extra'
972.66 s
[extra] Warning: 'ErrorCall' is ambiguous. It is defined
972.66 s
[extra] * in ‘GHC.Exception’
972.66 s
[extra] * in ‘GHC.Exception’
972.66 s
[extra] You may be able to disambiguate the identifier by qualifying it or
972.66 s
[extra] by specifying the type/value namespace explicitly.
972.66 s
[extra] Defaulting to the one defined in ‘GHC.Exception’
972.66 s
[extra] Warning: 'AssertionFailed' is ambiguous. It is defined
972.66 s
[extra] * in ‘GHC.IO.Exception’
972.66 s
[extra] * in ‘GHC.IO.Exception’
972.66 s
[extra] You may be able to disambiguate the identifier by qualifying it or
972.66 s
[extra] by specifying the type/value namespace explicitly.
972.66 s
[extra] Defaulting to the one defined in ‘GHC.IO.Exception’
972.66 s
[extra] Warning: 'SomeException' is ambiguous. It is defined
972.66 s
[extra] * in ‘GHC.Exception.Type’
972.66 s
[extra] * in ‘GHC.Exception.Type’
972.66 s
[extra] You may be able to disambiguate the identifier by qualifying it or
972.66 s
[extra] by specifying the type/value namespace explicitly.
972.66 s
[foldl] - Control.Monad.Primitive.D:R:PrimStateRWST
972.66 s
[foldl] - Control.Monad.Primitive.D:R:PrimStateReaderT
972.66 s
[foldl] - Control.Monad.Primitive.D:R:PrimStateSelectT
972.66 s
[foldl] - Control.Monad.Primitive.D:R:PrimStateStateT0
972.66 s
[foldl] - Control.Monad.Primitive.D:R:PrimStateStateT
972.66 s
[foldl] - Control.Monad.Primitive.D:R:PrimStateWriterT0
972.66 s
[foldl] - Control.Monad.Primitive.D:R:PrimStateWriterT1
972.66 s
[foldl] - Control.Monad.Primitive.D:R:PrimStateWriterT
972.66 s
[foldl] - Data.Vector.Generic.Base.basicLength
972.66 s
[foldl] - Data.Vector.Generic.Base.basicUnsafeCopy
972.66 s
[foldl] - Data.Vector.Generic.Base.basicUnsafeFreeze
972.66 s
[foldl] - Data.Vector.Generic.Base.basicUnsafeIndexM
972.66 s
[foldl] - Data.Vector.Generic.Base.basicUnsafeSlice
972.66 s
[foldl] - Data.Vector.Generic.Base.basicUnsafeThaw
972.66 s
[foldl] - Data.Vector.Generic.Base.elemseq
972.66 s
[foldl] - Data.Profunctor.Traversing.Baz
972.66 s
[foldl] - Data.Vector.Vector
972.66 s
[foldl] - Data.Vector.Mutable.MVector
972.66 s
[foldl] - Data.Vector.Primitive.Vector
972.66 s
[foldl] - Data.Vector.Primitive.Mutable.MVector
972.66 s
[foldl] - Data.Vector.Storable.Vector
972.66 s
[foldl] - Data.Vector.Storable.Mutable.MVector
972.66 s
[foldl] - Data.Vector.Strict.Vector
972.66 s
[foldl] - Data.Vector.Strict.Mutable.MVector
972.66 s
[foldl] - Data.Vector.Unboxed.Base.As
972.66 s
[foldl] - Data.Vector.Unboxed.Base.DoNotUnboxLazy
972.66 s
[foldl] - Data.Vector.Unboxed.Base.DoNotUnboxNormalForm
972.66 s
[foldl] - Data.Vector.Unboxed.Base.DoNotUnboxStrict
972.66 s
[foldl] - Data.Vector.Unboxed.Base.IsoUnbox
972.66 s
[foldl] - Data.Vector.Unboxed.Base.MVector
972.66 s
[foldl] - Data.Vector.Unboxed.Base.Unbox
972.66 s
[foldl] - Data.Vector.Unboxed.Base.UnboxViaPrim
972.66 s
[foldl] - Data.Vector.Unboxed.Base.Vector
972.66 s
[foldl] Warning: Control.Foldl.Text: could not find link destinations for:
972.66 s
[foldl] - Data.Profunctor.Traversing.Baz
972.66 s
[foldl] - Data.Vector.Vector
972.66 s
[foldl] - Data.Vector.Strict.Vector
972.67 s
[foldl] Warning: Control.Foldl.ByteString: could not find link destinations for:
972.67 s
[foldl] - Data.Vector.Generic.Mutable.Base.MVector
972.67 s
[foldl] - Data.Vector.Generic.Mutable.Base.basicClear
972.67 s
[foldl] - Data.Vector.Generic.Mutable.Base.basicInitialize
972.67 s
[foldl] - Data.Vector.Generic.Mutable.Base.basicLength
972.67 s
[foldl] - Data.Vector.Generic.Mutable.Base.basicOverlaps
972.67 s
[foldl] - Data.Vector.Generic.Mutable.Base.basicSet
972.67 s
[foldl] - Data.Vector.Generic.Mutable.Base.basicUnsafeCopy
972.67 s
[foldl] - Data.Vector.Generic.Mutable.Base.basicUnsafeGrow
972.67 s
[foldl] - Data.Vector.Generic.Mutable.Base.basicUnsafeMove
972.67 s
[foldl] - Data.Vector.Generic.Mutable.Base.basicUnsafeNew
972.67 s
[foldl] - Data.Vector.Generic.Mutable.Base.basicUnsafeRead
972.67 s
[foldl] - Data.Vector.Generic.Mutable.Base.basicUnsafeReplicate
972.67 s
[foldl] - Data.Vector.Generic.Mutable.Base.basicUnsafeSlice
972.67 s
[foldl] - Data.Vector.Generic.Mutable.Base.basicUnsafeWrite
972.67 s
[foldl] - Data.Vector.Generic.Base.basicLength
972.67 s
[foldl] - Data.Vector.Generic.Base.basicUnsafeCopy
972.67 s
[foldl] - Data.Vector.Generic.Base.basicUnsafeFreeze
972.67 s
[foldl] - Data.Vector.Generic.Base.basicUnsafeIndexM
972.67 s
[foldl] - Data.Vector.Generic.Base.basicUnsafeSlice
972.67 s
[foldl] - Data.Vector.Generic.Base.basicUnsafeThaw
972.67 s
[foldl] - Data.Vector.Generic.Base.elemseq
972.67 s
[foldl] - Data.ByteString.Internal.Type.D:R:ItemByteString
972.67 s
[foldl] - Data.Profunctor.Traversing.Baz
972.67 s
[foldl] - Data.Vector.Vector
972.67 s
[foldl] - Data.Vector.Primitive.Vector
972.67 s
[foldl] - Data.Vector.Primitive.Mutable.MVector
972.67 s
[foldl] - Data.Vector.Strict.Vector
972.67 s
[foldl] - Data.Vector.Unboxed.Base.MVector
972.67 s
[foldl] - Data.Vector.Unboxed.Base.MV_Word8
972.67 s
[foldl] - Data.Vector.Unboxed.Base.Unbox
972.67 s
[foldl] - Data.Vector.Unboxed.Base.Vector
972.67 s
[foldl] - Data.Vector.Unboxed.Base.V_Word8
972.67 s
[foldl] - Data.Vector.Unboxed.Base.D:R:MVectorsWord80
972.67 s
[foldl] - Data.Vector.Unboxed.Base.D:R:VectorWord80
972.67 s
[foldl] Documentation created: dist/doc/html/foldl/, dist/doc/html/foldl/foldl.txt
972.67 s
[foldl] Phase: installPhase
972.67 s
[foldl] Installing library in /nix/store/h7vs47g01bad3k8qqd3vkcd1jhhza6z4-foldl-1.4.18/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/foldl-1.4.18-62WoZL2Y1vbK9V8UvFwjK0
972.67 s
[free] You may be able to disambiguate the identifier by qualifying it or
972.67 s
[free] by specifying the type/value namespace explicitly.
972.67 s
[free] Defaulting to the one defined at src/Control/Monad/Trans/Free/Ap.hs:357:1
972.67 s
[free] Warning: 'Identity' is out of scope.
972.67 s
[free] If you qualify the identifier, haddock can try to link it anyway.
972.67 s
[free] Warning: 'Free' is ambiguous. It is defined
972.67 s
[free] * at src/Control/Monad/Free/Ap.hs:81:26
972.67 s
[free] * at src/Control/Monad/Free/Ap.hs:81:1
972.67 s
[free] * at src/Control/Monad/Trans/Free/Ap.hs:67:29
972.67 s
[free] * at src/Control/Monad/Trans/Free/Ap.hs:143:1
972.67 s
[free] You may be able to disambiguate the identifier by qualifying it or
972.67 s
[free] by specifying the type/value namespace explicitly.
972.67 s
[free] Defaulting to the one defined at src/Control/Monad/Trans/Free/Ap.hs:143:1
972.67 s
[free] Warning: 'iter' is ambiguous. It is defined
972.67 s
[free] * at src/Control/Monad/Free/Ap.hs:265:1
972.67 s
[free] * at src/Control/Monad/Trans/Free/Ap.hs:364:1
972.67 s
[free] You may be able to disambiguate the identifier by qualifying it or
972.67 s
[free] by specifying the type/value namespace explicitly.
972.67 s
[free] Defaulting to the one defined at src/Control/Monad/Trans/Free/Ap.hs:364:1
972.67 s
[free] 100% ( 16 / 16) in 'Control.Monad.Free.Ap'
972.67 s
[free] Warning: 'FreeT' is ambiguous. It is defined
972.67 s
[free] * at src/Control/Monad/Trans/Free.hs:150:23
972.67 s
[free] * at src/Control/Monad/Trans/Free.hs:150:1
972.67 s
[free] You may be able to disambiguate the identifier by qualifying it or
972.67 s
[free] by specifying the type/value namespace explicitly.
972.67 s
[free] Defaulting to the one defined at src/Control/Monad/Trans/Free.hs:150:1
972.67 s
[free] Warning: 'Free' is ambiguous. It is defined
972.67 s
[free] * at src/Control/Monad/Trans/Free.hs:77:29
972.67 s
[free] * at src/Control/Monad/Trans/Free.hs:153:1
972.67 s
[free] You may be able to disambiguate the identifier by qualifying it or
972.67 s
[free] by specifying the type/value namespace explicitly.
972.67 s
[free] Defaulting to the one defined at src/Control/Monad/Trans/Free.hs:153:1
972.67 s
[free] Warning: 'FT' is ambiguous. It is defined
972.67 s
[free] * at src/Control/Monad/Trans/Free/Church.hs:69:20
972.67 s
[free] * at src/Control/Monad/Trans/Free/Church.hs:69:1
972.67 s
[free] You may be able to disambiguate the identifier by qualifying it or
972.67 s
[free] by specifying the type/value namespace explicitly.
972.67 s
[free] Defaulting to the one defined at src/Control/Monad/Trans/Free/Church.hs:69:1
972.67 s
[free] Warning: 'retract' is ambiguous. It is defined
972.67 s
[free] * at src/Control/Monad/Trans/Free.hs:363:1
972.67 s
[free] * at src/Control/Monad/Trans/Free/Church.hs:248:1
972.67 s
[free] You may be able to disambiguate the identifier by qualifying it or
972.67 s
[free] by specifying the type/value namespace explicitly.
972.67 s
[free] Defaulting to the one defined at src/Control/Monad/Trans/Free/Church.hs:248:1
972.67 s
[free] Warning: 'iter' is ambiguous. It is defined
972.67 s
[free] * at src/Control/Monad/Trans/Free.hs:370:1
972.67 s
[free] * at src/Control/Monad/Trans/Free/Church.hs:257:1
972.67 s
[free] You may be able to disambiguate the identifier by qualifying it or
972.67 s
[free] by specifying the type/value namespace explicitly.
972.67 s
[free] Defaulting to the one defined at src/Control/Monad/Trans/Free/Church.hs:257:1
972.67 s
[free] 100% ( 28 / 28) in 'Control.Monad.Trans.Free.Church'
972.67 s
[free] Warning: 'Free' is out of scope.
972.67 s
[free] If you qualify the identifier, haddock can try to link it anyway.
972.67 s
[free] Warning: 'IterT' is ambiguous. It is defined
972.67 s
[free] * at src/Control/Monad/Trans/Iter.hs:105:21
972.67 s
[free] * at src/Control/Monad/Trans/Iter.hs:105:1
972.67 s
[free] You may be able to disambiguate the identifier by qualifying it or
972.67 s
[free] by specifying the type/value namespace explicitly.
972.67 s
[free] Defaulting to the one defined at src/Control/Monad/Trans/Iter.hs:105:1
972.67 s
[free] Warning: 'FreeT' is out of scope.
972.67 s
[free] If you qualify the identifier, haddock can try to link it anyway.
972.67 s
[free] Warning: 'Identity' is ambiguous. It is defined
972.67 s
[free] * in ‘Data.Functor.Identity’
972.67 s
[free] * in ‘Data.Functor.Identity’
972.67 s
[free] You may be able to disambiguate the identifier by qualifying it or
972.67 s
[free] by specifying the type/value namespace explicitly.
972.67 s
[free] Defaulting to the one defined in ‘Data.Functor.Identity’
972.67 s
[free] Warning: 'void' is out of scope.
972.67 s
[free] If you qualify the identifier, haddock can try to link it anyway.
972.67 s
[free] Warning: 'race' is out of scope.
972.67 s
[free] If you qualify the identifier, haddock can try to link it anyway.
972.67 s
[free] 100% ( 25 / 25) in 'Control.Monad.Trans.Iter'
972.67 s
[free] Warning: Control.Comonad.Cofree: could not find link destinations for:
972.67 s
[monoid-subclasses] 311 | ++ List.map (\d1-> (a, b, c, d1)) (List.tail $ inits d)
972.67 s
[monoid-subclasses] | ^^^^^^^^^
972.67 s
[monoid-subclasses]
972.67 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:313:65: warning : [ GHC-63394 ] [ -Wx-partial ]
972.67 s
[monoid-subclasses] In the use of ‘tail’
972.67 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
972.67 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
972.67 s
[monoid-subclasses] |
972.68 s
[monoid-subclasses] 313 | ++ List.map (\b1-> (mempty, b1, c, d)) (List.tail $ tails b)
972.68 s
[monoid-subclasses] | ^^^^^^^^^
972.68 s
[monoid-subclasses]
972.68 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:314:70: warning : [ GHC-63394 ] [ -Wx-partial ]
972.68 s
[monoid-subclasses] In the use of ‘tail’
972.68 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
972.68 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
972.68 s
[monoid-subclasses] |
972.68 s
[monoid-subclasses] 314 | ++ List.map (\c1-> (mempty, mempty, c1, d)) (List.tail $ tails c)
972.68 s
[monoid-subclasses] | ^^^^^^^^^
972.68 s
[monoid-subclasses]
972.68 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:315:75: warning : [ GHC-63394 ] [ -Wx-partial ]
972.68 s
[monoid-subclasses] In the use of ‘tail’
972.68 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
972.68 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
972.68 s
[monoid-subclasses] |
972.68 s
[monoid-subclasses] 315 | ++ List.map (\d1-> (mempty, mempty, mempty, d1)) (List.tail $ tails d)
972.68 s
[monoid-subclasses] | ^^^^^^^^^
972.68 s
[monoid-subclasses]
972.68 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:370:13: warning : [ GHC-62161 ] [ -Wincomplete-uni-patterns ]
972.68 s
[monoid-subclasses] Pattern match(es) are non-exhaustive
972.68 s
[monoid-subclasses] In a pattern binding: Patterns of type ‘[a]’ not matched: []
972.68 s
[monoid-subclasses] |
972.68 s
[monoid-subclasses] 370 | where splitLast f last@[_] = (f [], last)
972.68 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
972.68 s
[monoid-subclasses] [ 9 of 16] Compiling Data.Monoid.Textual ( src/Data/Monoid/Textual.hs, dist/build/Data/Monoid/Textual.p_o )
972.68 s
[monoid-subclasses] [10 of 16] Compiling Data.Monoid.Instances.CharVector ( src/Data/Monoid/Instances/CharVector.hs, dist/build/Data/Monoid/Instances/CharVector.p_o )
972.68 s
[monoid-subclasses] [11 of 16] Compiling Data.Monoid.Instances.Stateful ( src/Data/Monoid/Instances/Stateful.hs, dist/build/Data/Monoid/Instances/Stateful.p_o )
972.68 s
[monoid-subclasses]
972.68 s
[monoid-subclasses] src/Data/Monoid/Instances/Stateful.hs:27:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
972.68 s
[monoid-subclasses] The import of ‘Data.Semigroup’ is redundant
972.68 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Semigroup’
972.68 s
[monoid-subclasses] To import instances alone, use: import Data.Semigroup()
972.68 s
[monoid-subclasses] |
972.68 s
[monoid-subclasses] 27 | import Data.Semigroup (Semigroup(..))
972.68 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
972.68 s
[monoid-subclasses]
972.68 s
[monoid-subclasses] src/Data/Monoid/Instances/Stateful.hs:28:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
972.68 s
[monoid-subclasses] The import of ‘Data.Monoid’ is redundant
972.68 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Monoid’
972.68 s
[nothunks] Just ["Int","Either"] 32% ██████▍·············
972.68 s
[nothunks] Nothing 32% ██████▎·············
972.68 s
[nothunks] ListInt: OK (0.03s)
972.68 s
[nothunks] ✓ <interactive> passed 1000 tests.
972.68 s
[nothunks] Just ["Int","List"] 24% ████▋···············
972.68 s
[nothunks] Just ["List"] 42% ████████▎···········
972.68 s
[nothunks] Nothing 35% ██████▉·············
972.68 s
[nothunks] IntListInt: OK (0.04s)
972.68 s
[nothunks] ✓ <interactive> passed 1000 tests.
972.68 s
[nothunks] Just ["Int","List","Tuple2"] 6% █▏··················
972.68 s
[nothunks] Just ["Int","Tuple2"] 24% ████▊···············
972.68 s
[nothunks] Just ["List","Tuple2"] 10% ██··················
972.68 s
[nothunks] Just ["Tuple2"] 51% ██████████▏·········
972.68 s
[nothunks] Nothing 8% █▋··················
972.68 s
[nothunks] SeqInt: OK (0.12s)
972.68 s
[nothunks] ✓ <interactive> passed 1000 tests.
972.68 s
[nothunks] Just ["Int","Seq"] 46% █████████▎··········
972.68 s
[nothunks] Nothing 54% ██████████▋·········
972.68 s
[nothunks] AllowThunksIn: OK (0.04s)
972.68 s
[nothunks] ✓ <interactive> passed 1000 tests.
972.68 s
[nothunks] Just ["Int","field2","Record"] 25% ████▉···············
972.68 s
[nothunks] Just ["Record"] 51% ██████████▏·········
972.68 s
[nothunks] Nothing 24% ████▉···············
972.68 s
[nothunks] Fn: OK (0.02s)
972.68 s
[nothunks] ✓ <interactive> passed 1000 tests.
972.69 s
[nothunks] Just ["->"] 26% █████···············
972.69 s
[nothunks] Nothing 74% ██████████████▉·····
972.69 s
[nothunks] IO: OK (0.02s)
972.69 s
[nothunks] ✓ <interactive> passed 1000 tests.
972.69 s
[nothunks] Just ["IO"] 25% █████···············
972.69 s
[nothunks] Nothing 75% ██████████████▉·····
972.69 s
[nothunks] ThunkFreeFn: OK (0.02s)
972.69 s
[nothunks] ✓ <interactive> passed 1000 tests.
972.69 s
[nothunks] Just ["->"] 27% █████▎··············
972.69 s
[nothunks] Just ["...","->"] 39% ███████▋············
972.69 s
[nothunks] Nothing 35% ██████▉·············
972.69 s
[nothunks] ThunkFreeIO: OK (0.02s)
972.69 s
[nothunks] ✓ <interactive> passed 1000 tests.
972.69 s
[nothunks] Just ["...","IO"] 36% ███████▏············
972.69 s
[nothunks] Just ["IO"] 25% ████▉···············
972.69 s
[nothunks] Nothing 39% ███████▊············
972.69 s
[nothunks] MutableVars
972.69 s
[nothunks] IORef
972.69 s
[nothunks] NotNF: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NF: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NotNFPure: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NFPure: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NotNFAtomically: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NFAtomically: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] MVar
972.69 s
[nothunks] NotNF: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NF: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NotNFPure: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NFPure: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NotNFAtomically: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NFAtomically: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] TVar
972.69 s
[nothunks] NotNF: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NF: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NotNFPure: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NFPure: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NotNFAtomically: OK
972.69 s
[nothunks] ✓ <interactive> passed 1 test.
972.69 s
[nothunks] NFAtomically: OK
972.94 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/620lf25dimyx165wvjagkq57sp73j3sg-reducers-3.12.5 /nix/store/np9b30r37wb313fb3valbad6ifw7zqik-reducers-3.12.5-doc
974.21 s
[post-build-hook] Pushing 2 paths (98 are already present) using zstd to cache sellout ⏳
974.21 s
[post-build-hook]
974.55 s
[post-build-hook] Pushing /nix/store/np9b30r37wb313fb3valbad6ifw7zqik-reducers-3.12.5-doc (1.55 MiB)
974.74 s
[post-build-hook] Pushing /nix/store/620lf25dimyx165wvjagkq57sp73j3sg-reducers-3.12.5 (5.07 MiB)
975.73 s
[post-build-hook]
975.73 s
[post-build-hook] All done.
975.80 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/620lf25dimyx165wvjagkq57sp73j3sg-reducers-3.12.5 /nix/store/np9b30r37wb313fb3valbad6ifw7zqik-reducers-3.12.5-doc
975.91 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
976.14 s
[post-build-hook] copying 4 paths...
976.14 s
[post-build-hook] copying path '/nix/store/n502y0rkxqwr4v1712fpbf1qlzvmxipf-fingertree-0.1.5.0-doc' to 'https://cache.nix-ci.com'...
977.07 s
[post-build-hook] copying path '/nix/store/np9b30r37wb313fb3valbad6ifw7zqik-reducers-3.12.5-doc' to 'https://cache.nix-ci.com'...
977.07 s
[post-build-hook] copying path '/nix/store/448ig19rqv03bmdrc4ghllm845w3jzbi-fingertree-0.1.5.0' to 'https://cache.nix-ci.com'...
980.25 s
[post-build-hook] copying path '/nix/store/620lf25dimyx165wvjagkq57sp73j3sg-reducers-3.12.5' to 'https://cache.nix-ci.com'...
982.82 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
983.12 s
[post-build-hook] copying 2 paths...
983.13 s
[post-build-hook] copying path '/nix/store/kfx0rl0qkxhz2w5wmzzw7jkw8xvg33xm-fingertree-0.1.5.0.drv' to 'https://cache.nix-ci.com'...
983.33 s
[post-build-hook] copying path '/nix/store/4xqyi6gwdinzjrbvgn000zcls2gz7vic-reducers-3.12.5.drv' to 'https://cache.nix-ci.com'...
983.57 s
Progress: 74 of 171 built (10 building), 395 of 395 downloaded from cache
983.57 s
[regex-tdfa] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
983.57 s
[regex-tdfa] No pkg-config found
983.57 s
[regex-tdfa] Using runghc version 9.8.1 found on system at:
983.57 s
[regex-tdfa] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
983.57 s
[regex-tdfa] Using strip version 2.44 found on system at:
983.57 s
[regex-tdfa] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
983.57 s
[regex-tdfa] Using tar found on system at:
983.57 s
[regex-tdfa] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
983.57 s
[regex-tdfa] No uhc found
983.57 s
[regex-tdfa] Phase: buildPhase
983.57 s
[regex-tdfa] Preprocessing library for regex-tdfa-1.3.2.3..
983.57 s
[regex-tdfa] Building library for regex-tdfa-1.3.2.3..
983.57 s
[regex-tdfa] [ 1 of 25] Compiling Data.IntMap.CharMap2 ( lib/Data/IntMap/CharMap2.hs, dist/build/Data/IntMap/CharMap2.o, dist/build/Data/IntMap/CharMap2.dyn_o )
983.57 s
[regex-tdfa] [ 2 of 25] Compiling Data.IntSet.EnumSet2 ( lib/Data/IntSet/EnumSet2.hs, dist/build/Data/IntSet/EnumSet2.o, dist/build/Data/IntSet/EnumSet2.dyn_o )
983.57 s
[regex-tdfa] [ 3 of 25] Compiling Data.IntMap.EnumMap2 ( lib/Data/IntMap/EnumMap2.hs, dist/build/Data/IntMap/EnumMap2.o, dist/build/Data/IntMap/EnumMap2.dyn_o )
983.57 s
[regex-tdfa] [ 4 of 25] Compiling Paths_regex_tdfa ( dist/build/autogen/Paths_regex_tdfa.hs, dist/build/Paths_regex_tdfa.o, dist/build/Paths_regex_tdfa.dyn_o )
983.57 s
[regex-tdfa] [ 5 of 25] Compiling Text.Regex.TDFA.IntArrTrieSet ( lib/Text/Regex/TDFA/IntArrTrieSet.hs, dist/build/Text/Regex/TDFA/IntArrTrieSet.o, dist/build/Text/Regex/TDFA/IntArrTrieSet.dyn_o )
983.57 s
[regex-tdfa] [ 6 of 25] Compiling Text.Regex.TDFA.Common ( lib/Text/Regex/TDFA/Common.hs, dist/build/Text/Regex/TDFA/Common.o, dist/build/Text/Regex/TDFA/Common.dyn_o )
983.57 s
[regex-tdfa] [ 7 of 25] Compiling Text.Regex.TDFA.NewDFA.Uncons ( lib/Text/Regex/TDFA/NewDFA/Uncons.hs, dist/build/Text/Regex/TDFA/NewDFA/Uncons.o, dist/build/Text/Regex/TDFA/NewDFA/Uncons.dyn_o )
983.57 s
[regex-tdfa] [ 8 of 25] Compiling Text.Regex.TDFA.NewDFA.MakeTest ( lib/Text/Regex/TDFA/NewDFA/MakeTest.hs, dist/build/Text/Regex/TDFA/NewDFA/MakeTest.o, dist/build/Text/Regex/TDFA/NewDFA/MakeTest.dyn_o )
983.57 s
[regex-tdfa] [ 9 of 25] Compiling Text.Regex.TDFA.NewDFA.Tester ( lib/Text/Regex/TDFA/NewDFA/Tester.hs, dist/build/Text/Regex/TDFA/NewDFA/Tester.o, dist/build/Text/Regex/TDFA/NewDFA/Tester.dyn_o )
983.57 s
[regex-tdfa] [10 of 25] Compiling Text.Regex.TDFA.NewDFA.Engine_NC_FA ( lib/Text/Regex/TDFA/NewDFA/Engine_NC_FA.hs, dist/build/Text/Regex/TDFA/NewDFA/Engine_NC_FA.o, dist/build/Text/Regex/TDFA/NewDFA/Engine_NC_FA.dyn_o )
983.57 s
[regex-tdfa] [11 of 25] Compiling Text.Regex.TDFA.NewDFA.Engine_NC ( lib/Text/Regex/TDFA/NewDFA/Engine_NC.hs, dist/build/Text/Regex/TDFA/NewDFA/Engine_NC.o, dist/build/Text/Regex/TDFA/NewDFA/Engine_NC.dyn_o )
983.57 s
[regex-tdfa] [12 of 25] Compiling Text.Regex.TDFA.NewDFA.Engine_FA ( lib/Text/Regex/TDFA/NewDFA/Engine_FA.hs, dist/build/Text/Regex/TDFA/NewDFA/Engine_FA.o, dist/build/Text/Regex/TDFA/NewDFA/Engine_FA.dyn_o )
983.57 s
[regex-tdfa] [13 of 25] Compiling Text.Regex.TDFA.NewDFA.Engine ( lib/Text/Regex/TDFA/NewDFA/Engine.hs, dist/build/Text/Regex/TDFA/NewDFA/Engine.o, dist/build/Text/Regex/TDFA/NewDFA/Engine.dyn_o )
983.57 s
[semialign] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
983.57 s
[semialign] No uhc found
983.57 s
[semialign] Phase: buildPhase
983.57 s
[semialign] Preprocessing library for semialign-1.3.1..
983.57 s
[semialign] Building library for semialign-1.3.1..
983.57 s
[semialign] [1 of 6] Compiling Data.Semialign.Internal ( src/Data/Semialign/Internal.hs, dist/build/Data/Semialign/Internal.o, dist/build/Data/Semialign/Internal.dyn_o )
983.57 s
[semialign] [2 of 6] Compiling Data.Semialign.Indexed ( src/Data/Semialign/Indexed.hs, dist/build/Data/Semialign/Indexed.o, dist/build/Data/Semialign/Indexed.dyn_o )
983.57 s
[semialign] [3 of 6] Compiling Data.Semialign ( src/Data/Semialign.hs, dist/build/Data/Semialign.o, dist/build/Data/Semialign.dyn_o )
983.57 s
[semialign] [4 of 6] Compiling Data.Align ( src/Data/Align.hs, dist/build/Data/Align.o, dist/build/Data/Align.dyn_o )
983.57 s
[semialign] [5 of 6] Compiling Data.Crosswalk ( src/Data/Crosswalk.hs, dist/build/Data/Crosswalk.o, dist/build/Data/Crosswalk.dyn_o )
983.57 s
[semialign] [6 of 6] Compiling Data.Zip ( src/Data/Zip.hs, dist/build/Data/Zip.o, dist/build/Data/Zip.dyn_o )
983.57 s
[semialign] [1 of 6] Compiling Data.Semialign.Internal ( src/Data/Semialign/Internal.hs, dist/build/Data/Semialign/Internal.p_o )
983.57 s
[witherable] Configuration files installed in:
983.57 s
[witherable] /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5/etc
983.57 s
[witherable] No alex found
983.57 s
[witherable] Using ar found on system at:
983.57 s
[witherable] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
983.57 s
[witherable] No c2hs found
983.57 s
[witherable] No cpphs found
983.57 s
[witherable] No doctest found
983.57 s
[witherable] Using gcc version 14.3.0 given by user at:
983.57 s
[witherable] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
983.57 s
[witherable] Using ghc version 9.8.1 found on system at:
983.57 s
[witherable] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
983.57 s
[witherable] Using ghc-pkg version 9.8.1 found on system at:
983.57 s
[witherable] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
983.57 s
[witherable] No ghcjs found
983.57 s
[witherable] No ghcjs-pkg found
983.57 s
[witherable] No greencard found
983.57 s
[witherable] Using haddock version 2.30.0 found on system at:
983.57 s
[witherable] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
983.57 s
[witherable] No happy found
983.57 s
[witherable] Using haskell-suite found on system at: haskell-suite-dummy-location
983.57 s
[witherable] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
983.57 s
[witherable] No hmake found
983.57 s
[witherable] Using hpc version 0.69 found on system at:
983.57 s
[witherable] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
983.57 s
[witherable] Using hsc2hs version 0.68.10 found on system at:
983.57 s
[witherable] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
983.57 s
[witherable] Using hscolour version 1.25 found on system at:
983.57 s
[witherable] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
983.58 s
[witherable] No jhc found
983.58 s
[witherable] Using ld found on system at:
983.58 s
[witherable] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
983.58 s
[witherable] No pkg-config found
983.58 s
[witherable] Using runghc version 9.8.1 found on system at:
983.58 s
[witherable] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
983.58 s
[witherable] Using strip version 2.44 found on system at:
983.58 s
[witherable] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
983.58 s
[witherable] Using tar found on system at:
983.58 s
[witherable] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
983.58 s
[witherable] No uhc found
983.58 s
[witherable] Phase: buildPhase
983.58 s
[witherable] Preprocessing library for witherable-0.5..
983.58 s
[witherable] Building library for witherable-0.5..
983.58 s
[witherable] [1 of 1] Compiling Witherable ( src/Witherable.hs, dist/build/Witherable.o, dist/build/Witherable.dyn_o )
983.58 s
[witherable] [1 of 1] Compiling Witherable ( src/Witherable.hs, dist/build/Witherable.p_o )
983.58 s
[attoparsec] In the use of ‘memcpy’
983.58 s
[attoparsec] (imported from Data.ByteString.Internal, but defined in Data.ByteString.Internal.Type):
983.58 s
[attoparsec] Deprecated: "Use Foreign.Marshal.Utils.copyBytes instead"
983.58 s
[attoparsec] |
983.58 s
[attoparsec] 132 | memcpy ptr (ptr0 `plusPtr` off0) (fromIntegral len0)
983.58 s
[attoparsec] | ^^^^^^
983.58 s
[attoparsec]
983.58 s
[attoparsec] internal/Data/Attoparsec/ByteString/Buffer.hs:133:13: warning : [ GHC-68441 ] [ -Wdeprecations ]
983.58 s
[attoparsec] In the use of ‘memcpy’
983.58 s
[attoparsec] (imported from Data.ByteString.Internal, but defined in Data.ByteString.Internal.Type):
983.58 s
[attoparsec] Deprecated: "Use Foreign.Marshal.Utils.copyBytes instead"
983.58 s
[attoparsec] |
983.58 s
[attoparsec] 133 | memcpy (ptr `plusPtr` len0) (ptr1 `plusPtr` off1)
983.58 s
[attoparsec] | ^^^^^^
983.58 s
[attoparsec] [5 of 6] Compiling Data.Attoparsec.Text.Buffer ( internal/Data/Attoparsec/Text/Buffer.hs, dist/build/attoparsec-internal/Data/Attoparsec/Text/Buffer.p_o )
983.58 s
[attoparsec]
983.58 s
[attoparsec] internal/Data/Attoparsec/Text/Buffer.hs:44:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
983.58 s
[attoparsec] The import of ‘Data.Semigroup’ is redundant
983.58 s
[attoparsec] except perhaps to import instances from ‘Data.Semigroup’
983.58 s
[attoparsec] To import instances alone, use: import Data.Semigroup()
983.58 s
[attoparsec] |
983.58 s
[attoparsec] 44 | import Data.Semigroup (Semigroup(..))
983.58 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
983.58 s
[attoparsec] [6 of 6] Compiling Data.Attoparsec.Text.FastSet ( internal/Data/Attoparsec/Text/FastSet.hs, dist/build/attoparsec-internal/Data/Attoparsec/Text/FastSet.p_o )
983.58 s
[attoparsec] Preprocessing library for attoparsec-0.14.4..
983.58 s
[attoparsec] Building library for attoparsec-0.14.4..
983.58 s
[attoparsec] [ 1 of 16] Compiling Data.Attoparsec.Internal.Types ( Data/Attoparsec/Internal/Types.hs, dist/build/Data/Attoparsec/Internal/Types.o, dist/build/Data/Attoparsec/Internal/Types.dyn_o )
983.58 s
[attoparsec]
983.58 s
[attoparsec] Data/Attoparsec/Internal/Types.hs:28:53: warning : [ GHC-38856 ] [ -Wunused-imports ]
983.58 s
[attoparsec] The import of ‘<$>’ from module ‘Control.Applicative’ is redundant
983.58 s
[attoparsec] |
983.58 s
[attoparsec] 28 | import Control.Applicative as App (Applicative(..), (<$>) )
983.58 s
[attoparsec] | ^^^^^
983.58 s
[attoparsec]
983.58 s
[attoparsec] Data/Attoparsec/Internal/Types.hs:34:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
983.58 s
[attoparsec] The import of ‘Data.Semigroup’ is redundant
983.58 s
[attoparsec] except perhaps to import instances from ‘Data.Semigroup’
983.58 s
[attoparsec] To import instances alone, use: import Data.Semigroup()
983.58 s
[attoparsec] |
983.58 s
[attoparsec] 34 | import Data.Semigroup (Semigroup(..))
983.58 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
983.58 s
[attoparsec] [ 2 of 16] Compiling Data.Attoparsec.Internal ( Data/Attoparsec/Internal.hs, dist/build/Data/Attoparsec/Internal.o, dist/build/Data/Attoparsec/Internal.dyn_o )
983.58 s
[attoparsec] [ 3 of 16] Compiling Data.Attoparsec.Number ( Data/Attoparsec/Number.hs, dist/build/Data/Attoparsec/Number.o, dist/build/Data/Attoparsec/Number.dyn_o )
983.58 s
[attoparsec] [ 4 of 16] Compiling Data.Attoparsec.Types ( Data/Attoparsec/Types.hs, dist/build/Data/Attoparsec/Types.o, dist/build/Data/Attoparsec/Types.dyn_o )
983.58 s
[attoparsec] [ 5 of 16] Compiling Data.Attoparsec.Zepto ( Data/Attoparsec/Zepto.hs, dist/build/Data/Attoparsec/Zepto.o, dist/build/Data/Attoparsec/Zepto.dyn_o )
983.58 s
[attoparsec]
983.58 s
[attoparsec] Data/Attoparsec/Zepto.hs:46:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
983.58 s
[attoparsec] The import of ‘Data.Semigroup’ is redundant
983.58 s
[attoparsec] except perhaps to import instances from ‘Data.Semigroup’
983.58 s
[attoparsec] To import instances alone, use: import Data.Semigroup()
983.58 s
[attoparsec] |
983.58 s
[extra] Defaulting to the one defined in ‘GHC.Exception.Type’
983.58 s
[extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
983.58 s
[extra] Warning: 'partition' is out of scope.
983.58 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
983.58 s
[extra] Warning: 'mconcatMap' is out of scope.
983.58 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
983.58 s
[extra] Warning: 'find' is out of scope.
983.58 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
983.58 s
[extra] 100% ( 38 / 38) in 'Control.Monad.Extra'
983.58 s
[extra] 92% ( 12 / 13) in 'Data.Foldable.Extra'
983.58 s
[extra] Missing documentation for:
983.58 s
[extra] Module header
983.58 s
[extra] Warning: 'Lock' is ambiguous. It is defined
983.58 s
[extra] * at src/Control/Concurrent/Extra.hs:106:16
983.58 s
[extra] * at src/Control/Concurrent/Extra.hs:106:1
983.58 s
[extra] You may be able to disambiguate the identifier by qualifying it or
983.58 s
[extra] by specifying the type/value namespace explicitly.
983.58 s
[extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
983.58 s
[extra] Warning: 'Var' is ambiguous. It is defined
983.58 s
[extra] * at src/Control/Concurrent/Extra.hs:146:17
983.58 s
[extra] * at src/Control/Concurrent/Extra.hs:146:1
983.58 s
[extra] You may be able to disambiguate the identifier by qualifying it or
983.58 s
[extra] by specifying the type/value namespace explicitly.
983.58 s
[extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
983.58 s
[extra] Warning: 'Barrier' is ambiguous. It is defined
983.58 s
[extra] * at src/Control/Concurrent/Extra.hs:210:21
983.58 s
[extra] * at src/Control/Concurrent/Extra.hs:210:1
983.58 s
[extra] You may be able to disambiguate the identifier by qualifying it or
983.58 s
[extra] by specifying the type/value namespace explicitly.
983.58 s
[extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
983.58 s
[extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
983.58 s
[extra] Warning: 'createDirectory' is ambiguous. It is defined
983.58 s
[extra] * in ‘System.Directory’
983.58 s
[extra] * in ‘System.Posix.Directory’
983.58 s
[extra] You may be able to disambiguate the identifier by qualifying it or
983.58 s
[extra] by specifying the type/value namespace explicitly.
983.58 s
[extra] Defaulting to the one defined in ‘System.Posix.Directory’
983.58 s
[extra] 100% ( 8 / 8) in 'System.Directory.Extra'
983.58 s
[extra] 100% ( 2 / 2) in 'System.Environment.Extra'
983.58 s
[extra] 100% ( 26 / 26) in 'System.IO.Extra'
983.58 s
[extra] 100% ( 4 / 4) in 'System.Info.Extra'
983.58 s
[extra] 100% ( 5 / 5) in 'System.Process.Extra'
983.58 s
[extra] 100% ( 8 / 8) in 'System.Time.Extra'
983.58 s
[extra] 100% (268 /268) in 'Extra'
983.58 s
[extra] 100% ( 2 / 2) in 'Text.Read.Extra'
983.58 s
[extra] Warning: Data.Tuple.Extra: could not find link destinations for:
983.58 s
[extra] - GHC.Generics.Rep1_Solo
983.58 s
[extra] - GHC.Generics.Rep_Solo
983.58 s
[extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
983.58 s
[extra] Preprocessing test suite 'extra-test' for extra-1.7.16..
983.58 s
[extra] haddockPhase completed in 51 seconds
983.58 s
[extra] Phase: installPhase
983.58 s
[extra] Installing library in /nix/store/6bw638xvsqji2hb14bj62nvpbw2vv9rv-extra-1.7.16/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
983.58 s
[extra] Phase: fixupPhase
983.58 s
[extra] shrinking RPATHs of ELF executables and libraries in /nix/store/6bw638xvsqji2hb14bj62nvpbw2vv9rv-extra-1.7.16
983.58 s
[extra] shrinking /nix/store/6bw638xvsqji2hb14bj62nvpbw2vv9rv-extra-1.7.16/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSextra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ-ghc9.8.1.so
983.58 s
[extra] checking for references to /build/ in /nix/store/6bw638xvsqji2hb14bj62nvpbw2vv9rv-extra-1.7.16...
983.58 s
[extra] patching script interpreter paths in /nix/store/6bw638xvsqji2hb14bj62nvpbw2vv9rv-extra-1.7.16
983.58 s
[extra] stripping (with command strip and flags -S -p) in /nix/store/6bw638xvsqji2hb14bj62nvpbw2vv9rv-extra-1.7.16/lib
983.58 s
[extra] shrinking RPATHs of ELF executables and libraries in /nix/store/bi4pslxl5s26ywn4hx9mfg0hqcg1jjlh-extra-1.7.16-doc
983.58 s
[extra] checking for references to /build/ in /nix/store/bi4pslxl5s26ywn4hx9mfg0hqcg1jjlh-extra-1.7.16-doc...
983.58 s
[extra] patching script interpreter paths in /nix/store/bi4pslxl5s26ywn4hx9mfg0hqcg1jjlh-extra-1.7.16-doc
983.58 s
[foldl] Phase: fixupPhase
983.58 s
[foldl] shrinking RPATHs of ELF executables and libraries in /nix/store/h7vs47g01bad3k8qqd3vkcd1jhhza6z4-foldl-1.4.18
983.58 s
[foldl] shrinking /nix/store/h7vs47g01bad3k8qqd3vkcd1jhhza6z4-foldl-1.4.18/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSfoldl-1.4.18-62WoZL2Y1vbK9V8UvFwjK0-ghc9.8.1.so
983.58 s
[foldl] checking for references to /build/ in /nix/store/h7vs47g01bad3k8qqd3vkcd1jhhza6z4-foldl-1.4.18...
983.58 s
[foldl] patching script interpreter paths in /nix/store/h7vs47g01bad3k8qqd3vkcd1jhhza6z4-foldl-1.4.18
983.58 s
[foldl] stripping (with command strip and flags -S -p) in /nix/store/h7vs47g01bad3k8qqd3vkcd1jhhza6z4-foldl-1.4.18/lib
983.58 s
[foldl] shrinking RPATHs of ELF executables and libraries in /nix/store/w38qllska0qzzs1vkghmzb3g7izyxw25-foldl-1.4.18-doc
983.58 s
[foldl] checking for references to /build/ in /nix/store/w38qllska0qzzs1vkghmzb3g7izyxw25-foldl-1.4.18-doc...
983.59 s
[foldl] patching script interpreter paths in /nix/store/w38qllska0qzzs1vkghmzb3g7izyxw25-foldl-1.4.18-doc
983.59 s
[free] - Control.Comonad.Cofree.Rep_Cofree
983.59 s
[free] - Control.Comonad.Cofree.Rep1_Cofree
983.59 s
[free] Warning: Control.Comonad.Trans.Cofree: could not find link destinations for:
983.59 s
[free] - Control.Comonad.Trans.Cofree.Rep_CofreeF
983.59 s
[free] - Control.Comonad.Trans.Cofree.Rep1_CofreeF
983.59 s
[free] Warning: Control.Monad.Trans.Free: could not find link destinations for:
983.59 s
[free] - Control.Monad.Trans.Free.Rep_FreeF
983.59 s
[free] - Control.Monad.Trans.Free.Rep1_FreeF
983.59 s
[free] Warning: Control.Monad.Free: could not find link destinations for:
983.59 s
[free] - Control.Monad.Free.Rep_Free
983.59 s
[free] - Control.Monad.Free.Rep1_Free
983.59 s
[free] Warning: Control.Monad.Trans.Free.Ap: could not find link destinations for:
983.59 s
[free] - Control.Monad.Trans.Free.Ap.Rep_FreeF
983.59 s
[free] - Control.Monad.Trans.Free.Ap.Rep1_FreeF
983.59 s
[free] Warning: Control.Monad.Free.Ap: could not find link destinations for:
983.59 s
[free] - Control.Monad.Free.Ap.Rep_Free
983.59 s
[free] - Control.Monad.Free.Ap.Rep1_Free
983.59 s
[free] Documentation created: dist/doc/html/free/, dist/doc/html/free/free.txt
983.59 s
[free] haddockPhase completed in 49 seconds
983.59 s
[free] Phase: installPhase
983.59 s
[free] Installing library in /nix/store/f781q9h2a38js6x0viwirainvnbmvmp5-free-5.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/free-5.2-5jsicnVtm8y8KG9LMRezMp
983.59 s
[free] Phase: fixupPhase
983.59 s
[free] shrinking RPATHs of ELF executables and libraries in /nix/store/f781q9h2a38js6x0viwirainvnbmvmp5-free-5.2
983.59 s
[free] shrinking /nix/store/f781q9h2a38js6x0viwirainvnbmvmp5-free-5.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSfree-5.2-5jsicnVtm8y8KG9LMRezMp-ghc9.8.1.so
983.59 s
[free] checking for references to /build/ in /nix/store/f781q9h2a38js6x0viwirainvnbmvmp5-free-5.2...
983.59 s
[free] patching script interpreter paths in /nix/store/f781q9h2a38js6x0viwirainvnbmvmp5-free-5.2
983.59 s
[free] stripping (with command strip and flags -S -p) in /nix/store/f781q9h2a38js6x0viwirainvnbmvmp5-free-5.2/lib
983.59 s
[free] shrinking RPATHs of ELF executables and libraries in /nix/store/jv1lk6fz8idh20kidgmjaly5qvcs04fd-free-5.2-doc
983.59 s
[free] checking for references to /build/ in /nix/store/jv1lk6fz8idh20kidgmjaly5qvcs04fd-free-5.2-doc...
983.59 s
[free] patching script interpreter paths in /nix/store/jv1lk6fz8idh20kidgmjaly5qvcs04fd-free-5.2-doc
983.59 s
[monoid-subclasses] To import instances alone, use: import Data.Monoid()
983.59 s
[monoid-subclasses] |
983.59 s
[monoid-subclasses] 28 | import Data.Monoid (Monoid(..))
983.59 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
983.59 s
[monoid-subclasses]
983.59 s
[monoid-subclasses] src/Data/Monoid/Instances/Stateful.hs:216:13: warning : [ GHC-62161 ] [ -Wincomplete-uni-patterns ]
983.59 s
[monoid-subclasses] Pattern match(es) are non-exhaustive
983.59 s
[monoid-subclasses] In a pattern binding: Patterns of type ‘[b]’ not matched: []
983.59 s
[monoid-subclasses] |
983.59 s
[monoid-subclasses] 216 | restore f [t1] = f [Stateful (t1, x)]
983.59 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
983.59 s
[monoid-subclasses] [12 of 16] Compiling Data.Monoid.Instances.PrefixMemory ( src/Data/Monoid/Instances/PrefixMemory.hs, dist/build/Data/Monoid/Instances/PrefixMemory.p_o )
983.59 s
[monoid-subclasses]
983.59 s
[monoid-subclasses] src/Data/Monoid/Instances/PrefixMemory.hs:20:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
983.59 s
[monoid-subclasses] The import of ‘Data.Semigroup’ is redundant
983.59 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Semigroup’
983.59 s
[monoid-subclasses] To import instances alone, use: import Data.Semigroup()
983.59 s
[monoid-subclasses] |
983.59 s
[monoid-subclasses] 20 | import Data.Semigroup (Semigroup(..))
983.59 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
983.59 s
[monoid-subclasses]
983.59 s
[monoid-subclasses] src/Data/Monoid/Instances/PrefixMemory.hs:21:21: warning : [ GHC-38856 ] [ -Wunused-imports ]
983.59 s
[monoid-subclasses] The import of ‘Monoid’ from module ‘Data.Monoid’ is redundant
983.59 s
[monoid-subclasses] |
983.59 s
[monoid-subclasses] 21 | import Data.Monoid (Monoid(..) , Endo(..))
983.59 s
[monoid-subclasses] | ^^^^^^^^^^
983.59 s
[monoid-subclasses]
983.59 s
[monoid-subclasses] src/Data/Monoid/Instances/PrefixMemory.hs:106:40: warning : [ GHC-63394 ] [ -Wx-partial ]
983.59 s
[monoid-subclasses] In the use of ‘tail’
983.59 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
983.59 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
983.59 s
[monoid-subclasses] |
983.59 s
[monoid-subclasses] 106 | factors (Shadowed p c) = rewrap <$> List.tail (inits c)
983.59 s
[monoid-subclasses] | ^^^^^^^^^
983.59 s
[monoid-subclasses] [13 of 16] Compiling Data.Monoid.Instances.Positioned ( src/Data/Monoid/Instances/Positioned.hs, dist/build/Data/Monoid/Instances/Positioned.p_o )
983.59 s
[monoid-subclasses]
983.59 s
[monoid-subclasses] src/Data/Monoid/Instances/Positioned.hs:33:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
983.59 s
[monoid-subclasses] The import of ‘Data.Semigroup’ is redundant
983.59 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Semigroup’
983.59 s
[monoid-subclasses] To import instances alone, use: import Data.Semigroup()
983.59 s
[monoid-subclasses] |
983.59 s
[monoid-subclasses] 33 | import Data.Semigroup (Semigroup(..))
983.59 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
983.59 s
[monoid-subclasses]
983.59 s
[monoid-subclasses] src/Data/Monoid/Instances/Positioned.hs:34:21: warning : [ GHC-38856 ] [ -Wunused-imports ]
983.59 s
[monoid-subclasses] The import of ‘Monoid’ from module ‘Data.Monoid’ is redundant
983.59 s
[monoid-subclasses] |
983.59 s
[monoid-subclasses] 34 | import Data.Monoid (Monoid(..) , Endo(..))
983.59 s
[monoid-subclasses] | ^^^^^^^^^^
983.59 s
[monoid-subclasses] [14 of 16] Compiling Data.Monoid.Instances.Measured ( src/Data/Monoid/Instances/Measured.hs, dist/build/Data/Monoid/Instances/Measured.p_o )
983.59 s
[monoid-subclasses]
983.59 s
[monoid-subclasses] src/Data/Monoid/Instances/Measured.hs:21:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
983.59 s
[monoid-subclasses] The import of ‘Data.Semigroup’ is redundant
983.59 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Semigroup’
983.59 s
[nothunks] ✓ <interactive> passed 1 test.
983.59 s
[nothunks]
983.59 s
[nothunks] All 41 tests passed (0.62s)
983.59 s
[nothunks] Test suite nothunks-test: PASS
983.59 s
[nothunks] Test suite logged to: dist/test/nothunks-0.3.0.0-nothunks-test.log
983.59 s
[nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
983.59 s
[nothunks] Phase: haddockPhase
983.59 s
[nothunks] Preprocessing library for nothunks-0.3.0.0..
983.59 s
[nothunks] Running Haddock on library for nothunks-0.3.0.0..
983.59 s
[nothunks] Warning: The documentation for the following packages are not installed. No
983.59 s
[nothunks] links will be generated to these packages: vector-0.13.2.0
983.59 s
[nothunks] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
983.59 s
[nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
983.59 s
[nothunks] Haddock coverage:
983.59 s
[nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
983.59 s
[nothunks] * at src/NoThunks/Class.hs:334:48
983.59 s
[nothunks] * at src/NoThunks/Class.hs:334:1
983.59 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
983.59 s
[nothunks] by specifying the type/value namespace explicitly.
983.59 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
983.59 s
[nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
983.59 s
[nothunks] * at src/NoThunks/Class.hs:353:25
983.59 s
[nothunks] * at src/NoThunks/Class.hs:353:1
983.59 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
983.59 s
[nothunks] by specifying the type/value namespace explicitly.
983.59 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
983.59 s
[nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
983.59 s
[nothunks] * at src/NoThunks/Class.hs:358:47
983.59 s
[nothunks] * at src/NoThunks/Class.hs:358:1
983.60 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
983.60 s
[nothunks] by specifying the type/value namespace explicitly.
983.60 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
983.60 s
[nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
983.60 s
[nothunks] * at src/NoThunks/Class.hs:308:27
983.60 s
[nothunks] * at src/NoThunks/Class.hs:308:1
983.60 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
983.60 s
[nothunks] by specifying the type/value namespace explicitly.
983.60 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
983.60 s
[nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
983.60 s
[nothunks] * at src/NoThunks/Class.hs:230:18
983.60 s
[nothunks] * at src/NoThunks/Class.hs:230:1
983.60 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
983.60 s
[nothunks] by specifying the type/value namespace explicitly.
983.60 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
983.60 s
[nothunks] Warning: 'GHC' is out of scope.
983.60 s
[nothunks] If you qualify the identifier, haddock can try to link it anyway.
983.60 s
[nothunks] Warning: 'a' is out of scope.
983.60 s
[nothunks] If you qualify the identifier, haddock can try to link it anyway.
983.60 s
[nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
983.60 s
[nothunks] Missing documentation for:
983.60 s
[nothunks] Module header
983.60 s
[nothunks] Warning: NoThunks.Class: could not find link destinations for:
983.60 s
[nothunks] - Data.Vector.Vector
983.60 s
[nothunks] - Data.Vector.Unboxed.Base.Vector
983.60 s
[nothunks] - NoThunks.Class.HasFields
983.60 s
[nothunks] - NoThunks.Class.Elem
983.60 s
[nothunks] - NoThunks.Class.GShowTypeOf
983.60 s
[nothunks] - NoThunks.Class.GWRecordField
983.60 s
[nothunks] - NoThunks.Class.checkContainsThunks
983.60 s
[nothunks] Documentation created: dist/doc/html/nothunks/,
983.60 s
[nothunks] dist/doc/html/nothunks/nothunks.txt
983.60 s
[nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0..
983.60 s
[nothunks] Phase: installPhase
983.60 s
[nothunks] Installing library in /nix/store/v3pigpjw2hsh3zd3cwryibvyxv7frpiw-nothunks-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
983.60 s
[nothunks] Phase: fixupPhase
983.60 s
[nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/v3pigpjw2hsh3zd3cwryibvyxv7frpiw-nothunks-0.3.0.0
983.60 s
[nothunks] shrinking /nix/store/v3pigpjw2hsh3zd3cwryibvyxv7frpiw-nothunks-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSnothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg-ghc9.8.1.so
983.60 s
[nothunks] checking for references to /build/ in /nix/store/v3pigpjw2hsh3zd3cwryibvyxv7frpiw-nothunks-0.3.0.0...
983.60 s
[nothunks] patching script interpreter paths in /nix/store/v3pigpjw2hsh3zd3cwryibvyxv7frpiw-nothunks-0.3.0.0
983.60 s
[nothunks] stripping (with command strip and flags -S -p) in /nix/store/v3pigpjw2hsh3zd3cwryibvyxv7frpiw-nothunks-0.3.0.0/lib
983.60 s
[nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/dibyvbnvq1qap6yrxncgg12s6l7x49cv-nothunks-0.3.0.0-doc
983.60 s
[regex-tdfa] [14 of 25] Compiling Text.Regex.TDFA.Pattern ( lib/Text/Regex/TDFA/Pattern.hs, dist/build/Text/Regex/TDFA/Pattern.o, dist/build/Text/Regex/TDFA/Pattern.dyn_o )
983.60 s
[regex-tdfa] [15 of 25] Compiling Text.Regex.TDFA.CorePattern ( lib/Text/Regex/TDFA/CorePattern.hs, dist/build/Text/Regex/TDFA/CorePattern.o, dist/build/Text/Regex/TDFA/CorePattern.dyn_o )
983.60 s
[regex-tdfa] [16 of 25] Compiling Text.Regex.TDFA.ReadRegex ( lib/Text/Regex/TDFA/ReadRegex.hs, dist/build/Text/Regex/TDFA/ReadRegex.o, dist/build/Text/Regex/TDFA/ReadRegex.dyn_o )
983.60 s
[regex-tdfa] [17 of 25] Compiling Text.Regex.TDFA.TNFA ( lib/Text/Regex/TDFA/TNFA.hs, dist/build/Text/Regex/TDFA/TNFA.o, dist/build/Text/Regex/TDFA/TNFA.dyn_o )
983.60 s
[regex-tdfa] [18 of 25] Compiling Text.Regex.TDFA.TDFA ( lib/Text/Regex/TDFA/TDFA.hs, dist/build/Text/Regex/TDFA/TDFA.o, dist/build/Text/Regex/TDFA/TDFA.dyn_o )
983.60 s
[regex-tdfa] [19 of 25] Compiling Text.Regex.TDFA.String ( lib/Text/Regex/TDFA/String.hs, dist/build/Text/Regex/TDFA/String.o, dist/build/Text/Regex/TDFA/String.dyn_o )
983.60 s
[regex-tdfa] [20 of 25] Compiling Text.Regex.TDFA.Sequence ( lib/Text/Regex/TDFA/Sequence.hs, dist/build/Text/Regex/TDFA/Sequence.o, dist/build/Text/Regex/TDFA/Sequence.dyn_o )
983.60 s
[regex-tdfa] [21 of 25] Compiling Text.Regex.TDFA.ByteString.Lazy ( lib/Text/Regex/TDFA/ByteString/Lazy.hs, dist/build/Text/Regex/TDFA/ByteString/Lazy.o, dist/build/Text/Regex/TDFA/ByteString/Lazy.dyn_o )
983.60 s
[regex-tdfa] [22 of 25] Compiling Text.Regex.TDFA.ByteString ( lib/Text/Regex/TDFA/ByteString.hs, dist/build/Text/Regex/TDFA/ByteString.o, dist/build/Text/Regex/TDFA/ByteString.dyn_o )
983.60 s
[regex-tdfa] [23 of 25] Compiling Text.Regex.TDFA.Text ( lib/Text/Regex/TDFA/Text.hs, dist/build/Text/Regex/TDFA/Text.o, dist/build/Text/Regex/TDFA/Text.dyn_o )
983.60 s
[regex-tdfa] [24 of 25] Compiling Text.Regex.TDFA.Text.Lazy ( lib/Text/Regex/TDFA/Text/Lazy.hs, dist/build/Text/Regex/TDFA/Text/Lazy.o, dist/build/Text/Regex/TDFA/Text/Lazy.dyn_o )
983.60 s
[regex-tdfa] [25 of 25] Compiling Text.Regex.TDFA ( lib/Text/Regex/TDFA.hs, dist/build/Text/Regex/TDFA.o, dist/build/Text/Regex/TDFA.dyn_o )
983.60 s
[semialign] [2 of 6] Compiling Data.Semialign.Indexed ( src/Data/Semialign/Indexed.hs, dist/build/Data/Semialign/Indexed.p_o )
983.60 s
[semialign] [3 of 6] Compiling Data.Semialign ( src/Data/Semialign.hs, dist/build/Data/Semialign.p_o )
983.60 s
[semialign] [4 of 6] Compiling Data.Align ( src/Data/Align.hs, dist/build/Data/Align.p_o )
983.60 s
[semialign] [5 of 6] Compiling Data.Crosswalk ( src/Data/Crosswalk.hs, dist/build/Data/Crosswalk.p_o )
983.60 s
[semialign] [6 of 6] Compiling Data.Zip ( src/Data/Zip.hs, dist/build/Data/Zip.p_o )
983.60 s
[semialign] Phase: checkPhase
983.60 s
[semialign] Package has no test suites.
983.60 s
[semialign] Phase: haddockPhase
983.60 s
[semialign] Preprocessing library for semialign-1.3.1..
983.60 s
[semialign] Running Haddock on library for semialign-1.3.1..
983.60 s
[semialign] Warning: The documentation for the following packages are not installed. No
983.60 s
[semialign] links will be generated to these packages: vector-0.13.2.0
983.60 s
[semialign] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
983.60 s
[semialign] [1 of 6] Compiling Data.Semialign.Internal ( src/Data/Semialign/Internal.hs, nothing )
983.60 s
[semialign] [2 of 6] Compiling Data.Semialign.Indexed ( src/Data/Semialign/Indexed.hs, nothing )
983.60 s
[semialign] [3 of 6] Compiling Data.Semialign ( src/Data/Semialign.hs, nothing )
983.60 s
[semialign] [4 of 6] Compiling Data.Align ( src/Data/Align.hs, nothing )
983.60 s
[semialign] [5 of 6] Compiling Data.Crosswalk ( src/Data/Crosswalk.hs, nothing )
983.60 s
[semialign] [6 of 6] Compiling Data.Zip ( src/Data/Zip.hs, nothing )
983.60 s
[trial-tomland] Documentation created: dist/doc/html/trial-tomland/,
983.60 s
[trial-tomland] dist/doc/html/trial-tomland/trial-tomland.txt
983.60 s
[trial-tomland] Phase: installPhase
983.60 s
[trial-tomland] Installing library in /nix/store/bp65pkffywfmymniv52sl8qgfw91w0v9-trial-tomland-0.0.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/trial-tomland-0.0.0.0-GA74HS5KoQpDLLdkVNq670
983.60 s
[trial-tomland] Phase: fixupPhase
983.60 s
[trial-tomland] shrinking RPATHs of ELF executables and libraries in /nix/store/bp65pkffywfmymniv52sl8qgfw91w0v9-trial-tomland-0.0.0.0
983.60 s
[trial-tomland] shrinking /nix/store/bp65pkffywfmymniv52sl8qgfw91w0v9-trial-tomland-0.0.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHStrial-tomland-0.0.0.0-GA74HS5KoQpDLLdkVNq670-ghc9.8.1.so
983.60 s
[trial-tomland] checking for references to /build/ in /nix/store/bp65pkffywfmymniv52sl8qgfw91w0v9-trial-tomland-0.0.0.0...
983.60 s
[trial-tomland] patching script interpreter paths in /nix/store/bp65pkffywfmymniv52sl8qgfw91w0v9-trial-tomland-0.0.0.0
983.60 s
[trial-tomland] stripping (with command strip and flags -S -p) in /nix/store/bp65pkffywfmymniv52sl8qgfw91w0v9-trial-tomland-0.0.0.0/lib
983.60 s
[trial-tomland] shrinking RPATHs of ELF executables and libraries in /nix/store/kagrkhypy0446mvywv26q4nd4l41nmj4-trial-tomland-0.0.0.0-doc
983.60 s
[trial-tomland] checking for references to /build/ in /nix/store/kagrkhypy0446mvywv26q4nd4l41nmj4-trial-tomland-0.0.0.0-doc...
983.60 s
[trial-tomland] patching script interpreter paths in /nix/store/kagrkhypy0446mvywv26q4nd4l41nmj4-trial-tomland-0.0.0.0-doc
983.60 s
[witherable] Preprocessing test suite 'witherable-tests' for witherable-0.5..
983.60 s
[witherable] Building test suite 'witherable-tests' for witherable-0.5..
983.60 s
[witherable] [1 of 1] Compiling Main ( tests/tests.hs, dist/build/witherable-tests/witherable-tests-tmp/Main.o )
983.60 s
[attoparsec] 46 | import Data.Semigroup (Semigroup(..))
983.60 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
983.60 s
[attoparsec] [ 6 of 16] Compiling Data.Attoparsec.Combinator ( Data/Attoparsec/Combinator.hs, dist/build/Data/Attoparsec/Combinator.o, dist/build/Data/Attoparsec/Combinator.dyn_o )
983.60 s
[attoparsec]
983.60 s
[attoparsec] Data/Attoparsec/Combinator.hs:46:46: warning : [ GHC-38856 ] [ -Wunused-imports ]
983.60 s
[attoparsec] The import of ‘liftA2’
983.60 s
[attoparsec] from module ‘Control.Applicative’ is redundant
983.60 s
[attoparsec] |
983.60 s
[attoparsec] 46 | import Control.Applicative (Alternative(..), liftA2 , many, (<|>))
983.60 s
[attoparsec] | ^^^^^^
983.60 s
[attoparsec] [ 7 of 16] Compiling Data.Attoparsec.Text.Internal ( Data/Attoparsec/Text/Internal.hs, dist/build/Data/Attoparsec/Text/Internal.o, dist/build/Data/Attoparsec/Text/Internal.dyn_o )
983.60 s
[attoparsec]
983.60 s
[attoparsec] Data/Attoparsec/Text/Internal.hs:68:1: warning : [ GHC-38856 ] [ -Wunused-imports ]
983.60 s
[attoparsec] The import of ‘*>, <$>, pure’
983.60 s
[attoparsec] from module ‘Control.Applicative’ is redundant
983.60 s
[attoparsec] |
983.60 s
[attoparsec] 68 | import Control.Applicative ((<|>), (<$>), pure, (*>))
983.60 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
983.60 s
[attoparsec]
983.60 s
[attoparsec] Data/Attoparsec/Text/Internal.hs:91:13: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
983.60 s
[attoparsec] The use of ‘~’ without TypeOperators
983.60 s
[attoparsec] will become an error in a future GHC release.
983.60 s
[attoparsec] Suggested fix: Perhaps you intended to use TypeOperators
983.60 s
[attoparsec] |
983.60 s
[attoparsec] 91 | instance (a ~ Text) => IsString (Parser a) where
983.60 s
[attoparsec] | ^
983.60 s
[attoparsec] [ 8 of 16] Compiling Data.Attoparsec.Text ( Data/Attoparsec/Text.hs, dist/build/Data/Attoparsec/Text.o, dist/build/Data/Attoparsec/Text.dyn_o )
983.77 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/6bw638xvsqji2hb14bj62nvpbw2vv9rv-extra-1.7.16 /nix/store/bi4pslxl5s26ywn4hx9mfg0hqcg1jjlh-extra-1.7.16-doc
984.38 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
984.42 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/6bw638xvsqji2hb14bj62nvpbw2vv9rv-extra-1.7.16 /nix/store/bi4pslxl5s26ywn4hx9mfg0hqcg1jjlh-extra-1.7.16-doc
984.54 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
984.71 s
[post-build-hook] copying 3 paths...
984.71 s
[post-build-hook] copying path '/nix/store/h10s79qr69gnfmsrrw8mdshdfiyh254s-clock-0.8.4-doc' to 'https://cache.nix-ci.com'...
984.95 s
[post-build-hook] copying path '/nix/store/nrhlwdip4prr2n54y171vbxk9km0qxn9-clock-0.8.4' to 'https://cache.nix-ci.com'...
985.71 s
[post-build-hook] copying path '/nix/store/6bw638xvsqji2hb14bj62nvpbw2vv9rv-extra-1.7.16' to 'https://cache.nix-ci.com'...
988.36 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
988.56 s
[post-build-hook] copying 0 paths...
988.62 s
Progress: 75 of 171 built (9 building), 395 of 395 downloaded from cache
988.87 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/h7vs47g01bad3k8qqd3vkcd1jhhza6z4-foldl-1.4.18 /nix/store/w38qllska0qzzs1vkghmzb3g7izyxw25-foldl-1.4.18-doc
989.84 s
[post-build-hook] Pushing 2 paths (122 are already present) using zstd to cache sellout ⏳
989.84 s
[post-build-hook]
990.19 s
[post-build-hook] Pushing /nix/store/h7vs47g01bad3k8qqd3vkcd1jhhza6z4-foldl-1.4.18 (7.10 MiB)
990.26 s
[post-build-hook] Pushing /nix/store/w38qllska0qzzs1vkghmzb3g7izyxw25-foldl-1.4.18-doc (4.66 MiB)
991.38 s
[post-build-hook]
991.38 s
[post-build-hook] All done.
991.51 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/h7vs47g01bad3k8qqd3vkcd1jhhza6z4-foldl-1.4.18 /nix/store/w38qllska0qzzs1vkghmzb3g7izyxw25-foldl-1.4.18-doc
991.64 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
991.92 s
[post-build-hook] copying 2 paths...
991.92 s
[post-build-hook] copying path '/nix/store/w38qllska0qzzs1vkghmzb3g7izyxw25-foldl-1.4.18-doc' to 'https://cache.nix-ci.com'...
992.98 s
[post-build-hook] copying path '/nix/store/h7vs47g01bad3k8qqd3vkcd1jhhza6z4-foldl-1.4.18' to 'https://cache.nix-ci.com'...
997.48 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
997.78 s
[post-build-hook] copying 1 paths...
997.80 s
[post-build-hook] copying path '/nix/store/jy5k440yjnaczsc3j4z6rinjvsa019c8-foldl-1.4.18.drv' to 'https://cache.nix-ci.com'...
998.02 s
Progress: 76 of 172 built (8 building), 395 of 395 downloaded from cache
998.30 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/f781q9h2a38js6x0viwirainvnbmvmp5-free-5.2 /nix/store/jv1lk6fz8idh20kidgmjaly5qvcs04fd-free-5.2-doc
998.93 s
[post-build-hook] Pushing 2 paths (100 are already present) using zstd to cache sellout ⏳
998.93 s
[post-build-hook]
999.27 s
[post-build-hook] Pushing /nix/store/f781q9h2a38js6x0viwirainvnbmvmp5-free-5.2 (22.41 MiB)
999.32 s
[post-build-hook] Pushing /nix/store/jv1lk6fz8idh20kidgmjaly5qvcs04fd-free-5.2-doc (6.03 MiB)
1000.55 s
[post-build-hook]
1000.55 s
[post-build-hook] All done.
1000.60 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/f781q9h2a38js6x0viwirainvnbmvmp5-free-5.2 /nix/store/jv1lk6fz8idh20kidgmjaly5qvcs04fd-free-5.2-doc
1000.68 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1000.88 s
[post-build-hook] copying 2 paths...
1000.88 s
[post-build-hook] copying path '/nix/store/jv1lk6fz8idh20kidgmjaly5qvcs04fd-free-5.2-doc' to 'https://cache.nix-ci.com'...
1002.20 s
[post-build-hook] copying path '/nix/store/f781q9h2a38js6x0viwirainvnbmvmp5-free-5.2' to 'https://cache.nix-ci.com'...
1013.76 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1014.05 s
[post-build-hook] copying 1 paths...
1014.70 s
[post-build-hook] copying path '/nix/store/j629157x2qm621bi77l0qxsymmnsx8qj-free-5.2.drv' to 'https://cache.nix-ci.com'...
1014.70 s
Progress: 77 of 173 built (7 building), 395 of 395 downloaded from cache
1014.70 s
[monoid-subclasses] To import instances alone, use: import Data.Semigroup()
1014.70 s
[monoid-subclasses] |
1014.70 s
[monoid-subclasses] 21 | import Data.Semigroup (Semigroup(..))
1014.70 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1014.70 s
[monoid-subclasses]
1014.70 s
[monoid-subclasses] src/Data/Monoid/Instances/Measured.hs:22:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1014.70 s
[monoid-subclasses] The import of ‘Data.Monoid’ is redundant
1014.70 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Monoid’
1014.70 s
[monoid-subclasses] To import instances alone, use: import Data.Monoid()
1014.70 s
[monoid-subclasses] |
1014.70 s
[monoid-subclasses] 22 | import Data.Monoid (Monoid(..))
1014.70 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1014.70 s
[monoid-subclasses] [15 of 16] Compiling Data.Monoid.Instances.Concat ( src/Data/Monoid/Instances/Concat.hs, dist/build/Data/Monoid/Instances/Concat.p_o )
1014.70 s
[monoid-subclasses]
1014.70 s
[monoid-subclasses] src/Data/Monoid/Instances/Concat.hs:23:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1014.70 s
[monoid-subclasses] The import of ‘Data.Semigroup’ is redundant
1014.70 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Semigroup’
1014.70 s
[monoid-subclasses] To import instances alone, use: import Data.Semigroup()
1014.70 s
[monoid-subclasses] |
1014.70 s
[monoid-subclasses] 23 | import Data.Semigroup (Semigroup(..))
1014.70 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1014.70 s
[monoid-subclasses]
1014.70 s
[monoid-subclasses] src/Data/Monoid/Instances/Concat.hs:24:21: warning : [ GHC-38856 ] [ -Wunused-imports ]
1014.70 s
[monoid-subclasses] The import of ‘Monoid’ from module ‘Data.Monoid’ is redundant
1014.70 s
[monoid-subclasses] |
1014.70 s
[monoid-subclasses] 24 | import Data.Monoid (Monoid(..) , First(..), Sum(..))
1014.70 s
[monoid-subclasses] | ^^^^^^^^^^
1014.70 s
[monoid-subclasses]
1014.70 s
[monoid-subclasses] src/Data/Monoid/Instances/Concat.hs:199:13: warning : [ GHC-62161 ] [ -Wincomplete-uni-patterns ]
1014.70 s
[monoid-subclasses] Pattern match(es) are non-exhaustive
1014.70 s
[monoid-subclasses] In a pattern binding: Patterns of type ‘[Concat a]’ not matched: []
1014.70 s
[monoid-subclasses] |
1014.70 s
[monoid-subclasses] 199 | where splitNext a ~(xp:xs) =
1014.70 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^...
1014.70 s
[monoid-subclasses]
1014.70 s
[monoid-subclasses] src/Data/Monoid/Instances/Concat.hs:282:13: warning : [ GHC-62161 ] [ -Wincomplete-uni-patterns ]
1014.70 s
[monoid-subclasses] Pattern match(es) are non-exhaustive
1014.70 s
[monoid-subclasses] In a pattern binding: Patterns of type ‘[Concat p]’ not matched: []
1014.70 s
[monoid-subclasses] |
1014.70 s
[monoid-subclasses] 282 | where splitNext a ~(xp:xs) =
1014.70 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^...
1014.70 s
[monoid-subclasses] [16 of 16] Compiling Data.Monoid.Instances.ByteString.UTF8 ( src/Data/Monoid/Instances/ByteString/UTF8.hs, dist/build/Data/Monoid/Instances/ByteString/UTF8.p_o )
1014.70 s
[monoid-subclasses]
1014.70 s
[monoid-subclasses] src/Data/Monoid/Instances/ByteString/UTF8.hs:59:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1014.70 s
[monoid-subclasses] The import of ‘Data.Semigroup’ is redundant
1014.70 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Semigroup’
1014.70 s
[monoid-subclasses] To import instances alone, use: import Data.Semigroup()
1014.70 s
[monoid-subclasses] |
1014.70 s
[monoid-subclasses] 59 | import Data.Semigroup (Semigroup(..))
1014.70 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1014.70 s
[monoid-subclasses]
1014.70 s
[monoid-subclasses] src/Data/Monoid/Instances/ByteString/UTF8.hs:60:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1014.70 s
[monoid-subclasses] The import of ‘Data.Monoid’ is redundant
1014.70 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Monoid’
1014.70 s
[monoid-subclasses] To import instances alone, use: import Data.Monoid()
1014.70 s
[monoid-subclasses] |
1014.70 s
[monoid-subclasses] 60 | import Data.Monoid (Monoid(..))
1014.70 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1014.70 s
[nothunks] checking for references to /build/ in /nix/store/dibyvbnvq1qap6yrxncgg12s6l7x49cv-nothunks-0.3.0.0-doc...
1014.70 s
[nothunks] patching script interpreter paths in /nix/store/dibyvbnvq1qap6yrxncgg12s6l7x49cv-nothunks-0.3.0.0-doc
1014.70 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/bp65pkffywfmymniv52sl8qgfw91w0v9-trial-tomland-0.0.0.0 /nix/store/kagrkhypy0446mvywv26q4nd4l41nmj4-trial-tomland-0.0.0.0-doc
1015.10 s
[post-build-hook] Pushing 2 paths (103 are already present) using zstd to cache sellout ⏳
1015.10 s
[post-build-hook]
1015.45 s
[post-build-hook] Pushing /nix/store/bp65pkffywfmymniv52sl8qgfw91w0v9-trial-tomland-0.0.0.0 (393.59 KiB)
1015.57 s
[post-build-hook] Pushing /nix/store/kagrkhypy0446mvywv26q4nd4l41nmj4-trial-tomland-0.0.0.0-doc (217.99 KiB)
1016.46 s
[post-build-hook]
1016.46 s
[post-build-hook] All done.
1016.51 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/bp65pkffywfmymniv52sl8qgfw91w0v9-trial-tomland-0.0.0.0 /nix/store/kagrkhypy0446mvywv26q4nd4l41nmj4-trial-tomland-0.0.0.0-doc
1016.58 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1016.78 s
[post-build-hook] copying 2 paths...
1016.78 s
[post-build-hook] copying path '/nix/store/kagrkhypy0446mvywv26q4nd4l41nmj4-trial-tomland-0.0.0.0-doc' to 'https://cache.nix-ci.com'...
1017.17 s
[post-build-hook] copying path '/nix/store/bp65pkffywfmymniv52sl8qgfw91w0v9-trial-tomland-0.0.0.0' to 'https://cache.nix-ci.com'...
1017.58 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1017.85 s
[post-build-hook] copying 1 paths...
1017.85 s
[post-build-hook] copying path '/nix/store/ck9jvx25l712k8jkiml8sc0f3fcfjanp-trial-tomland-0.0.0.0.drv' to 'https://cache.nix-ci.com'...
1018.09 s
Progress: 78 of 174 built (6 building), 395 of 395 downloaded from cache
1018.27 s
Building adjunctions
1018.38 s
Building algebraic-graphs
1018.49 s
Building filepattern
1018.64 s
Building ghc-exactprint
1018.82 s
Building ghc-lib-parser-ex
1019.00 s
Building keys
1019.17 s
Building unix-compat
1019.18 s
[adjunctions] Phase: setupCompilerEnvironmentPhase
1019.20 s
[adjunctions] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1019.20 s
[adjunctions] Phase: unpackPhase
1019.20 s
[adjunctions] unpacking source archive /nix/store/waldaj6slia1mw3pm6y2clkf51jg1vin-adjunctions-4.4.3.tar.gz
1019.20 s
[algebraic-graphs] Phase: setupCompilerEnvironmentPhase
1019.20 s
[algebraic-graphs] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1019.20 s
[algebraic-graphs] Phase: unpackPhase
1019.20 s
[algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
1019.20 s
[algebraic-graphs] source root is algebraic-graphs-0.7
1019.20 s
[algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
1019.20 s
[algebraic-graphs] Phase: patchPhase
1019.21 s
[algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
1019.21 s
[algebraic-graphs] Phase: compileBuildDriverPhase
1019.21 s
[algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.q9qhvxwugU/setup-package.conf.d -threaded
1019.21 s
[attoparsec] [ 9 of 16] Compiling Data.Attoparsec.Text.Lazy ( Data/Attoparsec/Text/Lazy.hs, dist/build/Data/Attoparsec/Text/Lazy.o, dist/build/Data/Attoparsec/Text/Lazy.dyn_o )
1019.21 s
[attoparsec] [10 of 16] Compiling Data.Attoparsec.ByteString.Internal ( Data/Attoparsec/ByteString/Internal.hs, dist/build/Data/Attoparsec/ByteString/Internal.o, dist/build/Data/Attoparsec/ByteString/Internal.dyn_o )
1019.21 s
[attoparsec] [11 of 16] Compiling Data.Attoparsec.ByteString ( Data/Attoparsec/ByteString.hs, dist/build/Data/Attoparsec/ByteString.o, dist/build/Data/Attoparsec/ByteString.dyn_o )
1019.21 s
[attoparsec] [12 of 16] Compiling Data.Attoparsec.ByteString.Lazy ( Data/Attoparsec/ByteString/Lazy.hs, dist/build/Data/Attoparsec/ByteString/Lazy.o, dist/build/Data/Attoparsec/ByteString/Lazy.dyn_o )
1019.21 s
[attoparsec] [13 of 16] Compiling Data.Attoparsec.Lazy ( Data/Attoparsec/Lazy.hs, dist/build/Data/Attoparsec/Lazy.o, dist/build/Data/Attoparsec/Lazy.dyn_o )
1019.21 s
[attoparsec] [14 of 16] Compiling Data.Attoparsec.ByteString.Char8 ( Data/Attoparsec/ByteString/Char8.hs, dist/build/Data/Attoparsec/ByteString/Char8.o, dist/build/Data/Attoparsec/ByteString/Char8.dyn_o )
1019.21 s
[attoparsec]
1019.21 s
[attoparsec] Data/Attoparsec/ByteString/Char8.hs:154:13: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1019.21 s
[attoparsec] The use of ‘~’ without TypeOperators
1019.21 s
[attoparsec] will become an error in a future GHC release.
1019.22 s
[attoparsec] Suggested fix: Perhaps you intended to use TypeOperators
1019.22 s
[attoparsec] |
1019.22 s
[attoparsec] 154 | instance (a ~ B.ByteString) => IsString (Parser a) where
1019.22 s
[attoparsec] | ^
1019.22 s
[attoparsec] [15 of 16] Compiling Data.Attoparsec.Char8 ( Data/Attoparsec/Char8.hs, dist/build/Data/Attoparsec/Char8.o, dist/build/Data/Attoparsec/Char8.dyn_o )
1019.22 s
[attoparsec] [16 of 16] Compiling Data.Attoparsec ( Data/Attoparsec.hs, dist/build/Data/Attoparsec.o, dist/build/Data/Attoparsec.dyn_o )
1019.22 s
[attoparsec] [ 1 of 16] Compiling Data.Attoparsec.Internal.Types ( Data/Attoparsec/Internal/Types.hs, dist/build/Data/Attoparsec/Internal/Types.p_o )
1019.22 s
[attoparsec]
1019.22 s
[attoparsec] Data/Attoparsec/Internal/Types.hs:28:53: warning : [ GHC-38856 ] [ -Wunused-imports ]
1019.22 s
[attoparsec] The import of ‘<$>’ from module ‘Control.Applicative’ is redundant
1019.22 s
[attoparsec] |
1019.22 s
[attoparsec] 28 | import Control.Applicative as App (Applicative(..), (<$>) )
1019.22 s
[attoparsec] | ^^^^^
1019.22 s
[attoparsec]
1019.22 s
[attoparsec] Data/Attoparsec/Internal/Types.hs:34:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1019.22 s
[attoparsec] The import of ‘Data.Semigroup’ is redundant
1019.22 s
[attoparsec] except perhaps to import instances from ‘Data.Semigroup’
1019.22 s
[attoparsec] To import instances alone, use: import Data.Semigroup()
1019.22 s
[attoparsec] |
1019.22 s
[attoparsec] 34 | import Data.Semigroup (Semigroup(..))
1019.22 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1019.22 s
[attoparsec] [ 2 of 16] Compiling Data.Attoparsec.Internal ( Data/Attoparsec/Internal.hs, dist/build/Data/Attoparsec/Internal.p_o )
1019.22 s
[attoparsec] [ 3 of 16] Compiling Data.Attoparsec.Number ( Data/Attoparsec/Number.hs, dist/build/Data/Attoparsec/Number.p_o )
1019.22 s
[attoparsec] [ 4 of 16] Compiling Data.Attoparsec.Types ( Data/Attoparsec/Types.hs, dist/build/Data/Attoparsec/Types.p_o )
1019.22 s
[attoparsec] [ 5 of 16] Compiling Data.Attoparsec.Zepto ( Data/Attoparsec/Zepto.hs, dist/build/Data/Attoparsec/Zepto.p_o )
1019.22 s
[attoparsec]
1019.22 s
[attoparsec] Data/Attoparsec/Zepto.hs:46:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1019.22 s
[attoparsec] The import of ‘Data.Semigroup’ is redundant
1019.22 s
[attoparsec] except perhaps to import instances from ‘Data.Semigroup’
1019.22 s
[attoparsec] To import instances alone, use: import Data.Semigroup()
1019.22 s
[attoparsec] |
1019.22 s
[attoparsec] 46 | import Data.Semigroup (Semigroup(..))
1019.22 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1019.22 s
[filepattern] Phase: setupCompilerEnvironmentPhase
1019.22 s
[filepattern] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1019.22 s
[filepattern] Phase: unpackPhase
1019.22 s
[filepattern] unpacking source archive /nix/store/7hiqwrspk1532wdp82dqgd84w1da1hfm-filepattern-0.1.3.tar.gz
1019.23 s
[filepattern] source root is filepattern-0.1.3
1019.23 s
[filepattern] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "filepattern-0.1.3/test/Test/Util.hs"
1019.23 s
[filepattern] Phase: patchPhase
1019.23 s
[filepattern] Phase: compileBuildDriverPhase
1019.23 s
[ghc-exactprint] Phase: setupCompilerEnvironmentPhase
1019.23 s
[ghc-exactprint] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1019.23 s
[ghc-lib-parser-ex] Phase: setupCompilerEnvironmentPhase
1019.23 s
[ghc-lib-parser-ex] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1019.23 s
[monoid-subclasses] Preprocessing test suite 'Main' for monoid-subclasses-1.2.6..
1019.23 s
[monoid-subclasses] Building test suite 'Main' for monoid-subclasses-1.2.6..
1019.23 s
[monoid-subclasses] [1 of 1] Compiling Main ( Test/TestMonoidSubclasses.hs, dist/build/Main/Main-tmp/Main.o )
1019.23 s
[monoid-subclasses] [2 of 2] Linking dist/build/Main/Main
1019.23 s
[monoid-subclasses] buildPhase completed in 2 minutes 19 seconds
1019.23 s
[monoid-subclasses] Phase: checkPhase
1019.23 s
[monoid-subclasses] Running 1 test suites...
1019.23 s
[monoid-subclasses] Test suite Main: RUNNING...
1019.23 s
[monoid-subclasses] MonoidSubclasses
1019.23 s
[monoid-subclasses] CommutativeMonoid: OK (0.02s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] MonoidNull: OK (0.54s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] PositiveMonoid: OK (0.14s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] mconcat . factors == id: OK (1.65s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] all factors . factors: OK (0.82s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] splitPrimePrefix: OK (0.78s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] splitPrimeSuffix: OK (2.84s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] primePrefix: OK (0.25s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] primeSuffix: OK (0.27s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] inits: OK (0.65s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] tails: OK (0.47s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] foldl: OK (1.00s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] foldl': OK (1.13s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] foldr: OK (0.89s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] length: OK (0.51s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] span: OK (1.63s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.23 s
[monoid-subclasses] spanMaybe: OK (1.27s)
1019.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1019.51 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/dibyvbnvq1qap6yrxncgg12s6l7x49cv-nothunks-0.3.0.0-doc /nix/store/v3pigpjw2hsh3zd3cwryibvyxv7frpiw-nothunks-0.3.0.0
1020.47 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1020.57 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/dibyvbnvq1qap6yrxncgg12s6l7x49cv-nothunks-0.3.0.0-doc /nix/store/v3pigpjw2hsh3zd3cwryibvyxv7frpiw-nothunks-0.3.0.0
1020.87 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1020.99 s
[post-build-hook] copying 1 paths...
1020.99 s
[post-build-hook] copying path '/nix/store/v3pigpjw2hsh3zd3cwryibvyxv7frpiw-nothunks-0.3.0.0' to 'https://cache.nix-ci.com'...
1022.45 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1022.69 s
[post-build-hook] copying 0 paths...
1022.80 s
Progress: 79 of 171 built (12 building), 395 of 395 downloaded from cache
1022.80 s
[regex-tdfa] [ 1 of 25] Compiling Data.IntMap.CharMap2 ( lib/Data/IntMap/CharMap2.hs, dist/build/Data/IntMap/CharMap2.p_o )
1022.80 s
[regex-tdfa] [ 2 of 25] Compiling Data.IntSet.EnumSet2 ( lib/Data/IntSet/EnumSet2.hs, dist/build/Data/IntSet/EnumSet2.p_o )
1022.80 s
[regex-tdfa] [ 3 of 25] Compiling Data.IntMap.EnumMap2 ( lib/Data/IntMap/EnumMap2.hs, dist/build/Data/IntMap/EnumMap2.p_o )
1022.80 s
[regex-tdfa] [ 4 of 25] Compiling Paths_regex_tdfa ( dist/build/autogen/Paths_regex_tdfa.hs, dist/build/Paths_regex_tdfa.p_o )
1022.80 s
[regex-tdfa] [ 5 of 25] Compiling Text.Regex.TDFA.IntArrTrieSet ( lib/Text/Regex/TDFA/IntArrTrieSet.hs, dist/build/Text/Regex/TDFA/IntArrTrieSet.p_o )
1022.80 s
[regex-tdfa] [ 6 of 25] Compiling Text.Regex.TDFA.Common ( lib/Text/Regex/TDFA/Common.hs, dist/build/Text/Regex/TDFA/Common.p_o )
1022.80 s
[regex-tdfa] [ 7 of 25] Compiling Text.Regex.TDFA.NewDFA.Uncons ( lib/Text/Regex/TDFA/NewDFA/Uncons.hs, dist/build/Text/Regex/TDFA/NewDFA/Uncons.p_o )
1022.80 s
[regex-tdfa] [ 8 of 25] Compiling Text.Regex.TDFA.NewDFA.MakeTest ( lib/Text/Regex/TDFA/NewDFA/MakeTest.hs, dist/build/Text/Regex/TDFA/NewDFA/MakeTest.p_o )
1022.80 s
[regex-tdfa] [ 9 of 25] Compiling Text.Regex.TDFA.NewDFA.Tester ( lib/Text/Regex/TDFA/NewDFA/Tester.hs, dist/build/Text/Regex/TDFA/NewDFA/Tester.p_o )
1022.80 s
[regex-tdfa] [10 of 25] Compiling Text.Regex.TDFA.NewDFA.Engine_NC_FA ( lib/Text/Regex/TDFA/NewDFA/Engine_NC_FA.hs, dist/build/Text/Regex/TDFA/NewDFA/Engine_NC_FA.p_o )
1022.80 s
[regex-tdfa] [11 of 25] Compiling Text.Regex.TDFA.NewDFA.Engine_NC ( lib/Text/Regex/TDFA/NewDFA/Engine_NC.hs, dist/build/Text/Regex/TDFA/NewDFA/Engine_NC.p_o )
1022.80 s
[regex-tdfa] [12 of 25] Compiling Text.Regex.TDFA.NewDFA.Engine_FA ( lib/Text/Regex/TDFA/NewDFA/Engine_FA.hs, dist/build/Text/Regex/TDFA/NewDFA/Engine_FA.p_o )
1022.80 s
[regex-tdfa] [13 of 25] Compiling Text.Regex.TDFA.NewDFA.Engine ( lib/Text/Regex/TDFA/NewDFA/Engine.hs, dist/build/Text/Regex/TDFA/NewDFA/Engine.p_o )
1022.80 s
[regex-tdfa] [14 of 25] Compiling Text.Regex.TDFA.Pattern ( lib/Text/Regex/TDFA/Pattern.hs, dist/build/Text/Regex/TDFA/Pattern.p_o )
1022.80 s
[regex-tdfa] [15 of 25] Compiling Text.Regex.TDFA.CorePattern ( lib/Text/Regex/TDFA/CorePattern.hs, dist/build/Text/Regex/TDFA/CorePattern.p_o )
1022.80 s
[regex-tdfa] [16 of 25] Compiling Text.Regex.TDFA.ReadRegex ( lib/Text/Regex/TDFA/ReadRegex.hs, dist/build/Text/Regex/TDFA/ReadRegex.p_o )
1022.80 s
[regex-tdfa] [17 of 25] Compiling Text.Regex.TDFA.TNFA ( lib/Text/Regex/TDFA/TNFA.hs, dist/build/Text/Regex/TDFA/TNFA.p_o )
1022.80 s
[regex-tdfa] [18 of 25] Compiling Text.Regex.TDFA.TDFA ( lib/Text/Regex/TDFA/TDFA.hs, dist/build/Text/Regex/TDFA/TDFA.p_o )
1022.81 s
[regex-tdfa] [19 of 25] Compiling Text.Regex.TDFA.String ( lib/Text/Regex/TDFA/String.hs, dist/build/Text/Regex/TDFA/String.p_o )
1022.81 s
[regex-tdfa] [20 of 25] Compiling Text.Regex.TDFA.Sequence ( lib/Text/Regex/TDFA/Sequence.hs, dist/build/Text/Regex/TDFA/Sequence.p_o )
1022.81 s
[regex-tdfa] [21 of 25] Compiling Text.Regex.TDFA.ByteString.Lazy ( lib/Text/Regex/TDFA/ByteString/Lazy.hs, dist/build/Text/Regex/TDFA/ByteString/Lazy.p_o )
1022.81 s
[regex-tdfa] [22 of 25] Compiling Text.Regex.TDFA.ByteString ( lib/Text/Regex/TDFA/ByteString.hs, dist/build/Text/Regex/TDFA/ByteString.p_o )
1022.81 s
[regex-tdfa] [23 of 25] Compiling Text.Regex.TDFA.Text ( lib/Text/Regex/TDFA/Text.hs, dist/build/Text/Regex/TDFA/Text.p_o )
1022.81 s
[regex-tdfa] [24 of 25] Compiling Text.Regex.TDFA.Text.Lazy ( lib/Text/Regex/TDFA/Text/Lazy.hs, dist/build/Text/Regex/TDFA/Text/Lazy.p_o )
1022.81 s
[regex-tdfa] [25 of 25] Compiling Text.Regex.TDFA ( lib/Text/Regex/TDFA.hs, dist/build/Text/Regex/TDFA.p_o )
1022.81 s
[regex-tdfa] Preprocessing test suite 'regex-tdfa-unittest' for regex-tdfa-1.3.2.3..
1022.81 s
[regex-tdfa] Building test suite 'regex-tdfa-unittest' for regex-tdfa-1.3.2.3..
1022.81 s
[regex-tdfa] [1 of 1] Compiling Main ( test/Main.hs, dist/build/regex-tdfa-unittest/regex-tdfa-unittest-tmp/Main.o )
1022.81 s
[regex-tdfa] [2 of 2] Linking dist/build/regex-tdfa-unittest/regex-tdfa-unittest
1022.81 s
[regex-tdfa] Preprocessing test suite 'doctest' for regex-tdfa-1.3.2.3..
1022.81 s
[regex-tdfa] Building test suite 'doctest' for regex-tdfa-1.3.2.3..
1022.81 s
[regex-tdfa] [1 of 1] Compiling Main ( test/DocTestMain.hs, dist/build/doctest/doctest-tmp/Main.o )
1022.81 s
[regex-tdfa] [2 of 2] Linking dist/build/doctest/doctest
1022.81 s
[semialign] Haddock coverage:
1022.81 s
[semialign] Warning: 'repeat' is ambiguous. It is defined
1022.81 s
[semialign] * in ‘Data.List.NonEmpty’
1022.81 s
[semialign] * in ‘GHC.List’
1022.81 s
[semialign] * at src/Data/Semialign/Internal.hs:277:5
1022.81 s
[semialign] You may be able to disambiguate the identifier by qualifying it or
1022.81 s
[semialign] by specifying the type/value namespace explicitly.
1022.81 s
[semialign] Defaulting to the one defined at src/Data/Semialign/Internal.hs:277:5
1022.81 s
[semialign] Warning: 'tabulate' is out of scope.
1022.81 s
[semialign] If you qualify the identifier, haddock can try to link it anyway.
1022.81 s
[semialign] Warning: 'zipWith' is ambiguous. It is defined
1022.81 s
[semialign] * in ‘Data.List.NonEmpty’
1022.81 s
[semialign] * in ‘GHC.List’
1022.81 s
[semialign] * in ‘Data.Sequence.Internal’
1022.81 s
[semialign] * at src/Data/Semialign/Internal.hs:261:5
1022.81 s
[semialign] * in ‘Data.Vector’
1022.81 s
[semialign] * in ‘Data.Vector.Fusion.Bundle.Monadic’
1022.81 s
[semialign] * in ‘Data.Stream.Monadic’
1022.81 s
[semialign] You may be able to disambiguate the identifier by qualifying it or
1022.81 s
[semialign] by specifying the type/value namespace explicitly.
1022.81 s
[semialign] Defaulting to the one defined at src/Data/Semialign/Internal.hs:261:5
1022.81 s
[semialign] Warning: 'zip' is ambiguous. It is defined
1022.81 s
[semialign] * in ‘Data.List.NonEmpty’
1022.81 s
[semialign] * in ‘GHC.List’
1022.81 s
[semialign] * in ‘Data.Sequence.Internal’
1022.81 s
[semialign] * at src/Data/Semialign/Internal.hs:256:5
1022.81 s
[semialign] * in ‘Data.Vector’
1022.81 s
[semialign] * in ‘Data.Vector.Fusion.Bundle.Monadic’
1022.81 s
[semialign] * in ‘Data.Stream.Monadic’
1022.81 s
[semialign] You may be able to disambiguate the identifier by qualifying it or
1022.81 s
[semialign] by specifying the type/value namespace explicitly.
1022.81 s
[semialign] Defaulting to the one defined at src/Data/Semialign/Internal.hs:256:5
1022.81 s
[semialign] Warning: 'These' is ambiguous. It is defined
1022.81 s
[semialign] * in ‘Data.These’
1022.81 s
[semialign] * in ‘Data.These’
1022.81 s
[semialign] You may be able to disambiguate the identifier by qualifying it or
1022.81 s
[semialign] by specifying the type/value namespace explicitly.
1022.81 s
[semialign] Defaulting to the one defined in ‘Data.These’
1022.81 s
[semialign] Warning: 'join' is out of scope.
1022.81 s
[semialign] If you qualify the identifier, haddock can try to link it anyway.
1022.81 s
[semialign] 100% ( 4 / 4) in 'Data.Semialign.Indexed'
1022.81 s
[semialign] 88% ( 16 / 18) in 'Data.Semialign'
1022.81 s
[semialign] Missing documentation for:
1022.81 s
[semialign] unzipDefault (src/Data/Semialign/Internal.hs:308)
1022.81 s
[semialign] alignVectorWith (src/Data/Semialign/Internal.hs:718)
1022.81 s
[semialign] Warning: 'These' is out of scope.
1022.81 s
[semialign] If you qualify the identifier, haddock can try to link it anyway.
1022.81 s
[semialign] 92% ( 12 / 13) in 'Data.Align'
1022.81 s
[semialign] Missing documentation for:
1022.81 s
[semialign] alignVectorWith (src/Data/Semialign/Internal.hs:718)
1022.81 s
[semialign] 80% ( 4 / 5) in 'Data.Crosswalk'
1022.81 s
[semialign] Missing documentation for:
1022.81 s
[semialign] Module header
1022.81 s
[semialign] 71% ( 5 / 7) in 'Data.Zip'
1022.81 s
[semialign] Missing documentation for:
1022.81 s
[semialign] unzipDefault (src/Data/Semialign/Internal.hs:308)
1022.81 s
[semialign] Zippy (src/Data/Zip.hs:30)
1022.81 s
[semialign] Warning: Data.Semialign.Indexed: could not find link destinations for:
1022.81 s
[semialign] - Data.Vector.Vector
1022.81 s
[semialign] Warning: Data.Semialign: could not find link destinations for:
1022.81 s
[semialign] - Data.Vector.Generic.Base.Vector
1022.81 s
[semialign] - Data.Vector.Fusion.Bundle.Monadic.Bundle
1022.81 s
[semialign] - Data.Vector.Vector
1022.81 s
[semialign] Warning: Data.Align: could not find link destinations for:
1022.81 s
[semialign] - Data.Vector.Generic.Base.Vector
1022.81 s
[semialign] - Data.Vector.Fusion.Bundle.Monadic.Bundle
1022.81 s
[semialign] - Data.Vector.Vector
1022.81 s
[semialign] Warning: Data.Crosswalk: could not find link destinations for:
1022.81 s
[semialign] - Data.Vector.Vector
1022.81 s
[semialign] Warning: Data.Zip: could not find link destinations for:
1022.81 s
[semialign] - Data.Vector.Fusion.Bundle.Monadic.Bundle
1022.81 s
[semialign] - Data.Vector.Vector
1022.81 s
[semialign] Documentation created: dist/doc/html/semialign/,
1022.81 s
[semialign] dist/doc/html/semialign/semialign.txt
1022.81 s
[semialign] Phase: installPhase
1022.81 s
[semialign] Installing library in /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/semialign-1.3.1-GjSyYQig4Ie64NgVCte6oq
1022.81 s
[semialign] Phase: fixupPhase
1022.81 s
[semialign] shrinking RPATHs of ELF executables and libraries in /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1
1022.81 s
[semialign] shrinking /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSsemialign-1.3.1-GjSyYQig4Ie64NgVCte6oq-ghc9.8.1.so
1022.81 s
[semialign] checking for references to /build/ in /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1...
1022.81 s
[semialign] patching script interpreter paths in /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1
1022.81 s
[witherable] [2 of 2] Linking dist/build/witherable-tests/witherable-tests
1022.81 s
[witherable] buildPhase completed in 39 seconds
1022.81 s
[witherable] Phase: checkPhase
1022.81 s
[witherable] Running 1 test suites...
1022.81 s
[witherable] Test suite witherable-tests: RUNNING...
1022.82 s
[witherable] witherable
1022.82 s
[witherable] Filterable
1022.82 s
[witherable] []
1022.82 s
[witherable] conservation: OK (0.02s)
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] composition: OK (0.01s)
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default filter: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default mapMaybe: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default catMaybes: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] Maybe
1022.82 s
[witherable] conservation: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] composition: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default filter: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default mapMaybe: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default catMaybes: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] Either [Char]
1022.82 s
[witherable] conservation: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] composition: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default filter: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default mapMaybe: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default catMaybes: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] Vector
1022.82 s
[witherable] conservation: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] composition: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default filter: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default mapMaybe: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default catMaybes: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] Seq
1022.82 s
[witherable] conservation: OK (0.01s)
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] composition: OK (0.02s)
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default filter: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default mapMaybe: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default catMaybes: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] IntMap
1022.82 s
[witherable] conservation: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] composition: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default filter: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default mapMaybe: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default catMaybes: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] Map K
1022.82 s
[witherable] conservation: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] composition: OK (0.01s)
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default filter: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default mapMaybe: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default catMaybes: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] HashMap K
1022.82 s
[witherable] conservation: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] composition: OK (0.01s)
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default filter: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default mapMaybe: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default catMaybes: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] Wicked
1022.82 s
[witherable] conservation: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] composition: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default filter: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default mapMaybe: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default catMaybes: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] Witherable
1022.82 s
[witherable] []
1022.82 s
[witherable] default wither: OK (0.02s)
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default witherM: OK (0.03s)
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default filterA: OK (0.01s)
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] identity: OK (0.02s)
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] composition: OK (0.04s)
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] Maybe
1022.82 s
[witherable] default wither: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default witherM: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default filterA: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] identity: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] composition: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] Either [Char]
1022.82 s
[witherable] default wither: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default witherM: OK
1022.82 s
[witherable] +++ OK, passed 100 tests.
1022.82 s
[witherable] default filterA: OK
1022.96 s
Building unordered-containers
1022.96 s
[adjunctions] source root is adjunctions-4.4.3
1022.96 s
[adjunctions] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "adjunctions-4.4.3/.vim.custom"
1022.96 s
[adjunctions] Phase: patchPhase
1022.96 s
[adjunctions] Phase: compileBuildDriverPhase
1022.96 s
[adjunctions] setupCompileFlags: -package-db=/build/tmp.mB3IOpglcn/setup-package.conf.d -threaded
1022.96 s
[adjunctions] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.mB3IOpglcn/Main.o )
1022.96 s
[adjunctions] [2 of 2] Linking Setup
1022.96 s
[algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.q9qhvxwugU/Main.o )
1022.96 s
[algebraic-graphs] [2 of 2] Linking Setup
1022.96 s
[algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
1022.96 s
[algebraic-graphs] Phase: configurePhase
1022.96 s
[algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/kmhq1m44brvhzap1zdl0i25m78f00kvy-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/rbfgcy9y59gqkp6924h8ll9485a16iar-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.q9qhvxwugU/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/lib
1022.96 s
[algebraic-graphs] Using Parsec parser
1022.96 s
[algebraic-graphs] Configuring algebraic-graphs-0.7...
1022.96 s
[attoparsec] [ 6 of 16] Compiling Data.Attoparsec.Combinator ( Data/Attoparsec/Combinator.hs, dist/build/Data/Attoparsec/Combinator.p_o )
1022.96 s
[attoparsec]
1022.96 s
[attoparsec] Data/Attoparsec/Combinator.hs:46:46: warning : [ GHC-38856 ] [ -Wunused-imports ]
1022.96 s
[attoparsec] The import of ‘liftA2’
1022.96 s
[attoparsec] from module ‘Control.Applicative’ is redundant
1022.96 s
[attoparsec] |
1022.96 s
[attoparsec] 46 | import Control.Applicative (Alternative(..), liftA2 , many, (<|>))
1022.96 s
[attoparsec] | ^^^^^^
1022.96 s
[attoparsec] [ 7 of 16] Compiling Data.Attoparsec.Text.Internal ( Data/Attoparsec/Text/Internal.hs, dist/build/Data/Attoparsec/Text/Internal.p_o )
1022.96 s
[attoparsec]
1022.96 s
[attoparsec] Data/Attoparsec/Text/Internal.hs:68:1: warning : [ GHC-38856 ] [ -Wunused-imports ]
1022.96 s
[attoparsec] The import of ‘*>, <$>, pure’
1022.96 s
[attoparsec] from module ‘Control.Applicative’ is redundant
1022.96 s
[attoparsec] |
1022.96 s
[attoparsec] 68 | import Control.Applicative ((<|>), (<$>), pure, (*>))
1022.96 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1022.96 s
[attoparsec]
1022.96 s
[attoparsec] Data/Attoparsec/Text/Internal.hs:91:13: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1022.96 s
[attoparsec] The use of ‘~’ without TypeOperators
1022.96 s
[attoparsec] will become an error in a future GHC release.
1022.96 s
[attoparsec] Suggested fix: Perhaps you intended to use TypeOperators
1022.96 s
[attoparsec] |
1022.96 s
[attoparsec] 91 | instance (a ~ Text) => IsString (Parser a) where
1022.96 s
[attoparsec] | ^
1022.96 s
[attoparsec] [ 8 of 16] Compiling Data.Attoparsec.Text ( Data/Attoparsec/Text.hs, dist/build/Data/Attoparsec/Text.p_o )
1022.96 s
[filepattern] setupCompileFlags: -package-db=/build/tmp.uAxECplKyf/setup-package.conf.d -threaded
1022.96 s
[filepattern] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.uAxECplKyf/Main.o )
1022.96 s
[filepattern] [2 of 2] Linking Setup
1022.96 s
[filepattern] Phase: updateAutotoolsGnuConfigScriptsPhase
1022.96 s
[filepattern] Phase: configurePhase
1022.96 s
[filepattern] configureFlags: --verbose --prefix=/nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/bkgqmf9jag7h58rl8kggmacjhn9xbrrx-filepattern-0.1.3-doc/share/doc/filepattern-0.1.3 --with-gcc=gcc --package-db=/build/tmp.uAxECplKyf/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1022.96 s
[filepattern] Using Parsec parser
1022.96 s
[filepattern] Configuring filepattern-0.1.3...
1022.96 s
[ghc-exactprint] Phase: unpackPhase
1022.96 s
[ghc-exactprint] unpacking source archive /nix/store/fxby5vqqbw78g9y3izs0n9ahbmkxjzka-ghc-exactprint-1.8.0.0.tar.gz
1022.96 s
[ghc-exactprint] source root is ghc-exactprint-1.8.0.0
1022.96 s
[ghc-exactprint] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "ghc-exactprint-1.8.0.0/tests/Test/Transform.hs"
1022.96 s
[ghc-exactprint] Phase: patchPhase
1022.96 s
[ghc-exactprint] Phase: compileBuildDriverPhase
1022.96 s
[ghc-exactprint] setupCompileFlags: -package-db=/build/tmp.Kw5L1UvquM/setup-package.conf.d -threaded
1022.96 s
[ghc-exactprint] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.Kw5L1UvquM/Main.o )
1022.97 s
[ghc-exactprint] [2 of 2] Linking Setup
1022.97 s
[ghc-lib-parser-ex] Phase: unpackPhase
1022.97 s
[ghc-lib-parser-ex] unpacking source archive /nix/store/f41i39gym0x5wga5csmy0mzayc3xyq3q-ghc-lib-parser-ex-9.8.0.2.tar.gz
1022.97 s
[ghc-lib-parser-ex] source root is ghc-lib-parser-ex-9.8.0.2
1022.97 s
[ghc-lib-parser-ex] setting SOURCE_DATE_EPOCH to timestamp 1709089758 of file "ghc-lib-parser-ex-9.8.0.2/test/Test.hs"
1022.97 s
[ghc-lib-parser-ex] Phase: patchPhase
1022.97 s
[ghc-lib-parser-ex] Phase: compileBuildDriverPhase
1022.97 s
[ghc-lib-parser-ex] setupCompileFlags: -package-db=/build/tmp.46r6rilGKm/setup-package.conf.d -threaded
1022.97 s
[ghc-lib-parser-ex] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.46r6rilGKm/Main.o )
1022.97 s
[ghc-lib-parser-ex] [2 of 2] Linking Setup
1022.97 s
[keys] Phase: setupCompilerEnvironmentPhase
1022.97 s
[keys] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1022.97 s
[keys] Phase: unpackPhase
1022.97 s
[keys] unpacking source archive /nix/store/bsnsdqd5m5adc2xc23ia110lmh7ry4jf-keys-3.12.4.tar.gz
1022.97 s
[keys] source root is keys-3.12.4
1022.97 s
[keys] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "keys-3.12.4/src/Data/Key.hs"
1022.97 s
[keys] Phase: patchPhase
1022.97 s
[keys] Replace Cabal file with edited version from mirror://hackage/keys-3.12.4/revision/1.cabal.
1022.97 s
[keys] Phase: compileBuildDriverPhase
1022.97 s
[keys] setupCompileFlags: -package-db=/build/tmp.kfTlClgR2s/setup-package.conf.d -threaded
1022.97 s
[keys] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.kfTlClgR2s/Main.o )
1022.97 s
[keys] [2 of 2] Linking Setup
1022.97 s
[semialign] stripping (with command strip and flags -S -p) in /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1/lib
1022.97 s
[semialign] shrinking RPATHs of ELF executables and libraries in /nix/store/080qjbwjddblbcpbbf6l3i53hph2rk60-semialign-1.3.1-doc
1022.97 s
[semialign] checking for references to /build/ in /nix/store/080qjbwjddblbcpbbf6l3i53hph2rk60-semialign-1.3.1-doc...
1022.97 s
[semialign] patching script interpreter paths in /nix/store/080qjbwjddblbcpbbf6l3i53hph2rk60-semialign-1.3.1-doc
1022.97 s
[unix-compat] Phase: setupCompilerEnvironmentPhase
1022.97 s
[unix-compat] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1022.97 s
[unix-compat] Phase: unpackPhase
1022.97 s
[unix-compat] unpacking source archive /nix/store/sxajf6wmraplp7fmlb1571k2xcha606c-unix-compat-0.7.4.tar.gz
1022.97 s
[unix-compat] source root is unix-compat-0.7.4
1022.97 s
[unix-compat] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unix-compat-0.7.4/unix-compat.cabal"
1022.97 s
[unix-compat] Phase: patchPhase
1022.97 s
[unix-compat] Phase: compileBuildDriverPhase
1022.97 s
[unix-compat] setupCompileFlags: -package-db=/build/tmp.Cq28BQpogg/setup-package.conf.d -threaded
1022.97 s
[unix-compat] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.Cq28BQpogg/Main.o )
1022.97 s
[unix-compat] [2 of 2] Linking Setup
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] identity: OK
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] composition: OK
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] Vector
1022.97 s
[witherable] default wither: OK (0.02s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] default witherM: OK (0.02s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] default filterA: OK (0.03s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] identity: OK (0.02s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] composition: OK (0.09s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] Seq
1022.97 s
[witherable] default wither: OK (0.03s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] default witherM: OK (0.02s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] default filterA: OK (0.03s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] identity: OK (0.03s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] composition: OK (0.05s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] IntMap
1022.97 s
[witherable] default wither: OK (0.02s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] default witherM: OK (0.02s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] default filterA: OK (0.01s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] identity: OK (0.01s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] composition: OK (0.03s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] Map K
1022.97 s
[witherable] default wither: OK (0.01s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] default witherM: OK (0.03s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] default filterA: OK (0.03s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] identity: OK (0.02s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] composition: OK (0.04s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] HashMap K
1022.97 s
[witherable] default wither: OK (0.02s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] default witherM: OK (0.02s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] default filterA: OK (0.02s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] identity: OK (0.02s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] composition: OK (0.05s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] nub
1022.97 s
[witherable] ordNub: OK
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] ordNubOn: OK (0.09s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] hashNub: OK
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] hashNubOn: OK (0.07s)
1022.97 s
[witherable] +++ OK, passed 100 tests.
1022.97 s
[witherable] ordNub is lazy: OK
1022.97 s
[witherable] +++ OK, passed 1 test.
1022.97 s
[witherable] hashNub is lazy: OK
1022.97 s
[witherable] +++ OK, passed 1 test.
1022.97 s
[witherable]
1022.97 s
[witherable] All 91 tests passed (1.23s)
1022.97 s
[witherable] Test suite witherable-tests: PASS
1022.97 s
[witherable] Test suite logged to: dist/test/witherable-0.5-witherable-tests.log
1022.97 s
[witherable] 1 of 1 test suites (1 of 1 test cases) passed.
1022.97 s
[witherable] Phase: haddockPhase
1022.97 s
[witherable] Preprocessing library for witherable-0.5..
1022.97 s
[witherable] Running Haddock on library for witherable-0.5..
1022.97 s
[witherable] Warning: The documentation for the following packages are not installed. No
1022.97 s
[witherable] links will be generated to these packages: vector-0.13.2.0
1022.97 s
[witherable] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1022.97 s
[witherable] [1 of 1] Compiling Witherable ( src/Witherable.hs, nothing )
1022.97 s
[witherable] Haddock coverage:
1022.97 s
[witherable] Warning: 'imapMaybe' is ambiguous. It is defined
1022.97 s
[witherable] * in ‘Data.Vector’
1022.97 s
[witherable] * at src/Witherable.hs:495:3
1022.97 s
[witherable] You may be able to disambiguate the identifier by qualifying it or
1022.97 s
[witherable] by specifying the type/value namespace explicitly.
1022.97 s
[witherable] Defaulting to the one defined at src/Witherable.hs:495:3
1022.97 s
[witherable] Warning: 'filter' is ambiguous. It is defined
1022.97 s
[witherable] * in ‘GHC.List’
1022.97 s
[witherable] * in ‘Data.IntMap.Internal’
1022.97 s
[witherable] * in ‘Data.Map.Internal’
1022.97 s
[witherable] * in ‘Data.Sequence.Internal’
1022.97 s
[witherable] * in ‘Data.Set.Internal’
1022.97 s
[witherable] * in ‘Data.HashMap.Internal’
1022.97 s
[witherable] * in ‘Data.HashSet.Internal’
1022.97 s
[witherable] * in ‘Data.Vector’
1022.97 s
[witherable] * at src/Witherable.hs:100:3
1022.97 s
[witherable] You may be able to disambiguate the identifier by qualifying it or
1022.97 s
[witherable] by specifying the type/value namespace explicitly.
1022.97 s
[witherable] Defaulting to the one defined at src/Witherable.hs:100:3
1022.97 s
[witherable] Warning: 'ifilter' is ambiguous. It is defined
1022.98 s
[witherable] * in ‘Data.Vector’
1022.98 s
[witherable] * at src/Witherable.hs:500:3
1022.98 s
[witherable] You may be able to disambiguate the identifier by qualifying it or
1022.98 s
[witherable] by specifying the type/value namespace explicitly.
1022.98 s
[witherable] Defaulting to the one defined at src/Witherable.hs:500:3
1023.25 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/080qjbwjddblbcpbbf6l3i53hph2rk60-semialign-1.3.1-doc /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1
1024.26 s
[post-build-hook] Pushing 2 paths (126 are already present) using zstd to cache sellout ⏳
1024.26 s
[post-build-hook]
1024.61 s
[post-build-hook] Pushing /nix/store/080qjbwjddblbcpbbf6l3i53hph2rk60-semialign-1.3.1-doc (1.33 MiB)
1024.71 s
[post-build-hook] Pushing /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1 (3.71 MiB)
1025.68 s
[post-build-hook]
1025.68 s
[post-build-hook] All done.
1025.78 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/080qjbwjddblbcpbbf6l3i53hph2rk60-semialign-1.3.1-doc /nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1
1026.16 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1026.58 s
[post-build-hook] copying 2 paths...
1026.58 s
[post-build-hook] copying path '/nix/store/080qjbwjddblbcpbbf6l3i53hph2rk60-semialign-1.3.1-doc' to 'https://cache.nix-ci.com'...
1027.07 s
[post-build-hook] copying path '/nix/store/rcb905wwz6yf8kp2np49bmnlbk0ndy45-semialign-1.3.1' to 'https://cache.nix-ci.com'...
1030.33 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1031.04 s
[post-build-hook] copying 1 paths...
1031.05 s
[post-build-hook] copying path '/nix/store/xb53r27v1qks30p6j6ck1nvr36z3556n-semialign-1.3.1.drv' to 'https://cache.nix-ci.com'...
1031.45 s
Progress: 80 of 171 built (12 building), 395 of 395 downloaded from cache
1031.45 s
[witherable] Warning: 'Compose' is ambiguous. It is defined
1031.45 s
[witherable] * in ‘Data.Functor.Compose’
1031.45 s
[witherable] * in ‘Data.Functor.Compose’
1031.45 s
[witherable] You may be able to disambiguate the identifier by qualifying it or
1031.45 s
[witherable] by specifying the type/value namespace explicitly.
1031.45 s
[witherable] Defaulting to the one defined in ‘Data.Functor.Compose’
1031.45 s
[witherable] Warning: 'mapMaybe' is ambiguous. It is defined
1031.45 s
[witherable] * in ‘Data.Maybe’
1031.46 s
[witherable] * in ‘Data.IntMap.Internal’
1031.46 s
[witherable] * in ‘Data.Map.Internal’
1031.46 s
[witherable] * in ‘Data.HashMap.Internal’
1031.46 s
[witherable] * in ‘Data.Vector’
1031.46 s
[witherable] * at src/Witherable.hs:90:3
1031.46 s
[witherable] You may be able to disambiguate the identifier by qualifying it or
1031.46 s
[witherable] by specifying the type/value namespace explicitly.
1031.46 s
[witherable] Defaulting to the one defined at src/Witherable.hs:90:3
1031.46 s
[witherable] Warning: 'catMaybes' is ambiguous. It is defined
1031.46 s
[witherable] * in ‘Data.Maybe’
1031.46 s
[witherable] * in ‘Data.Vector’
1031.46 s
[witherable] * at src/Witherable.hs:95:3
1031.46 s
[witherable] You may be able to disambiguate the identifier by qualifying it or
1031.46 s
[witherable] by specifying the type/value namespace explicitly.
1031.46 s
[witherable] Defaulting to the one defined at src/Witherable.hs:95:3
1031.46 s
[witherable] 93% ( 14 / 15) in 'Witherable'
1031.46 s
[witherable] Missing documentation for:
1031.46 s
[witherable] WrappedFoldable (src/Witherable.hs:733)
1031.46 s
[witherable] Warning: Witherable: could not find link destinations for:
1031.46 s
[witherable] - Data.Vector.Vector
1031.46 s
[witherable] Documentation created: dist/doc/html/witherable/,
1031.46 s
[witherable] dist/doc/html/witherable/witherable.txt
1031.46 s
[witherable] Preprocessing test suite 'witherable-tests' for witherable-0.5..
1031.46 s
[witherable] Phase: installPhase
1031.46 s
[witherable] Installing library in /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/witherable-0.5-7zG28educK73JEyXcpqX0
1031.46 s
[witherable] Phase: fixupPhase
1031.46 s
[witherable] shrinking RPATHs of ELF executables and libraries in /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5
1031.46 s
[witherable] shrinking /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSwitherable-0.5-7zG28educK73JEyXcpqX0-ghc9.8.1.so
1031.46 s
[witherable] checking for references to /build/ in /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5...
1031.46 s
[witherable] patching script interpreter paths in /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5
1031.46 s
[witherable] stripping (with command strip and flags -S -p) in /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5/lib
1031.46 s
[witherable] shrinking RPATHs of ELF executables and libraries in /nix/store/nj85ibdbnyzg3snfq2pn4py3xhnlkl03-witherable-0.5-doc
1031.46 s
[witherable] checking for references to /build/ in /nix/store/nj85ibdbnyzg3snfq2pn4py3xhnlkl03-witherable-0.5-doc...
1031.46 s
[witherable] patching script interpreter paths in /nix/store/nj85ibdbnyzg3snfq2pn4py3xhnlkl03-witherable-0.5-doc
1031.46 s
[adjunctions] Phase: updateAutotoolsGnuConfigScriptsPhase
1031.46 s
[adjunctions] Phase: configurePhase
1031.46 s
[adjunctions] configureFlags: --verbose --prefix=/nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/bdg0d6qcw4p478b2jdglcwv7lr7g7qwr-adjunctions-4.4.3-doc/share/doc/adjunctions-4.4.3 --with-gcc=gcc --package-db=/build/tmp.mB3IOpglcn/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1031.46 s
[adjunctions] Using Parsec parser
1031.46 s
[adjunctions] Configuring adjunctions-4.4.3...
1031.46 s
[adjunctions] Dependency array >=0.3.0.2 && <0.7: using array-0.5.6.0
1031.46 s
[adjunctions] Dependency base >=4.9 && <5: using base-4.19.0.0
1031.46 s
[adjunctions] Dependency comonad >=4 && <6: using comonad-5.0.9
1031.46 s
[adjunctions] Dependency containers >=0.3 && <0.9: using containers-0.6.8
1031.46 s
[adjunctions] Dependency contravariant >=1 && <2: using contravariant-1.5.5
1031.46 s
[adjunctions] Dependency distributive >=0.5.1 && <1: using distributive-0.6.2.1
1031.46 s
[adjunctions] Dependency free >=4 && <6: using free-5.2
1031.46 s
[adjunctions] Dependency mtl >=2.0.1 && <2.4: using mtl-2.3.1
1031.46 s
[adjunctions] Dependency profunctors >=4 && <6: using profunctors-5.6.2
1031.46 s
[adjunctions] Dependency semigroupoids >=4 && <7: using semigroupoids-6.0.1
1031.46 s
[adjunctions] Dependency semigroups >=0.11 && <1: using semigroups-0.20
1031.46 s
[adjunctions] Dependency tagged >=0.7 && <1: using tagged-0.8.8
1031.46 s
[adjunctions] Dependency transformers >=0.5.2 && <0.7: using transformers-0.6.1.0
1031.46 s
[adjunctions] Dependency transformers-compat >=0.3 && <1: using transformers-compat-0.7.2
1031.46 s
[adjunctions] Dependency void >=0.5.5.1 && <1: using void-0.7.3
1031.46 s
[adjunctions] Dependency adjunctions: using adjunctions-4.4.3
1031.46 s
[adjunctions] Dependency base >=4 && <5: using base-4.19.0.0
1031.46 s
[adjunctions] Dependency distributive >=0.5.1 && <1: using distributive-0.6.2.1
1031.46 s
[adjunctions] Dependency hspec >=2 && <3: using hspec-2.11.12
1031.46 s
[adjunctions] Source component graph:
1031.46 s
[adjunctions] component lib
1031.46 s
[adjunctions] component test:spec dependency lib
1031.46 s
[adjunctions] Configured component graph:
1031.46 s
[adjunctions] component adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr
1031.46 s
[adjunctions] include array-0.5.6.0-dc89
1031.46 s
[adjunctions] include base-4.19.0.0-b960
1031.46 s
[adjunctions] include comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1031.46 s
[adjunctions] include containers-0.6.8-4775
1031.46 s
[adjunctions] include contravariant-1.5.5-J4LLuUnbnVaBzsIx42BlgS
1031.46 s
[adjunctions] include distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
1031.46 s
[adjunctions] include free-5.2-5jsicnVtm8y8KG9LMRezMp
1031.46 s
[adjunctions] include mtl-2.3.1-63a4
1031.46 s
[adjunctions] include profunctors-5.6.2-3nAHQARBXS12MCzIa3BzsU
1031.46 s
[adjunctions] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1031.46 s
[adjunctions] include semigroups-0.20-HSrvnib71V92veEQkXQjs8
1031.46 s
[adjunctions] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1031.46 s
[adjunctions] include transformers-0.6.1.0-c3ec
1031.46 s
[adjunctions] include transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
1031.46 s
[adjunctions] include void-0.7.3-5yU89rtcFpHDt8FMuiMLJt
1031.46 s
[adjunctions] component adjunctions-4.4.3-8fUAWBy6uVd3zdD6rfHW7M-spec
1031.46 s
[adjunctions] include adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr
1031.46 s
[adjunctions] include base-4.19.0.0-b960
1031.46 s
[adjunctions] include distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
1031.46 s
[adjunctions] include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
1031.46 s
[adjunctions] Linked component graph:
1031.46 s
[adjunctions] unit adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr
1031.47 s
[adjunctions] include array-0.5.6.0-dc89
1031.47 s
[adjunctions] include base-4.19.0.0-b960
1031.47 s
[adjunctions] include comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1031.47 s
[adjunctions] include containers-0.6.8-4775
1031.47 s
[adjunctions] include contravariant-1.5.5-J4LLuUnbnVaBzsIx42BlgS
1031.47 s
[adjunctions] include distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
1031.47 s
[adjunctions] include free-5.2-5jsicnVtm8y8KG9LMRezMp
1031.47 s
[adjunctions] include mtl-2.3.1-63a4
1031.47 s
[adjunctions] include profunctors-5.6.2-3nAHQARBXS12MCzIa3BzsU
1031.47 s
[algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.6.0
1031.47 s
[algebraic-graphs] Dependency base >=4.11 && <5: using base-4.19.0.0
1031.47 s
[algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
1031.47 s
[algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
1031.47 s
[algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
1031.47 s
[algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.14.3
1031.47 s
[algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
1031.47 s
[algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.6.0
1031.47 s
[algebraic-graphs] Dependency base >=4.11 && <5: using base-4.19.0.0
1031.47 s
[algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
1031.47 s
[algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
1031.47 s
[algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.7.16
1031.47 s
[algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.6: using
1031.47 s
[algebraic-graphs] inspection-testing-0.5.0.3
1031.47 s
[algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
1031.47 s
[algebraic-graphs] Source component graph:
1031.47 s
[algebraic-graphs] component lib
1031.47 s
[algebraic-graphs] component test:main dependency lib
1031.47 s
[algebraic-graphs] Configured component graph:
1031.47 s
[algebraic-graphs] component algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
1031.47 s
[algebraic-graphs] include array-0.5.6.0-dc89
1031.47 s
[algebraic-graphs] include base-4.19.0.0-b960
1031.47 s
[algebraic-graphs] include containers-0.6.8-4775
1031.47 s
[algebraic-graphs] include deepseq-1.5.0.0-412f
1031.47 s
[algebraic-graphs] include transformers-0.6.1.0-c3ec
1031.47 s
[algebraic-graphs] component algebraic-graphs-0.7-5OeXbbSnUqFIvHqlCjxIaZ-main
1031.47 s
[algebraic-graphs] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1031.47 s
[algebraic-graphs] include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
1031.47 s
[algebraic-graphs] include array-0.5.6.0-dc89
1031.47 s
[algebraic-graphs] include base-4.19.0.0-b960
1031.47 s
[algebraic-graphs] include containers-0.6.8-4775
1031.47 s
[algebraic-graphs] include deepseq-1.5.0.0-412f
1031.47 s
[algebraic-graphs] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1031.47 s
[algebraic-graphs] include inspection-testing-0.5.0.3-F5Uf2o8NuFA3RymCMAjQM3
1031.47 s
[algebraic-graphs] include transformers-0.6.1.0-c3ec
1031.47 s
[algebraic-graphs] Linked component graph:
1031.47 s
[algebraic-graphs] unit algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
1031.47 s
[algebraic-graphs] include array-0.5.6.0-dc89
1031.47 s
[algebraic-graphs] include base-4.19.0.0-b960
1031.47 s
[algebraic-graphs] include containers-0.6.8-4775
1031.47 s
[algebraic-graphs] include deepseq-1.5.0.0-412f
1031.47 s
[algebraic-graphs] include transformers-0.6.1.0-c3ec
1031.47 s
[filepattern] Dependency base >=4 && <5: using base-4.19.0.0
1031.47 s
[filepattern] Dependency directory: using directory-1.3.8.1
1031.47 s
[filepattern] Dependency extra >=1.6.2: using extra-1.7.16
1031.47 s
[filepattern] Dependency filepath: using filepath-1.4.100.4
1031.47 s
[filepattern] Dependency QuickCheck >=2.0: using QuickCheck-2.14.3
1031.47 s
[filepattern] Dependency base >=4 && <5: using base-4.19.0.0
1031.47 s
[filepattern] Dependency directory: using directory-1.3.8.1
1031.47 s
[filepattern] Dependency extra: using extra-1.7.16
1031.47 s
[filepattern] Dependency filepath: using filepath-1.4.100.4
1031.47 s
[filepattern] Dependency filepattern: using filepattern-0.1.3
1031.47 s
[filepattern] Source component graph:
1031.47 s
[filepattern] component lib
1031.47 s
[filepattern] component test:filepattern-test dependency lib
1031.47 s
[filepattern] Configured component graph:
1031.47 s
[filepattern] component filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d
1031.47 s
[filepattern] include base-4.19.0.0-b960
1031.47 s
[filepattern] include directory-1.3.8.1-6a8e
1031.47 s
[filepattern] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1031.47 s
[filepattern] include filepath-1.4.100.4-fa1c
1031.47 s
[filepattern] component filepattern-0.1.3-C7HNEoLzNsxnw2uSRfNve-filepattern-test
1031.47 s
[filepattern] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1031.47 s
[filepattern] include base-4.19.0.0-b960
1031.47 s
[filepattern] include directory-1.3.8.1-6a8e
1031.47 s
[filepattern] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1031.47 s
[filepattern] include filepath-1.4.100.4-fa1c
1031.47 s
[filepattern] include filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d
1031.47 s
[filepattern] Linked component graph:
1031.47 s
[filepattern] unit filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d
1031.47 s
[filepattern] include base-4.19.0.0-b960
1031.47 s
[filepattern] include directory-1.3.8.1-6a8e
1031.47 s
[filepattern] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1031.47 s
[filepattern] include filepath-1.4.100.4-fa1c
1031.47 s
[filepattern] System.FilePattern=filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d:System.FilePattern,System.FilePattern.Directory=filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d:System.FilePattern.Directory
1031.47 s
[filepattern] unit filepattern-0.1.3-C7HNEoLzNsxnw2uSRfNve-filepattern-test
1031.48 s
[filepattern] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1031.48 s
[filepattern] include base-4.19.0.0-b960
1031.48 s
[filepattern] include directory-1.3.8.1-6a8e
1031.48 s
[filepattern] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1031.48 s
[filepattern] include filepath-1.4.100.4-fa1c
1031.48 s
[filepattern] include filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d
1031.48 s
[filepattern] Ready component graph:
1031.48 s
[filepattern] definite filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d
1031.48 s
[filepattern] depends base-4.19.0.0-b960
1031.48 s
[filepattern] depends directory-1.3.8.1-6a8e
1031.48 s
[filepattern] depends extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1031.48 s
[filepattern] depends filepath-1.4.100.4-fa1c
1031.48 s
[filepattern] definite filepattern-0.1.3-C7HNEoLzNsxnw2uSRfNve-filepattern-test
1031.48 s
[filepattern] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1031.48 s
[filepattern] depends base-4.19.0.0-b960
1031.48 s
[filepattern] depends directory-1.3.8.1-6a8e
1031.48 s
[filepattern] depends extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1031.48 s
[filepattern] depends filepath-1.4.100.4-fa1c
1031.48 s
[filepattern] depends filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d
1031.48 s
[filepattern] Using Cabal-3.10.2.0 compiled by ghc-9.8
1031.48 s
[filepattern] Using compiler: ghc-9.8.1
1031.48 s
[filepattern] Using install prefix:
1031.48 s
[filepattern] /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3
1031.48 s
[filepattern] Executables installed in:
1031.48 s
[filepattern] /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3/bin
1031.48 s
[filepattern] Libraries installed in:
1031.48 s
[filepattern] /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d
1031.48 s
[filepattern] Dynamic Libraries installed in:
1031.48 s
[filepattern] /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1031.48 s
[filepattern] Private executables installed in:
1031.48 s
[filepattern] /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3/libexec/x86_64-linux-ghc-9.8.1/filepattern-0.1.3
1031.48 s
[filepattern] Data files installed in:
1031.48 s
[filepattern] /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3/share/x86_64-linux-ghc-9.8.1/filepattern-0.1.3
1031.48 s
[filepattern] Documentation installed in:
1031.48 s
[filepattern] /nix/store/bkgqmf9jag7h58rl8kggmacjhn9xbrrx-filepattern-0.1.3-doc/share/doc/filepattern-0.1.3
1031.48 s
[filepattern] Configuration files installed in:
1031.48 s
[filepattern] /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3/etc
1031.48 s
[filepattern] No alex found
1031.48 s
[filepattern] Using ar found on system at:
1031.48 s
[filepattern] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1031.48 s
[filepattern] No c2hs found
1031.48 s
[filepattern] No cpphs found
1031.48 s
[filepattern] No doctest found
1031.48 s
[filepattern] Using gcc version 14.3.0 given by user at:
1031.48 s
[filepattern] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1031.48 s
[filepattern] Using ghc version 9.8.1 found on system at:
1031.48 s
[filepattern] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1031.48 s
[filepattern] Using ghc-pkg version 9.8.1 found on system at:
1031.48 s
[filepattern] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1031.48 s
[filepattern] No ghcjs found
1031.48 s
[ghc-exactprint] Phase: updateAutotoolsGnuConfigScriptsPhase
1031.48 s
[ghc-exactprint] Phase: configurePhase
1031.48 s
[ghc-exactprint] configureFlags: --verbose --prefix=/nix/store/0gihdd6x1zsqkgkzxg8zyfshm5i8xpa8-ghc-exactprint-1.8.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/71miwyql5wd2ni8rilshlxahbx46raj8-ghc-exactprint-1.8.0.0-doc/share/doc/ghc-exactprint-1.8.0.0 --with-gcc=gcc --package-db=/build/tmp.Kw5L1UvquM/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/lib
1031.48 s
[ghc-exactprint] Using Parsec parser
1031.48 s
[ghc-exactprint] Configuring ghc-exactprint-1.8.0.0...
1031.48 s
[ghc-exactprint] Flags chosen: dev=False, roundtrip=False
1031.48 s
[ghc-exactprint] Dependency base >=4.19 && <4.20: using base-4.19.0.0
1031.48 s
[ghc-exactprint] Dependency bytestring >=0.10.6: using bytestring-0.12.0.2
1031.48 s
[ghc-exactprint] Dependency containers >=0.5: using containers-0.6.8
1031.48 s
[ghc-exactprint] Dependency data-default: using data-default-0.7.1.3
1031.48 s
[ghc-exactprint] Dependency directory >=1.2: using directory-1.3.8.1
1031.48 s
[ghc-exactprint] Dependency filepath >=1.4: using filepath-1.4.100.4
1031.48 s
[ghc-exactprint] Dependency free >=4.12: using free-5.2
1031.48 s
[ghc-exactprint] Dependency ghc >=9.8.1: using ghc-9.8.1
1031.48 s
[ghc-exactprint] Dependency ghc-boot: using ghc-boot-9.8.1
1031.48 s
[ghc-exactprint] Dependency mtl >=2.2.1: using mtl-2.3.1
1031.49 s
[ghc-exactprint] Dependency ordered-containers: using ordered-containers-0.2.4
1031.49 s
[ghc-exactprint] Dependency syb >=0.5: using syb-0.7.2.4
1031.49 s
[ghc-exactprint] Dependency Cabal-syntax: using Cabal-syntax-3.10.3.0
1031.49 s
[ghc-exactprint] Dependency Diff: using Diff-0.5
1031.49 s
[ghc-exactprint] Dependency HUnit >=1.2: using HUnit-1.6.2.0
1031.49 s
[ghc-exactprint] Dependency base <4.20: using base-4.19.0.0
1031.49 s
[ghc-exactprint] Dependency bytestring: using bytestring-0.12.0.2
1031.49 s
[ghc-exactprint] Dependency containers >=0.5: using containers-0.6.8
1031.49 s
[ghc-exactprint] Dependency data-default: using data-default-0.7.1.3
1031.49 s
[ghc-exactprint] Dependency directory >=1.2: using directory-1.3.8.1
1031.49 s
[ghc-exactprint] Dependency extra: using extra-1.7.16
1031.49 s
[ghc-exactprint] Dependency filepath >=1.4: using filepath-1.4.100.4
1031.49 s
[ghc-exactprint] Dependency ghc >=9.8.1: using ghc-9.8.1
1031.49 s
[ghc-exactprint] Dependency ghc-boot: using ghc-boot-9.8.1
1031.49 s
[ghc-exactprint] Dependency ghc-exactprint: using ghc-exactprint-1.8.0.0
1031.49 s
[ghc-exactprint] Dependency ghc-paths >=0.1: using ghc-paths-0.1.0.12
1031.49 s
[ghc-exactprint] Dependency mtl >=2.2.1: using mtl-2.3.1
1031.49 s
[ghc-exactprint] Dependency ordered-containers: using ordered-containers-0.2.4
1031.49 s
[ghc-exactprint] Dependency silently >=1.2: using silently-1.2.5.4
1031.49 s
[ghc-exactprint] Dependency syb >=0.5: using syb-0.7.2.4
1031.49 s
[ghc-exactprint] Source component graph:
1031.49 s
[ghc-exactprint] component lib
1031.49 s
[ghc-exactprint] component test:test dependency lib
1031.49 s
[ghc-exactprint] Configured component graph:
1031.49 s
[ghc-exactprint] component ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe
1031.49 s
[ghc-exactprint] include base-4.19.0.0-b960
1031.49 s
[ghc-exactprint] include bytestring-0.12.0.2-4690
1031.49 s
[ghc-exactprint] include containers-0.6.8-4775
1031.49 s
[ghc-exactprint] include data-default-0.7.1.3-2DC1QaEMC8oIg9ubW4Htvy
1031.49 s
[ghc-exactprint] include directory-1.3.8.1-6a8e
1031.49 s
[ghc-exactprint] include filepath-1.4.100.4-fa1c
1031.49 s
[ghc-exactprint] include free-5.2-5jsicnVtm8y8KG9LMRezMp
1031.49 s
[ghc-exactprint] include ghc-9.8.1-f1e9
1031.49 s
[ghc-exactprint] include ghc-boot-9.8.1-d7dd
1031.49 s
[ghc-exactprint] include mtl-2.3.1-63a4
1031.49 s
[ghc-exactprint] include ordered-containers-0.2.4-Ene2my0ZxDoJ5DMj7wTwY3
1031.49 s
[ghc-exactprint] include syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
1031.49 s
[ghc-exactprint] component ghc-exactprint-1.8.0.0-89agjVFEAuDed1GOfaWmy-test
1031.49 s
[ghc-exactprint] include Cabal-syntax-3.10.3.0-JJItMyRxq4YH93ghH3PX25
1031.49 s
[ghc-exactprint] include Diff-0.5-4nPoK53PkizD5e0dTbCPv7
1031.49 s
[ghc-exactprint] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1031.49 s
[ghc-exactprint] include base-4.19.0.0-b960
1031.49 s
[ghc-exactprint] include bytestring-0.12.0.2-4690
1031.49 s
[ghc-exactprint] include containers-0.6.8-4775
1031.49 s
[ghc-exactprint] include data-default-0.7.1.3-2DC1QaEMC8oIg9ubW4Htvy
1031.49 s
[ghc-exactprint] include directory-1.3.8.1-6a8e
1031.49 s
[ghc-exactprint] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1031.49 s
[ghc-lib-parser-ex] Phase: updateAutotoolsGnuConfigScriptsPhase
1031.49 s
[ghc-lib-parser-ex] Phase: configurePhase
1031.49 s
[ghc-lib-parser-ex] configureFlags: --verbose --prefix=/nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/xyiz5m8cd715vsb5ik7birf0zklz4rj4-ghc-lib-parser-ex-9.8.0.2-doc/share/doc/ghc-lib-parser-ex-9.8.0.2 --with-gcc=gcc --package-db=/build/tmp.46r6rilGKm/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock -f-auto --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1031.49 s
[ghc-lib-parser-ex] Using Parsec parser
1031.49 s
[ghc-lib-parser-ex] Configuring ghc-lib-parser-ex-9.8.0.2...
1031.49 s
[ghc-lib-parser-ex] Flags chosen: auto=False, no-ghc-lib=False
1031.49 s
[ghc-lib-parser-ex] Dependency base >=4.7 && <5: using base-4.19.0.0
1031.49 s
[ghc-lib-parser-ex] Dependency bytestring >=0.10.8.2: using bytestring-0.12.0.2
1031.49 s
[ghc-lib-parser-ex] Dependency containers >=0.5.8.1: using containers-0.6.8
1031.49 s
[ghc-lib-parser-ex] Dependency ghc-lib-parser >=9.8 && <9.9: using ghc-lib-parser-9.8.5.20250214
1031.49 s
[ghc-lib-parser-ex] Dependency uniplate >=1.5: using uniplate-1.6.13
1031.49 s
[ghc-lib-parser-ex] Dependency base >=4.7 && <5: using base-4.19.0.0
1031.49 s
[ghc-lib-parser-ex] Dependency directory >=1.3.3: using directory-1.3.8.1
1031.49 s
[ghc-lib-parser-ex] Dependency extra >=1.6: using extra-1.7.16
1031.49 s
[ghc-lib-parser-ex] Dependency filepath >=1.4.2: using filepath-1.4.100.4
1031.49 s
[ghc-lib-parser-ex] Dependency ghc-lib-parser >=9.8 && <9.9: using ghc-lib-parser-9.8.5.20250214
1031.49 s
[ghc-lib-parser-ex] Dependency ghc-lib-parser-ex: using ghc-lib-parser-ex-9.8.0.2
1031.49 s
[ghc-lib-parser-ex] Dependency tasty >=1.2: using tasty-1.5.3
1031.49 s
[ghc-lib-parser-ex] Dependency tasty-hunit >=0.10.0: using tasty-hunit-0.10.2
1031.49 s
[ghc-lib-parser-ex] Dependency uniplate >=1.6.12: using uniplate-1.6.13
1031.49 s
[ghc-lib-parser-ex] Source component graph:
1031.49 s
[ghc-lib-parser-ex] component lib
1031.49 s
[ghc-lib-parser-ex] component test:ghc-lib-parser-ex-test dependency lib
1031.49 s
[ghc-lib-parser-ex] Configured component graph:
1031.49 s
[ghc-lib-parser-ex] component ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d
1031.49 s
[ghc-lib-parser-ex] include base-4.19.0.0-b960
1031.49 s
[ghc-lib-parser-ex] include bytestring-0.12.0.2-4690
1031.49 s
[ghc-lib-parser-ex] include containers-0.6.8-4775
1031.49 s
[ghc-lib-parser-ex] include ghc-lib-parser-9.8.5.20250214-4drUxVHhKoGFUoOqornHDn
1031.49 s
[ghc-lib-parser-ex] include uniplate-1.6.13-FSZmfemPUb965irITYhfNI
1031.49 s
[ghc-lib-parser-ex] component ghc-lib-parser-ex-9.8.0.2-30E0q4CrJHM1oml7etNgE3-ghc-lib-parser-ex-test
1031.49 s
[ghc-lib-parser-ex] include base-4.19.0.0-b960
1031.49 s
[ghc-lib-parser-ex] include directory-1.3.8.1-6a8e
1031.49 s
[ghc-lib-parser-ex] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1031.49 s
[ghc-lib-parser-ex] include filepath-1.4.100.4-fa1c
1031.49 s
[ghc-lib-parser-ex] include ghc-lib-parser-9.8.5.20250214-4drUxVHhKoGFUoOqornHDn
1031.49 s
[ghc-lib-parser-ex] include ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d
1031.49 s
[ghc-lib-parser-ex] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1031.50 s
[ghc-lib-parser-ex] include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
1031.50 s
[ghc-lib-parser-ex] include uniplate-1.6.13-FSZmfemPUb965irITYhfNI
1031.50 s
[ghc-lib-parser-ex] Linked component graph:
1031.50 s
[ghc-lib-parser-ex] unit ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d
1031.50 s
[ghc-lib-parser-ex] include base-4.19.0.0-b960
1031.50 s
[ghc-lib-parser-ex] include bytestring-0.12.0.2-4690
1031.50 s
[ghc-lib-parser-ex] include containers-0.6.8-4775
1031.50 s
[ghc-lib-parser-ex] include ghc-lib-parser-9.8.5.20250214-4drUxVHhKoGFUoOqornHDn
1031.50 s
[ghc-lib-parser-ex] include uniplate-1.6.13-FSZmfemPUb965irITYhfNI
1031.50 s
[keys] Phase: updateAutotoolsGnuConfigScriptsPhase
1031.50 s
[keys] Phase: configurePhase
1031.50 s
[keys] configureFlags: --verbose --prefix=/nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/zvn09w2f3hwsy03yx28ln0pfl2y9154r-keys-3.12.4-doc/share/doc/keys-3.12.4 --with-gcc=gcc --package-db=/build/tmp.kfTlClgR2s/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1031.50 s
[keys] Using Parsec parser
1031.50 s
[keys] Configuring keys-3.12.4...
1031.50 s
[keys] Dependency array >=0.3.0.2 && <0.6: using array-0.5.6.0
1031.50 s
[keys] Dependency base >=4.9 && <5: using base-4.19.0.0
1031.50 s
[keys] Dependency comonad >=4 && <6: using comonad-5.0.9
1031.50 s
[keys] Dependency containers >=0.3 && <0.9: using containers-0.6.8
1031.50 s
[keys] Dependency free >=4 && <6: using free-5.2
1031.50 s
[keys] Dependency hashable >=1.1.2.3 && <1.6: using hashable-1.4.7.0
1031.50 s
[keys] Dependency semigroupoids >=5.2 && <7: using semigroupoids-6.0.1
1031.50 s
[keys] Dependency semigroups >=0.8.3.1 && <1: using semigroups-0.20
1031.50 s
[keys] Dependency tagged >=0.7.3 && <1: using tagged-0.8.8
1031.50 s
[keys] Dependency transformers >=0.2 && <0.7: using transformers-0.6.1.0
1031.50 s
[keys] Dependency transformers-compat >=0.3 && <1: using transformers-compat-0.7.2
1031.50 s
[keys] Dependency unordered-containers >=0.2.4 && <0.3: using
1031.50 s
[keys] unordered-containers-0.2.20
1031.50 s
[keys] Source component graph: component lib
1031.50 s
[keys] Configured component graph:
1031.50 s
[keys] component keys-3.12.4-9pIWSPQD3dgEmDN6rrDseM
1031.50 s
[keys] include array-0.5.6.0-dc89
1031.50 s
[keys] include base-4.19.0.0-b960
1031.50 s
[keys] include comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1031.50 s
[keys] include containers-0.6.8-4775
1031.50 s
[keys] include free-5.2-5jsicnVtm8y8KG9LMRezMp
1031.50 s
[keys] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1031.50 s
[keys] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1031.50 s
[keys] include semigroups-0.20-HSrvnib71V92veEQkXQjs8
1031.50 s
[keys] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1031.50 s
[keys] include transformers-0.6.1.0-c3ec
1031.50 s
[keys] include transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
1031.50 s
[keys] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1031.50 s
[keys] Linked component graph:
1031.50 s
[keys] unit keys-3.12.4-9pIWSPQD3dgEmDN6rrDseM
1031.50 s
[keys] include array-0.5.6.0-dc89
1031.50 s
[keys] include base-4.19.0.0-b960
1031.50 s
[keys] include comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1031.50 s
[keys] include containers-0.6.8-4775
1031.50 s
[keys] include free-5.2-5jsicnVtm8y8KG9LMRezMp
1031.50 s
[keys] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1031.50 s
[keys] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1031.50 s
[keys] include semigroups-0.20-HSrvnib71V92veEQkXQjs8
1031.50 s
[keys] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1031.50 s
[keys] include transformers-0.6.1.0-c3ec
1031.50 s
[keys] include transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
1031.50 s
[keys] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1031.50 s
[keys] Data.Key=keys-3.12.4-9pIWSPQD3dgEmDN6rrDseM:Data.Key
1031.50 s
[keys] Ready component graph:
1031.50 s
[keys] definite keys-3.12.4-9pIWSPQD3dgEmDN6rrDseM
1031.50 s
[keys] depends array-0.5.6.0-dc89
1031.50 s
[keys] depends base-4.19.0.0-b960
1031.50 s
[keys] depends comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1031.50 s
[keys] depends containers-0.6.8-4775
1031.50 s
[keys] depends free-5.2-5jsicnVtm8y8KG9LMRezMp
1031.50 s
[keys] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1031.50 s
[keys] depends semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1031.50 s
[keys] depends semigroups-0.20-HSrvnib71V92veEQkXQjs8
1031.50 s
[keys] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1031.50 s
[keys] depends transformers-0.6.1.0-c3ec
1031.50 s
[monoid-subclasses] split: OK (11.01s)
1031.50 s
[monoid-subclasses] +++ OK, passed 100 tests.
1031.50 s
[monoid-subclasses] splitAt: OK (1.87s)
1031.50 s
[monoid-subclasses] +++ OK, passed 100 tests.
1031.50 s
[monoid-subclasses] reverse: OK (1.73s)
1031.50 s
[monoid-subclasses] +++ OK, passed 100 tests.
1031.50 s
[monoid-subclasses] stable: OK (1.58s)
1031.50 s
[monoid-subclasses] +++ OK, passed 100 tests.
1031.50 s
[monoid-subclasses] fromText: OK (0.05s)
1031.50 s
[monoid-subclasses] +++ OK, passed 100 tests.
1031.50 s
[monoid-subclasses] singleton: OK (0.01s)
1031.50 s
[monoid-subclasses] +++ OK, passed 100 tests.
1031.50 s
[monoid-subclasses] Textual.splitCharacterPrefix: OK (0.06s)
1031.50 s
[monoid-subclasses] +++ OK, passed 100 tests.
1031.50 s
[monoid-subclasses] Textual.characterPrefix: OK
1031.50 s
[monoid-subclasses] +++ OK, passed 100 tests.
1031.50 s
[monoid-subclasses] Textual factors: OK (0.07s)
1031.50 s
[monoid-subclasses] +++ OK, passed 100 tests.
1031.50 s
[monoid-subclasses] Textual.unfoldr: OK (0.14s)
1031.50 s
[monoid-subclasses] +++ OK, passed 100 tests.
1031.50 s
[monoid-subclasses] factors . fromString: OK (0.06s)
1031.50 s
[monoid-subclasses] +++ OK, passed 100 tests.
1031.50 s
[regex-tdfa] buildPhase completed in 1 minutes 12 seconds
1031.50 s
[regex-tdfa] Phase: checkPhase
1031.50 s
[regex-tdfa] Running 1 test suites...
1031.50 s
[regex-tdfa] Test suite regex-tdfa-unittest: RUNNING...
1031.50 s
[regex-tdfa] Testing Text.Regex.TDFA version: Version {versionBranch = [1,3,2,3], versionTags = []}
1031.50 s
[regex-tdfa] Explanation and discussion of these tests on the wiki at http://www.haskell.org/haskellwiki/Regex_Posix including comparing results from different operating systems
1031.50 s
[regex-tdfa] Questions about this package to the author at email <TextRegexLazy@personal.mightyreason.com>
1031.50 s
[regex-tdfa] The type of both the pattern and test is [Char]
1031.50 s
[regex-tdfa] Without exactly two arguments:
1031.50 s
[regex-tdfa] This program runs all test files listed in test/data-dir/test-manifest.txt
1031.50 s
[regex-tdfa] Lines with negative number are expected to fail, others are expected to pass.
1031.50 s
[regex-tdfa] With exactly two arguments:
1031.50 s
[regex-tdfa] The first argument is the text to be searched.
1031.50 s
[regex-tdfa] The second argument is the regular expression pattern to search with.
1031.50 s
[regex-tdfa]
1031.50 s
[regex-tdfa] Using Tests from: basic3.txt
1031.50 s
[regex-tdfa]
1031.50 s
[regex-tdfa] Expected Pass #1
1031.50 s
[regex-tdfa] text and pattern: "()"
1031.50 s
[regex-tdfa] Regex pattern: "\\)"
1031.50 s
[regex-tdfa] Outputs agree: "(1,2)"
1031.50 s
[regex-tdfa]
1031.50 s
[regex-tdfa] Expected Pass #2
1031.50 s
[regex-tdfa] text and pattern: "}"
1031.50 s
[regex-tdfa] Regex pattern: "\\}"
1031.50 s
[regex-tdfa] Outputs agree: "(0,1)"
1031.50 s
[regex-tdfa]
1031.50 s
[regex-tdfa] Expected Pass #3
1031.50 s
[regex-tdfa] text and pattern: "]"
1031.50 s
[regex-tdfa] Regex pattern: "]"
1031.50 s
[regex-tdfa] Outputs agree: "(0,1)"
1031.50 s
[regex-tdfa]
1031.50 s
[regex-tdfa] Expected Pass #4
1031.50 s
[regex-tdfa] text and pattern: ""
1031.50 s
[regex-tdfa] Regex pattern: "$^"
1031.50 s
[regex-tdfa] Outputs agree: "(0,0)"
1031.50 s
[regex-tdfa]
1031.50 s
[regex-tdfa] Expected Pass #5
1031.50 s
[regex-tdfa] text and pattern: "aa"
1031.50 s
[regex-tdfa] Regex pattern: "a($)"
1031.50 s
[regex-tdfa] Outputs agree: "(1,2)(2,2)"
1031.50 s
[regex-tdfa]
1031.50 s
[regex-tdfa] Expected Pass #6
1031.50 s
[regex-tdfa] text and pattern: "aa"
1031.50 s
[regex-tdfa] Regex pattern: "a*(^a)"
1031.50 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1031.50 s
[regex-tdfa]
1031.50 s
[regex-tdfa] Expected Pass #7
1031.50 s
[regex-tdfa] text and pattern: "a"
1031.50 s
[regex-tdfa] Regex pattern: "(..)*(...)*"
1031.50 s
[regex-tdfa] Outputs agree: "(0,0)(-1,-1)(-1,-1)"
1031.50 s
[regex-tdfa]
1031.50 s
[regex-tdfa] Expected Pass #8
1031.50 s
[regex-tdfa] text and pattern: "abcd"
1031.50 s
[regex-tdfa] Regex pattern: "(..)*(...)*"
1031.50 s
[regex-tdfa] Outputs agree: "(0,4)(2,4)(-1,-1)"
1031.50 s
[regex-tdfa]
1031.50 s
[regex-tdfa] Expected Pass #9
1031.50 s
[regex-tdfa] text and pattern: "abc"
1031.50 s
[regex-tdfa] Regex pattern: "(ab|a)(bc|c)"
1031.50 s
[regex-tdfa] Outputs agree: "(0,3)(0,2)(2,3)"
1031.50 s
[regex-tdfa]
1031.50 s
[regex-tdfa] Expected Pass #10
1031.51 s
[regex-tdfa] text and pattern: "abc"
1031.51 s
[regex-tdfa] Regex pattern: "(ab)c|abc"
1031.51 s
[regex-tdfa] Outputs agree: "(0,3)(0,2)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #11
1031.51 s
[regex-tdfa] text and pattern: "ab"
1031.51 s
[regex-tdfa] Regex pattern: "a{0}b"
1031.51 s
[regex-tdfa] Outputs agree: "(1,2)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #12
1031.51 s
[regex-tdfa] text and pattern: "aaabbbbbbb"
1031.51 s
[regex-tdfa] Regex pattern: "(a*)(b?)(b+)b{3}"
1031.51 s
[regex-tdfa] Outputs agree: "(0,10)(0,3)(3,4)(4,7)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #13
1031.51 s
[regex-tdfa] text and pattern: "aaabbbbbbb"
1031.51 s
[regex-tdfa] Regex pattern: "(a*)(b{0,1})(b{1,})b{3}"
1031.51 s
[regex-tdfa] Outputs agree: "(0,10)(0,3)(3,4)(4,7)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #15
1031.51 s
[regex-tdfa] text and pattern: "a"
1031.51 s
[regex-tdfa] Regex pattern: "((a|a)|a)"
1031.51 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)(0,1)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #16
1031.51 s
[regex-tdfa] text and pattern: "aaaa"
1031.51 s
[regex-tdfa] Regex pattern: "(a*)(a|aa)"
1031.51 s
[regex-tdfa] Outputs agree: "(0,4)(0,3)(3,4)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #17
1031.51 s
[regex-tdfa] text and pattern: "aaaa"
1031.51 s
[regex-tdfa] Regex pattern: "a*(a.|aa)"
1031.51 s
[regex-tdfa] Outputs agree: "(0,4)(2,4)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #18
1031.51 s
[regex-tdfa] text and pattern: "aef"
1031.51 s
[regex-tdfa] Regex pattern: "a(b)|c(d)|a(e)f"
1031.51 s
[regex-tdfa] Outputs agree: "(0,3)(-1,-1)(-1,-1)(1,2)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #19
1031.51 s
[regex-tdfa] text and pattern: "b"
1031.51 s
[regex-tdfa] Regex pattern: "(a|b)?.*"
1031.51 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #20
1031.51 s
[regex-tdfa] text and pattern: "ac"
1031.51 s
[regex-tdfa] Regex pattern: "(a|b)c|a(b|c)"
1031.51 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(-1,-1)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #21
1031.51 s
[regex-tdfa] text and pattern: "ab"
1031.51 s
[regex-tdfa] Regex pattern: "(a|b)c|a(b|c)"
1031.51 s
[regex-tdfa] Outputs agree: "(0,2)(-1,-1)(1,2)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #22
1031.51 s
[regex-tdfa] text and pattern: "abc"
1031.51 s
[regex-tdfa] Regex pattern: "(a|b)*c|(a|ab)*c"
1031.51 s
[regex-tdfa] Outputs agree: "(0,3)(1,2)(-1,-1)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #23
1031.51 s
[regex-tdfa] text and pattern: "xc"
1031.51 s
[regex-tdfa] Regex pattern: "(a|b)*c|(a|ab)*c"
1031.51 s
[regex-tdfa] Outputs agree: "(1,2)(-1,-1)(-1,-1)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #24
1031.51 s
[regex-tdfa] text and pattern: "xa"
1031.51 s
[regex-tdfa] Regex pattern: "(.a|.b).*|.*(.a|.b)"
1031.51 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(-1,-1)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #25
1031.51 s
[regex-tdfa] text and pattern: "abab"
1031.51 s
[regex-tdfa] Regex pattern: "a?(ab|ba)ab"
1031.51 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #26
1031.51 s
[regex-tdfa] text and pattern: "abab"
1031.51 s
[regex-tdfa] Regex pattern: "a?(ac{0}b|ba)ab"
1031.51 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #27
1031.51 s
[regex-tdfa] text and pattern: "abbabab"
1031.51 s
[regex-tdfa] Regex pattern: "ab|abab"
1031.51 s
[regex-tdfa] Outputs agree: "(0,2)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #28
1031.51 s
[regex-tdfa] text and pattern: "baaabbbaba"
1031.51 s
[regex-tdfa] Regex pattern: "aba|bab|bba"
1031.51 s
[regex-tdfa] Outputs agree: "(5,8)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #29
1031.51 s
[regex-tdfa] text and pattern: "baaabbbaba"
1031.51 s
[regex-tdfa] Regex pattern: "aba|bab"
1031.51 s
[regex-tdfa] Outputs agree: "(6,9)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #30
1031.51 s
[regex-tdfa] text and pattern: "aa"
1031.51 s
[regex-tdfa] Regex pattern: "(aa|aaa)*|(a|aaaaa)"
1031.51 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(-1,-1)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #31
1031.51 s
[regex-tdfa] text and pattern: "aa"
1031.51 s
[regex-tdfa] Regex pattern: "(a.|.a.)*|(a|.a...)"
1031.51 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(-1,-1)"
1031.51 s
[regex-tdfa]
1031.51 s
[regex-tdfa] Expected Pass #32
1031.51 s
[regex-tdfa] text and pattern: "xabc"
1031.51 s
[unix-compat] Phase: updateAutotoolsGnuConfigScriptsPhase
1031.51 s
[unix-compat] Phase: configurePhase
1031.51 s
[unix-compat] configureFlags: --verbose --prefix=/nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/r5l7i6vzx4blz2nk85m14449smlrbd7j-unix-compat-0.7.4-doc/share/doc/unix-compat-0.7.4 --with-gcc=gcc --package-db=/build/tmp.Cq28BQpogg/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1031.51 s
[unix-compat] Using Parsec parser
1031.51 s
[unix-compat] Configuring unix-compat-0.7.4...
1031.51 s
[unix-compat] Dependency base >=4.9 && <5: using base-4.19.0.0
1031.51 s
[unix-compat] Dependency unix >=2.7.2.0 && <2.9: using unix-2.8.3.0
1031.51 s
[unix-compat] Dependency HUnit: using HUnit-1.6.2.0
1031.51 s
[unix-compat] Dependency base: using base-4.19.0.0
1031.51 s
[unix-compat] Dependency directory >=1.3.1.0: using directory-1.3.8.1
1031.51 s
[unix-compat] Dependency extra: using extra-1.7.16
1031.51 s
[unix-compat] Dependency hspec >=2.5.5: using hspec-2.11.12
1031.51 s
[unix-compat] Dependency monad-parallel: using monad-parallel-0.8
1031.51 s
[unix-compat] Dependency temporary: using temporary-1.3
1031.51 s
[unix-compat] Dependency unix-compat: using unix-compat-0.7.4
1031.51 s
[unix-compat] Source component graph:
1031.51 s
[unix-compat] component lib
1031.51 s
[unix-compat] component test:unix-compat-testsuite dependency lib
1031.51 s
[unix-compat] Configured component graph:
1031.51 s
[unix-compat] component unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP
1031.51 s
[unix-compat] include base-4.19.0.0-b960
1031.51 s
[unix-compat] include unix-2.8.3.0-8aa6
1031.51 s
[unix-compat] component unix-compat-0.7.4-F9C01w0bzd5JKM4xrultCW-unix-compat-testsuite
1031.51 s
[unix-compat] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1031.51 s
[unix-compat] include base-4.19.0.0-b960
1031.51 s
[unix-compat] include directory-1.3.8.1-6a8e
1031.51 s
[unix-compat] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1031.51 s
[unix-compat] include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
1031.51 s
[unix-compat] include monad-parallel-0.8-CW7jZA6N1Aw3qMN5baPisM
1031.51 s
[unix-compat] include temporary-1.3-6LDbtKZIJMrKol9xVw5U4b
1031.51 s
[unix-compat] include unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP
1031.51 s
[unix-compat] Linked component graph:
1031.51 s
[unix-compat] unit unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP
1031.52 s
[unix-compat] include base-4.19.0.0-b960
1031.52 s
[unix-compat] include unix-2.8.3.0-8aa6
1031.52 s
[unix-compat] System.PosixCompat=unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP:System.PosixCompat,System.PosixCompat.Extensions=unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP:System.PosixCompat.Extensions,System.PosixCompat.Files=unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP:System.PosixCompat.Files,System.PosixCompat.Process=unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP:System.PosixCompat.Process,System.PosixCompat.Temp=unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP:System.PosixCompat.Temp,System.PosixCompat.Time=unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP:System.PosixCompat.Time,System.PosixCompat.Types=unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP:System.PosixCompat.Types,System.PosixCompat.Unistd=unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP:System.PosixCompat.Unistd
1031.52 s
[unix-compat] unit unix-compat-0.7.4-F9C01w0bzd5JKM4xrultCW-unix-compat-testsuite
1031.52 s
[unix-compat] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1031.52 s
[unix-compat] include base-4.19.0.0-b960
1031.52 s
[unix-compat] include directory-1.3.8.1-6a8e
1031.52 s
[unix-compat] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1031.52 s
[unix-compat] include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
1031.52 s
[unix-compat] include monad-parallel-0.8-CW7jZA6N1Aw3qMN5baPisM
1031.52 s
[unix-compat] include temporary-1.3-6LDbtKZIJMrKol9xVw5U4b
1031.52 s
[unix-compat] include unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP
1031.52 s
[unix-compat] Ready component graph:
1031.52 s
[unix-compat] definite unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP
1031.52 s
[unix-compat] depends base-4.19.0.0-b960
1031.52 s
[unix-compat] depends unix-2.8.3.0-8aa6
1031.52 s
[unordered-containers] Phase: setupCompilerEnvironmentPhase
1031.52 s
[unordered-containers] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1031.52 s
[unordered-containers] Phase: unpackPhase
1031.52 s
[unordered-containers] unpacking source archive /nix/store/46rvk8vjzsagr58a6pqwimivmr0ahxys-unordered-containers-0.2.20.tar.gz
1031.52 s
[unordered-containers] source root is unordered-containers-0.2.20
1031.52 s
[unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20/unordered-containers.cabal"
1031.52 s
[unordered-containers] Phase: patchPhase
1031.52 s
[unordered-containers] Replace Cabal file with edited version from mirror://hackage/unordered-containers-0.2.20/revision/4.cabal.
1031.52 s
[unordered-containers] Phase: compileBuildDriverPhase
1031.52 s
[unordered-containers] setupCompileFlags: -package-db=/build/tmp.2V8WbIniUp/setup-package.conf.d -threaded
1031.52 s
[unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.2V8WbIniUp/Main.o )
1031.52 s
[unordered-containers] [2 of 2] Linking Setup
1031.52 s
[unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
1031.52 s
[unordered-containers] Phase: configurePhase
1031.52 s
[unordered-containers] configureFlags: --verbose --prefix=/nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/w05py57xs6l3yqdyn4vf7shdkxabiy5h-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20 --with-gcc=gcc --package-db=/build/tmp.2V8WbIniUp/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1031.52 s
[unordered-containers] Using Parsec parser
1031.52 s
[unordered-containers] Configuring unordered-containers-0.2.20...
1031.52 s
[unordered-containers] Flags chosen: debug=False
1031.52 s
[unordered-containers] Dependency base >=4.10 && <5: using base-4.19.0.0
1031.52 s
[unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.0.0
1031.52 s
[unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.4.7.0
1031.52 s
[unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.21.0.0
1031.52 s
[unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.15
1031.52 s
[unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
1031.52 s
[unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.14.3
1031.52 s
[unordered-containers] Dependency base: using base-4.19.0.0
1031.52 s
[unordered-containers] Dependency containers >=0.5.8: using containers-0.6.8
1031.52 s
[unordered-containers] Dependency hashable: using hashable-1.4.7.0
1031.52 s
[unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.0.0
1031.52 s
[unordered-containers] Dependency random: using random-1.2.1.3
1031.52 s
[unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
1031.52 s
[unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
1031.52 s
[unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11
1031.52 s
[unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20
1031.52 s
[unordered-containers] Source component graph:
1031.52 s
[unordered-containers] component lib
1031.52 s
[unordered-containers] component test:unordered-containers-tests dependency lib
1031.52 s
[unordered-containers] Configured component graph:
1031.52 s
[unordered-containers] component unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1031.52 s
[unordered-containers] include base-4.19.0.0-b960
1031.52 s
[unordered-containers] include deepseq-1.5.0.0-412f
1031.52 s
[unordered-containers] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1031.52 s
[unordered-containers] include template-haskell-2.21.0.0-8831
1031.52 s
[unordered-containers] component unordered-containers-0.2.20-2TSXkpknPL65rd0f1WFznb-unordered-containers-tests
1031.52 s
[unordered-containers] include ChasingBottoms-1.3.1.15-FxwScYtjqvxDEc2cZ0Gn1W
1031.52 s
[unordered-containers] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1031.52 s
[unordered-containers] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1031.52 s
[unordered-containers] include base-4.19.0.0-b960
1031.52 s
[unordered-containers] include containers-0.6.8-4775
1031.52 s
[unordered-containers] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1031.52 s
[unordered-containers] include nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
1031.78 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/nj85ibdbnyzg3snfq2pn4py3xhnlkl03-witherable-0.5-doc /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5
1033.15 s
[post-build-hook] Pushing 2 paths (108 are already present) using zstd to cache sellout ⏳
1033.15 s
[post-build-hook]
1033.50 s
[post-build-hook] Pushing /nix/store/nj85ibdbnyzg3snfq2pn4py3xhnlkl03-witherable-0.5-doc (1.13 MiB)
1033.56 s
[post-build-hook] Pushing /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5 (4.44 MiB)
1034.91 s
[post-build-hook]
1034.91 s
[post-build-hook] All done.
1035.13 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/nj85ibdbnyzg3snfq2pn4py3xhnlkl03-witherable-0.5-doc /nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5
1035.52 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1035.94 s
[post-build-hook] copying 2 paths...
1035.94 s
[post-build-hook] copying path '/nix/store/nj85ibdbnyzg3snfq2pn4py3xhnlkl03-witherable-0.5-doc' to 'https://cache.nix-ci.com'...
1036.42 s
[post-build-hook] copying path '/nix/store/vbpqqryycb70dfhiq2aa3vsa4rhkbq97-witherable-0.5' to 'https://cache.nix-ci.com'...
1039.45 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1040.02 s
[post-build-hook] copying 1 paths...
1040.03 s
[post-build-hook] copying path '/nix/store/98szbs9gmqx3vsp5zj8d4wypfm62vwlh-witherable-0.5.drv' to 'https://cache.nix-ci.com'...
1040.47 s
Progress: 81 of 171 built (11 building), 395 of 395 downloaded from cache
1040.69 s
Building aeson
1040.69 s
[adjunctions] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1040.69 s
[adjunctions] include semigroups-0.20-HSrvnib71V92veEQkXQjs8
1040.69 s
[adjunctions] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1040.69 s
[adjunctions] include transformers-0.6.1.0-c3ec
1040.69 s
[adjunctions] include transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
1040.69 s
[adjunctions] include void-0.7.3-5yU89rtcFpHDt8FMuiMLJt
1040.69 s
[adjunctions] Control.Comonad.Representable.Store=adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr:Control.Comonad.Representable.Store,Control.Comonad.Trans.Adjoint=adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr:Control.Comonad.Trans.Adjoint,Control.Monad.Representable.Reader=adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr:Control.Monad.Representable.Reader,Control.Monad.Representable.State=adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr:Control.Monad.Representable.State,Control.Monad.Trans.Adjoint=adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr:Control.Monad.Trans.Adjoint,Control.Monad.Trans.Contravariant.Adjoint=adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr:Control.Monad.Trans.Contravariant.Adjoint,Control.Monad.Trans.Conts=adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr:Control.Monad.Trans.Conts,Data.Functor.Adjunction=adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr:Data.Functor.Adjunction,Data.Functor.Contravariant.Adjunction=adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr:Data.Functor.Contravariant.Adjunction,Data.Functor.Contravariant.Rep=adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr:Data.Functor.Contravariant.Rep,Data.Functor.Rep=adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr:Data.Functor.Rep
1040.69 s
[adjunctions] unit adjunctions-4.4.3-8fUAWBy6uVd3zdD6rfHW7M-spec
1040.69 s
[adjunctions] include adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr
1040.69 s
[adjunctions] include base-4.19.0.0-b960
1040.69 s
[adjunctions] include distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
1040.69 s
[adjunctions] include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
1040.69 s
[adjunctions] Ready component graph:
1040.69 s
[adjunctions] definite adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr
1040.69 s
[adjunctions] depends array-0.5.6.0-dc89
1040.69 s
[adjunctions] depends base-4.19.0.0-b960
1040.69 s
[adjunctions] depends comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1040.69 s
[adjunctions] depends containers-0.6.8-4775
1040.69 s
[adjunctions] depends contravariant-1.5.5-J4LLuUnbnVaBzsIx42BlgS
1040.69 s
[adjunctions] depends distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
1040.69 s
[adjunctions] depends free-5.2-5jsicnVtm8y8KG9LMRezMp
1040.69 s
[adjunctions] depends mtl-2.3.1-63a4
1040.69 s
[adjunctions] depends profunctors-5.6.2-3nAHQARBXS12MCzIa3BzsU
1040.69 s
[adjunctions] depends semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1040.69 s
[adjunctions] depends semigroups-0.20-HSrvnib71V92veEQkXQjs8
1040.69 s
[adjunctions] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1040.69 s
[adjunctions] depends transformers-0.6.1.0-c3ec
1040.69 s
[adjunctions] depends transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
1040.69 s
[adjunctions] depends void-0.7.3-5yU89rtcFpHDt8FMuiMLJt
1040.69 s
[adjunctions] definite adjunctions-4.4.3-8fUAWBy6uVd3zdD6rfHW7M-spec
1040.69 s
[adjunctions] depends adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr
1040.69 s
[adjunctions] depends base-4.19.0.0-b960
1040.69 s
[adjunctions] depends distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
1040.69 s
[adjunctions] depends hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
1040.69 s
[adjunctions] Using Cabal-3.10.2.0 compiled by ghc-9.8
1040.69 s
[adjunctions] Using compiler: ghc-9.8.1
1040.69 s
[adjunctions] Using install prefix:
1040.69 s
[adjunctions] /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3
1040.69 s
[adjunctions] Executables installed in:
1040.69 s
[adjunctions] /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3/bin
1040.69 s
[adjunctions] Libraries installed in:
1040.69 s
[adjunctions] /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr
1040.69 s
[adjunctions] Dynamic Libraries installed in:
1040.69 s
[adjunctions] /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1040.69 s
[adjunctions] Private executables installed in:
1040.69 s
[adjunctions] /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3/libexec/x86_64-linux-ghc-9.8.1/adjunctions-4.4.3
1040.69 s
[adjunctions] Data files installed in:
1040.69 s
[adjunctions] /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3/share/x86_64-linux-ghc-9.8.1/adjunctions-4.4.3
1040.69 s
[adjunctions] Documentation installed in:
1040.69 s
[adjunctions] /nix/store/bdg0d6qcw4p478b2jdglcwv7lr7g7qwr-adjunctions-4.4.3-doc/share/doc/adjunctions-4.4.3
1040.69 s
[adjunctions] Configuration files installed in:
1040.69 s
[adjunctions] /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3/etc
1040.69 s
[adjunctions] No alex found
1040.69 s
[adjunctions] Using ar found on system at:
1040.69 s
[adjunctions] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1040.69 s
[adjunctions] No c2hs found
1040.69 s
[adjunctions] No cpphs found
1040.69 s
[adjunctions] No doctest found
1040.69 s
[adjunctions] Using gcc version 14.3.0 given by user at:
1040.69 s
[algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Data.Graph.Typed
1040.69 s
[algebraic-graphs] unit algebraic-graphs-0.7-5OeXbbSnUqFIvHqlCjxIaZ-main
1040.69 s
[algebraic-graphs] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1040.69 s
[algebraic-graphs] include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
1040.69 s
[algebraic-graphs] include array-0.5.6.0-dc89
1040.69 s
[algebraic-graphs] include base-4.19.0.0-b960
1040.69 s
[algebraic-graphs] include containers-0.6.8-4775
1040.69 s
[algebraic-graphs] include deepseq-1.5.0.0-412f
1040.69 s
[algebraic-graphs] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1040.69 s
[algebraic-graphs] include inspection-testing-0.5.0.3-F5Uf2o8NuFA3RymCMAjQM3
1040.69 s
[algebraic-graphs] include transformers-0.6.1.0-c3ec
1040.69 s
[algebraic-graphs] Ready component graph:
1040.69 s
[algebraic-graphs] definite algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
1040.69 s
[algebraic-graphs] depends array-0.5.6.0-dc89
1040.69 s
[algebraic-graphs] depends base-4.19.0.0-b960
1040.69 s
[algebraic-graphs] depends containers-0.6.8-4775
1040.69 s
[algebraic-graphs] depends deepseq-1.5.0.0-412f
1040.69 s
[algebraic-graphs] depends transformers-0.6.1.0-c3ec
1040.69 s
[algebraic-graphs] definite algebraic-graphs-0.7-5OeXbbSnUqFIvHqlCjxIaZ-main
1040.69 s
[algebraic-graphs] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1040.69 s
[algebraic-graphs] depends algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
1040.70 s
[algebraic-graphs] depends array-0.5.6.0-dc89
1040.70 s
[algebraic-graphs] depends base-4.19.0.0-b960
1040.70 s
[algebraic-graphs] depends containers-0.6.8-4775
1040.70 s
[algebraic-graphs] depends deepseq-1.5.0.0-412f
1040.70 s
[algebraic-graphs] depends extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1040.70 s
[algebraic-graphs] depends inspection-testing-0.5.0.3-F5Uf2o8NuFA3RymCMAjQM3
1040.70 s
[algebraic-graphs] depends transformers-0.6.1.0-c3ec
1040.70 s
[algebraic-graphs] Using Cabal-3.10.2.0 compiled by ghc-9.8
1040.70 s
[algebraic-graphs] Using compiler: ghc-9.8.1
1040.70 s
[algebraic-graphs] Using install prefix:
1040.70 s
[algebraic-graphs] /nix/store/kmhq1m44brvhzap1zdl0i25m78f00kvy-algebraic-graphs-0.7
1040.70 s
[algebraic-graphs] Executables installed in:
1040.70 s
[algebraic-graphs] /nix/store/kmhq1m44brvhzap1zdl0i25m78f00kvy-algebraic-graphs-0.7/bin
1040.70 s
[algebraic-graphs] Libraries installed in:
1040.70 s
[algebraic-graphs] /nix/store/kmhq1m44brvhzap1zdl0i25m78f00kvy-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
1040.70 s
[algebraic-graphs] Dynamic Libraries installed in:
1040.70 s
[algebraic-graphs] /nix/store/kmhq1m44brvhzap1zdl0i25m78f00kvy-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1040.70 s
[algebraic-graphs] Private executables installed in:
1040.70 s
[algebraic-graphs] /nix/store/kmhq1m44brvhzap1zdl0i25m78f00kvy-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7
1040.70 s
[algebraic-graphs] Data files installed in:
1040.70 s
[algebraic-graphs] /nix/store/kmhq1m44brvhzap1zdl0i25m78f00kvy-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7
1040.70 s
[algebraic-graphs] Documentation installed in:
1040.70 s
[algebraic-graphs] /nix/store/rbfgcy9y59gqkp6924h8ll9485a16iar-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
1040.70 s
[algebraic-graphs] Configuration files installed in:
1040.70 s
[algebraic-graphs] /nix/store/kmhq1m44brvhzap1zdl0i25m78f00kvy-algebraic-graphs-0.7/etc
1040.70 s
[algebraic-graphs] No alex found
1040.70 s
[algebraic-graphs] Using ar found on system at:
1040.70 s
[algebraic-graphs] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1040.70 s
[algebraic-graphs] No c2hs found
1040.70 s
[algebraic-graphs] No cpphs found
1040.70 s
[algebraic-graphs] No doctest found
1040.70 s
[algebraic-graphs] Using gcc version 14.3.0 given by user at:
1040.70 s
[algebraic-graphs] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1040.70 s
[algebraic-graphs] Using ghc version 9.8.1 found on system at:
1040.70 s
[algebraic-graphs] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1040.70 s
[algebraic-graphs] Using ghc-pkg version 9.8.1 found on system at:
1040.70 s
[algebraic-graphs] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1040.70 s
[algebraic-graphs] No ghcjs found
1040.70 s
[algebraic-graphs] No ghcjs-pkg found
1040.70 s
[algebraic-graphs] No greencard found
1040.70 s
[algebraic-graphs] Using haddock version 2.30.0 found on system at:
1040.70 s
[algebraic-graphs] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1040.70 s
[algebraic-graphs] No happy found
1040.70 s
[algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
1040.70 s
[algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1040.70 s
[algebraic-graphs] No hmake found
1040.70 s
[algebraic-graphs] Using hpc version 0.69 found on system at:
1040.70 s
[attoparsec] [ 9 of 16] Compiling Data.Attoparsec.Text.Lazy ( Data/Attoparsec/Text/Lazy.hs, dist/build/Data/Attoparsec/Text/Lazy.p_o )
1040.70 s
[attoparsec] [10 of 16] Compiling Data.Attoparsec.ByteString.Internal ( Data/Attoparsec/ByteString/Internal.hs, dist/build/Data/Attoparsec/ByteString/Internal.p_o )
1040.70 s
[attoparsec] [11 of 16] Compiling Data.Attoparsec.ByteString ( Data/Attoparsec/ByteString.hs, dist/build/Data/Attoparsec/ByteString.p_o )
1040.70 s
[attoparsec] [12 of 16] Compiling Data.Attoparsec.ByteString.Lazy ( Data/Attoparsec/ByteString/Lazy.hs, dist/build/Data/Attoparsec/ByteString/Lazy.p_o )
1040.70 s
[attoparsec] [13 of 16] Compiling Data.Attoparsec.Lazy ( Data/Attoparsec/Lazy.hs, dist/build/Data/Attoparsec/Lazy.p_o )
1040.70 s
[attoparsec] [14 of 16] Compiling Data.Attoparsec.ByteString.Char8 ( Data/Attoparsec/ByteString/Char8.hs, dist/build/Data/Attoparsec/ByteString/Char8.p_o )
1040.70 s
[attoparsec]
1040.70 s
[attoparsec] Data/Attoparsec/ByteString/Char8.hs:154:13: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1040.70 s
[attoparsec] The use of ‘~’ without TypeOperators
1040.70 s
[attoparsec] will become an error in a future GHC release.
1040.70 s
[attoparsec] Suggested fix: Perhaps you intended to use TypeOperators
1040.70 s
[attoparsec] |
1040.70 s
[attoparsec] 154 | instance (a ~ B.ByteString) => IsString (Parser a) where
1040.70 s
[attoparsec] | ^
1040.70 s
[attoparsec] [15 of 16] Compiling Data.Attoparsec.Char8 ( Data/Attoparsec/Char8.hs, dist/build/Data/Attoparsec/Char8.p_o )
1040.70 s
[attoparsec] [16 of 16] Compiling Data.Attoparsec ( Data/Attoparsec.hs, dist/build/Data/Attoparsec.p_o )
1040.70 s
[attoparsec] Preprocessing test suite 'attoparsec-tests' for attoparsec-0.14.4..
1040.70 s
[attoparsec] Building test suite 'attoparsec-tests' for attoparsec-0.14.4..
1040.70 s
[filepattern] No ghcjs-pkg found
1040.70 s
[filepattern] No greencard found
1040.70 s
[filepattern] Using haddock version 2.30.0 found on system at:
1040.70 s
[filepattern] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1040.70 s
[filepattern] No happy found
1040.70 s
[filepattern] Using haskell-suite found on system at: haskell-suite-dummy-location
1040.70 s
[filepattern] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1040.70 s
[filepattern] No hmake found
1040.70 s
[filepattern] Using hpc version 0.69 found on system at:
1040.70 s
[filepattern] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1040.70 s
[filepattern] Using hsc2hs version 0.68.10 found on system at:
1040.70 s
[filepattern] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1040.70 s
[filepattern] Using hscolour version 1.25 found on system at:
1040.70 s
[filepattern] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1040.70 s
[filepattern] No jhc found
1040.70 s
[filepattern] Using ld found on system at:
1040.70 s
[filepattern] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1040.70 s
[filepattern] No pkg-config found
1040.70 s
[filepattern] Using runghc version 9.8.1 found on system at:
1040.70 s
[filepattern] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1040.70 s
[filepattern] Using strip version 2.44 found on system at:
1040.70 s
[filepattern] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1040.70 s
[filepattern] Using tar found on system at:
1040.70 s
[filepattern] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1040.70 s
[filepattern] No uhc found
1040.70 s
[filepattern] Phase: buildPhase
1040.70 s
[filepattern] Preprocessing library for filepattern-0.1.3..
1040.70 s
[filepattern] Building library for filepattern-0.1.3..
1040.70 s
[filepattern] [1 of 8] Compiling System.FilePattern.ListBy ( src/System/FilePattern/ListBy.hs, dist/build/System/FilePattern/ListBy.o, dist/build/System/FilePattern/ListBy.dyn_o )
1040.70 s
[filepattern] [2 of 8] Compiling System.FilePattern.Monads ( src/System/FilePattern/Monads.hs, dist/build/System/FilePattern/Monads.o, dist/build/System/FilePattern/Monads.dyn_o )
1040.70 s
[filepattern] [3 of 8] Compiling System.FilePattern.Tree ( src/System/FilePattern/Tree.hs, dist/build/System/FilePattern/Tree.o, dist/build/System/FilePattern/Tree.dyn_o )
1040.70 s
[filepattern]
1040.70 s
[filepattern] src/System/FilePattern/Tree.hs:16:45: warning : [ GHC-63394 ] [ -Wx-partial ]
1040.70 s
[filepattern] In the use of ‘head’
1040.70 s
[filepattern] (imported from Prelude, but defined in GHC.List):
1040.70 s
[filepattern] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1040.71 s
[filepattern] |
1040.71 s
[filepattern] 16 | f xs = Tree (map fst empty) [(fst $ head gs, f $ map snd gs) | gs <- groups]
1040.71 s
[filepattern] | ^^^^
1040.71 s
[filepattern] [4 of 8] Compiling System.FilePattern.Wildcard ( src/System/FilePattern/Wildcard.hs, dist/build/System/FilePattern/Wildcard.o, dist/build/System/FilePattern/Wildcard.dyn_o )
1040.71 s
[filepattern] [5 of 8] Compiling System.FilePattern.Core ( src/System/FilePattern/Core.hs, dist/build/System/FilePattern/Core.o, dist/build/System/FilePattern/Core.dyn_o )
1040.71 s
[filepattern] [6 of 8] Compiling System.FilePattern.Step ( src/System/FilePattern/Step.hs, dist/build/System/FilePattern/Step.o, dist/build/System/FilePattern/Step.dyn_o )
1040.71 s
[filepattern] [7 of 8] Compiling System.FilePattern.Directory ( src/System/FilePattern/Directory.hs, dist/build/System/FilePattern/Directory.o, dist/build/System/FilePattern/Directory.dyn_o )
1040.71 s
[filepattern] [8 of 8] Compiling System.FilePattern ( src/System/FilePattern.hs, dist/build/System/FilePattern.o, dist/build/System/FilePattern.dyn_o )
1040.71 s
[filepattern] [1 of 8] Compiling System.FilePattern.ListBy ( src/System/FilePattern/ListBy.hs, dist/build/System/FilePattern/ListBy.p_o )
1040.71 s
[filepattern] [2 of 8] Compiling System.FilePattern.Monads ( src/System/FilePattern/Monads.hs, dist/build/System/FilePattern/Monads.p_o )
1040.71 s
[filepattern] [3 of 8] Compiling System.FilePattern.Tree ( src/System/FilePattern/Tree.hs, dist/build/System/FilePattern/Tree.p_o )
1040.71 s
[filepattern]
1040.71 s
[filepattern] src/System/FilePattern/Tree.hs:16:45: warning : [ GHC-63394 ] [ -Wx-partial ]
1040.71 s
[filepattern] In the use of ‘head’
1040.71 s
[filepattern] (imported from Prelude, but defined in GHC.List):
1040.71 s
[filepattern] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1040.71 s
[ghc-exactprint] include filepath-1.4.100.4-fa1c
1040.71 s
[ghc-exactprint] include ghc-9.8.1-f1e9
1040.71 s
[ghc-exactprint] include ghc-boot-9.8.1-d7dd
1040.71 s
[ghc-exactprint] include ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe
1040.71 s
[ghc-exactprint] include ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC
1040.71 s
[ghc-exactprint] include mtl-2.3.1-63a4
1040.71 s
[ghc-exactprint] include ordered-containers-0.2.4-Ene2my0ZxDoJ5DMj7wTwY3
1040.71 s
[ghc-exactprint] include silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT
1040.71 s
[ghc-exactprint] include syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
1040.71 s
[ghc-exactprint] Linked component graph:
1040.71 s
[ghc-exactprint] unit ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe
1040.71 s
[ghc-exactprint] include base-4.19.0.0-b960
1040.71 s
[ghc-exactprint] include bytestring-0.12.0.2-4690
1040.71 s
[ghc-exactprint] include containers-0.6.8-4775
1040.71 s
[ghc-exactprint] include data-default-0.7.1.3-2DC1QaEMC8oIg9ubW4Htvy
1040.71 s
[ghc-exactprint] include directory-1.3.8.1-6a8e
1040.71 s
[ghc-exactprint] include filepath-1.4.100.4-fa1c
1040.71 s
[ghc-exactprint] include free-5.2-5jsicnVtm8y8KG9LMRezMp
1040.71 s
[ghc-exactprint] include ghc-9.8.1-f1e9
1040.71 s
[ghc-exactprint] include ghc-boot-9.8.1-d7dd
1040.71 s
[ghc-exactprint] include mtl-2.3.1-63a4
1040.71 s
[ghc-exactprint] include ordered-containers-0.2.4-Ene2my0ZxDoJ5DMj7wTwY3
1040.71 s
[ghc-exactprint] include syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
1040.72 s
[ghc-exactprint] Language.Haskell.GHC.ExactPrint=ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe:Language.Haskell.GHC.ExactPrint,Language.Haskell.GHC.ExactPrint.Dump=ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe:Language.Haskell.GHC.ExactPrint.Dump,Language.Haskell.GHC.ExactPrint.ExactPrint=ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe:Language.Haskell.GHC.ExactPrint.ExactPrint,Language.Haskell.GHC.ExactPrint.Lookup=ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe:Language.Haskell.GHC.ExactPrint.Lookup,Language.Haskell.GHC.ExactPrint.Orphans=ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe:Language.Haskell.GHC.ExactPrint.Orphans,Language.Haskell.GHC.ExactPrint.Parsers=ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe:Language.Haskell.GHC.ExactPrint.Parsers,Language.Haskell.GHC.ExactPrint.Preprocess=ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe:Language.Haskell.GHC.ExactPrint.Preprocess,Language.Haskell.GHC.ExactPrint.Transform=ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe:Language.Haskell.GHC.ExactPrint.Transform,Language.Haskell.GHC.ExactPrint.Types=ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe:Language.Haskell.GHC.ExactPrint.Types,Language.Haskell.GHC.ExactPrint.Utils=ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe:Language.Haskell.GHC.ExactPrint.Utils
1040.72 s
[ghc-exactprint] unit ghc-exactprint-1.8.0.0-89agjVFEAuDed1GOfaWmy-test
1040.72 s
[ghc-exactprint] include Cabal-syntax-3.10.3.0-JJItMyRxq4YH93ghH3PX25
1040.72 s
[ghc-exactprint] include Diff-0.5-4nPoK53PkizD5e0dTbCPv7
1040.72 s
[ghc-exactprint] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1040.72 s
[ghc-exactprint] include base-4.19.0.0-b960
1040.72 s
[ghc-exactprint] include bytestring-0.12.0.2-4690
1040.72 s
[ghc-exactprint] include containers-0.6.8-4775
1040.72 s
[ghc-exactprint] include data-default-0.7.1.3-2DC1QaEMC8oIg9ubW4Htvy
1040.72 s
[ghc-exactprint] include directory-1.3.8.1-6a8e
1040.72 s
[ghc-exactprint] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1040.72 s
[ghc-exactprint] include filepath-1.4.100.4-fa1c
1040.72 s
[ghc-exactprint] include ghc-9.8.1-f1e9
1040.72 s
[ghc-exactprint] include ghc-boot-9.8.1-d7dd
1040.72 s
[ghc-exactprint] include ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe
1040.72 s
[ghc-exactprint] include ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC
1040.72 s
[ghc-exactprint] include mtl-2.3.1-63a4
1040.72 s
[ghc-exactprint] include ordered-containers-0.2.4-Ene2my0ZxDoJ5DMj7wTwY3
1040.72 s
[ghc-exactprint] include silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT
1040.72 s
[ghc-exactprint] include syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
1040.72 s
[ghc-exactprint] Ready component graph:
1040.72 s
[ghc-exactprint] definite ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe
1040.72 s
[ghc-exactprint] depends base-4.19.0.0-b960
1040.72 s
[ghc-exactprint] depends bytestring-0.12.0.2-4690
1040.72 s
[ghc-exactprint] depends containers-0.6.8-4775
1040.72 s
[ghc-exactprint] depends data-default-0.7.1.3-2DC1QaEMC8oIg9ubW4Htvy
1040.72 s
[ghc-exactprint] depends directory-1.3.8.1-6a8e
1040.72 s
[ghc-exactprint] depends filepath-1.4.100.4-fa1c
1040.72 s
[ghc-exactprint] depends free-5.2-5jsicnVtm8y8KG9LMRezMp
1040.72 s
[ghc-exactprint] depends ghc-9.8.1-f1e9
1040.72 s
[ghc-exactprint] depends ghc-boot-9.8.1-d7dd
1040.73 s
[ghc-exactprint] depends mtl-2.3.1-63a4
1040.73 s
[ghc-exactprint] depends ordered-containers-0.2.4-Ene2my0ZxDoJ5DMj7wTwY3
1040.73 s
[ghc-exactprint] depends syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
1040.73 s
[ghc-exactprint] definite ghc-exactprint-1.8.0.0-89agjVFEAuDed1GOfaWmy-test
1040.73 s
[ghc-exactprint] depends Cabal-syntax-3.10.3.0-JJItMyRxq4YH93ghH3PX25
1040.73 s
[ghc-exactprint] depends Diff-0.5-4nPoK53PkizD5e0dTbCPv7
1040.73 s
[ghc-exactprint] depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1040.73 s
[ghc-exactprint] depends base-4.19.0.0-b960
1040.73 s
[ghc-exactprint] depends bytestring-0.12.0.2-4690
1040.73 s
[ghc-lib-parser-ex] Language.Haskell.GhclibParserEx.Dump=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.Dump,Language.Haskell.GhclibParserEx.Fixity=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.Fixity,Language.Haskell.GhclibParserEx.GHC.Driver.Flags=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Driver.Flags,Language.Haskell.GhclibParserEx.GHC.Driver.Session=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Driver.Session,Language.Haskell.GhclibParserEx.GHC.Hs=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Hs,Language.Haskell.GhclibParserEx.GHC.Hs.Binds=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Hs.Binds,Language.Haskell.GhclibParserEx.GHC.Hs.Decls=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Hs.Decls,Language.Haskell.GhclibParserEx.GHC.Hs.Expr=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Hs.Expr,Language.Haskell.GhclibParserEx.GHC.Hs.ExtendInstances=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Hs.ExtendInstances,Language.Haskell.GhclibParserEx.GHC.Hs.ImpExp=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Hs.ImpExp,Language.Haskell.GhclibParserEx.GHC.Hs.Pat=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Hs.Pat,Language.Haskell.GhclibParserEx.GHC.Hs.Type=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Hs.Type,Language.Haskell.GhclibParserEx.GHC.Hs.Types=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Hs.Types,Language.Haskell.GhclibParserEx.GHC.Parser=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Parser,Language.Haskell.GhclibParserEx.GHC.Settings.Config=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Settings.Config,Language.Haskell.GhclibParserEx.GHC.Types.Name.Reader=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Types.Name.Reader,Language.Haskell.GhclibParserEx.GHC.Utils.Outputable=ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d:Language.Haskell.GhclibParserEx.GHC.Utils.Outputable
1040.73 s
[ghc-lib-parser-ex] unit ghc-lib-parser-ex-9.8.0.2-30E0q4CrJHM1oml7etNgE3-ghc-lib-parser-ex-test
1040.73 s
[ghc-lib-parser-ex] include base-4.19.0.0-b960
1040.73 s
[ghc-lib-parser-ex] include directory-1.3.8.1-6a8e
1040.73 s
[ghc-lib-parser-ex] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1040.73 s
[ghc-lib-parser-ex] include filepath-1.4.100.4-fa1c
1040.73 s
[ghc-lib-parser-ex] include ghc-lib-parser-9.8.5.20250214-4drUxVHhKoGFUoOqornHDn
1040.73 s
[ghc-lib-parser-ex] include ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d
1040.73 s
[ghc-lib-parser-ex] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1040.73 s
[ghc-lib-parser-ex] include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
1040.73 s
[ghc-lib-parser-ex] include uniplate-1.6.13-FSZmfemPUb965irITYhfNI
1040.73 s
[ghc-lib-parser-ex] Ready component graph:
1040.73 s
[ghc-lib-parser-ex] definite ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d
1040.73 s
[ghc-lib-parser-ex] depends base-4.19.0.0-b960
1040.73 s
[ghc-lib-parser-ex] depends bytestring-0.12.0.2-4690
1040.73 s
[ghc-lib-parser-ex] depends containers-0.6.8-4775
1040.73 s
[ghc-lib-parser-ex] depends ghc-lib-parser-9.8.5.20250214-4drUxVHhKoGFUoOqornHDn
1040.73 s
[ghc-lib-parser-ex] depends uniplate-1.6.13-FSZmfemPUb965irITYhfNI
1040.73 s
[ghc-lib-parser-ex] definite ghc-lib-parser-ex-9.8.0.2-30E0q4CrJHM1oml7etNgE3-ghc-lib-parser-ex-test
1040.73 s
[ghc-lib-parser-ex] depends base-4.19.0.0-b960
1040.73 s
[ghc-lib-parser-ex] depends directory-1.3.8.1-6a8e
1040.73 s
[ghc-lib-parser-ex] depends extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1040.73 s
[ghc-lib-parser-ex] depends filepath-1.4.100.4-fa1c
1040.73 s
[ghc-lib-parser-ex] depends ghc-lib-parser-9.8.5.20250214-4drUxVHhKoGFUoOqornHDn
1040.73 s
[ghc-lib-parser-ex] depends ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d
1040.73 s
[ghc-lib-parser-ex] depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1040.73 s
[ghc-lib-parser-ex] depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
1040.73 s
[ghc-lib-parser-ex] depends uniplate-1.6.13-FSZmfemPUb965irITYhfNI
1040.73 s
[ghc-lib-parser-ex] Using Cabal-3.10.2.0 compiled by ghc-9.8
1040.73 s
[ghc-lib-parser-ex] Using compiler: ghc-9.8.1
1040.73 s
[ghc-lib-parser-ex] Using install prefix:
1040.73 s
[ghc-lib-parser-ex] /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2
1040.73 s
[ghc-lib-parser-ex] Executables installed in:
1040.73 s
[ghc-lib-parser-ex] /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2/bin
1040.73 s
[ghc-lib-parser-ex] Libraries installed in:
1040.73 s
[ghc-lib-parser-ex] /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d
1040.73 s
[ghc-lib-parser-ex] Dynamic Libraries installed in:
1040.73 s
[ghc-lib-parser-ex] /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1040.73 s
[ghc-lib-parser-ex] Private executables installed in:
1040.73 s
[ghc-lib-parser-ex] /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2/libexec/x86_64-linux-ghc-9.8.1/ghc-lib-parser-ex-9.8.0.2
1040.73 s
[ghc-lib-parser-ex] Data files installed in:
1040.73 s
[keys] depends transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
1040.73 s
[keys] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1040.73 s
[keys] Using Cabal-3.10.2.0 compiled by ghc-9.8
1040.73 s
[keys] Using compiler: ghc-9.8.1
1040.73 s
[keys] Using install prefix: /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4
1040.73 s
[keys] Executables installed in:
1040.73 s
[keys] /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4/bin
1040.73 s
[keys] Libraries installed in:
1040.74 s
[keys] /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/keys-3.12.4-9pIWSPQD3dgEmDN6rrDseM
1040.74 s
[keys] Dynamic Libraries installed in:
1040.74 s
[keys] /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1040.74 s
[keys] Private executables installed in:
1040.74 s
[keys] /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4/libexec/x86_64-linux-ghc-9.8.1/keys-3.12.4
1040.74 s
[keys] Data files installed in:
1040.74 s
[keys] /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4/share/x86_64-linux-ghc-9.8.1/keys-3.12.4
1040.74 s
[keys] Documentation installed in:
1040.74 s
[keys] /nix/store/zvn09w2f3hwsy03yx28ln0pfl2y9154r-keys-3.12.4-doc/share/doc/keys-3.12.4
1040.74 s
[keys] Configuration files installed in:
1040.74 s
[keys] /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4/etc
1040.74 s
[keys] No alex found
1040.74 s
[keys] Using ar found on system at:
1040.74 s
[keys] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1040.74 s
[keys] No c2hs found
1040.74 s
[keys] No cpphs found
1040.74 s
[keys] No doctest found
1040.74 s
[keys] Using gcc version 14.3.0 given by user at:
1040.74 s
[keys] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1040.74 s
[keys] Using ghc version 9.8.1 found on system at:
1040.74 s
[keys] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1040.74 s
[keys] Using ghc-pkg version 9.8.1 found on system at:
1040.74 s
[keys] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1040.74 s
[keys] No ghcjs found
1040.74 s
[keys] No ghcjs-pkg found
1040.74 s
[keys] No greencard found
1040.74 s
[keys] Using haddock version 2.30.0 found on system at:
1040.74 s
[keys] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1040.74 s
[keys] No happy found
1040.74 s
[keys] Using haskell-suite found on system at: haskell-suite-dummy-location
1040.74 s
[keys] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1040.74 s
[keys] No hmake found
1040.74 s
[keys] Using hpc version 0.69 found on system at:
1040.74 s
[keys] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1040.74 s
[keys] Using hsc2hs version 0.68.10 found on system at:
1040.74 s
[keys] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1040.74 s
[keys] Using hscolour version 1.25 found on system at:
1040.74 s
[keys] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1040.74 s
[keys] No jhc found
1040.74 s
[keys] Using ld found on system at:
1040.74 s
[keys] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1040.74 s
[keys] No pkg-config found
1040.74 s
[keys] Using runghc version 9.8.1 found on system at:
1040.75 s
[keys] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1040.75 s
[keys] Using strip version 2.44 found on system at:
1040.75 s
[keys] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1040.75 s
[keys] Using tar found on system at:
1040.75 s
[keys] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1040.75 s
[keys] No uhc found
1040.75 s
[keys] Phase: buildPhase
1040.75 s
[keys] Preprocessing library for keys-3.12.4..
1040.75 s
[keys] Building library for keys-3.12.4..
1040.75 s
[keys] [1 of 1] Compiling Data.Key ( src/Data/Key.hs, dist/build/Data/Key.o, dist/build/Data/Key.dyn_o )
1040.75 s
[keys] [1 of 1] Compiling Data.Key ( src/Data/Key.hs, dist/build/Data/Key.p_o )
1040.75 s
[monoid-subclasses] Textual.map: OK (0.15s)
1040.75 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.75 s
[monoid-subclasses] Textual.concatMap: OK (0.22s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.any: OK (0.04s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.all: OK (0.03s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.foldl: OK (0.16s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.foldr: OK (0.22s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.foldl': OK (0.17s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.scanl: OK (0.29s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.scanr: OK (0.33s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.scanl1: OK (0.20s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.scanr1: OK (0.27s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.toString: OK (0.32s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.toText: OK (0.40s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.mapAccumL: OK (0.28s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.mapAccumR: OK (0.22s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.takeWhile: OK (0.18s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.dropWhile: OK (0.29s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.span: OK (0.07s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.break: OK (0.10s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.spanMaybe: OK (0.16s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.split: OK (0.09s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.find: OK (0.06s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.foldl_: OK (0.12s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.foldr_: OK (0.13s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.foldl_': OK (0.13s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.span_: OK (0.06s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.break_: OK (0.10s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.spanMaybe_: OK (0.13s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.spanMaybe_': OK (0.14s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.takeWhile_: OK (0.16s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Textual.dropWhile_: OK (0.29s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] stripPrefix: OK (0.56s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] stripPrefixOverlap 1: OK (0.15s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] stripPrefixOverlap 2: OK (0.24s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] stripPrefixOverlap 3: OK (0.04s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] stripSuffixOverlap 1: OK (0.13s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] stripSuffixOverlap 2: OK (0.24s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] stripSuffixOverlap 3: OK (0.10s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] overlap law 1: OK (0.16s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] overlap law 2: OK (0.10s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] overlap law 3: OK (0.14s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] overlap idempotence: OK (0.15s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] overlap identity (left): OK (0.04s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] overlap identity (right): OK (0.01s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Monus identity (1): OK (0.06s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Monus identity (2): OK (0.01s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Monus mappend (1): OK (0.32s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Monus mappend (2): OK (0.16s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Monus stripPrefixOverlap: OK (0.06s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] Monus stripSuffixOverlap: OK (0.10s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[monoid-subclasses] isPrefixOf: OK (0.39s)
1040.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.76 s
[regex-tdfa] Regex pattern: "ab|a"
1040.76 s
[regex-tdfa] Outputs agree: "(1,3)"
1040.76 s
[regex-tdfa]
1040.76 s
[regex-tdfa] Expected Pass #33
1040.76 s
[regex-tdfa] text and pattern: "xxabc"
1040.76 s
[regex-tdfa] Regex pattern: "ab|a"
1040.76 s
[regex-tdfa] Outputs agree: "(2,4)"
1040.76 s
[regex-tdfa]
1040.76 s
[regex-tdfa] Expected Pass #34
1040.76 s
[regex-tdfa] text and pattern: "aBcD"
1040.76 s
[regex-tdfa] Regex pattern: "(Ab|cD)*"
1040.76 s
[regex-tdfa] Outputs agree: "(0,4)(2,4)"
1040.76 s
[regex-tdfa]
1040.77 s
[regex-tdfa] Expected Pass #35
1040.77 s
[regex-tdfa] text and pattern: ":::0:::1:::1:::0:"
1040.77 s
[regex-tdfa] Regex pattern: ":::1:::0:|:::1:1:0:"
1040.77 s
[regex-tdfa] Outputs agree: "(8,17)"
1040.77 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #36
1040.78 s
[regex-tdfa] text and pattern: ":::0:::1:::1:::0:"
1040.78 s
[regex-tdfa] Regex pattern: ":::1:::0:|:::1:1:1:"
1040.78 s
[regex-tdfa] Outputs agree: "(8,17)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #37
1040.78 s
[regex-tdfa] text and pattern: "`az{"
1040.78 s
[regex-tdfa] Regex pattern: "[[:lower:]]+"
1040.78 s
[regex-tdfa] Outputs agree: "(1,3)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #38
1040.78 s
[regex-tdfa] text and pattern: "@AZ["
1040.78 s
[regex-tdfa] Regex pattern: "[[:upper:]]+"
1040.78 s
[regex-tdfa] Outputs agree: "(1,3)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #39
1040.78 s
[regex-tdfa] text and pattern: "abc"
1040.78 s
[regex-tdfa] Regex pattern: "(a)(b)(c)"
1040.78 s
[regex-tdfa] Outputs agree: "(0,3)(0,1)(1,2)(2,3)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #43
1040.78 s
[regex-tdfa] text and pattern: "x"
1040.78 s
[regex-tdfa] Regex pattern: "((((((((((((((((((((((((((((((x))))))))))))))))))))))))))))))"
1040.78 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #44
1040.78 s
[regex-tdfa] text and pattern: "xx"
1040.78 s
[regex-tdfa] Regex pattern: "((((((((((((((((((((((((((((((x))))))))))))))))))))))))))))))*"
1040.78 s
[regex-tdfa] Outputs agree: "(0,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)(1,2)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #45
1040.78 s
[regex-tdfa] text and pattern: "ababababababababababababababababababababababababababababababababababababababababa"
1040.78 s
[regex-tdfa] Regex pattern: "a?(ab|ba)*"
1040.78 s
[regex-tdfa] Outputs agree: "(0,81)(79,81)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #46
1040.78 s
[regex-tdfa] text and pattern: "ababbabbbabbbabbbbabbbbaa"
1040.78 s
[regex-tdfa] Regex pattern: "abaa|abbaa|abbbaa|abbbbaa"
1040.78 s
[regex-tdfa] Outputs agree: "(18,25)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #47
1040.78 s
[regex-tdfa] text and pattern: "ababbabbbabbbabbbbabaa"
1040.78 s
[regex-tdfa] Regex pattern: "abaa|abbaa|abbbaa|abbbbaa"
1040.78 s
[regex-tdfa] Outputs agree: "(18,22)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #48
1040.78 s
[regex-tdfa] text and pattern: "baaabbbabac"
1040.78 s
[regex-tdfa] Regex pattern: "aaac|aabc|abac|abbc|baac|babc|bbac|bbbc"
1040.78 s
[regex-tdfa] Outputs agree: "(7,11)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #49
1040.78 s
[regex-tdfa] text and pattern: "XaaaXbbbXcccXdddXeeeXfffXgggXhhhXiiiXjjjXkkkXlllXcbaXaaaa"
1040.78 s
[regex-tdfa] Regex pattern: "aaaa|bbbb|cccc|ddddd|eeeeee|fffffff|gggg|hhhh|iiiii|jjjjj|kkkkk|llll"
1040.78 s
[regex-tdfa] Outputs agree: "(53,57)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #50
1040.78 s
[regex-tdfa] text and pattern: "aaaaaaaaab"
1040.78 s
[regex-tdfa] Regex pattern: "a*a*a*a*a*b"
1040.78 s
[regex-tdfa] Outputs agree: "(0,10)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #51
1040.78 s
[regex-tdfa] text and pattern: "abbc"
1040.78 s
[regex-tdfa] Regex pattern: "ab+bc"
1040.78 s
[regex-tdfa] Outputs agree: "(0,4)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #52
1040.78 s
[regex-tdfa] text and pattern: "abbbbc"
1040.78 s
[regex-tdfa] Regex pattern: "ab+bc"
1040.78 s
[regex-tdfa] Outputs agree: "(0,6)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #53
1040.78 s
[regex-tdfa] text and pattern: "abbc"
1040.78 s
[regex-tdfa] Regex pattern: "ab?bc"
1040.78 s
[regex-tdfa] Outputs agree: "(0,4)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #54
1040.78 s
[regex-tdfa] text and pattern: "abc"
1040.78 s
[regex-tdfa] Regex pattern: "ab?bc"
1040.78 s
[regex-tdfa] Outputs agree: "(0,3)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #55
1040.78 s
[regex-tdfa] text and pattern: "abc"
1040.78 s
[regex-tdfa] Regex pattern: "ab?c"
1040.78 s
[regex-tdfa] Outputs agree: "(0,3)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #56
1040.78 s
[regex-tdfa] text and pattern: "abc"
1040.78 s
[regex-tdfa] Regex pattern: "ab|cd"
1040.78 s
[regex-tdfa] Outputs agree: "(0,2)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #57
1040.78 s
[regex-tdfa] text and pattern: "abcd"
1040.78 s
[regex-tdfa] Regex pattern: "ab|cd"
1040.78 s
[regex-tdfa] Outputs agree: "(0,2)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #58
1040.78 s
[regex-tdfa] text and pattern: "a(b"
1040.78 s
[regex-tdfa] Regex pattern: "a\\(b"
1040.78 s
[regex-tdfa] Outputs agree: "(0,3)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #59
1040.78 s
[regex-tdfa] text and pattern: "ab"
1040.78 s
[regex-tdfa] Regex pattern: "a\\(*b"
1040.78 s
[regex-tdfa] Outputs agree: "(0,2)"
1040.78 s
[regex-tdfa]
1040.78 s
[regex-tdfa] Expected Pass #60
1040.78 s
[regex-tdfa] text and pattern: "a((b"
1040.78 s
[regex-tdfa] Regex pattern: "a\\(*b"
1040.78 s
[regex-tdfa] Outputs agree: "(0,4)"
1040.79 s
[regex-tdfa]
1040.79 s
[regex-tdfa] Expected Pass #61
1040.79 s
[regex-tdfa] text and pattern: "abc"
1040.79 s
[regex-tdfa] Regex pattern: "((a))"
1040.79 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)(0,1)"
1040.79 s
[regex-tdfa]
1040.79 s
[regex-tdfa] Expected Pass #62
1040.79 s
[regex-tdfa] text and pattern: "abc"
1040.79 s
[regex-tdfa] Regex pattern: "(a)b(c)"
1040.79 s
[regex-tdfa] Outputs agree: "(0,3)(0,1)(2,3)"
1040.79 s
[regex-tdfa]
1040.79 s
[regex-tdfa] Expected Pass #63
1040.79 s
[regex-tdfa] text and pattern: "aabbabc"
1040.79 s
[regex-tdfa] Regex pattern: "a+b+c"
1040.79 s
[regex-tdfa] Outputs agree: "(4,7)"
1040.79 s
[regex-tdfa]
1040.79 s
[regex-tdfa] Expected Pass #64
1040.79 s
[regex-tdfa] text and pattern: "aaa"
1040.79 s
[regex-tdfa] Regex pattern: "a*"
1040.79 s
[regex-tdfa] Outputs agree: "(0,3)"
1040.79 s
[regex-tdfa]
1040.79 s
[regex-tdfa] Expected Pass #65
1040.79 s
[regex-tdfa] text and pattern: "-"
1040.79 s
[regex-tdfa] Regex pattern: "(a*)*"
1040.79 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1040.79 s
[regex-tdfa]
1040.79 s
[regex-tdfa] Expected Pass #66
1040.79 s
[regex-tdfa] text and pattern: "-"
1040.79 s
[regex-tdfa] Regex pattern: "(a*)+"
1040.79 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1040.79 s
[regex-tdfa]
1040.79 s
[regex-tdfa] Expected Pass #67
1040.79 s
[regex-tdfa] text and pattern: "-"
1040.79 s
[regex-tdfa] Regex pattern: "(a*|b)*"
1040.79 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1040.79 s
[regex-tdfa]
1040.79 s
[regex-tdfa] Expected Pass #68
1040.79 s
[regex-tdfa] text and pattern: "ab"
1040.79 s
[regex-tdfa] Regex pattern: "(a+|b)*"
1040.79 s
[regex-tdfa] Outputs agree: "(0,2)(1,2)"
1040.79 s
[regex-tdfa]
1040.79 s
[regex-tdfa] Expected Pass #69
1040.79 s
[regex-tdfa] text and pattern: "ab"
1040.79 s
[regex-tdfa] Regex pattern: "(a+|b)+"
1040.79 s
[regex-tdfa] Outputs agree: "(0,2)(1,2)"
1040.80 s
[regex-tdfa]
1040.80 s
[regex-tdfa] Expected Pass #70
1040.80 s
[regex-tdfa] text and pattern: "ab"
1040.80 s
[regex-tdfa] Regex pattern: "(a+|b)?"
1040.80 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1040.80 s
[regex-tdfa]
1040.80 s
[regex-tdfa] Expected Pass #71
1040.80 s
[unix-compat] definite unix-compat-0.7.4-F9C01w0bzd5JKM4xrultCW-unix-compat-testsuite
1040.80 s
[unix-compat] depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1040.80 s
[unix-compat] depends base-4.19.0.0-b960
1040.80 s
[unix-compat] depends directory-1.3.8.1-6a8e
1040.80 s
[unix-compat] depends extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1040.80 s
[unix-compat] depends hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
1040.80 s
[unix-compat] depends monad-parallel-0.8-CW7jZA6N1Aw3qMN5baPisM
1040.80 s
[unix-compat] depends temporary-1.3-6LDbtKZIJMrKol9xVw5U4b
1040.80 s
[unix-compat] depends unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP
1040.80 s
[unix-compat] Using Cabal-3.10.2.0 compiled by ghc-9.8
1040.80 s
[unix-compat] Using compiler: ghc-9.8.1
1040.80 s
[unix-compat] Using install prefix:
1040.80 s
[unix-compat] /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4
1040.80 s
[unix-compat] Executables installed in:
1040.80 s
[unix-compat] /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4/bin
1040.80 s
[unix-compat] Libraries installed in:
1040.80 s
[unix-compat] /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP
1040.80 s
[unix-compat] Dynamic Libraries installed in:
1040.80 s
[unix-compat] /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1040.80 s
[unix-compat] Private executables installed in:
1040.80 s
[unix-compat] /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4/libexec/x86_64-linux-ghc-9.8.1/unix-compat-0.7.4
1040.80 s
[unix-compat] Data files installed in:
1040.80 s
[unix-compat] /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4/share/x86_64-linux-ghc-9.8.1/unix-compat-0.7.4
1040.80 s
[unix-compat] Documentation installed in:
1040.80 s
[unix-compat] /nix/store/r5l7i6vzx4blz2nk85m14449smlrbd7j-unix-compat-0.7.4-doc/share/doc/unix-compat-0.7.4
1040.80 s
[unix-compat] Configuration files installed in:
1040.80 s
[unix-compat] /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4/etc
1040.80 s
[unix-compat] No alex found
1040.80 s
[unix-compat] Using ar found on system at:
1040.80 s
[unix-compat] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1040.80 s
[unix-compat] No c2hs found
1040.80 s
[unix-compat] No cpphs found
1040.80 s
[unix-compat] No doctest found
1040.80 s
[unix-compat] Using gcc version 14.3.0 given by user at:
1040.80 s
[unix-compat] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1040.80 s
[unix-compat] Using ghc version 9.8.1 found on system at:
1040.80 s
[unix-compat] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1040.80 s
[unix-compat] Using ghc-pkg version 9.8.1 found on system at:
1040.80 s
[unix-compat] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1040.80 s
[unix-compat] No ghcjs found
1040.80 s
[unix-compat] No ghcjs-pkg found
1040.80 s
[unix-compat] No greencard found
1040.80 s
[unix-compat] Using haddock version 2.30.0 found on system at:
1040.80 s
[unix-compat] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1040.81 s
[unix-compat] No happy found
1040.81 s
[unix-compat] Using haskell-suite found on system at: haskell-suite-dummy-location
1040.81 s
[unix-compat] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1040.81 s
[unix-compat] No hmake found
1040.81 s
[unix-compat] Using hpc version 0.69 found on system at:
1040.81 s
[unix-compat] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1040.81 s
[unix-compat] Using hsc2hs version 0.68.10 found on system at:
1040.81 s
[unix-compat] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1040.81 s
[unix-compat] Using hscolour version 1.25 found on system at:
1040.81 s
[unix-compat] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1040.81 s
[unix-compat] No jhc found
1040.81 s
[unix-compat] Using ld found on system at:
1040.81 s
[unix-compat] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1040.81 s
[unix-compat] No pkg-config found
1040.81 s
[unix-compat] Using runghc version 9.8.1 found on system at:
1040.81 s
[unix-compat] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1040.81 s
[unix-compat] Using strip version 2.44 found on system at:
1040.81 s
[unix-compat] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1040.81 s
[unix-compat] Using tar found on system at:
1040.81 s
[unix-compat] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1040.81 s
[unix-compat] No uhc found
1040.81 s
[unix-compat] Phase: buildPhase
1040.81 s
[unix-compat] Preprocessing library for unix-compat-0.7.4..
1040.81 s
[unix-compat] Building library for unix-compat-0.7.4..
1040.81 s
[unix-compat] [1 of 8] Compiling System.PosixCompat.Files ( dist/build/System/PosixCompat/Files.hs, dist/build/System/PosixCompat/Files.o, dist/build/System/PosixCompat/Files.dyn_o )
1040.81 s
[unix-compat] [2 of 8] Compiling System.PosixCompat.Process ( src/System/PosixCompat/Process.hs, dist/build/System/PosixCompat/Process.o, dist/build/System/PosixCompat/Process.dyn_o )
1040.81 s
[unix-compat] [3 of 8] Compiling System.PosixCompat.Temp ( src/System/PosixCompat/Temp.hs, dist/build/System/PosixCompat/Temp.o, dist/build/System/PosixCompat/Temp.dyn_o )
1040.81 s
[unix-compat] [4 of 8] Compiling System.PosixCompat.Time ( src/System/PosixCompat/Time.hs, dist/build/System/PosixCompat/Time.o, dist/build/System/PosixCompat/Time.dyn_o )
1040.81 s
[unordered-containers] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1040.81 s
[unordered-containers] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1040.81 s
[unordered-containers] include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
1040.81 s
[unordered-containers] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
1040.81 s
[unordered-containers] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1040.81 s
[unordered-containers] Linked component graph:
1040.81 s
[unordered-containers] unit unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1040.81 s
[unordered-containers] include base-4.19.0.0-b960
1040.81 s
[unordered-containers] include deepseq-1.5.0.0-412f
1040.81 s
[unordered-containers] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1040.81 s
[unordered-containers] include template-haskell-2.21.0.0-8831
1040.81 s
[unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashSet.Internal
1040.81 s
[unordered-containers] unit unordered-containers-0.2.20-2TSXkpknPL65rd0f1WFznb-unordered-containers-tests
1040.82 s
[unordered-containers] include ChasingBottoms-1.3.1.15-FxwScYtjqvxDEc2cZ0Gn1W
1040.82 s
[unordered-containers] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1040.82 s
[unordered-containers] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1040.82 s
[unordered-containers] include base-4.19.0.0-b960
1040.82 s
[unordered-containers] include containers-0.6.8-4775
1040.82 s
[unordered-containers] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1040.82 s
[unordered-containers] include nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
1040.82 s
[unordered-containers] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1040.82 s
[unordered-containers] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1040.82 s
[unordered-containers] include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
1040.83 s
[unordered-containers] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
1040.83 s
[unordered-containers] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1040.83 s
[unordered-containers] Ready component graph:
1040.83 s
[unordered-containers] definite unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1040.83 s
[unordered-containers] depends base-4.19.0.0-b960
1040.83 s
[unordered-containers] depends deepseq-1.5.0.0-412f
1040.83 s
[unordered-containers] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1040.83 s
[unordered-containers] depends template-haskell-2.21.0.0-8831
1040.83 s
[unordered-containers] definite unordered-containers-0.2.20-2TSXkpknPL65rd0f1WFznb-unordered-containers-tests
1040.83 s
[unordered-containers] depends ChasingBottoms-1.3.1.15-FxwScYtjqvxDEc2cZ0Gn1W
1040.83 s
[unordered-containers] depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1040.83 s
[unordered-containers] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1040.83 s
[unordered-containers] depends base-4.19.0.0-b960
1040.83 s
[unordered-containers] depends containers-0.6.8-4775
1040.83 s
[unordered-containers] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1040.83 s
[unordered-containers] depends nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
1040.83 s
[unordered-containers] depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1040.83 s
[unordered-containers] depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1040.83 s
[unordered-containers] depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
1040.83 s
[unordered-containers] depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
1040.83 s
[unordered-containers] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1040.83 s
[unordered-containers] Using Cabal-3.10.2.0 compiled by ghc-9.8
1040.83 s
[unordered-containers] Using compiler: ghc-9.8.1
1040.83 s
[unordered-containers] Using install prefix:
1040.83 s
[unordered-containers] /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20
1040.83 s
[unordered-containers] Executables installed in:
1040.84 s
[unordered-containers] /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20/bin
1040.84 s
[unordered-containers] Libraries installed in:
1040.84 s
[unordered-containers] /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1040.84 s
[unordered-containers] Dynamic Libraries installed in:
1040.84 s
[unordered-containers] /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1040.84 s
[unordered-containers] Private executables installed in:
1040.84 s
[unordered-containers] /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20/libexec/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20
1040.84 s
[unordered-containers] Data files installed in:
1040.84 s
[unordered-containers] /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20/share/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20
1040.84 s
[unordered-containers] Documentation installed in:
1040.84 s
[adjunctions] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1040.84 s
[adjunctions] Using ghc version 9.8.1 found on system at:
1040.84 s
[adjunctions] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1040.84 s
[adjunctions] Using ghc-pkg version 9.8.1 found on system at:
1040.84 s
[adjunctions] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1040.84 s
[adjunctions] No ghcjs found
1040.84 s
[adjunctions] No ghcjs-pkg found
1040.84 s
[adjunctions] No greencard found
1040.84 s
[adjunctions] Using haddock version 2.30.0 found on system at:
1040.84 s
[adjunctions] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1040.84 s
[adjunctions] No happy found
1040.84 s
[adjunctions] Using haskell-suite found on system at: haskell-suite-dummy-location
1040.84 s
[adjunctions] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1040.84 s
[adjunctions] No hmake found
1040.84 s
[adjunctions] Using hpc version 0.69 found on system at:
1040.84 s
[adjunctions] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1040.84 s
[adjunctions] Using hsc2hs version 0.68.10 found on system at:
1040.84 s
[adjunctions] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1040.84 s
[adjunctions] Using hscolour version 1.25 found on system at:
1040.84 s
[adjunctions] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1040.84 s
[adjunctions] No jhc found
1040.84 s
[adjunctions] Using ld found on system at:
1040.84 s
[adjunctions] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1040.84 s
[adjunctions] No pkg-config found
1040.84 s
[adjunctions] Using runghc version 9.8.1 found on system at:
1040.84 s
[adjunctions] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1040.84 s
[adjunctions] Using strip version 2.44 found on system at:
1040.84 s
[adjunctions] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1040.84 s
[adjunctions] Using tar found on system at:
1040.84 s
[adjunctions] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1040.84 s
[adjunctions] No uhc found
1040.84 s
[adjunctions] Phase: buildPhase
1040.84 s
[adjunctions] Preprocessing library for adjunctions-4.4.3..
1040.84 s
[adjunctions] Building library for adjunctions-4.4.3..
1040.84 s
[adjunctions] [ 1 of 11] Compiling Control.Monad.Trans.Conts ( src/Control/Monad/Trans/Conts.hs, dist/build/Control/Monad/Trans/Conts.o, dist/build/Control/Monad/Trans/Conts.dyn_o )
1040.85 s
[adjunctions] [ 2 of 11] Compiling Data.Functor.Contravariant.Rep ( src/Data/Functor/Contravariant/Rep.hs, dist/build/Data/Functor/Contravariant/Rep.o, dist/build/Data/Functor/Contravariant/Rep.dyn_o )
1040.85 s
[adjunctions] [ 3 of 11] Compiling Data.Functor.Contravariant.Adjunction ( src/Data/Functor/Contravariant/Adjunction.hs, dist/build/Data/Functor/Contravariant/Adjunction.o, dist/build/Data/Functor/Contravariant/Adjunction.dyn_o )
1040.85 s
[adjunctions] [ 4 of 11] Compiling Control.Monad.Trans.Contravariant.Adjoint ( src/Control/Monad/Trans/Contravariant/Adjoint.hs, dist/build/Control/Monad/Trans/Contravariant/Adjoint.o, dist/build/Control/Monad/Trans/Contravariant/Adjoint.dyn_o )
1040.86 s
[adjunctions] [ 5 of 11] Compiling Data.Functor.Rep ( src/Data/Functor/Rep.hs, dist/build/Data/Functor/Rep.o, dist/build/Data/Functor/Rep.dyn_o )
1040.86 s
[adjunctions] [ 6 of 11] Compiling Data.Functor.Adjunction ( src/Data/Functor/Adjunction.hs, dist/build/Data/Functor/Adjunction.o, dist/build/Data/Functor/Adjunction.dyn_o )
1040.86 s
[adjunctions] [ 7 of 11] Compiling Control.Monad.Trans.Adjoint ( src/Control/Monad/Trans/Adjoint.hs, dist/build/Control/Monad/Trans/Adjoint.o, dist/build/Control/Monad/Trans/Adjoint.dyn_o )
1040.86 s
[adjunctions] [ 8 of 11] Compiling Control.Comonad.Trans.Adjoint ( src/Control/Comonad/Trans/Adjoint.hs, dist/build/Control/Comonad/Trans/Adjoint.o, dist/build/Control/Comonad/Trans/Adjoint.dyn_o )
1040.86 s
[adjunctions] [ 9 of 11] Compiling Control.Monad.Representable.State ( src/Control/Monad/Representable/State.hs, dist/build/Control/Monad/Representable/State.o, dist/build/Control/Monad/Representable/State.dyn_o )
1040.86 s
[adjunctions] [10 of 11] Compiling Control.Monad.Representable.Reader ( src/Control/Monad/Representable/Reader.hs, dist/build/Control/Monad/Representable/Reader.o, dist/build/Control/Monad/Representable/Reader.dyn_o )
1040.86 s
[adjunctions] [11 of 11] Compiling Control.Comonad.Representable.Store ( src/Control/Comonad/Representable/Store.hs, dist/build/Control/Comonad/Representable/Store.o, dist/build/Control/Comonad/Representable/Store.dyn_o )
1040.86 s
[adjunctions] [ 1 of 11] Compiling Control.Monad.Trans.Conts ( src/Control/Monad/Trans/Conts.hs, dist/build/Control/Monad/Trans/Conts.p_o )
1040.86 s
[adjunctions] [ 2 of 11] Compiling Data.Functor.Contravariant.Rep ( src/Data/Functor/Contravariant/Rep.hs, dist/build/Data/Functor/Contravariant/Rep.p_o )
1040.86 s
[adjunctions] [ 3 of 11] Compiling Data.Functor.Contravariant.Adjunction ( src/Data/Functor/Contravariant/Adjunction.hs, dist/build/Data/Functor/Contravariant/Adjunction.p_o )
1040.86 s
[algebraic-graphs] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1040.86 s
[algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
1040.86 s
[algebraic-graphs] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1040.86 s
[algebraic-graphs] Using hscolour version 1.25 found on system at:
1040.86 s
[algebraic-graphs] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1040.86 s
[algebraic-graphs] No jhc found
1040.86 s
[algebraic-graphs] Using ld found on system at:
1040.86 s
[algebraic-graphs] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1040.86 s
[algebraic-graphs] No pkg-config found
1040.86 s
[algebraic-graphs] Using runghc version 9.8.1 found on system at:
1040.86 s
[algebraic-graphs] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1040.86 s
[algebraic-graphs] Using strip version 2.44 found on system at:
1040.86 s
[algebraic-graphs] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1040.86 s
[algebraic-graphs] Using tar found on system at:
1040.86 s
[algebraic-graphs] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1040.86 s
[algebraic-graphs] No uhc found
1040.86 s
[algebraic-graphs] Phase: buildPhase
1040.86 s
[algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
1040.86 s
[algebraic-graphs] Building library for algebraic-graphs-0.7..
1040.86 s
[algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.o, dist/build/Algebra/Graph/AdjacencyMap.dyn_o )
1040.86 s
[algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.o, dist/build/Algebra/Graph/AdjacencyIntMap.dyn_o )
1040.86 s
[algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.dyn_o )
1040.86 s
[algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.o, dist/build/Algebra/Graph/Internal.dyn_o )
1040.86 s
[algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
1040.86 s
[algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.o, dist/build/Algebra/Graph/HigherKinded/Class.dyn_o )
1040.86 s
[algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.dyn_o )
1040.86 s
[algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.dyn_o )
1040.86 s
[filepattern] |
1040.86 s
[filepattern] 16 | f xs = Tree (map fst empty) [(fst $ head gs, f $ map snd gs) | gs <- groups]
1040.86 s
[filepattern] | ^^^^
1040.86 s
[filepattern] [4 of 8] Compiling System.FilePattern.Wildcard ( src/System/FilePattern/Wildcard.hs, dist/build/System/FilePattern/Wildcard.p_o )
1040.86 s
[filepattern] [5 of 8] Compiling System.FilePattern.Core ( src/System/FilePattern/Core.hs, dist/build/System/FilePattern/Core.p_o )
1040.86 s
[filepattern] [6 of 8] Compiling System.FilePattern.Step ( src/System/FilePattern/Step.hs, dist/build/System/FilePattern/Step.p_o )
1040.86 s
[filepattern] [7 of 8] Compiling System.FilePattern.Directory ( src/System/FilePattern/Directory.hs, dist/build/System/FilePattern/Directory.p_o )
1040.86 s
[filepattern] [8 of 8] Compiling System.FilePattern ( src/System/FilePattern.hs, dist/build/System/FilePattern.p_o )
1040.86 s
[filepattern] Preprocessing test suite 'filepattern-test' for filepattern-0.1.3..
1040.86 s
[filepattern] Building test suite 'filepattern-test' for filepattern-0.1.3..
1040.86 s
[filepattern] [1 of 3] Compiling Test.Util ( test/Test/Util.hs, dist/build/filepattern-test/filepattern-test-tmp/Test/Util.o )
1040.86 s
[ghc-exactprint] depends containers-0.6.8-4775
1040.86 s
[ghc-exactprint] depends data-default-0.7.1.3-2DC1QaEMC8oIg9ubW4Htvy
1040.86 s
[ghc-exactprint] depends directory-1.3.8.1-6a8e
1040.86 s
[ghc-exactprint] depends extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1040.86 s
[ghc-exactprint] depends filepath-1.4.100.4-fa1c
1040.86 s
[ghc-exactprint] depends ghc-9.8.1-f1e9
1040.86 s
[ghc-exactprint] depends ghc-boot-9.8.1-d7dd
1040.86 s
[ghc-exactprint] depends ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe
1040.86 s
[ghc-exactprint] depends ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC
1040.86 s
[ghc-exactprint] depends mtl-2.3.1-63a4
1040.86 s
[ghc-exactprint] depends ordered-containers-0.2.4-Ene2my0ZxDoJ5DMj7wTwY3
1040.86 s
[ghc-exactprint] depends silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT
1040.86 s
[ghc-exactprint] depends syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
1040.86 s
[ghc-exactprint] Using Cabal-3.10.2.0 compiled by ghc-9.8
1040.86 s
[ghc-exactprint] Using compiler: ghc-9.8.1
1040.86 s
[ghc-exactprint] Using install prefix:
1040.86 s
[ghc-exactprint] /nix/store/0gihdd6x1zsqkgkzxg8zyfshm5i8xpa8-ghc-exactprint-1.8.0.0
1040.87 s
[ghc-exactprint] Executables installed in:
1040.87 s
[ghc-exactprint] /nix/store/0gihdd6x1zsqkgkzxg8zyfshm5i8xpa8-ghc-exactprint-1.8.0.0/bin
1040.87 s
[ghc-exactprint] Libraries installed in:
1040.87 s
[ghc-exactprint] /nix/store/0gihdd6x1zsqkgkzxg8zyfshm5i8xpa8-ghc-exactprint-1.8.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/ghc-exactprint-1.8.0.0-8Ww2N4V3QQQIYlk5wWtlVe
1040.87 s
[ghc-exactprint] Dynamic Libraries installed in:
1040.87 s
[ghc-exactprint] /nix/store/0gihdd6x1zsqkgkzxg8zyfshm5i8xpa8-ghc-exactprint-1.8.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1040.87 s
[ghc-exactprint] Private executables installed in:
1040.87 s
[ghc-exactprint] /nix/store/0gihdd6x1zsqkgkzxg8zyfshm5i8xpa8-ghc-exactprint-1.8.0.0/libexec/x86_64-linux-ghc-9.8.1/ghc-exactprint-1.8.0.0
1040.87 s
[ghc-exactprint] Data files installed in:
1040.87 s
[ghc-exactprint] /nix/store/0gihdd6x1zsqkgkzxg8zyfshm5i8xpa8-ghc-exactprint-1.8.0.0/share/x86_64-linux-ghc-9.8.1/ghc-exactprint-1.8.0.0
1040.87 s
[ghc-exactprint] Documentation installed in:
1040.87 s
[ghc-exactprint] /nix/store/71miwyql5wd2ni8rilshlxahbx46raj8-ghc-exactprint-1.8.0.0-doc/share/doc/ghc-exactprint-1.8.0.0
1040.87 s
[ghc-exactprint] Configuration files installed in:
1040.87 s
[ghc-exactprint] /nix/store/0gihdd6x1zsqkgkzxg8zyfshm5i8xpa8-ghc-exactprint-1.8.0.0/etc
1040.87 s
[ghc-exactprint] No alex found
1040.87 s
[ghc-exactprint] Using ar found on system at:
1040.87 s
[ghc-exactprint] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1040.87 s
[ghc-exactprint] No c2hs found
1040.87 s
[ghc-exactprint] No cpphs found
1040.87 s
[ghc-exactprint] No doctest found
1040.87 s
[ghc-exactprint] Using gcc version 14.3.0 given by user at:
1040.87 s
[ghc-exactprint] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1040.87 s
[ghc-exactprint] Using ghc version 9.8.1 found on system at:
1040.87 s
[ghc-exactprint] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1040.87 s
[ghc-exactprint] Using ghc-pkg version 9.8.1 found on system at:
1040.87 s
[ghc-exactprint] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1040.87 s
[ghc-exactprint] No ghcjs found
1040.87 s
[ghc-exactprint] No ghcjs-pkg found
1040.87 s
[ghc-exactprint] No greencard found
1040.87 s
[ghc-exactprint] Using haddock version 2.30.0 found on system at:
1040.87 s
[ghc-exactprint] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1040.87 s
[ghc-exactprint] No happy found
1040.87 s
[ghc-exactprint] Using haskell-suite found on system at: haskell-suite-dummy-location
1040.87 s
[ghc-exactprint] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1040.87 s
[ghc-exactprint] No hmake found
1040.88 s
[ghc-exactprint] Using hpc version 0.69 found on system at:
1040.88 s
[ghc-exactprint] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1040.88 s
[ghc-exactprint] Using hsc2hs version 0.68.10 found on system at:
1040.88 s
[ghc-exactprint] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1040.88 s
[ghc-exactprint] Using hscolour version 1.25 found on system at:
1040.88 s
[ghc-exactprint] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1040.88 s
[ghc-exactprint] No jhc found
1040.88 s
[ghc-exactprint] Using ld found on system at:
1040.88 s
[ghc-exactprint] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1040.88 s
[ghc-exactprint] No pkg-config found
1040.88 s
[ghc-exactprint] Using runghc version 9.8.1 found on system at:
1040.88 s
[ghc-exactprint] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1040.88 s
[ghc-exactprint] Using strip version 2.44 found on system at:
1040.88 s
[ghc-exactprint] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1040.88 s
[ghc-exactprint] Using tar found on system at:
1040.88 s
[ghc-exactprint] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1040.88 s
[ghc-exactprint] No uhc found
1040.88 s
[ghc-exactprint] Phase: buildPhase
1040.88 s
[ghc-exactprint] Preprocessing library for ghc-exactprint-1.8.0.0..
1040.88 s
[ghc-exactprint] Building library for ghc-exactprint-1.8.0.0..
1040.88 s
[ghc-exactprint] [ 1 of 10] Compiling Language.Haskell.GHC.ExactPrint.Dump ( src/Language/Haskell/GHC/ExactPrint/Dump.hs, dist/build/Language/Haskell/GHC/ExactPrint/Dump.o, dist/build/Language/Haskell/GHC/ExactPrint/Dump.dyn_o )
1040.88 s
[ghc-lib-parser-ex] /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2/share/x86_64-linux-ghc-9.8.1/ghc-lib-parser-ex-9.8.0.2
1040.88 s
[ghc-lib-parser-ex] Documentation installed in:
1040.88 s
[ghc-lib-parser-ex] /nix/store/xyiz5m8cd715vsb5ik7birf0zklz4rj4-ghc-lib-parser-ex-9.8.0.2-doc/share/doc/ghc-lib-parser-ex-9.8.0.2
1040.88 s
[ghc-lib-parser-ex] Configuration files installed in:
1040.88 s
[ghc-lib-parser-ex] /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2/etc
1040.88 s
[ghc-lib-parser-ex] No alex found
1040.88 s
[ghc-lib-parser-ex] Using ar found on system at:
1040.88 s
[ghc-lib-parser-ex] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1040.89 s
[ghc-lib-parser-ex] No c2hs found
1040.89 s
[ghc-lib-parser-ex] No cpphs found
1040.89 s
[ghc-lib-parser-ex] No doctest found
1040.89 s
[ghc-lib-parser-ex] Using gcc version 14.3.0 given by user at:
1040.89 s
[ghc-lib-parser-ex] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1040.89 s
[ghc-lib-parser-ex] Using ghc version 9.8.1 found on system at:
1040.89 s
[ghc-lib-parser-ex] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1040.89 s
[ghc-lib-parser-ex] Using ghc-pkg version 9.8.1 found on system at:
1040.89 s
[ghc-lib-parser-ex] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1040.89 s
[ghc-lib-parser-ex] No ghcjs found
1040.89 s
[ghc-lib-parser-ex] No ghcjs-pkg found
1040.89 s
[ghc-lib-parser-ex] No greencard found
1040.89 s
[ghc-lib-parser-ex] Using haddock version 2.30.0 found on system at:
1040.89 s
[ghc-lib-parser-ex] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1040.89 s
[ghc-lib-parser-ex] No happy found
1040.89 s
[ghc-lib-parser-ex] Using haskell-suite found on system at: haskell-suite-dummy-location
1040.89 s
[ghc-lib-parser-ex] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1040.89 s
[ghc-lib-parser-ex] No hmake found
1040.89 s
[ghc-lib-parser-ex] Using hpc version 0.69 found on system at:
1040.89 s
[ghc-lib-parser-ex] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1040.89 s
[ghc-lib-parser-ex] Using hsc2hs version 0.68.10 found on system at:
1040.89 s
[ghc-lib-parser-ex] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1040.89 s
[ghc-lib-parser-ex] Using hscolour version 1.25 found on system at:
1040.89 s
[ghc-lib-parser-ex] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1040.89 s
[ghc-lib-parser-ex] No jhc found
1040.89 s
[ghc-lib-parser-ex] Using ld found on system at:
1040.89 s
[ghc-lib-parser-ex] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1040.89 s
[ghc-lib-parser-ex] No pkg-config found
1040.89 s
[ghc-lib-parser-ex] Using runghc version 9.8.1 found on system at:
1040.89 s
[ghc-lib-parser-ex] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1040.89 s
[ghc-lib-parser-ex] Using strip version 2.44 found on system at:
1040.89 s
[ghc-lib-parser-ex] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1040.89 s
[ghc-lib-parser-ex] Using tar found on system at:
1040.89 s
[ghc-lib-parser-ex] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1040.89 s
[ghc-lib-parser-ex] No uhc found
1040.89 s
[ghc-lib-parser-ex] Phase: buildPhase
1040.89 s
[ghc-lib-parser-ex] Preprocessing library for ghc-lib-parser-ex-9.8.0.2..
1040.89 s
[ghc-lib-parser-ex] Building library for ghc-lib-parser-ex-9.8.0.2..
1040.89 s
[ghc-lib-parser-ex] [ 1 of 18] Compiling Language.Haskell.GhclibParserEx.Dump ( src/Language/Haskell/GhclibParserEx/Dump.hs, dist/build/Language/Haskell/GhclibParserEx/Dump.o, dist/build/Language/Haskell/GhclibParserEx/Dump.dyn_o )
1040.90 s
[ghc-lib-parser-ex] [ 2 of 18] Compiling Language.Haskell.GhclibParserEx.Fixity ( src/Language/Haskell/GhclibParserEx/Fixity.hs, dist/build/Language/Haskell/GhclibParserEx/Fixity.o, dist/build/Language/Haskell/GhclibParserEx/Fixity.dyn_o )
1040.90 s
[ghc-lib-parser-ex] [ 3 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Driver.Flags ( src/Language/Haskell/GhclibParserEx/GHC/Driver/Flags.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Driver/Flags.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Driver/Flags.dyn_o )
1040.90 s
[ghc-lib-parser-ex] [ 4 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Driver.Session ( src/Language/Haskell/GhclibParserEx/GHC/Driver/Session.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Driver/Session.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Driver/Session.dyn_o )
1040.90 s
[ghc-lib-parser-ex] [ 5 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs ( src/Language/Haskell/GhclibParserEx/GHC/Hs.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs.dyn_o )
1040.90 s
[ghc-lib-parser-ex] [ 6 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Binds ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Binds.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Binds.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Binds.dyn_o )
1040.90 s
[ghc-lib-parser-ex] [ 7 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Decls ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Decls.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Decls.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Decls.dyn_o )
1040.90 s
[regex-tdfa] text and pattern: "-"
1040.90 s
[regex-tdfa] Regex pattern: "(^)*"
1040.90 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1040.90 s
[regex-tdfa]
1040.90 s
[regex-tdfa] Expected Pass #72
1040.90 s
[regex-tdfa] text and pattern: "abbbcd"
1040.90 s
[regex-tdfa] Regex pattern: "([abc])*d"
1040.90 s
[regex-tdfa] Outputs agree: "(0,6)(4,5)"
1040.90 s
[regex-tdfa]
1040.90 s
[regex-tdfa] Expected Pass #73
1040.90 s
[regex-tdfa] text and pattern: "abcd"
1040.90 s
[regex-tdfa] Regex pattern: "([abc])*bcd"
1040.90 s
[regex-tdfa] Outputs agree: "(0,4)(0,1)"
1040.90 s
[regex-tdfa]
1040.90 s
[regex-tdfa] Expected Pass #74
1040.90 s
[regex-tdfa] text and pattern: "e"
1040.90 s
[regex-tdfa] Regex pattern: "a|b|c|d|e"
1040.90 s
[regex-tdfa] Outputs agree: "(0,1)"
1040.90 s
[regex-tdfa]
1040.90 s
[regex-tdfa] Expected Pass #75
1040.90 s
[regex-tdfa] text and pattern: "ef"
1040.90 s
[regex-tdfa] Regex pattern: "(a|b|c|d|e)f"
1040.90 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)"
1040.90 s
[regex-tdfa]
1040.90 s
[regex-tdfa] Expected Pass #76
1040.90 s
[regex-tdfa] text and pattern: "-"
1040.90 s
[regex-tdfa] Regex pattern: "((a*|b))*"
1040.90 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)(0,0)"
1040.90 s
[regex-tdfa]
1040.90 s
[regex-tdfa] Expected Pass #77
1040.90 s
[regex-tdfa] text and pattern: "abcde"
1040.90 s
[regex-tdfa] Regex pattern: "(ab|cd)e"
1040.90 s
[regex-tdfa] Outputs agree: "(2,5)(2,4)"
1040.90 s
[regex-tdfa]
1040.90 s
[regex-tdfa] Expected Pass #78
1040.90 s
[regex-tdfa] text and pattern: "abcd"
1040.90 s
[regex-tdfa] Regex pattern: "(a|b)c*d"
1040.90 s
[regex-tdfa] Outputs agree: "(1,4)(1,2)"
1040.90 s
[regex-tdfa]
1040.91 s
[regex-tdfa] Expected Pass #79
1040.91 s
[regex-tdfa] text and pattern: "abc"
1040.91 s
[regex-tdfa] Regex pattern: "(ab|ab*)bc"
1040.91 s
[regex-tdfa] Outputs agree: "(0,3)(0,1)"
1040.91 s
[regex-tdfa]
1040.91 s
[regex-tdfa] Expected Pass #80
1040.91 s
[regex-tdfa] text and pattern: "abc"
1040.91 s
[regex-tdfa] Regex pattern: "a([bc]*)c*"
1040.91 s
[regex-tdfa] Outputs agree: "(0,3)(1,3)"
1040.91 s
[regex-tdfa]
1040.91 s
[regex-tdfa] Expected Pass #81
1040.91 s
[regex-tdfa] text and pattern: "abcd"
1040.91 s
[regex-tdfa] Regex pattern: "a([bc]*)(c*d)"
1040.91 s
[regex-tdfa] Outputs agree: "(0,4)(1,3)(3,4)"
1040.91 s
[regex-tdfa]
1040.91 s
[regex-tdfa] Expected Pass #82
1040.91 s
[regex-tdfa] text and pattern: "abcd"
1040.91 s
[regex-tdfa] Regex pattern: "a([bc]+)(c*d)"
1040.91 s
[regex-tdfa] Outputs agree: "(0,4)(1,3)(3,4)"
1040.91 s
[regex-tdfa]
1040.91 s
[regex-tdfa] Expected Pass #83
1040.91 s
[regex-tdfa] text and pattern: "abcd"
1040.91 s
[regex-tdfa] Regex pattern: "a([bc]*)(c+d)"
1040.91 s
[regex-tdfa] Outputs agree: "(0,4)(1,2)(2,4)"
1040.91 s
[regex-tdfa]
1040.91 s
[regex-tdfa] Expected Pass #84
1040.91 s
[regex-tdfa] text and pattern: "adcdcde"
1040.91 s
[regex-tdfa] Regex pattern: "a[bcd]*dcdcde"
1040.91 s
[regex-tdfa] Outputs agree: "(0,7)"
1040.91 s
[regex-tdfa]
1040.91 s
[regex-tdfa] Expected Pass #85
1040.91 s
[regex-tdfa] text and pattern: "abc"
1040.91 s
[regex-tdfa] Regex pattern: "(ab|a)b*c"
1040.91 s
[regex-tdfa] Outputs agree: "(0,3)(0,2)"
1040.91 s
[regex-tdfa]
1040.91 s
[regex-tdfa] Expected Pass #86
1040.91 s
[regex-tdfa] text and pattern: "abcd"
1040.91 s
[regex-tdfa] Regex pattern: "((a)(b)c)(d)"
1040.91 s
[regex-tdfa] Outputs agree: "(0,4)(0,3)(0,1)(1,2)(3,4)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #87
1040.92 s
[regex-tdfa] text and pattern: "abh"
1040.92 s
[regex-tdfa] Regex pattern: "^a(bc+|b[eh])g|.h$"
1040.92 s
[regex-tdfa] Outputs agree: "(1,3)(-1,-1)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #88
1040.92 s
[regex-tdfa] text and pattern: "effgz"
1040.92 s
[regex-tdfa] Regex pattern: "(bc+d$|ef*g.|h?i(j|k))"
1040.92 s
[regex-tdfa] Outputs agree: "(0,5)(0,5)(-1,-1)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #89
1040.92 s
[regex-tdfa] text and pattern: "ij"
1040.92 s
[regex-tdfa] Regex pattern: "(bc+d$|ef*g.|h?i(j|k))"
1040.92 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(1,2)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #90
1040.92 s
[regex-tdfa] text and pattern: "reffgz"
1040.92 s
[regex-tdfa] Regex pattern: "(bc+d$|ef*g.|h?i(j|k))"
1040.92 s
[regex-tdfa] Outputs agree: "(1,6)(1,6)(-1,-1)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #91
1040.92 s
[regex-tdfa] text and pattern: "a"
1040.92 s
[regex-tdfa] Regex pattern: "(((((((((a)))))))))"
1040.92 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)(0,1)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #92
1040.92 s
[regex-tdfa] text and pattern: "abcde"
1040.92 s
[regex-tdfa] Regex pattern: "(.*)c(.*)"
1040.92 s
[regex-tdfa] Outputs agree: "(0,5)(0,2)(3,5)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #93
1040.92 s
[regex-tdfa] text and pattern: "abcd"
1040.92 s
[regex-tdfa] Regex pattern: "a(bc)d"
1040.92 s
[regex-tdfa] Outputs agree: "(0,4)(1,3)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #94
1040.92 s
[regex-tdfa] text and pattern: "a\STXc"
1040.92 s
[regex-tdfa] Regex pattern: "a[\SOH-\ETX]?c"
1040.92 s
[regex-tdfa] Outputs agree: "(0,3)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #95
1040.92 s
[regex-tdfa] text and pattern: "Muammar_Qaddafi"
1040.92 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.92 s
[regex-tdfa] Outputs agree: "(0,15)(-1,-1)(10,12)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #96
1040.92 s
[regex-tdfa] text and pattern: "Mo'ammar_Gadhafi"
1040.92 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.92 s
[regex-tdfa] Outputs agree: "(0,16)(-1,-1)(11,13)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #97
1040.92 s
[regex-tdfa] text and pattern: "Muammar_Kaddafi"
1040.92 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.92 s
[regex-tdfa] Outputs agree: "(0,15)(-1,-1)(10,12)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #98
1040.92 s
[regex-tdfa] text and pattern: "Muammar_Qadhafi"
1040.92 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.92 s
[regex-tdfa] Outputs agree: "(0,15)(-1,-1)(10,12)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #99
1040.92 s
[regex-tdfa] text and pattern: "Muammar_Gadafi"
1040.92 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.92 s
[regex-tdfa] Outputs agree: "(0,14)(-1,-1)(10,11)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #100
1040.92 s
[regex-tdfa] text and pattern: "Mu'ammar_Qadafi"
1040.92 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.92 s
[regex-tdfa] Outputs agree: "(0,15)(-1,-1)(11,12)"
1040.92 s
[regex-tdfa]
1040.92 s
[regex-tdfa] Expected Pass #101
1040.92 s
[regex-tdfa] text and pattern: "Moamar_Gaddafi"
1040.92 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.93 s
[regex-tdfa] Outputs agree: "(0,14)(-1,-1)(9,11)"
1040.93 s
[regex-tdfa]
1040.93 s
[regex-tdfa] Expected Pass #102
1040.93 s
[regex-tdfa] text and pattern: "Mu'ammar_Qadhdhafi"
1040.93 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.93 s
[regex-tdfa] Outputs agree: "(0,18)(-1,-1)(13,15)"
1040.93 s
[regex-tdfa]
1040.93 s
[regex-tdfa] Expected Pass #103
1040.93 s
[regex-tdfa] text and pattern: "Muammar_Khaddafi"
1040.93 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.93 s
[unix-compat] [5 of 8] Compiling System.PosixCompat.Types ( src/System/PosixCompat/Types.hs, dist/build/System/PosixCompat/Types.o, dist/build/System/PosixCompat/Types.dyn_o )
1040.93 s
[unix-compat] [6 of 8] Compiling System.PosixCompat.Extensions ( dist/build/System/PosixCompat/Extensions.hs, dist/build/System/PosixCompat/Extensions.o, dist/build/System/PosixCompat/Extensions.dyn_o )
1040.93 s
[unix-compat] [7 of 8] Compiling System.PosixCompat.Unistd ( src/System/PosixCompat/Unistd.hs, dist/build/System/PosixCompat/Unistd.o, dist/build/System/PosixCompat/Unistd.dyn_o )
1040.93 s
[unix-compat] [8 of 8] Compiling System.PosixCompat ( src/System/PosixCompat.hs, dist/build/System/PosixCompat.o, dist/build/System/PosixCompat.dyn_o )
1040.93 s
[unix-compat] [1 of 8] Compiling System.PosixCompat.Files ( dist/build/System/PosixCompat/Files.hs, dist/build/System/PosixCompat/Files.p_o )
1040.93 s
[unix-compat] [2 of 8] Compiling System.PosixCompat.Process ( src/System/PosixCompat/Process.hs, dist/build/System/PosixCompat/Process.p_o )
1040.93 s
[unix-compat] [3 of 8] Compiling System.PosixCompat.Temp ( src/System/PosixCompat/Temp.hs, dist/build/System/PosixCompat/Temp.p_o )
1040.93 s
[unix-compat] [4 of 8] Compiling System.PosixCompat.Time ( src/System/PosixCompat/Time.hs, dist/build/System/PosixCompat/Time.p_o )
1040.93 s
[unix-compat] [5 of 8] Compiling System.PosixCompat.Types ( src/System/PosixCompat/Types.hs, dist/build/System/PosixCompat/Types.p_o )
1040.93 s
[unix-compat] [6 of 8] Compiling System.PosixCompat.Extensions ( dist/build/System/PosixCompat/Extensions.hs, dist/build/System/PosixCompat/Extensions.p_o )
1040.93 s
[unix-compat] [7 of 8] Compiling System.PosixCompat.Unistd ( src/System/PosixCompat/Unistd.hs, dist/build/System/PosixCompat/Unistd.p_o )
1040.93 s
[unix-compat] [8 of 8] Compiling System.PosixCompat ( src/System/PosixCompat.hs, dist/build/System/PosixCompat.p_o )
1040.93 s
[unix-compat] Preprocessing test suite 'unix-compat-testsuite' for unix-compat-0.7.4..
1040.93 s
[unix-compat] Building test suite 'unix-compat-testsuite' for unix-compat-0.7.4..
1040.93 s
[unix-compat] [1 of 4] Compiling LinksSpec ( tests/LinksSpec.hs, dist/build/unix-compat-testsuite/unix-compat-testsuite-tmp/LinksSpec.o )
1040.93 s
[unix-compat] [2 of 4] Compiling MkstempSpec ( tests/MkstempSpec.hs, dist/build/unix-compat-testsuite/unix-compat-testsuite-tmp/MkstempSpec.o )
1040.93 s
[unix-compat] [3 of 4] Compiling ProcessSpec ( tests/ProcessSpec.hs, dist/build/unix-compat-testsuite/unix-compat-testsuite-tmp/ProcessSpec.o )
1040.93 s
[unix-compat] [4 of 4] Compiling Main ( tests/main.hs, dist/build/unix-compat-testsuite/unix-compat-testsuite-tmp/Main.o )
1040.93 s
[unix-compat] [5 of 5] Linking dist/build/unix-compat-testsuite/unix-compat-testsuite
1040.93 s
[unordered-containers] /nix/store/w05py57xs6l3yqdyn4vf7shdkxabiy5h-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20
1040.93 s
[unordered-containers] Configuration files installed in:
1040.93 s
[unordered-containers] /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20/etc
1040.93 s
[unordered-containers] No alex found
1040.93 s
[unordered-containers] Using ar found on system at:
1040.93 s
[unordered-containers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1040.93 s
[unordered-containers] No c2hs found
1040.93 s
[unordered-containers] No cpphs found
1040.93 s
[unordered-containers] No doctest found
1040.93 s
[unordered-containers] Using gcc version 14.3.0 given by user at:
1040.93 s
[unordered-containers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1040.93 s
[unordered-containers] Using ghc version 9.8.1 found on system at:
1040.93 s
[unordered-containers] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1040.93 s
[unordered-containers] Using ghc-pkg version 9.8.1 found on system at:
1040.93 s
[unordered-containers] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1040.93 s
[unordered-containers] No ghcjs found
1040.93 s
[unordered-containers] No ghcjs-pkg found
1040.93 s
[unordered-containers] No greencard found
1040.93 s
[unordered-containers] Using haddock version 2.30.0 found on system at:
1040.93 s
[unordered-containers] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1040.93 s
[unordered-containers] No happy found
1040.93 s
[unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
1040.93 s
[unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1040.93 s
[unordered-containers] No hmake found
1040.93 s
[unordered-containers] Using hpc version 0.69 found on system at:
1040.93 s
[unordered-containers] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1040.93 s
[unordered-containers] Using hsc2hs version 0.68.10 found on system at:
1040.93 s
[unordered-containers] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1040.93 s
[unordered-containers] Using hscolour version 1.25 found on system at:
1040.93 s
[unordered-containers] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1040.93 s
[unordered-containers] No jhc found
1040.93 s
[unordered-containers] Using ld found on system at:
1040.93 s
[unordered-containers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1040.93 s
[unordered-containers] No pkg-config found
1040.93 s
[unordered-containers] Using runghc version 9.8.1 found on system at:
1040.93 s
[unordered-containers] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1040.93 s
[unordered-containers] Using strip version 2.44 found on system at:
1040.93 s
[unordered-containers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1040.93 s
[unordered-containers] Using tar found on system at:
1040.93 s
[unordered-containers] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1040.93 s
[unordered-containers] No uhc found
1040.94 s
[unordered-containers] Phase: buildPhase
1040.94 s
[unordered-containers] Preprocessing library for unordered-containers-0.2.20..
1040.94 s
[unordered-containers] Building library for unordered-containers-0.2.20..
1040.94 s
[unordered-containers]
1040.94 s
[unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning : [ GHC-53692 ] [ -Wdeprecated-flags ]
1040.94 s
[unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
1040.94 s
[unordered-containers] |
1040.94 s
[unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
1040.94 s
[unordered-containers] | ^^^^^^^^^^
1040.94 s
[unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.o, dist/build/Data/HashMap/Internal/Array.dyn_o )
1040.94 s
[unordered-containers]
1040.94 s
[unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning : [ GHC-66111 ] [ -Wunused-imports ]
1040.94 s
[unordered-containers] The import of ‘Control.Applicative’ is redundant
1040.94 s
[unordered-containers] except perhaps to import instances from ‘Control.Applicative’
1040.94 s
[unordered-containers] To import instances alone, use: import Control.Applicative()
1040.94 s
[unordered-containers] |
1040.94 s
[unordered-containers] 83 | import Control.Applicative (liftA2)
1040.94 s
[unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1040.94 s
[unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.o, dist/build/Data/HashMap/Internal/List.dyn_o )
1040.94 s
[unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.o, dist/build/Data/HashMap/Internal.dyn_o )
1040.94 s
[adjunctions] [ 4 of 11] Compiling Control.Monad.Trans.Contravariant.Adjoint ( src/Control/Monad/Trans/Contravariant/Adjoint.hs, dist/build/Control/Monad/Trans/Contravariant/Adjoint.p_o )
1040.94 s
[adjunctions] [ 5 of 11] Compiling Data.Functor.Rep ( src/Data/Functor/Rep.hs, dist/build/Data/Functor/Rep.p_o )
1040.94 s
[adjunctions] [ 6 of 11] Compiling Data.Functor.Adjunction ( src/Data/Functor/Adjunction.hs, dist/build/Data/Functor/Adjunction.p_o )
1040.94 s
[adjunctions] [ 7 of 11] Compiling Control.Monad.Trans.Adjoint ( src/Control/Monad/Trans/Adjoint.hs, dist/build/Control/Monad/Trans/Adjoint.p_o )
1040.94 s
[adjunctions] [ 8 of 11] Compiling Control.Comonad.Trans.Adjoint ( src/Control/Comonad/Trans/Adjoint.hs, dist/build/Control/Comonad/Trans/Adjoint.p_o )
1040.94 s
[adjunctions] [ 9 of 11] Compiling Control.Monad.Representable.State ( src/Control/Monad/Representable/State.hs, dist/build/Control/Monad/Representable/State.p_o )
1040.94 s
[adjunctions] [10 of 11] Compiling Control.Monad.Representable.Reader ( src/Control/Monad/Representable/Reader.hs, dist/build/Control/Monad/Representable/Reader.p_o )
1040.94 s
[adjunctions] [11 of 11] Compiling Control.Comonad.Representable.Store ( src/Control/Comonad/Representable/Store.hs, dist/build/Control/Comonad/Representable/Store.p_o )
1040.94 s
[ghc-lib-parser-ex] [ 8 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.ExtendInstances ( src/Language/Haskell/GhclibParserEx/GHC/Hs/ExtendInstances.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/ExtendInstances.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/ExtendInstances.dyn_o )
1040.94 s
[ghc-lib-parser-ex] [ 9 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.ImpExp ( src/Language/Haskell/GhclibParserEx/GHC/Hs/ImpExp.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/ImpExp.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/ImpExp.dyn_o )
1040.94 s
[ghc-lib-parser-ex] [10 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Pat ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.dyn_o )
1040.94 s
[ghc-lib-parser-ex] [11 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Type ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Type.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Type.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Type.dyn_o )
1040.94 s
[ghc-lib-parser-ex] [12 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Types ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Types.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Types.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Types.dyn_o )
1040.94 s
[ghc-lib-parser-ex] [13 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Parser ( src/Language/Haskell/GhclibParserEx/GHC/Parser.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Parser.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Parser.dyn_o )
1040.94 s
[ghc-lib-parser-ex] [14 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Settings.Config ( src/Language/Haskell/GhclibParserEx/GHC/Settings/Config.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Settings/Config.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Settings/Config.dyn_o )
1040.94 s
[ghc-lib-parser-ex] [15 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Types.Name.Reader ( src/Language/Haskell/GhclibParserEx/GHC/Types/Name/Reader.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Types/Name/Reader.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Types/Name/Reader.dyn_o )
1040.94 s
[ghc-lib-parser-ex] [16 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Expr ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.dyn_o )
1040.94 s
[ghc-lib-parser-ex] [17 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Utils.Outputable ( src/Language/Haskell/GhclibParserEx/GHC/Utils/Outputable.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Utils/Outputable.o, dist/build/Language/Haskell/GhclibParserEx/GHC/Utils/Outputable.dyn_o )
1040.94 s
[ghc-lib-parser-ex] [18 of 18] Compiling Paths_ghc_lib_parser_ex ( dist/build/autogen/Paths_ghc_lib_parser_ex.hs, dist/build/Paths_ghc_lib_parser_ex.o, dist/build/Paths_ghc_lib_parser_ex.dyn_o )
1040.94 s
[ghc-lib-parser-ex] [ 1 of 18] Compiling Language.Haskell.GhclibParserEx.Dump ( src/Language/Haskell/GhclibParserEx/Dump.hs, dist/build/Language/Haskell/GhclibParserEx/Dump.p_o )
1040.94 s
[ghc-lib-parser-ex] [ 2 of 18] Compiling Language.Haskell.GhclibParserEx.Fixity ( src/Language/Haskell/GhclibParserEx/Fixity.hs, dist/build/Language/Haskell/GhclibParserEx/Fixity.p_o )
1040.94 s
[regex-tdfa] Outputs agree: "(0,16)(-1,-1)(11,13)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #104
1040.94 s
[regex-tdfa] text and pattern: "Muammar_Ghaddafy"
1040.94 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.94 s
[regex-tdfa] Outputs agree: "(0,16)(-1,-1)(11,13)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #105
1040.94 s
[regex-tdfa] text and pattern: "Muammar_Ghadafi"
1040.94 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.94 s
[regex-tdfa] Outputs agree: "(0,15)(-1,-1)(11,12)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #106
1040.94 s
[regex-tdfa] text and pattern: "Muammar_Ghaddafi"
1040.94 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.94 s
[regex-tdfa] Outputs agree: "(0,16)(-1,-1)(11,13)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #107
1040.94 s
[regex-tdfa] text and pattern: "Muamar_Kaddafi"
1040.94 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.94 s
[regex-tdfa] Outputs agree: "(0,14)(-1,-1)(9,11)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #108
1040.94 s
[regex-tdfa] text and pattern: "Muammar_Quathafi"
1040.94 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.94 s
[regex-tdfa] Outputs agree: "(0,16)(-1,-1)(11,13)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #109
1040.94 s
[regex-tdfa] text and pattern: "Muammar_Gheddafi"
1040.94 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.94 s
[regex-tdfa] Outputs agree: "(0,16)(-1,-1)(11,13)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #110
1040.94 s
[regex-tdfa] text and pattern: "Moammar_Khadafy"
1040.94 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.94 s
[regex-tdfa] Outputs agree: "(0,15)(-1,-1)(11,12)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #111
1040.94 s
[regex-tdfa] text and pattern: "Moammar_Qudhafi"
1040.94 s
[regex-tdfa] Regex pattern: "M[ou]'?am+[ae]r_.*([AEae]l[-_])?[GKQ]h?[aeu]+([dtz][dhz]?)+af[iy]"
1040.94 s
[regex-tdfa] Outputs agree: "(0,15)(-1,-1)(10,12)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #112
1040.94 s
[regex-tdfa] text and pattern: "aabcdd"
1040.94 s
[regex-tdfa] Regex pattern: "a+(b|c)*d+"
1040.94 s
[regex-tdfa] Outputs agree: "(0,6)(3,4)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #113
1040.94 s
[regex-tdfa] text and pattern: "vivi"
1040.94 s
[regex-tdfa] Regex pattern: "^.+$"
1040.94 s
[regex-tdfa] Outputs agree: "(0,4)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #114
1040.94 s
[regex-tdfa] text and pattern: "vivi"
1040.94 s
[regex-tdfa] Regex pattern: "^(.+)$"
1040.94 s
[regex-tdfa] Outputs agree: "(0,4)(0,4)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #115
1040.94 s
[regex-tdfa] text and pattern: "gryphon.att.com!eby"
1040.94 s
[regex-tdfa] Regex pattern: "^([^!.]+).att.com!(.+)$"
1040.94 s
[regex-tdfa] Outputs agree: "(0,19)(0,7)(16,19)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #116
1040.94 s
[regex-tdfa] text and pattern: "bas"
1040.94 s
[regex-tdfa] Regex pattern: "^([^!]+!)?([^!]+)$"
1040.94 s
[regex-tdfa] Outputs agree: "(0,3)(-1,-1)(0,3)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #117
1040.94 s
[regex-tdfa] text and pattern: "bar!bas"
1040.94 s
[regex-tdfa] Regex pattern: "^([^!]+!)?([^!]+)$"
1040.94 s
[regex-tdfa] Outputs agree: "(0,7)(0,4)(4,7)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #118
1040.94 s
[regex-tdfa] text and pattern: "foo!bas"
1040.94 s
[regex-tdfa] Regex pattern: "^([^!]+!)?([^!]+)$"
1040.94 s
[regex-tdfa] Outputs agree: "(0,7)(0,4)(4,7)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #119
1040.94 s
[regex-tdfa] text and pattern: "foo!bar!bas"
1040.94 s
[regex-tdfa] Regex pattern: "^.+!([^!]+!)([^!]+)$"
1040.94 s
[regex-tdfa] Outputs agree: "(0,11)(4,8)(8,11)"
1040.94 s
[regex-tdfa]
1040.94 s
[regex-tdfa] Expected Pass #120
1040.94 s
[regex-tdfa] text and pattern: "bar!bas"
1040.94 s
[regex-tdfa] Regex pattern: "((foo)|(bar))!bas"
1040.95 s
[regex-tdfa] Outputs agree: "(0,7)(0,3)(-1,-1)(0,3)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #121
1040.95 s
[regex-tdfa] text and pattern: "foo!bar!bas"
1040.95 s
[regex-tdfa] Regex pattern: "((foo)|(bar))!bas"
1040.95 s
[regex-tdfa] Outputs agree: "(4,11)(4,7)(-1,-1)(4,7)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #122
1040.95 s
[regex-tdfa] text and pattern: "foo!bas"
1040.95 s
[regex-tdfa] Regex pattern: "((foo)|(bar))!bas"
1040.95 s
[regex-tdfa] Outputs agree: "(0,7)(0,3)(0,3)(-1,-1)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #123
1040.95 s
[regex-tdfa] text and pattern: "bar!bas"
1040.95 s
[regex-tdfa] Regex pattern: "((foo)|bar)!bas"
1040.95 s
[regex-tdfa] Outputs agree: "(0,7)(0,3)(-1,-1)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #124
1040.95 s
[regex-tdfa] text and pattern: "foo!bar!bas"
1040.95 s
[regex-tdfa] Regex pattern: "((foo)|bar)!bas"
1040.95 s
[regex-tdfa] Outputs agree: "(4,11)(4,7)(-1,-1)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #125
1040.95 s
[regex-tdfa] text and pattern: "foo!bas"
1040.95 s
[regex-tdfa] Regex pattern: "((foo)|bar)!bas"
1040.95 s
[regex-tdfa] Outputs agree: "(0,7)(0,3)(0,3)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #126
1040.95 s
[regex-tdfa] text and pattern: "bar!bas"
1040.95 s
[regex-tdfa] Regex pattern: "(foo|(bar))!bas"
1040.95 s
[regex-tdfa] Outputs agree: "(0,7)(0,3)(0,3)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #127
1040.95 s
[regex-tdfa] text and pattern: "foo!bar!bas"
1040.95 s
[regex-tdfa] Regex pattern: "(foo|(bar))!bas"
1040.95 s
[regex-tdfa] Outputs agree: "(4,11)(4,7)(4,7)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #128
1040.95 s
[regex-tdfa] text and pattern: "foo!bas"
1040.95 s
[regex-tdfa] Regex pattern: "(foo|(bar))!bas"
1040.95 s
[regex-tdfa] Outputs agree: "(0,7)(0,3)(-1,-1)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #129
1040.95 s
[regex-tdfa] text and pattern: "bar!bas"
1040.95 s
[regex-tdfa] Regex pattern: "(foo|bar)!bas"
1040.95 s
[regex-tdfa] Outputs agree: "(0,7)(0,3)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #130
1040.95 s
[regex-tdfa] text and pattern: "foo!bar!bas"
1040.95 s
[regex-tdfa] Regex pattern: "(foo|bar)!bas"
1040.95 s
[regex-tdfa] Outputs agree: "(4,11)(4,7)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #131
1040.95 s
[regex-tdfa] text and pattern: "foo!bas"
1040.95 s
[regex-tdfa] Regex pattern: "(foo|bar)!bas"
1040.95 s
[regex-tdfa] Outputs agree: "(0,7)(0,3)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #132
1040.95 s
[regex-tdfa] text and pattern: "foo!bar!bas"
1040.95 s
[regex-tdfa] Regex pattern: "^(([^!]+!)?([^!]+)|.+!([^!]+!)([^!]+))$"
1040.95 s
[regex-tdfa] Outputs agree: "(0,11)(0,11)(-1,-1)(-1,-1)(4,8)(8,11)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #133
1040.95 s
[regex-tdfa] text and pattern: "bas"
1040.95 s
[regex-tdfa] Regex pattern: "^([^!]+!)?([^!]+)$|^.+!([^!]+!)([^!]+)$"
1040.95 s
[regex-tdfa] Outputs agree: "(0,3)(-1,-1)(0,3)(-1,-1)(-1,-1)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #134
1040.95 s
[regex-tdfa] text and pattern: "bar!bas"
1040.95 s
[monoid-subclasses] stripSuffix: OK (0.61s)
1040.95 s
[monoid-subclasses] +++ OK, passed 100 tests.
1040.95 s
[regex-tdfa] Regex pattern: "^([^!]+!)?([^!]+)$|^.+!([^!]+!)([^!]+)$"
1040.95 s
[regex-tdfa] Outputs agree: "(0,7)(0,4)(4,7)(-1,-1)(-1,-1)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #135
1040.95 s
[regex-tdfa] text and pattern: "foo!bar!bas"
1040.95 s
[regex-tdfa] Regex pattern: "^([^!]+!)?([^!]+)$|^.+!([^!]+!)([^!]+)$"
1040.95 s
[regex-tdfa] Outputs agree: "(0,11)(-1,-1)(-1,-1)(4,8)(8,11)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #136
1040.95 s
[regex-tdfa] text and pattern: "foo!bas"
1040.95 s
[regex-tdfa] Regex pattern: "^([^!]+!)?([^!]+)$|^.+!([^!]+!)([^!]+)$"
1040.95 s
[regex-tdfa] Outputs agree: "(0,7)(0,4)(4,7)(-1,-1)(-1,-1)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #137
1040.95 s
[regex-tdfa] text and pattern: "bas"
1040.95 s
[regex-tdfa] Regex pattern: "^(([^!]+!)?([^!]+)|.+!([^!]+!)([^!]+))$"
1040.95 s
[regex-tdfa] Outputs agree: "(0,3)(0,3)(-1,-1)(0,3)(-1,-1)(-1,-1)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #138
1040.95 s
[regex-tdfa] text and pattern: "bar!bas"
1040.95 s
[regex-tdfa] Regex pattern: "^(([^!]+!)?([^!]+)|.+!([^!]+!)([^!]+))$"
1040.95 s
[regex-tdfa] Outputs agree: "(0,7)(0,7)(0,4)(4,7)(-1,-1)(-1,-1)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #139
1040.95 s
[regex-tdfa] text and pattern: "foo!bar!bas"
1040.95 s
[regex-tdfa] Regex pattern: "^(([^!]+!)?([^!]+)|.+!([^!]+!)([^!]+))$"
1040.95 s
[regex-tdfa] Outputs agree: "(0,11)(0,11)(-1,-1)(-1,-1)(4,8)(8,11)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #140
1040.95 s
[regex-tdfa] text and pattern: "foo!bas"
1040.95 s
[regex-tdfa] Regex pattern: "^(([^!]+!)?([^!]+)|.+!([^!]+!)([^!]+))$"
1040.95 s
[regex-tdfa] Outputs agree: "(0,7)(0,7)(0,4)(4,7)(-1,-1)(-1,-1)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #141
1040.95 s
[regex-tdfa] text and pattern: "/XXX"
1040.95 s
[regex-tdfa] Regex pattern: ".*(/XXX).*"
1040.95 s
[regex-tdfa] Outputs agree: "(0,4)(0,4)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #142
1040.95 s
[regex-tdfa] text and pattern: "\\XXX"
1040.95 s
[regex-tdfa] Regex pattern: ".*(\\\\XXX).*"
1040.95 s
[regex-tdfa] Outputs agree: "(0,4)(0,4)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #143
1040.95 s
[regex-tdfa] text and pattern: "\\XXX"
1040.95 s
[regex-tdfa] Regex pattern: "\\\\XXX"
1040.95 s
[regex-tdfa] Outputs agree: "(0,4)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #144
1040.95 s
[regex-tdfa] text and pattern: "/000"
1040.95 s
[regex-tdfa] Regex pattern: ".*(/000).*"
1040.95 s
[regex-tdfa] Outputs agree: "(0,4)(0,4)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #145
1040.95 s
[regex-tdfa] text and pattern: "\\000"
1040.95 s
[regex-tdfa] Regex pattern: ".*(\\\\000).*"
1040.95 s
[regex-tdfa] Outputs agree: "(0,4)(0,4)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #146
1040.95 s
[regex-tdfa] text and pattern: "\\000"
1040.95 s
[regex-tdfa] Regex pattern: "\\\\000"
1040.95 s
[regex-tdfa] Outputs agree: "(0,4)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Using Tests from: class.txt
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #1
1040.95 s
[regex-tdfa] text and pattern: "xaxaax"
1040.95 s
[regex-tdfa] Regex pattern: "aa*"
1040.95 s
[regex-tdfa] Outputs agree: "(1,2)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #2
1040.95 s
[regex-tdfa] text and pattern: "abc"
1040.95 s
[regex-tdfa] Regex pattern: "(a*)(ab)*(b*)"
1040.95 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(-1,-1)(1,2)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Fail #-2
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Searched text: "abc"
1040.95 s
[regex-tdfa] Regex pattern: "(a*)(ab)*(b*)"
1040.95 s
[regex-tdfa] Expected output: "(0,2)(0,0)(0,2)(2,2)"
1040.95 s
[regex-tdfa] Actual result : "(0,2)(0,1)(-1,-1)(1,2)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #3
1040.95 s
[regex-tdfa] text and pattern: "aba"
1040.95 s
[regex-tdfa] Regex pattern: "((a*)(ab)*)((b*)(a*))"
1040.95 s
[regex-tdfa] Outputs agree: "(0,3)(0,2)(0,0)(0,2)(2,3)(2,2)(2,3)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #4
1040.95 s
[regex-tdfa] text and pattern: "xxxxxx"
1040.95 s
[regex-tdfa] Regex pattern: "(...?.?)*"
1040.95 s
[regex-tdfa] Outputs agree: "(0,6)(4,6)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #5
1040.95 s
[regex-tdfa] text and pattern: "abcabc"
1040.95 s
[regex-tdfa] Regex pattern: "(a|ab)(bc|c)"
1040.95 s
[regex-tdfa] Outputs agree: "(0,3)(0,2)(2,3)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #6
1040.95 s
[regex-tdfa] text and pattern: "ababa"
1040.95 s
[regex-tdfa] Regex pattern: "(aba|a*b)(aba|a*b)"
1040.95 s
[regex-tdfa] Outputs agree: "(0,5)(0,2)(2,5)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #7
1040.95 s
[regex-tdfa] text and pattern: "xxxxx"
1040.95 s
[regex-tdfa] Regex pattern: "(a*){2}"
1040.95 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #8
1040.95 s
[regex-tdfa] text and pattern: "a"
1040.95 s
[regex-tdfa] Regex pattern: "(a*)*"
1040.95 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #9
1040.95 s
[regex-tdfa] text and pattern: "ababa"
1040.95 s
[regex-tdfa] Regex pattern: "(aba|a*b)*"
1040.95 s
[regex-tdfa] Outputs agree: "(0,5)(2,5)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #10
1040.95 s
[regex-tdfa] text and pattern: "aba"
1040.95 s
[regex-tdfa] Regex pattern: "(a(b)?)+"
1040.95 s
[regex-tdfa] Outputs agree: "(0,3)(2,3)(-1,-1)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #11
1040.95 s
[regex-tdfa] text and pattern: "ab"
1040.95 s
[regex-tdfa] Regex pattern: ".*(.*)"
1040.95 s
[regex-tdfa] Outputs agree: "(0,2)(2,2)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #12
1040.95 s
[regex-tdfa] text and pattern: "abab"
1040.95 s
[regex-tdfa] Regex pattern: "(a?)((ab)?)(b?)a?(ab)?b?"
1040.95 s
[regex-tdfa] Outputs agree: "(0,4)(0,1)(1,1)(-1,-1)(1,2)(-1,-1)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Fail #-12
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Searched text: "abab"
1040.95 s
[regex-tdfa] Regex pattern: "(a?)((ab)?)(b?)a?(ab)?b?"
1040.95 s
[regex-tdfa] Expected output: "(0,4)(0,1)(1,1)(-1,-1)(1,2)(2,4)"
1040.95 s
[regex-tdfa] Actual result : "(0,4)(0,1)(1,1)(-1,-1)(1,2)(-1,-1)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Using Tests from: forced-assoc.txt
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #1
1040.95 s
[regex-tdfa] text and pattern: "abcd"
1040.95 s
[regex-tdfa] Regex pattern: "(a|ab)(c|bcd)"
1040.95 s
[regex-tdfa] Outputs agree: "(0,4)(0,1)(1,4)"
1040.95 s
[regex-tdfa]
1040.95 s
[regex-tdfa] Expected Pass #2
1040.96 s
[regex-tdfa] text and pattern: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "(a|ab)(bcd|c)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,4)(0,1)(1,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #3
1040.96 s
[regex-tdfa] text and pattern: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "(ab|a)(c|bcd)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,4)(0,1)(1,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #4
1040.96 s
[regex-tdfa] text and pattern: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "(ab|a)(bcd|c)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,4)(0,1)(1,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #5
1040.96 s
[regex-tdfa] text and pattern: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "((a|ab)(c|bcd))(d*)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,4)(0,4)(0,1)(1,4)(4,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #6
1040.96 s
[regex-tdfa] text and pattern: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "((a|ab)(bcd|c))(d*)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,4)(0,4)(0,1)(1,4)(4,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #7
1040.96 s
[regex-tdfa] text and pattern: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "((ab|a)(c|bcd))(d*)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,4)(0,4)(0,1)(1,4)(4,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #8
1040.96 s
[regex-tdfa] text and pattern: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "((ab|a)(bcd|c))(d*)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,4)(0,4)(0,1)(1,4)(4,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #9
1040.96 s
[regex-tdfa] text and pattern: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "(a|ab)((c|bcd)(d*))"
1040.96 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(2,4)(2,3)(3,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #10
1040.96 s
[regex-tdfa] text and pattern: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "(a|ab)((bcd|c)(d*))"
1040.96 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(2,4)(2,3)(3,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #11
1040.96 s
[regex-tdfa] text and pattern: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "(ab|a)((c|bcd)(d*))"
1040.96 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(2,4)(2,3)(3,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #12
1040.96 s
[regex-tdfa] text and pattern: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "(ab|a)((bcd|c)(d*))"
1040.96 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(2,4)(2,3)(3,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #13
1040.96 s
[regex-tdfa] text and pattern: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "(a*)(b|abc)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,3)(0,0)(0,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #14
1040.96 s
[regex-tdfa] text and pattern: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "(a*)(abc|b)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,3)(0,0)(0,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #15
1040.96 s
[regex-tdfa] text and pattern: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "((a*)(b|abc))(c*)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,3)(0,3)(0,0)(0,3)(3,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #16
1040.96 s
[regex-tdfa] text and pattern: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "((a*)(abc|b))(c*)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,3)(0,3)(0,0)(0,3)(3,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #17
1040.96 s
[regex-tdfa] text and pattern: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "(a*)((b|abc)(c*))"
1040.96 s
[regex-tdfa] Outputs agree: "(0,3)(0,1)(1,3)(1,2)(2,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #18
1040.96 s
[regex-tdfa] text and pattern: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "(a*)((abc|b)(c*))"
1040.96 s
[regex-tdfa] Outputs agree: "(0,3)(0,1)(1,3)(1,2)(2,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #19
1040.96 s
[regex-tdfa] text and pattern: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "(a*)(b|abc)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,3)(0,0)(0,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #20
1040.96 s
[regex-tdfa] text and pattern: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "(a*)(abc|b)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,3)(0,0)(0,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #21
1040.96 s
[regex-tdfa] text and pattern: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "((a*)(b|abc))(c*)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,3)(0,3)(0,0)(0,3)(3,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #22
1040.96 s
[regex-tdfa] text and pattern: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "((a*)(abc|b))(c*)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,3)(0,3)(0,0)(0,3)(3,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #23
1040.96 s
[regex-tdfa] text and pattern: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "(a*)((b|abc)(c*))"
1040.96 s
[regex-tdfa] Outputs agree: "(0,3)(0,1)(1,3)(1,2)(2,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #24
1040.96 s
[regex-tdfa] text and pattern: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "(a*)((abc|b)(c*))"
1040.96 s
[regex-tdfa] Outputs agree: "(0,3)(0,1)(1,3)(1,2)(2,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #25
1040.96 s
[regex-tdfa] text and pattern: "ab"
1040.96 s
[regex-tdfa] Regex pattern: "(a|ab)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #26
1040.96 s
[regex-tdfa] text and pattern: "ab"
1040.96 s
[regex-tdfa] Regex pattern: "(ab|a)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #27
1040.96 s
[regex-tdfa] text and pattern: "ab"
1040.96 s
[regex-tdfa] Regex pattern: "(a|ab)(b*)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(2,2)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Pass #28
1040.96 s
[regex-tdfa] text and pattern: "ab"
1040.96 s
[regex-tdfa] Regex pattern: "(ab|a)(b*)"
1040.96 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(2,2)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Using Tests from: left-assoc.txt
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Fail #-1
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Searched text: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "(a|ab)(c|bcd)(d*)"
1040.96 s
[regex-tdfa] Expected output: "(0,4)(0,1)(1,4)(4,4)"
1040.96 s
[regex-tdfa] Actual result : "(0,4)(0,2)(2,3)(3,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Fail #-2
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Searched text: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "(a|ab)(bcd|c)(d*)"
1040.96 s
[regex-tdfa] Expected output: "(0,4)(0,1)(1,4)(4,4)"
1040.96 s
[regex-tdfa] Actual result : "(0,4)(0,2)(2,3)(3,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Fail #-3
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Searched text: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "(ab|a)(c|bcd)(d*)"
1040.96 s
[regex-tdfa] Expected output: "(0,4)(0,1)(1,4)(4,4)"
1040.96 s
[regex-tdfa] Actual result : "(0,4)(0,2)(2,3)(3,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Fail #-4
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Searched text: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "(ab|a)(bcd|c)(d*)"
1040.96 s
[regex-tdfa] Expected output: "(0,4)(0,1)(1,4)(4,4)"
1040.96 s
[regex-tdfa] Actual result : "(0,4)(0,2)(2,3)(3,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Fail #-5
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Searched text: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "(a*)(b|abc)(c*)"
1040.96 s
[regex-tdfa] Expected output: "(0,3)(0,0)(0,3)(3,3)"
1040.96 s
[regex-tdfa] Actual result : "(0,3)(0,1)(1,2)(2,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Fail #-6
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Searched text: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "(a*)(abc|b)(c*)"
1040.96 s
[regex-tdfa] Expected output: "(0,3)(0,0)(0,3)(3,3)"
1040.96 s
[regex-tdfa] Actual result : "(0,3)(0,1)(1,2)(2,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Fail #-7
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Searched text: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "(a*)(b|abc)(c*)"
1040.96 s
[regex-tdfa] Expected output: "(0,3)(0,0)(0,3)(3,3)"
1040.96 s
[regex-tdfa] Actual result : "(0,3)(0,1)(1,2)(2,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Fail #-8
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Searched text: "abc"
1040.96 s
[regex-tdfa] Regex pattern: "(a*)(abc|b)(c*)"
1040.96 s
[regex-tdfa] Expected output: "(0,3)(0,0)(0,3)(3,3)"
1040.96 s
[regex-tdfa] Actual result : "(0,3)(0,1)(1,2)(2,3)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Fail #-9
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Searched text: "abcd"
1040.96 s
[regex-tdfa] Regex pattern: "(a|ab)(c|bcd)(d|.*)"
1040.96 s
[regex-tdfa] Expected output: "(0,4)(0,1)(1,4)(4,4)"
1040.96 s
[regex-tdfa] Actual result : "(0,4)(0,2)(2,3)(3,4)"
1040.96 s
[regex-tdfa]
1040.96 s
[regex-tdfa] Expected Fail #-10
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Searched text: "abcd"
1040.97 s
[regex-tdfa] Regex pattern: "(a|ab)(bcd|c)(d|.*)"
1040.97 s
[regex-tdfa] Expected output: "(0,4)(0,1)(1,4)(4,4)"
1040.97 s
[regex-tdfa] Actual result : "(0,4)(0,2)(2,3)(3,4)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Fail #-11
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Searched text: "abcd"
1040.97 s
[regex-tdfa] Regex pattern: "(ab|a)(c|bcd)(d|.*)"
1040.97 s
[regex-tdfa] Expected output: "(0,4)(0,1)(1,4)(4,4)"
1040.97 s
[regex-tdfa] Actual result : "(0,4)(0,2)(2,3)(3,4)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Fail #-12
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Searched text: "abcd"
1040.97 s
[regex-tdfa] Regex pattern: "(ab|a)(bcd|c)(d|.*)"
1040.97 s
[regex-tdfa] Expected output: "(0,4)(0,1)(1,4)(4,4)"
1040.97 s
[regex-tdfa] Actual result : "(0,4)(0,2)(2,3)(3,4)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Using Tests from: nullsub3.txt
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #1
1040.97 s
[regex-tdfa] text and pattern: "a"
1040.97 s
[regex-tdfa] Regex pattern: "(a*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #2
1040.97 s
[regex-tdfa] text and pattern: "x"
1040.97 s
[regex-tdfa] Regex pattern: "(a*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #3
1040.97 s
[regex-tdfa] text and pattern: "aaaaaa"
1040.97 s
[regex-tdfa] Regex pattern: "(a*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #4
1040.97 s
[regex-tdfa] text and pattern: "aaaaaax"
1040.97 s
[regex-tdfa] Regex pattern: "(a*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #5
1040.97 s
[regex-tdfa] text and pattern: "a"
1040.97 s
[regex-tdfa] Regex pattern: "(a*)+"
1040.97 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #6
1040.97 s
[regex-tdfa] text and pattern: "x"
1040.97 s
[regex-tdfa] Regex pattern: "(a*)+"
1040.97 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #7
1040.97 s
[regex-tdfa] text and pattern: "aaaaaa"
1040.97 s
[regex-tdfa] Regex pattern: "(a*)+"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #8
1040.97 s
[regex-tdfa] text and pattern: "aaaaaax"
1040.97 s
[regex-tdfa] Regex pattern: "(a*)+"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #9
1040.97 s
[regex-tdfa] text and pattern: "a"
1040.97 s
[regex-tdfa] Regex pattern: "(a+)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #10
1040.97 s
[regex-tdfa] text and pattern: "x"
1040.97 s
[regex-tdfa] Regex pattern: "(a+)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,0)(-1,-1)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #11
1040.97 s
[regex-tdfa] text and pattern: "aaaaaa"
1040.97 s
[regex-tdfa] Regex pattern: "(a+)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #12
1040.97 s
[regex-tdfa] text and pattern: "aaaaaax"
1040.97 s
[regex-tdfa] Regex pattern: "(a+)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #13
1040.97 s
[regex-tdfa] text and pattern: "a"
1040.97 s
[regex-tdfa] Regex pattern: "(a+)+"
1040.97 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #14
1040.97 s
[regex-tdfa] text and pattern: "x"
1040.97 s
[regex-tdfa] Regex pattern: "(a+)+"
1040.97 s
[regex-tdfa] Outputs agree: "NOMATCH"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #15
1040.97 s
[regex-tdfa] text and pattern: "aaaaaa"
1040.97 s
[regex-tdfa] Regex pattern: "(a+)+"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #16
1040.97 s
[regex-tdfa] text and pattern: "aaaaaax"
1040.97 s
[regex-tdfa] Regex pattern: "(a+)+"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #17
1040.97 s
[regex-tdfa] text and pattern: "a"
1040.97 s
[regex-tdfa] Regex pattern: "([a]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #18
1040.97 s
[regex-tdfa] text and pattern: "x"
1040.97 s
[regex-tdfa] Regex pattern: "([a]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #19
1040.97 s
[regex-tdfa] text and pattern: "aaaaaa"
1040.97 s
[regex-tdfa] Regex pattern: "([a]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #20
1040.97 s
[regex-tdfa] text and pattern: "aaaaaax"
1040.97 s
[regex-tdfa] Regex pattern: "([a]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #21
1040.97 s
[regex-tdfa] text and pattern: "a"
1040.97 s
[regex-tdfa] Regex pattern: "([a]*)+"
1040.97 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #22
1040.97 s
[regex-tdfa] text and pattern: "x"
1040.97 s
[regex-tdfa] Regex pattern: "([a]*)+"
1040.97 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #23
1040.97 s
[regex-tdfa] text and pattern: "aaaaaa"
1040.97 s
[regex-tdfa] Regex pattern: "([a]*)+"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #24
1040.97 s
[regex-tdfa] text and pattern: "aaaaaax"
1040.97 s
[regex-tdfa] Regex pattern: "([a]*)+"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #25
1040.97 s
[regex-tdfa] text and pattern: "a"
1040.97 s
[regex-tdfa] Regex pattern: "([^b]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #26
1040.97 s
[regex-tdfa] text and pattern: "b"
1040.97 s
[regex-tdfa] Regex pattern: "([^b]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #27
1040.97 s
[regex-tdfa] text and pattern: "aaaaaa"
1040.97 s
[regex-tdfa] Regex pattern: "([^b]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #28
1040.97 s
[regex-tdfa] text and pattern: "aaaaaab"
1040.97 s
[regex-tdfa] Regex pattern: "([^b]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #29
1040.97 s
[regex-tdfa] text and pattern: "a"
1040.97 s
[regex-tdfa] Regex pattern: "([ab]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #30
1040.97 s
[regex-tdfa] text and pattern: "aaaaaa"
1040.97 s
[regex-tdfa] Regex pattern: "([ab]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #31
1040.97 s
[regex-tdfa] text and pattern: "ababab"
1040.97 s
[regex-tdfa] Regex pattern: "([ab]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #32
1040.97 s
[regex-tdfa] text and pattern: "bababa"
1040.97 s
[regex-tdfa] Regex pattern: "([ab]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #33
1040.97 s
[regex-tdfa] text and pattern: "b"
1040.97 s
[regex-tdfa] Regex pattern: "([ab]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #34
1040.97 s
[regex-tdfa] text and pattern: "bbbbbb"
1040.97 s
[regex-tdfa] Regex pattern: "([ab]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #35
1040.97 s
[regex-tdfa] text and pattern: "aaaabcde"
1040.97 s
[regex-tdfa] Regex pattern: "([ab]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,5)(0,5)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #36
1040.97 s
[regex-tdfa] text and pattern: "b"
1040.97 s
[regex-tdfa] Regex pattern: "([^a]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #37
1040.97 s
[regex-tdfa] text and pattern: "bbbbbb"
1040.97 s
[regex-tdfa] Regex pattern: "([^a]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #38
1040.97 s
[regex-tdfa] text and pattern: "aaaaaa"
1040.97 s
[regex-tdfa] Regex pattern: "([^a]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #39
1040.97 s
[regex-tdfa] text and pattern: "ccccxx"
1040.97 s
[regex-tdfa] Regex pattern: "([^ab]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,6)(0,6)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #40
1040.97 s
[regex-tdfa] text and pattern: "ababab"
1040.97 s
[regex-tdfa] Regex pattern: "([^ab]*)*"
1040.97 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1040.97 s
[regex-tdfa]
1040.97 s
[regex-tdfa] Expected Pass #41
1040.98 s
[regex-tdfa] text and pattern: "zabcde"
1040.98 s
[regex-tdfa] Regex pattern: "((z)+|a)*"
1040.98 s
[regex-tdfa] Outputs agree: "(0,2)(1,2)(-1,-1)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #42
1040.98 s
[regex-tdfa] text and pattern: "aaa"
1040.98 s
[regex-tdfa] Regex pattern: "(a)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #46
1040.98 s
[regex-tdfa] text and pattern: "x"
1040.98 s
[regex-tdfa] Regex pattern: "(a*)*(x)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,1)(0,0)(0,1)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #47
1040.98 s
[regex-tdfa] text and pattern: "ax"
1040.98 s
[regex-tdfa] Regex pattern: "(a*)*(x)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(1,2)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #48
1040.98 s
[regex-tdfa] text and pattern: "axa"
1040.98 s
[regex-tdfa] Regex pattern: "(a*)*(x)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(1,2)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #49
1040.98 s
[regex-tdfa] text and pattern: "x"
1040.98 s
[regex-tdfa] Regex pattern: "(a*)+(x)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,1)(0,0)(0,1)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #50
1040.98 s
[regex-tdfa] text and pattern: "ax"
1040.98 s
[regex-tdfa] Regex pattern: "(a*)+(x)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(1,2)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #51
1040.98 s
[regex-tdfa] text and pattern: "axa"
1040.98 s
[regex-tdfa] Regex pattern: "(a*)+(x)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(1,2)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #52
1040.98 s
[regex-tdfa] text and pattern: "x"
1040.98 s
[regex-tdfa] Regex pattern: "(a*){2}(x)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,1)(0,0)(0,1)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #53
1040.98 s
[regex-tdfa] text and pattern: "ax"
1040.98 s
[regex-tdfa] Regex pattern: "(a*){2}(x)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,2)(1,1)(1,2)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #54
1040.98 s
[regex-tdfa] text and pattern: "axa"
1040.98 s
[regex-tdfa] Regex pattern: "(a*){2}(x)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,2)(1,1)(1,2)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Using Tests from: osx-bsd-critical.txt
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #1
1040.98 s
[regex-tdfa] text and pattern: "ab"
1040.98 s
[regex-tdfa] Regex pattern: "(()|.)(b)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(-1,-1)(1,2)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Fail #-1
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Searched text: "ab"
1040.98 s
[regex-tdfa] Regex pattern: "(()|.)(b)"
1040.98 s
[regex-tdfa] Expected output: "(1,2)(1,1)(1,1)(1,2)"
1040.98 s
[regex-tdfa] Actual result : "(0,2)(0,1)(-1,-1)(1,2)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #2
1040.98 s
[regex-tdfa] text and pattern: "ab"
1040.98 s
[regex-tdfa] Regex pattern: "(()|[ab])(b)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(-1,-1)(1,2)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Fail #-2
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Searched text: "ab"
1040.98 s
[regex-tdfa] Regex pattern: "(()|[ab])(b)"
1040.98 s
[regex-tdfa] Expected output: "(1,2)(1,1)(1,1)(1,2)"
1040.98 s
[regex-tdfa] Actual result : "(0,2)(0,1)(-1,-1)(1,2)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #3
1040.98 s
[regex-tdfa] text and pattern: "aaab"
1040.98 s
[regex-tdfa] Regex pattern: "(()|[ab])+b"
1040.98 s
[regex-tdfa] Outputs agree: "(0,4)(2,3)(-1,-1)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Fail #-3
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Searched text: "aaab"
1040.98 s
[regex-tdfa] Regex pattern: "(()|[ab])+b"
1040.98 s
[regex-tdfa] Expected output: "(3,4)(3,3)(3,3)"
1040.98 s
[regex-tdfa] Actual result : "(0,4)(2,3)(-1,-1)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #11
1040.98 s
[regex-tdfa] text and pattern: "ab"
1040.98 s
[regex-tdfa] Regex pattern: "(.|())(b)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(-1,-1)(1,2)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #12
1040.98 s
[regex-tdfa] text and pattern: "ab"
1040.98 s
[regex-tdfa] Regex pattern: "([ab]|())(b)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(-1,-1)(1,2)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #14
1040.98 s
[regex-tdfa] text and pattern: "aaab"
1040.98 s
[regex-tdfa] Regex pattern: "([ab]|())+b"
1040.98 s
[regex-tdfa] Outputs agree: "(0,4)(2,3)(-1,-1)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Fail #-14
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Searched text: "aaab"
1040.98 s
[regex-tdfa] Regex pattern: "([ab]|())+b"
1040.98 s
[regex-tdfa] Expected output: "(0,4)(3,3)(3,3)"
1040.98 s
[regex-tdfa] Actual result : "(0,4)(2,3)(-1,-1)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #20
1040.98 s
[regex-tdfa] text and pattern: "ab"
1040.98 s
[regex-tdfa] Regex pattern: "(.?)(b)"
1040.98 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(1,2)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Using Tests from: repetition2.txt
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #1
1040.98 s
[regex-tdfa] text and pattern: ""
1040.98 s
[regex-tdfa] Regex pattern: "((..)|(.))"
1040.98 s
[regex-tdfa] Outputs agree: "NOMATCH"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #2
1040.98 s
[regex-tdfa] text and pattern: ""
1040.98 s
[regex-tdfa] Regex pattern: "((..)|(.))((..)|(.))"
1040.98 s
[regex-tdfa] Outputs agree: "NOMATCH"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #3
1040.98 s
[regex-tdfa] text and pattern: ""
1040.98 s
[regex-tdfa] Regex pattern: "((..)|(.))((..)|(.))((..)|(.))"
1040.98 s
[regex-tdfa] Outputs agree: "NOMATCH"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #4
1040.98 s
[regex-tdfa] text and pattern: ""
1040.98 s
[regex-tdfa] Regex pattern: "((..)|(.)){1}"
1040.98 s
[regex-tdfa] Outputs agree: "NOMATCH"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #5
1040.98 s
[regex-tdfa] text and pattern: ""
1040.98 s
[regex-tdfa] Regex pattern: "((..)|(.)){2}"
1040.98 s
[regex-tdfa] Outputs agree: "NOMATCH"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #6
1040.98 s
[regex-tdfa] text and pattern: ""
1040.98 s
[regex-tdfa] Regex pattern: "((..)|(.)){3}"
1040.98 s
[regex-tdfa] Outputs agree: "NOMATCH"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #7
1040.98 s
[regex-tdfa] text and pattern: ""
1040.98 s
[regex-tdfa] Regex pattern: "((..)|(.))*"
1040.98 s
[regex-tdfa] Outputs agree: "(0,0)(-1,-1)(-1,-1)(-1,-1)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #8
1040.98 s
[regex-tdfa] text and pattern: "a"
1040.98 s
[regex-tdfa] Regex pattern: "((..)|(.))"
1040.98 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)(-1,-1)(0,1)"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #9
1040.98 s
[regex-tdfa] text and pattern: "a"
1040.98 s
[regex-tdfa] Regex pattern: "((..)|(.))((..)|(.))"
1040.98 s
[regex-tdfa] Outputs agree: "NOMATCH"
1040.98 s
[regex-tdfa]
1040.98 s
[regex-tdfa] Expected Pass #10
1040.98 s
[regex-tdfa] text and pattern: "a"
1040.98 s
[regex-tdfa] Regex pattern: "((..)|(.))((..)|(.))((..)|(.))"
1040.98 s
[regex-tdfa] Outputs agree: "NOMATCH"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #11
1040.99 s
[regex-tdfa] text and pattern: "a"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){1}"
1040.99 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)(-1,-1)(0,1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #12
1040.99 s
[regex-tdfa] text and pattern: "a"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){2}"
1040.99 s
[regex-tdfa] Outputs agree: "NOMATCH"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #13
1040.99 s
[regex-tdfa] text and pattern: "a"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){3}"
1040.99 s
[regex-tdfa] Outputs agree: "NOMATCH"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #14
1040.99 s
[regex-tdfa] text and pattern: "a"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))*"
1040.99 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)(-1,-1)(0,1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #15
1040.99 s
[regex-tdfa] text and pattern: "aa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))"
1040.99 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(0,2)(-1,-1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #16
1040.99 s
[regex-tdfa] text and pattern: "aa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))((..)|(.))"
1040.99 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(-1,-1)(0,1)(1,2)(-1,-1)(1,2)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #17
1040.99 s
[regex-tdfa] text and pattern: "aa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))((..)|(.))((..)|(.))"
1040.99 s
[regex-tdfa] Outputs agree: "NOMATCH"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #18
1040.99 s
[regex-tdfa] text and pattern: "aa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){1}"
1040.99 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(0,2)(-1,-1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #19
1040.99 s
[regex-tdfa] text and pattern: "aa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){2}"
1040.99 s
[regex-tdfa] Outputs agree: "(0,2)(1,2)(-1,-1)(1,2)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #20
1040.99 s
[regex-tdfa] text and pattern: "aa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){3}"
1040.99 s
[regex-tdfa] Outputs agree: "NOMATCH"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #21
1040.99 s
[regex-tdfa] text and pattern: "aa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))*"
1040.99 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(0,2)(-1,-1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #22
1040.99 s
[regex-tdfa] text and pattern: "aaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))"
1040.99 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(0,2)(-1,-1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #23
1040.99 s
[regex-tdfa] text and pattern: "aaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))((..)|(.))"
1040.99 s
[regex-tdfa] Outputs agree: "(0,3)(0,2)(0,2)(-1,-1)(2,3)(-1,-1)(2,3)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #24
1040.99 s
[regex-tdfa] text and pattern: "aaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))((..)|(.))((..)|(.))"
1040.99 s
[regex-tdfa] Outputs agree: "(0,3)(0,1)(-1,-1)(0,1)(1,2)(-1,-1)(1,2)(2,3)(-1,-1)(2,3)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #25
1040.99 s
[regex-tdfa] text and pattern: "aaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){1}"
1040.99 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(0,2)(-1,-1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #26
1040.99 s
[regex-tdfa] text and pattern: "aaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){2}"
1040.99 s
[regex-tdfa] Outputs agree: "(0,3)(2,3)(-1,-1)(2,3)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #27
1040.99 s
[regex-tdfa] text and pattern: "aaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){3}"
1040.99 s
[regex-tdfa] Outputs agree: "(0,3)(2,3)(-1,-1)(2,3)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #28
1040.99 s
[regex-tdfa] text and pattern: "aaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))*"
1040.99 s
[regex-tdfa] Outputs agree: "(0,3)(2,3)(-1,-1)(2,3)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #29
1040.99 s
[regex-tdfa] text and pattern: "aaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))"
1040.99 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(0,2)(-1,-1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #30
1040.99 s
[regex-tdfa] text and pattern: "aaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))((..)|(.))"
1040.99 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(0,2)(-1,-1)(2,4)(2,4)(-1,-1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #31
1040.99 s
[regex-tdfa] text and pattern: "aaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))((..)|(.))((..)|(.))"
1040.99 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(0,2)(-1,-1)(2,3)(-1,-1)(2,3)(3,4)(-1,-1)(3,4)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #32
1040.99 s
[regex-tdfa] text and pattern: "aaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){1}"
1040.99 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(0,2)(-1,-1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #33
1040.99 s
[regex-tdfa] text and pattern: "aaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){2}"
1040.99 s
[regex-tdfa] Outputs agree: "(0,4)(2,4)(2,4)(-1,-1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #34
1040.99 s
[regex-tdfa] text and pattern: "aaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){3}"
1040.99 s
[regex-tdfa] Outputs agree: "(0,4)(3,4)(-1,-1)(3,4)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #35
1040.99 s
[regex-tdfa] text and pattern: "aaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))*"
1040.99 s
[regex-tdfa] Outputs agree: "(0,4)(2,4)(2,4)(-1,-1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #36
1040.99 s
[regex-tdfa] text and pattern: "aaaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))"
1040.99 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(0,2)(-1,-1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #37
1040.99 s
[regex-tdfa] text and pattern: "aaaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))((..)|(.))"
1040.99 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(0,2)(-1,-1)(2,4)(2,4)(-1,-1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #38
1040.99 s
[regex-tdfa] text and pattern: "aaaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))((..)|(.))((..)|(.))"
1040.99 s
[regex-tdfa] Outputs agree: "(0,5)(0,2)(0,2)(-1,-1)(2,4)(2,4)(-1,-1)(4,5)(-1,-1)(4,5)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #39
1040.99 s
[regex-tdfa] text and pattern: "aaaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){1}"
1040.99 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(0,2)(-1,-1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #40
1040.99 s
[regex-tdfa] text and pattern: "aaaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){2}"
1040.99 s
[regex-tdfa] Outputs agree: "(0,4)(2,4)(2,4)(-1,-1)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #41
1040.99 s
[regex-tdfa] text and pattern: "aaaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.)){3}"
1040.99 s
[regex-tdfa] Outputs agree: "(0,5)(4,5)(-1,-1)(4,5)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #42
1040.99 s
[regex-tdfa] text and pattern: "aaaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))*"
1040.99 s
[regex-tdfa] Outputs agree: "(0,5)(4,5)(-1,-1)(4,5)"
1040.99 s
[regex-tdfa]
1040.99 s
[regex-tdfa] Expected Pass #43
1040.99 s
[regex-tdfa] text and pattern: "aaaaaa"
1040.99 s
[regex-tdfa] Regex pattern: "((..)|(.))"
1041.00 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(0,2)(-1,-1)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #44
1041.00 s
[regex-tdfa] text and pattern: "aaaaaa"
1041.00 s
[regex-tdfa] Regex pattern: "((..)|(.))((..)|(.))"
1041.00 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(0,2)(-1,-1)(2,4)(2,4)(-1,-1)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #45
1041.00 s
[regex-tdfa] text and pattern: "aaaaaa"
1041.00 s
[regex-tdfa] Regex pattern: "((..)|(.))((..)|(.))((..)|(.))"
1041.00 s
[regex-tdfa] Outputs agree: "(0,6)(0,2)(0,2)(-1,-1)(2,4)(2,4)(-1,-1)(4,6)(4,6)(-1,-1)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #46
1041.00 s
[regex-tdfa] text and pattern: "aaaaaa"
1041.00 s
[regex-tdfa] Regex pattern: "((..)|(.)){1}"
1041.00 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(0,2)(-1,-1)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #47
1041.00 s
[regex-tdfa] text and pattern: "aaaaaa"
1041.00 s
[regex-tdfa] Regex pattern: "((..)|(.)){2}"
1041.00 s
[regex-tdfa] Outputs agree: "(0,4)(2,4)(2,4)(-1,-1)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #48
1041.00 s
[regex-tdfa] text and pattern: "aaaaaa"
1041.00 s
[regex-tdfa] Regex pattern: "((..)|(.)){3}"
1041.00 s
[regex-tdfa] Outputs agree: "(0,6)(4,6)(4,6)(-1,-1)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #49
1041.00 s
[regex-tdfa] text and pattern: "aaaaaa"
1041.00 s
[regex-tdfa] Regex pattern: "((..)|(.))*"
1041.00 s
[regex-tdfa] Outputs agree: "(0,6)(4,6)(4,6)(-1,-1)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #100
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){0,}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #101
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){1,}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #102
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){2,}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #103
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){3,}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #104
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){4,}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #105
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){5,}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #106
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){6,}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #107
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){7,}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #108
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){8,}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(8,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #110
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){0,8}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #111
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){1,8}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #112
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){2,8}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #113
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){3,8}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #114
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){4,8}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #115
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){5,8}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #116
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){6,8}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #117
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){7,8}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(7,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #118
1041.00 s
[regex-tdfa] text and pattern: "X1234567Y"
1041.00 s
[regex-tdfa] Regex pattern: "X(.?){8,8}Y"
1041.00 s
[regex-tdfa] Outputs agree: "(0,9)(8,8)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #260
1041.00 s
[regex-tdfa] text and pattern: "ababcd"
1041.00 s
[regex-tdfa] Regex pattern: "(a|ab|c|bcd){0,}(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "(0,6)(3,6)(6,6)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #261
1041.00 s
[regex-tdfa] text and pattern: "ababcd"
1041.00 s
[regex-tdfa] Regex pattern: "(a|ab|c|bcd){1,}(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "(0,6)(3,6)(6,6)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #262
1041.00 s
[regex-tdfa] text and pattern: "ababcd"
1041.00 s
[regex-tdfa] Regex pattern: "(a|ab|c|bcd){2,}(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "(0,6)(3,6)(6,6)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #263
1041.00 s
[regex-tdfa] text and pattern: "ababcd"
1041.00 s
[regex-tdfa] Regex pattern: "(a|ab|c|bcd){3,}(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "(0,6)(3,6)(6,6)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #264
1041.00 s
[regex-tdfa] text and pattern: "ababcd"
1041.00 s
[regex-tdfa] Regex pattern: "(a|ab|c|bcd){4,}(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "NOMATCH"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #265
1041.00 s
[regex-tdfa] text and pattern: "ababcd"
1041.00 s
[regex-tdfa] Regex pattern: "(a|ab|c|bcd){0,10}(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "(0,6)(3,6)(6,6)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #266
1041.00 s
[regex-tdfa] text and pattern: "ababcd"
1041.00 s
[regex-tdfa] Regex pattern: "(a|ab|c|bcd){1,10}(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "(0,6)(3,6)(6,6)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #267
1041.00 s
[regex-tdfa] text and pattern: "ababcd"
1041.00 s
[regex-tdfa] Regex pattern: "(a|ab|c|bcd){2,10}(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "(0,6)(3,6)(6,6)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #268
1041.00 s
[regex-tdfa] text and pattern: "ababcd"
1041.00 s
[regex-tdfa] Regex pattern: "(a|ab|c|bcd){3,10}(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "(0,6)(3,6)(6,6)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #269
1041.00 s
[regex-tdfa] text and pattern: "ababcd"
1041.00 s
[regex-tdfa] Regex pattern: "(a|ab|c|bcd){4,10}(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "NOMATCH"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #270
1041.00 s
[regex-tdfa] text and pattern: "ababcd"
1041.00 s
[regex-tdfa] Regex pattern: "(a|ab|c|bcd)*(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "(0,6)(3,6)(6,6)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #271
1041.00 s
[regex-tdfa] text and pattern: "ababcd"
1041.00 s
[regex-tdfa] Regex pattern: "(a|ab|c|bcd)+(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "(0,6)(3,6)(6,6)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Using Tests from: right-assoc.txt
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #1
1041.00 s
[regex-tdfa] text and pattern: "abcd"
1041.00 s
[regex-tdfa] Regex pattern: "(a|ab)(c|bcd)(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(2,3)(3,4)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #2
1041.00 s
[regex-tdfa] text and pattern: "abcd"
1041.00 s
[regex-tdfa] Regex pattern: "(a|ab)(bcd|c)(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(2,3)(3,4)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #3
1041.00 s
[regex-tdfa] text and pattern: "abcd"
1041.00 s
[regex-tdfa] Regex pattern: "(ab|a)(c|bcd)(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(2,3)(3,4)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #4
1041.00 s
[regex-tdfa] text and pattern: "abcd"
1041.00 s
[regex-tdfa] Regex pattern: "(ab|a)(bcd|c)(d*)"
1041.00 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(2,3)(3,4)"
1041.00 s
[regex-tdfa]
1041.00 s
[regex-tdfa] Expected Pass #5
1041.00 s
[regex-tdfa] text and pattern: "abc"
1041.01 s
[regex-tdfa] Regex pattern: "(a*)(b|abc)(c*)"
1041.01 s
[regex-tdfa] Outputs agree: "(0,3)(0,1)(1,2)(2,3)"
1041.01 s
[regex-tdfa]
1041.01 s
[regex-tdfa] Expected Pass #6
1041.01 s
[regex-tdfa] text and pattern: "abc"
1041.01 s
[regex-tdfa] Regex pattern: "(a*)(abc|b)(c*)"
1041.01 s
[regex-tdfa] Outputs agree: "(0,3)(0,1)(1,2)(2,3)"
1041.01 s
[regex-tdfa]
1041.01 s
[regex-tdfa] Expected Pass #7
1041.01 s
[regex-tdfa] text and pattern: "abc"
1041.01 s
[regex-tdfa] Regex pattern: "(a*)(b|abc)(c*)"
1041.01 s
[regex-tdfa] Outputs agree: "(0,3)(0,1)(1,2)(2,3)"
1041.01 s
[regex-tdfa]
1041.01 s
[regex-tdfa] Expected Pass #8
1041.01 s
[regex-tdfa] text and pattern: "abc"
1041.01 s
[regex-tdfa] Regex pattern: "(a*)(abc|b)(c*)"
1041.01 s
[regex-tdfa] Outputs agree: "(0,3)(0,1)(1,2)(2,3)"
1041.01 s
[regex-tdfa]
1041.01 s
[regex-tdfa] Expected Pass #9
1041.01 s
[regex-tdfa] text and pattern: "abcd"
1041.01 s
[regex-tdfa] Regex pattern: "(a|ab)(c|bcd)(d|.*)"
1041.01 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(2,3)(3,4)"
1041.01 s
[regex-tdfa]
1041.01 s
[regex-tdfa] Expected Pass #10
1041.01 s
[regex-tdfa] text and pattern: "abcd"
1041.01 s
[regex-tdfa] Regex pattern: "(a|ab)(bcd|c)(d|.*)"
1041.01 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(2,3)(3,4)"
1041.01 s
[regex-tdfa]
1041.01 s
[regex-tdfa] Expected Pass #11
1041.01 s
[regex-tdfa] text and pattern: "abcd"
1041.01 s
[regex-tdfa] Regex pattern: "(ab|a)(c|bcd)(d|.*)"
1041.01 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(2,3)(3,4)"
1041.01 s
[regex-tdfa]
1041.01 s
[regex-tdfa] Expected Pass #12
1041.01 s
[regex-tdfa] text and pattern: "abcd"
1041.01 s
[regex-tdfa] Regex pattern: "(ab|a)(bcd|c)(d|.*)"
1041.01 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(2,3)(3,4)"
1041.01 s
[regex-tdfa]
1041.01 s
[regex-tdfa] Using Tests from: totest.txt
1041.01 s
[regex-tdfa]
1041.01 s
[regex-tdfa] Expected Pass #1
1041.01 s
[regex-tdfa] text and pattern: "xaax"
1041.01 s
[regex-tdfa] Regex pattern: "a+"
1041.02 s
[regex-tdfa] Outputs agree: "(1,3)"
1041.02 s
[regex-tdfa]
1041.02 s
[regex-tdfa] Expected Pass #3
1041.02 s
[regex-tdfa] text and pattern: "ab"
1041.02 s
[regex-tdfa] Regex pattern: "(a?)((ab)?)"
1041.02 s
[regex-tdfa] Outputs agree: "(0,2)(0,0)(0,2)(0,2)"
1041.02 s
[regex-tdfa]
1041.02 s
[regex-tdfa] Expected Pass #4
1041.02 s
[regex-tdfa] text and pattern: "ab"
1041.02 s
[regex-tdfa] Regex pattern: "(a?)((ab)?)(b?)"
1041.02 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(1,1)(-1,-1)(1,2)"
1041.02 s
[regex-tdfa]
1041.02 s
[regex-tdfa] Expected Pass #5
1041.02 s
[regex-tdfa] text and pattern: "ab"
1041.02 s
[regex-tdfa] Regex pattern: "((a?)((ab)?))(b?)"
1041.02 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(0,0)(0,2)(0,2)(2,2)"
1041.02 s
[regex-tdfa]
1041.02 s
[regex-tdfa] Expected Pass #6
1041.02 s
[regex-tdfa] text and pattern: "ab"
1041.02 s
[regex-tdfa] Regex pattern: "(a?)(((ab)?)(b?))"
1041.02 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(1,2)(1,1)(-1,-1)(1,2)"
1041.02 s
[regex-tdfa]
1041.02 s
[regex-tdfa] Expected Pass #7
1041.02 s
[regex-tdfa] text and pattern: "x"
1041.02 s
[regex-tdfa] Regex pattern: "(.?)"
1041.02 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1041.02 s
[regex-tdfa]
1041.02 s
[regex-tdfa] Expected Pass #8
1041.02 s
[regex-tdfa] text and pattern: "x"
1041.02 s
[regex-tdfa] Regex pattern: "(.?){1}"
1041.02 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1041.02 s
[regex-tdfa]
1041.02 s
[regex-tdfa] Expected Pass #9
1041.02 s
[regex-tdfa] text and pattern: "x"
1041.02 s
[regex-tdfa] Regex pattern: "(.?)(.?)"
1041.02 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)(1,1)"
1041.02 s
[regex-tdfa]
1041.02 s
[regex-tdfa] Expected Pass #10
1041.02 s
[regex-tdfa] text and pattern: "x"
1041.02 s
[regex-tdfa] Regex pattern: "(.?){2}"
1041.02 s
[regex-tdfa] Outputs agree: "(0,1)(1,1)"
1041.02 s
[regex-tdfa]
1041.03 s
[regex-tdfa] Expected Pass #11
1041.03 s
[regex-tdfa] text and pattern: "x"
1041.03 s
[regex-tdfa] Regex pattern: "(.?)*"
1041.03 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)"
1041.03 s
[regex-tdfa]
1041.03 s
[regex-tdfa] Expected Pass #12
1041.03 s
[regex-tdfa] text and pattern: "xxx"
1041.03 s
[regex-tdfa] Regex pattern: "(.?.?)"
1041.03 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)"
1041.03 s
[regex-tdfa]
1041.03 s
[regex-tdfa] Expected Pass #13
1041.03 s
[regex-tdfa] text and pattern: "xxx"
1041.03 s
[regex-tdfa] Regex pattern: "(.?.?){1}"
1041.03 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)"
1041.03 s
[regex-tdfa]
1041.03 s
[regex-tdfa] Expected Pass #14
1041.03 s
[regex-tdfa] text and pattern: "xxx"
1041.03 s
[regex-tdfa] Regex pattern: "(.?.?)(.?.?)"
1041.03 s
[regex-tdfa] Outputs agree: "(0,3)(0,2)(2,3)"
1041.03 s
[regex-tdfa]
1041.03 s
[regex-tdfa] Expected Pass #15
1041.03 s
[regex-tdfa] text and pattern: "xxx"
1041.03 s
[regex-tdfa] Regex pattern: "(.?.?){2}"
1041.03 s
[regex-tdfa] Outputs agree: "(0,3)(2,3)"
1041.03 s
[regex-tdfa]
1041.03 s
[regex-tdfa] Expected Pass #16
1041.03 s
[regex-tdfa] text and pattern: "xxx"
1041.03 s
[regex-tdfa] Regex pattern: "(.?.?)(.?.?)(.?.?)"
1041.03 s
[regex-tdfa] Outputs agree: "(0,3)(0,2)(2,3)(3,3)"
1041.03 s
[regex-tdfa]
1041.03 s
[regex-tdfa] Expected Pass #17
1041.03 s
[regex-tdfa] text and pattern: "xxx"
1041.03 s
[regex-tdfa] Regex pattern: "(.?.?){3}"
1041.03 s
[regex-tdfa] Outputs agree: "(0,3)(3,3)"
1041.03 s
[regex-tdfa]
1041.03 s
[regex-tdfa] Expected Pass #18
1041.03 s
[regex-tdfa] text and pattern: "xxx"
1041.03 s
[regex-tdfa] Regex pattern: "(.?.?)*"
1041.03 s
[regex-tdfa] Outputs agree: "(0,3)(2,3)"
1041.03 s
[regex-tdfa]
1041.03 s
[regex-tdfa] Expected Pass #19
1041.04 s
[regex-tdfa] text and pattern: "ab"
1041.04 s
[regex-tdfa] Regex pattern: "a?((ab)?)(b?)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,2)(1,1)(-1,-1)(1,2)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #20
1041.04 s
[regex-tdfa] text and pattern: "ab"
1041.04 s
[regex-tdfa] Regex pattern: "(a?)((ab)?)b?"
1041.04 s
[regex-tdfa] Outputs agree: "(0,2)(0,1)(1,1)(-1,-1)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #21
1041.04 s
[regex-tdfa] text and pattern: "ab"
1041.04 s
[regex-tdfa] Regex pattern: "a?((ab)?)b?"
1041.04 s
[regex-tdfa] Outputs agree: "(0,2)(1,1)(-1,-1)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #22
1041.04 s
[regex-tdfa] text and pattern: "xxxxx"
1041.04 s
[regex-tdfa] Regex pattern: "(a*){2}"
1041.04 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #23
1041.04 s
[regex-tdfa] text and pattern: "aba"
1041.04 s
[regex-tdfa] Regex pattern: "(ab?)(b?a)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,3)(0,2)(2,3)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #24
1041.04 s
[regex-tdfa] text and pattern: "aba"
1041.04 s
[regex-tdfa] Regex pattern: "(a|ab)(ba|a)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,3)(0,2)(2,3)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #25
1041.04 s
[regex-tdfa] text and pattern: "aba"
1041.04 s
[regex-tdfa] Regex pattern: "(a|ab|ba)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #26
1041.04 s
[regex-tdfa] text and pattern: "aba"
1041.04 s
[regex-tdfa] Regex pattern: "(a|ab|ba)(a|ab|ba)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,3)(0,2)(2,3)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #27
1041.04 s
[regex-tdfa] text and pattern: "aba"
1041.04 s
[regex-tdfa] Regex pattern: "(a|ab|ba)*"
1041.04 s
[regex-tdfa] Outputs agree: "(0,3)(2,3)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #28
1041.04 s
[regex-tdfa] text and pattern: "ababa"
1041.04 s
[regex-tdfa] Regex pattern: "(aba|a*b)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,3)(0,3)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #29
1041.04 s
[regex-tdfa] text and pattern: "ababa"
1041.04 s
[regex-tdfa] Regex pattern: "(aba|a*b)(aba|a*b)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,5)(0,2)(2,5)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #1029
1041.04 s
[regex-tdfa] text and pattern: "ababa"
1041.04 s
[regex-tdfa] Regex pattern: "(aba|a*b)(aba|a*b)(aba|a*b)"
1041.04 s
[regex-tdfa] Outputs agree: "NOMATCH"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #30
1041.04 s
[regex-tdfa] text and pattern: "ababa"
1041.04 s
[regex-tdfa] Regex pattern: "(aba|a*b)*"
1041.04 s
[regex-tdfa] Outputs agree: "(0,5)(2,5)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #31
1041.04 s
[regex-tdfa] text and pattern: "ababa"
1041.04 s
[regex-tdfa] Regex pattern: "(aba|ab|a)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,3)(0,3)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #32
1041.04 s
[regex-tdfa] text and pattern: "ababa"
1041.04 s
[regex-tdfa] Regex pattern: "(aba|ab|a)(aba|ab|a)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,5)(0,2)(2,5)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #1032
1041.04 s
[regex-tdfa] text and pattern: "ababa"
1041.04 s
[regex-tdfa] Regex pattern: "(aba|ab|a)(aba|ab|a)(aba|ab|a)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,5)(0,2)(2,4)(4,5)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #33
1041.04 s
[regex-tdfa] text and pattern: "ababa"
1041.04 s
[regex-tdfa] Regex pattern: "(aba|ab|a)*"
1041.04 s
[regex-tdfa] Outputs agree: "(0,5)(2,5)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #34
1041.04 s
[regex-tdfa] text and pattern: "aba"
1041.04 s
[regex-tdfa] Regex pattern: "(a(b)?)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(1,2)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #35
1041.04 s
[regex-tdfa] text and pattern: "aba"
1041.04 s
[regex-tdfa] Regex pattern: "(a(b)?)(a(b)?)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,3)(0,2)(1,2)(2,3)(-1,-1)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #36
1041.04 s
[regex-tdfa] text and pattern: "aba"
1041.04 s
[regex-tdfa] Regex pattern: "(a(b)?)+"
1041.04 s
[regex-tdfa] Outputs agree: "(0,3)(2,3)(-1,-1)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #37
1041.04 s
[regex-tdfa] text and pattern: "xx"
1041.04 s
[regex-tdfa] Regex pattern: "(.*)(.*)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(2,2)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #38
1041.04 s
[regex-tdfa] text and pattern: "xx"
1041.04 s
[regex-tdfa] Regex pattern: ".*(.*)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,2)(2,2)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #39
1041.04 s
[regex-tdfa] text and pattern: "azbazby"
1041.04 s
[regex-tdfa] Regex pattern: "(a.*z|b.*y)"
1041.04 s
[regex-tdfa] Outputs agree: "(0,5)(0,5)"
1041.04 s
[regex-tdfa]
1041.04 s
[regex-tdfa] Expected Pass #40
1041.04 s
[regex-tdfa] text and pattern: "azbazby"
1041.04 s
[regex-tdfa] Regex pattern: "(a.*z|b.*y)(a.*z|b.*y)"
1041.05 s
[regex-tdfa] Outputs agree: "(0,7)(0,5)(5,7)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #41
1041.05 s
[regex-tdfa] text and pattern: "azbazby"
1041.05 s
[regex-tdfa] Regex pattern: "(a.*z|b.*y)*"
1041.05 s
[regex-tdfa] Outputs agree: "(0,7)(5,7)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #42
1041.05 s
[regex-tdfa] text and pattern: "ab"
1041.05 s
[regex-tdfa] Regex pattern: "(.|..)(.*)"
1041.05 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(2,2)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #43
1041.05 s
[regex-tdfa] text and pattern: "xxx"
1041.05 s
[regex-tdfa] Regex pattern: "((..)*(...)*)"
1041.05 s
[regex-tdfa] Outputs agree: "(0,3)(0,3)(-1,-1)(0,3)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #44
1041.05 s
[regex-tdfa] text and pattern: "xxx"
1041.05 s
[regex-tdfa] Regex pattern: "((..)*(...)*)((..)*(...)*)"
1041.05 s
[regex-tdfa] Outputs agree: "(0,3)(0,3)(-1,-1)(0,3)(3,3)(-1,-1)(-1,-1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #45
1041.05 s
[regex-tdfa] text and pattern: "xxx"
1041.05 s
[regex-tdfa] Regex pattern: "((..)*(...)*)*"
1041.05 s
[regex-tdfa] Outputs agree: "(0,3)(0,3)(-1,-1)(0,3)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #83
1041.05 s
[regex-tdfa] text and pattern: "aabbaa"
1041.05 s
[regex-tdfa] Regex pattern: "(aa(b(b))?)+"
1041.05 s
[regex-tdfa] Outputs agree: "(0,6)(4,6)(-1,-1)(-1,-1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #84
1041.05 s
[regex-tdfa] text and pattern: "aba"
1041.05 s
[regex-tdfa] Regex pattern: "(a(b)?)+"
1041.05 s
[regex-tdfa] Outputs agree: "(0,3)(2,3)(-1,-1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #85
1041.05 s
[regex-tdfa] text and pattern: "abcd"
1041.05 s
[regex-tdfa] Regex pattern: "([ab]+)([bc]+)([cd]*)"
1041.05 s
[regex-tdfa] Outputs agree: "(0,4)(0,2)(2,3)(3,4)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #90
1041.05 s
[regex-tdfa] text and pattern: "Aa"
1041.05 s
[regex-tdfa] Regex pattern: "^(A([^B]*))?(B(.*))?"
1041.05 s
[regex-tdfa] Outputs agree: "(0,2)(0,2)(1,2)(-1,-1)(-1,-1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #91
1041.05 s
[regex-tdfa] text and pattern: "Bb"
1041.05 s
[regex-tdfa] Regex pattern: "^(A([^B]*))?(B(.*))?"
1041.05 s
[regex-tdfa] Outputs agree: "(0,2)(-1,-1)(-1,-1)(0,2)(1,2)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #110
1041.05 s
[regex-tdfa] text and pattern: "a"
1041.05 s
[regex-tdfa] Regex pattern: "(^){0,3}"
1041.05 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #111
1041.05 s
[regex-tdfa] text and pattern: "a"
1041.05 s
[regex-tdfa] Regex pattern: "($){0,3}"
1041.05 s
[regex-tdfa] Outputs agree: "(0,0)(-1,-1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #112
1041.05 s
[regex-tdfa] text and pattern: "a"
1041.05 s
[regex-tdfa] Regex pattern: "(^){1,3}"
1041.05 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #113
1041.05 s
[regex-tdfa] text and pattern: "a"
1041.05 s
[regex-tdfa] Regex pattern: "($){1,3}"
1041.05 s
[regex-tdfa] Outputs agree: "(1,1)(1,1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #200
1041.05 s
[regex-tdfa] text and pattern: "searchme"
1041.05 s
[regex-tdfa] Regex pattern: "((s^)|(s)|(^)|($)|(^.))*"
1041.05 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)(-1,-1)(0,1)(-1,-1)(-1,-1)(-1,-1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #201
1041.05 s
[regex-tdfa] text and pattern: "searchme"
1041.05 s
[regex-tdfa] Regex pattern: "s(()|^)e"
1041.05 s
[regex-tdfa] Outputs agree: "(0,2)(1,1)(1,1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #202
1041.05 s
[regex-tdfa] text and pattern: "searchme"
1041.05 s
[regex-tdfa] Regex pattern: "s(^|())e"
1041.05 s
[regex-tdfa] Outputs agree: "(0,2)(1,1)(1,1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #203
1041.05 s
[regex-tdfa] text and pattern: "searchme"
1041.05 s
[regex-tdfa] Regex pattern: "s(^|())e"
1041.05 s
[regex-tdfa] Outputs agree: "(0,2)(1,1)(1,1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #204
1041.05 s
[regex-tdfa] text and pattern: "searchme"
1041.05 s
[regex-tdfa] Regex pattern: "s()?e"
1041.05 s
[regex-tdfa] Outputs agree: "(0,2)(1,1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #205
1041.05 s
[regex-tdfa] text and pattern: "searchme"
1041.05 s
[regex-tdfa] Regex pattern: "s(^)?e"
1041.05 s
[regex-tdfa] Outputs agree: "(0,2)(-1,-1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #206
1041.05 s
[regex-tdfa] text and pattern: "searchme"
1041.05 s
[regex-tdfa] Regex pattern: "((s)|(e)|(a))*"
1041.05 s
[regex-tdfa] Outputs agree: "(0,3)(2,3)(-1,-1)(-1,-1)(2,3)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #207
1041.05 s
[regex-tdfa] text and pattern: "searchme"
1041.05 s
[regex-tdfa] Regex pattern: "((s)|(e)|())*"
1041.05 s
[regex-tdfa] Outputs agree: "(0,2)(1,2)(-1,-1)(1,2)(-1,-1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #208
1041.05 s
[regex-tdfa] text and pattern: "cbb"
1041.05 s
[regex-tdfa] Regex pattern: "((b*)|c(c*))*"
1041.05 s
[regex-tdfa] Outputs agree: "(0,3)(1,3)(1,3)(-1,-1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #209
1041.05 s
[regex-tdfa] text and pattern: "yyyyyy"
1041.05 s
[regex-tdfa] Regex pattern: "(yyy|(x?)){2,4}"
1041.05 s
[regex-tdfa] Outputs agree: "(0,6)(3,6)(-1,-1)"
1041.05 s
[regex-tdfa]
1041.05 s
[regex-tdfa] Expected Pass #210
1041.05 s
[regex-tdfa] text and pattern: "xxx"
1041.06 s
[regex-tdfa] Regex pattern: "($)|()"
1041.06 s
[regex-tdfa] Outputs agree: "(0,0)(-1,-1)(0,0)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #211
1041.06 s
[regex-tdfa] text and pattern: "ac\\n"
1041.06 s
[regex-tdfa] Regex pattern: "$()|^()"
1041.06 s
[regex-tdfa] Outputs agree: "(0,0)(-1,-1)(0,0)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #212
1041.06 s
[regex-tdfa] text and pattern: "ac\\n"
1041.06 s
[regex-tdfa] Regex pattern: "^()|$()"
1041.06 s
[regex-tdfa] Outputs agree: "(0,0)(0,0)(-1,-1)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #213
1041.06 s
[regex-tdfa] text and pattern: "__"
1041.06 s
[regex-tdfa] Regex pattern: "($)?(.)"
1041.06 s
[regex-tdfa] Outputs agree: "(0,1)(-1,-1)(0,1)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #214
1041.06 s
[regex-tdfa] text and pattern: "c"
1041.06 s
[regex-tdfa] Regex pattern: "(.|()|())*"
1041.06 s
[regex-tdfa] Outputs agree: "(0,1)(0,1)(-1,-1)(-1,-1)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #215
1041.06 s
[regex-tdfa] text and pattern: "ab"
1041.06 s
[regex-tdfa] Regex pattern: "((a)|(b)){2,}"
1041.06 s
[regex-tdfa] Outputs agree: "(0,2)(1,2)(-1,-1)(1,2)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #216
1041.06 s
[regex-tdfa] text and pattern: ""
1041.06 s
[regex-tdfa] Regex pattern: ".()|((.)?)"
1041.06 s
[regex-tdfa] Outputs agree: "(0,0)(-1,-1)(0,0)(-1,-1)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #217
1041.06 s
[regex-tdfa] text and pattern: "xx"
1041.06 s
[regex-tdfa] Regex pattern: "(.|$){2,}"
1041.06 s
[regex-tdfa] Outputs agree: "(0,2)(1,2)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #218
1041.06 s
[regex-tdfa] text and pattern: "xx"
1041.06 s
[regex-tdfa] Regex pattern: "(.|$){2,2}"
1041.06 s
[regex-tdfa] Outputs agree: "(0,2)(1,2)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #219
1041.06 s
[regex-tdfa] text and pattern: "xx"
1041.06 s
[regex-tdfa] Regex pattern: "(.){2,}"
1041.06 s
[regex-tdfa] Outputs agree: "(0,2)(1,2)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #220
1041.06 s
[regex-tdfa] text and pattern: "abc"
1041.06 s
[regex-tdfa] Regex pattern: "(a|())(b|())(c|())"
1041.06 s
[regex-tdfa] Outputs agree: "(0,3)(0,1)(-1,-1)(1,2)(-1,-1)(2,3)(-1,-1)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #220
1041.06 s
[regex-tdfa] text and pattern: "abc"
1041.06 s
[regex-tdfa] Regex pattern: "ab()c|ab()c()"
1041.06 s
[regex-tdfa] Outputs agree: "(0,3)(2,2)(-1,-1)(-1,-1)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #250
1041.06 s
[regex-tdfa] text and pattern: "bcde"
1041.06 s
[regex-tdfa] Regex pattern: "(b(c)|d(e))*"
1041.06 s
[regex-tdfa] Outputs agree: "(0,4)(2,4)(-1,-1)(3,4)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #251
1041.06 s
[regex-tdfa] text and pattern: "aba"
1041.06 s
[regex-tdfa] Regex pattern: "(a(b)*)*"
1041.06 s
[regex-tdfa] Outputs agree: "(0,3)(2,3)(-1,-1)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #260
1041.06 s
[regex-tdfa] text and pattern: "]"
1041.06 s
[regex-tdfa] Regex pattern: "[]]"
1041.06 s
[regex-tdfa] Outputs agree: "(0,1)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #261
1041.06 s
[regex-tdfa] text and pattern: "]"
1041.06 s
[regex-tdfa] Regex pattern: "[^]]"
1041.06 s
[regex-tdfa] Outputs agree: "NOMATCH"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #262
1041.06 s
[regex-tdfa] text and pattern: "-"
1041.06 s
[regex-tdfa] Regex pattern: "[-]"
1041.06 s
[regex-tdfa] Outputs agree: "(0,1)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #263
1041.06 s
[regex-tdfa] text and pattern: "-"
1041.06 s
[regex-tdfa] Regex pattern: "[^-]"
1041.06 s
[regex-tdfa] Outputs agree: "NOMATCH"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #260
1041.06 s
[regex-tdfa] text and pattern: "a"
1041.06 s
[regex-tdfa] Regex pattern: "[]]"
1041.06 s
[regex-tdfa] Outputs agree: "NOMATCH"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #261
1041.06 s
[regex-tdfa] text and pattern: "a"
1041.06 s
[regex-tdfa] Regex pattern: "[^]]"
1041.06 s
[regex-tdfa] Outputs agree: "(0,1)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #262
1041.06 s
[regex-tdfa] text and pattern: "a"
1041.06 s
[regex-tdfa] Regex pattern: "[-]"
1041.06 s
[regex-tdfa] Outputs agree: "NOMATCH"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Expected Pass #263
1041.06 s
[regex-tdfa] text and pattern: "a"
1041.06 s
[regex-tdfa] Regex pattern: "[^-]"
1041.06 s
[regex-tdfa] Outputs agree: "(0,1)"
1041.06 s
[regex-tdfa]
1041.06 s
[regex-tdfa] Wow, all the tests passed!
1041.06 s
[regex-tdfa] Test suite regex-tdfa-unittest: PASS
1041.06 s
[regex-tdfa] Test suite logged to: dist/test/regex-tdfa-1.3.2.3-regex-tdfa-unittest.log
1041.06 s
[regex-tdfa] 1 of 1 test suites (1 of 1 test cases) passed.
1041.06 s
[regex-tdfa] Phase: haddockPhase
1041.37 s
[attoparsec] [ 1 of 12] Compiling QC.Common ( tests/QC/Common.hs, dist/build/attoparsec-tests/attoparsec-tests-tmp/QC/Common.o )
1041.42 s
[monoid-subclasses] isSuffixOf: OK (0.67s)
1041.42 s
[monoid-subclasses] +++ OK, passed 100 tests.
1041.44 s
[aeson] Phase: setupCompilerEnvironmentPhase
1041.68 s
[monoid-subclasses] </>: OK (0.02s)
1041.68 s
[monoid-subclasses] +++ OK, passed 100 tests.
1041.68 s
[aeson] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1041.68 s
[monoid-subclasses] cancellative stripPrefix: OK (0.06s)
1041.68 s
[monoid-subclasses] +++ OK, passed 100 tests.
1041.68 s
[monoid-subclasses] cancellative stripSuffix: OK (0.03s)
1041.68 s
[monoid-subclasses] +++ OK, passed 100 tests.
1041.68 s
[monoid-subclasses] cancellative </>: OK
1041.68 s
[monoid-subclasses] +++ OK, passed 100 tests.
1041.80 s
[filepattern] [2 of 3] Compiling Test.Cases ( test/Test/Cases.hs, dist/build/filepattern-test/filepattern-test-tmp/Test/Cases.o )
1041.86 s
[regex-tdfa] Preprocessing library for regex-tdfa-1.3.2.3..
1041.88 s
[regex-tdfa] Running Haddock on library for regex-tdfa-1.3.2.3..
1042.24 s
[unix-compat] Phase: checkPhase
1042.43 s
[unix-compat] Running 1 test suites...
1042.43 s
[unix-compat] Test suite unix-compat-testsuite: RUNNING...
1042.45 s
[unix-compat]
1042.45 s
[unix-compat] mkstemp
1042.46 s
[monoid-subclasses] stripCommonPrefix 1: OK (0.93s)
1042.46 s
[monoid-subclasses] +++ OK, passed 100 tests.
1042.53 s
[regex-tdfa] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1042.93 s
[aeson] Phase: unpackPhase
1042.94 s
[aeson] unpacking source archive /nix/store/f0d7b9x9gkig0ip0d9g81wf1vsdp1nl4-aeson-2.2.3.0.tar.gz
1043.02 s
[adjunctions] Preprocessing test suite 'spec' for adjunctions-4.4.3..
1043.02 s
[adjunctions] Building test suite 'spec' for adjunctions-4.4.3..
1043.08 s
[aeson] source root is aeson-2.2.3.0
1043.13 s
[filepattern] [3 of 3] Compiling Main ( test/Test.hs, dist/build/filepattern-test/filepattern-test-tmp/Main.o )
1043.13 s
[aeson] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "aeson-2.2.3.0/tests/UnitTests/UTCTime.hs"
1043.16 s
[aeson] Phase: patchPhase
1043.18 s
[aeson] Replace Cabal file with edited version from mirror://hackage/aeson-2.2.3.0/revision/3.cabal.
1043.21 s
[aeson] Phase: compileBuildDriverPhase
1043.24 s
[aeson] setupCompileFlags: -package-db=/build/tmp.a5GvLMNAMS/setup-package.conf.d -threaded
1043.27 s
[adjunctions] [1 of 2] Compiling GenericsSpec ( tests/GenericsSpec.hs, dist/build/spec/spec-tmp/GenericsSpec.o )
1043.43 s
[regex-tdfa] [ 1 of 25] Compiling Data.IntMap.CharMap2 ( lib/Data/IntMap/CharMap2.hs, nothing )
1043.43 s
[aeson] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.a5GvLMNAMS/Main.o )
1043.46 s
[monoid-subclasses] stripCommonPrefix 2: OK (1.01s)
1043.46 s
[monoid-subclasses] +++ OK, passed 100 tests.
1043.51 s
[unix-compat] Creating 10000 temp files...ok
1043.79 s
[aeson] [2 of 2] Linking Setup
1043.97 s
[unix-compat] Deleting temp files...ok
1043.97 s
[unix-compat] TODO [✔]
1043.97 s
[unix-compat] createSymbolicLink
1043.97 s
[unix-compat] should error on Windows and succeed on other OSes [✔]
1043.97 s
[unix-compat] getSymbolicLinkStatus
1043.99 s
[unix-compat] should detect symbolic link to a file [✔]
1044.00 s
[unix-compat] should detect symbolic link to a directory [✔]
1044.01 s
[unix-compat] should give later time stamp than getFileStatus for link to file [✔]
1044.02 s
[unix-compat] should give later time stamp than getFileStatus for link to dir [✔]
1044.03 s
[unix-compat] should give a different fileID than getFileStatus for link to file [✔]
1044.05 s
[unix-compat] should give a different fileID than getFileStatus for link to dir [✔]
1044.05 s
[unix-compat] getFileStatus
1044.06 s
[unix-compat] should detect that symbolic link target is a file [✔]
1044.07 s
[unix-compat] should detect that symbolic link target is a directory [✔]
1044.09 s
[unix-compat] should be equal for link and link target (except access time) [✔]
1044.09 s
[unix-compat] getProcessID
1044.09 s
[unix-compat] should work on Windows and Unix [✔]
1044.09 s
[unix-compat]
1044.10 s
[unix-compat] Finished in 1.6412 seconds
1044.10 s
[unix-compat] 12 examples, 0 failures
1044.14 s
[unix-compat] Test suite unix-compat-testsuite: PASS
1044.14 s
[unix-compat] Test suite logged to: dist/test/unix-compat-0.7.4-unix-compat-testsuite.log
1044.15 s
[unix-compat] 1 of 1 test suites (1 of 1 test cases) passed.
1044.18 s
[unix-compat] Phase: haddockPhase
1044.18 s
[regex-tdfa] [ 2 of 25] Compiling Data.IntSet.EnumSet2 ( lib/Data/IntSet/EnumSet2.hs, nothing )
1044.20 s
[algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.o, dist/build/Algebra/Graph/Label.dyn_o )
1044.20 s
[algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.o, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.dyn_o )
1044.20 s
[algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.dyn_o )
1044.20 s
[algebraic-graphs]
1044.20 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning : [ GHC-63394 ] [ -Wx-partial ]
1044.20 s
[algebraic-graphs] In the use of ‘head’
1044.20 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1044.20 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1044.20 s
[algebraic-graphs] |
1044.20 s
[algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
1044.20 s
[algebraic-graphs] | ^^^^
1044.20 s
[algebraic-graphs]
1044.20 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1044.20 s
[algebraic-graphs] In the use of ‘tail’
1044.20 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1044.20 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1044.20 s
[algebraic-graphs] |
1044.20 s
[algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
1044.20 s
[algebraic-graphs] | ^^^^
1044.20 s
[algebraic-graphs]
1044.20 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning : [ GHC-63394 ] [ -Wx-partial ]
1044.20 s
[algebraic-graphs] In the use of ‘head’
1044.20 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1044.20 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1044.20 s
[algebraic-graphs] |
1044.21 s
[algebraic-graphs] 395 | p_v = fst $ head bnd
1044.21 s
[algebraic-graphs] | ^^^^
1044.21 s
[algebraic-graphs]
1044.21 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1044.21 s
[algebraic-graphs] In the use of ‘tail’
1044.21 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1044.21 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1044.21 s
[algebraic-graphs] |
1044.21 s
[algebraic-graphs] 397 | bnd' = tail bnd
1044.21 s
[algebraic-graphs] | ^^^^
1044.21 s
[algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.o, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.dyn_o )
1044.21 s
[algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.o, dist/build/Algebra/Graph/ToGraph.dyn_o )
1044.21 s
[algebraic-graphs]
1044.21 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1044.21 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1044.21 s
[algebraic-graphs] will become an error in a future GHC release.
1044.21 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1044.21 s
[algebraic-graphs] |
1044.21 s
[algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
1044.21 s
[algebraic-graphs] | ^
1044.21 s
[algebraic-graphs]
1044.21 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1044.21 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1044.21 s
[algebraic-graphs] will become an error in a future GHC release.
1044.21 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1044.21 s
[algebraic-graphs] |
1044.21 s
[algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1044.21 s
[algebraic-graphs] | ^
1044.21 s
[algebraic-graphs]
1044.21 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1044.21 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1044.21 s
[algebraic-graphs] will become an error in a future GHC release.
1044.21 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1044.21 s
[algebraic-graphs] |
1044.21 s
[algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1044.21 s
[algebraic-graphs] | ^
1044.21 s
[algebraic-graphs]
1044.21 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1044.21 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1044.21 s
[algebraic-graphs] will become an error in a future GHC release.
1044.21 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1044.21 s
[algebraic-graphs] |
1044.21 s
[algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1044.21 s
[algebraic-graphs] | ^
1044.21 s
[algebraic-graphs]
1044.21 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1044.21 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1044.21 s
[algebraic-graphs] will become an error in a future GHC release.
1044.21 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1044.21 s
[algebraic-graphs] |
1044.21 s
[algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1044.21 s
[algebraic-graphs] | ^
1044.21 s
[algebraic-graphs]
1044.21 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1044.21 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1044.21 s
[algebraic-graphs] will become an error in a future GHC release.
1044.21 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1044.21 s
[algebraic-graphs] |
1044.21 s
[algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1044.21 s
[algebraic-graphs] | ^
1044.21 s
[algebraic-graphs]
1044.21 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1044.21 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1044.21 s
[algebraic-graphs] will become an error in a future GHC release.
1044.21 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1044.21 s
[algebraic-graphs] |
1044.21 s
[algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1044.21 s
[algebraic-graphs] | ^
1044.21 s
[algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.o, dist/build/Algebra/Graph/Relation.dyn_o )
1044.32 s
[monoid-subclasses] stripCommonPrefix 3: OK (0.85s)
1044.32 s
[monoid-subclasses] +++ OK, passed 100 tests.
1044.33 s
[regex-tdfa] [ 3 of 25] Compiling Data.IntMap.EnumMap2 ( lib/Data/IntMap/EnumMap2.hs, nothing )
1044.73 s
[ghc-lib-parser-ex] [ 3 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Driver.Flags ( src/Language/Haskell/GhclibParserEx/GHC/Driver/Flags.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Driver/Flags.p_o )
1044.73 s
[ghc-lib-parser-ex] [ 4 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Driver.Session ( src/Language/Haskell/GhclibParserEx/GHC/Driver/Session.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Driver/Session.p_o )
1044.76 s
[monoid-subclasses] stripCommonPrefix 4: OK (0.45s)
1044.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1044.95 s
[regex-tdfa] [ 4 of 25] Compiling Paths_regex_tdfa ( dist/build/autogen/Paths_regex_tdfa.hs, nothing )
1044.96 s
[unix-compat] Preprocessing library for unix-compat-0.7.4..
1044.96 s
[unix-compat] Running Haddock on library for unix-compat-0.7.4..
1045.02 s
[regex-tdfa] [ 5 of 25] Compiling Text.Regex.TDFA.IntArrTrieSet ( lib/Text/Regex/TDFA/IntArrTrieSet.hs, nothing )
1045.05 s
[adjunctions] [2 of 2] Compiling Main ( tests/Spec.hs, dist/build/spec/spec-tmp/Main.o )
1045.08 s
[regex-tdfa] [ 6 of 25] Compiling Text.Regex.TDFA.Common ( lib/Text/Regex/TDFA/Common.hs, nothing )
1045.11 s
[monoid-subclasses] stripCommonSuffix 1: OK (0.36s)
1045.11 s
[monoid-subclasses] +++ OK, passed 100 tests.
1045.25 s
[unix-compat] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1045.29 s
[filepattern] [4 of 4] Linking dist/build/filepattern-test/filepattern-test
1045.50 s
[monoid-subclasses] stripCommonSuffix 2: OK (0.37s)
1045.50 s
[monoid-subclasses] +++ OK, passed 100 tests.
1045.50 s
[attoparsec] [ 2 of 12] Compiling QC.Combinator ( tests/QC/Combinator.hs, dist/build/attoparsec-tests/attoparsec-tests-tmp/QC/Combinator.o )
1045.69 s
[ghc-lib-parser-ex] [ 5 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs ( src/Language/Haskell/GhclibParserEx/GHC/Hs.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs.p_o )
1045.69 s
[ghc-lib-parser-ex] [ 6 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Binds ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Binds.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Binds.p_o )
1045.69 s
[ghc-lib-parser-ex] [ 7 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Decls ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Decls.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Decls.p_o )
1045.69 s
[ghc-lib-parser-ex] [ 8 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.ExtendInstances ( src/Language/Haskell/GhclibParserEx/GHC/Hs/ExtendInstances.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/ExtendInstances.p_o )
1045.69 s
[ghc-lib-parser-ex] [ 9 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.ImpExp ( src/Language/Haskell/GhclibParserEx/GHC/Hs/ImpExp.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/ImpExp.p_o )
1045.69 s
[ghc-lib-parser-ex] [10 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Pat ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.p_o )
1045.69 s
[ghc-lib-parser-ex] [11 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Type ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Type.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Type.p_o )
1045.69 s
[ghc-lib-parser-ex] [12 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Types ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Types.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Types.p_o )
1045.69 s
[ghc-lib-parser-ex] [13 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Parser ( src/Language/Haskell/GhclibParserEx/GHC/Parser.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Parser.p_o )
1045.69 s
[ghc-lib-parser-ex] [14 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Settings.Config ( src/Language/Haskell/GhclibParserEx/GHC/Settings/Config.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Settings/Config.p_o )
1045.69 s
[ghc-lib-parser-ex] [15 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Types.Name.Reader ( src/Language/Haskell/GhclibParserEx/GHC/Types/Name/Reader.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Types/Name/Reader.p_o )
1045.69 s
[ghc-lib-parser-ex] [16 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Expr ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.p_o )
1045.69 s
[ghc-lib-parser-ex] [17 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Utils.Outputable ( src/Language/Haskell/GhclibParserEx/GHC/Utils/Outputable.hs, dist/build/Language/Haskell/GhclibParserEx/GHC/Utils/Outputable.p_o )
1045.69 s
[ghc-lib-parser-ex] [18 of 18] Compiling Paths_ghc_lib_parser_ex ( dist/build/autogen/Paths_ghc_lib_parser_ex.hs, dist/build/Paths_ghc_lib_parser_ex.p_o )
1045.74 s
[regex-tdfa] [ 7 of 25] Compiling Text.Regex.TDFA.NewDFA.Uncons ( lib/Text/Regex/TDFA/NewDFA/Uncons.hs, nothing )
1045.80 s
[regex-tdfa] [ 8 of 25] Compiling Text.Regex.TDFA.NewDFA.MakeTest ( lib/Text/Regex/TDFA/NewDFA/MakeTest.hs, nothing )
1045.85 s
[regex-tdfa] [ 9 of 25] Compiling Text.Regex.TDFA.NewDFA.Tester ( lib/Text/Regex/TDFA/NewDFA/Tester.hs, nothing )
1045.90 s
[monoid-subclasses] stripCommonSuffix 3: OK (0.42s)
1045.90 s
[monoid-subclasses] +++ OK, passed 100 tests.
1045.95 s
[regex-tdfa] [10 of 25] Compiling Text.Regex.TDFA.NewDFA.Engine_NC_FA ( lib/Text/Regex/TDFA/NewDFA/Engine_NC_FA.hs, nothing )
1045.98 s
[adjunctions] [3 of 3] Linking dist/build/spec/spec
1046.03 s
[algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.o, dist/build/Algebra/Graph/Relation/Symmetric.dyn_o )
1046.04 s
[regex-tdfa] [11 of 25] Compiling Text.Regex.TDFA.NewDFA.Engine_NC ( lib/Text/Regex/TDFA/NewDFA/Engine_NC.hs, nothing )
1046.14 s
[monoid-subclasses] stripCommonSuffix 4: OK (0.24s)
1046.14 s
[monoid-subclasses] +++ OK, passed 100 tests.
1046.16 s
[monoid-subclasses] gcd: OK (0.01s)
1046.16 s
[monoid-subclasses] +++ OK, passed 100 tests.
1046.18 s
[monoid-subclasses] gcd uniqueness: OK (0.01s)
1046.18 s
[monoid-subclasses] +++ OK, passed 100 tests.
1046.22 s
[monoid-subclasses] gcd idempotence: OK (0.06s)
1046.22 s
[monoid-subclasses] +++ OK, passed 100 tests.
1046.22 s
[monoid-subclasses] gcd identity (left): OK
1046.23 s
[monoid-subclasses] +++ OK, passed 100 tests.
1046.23 s
[monoid-subclasses] gcd identity (right): OK
1046.24 s
[monoid-subclasses] +++ OK, passed 100 tests.
1046.26 s
[monoid-subclasses] gcd commutativity: OK (0.01s)
1046.26 s
[monoid-subclasses] +++ OK, passed 100 tests.
1046.28 s
[monoid-subclasses] gcd associativity: OK (0.02s)
1046.28 s
[monoid-subclasses] +++ OK, passed 100 tests.
1046.29 s
[monoid-subclasses] gcd distributivity (left): OK (0.01s)
1046.29 s
[monoid-subclasses] +++ OK, passed 100 tests.
1046.29 s
[unix-compat] [1 of 8] Compiling System.PosixCompat.Files ( dist/build/System/PosixCompat/Files.hs, nothing )
1046.30 s
[monoid-subclasses] gcd distributivity (right): OK (0.01s)
1046.30 s
[monoid-subclasses] +++ OK, passed 100 tests.
1046.36 s
[regex-tdfa] [12 of 25] Compiling Text.Regex.TDFA.NewDFA.Engine_FA ( lib/Text/Regex/TDFA/NewDFA/Engine_FA.hs, nothing )
1046.40 s
[unix-compat] [2 of 8] Compiling System.PosixCompat.Process ( src/System/PosixCompat/Process.hs, nothing )
1046.42 s
[unix-compat] [3 of 8] Compiling System.PosixCompat.Temp ( src/System/PosixCompat/Temp.hs, nothing )
1046.43 s
[unix-compat] [4 of 8] Compiling System.PosixCompat.Time ( src/System/PosixCompat/Time.hs, nothing )
1046.44 s
[unix-compat] [5 of 8] Compiling System.PosixCompat.Types ( src/System/PosixCompat/Types.hs, nothing )
1046.49 s
[unix-compat] [6 of 8] Compiling System.PosixCompat.Extensions ( dist/build/System/PosixCompat/Extensions.hs, nothing )
1046.50 s
[unix-compat] [7 of 8] Compiling System.PosixCompat.Unistd ( src/System/PosixCompat/Unistd.hs, nothing )
1046.51 s
[unix-compat] [8 of 8] Compiling System.PosixCompat ( src/System/PosixCompat.hs, nothing )
1046.53 s
[unix-compat] Haddock coverage:
1046.54 s
[unix-compat] 98% ( 80 / 81) in 'System.PosixCompat.Files'
1046.54 s
[unix-compat] Missing documentation for:
1046.54 s
[unix-compat] PathVar
1046.54 s
[unix-compat] 100% ( 2 / 2) in 'System.PosixCompat.Process'
1046.56 s
[unix-compat] 100% ( 2 / 2) in 'System.PosixCompat.Temp'
1046.56 s
[unix-compat] 100% ( 2 / 2) in 'System.PosixCompat.Time'
1046.57 s
[unix-compat] 100% ( 2 / 2) in 'System.PosixCompat.Types'
1046.57 s
[unix-compat] 71% ( 5 / 7) in 'System.PosixCompat.Extensions'
1046.57 s
[unix-compat] Missing documentation for:
1046.57 s
[unix-compat] CMajor (src/System/PosixCompat/Extensions.hsc:23)
1046.58 s
[unix-compat] CMinor (src/System/PosixCompat/Extensions.hsc:24)
1046.59 s
[unix-compat] 75% ( 6 / 8) in 'System.PosixCompat.Unistd'
1046.59 s
[unix-compat] Missing documentation for:
1046.59 s
[unix-compat] SystemID
1046.59 s
[unix-compat] getSystemID
1046.59 s
[unix-compat] 100% ( 8 / 8) in 'System.PosixCompat'
1046.74 s
[monoid-subclasses] commonPrefix idempotence: OK (0.43s)
1046.74 s
[monoid-subclasses] +++ OK, passed 100 tests.
1046.89 s
[monoid-subclasses] commonPrefix identity (left): OK (0.17s)
1046.89 s
[monoid-subclasses] +++ OK, passed 100 tests.
1047.03 s
[monoid-subclasses] commonPrefix identity (right): OK (0.15s)
1047.03 s
[monoid-subclasses] +++ OK, passed 100 tests.
1047.37 s
[regex-tdfa] [13 of 25] Compiling Text.Regex.TDFA.NewDFA.Engine ( lib/Text/Regex/TDFA/NewDFA/Engine.hs, nothing )
1047.51 s
[filepattern] Phase: checkPhase
1047.55 s
[algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.o, dist/build/Algebra/Graph/NonEmpty.dyn_o )
1047.55 s
[algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.o, dist/build/Algebra/Graph/Labelled/AdjacencyMap.dyn_o )
1047.55 s
[algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.o, dist/build/Algebra/Graph/Labelled.dyn_o )
1047.73 s
[filepattern] Running 1 test suites...
1047.73 s
[filepattern] Test suite filepattern-test: RUNNING...
1047.78 s
[monoid-subclasses] commonPrefix commutativity: OK (0.73s)
1047.78 s
[monoid-subclasses] +++ OK, passed 100 tests.
1047.79 s
[aeson] Phase: updateAutotoolsGnuConfigScriptsPhase
1047.82 s
[aeson] Phase: configurePhase
1047.83 s
[aeson] configureFlags: --verbose --prefix=/nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/ljr3rnwd8s1fggbaiwd22941awg4hks7-aeson-2.2.3.0-doc/share/doc/aeson-2.2.3.0 --with-gcc=gcc --package-db=/build/tmp.a5GvLMNAMS/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1047.86 s
[aeson] Using Parsec parser
1047.86 s
[aeson] Configuring aeson-2.2.3.0...
1048.15 s
[attoparsec] [ 3 of 12] Compiling QC.ByteString ( tests/QC/ByteString.hs, dist/build/attoparsec-tests/attoparsec-tests-tmp/QC/ByteString.o )
1048.32 s
[filepattern] Testing...
1048.32 s
[filepattern] Passed 126 specific cases
1048.32 s
[filepattern] Passed 12996 properties on specific cases
1048.32 s
[filepattern] +++ OK, passed 10000 tests (3.06% match).
1048.32 s
[filepattern] SUCCESS (all tests completed)
1048.32 s
[filepattern] Test suite filepattern-test: PASS
1048.33 s
[filepattern] Test suite logged to: dist/test/filepattern-0.1.3-filepattern-test.log
1048.33 s
[filepattern] 1 of 1 test suites (1 of 1 test cases) passed.
1048.35 s
[filepattern] Phase: haddockPhase
1048.58 s
[regex-tdfa] [14 of 25] Compiling Text.Regex.TDFA.Pattern ( lib/Text/Regex/TDFA/Pattern.hs, nothing )
1048.73 s
[adjunctions] Phase: checkPhase
1048.90 s
[adjunctions] Running 1 test suites...
1048.90 s
[adjunctions] Test suite spec: RUNNING...
1048.93 s
[adjunctions]
1048.93 s
[adjunctions] Generics
1048.93 s
[adjunctions] Id
1048.93 s
[adjunctions] index idExample idRep = 42 [✔]
1048.93 s
[adjunctions] Stream
1048.93 s
[adjunctions] index streamExample streamRep1 = 0 [✔]
1048.93 s
[adjunctions] index streamExample streamRep2 = 1 [✔]
1048.93 s
[adjunctions] index streamExample streamRep3 = 2 [✔]
1048.93 s
[adjunctions] PolyRec
1048.93 s
[adjunctions] index polyRecExample polyRecRep1 = 1 [✔]
1048.93 s
[adjunctions] index polyRecExample polyRecRep2 = 2 [✔]
1048.93 s
[adjunctions] index polyRecExample polyRecRep3 = 0 [✔]
1048.93 s
[adjunctions]
1048.93 s
[adjunctions] Finished in 0.0054 seconds
1048.93 s
[adjunctions] 7 examples, 0 failures
1048.94 s
[adjunctions] Test suite spec: PASS
1048.94 s
[adjunctions] Test suite logged to: dist/test/adjunctions-4.4.3-spec.log
1048.94 s
[adjunctions] 1 of 1 test suites (1 of 1 test cases) passed.
1048.96 s
[filepattern] Preprocessing library for filepattern-0.1.3..
1048.96 s
[adjunctions] Phase: haddockPhase
1048.97 s
[filepattern] Running Haddock on library for filepattern-0.1.3..
1049.04 s
[algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.o, dist/build/Algebra/Graph/Labelled/Example/Network.dyn_o )
1049.13 s
[filepattern] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1049.17 s
[regex-tdfa] [15 of 25] Compiling Text.Regex.TDFA.CorePattern ( lib/Text/Regex/TDFA/CorePattern.hs, nothing )
1049.31 s
[monoid-subclasses] commonPrefix associativity: OK (1.52s)
1049.31 s
[monoid-subclasses] +++ OK, passed 100 tests.
1049.34 s
[monoid-subclasses] commonPrefix distributivity: OK (0.04s)
1049.34 s
[monoid-subclasses] +++ OK, passed 100 tests.
1049.52 s
[adjunctions] Preprocessing library for adjunctions-4.4.3..
1049.53 s
[adjunctions] Running Haddock on library for adjunctions-4.4.3..
1049.56 s
[monoid-subclasses] commonSuffix idempotence: OK (0.24s)
1049.56 s
[monoid-subclasses] +++ OK, passed 100 tests.
1049.58 s
[aeson] Flags chosen: ordered-keymap=True
1049.58 s
[aeson] Dependency OneTuple >=0.4.1.1 && <0.5: using OneTuple-0.4.2
1049.58 s
[aeson] Dependency QuickCheck >=2.14.3 && <2.16: using QuickCheck-2.14.3
1049.58 s
[aeson] Dependency base >=4.12.0.0 && <5: using base-4.19.0.0
1049.58 s
[aeson] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.0.2
1049.58 s
[aeson] Dependency character-ps >=0.1 && <0.2: using character-ps-0.1
1049.58 s
[aeson] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.8
1049.58 s
[aeson] Dependency data-fix >=0.3.2 && <0.4: using data-fix-0.3.4
1049.58 s
[aeson] Dependency deepseq >=1.4.4.0 && <1.6: using deepseq-1.5.0.0
1049.58 s
[aeson] Dependency dlist >=1.0 && <1.1: using dlist-1.0
1049.58 s
[aeson] Dependency exceptions >=0.10.4 && <0.11: using exceptions-0.10.7
1049.58 s
[aeson] Dependency generically >=0.1 && <0.2: using generically-0.1.1
1049.58 s
[aeson] Dependency ghc-prim >=0.5.0.0 && <0.14: using ghc-prim-0.11.0
1049.58 s
[aeson] Dependency hashable >=1.4.6.0 && <1.5 || >=1.5.0.0 && <1.6: using
1049.58 s
[aeson] hashable-1.4.7.0
1049.58 s
[aeson] Dependency indexed-traversable >=0.1.2 && <0.2: using
1049.58 s
[aeson] indexed-traversable-0.1.4
1049.58 s
[aeson] Dependency integer-conversion >=0.1 && <0.2: using integer-conversion-0.1.1
1049.58 s
[aeson] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
1049.58 s
[aeson] integer-logarithms-1.0.4
1049.58 s
[aeson] Dependency network-uri >=2.6.4.1 && <2.7: using network-uri-2.6.4.2
1049.58 s
[aeson] Dependency primitive >=0.8.0.0 && <0.9 || >=0.9.0.0 && <0.10: using
1049.58 s
[aeson] primitive-0.9.1.0
1049.58 s
[aeson] Dependency scientific >=0.3.7.0 && <0.4: using scientific-0.3.8.0
1049.58 s
[aeson] Dependency semialign >=1.3 && <1.4: using semialign-1.3.1
1049.58 s
[aeson] Dependency strict >=0.5 && <0.6: using strict-0.5.1
1049.58 s
[aeson] Dependency tagged >=0.8.7 && <0.9: using tagged-0.8.8
1049.58 s
[aeson] Dependency template-haskell >=2.14.0.0 && <2.24: using
1049.58 s
[aeson] template-haskell-2.21.0.0
1049.58 s
[aeson] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1
1049.58 s
[aeson] Dependency text-iso8601 >=0.1.1 && <0.2: using text-iso8601-0.1.1
1049.58 s
[aeson] Dependency text-short >=0.1.5 && <0.2: using text-short-0.1.6
1049.59 s
[aeson] Dependency th-abstraction >=0.5.0.0 && <0.6 || >=0.6.0.0 && <0.7 || >=0.7.0.0
1049.59 s
[aeson] && <0.8: using th-abstraction-0.7.1.0
1049.59 s
[aeson] Dependency these >=1.2 && <1.3: using these-1.2.1
1049.59 s
[aeson] Dependency time >=1.8.0.2 && <1.15: using time-1.12.2
1049.59 s
[aeson] Dependency time-compat >=1.9.6 && <1.10: using time-compat-1.9.7
1049.59 s
[aeson] Dependency unordered-containers >=0.2.10.0 && <0.3: using
1049.59 s
[aeson] unordered-containers-0.2.20
1049.59 s
[aeson] Dependency uuid-types >=1.0.5 && <1.1: using uuid-types-1.0.6
1049.59 s
[aeson] Dependency vector >=0.13.0.0 && <0.14: using vector-0.13.2.0
1049.59 s
[aeson] Dependency witherable >=0.4.2 && <0.6: using witherable-0.5
1049.59 s
[aeson] Dependency Diff >=0.4 && <0.6 || >=1.0.2 && <1.1: using Diff-0.5
1049.59 s
[aeson] Dependency OneTuple: using OneTuple-0.4.2
1049.59 s
[aeson] Dependency QuickCheck >=2.14.2 && <2.16: using QuickCheck-2.14.3
1049.59 s
[aeson] Dependency aeson: using aeson-2.2.3.0
1049.59 s
[aeson] Dependency base: using base-4.19.0.0
1049.59 s
[aeson] Dependency base-compat: using base-compat-0.13.1
1049.59 s
[aeson] Dependency base-orphans >=0.5.3 && <0.10: using base-orphans-0.9.3
1049.59 s
[aeson] Dependency base16-bytestring: using base16-bytestring-1.0.2.0
1049.59 s
[aeson] Dependency bytestring: using bytestring-0.12.0.2
1049.59 s
[aeson] Dependency containers: using containers-0.6.8
1049.59 s
[aeson] Dependency data-fix: using data-fix-0.3.4
1049.59 s
[aeson] Dependency deepseq: using deepseq-1.5.0.0
1049.59 s
[aeson] Dependency directory: using directory-1.3.8.1
1049.59 s
[aeson] Dependency dlist: using dlist-1.0
1049.59 s
[aeson] Dependency filepath: using filepath-1.4.100.4
1049.59 s
[aeson] Dependency generic-deriving >=1.10 && <1.15: using generic-deriving-1.14.6
1049.59 s
[aeson] Dependency generically: using generically-0.1.1
1049.59 s
[aeson] Dependency ghc-prim >=0.2: using ghc-prim-0.11.0
1049.59 s
[aeson] Dependency hashable: using hashable-1.4.7.0
1049.59 s
[aeson] Dependency indexed-traversable: using indexed-traversable-0.1.4
1049.59 s
[aeson] Dependency integer-logarithms >=1 && <1.1: using integer-logarithms-1.0.4
1049.59 s
[aeson] Dependency network-uri: using network-uri-2.6.4.2
1049.59 s
[aeson] Dependency primitive: using primitive-0.9.1.0
1049.59 s
[aeson] Dependency quickcheck-instances >=0.3.29 && <0.4: using
1049.59 s
[aeson] quickcheck-instances-0.3.32
1049.59 s
[aeson] Dependency scientific: using scientific-0.3.8.0
1049.59 s
[aeson] Dependency strict: using strict-0.5.1
1049.59 s
[aeson] Dependency tagged: using tagged-0.8.8
1049.59 s
[aeson] Dependency tasty: using tasty-1.5.3
1049.59 s
[aeson] Dependency tasty-golden: using tasty-golden-2.3.5
1049.59 s
[aeson] Dependency tasty-hunit: using tasty-hunit-0.10.2
1049.59 s
[aeson] Dependency tasty-quickcheck: using tasty-quickcheck-0.11
1049.59 s
[aeson] Dependency template-haskell: using template-haskell-2.21.0.0
1049.59 s
[aeson] Dependency text: using text-2.1
1049.59 s
[aeson] Dependency text-short: using text-short-0.1.6
1049.59 s
[aeson] Dependency these: using these-1.2.1
1049.59 s
[aeson] Dependency time: using time-1.12.2
1049.59 s
[aeson] Dependency time-compat: using time-compat-1.9.7
1049.59 s
[aeson] Dependency unordered-containers: using unordered-containers-0.2.20
1049.59 s
[aeson] Dependency uuid-types: using uuid-types-1.0.6
1049.59 s
[aeson] Dependency vector: using vector-0.13.2.0
1049.60 s
[filepattern] [1 of 8] Compiling System.FilePattern.ListBy ( src/System/FilePattern/ListBy.hs, nothing )
1049.66 s
[monoid-subclasses] commonSuffix identity (left): OK (0.10s)
1049.66 s
[monoid-subclasses] +++ OK, passed 100 tests.
1049.72 s
[algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.o, dist/build/Algebra/Graph/Labelled/Example/Automaton.dyn_o )
1049.73 s
[filepattern] [2 of 8] Compiling System.FilePattern.Monads ( src/System/FilePattern/Monads.hs, nothing )
1049.76 s
[monoid-subclasses] commonSuffix identity (right): OK (0.09s)
1049.76 s
[monoid-subclasses] +++ OK, passed 100 tests.
1049.78 s
[filepattern] [3 of 8] Compiling System.FilePattern.Tree ( src/System/FilePattern/Tree.hs, nothing )
1049.86 s
[filepattern]
1049.86 s
[filepattern] src/System/FilePattern/Tree.hs:16:45: warning : [ GHC-63394 ] [ -Wx-partial ]
1049.86 s
[filepattern] In the use of ‘head’
1049.86 s
[filepattern] (imported from Prelude, but defined in GHC.List):
1049.86 s
[filepattern] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1049.86 s
[filepattern] |
1049.86 s
[filepattern] 16 | f xs = Tree (map fst empty) [(fst $ head gs, f $ map snd gs) | gs <- groups]
1049.86 s
[filepattern] | ^^^^
1049.86 s
[filepattern] [4 of 8] Compiling System.FilePattern.Wildcard ( src/System/FilePattern/Wildcard.hs, nothing )
1049.91 s
[adjunctions] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1049.99 s
[attoparsec] [ 4 of 12] Compiling QC.Buffer ( tests/QC/Buffer.hs, dist/build/attoparsec-tests/attoparsec-tests-tmp/QC/Buffer.o )
1049.99 s
[attoparsec] [ 5 of 12] Compiling QC.IPv6.Types ( tests/QC/IPv6/Types.hs, dist/build/attoparsec-tests/attoparsec-tests-tmp/QC/IPv6/Types.o )
1049.99 s
[attoparsec] [ 6 of 12] Compiling QC.IPv6.Internal ( tests/QC/IPv6/Internal.hs, dist/build/attoparsec-tests/attoparsec-tests-tmp/QC/IPv6/Internal.o )
1049.99 s
[attoparsec]
1049.99 s
[attoparsec] tests/QC/IPv6/Internal.hs:32:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1049.99 s
[attoparsec] The import of ‘Control.Monad’ is redundant
1049.99 s
[attoparsec] except perhaps to import instances from ‘Control.Monad’
1049.99 s
[attoparsec] To import instances alone, use: import Control.Monad()
1049.99 s
[attoparsec] |
1049.99 s
[attoparsec] 32 | import Control.Monad (replicateM)
1049.99 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1049.99 s
[attoparsec]
1049.99 s
[attoparsec] tests/QC/IPv6/Internal.hs:34:1: warning : [ GHC-38856 ] [ -Wunused-imports ]
1049.99 s
[attoparsec] The import of ‘isHexDigit, toLower’
1049.99 s
[attoparsec] from module ‘Data.Char’ is redundant
1049.99 s
[attoparsec] |
1049.99 s
[attoparsec] 34 | import Data.Char (isDigit,isHexDigit,toLower)
1049.99 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1049.99 s
[attoparsec]
1049.99 s
[attoparsec] tests/QC/IPv6/Internal.hs:35:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1049.99 s
[attoparsec] The import of ‘Data.Monoid’ is redundant
1049.99 s
[attoparsec] except perhaps to import instances from ‘Data.Monoid’
1049.99 s
[attoparsec] To import instances alone, use: import Data.Monoid()
1049.99 s
[attoparsec] |
1049.99 s
[attoparsec] 35 | import Data.Monoid ((<>))
1049.99 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^^^^^^^^
1049.99 s
[attoparsec]
1049.99 s
[attoparsec] tests/QC/IPv6/Internal.hs:36:35: warning : [ GHC-38856 ] [ -Wunused-imports ]
1049.99 s
[attoparsec] The import of ‘<*’ from module ‘Control.Applicative’ is redundant
1049.99 s
[attoparsec] |
1049.99 s
[attoparsec] 36 | import Control.Applicative ((<|>),(<*) )
1049.99 s
[attoparsec] | ^^^^
1049.99 s
[attoparsec]
1049.99 s
[attoparsec] tests/QC/IPv6/Internal.hs:38:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1049.99 s
[attoparsec] The import of ‘Data.Word’ is redundant
1049.99 s
[attoparsec] except perhaps to import instances from ‘Data.Word’
1049.99 s
[attoparsec] To import instances alone, use: import Data.Word()
1049.99 s
[attoparsec] |
1049.99 s
[attoparsec] 38 | import Data.Word (Word32)
1049.99 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^^^^^^^^
1049.99 s
[attoparsec]
1049.99 s
[attoparsec] tests/QC/IPv6/Internal.hs:46:1: warning : [ GHC-38417 ] [ -Wmissing-signatures ]
1049.99 s
[attoparsec] Top-level binding with no type signature: tok0 :: T.Text
1049.99 s
[attoparsec] |
1049.99 s
[attoparsec] 46 | tok0 = "0"
1049.99 s
[attoparsec] | ^^^^
1049.99 s
[attoparsec]
1049.99 s
[attoparsec] tests/QC/IPv6/Internal.hs:68:36: warning : [ GHC-40910 ] [ -Wunused-matches ]
1049.99 s
[attoparsec] Defined but not used: ‘tok1’
1049.99 s
[attoparsec] |
1049.99 s
[attoparsec] 68 | isIPv6Addr [DoubleColon,SixteenBit tok1 ] = True
1049.99 s
[attoparsec] | ^^^^
1049.99 s
[attoparsec]
1050.00 s
[attoparsec] tests/QC/IPv6/Internal.hs:77:17: warning : [ GHC-18042 ] [ -Wtype-defaults ]
1050.00 s
[attoparsec] • Defaulting the type variable ‘a0’ to type ‘Integer’ in the following constraints
1050.00 s
[attoparsec] (Eq a0)
1050.00 s
[attoparsec] arising from the literal ‘0’ at tests/QC/IPv6/Internal.hs:77:17
1050.00 s
[attoparsec] (Num a0)
1050.00 s
[attoparsec] arising from the literal ‘0’ at tests/QC/IPv6/Internal.hs:77:17
1050.00 s
[attoparsec] (Num a0)
1050.00 s
[attoparsec] arising from a use of ‘oneMoreIPv4Addr’
1050.00 s
[attoparsec] at tests/QC/IPv6/Internal.hs:109:23-37
1050.00 s
[attoparsec] (Eq a0)
1050.00 s
[attoparsec] arising from a use of ‘==’ at tests/QC/IPv6/Internal.hs:221:45-46
1050.00 s
[attoparsec] (Num a0)
1050.00 s
[attoparsec] arising from the literal ‘1’ at tests/QC/IPv6/Internal.hs:221:48
1050.00 s
[attoparsec] • In the pattern: 0
1050.00 s
[attoparsec] In a case alternative:
1050.00 s
[attoparsec] 0 -> case lasttk of
1050.00 s
[attoparsec] SixteenBit _ -> lenconst
1050.00 s
[attoparsec] DoubleColon -> lenconst
1050.00 s
[attoparsec] AllZeros -> lenconst
1050.00 s
[attoparsec] _ -> False
1050.00 s
[attoparsec] In the second argument of ‘(&&)’, namely
1050.00 s
[attoparsec] ‘(case countIPv4Addr tks of
1050.00 s
[attoparsec] 0 -> case lasttk of
1050.00 s
[attoparsec] SixteenBit _ -> lenconst
1050.00 s
[attoparsec] DoubleColon -> lenconst
1050.00 s
[attoparsec] AllZeros -> lenconst
1050.00 s
[attoparsec] _ -> False
1050.00 s
[attoparsec] 1 -> case lasttk of
1050.00 s
[attoparsec] IPv4Addr _
1050.00 s
[attoparsec] -> (lentks == 13 && cdctks == 0) || (lentks < 12 && cdctks == 1)
1050.00 s
[attoparsec] _ -> False
1050.00 s
[attoparsec] otherwise -> False)’
1050.00 s
[attoparsec] |
1050.00 s
[attoparsec] 77 | 0 -> case lasttk of
1050.00 s
[attoparsec] | ^
1050.00 s
[attoparsec]
1050.00 s
[attoparsec] tests/QC/IPv6/Internal.hs:85:17: warning : [ GHC-40910 ] [ -Wunused-matches ]
1050.00 s
[attoparsec] Defined but not used: ‘otherwise’
1050.00 s
[attoparsec] |
1050.00 s
[attoparsec] 85 | otherwise -> False))
1050.00 s
[attoparsec] | ^^^^^^^^^
1050.00 s
[attoparsec]
1050.00 s
[attoparsec] tests/QC/IPv6/Internal.hs:85:17: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1050.00 s
[attoparsec] This binding for ‘otherwise’ shadows the existing binding
1050.00 s
[attoparsec] imported from ‘Prelude’ at tests/QC/IPv6/Internal.hs:16:8-23
1050.00 s
[attoparsec] (and originally defined in ‘GHC.Base’)
1050.00 s
[attoparsec] |
1050.00 s
[attoparsec] 85 | otherwise -> False))
1050.00 s
[attoparsec] | ^^^^^^^^^
1050.00 s
[attoparsec]
1050.00 s
[attoparsec] tests/QC/IPv6/Internal.hs:89:29: warning : [ GHC-63394 ] [ -Wx-partial ]
1050.00 s
[attoparsec] In the use of ‘head’
1050.00 s
[attoparsec] (imported from Prelude, but defined in GHC.List):
1050.00 s
[attoparsec] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1050.00 s
[attoparsec] |
1050.00 s
[attoparsec] 89 | let h = head ts
1050.00 s
[attoparsec] | ^^^^
1050.00 s
[attoparsec]
1050.00 s
[attoparsec] tests/QC/IPv6/Internal.hs:101:26: warning : [ GHC-63394 ] [ -Wx-partial ]
1050.00 s
[attoparsec] In the use of ‘head’
1050.00 s
[attoparsec] (imported from Prelude, but defined in GHC.List):
1050.00 s
[attoparsec] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1050.00 s
[attoparsec] |
1050.00 s
[attoparsec] 101 | case head l of
1050.00 s
[attoparsec] | ^^^^
1050.00 s
[attoparsec]
1050.00 s
[attoparsec] tests/QC/IPv6/Internal.hs:107:17: warning : [ GHC-40910 ] [ -Wunused-local-binds ]
1050.00 s
[attoparsec] Defined but not used: ‘tok1’
1050.00 s
[attoparsec] |
1050.00 s
[attoparsec] 107 | tok1 = "1"
1050.00 s
[attoparsec] | ^^^^
1050.00 s
[attoparsec]
1050.00 s
[attoparsec] tests/QC/IPv6/Internal.hs:107:24: warning : [ GHC-18042 ] [ -Wtype-defaults ]
1050.00 s
[attoparsec] • Defaulting the type variable ‘a0’ to type ‘String’ in the following constraint
1050.00 s
[attoparsec] Data.String.IsString a0 arising from the literal ‘"1"’
1050.00 s
[attoparsec] • In the expression: "1"
1050.00 s
[attoparsec] In an equation for ‘tok1’: tok1 = "1"
1050.00 s
[attoparsec] In an equation for ‘isIPv6Addr’:
1050.00 s
[attoparsec] isIPv6Addr tks
1050.00 s
[attoparsec] = diffNext tks
1050.00 s
[attoparsec] &&
1050.00 s
[attoparsec] (do let cdctks = countDoubleColon tks
1050.00 s
[attoparsec] let lentks = length tks
1050.00 s
[attoparsec] let lasttk = last tks
1050.00 s
[attoparsec] let lenconst
1050.00 s
[attoparsec] = (lentks == 15 && cdctks == 0) || (lentks < 15 && cdctks == 1)
1050.00 s
[attoparsec] ....)
1050.00 s
[attoparsec] where
1050.00 s
[attoparsec] diffNext [] = False
1050.00 s
[attoparsec] diffNext [_] = True
1050.00 s
[attoparsec] diffNext (t : ts)
1050.00 s
[attoparsec] = do let ...
1050.00 s
[attoparsec] ....
1050.00 s
[attoparsec] firstValidToken l
1050.01 s
[attoparsec] = case head l of
1050.01 s
[attoparsec] SixteenBit _ -> True
1050.01 s
[attoparsec] DoubleColon -> True
1050.01 s
[attoparsec] AllZeros -> True
1050.01 s
[attoparsec] _ -> False
1050.01 s
[attoparsec] countDoubleColon l = length $ elemIndices DoubleColon l
1050.01 s
[attoparsec] tok1 = "1"
1050.01 s
[attoparsec] |
1050.01 s
[attoparsec] 107 | tok1 = "1"
1050.01 s
[attoparsec] | ^^^
1050.01 s
[attoparsec]
1050.01 s
[attoparsec] tests/QC/IPv6/Internal.hs:109:1: warning : [ GHC-38417 ] [ -Wmissing-signatures ]
1050.01 s
[attoparsec] Top-level binding with no type signature:
1050.01 s
[attoparsec] countIPv4Addr :: [IPv6AddrToken] -> Integer
1050.01 s
[attoparsec] |
1050.01 s
[attoparsec] 109 | countIPv4Addr = foldr oneMoreIPv4Addr 0
1050.01 s
[attoparsec] | ^^^^^^^^^^^^^
1050.01 s
[attoparsec]
1050.01 s
[attoparsec] tests/QC/IPv6/Internal.hs:113:31: warning : [ GHC-40910 ] [ -Wunused-matches ]
1050.01 s
[attoparsec] Defined but not used: ‘otherwise’
1050.01 s
[attoparsec] |
1050.01 s
[attoparsec] 113 | otherwise -> c
1050.01 s
[attoparsec] | ^^^^^^^^^
1050.01 s
[attoparsec]
1050.01 s
[attoparsec] tests/QC/IPv6/Internal.hs:113:31: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1050.01 s
[attoparsec] This binding for ‘otherwise’ shadows the existing binding
1050.01 s
[attoparsec] imported from ‘Prelude’ at tests/QC/IPv6/Internal.hs:16:8-23
1050.01 s
[attoparsec] (and originally defined in ‘GHC.Base’)
1050.01 s
[attoparsec] |
1050.01 s
[attoparsec] 113 | otherwise -> c
1050.01 s
[attoparsec] | ^^^^^^^^^
1050.01 s
[attoparsec]
1050.01 s
[attoparsec] tests/QC/IPv6/Internal.hs:145:5: warning : [ GHC-62161 ] [ -Wincomplete-patterns ]
1050.01 s
[attoparsec] Pattern match(es) are non-exhaustive
1050.01 s
[attoparsec] In a case alternative:
1050.01 s
[attoparsec] Patterns of type ‘IResult T.Text [IPv6AddrToken]’ not matched:
1050.01 s
[attoparsec] Partial _
1050.01 s
[attoparsec] |
1050.01 s
[attoparsec] 145 | case readText s of
1050.01 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^...
1050.01 s
[attoparsec]
1050.01 s
[attoparsec] tests/QC/IPv6/Internal.hs:149:14: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1050.01 s
[attoparsec] This binding for ‘s’ shadows the existing binding
1050.01 s
[attoparsec] bound at tests/QC/IPv6/Internal.hs:144:21
1050.01 s
[attoparsec] |
1050.01 s
[attoparsec] 149 | readText s = feed (parse (many1 $ ipv4Addr <|> sixteenBit <|> doubleColon <|> colon) s) T.empty
1050.01 s
[attoparsec] | ^
1050.01 s
[attoparsec]
1050.01 s
[attoparsec] tests/QC/IPv6/Internal.hs:212:55: warning : [ GHC-63394 ] [ -Wx-partial ]
1050.01 s
[attoparsec] In the use of ‘tail’
1050.01 s
[attoparsec] (imported from Prelude, but defined in GHC.List):
1050.01 s
[attoparsec] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1050.01 s
[attoparsec] |
1050.01 s
[attoparsec] 212 | let snds = if not (null (snd s)) then tail (snd s) else []
1050.01 s
[attoparsec] | ^^^^
1050.01 s
[attoparsec]
1050.01 s
[attoparsec] tests/QC/IPv6/Internal.hs:219:34: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1050.01 s
[attoparsec] This binding for ‘x’ shadows the existing binding
1050.01 s
[attoparsec] bound at tests/QC/IPv6/Internal.hs:218:42
1050.01 s
[attoparsec] |
1050.01 s
[attoparsec] 219 | ntks tks - foldl (\c x -> if (x /= DoubleColon) && (x /= Colon) then c+1 else c) 0 x
1050.01 s
[attoparsec] | ^
1050.01 s
[attoparsec]
1050.01 s
[attoparsec] tests/QC/IPv6/Internal.hs:221:18: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1050.01 s
[attoparsec] This binding for ‘tks’ shadows the existing binding
1050.01 s
[attoparsec] bound at tests/QC/IPv6/Internal.hs:207:17
1050.01 s
[attoparsec] |
1050.01 s
[attoparsec] 221 | ntks tks = if countIPv4Addr tks == 1 then 7 else 8
1050.01 s
[attoparsec] | ^^^
1050.01 s
[attoparsec]
1050.01 s
[attoparsec] tests/QC/IPv6/Internal.hs:242:25: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1050.01 s
[attoparsec] This binding for ‘t’ shadows the existing binding
1050.01 s
[attoparsec] bound at tests/QC/IPv6/Internal.hs:235:23
1050.01 s
[attoparsec] |
1050.01 s
[attoparsec] 242 | where longest t = case t of
1050.01 s
[attoparsec] | ^
1050.01 s
[attoparsec]
1050.01 s
[attoparsec] tests/QC/IPv6/Internal.hs:247:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1050.01 s
[attoparsec] In the use of ‘head’
1050.01 s
[attoparsec] (imported from Prelude, but defined in GHC.List):
1050.01 s
[attoparsec] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1050.01 s
[attoparsec] |
1050.01 s
[attoparsec] 247 | helper h = (head h == AllZeros, lh) where lh = length h
1050.01 s
[attoparsec] | ^^^^
1050.01 s
[attoparsec]
1050.01 s
[attoparsec] tests/QC/IPv6/Internal.hs:298:12: warning : [ GHC-18042 ] [ -Wtype-defaults ]
1050.01 s
[attoparsec] • Defaulting the type variable ‘a0’ to type ‘Integer’ in the following constraints
1050.01 s
[attoparsec] (Integral a0)
1050.02 s
[attoparsec] arising from a use of ‘R.decimal’
1050.02 s
[attoparsec] at tests/QC/IPv6/Internal.hs:298:12-20
1050.02 s
[attoparsec] (Ord a0)
1050.02 s
[attoparsec] arising from a use of ‘<’ at tests/QC/IPv6/Internal.hs:299:39
1050.02 s
[attoparsec] (Num a0)
1050.02 s
[attoparsec] arising from the literal ‘256’
1050.02 s
[attoparsec] at tests/QC/IPv6/Internal.hs:299:41-43
1050.02 s
[attoparsec] (Show a0)
1050.02 s
[attoparsec] arising from a use of ‘show’ at tests/QC/IPv6/Internal.hs:299:59-62
1050.02 s
[attoparsec] • In the expression: R.decimal ds
1050.02 s
[attoparsec] In a stmt of a 'do' block:
1050.02 s
[attoparsec] case R.decimal ds of
1050.02 s
[attoparsec] Right (n, _)
1050.02 s
[attoparsec] -> return (if n < 256 then T.pack $ show n else T.empty)
1050.02 s
[attoparsec] Left _ -> return T.empty
1050.02 s
[attoparsec] In the expression:
1050.02 s
[attoparsec] do ds <- takeWhile1 isDigit
1050.02 s
[attoparsec] case R.decimal ds of
1050.02 s
[attoparsec] Right (n, _)
1050.02 s
[attoparsec] -> return (if n < 256 then T.pack $ show n else T.empty)
1050.02 s
[attoparsec] Left _ -> return T.empty
1050.02 s
[attoparsec] |
1050.02 s
[attoparsec] 298 | case R.decimal ds of
1050.02 s
[attoparsec] | ^^^^^^^^^
1050.02 s
[attoparsec]
1050.02 s
[attoparsec] tests/QC/IPv6/Internal.hs:304:5: warning : [ GHC-81995 ] [ -Wunused-do-bind ]
1050.02 s
[attoparsec] A do-notation statement discarded a result of type ‘T.Text’
1050.02 s
[attoparsec] Suggested fix: Suppress this warning by saying ‘_ <- string "::"’
1050.02 s
[attoparsec] |
1050.02 s
[attoparsec] 304 | string "::"
1050.02 s
[attoparsec] | ^^^^^^^^^^^
1050.02 s
[attoparsec]
1050.02 s
[attoparsec] tests/QC/IPv6/Internal.hs:309:5: warning : [ GHC-81995 ] [ -Wunused-do-bind ]
1050.02 s
[attoparsec] A do-notation statement discarded a result of type ‘T.Text’
1050.02 s
[attoparsec] Suggested fix: Suppress this warning by saying ‘_ <- string ":"’
1050.02 s
[attoparsec] |
1050.02 s
[attoparsec] 309 | string ":"
1050.02 s
[attoparsec] | ^^^^^^^^^^
1050.02 s
[attoparsec] [ 7 of 12] Compiling QC.Rechunked ( tests/QC/Rechunked.hs, dist/build/attoparsec-tests/attoparsec-tests-tmp/QC/Rechunked.o )
1050.02 s
[attoparsec] [ 8 of 12] Compiling QC.Simple ( tests/QC/Simple.hs, dist/build/attoparsec-tests/attoparsec-tests-tmp/QC/Simple.o )
1050.02 s
[attoparsec] [ 9 of 12] Compiling QC.Text.FastSet ( tests/QC/Text/FastSet.hs, dist/build/attoparsec-tests/attoparsec-tests-tmp/QC/Text/FastSet.o )
1050.02 s
[attoparsec] [10 of 12] Compiling QC.Text.Regressions ( tests/QC/Text/Regressions.hs, dist/build/attoparsec-tests/attoparsec-tests-tmp/QC/Text/Regressions.o )
1050.02 s
[attoparsec]
1050.02 s
[attoparsec] tests/QC/Text/Regressions.hs:12:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1050.02 s
[attoparsec] The import of ‘Data.Monoid’ is redundant
1050.02 s
[attoparsec] except perhaps to import instances from ‘Data.Monoid’
1050.02 s
[attoparsec] To import instances alone, use: import Data.Monoid()
1050.02 s
[attoparsec] |
1050.02 s
[attoparsec] 12 | import Data.Monoid ((<>))
1050.02 s
[attoparsec] | ^^^^^^^^^^^^^^^^^^^^^^^^^
1050.02 s
[attoparsec] [11 of 12] Compiling QC.Text ( tests/QC/Text.hs, dist/build/attoparsec-tests/attoparsec-tests-tmp/QC/Text.o )
1050.11 s
[filepattern] [5 of 8] Compiling System.FilePattern.Core ( src/System/FilePattern/Core.hs, nothing )
1050.17 s
[monoid-subclasses] commonSuffix commutativity: OK (0.41s)
1050.18 s
[monoid-subclasses] +++ OK, passed 100 tests.
1050.22 s
[filepattern] [6 of 8] Compiling System.FilePattern.Step ( src/System/FilePattern/Step.hs, nothing )
1050.31 s
[regex-tdfa] [16 of 25] Compiling Text.Regex.TDFA.ReadRegex ( lib/Text/Regex/TDFA/ReadRegex.hs, nothing )
1050.46 s
[aeson] Source component graph:
1050.47 s
[aeson] component lib
1050.47 s
[aeson] component test:aeson-tests dependency lib
1050.47 s
[aeson] Configured component graph:
1050.47 s
[aeson] component aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1050.47 s
[aeson] include OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
1050.47 s
[aeson] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1050.47 s
[aeson] include base-4.19.0.0-b960
1050.47 s
[aeson] include bytestring-0.12.0.2-4690
1050.47 s
[aeson] include character-ps-0.1-5NZ4UJdXHV93lSpc31BgaQ
1050.47 s
[aeson] include containers-0.6.8-4775
1050.47 s
[aeson] include data-fix-0.3.4-90kAYHfhdX433d7z3npPya
1050.47 s
[aeson] include deepseq-1.5.0.0-412f
1050.47 s
[aeson] include dlist-1.0-92EE3VRf6S86YM2NLYx7Zz
1050.47 s
[aeson] include exceptions-0.10.7-d3e7
1050.47 s
[aeson] include generically-0.1.1-K3imEYsTalR7I3JkgzAJ40
1050.47 s
[aeson] include ghc-prim-0.11.0-a69e
1050.47 s
[aeson] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1050.47 s
[aeson] include indexed-traversable-0.1.4-HhvObHiiVRhC9VCRLqXs4g
1050.47 s
[aeson] include integer-conversion-0.1.1-AEc8Mc86KpxKTurcpgT6s2
1050.47 s
[aeson] include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
1050.47 s
[aeson] include network-uri-2.6.4.2-7eg1zqHSZKN83Q25OAVa26
1050.47 s
[aeson] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1050.47 s
[aeson] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1050.47 s
[aeson] include semialign-1.3.1-GjSyYQig4Ie64NgVCte6oq
1050.47 s
[aeson] include strict-0.5.1-GVSVdbGTOCS56r31yJq782
1050.47 s
[aeson] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1050.47 s
[aeson] include template-haskell-2.21.0.0-8831
1050.47 s
[aeson] include text-2.1-c36a
1050.47 s
[aeson] include text-iso8601-0.1.1-EZ1MMZNTqfxBVbpUGxXkG
1050.47 s
[aeson] include text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
1050.47 s
[aeson] include th-abstraction-0.7.1.0-D2qAyomm2vvKhfkR0SrGAm
1050.47 s
[aeson] include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
1050.47 s
[aeson] include time-1.12.2-d26d
1050.47 s
[aeson] include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
1050.47 s
[aeson] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1050.47 s
[aeson] include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
1050.47 s
[aeson] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1050.47 s
[aeson] include witherable-0.5-7zG28educK73JEyXcpqX0
1050.47 s
[aeson] component aeson-2.2.3.0-7isKCy7sDhLNpYiCaQmK3-aeson-tests
1050.47 s
[aeson] include Diff-0.5-4nPoK53PkizD5e0dTbCPv7
1050.47 s
[aeson] include OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
1050.47 s
[aeson] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1050.47 s
[aeson] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1050.47 s
[aeson] include base-4.19.0.0-b960
1050.47 s
[aeson] include base-compat-0.13.1-Eotc18fTsmWG4LIuz3QQXm
1050.47 s
[aeson] include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
1050.47 s
[aeson] include base16-bytestring-1.0.2.0-L2HTrI5sDR6GxzNP6riz2o
1050.47 s
[aeson] include bytestring-0.12.0.2-4690
1050.47 s
[aeson] include containers-0.6.8-4775
1050.47 s
[aeson] include data-fix-0.3.4-90kAYHfhdX433d7z3npPya
1050.47 s
[aeson] include deepseq-1.5.0.0-412f
1050.47 s
[aeson] include directory-1.3.8.1-6a8e
1050.47 s
[aeson] include dlist-1.0-92EE3VRf6S86YM2NLYx7Zz
1050.47 s
[aeson] include filepath-1.4.100.4-fa1c
1050.47 s
[aeson] include generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT
1050.47 s
[aeson] include generically-0.1.1-K3imEYsTalR7I3JkgzAJ40
1050.47 s
[aeson] include ghc-prim-0.11.0-a69e
1050.47 s
[aeson] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1050.47 s
[aeson] include indexed-traversable-0.1.4-HhvObHiiVRhC9VCRLqXs4g
1050.47 s
[aeson] include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
1050.47 s
[aeson] include network-uri-2.6.4.2-7eg1zqHSZKN83Q25OAVa26
1050.47 s
[aeson] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1050.47 s
[aeson] include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
1050.47 s
[aeson] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1050.47 s
[aeson] include strict-0.5.1-GVSVdbGTOCS56r31yJq782
1050.47 s
[aeson] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1050.47 s
[aeson] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1050.47 s
[aeson] include tasty-golden-2.3.5-6P6GNEakBlYHi0mjKqBrlF
1050.47 s
[aeson] include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
1050.47 s
[aeson] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
1050.47 s
[aeson] include template-haskell-2.21.0.0-8831
1050.47 s
[aeson] include text-2.1-c36a
1050.47 s
[aeson] include text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
1050.47 s
[aeson] include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
1050.47 s
[aeson] include time-1.12.2-d26d
1050.47 s
[aeson] include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
1050.47 s
[aeson] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1050.48 s
[aeson] include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
1050.48 s
[aeson] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1050.48 s
[aeson] Linked component graph:
1050.48 s
[aeson] unit aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1050.48 s
[aeson] include OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
1050.48 s
[aeson] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1050.48 s
[aeson] include base-4.19.0.0-b960
1050.48 s
[aeson] include bytestring-0.12.0.2-4690
1050.48 s
[aeson] include character-ps-0.1-5NZ4UJdXHV93lSpc31BgaQ
1050.48 s
[aeson] include containers-0.6.8-4775
1050.48 s
[aeson] include data-fix-0.3.4-90kAYHfhdX433d7z3npPya
1050.48 s
[aeson] include deepseq-1.5.0.0-412f
1050.48 s
[aeson] include dlist-1.0-92EE3VRf6S86YM2NLYx7Zz
1050.48 s
[aeson] include exceptions-0.10.7-d3e7
1050.48 s
[aeson] include generically-0.1.1-K3imEYsTalR7I3JkgzAJ40
1050.48 s
[aeson] include ghc-prim-0.11.0-a69e
1050.48 s
[aeson] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1050.48 s
[aeson] include indexed-traversable-0.1.4-HhvObHiiVRhC9VCRLqXs4g
1050.48 s
[aeson] include integer-conversion-0.1.1-AEc8Mc86KpxKTurcpgT6s2
1050.48 s
[aeson] include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
1050.48 s
[aeson] include network-uri-2.6.4.2-7eg1zqHSZKN83Q25OAVa26
1050.48 s
[aeson] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1050.48 s
[aeson] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1050.48 s
[aeson] include semialign-1.3.1-GjSyYQig4Ie64NgVCte6oq
1050.48 s
[aeson] include strict-0.5.1-GVSVdbGTOCS56r31yJq782
1050.48 s
[aeson] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1050.48 s
[aeson] include template-haskell-2.21.0.0-8831
1050.48 s
[aeson] include text-2.1-c36a
1050.48 s
[aeson] include text-iso8601-0.1.1-EZ1MMZNTqfxBVbpUGxXkG
1050.48 s
[aeson] include text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
1050.48 s
[aeson] include th-abstraction-0.7.1.0-D2qAyomm2vvKhfkR0SrGAm
1050.48 s
[aeson] include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
1050.48 s
[aeson] include time-1.12.2-d26d
1050.48 s
[aeson] include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
1050.48 s
[aeson] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1050.48 s
[aeson] include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
1050.48 s
[aeson] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1050.48 s
[aeson] include witherable-0.5-7zG28educK73JEyXcpqX0
1050.48 s
[aeson] Data.Aeson=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson,Data.Aeson.Decoding=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson.Decoding,Data.Aeson.Decoding.ByteString=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson.Decoding.ByteString,Data.Aeson.Decoding.ByteString.Lazy=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson.Decoding.ByteString.Lazy,Data.Aeson.Decoding.Text=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson.Decoding.Text,Data.Aeson.Decoding.Tokens=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson.Decoding.Tokens,Data.Aeson.Encoding=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson.Encoding,Data.Aeson.Encoding.Internal=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson.Encoding.Internal,Data.Aeson.Key=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson.Key,Data.Aeson.KeyMap=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson.KeyMap,Data.Aeson.QQ.Simple=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson.QQ.Simple,Data.Aeson.RFC8785=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson.RFC8785,Data.Aeson.TH=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson.TH,Data.Aeson.Text=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson.Text,Data.Aeson.Types=aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15:Data.Aeson.Types
1050.48 s
[aeson] unit aeson-2.2.3.0-7isKCy7sDhLNpYiCaQmK3-aeson-tests
1050.48 s
[aeson] include Diff-0.5-4nPoK53PkizD5e0dTbCPv7
1050.48 s
[aeson] include OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
1050.48 s
[aeson] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1050.48 s
[aeson] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1050.48 s
[aeson] include base-4.19.0.0-b960
1050.48 s
[aeson] include base-compat-0.13.1-Eotc18fTsmWG4LIuz3QQXm
1050.48 s
[aeson] include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
1050.48 s
[aeson] include base16-bytestring-1.0.2.0-L2HTrI5sDR6GxzNP6riz2o
1050.48 s
[aeson] include bytestring-0.12.0.2-4690
1050.48 s
[aeson] include containers-0.6.8-4775
1050.48 s
[aeson] include data-fix-0.3.4-90kAYHfhdX433d7z3npPya
1050.48 s
[aeson] include deepseq-1.5.0.0-412f
1050.48 s
[aeson] include directory-1.3.8.1-6a8e
1050.48 s
[aeson] include dlist-1.0-92EE3VRf6S86YM2NLYx7Zz
1050.48 s
[aeson] include filepath-1.4.100.4-fa1c
1050.48 s
[aeson] include generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT
1050.48 s
[aeson] include generically-0.1.1-K3imEYsTalR7I3JkgzAJ40
1050.48 s
[aeson] include ghc-prim-0.11.0-a69e
1050.48 s
[aeson] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1050.48 s
[aeson] include indexed-traversable-0.1.4-HhvObHiiVRhC9VCRLqXs4g
1050.52 s
[regex-tdfa] [17 of 25] Compiling Text.Regex.TDFA.TNFA ( lib/Text/Regex/TDFA/TNFA.hs, nothing )
1050.55 s
[aeson] include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
1050.55 s
[aeson] include network-uri-2.6.4.2-7eg1zqHSZKN83Q25OAVa26
1050.55 s
[aeson] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1050.55 s
[aeson] include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
1050.55 s
[aeson] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1050.55 s
[aeson] include strict-0.5.1-GVSVdbGTOCS56r31yJq782
1050.55 s
[aeson] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1050.55 s
[aeson] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1050.55 s
[aeson] include tasty-golden-2.3.5-6P6GNEakBlYHi0mjKqBrlF
1050.55 s
[aeson] include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
1050.55 s
[aeson] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
1050.55 s
[aeson] include template-haskell-2.21.0.0-8831
1050.55 s
[aeson] include text-2.1-c36a
1050.55 s
[aeson] include text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
1050.55 s
[aeson] include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
1050.55 s
[aeson] include time-1.12.2-d26d
1050.55 s
[aeson] include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
1050.55 s
[aeson] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1050.55 s
[aeson] include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
1050.55 s
[aeson] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1050.55 s
[aeson] Ready component graph:
1050.55 s
[aeson] definite aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1050.55 s
[aeson] depends OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
1050.55 s
[aeson] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1050.55 s
[aeson] depends base-4.19.0.0-b960
1050.55 s
[aeson] depends bytestring-0.12.0.2-4690
1050.55 s
[aeson] depends character-ps-0.1-5NZ4UJdXHV93lSpc31BgaQ
1050.55 s
[aeson] depends containers-0.6.8-4775
1050.55 s
[aeson] depends data-fix-0.3.4-90kAYHfhdX433d7z3npPya
1050.55 s
[aeson] depends deepseq-1.5.0.0-412f
1050.55 s
[aeson] depends dlist-1.0-92EE3VRf6S86YM2NLYx7Zz
1050.55 s
[aeson] depends exceptions-0.10.7-d3e7
1050.55 s
[aeson] depends generically-0.1.1-K3imEYsTalR7I3JkgzAJ40
1050.55 s
[aeson] depends ghc-prim-0.11.0-a69e
1050.55 s
[aeson] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1050.55 s
[aeson] depends indexed-traversable-0.1.4-HhvObHiiVRhC9VCRLqXs4g
1050.55 s
[aeson] depends integer-conversion-0.1.1-AEc8Mc86KpxKTurcpgT6s2
1050.55 s
[aeson] depends integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
1050.55 s
[aeson] depends network-uri-2.6.4.2-7eg1zqHSZKN83Q25OAVa26
1050.55 s
[aeson] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1050.55 s
[aeson] depends scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1050.55 s
[aeson] depends semialign-1.3.1-GjSyYQig4Ie64NgVCte6oq
1050.55 s
[aeson] depends strict-0.5.1-GVSVdbGTOCS56r31yJq782
1050.55 s
[aeson] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1050.55 s
[aeson] depends template-haskell-2.21.0.0-8831
1050.55 s
[aeson] depends text-2.1-c36a
1050.55 s
[aeson] depends text-iso8601-0.1.1-EZ1MMZNTqfxBVbpUGxXkG
1050.55 s
[aeson] depends text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
1050.55 s
[aeson] depends th-abstraction-0.7.1.0-D2qAyomm2vvKhfkR0SrGAm
1050.55 s
[aeson] depends these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
1050.55 s
[aeson] depends time-1.12.2-d26d
1050.55 s
[aeson] depends time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
1050.55 s
[aeson] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1050.55 s
[aeson] depends uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
1050.55 s
[aeson] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
1050.55 s
[aeson] depends witherable-0.5-7zG28educK73JEyXcpqX0
1050.55 s
[aeson] definite aeson-2.2.3.0-7isKCy7sDhLNpYiCaQmK3-aeson-tests
1050.55 s
[aeson] depends Diff-0.5-4nPoK53PkizD5e0dTbCPv7
1050.55 s
[aeson] depends OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
1050.55 s
[aeson] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1050.55 s
[aeson] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1050.55 s
[aeson] depends base-4.19.0.0-b960
1050.55 s
[aeson] depends base-compat-0.13.1-Eotc18fTsmWG4LIuz3QQXm
1050.55 s
[aeson] depends base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
1050.55 s
[aeson] depends base16-bytestring-1.0.2.0-L2HTrI5sDR6GxzNP6riz2o
1050.55 s
[aeson] depends bytestring-0.12.0.2-4690
1050.55 s
[aeson] depends containers-0.6.8-4775
1050.55 s
[aeson] depends data-fix-0.3.4-90kAYHfhdX433d7z3npPya
1050.55 s
[aeson] depends deepseq-1.5.0.0-412f
1050.55 s
[aeson] depends directory-1.3.8.1-6a8e
1050.55 s
[aeson] depends dlist-1.0-92EE3VRf6S86YM2NLYx7Zz
1050.55 s
[aeson] depends filepath-1.4.100.4-fa1c
1050.55 s
[aeson] depends generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT
1050.55 s
[aeson] depends generically-0.1.1-K3imEYsTalR7I3JkgzAJ40
1050.55 s
[aeson] depends ghc-prim-0.11.0-a69e
1050.55 s
[aeson] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1050.55 s
[aeson] depends indexed-traversable-0.1.4-HhvObHiiVRhC9VCRLqXs4g
1050.55 s
[aeson] depends integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
1050.55 s
[aeson] depends network-uri-2.6.4.2-7eg1zqHSZKN83Q25OAVa26
1050.55 s
[aeson] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1050.55 s
[aeson] depends quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
1050.55 s
[aeson] depends scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1050.55 s
[aeson] depends strict-0.5.1-GVSVdbGTOCS56r31yJq782
1050.55 s
[aeson] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1050.55 s
[aeson] depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1050.55 s
[aeson] depends tasty-golden-2.3.5-6P6GNEakBlYHi0mjKqBrlF
1050.55 s
[aeson] depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
1050.55 s
[aeson] depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
1050.55 s
[aeson] depends template-haskell-2.21.0.0-8831
1050.55 s
[aeson] depends text-2.1-c36a
1050.55 s
[aeson] depends text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
1050.55 s
[aeson] depends these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
1050.55 s
[aeson] depends time-1.12.2-d26d
1050.55 s
[aeson] depends time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
1050.55 s
[aeson] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1050.55 s
[aeson] depends uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
1050.55 s
[aeson] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
1050.55 s
[aeson] Using Cabal-3.10.2.0 compiled by ghc-9.8
1050.55 s
[aeson] Using compiler: ghc-9.8.1
1050.55 s
[aeson] Using install prefix:
1050.55 s
[aeson] /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0
1050.55 s
[aeson] Executables installed in:
1050.55 s
[aeson] /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0/bin
1050.55 s
[aeson] Libraries installed in:
1050.55 s
[aeson] /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1050.55 s
[aeson] Dynamic Libraries installed in:
1050.55 s
[aeson] /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1050.55 s
[aeson] Private executables installed in:
1050.55 s
[aeson] /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0/libexec/x86_64-linux-ghc-9.8.1/aeson-2.2.3.0
1050.55 s
[aeson] Data files installed in:
1050.55 s
[aeson] /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0/share/x86_64-linux-ghc-9.8.1/aeson-2.2.3.0
1050.55 s
[aeson] Documentation installed in:
1050.55 s
[aeson] /nix/store/ljr3rnwd8s1fggbaiwd22941awg4hks7-aeson-2.2.3.0-doc/share/doc/aeson-2.2.3.0
1050.55 s
[aeson] Configuration files installed in:
1050.55 s
[aeson] /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0/etc
1050.55 s
[aeson] No alex found
1050.55 s
[aeson] Using ar found on system at:
1050.55 s
[aeson] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1050.55 s
[aeson] No c2hs found
1050.55 s
[aeson] No cpphs found
1050.55 s
[aeson] No doctest found
1050.55 s
[aeson] Using gcc version 14.3.0 given by user at:
1050.55 s
[aeson] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1050.55 s
[aeson] Using ghc version 9.8.1 found on system at:
1050.56 s
[aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1050.56 s
[aeson] Using ghc-pkg version 9.8.1 found on system at:
1050.56 s
[aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1050.56 s
[aeson] No ghcjs found
1050.56 s
[aeson] No ghcjs-pkg found
1050.56 s
[aeson] No greencard found
1050.56 s
[aeson] Using haddock version 2.30.0 found on system at:
1050.56 s
[aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1050.56 s
[aeson] No happy found
1050.56 s
[aeson] Using haskell-suite found on system at: haskell-suite-dummy-location
1050.56 s
[aeson] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1050.56 s
[aeson] No hmake found
1050.56 s
[aeson] Using hpc version 0.69 found on system at:
1050.56 s
[aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1050.56 s
[aeson] Using hsc2hs version 0.68.10 found on system at:
1050.56 s
[aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1050.56 s
[aeson] Using hscolour version 1.25 found on system at:
1050.56 s
[aeson] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1050.56 s
[aeson] No jhc found
1050.56 s
[aeson] Using ld found on system at:
1050.56 s
[aeson] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1050.56 s
[aeson] No pkg-config found
1050.56 s
[aeson] Using runghc version 9.8.1 found on system at:
1050.56 s
[aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1050.56 s
[aeson] Using strip version 2.44 found on system at:
1050.56 s
[aeson] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1050.56 s
[aeson] Using tar found on system at:
1050.56 s
[aeson] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1050.56 s
[aeson] No uhc found
1050.56 s
[adjunctions] [ 1 of 11] Compiling Control.Monad.Trans.Conts ( src/Control/Monad/Trans/Conts.hs, nothing )
1050.66 s
[filepattern] [7 of 8] Compiling System.FilePattern.Directory ( src/System/FilePattern/Directory.hs, nothing )
1050.72 s
[filepattern] [8 of 8] Compiling System.FilePattern ( src/System/FilePattern.hs, nothing )
1050.79 s
[filepattern] Haddock coverage:
1050.80 s
[filepattern] Warning: '<.>' is out of scope.
1050.80 s
[filepattern] If you qualify the identifier, haddock can try to link it anyway.
1050.80 s
[filepattern] Warning: '</>' is out of scope.
1050.80 s
[filepattern] If you qualify the identifier, haddock can try to link it anyway.
1050.80 s
[filepattern] Warning: 'Step' is ambiguous. It is defined
1050.80 s
[filepattern] * at src/System/FilePattern/Step.hs:60:15
1050.80 s
[filepattern] * at src/System/FilePattern/Step.hs:60:1
1050.80 s
[filepattern] You may be able to disambiguate the identifier by qualifying it or
1050.80 s
[filepattern] by specifying the type/value namespace explicitly.
1050.80 s
[filepattern] Defaulting to the one defined at src/System/FilePattern/Step.hs:60:1
1050.82 s
[filepattern] 100% ( 5 / 5) in 'System.FilePattern.Directory'
1050.83 s
[filepattern] Warning: 'match' is ambiguous. It is defined
1050.83 s
[filepattern] * at src/System/FilePattern.hs:75:1
1050.83 s
[filepattern] * at src/System/FilePattern/Core.hs:111:1
1050.83 s
[filepattern] You may be able to disambiguate the identifier by qualifying it or
1050.83 s
[filepattern] by specifying the type/value namespace explicitly.
1050.83 s
[filepattern] Defaulting to the one defined at src/System/FilePattern/Core.hs:111:1
1050.83 s
[filepattern] Warning: 'substitute' is ambiguous. It is defined
1050.83 s
[filepattern] * at src/System/FilePattern.hs:99:1
1050.83 s
[filepattern] * at src/System/FilePattern/Core.hs:120:1
1050.83 s
[filepattern] You may be able to disambiguate the identifier by qualifying it or
1050.83 s
[filepattern] by specifying the type/value namespace explicitly.
1050.83 s
[filepattern] Defaulting to the one defined at src/System/FilePattern/Core.hs:120:1
1050.83 s
[filepattern] Warning: 'arity' is ambiguous. It is defined
1050.83 s
[filepattern] * at src/System/FilePattern.hs:88:1
1050.83 s
[filepattern] * at src/System/FilePattern/Core.hs:128:1
1050.83 s
[filepattern] You may be able to disambiguate the identifier by qualifying it or
1050.83 s
[filepattern] by specifying the type/value namespace explicitly.
1050.84 s
[filepattern] Defaulting to the one defined at src/System/FilePattern/Core.hs:128:1
1050.84 s
[filepattern] 100% ( 12 / 12) in 'System.FilePattern'
1050.93 s
[algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.o, dist/build/Algebra/Graph/Export.dyn_o )
1050.93 s
[algebraic-graphs]
1050.93 s
[algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1050.93 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1050.93 s
[algebraic-graphs] will become an error in a future GHC release.
1050.93 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1050.93 s
[algebraic-graphs] |
1050.93 s
[algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
1050.93 s
[algebraic-graphs] | ^
1050.93 s
[algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.o, dist/build/Algebra/Graph/Export/Dot.dyn_o )
1050.93 s
[algebraic-graphs]
1050.93 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1050.93 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1050.93 s
[algebraic-graphs] will become an error in a future GHC release.
1050.93 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1050.93 s
[algebraic-graphs] |
1050.93 s
[algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
1050.93 s
[algebraic-graphs] | ^
1050.93 s
[algebraic-graphs]
1050.93 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1050.93 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1050.93 s
[algebraic-graphs] will become an error in a future GHC release.
1050.93 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1050.93 s
[algebraic-graphs] |
1050.93 s
[algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
1050.93 s
[algebraic-graphs] | ^
1050.93 s
[algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.o, dist/build/Algebra/Graph/Undirected.dyn_o )
1050.93 s
[algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.o, dist/build/Algebra/Graph/Class.dyn_o )
1050.93 s
[algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.o, dist/build/Algebra/Graph/Relation/Transitive.dyn_o )
1050.93 s
[algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.o, dist/build/Algebra/Graph/Relation/Reflexive.dyn_o )
1050.93 s
[algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.o, dist/build/Algebra/Graph/Relation/Preorder.dyn_o )
1050.93 s
[algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.o, dist/build/Algebra/Graph/Example/Todo.dyn_o )
1050.93 s
[algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.o, dist/build/Data/Graph/Typed.dyn_o )
1050.94 s
[adjunctions] [ 2 of 11] Compiling Data.Functor.Contravariant.Rep ( src/Data/Functor/Contravariant/Rep.hs, nothing )
1050.96 s
[aeson] Phase: buildPhase
1050.98 s
[monoid-subclasses] commonSuffix associativity: OK (0.81s)
1050.98 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.02 s
[monoid-subclasses] commonSuffix distributivity: OK (0.04s)
1051.02 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.03 s
[monoid-subclasses] lcm reductivity (left): OK (0.02s)
1051.03 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.06 s
[monoid-subclasses] lcm reductivity (right): OK (0.02s)
1051.06 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.09 s
[monoid-subclasses] lcm uniqueness: OK (0.02s)
1051.09 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.09 s
[monoid-subclasses] lcm idempotence: OK
1051.09 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.09 s
[monoid-subclasses] lcm identity (left): OK
1051.09 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.12 s
[adjunctions] [ 3 of 11] Compiling Data.Functor.Contravariant.Adjunction ( src/Data/Functor/Contravariant/Adjunction.hs, nothing )
1051.12 s
[monoid-subclasses] lcm identity (right): OK
1051.12 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.14 s
[monoid-subclasses] lcm commutativity: OK (0.02s)
1051.14 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.18 s
[monoid-subclasses] lcm associativity: OK (0.05s)
1051.18 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.20 s
[monoid-subclasses] lcm absorption (gcd-lcm): OK (0.02s)
1051.20 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.21 s
[adjunctions] [ 4 of 11] Compiling Control.Monad.Trans.Contravariant.Adjoint ( src/Control/Monad/Trans/Contravariant/Adjoint.hs, nothing )
1051.24 s
[monoid-subclasses] lcm absorption (lcm-gcd): OK (0.03s)
1051.24 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.24 s
[aeson] Preprocessing library for aeson-2.2.3.0..
1051.25 s
[monoid-subclasses] lcm distributivity (left): OK (0.03s)
1051.26 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.26 s
[aeson] Building library for aeson-2.2.3.0..
1051.28 s
[monoid-subclasses] lcm distributivity (right): OK (0.02s)
1051.28 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.32 s
[monoid-subclasses] lcm distributivity (gcd-lcm): OK (0.03s)
1051.32 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.33 s
[monoid-subclasses] lcm distributivity (lcm-gcd): OK (0.02s)
1051.33 s
[monoid-subclasses] +++ OK, passed 100 tests.
1051.33 s
[monoid-subclasses]
1051.33 s
[monoid-subclasses] All 128 tests passed (51.43s)
1051.33 s
[adjunctions] [ 5 of 11] Compiling Data.Functor.Rep ( src/Data/Functor/Rep.hs, nothing )
1051.33 s
[monoid-subclasses] Test suite Main: PASS
1051.33 s
[monoid-subclasses] Test suite logged to: dist/test/monoid-subclasses-1.2.6-Main.log
1051.33 s
[monoid-subclasses] 1 of 1 test suites (1 of 1 test cases) passed.
1051.41 s
[monoid-subclasses] checkPhase completed in 52 seconds
1051.41 s
[monoid-subclasses] Phase: haddockPhase
1051.59 s
[regex-tdfa] [18 of 25] Compiling Text.Regex.TDFA.TDFA ( lib/Text/Regex/TDFA/TDFA.hs, nothing )
1051.68 s
[algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
1051.99 s
[monoid-subclasses] Preprocessing library for monoid-subclasses-1.2.6..
1052.00 s
[monoid-subclasses] Running Haddock on library for monoid-subclasses-1.2.6..
1052.03 s
[monoid-subclasses] Warning: The documentation for the following packages are not installed. No
1052.03 s
[monoid-subclasses] links will be generated to these packages: vector-0.13.2.0
1052.04 s
[regex-tdfa] [19 of 25] Compiling Text.Regex.TDFA.String ( lib/Text/Regex/TDFA/String.hs, nothing )
1052.11 s
[filepattern] Warning: System.FilePattern: could not find link destinations for:
1052.11 s
[filepattern] - System.FilePattern.Core.match
1052.11 s
[filepattern] - System.FilePattern.Core.substitute
1052.11 s
[filepattern] - System.FilePattern.Core.arity
1052.13 s
[regex-tdfa] [20 of 25] Compiling Text.Regex.TDFA.Sequence ( lib/Text/Regex/TDFA/Sequence.hs, nothing )
1052.19 s
[monoid-subclasses] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1052.22 s
[regex-tdfa] [21 of 25] Compiling Text.Regex.TDFA.ByteString.Lazy ( lib/Text/Regex/TDFA/ByteString/Lazy.hs, nothing )
1052.36 s
[regex-tdfa] [22 of 25] Compiling Text.Regex.TDFA.ByteString ( lib/Text/Regex/TDFA/ByteString.hs, nothing )
1052.46 s
[regex-tdfa] [23 of 25] Compiling Text.Regex.TDFA.Text ( lib/Text/Regex/TDFA/Text.hs, nothing )
1052.53 s
[regex-tdfa] [24 of 25] Compiling Text.Regex.TDFA.Text.Lazy ( lib/Text/Regex/TDFA/Text/Lazy.hs, nothing )
1052.57 s
[adjunctions] [ 6 of 11] Compiling Data.Functor.Adjunction ( src/Data/Functor/Adjunction.hs, nothing )
1052.67 s
[regex-tdfa] [25 of 25] Compiling Text.Regex.TDFA ( lib/Text/Regex/TDFA.hs, nothing )
1052.71 s
[regex-tdfa] Haddock coverage:
1052.72 s
[regex-tdfa] 0% ( 0 / 69) in 'Data.IntMap.CharMap2'
1052.72 s
[regex-tdfa] Missing documentation for:
1052.72 s
[regex-tdfa] Module header
1052.72 s
[regex-tdfa] CharMap (lib/Data/IntMap/CharMap2.hs:24)
1052.72 s
[regex-tdfa] Key (lib/Data/IntMap/CharMap2.hs:36)
1052.72 s
[regex-tdfa] ! (lib/Data/IntMap/CharMap2.hs:39)
1052.72 s
[regex-tdfa] \\ (lib/Data/IntMap/CharMap2.hs:42)
1052.72 s
[regex-tdfa] null (lib/Data/IntMap/CharMap2.hs:45)
1052.72 s
[regex-tdfa] size (lib/Data/IntMap/CharMap2.hs:48)
1052.72 s
[regex-tdfa] member (lib/Data/IntMap/CharMap2.hs:51)
1052.72 s
[regex-tdfa] notMember (lib/Data/IntMap/CharMap2.hs:54)
1052.72 s
[regex-tdfa] lookup (lib/Data/IntMap/CharMap2.hs:57)
1052.72 s
[regex-tdfa] findWithDefault (lib/Data/IntMap/CharMap2.hs:60)
1052.72 s
[regex-tdfa] empty (lib/Data/IntMap/CharMap2.hs:63)
1052.72 s
[regex-tdfa] singleton (lib/Data/IntMap/CharMap2.hs:66)
1052.72 s
[regex-tdfa] insert (lib/Data/IntMap/CharMap2.hs:69)
1052.72 s
[regex-tdfa] insertWith (lib/Data/IntMap/CharMap2.hs:72)
1052.72 s
[regex-tdfa] insertWithKey (lib/Data/IntMap/CharMap2.hs:75)
1052.72 s
[regex-tdfa] insertLookupWithKey (lib/Data/IntMap/CharMap2.hs:79)
1052.72 s
[regex-tdfa] delete (lib/Data/IntMap/CharMap2.hs:84)
1052.72 s
[regex-tdfa] adjust (lib/Data/IntMap/CharMap2.hs:87)
1052.72 s
[regex-tdfa] adjustWithKey (lib/Data/IntMap/CharMap2.hs:90)
1052.72 s
[regex-tdfa] update (lib/Data/IntMap/CharMap2.hs:94)
1052.72 s
[regex-tdfa] updateWithKey (lib/Data/IntMap/CharMap2.hs:97)
1052.72 s
[regex-tdfa] updateLookupWithKey (lib/Data/IntMap/CharMap2.hs:101)
1052.72 s
[regex-tdfa] union (lib/Data/IntMap/CharMap2.hs:106)
1052.72 s
[regex-tdfa] unionWith (lib/Data/IntMap/CharMap2.hs:109)
1052.72 s
[regex-tdfa] unionWithKey (lib/Data/IntMap/CharMap2.hs:112)
1052.72 s
[regex-tdfa] unions (lib/Data/IntMap/CharMap2.hs:116)
1052.72 s
[regex-tdfa] unionsWith (lib/Data/IntMap/CharMap2.hs:119)
1052.72 s
[regex-tdfa] difference (lib/Data/IntMap/CharMap2.hs:122)
1052.72 s
[regex-tdfa] differenceWith (lib/Data/IntMap/CharMap2.hs:125)
1052.73 s
[regex-tdfa] differenceWithKey (lib/Data/IntMap/CharMap2.hs:128)
1052.73 s
[regex-tdfa] intersection (lib/Data/IntMap/CharMap2.hs:132)
1052.73 s
[regex-tdfa] intersectionWith (lib/Data/IntMap/CharMap2.hs:135)
1052.73 s
[regex-tdfa] intersectionWithKey (lib/Data/IntMap/CharMap2.hs:138)
1052.73 s
[regex-tdfa] map (lib/Data/IntMap/CharMap2.hs:142)
1052.73 s
[regex-tdfa] mapWithKey (lib/Data/IntMap/CharMap2.hs:145)
1052.73 s
[regex-tdfa] mapAccum (lib/Data/IntMap/CharMap2.hs:149)
1052.73 s
[regex-tdfa] mapAccumWithKey (lib/Data/IntMap/CharMap2.hs:153)
1052.73 s
[regex-tdfa] fold (lib/Data/IntMap/CharMap2.hs:158)
1052.73 s
[regex-tdfa] foldWithKey (lib/Data/IntMap/CharMap2.hs:161)
1052.73 s
[regex-tdfa] elems (lib/Data/IntMap/CharMap2.hs:165)
1052.73 s
[regex-tdfa] keys (lib/Data/IntMap/CharMap2.hs:168)
1052.73 s
[regex-tdfa] keysSet (lib/Data/IntMap/CharMap2.hs:171)
1052.73 s
[regex-tdfa] assocs (lib/Data/IntMap/CharMap2.hs:174)
1052.73 s
[regex-tdfa] toList (lib/Data/IntMap/CharMap2.hs:177)
1052.73 s
[regex-tdfa] fromList (lib/Data/IntMap/CharMap2.hs:180)
1052.73 s
[regex-tdfa] fromListWith (lib/Data/IntMap/CharMap2.hs:183)
1052.73 s
[regex-tdfa] fromListWithKey (lib/Data/IntMap/CharMap2.hs:186)
1052.73 s
[regex-tdfa] toAscList (lib/Data/IntMap/CharMap2.hs:190)
1052.73 s
[regex-tdfa] fromAscList (lib/Data/IntMap/CharMap2.hs:193)
1052.73 s
[regex-tdfa] fromAscListWith (lib/Data/IntMap/CharMap2.hs:196)
1052.73 s
[regex-tdfa] fromAscListWithKey (lib/Data/IntMap/CharMap2.hs:199)
1052.73 s
[regex-tdfa] fromDistinctAscList (lib/Data/IntMap/CharMap2.hs:203)
1052.73 s
[regex-tdfa] filter (lib/Data/IntMap/CharMap2.hs:206)
1052.73 s
[regex-tdfa] filterWithKey (lib/Data/IntMap/CharMap2.hs:209)
1052.73 s
[regex-tdfa] partition (lib/Data/IntMap/CharMap2.hs:213)
1052.73 s
[regex-tdfa] partitionWithKey (lib/Data/IntMap/CharMap2.hs:217)
1052.73 s
[regex-tdfa] mapMaybe (lib/Data/IntMap/CharMap2.hs:222)
1052.73 s
[regex-tdfa] mapMaybeWithKey (lib/Data/IntMap/CharMap2.hs:225)
1052.73 s
[regex-tdfa] mapEither (lib/Data/IntMap/CharMap2.hs:229)
1052.73 s
[regex-tdfa] mapEitherWithKey (lib/Data/IntMap/CharMap2.hs:233)
1052.73 s
[regex-tdfa] split (lib/Data/IntMap/CharMap2.hs:238)
1052.73 s
[regex-tdfa] splitLookup (lib/Data/IntMap/CharMap2.hs:242)
1052.73 s
[regex-tdfa] isSubmapOf (lib/Data/IntMap/CharMap2.hs:246)
1052.73 s
[regex-tdfa] isSubmapOfBy (lib/Data/IntMap/CharMap2.hs:249)
1052.73 s
[regex-tdfa] isProperSubmapOf (lib/Data/IntMap/CharMap2.hs:252)
1052.73 s
[regex-tdfa] isProperSubmapOfBy (lib/Data/IntMap/CharMap2.hs:255)
1052.73 s
[regex-tdfa] showTree (lib/Data/IntMap/CharMap2.hs:258)
1052.73 s
[regex-tdfa] showTreeWith (lib/Data/IntMap/CharMap2.hs:261)
1052.73 s
[regex-tdfa] 0% ( 0 / 31) in 'Data.IntSet.EnumSet2'
1052.73 s
[regex-tdfa] Missing documentation for:
1052.73 s
[regex-tdfa] Module header
1052.73 s
[regex-tdfa] EnumSet (lib/Data/IntSet/EnumSet2.hs:7)
1052.73 s
[regex-tdfa] \\ (lib/Data/IntSet/EnumSet2.hs:18)
1052.73 s
[regex-tdfa] null (lib/Data/IntSet/EnumSet2.hs:21)
1052.73 s
[regex-tdfa] size (lib/Data/IntSet/EnumSet2.hs:24)
1052.73 s
[regex-tdfa] member (lib/Data/IntSet/EnumSet2.hs:27)
1052.73 s
[regex-tdfa] notMember (lib/Data/IntSet/EnumSet2.hs:30)
1052.73 s
[regex-tdfa] isSubsetOf (lib/Data/IntSet/EnumSet2.hs:33)
1052.73 s
[regex-tdfa] isProperSubsetOf (lib/Data/IntSet/EnumSet2.hs:36)
1052.73 s
[regex-tdfa] empty (lib/Data/IntSet/EnumSet2.hs:39)
1052.73 s
[regex-tdfa] singleton (lib/Data/IntSet/EnumSet2.hs:42)
1052.73 s
[regex-tdfa] insert (lib/Data/IntSet/EnumSet2.hs:45)
1052.73 s
[regex-tdfa] delete (lib/Data/IntSet/EnumSet2.hs:48)
1052.73 s
[regex-tdfa] union (lib/Data/IntSet/EnumSet2.hs:51)
1052.73 s
[regex-tdfa] unions (lib/Data/IntSet/EnumSet2.hs:54)
1052.73 s
[regex-tdfa] difference (lib/Data/IntSet/EnumSet2.hs:57)
1052.73 s
[regex-tdfa] intersection (lib/Data/IntSet/EnumSet2.hs:60)
1052.73 s
[regex-tdfa] filter (lib/Data/IntSet/EnumSet2.hs:63)
1052.73 s
[regex-tdfa] partition (lib/Data/IntSet/EnumSet2.hs:67)
1052.73 s
[regex-tdfa] split (lib/Data/IntSet/EnumSet2.hs:72)
1052.73 s
[regex-tdfa] splitMember (lib/Data/IntSet/EnumSet2.hs:76)
1052.73 s
[regex-tdfa] map (lib/Data/IntSet/EnumSet2.hs:80)
1052.73 s
[regex-tdfa] fold (lib/Data/IntSet/EnumSet2.hs:84)
1052.73 s
[regex-tdfa] elems (lib/Data/IntSet/EnumSet2.hs:88)
1052.73 s
[regex-tdfa] toList (lib/Data/IntSet/EnumSet2.hs:91)
1052.73 s
[regex-tdfa] fromList (lib/Data/IntSet/EnumSet2.hs:94)
1052.73 s
[regex-tdfa] toAscList (lib/Data/IntSet/EnumSet2.hs:97)
1052.73 s
[regex-tdfa] fromAscList (lib/Data/IntSet/EnumSet2.hs:100)
1052.73 s
[regex-tdfa] fromDistinctAscList (lib/Data/IntSet/EnumSet2.hs:103)
1052.73 s
[regex-tdfa] showTree (lib/Data/IntSet/EnumSet2.hs:106)
1052.73 s
[regex-tdfa] showTreeWith (lib/Data/IntSet/EnumSet2.hs:109)
1052.74 s
[regex-tdfa] 0% ( 0 / 68) in 'Data.IntMap.EnumMap2'
1052.74 s
[regex-tdfa] Missing documentation for:
1052.74 s
[regex-tdfa] Module header
1052.74 s
[regex-tdfa] EnumMap (lib/Data/IntMap/EnumMap2.hs:17)
1052.74 s
[regex-tdfa] ! (lib/Data/IntMap/EnumMap2.hs:34)
1052.74 s
[regex-tdfa] \\ (lib/Data/IntMap/EnumMap2.hs:37)
1052.74 s
[regex-tdfa] null (lib/Data/IntMap/EnumMap2.hs:40)
1052.74 s
[regex-tdfa] size (lib/Data/IntMap/EnumMap2.hs:43)
1052.74 s
[regex-tdfa] member (lib/Data/IntMap/EnumMap2.hs:46)
1052.74 s
[regex-tdfa] notMember (lib/Data/IntMap/EnumMap2.hs:49)
1052.74 s
[regex-tdfa] lookup (lib/Data/IntMap/EnumMap2.hs:53)
1052.74 s
[regex-tdfa] findWithDefault (lib/Data/IntMap/EnumMap2.hs:56)
1052.74 s
[regex-tdfa] empty (lib/Data/IntMap/EnumMap2.hs:59)
1052.74 s
[regex-tdfa] singleton (lib/Data/IntMap/EnumMap2.hs:62)
1052.74 s
[regex-tdfa] insert (lib/Data/IntMap/EnumMap2.hs:65)
1052.74 s
[regex-tdfa] insertWith (lib/Data/IntMap/EnumMap2.hs:68)
1052.74 s
[regex-tdfa] insertWithKey (lib/Data/IntMap/EnumMap2.hs:71)
1052.74 s
[regex-tdfa] insertLookupWithKey (lib/Data/IntMap/EnumMap2.hs:75)
1052.74 s
[regex-tdfa] delete (lib/Data/IntMap/EnumMap2.hs:80)
1052.74 s
[regex-tdfa] adjust (lib/Data/IntMap/EnumMap2.hs:83)
1052.74 s
[regex-tdfa] adjustWithKey (lib/Data/IntMap/EnumMap2.hs:86)
1052.74 s
[regex-tdfa] update (lib/Data/IntMap/EnumMap2.hs:90)
1052.74 s
[regex-tdfa] updateWithKey (lib/Data/IntMap/EnumMap2.hs:93)
1052.74 s
[regex-tdfa] updateLookupWithKey (lib/Data/IntMap/EnumMap2.hs:97)
1052.74 s
[regex-tdfa] union (lib/Data/IntMap/EnumMap2.hs:102)
1052.74 s
[regex-tdfa] unionWith (lib/Data/IntMap/EnumMap2.hs:105)
1052.74 s
[regex-tdfa] unionWithKey (lib/Data/IntMap/EnumMap2.hs:108)
1052.74 s
[regex-tdfa] unions (lib/Data/IntMap/EnumMap2.hs:112)
1052.74 s
[regex-tdfa] unionsWith (lib/Data/IntMap/EnumMap2.hs:115)
1052.74 s
[regex-tdfa] difference (lib/Data/IntMap/EnumMap2.hs:118)
1052.74 s
[regex-tdfa] differenceWith (lib/Data/IntMap/EnumMap2.hs:121)
1052.74 s
[regex-tdfa] differenceWithKey (lib/Data/IntMap/EnumMap2.hs:124)
1052.74 s
[regex-tdfa] intersection (lib/Data/IntMap/EnumMap2.hs:128)
1052.74 s
[regex-tdfa] intersectionWith (lib/Data/IntMap/EnumMap2.hs:131)
1052.74 s
[regex-tdfa] intersectionWithKey (lib/Data/IntMap/EnumMap2.hs:134)
1052.74 s
[regex-tdfa] map (lib/Data/IntMap/EnumMap2.hs:138)
1052.74 s
[regex-tdfa] mapWithKey (lib/Data/IntMap/EnumMap2.hs:141)
1052.74 s
[regex-tdfa] mapAccum (lib/Data/IntMap/EnumMap2.hs:145)
1052.74 s
[regex-tdfa] mapAccumWithKey (lib/Data/IntMap/EnumMap2.hs:149)
1052.74 s
[regex-tdfa] fold (lib/Data/IntMap/EnumMap2.hs:154)
1052.74 s
[regex-tdfa] foldWithKey (lib/Data/IntMap/EnumMap2.hs:157)
1052.74 s
[regex-tdfa] elems (lib/Data/IntMap/EnumMap2.hs:161)
1052.74 s
[regex-tdfa] keys (lib/Data/IntMap/EnumMap2.hs:164)
1052.74 s
[regex-tdfa] keysSet (lib/Data/IntMap/EnumMap2.hs:168)
1052.74 s
[regex-tdfa] assocs (lib/Data/IntMap/EnumMap2.hs:171)
1052.74 s
[regex-tdfa] toList (lib/Data/IntMap/EnumMap2.hs:174)
1052.74 s
[regex-tdfa] fromList (lib/Data/IntMap/EnumMap2.hs:177)
1052.74 s
[regex-tdfa] fromListWith (lib/Data/IntMap/EnumMap2.hs:180)
1052.74 s
[regex-tdfa] fromListWithKey (lib/Data/IntMap/EnumMap2.hs:183)
1052.74 s
[regex-tdfa] toAscList (lib/Data/IntMap/EnumMap2.hs:187)
1052.74 s
[regex-tdfa] fromAscList (lib/Data/IntMap/EnumMap2.hs:190)
1052.74 s
[regex-tdfa] fromAscListWith (lib/Data/IntMap/EnumMap2.hs:193)
1052.74 s
[regex-tdfa] fromAscListWithKey (lib/Data/IntMap/EnumMap2.hs:196)
1052.74 s
[regex-tdfa] fromDistinctAscList (lib/Data/IntMap/EnumMap2.hs:200)
1052.74 s
[regex-tdfa] filter (lib/Data/IntMap/EnumMap2.hs:203)
1052.74 s
[regex-tdfa] filterWithKey (lib/Data/IntMap/EnumMap2.hs:206)
1052.74 s
[regex-tdfa] partition (lib/Data/IntMap/EnumMap2.hs:210)
1052.74 s
[regex-tdfa] partitionWithKey (lib/Data/IntMap/EnumMap2.hs:214)
1052.74 s
[regex-tdfa] mapMaybe (lib/Data/IntMap/EnumMap2.hs:219)
1052.74 s
[regex-tdfa] mapMaybeWithKey (lib/Data/IntMap/EnumMap2.hs:222)
1052.74 s
[regex-tdfa] mapEither (lib/Data/IntMap/EnumMap2.hs:226)
1052.74 s
[regex-tdfa] mapEitherWithKey (lib/Data/IntMap/EnumMap2.hs:230)
1052.74 s
[regex-tdfa] split (lib/Data/IntMap/EnumMap2.hs:235)
1052.74 s
[regex-tdfa] splitLookup (lib/Data/IntMap/EnumMap2.hs:239)
1052.74 s
[regex-tdfa] isSubmapOf (lib/Data/IntMap/EnumMap2.hs:243)
1052.74 s
[regex-tdfa] isSubmapOfBy (lib/Data/IntMap/EnumMap2.hs:246)
1052.74 s
[regex-tdfa] isProperSubmapOf (lib/Data/IntMap/EnumMap2.hs:249)
1052.74 s
[regex-tdfa] isProperSubmapOfBy (lib/Data/IntMap/EnumMap2.hs:252)
1052.74 s
[regex-tdfa] showTree (lib/Data/IntMap/EnumMap2.hs:255)
1052.74 s
[regex-tdfa] showTreeWith (lib/Data/IntMap/EnumMap2.hs:258)
1052.75 s
[regex-tdfa] 83% ( 5 / 6) in 'Text.Regex.TDFA.IntArrTrieSet'
1052.75 s
[regex-tdfa] Missing documentation for:
1052.75 s
[regex-tdfa] TrieSet (lib/Text/Regex/TDFA/IntArrTrieSet.hs:17)
1052.75 s
[regex-tdfa] Warning: 'newFlags' is out of scope.
1052.75 s
[regex-tdfa] If you qualify the identifier, haddock can try to link it anyway.
1052.76 s
[regex-tdfa] Warning: 'TagTask' is ambiguous. It is defined
1052.76 s
[regex-tdfa] * at lib/Text/Regex/TDFA/Common.hs:211:16
1052.76 s
[regex-tdfa] * at lib/Text/Regex/TDFA/Common.hs:211:1
1052.76 s
[regex-tdfa] You may be able to disambiguate the identifier by qualifying it or
1052.77 s
[regex-tdfa] by specifying the type/value namespace explicitly.
1052.77 s
[regex-tdfa] Defaulting to the one defined at lib/Text/Regex/TDFA/Common.hs:211:1
1052.77 s
[regex-tdfa] Warning: 'QNFA' is ambiguous. It is defined
1052.77 s
[regex-tdfa] * at lib/Text/Regex/TDFA/Common.hs:176:13
1052.77 s
[regex-tdfa] * at lib/Text/Regex/TDFA/Common.hs:176:1
1052.77 s
[regex-tdfa] You may be able to disambiguate the identifier by qualifying it or
1052.77 s
[regex-tdfa] by specifying the type/value namespace explicitly.
1052.77 s
[regex-tdfa] Defaulting to the one defined at lib/Text/Regex/TDFA/Common.hs:176:1
1052.77 s
[regex-tdfa] Warning: 'Regex' is ambiguous. It is defined
1052.77 s
[regex-tdfa] * at lib/Text/Regex/TDFA/Common.hs:138:14
1052.77 s
[regex-tdfa] * at lib/Text/Regex/TDFA/Common.hs:138:1
1052.78 s
[regex-tdfa] You may be able to disambiguate the identifier by qualifying it or
1052.78 s
[regex-tdfa] by specifying the type/value namespace explicitly.
1052.78 s
[regex-tdfa] Defaulting to the one defined at lib/Text/Regex/TDFA/Common.hs:138:1
1052.78 s
[regex-tdfa] Warning: 'RegexMaker' is out of scope.
1052.78 s
[regex-tdfa] If you qualify the identifier, haddock can try to link it anyway.
1052.78 s
[regex-tdfa] Warning: 'GroupInfo' is ambiguous. It is defined
1052.78 s
[regex-tdfa] * at lib/Text/Regex/TDFA/Common.hs:132:18
1052.78 s
[regex-tdfa] * at lib/Text/Regex/TDFA/Common.hs:132:1
1052.78 s
[regex-tdfa] You may be able to disambiguate the identifier by qualifying it or
1052.78 s
[regex-tdfa] by specifying the type/value namespace explicitly.
1052.78 s
[regex-tdfa] Defaulting to the one defined at lib/Text/Regex/TDFA/Common.hs:132:1
1052.78 s
[regex-tdfa] Warning: 'PGroup' is out of scope.
1052.78 s
[regex-tdfa] If you qualify the identifier, haddock can try to link it anyway.
1052.78 s
[regex-tdfa] Warning: 'Group' is out of scope.
1052.78 s
[regex-tdfa] If you qualify the identifier, haddock can try to link it anyway.
1052.78 s
[regex-tdfa] Warning: 'Set' is out of scope.
1052.78 s
[regex-tdfa] If you qualify the identifier, haddock can try to link it anyway.
1052.79 s
[regex-tdfa] Warning: 'ExecOption' is ambiguous. It is defined
1052.79 s
[regex-tdfa] * at lib/Text/Regex/TDFA/Common.hs:108:19
1052.79 s
[regex-tdfa] * at lib/Text/Regex/TDFA/Common.hs:108:1
1052.79 s
[regex-tdfa] You may be able to disambiguate the identifier by qualifying it or
1052.79 s
[regex-tdfa] by specifying the type/value namespace explicitly.
1052.79 s
[regex-tdfa] Defaulting to the one defined at lib/Text/Regex/TDFA/Common.hs:108:1
1052.79 s
[regex-tdfa] Warning: 'sort' is out of scope.
1052.79 s
[regex-tdfa] If you qualify the identifier, haddock can try to link it anyway.
1052.79 s
[regex-tdfa] Warning: 'sortBy' is out of scope.
1052.79 s
[regex-tdfa] If you qualify the identifier, haddock can try to link it anyway.
1052.79 s
[regex-tdfa] Warning: 'nub' is out of scope.
1052.79 s
[regex-tdfa] If you qualify the identifier, haddock can try to link it anyway.
1052.79 s
[regex-tdfa] Warning: 'nubBy' is out of scope.
1052.79 s
[regex-tdfa] If you qualify the identifier, haddock can try to link it anyway.
1052.80 s
[regex-tdfa] 59% ( 29 / 49) in 'Text.Regex.TDFA.Common'
1052.80 s
[regex-tdfa] Missing documentation for:
1052.80 s
[regex-tdfa] look (lib/Text/Regex/TDFA/Common.hs:27)
1052.80 s
[regex-tdfa] common_error (lib/Text/Regex/TDFA/Common.hs:30)
1052.80 s
[regex-tdfa] on (lib/Text/Regex/TDFA/Common.hs:34)
1052.80 s
[regex-tdfa] mapFst (lib/Text/Regex/TDFA/Common.hs:51)
1052.80 s
[regex-tdfa] mapSnd (lib/Text/Regex/TDFA/Common.hs:54)
1052.80 s
[regex-tdfa] fst3 (lib/Text/Regex/TDFA/Common.hs:57)
1052.80 s
[regex-tdfa] snd3 (lib/Text/Regex/TDFA/Common.hs:60)
1052.80 s
[regex-tdfa] thd3 (lib/Text/Regex/TDFA/Common.hs:63)
1052.80 s
[regex-tdfa] flipOrder (lib/Text/Regex/TDFA/Common.hs:66)
1052.80 s
[regex-tdfa] noWin (lib/Text/Regex/TDFA/Common.hs:71)
1052.80 s
[regex-tdfa] ExecOption (lib/Text/Regex/TDFA/Common.hs:108)
1052.80 s
[regex-tdfa] WinEmpty (lib/Text/Regex/TDFA/Common.hs:171)
1052.80 s
[regex-tdfa] Transition (lib/Text/Regex/TDFA/Common.hs:235)
1052.80 s
[regex-tdfa] Action (lib/Text/Regex/TDFA/Common.hs:293)
1052.80 s
[regex-tdfa] OrbitTransformer (lib/Text/Regex/TDFA/Common.hs:294)
1052.80 s
[regex-tdfa] OrbitLog (lib/Text/Regex/TDFA/Common.hs:295)
1052.80 s
[regex-tdfa] showQT (lib/Text/Regex/TDFA/Common.hs:306)
1052.80 s
[regex-tdfa] indent (lib/Text/Regex/TDFA/Common.hs:322)
1052.80 s
[regex-tdfa] showDT (lib/Text/Regex/TDFA/Common.hs:325)
1052.80 s
[regex-tdfa] seeDTrans (lib/Text/Regex/TDFA/Common.hs:370)
1052.80 s
[regex-tdfa] 0% ( 0 / 2) in 'Text.Regex.TDFA.NewDFA.Uncons'
1052.80 s
[regex-tdfa] Missing documentation for:
1052.80 s
[regex-tdfa] Module header
1052.80 s
[regex-tdfa] Uncons (lib/Text/Regex/TDFA/NewDFA/Uncons.hs:9)
1052.80 s
[regex-tdfa] 0% ( 0 / 3) in 'Text.Regex.TDFA.NewDFA.MakeTest'
1052.80 s
[regex-tdfa] Missing documentation for:
1052.80 s
[regex-tdfa] Module header
1052.80 s
[regex-tdfa] test_singleline (lib/Text/Regex/TDFA/NewDFA/MakeTest.hs:17)
1052.80 s
[regex-tdfa] test_multiline (lib/Text/Regex/TDFA/NewDFA/MakeTest.hs:11)
1052.80 s
[regex-tdfa] 50% ( 1 / 2) in 'Text.Regex.TDFA.NewDFA.Tester'
1052.80 s
[regex-tdfa] Missing documentation for:
1052.80 s
[regex-tdfa] matchTest (lib/Text/Regex/TDFA/NewDFA/Tester.hs:23)
1052.80 s
[regex-tdfa] 50% ( 1 / 2) in 'Text.Regex.TDFA.NewDFA.Engine_NC_FA'
1052.80 s
[regex-tdfa] Missing documentation for:
1052.80 s
[regex-tdfa] execMatch (lib/Text/Regex/TDFA/NewDFA/Engine_NC_FA.hs:35)
1052.80 s
[regex-tdfa] 50% ( 1 / 2) in 'Text.Regex.TDFA.NewDFA.Engine_NC'
1052.80 s
[regex-tdfa] Missing documentation for:
1052.80 s
[regex-tdfa] execMatch (lib/Text/Regex/TDFA/NewDFA/Engine_NC.hs:48)
1052.80 s
[regex-tdfa] 50% ( 1 / 2) in 'Text.Regex.TDFA.NewDFA.Engine_FA'
1052.80 s
[regex-tdfa] Missing documentation for:
1052.80 s
[regex-tdfa] execMatch (lib/Text/Regex/TDFA/NewDFA/Engine_FA.hs:72)
1052.81 s
[regex-tdfa] Warning: 'execMatch' is ambiguous. It is defined
1052.81 s
[regex-tdfa] * at lib/Text/Regex/TDFA/NewDFA/Engine.hs:86:1
1052.81 s
[regex-tdfa] * at lib/Text/Regex/TDFA/NewDFA/Engine_FA.hs:72:1
1052.81 s
[regex-tdfa] * at lib/Text/Regex/TDFA/NewDFA/Engine_NC.hs:48:1
1052.81 s
[regex-tdfa] * at lib/Text/Regex/TDFA/NewDFA/Engine_NC_FA.hs:35:1
1052.81 s
[regex-tdfa] You may be able to disambiguate the identifier by qualifying it or
1052.81 s
[regex-tdfa] by specifying the type/value namespace explicitly.
1052.81 s
[regex-tdfa] Defaulting to the one defined at lib/Text/Regex/TDFA/NewDFA/Engine_NC_FA.hs:35:1
1052.81 s
[regex-tdfa] 50% ( 1 / 2) in 'Text.Regex.TDFA.NewDFA.Engine'
1052.81 s
[regex-tdfa] Missing documentation for:
1052.81 s
[regex-tdfa] execMatch (lib/Text/Regex/TDFA/NewDFA/Engine.hs:86)
1052.82 s
[regex-tdfa] Warning: 'parseRegex' is out of scope.
1052.82 s
[regex-tdfa] If you qualify the identifier, haddock can try to link it anyway.
1052.82 s
[regex-tdfa] Warning: 'DoPa' is ambiguous. It is defined
1052.82 s
[regex-tdfa] * at lib/Text/Regex/TDFA/Common.hs:74:16
1052.82 s
[regex-tdfa] * at lib/Text/Regex/TDFA/Common.hs:74:1
1052.82 s
[regex-tdfa] You may be able to disambiguate the identifier by qualifying it or
1052.82 s
[regex-tdfa] by specifying the type/value namespace explicitly.
1052.82 s
[regex-tdfa] Defaulting to the one defined at lib/Text/Regex/TDFA/Common.hs:74:1
1052.83 s
[regex-tdfa] 88% ( 15 / 17) in 'Text.Regex.TDFA.Pattern'
1052.83 s
[regex-tdfa] Missing documentation for:
1052.83 s
[regex-tdfa] showPattern (lib/Text/Regex/TDFA/Pattern.hs:93)
1052.83 s
[regex-tdfa] starTrans' (lib/Text/Regex/TDFA/Pattern.hs:253)
1052.84 s
[regex-tdfa] 23% ( 3 / 13) in 'Text.Regex.TDFA.CorePattern'
1052.84 s
[regex-tdfa] Missing documentation for:
1052.84 s
[regex-tdfa] Q (lib/Text/Regex/TDFA/CorePattern.hs:79)
1052.84 s
[regex-tdfa] P (lib/Text/Regex/TDFA/CorePattern.hs:64)
1052.85 s
[regex-tdfa] Wanted (lib/Text/Regex/TDFA/CorePattern.hs:125)
1052.85 s
[regex-tdfa] TestInfo (lib/Text/Regex/TDFA/CorePattern.hs:89)
1052.85 s
[regex-tdfa] SetTestInfo (lib/Text/Regex/TDFA/CorePattern.hs:93)
1052.85 s
[regex-tdfa] NullView (lib/Text/Regex/TDFA/CorePattern.hs:109)
1052.85 s
[regex-tdfa] patternToQ (lib/Text/Regex/TDFA/CorePattern.hs:296)
1052.85 s
[regex-tdfa] cleanNullView (lib/Text/Regex/TDFA/CorePattern.hs:194)
1052.85 s
[regex-tdfa] cannotAccept (lib/Text/Regex/TDFA/CorePattern.hs:246)
1052.85 s
[regex-tdfa] mustAccept (lib/Text/Regex/TDFA/CorePattern.hs:240)
1052.85 s
[regex-tdfa] 100% ( 2 / 2) in 'Text.Regex.TDFA.ReadRegex'
1052.86 s
[regex-tdfa] 83% ( 5 / 6) in 'Text.Regex.TDFA.TNFA'
1052.86 s
[regex-tdfa] Missing documentation for:
1052.86 s
[regex-tdfa] patternToNFA (lib/Text/Regex/TDFA/TNFA.hs:85)
1052.87 s
[regex-tdfa] 42% ( 3 / 7) in 'Text.Regex.TDFA.TDFA'
1052.87 s
[regex-tdfa] Missing documentation for:
1052.87 s
[regex-tdfa] patternToRegex (lib/Text/Regex/TDFA/TDFA.hs:160)
1052.87 s
[regex-tdfa] examineDFA (lib/Text/Regex/TDFA/TDFA.hs:176)
1052.87 s
[regex-tdfa] nfaToDFA (lib/Text/Regex/TDFA/TDFA.hs:53)
1052.87 s
[regex-tdfa] dfaMap (lib/Text/Regex/TDFA/TDFA.hs:163)
1052.87 s
[regex-tdfa] 63% ( 7 / 11) in 'Text.Regex.TDFA.String'
1052.87 s
[regex-tdfa] Missing documentation for:
1052.87 s
[regex-tdfa] ExecOption (lib/Text/Regex/TDFA/Common.hs:108)
1052.88 s
[regex-tdfa] compile (lib/Text/Regex/TDFA/String.hs:44)
1052.88 s
[regex-tdfa] execute (lib/Text/Regex/TDFA/String.hs:56)
1052.88 s
[regex-tdfa] regexec (lib/Text/Regex/TDFA/String.hs:61)
1052.88 s
[regex-tdfa] 42% ( 3 / 7) in 'Text.Regex.TDFA.Sequence'
1052.88 s
[regex-tdfa] Missing documentation for:
1052.88 s
[regex-tdfa] ExecOption (lib/Text/Regex/TDFA/Common.hs:108)
1052.88 s
[regex-tdfa] compile (lib/Text/Regex/TDFA/Sequence.hs:66)
1052.88 s
[regex-tdfa] execute (lib/Text/Regex/TDFA/Sequence.hs:74)
1052.88 s
[regex-tdfa] regexec (lib/Text/Regex/TDFA/Sequence.hs:79)
1052.89 s
[regex-tdfa] 42% ( 3 / 7) in 'Text.Regex.TDFA.ByteString.Lazy'
1052.89 s
[regex-tdfa] Missing documentation for:
1052.89 s
[regex-tdfa] ExecOption (lib/Text/Regex/TDFA/Common.hs:108)
1052.89 s
[regex-tdfa] compile (lib/Text/Regex/TDFA/ByteString/Lazy.hs:77)
1052.89 s
[regex-tdfa] execute (lib/Text/Regex/TDFA/ByteString/Lazy.hs:85)
1052.89 s
[regex-tdfa] regexec (lib/Text/Regex/TDFA/ByteString/Lazy.hs:90)
1052.89 s
[regex-tdfa] 42% ( 3 / 7) in 'Text.Regex.TDFA.ByteString'
1052.89 s
[regex-tdfa] Missing documentation for:
1052.89 s
[regex-tdfa] ExecOption (lib/Text/Regex/TDFA/Common.hs:108)
1052.89 s
[regex-tdfa] compile (lib/Text/Regex/TDFA/ByteString.hs:61)
1052.89 s
[regex-tdfa] execute (lib/Text/Regex/TDFA/ByteString.hs:69)
1052.89 s
[regex-tdfa] regexec (lib/Text/Regex/TDFA/ByteString.hs:74)
1052.90 s
[regex-tdfa] 85% ( 6 / 7) in 'Text.Regex.TDFA.Text'
1052.90 s
[regex-tdfa] Missing documentation for:
1052.90 s
[regex-tdfa] ExecOption (lib/Text/Regex/TDFA/Common.hs:108)
1052.90 s
[regex-tdfa] 85% ( 6 / 7) in 'Text.Regex.TDFA.Text.Lazy'
1052.90 s
[regex-tdfa] Missing documentation for:
1052.90 s
[regex-tdfa] ExecOption (lib/Text/Regex/TDFA/Common.hs:108)
1052.91 s
[adjunctions] [ 7 of 11] Compiling Control.Monad.Trans.Adjoint ( src/Control/Monad/Trans/Adjoint.hs, nothing )
1052.93 s
[regex-tdfa] Warning: 'CompOption' is ambiguous. It is defined
1052.93 s
[regex-tdfa] * at lib/Text/Regex/TDFA/Common.hs:85:19
1052.93 s
[regex-tdfa] * at lib/Text/Regex/TDFA/Common.hs:85:1
1052.93 s
[regex-tdfa] You may be able to disambiguate the identifier by qualifying it or
1052.93 s
[regex-tdfa] by specifying the type/value namespace explicitly.
1052.93 s
[regex-tdfa] Defaulting to the one defined at lib/Text/Regex/TDFA/Common.hs:85:1
1052.93 s
[regex-tdfa] 75% ( 6 / 8) in 'Text.Regex.TDFA'
1052.93 s
[regex-tdfa] Missing documentation for:
1052.93 s
[regex-tdfa] getVersion_Text_Regex_TDFA (lib/Text/Regex/TDFA.hs:209)
1052.93 s
[regex-tdfa] ExecOption (lib/Text/Regex/TDFA/Common.hs:108)
1052.96 s
[monoid-subclasses] [ 1 of 16] Compiling Data.Monoid.Null ( src/Data/Monoid/Null.hs, nothing )
1052.98 s
[adjunctions] [ 8 of 11] Compiling Control.Comonad.Trans.Adjoint ( src/Control/Comonad/Trans/Adjoint.hs, nothing )
1053.02 s
[attoparsec] [12 of 12] Compiling Main ( tests/QC.hs, dist/build/attoparsec-tests/attoparsec-tests-tmp/Main.o )
1053.04 s
[adjunctions] [ 9 of 11] Compiling Control.Monad.Representable.State ( src/Control/Monad/Representable/State.hs, nothing )
1053.04 s
[aeson] [ 1 of 32] Compiling Data.Aeson.Internal.ByteString ( src/Data/Aeson/Internal/ByteString.hs, dist/build/Data/Aeson/Internal/ByteString.o, dist/build/Data/Aeson/Internal/ByteString.dyn_o )
1053.50 s
[adjunctions] [10 of 11] Compiling Control.Monad.Representable.Reader ( src/Control/Monad/Representable/Reader.hs, nothing )
1053.76 s
[monoid-subclasses] [ 2 of 16] Compiling Data.Semigroup.Cancellative ( src/Data/Semigroup/Cancellative.hs, nothing )
1053.81 s
[adjunctions] [11 of 11] Compiling Control.Comonad.Representable.Store ( src/Control/Comonad/Representable/Store.hs, nothing )
1054.27 s
[adjunctions] Haddock coverage:
1054.28 s
[adjunctions] 33% ( 4 / 12) in 'Control.Monad.Trans.Conts'
1054.28 s
[adjunctions] Missing documentation for:
1054.28 s
[adjunctions] Cont (src/Control/Monad/Trans/Conts.hs:38)
1054.28 s
[adjunctions] cont (src/Control/Monad/Trans/Conts.hs:41)
1054.28 s
[adjunctions] runCont (src/Control/Monad/Trans/Conts.hs:44)
1054.28 s
[adjunctions] Conts (src/Control/Monad/Trans/Conts.hs:46)
1054.28 s
[adjunctions] runConts (src/Control/Monad/Trans/Conts.hs:52)
1054.28 s
[adjunctions] conts (src/Control/Monad/Trans/Conts.hs:49)
1054.28 s
[adjunctions] ContsT (src/Control/Monad/Trans/Conts.hs:54)
1054.28 s
[adjunctions] callCC (src/Control/Monad/Trans/Conts.hs:71)
1054.30 s
[adjunctions] Warning: 'Iso'' is out of scope.
1054.30 s
[adjunctions] If you qualify the identifier, haddock can try to link it anyway.
1054.30 s
[adjunctions] 83% ( 5 / 6) in 'Data.Functor.Contravariant.Rep'
1054.30 s
[adjunctions] Missing documentation for:
1054.30 s
[adjunctions] contramapRep (src/Data/Functor/Contravariant/Rep.hs:71)
1054.30 s
[adjunctions] Warning: 'Op' is ambiguous. It is defined
1054.30 s
[adjunctions] * in ‘Data.Functor.Contravariant’
1054.30 s
[adjunctions] * in ‘Data.Functor.Contravariant’
1054.30 s
[adjunctions] You may be able to disambiguate the identifier by qualifying it or
1054.30 s
[adjunctions] by specifying the type/value namespace explicitly.
1054.30 s
[adjunctions] Defaulting to the one defined in ‘Data.Functor.Contravariant’
1054.30 s
[adjunctions] Warning: 'Hask' is out of scope.
1054.30 s
[adjunctions] If you qualify the identifier, haddock can try to link it anyway.
1054.30 s
[adjunctions] Warning: 'Iso'' is out of scope.
1054.30 s
[adjunctions] If you qualify the identifier, haddock can try to link it anyway.
1054.30 s
[adjunctions] 80% ( 4 / 5) in 'Data.Functor.Contravariant.Adjunction'
1054.30 s
[adjunctions] Missing documentation for:
1054.30 s
[adjunctions] coindexAdjunction (src/Data/Functor/Contravariant/Adjunction.hs:74)
1054.30 s
[adjunctions] 20% ( 1 / 5) in 'Control.Monad.Trans.Contravariant.Adjoint'
1054.30 s
[adjunctions] Missing documentation for:
1054.30 s
[adjunctions] Adjoint (src/Control/Monad/Trans/Contravariant/Adjoint.hs:40)
1054.30 s
[adjunctions] runAdjoint (src/Control/Monad/Trans/Contravariant/Adjoint.hs:48)
1054.30 s
[adjunctions] adjoint (src/Control/Monad/Trans/Contravariant/Adjoint.hs:45)
1054.30 s
[adjunctions] AdjointT (src/Control/Monad/Trans/Contravariant/Adjoint.hs:42)
1054.31 s
[adjunctions] Warning: 'WrappedRec' is out of scope.
1054.31 s
[adjunctions] If you qualify the identifier, haddock can try to link it anyway.
1054.31 s
[adjunctions] Warning: 'index' is ambiguous. It is defined
1054.31 s
[adjunctions] * at src/Data/Functor/Rep.hs:139:3
1054.31 s
[adjunctions] * in ‘Data.Sequence.Internal’
1054.31 s
[adjunctions] You may be able to disambiguate the identifier by qualifying it or
1054.32 s
[adjunctions] by specifying the type/value namespace explicitly.
1054.32 s
[adjunctions] Defaulting to the one defined at src/Data/Functor/Rep.hs:139:3
1054.33 s
[adjunctions] Warning: 'Iso'' is out of scope.
1054.33 s
[adjunctions] If you qualify the identifier, haddock can try to link it anyway.
1054.33 s
[adjunctions] 46% ( 22 / 47) in 'Data.Functor.Rep'
1054.34 s
[adjunctions] Missing documentation for:
1054.34 s
[adjunctions] Co (src/Data/Functor/Rep.hs:437)
1054.34 s
[adjunctions] fmapRep (src/Data/Functor/Rep.hs:254)
1054.34 s
[adjunctions] distributeRep (src/Data/Functor/Rep.hs:281)
1054.34 s
[adjunctions] collectRep (src/Data/Functor/Rep.hs:284)
1054.34 s
[adjunctions] apRep (src/Data/Functor/Rep.hs:278)
1054.34 s
[adjunctions] pureRep (src/Data/Functor/Rep.hs:257)
1054.34 s
[adjunctions] liftR2 (src/Data/Functor/Rep.hs:477)
1054.34 s
[adjunctions] liftR3 (src/Data/Functor/Rep.hs:480)
1054.34 s
[adjunctions] bindRep (src/Data/Functor/Rep.hs:260)
1054.34 s
[adjunctions] mfixRep (src/Data/Functor/Rep.hs:263)
1054.34 s
[adjunctions] mzipRep (src/Data/Functor/Rep.hs:269)
1054.34 s
[adjunctions] mzipWithRep (src/Data/Functor/Rep.hs:266)
1054.34 s
[adjunctions] askRep (src/Data/Functor/Rep.hs:272)
1054.34 s
[adjunctions] localRep (src/Data/Functor/Rep.hs:275)
1054.34 s
[adjunctions] duplicatedRep (src/Data/Functor/Rep.hs:296)
1054.34 s
[adjunctions] extendedRep (src/Data/Functor/Rep.hs:299)
1054.34 s
[adjunctions] duplicateRep (src/Data/Functor/Rep.hs:302)
1054.34 s
[adjunctions] extendRep (src/Data/Functor/Rep.hs:305)
1054.34 s
[adjunctions] extractRep (src/Data/Functor/Rep.hs:308)
1054.34 s
[adjunctions] duplicateRepBy (src/Data/Functor/Rep.hs:287)
1054.34 s
[adjunctions] extendRepBy (src/Data/Functor/Rep.hs:290)
1054.34 s
[adjunctions] extractRepBy (src/Data/Functor/Rep.hs:293)
1054.34 s
[adjunctions] imapRep (src/Data/Functor/Rep.hs:311)
1054.34 s
[adjunctions] ifoldMapRep (src/Data/Functor/Rep.hs:315)
1054.34 s
[adjunctions] itraverseRep (src/Data/Functor/Rep.hs:319)
1054.35 s
[adjunctions] Warning: 'Iso'' is out of scope.
1054.35 s
[adjunctions] If you qualify the identifier, haddock can try to link it anyway.
1054.36 s
[adjunctions] Warning: 'uncozipping' is out of scope.
1054.36 s
[adjunctions] If you qualify the identifier, haddock can try to link it anyway.
1054.36 s
[adjunctions] 62% ( 10 / 16) in 'Data.Functor.Adjunction'
1054.36 s
[adjunctions] Missing documentation for:
1054.36 s
[adjunctions] zapWithAdjunction (src/Data/Functor/Adjunction.hs:108)
1054.36 s
[adjunctions] absurdL (src/Data/Functor/Adjunction.hs:132)
1054.36 s
[adjunctions] extractL (src/Data/Functor/Adjunction.hs:117)
1054.36 s
[adjunctions] duplicateL (src/Data/Functor/Adjunction.hs:120)
1054.36 s
[adjunctions] splitL (src/Data/Functor/Adjunction.hs:111)
1054.36 s
[adjunctions] unsplitL (src/Data/Functor/Adjunction.hs:114)
1054.36 s
[adjunctions] 20% ( 1 / 5) in 'Control.Monad.Trans.Adjoint'
1054.36 s
[adjunctions] Missing documentation for:
1054.36 s
[adjunctions] Adjoint (src/Control/Monad/Trans/Adjoint.hs:27)
1054.36 s
[adjunctions] runAdjoint (src/Control/Monad/Trans/Adjoint.hs:35)
1054.36 s
[adjunctions] adjoint (src/Control/Monad/Trans/Adjoint.hs:32)
1054.36 s
[adjunctions] AdjointT (src/Control/Monad/Trans/Adjoint.hs:29)
1054.36 s
[adjunctions] 20% ( 1 / 5) in 'Control.Comonad.Trans.Adjoint'
1054.36 s
[adjunctions] Missing documentation for:
1054.36 s
[adjunctions] Adjoint (src/Control/Comonad/Trans/Adjoint.hs:28)
1054.36 s
[adjunctions] runAdjoint (src/Control/Comonad/Trans/Adjoint.hs:36)
1054.36 s
[adjunctions] adjoint (src/Control/Comonad/Trans/Adjoint.hs:33)
1054.36 s
[adjunctions] AdjointT (src/Control/Comonad/Trans/Adjoint.hs:30)
1054.38 s
[adjunctions] 80% ( 12 / 15) in 'Control.Monad.Representable.State'
1054.38 s
[adjunctions] Missing documentation for:
1054.38 s
[adjunctions] stateT (src/Control/Monad/Representable/State.hs:107)
1054.38 s
[adjunctions] runStateT (src/Control/Monad/Representable/State.hs:110)
1054.38 s
[adjunctions] mapStateT (src/Control/Monad/Representable/State.hs:113)
1054.38 s
[adjunctions] 50% ( 5 / 10) in 'Control.Monad.Representable.Reader'
1054.39 s
[adjunctions] Missing documentation for:
1054.39 s
[adjunctions] Reader (src/Control/Monad/Representable/Reader.hs:46)
1054.39 s
[adjunctions] runReader (src/Control/Monad/Representable/Reader.hs:49)
1054.39 s
[adjunctions] ReaderT (src/Control/Monad/Representable/Reader.hs:53)
1054.39 s
[adjunctions] readerT (src/Control/Monad/Representable/Reader.hs:56)
1054.39 s
[adjunctions] runReaderT (src/Control/Monad/Representable/Reader.hs:59)
1054.40 s
[adjunctions] 62% ( 5 / 8) in 'Control.Comonad.Representable.Store'
1054.40 s
[adjunctions] Missing documentation for:
1054.40 s
[adjunctions] storeT (src/Control/Comonad/Representable/Store.hs:77)
1054.40 s
[adjunctions] runStoreT (src/Control/Comonad/Representable/Store.hs:80)
1054.40 s
[adjunctions] ComonadStore
1054.56 s
[aeson] [ 2 of 32] Compiling Data.Aeson.Internal.Functions ( src/Data/Aeson/Internal/Functions.hs, dist/build/Data/Aeson/Internal/Functions.o, dist/build/Data/Aeson/Internal/Functions.dyn_o )
1054.61 s
[aeson] [ 3 of 32] Compiling Data.Aeson.Internal.Prelude ( src/Data/Aeson/Internal/Prelude.hs, dist/build/Data/Aeson/Internal/Prelude.o, dist/build/Data/Aeson/Internal/Prelude.dyn_o )
1054.67 s
[aeson] [ 4 of 32] Compiling Data.Aeson.Internal.Scientific ( src/Data/Aeson/Internal/Scientific.hs, dist/build/Data/Aeson/Internal/Scientific.o, dist/build/Data/Aeson/Internal/Scientific.dyn_o )
1054.84 s
[attoparsec] [13 of 13] Linking dist/build/attoparsec-tests/attoparsec-tests
1054.87 s
[algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
1055.00 s
[monoid-subclasses] [ 3 of 16] Compiling Data.Monoid.Monus ( src/Data/Monoid/Monus.hs, nothing )
1055.25 s
[keys] Phase: checkPhase
1055.45 s
[keys] Package has no test suites.
1055.49 s
[keys] Phase: haddockPhase
1056.00 s
[monoid-subclasses]
1056.01 s
[monoid-subclasses] src/Data/Monoid/Monus.hs:320:36: warning : [ GHC-63394 ] [ -Wx-partial ]
1056.01 s
[monoid-subclasses] In the use of ‘tail’
1056.01 s
[monoid-subclasses] (imported from Prelude, but defined in GHC.List):
1056.01 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1056.01 s
[monoid-subclasses] |
1056.01 s
[monoid-subclasses] 320 | | otherwise = go (tail x)
1056.01 s
[monoid-subclasses] | ^^^^
1056.01 s
[monoid-subclasses]
1056.01 s
[monoid-subclasses] src/Data/Monoid/Monus.hs:327:36: warning : [ GHC-63394 ] [ -Wx-partial ]
1056.01 s
[monoid-subclasses] In the use of ‘tail’
1056.01 s
[monoid-subclasses] (imported from Prelude, but defined in GHC.List):
1056.01 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1056.01 s
[monoid-subclasses] |
1056.01 s
[monoid-subclasses] 327 | | otherwise = go (tail x)
1056.01 s
[monoid-subclasses] | ^^^^
1056.02 s
[monoid-subclasses] [ 4 of 16] Compiling Data.Monoid.GCD ( src/Data/Monoid/GCD.hs, nothing )
1056.15 s
[keys] Preprocessing library for keys-3.12.4..
1056.16 s
[keys] Running Haddock on library for keys-3.12.4..
1056.24 s
[adjunctions] Warning: Data.Functor.Contravariant.Rep: could not find link destinations for:
1056.24 s
[adjunctions] - Data.Functor.Contravariant.Rep.D:R:Rep:*:
1056.24 s
[adjunctions] - Data.Functor.Contravariant.Rep.D:R:RepU1
1056.24 s
[adjunctions] - Data.Functor.Contravariant.Rep.D:R:RepProduct
1056.24 s
[adjunctions] - Data.Functor.Contravariant.Rep.D:R:RepPredicate
1056.24 s
[adjunctions] - Data.Functor.Contravariant.Rep.D:R:RepOp
1056.24 s
[adjunctions] - Data.Functor.Contravariant.Rep.D:R:RepProxy
1056.26 s
[adjunctions] Warning: Data.Functor.Rep: could not find link destinations for:
1056.26 s
[adjunctions] - Data.Functor.Rep.GIndex
1056.26 s
[adjunctions] - Data.Functor.Rep.GTabulate
1056.26 s
[adjunctions] - Data.Functor.Rep.GRep'
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepM1
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepRec1
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepPar1
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:Rep:.:
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:Rep:*:
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepU1
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepComplex
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepSum
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepProduct
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepDual
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepReverse
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepBackwards
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepCofree
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepProduct0
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepCompose
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepReaderT
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepFUN
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepIdentityT
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepTagged
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepIdentity
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepProxy
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepCo
1056.26 s
[adjunctions] - Data.Functor.Rep.D:R:RepTracedT
1056.26 s
[adjunctions] - Control.Monad.Representable.Reader.D:R:RepReaderT
1056.30 s
[keys] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1056.32 s
[adjunctions] Warning: Control.Monad.Representable.Reader: could not find link destinations for:
1056.32 s
[adjunctions] - Control.Monad.Representable.Reader.D:R:RepReaderT
1056.86 s
[monoid-subclasses]
1056.87 s
[monoid-subclasses] src/Data/Monoid/GCD.hs:75:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1056.93 s
[monoid-subclasses] The qualified import of ‘Data.Text.Encoding’ is redundant
1056.93 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Text.Encoding’
1056.93 s
[monoid-subclasses] To import instances alone, use: import Data.Text.Encoding()
1056.93 s
[keys] [1 of 1] Compiling Data.Key ( src/Data/Key.hs, nothing )
1056.93 s
[monoid-subclasses] |
1056.93 s
[monoid-subclasses] 75 | import qualified Data.Text.Encoding as TextEncoding
1056.93 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1056.93 s
[monoid-subclasses]
1056.93 s
[monoid-subclasses] src/Data/Monoid/GCD.hs:83:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1056.93 s
[monoid-subclasses] The qualified import of ‘Data.Text.Lazy.Encoding’ is redundant
1056.93 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Text.Lazy.Encoding’
1056.93 s
[monoid-subclasses] To import instances alone, use: import Data.Text.Lazy.Encoding()
1056.93 s
[monoid-subclasses] |
1056.93 s
[monoid-subclasses] 83 | import qualified Data.Text.Lazy.Encoding as LazyEncoding
1056.93 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1056.93 s
[monoid-subclasses]
1056.93 s
[monoid-subclasses] src/Data/Monoid/GCD.hs:97:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1056.93 s
[monoid-subclasses] The import of ‘Data.Maybe’ is redundant
1056.93 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Maybe’
1056.93 s
[monoid-subclasses] To import instances alone, use: import Data.Maybe()
1056.93 s
[monoid-subclasses] |
1056.94 s
[monoid-subclasses] 97 | import Data.Maybe (isJust)
1056.94 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^
1056.94 s
[monoid-subclasses] [ 5 of 16] Compiling Data.Monoid.LCM ( src/Data/Monoid/LCM.hs, nothing )
1056.94 s
[unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.o, dist/build/Data/HashMap/Internal/Debug.dyn_o )
1057.35 s
[monoid-subclasses]
1057.35 s
[monoid-subclasses] src/Data/Monoid/LCM.hs:37:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1057.35 s
[monoid-subclasses] The import of ‘Data.Maybe’ is redundant
1057.35 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Maybe’
1057.35 s
[monoid-subclasses] To import instances alone, use: import Data.Maybe()
1057.35 s
[monoid-subclasses] |
1057.35 s
[monoid-subclasses] 37 | import Data.Maybe (isJust)
1057.35 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^
1057.35 s
[monoid-subclasses]
1057.35 s
[monoid-subclasses] src/Data/Monoid/LCM.hs:38:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1057.35 s
[monoid-subclasses] The import of ‘Data.Semigroup.Cancellative’ is redundant
1057.35 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Semigroup.Cancellative’
1057.38 s
[ghc-lib-parser-ex] Preprocessing test suite 'ghc-lib-parser-ex-test' for ghc-lib-parser-ex-9.8.0.2..
1057.38 s
[ghc-lib-parser-ex] Building test suite 'ghc-lib-parser-ex-test' for ghc-lib-parser-ex-9.8.0.2..
1057.44 s
[aeson] [ 5 of 32] Compiling Data.Aeson.Internal.TH ( src/Data/Aeson/Internal/TH.hs, dist/build/Data/Aeson/Internal/TH.o, dist/build/Data/Aeson/Internal/TH.dyn_o )
1057.45 s
[aeson] [ 6 of 32] Compiling Data.Aeson.Internal.Text ( src/Data/Aeson/Internal/Text.hs, dist/build/Data/Aeson/Internal/Text.o, dist/build/Data/Aeson/Internal/Text.dyn_o )
1057.45 s
[aeson] [ 7 of 32] Compiling Data.Aeson.Internal.Unescape ( src/Data/Aeson/Internal/Unescape.hs, dist/build/Data/Aeson/Internal/Unescape.o, dist/build/Data/Aeson/Internal/Unescape.dyn_o )
1057.45 s
[aeson] [ 8 of 32] Compiling Data.Aeson.Internal.UnescapeFromText ( src/Data/Aeson/Internal/UnescapeFromText.hs, dist/build/Data/Aeson/Internal/UnescapeFromText.o, dist/build/Data/Aeson/Internal/UnescapeFromText.dyn_o )
1057.45 s
[aeson] [ 9 of 32] Compiling Data.Aeson.Key ( src/Data/Aeson/Key.hs, dist/build/Data/Aeson/Key.o, dist/build/Data/Aeson/Key.dyn_o )
1057.45 s
[aeson] [10 of 32] Compiling Data.Aeson.Decoding.Tokens ( src/Data/Aeson/Decoding/Tokens.hs, dist/build/Data/Aeson/Decoding/Tokens.o, dist/build/Data/Aeson/Decoding/Tokens.dyn_o )
1057.57 s
[monoid-subclasses] To import instances alone, use: import Data.Semigroup.Cancellative()
1057.57 s
[monoid-subclasses] |
1057.57 s
[monoid-subclasses] 38 | import Data.Semigroup.Cancellative (Reductive ((</>)))
1057.57 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1057.57 s
[monoid-subclasses]
1057.57 s
[monoid-subclasses] src/Data/Monoid/LCM.hs:39:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1057.57 s
[monoid-subclasses] The import of ‘Data.Semigroup.Commutative’ is redundant
1057.57 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Semigroup.Commutative’
1057.57 s
[monoid-subclasses] To import instances alone, use: import Data.Semigroup.Commutative()
1057.57 s
[monoid-subclasses] |
1057.57 s
[monoid-subclasses] 39 | import Data.Semigroup.Commutative (Commutative)
1057.57 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1057.58 s
[monoid-subclasses] [ 6 of 16] Compiling Data.Monoid.Cancellative ( src/Data/Monoid/Cancellative.hs, nothing )
1057.60 s
[monoid-subclasses]
1057.60 s
[monoid-subclasses] src/Data/Monoid/Cancellative.hs:38:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1057.60 s
[monoid-subclasses] The import of ‘Data.Monoid’ is redundant
1057.60 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Monoid’
1057.60 s
[monoid-subclasses] To import instances alone, use: import Data.Monoid()
1057.60 s
[monoid-subclasses] |
1057.60 s
[monoid-subclasses] 38 | import Data.Monoid (Monoid)
1057.60 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^
1057.60 s
[monoid-subclasses] [ 7 of 16] Compiling Data.Semigroup.Factorial ( src/Data/Semigroup/Factorial.hs, nothing )
1057.86 s
[unix-compat] Documentation created: dist/doc/html/unix-compat/,
1057.86 s
[unix-compat] dist/doc/html/unix-compat/unix-compat.txt
1057.89 s
[ghc-lib-parser-ex] [1 of 2] Compiling Main ( test/Test.hs, dist/build/ghc-lib-parser-ex-test/ghc-lib-parser-ex-test-tmp/Main.o )
1058.04 s
[attoparsec] buildPhase completed in 2 minutes 17 seconds
1058.04 s
[attoparsec] Phase: checkPhase
1058.07 s
[unix-compat] Preprocessing test suite 'unix-compat-testsuite' for unix-compat-0.7.4..
1058.09 s
[unix-compat] Phase: installPhase
1058.35 s
[attoparsec] Running 1 test suites...
1058.37 s
[attoparsec] Test suite attoparsec-tests: RUNNING...
1058.40 s
[algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.p_o )
1058.41 s
[attoparsec] tests
1058.42 s
[attoparsec] bs
1058.42 s
[attoparsec] anyWord8: OK (0.01s)
1058.42 s
[attoparsec] +++ OK, passed 100 tests.
1058.43 s
[attoparsec] endOfInput: OK
1058.43 s
[attoparsec] +++ OK, passed 100 tests.
1058.44 s
[attoparsec] endOfLine: OK
1058.44 s
[attoparsec] +++ OK, failed as expected. Falsified, Falsified (after 3 tests and 1 shrink):
1058.44 s
[attoparsec] "\NUL"
1058.44 s
[attoparsec] '\NUL' /= '\n'
1058.44 s
[attoparsec]
1058.44 s
[attoparsec] ('\NUL',Nothing) /= ('\r',Just '\n')
1058.44 s
[attoparsec] notWord8: OK
1058.44 s
[attoparsec] +++ OK, passed 100 tests.
1058.45 s
[attoparsec] peekWord8: OK
1058.45 s
[attoparsec] +++ OK, passed 100 tests.
1058.46 s
[attoparsec] peekWord8': OK
1058.46 s
[attoparsec] +++ OK, passed 100 tests.
1058.46 s
[attoparsec] satisfy: OK
1058.46 s
[attoparsec] +++ OK, passed 100 tests.
1058.47 s
[attoparsec] satisfyWith: OK
1058.47 s
[attoparsec] +++ OK, passed 100 tests.
1058.47 s
[attoparsec] scan: OK
1058.47 s
[attoparsec] +++ OK, passed 100 tests.
1058.48 s
[attoparsec] skip: OK
1058.49 s
[attoparsec] +++ OK, failed as expected. Falsified (after 3 tests and 2 shrinks):
1058.49 s
[attoparsec] 0
1058.49 s
[attoparsec] "\NUL"
1058.49 s
[attoparsec] not (0 < 0)
1058.49 s
[attoparsec] skipWhile: OK
1058.49 s
[attoparsec] +++ OK, passed 100 tests.
1058.49 s
[attoparsec] string: OK
1058.49 s
[attoparsec] +++ OK, passed 100 tests.
1058.49 s
[attoparsec] stringCI: OK
1058.49 s
[attoparsec] +++ OK, passed 100 tests.
1058.50 s
[attoparsec] strings: OK
1058.50 s
[attoparsec] +++ OK, passed 100 tests.
1058.50 s
[unix-compat] Installing library in /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP
1058.50 s
[attoparsec] take: OK
1058.50 s
[attoparsec] +++ OK, passed 100 tests.
1058.50 s
[attoparsec] takeByteString: OK
1058.50 s
[attoparsec] +++ OK, passed 100 tests.
1058.50 s
[attoparsec] takeCount: OK
1058.50 s
[attoparsec] +++ OK, passed 100 tests.
1058.50 s
[attoparsec] takeLazyByteString: OK
1058.51 s
[attoparsec] +++ OK, passed 100 tests.
1058.51 s
[attoparsec] takeTill: OK
1058.51 s
[attoparsec] +++ OK, passed 100 tests.
1058.51 s
[attoparsec] takeWhile: OK
1058.51 s
[attoparsec] +++ OK, passed 100 tests.
1058.52 s
[attoparsec] takeWhile1: OK
1058.52 s
[attoparsec] +++ OK, passed 100 tests.
1058.52 s
[attoparsec] takeWhile1_empty: OK
1058.52 s
[attoparsec] +++ OK, passed 1 test.
1058.52 s
[attoparsec] takeWhileIncluding: OK
1058.52 s
[attoparsec] +++ OK, passed 100 tests; 1 discarded.
1058.52 s
[attoparsec] getChunk: OK
1058.52 s
[attoparsec] +++ OK, passed 100 tests.
1058.53 s
[attoparsec] word8: OK
1058.53 s
[attoparsec] +++ OK, passed 100 tests.
1058.53 s
[attoparsec] members: OK
1058.53 s
[attoparsec] +++ OK, passed 100 tests.
1058.53 s
[attoparsec] nonmembers: OK
1058.55 s
[attoparsec] +++ OK, passed 100 tests.
1058.55 s
[attoparsec] buf
1058.57 s
[attoparsec] b_unbuffer: OK (0.03s)
1058.57 s
[attoparsec] +++ OK, passed 100 tests.
1058.58 s
[attoparsec] t_unbuffer: OK (0.02s)
1058.58 s
[attoparsec] +++ OK, passed 100 tests.
1058.58 s
[attoparsec] t_unbuffer_three: OK
1058.58 s
[attoparsec] +++ OK, passed 1 test.
1058.61 s
[monoid-subclasses] [ 8 of 16] Compiling Data.Monoid.Factorial ( src/Data/Monoid/Factorial.hs, nothing )
1058.62 s
[attoparsec] b_length: OK (0.04s)
1058.62 s
[attoparsec] +++ OK, passed 100 tests.
1058.67 s
[attoparsec] t_length: OK (0.04s)
1058.67 s
[attoparsec] +++ OK, passed 100 tests.
1058.73 s
[attoparsec] b_unsafeIndex: OK (0.06s)
1058.73 s
[attoparsec] +++ OK, passed 100 tests.
1058.77 s
[attoparsec] t_iter: OK (0.03s)
1058.77 s
[attoparsec] +++ OK, passed 100 tests.
1058.79 s
[attoparsec] t_iter_: OK (0.03s)
1058.79 s
[attoparsec] +++ OK, passed 100 tests.
1058.82 s
[attoparsec] b_unsafeDrop: OK (0.03s)
1058.82 s
[attoparsec] +++ OK, passed 100 tests.
1058.83 s
[attoparsec] t_dropCodeUnits: OK (0.02s)
1058.83 s
[attoparsec] +++ OK, passed 100 tests.
1058.83 s
[attoparsec] combinator
1058.83 s
[unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.o, dist/build/Data/HashMap/Internal/Strict.dyn_o )
1058.84 s
[attoparsec] choice: OK (0.01s)
1058.84 s
[attoparsec] +++ OK, passed 100 tests.
1058.84 s
[attoparsec] count: OK
1058.84 s
[attoparsec] +++ OK, passed 100 tests.
1058.84 s
[attoparsec] lookAhead: OK
1058.84 s
[attoparsec] +++ OK, passed 100 tests.
1058.84 s
[attoparsec] match: OK
1058.84 s
[attoparsec] +++ OK, passed 100 tests.
1058.84 s
[attoparsec] simple
1058.84 s
[attoparsec] issue75: OK
1058.84 s
[attoparsec] +++ OK, passed 100 tests.
1058.84 s
[attoparsec] text
1058.84 s
[attoparsec] anyChar: OK
1058.84 s
[attoparsec] +++ OK, passed 100 tests.
1058.84 s
[attoparsec] asciiCI: OK
1058.84 s
[attoparsec] +++ OK, passed 100 tests.
1058.85 s
[attoparsec] char: OK
1058.85 s
[attoparsec] +++ OK, passed 100 tests.
1058.85 s
[attoparsec] endOfInput: OK
1058.85 s
[attoparsec] +++ OK, passed 100 tests.
1058.85 s
[attoparsec] endOfLine: OK
1058.85 s
[attoparsec] +++ OK, failed as expected. Falsified, Falsified (after 2 tests and 1 shrink):
1058.85 s
[attoparsec] "\NUL"
1058.85 s
[attoparsec] '\NUL' /= '\n'
1058.85 s
[attoparsec]
1058.85 s
[attoparsec] ('\NUL',Nothing) /= ('\r',Just '\n')
1058.85 s
[attoparsec] notChar: OK
1058.85 s
[attoparsec] +++ OK, passed 100 tests.
1058.85 s
[attoparsec] peekChar: OK
1058.85 s
[attoparsec] +++ OK, passed 100 tests.
1058.85 s
[attoparsec] peekChar': OK
1058.85 s
[attoparsec] +++ OK, passed 100 tests.
1058.85 s
[attoparsec] satisfy: OK
1058.85 s
[attoparsec] +++ OK, passed 100 tests.
1058.85 s
[attoparsec] satisfyWith: OK
1058.85 s
[attoparsec] +++ OK, passed 100 tests.
1058.85 s
[attoparsec] scan: OK
1058.85 s
[attoparsec] +++ OK, passed 100 tests.
1058.86 s
[attoparsec] skip: OK
1058.86 s
[attoparsec] +++ OK, failed as expected. Falsified (after 6 tests and 15 shrinks):
1058.86 s
[attoparsec] 'a'
1058.86 s
[attoparsec] "a"
1058.86 s
[attoparsec] not ('a' < 'a')
1058.86 s
[attoparsec] skipWhile: OK
1058.86 s
[attoparsec] +++ OK, passed 100 tests.
1058.86 s
[attoparsec] string: OK
1058.86 s
[attoparsec] +++ OK, passed 100 tests.
1058.86 s
[attoparsec] strings: OK
1058.86 s
[attoparsec] +++ OK, passed 100 tests.
1058.86 s
[attoparsec] stringCI: OK
1058.86 s
[attoparsec] +++ OK, passed 100 tests.
1058.86 s
[attoparsec] take: OK
1058.86 s
[attoparsec] +++ OK, passed 100 tests.
1058.86 s
[attoparsec] takeText: OK
1058.87 s
[attoparsec] +++ OK, passed 100 tests.
1058.87 s
[attoparsec] takeCount: OK
1058.87 s
[attoparsec] +++ OK, passed 100 tests.
1058.87 s
[attoparsec] takeLazyText: OK
1058.87 s
[attoparsec] +++ OK, passed 100 tests.
1058.87 s
[attoparsec] takeTill: OK
1058.87 s
[attoparsec] +++ OK, passed 100 tests.
1058.87 s
[attoparsec] takeWhile: OK
1058.87 s
[attoparsec] +++ OK, passed 100 tests.
1058.87 s
[attoparsec] takeWhile1: OK
1058.87 s
[attoparsec] +++ OK, passed 100 tests.
1058.88 s
[attoparsec] takeWhile1_empty: OK
1058.88 s
[attoparsec] +++ OK, passed 1 test.
1058.88 s
[attoparsec] members: OK
1058.88 s
[attoparsec] +++ OK, passed 100 tests.
1058.90 s
[attoparsec] nonmembers: OK
1058.90 s
[attoparsec] +++ OK, passed 100 tests.
1058.90 s
[attoparsec] FastSet
1058.90 s
[attoparsec] membership is correct: OK
1058.90 s
[attoparsec] +++ OK, passed 100 tests.
1058.90 s
[attoparsec] Regressions
1058.90 s
[attoparsec] issue105: OK
1058.90 s
[attoparsec] +++ OK, passed 100 tests.
1058.90 s
[attoparsec]
1058.90 s
[attoparsec] All 70 tests passed (0.50s)
1058.91 s
[attoparsec] Test suite attoparsec-tests: PASS
1058.91 s
[attoparsec] Test suite logged to: dist/test/attoparsec-0.14.4-attoparsec-tests.log
1058.91 s
[attoparsec] 1 of 1 test suites (1 of 1 test cases) passed.
1058.93 s
[attoparsec] Phase: haddockPhase
1058.95 s
[attoparsec] Phase: installPhase
1059.26 s
[attoparsec] Installing internal library attoparsec-internal in /nix/store/nq4dl0wjnd4d6bvbxdxg2gfx5yy7gswd-attoparsec-0.14.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/attoparsec-0.14.4-EltmJBtr0Z5NUD2noq0wb-attoparsec-internal
1059.37 s
[attoparsec] Installing library in /nix/store/nq4dl0wjnd4d6bvbxdxg2gfx5yy7gswd-attoparsec-0.14.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/attoparsec-0.14.4-C7aHI3pddOC9iYSiyhYSYZ
1059.48 s
[unix-compat] Phase: fixupPhase
1059.52 s
[unix-compat] shrinking RPATHs of ELF executables and libraries in /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4
1059.54 s
[unix-compat] shrinking /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSunix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP-ghc9.8.1.so
1059.56 s
[unix-compat] checking for references to /build/ in /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4...
1059.60 s
[unix-compat] patching script interpreter paths in /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4
1059.61 s
[unix-compat] stripping (with command strip and flags -S -p) in /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4/lib
1059.92 s
[unix-compat] shrinking RPATHs of ELF executables and libraries in /nix/store/r5l7i6vzx4blz2nk85m14449smlrbd7j-unix-compat-0.7.4-doc
1059.96 s
[unix-compat] checking for references to /build/ in /nix/store/r5l7i6vzx4blz2nk85m14449smlrbd7j-unix-compat-0.7.4-doc...
1059.99 s
[unix-compat] patching script interpreter paths in /nix/store/r5l7i6vzx4blz2nk85m14449smlrbd7j-unix-compat-0.7.4-doc
1060.47 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4 /nix/store/r5l7i6vzx4blz2nk85m14449smlrbd7j-unix-compat-0.7.4-doc
1061.86 s
[post-build-hook] Pushing 1 paths (67 are already present) using zstd to cache sellout ⏳
1061.86 s
[post-build-hook]
1062.22 s
[post-build-hook] Pushing /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4 (205.50 KiB)
1063.24 s
[post-build-hook]
1063.24 s
[post-build-hook] All done.
1063.37 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4 /nix/store/r5l7i6vzx4blz2nk85m14449smlrbd7j-unix-compat-0.7.4-doc
1063.49 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1063.77 s
[post-build-hook] copying 2 paths...
1063.77 s
[post-build-hook] copying path '/nix/store/r5l7i6vzx4blz2nk85m14449smlrbd7j-unix-compat-0.7.4-doc' to 'https://cache.nix-ci.com'...
1064.11 s
[post-build-hook] copying path '/nix/store/i681k6cgxc3xg7xladccvnbf2px615ly-unix-compat-0.7.4' to 'https://cache.nix-ci.com'...
1064.54 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1064.87 s
[post-build-hook] copying 1 paths...
1064.87 s
[post-build-hook] copying path '/nix/store/4zi5vgcq6q3xbza88lll1mf3j64z4f9w-unix-compat-0.7.4.drv' to 'https://cache.nix-ci.com'...
1065.21 s
Progress: 82 of 171 built (11 building), 395 of 395 downloaded from cache
1065.41 s
Building filemanip
1065.41 s
[aeson] [11 of 32] Compiling Data.Aeson.Decoding.Internal ( src/Data/Aeson/Decoding/Internal.hs, dist/build/Data/Aeson/Decoding/Internal.o, dist/build/Data/Aeson/Decoding/Internal.dyn_o )
1065.41 s
[aeson] [12 of 32] Compiling Data.Aeson.Decoding.Text ( src/Data/Aeson/Decoding/Text.hs, dist/build/Data/Aeson/Decoding/Text.o, dist/build/Data/Aeson/Decoding/Text.dyn_o )
1065.41 s
[aeson] [13 of 32] Compiling Data.Aeson.Decoding.ByteString.Lazy ( src/Data/Aeson/Decoding/ByteString/Lazy.hs, dist/build/Data/Aeson/Decoding/ByteString/Lazy.o, dist/build/Data/Aeson/Decoding/ByteString/Lazy.dyn_o )
1065.41 s
[aeson] [14 of 32] Compiling Data.Aeson.Decoding.ByteString ( src/Data/Aeson/Decoding/ByteString.hs, dist/build/Data/Aeson/Decoding/ByteString.o, dist/build/Data/Aeson/Decoding/ByteString.dyn_o )
1065.41 s
[aeson] [15 of 32] Compiling Data.Aeson.KeyMap ( src/Data/Aeson/KeyMap.hs, dist/build/Data/Aeson/KeyMap.o, dist/build/Data/Aeson/KeyMap.dyn_o )
1065.41 s
[aeson] [16 of 32] Compiling Data.Aeson.Types.Generic ( src/Data/Aeson/Types/Generic.hs, dist/build/Data/Aeson/Types/Generic.o, dist/build/Data/Aeson/Types/Generic.dyn_o )
1065.41 s
[aeson] [17 of 32] Compiling Data.Aeson.Types.Internal ( src/Data/Aeson/Types/Internal.hs, dist/build/Data/Aeson/Types/Internal.o, dist/build/Data/Aeson/Types/Internal.dyn_o )
1065.41 s
[algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
1065.41 s
[algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
1065.41 s
[algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.p_o )
1065.41 s
[attoparsec] Phase: fixupPhase
1065.41 s
[attoparsec] shrinking RPATHs of ELF executables and libraries in /nix/store/nq4dl0wjnd4d6bvbxdxg2gfx5yy7gswd-attoparsec-0.14.4
1065.41 s
[attoparsec] shrinking /nix/store/nq4dl0wjnd4d6bvbxdxg2gfx5yy7gswd-attoparsec-0.14.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSattoparsec-0.14.4-C7aHI3pddOC9iYSiyhYSYZ-ghc9.8.1.so
1065.41 s
[attoparsec] shrinking /nix/store/nq4dl0wjnd4d6bvbxdxg2gfx5yy7gswd-attoparsec-0.14.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSattoparsec-0.14.4-EltmJBtr0Z5NUD2noq0wb-attoparsec-internal-ghc9.8.1.so
1065.41 s
[attoparsec] checking for references to /build/ in /nix/store/nq4dl0wjnd4d6bvbxdxg2gfx5yy7gswd-attoparsec-0.14.4...
1065.41 s
[attoparsec] patching script interpreter paths in /nix/store/nq4dl0wjnd4d6bvbxdxg2gfx5yy7gswd-attoparsec-0.14.4
1065.41 s
[attoparsec] stripping (with command strip and flags -S -p) in /nix/store/nq4dl0wjnd4d6bvbxdxg2gfx5yy7gswd-attoparsec-0.14.4/lib
1065.41 s
[filepattern] Documentation created: dist/doc/html/filepattern/,
1065.41 s
[filepattern] dist/doc/html/filepattern/filepattern.txt
1065.41 s
[filepattern] Preprocessing test suite 'filepattern-test' for filepattern-0.1.3..
1065.41 s
[filepattern] Phase: installPhase
1065.41 s
[filepattern] Installing library in /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d
1065.41 s
[filepattern] Phase: fixupPhase
1065.41 s
[filepattern] shrinking RPATHs of ELF executables and libraries in /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3
1065.41 s
[filepattern] shrinking /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSfilepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d-ghc9.8.1.so
1065.41 s
[filepattern] checking for references to /build/ in /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3...
1065.41 s
[filepattern] patching script interpreter paths in /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3
1065.41 s
[filepattern] stripping (with command strip and flags -S -p) in /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3/lib
1065.41 s
[filepattern] shrinking RPATHs of ELF executables and libraries in /nix/store/bkgqmf9jag7h58rl8kggmacjhn9xbrrx-filepattern-0.1.3-doc
1065.41 s
[filepattern] checking for references to /build/ in /nix/store/bkgqmf9jag7h58rl8kggmacjhn9xbrrx-filepattern-0.1.3-doc...
1065.41 s
[filepattern] patching script interpreter paths in /nix/store/bkgqmf9jag7h58rl8kggmacjhn9xbrrx-filepattern-0.1.3-doc
1065.41 s
[ghc-lib-parser-ex] [2 of 2] Compiling Paths_ghc_lib_parser_ex ( dist/build/ghc-lib-parser-ex-test/autogen/Paths_ghc_lib_parser_ex.hs, dist/build/ghc-lib-parser-ex-test/ghc-lib-parser-ex-test-tmp/Paths_ghc_lib_parser_ex.o )
1065.41 s
[ghc-lib-parser-ex] [3 of 3] Linking dist/build/ghc-lib-parser-ex-test/ghc-lib-parser-ex-test
1065.41 s
[keys] Haddock coverage:
1065.41 s
[keys] Warning: 'zip' is ambiguous. It is defined
1065.41 s
[keys] * in ‘Data.List.NonEmpty’
1065.41 s
[keys] * in ‘GHC.List’
1065.41 s
[keys] * in ‘Data.Sequence.Internal’
1065.41 s
[keys] * at src/Data/Key.hs:220:3
1065.41 s
[keys] You may be able to disambiguate the identifier by qualifying it or
1065.41 s
[keys] by specifying the type/value namespace explicitly.
1065.41 s
[keys] Defaulting to the one defined at src/Data/Key.hs:220:3
1065.41 s
[keys] Warning: 'mapWithKey' is ambiguous. It is defined
1065.41 s
[keys] * in ‘Data.IntMap.Internal’
1065.41 s
[keys] * in ‘Data.Map.Internal’
1065.41 s
[keys] * at src/Data/Key.hs:135:3
1065.41 s
[keys] * in ‘Data.HashMap.Internal’
1065.41 s
[keys] You may be able to disambiguate the identifier by qualifying it or
1065.41 s
[keys] by specifying the type/value namespace explicitly.
1065.41 s
[keys] Defaulting to the one defined at src/Data/Key.hs:135:3
1065.41 s
[keys] Warning: 'foldlWithKey' is ambiguous. It is defined
1065.41 s
[keys] * in ‘Data.IntMap.Internal’
1065.41 s
[keys] * in ‘Data.Map.Internal’
1065.41 s
[keys] * at src/Data/Key.hs:531:3
1065.41 s
[keys] * in ‘Data.HashMap.Internal’
1065.41 s
[keys] You may be able to disambiguate the identifier by qualifying it or
1065.41 s
[keys] by specifying the type/value namespace explicitly.
1065.41 s
[keys] Defaulting to the one defined at src/Data/Key.hs:531:3
1065.41 s
[keys] Warning: 'foldrWithKey' is ambiguous. It is defined
1065.41 s
[keys] * in ‘Data.IntMap.Internal’
1065.41 s
[keys] * in ‘Data.Map.Internal’
1065.41 s
[keys] * at src/Data/Key.hs:528:3
1065.41 s
[keys] * in ‘Data.HashMap.Internal’
1065.41 s
[keys] You may be able to disambiguate the identifier by qualifying it or
1065.41 s
[keys] by specifying the type/value namespace explicitly.
1065.41 s
[keys] Defaulting to the one defined at src/Data/Key.hs:528:3
1065.41 s
[keys] 30% ( 15 / 49) in 'Data.Key'
1065.41 s
[keys] Missing documentation for:
1065.41 s
[keys] Module header
1065.41 s
[keys] Key (src/Data/Key.hs:114)
1065.42 s
[keys] Keyed (src/Data/Key.hs:134)
1065.42 s
[keys] <#$> (src/Data/Key.hs:319)
1065.42 s
[keys] keyed (src/Data/Key.hs:323)
1065.42 s
[keys] ZipWithKey (src/Data/Key.hs:276)
1065.42 s
[keys] Indexable (src/Data/Key.hs:328)
1065.42 s
[keys] ! (src/Data/Key.hs:378)
1065.42 s
[keys] Lookup (src/Data/Key.hs:382)
1065.42 s
[keys] lookupDefault (src/Data/Key.hs:437)
1065.42 s
[keys] Adjustable (src/Data/Key.hs:441)
1065.42 s
[keys] FoldableWithKey (src/Data/Key.hs:521)
1065.42 s
[keys] foldrWithKey' (src/Data/Key.hs:584)
1065.42 s
[keys] foldlWithKey' (src/Data/Key.hs:589)
1065.42 s
[keys] foldrWithKeyM (src/Data/Key.hs:594)
1065.42 s
[keys] foldlWithKeyM (src/Data/Key.hs:599)
1065.42 s
[keys] traverseWithKey_ (src/Data/Key.hs:604)
1065.42 s
[keys] forWithKey_ (src/Data/Key.hs:608)
1065.42 s
[keys] mapWithKeyM_ (src/Data/Key.hs:612)
1065.42 s
[keys] forWithKeyM_ (src/Data/Key.hs:616)
1065.42 s
[keys] concatMapWithKey (src/Data/Key.hs:620)
1065.42 s
[keys] anyWithKey (src/Data/Key.hs:624)
1065.42 s
[keys] allWithKey (src/Data/Key.hs:628)
1065.42 s
[keys] findWithKey (src/Data/Key.hs:632)
1065.42 s
[keys] FoldableWithKey1 (src/Data/Key.hs:637)
1065.42 s
[keys] traverseWithKey1_ (src/Data/Key.hs:687)
1065.42 s
[keys] forWithKey1_ (src/Data/Key.hs:691)
1065.42 s
[keys] foldMapWithKeyDefault1 (src/Data/Key.hs:695)
1065.42 s
[keys] TraversableWithKey (src/Data/Key.hs:700)
1065.42 s
[keys] forWithKey (src/Data/Key.hs:754)
1065.42 s
[keys] forWithKeyM (src/Data/Key.hs:758)
1065.42 s
[keys] mapWithKeyDefault (src/Data/Key.hs:806)
1065.42 s
[keys] TraversableWithKey1 (src/Data/Key.hs:816)
1065.42 s
[keys] foldMapWithKey1Default (src/Data/Key.hs:854)
1065.42 s
[monoid-subclasses]
1065.42 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:208:77: warning : [ GHC-63394 ] [ -Wx-partial ]
1065.42 s
[monoid-subclasses] In the use of ‘tail’
1065.42 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
1065.42 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1065.42 s
[monoid-subclasses] |
1065.42 s
[monoid-subclasses] 208 | inits (a, b) = List.map (flip (,) mempty) (inits a) ++ List.map ((,) a) (List.tail $ inits b)
1065.42 s
[monoid-subclasses] | ^^^^^^^^^
1065.42 s
[monoid-subclasses]
1065.42 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:209:77: warning : [ GHC-63394 ] [ -Wx-partial ]
1065.42 s
[monoid-subclasses] In the use of ‘tail’
1065.42 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
1065.42 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1065.42 s
[monoid-subclasses] |
1065.42 s
[monoid-subclasses] 209 | tails (a, b) = List.map (flip (,) b) (tails a) ++ List.map ((,) mempty) (List.tail $ tails b)
1065.42 s
[monoid-subclasses] | ^^^^^^^^^
1065.42 s
[monoid-subclasses]
1065.42 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:252:59: warning : [ GHC-63394 ] [ -Wx-partial ]
1065.42 s
[monoid-subclasses] In the use of ‘tail’
1065.42 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
1065.42 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1065.42 s
[monoid-subclasses] |
1065.42 s
[monoid-subclasses] 252 | ++ List.map (\b1-> (a, b1, mempty)) (List.tail $ inits b)
1065.42 s
[monoid-subclasses] | ^^^^^^^^^
1065.42 s
[monoid-subclasses]
1065.42 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:253:54: warning : [ GHC-63394 ] [ -Wx-partial ]
1065.42 s
[monoid-subclasses] In the use of ‘tail’
1065.42 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
1065.42 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1065.42 s
[monoid-subclasses] |
1065.42 s
[monoid-subclasses] 253 | ++ List.map (\c1-> (a, b, c1)) (List.tail $ inits c)
1065.42 s
[monoid-subclasses] | ^^^^^^^^^
1065.42 s
[monoid-subclasses]
1065.42 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:255:59: warning : [ GHC-63394 ] [ -Wx-partial ]
1065.42 s
[monoid-subclasses] In the use of ‘tail’
1065.42 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
1065.42 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1065.42 s
[monoid-subclasses] |
1065.42 s
[monoid-subclasses] 255 | ++ List.map (\b1-> (mempty, b1, c)) (List.tail $ tails b)
1065.42 s
[monoid-subclasses] | ^^^^^^^^^
1065.42 s
[monoid-subclasses]
1065.42 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:256:64: warning : [ GHC-63394 ] [ -Wx-partial ]
1065.42 s
[monoid-subclasses] In the use of ‘tail’
1065.42 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
1065.42 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1065.42 s
[monoid-subclasses] |
1065.42 s
[unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.o, dist/build/Data/HashSet/Internal.dyn_o )
1065.42 s
[unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
1065.42 s
[unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.o, dist/build/Data/HashMap/Strict.dyn_o )
1065.89 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/nq4dl0wjnd4d6bvbxdxg2gfx5yy7gswd-attoparsec-0.14.4
1067.16 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1067.27 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/nq4dl0wjnd4d6bvbxdxg2gfx5yy7gswd-attoparsec-0.14.4
1067.55 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1067.63 s
[post-build-hook] copying 1 paths...
1067.63 s
[post-build-hook] copying path '/nix/store/nq4dl0wjnd4d6bvbxdxg2gfx5yy7gswd-attoparsec-0.14.4' to 'https://cache.nix-ci.com'...
1076.43 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1076.66 s
[post-build-hook] copying 0 paths...
1076.75 s
Progress: 83 of 171 built (11 building), 395 of 395 downloaded from cache
1076.98 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/bkgqmf9jag7h58rl8kggmacjhn9xbrrx-filepattern-0.1.3-doc /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3
1077.81 s
[post-build-hook] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
1077.81 s
[post-build-hook]
1078.15 s
[post-build-hook] Pushing /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3 (2.07 MiB)
1078.20 s
[post-build-hook] Pushing /nix/store/bkgqmf9jag7h58rl8kggmacjhn9xbrrx-filepattern-0.1.3-doc (641.35 KiB)
1079.09 s
[post-build-hook]
1079.09 s
[post-build-hook] All done.
1079.14 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/bkgqmf9jag7h58rl8kggmacjhn9xbrrx-filepattern-0.1.3-doc /nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3
1079.25 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1079.49 s
[post-build-hook] copying 2 paths...
1079.49 s
[post-build-hook] copying path '/nix/store/bkgqmf9jag7h58rl8kggmacjhn9xbrrx-filepattern-0.1.3-doc' to 'https://cache.nix-ci.com'...
1079.93 s
[post-build-hook] copying path '/nix/store/xhjankjrks67kp78w5wrp0wa8dcwnbzp-filepattern-0.1.3' to 'https://cache.nix-ci.com'...
1081.42 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1081.77 s
[post-build-hook] copying 1 paths...
1081.78 s
[post-build-hook] copying path '/nix/store/qsd0b2hdbp1l3dwaqcpk2ilwpbgcl8hg-filepattern-0.1.3.drv' to 'https://cache.nix-ci.com'...
1082.11 s
Progress: 84 of 172 built (10 building), 395 of 395 downloaded from cache
1082.11 s
[monoid-subclasses] 256 | ++ List.map (\c1-> (mempty, mempty, c1)) (List.tail $ tails c)
1082.11 s
[monoid-subclasses] | ^^^^^^^^^
1082.11 s
[monoid-subclasses]
1082.11 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:309:70: warning : [ GHC-63394 ] [ -Wx-partial ]
1082.11 s
[monoid-subclasses] In the use of ‘tail’
1082.11 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
1082.11 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1082.11 s
[monoid-subclasses] |
1082.11 s
[monoid-subclasses] 309 | ++ List.map (\b1-> (a, b1, mempty, mempty)) (List.tail $ inits b)
1082.11 s
[monoid-subclasses] | ^^^^^^^^^
1082.11 s
[monoid-subclasses]
1082.11 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:310:65: warning : [ GHC-63394 ] [ -Wx-partial ]
1082.11 s
[monoid-subclasses] In the use of ‘tail’
1082.11 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
1082.11 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1082.11 s
[monoid-subclasses] |
1082.11 s
[monoid-subclasses] 310 | ++ List.map (\c1-> (a, b, c1, mempty)) (List.tail $ inits c)
1082.11 s
[monoid-subclasses] | ^^^^^^^^^
1082.11 s
[monoid-subclasses]
1082.12 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:311:60: warning : [ GHC-63394 ] [ -Wx-partial ]
1082.12 s
[monoid-subclasses] In the use of ‘tail’
1082.12 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
1082.12 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1082.12 s
[monoid-subclasses] |
1082.12 s
[monoid-subclasses] 311 | ++ List.map (\d1-> (a, b, c, d1)) (List.tail $ inits d)
1082.12 s
[monoid-subclasses] | ^^^^^^^^^
1082.12 s
[monoid-subclasses]
1082.12 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:313:65: warning : [ GHC-63394 ] [ -Wx-partial ]
1082.12 s
[monoid-subclasses] In the use of ‘tail’
1082.12 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
1082.12 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1082.12 s
[monoid-subclasses] |
1082.12 s
[monoid-subclasses] 313 | ++ List.map (\b1-> (mempty, b1, c, d)) (List.tail $ tails b)
1082.12 s
[monoid-subclasses] | ^^^^^^^^^
1082.12 s
[monoid-subclasses]
1082.12 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:314:70: warning : [ GHC-63394 ] [ -Wx-partial ]
1082.12 s
[monoid-subclasses] In the use of ‘tail’
1082.12 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
1082.12 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1082.12 s
[monoid-subclasses] |
1082.12 s
[monoid-subclasses] 314 | ++ List.map (\c1-> (mempty, mempty, c1, d)) (List.tail $ tails c)
1082.12 s
[monoid-subclasses] | ^^^^^^^^^
1082.12 s
[monoid-subclasses]
1082.12 s
[monoid-subclasses] src/Data/Monoid/Factorial.hs:315:75: warning : [ GHC-63394 ] [ -Wx-partial ]
1082.12 s
[monoid-subclasses] In the use of ‘tail’
1082.12 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
1082.30 s
Building shake
1082.30 s
[adjunctions] Documentation created: dist/doc/html/adjunctions/,
1082.30 s
[adjunctions] dist/doc/html/adjunctions/adjunctions.txt
1082.30 s
[adjunctions] Preprocessing test suite 'spec' for adjunctions-4.4.3..
1082.30 s
[adjunctions] Phase: installPhase
1082.30 s
[adjunctions] Installing library in /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr
1082.30 s
[adjunctions] Phase: fixupPhase
1082.30 s
[adjunctions] shrinking RPATHs of ELF executables and libraries in /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3
1082.30 s
[adjunctions] shrinking /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSadjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr-ghc9.8.1.so
1082.30 s
[adjunctions] checking for references to /build/ in /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3...
1082.30 s
[adjunctions] patching script interpreter paths in /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3
1082.30 s
[adjunctions] stripping (with command strip and flags -S -p) in /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3/lib
1082.30 s
[adjunctions] shrinking RPATHs of ELF executables and libraries in /nix/store/bdg0d6qcw4p478b2jdglcwv7lr7g7qwr-adjunctions-4.4.3-doc
1082.30 s
[adjunctions] checking for references to /build/ in /nix/store/bdg0d6qcw4p478b2jdglcwv7lr7g7qwr-adjunctions-4.4.3-doc...
1082.30 s
[adjunctions] patching script interpreter paths in /nix/store/bdg0d6qcw4p478b2jdglcwv7lr7g7qwr-adjunctions-4.4.3-doc
1082.30 s
[aeson] [18 of 32] Compiling Data.Aeson.Parser.Time ( src/Data/Aeson/Parser/Time.hs, dist/build/Data/Aeson/Parser/Time.o, dist/build/Data/Aeson/Parser/Time.dyn_o )
1082.30 s
[aeson] [19 of 32] Compiling Data.Aeson.Encoding.Builder ( src/Data/Aeson/Encoding/Builder.hs, dist/build/Data/Aeson/Encoding/Builder.o, dist/build/Data/Aeson/Encoding/Builder.dyn_o )
1082.31 s
[aeson] [20 of 32] Compiling Data.Aeson.Encoding.Internal ( src/Data/Aeson/Encoding/Internal.hs, dist/build/Data/Aeson/Encoding/Internal.o, dist/build/Data/Aeson/Encoding/Internal.dyn_o )
1082.31 s
[aeson] [21 of 32] Compiling Data.Aeson.Encoding ( src/Data/Aeson/Encoding.hs, dist/build/Data/Aeson/Encoding.o, dist/build/Data/Aeson/Encoding.dyn_o )
1082.31 s
[aeson] [22 of 32] Compiling Data.Aeson.Decoding.Conversion ( src/Data/Aeson/Decoding/Conversion.hs, dist/build/Data/Aeson/Decoding/Conversion.o, dist/build/Data/Aeson/Decoding/Conversion.dyn_o )
1082.31 s
[aeson] [23 of 32] Compiling Data.Aeson.Types.FromJSON ( src/Data/Aeson/Types/FromJSON.hs, dist/build/Data/Aeson/Types/FromJSON.o, dist/build/Data/Aeson/Types/FromJSON.dyn_o )
1082.31 s
[algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.p_o )
1082.31 s
[algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.p_o )
1082.31 s
[algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
1082.31 s
[algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.p_o )
1082.31 s
[algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.p_o )
1082.31 s
[algebraic-graphs]
1082.31 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning : [ GHC-63394 ] [ -Wx-partial ]
1082.31 s
[algebraic-graphs] In the use of ‘head’
1082.31 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1082.31 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1082.31 s
[algebraic-graphs] |
1082.31 s
[algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
1082.31 s
[algebraic-graphs] | ^^^^
1082.31 s
[algebraic-graphs]
1082.31 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1082.31 s
[algebraic-graphs] In the use of ‘tail’
1082.31 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1082.31 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1082.31 s
[algebraic-graphs] |
1082.31 s
[algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
1082.31 s
[algebraic-graphs] | ^^^^
1082.31 s
[algebraic-graphs]
1082.31 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning : [ GHC-63394 ] [ -Wx-partial ]
1082.31 s
[algebraic-graphs] In the use of ‘head’
1082.31 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1082.31 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1082.31 s
[algebraic-graphs] |
1082.31 s
[algebraic-graphs] 395 | p_v = fst $ head bnd
1082.31 s
[algebraic-graphs] | ^^^^
1082.31 s
[algebraic-graphs]
1082.31 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1082.31 s
[algebraic-graphs] In the use of ‘tail’
1082.31 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1082.31 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1082.31 s
[algebraic-graphs] |
1082.31 s
[algebraic-graphs] 397 | bnd' = tail bnd
1082.31 s
[algebraic-graphs] | ^^^^
1082.31 s
[algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.p_o )
1082.31 s
[algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
1082.31 s
[algebraic-graphs]
1082.31 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1082.31 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1082.31 s
[algebraic-graphs] will become an error in a future GHC release.
1082.31 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1082.31 s
[algebraic-graphs] |
1082.31 s
[algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
1082.31 s
[filemanip] Phase: setupCompilerEnvironmentPhase
1082.31 s
[filemanip] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1082.31 s
[filemanip] Phase: unpackPhase
1082.31 s
[filemanip] unpacking source archive /nix/store/i2isam3p7fq23gx5sg3h6p6sp674yhky-filemanip-0.3.6.3.tar.gz
1082.31 s
[filemanip] source root is filemanip-0.3.6.3
1082.31 s
[filemanip] setting SOURCE_DATE_EPOCH to timestamp 1421796843 of file "filemanip-0.3.6.3/System/FilePath/Manip.hs"
1082.31 s
[filemanip] Phase: patchPhase
1082.31 s
[filemanip] Replace Cabal file with edited version from mirror://hackage/filemanip-0.3.6.3/revision/1.cabal.
1082.31 s
[filemanip] Phase: compileBuildDriverPhase
1082.31 s
[filemanip] setupCompileFlags: -package-db=/build/tmp.RLL9lcQx5s/setup-package.conf.d -threaded
1082.31 s
[filemanip] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.RLL9lcQx5s/Main.o )
1082.31 s
[filemanip] [2 of 2] Linking Setup
1082.31 s
[filemanip] Phase: updateAutotoolsGnuConfigScriptsPhase
1082.31 s
[filemanip] Phase: configurePhase
1082.31 s
[filemanip] configureFlags: --verbose --prefix=/nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/m8q2nr3z7kchw6ajj5lgwmchrm0bv9pc-filemanip-0.3.6.3-doc/share/doc/filemanip-0.3.6.3 --with-gcc=gcc --package-db=/build/tmp.RLL9lcQx5s/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1082.31 s
[filemanip] Using Parsec parser
1082.31 s
[filemanip] Configuring filemanip-0.3.6.3...
1082.31 s
[filemanip] Dependency base >=4 && <5: using base-4.19.0.0
1082.31 s
[filemanip] Dependency bytestring: using bytestring-0.12.0.2
1082.31 s
[filemanip] Dependency directory: using directory-1.3.8.1
1082.31 s
[filemanip] Dependency filepath: using filepath-1.4.100.4
1082.31 s
[filemanip] Dependency mtl: using mtl-2.3.1
1082.31 s
[filemanip] Dependency unix-compat >=0.3: using unix-compat-0.7.4
1082.31 s
[filemanip] Source component graph: component lib
1082.31 s
[filemanip] Configured component graph:
1082.31 s
[filemanip] component filemanip-0.3.6.3-LjsWJolbYIH3RY2BS86jtt
1082.31 s
[filemanip] include base-4.19.0.0-b960
1082.31 s
[filemanip] include bytestring-0.12.0.2-4690
1082.31 s
[filemanip] include directory-1.3.8.1-6a8e
1082.31 s
[filemanip] include filepath-1.4.100.4-fa1c
1082.31 s
[filemanip] include mtl-2.3.1-63a4
1082.31 s
[filemanip] include unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP
1082.31 s
[filemanip] Linked component graph:
1082.31 s
[filemanip] unit filemanip-0.3.6.3-LjsWJolbYIH3RY2BS86jtt
1082.31 s
[filemanip] include base-4.19.0.0-b960
1082.32 s
[filemanip] include bytestring-0.12.0.2-4690
1082.32 s
[filemanip] include directory-1.3.8.1-6a8e
1082.32 s
[filemanip] include filepath-1.4.100.4-fa1c
1082.32 s
[filemanip] include mtl-2.3.1-63a4
1082.32 s
[filemanip] include unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP
1082.32 s
[filemanip] System.FilePath.Find=filemanip-0.3.6.3-LjsWJolbYIH3RY2BS86jtt:System.FilePath.Find,System.FilePath.Glob=filemanip-0.3.6.3-LjsWJolbYIH3RY2BS86jtt:System.FilePath.Glob,System.FilePath.GlobPattern=filemanip-0.3.6.3-LjsWJolbYIH3RY2BS86jtt:System.FilePath.GlobPattern,System.FilePath.Manip=filemanip-0.3.6.3-LjsWJolbYIH3RY2BS86jtt:System.FilePath.Manip
1082.32 s
[filemanip] Ready component graph:
1082.32 s
[filemanip] definite filemanip-0.3.6.3-LjsWJolbYIH3RY2BS86jtt
1082.32 s
[filemanip] depends base-4.19.0.0-b960
1082.32 s
[filemanip] depends bytestring-0.12.0.2-4690
1082.32 s
[filemanip] depends directory-1.3.8.1-6a8e
1082.32 s
[filemanip] depends filepath-1.4.100.4-fa1c
1082.32 s
[filemanip] depends mtl-2.3.1-63a4
1082.32 s
[filemanip] depends unix-compat-0.7.4-Iz2j0DpfCH6FjDLc34mHUP
1082.32 s
[filemanip] Using Cabal-3.10.2.0 compiled by ghc-9.8
1082.32 s
[filemanip] Using compiler: ghc-9.8.1
1082.32 s
[filemanip] Using install prefix:
1082.32 s
[filemanip] /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3
1082.32 s
[ghc-lib-parser-ex] buildPhase completed in 47 seconds
1082.32 s
[ghc-lib-parser-ex] Phase: checkPhase
1082.32 s
[ghc-lib-parser-ex] Running 1 test suites...
1082.32 s
[ghc-lib-parser-ex] Test suite ghc-lib-parser-ex-test: RUNNING...
1082.32 s
[ghc-lib-parser-ex] All tests
1082.32 s
[ghc-lib-parser-ex] Parse tests
1082.32 s
[ghc-lib-parser-ex] Module: OK
1082.32 s
[ghc-lib-parser-ex] Module: OK
1082.32 s
[ghc-lib-parser-ex] Signature: OK
1082.32 s
[ghc-lib-parser-ex] Import: OK
1082.32 s
[ghc-lib-parser-ex] Statement: OK
1082.32 s
[ghc-lib-parser-ex] Backpack: OK
1082.32 s
[ghc-lib-parser-ex] Expression: OK
1082.32 s
[ghc-lib-parser-ex] Declaration (1): OK
1082.32 s
[ghc-lib-parser-ex] Declaration (2): OK
1082.32 s
[ghc-lib-parser-ex] File: OK
1082.32 s
[ghc-lib-parser-ex] Fixity tests
1082.32 s
[ghc-lib-parser-ex] Expression: OK
1082.32 s
[ghc-lib-parser-ex] Pattern: OK (0.01s)
1082.32 s
[ghc-lib-parser-ex] fixitiesFromModule: OK
1082.32 s
[ghc-lib-parser-ex] Extend instances tests
1082.32 s
[ghc-lib-parser-ex] Eq, Ord: OK
1082.32 s
[ghc-lib-parser-ex] Expression predicate tests
1082.32 s
[ghc-lib-parser-ex] isTag: OK
1082.32 s
[ghc-lib-parser-ex] isTag: OK
1082.32 s
[ghc-lib-parser-ex] isDol: OK
1082.32 s
[ghc-lib-parser-ex] isDot: OK
1082.32 s
[ghc-lib-parser-ex] isReturn: OK
1082.32 s
[ghc-lib-parser-ex] isReturn: OK
1082.32 s
[ghc-lib-parser-ex] isSection: OK
1082.32 s
[ghc-lib-parser-ex] isSection: OK
1082.32 s
[ghc-lib-parser-ex] isRecConstr: OK
1082.32 s
[ghc-lib-parser-ex] isRecUpdate: OK
1082.32 s
[ghc-lib-parser-ex] isVar: OK
1082.32 s
[ghc-lib-parser-ex] isVar: OK
1082.32 s
[ghc-lib-parser-ex] isPar: OK
1082.32 s
[ghc-lib-parser-ex] isPar: OK
1082.32 s
[ghc-lib-parser-ex] isApp: OK
1082.32 s
[ghc-lib-parser-ex] isApp: OK
1082.32 s
[ghc-lib-parser-ex] isOpApp: OK
1082.32 s
[ghc-lib-parser-ex] isOpApp: OK
1082.32 s
[ghc-lib-parser-ex] isAnyApp: OK
1082.32 s
[ghc-lib-parser-ex] isAnyApp: OK
1082.32 s
[ghc-lib-parser-ex] isAnyApp: OK
1082.32 s
[ghc-lib-parser-ex] isDo: OK
1082.32 s
[ghc-lib-parser-ex] isDo: OK
1082.32 s
[ghc-lib-parser-ex] isAnyApp: OK
1082.32 s
[ghc-lib-parser-ex] isLexeme: OK
1082.32 s
[ghc-lib-parser-ex] isLexeme: OK
1082.32 s
[ghc-lib-parser-ex] isLexeme: OK
1082.32 s
[ghc-lib-parser-ex] isLambda: OK
1082.32 s
[ghc-lib-parser-ex] isLambda: OK
1082.32 s
[ghc-lib-parser-ex] isLambda: OK
1082.32 s
[ghc-lib-parser-ex] isDotApp: OK
1082.32 s
[ghc-lib-parser-ex] isDotApp: OK
1082.32 s
[ghc-lib-parser-ex] isTypeApp: OK
1082.32 s
[ghc-lib-parser-ex] isTypeApp: OK
1082.32 s
[ghc-lib-parser-ex] isTypeApp: OK
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK (0.04s)
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK
1082.32 s
[ghc-lib-parser-ex] isWHNF: OK
1082.32 s
[ghc-lib-parser-ex] isLCase: OK
1082.32 s
[ghc-lib-parser-ex] isLCase: OK
1082.32 s
[ghc-lib-parser-ex] isSpliceDecl: OK
1082.32 s
[ghc-lib-parser-ex] isSpliceDecl: OK
1082.32 s
[ghc-lib-parser-ex] isSpliceDecl: OK
1082.32 s
[ghc-lib-parser-ex] isTypedSplice: OK
1082.32 s
[ghc-lib-parser-ex] isTypedSplice: OK
1082.32 s
[ghc-lib-parser-ex] isUntypedSplice: OK
1082.32 s
[ghc-lib-parser-ex] isUntypedSplice: OK
1082.32 s
[ghc-lib-parser-ex] isQuasiQuoteExpr: OK
1082.32 s
[ghc-lib-parser-ex] isQuasiQuoteExpr: OK
1082.32 s
[ghc-lib-parser-ex] isWholeFrac: OK
1082.32 s
[ghc-lib-parser-ex] isWholeFrac: OK
1082.32 s
[ghc-lib-parser-ex] isMDo: OK
1082.32 s
[ghc-lib-parser-ex] isListComp (1): OK
1082.32 s
[ghc-lib-parser-ex] isListComp (2): OK
1082.32 s
[ghc-lib-parser-ex] isMonadComp (0): OK
1082.32 s
[ghc-lib-parser-ex] isMonadComp (1): OK
1082.32 s
[ghc-lib-parser-ex] isMonadComp (2): OK
1082.32 s
[ghc-lib-parser-ex] isMonadComp (3): OK
1082.32 s
[ghc-lib-parser-ex] strToVar: OK
1082.32 s
[ghc-lib-parser-ex] varToStr: OK
1082.32 s
[ghc-lib-parser-ex] varToStr: OK
1082.32 s
[ghc-lib-parser-ex] varToStr: OK
1082.32 s
[ghc-lib-parser-ex] isLetStmt: OK
1082.32 s
[ghc-lib-parser-ex] isLetStmt: OK
1082.32 s
[ghc-lib-parser-ex] isRecStmt: OK
1082.32 s
[ghc-lib-parser-ex] isRecStmt: OK
1082.32 s
[ghc-lib-parser-ex] Declaration predicate tests
1082.32 s
[ghc-lib-parser-ex] isStrictMatch: OK
1082.32 s
[ghc-lib-parser-ex] isStrictMatch: OK
1082.32 s
[keys] Documentation created: dist/doc/html/keys/, dist/doc/html/keys/keys.txt
1082.32 s
[keys] Phase: installPhase
1082.32 s
[keys] Installing library in /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/keys-3.12.4-9pIWSPQD3dgEmDN6rrDseM
1082.32 s
[keys] Phase: fixupPhase
1082.32 s
[keys] shrinking RPATHs of ELF executables and libraries in /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4
1082.32 s
[keys] shrinking /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSkeys-3.12.4-9pIWSPQD3dgEmDN6rrDseM-ghc9.8.1.so
1082.32 s
[keys] checking for references to /build/ in /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4...
1082.32 s
[keys] patching script interpreter paths in /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4
1082.32 s
[keys] stripping (with command strip and flags -S -p) in /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4/lib
1082.32 s
[keys] shrinking RPATHs of ELF executables and libraries in /nix/store/zvn09w2f3hwsy03yx28ln0pfl2y9154r-keys-3.12.4-doc
1082.32 s
[keys] checking for references to /build/ in /nix/store/zvn09w2f3hwsy03yx28ln0pfl2y9154r-keys-3.12.4-doc...
1082.32 s
[keys] patching script interpreter paths in /nix/store/zvn09w2f3hwsy03yx28ln0pfl2y9154r-keys-3.12.4-doc
1082.32 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1082.33 s
[monoid-subclasses] |
1082.33 s
[monoid-subclasses] 315 | ++ List.map (\d1-> (mempty, mempty, mempty, d1)) (List.tail $ tails d)
1082.33 s
[monoid-subclasses] | ^^^^^^^^^
1082.33 s
[monoid-subclasses] [ 9 of 16] Compiling Data.Monoid.Textual ( src/Data/Monoid/Textual.hs, nothing )
1082.33 s
[monoid-subclasses] [10 of 16] Compiling Data.Monoid.Instances.CharVector ( src/Data/Monoid/Instances/CharVector.hs, nothing )
1082.33 s
[monoid-subclasses] [11 of 16] Compiling Data.Monoid.Instances.Stateful ( src/Data/Monoid/Instances/Stateful.hs, nothing )
1082.33 s
[monoid-subclasses]
1082.33 s
[monoid-subclasses] src/Data/Monoid/Instances/Stateful.hs:27:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1082.33 s
[monoid-subclasses] The import of ‘Data.Semigroup’ is redundant
1082.33 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Semigroup’
1082.33 s
[monoid-subclasses] To import instances alone, use: import Data.Semigroup()
1082.33 s
[monoid-subclasses] |
1082.33 s
[monoid-subclasses] 27 | import Data.Semigroup (Semigroup(..))
1082.33 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1082.33 s
[monoid-subclasses]
1082.33 s
[monoid-subclasses] src/Data/Monoid/Instances/Stateful.hs:28:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1082.33 s
[monoid-subclasses] The import of ‘Data.Monoid’ is redundant
1082.33 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Monoid’
1082.33 s
[monoid-subclasses] To import instances alone, use: import Data.Monoid()
1082.33 s
[monoid-subclasses] |
1082.33 s
[monoid-subclasses] 28 | import Data.Monoid (Monoid(..))
1082.33 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1082.33 s
[monoid-subclasses] [12 of 16] Compiling Data.Monoid.Instances.PrefixMemory ( src/Data/Monoid/Instances/PrefixMemory.hs, nothing )
1082.33 s
[monoid-subclasses]
1082.33 s
[monoid-subclasses] src/Data/Monoid/Instances/PrefixMemory.hs:20:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1082.33 s
[monoid-subclasses] The import of ‘Data.Semigroup’ is redundant
1082.33 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Semigroup’
1082.33 s
[monoid-subclasses] To import instances alone, use: import Data.Semigroup()
1082.33 s
[monoid-subclasses] |
1082.33 s
[monoid-subclasses] 20 | import Data.Semigroup (Semigroup(..))
1082.33 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1082.33 s
[monoid-subclasses]
1082.33 s
[monoid-subclasses] src/Data/Monoid/Instances/PrefixMemory.hs:21:21: warning : [ GHC-38856 ] [ -Wunused-imports ]
1082.33 s
[monoid-subclasses] The import of ‘Monoid’ from module ‘Data.Monoid’ is redundant
1082.33 s
[monoid-subclasses] |
1082.33 s
[monoid-subclasses] 21 | import Data.Monoid (Monoid(..) , Endo(..))
1082.33 s
[monoid-subclasses] | ^^^^^^^^^^
1082.33 s
[monoid-subclasses]
1082.33 s
[monoid-subclasses] src/Data/Monoid/Instances/PrefixMemory.hs:106:40: warning : [ GHC-63394 ] [ -Wx-partial ]
1082.33 s
[monoid-subclasses] In the use of ‘tail’
1082.33 s
[monoid-subclasses] (imported from Data.List, but defined in GHC.List):
1082.33 s
[monoid-subclasses] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1082.33 s
[monoid-subclasses] |
1082.33 s
[monoid-subclasses] 106 | factors (Shadowed p c) = rewrap <$> List.tail (inits c)
1082.33 s
[monoid-subclasses] | ^^^^^^^^^
1082.33 s
[monoid-subclasses] [13 of 16] Compiling Data.Monoid.Instances.Positioned ( src/Data/Monoid/Instances/Positioned.hs, nothing )
1082.33 s
[monoid-subclasses]
1082.33 s
[monoid-subclasses] src/Data/Monoid/Instances/Positioned.hs:33:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1082.33 s
[monoid-subclasses] The import of ‘Data.Semigroup’ is redundant
1082.33 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Semigroup’
1082.33 s
[monoid-subclasses] To import instances alone, use: import Data.Semigroup()
1082.33 s
[monoid-subclasses] |
1082.33 s
[regex-tdfa] Documentation created: dist/doc/html/regex-tdfa/,
1082.33 s
[regex-tdfa] dist/doc/html/regex-tdfa/regex-tdfa.txt
1082.33 s
[regex-tdfa] Preprocessing test suite 'regex-tdfa-unittest' for regex-tdfa-1.3.2.3..
1082.33 s
[regex-tdfa] Preprocessing test suite 'doctest' for regex-tdfa-1.3.2.3..
1082.33 s
[regex-tdfa] haddockPhase completed in 31 seconds
1082.33 s
[regex-tdfa] Phase: installPhase
1082.33 s
[regex-tdfa] Installing library in /nix/store/szxiys85w2xdqr800bm77386ha7i1s5v-regex-tdfa-1.3.2.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/regex-tdfa-1.3.2.3-AkYTgc8l27U9EvdFIYXjru
1082.33 s
[regex-tdfa] Phase: fixupPhase
1082.33 s
[regex-tdfa] shrinking RPATHs of ELF executables and libraries in /nix/store/szxiys85w2xdqr800bm77386ha7i1s5v-regex-tdfa-1.3.2.3
1082.33 s
[regex-tdfa] shrinking /nix/store/szxiys85w2xdqr800bm77386ha7i1s5v-regex-tdfa-1.3.2.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSregex-tdfa-1.3.2.3-AkYTgc8l27U9EvdFIYXjru-ghc9.8.1.so
1082.33 s
[regex-tdfa] checking for references to /build/ in /nix/store/szxiys85w2xdqr800bm77386ha7i1s5v-regex-tdfa-1.3.2.3...
1082.33 s
[regex-tdfa] patching script interpreter paths in /nix/store/szxiys85w2xdqr800bm77386ha7i1s5v-regex-tdfa-1.3.2.3
1082.33 s
[regex-tdfa] stripping (with command strip and flags -S -p) in /nix/store/szxiys85w2xdqr800bm77386ha7i1s5v-regex-tdfa-1.3.2.3/lib
1082.33 s
[regex-tdfa] shrinking RPATHs of ELF executables and libraries in /nix/store/qb0yv8aj8nbg00rz87xhzwicsdaxgz78-regex-tdfa-1.3.2.3-doc
1082.33 s
[regex-tdfa] checking for references to /build/ in /nix/store/qb0yv8aj8nbg00rz87xhzwicsdaxgz78-regex-tdfa-1.3.2.3-doc...
1082.33 s
[regex-tdfa] patching script interpreter paths in /nix/store/qb0yv8aj8nbg00rz87xhzwicsdaxgz78-regex-tdfa-1.3.2.3-doc
1082.33 s
[unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.o, dist/build/Data/HashMap/Lazy.dyn_o )
1082.33 s
[unordered-containers]
1082.33 s
[unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning : [ GHC-53692 ] [ -Wdeprecated-flags ]
1082.33 s
[unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
1082.33 s
[unordered-containers] |
1082.33 s
[unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
1082.33 s
[unordered-containers] | ^^^^^^^^^^
1082.33 s
[unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
1082.33 s
[unordered-containers]
1082.33 s
[unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning : [ GHC-66111 ] [ -Wunused-imports ]
1082.33 s
[unordered-containers] The import of ‘Control.Applicative’ is redundant
1082.33 s
[unordered-containers] except perhaps to import instances from ‘Control.Applicative’
1082.33 s
[unordered-containers] To import instances alone, use: import Control.Applicative()
1082.33 s
[unordered-containers] |
1082.33 s
[unordered-containers] 83 | import Control.Applicative (liftA2)
1082.33 s
[unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1082.33 s
[unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
1082.33 s
[unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
1082.60 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/bdg0d6qcw4p478b2jdglcwv7lr7g7qwr-adjunctions-4.4.3-doc /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3
1083.94 s
[post-build-hook] Pushing 3 paths (105 are already present) using zstd to cache sellout ⏳
1083.94 s
[post-build-hook]
1084.28 s
[post-build-hook] Pushing /nix/store/bdg0d6qcw4p478b2jdglcwv7lr7g7qwr-adjunctions-4.4.3-doc (2.01 MiB)
1084.45 s
[post-build-hook] Pushing /nix/store/qsaszbis1va1b5rvl1fprydx0zad37h2-nghttp2-1.65.0-lib (217.45 KiB)
1084.48 s
[post-build-hook] Pushing /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3 (6.02 MiB)
1085.68 s
[post-build-hook]
1085.68 s
[post-build-hook] All done.
1085.80 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/bdg0d6qcw4p478b2jdglcwv7lr7g7qwr-adjunctions-4.4.3-doc /nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3
1086.23 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1086.55 s
[post-build-hook] copying 6 paths...
1086.56 s
[post-build-hook] copying path '/nix/store/bdg0d6qcw4p478b2jdglcwv7lr7g7qwr-adjunctions-4.4.3-doc' to 'https://cache.nix-ci.com'...
1086.56 s
[post-build-hook] copying path '/nix/store/q162vdm3yx1zcpn1xwkww8s6d7z4bxzk-semigroups-0.20-doc' to 'https://cache.nix-ci.com'...
1086.56 s
[post-build-hook] copying path '/nix/store/0r0ma0iyln55sxrqr7rn5j7l4jfs2hiv-void-0.7.3-doc' to 'https://cache.nix-ci.com'...
1086.89 s
[post-build-hook] copying path '/nix/store/kig3gfc89b25ijk30d0d86aaph4mgxmp-void-0.7.3' to 'https://cache.nix-ci.com'...
1086.99 s
[post-build-hook] copying path '/nix/store/7glpzg93h2y86ff7vgnl584dnfyh3idl-semigroups-0.20' to 'https://cache.nix-ci.com'...
1087.55 s
[post-build-hook] copying path '/nix/store/rk98zxzr81qhrbqcilvqd8qlmflvwybi-adjunctions-4.4.3' to 'https://cache.nix-ci.com'...
1090.95 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1091.32 s
[post-build-hook] copying 2 paths...
1091.32 s
[post-build-hook] copying path '/nix/store/hg51ip4pm6a3djh62rzrim6l98l5mysy-semigroups-0.20.drv' to 'https://cache.nix-ci.com'...
1091.51 s
[post-build-hook] copying path '/nix/store/nq8sg71ixrb1iqx9h4sm5hf33k6hdv84-adjunctions-4.4.3.drv' to 'https://cache.nix-ci.com'...
1091.80 s
Progress: 85 of 171 built (10 building), 395 of 395 downloaded from cache
1091.80 s
[algebraic-graphs] | ^
1091.80 s
[algebraic-graphs]
1091.80 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1091.80 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1091.80 s
[algebraic-graphs] will become an error in a future GHC release.
1091.80 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1091.80 s
[algebraic-graphs] |
1091.80 s
[algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1091.80 s
[algebraic-graphs] | ^
1091.80 s
[algebraic-graphs]
1091.80 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1091.80 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1091.80 s
[algebraic-graphs] will become an error in a future GHC release.
1091.80 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1091.80 s
[algebraic-graphs] |
1091.80 s
[algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1091.80 s
[algebraic-graphs] | ^
1091.80 s
[algebraic-graphs]
1091.80 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1091.80 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1091.80 s
[algebraic-graphs] will become an error in a future GHC release.
1091.80 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1091.80 s
[algebraic-graphs] |
1091.80 s
[algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1091.80 s
[algebraic-graphs] | ^
1091.80 s
[algebraic-graphs]
1091.80 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1091.80 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1091.80 s
[algebraic-graphs] will become an error in a future GHC release.
1091.80 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1091.80 s
[algebraic-graphs] |
1091.80 s
[algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1091.80 s
[algebraic-graphs] | ^
1091.80 s
[algebraic-graphs]
1091.80 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1091.80 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1091.80 s
[algebraic-graphs] will become an error in a future GHC release.
1091.80 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1091.80 s
[algebraic-graphs] |
1091.80 s
[algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1091.80 s
[algebraic-graphs] | ^
1091.80 s
[algebraic-graphs]
1091.80 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1091.80 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1091.80 s
[algebraic-graphs] will become an error in a future GHC release.
1091.80 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1091.80 s
[algebraic-graphs] |
1091.80 s
[algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1091.80 s
[algebraic-graphs] | ^
1091.80 s
[algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
1091.80 s
[algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.p_o )
1091.80 s
[algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
1091.80 s
[algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.p_o )
1091.80 s
[algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
1091.80 s
[filemanip] Executables installed in:
1091.80 s
[filemanip] /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3/bin
1091.80 s
[filemanip] Libraries installed in:
1091.80 s
[filemanip] /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/filemanip-0.3.6.3-LjsWJolbYIH3RY2BS86jtt
1091.80 s
[filemanip] Dynamic Libraries installed in:
1091.80 s
[filemanip] /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1091.80 s
[filemanip] Private executables installed in:
1091.80 s
[filemanip] /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3/libexec/x86_64-linux-ghc-9.8.1/filemanip-0.3.6.3
1091.80 s
[filemanip] Data files installed in:
1091.80 s
[filemanip] /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3/share/x86_64-linux-ghc-9.8.1/filemanip-0.3.6.3
1091.80 s
[filemanip] Documentation installed in:
1091.80 s
[filemanip] /nix/store/m8q2nr3z7kchw6ajj5lgwmchrm0bv9pc-filemanip-0.3.6.3-doc/share/doc/filemanip-0.3.6.3
1091.81 s
[filemanip] Configuration files installed in:
1091.81 s
[filemanip] /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3/etc
1091.81 s
[filemanip] No alex found
1091.81 s
[filemanip] Using ar found on system at:
1091.81 s
[filemanip] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1091.81 s
[filemanip] No c2hs found
1091.81 s
[filemanip] No cpphs found
1091.81 s
[filemanip] No doctest found
1091.81 s
[filemanip] Using gcc version 14.3.0 given by user at:
1091.81 s
[filemanip] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1091.81 s
[filemanip] Using ghc version 9.8.1 found on system at:
1091.81 s
[filemanip] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1091.81 s
[filemanip] Using ghc-pkg version 9.8.1 found on system at:
1091.81 s
[filemanip] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1091.81 s
[filemanip] No ghcjs found
1091.81 s
[filemanip] No ghcjs-pkg found
1091.81 s
[filemanip] No greencard found
1091.81 s
[filemanip] Using haddock version 2.30.0 found on system at:
1091.81 s
[filemanip] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1091.81 s
[filemanip] No happy found
1091.81 s
[filemanip] Using haskell-suite found on system at: haskell-suite-dummy-location
1091.81 s
[filemanip] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1091.81 s
[filemanip] No hmake found
1091.81 s
[filemanip] Using hpc version 0.69 found on system at:
1091.81 s
[filemanip] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1091.81 s
[filemanip] Using hsc2hs version 0.68.10 found on system at:
1091.81 s
[filemanip] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1091.81 s
[filemanip] Using hscolour version 1.25 found on system at:
1091.81 s
[filemanip] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1091.81 s
[filemanip] No jhc found
1091.81 s
[filemanip] Using ld found on system at:
1091.81 s
[filemanip] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1091.81 s
[filemanip] No pkg-config found
1091.81 s
[filemanip] Using runghc version 9.8.1 found on system at:
1091.81 s
[filemanip] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1091.81 s
[filemanip] Using strip version 2.44 found on system at:
1091.81 s
[filemanip] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1091.81 s
[filemanip] Using tar found on system at:
1091.81 s
[filemanip] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1091.81 s
[filemanip] No uhc found
1091.81 s
[filemanip] Phase: buildPhase
1091.81 s
[filemanip] Preprocessing library for filemanip-0.3.6.3..
1091.81 s
[filemanip] Building library for filemanip-0.3.6.3..
1091.81 s
[filemanip] [1 of 4] Compiling System.FilePath.GlobPattern ( System/FilePath/GlobPattern.hs, dist/build/System/FilePath/GlobPattern.o, dist/build/System/FilePath/GlobPattern.dyn_o )
1091.81 s
[filemanip]
1091.81 s
[filemanip] System/FilePath/GlobPattern.hs:130:49: warning : [ GHC-63394 ] [ -Wx-partial ]
1091.81 s
[filemanip] In the use of ‘head’
1091.81 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1091.81 s
[filemanip] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1091.81 s
[filemanip] |
1091.81 s
[filemanip] 130 | | otherwise = let hs = map head ss
1091.81 s
[filemanip] | ^^^^
1091.81 s
[filemanip]
1091.81 s
[filemanip] System/FilePath/GlobPattern.hs:131:44: warning : [ GHC-63394 ] [ -Wx-partial ]
1091.81 s
[filemanip] In the use of ‘head’
1091.81 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1091.81 s
[filemanip] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1091.81 s
[filemanip] |
1091.81 s
[ghc-lib-parser-ex] Type predicate tests
1091.81 s
[ghc-lib-parser-ex] isKindTyApp: OK
1091.81 s
[ghc-lib-parser-ex] isKindTyApp: OK
1091.81 s
[ghc-lib-parser-ex] Pattern predicate tests
1091.81 s
[ghc-lib-parser-ex] patToStr: OK
1091.81 s
[ghc-lib-parser-ex] patToStr: OK
1091.81 s
[ghc-lib-parser-ex] patToStr: OK
1091.81 s
[ghc-lib-parser-ex] strToPat: OK
1091.81 s
[ghc-lib-parser-ex] strToPat: OK
1091.81 s
[ghc-lib-parser-ex] strToPat: OK
1091.81 s
[ghc-lib-parser-ex] fromPChar: OK
1091.81 s
[ghc-lib-parser-ex] fromPChar: OK
1091.81 s
[ghc-lib-parser-ex] isSplicePat: OK
1091.81 s
[ghc-lib-parser-ex] isWildPat: OK
1091.81 s
[ghc-lib-parser-ex] isWildPat: OK
1091.81 s
[ghc-lib-parser-ex] DynFlags tests
1091.81 s
[ghc-lib-parser-ex] readExtension: OK
1091.81 s
[ghc-lib-parser-ex] readExtension: OK
1091.81 s
[ghc-lib-parser-ex] extensionImplications: OK
1091.81 s
[ghc-lib-parser-ex] check instance Bounded Language: OK
1091.81 s
[ghc-lib-parser-ex] check instance Ord Extension: OK
1091.81 s
[ghc-lib-parser-ex] disable via pragma: OK
1091.81 s
[ghc-lib-parser-ex] ImportQualifiedPost: OK
1091.81 s
[ghc-lib-parser-ex] Name tests
1091.81 s
[ghc-lib-parser-ex] modName (1): OK
1091.81 s
[ghc-lib-parser-ex] modName (2): OK
1091.81 s
[ghc-lib-parser-ex] isSymbolRdrName (1): OK
1091.81 s
[ghc-lib-parser-ex] isSymbolRdrName (2): OK
1091.81 s
[ghc-lib-parser-ex] isSymbolRdrName (3): OK
1091.81 s
[ghc-lib-parser-ex] isSymbolRdrName (4): OK
1091.81 s
[ghc-lib-parser-ex]
1091.81 s
[ghc-lib-parser-ex] All 120 tests passed (0.08s)
1091.81 s
[ghc-lib-parser-ex] Test suite ghc-lib-parser-ex-test: PASS
1091.81 s
[ghc-lib-parser-ex] Test suite logged to:
1091.81 s
[ghc-lib-parser-ex] dist/test/ghc-lib-parser-ex-9.8.0.2-ghc-lib-parser-ex-test.log
1091.81 s
[ghc-lib-parser-ex] 1 of 1 test suites (1 of 1 test cases) passed.
1091.81 s
[ghc-lib-parser-ex] Phase: haddockPhase
1091.81 s
[ghc-lib-parser-ex] Preprocessing library for ghc-lib-parser-ex-9.8.0.2..
1091.81 s
[ghc-lib-parser-ex] Running Haddock on library for ghc-lib-parser-ex-9.8.0.2..
1091.81 s
[ghc-lib-parser-ex] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1091.81 s
[ghc-lib-parser-ex] [ 1 of 18] Compiling Language.Haskell.GhclibParserEx.Dump ( src/Language/Haskell/GhclibParserEx/Dump.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [ 2 of 18] Compiling Language.Haskell.GhclibParserEx.Fixity ( src/Language/Haskell/GhclibParserEx/Fixity.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [ 3 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Driver.Flags ( src/Language/Haskell/GhclibParserEx/GHC/Driver/Flags.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [ 4 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Driver.Session ( src/Language/Haskell/GhclibParserEx/GHC/Driver/Session.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [ 5 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs ( src/Language/Haskell/GhclibParserEx/GHC/Hs.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [ 6 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Binds ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Binds.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [ 7 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Decls ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Decls.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [ 8 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.ExtendInstances ( src/Language/Haskell/GhclibParserEx/GHC/Hs/ExtendInstances.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [ 9 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.ImpExp ( src/Language/Haskell/GhclibParserEx/GHC/Hs/ImpExp.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [10 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Pat ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [11 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Type ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Type.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [12 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Types ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Types.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [13 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Parser ( src/Language/Haskell/GhclibParserEx/GHC/Parser.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [14 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Settings.Config ( src/Language/Haskell/GhclibParserEx/GHC/Settings/Config.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [15 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Types.Name.Reader ( src/Language/Haskell/GhclibParserEx/GHC/Types/Name/Reader.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [16 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Hs.Expr ( src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [17 of 18] Compiling Language.Haskell.GhclibParserEx.GHC.Utils.Outputable ( src/Language/Haskell/GhclibParserEx/GHC/Utils/Outputable.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] [18 of 18] Compiling Paths_ghc_lib_parser_ex ( dist/build/autogen/Paths_ghc_lib_parser_ex.hs, nothing )
1091.81 s
[ghc-lib-parser-ex] Haddock coverage:
1091.81 s
[ghc-lib-parser-ex] 75% ( 3 / 4) in 'Language.Haskell.GhclibParserEx.Dump'
1091.81 s
[ghc-lib-parser-ex] Missing documentation for:
1091.81 s
[ghc-lib-parser-ex] Module header
1092.00 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4 /nix/store/zvn09w2f3hwsy03yx28ln0pfl2y9154r-keys-3.12.4-doc
1092.74 s
[post-build-hook] Pushing 2 paths (104 are already present) using zstd to cache sellout ⏳
1092.74 s
[post-build-hook]
1093.07 s
[post-build-hook] Pushing /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4 (6.47 MiB)
1093.16 s
[post-build-hook] Pushing /nix/store/zvn09w2f3hwsy03yx28ln0pfl2y9154r-keys-3.12.4-doc (2.14 MiB)
1094.17 s
[post-build-hook]
1094.17 s
[post-build-hook] All done.
1094.28 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4 /nix/store/zvn09w2f3hwsy03yx28ln0pfl2y9154r-keys-3.12.4-doc
1094.41 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1094.62 s
[post-build-hook] copying 2 paths...
1094.63 s
[post-build-hook] copying path '/nix/store/zvn09w2f3hwsy03yx28ln0pfl2y9154r-keys-3.12.4-doc' to 'https://cache.nix-ci.com'...
1095.18 s
[post-build-hook] copying path '/nix/store/ja8hprh9kvka53kr2518fzdz2vqnh4ca-keys-3.12.4' to 'https://cache.nix-ci.com'...
1098.71 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1099.04 s
[post-build-hook] copying 1 paths...
1099.06 s
[post-build-hook] copying path '/nix/store/rw27nrwz76csz9naa739pc7fxj6pinv6-keys-3.12.4.drv' to 'https://cache.nix-ci.com'...
1099.33 s
Progress: 86 of 172 built (9 building), 395 of 395 downloaded from cache
1099.33 s
[monoid-subclasses] 33 | import Data.Semigroup (Semigroup(..))
1099.33 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1099.33 s
[monoid-subclasses]
1099.33 s
[monoid-subclasses] src/Data/Monoid/Instances/Positioned.hs:34:21: warning : [ GHC-38856 ] [ -Wunused-imports ]
1099.33 s
[monoid-subclasses] The import of ‘Monoid’ from module ‘Data.Monoid’ is redundant
1099.33 s
[monoid-subclasses] |
1099.33 s
[monoid-subclasses] 34 | import Data.Monoid (Monoid(..) , Endo(..))
1099.33 s
[monoid-subclasses] | ^^^^^^^^^^
1099.33 s
[monoid-subclasses] [14 of 16] Compiling Data.Monoid.Instances.Measured ( src/Data/Monoid/Instances/Measured.hs, nothing )
1099.33 s
[monoid-subclasses]
1099.33 s
[monoid-subclasses] src/Data/Monoid/Instances/Measured.hs:21:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1099.33 s
[monoid-subclasses] The import of ‘Data.Semigroup’ is redundant
1099.33 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Semigroup’
1099.33 s
[monoid-subclasses] To import instances alone, use: import Data.Semigroup()
1099.33 s
[monoid-subclasses] |
1099.33 s
[monoid-subclasses] 21 | import Data.Semigroup (Semigroup(..))
1099.33 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1099.33 s
[monoid-subclasses]
1099.33 s
[monoid-subclasses] src/Data/Monoid/Instances/Measured.hs:22:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1099.33 s
[monoid-subclasses] The import of ‘Data.Monoid’ is redundant
1099.33 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Monoid’
1099.33 s
[monoid-subclasses] To import instances alone, use: import Data.Monoid()
1099.33 s
[monoid-subclasses] |
1099.33 s
[monoid-subclasses] 22 | import Data.Monoid (Monoid(..))
1099.33 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1099.33 s
[monoid-subclasses] [15 of 16] Compiling Data.Monoid.Instances.Concat ( src/Data/Monoid/Instances/Concat.hs, nothing )
1099.33 s
[monoid-subclasses]
1099.33 s
[monoid-subclasses] src/Data/Monoid/Instances/Concat.hs:23:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1099.33 s
[monoid-subclasses] The import of ‘Data.Semigroup’ is redundant
1099.33 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Semigroup’
1099.33 s
[monoid-subclasses] To import instances alone, use: import Data.Semigroup()
1099.33 s
[monoid-subclasses] |
1099.33 s
[monoid-subclasses] 23 | import Data.Semigroup (Semigroup(..))
1099.33 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1099.33 s
[monoid-subclasses]
1099.33 s
[monoid-subclasses] src/Data/Monoid/Instances/Concat.hs:24:21: warning : [ GHC-38856 ] [ -Wunused-imports ]
1099.33 s
[monoid-subclasses] The import of ‘Monoid’ from module ‘Data.Monoid’ is redundant
1099.33 s
[monoid-subclasses] |
1099.33 s
[monoid-subclasses] 24 | import Data.Monoid (Monoid(..) , First(..), Sum(..))
1099.33 s
[monoid-subclasses] | ^^^^^^^^^^
1099.33 s
[monoid-subclasses] [16 of 16] Compiling Data.Monoid.Instances.ByteString.UTF8 ( src/Data/Monoid/Instances/ByteString/UTF8.hs, nothing )
1099.33 s
[monoid-subclasses]
1099.33 s
[monoid-subclasses] src/Data/Monoid/Instances/ByteString/UTF8.hs:59:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1099.33 s
[monoid-subclasses] The import of ‘Data.Semigroup’ is redundant
1099.33 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Semigroup’
1099.33 s
[monoid-subclasses] To import instances alone, use: import Data.Semigroup()
1099.33 s
[monoid-subclasses] |
1099.33 s
[monoid-subclasses] 59 | import Data.Semigroup (Semigroup(..))
1099.33 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1099.33 s
[monoid-subclasses]
1099.33 s
[monoid-subclasses] src/Data/Monoid/Instances/ByteString/UTF8.hs:60:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1099.33 s
[monoid-subclasses] The import of ‘Data.Monoid’ is redundant
1099.33 s
[monoid-subclasses] except perhaps to import instances from ‘Data.Monoid’
1099.33 s
[monoid-subclasses] To import instances alone, use: import Data.Monoid()
1099.33 s
[monoid-subclasses] |
1099.33 s
[monoid-subclasses] 60 | import Data.Monoid (Monoid(..))
1099.33 s
[monoid-subclasses] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1099.33 s
[monoid-subclasses] Haddock coverage:
1099.33 s
[monoid-subclasses] 100% ( 3 / 3) in 'Data.Monoid.Null'
1099.33 s
[monoid-subclasses] Warning: 'Sum' is ambiguous. It is defined
1099.33 s
[monoid-subclasses] * in ‘Data.Semigroup.Internal’
1099.69 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/qb0yv8aj8nbg00rz87xhzwicsdaxgz78-regex-tdfa-1.3.2.3-doc /nix/store/szxiys85w2xdqr800bm77386ha7i1s5v-regex-tdfa-1.3.2.3
1100.52 s
[post-build-hook] Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
1100.52 s
[post-build-hook]
1100.86 s
[post-build-hook] Pushing /nix/store/szxiys85w2xdqr800bm77386ha7i1s5v-regex-tdfa-1.3.2.3 (17.85 MiB)
1101.02 s
[post-build-hook] Pushing /nix/store/qb0yv8aj8nbg00rz87xhzwicsdaxgz78-regex-tdfa-1.3.2.3-doc (7.13 MiB)
1102.25 s
[post-build-hook]
1102.25 s
[post-build-hook] All done.
1102.31 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/qb0yv8aj8nbg00rz87xhzwicsdaxgz78-regex-tdfa-1.3.2.3-doc /nix/store/szxiys85w2xdqr800bm77386ha7i1s5v-regex-tdfa-1.3.2.3
1102.41 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1102.63 s
[post-build-hook] copying 2 paths...
1102.63 s
[post-build-hook] copying path '/nix/store/qb0yv8aj8nbg00rz87xhzwicsdaxgz78-regex-tdfa-1.3.2.3-doc' to 'https://cache.nix-ci.com'...
1104.35 s
[post-build-hook] copying path '/nix/store/szxiys85w2xdqr800bm77386ha7i1s5v-regex-tdfa-1.3.2.3' to 'https://cache.nix-ci.com'...
1115.15 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1115.47 s
[post-build-hook] copying 1 paths...
1115.48 s
[post-build-hook] copying path '/nix/store/idjwqsh3nl97b8i6fycvc034s39h9zy5-regex-tdfa-1.3.2.3.drv' to 'https://cache.nix-ci.com'...
1115.72 s
Progress: 87 of 173 built (8 building), 395 of 395 downloaded from cache
1115.88 s
Building kan-extensions
1116.01 s
Building regex
1116.02 s
[aeson] [24 of 32] Compiling Data.Aeson.Types.ToJSON ( src/Data/Aeson/Types/ToJSON.hs, dist/build/Data/Aeson/Types/ToJSON.o, dist/build/Data/Aeson/Types/ToJSON.dyn_o )
1116.02 s
[aeson]
1116.02 s
[aeson] src/Data/Aeson/Types/ToJSON.hs:1615:23: warning : [ GHC-68441 ] [ -Wdeprecations ]
1116.02 s
[aeson] In the use of data constructor ‘Solo’
1116.02 s
[aeson] (imported from Data.Tuple.Solo, but defined in GHC.Tuple):
1116.02 s
[aeson] Deprecated: "The Solo constructor has been renamed to MkSolo to avoid punning."
1116.02 s
[aeson] |
1116.02 s
[aeson] 1615 | liftToJSON _ t _ (Solo a) = t a
1116.02 s
[aeson] | ^^^^
1116.02 s
[aeson]
1116.02 s
[aeson] src/Data/Aeson/Types/ToJSON.hs:1618:27: warning : [ GHC-68441 ] [ -Wdeprecations ]
1116.02 s
[aeson] In the use of data constructor ‘Solo’
1116.02 s
[aeson] (imported from Data.Tuple.Solo, but defined in GHC.Tuple):
1116.02 s
[aeson] Deprecated: "The Solo constructor has been renamed to MkSolo to avoid punning."
1116.02 s
[aeson] |
1116.02 s
[aeson] 1618 | liftToEncoding _ t _ (Solo a) = t a
1116.02 s
[aeson] | ^^^^
1116.02 s
[algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.p_o )
1116.02 s
[algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.p_o )
1116.02 s
[algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
1116.02 s
[algebraic-graphs]
1116.02 s
[algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1116.02 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1116.02 s
[algebraic-graphs] will become an error in a future GHC release.
1116.02 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1116.02 s
[algebraic-graphs] |
1116.02 s
[algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
1116.02 s
[algebraic-graphs] | ^
1116.02 s
[algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.p_o )
1116.02 s
[algebraic-graphs]
1116.02 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1116.02 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1116.02 s
[algebraic-graphs] will become an error in a future GHC release.
1116.02 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1116.02 s
[algebraic-graphs] |
1116.02 s
[algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
1116.02 s
[algebraic-graphs] | ^
1116.02 s
[algebraic-graphs]
1116.02 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1116.02 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1116.02 s
[algebraic-graphs] will become an error in a future GHC release.
1116.02 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1116.02 s
[algebraic-graphs] |
1116.02 s
[algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
1116.02 s
[algebraic-graphs] | ^
1116.02 s
[algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
1116.02 s
[algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
1116.02 s
[algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.p_o )
1116.02 s
[algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.p_o )
1116.02 s
[algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.p_o )
1116.02 s
[algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.p_o )
1116.02 s
[algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
1116.02 s
[algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
1116.02 s
[algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7..
1116.02 s
[algebraic-graphs] [ 1 of 23] Compiling Algebra.Graph.Test.Arbitrary ( test/Algebra/Graph/Test/Arbitrary.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.o, dist/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.dyn_o )
1116.02 s
[algebraic-graphs] [ 2 of 23] Compiling Algebra.Graph.Test.API ( test/Algebra/Graph/Test/API.hs, dist/build/main/main-tmp/Algebra/Graph/Test/API.o, dist/build/main/main-tmp/Algebra/Graph/Test/API.dyn_o )
1116.02 s
[algebraic-graphs] [ 3 of 23] Compiling Algebra.Graph.Test ( test/Algebra/Graph/Test.hs, dist/build/main/main-tmp/Algebra/Graph/Test.o, dist/build/main/main-tmp/Algebra/Graph/Test.dyn_o )
1116.02 s
[filemanip] 131 | h = head hs
1116.02 s
[filemanip] | ^^^^
1116.02 s
[filemanip]
1116.02 s
[filemanip] System/FilePath/GlobPattern.hs:132:54: warning : [ GHC-63394 ] [ -Wx-partial ]
1116.02 s
[filemanip] In the use of ‘tail’
1116.02 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1116.02 s
[filemanip] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1116.02 s
[filemanip] |
1116.02 s
[filemanip] 132 | in if all (h==) $ tail hs
1116.02 s
[filemanip] | ^^^^
1116.02 s
[filemanip]
1116.02 s
[filemanip] System/FilePath/GlobPattern.hs:133:62: warning : [ GHC-63394 ] [ -Wx-partial ]
1116.02 s
[filemanip] In the use of ‘tail’
1116.02 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1116.02 s
[filemanip] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1116.02 s
[filemanip] |
1116.02 s
[filemanip] 133 | then pfx (h:acc) $ map tail ss
1116.02 s
[filemanip] | ^^^^
1116.02 s
[filemanip]
1116.02 s
[filemanip] System/FilePath/GlobPattern.hs:149:22: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.02 s
[filemanip] This binding for ‘g’ shadows the existing binding
1116.02 s
[filemanip] bound at System/FilePath/GlobPattern.hs:148:24
1116.02 s
[filemanip] |
1116.02 s
[filemanip] 149 | where matchGroup g = matchTerms (MatchLiteral g : ts) cs
1116.02 s
[filemanip] | ^
1116.02 s
[filemanip]
1116.02 s
[filemanip] System/FilePath/GlobPattern.hs:154:48: warning : [ GHC-63394 ] [ -Wx-partial ]
1116.02 s
[filemanip] In the use of ‘tail’
1116.02 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1116.02 s
[filemanip] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1116.02 s
[filemanip] |
1116.02 s
[filemanip] 154 | Nothing -> matchAny (tail cs')
1116.02 s
[filemanip] | ^^^^
1116.02 s
[filemanip]
1116.02 s
[filemanip] System/FilePath/GlobPattern.hs:162:48: warning : [ GHC-63394 ] [ -Wx-partial ]
1116.02 s
[filemanip] In the use of ‘tail’
1116.02 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1116.02 s
[filemanip] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1116.02 s
[filemanip] |
1116.03 s
[filemanip] 162 | Nothing -> matchDir $ tail cs'
1116.03 s
[filemanip] | ^^^^
1116.03 s
[filemanip] [2 of 4] Compiling System.FilePath.Glob ( System/FilePath/Glob.hs, dist/build/System/FilePath/Glob.o, dist/build/System/FilePath/Glob.dyn_o )
1116.03 s
[filemanip] [3 of 4] Compiling System.FilePath.Find ( System/FilePath/Find.hs, dist/build/System/FilePath/Find.o, dist/build/System/FilePath/Find.dyn_o )
1116.03 s
[filemanip]
1116.03 s
[filemanip] System/FilePath/Find.hs:227:20: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.03 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1116.03 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1116.03 s
[filemanip] |
1116.03 s
[filemanip] 227 | where visit path depth st =
1116.03 s
[filemanip] | ^^^^^
1116.03 s
[filemanip]
1116.03 s
[ghc-exactprint] [ 2 of 10] Compiling Language.Haskell.GHC.ExactPrint.Orphans ( src/Language/Haskell/GHC/ExactPrint/Orphans.hs, dist/build/Language/Haskell/GHC/ExactPrint/Orphans.o, dist/build/Language/Haskell/GHC/ExactPrint/Orphans.dyn_o )
1116.03 s
[ghc-exactprint] [ 3 of 10] Compiling Language.Haskell.GHC.ExactPrint.Types ( src/Language/Haskell/GHC/ExactPrint/Types.hs, dist/build/Language/Haskell/GHC/ExactPrint/Types.o, dist/build/Language/Haskell/GHC/ExactPrint/Types.dyn_o )
1116.03 s
[ghc-exactprint] [ 4 of 10] Compiling Language.Haskell.GHC.ExactPrint.Lookup ( src/Language/Haskell/GHC/ExactPrint/Lookup.hs, dist/build/Language/Haskell/GHC/ExactPrint/Lookup.o, dist/build/Language/Haskell/GHC/ExactPrint/Lookup.dyn_o )
1116.03 s
[ghc-exactprint] [ 5 of 10] Compiling Language.Haskell.GHC.ExactPrint.Utils ( src/Language/Haskell/GHC/ExactPrint/Utils.hs, dist/build/Language/Haskell/GHC/ExactPrint/Utils.o, dist/build/Language/Haskell/GHC/ExactPrint/Utils.dyn_o )
1116.03 s
[ghc-exactprint] [ 6 of 10] Compiling Language.Haskell.GHC.ExactPrint.Preprocess ( src/Language/Haskell/GHC/ExactPrint/Preprocess.hs, dist/build/Language/Haskell/GHC/ExactPrint/Preprocess.o, dist/build/Language/Haskell/GHC/ExactPrint/Preprocess.dyn_o )
1116.03 s
[ghc-exactprint] [ 7 of 10] Compiling Language.Haskell.GHC.ExactPrint.Parsers ( src/Language/Haskell/GHC/ExactPrint/Parsers.hs, dist/build/Language/Haskell/GHC/ExactPrint/Parsers.o, dist/build/Language/Haskell/GHC/ExactPrint/Parsers.dyn_o )
1116.03 s
[ghc-exactprint] [ 8 of 10] Compiling Language.Haskell.GHC.ExactPrint.ExactPrint ( src/Language/Haskell/GHC/ExactPrint/ExactPrint.hs, dist/build/Language/Haskell/GHC/ExactPrint/ExactPrint.o, dist/build/Language/Haskell/GHC/ExactPrint/ExactPrint.dyn_o )
1116.03 s
[ghc-exactprint]
1116.03 s
[ghc-exactprint] src/Language/Haskell/GHC/ExactPrint/ExactPrint.hs:1422:15: warning : [ GHC-62161 ] [ -Wincomplete-record-updates ]
1116.03 s
[ghc-exactprint] Pattern match(es) are non-exhaustive
1116.03 s
[ghc-exactprint] In a record update:
1116.03 s
[ghc-exactprint] Patterns of type ‘EpAnn AnnsModule’ not matched: EpAnnNotUsed
1116.03 s
[ghc-exactprint] |
1116.03 s
[ghc-exactprint] 1422 | let anf = an0 { anns = (anns an0) { am_decls = am_decls' }}
1116.03 s
[ghc-exactprint] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1116.03 s
[ghc-exactprint]
1116.03 s
[ghc-exactprint] src/Language/Haskell/GHC/ExactPrint/ExactPrint.hs:3308:19: warning : [ GHC-62161 ] [ -Wincomplete-record-updates ]
1116.03 s
[ghc-exactprint] Pattern match(es) are non-exhaustive
1116.03 s
[ghc-exactprint] In a record update:
1116.03 s
[ghc-exactprint] Patterns of type ‘XCmdArrApp GhcPs’ not matched: EpAnnNotUsed
1116.03 s
[ghc-exactprint] |
1116.03 s
[ghc-exactprint] 3308 | let an1 = an{anns = an0}
1116.03 s
[ghc-exactprint] | ^^^^^^^^^^^^^^
1116.03 s
[ghc-exactprint]
1116.03 s
[ghc-exactprint] src/Language/Haskell/GHC/ExactPrint/ExactPrint.hs:3314:19: warning : [ GHC-62161 ] [ -Wincomplete-record-updates ]
1116.03 s
[ghc-exactprint] Pattern match(es) are non-exhaustive
1116.03 s
[ghc-exactprint] In a record update:
1116.03 s
[ghc-exactprint] Patterns of type ‘XCmdArrApp GhcPs’ not matched: EpAnnNotUsed
1116.03 s
[ghc-exactprint] |
1116.03 s
[ghc-exactprint] 3314 | let an1 = an {anns = an0}
1116.03 s
[ghc-exactprint] | ^^^^^^^^^^^^^^^
1116.03 s
[ghc-lib-parser-ex] 11% ( 1 / 9) in 'Language.Haskell.GhclibParserEx.Fixity'
1116.03 s
[ghc-lib-parser-ex] Missing documentation for:
1116.03 s
[ghc-lib-parser-ex] Module header
1116.03 s
[ghc-lib-parser-ex] fixitiesFromModule (src/Language/Haskell/GhclibParserEx/Fixity.hs:284)
1116.03 s
[ghc-lib-parser-ex] preludeFixities (src/Language/Haskell/GhclibParserEx/Fixity.hs:225)
1116.03 s
[ghc-lib-parser-ex] baseFixities (src/Language/Haskell/GhclibParserEx/Fixity.hs:245)
1116.03 s
[ghc-lib-parser-ex] infixr_ (src/Language/Haskell/GhclibParserEx/Fixity.hs:268)
1116.03 s
[ghc-lib-parser-ex] infixl_ (src/Language/Haskell/GhclibParserEx/Fixity.hs:269)
1116.03 s
[ghc-lib-parser-ex] infix_ (src/Language/Haskell/GhclibParserEx/Fixity.hs:270)
1116.03 s
[ghc-lib-parser-ex] fixity (src/Language/Haskell/GhclibParserEx/Fixity.hs:274)
1116.03 s
[ghc-lib-parser-ex] 0% ( 0 / 1) in 'Language.Haskell.GhclibParserEx.GHC.Driver.Flags'
1116.03 s
[ghc-lib-parser-ex] Missing documentation for:
1116.03 s
[ghc-lib-parser-ex] Module header
1116.03 s
[ghc-lib-parser-ex] 50% ( 2 / 4) in 'Language.Haskell.GhclibParserEx.GHC.Driver.Session'
1116.03 s
[ghc-lib-parser-ex] Missing documentation for:
1116.03 s
[ghc-lib-parser-ex] Module header
1116.03 s
[ghc-lib-parser-ex] parsePragmasIntoDynFlags (src/Language/Haskell/GhclibParserEx/GHC/Driver/Session.hs:169)
1116.03 s
[ghc-lib-parser-ex] 0% ( 0 / 2) in 'Language.Haskell.GhclibParserEx.GHC.Hs'
1116.03 s
[ghc-lib-parser-ex] Missing documentation for:
1116.03 s
[ghc-lib-parser-ex] Module header
1116.03 s
[ghc-lib-parser-ex] modName (src/Language/Haskell/GhclibParserEx/GHC/Hs.hs:32)
1116.03 s
[ghc-lib-parser-ex] 0% ( 0 / 2) in 'Language.Haskell.GhclibParserEx.GHC.Hs.Binds'
1116.03 s
[ghc-lib-parser-ex] Missing documentation for:
1116.03 s
[ghc-lib-parser-ex] Module header
1116.03 s
[ghc-lib-parser-ex] isPatSynBind (src/Language/Haskell/GhclibParserEx/GHC/Hs/Binds.hs:19)
1116.03 s
[ghc-lib-parser-ex] 0% ( 0 / 5) in 'Language.Haskell.GhclibParserEx.GHC.Hs.Decls'
1116.03 s
[ghc-lib-parser-ex] Missing documentation for:
1116.03 s
[ghc-lib-parser-ex] Module header
1116.03 s
[ghc-lib-parser-ex] isNewType (src/Language/Haskell/GhclibParserEx/GHC/Hs/Decls.hs:21)
1116.03 s
[ghc-lib-parser-ex] isForD (src/Language/Haskell/GhclibParserEx/GHC/Hs/Decls.hs:25)
1116.03 s
[ghc-lib-parser-ex] isDerivD (src/Language/Haskell/GhclibParserEx/GHC/Hs/Decls.hs:26)
1116.03 s
[ghc-lib-parser-ex] isClsDefSig (src/Language/Haskell/GhclibParserEx/GHC/Hs/Decls.hs:29)
1116.03 s
[ghc-lib-parser-ex] 0% ( 0 / 5) in 'Language.Haskell.GhclibParserEx.GHC.Hs.ExtendInstances'
1116.03 s
[ghc-lib-parser-ex] Missing documentation for:
1116.03 s
[ghc-lib-parser-ex] Module header
1116.03 s
[ghc-lib-parser-ex] HsExtendInstances (src/Language/Haskell/GhclibParserEx/GHC/Hs/ExtendInstances.hs:29)
1116.03 s
[ghc-lib-parser-ex] extendInstances (src/Language/Haskell/GhclibParserEx/GHC/Hs/ExtendInstances.hs:34)
1116.03 s
[ghc-lib-parser-ex] astEq (src/Language/Haskell/GhclibParserEx/GHC/Hs/ExtendInstances.hs:51)
1116.03 s
[ghc-lib-parser-ex] astListEq (src/Language/Haskell/GhclibParserEx/GHC/Hs/ExtendInstances.hs:54)
1116.03 s
[ghc-lib-parser-ex] 0% ( 0 / 3) in 'Language.Haskell.GhclibParserEx.GHC.Hs.ImpExp'
1116.03 s
[ghc-lib-parser-ex] Missing documentation for:
1116.03 s
[ghc-lib-parser-ex] Module header
1116.03 s
[ghc-lib-parser-ex] isPatSynIE (src/Language/Haskell/GhclibParserEx/GHC/Hs/ImpExp.hs:36)
1116.03 s
[ghc-lib-parser-ex] isImportQualifiedPost (src/Language/Haskell/GhclibParserEx/GHC/Hs/ImpExp.hs:42)
1116.03 s
[ghc-lib-parser-ex] 0% ( 0 / 13) in 'Language.Haskell.GhclibParserEx.GHC.Hs.Pat'
1116.03 s
[ghc-lib-parser-ex] Missing documentation for:
1116.03 s
[ghc-lib-parser-ex] Module header
1116.03 s
[ghc-lib-parser-ex] patToStr (src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs:55)
1116.03 s
[ghc-lib-parser-ex] strToPat (src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs:62)
1116.03 s
[ghc-lib-parser-ex] fromPChar (src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs:89)
1116.03 s
[ghc-lib-parser-ex] hasPFieldsDotDot (src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs:95)
1116.03 s
[ghc-lib-parser-ex] isPFieldWildcard (src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs:118)
1116.03 s
[ghc-lib-parser-ex] isPWildcard (src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs:127)
1116.03 s
[ghc-lib-parser-ex] isPFieldPun (src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs:144)
1116.03 s
[ghc-lib-parser-ex] isPatTypeSig (src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs:154)
1116.03 s
[ghc-lib-parser-ex] isPBangPat (src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs:155)
1116.03 s
[ghc-lib-parser-ex] isPViewPat (src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs:156)
1116.03 s
[ghc-lib-parser-ex] isWildPat (src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs:132)
1116.03 s
[ghc-lib-parser-ex] isSplicePat (src/Language/Haskell/GhclibParserEx/GHC/Hs/Pat.hs:163)
1116.03 s
[ghc-lib-parser-ex] 0% ( 0 / 5) in 'Language.Haskell.GhclibParserEx.GHC.Hs.Type'
1116.03 s
[ghc-lib-parser-ex] Missing documentation for:
1116.03 s
[ghc-lib-parser-ex] Module header
1116.03 s
[ghc-lib-parser-ex] fromTyParen (src/Language/Haskell/GhclibParserEx/GHC/Hs/Type.hs:26)
1116.03 s
[ghc-lib-parser-ex] isTyQuasiQuote (src/Language/Haskell/GhclibParserEx/GHC/Hs/Type.hs:30)
1116.03 s
[ghc-lib-parser-ex] isUnboxedTuple (src/Language/Haskell/GhclibParserEx/GHC/Hs/Type.hs:34)
1116.03 s
[ghc-lib-parser-ex] isKindTyApp (src/Language/Haskell/GhclibParserEx/GHC/Hs/Type.hs:23)
1116.03 s
[ghc-lib-parser-ex] 50% ( 1 / 2) in 'Language.Haskell.GhclibParserEx.GHC.Hs.Types'
1116.03 s
[ghc-lib-parser-ex] Missing documentation for:
1116.03 s
[ghc-lib-parser-ex] Module header
1116.03 s
[ghc-lib-parser-ex] 0% ( 0 / 16) in 'Language.Haskell.GhclibParserEx.GHC.Parser'
1116.03 s
[ghc-lib-parser-ex] Missing documentation for:
1116.03 s
[ghc-lib-parser-ex] Module header
1116.03 s
[ghc-lib-parser-ex] parseFile (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:185)
1116.03 s
[monoid-subclasses] * in ‘Data.Semigroup.Internal’
1116.03 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.03 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.03 s
[monoid-subclasses] Defaulting to the one defined in ‘Data.Semigroup.Internal’
1116.03 s
[monoid-subclasses] Warning: 'Product' is ambiguous. It is defined
1116.03 s
[monoid-subclasses] * in ‘Data.Semigroup.Internal’
1116.03 s
[monoid-subclasses] * in ‘Data.Semigroup.Internal’
1116.03 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.03 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.03 s
[monoid-subclasses] Defaulting to the one defined in ‘Data.Semigroup.Internal’
1116.03 s
[monoid-subclasses] Warning: 'stripPrefix' is ambiguous. It is defined
1116.03 s
[monoid-subclasses] * in ‘Data.OldList’
1116.03 s
[monoid-subclasses] * in ‘Data.ByteString’
1116.03 s
[monoid-subclasses] * in ‘Data.ByteString.Lazy’
1116.03 s
[monoid-subclasses] * at src/Data/Semigroup/Cancellative.hs:94:4
1116.03 s
[monoid-subclasses] * in ‘Data.Text’
1116.03 s
[monoid-subclasses] * in ‘Data.Text.Lazy’
1116.03 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.03 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.03 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Semigroup/Cancellative.hs:94:4
1116.03 s
[monoid-subclasses] Warning: 'stripSuffix' is ambiguous. It is defined
1116.03 s
[monoid-subclasses] * in ‘Data.ByteString’
1116.03 s
[monoid-subclasses] * in ‘Data.ByteString.Lazy’
1116.03 s
[monoid-subclasses] * at src/Data/Semigroup/Cancellative.hs:108:4
1116.03 s
[monoid-subclasses] * in ‘Data.Text’
1116.03 s
[monoid-subclasses] * in ‘Data.Text.Lazy’
1116.03 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.03 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.03 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Semigroup/Cancellative.hs:108:4
1116.03 s
[monoid-subclasses] 100% ( 11 / 11) in 'Data.Semigroup.Cancellative'
1116.03 s
[monoid-subclasses] Warning: 'isPrefixOf' is ambiguous. It is defined
1116.03 s
[monoid-subclasses] * in ‘Data.ByteString’
1116.03 s
[monoid-subclasses] * in ‘Data.ByteString.Lazy’
1116.03 s
[monoid-subclasses] * at src/Data/Semigroup/Cancellative.hs:93:4
1116.03 s
[monoid-subclasses] * in ‘Data.Text’
1116.03 s
[monoid-subclasses] * in ‘Data.Text.Lazy’
1116.03 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.03 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.03 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Semigroup/Cancellative.hs:93:4
1116.03 s
[monoid-subclasses] Warning: 'isSuffixOf' is ambiguous. It is defined
1116.03 s
[monoid-subclasses] * in ‘Data.ByteString’
1116.03 s
[monoid-subclasses] * in ‘Data.ByteString.Lazy’
1116.03 s
[monoid-subclasses] * at src/Data/Semigroup/Cancellative.hs:107:4
1116.03 s
[monoid-subclasses] * in ‘Data.Text’
1116.03 s
[monoid-subclasses] * in ‘Data.Text.Lazy’
1116.03 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.03 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.03 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Semigroup/Cancellative.hs:107:4
1116.03 s
[monoid-subclasses] 100% ( 3 / 3) in 'Data.Monoid.Monus'
1116.03 s
[monoid-subclasses] Warning: 'gcd' is ambiguous. It is defined
1116.03 s
[monoid-subclasses] * in ‘GHC.Real’
1116.03 s
[monoid-subclasses] * at src/Data/Monoid/GCD.hs:150:4
1116.03 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.03 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.03 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Monoid/GCD.hs:150:4
1116.03 s
[monoid-subclasses] Warning: 'all' is ambiguous. It is defined
1116.03 s
[monoid-subclasses] * in ‘Data.Foldable’
1116.03 s
[monoid-subclasses] * in ‘Data.ByteString’
1116.03 s
[monoid-subclasses] * in ‘Data.ByteString.Lazy’
1116.03 s
[monoid-subclasses] * in ‘Data.Text’
1116.03 s
[monoid-subclasses] * in ‘Data.Text.Lazy’
1116.03 s
[monoid-subclasses] * in ‘Data.Vector’
1116.03 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.03 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.03 s
[monoid-subclasses] Defaulting to the one defined in ‘Data.Vector’
1116.03 s
[monoid-subclasses] 100% ( 8 / 8) in 'Data.Monoid.GCD'
1116.03 s
[monoid-subclasses] Warning: 'lcm' is ambiguous. It is defined
1116.03 s
[monoid-subclasses] * in ‘GHC.Real’
1116.03 s
[monoid-subclasses] * at src/Data/Monoid/LCM.hs:108:5
1116.03 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.03 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.03 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Monoid/LCM.hs:108:5
1116.03 s
[monoid-subclasses] Warning: 'gcd' is ambiguous. It is defined
1116.03 s
[monoid-subclasses] * in ‘GHC.Real’
1116.03 s
[monoid-subclasses] * at src/Data/Monoid/GCD.hs:150:4
1116.03 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.03 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.03 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Monoid/GCD.hs:150:4
1116.03 s
[monoid-subclasses] 100% ( 3 / 3) in 'Data.Monoid.LCM'
1116.03 s
[monoid-subclasses] 41% ( 5 / 12) in 'Data.Monoid.Cancellative'
1116.03 s
[monoid-subclasses] Missing documentation for:
1116.04 s
[monoid-subclasses] CommutativeMonoid (src/Data/Monoid/Cancellative.hs:51)
1116.04 s
[monoid-subclasses] ReductiveMonoid (src/Data/Monoid/Cancellative.hs:52)
1116.04 s
[monoid-subclasses] CancellativeMonoid (src/Data/Monoid/Cancellative.hs:55)
1116.04 s
[monoid-subclasses] LeftReductiveMonoid (src/Data/Monoid/Cancellative.hs:53)
1116.04 s
[shake] Phase: setupCompilerEnvironmentPhase
1116.04 s
[shake] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1116.04 s
[shake] Phase: unpackPhase
1116.04 s
[shake] unpacking source archive /nix/store/x8azcgws6ybnhlpzdkby4s4lf1kj11ah-shake-0.19.8.tar.gz
1116.04 s
[shake] source root is shake-0.19.8
1116.04 s
[shake] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "shake-0.19.8/src/Test/Version.hs"
1116.04 s
[shake] Phase: patchPhase
1116.04 s
[shake] Phase: compileBuildDriverPhase
1116.04 s
[shake] setupCompileFlags: -package-db=/build/tmp.wg4myOD4U1/setup-package.conf.d -threaded
1116.04 s
[shake] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.wg4myOD4U1/Main.o )
1116.04 s
[shake] [2 of 2] Linking Setup
1116.04 s
[shake] Phase: updateAutotoolsGnuConfigScriptsPhase
1116.04 s
[shake] Phase: configurePhase
1116.04 s
[shake] configureFlags: --verbose --prefix=/nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --datadir=/nix/store/iq8l5cy2qzvrc55zfs8wxjss7qblrjyr-shake-0.19.8-data/share/ghc-9.8.1 --docdir=/nix/store/xxzinarv27ih7cg9yzhi0kznc3mxvr34-shake-0.19.8-doc/share/doc/shake-0.19.8 --with-gcc=gcc --package-db=/build/tmp.wg4myOD4U1/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --disable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1116.04 s
[shake] Using Parsec parser
1116.04 s
[shake] Configuring shake-0.19.8...
1116.04 s
[shake] Flags chosen: cloud=False, embed-files=False, portable=False, threaded=True
1116.04 s
[shake] Dependency base >=4.9: using base-4.19.0.0
1116.04 s
[shake] Dependency binary: using binary-0.8.9.1
1116.04 s
[shake] Dependency bytestring: using bytestring-0.12.0.2
1116.04 s
[shake] Dependency deepseq >=1.1: using deepseq-1.5.0.0
1116.04 s
[shake] Dependency directory >=1.2.7.0: using directory-1.3.8.1
1116.04 s
[shake] Dependency extra >=1.6.19: using extra-1.7.16
1116.04 s
[shake] Dependency filepath >=1.4: using filepath-1.4.100.4
1116.04 s
[shake] Dependency filepattern: using filepattern-0.1.3
1116.04 s
[shake] Dependency hashable >=1.1.2.3: using hashable-1.4.7.0
1116.04 s
[shake] Dependency heaps >=0.3.6.1: using heaps-0.4.1
1116.04 s
[shake] Dependency js-dgtable: using js-dgtable-0.5.2
1116.04 s
[shake] Dependency js-flot: using js-flot-0.8.3
1116.04 s
[shake] Dependency js-jquery: using js-jquery-3.3.1
1116.04 s
[shake] Dependency primitive: using primitive-0.9.1.0
1116.04 s
[shake] Dependency process >=1.1: using process-1.6.18.0
1116.04 s
[shake] Dependency random: using random-1.2.1.3
1116.04 s
[shake] Dependency time: using time-1.12.2
1116.04 s
[shake] Dependency transformers >=0.2: using transformers-0.6.1.0
1116.04 s
[shake] Dependency unix >=2.5.1: using unix-2.8.3.0
1116.04 s
[shake] Dependency unordered-containers >=0.2.7: using unordered-containers-0.2.20
1116.04 s
[shake] Dependency utf8-string >=0.3: using utf8-string-1.0.2
1116.04 s
[shake] Dependency base >=4 && <5: using base-4.19.0.0
1116.04 s
[shake] Dependency binary: using binary-0.8.9.1
1116.04 s
[shake] Dependency bytestring: using bytestring-0.12.0.2
1116.04 s
[shake] Dependency deepseq >=1.1: using deepseq-1.5.0.0
1116.04 s
[shake] Dependency directory: using directory-1.3.8.1
1116.04 s
[shake] Dependency extra >=1.6.19: using extra-1.7.16
1116.04 s
[shake] Dependency filepath: using filepath-1.4.100.4
1116.04 s
[shake] Dependency filepattern: using filepattern-0.1.3
1116.04 s
[shake] Dependency hashable >=1.1.2.3: using hashable-1.4.7.0
1116.04 s
[shake] Dependency heaps >=0.3.6.1: using heaps-0.4.1
1116.04 s
[shake] Dependency js-dgtable: using js-dgtable-0.5.2
1116.04 s
[shake] Dependency js-flot: using js-flot-0.8.3
1116.04 s
[shake] Dependency js-jquery: using js-jquery-3.3.1
1116.04 s
[shake] Dependency primitive: using primitive-0.9.1.0
1116.04 s
[shake] Dependency process >=1.1: using process-1.6.18.0
1116.04 s
[shake] Dependency random: using random-1.2.1.3
1116.04 s
[unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
1116.04 s
[unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
1116.04 s
[unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
1116.04 s
[unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
1116.04 s
[unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
1116.04 s
[unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
1116.04 s
[unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
1116.04 s
[unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
1116.04 s
[unordered-containers] [1 of 9] Compiling Properties.List ( tests/Properties/List.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/List.o )
1116.04 s
[unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
1116.04 s
[unordered-containers]
1116.04 s
[unordered-containers] tests/Regressions.hs:91:16: warning : [ GHC-63394 ] [ -Wx-partial ]
1116.04 s
[unordered-containers] In the use of ‘head’
1116.04 s
[unordered-containers] (imported from Prelude, but defined in GHC.List):
1116.04 s
[unordered-containers] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1116.04 s
[unordered-containers] |
1116.04 s
[unordered-containers] 91 | k = head keys
1116.04 s
[unordered-containers] | ^^^^
1116.04 s
[unordered-containers] [3 of 9] Compiling Util.Key ( tests/Util/Key.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Util/Key.o )
1116.04 s
[unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
1116.04 s
[unordered-containers] [5 of 9] Compiling Properties.HashSet ( tests/Properties/HashSet.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashSet.o )
1116.04 s
[unordered-containers] [6 of 9] Compiling Properties.HashMapStrict ( tests/Properties/HashMapStrict.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapStrict.o )
1116.04 s
[algebraic-graphs] [ 4 of 23] Compiling Algebra.Graph.Test.Acyclic.AdjacencyMap ( test/Algebra/Graph/Test/Acyclic/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.dyn_o )
1116.04 s
[algebraic-graphs] [ 5 of 23] Compiling Algebra.Graph.Test.Bipartite.AdjacencyMap ( test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.dyn_o )
1116.04 s
[algebraic-graphs] [ 6 of 23] Compiling Algebra.Graph.Test.Example.Todo ( test/Algebra/Graph/Test/Example/Todo.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.o, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.dyn_o )
1116.04 s
[algebraic-graphs] [ 7 of 23] Compiling Algebra.Graph.Test.Export ( test/Algebra/Graph/Test/Export.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Export.o, dist/build/main/main-tmp/Algebra/Graph/Test/Export.dyn_o )
1116.04 s
[algebraic-graphs] [ 8 of 23] Compiling Algebra.Graph.Test.Generic ( test/Algebra/Graph/Test/Generic.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Generic.o, dist/build/main/main-tmp/Algebra/Graph/Test/Generic.dyn_o )
1116.04 s
[algebraic-graphs] [ 9 of 23] Compiling Algebra.Graph.Test.AdjacencyMap ( test/Algebra/Graph/Test/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.dyn_o )
1116.04 s
[algebraic-graphs] [10 of 23] Compiling Algebra.Graph.Test.AdjacencyIntMap ( test/Algebra/Graph/Test/AdjacencyIntMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.dyn_o )
1116.04 s
[algebraic-graphs] [11 of 23] Compiling Algebra.Graph.Test.Graph ( test/Algebra/Graph/Test/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.dyn_o )
1116.04 s
[algebraic-graphs] [12 of 23] Compiling Algebra.Graph.Test.Internal ( test/Algebra/Graph/Test/Internal.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Internal.o, dist/build/main/main-tmp/Algebra/Graph/Test/Internal.dyn_o )
1116.04 s
[algebraic-graphs] [13 of 23] Compiling Algebra.Graph.Test.Label ( test/Algebra/Graph/Test/Label.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Label.o, dist/build/main/main-tmp/Algebra/Graph/Test/Label.dyn_o )
1116.04 s
[algebraic-graphs] [14 of 23] Compiling Algebra.Graph.Test.Labelled.AdjacencyMap ( test/Algebra/Graph/Test/Labelled/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.dyn_o )
1116.04 s
[algebraic-graphs] [15 of 23] Compiling Algebra.Graph.Test.Labelled.Graph ( test/Algebra/Graph/Test/Labelled/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.dyn_o )
1116.04 s
[algebraic-graphs] [16 of 23] Compiling Algebra.Graph.Test.NonEmpty.AdjacencyMap ( test/Algebra/Graph/Test/NonEmpty/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.dyn_o )
1116.04 s
[algebraic-graphs] [17 of 23] Compiling Algebra.Graph.Test.NonEmpty.Graph ( test/Algebra/Graph/Test/NonEmpty/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.dyn_o )
1116.04 s
[algebraic-graphs] [18 of 23] Compiling Algebra.Graph.Test.Relation ( test/Algebra/Graph/Test/Relation.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.dyn_o )
1116.04 s
[algebraic-graphs] [19 of 23] Compiling Algebra.Graph.Test.Relation.Symmetric ( test/Algebra/Graph/Test/Relation/Symmetric.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.dyn_o )
1116.04 s
[algebraic-graphs] [20 of 23] Compiling Algebra.Graph.Test.RewriteRules ( test/Algebra/Graph/Test/RewriteRules.hs, dist/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.o, dist/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.dyn_o )
1116.04 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
1116.04 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
1116.04 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
1116.04 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
1116.04 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
1116.04 s
[filemanip] System/FilePath/Find.hs:231:9: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.04 s
[filemanip] This binding for ‘traverse’ shadows the existing binding
1116.04 s
[filemanip] imported from ‘Prelude’ at System/FilePath/Find.hs:39:8-27
1116.04 s
[filemanip] (and originally defined in ‘Data.Traversable’)
1116.04 s
[filemanip] |
1116.04 s
[filemanip] 231 | traverse dir depth dirSt = do
1116.04 s
[filemanip] | ^^^^^^^^
1116.04 s
[filemanip]
1116.04 s
[filemanip] System/FilePath/Find.hs:231:22: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.04 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1116.04 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1116.04 s
[filemanip] |
1116.04 s
[filemanip] 231 | traverse dir depth dirSt = do
1116.04 s
[filemanip] | ^^^^^
1116.04 s
[filemanip]
1116.04 s
[filemanip] System/FilePath/Find.hs:238:25: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.04 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1116.04 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1116.04 s
[filemanip] |
1116.04 s
[filemanip] 238 | filterPath path depth st result =
1116.04 s
[filemanip] | ^^^^^
1116.04 s
[filemanip]
1116.04 s
[filemanip] System/FilePath/Find.hs:274:15: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.04 s
[filemanip] This binding for ‘state’ shadows the existing binding
1116.04 s
[filemanip] bound at System/FilePath/Find.hs:271:38
1116.04 s
[filemanip] |
1116.04 s
[filemanip] 274 | where visit state path depth st =
1116.04 s
[filemanip] | ^^^^^
1116.04 s
[filemanip]
1116.04 s
[filemanip] System/FilePath/Find.hs:274:21: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.04 s
[filemanip] This binding for ‘path’ shadows the existing binding
1116.04 s
[filemanip] bound at System/FilePath/Find.hs:271:44
1116.04 s
[filemanip] |
1116.04 s
[filemanip] 274 | where visit state path depth st =
1116.04 s
[filemanip] | ^^^^
1116.04 s
[filemanip]
1116.04 s
[filemanip] System/FilePath/Find.hs:274:26: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.04 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1116.04 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1116.04 s
[filemanip] |
1116.04 s
[filemanip] 274 | where visit state path depth st =
1116.04 s
[filemanip] | ^^^^^
1116.04 s
[filemanip]
1116.04 s
[filemanip] System/FilePath/Find.hs:279:9: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.04 s
[filemanip] This binding for ‘traverse’ shadows the existing binding
1116.04 s
[filemanip] imported from ‘Prelude’ at System/FilePath/Find.hs:39:8-27
1116.04 s
[filemanip] (and originally defined in ‘Data.Traversable’)
1116.04 s
[filemanip] |
1116.04 s
[filemanip] 279 | traverse state dir depth dirSt = handle (errHandler dir state) $
1116.04 s
[filemanip] | ^^^^^^^^
1116.04 s
[filemanip]
1116.04 s
[filemanip] System/FilePath/Find.hs:279:18: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.04 s
[filemanip] This binding for ‘state’ shadows the existing binding
1116.04 s
[filemanip] bound at System/FilePath/Find.hs:271:38
1116.04 s
[filemanip] |
1116.05 s
[filemanip] 279 | traverse state dir depth dirSt = handle (errHandler dir state) $
1116.05 s
[filemanip] | ^^^^^
1116.05 s
[filemanip]
1116.05 s
[filemanip] System/FilePath/Find.hs:279:28: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.05 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1116.05 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1116.05 s
[filemanip] |
1116.05 s
[ghc-lib-parser-ex] parseModule (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:108)
1116.05 s
[ghc-lib-parser-ex] parseSignature (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:115)
1116.05 s
[ghc-lib-parser-ex] parseImport (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:118)
1116.05 s
[ghc-lib-parser-ex] parseStatement (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:121)
1116.05 s
[ghc-lib-parser-ex] parseBackpack (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:124)
1116.05 s
[ghc-lib-parser-ex] parseDeclaration (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:127)
1116.05 s
[ghc-lib-parser-ex] parseExpression (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:131)
1116.05 s
[ghc-lib-parser-ex] parsePattern (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:149)
1116.05 s
[ghc-lib-parser-ex] parseTypeSignature (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:152)
1116.05 s
[ghc-lib-parser-ex] parseStmt (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:155)
1116.05 s
[ghc-lib-parser-ex] parseIdentifier (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:162)
1116.05 s
[ghc-lib-parser-ex] parseType (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:165)
1116.05 s
[ghc-lib-parser-ex] parseHeader (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:172)
1116.05 s
[ghc-lib-parser-ex] parse (src/Language/Haskell/GhclibParserEx/GHC/Parser.hs:92)
1116.05 s
[ghc-lib-parser-ex] 0% ( 0 / 2) in 'Language.Haskell.GhclibParserEx.GHC.Settings.Config'
1116.05 s
[ghc-lib-parser-ex] Missing documentation for:
1116.05 s
[ghc-lib-parser-ex] Module header
1116.05 s
[ghc-lib-parser-ex] fakeSettings (src/Language/Haskell/GhclibParserEx/GHC/Settings/Config.hs:34)
1116.05 s
[ghc-lib-parser-ex] 0% ( 0 / 7) in 'Language.Haskell.GhclibParserEx.GHC.Types.Name.Reader'
1116.05 s
[ghc-lib-parser-ex] Missing documentation for:
1116.05 s
[ghc-lib-parser-ex] Module header
1116.05 s
[ghc-lib-parser-ex] occNameStr (src/Language/Haskell/GhclibParserEx/GHC/Types/Name/Reader.hs:27)
1116.05 s
[ghc-lib-parser-ex] rdrNameStr (src/Language/Haskell/GhclibParserEx/GHC/Types/Name/Reader.hs:33)
1116.05 s
[ghc-lib-parser-ex] isSpecial (src/Language/Haskell/GhclibParserEx/GHC/Types/Name/Reader.hs:41)
1116.05 s
[ghc-lib-parser-ex] unqual (src/Language/Haskell/GhclibParserEx/GHC/Types/Name/Reader.hs:51)
1116.05 s
[ghc-lib-parser-ex] fromQual (src/Language/Haskell/GhclibParserEx/GHC/Types/Name/Reader.hs:60)
1116.05 s
[ghc-lib-parser-ex] isSymbolRdrName (src/Language/Haskell/GhclibParserEx/GHC/Types/Name/Reader.hs:67)
1116.05 s
[ghc-lib-parser-ex] 0% ( 0 / 49) in 'Language.Haskell.GhclibParserEx.GHC.Hs.Expr'
1116.05 s
[ghc-lib-parser-ex] Missing documentation for:
1116.05 s
[ghc-lib-parser-ex] Module header
1116.05 s
[ghc-lib-parser-ex] isTag (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:68)
1116.05 s
[ghc-lib-parser-ex] isDol (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:73)
1116.05 s
[ghc-lib-parser-ex] isDot (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:74)
1116.05 s
[ghc-lib-parser-ex] isReturn (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:75)
1116.05 s
[ghc-lib-parser-ex] isSection (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:76)
1116.05 s
[ghc-lib-parser-ex] isRecConstr (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:77)
1116.05 s
[ghc-lib-parser-ex] isRecUpdate (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:78)
1116.05 s
[ghc-lib-parser-ex] isVar (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:79)
1116.05 s
[ghc-lib-parser-ex] isPar (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:80)
1116.05 s
[ghc-lib-parser-ex] isApp (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:81)
1116.05 s
[ghc-lib-parser-ex] isOpApp (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:82)
1116.05 s
[ghc-lib-parser-ex] isAnyApp (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:83)
1116.05 s
[ghc-lib-parser-ex] isDo (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:84)
1116.05 s
[ghc-lib-parser-ex] isLexeme (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:85)
1116.05 s
[ghc-lib-parser-ex] isLambda (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:91)
1116.05 s
[ghc-lib-parser-ex] isQuasiQuote (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:100)
1116.05 s
[ghc-lib-parser-ex] isQuasiQuoteExpr (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:95)
1116.05 s
[ghc-lib-parser-ex] isQuasiQuoteSplice (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:138)
1116.05 s
[ghc-lib-parser-ex] isOverLabel (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:130)
1116.05 s
[ghc-lib-parser-ex] isDotApp (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:101)
1116.05 s
[ghc-lib-parser-ex] isTypeApp (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:102)
1116.05 s
[ghc-lib-parser-ex] isWHNF (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:103)
1116.05 s
[ghc-lib-parser-ex] isLCase (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:128)
1116.05 s
[ghc-lib-parser-ex] isFieldPun (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:154)
1116.05 s
[ghc-lib-parser-ex] isFieldPunUpdate (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:164)
1116.05 s
[ghc-lib-parser-ex] isRecStmt (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:175)
1116.05 s
[ghc-lib-parser-ex] isLetStmt (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:178)
1116.05 s
[ghc-lib-parser-ex] isParComp (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:181)
1116.05 s
[ghc-lib-parser-ex] isMDo (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:187)
1116.05 s
[ghc-lib-parser-ex] isListComp (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:191)
1116.05 s
[ghc-lib-parser-ex] isMonadComp (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:189)
1116.05 s
[monoid-subclasses] RightReductiveMonoid (src/Data/Monoid/Cancellative.hs:54)
1116.05 s
[monoid-subclasses] LeftCancellativeMonoid (src/Data/Monoid/Cancellative.hs:56)
1116.05 s
[monoid-subclasses] RightCancellativeMonoid (src/Data/Monoid/Cancellative.hs:57)
1116.05 s
[monoid-subclasses] Warning: 'Product' is ambiguous. It is defined
1116.05 s
[monoid-subclasses] * in ‘Data.Semigroup.Internal’
1116.05 s
[monoid-subclasses] * in ‘Data.Semigroup.Internal’
1116.05 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.05 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.05 s
[monoid-subclasses] Defaulting to the one defined in ‘Data.Semigroup.Internal’
1116.05 s
[monoid-subclasses] Warning: 'foldr' is ambiguous. It is defined
1116.05 s
[monoid-subclasses] * in ‘Data.Foldable’
1116.05 s
[monoid-subclasses] * in ‘Data.ByteString’
1116.05 s
[monoid-subclasses] * in ‘Data.ByteString.Lazy’
1116.05 s
[monoid-subclasses] * in ‘Data.IntMap.Internal’
1116.05 s
[monoid-subclasses] * in ‘Data.IntSet.Internal’
1116.05 s
[monoid-subclasses] * in ‘Data.Map.Internal’
1116.05 s
[monoid-subclasses] * in ‘Data.Set.Internal’
1116.05 s
[monoid-subclasses] * at src/Data/Semigroup/Factorial.hs:81:4
1116.05 s
[monoid-subclasses] * in ‘Data.Text’
1116.05 s
[monoid-subclasses] * in ‘Data.Text.Lazy’
1116.05 s
[monoid-subclasses] * in ‘Data.Vector’
1116.05 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.05 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.05 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Semigroup/Factorial.hs:81:4
1116.05 s
[monoid-subclasses] Warning: 'length' is ambiguous. It is defined
1116.05 s
[monoid-subclasses] * in ‘Data.Foldable’
1116.05 s
[monoid-subclasses] * in ‘Data.ByteString’
1116.05 s
[monoid-subclasses] * in ‘Data.ByteString.Lazy’
1116.05 s
[monoid-subclasses] * in ‘Data.Sequence.Internal’
1116.05 s
[monoid-subclasses] * at src/Data/Semigroup/Factorial.hs:83:4
1116.05 s
[monoid-subclasses] * in ‘Data.Text’
1116.05 s
[monoid-subclasses] * in ‘Data.Text.Lazy’
1116.05 s
[monoid-subclasses] * in ‘Data.Vector’
1116.05 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.05 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.05 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Semigroup/Factorial.hs:83:4
1116.05 s
[monoid-subclasses] 100% ( 7 / 7) in 'Data.Semigroup.Factorial'
1116.05 s
[monoid-subclasses] Warning: 'Product' is ambiguous. It is defined
1116.05 s
[monoid-subclasses] * in ‘Data.Semigroup.Internal’
1116.05 s
[monoid-subclasses] * in ‘Data.Semigroup.Internal’
1116.05 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.05 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.05 s
[monoid-subclasses] Defaulting to the one defined in ‘Data.Semigroup.Internal’
1116.05 s
[monoid-subclasses] Warning: 'span' is ambiguous. It is defined
1116.05 s
[monoid-subclasses] * in ‘GHC.List’
1116.05 s
[monoid-subclasses] * in ‘Data.ByteString’
1116.05 s
[monoid-subclasses] * in ‘Data.ByteString.Lazy’
1116.05 s
[monoid-subclasses] * at src/Data/Monoid/Factorial.hs:89:4
1116.05 s
[monoid-subclasses] * in ‘Data.Text’
1116.05 s
[monoid-subclasses] * in ‘Data.Text.Lazy’
1116.05 s
[monoid-subclasses] * in ‘Data.Vector’
1116.05 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.05 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.05 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Monoid/Factorial.hs:89:4
1116.05 s
[monoid-subclasses] 75% ( 3 / 4) in 'Data.Monoid.Factorial'
1116.05 s
[monoid-subclasses] Missing documentation for:
1116.05 s
[monoid-subclasses] StableFactorialMonoid (src/Data/Monoid/Factorial.hs:164)
1116.05 s
[monoid-subclasses] Warning: 'foldr' is ambiguous. It is defined
1116.05 s
[monoid-subclasses] * in ‘Data.Foldable’
1116.05 s
[monoid-subclasses] * at src/Data/Monoid/Textual.hs:126:4
1116.05 s
[monoid-subclasses] * at src/Data/Semigroup/Factorial.hs:81:4
1116.05 s
[monoid-subclasses] * in ‘Data.Text’
1116.05 s
[monoid-subclasses] * in ‘Data.Text.Lazy’
1116.05 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.05 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.05 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Semigroup/Factorial.hs:81:4
1116.05 s
[monoid-subclasses] Warning: 'Text' is ambiguous. It is defined
1116.05 s
[monoid-subclasses] * in ‘Data.Text.Internal’
1116.05 s
[monoid-subclasses] * in ‘Data.Text.Internal.Lazy’
1116.05 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.05 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.05 s
[monoid-subclasses] Defaulting to the one defined in ‘Data.Text.Internal.Lazy’
1116.05 s
[monoid-subclasses] Warning: 'foldl' is ambiguous. It is defined
1116.05 s
[monoid-subclasses] * in ‘Data.Foldable’
1116.05 s
[monoid-subclasses] * at src/Data/Monoid/Textual.hs:121:4
1116.05 s
[monoid-subclasses] * at src/Data/Semigroup/Factorial.hs:77:4
1116.05 s
[monoid-subclasses] * in ‘Data.Text’
1116.05 s
[monoid-subclasses] * in ‘Data.Text.Lazy’
1116.05 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.05 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.05 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Semigroup/Factorial.hs:77:4
1116.05 s
[monoid-subclasses] Warning: 'span' is ambiguous. It is defined
1116.05 s
[monoid-subclasses] * in ‘GHC.List’
1116.05 s
[monoid-subclasses] * at src/Data/Monoid/Factorial.hs:89:4
1116.05 s
[monoid-subclasses] * at src/Data/Monoid/Textual.hs:156:4
1116.05 s
[monoid-subclasses] * in ‘Data.Text’
1116.05 s
[monoid-subclasses] * in ‘Data.Text.Lazy’
1116.05 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.05 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.05 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Monoid/Textual.hs:156:4
1116.05 s
[shake] Dependency time: using time-1.12.2
1116.05 s
[shake] Dependency transformers >=0.2: using transformers-0.6.1.0
1116.05 s
[shake] Dependency unix >=2.5.1: using unix-2.8.3.0
1116.05 s
[shake] Dependency unordered-containers >=0.2.7: using unordered-containers-0.2.20
1116.05 s
[shake] Dependency utf8-string >=0.3: using utf8-string-1.0.2
1116.05 s
[shake] Source component graph:
1116.05 s
[shake] component exe:shake
1116.05 s
[shake] component lib
1116.05 s
[shake] Configured component graph:
1116.05 s
[shake] component shake-0.19.8-INDvknM10CN7mJfU273YTP-shake
1116.05 s
[shake] include base-4.19.0.0-b960
1116.05 s
[shake] include binary-0.8.9.1-0e3e
1116.06 s
[shake] include bytestring-0.12.0.2-4690
1116.06 s
[shake] include deepseq-1.5.0.0-412f
1116.06 s
[shake] include directory-1.3.8.1-6a8e
1116.06 s
[shake] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1116.06 s
[shake] include filepath-1.4.100.4-fa1c
1116.06 s
[shake] include filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d
1116.06 s
[shake] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1116.06 s
[shake] include heaps-0.4.1-2AdtVAlydox2XXVzB8vjUR
1116.06 s
[shake] include js-dgtable-0.5.2-FHHcjRz7tJFFli9kOrBJaV
1116.06 s
[shake] include js-flot-0.8.3-Eor4cMh3BIMGLuP2kpOPu9
1116.06 s
[shake] include js-jquery-3.3.1-FRZjOWYcfA5B8ZSPMw6KGP
1116.06 s
[shake] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1116.06 s
[shake] include process-1.6.18.0-26fa
1116.06 s
[shake] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1116.06 s
[shake] include time-1.12.2-d26d
1116.06 s
[shake] include transformers-0.6.1.0-c3ec
1116.06 s
[shake] include unix-2.8.3.0-8aa6
1116.06 s
[shake] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1116.06 s
[shake] include utf8-string-1.0.2-3f0Yb0EPatE18c5eXZUE9
1116.06 s
[shake] component shake-0.19.8-3FCaRvebiS3CdqCMPQhT3v
1116.06 s
[shake] include base-4.19.0.0-b960
1116.06 s
[shake] include binary-0.8.9.1-0e3e
1116.06 s
[shake] include bytestring-0.12.0.2-4690
1116.06 s
[shake] include deepseq-1.5.0.0-412f
1116.06 s
[shake] include directory-1.3.8.1-6a8e
1116.06 s
[shake] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1116.06 s
[shake] include filepath-1.4.100.4-fa1c
1116.06 s
[shake] include filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d
1116.06 s
[shake] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1116.06 s
[shake] include heaps-0.4.1-2AdtVAlydox2XXVzB8vjUR
1116.06 s
[shake] include js-dgtable-0.5.2-FHHcjRz7tJFFli9kOrBJaV
1116.06 s
[shake] include js-flot-0.8.3-Eor4cMh3BIMGLuP2kpOPu9
1116.06 s
[shake] include js-jquery-3.3.1-FRZjOWYcfA5B8ZSPMw6KGP
1116.06 s
[shake] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1116.06 s
[shake] include process-1.6.18.0-26fa
1116.06 s
[shake] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1116.06 s
[shake] include time-1.12.2-d26d
1116.06 s
[shake] include transformers-0.6.1.0-c3ec
1116.06 s
[shake] include unix-2.8.3.0-8aa6
1116.06 s
[shake] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1116.06 s
[shake] include utf8-string-1.0.2-3f0Yb0EPatE18c5eXZUE9
1116.06 s
[shake] Linked component graph:
1116.06 s
[shake] unit shake-0.19.8-INDvknM10CN7mJfU273YTP-shake
1116.06 s
[shake] include base-4.19.0.0-b960
1116.06 s
[shake] include binary-0.8.9.1-0e3e
1116.06 s
[shake] include bytestring-0.12.0.2-4690
1116.06 s
[shake] include deepseq-1.5.0.0-412f
1116.06 s
[shake] include directory-1.3.8.1-6a8e
1116.06 s
[shake] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1116.06 s
[shake] include filepath-1.4.100.4-fa1c
1116.06 s
[shake] include filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d
1116.06 s
[shake] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1116.06 s
[shake] include heaps-0.4.1-2AdtVAlydox2XXVzB8vjUR
1116.06 s
[shake] include js-dgtable-0.5.2-FHHcjRz7tJFFli9kOrBJaV
1116.06 s
[shake] include js-flot-0.8.3-Eor4cMh3BIMGLuP2kpOPu9
1116.06 s
[shake] include js-jquery-3.3.1-FRZjOWYcfA5B8ZSPMw6KGP
1116.06 s
[shake] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1116.06 s
[shake] include process-1.6.18.0-26fa
1116.06 s
[shake] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1116.06 s
[shake] include time-1.12.2-d26d
1116.06 s
[shake] include transformers-0.6.1.0-c3ec
1116.06 s
[shake] include unix-2.8.3.0-8aa6
1116.06 s
[shake] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1116.06 s
[shake] include utf8-string-1.0.2-3f0Yb0EPatE18c5eXZUE9
1116.06 s
[shake] unit shake-0.19.8-3FCaRvebiS3CdqCMPQhT3v
1116.06 s
[shake] include base-4.19.0.0-b960
1116.06 s
[shake] include binary-0.8.9.1-0e3e
1116.06 s
[shake] include bytestring-0.12.0.2-4690
1116.06 s
[shake] include deepseq-1.5.0.0-412f
1116.06 s
[shake] include directory-1.3.8.1-6a8e
1116.06 s
[shake] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1116.06 s
[shake] include filepath-1.4.100.4-fa1c
1116.06 s
[shake] include filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d
1116.06 s
[shake] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1116.06 s
[shake] include heaps-0.4.1-2AdtVAlydox2XXVzB8vjUR
1116.06 s
[shake] include js-dgtable-0.5.2-FHHcjRz7tJFFli9kOrBJaV
1116.06 s
[shake] include js-flot-0.8.3-Eor4cMh3BIMGLuP2kpOPu9
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
1116.06 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
1116.06 s
[filemanip] 279 | traverse state dir depth dirSt = handle (errHandler dir state) $
1116.06 s
[filemanip] | ^^^^^
1116.06 s
[filemanip]
1116.06 s
[filemanip] System/FilePath/Find.hs:282:53: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.06 s
[filemanip] This binding for ‘state’ shadows the existing binding
1116.06 s
[filemanip] bound at System/FilePath/Find.hs:279:18
1116.06 s
[filemanip] |
1116.06 s
[filemanip] 282 | in state' `seq` flip foldM state' (\state name ->
1116.06 s
[filemanip] | ^^^^^
1116.06 s
[filemanip]
1116.06 s
[filemanip] System/FilePath/Find.hs:284:25: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.06 s
[filemanip] This binding for ‘path’ shadows the existing binding
1116.06 s
[filemanip] bound at System/FilePath/Find.hs:271:44
1116.06 s
[filemanip] |
1116.06 s
[filemanip] 284 | let path = dir </> name
1116.06 s
[filemanip] | ^^^^
1116.06 s
[filemanip] [4 of 4] Compiling System.FilePath.Manip ( System/FilePath/Manip.hs, dist/build/System/FilePath/Manip.o, dist/build/System/FilePath/Manip.dyn_o )
1116.06 s
[filemanip] [1 of 4] Compiling System.FilePath.GlobPattern ( System/FilePath/GlobPattern.hs, dist/build/System/FilePath/GlobPattern.p_o )
1116.06 s
[filemanip]
1116.06 s
[filemanip] System/FilePath/GlobPattern.hs:130:49: warning : [ GHC-63394 ] [ -Wx-partial ]
1116.06 s
[filemanip] In the use of ‘head’
1116.06 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1116.06 s
[filemanip] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1116.06 s
[filemanip] |
1116.06 s
[filemanip] 130 | | otherwise = let hs = map head ss
1116.06 s
[filemanip] | ^^^^
1116.06 s
[filemanip]
1116.06 s
[filemanip] System/FilePath/GlobPattern.hs:131:44: warning : [ GHC-63394 ] [ -Wx-partial ]
1116.06 s
[filemanip] In the use of ‘head’
1116.06 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1116.06 s
[filemanip] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1116.06 s
[filemanip] |
1116.06 s
[filemanip] 131 | h = head hs
1116.06 s
[filemanip] | ^^^^
1116.06 s
[filemanip]
1116.06 s
[filemanip] System/FilePath/GlobPattern.hs:132:54: warning : [ GHC-63394 ] [ -Wx-partial ]
1116.06 s
[filemanip] In the use of ‘tail’
1116.06 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1116.06 s
[filemanip] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1116.06 s
[filemanip] |
1116.06 s
[filemanip] 132 | in if all (h==) $ tail hs
1116.07 s
[filemanip] | ^^^^
1116.07 s
[filemanip]
1116.07 s
[filemanip] System/FilePath/GlobPattern.hs:133:62: warning : [ GHC-63394 ] [ -Wx-partial ]
1116.07 s
[filemanip] In the use of ‘tail’
1116.07 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1116.07 s
[filemanip] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1116.07 s
[filemanip] |
1116.07 s
[filemanip] 133 | then pfx (h:acc) $ map tail ss
1116.07 s
[filemanip] | ^^^^
1116.07 s
[filemanip]
1116.07 s
[ghc-lib-parser-ex] isTupleSection (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:209)
1116.07 s
[ghc-lib-parser-ex] isString (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:212)
1116.07 s
[ghc-lib-parser-ex] isPrimLiteral (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:215)
1116.07 s
[ghc-lib-parser-ex] isSpliceDecl (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:238)
1116.07 s
[ghc-lib-parser-ex] isTypedSplice (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:231)
1116.07 s
[ghc-lib-parser-ex] isUntypedSplice (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:232)
1116.07 s
[ghc-lib-parser-ex] isFieldWildcard (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:262)
1116.07 s
[ghc-lib-parser-ex] isUnboxed (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:287)
1116.07 s
[ghc-lib-parser-ex] isWholeFrac (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:293)
1116.07 s
[ghc-lib-parser-ex] isStrictMatch (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:148)
1116.07 s
[ghc-lib-parser-ex] isMultiIf (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:247)
1116.07 s
[ghc-lib-parser-ex] isProc (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:250)
1116.07 s
[ghc-lib-parser-ex] isTransStmt (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:253)
1116.07 s
[ghc-lib-parser-ex] hasFieldsDotDot (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:172)
1116.07 s
[ghc-lib-parser-ex] varToStr (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:305)
1116.07 s
[ghc-lib-parser-ex] strToVar (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:315)
1116.07 s
[ghc-lib-parser-ex] fromChar (src/Language/Haskell/GhclibParserEx/GHC/Hs/Expr.hs:323)
1116.07 s
[ghc-lib-parser-ex] 0% ( 0 / 2) in 'Language.Haskell.GhclibParserEx.GHC.Utils.Outputable'
1116.07 s
[ghc-lib-parser-ex] Missing documentation for:
1116.07 s
[ghc-lib-parser-ex] Module header
1116.07 s
[ghc-lib-parser-ex] unsafePrettyPrint (src/Language/Haskell/GhclibParserEx/GHC/Utils/Outputable.hs:17)
1116.07 s
[ghc-lib-parser-ex] Documentation created: dist/doc/html/ghc-lib-parser-ex/,
1116.07 s
[ghc-lib-parser-ex] dist/doc/html/ghc-lib-parser-ex/ghc-lib-parser-ex.txt
1116.07 s
[ghc-lib-parser-ex] Preprocessing test suite 'ghc-lib-parser-ex-test' for ghc-lib-parser-ex-9.8.0.2..
1116.07 s
[ghc-lib-parser-ex] haddockPhase completed in 34 seconds
1116.07 s
[ghc-lib-parser-ex] Phase: installPhase
1116.07 s
[ghc-lib-parser-ex] Installing library in /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/ghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d
1116.07 s
[ghc-lib-parser-ex] Phase: fixupPhase
1116.07 s
[ghc-lib-parser-ex] shrinking RPATHs of ELF executables and libraries in /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2
1116.07 s
[ghc-lib-parser-ex] shrinking /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSghc-lib-parser-ex-9.8.0.2-9UlIcF2bsmO9IGmZ24I82d-ghc9.8.1.so
1116.07 s
[ghc-lib-parser-ex] checking for references to /build/ in /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2...
1116.07 s
[ghc-lib-parser-ex] patching script interpreter paths in /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2
1116.07 s
[ghc-lib-parser-ex] stripping (with command strip and flags -S -p) in /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2/lib
1116.07 s
[ghc-lib-parser-ex] shrinking RPATHs of ELF executables and libraries in /nix/store/xyiz5m8cd715vsb5ik7birf0zklz4rj4-ghc-lib-parser-ex-9.8.0.2-doc
1116.07 s
[ghc-lib-parser-ex] checking for references to /build/ in /nix/store/xyiz5m8cd715vsb5ik7birf0zklz4rj4-ghc-lib-parser-ex-9.8.0.2-doc...
1116.07 s
[ghc-lib-parser-ex] patching script interpreter paths in /nix/store/xyiz5m8cd715vsb5ik7birf0zklz4rj4-ghc-lib-parser-ex-9.8.0.2-doc
1116.07 s
[monoid-subclasses] Warning: 'spanMaybe' is ambiguous. It is defined
1116.07 s
[monoid-subclasses] * at src/Data/Monoid/Factorial.hs:100:4
1116.07 s
[monoid-subclasses] * at src/Data/Monoid/Textual.hs:158:4
1116.07 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.07 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.07 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Monoid/Textual.hs:158:4
1116.07 s
[monoid-subclasses] 100% ( 2 / 2) in 'Data.Monoid.Textual'
1116.07 s
[monoid-subclasses] 100% ( 1 / 1) in 'Data.Monoid.Instances.CharVector'
1116.07 s
[monoid-subclasses] Warning: 'Stateful' is ambiguous. It is defined
1116.07 s
[monoid-subclasses] * at src/Data/Monoid/Instances/Stateful.hs:45:24
1116.07 s
[monoid-subclasses] * at src/Data/Monoid/Instances/Stateful.hs:45:1
1116.07 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.07 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.07 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Monoid/Instances/Stateful.hs:45:1
1116.07 s
[monoid-subclasses] 40% ( 2 / 5) in 'Data.Monoid.Instances.Stateful'
1116.07 s
[monoid-subclasses] Missing documentation for:
1116.07 s
[monoid-subclasses] extract (src/Data/Monoid/Instances/Stateful.hs:48)
1116.07 s
[monoid-subclasses] state (src/Data/Monoid/Instances/Stateful.hs:51)
1116.07 s
[monoid-subclasses] setState (src/Data/Monoid/Instances/Stateful.hs:54)
1116.07 s
[monoid-subclasses] Warning: 'Shadowed' is ambiguous. It is defined
1116.07 s
[monoid-subclasses] * at src/Data/Monoid/Instances/PrefixMemory.hs:37:19
1116.07 s
[monoid-subclasses] * at src/Data/Monoid/Instances/PrefixMemory.hs:37:1
1116.07 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.07 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.07 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Monoid/Instances/PrefixMemory.hs:37:1
1116.07 s
[monoid-subclasses] Warning: 'stripPrefix' is ambiguous. It is defined
1116.07 s
[monoid-subclasses] * in ‘Data.OldList’
1116.07 s
[monoid-subclasses] * at src/Data/Semigroup/Cancellative.hs:94:4
1116.07 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.07 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.07 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Semigroup/Cancellative.hs:94:4
1116.07 s
[monoid-subclasses] 100% ( 5 / 5) in 'Data.Monoid.Instances.PrefixMemory'
1116.07 s
[monoid-subclasses] Warning: 'OffsetPositioned' is ambiguous. It is defined
1116.07 s
[monoid-subclasses] * at src/Data/Monoid/Instances/Positioned.hs:52:27
1116.07 s
[monoid-subclasses] * at src/Data/Monoid/Instances/Positioned.hs:52:1
1116.07 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.07 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.07 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Monoid/Instances/Positioned.hs:52:1
1116.07 s
[monoid-subclasses] Warning: 'LinePositioned' is ambiguous. It is defined
1116.07 s
[monoid-subclasses] * at src/Data/Monoid/Instances/Positioned.hs:56:25
1116.07 s
[monoid-subclasses] * at src/Data/Monoid/Instances/Positioned.hs:56:1
1116.07 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.07 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.07 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Monoid/Instances/Positioned.hs:56:1
1116.07 s
[monoid-subclasses] 42% ( 3 / 7) in 'Data.Monoid.Instances.Positioned'
1116.07 s
[monoid-subclasses] Missing documentation for:
1116.07 s
[monoid-subclasses] OffsetPositioned (src/Data/Monoid/Instances/Positioned.hs:52)
1116.07 s
[monoid-subclasses] LinePositioned (src/Data/Monoid/Instances/Positioned.hs:56)
1116.07 s
[monoid-subclasses] extract
1116.07 s
[monoid-subclasses] position
1116.07 s
[monoid-subclasses] Warning: 'Measured' is ambiguous. It is defined
1116.07 s
[monoid-subclasses] * at src/Data/Monoid/Instances/Measured.hs:39:19
1116.07 s
[monoid-subclasses] * at src/Data/Monoid/Instances/Measured.hs:39:1
1116.07 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.07 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.07 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Monoid/Instances/Measured.hs:39:1
1116.07 s
[monoid-subclasses] Warning: 'length' is ambiguous. It is defined
1116.07 s
[monoid-subclasses] * in ‘Data.Foldable’
1116.07 s
[monoid-subclasses] * at src/Data/Semigroup/Factorial.hs:83:4
1116.07 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.07 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.07 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Semigroup/Factorial.hs:83:4
1116.07 s
[monoid-subclasses] 75% ( 3 / 4) in 'Data.Monoid.Instances.Measured'
1116.07 s
[monoid-subclasses] Missing documentation for:
1116.07 s
[monoid-subclasses] extract
1116.07 s
[monoid-subclasses] 40% ( 2 / 5) in 'Data.Monoid.Instances.Concat'
1116.07 s
[monoid-subclasses] Missing documentation for:
1116.07 s
[monoid-subclasses] concatenate (src/Data/Monoid/Instances/Concat.hs:54)
1116.07 s
[monoid-subclasses] extract (src/Data/Monoid/Instances/Concat.hs:59)
1116.07 s
[monoid-subclasses] force (src/Data/Monoid/Instances/Concat.hs:62)
1116.07 s
[monoid-subclasses] Warning: 'ByteStringUTF8' is ambiguous. It is defined
1116.07 s
[monoid-subclasses] * at src/Data/Monoid/Instances/ByteString/UTF8.hs:73:26
1116.07 s
[monoid-subclasses] * at src/Data/Monoid/Instances/ByteString/UTF8.hs:73:1
1116.07 s
[monoid-subclasses] You may be able to disambiguate the identifier by qualifying it or
1116.07 s
[monoid-subclasses] by specifying the type/value namespace explicitly.
1116.07 s
[shake] include js-jquery-3.3.1-FRZjOWYcfA5B8ZSPMw6KGP
1116.07 s
[shake] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1116.07 s
[shake] include process-1.6.18.0-26fa
1116.07 s
[shake] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1116.07 s
[shake] include time-1.12.2-d26d
1116.07 s
[shake] include transformers-0.6.1.0-c3ec
1116.07 s
[shake] include unix-2.8.3.0-8aa6
1116.07 s
[shake] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1116.07 s
[shake] include utf8-string-1.0.2-3f0Yb0EPatE18c5eXZUE9
1116.07 s
[shake] Development.Shake=shake-0.19.8-3FCaRvebiS3CdqCMPQhT3v:Development.Shake,Development.Shake.Classes=shake-0.19.8-3FCaRvebiS3CdqCMPQhT3v:Development.Shake.Classes,Development.Shake.Command=shake-0.19.8-3FCaRvebiS3CdqCMPQhT3v:Development.Shake.Command,Development.Shake.Config=shake-0.19.8-3FCaRvebiS3CdqCMPQhT3v:Development.Shake.Config,Development.Shake.Database=shake-0.19.8-3FCaRvebiS3CdqCMPQhT3v:Development.Shake.Database,Development.Shake.FilePath=shake-0.19.8-3FCaRvebiS3CdqCMPQhT3v:Development.Shake.FilePath,Development.Shake.Forward=shake-0.19.8-3FCaRvebiS3CdqCMPQhT3v:Development.Shake.Forward,Development.Shake.Rule=shake-0.19.8-3FCaRvebiS3CdqCMPQhT3v:Development.Shake.Rule,Development.Shake.Util=shake-0.19.8-3FCaRvebiS3CdqCMPQhT3v:Development.Shake.Util
1116.07 s
[shake] Ready component graph:
1116.07 s
[shake] definite shake-0.19.8-INDvknM10CN7mJfU273YTP-shake
1116.07 s
[shake] depends base-4.19.0.0-b960
1116.07 s
[shake] depends binary-0.8.9.1-0e3e
1116.07 s
[shake] depends bytestring-0.12.0.2-4690
1116.07 s
[shake] depends deepseq-1.5.0.0-412f
1116.07 s
[shake] depends directory-1.3.8.1-6a8e
1116.07 s
[shake] depends extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1116.07 s
[shake] depends filepath-1.4.100.4-fa1c
1116.07 s
[shake] depends filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d
1116.07 s
[shake] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1116.07 s
[shake] depends heaps-0.4.1-2AdtVAlydox2XXVzB8vjUR
1116.07 s
[shake] depends js-dgtable-0.5.2-FHHcjRz7tJFFli9kOrBJaV
1116.07 s
[shake] depends js-flot-0.8.3-Eor4cMh3BIMGLuP2kpOPu9
1116.07 s
[shake] depends js-jquery-3.3.1-FRZjOWYcfA5B8ZSPMw6KGP
1116.07 s
[shake] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1116.07 s
[shake] depends process-1.6.18.0-26fa
1116.07 s
[shake] depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1116.07 s
[shake] depends time-1.12.2-d26d
1116.07 s
[shake] depends transformers-0.6.1.0-c3ec
1116.07 s
[shake] depends unix-2.8.3.0-8aa6
1116.07 s
[shake] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1116.07 s
[shake] depends utf8-string-1.0.2-3f0Yb0EPatE18c5eXZUE9
1116.07 s
[shake] definite shake-0.19.8-3FCaRvebiS3CdqCMPQhT3v
1116.07 s
[shake] depends base-4.19.0.0-b960
1116.07 s
[shake] depends binary-0.8.9.1-0e3e
1116.07 s
[shake] depends bytestring-0.12.0.2-4690
1116.07 s
[shake] depends deepseq-1.5.0.0-412f
1116.07 s
[shake] depends directory-1.3.8.1-6a8e
1116.07 s
[shake] depends extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
1116.07 s
[shake] depends filepath-1.4.100.4-fa1c
1116.07 s
[shake] depends filepattern-0.1.3-C5ZdfR7Ip1J19zhk6Q3p4d
1116.07 s
[shake] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1116.07 s
[shake] depends heaps-0.4.1-2AdtVAlydox2XXVzB8vjUR
1116.07 s
[shake] depends js-dgtable-0.5.2-FHHcjRz7tJFFli9kOrBJaV
1116.07 s
[shake] depends js-flot-0.8.3-Eor4cMh3BIMGLuP2kpOPu9
1116.07 s
[shake] depends js-jquery-3.3.1-FRZjOWYcfA5B8ZSPMw6KGP
1116.07 s
[shake] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1116.07 s
[shake] depends process-1.6.18.0-26fa
1116.07 s
[shake] depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1116.08 s
[shake] depends time-1.12.2-d26d
1116.08 s
[shake] depends transformers-0.6.1.0-c3ec
1116.08 s
[shake] depends unix-2.8.3.0-8aa6
1116.08 s
[shake] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1116.08 s
[shake] depends utf8-string-1.0.2-3f0Yb0EPatE18c5eXZUE9
1116.08 s
[shake] Using Cabal-3.10.2.0 compiled by ghc-9.8
1116.08 s
[shake] Using compiler: ghc-9.8.1
1116.08 s
[shake] Using install prefix: /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8
1116.08 s
[shake] Executables installed in:
1116.08 s
[shake] /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8/bin
1116.08 s
[shake] Libraries installed in:
1116.08 s
[shake] /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/shake-0.19.8-3FCaRvebiS3CdqCMPQhT3v
1116.08 s
[shake] Dynamic Libraries installed in:
1116.08 s
[shake] /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1116.08 s
[shake] Private executables installed in:
1116.08 s
[shake] /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8/libexec/x86_64-linux-ghc-9.8.1/shake-0.19.8
1116.08 s
[shake] Data files installed in:
1116.08 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
1116.08 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
1116.08 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
1116.08 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
1116.08 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
1116.08 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
1116.08 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
1116.08 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
1116.08 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
1116.08 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
1116.08 s
[algebraic-graphs] inspection testing successful
1116.08 s
[algebraic-graphs] expected successes: 58
1116.08 s
[algebraic-graphs] [21 of 23] Compiling Algebra.Graph.Test.Undirected ( test/Algebra/Graph/Test/Undirected.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Undirected.o, dist/build/main/main-tmp/Algebra/Graph/Test/Undirected.dyn_o )
1116.08 s
[algebraic-graphs] [22 of 23] Compiling Data.Graph.Test.Typed ( test/Data/Graph/Test/Typed.hs, dist/build/main/main-tmp/Data/Graph/Test/Typed.o, dist/build/main/main-tmp/Data/Graph/Test/Typed.dyn_o )
1116.08 s
[algebraic-graphs] [23 of 23] Compiling Main ( test/Main.hs, dist/build/main/main-tmp/Main.o, dist/build/main/main-tmp/Main.dyn_o )
1116.08 s
[algebraic-graphs] [24 of 24] Linking dist/build/main/main
1116.08 s
[algebraic-graphs] buildPhase completed in 1 minutes 29 seconds
1116.08 s
[algebraic-graphs] Phase: checkPhase
1116.08 s
[algebraic-graphs] Running 1 test suites...
1116.08 s
[algebraic-graphs] Test suite main: RUNNING...
1116.08 s
[filemanip] System/FilePath/GlobPattern.hs:149:22: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.08 s
[filemanip] This binding for ‘g’ shadows the existing binding
1116.08 s
[filemanip] bound at System/FilePath/GlobPattern.hs:148:24
1116.08 s
[filemanip] |
1116.08 s
[filemanip] 149 | where matchGroup g = matchTerms (MatchLiteral g : ts) cs
1116.08 s
[filemanip] | ^
1116.08 s
[filemanip]
1116.08 s
[filemanip] System/FilePath/GlobPattern.hs:154:48: warning : [ GHC-63394 ] [ -Wx-partial ]
1116.08 s
[filemanip] In the use of ‘tail’
1116.08 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1116.08 s
[filemanip] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1116.08 s
[filemanip] |
1116.08 s
[filemanip] 154 | Nothing -> matchAny (tail cs')
1116.08 s
[filemanip] | ^^^^
1116.08 s
[filemanip]
1116.08 s
[filemanip] System/FilePath/GlobPattern.hs:162:48: warning : [ GHC-63394 ] [ -Wx-partial ]
1116.08 s
[filemanip] In the use of ‘tail’
1116.08 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1116.08 s
[filemanip] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1116.08 s
[filemanip] |
1116.08 s
[filemanip] 162 | Nothing -> matchDir $ tail cs'
1116.08 s
[filemanip] | ^^^^
1116.08 s
[filemanip] [2 of 4] Compiling System.FilePath.Glob ( System/FilePath/Glob.hs, dist/build/System/FilePath/Glob.p_o )
1116.08 s
[filemanip] [3 of 4] Compiling System.FilePath.Find ( System/FilePath/Find.hs, dist/build/System/FilePath/Find.p_o )
1116.08 s
[filemanip]
1116.08 s
[filemanip] System/FilePath/Find.hs:227:20: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.08 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1116.08 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1116.08 s
[filemanip] |
1116.08 s
[filemanip] 227 | where visit path depth st =
1116.08 s
[filemanip] | ^^^^^
1116.08 s
[filemanip]
1116.08 s
[filemanip] System/FilePath/Find.hs:231:9: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.08 s
[filemanip] This binding for ‘traverse’ shadows the existing binding
1116.08 s
[filemanip] imported from ‘Prelude’ at System/FilePath/Find.hs:39:8-27
1116.08 s
[filemanip] (and originally defined in ‘Data.Traversable’)
1116.08 s
[filemanip] |
1116.08 s
[filemanip] 231 | traverse dir depth dirSt = do
1116.08 s
[filemanip] | ^^^^^^^^
1116.08 s
[filemanip]
1116.08 s
[filemanip] System/FilePath/Find.hs:231:22: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.08 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1116.08 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1116.08 s
[filemanip] |
1116.08 s
[filemanip] 231 | traverse dir depth dirSt = do
1116.08 s
[filemanip] | ^^^^^
1116.08 s
[filemanip]
1116.08 s
[filemanip] System/FilePath/Find.hs:238:25: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.08 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1116.08 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1116.08 s
[filemanip] |
1116.08 s
[filemanip] 238 | filterPath path depth st result =
1116.08 s
[filemanip] | ^^^^^
1116.08 s
[filemanip]
1116.08 s
[filemanip] System/FilePath/Find.hs:274:15: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1116.08 s
[filemanip] This binding for ‘state’ shadows the existing binding
1116.08 s
[filemanip] bound at System/FilePath/Find.hs:271:38
1116.08 s
[filemanip] |
1116.40 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2 /nix/store/xyiz5m8cd715vsb5ik7birf0zklz4rj4-ghc-lib-parser-ex-9.8.0.2-doc
1117.64 s
[post-build-hook] Pushing 2 paths (79 are already present) using zstd to cache sellout ⏳
1117.64 s
[post-build-hook]
1117.99 s
[post-build-hook] Pushing /nix/store/xyiz5m8cd715vsb5ik7birf0zklz4rj4-ghc-lib-parser-ex-9.8.0.2-doc (1.28 MiB)
1118.05 s
[post-build-hook] Pushing /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2 (3.20 MiB)
1119.52 s
[post-build-hook]
1119.52 s
[post-build-hook] All done.
1119.69 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2 /nix/store/xyiz5m8cd715vsb5ik7birf0zklz4rj4-ghc-lib-parser-ex-9.8.0.2-doc
1120.02 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1120.26 s
[post-build-hook] copying 5 paths...
1120.26 s
[post-build-hook] copying path '/nix/store/4ha8aihi2jmwfpd4fzvf05ds1as1ax3a-ghc-lib-parser-9.8.5.20250214-doc' to 'https://cache.nix-ci.com'...
1120.26 s
[post-build-hook] copying path '/nix/store/ky8gc60x86vv5hy117985srsplmbwzaw-ghc-lib-parser-9.8.5.20250214-data' to 'https://cache.nix-ci.com'...
1184.46 s
[post-build-hook] copying path '/nix/store/dzjm5464iv9kajxq7vj09l1j4kdilw2a-ghc-lib-parser-9.8.5.20250214' to 'https://cache.nix-ci.com'...
1184.48 s
[post-build-hook] copying path '/nix/store/xyiz5m8cd715vsb5ik7birf0zklz4rj4-ghc-lib-parser-ex-9.8.0.2-doc' to 'https://cache.nix-ci.com'...
1534.67 s
[post-build-hook] copying path '/nix/store/fbpiisjzbigqix3bdrcy48c33mzzna4q-ghc-lib-parser-ex-9.8.0.2' to 'https://cache.nix-ci.com'...
1535.58 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1535.77 s
[post-build-hook] copying 2 paths...
1535.77 s
[post-build-hook] copying path '/nix/store/azk5p7s4w77jlr14zrmzsf28bf5ak79p-ghc-lib-parser-9.8.5.20250214.drv' to 'https://cache.nix-ci.com'...
1535.92 s
[post-build-hook] copying path '/nix/store/fhgdkj1xixv18rzkqcy38pwzq9c8msnb-ghc-lib-parser-ex-9.8.0.2.drv' to 'https://cache.nix-ci.com'...
1536.09 s
Progress: 88 of 171 built (9 building), 395 of 395 downloaded from cache
1536.10 s
[monoid-subclasses] Defaulting to the one defined at src/Data/Monoid/Instances/ByteString/UTF8.hs:73:1
1536.10 s
[monoid-subclasses] 66% ( 2 / 3) in 'Data.Monoid.Instances.ByteString.UTF8'
1536.10 s
[monoid-subclasses] Missing documentation for:
1536.10 s
[monoid-subclasses] ByteStringUTF8 (src/Data/Monoid/Instances/ByteString/UTF8.hs:73)
1536.10 s
[monoid-subclasses] Warning: Data.Monoid.Null: could not find link destinations for:
1536.10 s
[monoid-subclasses] - Data.Vector.Vector
1536.10 s
[monoid-subclasses] Warning: Data.Semigroup.Cancellative: could not find link destinations for:
1536.10 s
[monoid-subclasses] - Data.Vector.Vector
1536.10 s
[monoid-subclasses] Warning: Data.Monoid.Monus: could not find link destinations for:
1536.10 s
[monoid-subclasses] - Data.Vector.Vector
1536.10 s
[monoid-subclasses] Warning: Data.Monoid.GCD: could not find link destinations for:
1536.10 s
[monoid-subclasses] - Data.Vector.all
1536.10 s
[monoid-subclasses] - Data.Vector.Vector
1536.10 s
[monoid-subclasses] Warning: Data.Semigroup.Factorial: could not find link destinations for:
1536.10 s
[monoid-subclasses] - Data.Vector.Vector
1536.10 s
[monoid-subclasses] Warning: Data.Monoid.Factorial: could not find link destinations for:
1536.10 s
[monoid-subclasses] - Data.Vector.Vector
1536.10 s
[monoid-subclasses] Warning: Data.Monoid.Textual: could not find link destinations for:
1536.10 s
[monoid-subclasses] - Data.Vector.Vector
1536.10 s
[monoid-subclasses] Warning: Data.Monoid.Instances.CharVector: could not find link destinations for:
1536.10 s
[monoid-subclasses] - Data.Vector.Vector
1536.10 s
[monoid-subclasses] Warning: Data.Monoid.Instances.Positioned: could not find link destinations for:
1536.10 s
[monoid-subclasses] - Data.Monoid.Instances.Positioned.Positioned
1536.10 s
[monoid-subclasses] Documentation created: dist/doc/html/monoid-subclasses/,
1536.10 s
[monoid-subclasses] dist/doc/html/monoid-subclasses/monoid-subclasses.txt
1536.10 s
[monoid-subclasses] Preprocessing test suite 'Main' for monoid-subclasses-1.2.6..
1536.10 s
[monoid-subclasses] haddockPhase completed in 49 seconds
1536.10 s
[monoid-subclasses] Phase: installPhase
1536.10 s
[monoid-subclasses] Installing library in /nix/store/dyykf7339dkcpcfs97m67cqkwzhyy8sg-monoid-subclasses-1.2.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/monoid-subclasses-1.2.6-Gfcvp0EfwKt1Ok9yeWcbEn
1536.10 s
[monoid-subclasses] Phase: fixupPhase
1536.10 s
[monoid-subclasses] shrinking RPATHs of ELF executables and libraries in /nix/store/dyykf7339dkcpcfs97m67cqkwzhyy8sg-monoid-subclasses-1.2.6
1536.10 s
[monoid-subclasses] shrinking /nix/store/dyykf7339dkcpcfs97m67cqkwzhyy8sg-monoid-subclasses-1.2.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSmonoid-subclasses-1.2.6-Gfcvp0EfwKt1Ok9yeWcbEn-ghc9.8.1.so
1536.10 s
[monoid-subclasses] checking for references to /build/ in /nix/store/dyykf7339dkcpcfs97m67cqkwzhyy8sg-monoid-subclasses-1.2.6...
1536.10 s
[monoid-subclasses] patching script interpreter paths in /nix/store/dyykf7339dkcpcfs97m67cqkwzhyy8sg-monoid-subclasses-1.2.6
1536.10 s
[monoid-subclasses] stripping (with command strip and flags -S -p) in /nix/store/dyykf7339dkcpcfs97m67cqkwzhyy8sg-monoid-subclasses-1.2.6/lib
1536.10 s
[monoid-subclasses] shrinking RPATHs of ELF executables and libraries in /nix/store/v7n98acwmpgp5844mrdc7cfgz5m4v92s-monoid-subclasses-1.2.6-doc
1536.10 s
[monoid-subclasses] checking for references to /build/ in /nix/store/v7n98acwmpgp5844mrdc7cfgz5m4v92s-monoid-subclasses-1.2.6-doc...
1536.10 s
[monoid-subclasses] patching script interpreter paths in /nix/store/v7n98acwmpgp5844mrdc7cfgz5m4v92s-monoid-subclasses-1.2.6-doc
1536.10 s
[shake] /nix/store/iq8l5cy2qzvrc55zfs8wxjss7qblrjyr-shake-0.19.8-data/share/ghc-9.8.1/x86_64-linux-ghc-9.8.1/shake-0.19.8
1536.10 s
[shake] Documentation installed in:
1536.10 s
[shake] /nix/store/xxzinarv27ih7cg9yzhi0kznc3mxvr34-shake-0.19.8-doc/share/doc/shake-0.19.8
1536.10 s
[shake] Configuration files installed in:
1536.10 s
[shake] /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8/etc
1536.10 s
[shake] No alex found
1536.10 s
[shake] Using ar found on system at:
1536.10 s
[shake] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1536.10 s
[shake] No c2hs found
1536.10 s
[shake] No cpphs found
1536.10 s
[shake] No doctest found
1536.10 s
[shake] Using gcc version 14.3.0 given by user at:
1536.10 s
[shake] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1536.10 s
[shake] Using ghc version 9.8.1 found on system at:
1536.10 s
[shake] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1536.10 s
[shake] Using ghc-pkg version 9.8.1 found on system at:
1536.10 s
[shake] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1536.10 s
[shake] No ghcjs found
1536.10 s
[shake] No ghcjs-pkg found
1536.10 s
[shake] No greencard found
1536.10 s
[shake] Using haddock version 2.30.0 found on system at:
1536.10 s
[shake] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1536.10 s
[shake] No happy found
1536.10 s
[shake] Using haskell-suite found on system at: haskell-suite-dummy-location
1536.10 s
[shake] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1536.10 s
[shake] No hmake found
1536.10 s
[shake] Using hpc version 0.69 found on system at:
1536.10 s
[shake] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1536.10 s
[shake] Using hsc2hs version 0.68.10 found on system at:
1536.10 s
[shake] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1536.10 s
[shake] Using hscolour version 1.25 found on system at:
1536.10 s
[shake] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1536.10 s
[shake] No jhc found
1536.10 s
[shake] Using ld found on system at:
1536.10 s
[shake] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1536.10 s
[shake] No pkg-config found
1536.10 s
[shake] Using runghc version 9.8.1 found on system at:
1536.10 s
[shake] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1536.10 s
[shake] Using strip version 2.44 found on system at:
1536.10 s
[shake] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1536.10 s
[shake] Using tar found on system at:
1536.10 s
[shake] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1536.10 s
[shake] No uhc found
1536.10 s
[shake] Phase: buildPhase
1536.10 s
[shake] Preprocessing executable 'shake' for shake-0.19.8..
1536.10 s
[shake] Building executable 'shake' for shake-0.19.8..
1536.10 s
[aeson] [25 of 32] Compiling Data.Aeson.Types.Class ( src/Data/Aeson/Types/Class.hs, dist/build/Data/Aeson/Types/Class.o, dist/build/Data/Aeson/Types/Class.dyn_o )
1536.10 s
[aeson] [26 of 32] Compiling Data.Aeson.Types ( src/Data/Aeson/Types.hs, dist/build/Data/Aeson/Types.o, dist/build/Data/Aeson/Types.dyn_o )
1536.10 s
[aeson] [27 of 32] Compiling Data.Aeson.Text ( src/Data/Aeson/Text.hs, dist/build/Data/Aeson/Text.o, dist/build/Data/Aeson/Text.dyn_o )
1536.10 s
[aeson] [28 of 32] Compiling Data.Aeson.Decoding ( src/Data/Aeson/Decoding.hs, dist/build/Data/Aeson/Decoding.o, dist/build/Data/Aeson/Decoding.dyn_o )
1536.10 s
[aeson] [29 of 32] Compiling Data.Aeson ( src/Data/Aeson.hs, dist/build/Data/Aeson.o, dist/build/Data/Aeson.dyn_o )
1536.10 s
[aeson] [30 of 32] Compiling Data.Aeson.RFC8785 ( src/Data/Aeson/RFC8785.hs, dist/build/Data/Aeson/RFC8785.o, dist/build/Data/Aeson/RFC8785.dyn_o )
1536.10 s
[aeson] [31 of 32] Compiling Data.Aeson.QQ.Simple ( src/Data/Aeson/QQ/Simple.hs, dist/build/Data/Aeson/QQ/Simple.o, dist/build/Data/Aeson/QQ/Simple.dyn_o )
1536.10 s
[aeson] [32 of 32] Compiling Data.Aeson.TH ( src/Data/Aeson/TH.hs, dist/build/Data/Aeson/TH.o, dist/build/Data/Aeson/TH.dyn_o )
1536.10 s
[aeson]
1536.10 s
[aeson] src/Data/Aeson/TH.hs:948:7: warning : [ GHC-62161 ] [ -Wincomplete-uni-patterns ]
1536.10 s
[aeson] Pattern match(es) are non-exhaustive
1536.10 s
[aeson] In a pattern binding: Patterns of type ‘[Q Exp]’ not matched: []
1536.10 s
[aeson] |
1536.10 s
[aeson] 948 | x:xs = [ lookupField argTy
1536.10 s
[aeson] | ^^^^^^^^^^^^^^^^^^^^^^^^^^...
1536.10 s
[aeson]
1536.10 s
[aeson] src/Data/Aeson/TH.hs:1064:14: warning : [ GHC-62161 ] [ -Wincomplete-uni-patterns ]
1536.10 s
[aeson] Pattern match(es) are non-exhaustive
1536.10 s
[aeson] In a pattern binding: Patterns of type ‘[Q Exp]’ not matched: []
1536.10 s
[aeson] |
1536.10 s
[aeson] 1064 | let x:xs = [ dispatchParseJSON jc conName tvMap argTy
1536.10 s
[aeson] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
1536.10 s
[aeson] [ 1 of 32] Compiling Data.Aeson.Internal.ByteString ( src/Data/Aeson/Internal/ByteString.hs, dist/build/Data/Aeson/Internal/ByteString.p_o )
1536.10 s
[aeson] [ 2 of 32] Compiling Data.Aeson.Internal.Functions ( src/Data/Aeson/Internal/Functions.hs, dist/build/Data/Aeson/Internal/Functions.p_o )
1536.10 s
[aeson] [ 3 of 32] Compiling Data.Aeson.Internal.Prelude ( src/Data/Aeson/Internal/Prelude.hs, dist/build/Data/Aeson/Internal/Prelude.p_o )
1536.10 s
[aeson] [ 4 of 32] Compiling Data.Aeson.Internal.Scientific ( src/Data/Aeson/Internal/Scientific.hs, dist/build/Data/Aeson/Internal/Scientific.p_o )
1536.10 s
[aeson] [ 5 of 32] Compiling Data.Aeson.Internal.TH ( src/Data/Aeson/Internal/TH.hs, dist/build/Data/Aeson/Internal/TH.p_o )
1536.10 s
[aeson] [ 6 of 32] Compiling Data.Aeson.Internal.Text ( src/Data/Aeson/Internal/Text.hs, dist/build/Data/Aeson/Internal/Text.p_o )
1536.10 s
[aeson] [ 7 of 32] Compiling Data.Aeson.Internal.Unescape ( src/Data/Aeson/Internal/Unescape.hs, dist/build/Data/Aeson/Internal/Unescape.p_o )
1536.10 s
[aeson] [ 8 of 32] Compiling Data.Aeson.Internal.UnescapeFromText ( src/Data/Aeson/Internal/UnescapeFromText.hs, dist/build/Data/Aeson/Internal/UnescapeFromText.p_o )
1536.10 s
[aeson] [ 9 of 32] Compiling Data.Aeson.Key ( src/Data/Aeson/Key.hs, dist/build/Data/Aeson/Key.p_o )
1536.10 s
[aeson] [10 of 32] Compiling Data.Aeson.Decoding.Tokens ( src/Data/Aeson/Decoding/Tokens.hs, dist/build/Data/Aeson/Decoding/Tokens.p_o )
1536.10 s
[aeson] [11 of 32] Compiling Data.Aeson.Decoding.Internal ( src/Data/Aeson/Decoding/Internal.hs, dist/build/Data/Aeson/Decoding/Internal.p_o )
1536.10 s
[aeson] [12 of 32] Compiling Data.Aeson.Decoding.Text ( src/Data/Aeson/Decoding/Text.hs, dist/build/Data/Aeson/Decoding/Text.p_o )
1536.10 s
[aeson] [13 of 32] Compiling Data.Aeson.Decoding.ByteString.Lazy ( src/Data/Aeson/Decoding/ByteString/Lazy.hs, dist/build/Data/Aeson/Decoding/ByteString/Lazy.p_o )
1536.11 s
[aeson] [14 of 32] Compiling Data.Aeson.Decoding.ByteString ( src/Data/Aeson/Decoding/ByteString.hs, dist/build/Data/Aeson/Decoding/ByteString.p_o )
1536.11 s
[aeson] [15 of 32] Compiling Data.Aeson.KeyMap ( src/Data/Aeson/KeyMap.hs, dist/build/Data/Aeson/KeyMap.p_o )
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
1536.11 s
[algebraic-graphs] OK: show empty == "empty"
1536.11 s
[algebraic-graphs] OK: show (shrink 1) == "vertex 1"
1536.11 s
[algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
1536.11 s
[algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
1536.11 s
[algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
1536.11 s
[algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
1536.11 s
[algebraic-graphs] OK: fromAcyclic empty == empty
1536.11 s
[algebraic-graphs] OK: fromAcyclic . vertex == vertex
1536.11 s
[algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
1536.11 s
[algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
1536.11 s
[algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
1536.11 s
[algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
1536.11 s
[algebraic-graphs] OK: isEmpty empty == True
1536.11 s
[algebraic-graphs] OK: hasVertex x empty == False
1536.11 s
[algebraic-graphs] OK: vertexCount empty == 0
1536.11 s
[algebraic-graphs] OK: edgeCount empty == 0
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
1536.11 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1536.11 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1536.11 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1536.11 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
1536.11 s
[algebraic-graphs] OK: vertices [] == empty
1536.11 s
[algebraic-graphs] OK: vertices [x] == vertex x
1536.11 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1536.11 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1536.11 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
1536.11 s
[algebraic-graphs] OK: vertexSet (union x y) == <correct result>
1536.11 s
[algebraic-graphs] OK: edgeSet (union x y) == <correct result>
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
1536.11 s
[algebraic-graphs] OK: vertexSet (join x y) == <correct result>
1536.11 s
[algebraic-graphs] OK: edgeSet (join x y) == <correct result>
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
1536.11 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1536.11 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1536.11 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1536.11 s
[algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
1536.11 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
1536.11 s
[algebraic-graphs] OK: isEmpty empty == True
1536.11 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1536.11 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1536.11 s
[algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
1536.11 s
[algebraic-graphs] OK: hasVertex x empty == False
1536.11 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1536.11 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
1536.11 s
[algebraic-graphs] OK: hasEdge x y empty == False
1536.11 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1536.11 s
[algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
1536.11 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1536.11 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
1536.11 s
[algebraic-graphs] OK: vertexCount empty == 0
1536.11 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1536.11 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1536.11 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
1536.11 s
[algebraic-graphs] OK: edgeCount empty == 0
1536.11 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1536.11 s
[algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
1536.11 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
1536.11 s
[algebraic-graphs] OK: vertexList empty == []
1536.11 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1536.11 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
1536.11 s
[algebraic-graphs] OK: edgeList empty == []
1536.11 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1536.11 s
[algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
1536.11 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
1536.11 s
[algebraic-graphs] OK: adjacencyList empty == []
1536.11 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1536.11 s
[algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
1536.11 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1536.11 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1536.11 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1536.11 s
[algebraic-graphs]
1536.11 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
1536.11 s
[filemanip] 274 | where visit state path depth st =
1536.11 s
[filemanip] | ^^^^^
1536.11 s
[filemanip]
1536.11 s
[filemanip] System/FilePath/Find.hs:274:21: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1536.11 s
[filemanip] This binding for ‘path’ shadows the existing binding
1536.11 s
[filemanip] bound at System/FilePath/Find.hs:271:44
1536.11 s
[filemanip] |
1536.11 s
[filemanip] 274 | where visit state path depth st =
1536.11 s
[filemanip] | ^^^^
1536.11 s
[filemanip]
1536.11 s
[filemanip] System/FilePath/Find.hs:274:26: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1536.11 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1536.11 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1536.11 s
[filemanip] |
1536.11 s
[filemanip] 274 | where visit state path depth st =
1536.11 s
[filemanip] | ^^^^^
1536.11 s
[filemanip]
1536.11 s
[filemanip] System/FilePath/Find.hs:279:9: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1536.11 s
[filemanip] This binding for ‘traverse’ shadows the existing binding
1536.11 s
[filemanip] imported from ‘Prelude’ at System/FilePath/Find.hs:39:8-27
1536.11 s
[filemanip] (and originally defined in ‘Data.Traversable’)
1536.11 s
[filemanip] |
1536.11 s
[filemanip] 279 | traverse state dir depth dirSt = handle (errHandler dir state) $
1536.11 s
[filemanip] | ^^^^^^^^
1536.11 s
[filemanip]
1536.11 s
[filemanip] System/FilePath/Find.hs:279:18: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1536.11 s
[filemanip] This binding for ‘state’ shadows the existing binding
1536.11 s
[filemanip] bound at System/FilePath/Find.hs:271:38
1536.11 s
[filemanip] |
1536.11 s
[filemanip] 279 | traverse state dir depth dirSt = handle (errHandler dir state) $
1536.11 s
[filemanip] | ^^^^^
1536.11 s
[filemanip]
1536.11 s
[filemanip] System/FilePath/Find.hs:279:28: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1536.11 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1536.11 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1536.11 s
[filemanip] |
1536.11 s
[filemanip] 279 | traverse state dir depth dirSt = handle (errHandler dir state) $
1536.11 s
[filemanip] | ^^^^^
1536.11 s
[filemanip]
1536.11 s
[filemanip] System/FilePath/Find.hs:282:53: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1536.11 s
[filemanip] This binding for ‘state’ shadows the existing binding
1536.11 s
[filemanip] bound at System/FilePath/Find.hs:279:18
1536.11 s
[filemanip] |
1536.11 s
[filemanip] 282 | in state' `seq` flip foldM state' (\state name ->
1536.11 s
[filemanip] | ^^^^^
1536.11 s
[filemanip]
1536.11 s
[filemanip] System/FilePath/Find.hs:284:25: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1536.11 s
[filemanip] This binding for ‘path’ shadows the existing binding
1536.11 s
[filemanip] bound at System/FilePath/Find.hs:271:44
1536.11 s
[filemanip] |
1536.11 s
[filemanip] 284 | let path = dir </> name
1536.11 s
[filemanip] | ^^^^
1536.11 s
[filemanip] [4 of 4] Compiling System.FilePath.Manip ( System/FilePath/Manip.hs, dist/build/System/FilePath/Manip.p_o )
1536.11 s
[filemanip] buildPhase completed in 48 seconds
1536.11 s
[filemanip] Phase: checkPhase
1536.11 s
[filemanip] Package has no test suites.
1536.11 s
[filemanip] Phase: haddockPhase
1536.11 s
[filemanip] Preprocessing library for filemanip-0.3.6.3..
1536.11 s
[filemanip] Running Haddock on library for filemanip-0.3.6.3..
1536.11 s
[filemanip] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1536.11 s
[filemanip] [1 of 4] Compiling System.FilePath.GlobPattern ( System/FilePath/GlobPattern.hs, nothing )
1536.11 s
[filemanip]
1536.11 s
[ghc-exactprint] [ 9 of 10] Compiling Language.Haskell.GHC.ExactPrint.Transform ( src/Language/Haskell/GHC/ExactPrint/Transform.hs, dist/build/Language/Haskell/GHC/ExactPrint/Transform.o, dist/build/Language/Haskell/GHC/ExactPrint/Transform.dyn_o )
1536.11 s
[ghc-exactprint] [10 of 10] Compiling Language.Haskell.GHC.ExactPrint ( src/Language/Haskell/GHC/ExactPrint.hs, dist/build/Language/Haskell/GHC/ExactPrint.o, dist/build/Language/Haskell/GHC/ExactPrint.dyn_o )
1536.11 s
[ghc-exactprint] [ 1 of 10] Compiling Language.Haskell.GHC.ExactPrint.Dump ( src/Language/Haskell/GHC/ExactPrint/Dump.hs, dist/build/Language/Haskell/GHC/ExactPrint/Dump.p_o )
1536.11 s
[ghc-exactprint] [ 2 of 10] Compiling Language.Haskell.GHC.ExactPrint.Orphans ( src/Language/Haskell/GHC/ExactPrint/Orphans.hs, dist/build/Language/Haskell/GHC/ExactPrint/Orphans.p_o )
1536.11 s
[ghc-exactprint] [ 3 of 10] Compiling Language.Haskell.GHC.ExactPrint.Types ( src/Language/Haskell/GHC/ExactPrint/Types.hs, dist/build/Language/Haskell/GHC/ExactPrint/Types.p_o )
1536.11 s
[ghc-exactprint] [ 4 of 10] Compiling Language.Haskell.GHC.ExactPrint.Lookup ( src/Language/Haskell/GHC/ExactPrint/Lookup.hs, dist/build/Language/Haskell/GHC/ExactPrint/Lookup.p_o )
1536.11 s
[ghc-exactprint] [ 5 of 10] Compiling Language.Haskell.GHC.ExactPrint.Utils ( src/Language/Haskell/GHC/ExactPrint/Utils.hs, dist/build/Language/Haskell/GHC/ExactPrint/Utils.p_o )
1536.11 s
[ghc-exactprint] [ 6 of 10] Compiling Language.Haskell.GHC.ExactPrint.Preprocess ( src/Language/Haskell/GHC/ExactPrint/Preprocess.hs, dist/build/Language/Haskell/GHC/ExactPrint/Preprocess.p_o )
1536.11 s
[ghc-exactprint] [ 7 of 10] Compiling Language.Haskell.GHC.ExactPrint.Parsers ( src/Language/Haskell/GHC/ExactPrint/Parsers.hs, dist/build/Language/Haskell/GHC/ExactPrint/Parsers.p_o )
1536.11 s
[ghc-exactprint] [ 8 of 10] Compiling Language.Haskell.GHC.ExactPrint.ExactPrint ( src/Language/Haskell/GHC/ExactPrint/ExactPrint.hs, dist/build/Language/Haskell/GHC/ExactPrint/ExactPrint.p_o )
1536.11 s
[ghc-exactprint]
1536.11 s
[ghc-exactprint] src/Language/Haskell/GHC/ExactPrint/ExactPrint.hs:1422:15: warning : [ GHC-62161 ] [ -Wincomplete-record-updates ]
1536.11 s
[ghc-exactprint] Pattern match(es) are non-exhaustive
1536.11 s
[ghc-exactprint] In a record update:
1536.11 s
[ghc-exactprint] Patterns of type ‘EpAnn AnnsModule’ not matched: EpAnnNotUsed
1536.11 s
[ghc-exactprint] |
1536.11 s
[ghc-exactprint] 1422 | let anf = an0 { anns = (anns an0) { am_decls = am_decls' }}
1536.11 s
[ghc-exactprint] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1536.11 s
[ghc-exactprint]
1536.11 s
[ghc-exactprint] src/Language/Haskell/GHC/ExactPrint/ExactPrint.hs:3308:19: warning : [ GHC-62161 ] [ -Wincomplete-record-updates ]
1536.11 s
[ghc-exactprint] Pattern match(es) are non-exhaustive
1536.11 s
[ghc-exactprint] In a record update:
1536.11 s
[ghc-exactprint] Patterns of type ‘XCmdArrApp GhcPs’ not matched: EpAnnNotUsed
1536.11 s
[ghc-exactprint] |
1536.11 s
[ghc-exactprint] 3308 | let an1 = an{anns = an0}
1536.11 s
[ghc-exactprint] | ^^^^^^^^^^^^^^
1536.11 s
[ghc-exactprint]
1536.11 s
[ghc-exactprint] src/Language/Haskell/GHC/ExactPrint/ExactPrint.hs:3314:19: warning : [ GHC-62161 ] [ -Wincomplete-record-updates ]
1536.11 s
[ghc-exactprint] Pattern match(es) are non-exhaustive
1536.11 s
[ghc-exactprint] In a record update:
1536.11 s
[ghc-exactprint] Patterns of type ‘XCmdArrApp GhcPs’ not matched: EpAnnNotUsed
1536.11 s
[ghc-exactprint] |
1536.11 s
[ghc-exactprint] 3314 | let an1 = an {anns = an0}
1536.11 s
[ghc-exactprint] | ^^^^^^^^^^^^^^^
1536.11 s
[ghc-exactprint] [ 9 of 10] Compiling Language.Haskell.GHC.ExactPrint.Transform ( src/Language/Haskell/GHC/ExactPrint/Transform.hs, dist/build/Language/Haskell/GHC/ExactPrint/Transform.p_o )
1536.11 s
[ghc-exactprint] [10 of 10] Compiling Language.Haskell.GHC.ExactPrint ( src/Language/Haskell/GHC/ExactPrint.hs, dist/build/Language/Haskell/GHC/ExactPrint.p_o )
1536.11 s
[ghc-exactprint] Preprocessing test suite 'test' for ghc-exactprint-1.8.0.0..
1536.11 s
[ghc-exactprint] Building test suite 'test' for ghc-exactprint-1.8.0.0..
1536.11 s
[ghc-exactprint] [1 of 5] Compiling Test.Common ( tests/Test/Common.hs, dist/build/test/test-tmp/Test/Common.o )
1536.11 s
[ghc-exactprint] [2 of 5] Compiling Test.CommonUtils ( tests/Test/CommonUtils.hs, dist/build/test/test-tmp/Test/CommonUtils.o )
1536.11 s
[kan-extensions] Phase: setupCompilerEnvironmentPhase
1536.11 s
[kan-extensions] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1536.11 s
[kan-extensions] Phase: unpackPhase
1536.11 s
[kan-extensions] unpacking source archive /nix/store/sgrqnm2zizgrxv6z2ir5hnhn9fv2r295-kan-extensions-5.2.6.tar.gz
1536.12 s
[kan-extensions] source root is kan-extensions-5.2.6
1536.12 s
[kan-extensions] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "kan-extensions-5.2.6/.vim.custom"
1536.12 s
[kan-extensions] Phase: patchPhase
1536.12 s
[kan-extensions] Replace Cabal file with edited version from mirror://hackage/kan-extensions-5.2.6/revision/1.cabal.
1536.12 s
[kan-extensions] Phase: compileBuildDriverPhase
1536.12 s
[kan-extensions] setupCompileFlags: -package-db=/build/tmp.QWX25gu4d1/setup-package.conf.d -threaded
1536.12 s
[kan-extensions] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.QWX25gu4d1/Main.o )
1536.12 s
[kan-extensions] [2 of 2] Linking Setup
1536.12 s
[kan-extensions] Phase: updateAutotoolsGnuConfigScriptsPhase
1536.12 s
[kan-extensions] Phase: configurePhase
1536.12 s
[kan-extensions] configureFlags: --verbose --prefix=/nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/71fs2683vypxzjif0mirrkm6f2vva1gd-kan-extensions-5.2.6-doc/share/doc/kan-extensions-5.2.6 --with-gcc=gcc --package-db=/build/tmp.QWX25gu4d1/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1536.12 s
[kan-extensions] Using Parsec parser
1536.12 s
[kan-extensions] Configuring kan-extensions-5.2.6...
1536.12 s
[kan-extensions] Dependency adjunctions >=4.2 && <5: using adjunctions-4.4.3
1536.12 s
[kan-extensions] Dependency array >=0.3.0.2 && <0.6: using array-0.5.6.0
1536.12 s
[kan-extensions] Dependency base >=4.11 && <5: using base-4.19.0.0
1536.12 s
[kan-extensions] Dependency comonad >=4 && <6: using comonad-5.0.9
1536.12 s
[kan-extensions] Dependency containers >=0.4 && <0.9: using containers-0.6.8
1536.12 s
[kan-extensions] Dependency contravariant >=1 && <2: using contravariant-1.5.5
1536.12 s
[kan-extensions] Dependency distributive >=0.2.2 && <1: using distributive-0.6.2.1
1536.12 s
[kan-extensions] Dependency free >=4 && <6: using free-5.2
1536.12 s
[kan-extensions] Dependency invariant >=0.1 && <1: using invariant-0.6.4
1536.12 s
[kan-extensions] Dependency mtl >=2.2.1 && <2.4: using mtl-2.3.1
1536.12 s
[kan-extensions] Dependency profunctors >=5 && <6: using profunctors-5.6.2
1536.12 s
[kan-extensions] Dependency semigroupoids >=5.2.2 && <7: using semigroupoids-6.0.1
1536.12 s
[kan-extensions] Dependency tagged >=0.7.2 && <1: using tagged-0.8.8
1536.12 s
[kan-extensions] Dependency transformers >=0.5 && <0.7: using transformers-0.6.1.0
1536.12 s
[kan-extensions] Source component graph: component lib
1536.12 s
[kan-extensions] Configured component graph:
1536.12 s
[kan-extensions] component kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An
1536.12 s
[kan-extensions] include adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr
1536.12 s
[kan-extensions] include array-0.5.6.0-dc89
1536.12 s
[kan-extensions] include base-4.19.0.0-b960
1536.12 s
[kan-extensions] include comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1536.12 s
[kan-extensions] include containers-0.6.8-4775
1536.12 s
[kan-extensions] include contravariant-1.5.5-J4LLuUnbnVaBzsIx42BlgS
1536.12 s
[kan-extensions] include distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
1536.12 s
[kan-extensions] include free-5.2-5jsicnVtm8y8KG9LMRezMp
1536.12 s
[kan-extensions] include invariant-0.6.4-9MdOxjYVRq95RCcv5wEaad
1536.12 s
[kan-extensions] include mtl-2.3.1-63a4
1536.12 s
[kan-extensions] include profunctors-5.6.2-3nAHQARBXS12MCzIa3BzsU
1536.12 s
[kan-extensions] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1536.12 s
[kan-extensions] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1536.12 s
[kan-extensions] include transformers-0.6.1.0-c3ec
1536.12 s
[kan-extensions] Linked component graph:
1536.12 s
[kan-extensions] unit kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An
1536.12 s
[kan-extensions] include adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr
1536.12 s
[kan-extensions] include array-0.5.6.0-dc89
1536.30 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/dyykf7339dkcpcfs97m67cqkwzhyy8sg-monoid-subclasses-1.2.6 /nix/store/v7n98acwmpgp5844mrdc7cfgz5m4v92s-monoid-subclasses-1.2.6-doc
1536.79 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1536.84 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/dyykf7339dkcpcfs97m67cqkwzhyy8sg-monoid-subclasses-1.2.6 /nix/store/v7n98acwmpgp5844mrdc7cfgz5m4v92s-monoid-subclasses-1.2.6-doc
1536.90 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1536.95 s
[post-build-hook] copying 5 paths...
1536.95 s
[post-build-hook] copying path '/nix/store/0w22a65y8yg6wn4jwiz7m0zc0kpf8s3b-primes-0.2.1.0-doc' to 'https://cache.nix-ci.com'...
1536.95 s
[post-build-hook] copying path '/nix/store/gpd67jvqyx61r92yc4yfknwaimbgpfrm-commutative-semigroups-0.2.0.2-doc' to 'https://cache.nix-ci.com'...
1537.05 s
[post-build-hook] copying path '/nix/store/j8r3jv47fj3nca5mw6x3dr8mf66azdwv-commutative-semigroups-0.2.0.2' to 'https://cache.nix-ci.com'...
1537.06 s
[post-build-hook] copying path '/nix/store/10rs52049rf4haljgszj1l6jx8052s9m-primes-0.2.1.0' to 'https://cache.nix-ci.com'...
1537.31 s
[post-build-hook] copying path '/nix/store/dyykf7339dkcpcfs97m67cqkwzhyy8sg-monoid-subclasses-1.2.6' to 'https://cache.nix-ci.com'...
1546.75 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1546.84 s
[post-build-hook] copying 0 paths...
1546.86 s
Progress: 89 of 171 built (8 building), 395 of 395 downloaded from cache
1546.87 s
[regex] Phase: setupCompilerEnvironmentPhase
1546.87 s
[regex] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1546.87 s
[regex] Phase: unpackPhase
1546.87 s
[regex] unpacking source archive /nix/store/ms5iqhw640hsr30nrwwha0m8dsj40rgk-regex-1.1.0.2.tar.gz
1546.87 s
[regex] source root is regex-1.1.0.2
1546.87 s
[regex] setting SOURCE_DATE_EPOCH to timestamp 1655732905 of file "regex-1.1.0.2/regex.cabal"
1546.87 s
[regex] Phase: patchPhase
1546.87 s
[regex] Phase: compileBuildDriverPhase
1546.87 s
[regex] setupCompileFlags: -package-db=/build/tmp.xj1Ye62hTW/setup-package.conf.d -threaded
1546.87 s
[regex] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.xj1Ye62hTW/Main.o )
1546.87 s
[regex] [2 of 2] Linking Setup
1546.87 s
[regex] Phase: updateAutotoolsGnuConfigScriptsPhase
1546.87 s
[regex] Phase: configurePhase
1546.87 s
[regex] configureFlags: --verbose --prefix=/nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/29dzdfdjmihjak00g3p2xwdqgnihm3r8-regex-1.1.0.2-doc/share/doc/regex-1.1.0.2 --with-gcc=gcc --package-db=/build/tmp.xj1Ye62hTW/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1546.87 s
[regex] Using Parsec parser
1546.87 s
[regex] Configuring regex-1.1.0.2...
1546.87 s
[regex] Dependency array >=0.4: using array-0.5.6.0
1546.87 s
[regex] Dependency base >=4 && <5: using base-4.19.0.0
1546.87 s
[regex] Dependency base-compat >=0.6 && <1: using base-compat-0.13.1
1546.87 s
[regex] Dependency bytestring >=0.10: using bytestring-0.12.0.2
1546.87 s
[regex] Dependency containers >=0.4: using containers-0.6.8
1546.87 s
[regex] Dependency hashable >=1.2: using hashable-1.4.7.0
1546.87 s
[regex] Dependency regex-base >=0.93: using regex-base-0.94.0.3
1546.87 s
[regex] Dependency regex-pcre-builtin >=0.94: using regex-pcre-builtin-0.95.2.3.8.44
1546.87 s
[regex] Dependency regex-tdfa >=1.3.1.0: using regex-tdfa-1.3.2.3
1546.87 s
[regex] Dependency template-haskell >=2.7: using template-haskell-2.21.0.0
1546.87 s
[regex] Dependency text >=1.2: using text-2.1
1546.87 s
[regex] Dependency time >=1.4.2: using time-1.12.2
1546.87 s
[regex] Dependency time-locale-compat >=0.1: using time-locale-compat-0.1.1.5
1546.87 s
[regex] Dependency transformers >=0.2.2: using transformers-0.6.1.0
1546.87 s
[regex] Dependency unordered-containers >=0.2: using unordered-containers-0.2.20
1546.87 s
[regex] Dependency utf8-string >=1: using utf8-string-1.0.2
1546.87 s
[regex] Source component graph: component lib
1546.87 s
[regex] Configured component graph:
1546.87 s
[regex] component regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z
1546.87 s
[regex] include array-0.5.6.0-dc89
1546.87 s
[regex] include base-4.19.0.0-b960
1546.87 s
[regex] include base-compat-0.13.1-Eotc18fTsmWG4LIuz3QQXm
1546.87 s
[regex] include bytestring-0.12.0.2-4690
1546.87 s
[regex] include containers-0.6.8-4775
1546.87 s
[regex] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1546.87 s
[regex] include regex-base-0.94.0.3-J3ME5r0V7dZ2OROnz448wg
1546.87 s
[regex] include regex-pcre-builtin-0.95.2.3.8.44-KEghb9i9Y7BDoSBfWCLtRJ
1546.87 s
[regex] include regex-tdfa-1.3.2.3-AkYTgc8l27U9EvdFIYXjru
1546.87 s
[regex] include template-haskell-2.21.0.0-8831
1546.87 s
[regex] include text-2.1-c36a
1546.87 s
[regex] include time-1.12.2-d26d
1546.87 s
[regex] include time-locale-compat-0.1.1.5-1JraZvcDIW7ILMHKkdGQNi
1546.87 s
[regex] include transformers-0.6.1.0-c3ec
1546.87 s
[regex] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1546.87 s
[regex] include utf8-string-1.0.2-3f0Yb0EPatE18c5eXZUE9
1546.87 s
[regex] Linked component graph:
1546.87 s
[regex] unit regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z
1546.87 s
[regex] include array-0.5.6.0-dc89
1546.87 s
[shake] [ 1 of 71] Compiling Development.Ninja.Env ( src/Development/Ninja/Env.hs, dist/build/shake/shake-tmp/Development/Ninja/Env.o )
1546.87 s
[shake] [ 2 of 71] Compiling Development.Ninja.Type ( src/Development/Ninja/Type.hs, dist/build/shake/shake-tmp/Development/Ninja/Type.o )
1546.87 s
[shake] [ 3 of 71] Compiling Development.Ninja.Lexer ( src/Development/Ninja/Lexer.hs, dist/build/shake/shake-tmp/Development/Ninja/Lexer.o )
1546.87 s
[shake] [ 4 of 71] Compiling Development.Shake.Classes ( src/Development/Shake/Classes.hs, dist/build/shake/shake-tmp/Development/Shake/Classes.o )
1546.87 s
[shake] [ 5 of 71] Compiling Development.Shake.FilePath ( src/Development/Shake/FilePath.hs, dist/build/shake/shake-tmp/Development/Shake/FilePath.o )
1546.87 s
[shake] [ 6 of 71] Compiling Development.Shake.Internal.CmdOption ( src/Development/Shake/Internal/CmdOption.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/CmdOption.o )
1546.87 s
[shake] [ 7 of 71] Compiling Development.Shake.Internal.History.Bloom ( src/Development/Shake/Internal/History/Bloom.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/History/Bloom.o )
1546.87 s
[shake] [ 8 of 71] Compiling Development.Shake.Internal.History.Network ( src/Development/Shake/Internal/History/Network.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/History/Network.o )
1546.87 s
[shake] [ 9 of 71] Compiling Development.Shake.Internal.History.Types ( src/Development/Shake/Internal/History/Types.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/History/Types.o )
1546.87 s
[shake] [10 of 71] Compiling General.Bilist ( src/General/Bilist.hs, dist/build/shake/shake-tmp/General/Bilist.o )
1546.87 s
[shake] [11 of 71] Compiling General.Binary ( src/General/Binary.hs, dist/build/shake/shake-tmp/General/Binary.o )
1546.87 s
[shake] [12 of 71] Compiling Development.Shake.Internal.FileName ( src/Development/Shake/Internal/FileName.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/FileName.o )
1546.87 s
[shake] [13 of 71] Compiling General.Cleanup ( src/General/Cleanup.hs, dist/build/shake/shake-tmp/General/Cleanup.o )
1546.87 s
[shake] [14 of 71] Compiling General.EscCodes ( src/General/EscCodes.hs, dist/build/shake/shake-tmp/General/EscCodes.o )
1546.87 s
[shake] [15 of 71] Compiling General.Extra ( src/General/Extra.hs, dist/build/shake/shake-tmp/General/Extra.o )
1546.87 s
[shake] [16 of 71] Compiling Development.Shake.Internal.History.Symlink ( src/Development/Shake/Internal/History/Symlink.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/History/Symlink.o )
1546.87 s
[shake] [17 of 71] Compiling Development.Shake.Internal.Errors ( src/Development/Shake/Internal/Errors.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Errors.o )
1546.87 s
[shake] [18 of 71] Compiling Development.Shake.Internal.Value ( src/Development/Shake/Internal/Value.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Value.o )
1546.87 s
[shake] [19 of 71] Compiling Development.Shake.Internal.FilePattern ( src/Development/Shake/Internal/FilePattern.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/FilePattern.o )
1546.87 s
[shake] [20 of 71] Compiling Development.Shake.Internal.Options ( src/Development/Shake/Internal/Options.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Options.o )
1546.87 s
[shake] [21 of 71] Compiling Development.Shake.Internal.FileInfo ( src/Development/Shake/Internal/FileInfo.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/FileInfo.o )
1546.87 s
[shake] [22 of 71] Compiling Development.Shake.Internal.Core.Monad ( src/Development/Shake/Internal/Core/Monad.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Core/Monad.o )
1546.87 s
[shake] [23 of 71] Compiling Development.Ninja.Parse ( src/Development/Ninja/Parse.hs, dist/build/shake/shake-tmp/Development/Ninja/Parse.o )
1546.87 s
[shake] [24 of 71] Compiling General.Fence ( src/General/Fence.hs, dist/build/shake/shake-tmp/General/Fence.o )
1546.87 s
[shake] [25 of 71] Compiling General.FileLock ( src/General/FileLock.hs, dist/build/shake/shake-tmp/General/FileLock.o )
1546.87 s
[shake] [26 of 71] Compiling General.GetOpt ( src/General/GetOpt.hs, dist/build/shake/shake-tmp/General/GetOpt.o )
1546.87 s
[shake] [27 of 71] Compiling General.Intern ( src/General/Intern.hs, dist/build/shake/shake-tmp/General/Intern.o )
1546.87 s
[shake] [28 of 71] Compiling General.Ids ( src/General/Ids.hs, dist/build/shake/shake-tmp/General/Ids.o )
1546.87 s
[unordered-containers] [7 of 9] Compiling Properties.HashMapLazy ( tests/Properties/HashMapLazy.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapLazy.o )
1546.87 s
[unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
1546.87 s
[unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
1546.87 s
[unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
1546.87 s
[unordered-containers] buildPhase completed in 1 minutes 40 seconds
1546.87 s
[unordered-containers] Phase: checkPhase
1546.87 s
[unordered-containers] Running 1 test suites...
1546.87 s
[unordered-containers] Test suite unordered-containers-tests: RUNNING...
1546.87 s
[unordered-containers] All
1546.87 s
[unordered-containers] Properties
1546.87 s
[unordered-containers] Data.HashMap.Lazy
1546.87 s
[unordered-containers] instances
1546.87 s
[unordered-containers] Eq
1546.87 s
[unordered-containers] ==: OK (0.05s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] /=: OK (0.08s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] Ord
1546.87 s
[unordered-containers] compare reflexive: OK (0.08s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] compare transitive: OK (0.13s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] compare antisymmetric: OK (0.07s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] Ord => Eq: OK (0.13s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] Read/Show: OK (1.30s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] Functor: OK (0.38s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] Foldable: OK (0.11s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] Bifoldable
1546.87 s
[unordered-containers] bifoldMap: OK (0.05s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] bifoldr: OK (0.06s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] bifoldl: OK (0.08s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] Hashable: OK (0.16s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] empty
1546.87 s
[unordered-containers] valid: OK
1546.87 s
[unordered-containers] +++ OK, passed 1 test.
1546.87 s
[unordered-containers] singleton
1546.87 s
[unordered-containers] valid: OK (0.02s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] size: OK (0.02s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] member: OK (0.04s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] lookup: OK (0.04s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] !?: OK (0.02s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] insert
1546.87 s
[unordered-containers] model: OK (0.05s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] valid: OK (0.03s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] insertWith
1546.87 s
[unordered-containers] insertWith: OK (0.05s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] valid: OK (0.06s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] delete
1546.87 s
[unordered-containers] model: OK (0.06s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] valid: OK (0.03s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] adjust
1546.87 s
[unordered-containers] model: OK (0.07s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] valid: OK (0.06s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] update
1546.87 s
[unordered-containers] model: OK (0.10s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] valid: OK (0.07s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] alter
1546.87 s
[unordered-containers] model: OK (0.06s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] valid: OK (0.05s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] alterF
1546.87 s
[unordered-containers] model
1546.87 s
[unordered-containers] []: OK (0.62s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] adjust: OK (0.05s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] insert: OK (0.09s)
1546.87 s
[unordered-containers] +++ OK, passed 100 tests.
1546.87 s
[unordered-containers] insertWith: OK (0.10s)
1546.94 s
Building fuzzy
1546.94 s
[aeson] [16 of 32] Compiling Data.Aeson.Types.Generic ( src/Data/Aeson/Types/Generic.hs, dist/build/Data/Aeson/Types/Generic.p_o )
1546.94 s
[aeson] [17 of 32] Compiling Data.Aeson.Types.Internal ( src/Data/Aeson/Types/Internal.hs, dist/build/Data/Aeson/Types/Internal.p_o )
1546.94 s
[aeson] [18 of 32] Compiling Data.Aeson.Parser.Time ( src/Data/Aeson/Parser/Time.hs, dist/build/Data/Aeson/Parser/Time.p_o )
1546.94 s
[aeson] [19 of 32] Compiling Data.Aeson.Encoding.Builder ( src/Data/Aeson/Encoding/Builder.hs, dist/build/Data/Aeson/Encoding/Builder.p_o )
1546.94 s
[aeson] [20 of 32] Compiling Data.Aeson.Encoding.Internal ( src/Data/Aeson/Encoding/Internal.hs, dist/build/Data/Aeson/Encoding/Internal.p_o )
1546.94 s
[aeson] [21 of 32] Compiling Data.Aeson.Encoding ( src/Data/Aeson/Encoding.hs, dist/build/Data/Aeson/Encoding.p_o )
1546.94 s
[aeson] [22 of 32] Compiling Data.Aeson.Decoding.Conversion ( src/Data/Aeson/Decoding/Conversion.hs, dist/build/Data/Aeson/Decoding/Conversion.p_o )
1546.94 s
[aeson] [23 of 32] Compiling Data.Aeson.Types.FromJSON ( src/Data/Aeson/Types/FromJSON.hs, dist/build/Data/Aeson/Types/FromJSON.p_o )
1546.94 s
[aeson] [24 of 32] Compiling Data.Aeson.Types.ToJSON ( src/Data/Aeson/Types/ToJSON.hs, dist/build/Data/Aeson/Types/ToJSON.p_o )
1546.94 s
[aeson]
1546.94 s
[aeson] src/Data/Aeson/Types/ToJSON.hs:1615:23: warning : [ GHC-68441 ] [ -Wdeprecations ]
1546.94 s
[aeson] In the use of data constructor ‘Solo’
1546.94 s
[aeson] (imported from Data.Tuple.Solo, but defined in GHC.Tuple):
1546.94 s
[aeson] Deprecated: "The Solo constructor has been renamed to MkSolo to avoid punning."
1546.94 s
[aeson] |
1546.94 s
[aeson] 1615 | liftToJSON _ t _ (Solo a) = t a
1546.94 s
[aeson] | ^^^^
1546.94 s
[aeson]
1546.94 s
[aeson] src/Data/Aeson/Types/ToJSON.hs:1618:27: warning : [ GHC-68441 ] [ -Wdeprecations ]
1546.94 s
[aeson] In the use of data constructor ‘Solo’
1546.94 s
[aeson] (imported from Data.Tuple.Solo, but defined in GHC.Tuple):
1546.94 s
[aeson] Deprecated: "The Solo constructor has been renamed to MkSolo to avoid punning."
1546.94 s
[aeson] |
1546.94 s
[aeson] 1618 | liftToEncoding _ t _ (Solo a) = t a
1546.94 s
[aeson] | ^^^^
1546.94 s
[aeson] [25 of 32] Compiling Data.Aeson.Types.Class ( src/Data/Aeson/Types/Class.hs, dist/build/Data/Aeson/Types/Class.p_o )
1546.94 s
[aeson] [26 of 32] Compiling Data.Aeson.Types ( src/Data/Aeson/Types.hs, dist/build/Data/Aeson/Types.p_o )
1546.94 s
[aeson] [27 of 32] Compiling Data.Aeson.Text ( src/Data/Aeson/Text.hs, dist/build/Data/Aeson/Text.p_o )
1546.94 s
[aeson] [28 of 32] Compiling Data.Aeson.Decoding ( src/Data/Aeson/Decoding.hs, dist/build/Data/Aeson/Decoding.p_o )
1546.94 s
[aeson] [29 of 32] Compiling Data.Aeson ( src/Data/Aeson.hs, dist/build/Data/Aeson.p_o )
1546.94 s
[aeson] [30 of 32] Compiling Data.Aeson.RFC8785 ( src/Data/Aeson/RFC8785.hs, dist/build/Data/Aeson/RFC8785.p_o )
1546.94 s
[aeson] [31 of 32] Compiling Data.Aeson.QQ.Simple ( src/Data/Aeson/QQ/Simple.hs, dist/build/Data/Aeson/QQ/Simple.p_o )
1546.94 s
[aeson] [32 of 32] Compiling Data.Aeson.TH ( src/Data/Aeson/TH.hs, dist/build/Data/Aeson/TH.p_o )
1546.94 s
[aeson]
1546.94 s
[aeson] src/Data/Aeson/TH.hs:948:7: warning : [ GHC-62161 ] [ -Wincomplete-uni-patterns ]
1546.94 s
[aeson] Pattern match(es) are non-exhaustive
1546.94 s
[aeson] In a pattern binding: Patterns of type ‘[Q Exp]’ not matched: []
1546.94 s
[aeson] |
1546.94 s
[aeson] 948 | x:xs = [ lookupField argTy
1546.94 s
[aeson] | ^^^^^^^^^^^^^^^^^^^^^^^^^^...
1546.94 s
[aeson]
1546.94 s
[aeson] src/Data/Aeson/TH.hs:1064:14: warning : [ GHC-62161 ] [ -Wincomplete-uni-patterns ]
1546.94 s
[aeson] Pattern match(es) are non-exhaustive
1546.94 s
[aeson] In a pattern binding: Patterns of type ‘[Q Exp]’ not matched: []
1546.94 s
[aeson] |
1546.94 s
[aeson] 1064 | let x:xs = [ dispatchParseJSON jc conName tvMap argTy
1546.94 s
[aeson] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
1546.94 s
[aeson] Preprocessing test suite 'aeson-tests' for aeson-2.2.3.0..
1546.94 s
[aeson] Building test suite 'aeson-tests' for aeson-2.2.3.0..
1546.94 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1546.94 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1546.94 s
[algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
1546.94 s
[algebraic-graphs]
1546.94 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
1546.94 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1546.95 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1546.95 s
[algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
1546.95 s
[algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
1546.95 s
[algebraic-graphs] OK: Set.member x . preSet x == const False
1546.95 s
[algebraic-graphs]
1546.95 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
1546.95 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1546.95 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1546.95 s
[algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
1546.95 s
[algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
1546.95 s
[algebraic-graphs] OK: Set.member x . postSet x == const False
1546.95 s
[algebraic-graphs]
1546.95 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
1546.95 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1546.95 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1546.95 s
[algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
1546.95 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1546.95 s
[algebraic-graphs]
1546.95 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
1546.95 s
[algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
1546.95 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1546.95 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1546.95 s
[algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
1546.95 s
[algebraic-graphs]
1546.95 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
1546.95 s
[algebraic-graphs] OK: transpose empty == empty
1546.95 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1546.95 s
[algebraic-graphs] OK: transpose . transpose == id
1546.95 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1546.95 s
[algebraic-graphs]
1546.95 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
1546.95 s
[algebraic-graphs] OK: induce (const True ) x == x
1546.95 s
[algebraic-graphs] OK: induce (const False) x == empty
1546.95 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1546.95 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1546.95 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1546.95 s
[algebraic-graphs]
1546.95 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
1546.95 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1546.95 s
[algebraic-graphs] OK: induceJust . vertex . Just == vertex
1546.95 s
[algebraic-graphs]
1546.95 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
1546.95 s
[algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
1546.95 s
[algebraic-graphs]
1546.95 s
[algebraic-graphs] OK: box x y ~~ box y x
1546.95 s
[algebraic-graphs] OK: box x (vertex ()) ~~ x
1546.95 s
[algebraic-graphs] OK: box x empty ~~ empty
1546.95 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1546.95 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1546.95 s
[algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
1546.95 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1546.95 s
[algebraic-graphs]
1546.95 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
1546.95 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1546.95 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1546.95 s
[algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
1546.95 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1546.95 s
[algebraic-graphs]
1546.95 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
1546.95 s
[algebraic-graphs] OK: topSort empty == []
1546.95 s
[algebraic-graphs] OK: topSort (vertex x) == [x]
1546.95 s
[algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
1546.95 s
[algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
1546.95 s
[algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
1546.95 s
[algebraic-graphs]
1546.95 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
1546.95 s
[algebraic-graphs] OK: scc empty == empty
1546.95 s
[algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
1546.95 s
[algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
1546.95 s
[algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
1546.95 s
[algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
1546.95 s
[algebraic-graphs]
1546.95 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
1546.95 s
[algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
1546.95 s
[algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
1546.95 s
[algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
1546.95 s
[algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
1546.95 s
[algebraic-graphs]
1546.95 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
1546.95 s
[algebraic-graphs] OK: toAcyclicOrd empty == empty
1546.95 s
[algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
1546.95 s
[algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
1546.95 s
[algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
1546.95 s
[algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
1546.95 s
[algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
1546.95 s
[filemanip] System/FilePath/GlobPattern.hs:130:49: warning : [ GHC-63394 ] [ -Wx-partial ]
1546.95 s
[filemanip] In the use of ‘head’
1546.95 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1546.95 s
[filemanip] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1546.95 s
[filemanip] |
1546.95 s
[filemanip] 130 | | otherwise = let hs = map head ss
1546.95 s
[filemanip] | ^^^^
1546.95 s
[filemanip]
1546.95 s
[filemanip] System/FilePath/GlobPattern.hs:131:44: warning : [ GHC-63394 ] [ -Wx-partial ]
1546.95 s
[filemanip] In the use of ‘head’
1546.95 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1546.95 s
[filemanip] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1546.95 s
[filemanip] |
1546.95 s
[filemanip] 131 | h = head hs
1546.95 s
[filemanip] | ^^^^
1546.95 s
[filemanip]
1546.95 s
[filemanip] System/FilePath/GlobPattern.hs:132:54: warning : [ GHC-63394 ] [ -Wx-partial ]
1546.95 s
[filemanip] In the use of ‘tail’
1546.95 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1546.95 s
[filemanip] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1546.95 s
[filemanip] |
1546.95 s
[filemanip] 132 | in if all (h==) $ tail hs
1546.95 s
[filemanip] | ^^^^
1546.95 s
[filemanip]
1546.95 s
[filemanip] System/FilePath/GlobPattern.hs:133:62: warning : [ GHC-63394 ] [ -Wx-partial ]
1546.95 s
[filemanip] In the use of ‘tail’
1546.95 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1546.95 s
[filemanip] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1546.95 s
[filemanip] |
1546.95 s
[filemanip] 133 | then pfx (h:acc) $ map tail ss
1546.95 s
[filemanip] | ^^^^
1546.95 s
[filemanip]
1546.95 s
[filemanip] System/FilePath/GlobPattern.hs:149:22: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1546.95 s
[filemanip] This binding for ‘g’ shadows the existing binding
1546.95 s
[filemanip] bound at System/FilePath/GlobPattern.hs:148:24
1546.95 s
[filemanip] |
1546.95 s
[filemanip] 149 | where matchGroup g = matchTerms (MatchLiteral g : ts) cs
1546.95 s
[filemanip] | ^
1546.95 s
[filemanip]
1546.95 s
[filemanip] System/FilePath/GlobPattern.hs:154:48: warning : [ GHC-63394 ] [ -Wx-partial ]
1546.95 s
[filemanip] In the use of ‘tail’
1546.95 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1546.95 s
[filemanip] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1546.95 s
[filemanip] |
1546.95 s
[filemanip] 154 | Nothing -> matchAny (tail cs')
1546.95 s
[filemanip] | ^^^^
1546.95 s
[filemanip]
1546.95 s
[filemanip] System/FilePath/GlobPattern.hs:162:48: warning : [ GHC-63394 ] [ -Wx-partial ]
1546.95 s
[filemanip] In the use of ‘tail’
1546.95 s
[filemanip] (imported from Prelude, but defined in GHC.List):
1546.95 s
[ghc-exactprint] [3 of 5] Compiling Test.NoAnnotations ( tests/Test/NoAnnotations.hs, dist/build/test/test-tmp/Test/NoAnnotations.o )
1546.95 s
[ghc-exactprint] [4 of 5] Compiling Test.Transform ( tests/Test/Transform.hs, dist/build/test/test-tmp/Test/Transform.o )
1546.95 s
[ghc-exactprint]
1546.95 s
[ghc-exactprint] tests/Test/Transform.hs:114:31: warning : [ GHC-63394 ] [ -Wx-partial ]
1546.95 s
[ghc-exactprint] In the use of ‘tail’
1546.95 s
[ghc-exactprint] (imported from Data.List, but defined in GHC.List):
1546.95 s
[ghc-exactprint] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1546.95 s
[ghc-exactprint] |
1546.95 s
[ghc-exactprint] 114 | decls' = d2':de1':de0':(tail decls)
1546.95 s
[ghc-exactprint] | ^^^^
1546.95 s
[ghc-exactprint] [5 of 5] Compiling Main ( tests/Test.hs, dist/build/test/test-tmp/Main.o )
1546.95 s
[ghc-exactprint] [6 of 6] Linking dist/build/test/test
1546.95 s
[ghc-exactprint] buildPhase completed in 4 minutes 48 seconds
1546.95 s
[ghc-exactprint] Phase: checkPhase
1546.95 s
[ghc-exactprint] Running 1 test suites...
1546.95 s
[ghc-exactprint] Test suite test: RUNNING...
1546.95 s
[ghc-exactprint] GHC98
1546.95 s
[kan-extensions] include base-4.19.0.0-b960
1546.95 s
[kan-extensions] include comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1546.95 s
[kan-extensions] include containers-0.6.8-4775
1546.95 s
[kan-extensions] include contravariant-1.5.5-J4LLuUnbnVaBzsIx42BlgS
1546.95 s
[kan-extensions] include distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
1546.95 s
[kan-extensions] include free-5.2-5jsicnVtm8y8KG9LMRezMp
1546.95 s
[kan-extensions] include invariant-0.6.4-9MdOxjYVRq95RCcv5wEaad
1546.95 s
[kan-extensions] include mtl-2.3.1-63a4
1546.95 s
[kan-extensions] include profunctors-5.6.2-3nAHQARBXS12MCzIa3BzsU
1546.95 s
[kan-extensions] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1546.95 s
[kan-extensions] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1546.95 s
[kan-extensions] include transformers-0.6.1.0-c3ec
1546.95 s
[kan-extensions] Control.Comonad.Density=kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An:Control.Comonad.Density,Control.Monad.Co=kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An:Control.Monad.Co,Control.Monad.Codensity=kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An:Control.Monad.Codensity,Data.Functor.Contravariant.Coyoneda=kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An:Data.Functor.Contravariant.Coyoneda,Data.Functor.Contravariant.Day=kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An:Data.Functor.Contravariant.Day,Data.Functor.Contravariant.Yoneda=kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An:Data.Functor.Contravariant.Yoneda,Data.Functor.Coyoneda=kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An:Data.Functor.Coyoneda,Data.Functor.Day=kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An:Data.Functor.Day,Data.Functor.Day.Curried=kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An:Data.Functor.Day.Curried,Data.Functor.Invariant.Day=kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An:Data.Functor.Invariant.Day,Data.Functor.Kan.Lan=kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An:Data.Functor.Kan.Lan,Data.Functor.Kan.Ran=kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An:Data.Functor.Kan.Ran,Data.Functor.Yoneda=kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An:Data.Functor.Yoneda
1546.95 s
[kan-extensions] Ready component graph:
1546.95 s
[kan-extensions] definite kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An
1546.95 s
[kan-extensions] depends adjunctions-4.4.3-7V7yRvBLRZtG7WxgI78eNr
1546.95 s
[kan-extensions] depends array-0.5.6.0-dc89
1546.95 s
[kan-extensions] depends base-4.19.0.0-b960
1546.95 s
[kan-extensions] depends comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1546.95 s
[kan-extensions] depends containers-0.6.8-4775
1546.95 s
[kan-extensions] depends contravariant-1.5.5-J4LLuUnbnVaBzsIx42BlgS
1546.95 s
[kan-extensions] depends distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
1546.95 s
[kan-extensions] depends free-5.2-5jsicnVtm8y8KG9LMRezMp
1546.95 s
[kan-extensions] depends invariant-0.6.4-9MdOxjYVRq95RCcv5wEaad
1546.95 s
[kan-extensions] depends mtl-2.3.1-63a4
1546.95 s
[kan-extensions] depends profunctors-5.6.2-3nAHQARBXS12MCzIa3BzsU
1546.95 s
[kan-extensions] depends semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1546.95 s
[kan-extensions] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1546.95 s
[kan-extensions] depends transformers-0.6.1.0-c3ec
1546.95 s
[kan-extensions] Using Cabal-3.10.2.0 compiled by ghc-9.8
1546.95 s
[kan-extensions] Using compiler: ghc-9.8.1
1546.95 s
[kan-extensions] Using install prefix:
1546.95 s
[kan-extensions] /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6
1546.95 s
[kan-extensions] Executables installed in:
1546.95 s
[kan-extensions] /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6/bin
1546.95 s
[kan-extensions] Libraries installed in:
1546.95 s
[kan-extensions] /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An
1546.95 s
[kan-extensions] Dynamic Libraries installed in:
1546.95 s
[kan-extensions] /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1546.95 s
[kan-extensions] Private executables installed in:
1546.95 s
[kan-extensions] /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6/libexec/x86_64-linux-ghc-9.8.1/kan-extensions-5.2.6
1546.95 s
[kan-extensions] Data files installed in:
1546.95 s
[kan-extensions] /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6/share/x86_64-linux-ghc-9.8.1/kan-extensions-5.2.6
1546.95 s
[kan-extensions] Documentation installed in:
1546.95 s
[kan-extensions] /nix/store/71fs2683vypxzjif0mirrkm6f2vva1gd-kan-extensions-5.2.6-doc/share/doc/kan-extensions-5.2.6
1546.95 s
[kan-extensions] Configuration files installed in:
1546.95 s
[kan-extensions] /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6/etc
1546.95 s
[kan-extensions] No alex found
1546.95 s
[kan-extensions] Using ar found on system at:
1546.95 s
[kan-extensions] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1546.95 s
[kan-extensions] No c2hs found
1546.95 s
[kan-extensions] No cpphs found
1546.95 s
[kan-extensions] No doctest found
1546.95 s
[kan-extensions] Using gcc version 14.3.0 given by user at:
1546.95 s
[kan-extensions] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1546.95 s
[kan-extensions] Using ghc version 9.8.1 found on system at:
1546.95 s
[kan-extensions] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1546.95 s
[kan-extensions] Using ghc-pkg version 9.8.1 found on system at:
1546.95 s
[regex] include base-4.19.0.0-b960
1546.95 s
[regex] include base-compat-0.13.1-Eotc18fTsmWG4LIuz3QQXm
1546.95 s
[regex] include bytestring-0.12.0.2-4690
1546.95 s
[regex] include containers-0.6.8-4775
1546.95 s
[regex] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1546.95 s
[regex] include regex-base-0.94.0.3-J3ME5r0V7dZ2OROnz448wg
1546.95 s
[regex] include regex-pcre-builtin-0.95.2.3.8.44-KEghb9i9Y7BDoSBfWCLtRJ
1546.95 s
[regex] include regex-tdfa-1.3.2.3-AkYTgc8l27U9EvdFIYXjru
1546.95 s
[regex] include template-haskell-2.21.0.0-8831
1546.95 s
[regex] include text-2.1-c36a
1546.95 s
[regex] include time-1.12.2-d26d
1546.95 s
[regex] include time-locale-compat-0.1.1.5-1JraZvcDIW7ILMHKkdGQNi
1546.95 s
[regex] include transformers-0.6.1.0-c3ec
1546.95 s
[regex] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1546.95 s
[regex] include utf8-string-1.0.2-3f0Yb0EPatE18c5eXZUE9
1546.95 s
[regex] Text.RE=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE,Text.RE.REOptions=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.REOptions,Text.RE.Replace=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.Replace,Text.RE.Summa=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.Summa,Text.RE.TDFA=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.TDFA,Text.RE.TDFA.ByteString=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.TDFA.ByteString,Text.RE.TDFA.ByteString.Lazy=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.TDFA.ByteString.Lazy,Text.RE.TDFA.Sequence=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.TDFA.Sequence,Text.RE.TDFA.String=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.TDFA.String,Text.RE.TDFA.Text=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.TDFA.Text,Text.RE.TDFA.Text.Lazy=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.TDFA.Text.Lazy,Text.RE.TestBench=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.TestBench,Text.RE.TestBench.Parsers=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.TestBench.Parsers,Text.RE.Tools=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.Tools,Text.RE.Tools.Edit=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.Tools.Edit,Text.RE.Tools.Find=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.Tools.Find,Text.RE.Tools.Grep=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.Tools.Grep,Text.RE.Tools.IsRegex=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.Tools.IsRegex,Text.RE.Tools.Lex=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.Tools.Lex,Text.RE.Tools.Sed=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.Tools.Sed,Text.RE.ZeInternals=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.ZeInternals,Text.RE.ZeInternals.Types.Poss=regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z:Text.RE.ZeInternals.Types.Poss
1546.95 s
[regex] Ready component graph:
1546.95 s
[regex] definite regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z
1546.95 s
[regex] depends array-0.5.6.0-dc89
1546.95 s
[regex] depends base-4.19.0.0-b960
1546.95 s
[regex] depends base-compat-0.13.1-Eotc18fTsmWG4LIuz3QQXm
1546.95 s
[regex] depends bytestring-0.12.0.2-4690
1546.95 s
[regex] depends containers-0.6.8-4775
1546.95 s
[regex] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1546.95 s
[regex] depends regex-base-0.94.0.3-J3ME5r0V7dZ2OROnz448wg
1546.95 s
[regex] depends regex-pcre-builtin-0.95.2.3.8.44-KEghb9i9Y7BDoSBfWCLtRJ
1546.95 s
[regex] depends regex-tdfa-1.3.2.3-AkYTgc8l27U9EvdFIYXjru
1546.95 s
[regex] depends template-haskell-2.21.0.0-8831
1546.95 s
[regex] depends text-2.1-c36a
1546.95 s
[regex] depends time-1.12.2-d26d
1546.95 s
[regex] depends time-locale-compat-0.1.1.5-1JraZvcDIW7ILMHKkdGQNi
1546.95 s
[regex] depends transformers-0.6.1.0-c3ec
1546.95 s
[regex] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1546.95 s
[regex] depends utf8-string-1.0.2-3f0Yb0EPatE18c5eXZUE9
1546.95 s
[regex] Using Cabal-3.10.2.0 compiled by ghc-9.8
1546.95 s
[regex] Using compiler: ghc-9.8.1
1546.95 s
[regex] Using install prefix:
1546.95 s
[regex] /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2
1546.95 s
[regex] Executables installed in:
1546.95 s
[regex] /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2/bin
1546.95 s
[regex] Libraries installed in:
1546.95 s
[regex] /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z
1546.95 s
[regex] Dynamic Libraries installed in:
1546.95 s
[regex] /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1546.95 s
[regex] Private executables installed in:
1546.95 s
[regex] /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2/libexec/x86_64-linux-ghc-9.8.1/regex-1.1.0.2
1546.95 s
[regex] Data files installed in:
1546.95 s
[regex] /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2/share/x86_64-linux-ghc-9.8.1/regex-1.1.0.2
1546.95 s
[shake] [29 of 71] Compiling Development.Shake.Internal.History.Serialise ( src/Development/Shake/Internal/History/Serialise.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/History/Serialise.o )
1546.95 s
[shake] [30 of 71] Compiling Development.Shake.Internal.History.Server ( src/Development/Shake/Internal/History/Server.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/History/Server.o )
1546.95 s
[shake] [31 of 71] Compiling Development.Shake.Internal.Core.Database ( src/Development/Shake/Internal/Core/Database.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Core/Database.o )
1546.95 s
[shake] [32 of 71] Compiling General.ListBuilder ( src/General/ListBuilder.hs, dist/build/shake/shake-tmp/General/ListBuilder.o )
1546.95 s
[shake] [33 of 71] Compiling General.Makefile ( src/General/Makefile.hs, dist/build/shake/shake-tmp/General/Makefile.o )
1546.95 s
[shake] [34 of 71] Compiling General.Process ( src/General/Process.hs, dist/build/shake/shake-tmp/General/Process.o )
1546.95 s
[shake] [35 of 71] Compiling General.Thread ( src/General/Thread.hs, dist/build/shake/shake-tmp/General/Thread.o )
1546.95 s
[shake] [36 of 71] Compiling General.Chunks ( src/General/Chunks.hs, dist/build/shake/shake-tmp/General/Chunks.o )
1546.95 s
[shake] [37 of 71] Compiling General.Timing ( src/General/Timing.hs, dist/build/shake/shake-tmp/General/Timing.o )
1546.95 s
[shake] [38 of 71] Compiling General.Pool ( src/General/Pool.hs, dist/build/shake/shake-tmp/General/Pool.o )
1546.95 s
[shake] [39 of 71] Compiling Development.Shake.Internal.Core.Storage ( src/Development/Shake/Internal/Core/Storage.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Core/Storage.o )
1546.95 s
[shake] [40 of 71] Compiling General.TypeMap ( src/General/TypeMap.hs, dist/build/shake/shake-tmp/General/TypeMap.o )
1546.95 s
[shake] [41 of 71] Compiling General.Wait ( src/General/Wait.hs, dist/build/shake/shake-tmp/General/Wait.o )
1546.95 s
[shake] [42 of 71] Compiling Development.Shake.Internal.History.Shared ( src/Development/Shake/Internal/History/Shared.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/History/Shared.o )
1546.95 s
[shake] [43 of 71] Compiling Development.Shake.Internal.History.Cloud ( src/Development/Shake/Internal/History/Cloud.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/History/Cloud.o )
1546.95 s
[shake] [44 of 71] Compiling Development.Shake.Internal.Core.Types ( src/Development/Shake/Internal/Core/Types.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Core/Types.o )
1546.95 s
[shake] [45 of 71] Compiling Development.Shake.Internal.Core.Rules ( src/Development/Shake/Internal/Core/Rules.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Core/Rules.o )
1546.95 s
[shake] [46 of 71] Compiling Development.Shake.Internal.Core.Pool ( src/Development/Shake/Internal/Core/Pool.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Core/Pool.o )
1546.95 s
[shake] [47 of 71] Compiling Development.Shake.Internal.Core.Action ( src/Development/Shake/Internal/Core/Action.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Core/Action.o )
1546.95 s
[shake] [48 of 71] Compiling Development.Shake.Internal.Resource ( src/Development/Shake/Internal/Resource.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Resource.o )
1546.95 s
[shake] [49 of 71] Compiling Development.Shake.Internal.Core.Build ( src/Development/Shake/Internal/Core/Build.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Core/Build.o )
1546.95 s
[shake] [50 of 71] Compiling Development.Shake.Internal.Rules.Rerun ( src/Development/Shake/Internal/Rules/Rerun.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Rules/Rerun.o )
1546.95 s
[shake] [51 of 71] Compiling Development.Shake.Internal.Rules.Oracle ( src/Development/Shake/Internal/Rules/Oracle.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Rules/Oracle.o )
1546.95 s
[shake] [52 of 71] Compiling Development.Shake.Internal.Rules.File ( src/Development/Shake/Internal/Rules/File.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Rules/File.o )
1546.95 s
[shake] [53 of 71] Compiling Development.Shake.Internal.Rules.OrderOnly ( src/Development/Shake/Internal/Rules/OrderOnly.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Rules/OrderOnly.o )
1546.95 s
[shake] [54 of 71] Compiling Development.Shake.Internal.Rules.Files ( src/Development/Shake/Internal/Rules/Files.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Rules/Files.o )
1546.95 s
[unordered-containers] +++ OK, passed 100 tests.
1546.95 s
[unordered-containers] delete: OK (0.06s)
1546.95 s
[unordered-containers] +++ OK, passed 100 tests.
1546.95 s
[unordered-containers] lookup: OK (0.06s)
1546.95 s
[unordered-containers] +++ OK, passed 100 tests.
1546.95 s
[unordered-containers] valid: OK (0.15s)
1546.95 s
[unordered-containers] +++ OK, passed 100 tests.
1546.95 s
[unordered-containers] isSubmapOf
1546.95 s
[unordered-containers] model: OK (0.15s)
1546.95 s
[unordered-containers] +++ OK, passed 100 tests.
1546.95 s
[unordered-containers] m ⊆ m: OK (0.01s)
1546.95 s
[unordered-containers] +++ OK, passed 100 tests.
1546.95 s
[unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.17s)
1546.95 s
[unordered-containers] +++ OK, passed 100 tests.
1546.95 s
[unordered-containers] m1 ⊈ m2 ⇒ m1 ∪ m2 ⊈ m1: OK (0.12s)
1546.95 s
[unordered-containers] +++ OK, passed 100 tests; 19 discarded.
1546.95 s
[unordered-containers] m1\m2 ⊆ m1: OK (0.12s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.12s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests; 202 discarded.
1546.96 s
[unordered-containers] delete k m ⊆ m: OK (0.04s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests; 15 discarded.
1546.96 s
[unordered-containers] m ⊈ delete k m : OK (0.04s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests; 16 discarded.
1546.96 s
[unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.05s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests; 6 discarded.
1546.96 s
[unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.07s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests; 5 discarded.
1546.96 s
[unordered-containers] union
1546.96 s
[unordered-containers] model: OK (0.12s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] valid: OK (0.09s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] unionWith
1546.96 s
[unordered-containers] model: OK (0.12s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] valid: OK (0.09s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] unionWithKey
1546.96 s
[unordered-containers] model: OK (0.22s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] valid: OK (0.06s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] unions
1546.96 s
[unordered-containers] model: OK (5.80s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] valid: OK (3.34s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] difference
1546.96 s
[unordered-containers] model: OK (0.15s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] valid: OK (0.09s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] differenceWith
1546.96 s
[unordered-containers] model: OK (0.16s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] valid: OK (0.14s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] intersection
1546.96 s
[unordered-containers] model: OK (0.09s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] valid: OK (0.04s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] intersectionWith
1546.96 s
[unordered-containers] model: OK (0.22s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] valid: OK (0.06s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] intersectionWithKey
1546.96 s
[unordered-containers] model: OK (0.18s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] valid: OK (0.09s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] compose
1546.96 s
[unordered-containers] valid: OK (0.09s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] map
1546.96 s
[unordered-containers] model: OK (0.36s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] valid: OK (0.04s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] traverseWithKey
1546.96 s
[unordered-containers] model: OK (3.71s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] valid: OK (0.07s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] mapKeys
1546.96 s
[unordered-containers] model: OK (0.06s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] valid: OK (3.86s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] foldr: OK (0.03s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] foldl: OK (0.07s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[unordered-containers] foldrWithKey: OK (0.10s)
1546.96 s
[unordered-containers] +++ OK, passed 100 tests.
1546.96 s
[aeson] [ 1 of 42] Compiling Functions ( tests/Functions.hs, dist/build/aeson-tests/aeson-tests-tmp/Functions.o, dist/build/aeson-tests/aeson-tests-tmp/Functions.dyn_o )
1546.96 s
[aeson] [ 2 of 42] Compiling JSONTestSuite ( tests/JSONTestSuite.hs, dist/build/aeson-tests/aeson-tests-tmp/JSONTestSuite.o )
1546.96 s
[aeson] [ 3 of 42] Compiling Options ( tests/Options.hs, dist/build/aeson-tests/aeson-tests-tmp/Options.o, dist/build/aeson-tests/aeson-tests-tmp/Options.dyn_o )
1546.96 s
[aeson] [ 4 of 42] Compiling Regression.Issue351 ( tests/Regression/Issue351.hs, dist/build/aeson-tests/aeson-tests-tmp/Regression/Issue351.o, dist/build/aeson-tests/aeson-tests-tmp/Regression/Issue351.dyn_o )
1546.96 s
[aeson] [ 5 of 42] Compiling Regression.Issue571 ( tests/Regression/Issue571.hs, dist/build/aeson-tests/aeson-tests-tmp/Regression/Issue571.o, dist/build/aeson-tests/aeson-tests-tmp/Regression/Issue571.dyn_o )
1546.96 s
[aeson] [ 6 of 42] Compiling Regression.Issue687 ( tests/Regression/Issue687.hs, dist/build/aeson-tests/aeson-tests-tmp/Regression/Issue687.o, dist/build/aeson-tests/aeson-tests-tmp/Regression/Issue687.dyn_o )
1546.96 s
[aeson] [ 7 of 42] Compiling Regression.Issue967 ( tests/Regression/Issue967.hs, dist/build/aeson-tests/aeson-tests-tmp/Regression/Issue967.o, dist/build/aeson-tests/aeson-tests-tmp/Regression/Issue967.dyn_o )
1546.96 s
[aeson] [ 8 of 42] Compiling Types ( tests/Types.hs, dist/build/aeson-tests/aeson-tests-tmp/Types.o, dist/build/aeson-tests/aeson-tests-tmp/Types.dyn_o )
1546.96 s
[aeson] [ 9 of 42] Compiling Instances ( tests/Instances.hs, dist/build/aeson-tests/aeson-tests-tmp/Instances.o, dist/build/aeson-tests/aeson-tests-tmp/Instances.dyn_o )
1546.96 s
[aeson] [10 of 42] Compiling SerializationFormatSpec ( tests/SerializationFormatSpec.hs, dist/build/aeson-tests/aeson-tests-tmp/SerializationFormatSpec.o, dist/build/aeson-tests/aeson-tests-tmp/SerializationFormatSpec.dyn_o )
1546.96 s
[aeson] [11 of 42] Compiling PropertyQC ( tests/PropertyQC.hs, dist/build/aeson-tests/aeson-tests-tmp/PropertyQC.o )
1546.96 s
[aeson] [12 of 42] Compiling Encoders ( tests/Encoders.hs, dist/build/aeson-tests/aeson-tests-tmp/Encoders.o, dist/build/aeson-tests/aeson-tests-tmp/Encoders.dyn_o )
1546.96 s
[aeson] [13 of 42] Compiling PropUtils ( tests/PropUtils.hs, dist/build/aeson-tests/aeson-tests-tmp/PropUtils.o )
1546.96 s
[aeson] [14 of 42] Compiling PropertyTH ( tests/PropertyTH.hs, dist/build/aeson-tests/aeson-tests-tmp/PropertyTH.o )
1546.96 s
[aeson] [15 of 42] Compiling PropertyRTFunctors ( tests/PropertyRTFunctors.hs, dist/build/aeson-tests/aeson-tests-tmp/PropertyRTFunctors.o )
1546.96 s
[aeson] [16 of 42] Compiling PropertyRoundTrip ( tests/PropertyRoundTrip.hs, dist/build/aeson-tests/aeson-tests-tmp/PropertyRoundTrip.o )
1546.96 s
[aeson] [17 of 42] Compiling PropertyKeys ( tests/PropertyKeys.hs, dist/build/aeson-tests/aeson-tests-tmp/PropertyKeys.o )
1546.96 s
[aeson] [18 of 42] Compiling PropertyGeneric ( tests/PropertyGeneric.hs, dist/build/aeson-tests/aeson-tests-tmp/PropertyGeneric.o )
1546.96 s
[aeson] [19 of 42] Compiling Properties ( tests/Properties.hs, dist/build/aeson-tests/aeson-tests-tmp/Properties.o )
1546.96 s
[aeson] [20 of 42] Compiling ErrorMessages ( tests/ErrorMessages.hs, dist/build/aeson-tests/aeson-tests-tmp/ErrorMessages.o, dist/build/aeson-tests/aeson-tests-tmp/ErrorMessages.dyn_o )
1546.96 s
[aeson] [21 of 42] Compiling DataFamilies.Types ( tests/DataFamilies/Types.hs, dist/build/aeson-tests/aeson-tests-tmp/DataFamilies/Types.o, dist/build/aeson-tests/aeson-tests-tmp/DataFamilies/Types.dyn_o )
1546.96 s
[aeson] [22 of 42] Compiling DataFamilies.Instances ( tests/DataFamilies/Instances.hs, dist/build/aeson-tests/aeson-tests-tmp/DataFamilies/Instances.o )
1546.96 s
[aeson] [23 of 42] Compiling DataFamilies.Encoders ( tests/DataFamilies/Encoders.hs, dist/build/aeson-tests/aeson-tests-tmp/DataFamilies/Encoders.o )
1546.96 s
[aeson] [24 of 42] Compiling DataFamilies.Properties ( tests/DataFamilies/Properties.hs, dist/build/aeson-tests/aeson-tests-tmp/DataFamilies/Properties.o )
1546.96 s
[aeson] [25 of 42] Compiling CastFloat ( tests/CastFloat.hs, dist/build/aeson-tests/aeson-tests-tmp/CastFloat.o, dist/build/aeson-tests/aeson-tests-tmp/CastFloat.dyn_o )
1546.96 s
[algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
1546.96 s
[algebraic-graphs] OK: shrink . AM.vertex == vertex
1546.96 s
[algebraic-graphs] OK: shrink . AM.vertices == vertices
1546.96 s
[algebraic-graphs] OK: shrink . fromAcyclic == id
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
1546.96 s
[algebraic-graphs] OK: Arbitrary
1546.96 s
[algebraic-graphs] OK: empty
1546.96 s
[algebraic-graphs] OK: vertex
1546.96 s
[algebraic-graphs] OK: vertices
1546.96 s
[algebraic-graphs] OK: union
1546.96 s
[algebraic-graphs] OK: join
1546.96 s
[algebraic-graphs] OK: transpose
1546.96 s
[algebraic-graphs] OK: box
1546.96 s
[algebraic-graphs] OK: transitiveClosure
1546.96 s
[algebraic-graphs] OK: scc
1546.96 s
[algebraic-graphs] OK: toAcyclic
1546.96 s
[algebraic-graphs] OK: toAcyclicOrd
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ AdjacencyIntMap ============
1546.96 s
[algebraic-graphs] OK: Axioms of graphs
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
1546.96 s
[algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ AdjacencyIntMap.consistent ============
1546.96 s
[algebraic-graphs] OK: Consistency of the Arbitrary instance
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] OK: consistent empty == True
1546.96 s
[algebraic-graphs] OK: consistent (vertex x) == True
1546.96 s
[algebraic-graphs] OK: consistent (overlay x y) == True
1546.96 s
[algebraic-graphs] OK: consistent (connect x y) == True
1546.96 s
[algebraic-graphs] OK: consistent (edge x y) == True
1546.96 s
[algebraic-graphs] OK: consistent (edges xs) == True
1546.96 s
[algebraic-graphs] OK: consistent (stars xs) == True
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ AdjacencyIntMap.Show ============
1546.96 s
[algebraic-graphs] OK: show (empty ) == "empty"
1546.96 s
[algebraic-graphs] OK: show (1 ) == "vertex 1"
1546.96 s
[algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
1546.96 s
[algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
1546.96 s
[algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
1546.96 s
[algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
1546.96 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
1546.96 s
[algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
1546.96 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
1546.96 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ AdjacencyIntMap.Ord ============
1546.96 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1546.96 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1546.96 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1546.96 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1546.96 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1546.96 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1546.96 s
[algebraic-graphs] OK: x <= x + y
1546.96 s
[algebraic-graphs] OK: x + y <= x * y
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ AdjacencyIntMap.empty ============
1546.96 s
[algebraic-graphs] OK: isEmpty empty == True
1546.96 s
[algebraic-graphs] OK: hasVertex x empty == False
1546.96 s
[algebraic-graphs] OK: vertexCount empty == 0
1546.96 s
[algebraic-graphs] OK: edgeCount empty == 0
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ AdjacencyIntMap.vertex ============
1546.96 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1546.96 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1546.96 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1546.96 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ AdjacencyIntMap.edge ============
1546.96 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1546.96 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1546.96 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1546.96 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1546.96 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ AdjacencyIntMap.overlay ============
1546.96 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1546.96 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1546.96 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1546.96 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1546.96 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1546.96 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1546.96 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1546.96 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ AdjacencyIntMap.connect ============
1546.96 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1546.96 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1546.96 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1546.96 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1546.96 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1546.96 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1546.96 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1546.96 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1546.96 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1546.96 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ AdjacencyIntMap.vertices ============
1546.96 s
[algebraic-graphs] OK: vertices [] == empty
1546.96 s
[algebraic-graphs] OK: vertices [x] == vertex x
1546.96 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1546.96 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1546.96 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1546.96 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ AdjacencyIntMap.edges ============
1546.96 s
[algebraic-graphs] OK: edges [] == empty
1546.96 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1546.96 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1546.96 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1546.96 s
[algebraic-graphs]
1546.96 s
[algebraic-graphs] ============ AdjacencyIntMap.overlays ============
1546.96 s
[filemanip] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1546.96 s
[filemanip] |
1546.96 s
[filemanip] 162 | Nothing -> matchDir $ tail cs'
1546.96 s
[filemanip] | ^^^^
1546.96 s
[filemanip] [2 of 4] Compiling System.FilePath.Glob ( System/FilePath/Glob.hs, nothing )
1546.96 s
[filemanip] [3 of 4] Compiling System.FilePath.Find ( System/FilePath/Find.hs, nothing )
1546.96 s
[filemanip]
1546.96 s
[filemanip] System/FilePath/Find.hs:227:20: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1546.96 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1546.96 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1546.96 s
[filemanip] |
1546.96 s
[filemanip] 227 | where visit path depth st =
1546.96 s
[filemanip] | ^^^^^
1546.96 s
[filemanip]
1546.96 s
[filemanip] System/FilePath/Find.hs:231:9: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1546.96 s
[filemanip] This binding for ‘traverse’ shadows the existing binding
1546.96 s
[filemanip] imported from ‘Prelude’ at System/FilePath/Find.hs:39:8-27
1546.96 s
[filemanip] (and originally defined in ‘Data.Traversable’)
1546.96 s
[filemanip] |
1546.96 s
[filemanip] 231 | traverse dir depth dirSt = do
1546.96 s
[filemanip] | ^^^^^^^^
1546.96 s
[filemanip]
1546.96 s
[filemanip] System/FilePath/Find.hs:231:22: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1546.96 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1546.96 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1546.96 s
[filemanip] |
1546.96 s
[filemanip] 231 | traverse dir depth dirSt = do
1546.96 s
[filemanip] | ^^^^^
1546.96 s
[filemanip]
1546.96 s
[filemanip] System/FilePath/Find.hs:238:25: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1546.96 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1546.96 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1546.96 s
[filemanip] |
1546.96 s
[filemanip] 238 | filterPath path depth st result =
1546.96 s
[filemanip] | ^^^^^
1546.96 s
[filemanip]
1546.96 s
[filemanip] System/FilePath/Find.hs:274:15: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1546.96 s
[filemanip] This binding for ‘state’ shadows the existing binding
1546.96 s
[filemanip] bound at System/FilePath/Find.hs:271:38
1546.96 s
[filemanip] |
1546.96 s
[filemanip] 274 | where visit state path depth st =
1546.96 s
[filemanip] | ^^^^^
1546.96 s
[filemanip]
1546.96 s
[filemanip] System/FilePath/Find.hs:274:21: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1546.96 s
[filemanip] This binding for ‘path’ shadows the existing binding
1546.96 s
[filemanip] bound at System/FilePath/Find.hs:271:44
1546.96 s
[filemanip] |
1546.96 s
[filemanip] 274 | where visit state path depth st =
1546.96 s
[filemanip] | ^^^^
1546.96 s
[filemanip]
1546.96 s
[filemanip] System/FilePath/Find.hs:274:26: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1546.96 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1546.96 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1546.96 s
[filemanip] |
1546.96 s
[filemanip] 274 | where visit state path depth st =
1546.96 s
[filemanip] | ^^^^^
1546.96 s
[filemanip]
1546.96 s
[filemanip] System/FilePath/Find.hs:279:9: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1546.96 s
[filemanip] This binding for ‘traverse’ shadows the existing binding
1546.96 s
[filemanip] imported from ‘Prelude’ at System/FilePath/Find.hs:39:8-27
1546.96 s
[filemanip] (and originally defined in ‘Data.Traversable’)
1546.96 s
[filemanip] |
1546.97 s
[kan-extensions] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1546.97 s
[kan-extensions] No ghcjs found
1546.97 s
[kan-extensions] No ghcjs-pkg found
1546.97 s
[kan-extensions] No greencard found
1546.97 s
[kan-extensions] Using haddock version 2.30.0 found on system at:
1546.97 s
[kan-extensions] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1546.97 s
[kan-extensions] No happy found
1546.97 s
[kan-extensions] Using haskell-suite found on system at: haskell-suite-dummy-location
1546.97 s
[kan-extensions] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1546.97 s
[kan-extensions] No hmake found
1546.97 s
[kan-extensions] Using hpc version 0.69 found on system at:
1546.97 s
[kan-extensions] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1546.97 s
[kan-extensions] Using hsc2hs version 0.68.10 found on system at:
1546.97 s
[kan-extensions] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1546.97 s
[kan-extensions] Using hscolour version 1.25 found on system at:
1546.97 s
[kan-extensions] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1546.97 s
[kan-extensions] No jhc found
1546.97 s
[kan-extensions] Using ld found on system at:
1546.97 s
[kan-extensions] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1546.97 s
[kan-extensions] No pkg-config found
1546.97 s
[kan-extensions] Using runghc version 9.8.1 found on system at:
1546.97 s
[kan-extensions] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1546.97 s
[kan-extensions] Using strip version 2.44 found on system at:
1546.97 s
[kan-extensions] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1546.97 s
[kan-extensions] Using tar found on system at:
1546.97 s
[kan-extensions] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1546.97 s
[kan-extensions] No uhc found
1546.97 s
[kan-extensions] Phase: buildPhase
1546.97 s
[kan-extensions] Preprocessing library for kan-extensions-5.2.6..
1546.97 s
[kan-extensions] Building library for kan-extensions-5.2.6..
1546.97 s
[kan-extensions] [ 1 of 13] Compiling Data.Functor.Contravariant.Coyoneda ( src/Data/Functor/Contravariant/Coyoneda.hs, dist/build/Data/Functor/Contravariant/Coyoneda.o, dist/build/Data/Functor/Contravariant/Coyoneda.dyn_o )
1546.97 s
[kan-extensions] [ 2 of 13] Compiling Data.Functor.Contravariant.Day ( src/Data/Functor/Contravariant/Day.hs, dist/build/Data/Functor/Contravariant/Day.o, dist/build/Data/Functor/Contravariant/Day.dyn_o )
1546.97 s
[kan-extensions] [ 3 of 13] Compiling Data.Functor.Contravariant.Yoneda ( src/Data/Functor/Contravariant/Yoneda.hs, dist/build/Data/Functor/Contravariant/Yoneda.o, dist/build/Data/Functor/Contravariant/Yoneda.dyn_o )
1546.97 s
[kan-extensions] [ 4 of 13] Compiling Data.Functor.Day ( src/Data/Functor/Day.hs, dist/build/Data/Functor/Day.o, dist/build/Data/Functor/Day.dyn_o )
1546.97 s
[kan-extensions] [ 5 of 13] Compiling Data.Functor.Day.Curried ( src/Data/Functor/Day/Curried.hs, dist/build/Data/Functor/Day/Curried.o, dist/build/Data/Functor/Day/Curried.dyn_o )
1546.97 s
[kan-extensions] [ 6 of 13] Compiling Data.Functor.Invariant.Day ( src/Data/Functor/Invariant/Day.hs, dist/build/Data/Functor/Invariant/Day.o, dist/build/Data/Functor/Invariant/Day.dyn_o )
1546.97 s
[kan-extensions] [ 7 of 13] Compiling Data.Functor.Kan.Lan ( src/Data/Functor/Kan/Lan.hs, dist/build/Data/Functor/Kan/Lan.o, dist/build/Data/Functor/Kan/Lan.dyn_o )
1546.97 s
[kan-extensions] [ 8 of 13] Compiling Data.Functor.Coyoneda ( src/Data/Functor/Coyoneda.hs, dist/build/Data/Functor/Coyoneda.o, dist/build/Data/Functor/Coyoneda.dyn_o )
1546.97 s
[kan-extensions] [ 9 of 13] Compiling Control.Comonad.Density ( src/Control/Comonad/Density.hs, dist/build/Control/Comonad/Density.o, dist/build/Control/Comonad/Density.dyn_o )
1546.97 s
[kan-extensions] [10 of 13] Compiling Control.Monad.Co ( src/Control/Monad/Co.hs, dist/build/Control/Monad/Co.o, dist/build/Control/Monad/Co.dyn_o )
1546.97 s
[kan-extensions] [11 of 13] Compiling Data.Functor.Kan.Ran ( src/Data/Functor/Kan/Ran.hs, dist/build/Data/Functor/Kan/Ran.o, dist/build/Data/Functor/Kan/Ran.dyn_o )
1546.97 s
[kan-extensions] [12 of 13] Compiling Control.Monad.Codensity ( src/Control/Monad/Codensity.hs, dist/build/Control/Monad/Codensity.o, dist/build/Control/Monad/Codensity.dyn_o )
1546.97 s
[kan-extensions] [13 of 13] Compiling Data.Functor.Yoneda ( src/Data/Functor/Yoneda.hs, dist/build/Data/Functor/Yoneda.o, dist/build/Data/Functor/Yoneda.dyn_o )
1546.97 s
[kan-extensions] [ 1 of 13] Compiling Data.Functor.Contravariant.Coyoneda ( src/Data/Functor/Contravariant/Coyoneda.hs, dist/build/Data/Functor/Contravariant/Coyoneda.p_o )
1546.97 s
[kan-extensions] [ 2 of 13] Compiling Data.Functor.Contravariant.Day ( src/Data/Functor/Contravariant/Day.hs, dist/build/Data/Functor/Contravariant/Day.p_o )
1546.97 s
[kan-extensions] [ 3 of 13] Compiling Data.Functor.Contravariant.Yoneda ( src/Data/Functor/Contravariant/Yoneda.hs, dist/build/Data/Functor/Contravariant/Yoneda.p_o )
1546.97 s
[kan-extensions] [ 4 of 13] Compiling Data.Functor.Day ( src/Data/Functor/Day.hs, dist/build/Data/Functor/Day.p_o )
1546.97 s
[regex] Documentation installed in:
1546.97 s
[regex] /nix/store/29dzdfdjmihjak00g3p2xwdqgnihm3r8-regex-1.1.0.2-doc/share/doc/regex-1.1.0.2
1546.97 s
[regex] Configuration files installed in:
1546.97 s
[regex] /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2/etc
1546.97 s
[regex] No alex found
1546.97 s
[regex] Using ar found on system at:
1546.97 s
[regex] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1546.97 s
[regex] No c2hs found
1546.97 s
[regex] No cpphs found
1546.97 s
[regex] No doctest found
1546.97 s
[regex] Using gcc version 14.3.0 given by user at:
1546.97 s
[regex] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1546.97 s
[regex] Using ghc version 9.8.1 found on system at:
1546.97 s
[regex] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1546.97 s
[regex] Using ghc-pkg version 9.8.1 found on system at:
1546.97 s
[regex] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1546.97 s
[regex] No ghcjs found
1546.97 s
[regex] No ghcjs-pkg found
1546.97 s
[regex] No greencard found
1546.97 s
[regex] Using haddock version 2.30.0 found on system at:
1546.97 s
[regex] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1546.97 s
[regex] No happy found
1546.97 s
[regex] Using haskell-suite found on system at: haskell-suite-dummy-location
1546.97 s
[regex] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1546.97 s
[regex] No hmake found
1546.97 s
[regex] Using hpc version 0.69 found on system at:
1546.97 s
[regex] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1546.97 s
[regex] Using hsc2hs version 0.68.10 found on system at:
1546.97 s
[regex] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1546.97 s
[regex] Using hscolour version 1.25 found on system at:
1546.97 s
[regex] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1546.97 s
[regex] No jhc found
1546.97 s
[regex] Using ld found on system at:
1546.97 s
[regex] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1546.97 s
[regex] No pkg-config found
1546.97 s
[regex] Using runghc version 9.8.1 found on system at:
1546.97 s
[regex] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1546.97 s
[regex] Using strip version 2.44 found on system at:
1546.97 s
[regex] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1546.97 s
[regex] Using tar found on system at:
1546.97 s
[regex] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1546.97 s
[regex] No uhc found
1546.97 s
[regex] Phase: buildPhase
1546.97 s
[regex] Preprocessing library for regex-1.1.0.2..
1546.97 s
[regex] Building library for regex-1.1.0.2..
1546.97 s
[regex] [ 1 of 48] Compiling Text.RE ( Text/RE.hs, dist/build/Text/RE.o, dist/build/Text/RE.dyn_o )
1546.97 s
[regex] [ 2 of 48] Compiling Text.RE.REOptions ( Text/RE/REOptions.lhs, dist/build/Text/RE/REOptions.o, dist/build/Text/RE/REOptions.dyn_o )
1546.97 s
[regex] [ 3 of 48] Compiling Text.RE.ZeInternals.EscapeREString ( Text/RE/ZeInternals/EscapeREString.hs, dist/build/Text/RE/ZeInternals/EscapeREString.o, dist/build/Text/RE/ZeInternals/EscapeREString.dyn_o )
1546.97 s
[regex] [ 4 of 48] Compiling Text.RE.ZeInternals.QQ ( Text/RE/ZeInternals/QQ.hs, dist/build/Text/RE/ZeInternals/QQ.o, dist/build/Text/RE/ZeInternals/QQ.dyn_o )
1546.97 s
[regex] [ 5 of 48] Compiling Text.RE.ZeInternals.Types.Capture ( Text/RE/ZeInternals/Types/Capture.lhs, dist/build/Text/RE/ZeInternals/Types/Capture.o, dist/build/Text/RE/ZeInternals/Types/Capture.dyn_o )
1546.97 s
[regex] [ 6 of 48] Compiling Text.RE.ZeInternals.Types.CaptureID ( Text/RE/ZeInternals/Types/CaptureID.hs, dist/build/Text/RE/ZeInternals/Types/CaptureID.o, dist/build/Text/RE/ZeInternals/Types/CaptureID.dyn_o )
1546.97 s
[regex] [ 7 of 48] Compiling Text.RE.ZeInternals.Types.LineNo ( Text/RE/ZeInternals/Types/LineNo.hs, dist/build/Text/RE/ZeInternals/Types/LineNo.o, dist/build/Text/RE/ZeInternals/Types/LineNo.dyn_o )
1546.97 s
[regex] [ 8 of 48] Compiling Text.RE.ZeInternals.Types.Match ( Text/RE/ZeInternals/Types/Match.lhs, dist/build/Text/RE/ZeInternals/Types/Match.o, dist/build/Text/RE/ZeInternals/Types/Match.dyn_o )
1546.97 s
[regex] [ 9 of 48] Compiling Text.RE.ZeInternals.Types.Matches ( Text/RE/ZeInternals/Types/Matches.lhs, dist/build/Text/RE/ZeInternals/Types/Matches.o, dist/build/Text/RE/ZeInternals/Types/Matches.dyn_o )
1546.97 s
[regex] [10 of 48] Compiling Text.RE.ZeInternals.Replace ( Text/RE/ZeInternals/Replace.lhs, dist/build/Text/RE/ZeInternals/Replace.o, dist/build/Text/RE/ZeInternals/Replace.dyn_o )
1546.97 s
[regex]
1546.97 s
[regex] Text/RE/ZeInternals/Replace.lhs:530:34: warning : [ GHC-63394 ] [ -Wx-partial ]
1546.97 s
[regex] In the use of ‘tail’
1546.97 s
[regex] (imported from Prelude.Compat, but defined in GHC.List):
1546.97 s
[shake] [55 of 71] Compiling Development.Shake.Internal.Derived ( src/Development/Shake/Internal/Derived.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Derived.o )
1546.97 s
[shake] [56 of 71] Compiling Development.Shake.Command ( src/Development/Shake/Command.hs, dist/build/shake/shake-tmp/Development/Shake/Command.o )
1546.97 s
[shake] [57 of 71] Compiling Development.Shake.Internal.Rules.Directory ( src/Development/Shake/Internal/Rules/Directory.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Rules/Directory.o )
1546.97 s
[shake] [58 of 71] Compiling Development.Shake.Internal.Rules.Default ( src/Development/Shake/Internal/Rules/Default.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Rules/Default.o )
1546.97 s
[shake] [59 of 71] Compiling Paths_shake ( dist/build/shake/autogen/Paths_shake.hs, dist/build/shake/shake-tmp/Paths_shake.o )
1546.97 s
[shake] [60 of 71] Compiling Development.Shake.Internal.Paths ( src/Development/Shake/Internal/Paths.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Paths.o )
1546.97 s
[shake] [61 of 71] Compiling General.Template ( src/General/Template.hs, dist/build/shake/shake-tmp/General/Template.o )
1546.97 s
[shake] [62 of 71] Compiling Development.Shake.Internal.Progress ( src/Development/Shake/Internal/Progress.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Progress.o )
1546.97 s
[shake] [63 of 71] Compiling Development.Shake.Internal.CompactUI ( src/Development/Shake/Internal/CompactUI.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/CompactUI.o )
1546.97 s
[shake] [64 of 71] Compiling Development.Shake.Internal.Profile ( src/Development/Shake/Internal/Profile.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Profile.o )
1546.97 s
[shake] [65 of 71] Compiling Development.Shake.Internal.Core.Run ( src/Development/Shake/Internal/Core/Run.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Core/Run.o )
1546.97 s
[shake] [66 of 71] Compiling Development.Shake.Database ( src/Development/Shake/Database.hs, dist/build/shake/shake-tmp/Development/Shake/Database.o )
1546.97 s
[shake] [67 of 71] Compiling Development.Shake.Internal.Demo ( src/Development/Shake/Internal/Demo.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Demo.o )
1546.97 s
[shake] [68 of 71] Compiling Development.Shake.Internal.Args ( src/Development/Shake/Internal/Args.hs, dist/build/shake/shake-tmp/Development/Shake/Internal/Args.o )
1546.97 s
[shake] [69 of 71] Compiling Development.Shake ( src/Development/Shake.hs, dist/build/shake/shake-tmp/Development/Shake.o )
1546.97 s
[shake] [70 of 71] Compiling Development.Ninja.All ( src/Development/Ninja/All.hs, dist/build/shake/shake-tmp/Development/Ninja/All.o )
1546.97 s
[shake] [71 of 71] Compiling Run ( src/Run.hs, dist/build/shake/shake-tmp/Run.o )
1546.97 s
[shake] [72 of 72] Linking dist/build/shake/shake
1546.97 s
[shake] Preprocessing library for shake-0.19.8..
1546.97 s
[shake] Building library for shake-0.19.8..
1546.97 s
[shake] [ 1 of 73] Compiling Development.Ninja.Env ( src/Development/Ninja/Env.hs, dist/build/Development/Ninja/Env.o, dist/build/Development/Ninja/Env.dyn_o )
1546.97 s
[shake] [ 2 of 73] Compiling Development.Ninja.Type ( src/Development/Ninja/Type.hs, dist/build/Development/Ninja/Type.o, dist/build/Development/Ninja/Type.dyn_o )
1546.97 s
[shake] [ 3 of 73] Compiling Development.Ninja.Lexer ( src/Development/Ninja/Lexer.hs, dist/build/Development/Ninja/Lexer.o, dist/build/Development/Ninja/Lexer.dyn_o )
1546.97 s
[shake] [ 4 of 73] Compiling Development.Shake.Classes ( src/Development/Shake/Classes.hs, dist/build/Development/Shake/Classes.o, dist/build/Development/Shake/Classes.dyn_o )
1546.97 s
[shake] [ 5 of 73] Compiling Development.Shake.FilePath ( src/Development/Shake/FilePath.hs, dist/build/Development/Shake/FilePath.o, dist/build/Development/Shake/FilePath.dyn_o )
1546.97 s
[shake] [ 6 of 73] Compiling Development.Shake.Internal.CmdOption ( src/Development/Shake/Internal/CmdOption.hs, dist/build/Development/Shake/Internal/CmdOption.o, dist/build/Development/Shake/Internal/CmdOption.dyn_o )
1546.97 s
[shake] [ 7 of 73] Compiling Development.Shake.Internal.History.Bloom ( src/Development/Shake/Internal/History/Bloom.hs, dist/build/Development/Shake/Internal/History/Bloom.o, dist/build/Development/Shake/Internal/History/Bloom.dyn_o )
1546.97 s
[shake] [ 8 of 73] Compiling Development.Shake.Internal.History.Network ( src/Development/Shake/Internal/History/Network.hs, dist/build/Development/Shake/Internal/History/Network.o, dist/build/Development/Shake/Internal/History/Network.dyn_o )
1546.97 s
[unordered-containers] foldlWithKey: OK (0.06s)
1546.97 s
[unordered-containers] +++ OK, passed 100 tests.
1546.97 s
[unordered-containers] foldrWithKey': OK (0.12s)
1546.97 s
[unordered-containers] +++ OK, passed 100 tests.
1546.97 s
[unordered-containers] foldlWithKey': OK (0.04s)
1546.97 s
[unordered-containers] +++ OK, passed 100 tests.
1546.97 s
[unordered-containers] foldl': OK (0.04s)
1546.97 s
[unordered-containers] +++ OK, passed 100 tests.
1546.97 s
[unordered-containers] foldr': OK (0.17s)
1546.97 s
[unordered-containers] +++ OK, passed 100 tests.
1546.97 s
[unordered-containers] foldMapWithKey: OK (0.07s)
1546.97 s
[unordered-containers] +++ OK, passed 100 tests.
1546.97 s
[unordered-containers] filter
1546.97 s
[unordered-containers] model: OK (0.42s)
1546.97 s
[unordered-containers] +++ OK, passed 100 tests.
1546.97 s
[unordered-containers] valid: OK (0.38s)
1546.97 s
[unordered-containers] +++ OK, passed 100 tests.
1546.97 s
[unordered-containers] filterWithKey
1546.97 s
[unordered-containers] model: OK (6.75s)
1546.97 s
[unordered-containers] +++ OK, passed 100 tests.
1546.97 s
[unordered-containers] valid: OK (5.09s)
1546.97 s
[unordered-containers] +++ OK, passed 100 tests.
1546.97 s
[unordered-containers] mapMaybe
1546.97 s
[unordered-containers] model: OK (0.49s)
1546.97 s
[unordered-containers] +++ OK, passed 100 tests.
1546.97 s
[unordered-containers] valid: OK (0.30s)
1546.97 s
[unordered-containers] +++ OK, passed 100 tests.
1546.97 s
[unordered-containers] mapMaybeWithKey
1546.98 s
[unordered-containers] model: OK (8.08s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] valid: OK (4.71s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] elems: OK (0.13s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] keys: OK (0.08s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] fromList
1546.98 s
[unordered-containers] model: OK (0.09s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] valid: OK (0.05s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] fromListWith
1546.98 s
[unordered-containers] model: OK (0.25s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] valid: OK (0.06s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] fromListWithKey
1546.98 s
[unordered-containers] model: OK (0.12s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] valid: OK (0.03s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] toList: OK (0.10s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] Data.HashMap.Strict
1546.98 s
[unordered-containers] instances
1546.98 s
[unordered-containers] Eq
1546.98 s
[unordered-containers] ==: OK (0.16s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] /=: OK (0.09s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] Ord
1546.98 s
[unordered-containers] compare reflexive: OK (0.13s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] compare transitive: OK (0.10s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] compare antisymmetric: OK (0.29s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] Ord => Eq: OK (0.33s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] Read/Show: OK (2.26s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] Functor: OK (0.83s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] Foldable: OK (0.16s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] Bifoldable
1546.98 s
[unordered-containers] bifoldMap: OK (0.11s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] bifoldr: OK (0.25s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] bifoldl: OK (0.19s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] Hashable: OK (0.15s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] empty
1546.98 s
[unordered-containers] valid: OK
1546.98 s
[unordered-containers] +++ OK, passed 1 test.
1546.98 s
[unordered-containers] singleton
1546.98 s
[unordered-containers] valid: OK
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] size: OK (0.06s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] member: OK (0.07s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] lookup: OK (0.07s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] !?: OK (0.07s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[unordered-containers] insert
1546.98 s
[unordered-containers] model: OK (0.05s)
1546.98 s
[unordered-containers] +++ OK, passed 100 tests.
1546.98 s
[aeson] [26 of 42] Compiling DoubleToScientific ( tests/DoubleToScientific.hs, dist/build/aeson-tests/aeson-tests-tmp/DoubleToScientific.o, dist/build/aeson-tests/aeson-tests-tmp/DoubleToScientific.dyn_o )
1546.98 s
[aeson] [27 of 42] Compiling RFC8785 ( tests/RFC8785.hs, dist/build/aeson-tests/aeson-tests-tmp/RFC8785.o )
1546.98 s
[aeson] [28 of 42] Compiling UnitTests.FromJSONKey ( tests/UnitTests/FromJSONKey.hs, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/FromJSONKey.o, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/FromJSONKey.dyn_o )
1546.98 s
[aeson]
1546.98 s
[aeson] tests/UnitTests/FromJSONKey.hs:35:22: warning : [ GHC-58008 ] [ -Wgadt-mono-local-binds ]
1546.98 s
[aeson] Pattern matching on GADTs without MonoLocalBinds is fragile.
1546.98 s
[aeson] Suggested fix:
1546.98 s
[aeson] Enable any of the following extensions: GADTs, TypeFamilies
1546.98 s
[aeson] |
1546.98 s
[aeson] 35 | assertIsCoerce _ FromJSONKeyCoerce = pure ()
1546.98 s
[aeson] | ^^^^^^^^^^^^^^^^^
1546.98 s
[aeson]
1546.98 s
[aeson] tests/UnitTests/FromJSONKey.hs:39:23: warning : [ GHC-58008 ] [ -Wgadt-mono-local-binds ]
1546.98 s
[aeson] Pattern matching on GADTs without MonoLocalBinds is fragile.
1546.98 s
[aeson] Suggested fix:
1546.98 s
[aeson] Enable any of the following extensions: GADTs, TypeFamilies
1546.98 s
[aeson] |
1546.98 s
[aeson] 39 | assertIsCoerce' _ FromJSONKeyCoerce = pure ()
1546.98 s
[aeson] | ^^^^^^^^^^^^^^^^^
1546.98 s
[aeson] [29 of 42] Compiling UnitTests.Hashable ( tests/UnitTests/Hashable.hs, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/Hashable.o, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/Hashable.dyn_o )
1546.98 s
[aeson] [30 of 42] Compiling UnitTests.KeyMapInsertWith ( tests/UnitTests/KeyMapInsertWith.hs, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/KeyMapInsertWith.o, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/KeyMapInsertWith.dyn_o )
1546.98 s
[aeson] [31 of 42] Compiling UnitTests.MonadFix ( tests/UnitTests/MonadFix.hs, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/MonadFix.o, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/MonadFix.dyn_o )
1546.98 s
[aeson] [32 of 42] Compiling UnitTests.NoThunks ( tests/UnitTests/NoThunks.hs, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/NoThunks.o, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/NoThunks.dyn_o )
1546.98 s
[aeson] [33 of 42] Compiling UnitTests.NullaryConstructors ( tests/UnitTests/NullaryConstructors.hs, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/NullaryConstructors.o, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/NullaryConstructors.dyn_o )
1546.98 s
[aeson] [34 of 42] Compiling UnitTests.OmitNothingFieldsNote ( tests/UnitTests/OmitNothingFieldsNote.hs, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/OmitNothingFieldsNote.o, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/OmitNothingFieldsNote.dyn_o )
1546.98 s
[aeson] [35 of 42] Compiling UnitTests.OptionalFields.Common ( tests/UnitTests/OptionalFields/Common.hs, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/OptionalFields/Common.o, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/OptionalFields/Common.dyn_o )
1546.98 s
[aeson] [36 of 42] Compiling UnitTests.OptionalFields.Generics ( tests/UnitTests/OptionalFields/Generics.hs, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/OptionalFields/Generics.o, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/OptionalFields/Generics.dyn_o )
1546.98 s
[aeson] [37 of 42] Compiling UnitTests.OptionalFields.Manual ( tests/UnitTests/OptionalFields/Manual.hs, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/OptionalFields/Manual.o, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/OptionalFields/Manual.dyn_o )
1546.98 s
[aeson] [38 of 42] Compiling UnitTests.OptionalFields.TH ( tests/UnitTests/OptionalFields/TH.hs, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/OptionalFields/TH.o, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/OptionalFields/TH.dyn_o )
1546.98 s
[aeson] [39 of 42] Compiling UnitTests.OptionalFields ( tests/UnitTests/OptionalFields.hs, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/OptionalFields.o, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/OptionalFields.dyn_o )
1546.98 s
[algebraic-graphs] OK: overlays [] == empty
1546.98 s
[algebraic-graphs] OK: overlays [x] == x
1546.98 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1546.98 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1546.98 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1546.98 s
[algebraic-graphs]
1546.98 s
[algebraic-graphs] ============ AdjacencyIntMap.connects ============
1546.98 s
[algebraic-graphs] OK: connects [] == empty
1546.98 s
[algebraic-graphs] OK: connects [x] == x
1546.98 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1546.98 s
[algebraic-graphs] OK: connects == foldr connect empty
1546.98 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1546.98 s
[algebraic-graphs]
1546.98 s
[algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
1546.98 s
[algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
1546.98 s
[algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
1546.98 s
[algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
1546.98 s
[algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
1546.98 s
[algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
1546.98 s
[algebraic-graphs]
1546.98 s
[algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
1546.98 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1546.98 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1546.98 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1546.98 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1546.98 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1546.98 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1546.98 s
[algebraic-graphs]
1546.98 s
[algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
1546.98 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1546.98 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1546.98 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1546.98 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1546.98 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1546.98 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1546.98 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1546.98 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1546.98 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1546.98 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1546.98 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1546.98 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1546.98 s
[algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
1546.98 s
[algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
1546.98 s
[algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
1546.98 s
[algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
1546.98 s
[algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
1546.98 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1546.98 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1546.98 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1546.98 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1546.98 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1546.98 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1546.98 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1546.98 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1546.98 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1546.98 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1546.98 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1546.98 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1546.98 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1546.98 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1546.98 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1546.98 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1546.98 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1546.98 s
[filemanip] 279 | traverse state dir depth dirSt = handle (errHandler dir state) $
1546.98 s
[filemanip] | ^^^^^^^^
1546.98 s
[filemanip]
1546.98 s
[filemanip] System/FilePath/Find.hs:279:18: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1546.98 s
[filemanip] This binding for ‘state’ shadows the existing binding
1546.98 s
[filemanip] bound at System/FilePath/Find.hs:271:38
1546.98 s
[filemanip] |
1546.98 s
[filemanip] 279 | traverse state dir depth dirSt = handle (errHandler dir state) $
1546.98 s
[filemanip] | ^^^^^
1546.98 s
[filemanip]
1546.99 s
[filemanip] System/FilePath/Find.hs:279:28: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1546.99 s
[filemanip] This binding for ‘depth’ shadows the existing binding
1546.99 s
[filemanip] defined at System/FilePath/Find.hs:195:1
1546.99 s
[filemanip] |
1546.99 s
[filemanip] 279 | traverse state dir depth dirSt = handle (errHandler dir state) $
1546.99 s
[filemanip] | ^^^^^
1546.99 s
[filemanip]
1546.99 s
[filemanip] System/FilePath/Find.hs:282:53: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1546.99 s
[filemanip] This binding for ‘state’ shadows the existing binding
1546.99 s
[filemanip] bound at System/FilePath/Find.hs:279:18
1546.99 s
[filemanip] |
1546.99 s
[filemanip] 282 | in state' `seq` flip foldM state' (\state name ->
1546.99 s
[filemanip] | ^^^^^
1546.99 s
[filemanip]
1546.99 s
[filemanip] System/FilePath/Find.hs:284:25: warning : [ GHC-63397 ] [ -Wname-shadowing ]
1546.99 s
[filemanip] This binding for ‘path’ shadows the existing binding
1546.99 s
[filemanip] bound at System/FilePath/Find.hs:271:44
1546.99 s
[filemanip] |
1546.99 s
[filemanip] 284 | let path = dir </> name
1546.99 s
[filemanip] | ^^^^
1546.99 s
[filemanip] [4 of 4] Compiling System.FilePath.Manip ( System/FilePath/Manip.hs, nothing )
1546.99 s
[filemanip] Haddock coverage:
1546.99 s
[filemanip] 100% ( 7 / 7) in 'System.FilePath.GlobPattern'
1546.99 s
[filemanip] 100% ( 2 / 2) in 'System.FilePath.Glob'
1546.99 s
[filemanip] Warning: 'put' is out of scope.
1546.99 s
[filemanip] If you qualify the identifier, haddock can try to link it anyway.
1546.99 s
[filemanip] Warning: 'FileInfo' is ambiguous. It is defined
1546.99 s
[filemanip] * at System/FilePath/Find.hs:136:17
1546.99 s
[filemanip] * at System/FilePath/Find.hs:136:1
1546.99 s
[filemanip] You may be able to disambiguate the identifier by qualifying it or
1546.99 s
[filemanip] by specifying the type/value namespace explicitly.
1546.99 s
[filemanip] Defaulting to the one defined at System/FilePath/Find.hs:136:1
1546.99 s
[filemanip] Warning: 'isSuffixOf' is out of scope.
1546.99 s
[filemanip] If you qualify the identifier, haddock can try to link it anyway.
1546.99 s
[filemanip] Warning: 'deviceID' is ambiguous. It is defined
1546.99 s
[filemanip] * at System/FilePath/Find.hs:440:1
1546.99 s
[filemanip] * in ‘System.Posix.Files.Common’
1546.99 s
[filemanip] You may be able to disambiguate the identifier by qualifying it or
1546.99 s
[filemanip] by specifying the type/value namespace explicitly.
1546.99 s
[filemanip] Defaulting to the one defined at System/FilePath/Find.hs:440:1
1546.99 s
[filemanip] 65% ( 41 / 63) in 'System.FilePath.Find'
1546.99 s
[filemanip] Missing documentation for:
1546.99 s
[filemanip] FileType (System/FilePath/Find.hs:394)
1546.99 s
[filemanip] FilterPredicate (System/FilePath/Find.hs:202)
1546.99 s
[filemanip] RecursionPredicate (System/FilePath/Find.hs:203)
1546.99 s
[filemanip] deviceID (System/FilePath/Find.hs:440)
1546.99 s
[filemanip] fileID (System/FilePath/Find.hs:443)
1546.99 s
[filemanip] fileOwner (System/FilePath/Find.hs:446)
1546.99 s
[filemanip] fileGroup (System/FilePath/Find.hs:449)
1546.99 s
[filemanip] fileSize (System/FilePath/Find.hs:452)
1546.99 s
[filemanip] linkCount (System/FilePath/Find.hs:455)
1546.99 s
[filemanip] specialDeviceID (System/FilePath/Find.hs:458)
1546.99 s
[filemanip] fileMode (System/FilePath/Find.hs:461)
1546.99 s
[filemanip] accessTime (System/FilePath/Find.hs:479)
1546.99 s
[filemanip] modificationTime (System/FilePath/Find.hs:482)
1546.99 s
[filemanip] statusChangeTime (System/FilePath/Find.hs:485)
1546.99 s
[filemanip] ==? (System/FilePath/Find.hs:528)
1546.99 s
[filemanip] /=? (System/FilePath/Find.hs:532)
1546.99 s
[filemanip] >? (System/FilePath/Find.hs:536)
1546.99 s
[filemanip] <? (System/FilePath/Find.hs:540)
1546.99 s
[filemanip] >=? (System/FilePath/Find.hs:544)
1546.99 s
[filemanip] <=? (System/FilePath/Find.hs:548)
1546.99 s
[filemanip] &&? (System/FilePath/Find.hs:558)
1546.99 s
[kan-extensions] [ 5 of 13] Compiling Data.Functor.Day.Curried ( src/Data/Functor/Day/Curried.hs, dist/build/Data/Functor/Day/Curried.p_o )
1546.99 s
[kan-extensions] [ 6 of 13] Compiling Data.Functor.Invariant.Day ( src/Data/Functor/Invariant/Day.hs, dist/build/Data/Functor/Invariant/Day.p_o )
1546.99 s
[kan-extensions] [ 7 of 13] Compiling Data.Functor.Kan.Lan ( src/Data/Functor/Kan/Lan.hs, dist/build/Data/Functor/Kan/Lan.p_o )
1546.99 s
[kan-extensions] [ 8 of 13] Compiling Data.Functor.Coyoneda ( src/Data/Functor/Coyoneda.hs, dist/build/Data/Functor/Coyoneda.p_o )
1546.99 s
[kan-extensions] [ 9 of 13] Compiling Control.Comonad.Density ( src/Control/Comonad/Density.hs, dist/build/Control/Comonad/Density.p_o )
1546.99 s
[kan-extensions] [10 of 13] Compiling Control.Monad.Co ( src/Control/Monad/Co.hs, dist/build/Control/Monad/Co.p_o )
1546.99 s
[kan-extensions] [11 of 13] Compiling Data.Functor.Kan.Ran ( src/Data/Functor/Kan/Ran.hs, dist/build/Data/Functor/Kan/Ran.p_o )
1546.99 s
[kan-extensions] [12 of 13] Compiling Control.Monad.Codensity ( src/Control/Monad/Codensity.hs, dist/build/Control/Monad/Codensity.p_o )
1546.99 s
[kan-extensions] [13 of 13] Compiling Data.Functor.Yoneda ( src/Data/Functor/Yoneda.hs, dist/build/Data/Functor/Yoneda.p_o )
1546.99 s
[kan-extensions] Phase: checkPhase
1546.99 s
[kan-extensions] Package has no test suites.
1546.99 s
[kan-extensions] Phase: haddockPhase
1546.99 s
[kan-extensions] Preprocessing library for kan-extensions-5.2.6..
1546.99 s
[kan-extensions] Running Haddock on library for kan-extensions-5.2.6..
1546.99 s
[kan-extensions] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1546.99 s
[kan-extensions] [ 1 of 13] Compiling Data.Functor.Contravariant.Coyoneda ( src/Data/Functor/Contravariant/Coyoneda.hs, nothing )
1546.99 s
[kan-extensions] [ 2 of 13] Compiling Data.Functor.Contravariant.Day ( src/Data/Functor/Contravariant/Day.hs, nothing )
1546.99 s
[kan-extensions] [ 3 of 13] Compiling Data.Functor.Contravariant.Yoneda ( src/Data/Functor/Contravariant/Yoneda.hs, nothing )
1546.99 s
[kan-extensions] [ 4 of 13] Compiling Data.Functor.Day ( src/Data/Functor/Day.hs, nothing )
1546.99 s
[kan-extensions] [ 5 of 13] Compiling Data.Functor.Day.Curried ( src/Data/Functor/Day/Curried.hs, nothing )
1546.99 s
[kan-extensions] [ 6 of 13] Compiling Data.Functor.Invariant.Day ( src/Data/Functor/Invariant/Day.hs, nothing )
1546.99 s
[kan-extensions] [ 7 of 13] Compiling Data.Functor.Kan.Lan ( src/Data/Functor/Kan/Lan.hs, nothing )
1546.99 s
[kan-extensions] [ 8 of 13] Compiling Data.Functor.Coyoneda ( src/Data/Functor/Coyoneda.hs, nothing )
1546.99 s
[kan-extensions] [ 9 of 13] Compiling Control.Comonad.Density ( src/Control/Comonad/Density.hs, nothing )
1546.99 s
[kan-extensions] [10 of 13] Compiling Control.Monad.Co ( src/Control/Monad/Co.hs, nothing )
1546.99 s
[kan-extensions] [11 of 13] Compiling Data.Functor.Kan.Ran ( src/Data/Functor/Kan/Ran.hs, nothing )
1546.99 s
[kan-extensions] [12 of 13] Compiling Control.Monad.Codensity ( src/Control/Monad/Codensity.hs, nothing )
1546.99 s
[kan-extensions] [13 of 13] Compiling Data.Functor.Yoneda ( src/Data/Functor/Yoneda.hs, nothing )
1546.99 s
[kan-extensions] Haddock coverage:
1546.99 s
[kan-extensions] Warning: 'Coyoneda' is ambiguous. It is defined
1546.99 s
[kan-extensions] * at src/Data/Functor/Contravariant/Coyoneda.hs:37:3
1546.99 s
[kan-extensions] * at src/Data/Functor/Contravariant/Coyoneda.hs:36:1
1546.99 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1546.99 s
[kan-extensions] by specifying the type/value namespace explicitly.
1546.99 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Contravariant/Coyoneda.hs:36:1
1546.99 s
[kan-extensions] 100% ( 5 / 5) in 'Data.Functor.Contravariant.Coyoneda'
1546.99 s
[kan-extensions] 100% ( 14 / 14) in 'Data.Functor.Contravariant.Day'
1546.99 s
[kan-extensions] 75% ( 3 / 4) in 'Data.Functor.Contravariant.Yoneda'
1546.99 s
[kan-extensions] Missing documentation for:
1546.99 s
[kan-extensions] lowerYoneda (src/Data/Functor/Contravariant/Yoneda.hs:41)
1546.99 s
[kan-extensions] Warning: 'Day' is ambiguous. It is defined
1546.99 s
[kan-extensions] * at src/Data/Functor/Day.hs:56:18
1546.99 s
[kan-extensions] * at src/Data/Functor/Day.hs:56:1
1546.99 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1546.99 s
[kan-extensions] by specifying the type/value namespace explicitly.
1546.99 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Day.hs:56:1
1546.99 s
[kan-extensions] Warning: 'Identity' is ambiguous. It is defined
1546.99 s
[kan-extensions] * in ‘Data.Functor.Identity’
1546.99 s
[kan-extensions] * in ‘Data.Functor.Identity’
1546.99 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1546.99 s
[kan-extensions] by specifying the type/value namespace explicitly.
1546.99 s
[kan-extensions] Defaulting to the one defined in ‘Data.Functor.Identity’
1546.99 s
[kan-extensions] 93% ( 14 / 15) in 'Data.Functor.Day'
1546.99 s
[kan-extensions] Missing documentation for:
1546.99 s
[kan-extensions] cayley (src/Data/Functor/Day.hs:200)
1546.99 s
[kan-extensions] Warning: 'Day' is ambiguous. It is defined
1546.99 s
[kan-extensions] * at src/Data/Functor/Day.hs:56:18
1546.99 s
[kan-extensions] * at src/Data/Functor/Day.hs:56:1
1546.99 s
[regex] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1546.99 s
[regex] |
1546.99 s
[regex] 530 | chk xs = chk $ tail xs
1546.99 s
[regex] | ^^^^
1546.99 s
[regex] [11 of 48] Compiling Text.RE.ZeInternals.TestBench ( Text/RE/ZeInternals/TestBench.lhs, dist/build/Text/RE/ZeInternals/TestBench.o, dist/build/Text/RE/ZeInternals/TestBench.dyn_o )
1546.99 s
[regex] [12 of 48] Compiling Text.RE.ZeInternals.AddCaptureNames ( Text/RE/ZeInternals/AddCaptureNames.hs, dist/build/Text/RE/ZeInternals/AddCaptureNames.o, dist/build/Text/RE/ZeInternals/AddCaptureNames.dyn_o )
1546.99 s
[regex] [13 of 48] Compiling Text.RE.Replace ( Text/RE/Replace.hs, dist/build/Text/RE/Replace.o, dist/build/Text/RE/Replace.dyn_o )
1546.99 s
[regex] [14 of 48] Compiling Text.RE.ZeInternals.TestBench.Parsers ( Text/RE/ZeInternals/TestBench/Parsers.hs, dist/build/Text/RE/ZeInternals/TestBench/Parsers.o, dist/build/Text/RE/ZeInternals/TestBench/Parsers.dyn_o )
1546.99 s
[regex] [15 of 48] Compiling Text.RE.ZeInternals.PreludeMacros ( Text/RE/ZeInternals/PreludeMacros.hs, dist/build/Text/RE/ZeInternals/PreludeMacros.o, dist/build/Text/RE/ZeInternals/PreludeMacros.dyn_o )
1546.99 s
[regex] [16 of 48] Compiling Text.RE.TestBench.Parsers ( Text/RE/TestBench/Parsers.hs, dist/build/Text/RE/TestBench/Parsers.o, dist/build/Text/RE/TestBench/Parsers.dyn_o )
1546.99 s
[regex] [17 of 48] Compiling Text.RE.TestBench ( Text/RE/TestBench.hs, dist/build/Text/RE/TestBench.o, dist/build/Text/RE/TestBench.dyn_o )
1546.99 s
[regex] [18 of 48] Compiling Text.RE.ZeInternals.Types.Poss ( Text/RE/ZeInternals/Types/Poss.hs, dist/build/Text/RE/ZeInternals/Types/Poss.o, dist/build/Text/RE/ZeInternals/Types/Poss.dyn_o )
1546.99 s
[regex] [19 of 48] Compiling Text.RE.ZeInternals.Types.SearchReplace ( Text/RE/ZeInternals/Types/SearchReplace.lhs, dist/build/Text/RE/ZeInternals/Types/SearchReplace.o, dist/build/Text/RE/ZeInternals/Types/SearchReplace.dyn_o )
1546.99 s
[regex] [20 of 48] Compiling Text.RE.ZeInternals.Types.IsRegex ( Text/RE/ZeInternals/Types/IsRegex.lhs, dist/build/Text/RE/ZeInternals/Types/IsRegex.o, dist/build/Text/RE/ZeInternals/Types/IsRegex.dyn_o )
1546.99 s
[regex] [21 of 48] Compiling Text.RE.ZeInternals.Tools.Lex ( Text/RE/ZeInternals/Tools/Lex.lhs, dist/build/Text/RE/ZeInternals/Tools/Lex.o, dist/build/Text/RE/ZeInternals/Tools/Lex.dyn_o )
1546.99 s
[regex] [22 of 48] Compiling Text.RE.ZeInternals.NamedCaptures ( Text/RE/ZeInternals/NamedCaptures.lhs, dist/build/Text/RE/ZeInternals/NamedCaptures.o, dist/build/Text/RE/ZeInternals/NamedCaptures.dyn_o )
1546.99 s
[regex] [23 of 48] Compiling Text.RE.Tools.IsRegex ( Text/RE/Tools/IsRegex.hs, dist/build/Text/RE/Tools/IsRegex.o, dist/build/Text/RE/Tools/IsRegex.dyn_o )
1546.99 s
[regex] [24 of 48] Compiling Text.RE.Tools.Lex ( Text/RE/Tools/Lex.hs, dist/build/Text/RE/Tools/Lex.o, dist/build/Text/RE/Tools/Lex.dyn_o )
1546.99 s
[regex] [25 of 48] Compiling Text.RE.Tools.Grep ( Text/RE/Tools/Grep.lhs, dist/build/Text/RE/Tools/Grep.o, dist/build/Text/RE/Tools/Grep.dyn_o )
1546.99 s
[regex] [26 of 48] Compiling Text.RE.Tools.Find ( Text/RE/Tools/Find.lhs, dist/build/Text/RE/Tools/Find.o, dist/build/Text/RE/Tools/Find.dyn_o )
1546.99 s
[regex] [27 of 48] Compiling Text.RE.Tools.Edit ( Text/RE/Tools/Edit.lhs, dist/build/Text/RE/Tools/Edit.o, dist/build/Text/RE/Tools/Edit.dyn_o )
1546.99 s
[regex] [28 of 48] Compiling Text.RE.Tools.Sed ( Text/RE/Tools/Sed.lhs, dist/build/Text/RE/Tools/Sed.o, dist/build/Text/RE/Tools/Sed.dyn_o )
1546.99 s
[regex] [29 of 48] Compiling Text.RE.Tools ( Text/RE/Tools.hs, dist/build/Text/RE/Tools.o, dist/build/Text/RE/Tools.dyn_o )
1546.99 s
[regex] [30 of 48] Compiling Text.RE.Summa ( Text/RE/Summa.hs, dist/build/Text/RE/Summa.o, dist/build/Text/RE/Summa.dyn_o )
1546.99 s
[regex] [31 of 48] Compiling Text.RE.ZeInternals.SearchReplace ( Text/RE/ZeInternals/SearchReplace.hs, dist/build/Text/RE/ZeInternals/SearchReplace.o, dist/build/Text/RE/ZeInternals/SearchReplace.dyn_o )
1546.99 s
[regex] [32 of 48] Compiling Text.RE.ZeInternals ( Text/RE/ZeInternals.hs, dist/build/Text/RE/ZeInternals.o, dist/build/Text/RE/ZeInternals.dyn_o )
1546.99 s
[regex] [33 of 48] Compiling Text.RE.ZeInternals.TDFA ( Text/RE/ZeInternals/TDFA.hs, dist/build/Text/RE/ZeInternals/TDFA.o, dist/build/Text/RE/ZeInternals/TDFA.dyn_o )
1546.99 s
[shake] [ 9 of 73] Compiling Development.Shake.Internal.History.Types ( src/Development/Shake/Internal/History/Types.hs, dist/build/Development/Shake/Internal/History/Types.o, dist/build/Development/Shake/Internal/History/Types.dyn_o )
1546.99 s
[shake] [10 of 73] Compiling General.Bilist ( src/General/Bilist.hs, dist/build/General/Bilist.o, dist/build/General/Bilist.dyn_o )
1546.99 s
[shake] [11 of 73] Compiling General.Binary ( src/General/Binary.hs, dist/build/General/Binary.o, dist/build/General/Binary.dyn_o )
1546.99 s
[shake] [12 of 73] Compiling Development.Shake.Internal.FileName ( src/Development/Shake/Internal/FileName.hs, dist/build/Development/Shake/Internal/FileName.o, dist/build/Development/Shake/Internal/FileName.dyn_o )
1546.99 s
[shake] [13 of 73] Compiling General.Cleanup ( src/General/Cleanup.hs, dist/build/General/Cleanup.o, dist/build/General/Cleanup.dyn_o )
1546.99 s
[shake] [14 of 73] Compiling General.EscCodes ( src/General/EscCodes.hs, dist/build/General/EscCodes.o, dist/build/General/EscCodes.dyn_o )
1546.99 s
[shake] [15 of 73] Compiling General.Extra ( src/General/Extra.hs, dist/build/General/Extra.o, dist/build/General/Extra.dyn_o )
1546.99 s
[shake] [16 of 73] Compiling Development.Shake.Internal.History.Symlink ( src/Development/Shake/Internal/History/Symlink.hs, dist/build/Development/Shake/Internal/History/Symlink.o, dist/build/Development/Shake/Internal/History/Symlink.dyn_o )
1546.99 s
[shake] [17 of 73] Compiling Development.Shake.Internal.Errors ( src/Development/Shake/Internal/Errors.hs, dist/build/Development/Shake/Internal/Errors.o, dist/build/Development/Shake/Internal/Errors.dyn_o )
1546.99 s
[shake] [18 of 73] Compiling Development.Shake.Internal.Value ( src/Development/Shake/Internal/Value.hs, dist/build/Development/Shake/Internal/Value.o, dist/build/Development/Shake/Internal/Value.dyn_o )
1546.99 s
[shake] [19 of 73] Compiling Development.Shake.Internal.FilePattern ( src/Development/Shake/Internal/FilePattern.hs, dist/build/Development/Shake/Internal/FilePattern.o, dist/build/Development/Shake/Internal/FilePattern.dyn_o )
1546.99 s
[shake] [20 of 73] Compiling Development.Shake.Internal.Options ( src/Development/Shake/Internal/Options.hs, dist/build/Development/Shake/Internal/Options.o, dist/build/Development/Shake/Internal/Options.dyn_o )
1546.99 s
[shake] [21 of 73] Compiling Development.Shake.Internal.FileInfo ( src/Development/Shake/Internal/FileInfo.hs, dist/build/Development/Shake/Internal/FileInfo.o, dist/build/Development/Shake/Internal/FileInfo.dyn_o )
1546.99 s
[shake] [22 of 73] Compiling Development.Shake.Internal.Core.Monad ( src/Development/Shake/Internal/Core/Monad.hs, dist/build/Development/Shake/Internal/Core/Monad.o, dist/build/Development/Shake/Internal/Core/Monad.dyn_o )
1546.99 s
[shake] [23 of 73] Compiling Development.Ninja.Parse ( src/Development/Ninja/Parse.hs, dist/build/Development/Ninja/Parse.o, dist/build/Development/Ninja/Parse.dyn_o )
1546.99 s
[shake] [24 of 73] Compiling General.Fence ( src/General/Fence.hs, dist/build/General/Fence.o, dist/build/General/Fence.dyn_o )
1546.99 s
[shake] [25 of 73] Compiling General.FileLock ( src/General/FileLock.hs, dist/build/General/FileLock.o, dist/build/General/FileLock.dyn_o )
1546.99 s
[shake] [26 of 73] Compiling General.GetOpt ( src/General/GetOpt.hs, dist/build/General/GetOpt.o, dist/build/General/GetOpt.dyn_o )
1546.99 s
[shake] [27 of 73] Compiling General.Intern ( src/General/Intern.hs, dist/build/General/Intern.o, dist/build/General/Intern.dyn_o )
1546.99 s
[shake] [28 of 73] Compiling General.Ids ( src/General/Ids.hs, dist/build/General/Ids.o, dist/build/General/Ids.dyn_o )
1546.99 s
[shake] [29 of 73] Compiling Development.Shake.Internal.History.Serialise ( src/Development/Shake/Internal/History/Serialise.hs, dist/build/Development/Shake/Internal/History/Serialise.o, dist/build/Development/Shake/Internal/History/Serialise.dyn_o )
1546.99 s
[shake] [30 of 73] Compiling Development.Shake.Internal.History.Server ( src/Development/Shake/Internal/History/Server.hs, dist/build/Development/Shake/Internal/History/Server.o, dist/build/Development/Shake/Internal/History/Server.dyn_o )
1546.99 s
[shake] [31 of 73] Compiling Development.Shake.Internal.Core.Database ( src/Development/Shake/Internal/Core/Database.hs, dist/build/Development/Shake/Internal/Core/Database.o, dist/build/Development/Shake/Internal/Core/Database.dyn_o )
1546.99 s
[unordered-containers] valid: OK (0.08s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] insertWith
1546.99 s
[unordered-containers] insertWith: OK (0.11s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] valid: OK (0.15s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] delete
1546.99 s
[unordered-containers] model: OK (0.14s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] valid: OK (0.16s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] adjust
1546.99 s
[unordered-containers] model: OK (0.18s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] valid: OK (0.13s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] update
1546.99 s
[unordered-containers] model: OK (0.10s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] valid: OK (0.10s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] alter
1546.99 s
[unordered-containers] model: OK (0.12s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] valid: OK (0.06s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] alterF
1546.99 s
[unordered-containers] model
1546.99 s
[unordered-containers] []: OK (1.52s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] adjust: OK (0.21s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] insert: OK (0.08s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] insertWith: OK (0.08s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] delete: OK (0.09s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] lookup: OK (0.08s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] valid: OK (0.19s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] isSubmapOf
1546.99 s
[unordered-containers] model: OK (0.19s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] m ⊆ m: OK (0.06s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.21s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] m1 ⊈ m2 ⇒ m1 ∪ m2 ⊈ m1: OK (0.10s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests; 16 discarded.
1546.99 s
[unordered-containers] m1\m2 ⊆ m1: OK (0.28s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.30s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests; 174 discarded.
1546.99 s
[unordered-containers] delete k m ⊆ m: OK (0.08s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests; 23 discarded.
1546.99 s
[unordered-containers] m ⊈ delete k m : OK (0.09s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests; 16 discarded.
1546.99 s
[unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.18s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests; 10 discarded.
1546.99 s
[unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.12s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests; 11 discarded.
1546.99 s
[unordered-containers] union
1546.99 s
[unordered-containers] model: OK (0.18s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] valid: OK (0.10s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] unionWith
1546.99 s
[unordered-containers] model: OK (0.87s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] valid: OK (0.27s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] unionWithKey
1546.99 s
[unordered-containers] model: OK (0.66s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] valid: OK (0.61s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] unions
1546.99 s
[unordered-containers] model: OK (5.38s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] valid: OK (4.07s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] difference
1546.99 s
[unordered-containers] model: OK (0.45s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] valid: OK (0.18s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] differenceWith
1546.99 s
[unordered-containers] model: OK (0.50s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] valid: OK (0.13s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] intersection
1546.99 s
[unordered-containers] model: OK (0.37s)
1546.99 s
[unordered-containers] +++ OK, passed 100 tests.
1546.99 s
[unordered-containers] valid: OK (0.14s)
1546.99 s
[aeson] [40 of 42] Compiling UnitTests.UTCTime ( tests/UnitTests/UTCTime.hs, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/UTCTime.o, dist/build/aeson-tests/aeson-tests-tmp/UnitTests/UTCTime.dyn_o )
1546.99 s
[aeson] [41 of 42] Compiling UnitTests ( tests/UnitTests.hs, dist/build/aeson-tests/aeson-tests-tmp/UnitTests.o )
1546.99 s
[aeson]
1546.99 s
[aeson] tests/UnitTests.hs:89:29: warning : [ GHC-63394 ] [ -Wx-partial ]
1546.99 s
[aeson] In the use of ‘head’
1546.99 s
[aeson] (imported from Prelude.Compat, but defined in GHC.List):
1546.99 s
[aeson] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1546.99 s
[aeson] |
1546.99 s
[aeson] 89 | capitalize t = toUpper (head t) : tail t
1547.00 s
[aeson] | ^^^^
1547.00 s
[aeson]
1547.00 s
[aeson] tests/UnitTests.hs:89:39: warning : [ GHC-63394 ] [ -Wx-partial ]
1547.00 s
[aeson] In the use of ‘tail’
1547.00 s
[aeson] (imported from Prelude.Compat, but defined in GHC.List):
1547.00 s
[aeson] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1547.00 s
[aeson] |
1547.00 s
[aeson] 89 | capitalize t = toUpper (head t) : tail t
1547.00 s
[aeson] | ^^^^
1547.00 s
[aeson] [42 of 42] Compiling Main ( tests/Tests.hs, dist/build/aeson-tests/aeson-tests-tmp/Main.o )
1547.00 s
[aeson] [43 of 43] Linking dist/build/aeson-tests/aeson-tests
1547.00 s
[aeson] buildPhase completed in 3 minutes 23 seconds
1547.00 s
[aeson] Phase: checkPhase
1547.00 s
[aeson] Running 1 test suites...
1547.00 s
[aeson] Test suite aeson-tests: RUNNING...
1547.00 s
[aeson] tests
1547.00 s
[aeson] data families
1547.00 s
[aeson] template-haskell
1547.00 s
[aeson] toJSON
1547.00 s
[aeson] Nullary
1547.00 s
[aeson] string: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] 2ElemArray: OK (0.02s)
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] TaggedObject: OK (0.01s)
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] ObjectWithSingleField: OK (0.03s)
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] roundTrip
1547.00 s
[aeson] string: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] 2ElemArray: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] TaggedObject: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] ObjectWithSingleField: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] SomeType
1547.00 s
[aeson] 2ElemArray: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] TaggedObject: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] ObjectWithSingleField: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] roundTrip
1547.00 s
[aeson] 2ElemArray: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] TaggedObject: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] ObjectWithSingleField: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] Approx
1547.00 s
[aeson] string: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] ObjectWithSingleField: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] roundTrip
1547.00 s
[aeson] string: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] ObjectWithSingleField: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] GADT
1547.00 s
[aeson] string: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] ObjectWithSingleField: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] roundTrip
1547.00 s
[aeson] string: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] ObjectWithSingleField: OK
1547.00 s
[aeson] +++ OK, passed 100 tests.
1547.00 s
[aeson] toEncoding
1547.00 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.foldg ============
1547.00 s
[algebraic-graphs] OK: foldg empty vertex overlay connect == id
1547.00 s
[algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
1547.00 s
[algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
1547.00 s
[algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
1547.00 s
[algebraic-graphs] OK: isEmpty empty == True
1547.00 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1547.00 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1547.00 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1547.00 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
1547.00 s
[algebraic-graphs] OK: hasVertex x empty == False
1547.00 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1547.00 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
1547.00 s
[algebraic-graphs] OK: hasEdge x y empty == False
1547.00 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1547.00 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1547.00 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1547.00 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
1547.00 s
[algebraic-graphs] OK: vertexCount empty == 0
1547.00 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1547.00 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1547.00 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
1547.00 s
[algebraic-graphs] OK: edgeCount empty == 0
1547.00 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1547.00 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1547.00 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
1547.00 s
[algebraic-graphs] OK: vertexList empty == []
1547.00 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1547.00 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
1547.00 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1547.00 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1547.00 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
1547.00 s
[algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
1547.00 s
[algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
1547.00 s
[algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
1547.00 s
[algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
1547.00 s
[algebraic-graphs] OK: edgeList empty == []
1547.00 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1547.00 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1547.00 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1547.00 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
1547.00 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1547.00 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1547.00 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1547.00 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
1547.00 s
[algebraic-graphs] OK: adjacencyList empty == []
1547.00 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1547.00 s
[algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
1547.00 s
[algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.preSet ============
1547.00 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1547.00 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1547.00 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1547.00 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
1547.00 s
[algebraic-graphs] OK: preIntSet x empty == IntSet.empty
1547.00 s
[algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
1547.00 s
[algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
1547.00 s
[algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.postSet ============
1547.00 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1547.00 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1547.00 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1547.00 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
1547.00 s
[algebraic-graphs] OK: postIntSet x empty == IntSet.empty
1547.00 s
[algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
1547.00 s
[algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
1547.00 s
[algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.path ============
1547.00 s
[algebraic-graphs] OK: path [] == empty
1547.00 s
[algebraic-graphs] OK: path [x] == vertex x
1547.00 s
[algebraic-graphs] OK: path [x,y] == edge x y
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.circuit ============
1547.00 s
[algebraic-graphs] OK: circuit [] == empty
1547.00 s
[algebraic-graphs] OK: circuit [x] == edge x x
1547.00 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1547.00 s
[algebraic-graphs]
1547.00 s
[algebraic-graphs] ============ AdjacencyIntMap.clique ============
1547.00 s
[algebraic-graphs] OK: clique [] == empty
1547.01 s
[filemanip] ||? (System/FilePath/Find.hs:562)
1547.01 s
[filemanip] 100% ( 6 / 6) in 'System.FilePath.Manip'
1547.01 s
[filemanip] Documentation created: dist/doc/html/filemanip/,
1547.01 s
[filemanip] dist/doc/html/filemanip/filemanip.txt
1547.01 s
[filemanip] Phase: installPhase
1547.01 s
[filemanip] Installing library in /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/filemanip-0.3.6.3-LjsWJolbYIH3RY2BS86jtt
1547.01 s
[filemanip] Phase: fixupPhase
1547.01 s
[filemanip] shrinking RPATHs of ELF executables and libraries in /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3
1547.01 s
[filemanip] shrinking /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSfilemanip-0.3.6.3-LjsWJolbYIH3RY2BS86jtt-ghc9.8.1.so
1547.01 s
[filemanip] checking for references to /build/ in /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3...
1547.01 s
[filemanip] patching script interpreter paths in /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3
1547.01 s
[filemanip] stripping (with command strip and flags -S -p) in /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3/lib
1547.01 s
[filemanip] shrinking RPATHs of ELF executables and libraries in /nix/store/m8q2nr3z7kchw6ajj5lgwmchrm0bv9pc-filemanip-0.3.6.3-doc
1547.01 s
[filemanip] checking for references to /build/ in /nix/store/m8q2nr3z7kchw6ajj5lgwmchrm0bv9pc-filemanip-0.3.6.3-doc...
1547.01 s
[filemanip] patching script interpreter paths in /nix/store/m8q2nr3z7kchw6ajj5lgwmchrm0bv9pc-filemanip-0.3.6.3-doc
1547.01 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1547.01 s
[kan-extensions] by specifying the type/value namespace explicitly.
1547.01 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Day.hs:56:1
1547.01 s
[kan-extensions] Warning: 'Curried' is ambiguous. It is defined
1547.01 s
[kan-extensions] * at src/Data/Functor/Day/Curried.hs:37:3
1547.01 s
[kan-extensions] * at src/Data/Functor/Day/Curried.hs:36:1
1547.01 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1547.01 s
[kan-extensions] by specifying the type/value namespace explicitly.
1547.01 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Day/Curried.hs:36:1
1547.01 s
[kan-extensions] Warning: 'Compose' is out of scope.
1547.01 s
[kan-extensions] If you qualify the identifier, haddock can try to link it anyway.
1547.01 s
[kan-extensions] Warning: 'Rift' is out of scope.
1547.01 s
[kan-extensions] If you qualify the identifier, haddock can try to link it anyway.
1547.01 s
[kan-extensions] 92% ( 13 / 14) in 'Data.Functor.Day.Curried'
1547.01 s
[kan-extensions] Missing documentation for:
1547.01 s
[kan-extensions] Curried (src/Data/Functor/Day/Curried.hs:36)
1547.01 s
[kan-extensions] Warning: 'assoc' is ambiguous. It is defined
1547.01 s
[kan-extensions] * at src/Data/Functor/Contravariant/Day.hs:100:1
1547.01 s
[kan-extensions] * at src/Data/Functor/Day.hs:112:1
1547.01 s
[kan-extensions] * at src/Data/Functor/Invariant/Day.hs:53:1
1547.01 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1547.01 s
[kan-extensions] by specifying the type/value namespace explicitly.
1547.01 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Invariant/Day.hs:53:1
1547.01 s
[kan-extensions] Warning: 'disassoc' is ambiguous. It is defined
1547.01 s
[kan-extensions] * at src/Data/Functor/Contravariant/Day.hs:113:1
1547.01 s
[kan-extensions] * at src/Data/Functor/Day.hs:124:1
1547.01 s
[kan-extensions] * at src/Data/Functor/Invariant/Day.hs:71:1
1547.01 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1547.01 s
[kan-extensions] by specifying the type/value namespace explicitly.
1547.01 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Invariant/Day.hs:71:1
1547.01 s
[kan-extensions] Warning: 'Day' is ambiguous. It is defined
1547.01 s
[kan-extensions] * at src/Data/Functor/Contravariant/Day.hs:45:18
1547.01 s
[kan-extensions] * at src/Data/Functor/Contravariant/Day.hs:45:1
1547.01 s
[kan-extensions] * at src/Data/Functor/Day.hs:56:18
1547.01 s
[kan-extensions] * at src/Data/Functor/Day.hs:56:1
1547.01 s
[kan-extensions] * at src/Data/Functor/Invariant/Day.hs:35:18
1547.01 s
[kan-extensions] * at src/Data/Functor/Invariant/Day.hs:35:1
1547.01 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1547.01 s
[kan-extensions] by specifying the type/value namespace explicitly.
1547.01 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Invariant/Day.hs:35:1
1547.01 s
[kan-extensions] Warning: 'swapped' is ambiguous. It is defined
1547.01 s
[kan-extensions] * at src/Data/Functor/Contravariant/Day.hs:124:1
1547.01 s
[kan-extensions] * at src/Data/Functor/Day.hs:133:1
1547.01 s
[kan-extensions] * at src/Data/Functor/Invariant/Day.hs:86:1
1547.01 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1547.01 s
[kan-extensions] by specifying the type/value namespace explicitly.
1547.01 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Invariant/Day.hs:86:1
1547.01 s
[kan-extensions] Warning: 'Identity' is ambiguous. It is defined
1547.01 s
[kan-extensions] * in ‘Data.Functor.Identity’
1547.01 s
[kan-extensions] * in ‘Data.Functor.Identity’
1547.01 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1547.01 s
[kan-extensions] by specifying the type/value namespace explicitly.
1547.01 s
[kan-extensions] Defaulting to the one defined in ‘Data.Functor.Identity’
1547.01 s
[kan-extensions] Warning: 'intro1' is ambiguous. It is defined
1547.01 s
[kan-extensions] * at src/Data/Functor/Contravariant/Day.hs:133:1
1547.01 s
[kan-extensions] * at src/Data/Functor/Day.hs:142:1
1547.01 s
[kan-extensions] * at src/Data/Functor/Invariant/Day.hs:95:1
1547.01 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1547.01 s
[kan-extensions] by specifying the type/value namespace explicitly.
1547.01 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Invariant/Day.hs:95:1
1547.01 s
[kan-extensions] Warning: 'elim1' is ambiguous. It is defined
1547.01 s
[kan-extensions] * at src/Data/Functor/Day.hs:160:1
1547.01 s
[kan-extensions] * at src/Data/Functor/Invariant/Day.hs:113:1
1547.01 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1547.01 s
[kan-extensions] by specifying the type/value namespace explicitly.
1547.01 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Invariant/Day.hs:113:1
1547.01 s
[kan-extensions] Warning: 'intro2' is ambiguous. It is defined
1547.01 s
[kan-extensions] * at src/Data/Functor/Contravariant/Day.hs:142:1
1547.01 s
[kan-extensions] * at src/Data/Functor/Day.hs:151:1
1547.01 s
[kan-extensions] * at src/Data/Functor/Invariant/Day.hs:104:1
1547.01 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1547.01 s
[kan-extensions] by specifying the type/value namespace explicitly.
1547.01 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Invariant/Day.hs:104:1
1547.01 s
[kan-extensions] Warning: 'elim2' is ambiguous. It is defined
1547.01 s
[kan-extensions] * at src/Data/Functor/Day.hs:169:1
1547.01 s
[kan-extensions] * at src/Data/Functor/Invariant/Day.hs:122:1
1547.01 s
[regex] [34 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFAEdPrime ( Text/RE/ZeInternals/SearchReplace/TDFAEdPrime.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFAEdPrime.o, dist/build/Text/RE/ZeInternals/SearchReplace/TDFAEdPrime.dyn_o )
1547.01 s
[regex] [35 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.Text.Lazy ( Text/RE/ZeInternals/SearchReplace/TDFA/Text/Lazy.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/Text/Lazy.o, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/Text/Lazy.dyn_o )
1547.01 s
[regex] [36 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.Text ( Text/RE/ZeInternals/SearchReplace/TDFA/Text.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/Text.o, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/Text.dyn_o )
1547.01 s
[regex] [37 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.String ( Text/RE/ZeInternals/SearchReplace/TDFA/String.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/String.o, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/String.dyn_o )
1547.01 s
[regex] [38 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.Sequence ( Text/RE/ZeInternals/SearchReplace/TDFA/Sequence.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/Sequence.o, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/Sequence.dyn_o )
1547.01 s
[regex] [39 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.ByteString.Lazy ( Text/RE/ZeInternals/SearchReplace/TDFA/ByteString/Lazy.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/ByteString/Lazy.o, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/ByteString/Lazy.dyn_o )
1547.01 s
[regex] [40 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.ByteString ( Text/RE/ZeInternals/SearchReplace/TDFA/ByteString.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/ByteString.o, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/ByteString.dyn_o )
1547.01 s
[regex] [41 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA ( Text/RE/ZeInternals/SearchReplace/TDFA.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA.o, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA.dyn_o )
1547.01 s
[regex] [42 of 48] Compiling Text.RE.TDFA.Text.Lazy ( Text/RE/TDFA/Text/Lazy.hs, dist/build/Text/RE/TDFA/Text/Lazy.o, dist/build/Text/RE/TDFA/Text/Lazy.dyn_o )
1547.01 s
[regex] [43 of 48] Compiling Text.RE.TDFA.Text ( Text/RE/TDFA/Text.hs, dist/build/Text/RE/TDFA/Text.o, dist/build/Text/RE/TDFA/Text.dyn_o )
1547.01 s
[regex] [44 of 48] Compiling Text.RE.TDFA.String ( Text/RE/TDFA/String.hs, dist/build/Text/RE/TDFA/String.o, dist/build/Text/RE/TDFA/String.dyn_o )
1547.01 s
[regex] [45 of 48] Compiling Text.RE.TDFA.Sequence ( Text/RE/TDFA/Sequence.hs, dist/build/Text/RE/TDFA/Sequence.o, dist/build/Text/RE/TDFA/Sequence.dyn_o )
1547.01 s
[regex] [46 of 48] Compiling Text.RE.TDFA.ByteString.Lazy ( Text/RE/TDFA/ByteString/Lazy.hs, dist/build/Text/RE/TDFA/ByteString/Lazy.o, dist/build/Text/RE/TDFA/ByteString/Lazy.dyn_o )
1547.01 s
[regex] [47 of 48] Compiling Text.RE.TDFA.ByteString ( Text/RE/TDFA/ByteString.hs, dist/build/Text/RE/TDFA/ByteString.o, dist/build/Text/RE/TDFA/ByteString.dyn_o )
1547.01 s
[regex] [48 of 48] Compiling Text.RE.TDFA ( Text/RE/TDFA.hs, dist/build/Text/RE/TDFA.o, dist/build/Text/RE/TDFA.dyn_o )
1547.01 s
[regex] [ 1 of 48] Compiling Text.RE ( Text/RE.hs, dist/build/Text/RE.p_o )
1547.01 s
[regex] [ 2 of 48] Compiling Text.RE.REOptions ( Text/RE/REOptions.lhs, dist/build/Text/RE/REOptions.p_o )
1547.01 s
[regex] [ 3 of 48] Compiling Text.RE.ZeInternals.EscapeREString ( Text/RE/ZeInternals/EscapeREString.hs, dist/build/Text/RE/ZeInternals/EscapeREString.p_o )
1547.01 s
[regex] [ 4 of 48] Compiling Text.RE.ZeInternals.QQ ( Text/RE/ZeInternals/QQ.hs, dist/build/Text/RE/ZeInternals/QQ.p_o )
1547.01 s
[regex] [ 5 of 48] Compiling Text.RE.ZeInternals.Types.Capture ( Text/RE/ZeInternals/Types/Capture.lhs, dist/build/Text/RE/ZeInternals/Types/Capture.p_o )
1547.01 s
[regex] [ 6 of 48] Compiling Text.RE.ZeInternals.Types.CaptureID ( Text/RE/ZeInternals/Types/CaptureID.hs, dist/build/Text/RE/ZeInternals/Types/CaptureID.p_o )
1547.01 s
[regex] [ 7 of 48] Compiling Text.RE.ZeInternals.Types.LineNo ( Text/RE/ZeInternals/Types/LineNo.hs, dist/build/Text/RE/ZeInternals/Types/LineNo.p_o )
1547.01 s
[regex] [ 8 of 48] Compiling Text.RE.ZeInternals.Types.Match ( Text/RE/ZeInternals/Types/Match.lhs, dist/build/Text/RE/ZeInternals/Types/Match.p_o )
1547.01 s
[shake] [32 of 73] Compiling General.ListBuilder ( src/General/ListBuilder.hs, dist/build/General/ListBuilder.o, dist/build/General/ListBuilder.dyn_o )
1547.01 s
[shake] [33 of 73] Compiling General.Makefile ( src/General/Makefile.hs, dist/build/General/Makefile.o, dist/build/General/Makefile.dyn_o )
1547.01 s
[shake] [34 of 73] Compiling General.Process ( src/General/Process.hs, dist/build/General/Process.o, dist/build/General/Process.dyn_o )
1547.01 s
[shake] [35 of 73] Compiling General.Thread ( src/General/Thread.hs, dist/build/General/Thread.o, dist/build/General/Thread.dyn_o )
1547.01 s
[shake] [36 of 73] Compiling General.Chunks ( src/General/Chunks.hs, dist/build/General/Chunks.o, dist/build/General/Chunks.dyn_o )
1547.01 s
[shake] [37 of 73] Compiling General.Timing ( src/General/Timing.hs, dist/build/General/Timing.o, dist/build/General/Timing.dyn_o )
1547.01 s
[shake] [38 of 73] Compiling General.Pool ( src/General/Pool.hs, dist/build/General/Pool.o, dist/build/General/Pool.dyn_o )
1547.01 s
[shake] [39 of 73] Compiling Development.Shake.Internal.Core.Storage ( src/Development/Shake/Internal/Core/Storage.hs, dist/build/Development/Shake/Internal/Core/Storage.o, dist/build/Development/Shake/Internal/Core/Storage.dyn_o )
1547.01 s
[shake] [40 of 73] Compiling General.TypeMap ( src/General/TypeMap.hs, dist/build/General/TypeMap.o, dist/build/General/TypeMap.dyn_o )
1547.01 s
[shake] [41 of 73] Compiling General.Wait ( src/General/Wait.hs, dist/build/General/Wait.o, dist/build/General/Wait.dyn_o )
1547.01 s
[shake] [42 of 73] Compiling Development.Shake.Internal.History.Shared ( src/Development/Shake/Internal/History/Shared.hs, dist/build/Development/Shake/Internal/History/Shared.o, dist/build/Development/Shake/Internal/History/Shared.dyn_o )
1547.01 s
[shake] [43 of 73] Compiling Development.Shake.Internal.History.Cloud ( src/Development/Shake/Internal/History/Cloud.hs, dist/build/Development/Shake/Internal/History/Cloud.o, dist/build/Development/Shake/Internal/History/Cloud.dyn_o )
1547.01 s
[shake] [44 of 73] Compiling Development.Shake.Internal.Core.Types ( src/Development/Shake/Internal/Core/Types.hs, dist/build/Development/Shake/Internal/Core/Types.o, dist/build/Development/Shake/Internal/Core/Types.dyn_o )
1547.01 s
[shake] [45 of 73] Compiling Development.Shake.Internal.Core.Rules ( src/Development/Shake/Internal/Core/Rules.hs, dist/build/Development/Shake/Internal/Core/Rules.o, dist/build/Development/Shake/Internal/Core/Rules.dyn_o )
1547.01 s
[shake] [46 of 73] Compiling Development.Shake.Internal.Core.Pool ( src/Development/Shake/Internal/Core/Pool.hs, dist/build/Development/Shake/Internal/Core/Pool.o, dist/build/Development/Shake/Internal/Core/Pool.dyn_o )
1547.01 s
[shake] [47 of 73] Compiling Development.Shake.Internal.Core.Action ( src/Development/Shake/Internal/Core/Action.hs, dist/build/Development/Shake/Internal/Core/Action.o, dist/build/Development/Shake/Internal/Core/Action.dyn_o )
1547.01 s
[shake] [48 of 73] Compiling Development.Shake.Internal.Resource ( src/Development/Shake/Internal/Resource.hs, dist/build/Development/Shake/Internal/Resource.o, dist/build/Development/Shake/Internal/Resource.dyn_o )
1547.01 s
[shake] [49 of 73] Compiling Development.Shake.Internal.Core.Build ( src/Development/Shake/Internal/Core/Build.hs, dist/build/Development/Shake/Internal/Core/Build.o, dist/build/Development/Shake/Internal/Core/Build.dyn_o )
1547.01 s
[shake] [50 of 73] Compiling Development.Shake.Rule ( src/Development/Shake/Rule.hs, dist/build/Development/Shake/Rule.o, dist/build/Development/Shake/Rule.dyn_o )
1547.01 s
[shake] [51 of 73] Compiling Development.Shake.Internal.Rules.Rerun ( src/Development/Shake/Internal/Rules/Rerun.hs, dist/build/Development/Shake/Internal/Rules/Rerun.o, dist/build/Development/Shake/Internal/Rules/Rerun.dyn_o )
1547.01 s
[shake] [52 of 73] Compiling Development.Shake.Internal.Rules.Oracle ( src/Development/Shake/Internal/Rules/Oracle.hs, dist/build/Development/Shake/Internal/Rules/Oracle.o, dist/build/Development/Shake/Internal/Rules/Oracle.dyn_o )
1547.01 s
[shake] [53 of 73] Compiling Development.Shake.Internal.Rules.File ( src/Development/Shake/Internal/Rules/File.hs, dist/build/Development/Shake/Internal/Rules/File.o, dist/build/Development/Shake/Internal/Rules/File.dyn_o )
1547.01 s
[shake] [54 of 73] Compiling Development.Shake.Internal.Rules.OrderOnly ( src/Development/Shake/Internal/Rules/OrderOnly.hs, dist/build/Development/Shake/Internal/Rules/OrderOnly.o, dist/build/Development/Shake/Internal/Rules/OrderOnly.dyn_o )
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] intersectionWith
1547.01 s
[unordered-containers] model: OK (0.28s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] valid: OK (0.22s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] intersectionWithKey
1547.01 s
[unordered-containers] model: OK (0.63s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] valid: OK (0.40s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] compose
1547.01 s
[unordered-containers] valid: OK (0.29s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] map
1547.01 s
[unordered-containers] model: OK (0.49s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] valid: OK (0.34s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] traverseWithKey
1547.01 s
[unordered-containers] model: OK (1.15s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] valid: OK (0.20s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] mapKeys
1547.01 s
[unordered-containers] model: OK (0.05s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] valid: OK (3.09s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] foldr: OK (0.10s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] foldl: OK (0.08s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] foldrWithKey: OK (0.05s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] foldlWithKey: OK (0.05s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] foldrWithKey': OK (0.11s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] foldlWithKey': OK (0.07s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] foldl': OK (0.14s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] foldr': OK (0.05s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] foldMapWithKey: OK (0.12s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] filter
1547.01 s
[unordered-containers] model: OK (0.28s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] valid: OK (0.29s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] filterWithKey
1547.01 s
[unordered-containers] model: OK (5.47s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] valid: OK (4.36s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] mapMaybe
1547.01 s
[unordered-containers] model: OK (0.59s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] valid: OK (0.30s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] mapMaybeWithKey
1547.01 s
[unordered-containers] model: OK (5.14s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] valid: OK (4.32s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] elems: OK (0.10s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] keys: OK (0.06s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] fromList
1547.01 s
[unordered-containers] model: OK (0.07s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] valid: OK (0.17s)
1547.01 s
[unordered-containers] +++ OK, passed 100 tests.
1547.01 s
[unordered-containers] fromListWith
1547.01 s
[unordered-containers] model: OK (0.09s)
1547.02 s
[unordered-containers] +++ OK, passed 100 tests.
1547.02 s
[unordered-containers] valid: OK (0.14s)
1547.02 s
[unordered-containers] +++ OK, passed 100 tests.
1547.02 s
[unordered-containers] fromListWithKey
1547.02 s
[unordered-containers] model: OK (0.35s)
1547.02 s
[unordered-containers] +++ OK, passed 100 tests.
1547.02 s
[unordered-containers] valid: OK (0.26s)
1547.02 s
[unordered-containers] +++ OK, passed 100 tests.
1547.02 s
[unordered-containers] toList: OK (0.12s)
1547.02 s
[unordered-containers] +++ OK, passed 100 tests.
1547.02 s
[unordered-containers] Data.HashSet
1547.02 s
[unordered-containers] instances
1547.02 s
[unordered-containers] Eq
1547.02 s
[unordered-containers] ==: OK (0.17s)
1547.02 s
[unordered-containers] +++ OK, passed 100 tests.
1547.02 s
[unordered-containers] == permutations: OK (0.04s)
1547.02 s
[unordered-containers] +++ OK, passed 100 tests.
1547.02 s
[unordered-containers] /=: OK (0.24s)
1547.02 s
[unordered-containers] +++ OK, passed 100 tests.
1547.02 s
[unordered-containers] Ord
1547.02 s
[unordered-containers] compare reflexive: OK (0.04s)
1547.02 s
[unordered-containers] +++ OK, passed 100 tests.
1547.02 s
[unordered-containers] compare transitive: OK (0.18s)
1547.02 s
[unordered-containers] +++ OK, passed 100 tests.
1547.02 s
[aeson] NullaryString: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] Nullary2ElemArray: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] NullaryTaggedObject: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] NullaryObjectWithSingleField: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] ApproxUnwrap: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] ApproxDefault: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] SomeType2ElemArray: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] SomeTypeTaggedObject: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] SomeTypeObjectWithSingleField: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] generics
1547.02 s
[aeson] toJSON
1547.02 s
[aeson] Nullary
1547.02 s
[aeson] string: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] 2ElemArray: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] TaggedObject: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] ObjectWithSingleField: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] roundTrip
1547.02 s
[aeson] string: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] 2ElemArray: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] TaggedObject: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] ObjectWithSingleField: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] SomeType
1547.02 s
[aeson] 2ElemArray: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] TaggedObject: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] ObjectWithSingleField: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] roundTrip
1547.02 s
[aeson] 2ElemArray: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] TaggedObject: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] ObjectWithSingleField: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] Approx
1547.02 s
[aeson] string: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] ObjectWithSingleField: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] roundTrip
1547.02 s
[aeson] string: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] ObjectWithSingleField: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] toEncoding
1547.02 s
[aeson] NullaryString: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] Nullary2ElemArray: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] NullaryTaggedObject: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] NullaryObjectWithSingleField: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] ApproxUnwrap: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] ApproxDefault: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] SomeType2ElemArray: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] SomeTypeTaggedObject: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] SomeTypeObjectWithSingleField: OK
1547.02 s
[aeson] +++ OK, passed 100 tests.
1547.02 s
[aeson] RFC8785
1547.02 s
[aeson] example: OK
1547.02 s
[aeson] key-sort: OK
1547.02 s
[aeson] numbers
1547.02 s
[aeson] 0: OK
1547.02 s
[aeson] 0: OK
1547.02 s
[aeson] 5e-324: OK
1547.02 s
[aeson] -5e-324: OK
1547.02 s
[aeson] 1.7976931348623157e+308: OK
1547.02 s
[aeson] -1.7976931348623157e+308: OK
1547.02 s
[aeson] 9007199254740992: OK
1547.02 s
[algebraic-graphs] OK: clique [x] == vertex x
1547.02 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1547.02 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1547.02 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1547.02 s
[algebraic-graphs]
1547.02 s
[algebraic-graphs] ============ AdjacencyIntMap.biclique ============
1547.02 s
[algebraic-graphs] OK: biclique [] [] == empty
1547.02 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1547.02 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1547.02 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1547.02 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1547.02 s
[algebraic-graphs]
1547.02 s
[algebraic-graphs] ============ AdjacencyIntMap.star ============
1547.02 s
[algebraic-graphs] OK: star x [] == vertex x
1547.02 s
[algebraic-graphs] OK: star x [y] == edge x y
1547.02 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1547.02 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1547.02 s
[algebraic-graphs]
1547.02 s
[algebraic-graphs] ============ AdjacencyIntMap.stars ============
1547.02 s
[algebraic-graphs] OK: stars [] == empty
1547.02 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1547.02 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1547.02 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1547.02 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1547.02 s
[algebraic-graphs] OK: stars . adjacencyList == id
1547.02 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1547.02 s
[algebraic-graphs]
1547.02 s
[algebraic-graphs] ============ AdjacencyIntMap.tree ============
1547.02 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1547.02 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1547.02 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1547.02 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1547.02 s
[algebraic-graphs]
1547.02 s
[algebraic-graphs] ============ AdjacencyIntMap.forest ============
1547.02 s
[algebraic-graphs] OK: forest [] == empty
1547.02 s
[algebraic-graphs] OK: forest [x] == tree x
1547.02 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1547.02 s
[algebraic-graphs] OK: forest == overlays . map tree
1547.02 s
[algebraic-graphs]
1547.02 s
[algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
1547.02 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1547.02 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1547.02 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1547.02 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1547.02 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1547.02 s
[algebraic-graphs]
1547.02 s
[algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
1547.02 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1547.02 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1547.02 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1547.02 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1547.02 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1547.02 s
[algebraic-graphs]
1547.02 s
[algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
1547.02 s
[algebraic-graphs] OK: replaceVertex x x == id
1547.02 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1547.02 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1547.02 s
[algebraic-graphs]
1547.02 s
[algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
1547.02 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1547.02 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1547.02 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1547.02 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1547.02 s
[algebraic-graphs]
1547.02 s
[algebraic-graphs] ============ AdjacencyIntMap.transpose ============
1547.02 s
[algebraic-graphs] OK: transpose empty == empty
1547.02 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1547.02 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1547.02 s
[algebraic-graphs] OK: transpose . transpose == id
1547.02 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1547.02 s
[algebraic-graphs]
1547.02 s
[algebraic-graphs] ============ AdjacencyIntMap.gmap ============
1547.02 s
[algebraic-graphs] OK: gmap f empty == empty
1547.02 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1547.02 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1547.02 s
[algebraic-graphs] OK: gmap id == id
1547.02 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1547.02 s
[algebraic-graphs]
1547.02 s
[algebraic-graphs] ============ AdjacencyIntMap.induce ============
1547.02 s
[algebraic-graphs] OK: induce (const True ) x == x
1547.02 s
[algebraic-graphs] OK: induce (const False) x == empty
1547.02 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1547.02 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1547.02 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1547.02 s
[algebraic-graphs]
1547.02 s
[algebraic-graphs] ============ AdjacencyIntMap.compose ============
1547.02 s
[algebraic-graphs] OK: compose empty x == empty
1547.02 s
[algebraic-graphs] OK: compose x empty == empty
1547.02 s
[algebraic-graphs] OK: compose (vertex x) y == empty
1547.02 s
[algebraic-graphs] OK: compose x (vertex y) == empty
1547.02 s
[algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
1547.02 s
[algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
1547.11 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/m8q2nr3z7kchw6ajj5lgwmchrm0bv9pc-filemanip-0.3.6.3-doc /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3
1547.55 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1547.57 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/m8q2nr3z7kchw6ajj5lgwmchrm0bv9pc-filemanip-0.3.6.3-doc /nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3
1547.63 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1547.67 s
[post-build-hook] copying 1 paths...
1547.67 s
[post-build-hook] copying path '/nix/store/r747713izmbnpg6913q3lqizhxmwv219-filemanip-0.3.6.3' to 'https://cache.nix-ci.com'...
1548.59 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1548.75 s
[post-build-hook] copying 0 paths...
1548.88 s
Progress: 90 of 171 built (8 building), 395 of 395 downloaded from cache
1548.88 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.88 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.88 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Invariant/Day.hs:122:1
1548.88 s
[kan-extensions] Warning: 'trans1' is ambiguous. It is defined
1548.88 s
[kan-extensions] * at src/Data/Functor/Contravariant/Day.hs:185:1
1548.88 s
[kan-extensions] * at src/Data/Functor/Day.hs:187:1
1548.88 s
[kan-extensions] * at src/Data/Functor/Invariant/Day.hs:132:1
1548.88 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.88 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.88 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Invariant/Day.hs:132:1
1548.88 s
[kan-extensions] Warning: 'trans2' is ambiguous. It is defined
1548.88 s
[kan-extensions] * at src/Data/Functor/Contravariant/Day.hs:195:1
1548.88 s
[kan-extensions] * at src/Data/Functor/Day.hs:197:1
1548.88 s
[kan-extensions] * at src/Data/Functor/Invariant/Day.hs:142:1
1548.88 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.88 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.88 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Invariant/Day.hs:142:1
1548.88 s
[kan-extensions] 100% ( 14 / 14) in 'Data.Functor.Invariant.Day'
1548.88 s
[kan-extensions] Warning: 'Lan' is ambiguous. It is defined
1548.88 s
[kan-extensions] * at src/Data/Functor/Kan/Lan.hs:37:3
1548.88 s
[kan-extensions] * at src/Data/Functor/Kan/Lan.hs:36:1
1548.88 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.88 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.88 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Kan/Lan.hs:36:1
1548.88 s
[kan-extensions] Warning: 'Compose' is out of scope.
1548.88 s
[kan-extensions] If you qualify the identifier, haddock can try to link it anyway.
1548.88 s
[kan-extensions] Warning: 'o' is out of scope.
1548.88 s
[kan-extensions] If you qualify the identifier, haddock can try to link it anyway.
1548.88 s
[kan-extensions] 75% ( 9 / 12) in 'Data.Functor.Kan.Lan'
1548.88 s
[kan-extensions] Missing documentation for:
1548.88 s
[kan-extensions] decomposeLan (src/Data/Functor/Kan/Lan.hs:109)
1548.88 s
[kan-extensions] lanToAdjoint (src/Data/Functor/Kan/Lan.hs:81)
1548.88 s
[kan-extensions] composedAdjointToLan (src/Data/Functor/Kan/Lan.hs:95)
1548.88 s
[kan-extensions] Warning: 'Coyoneda' is ambiguous. It is defined
1548.88 s
[kan-extensions] * at src/Data/Functor/Coyoneda.hs:54:3
1548.88 s
[kan-extensions] * at src/Data/Functor/Coyoneda.hs:53:1
1548.88 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.88 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.89 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Coyoneda.hs:53:1
1548.89 s
[kan-extensions] Warning: 'Identity' is ambiguous. It is defined
1548.89 s
[kan-extensions] * in ‘Data.Functor.Identity’
1548.89 s
[kan-extensions] * in ‘Data.Functor.Identity’
1548.89 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.89 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.89 s
[kan-extensions] Defaulting to the one defined in ‘Data.Functor.Identity’
1548.89 s
[kan-extensions] 88% ( 8 / 9) in 'Data.Functor.Coyoneda'
1548.89 s
[kan-extensions] Missing documentation for:
1548.89 s
[kan-extensions] lanToCoyoneda (src/Data/Functor/Coyoneda.hs:76)
1548.89 s
[kan-extensions] Warning: 'Density' is ambiguous. It is defined
1548.89 s
[kan-extensions] * at src/Control/Comonad/Density.hs:41:3
1548.89 s
[kan-extensions] * at src/Control/Comonad/Density.hs:40:1
1548.89 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.89 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.89 s
[kan-extensions] Defaulting to the one defined at src/Control/Comonad/Density.hs:40:1
1548.89 s
[kan-extensions] Warning: 'Lan' is ambiguous. It is defined
1548.89 s
[kan-extensions] * at src/Data/Functor/Kan/Lan.hs:37:3
1548.89 s
[kan-extensions] * at src/Data/Functor/Kan/Lan.hs:36:1
1548.89 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.89 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.89 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Kan/Lan.hs:36:1
1548.89 s
[kan-extensions] 57% ( 4 / 7) in 'Control.Comonad.Density'
1548.89 s
[kan-extensions] Missing documentation for:
1548.89 s
[kan-extensions] Density (src/Control/Comonad/Density.hs:40)
1548.89 s
[kan-extensions] adjunctionToDensity (src/Control/Comonad/Density.hs:97)
1548.89 s
[kan-extensions] densityToLan (src/Control/Comonad/Density.hs:112)
1548.89 s
[kan-extensions] Warning: 'Hask' is out of scope.
1548.89 s
[kan-extensions] If you qualify the identifier, haddock can try to link it anyway.
1548.89 s
[kan-extensions] Warning: 'Contravariant' is out of scope.
1548.89 s
[kan-extensions] If you qualify the identifier, haddock can try to link it anyway.
1548.89 s
[kan-extensions] Warning: 'CoT' is ambiguous. It is defined
1548.89 s
[kan-extensions] * at src/Control/Monad/Co.hs:84:21
1548.89 s
[kan-extensions] * at src/Control/Monad/Co.hs:84:1
1548.89 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.89 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.89 s
[kan-extensions] Defaulting to the one defined at src/Control/Monad/Co.hs:84:1
1548.89 s
[kan-extensions] Warning: 'Rift' is out of scope.
1548.89 s
[kan-extensions] If you qualify the identifier, haddock can try to link it anyway.
1548.89 s
[regex] [ 9 of 48] Compiling Text.RE.ZeInternals.Types.Matches ( Text/RE/ZeInternals/Types/Matches.lhs, dist/build/Text/RE/ZeInternals/Types/Matches.p_o )
1548.89 s
[regex] [10 of 48] Compiling Text.RE.ZeInternals.Replace ( Text/RE/ZeInternals/Replace.lhs, dist/build/Text/RE/ZeInternals/Replace.p_o )
1548.89 s
[regex]
1548.89 s
[regex] Text/RE/ZeInternals/Replace.lhs:530:34: warning : [ GHC-63394 ] [ -Wx-partial ]
1548.89 s
[regex] In the use of ‘tail’
1548.89 s
[regex] (imported from Prelude.Compat, but defined in GHC.List):
1548.89 s
[regex] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1548.89 s
[regex] |
1548.89 s
[regex] 530 | chk xs = chk $ tail xs
1548.89 s
[regex] | ^^^^
1548.89 s
[regex] [11 of 48] Compiling Text.RE.ZeInternals.TestBench ( Text/RE/ZeInternals/TestBench.lhs, dist/build/Text/RE/ZeInternals/TestBench.p_o )
1548.89 s
[regex] [12 of 48] Compiling Text.RE.ZeInternals.AddCaptureNames ( Text/RE/ZeInternals/AddCaptureNames.hs, dist/build/Text/RE/ZeInternals/AddCaptureNames.p_o )
1548.89 s
[regex] [13 of 48] Compiling Text.RE.Replace ( Text/RE/Replace.hs, dist/build/Text/RE/Replace.p_o )
1548.89 s
[regex] [14 of 48] Compiling Text.RE.ZeInternals.TestBench.Parsers ( Text/RE/ZeInternals/TestBench/Parsers.hs, dist/build/Text/RE/ZeInternals/TestBench/Parsers.p_o )
1548.89 s
[regex] [15 of 48] Compiling Text.RE.ZeInternals.PreludeMacros ( Text/RE/ZeInternals/PreludeMacros.hs, dist/build/Text/RE/ZeInternals/PreludeMacros.p_o )
1548.89 s
[regex] [16 of 48] Compiling Text.RE.TestBench.Parsers ( Text/RE/TestBench/Parsers.hs, dist/build/Text/RE/TestBench/Parsers.p_o )
1548.89 s
[regex] [17 of 48] Compiling Text.RE.TestBench ( Text/RE/TestBench.hs, dist/build/Text/RE/TestBench.p_o )
1548.89 s
[regex] [18 of 48] Compiling Text.RE.ZeInternals.Types.Poss ( Text/RE/ZeInternals/Types/Poss.hs, dist/build/Text/RE/ZeInternals/Types/Poss.p_o )
1548.89 s
[regex] [19 of 48] Compiling Text.RE.ZeInternals.Types.SearchReplace ( Text/RE/ZeInternals/Types/SearchReplace.lhs, dist/build/Text/RE/ZeInternals/Types/SearchReplace.p_o )
1548.89 s
[regex] [20 of 48] Compiling Text.RE.ZeInternals.Types.IsRegex ( Text/RE/ZeInternals/Types/IsRegex.lhs, dist/build/Text/RE/ZeInternals/Types/IsRegex.p_o )
1548.89 s
[regex] [21 of 48] Compiling Text.RE.ZeInternals.Tools.Lex ( Text/RE/ZeInternals/Tools/Lex.lhs, dist/build/Text/RE/ZeInternals/Tools/Lex.p_o )
1548.89 s
[regex] [22 of 48] Compiling Text.RE.ZeInternals.NamedCaptures ( Text/RE/ZeInternals/NamedCaptures.lhs, dist/build/Text/RE/ZeInternals/NamedCaptures.p_o )
1548.89 s
[regex] [23 of 48] Compiling Text.RE.Tools.IsRegex ( Text/RE/Tools/IsRegex.hs, dist/build/Text/RE/Tools/IsRegex.p_o )
1548.89 s
[regex] [24 of 48] Compiling Text.RE.Tools.Lex ( Text/RE/Tools/Lex.hs, dist/build/Text/RE/Tools/Lex.p_o )
1548.89 s
[regex] [25 of 48] Compiling Text.RE.Tools.Grep ( Text/RE/Tools/Grep.lhs, dist/build/Text/RE/Tools/Grep.p_o )
1548.89 s
[regex] [26 of 48] Compiling Text.RE.Tools.Find ( Text/RE/Tools/Find.lhs, dist/build/Text/RE/Tools/Find.p_o )
1548.89 s
[regex] [27 of 48] Compiling Text.RE.Tools.Edit ( Text/RE/Tools/Edit.lhs, dist/build/Text/RE/Tools/Edit.p_o )
1548.89 s
[regex] [28 of 48] Compiling Text.RE.Tools.Sed ( Text/RE/Tools/Sed.lhs, dist/build/Text/RE/Tools/Sed.p_o )
1548.89 s
[regex] [29 of 48] Compiling Text.RE.Tools ( Text/RE/Tools.hs, dist/build/Text/RE/Tools.p_o )
1548.89 s
[regex] [30 of 48] Compiling Text.RE.Summa ( Text/RE/Summa.hs, dist/build/Text/RE/Summa.p_o )
1548.89 s
[regex] [31 of 48] Compiling Text.RE.ZeInternals.SearchReplace ( Text/RE/ZeInternals/SearchReplace.hs, dist/build/Text/RE/ZeInternals/SearchReplace.p_o )
1548.89 s
[regex] [32 of 48] Compiling Text.RE.ZeInternals ( Text/RE/ZeInternals.hs, dist/build/Text/RE/ZeInternals.p_o )
1548.89 s
[regex] [33 of 48] Compiling Text.RE.ZeInternals.TDFA ( Text/RE/ZeInternals/TDFA.hs, dist/build/Text/RE/ZeInternals/TDFA.p_o )
1548.89 s
[regex] [34 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFAEdPrime ( Text/RE/ZeInternals/SearchReplace/TDFAEdPrime.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFAEdPrime.p_o )
1548.89 s
[regex] [35 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.Text.Lazy ( Text/RE/ZeInternals/SearchReplace/TDFA/Text/Lazy.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/Text/Lazy.p_o )
1548.89 s
[shake] [55 of 73] Compiling Development.Shake.Internal.Rules.Files ( src/Development/Shake/Internal/Rules/Files.hs, dist/build/Development/Shake/Internal/Rules/Files.o, dist/build/Development/Shake/Internal/Rules/Files.dyn_o )
1548.89 s
[shake] [56 of 73] Compiling Development.Shake.Internal.Derived ( src/Development/Shake/Internal/Derived.hs, dist/build/Development/Shake/Internal/Derived.o, dist/build/Development/Shake/Internal/Derived.dyn_o )
1548.89 s
[shake] [57 of 73] Compiling Development.Shake.Command ( src/Development/Shake/Command.hs, dist/build/Development/Shake/Command.o, dist/build/Development/Shake/Command.dyn_o )
1548.89 s
[shake] [58 of 73] Compiling Development.Shake.Internal.Rules.Directory ( src/Development/Shake/Internal/Rules/Directory.hs, dist/build/Development/Shake/Internal/Rules/Directory.o, dist/build/Development/Shake/Internal/Rules/Directory.dyn_o )
1548.89 s
[shake] [59 of 73] Compiling Development.Shake.Internal.Rules.Default ( src/Development/Shake/Internal/Rules/Default.hs, dist/build/Development/Shake/Internal/Rules/Default.o, dist/build/Development/Shake/Internal/Rules/Default.dyn_o )
1548.89 s
[shake] [60 of 73] Compiling Paths_shake ( dist/build/autogen/Paths_shake.hs, dist/build/Paths_shake.o, dist/build/Paths_shake.dyn_o )
1548.89 s
[shake] [61 of 73] Compiling Development.Shake.Internal.Paths ( src/Development/Shake/Internal/Paths.hs, dist/build/Development/Shake/Internal/Paths.o, dist/build/Development/Shake/Internal/Paths.dyn_o )
1548.89 s
[shake] [62 of 73] Compiling General.Template ( src/General/Template.hs, dist/build/General/Template.o, dist/build/General/Template.dyn_o )
1548.89 s
[shake] [63 of 73] Compiling Development.Shake.Internal.Progress ( src/Development/Shake/Internal/Progress.hs, dist/build/Development/Shake/Internal/Progress.o, dist/build/Development/Shake/Internal/Progress.dyn_o )
1548.89 s
[shake] [64 of 73] Compiling Development.Shake.Internal.CompactUI ( src/Development/Shake/Internal/CompactUI.hs, dist/build/Development/Shake/Internal/CompactUI.o, dist/build/Development/Shake/Internal/CompactUI.dyn_o )
1548.89 s
[shake] [65 of 73] Compiling Development.Shake.Internal.Profile ( src/Development/Shake/Internal/Profile.hs, dist/build/Development/Shake/Internal/Profile.o, dist/build/Development/Shake/Internal/Profile.dyn_o )
1548.89 s
[shake] [66 of 73] Compiling Development.Shake.Internal.Core.Run ( src/Development/Shake/Internal/Core/Run.hs, dist/build/Development/Shake/Internal/Core/Run.o, dist/build/Development/Shake/Internal/Core/Run.dyn_o )
1548.89 s
[shake] [67 of 73] Compiling Development.Shake.Database ( src/Development/Shake/Database.hs, dist/build/Development/Shake/Database.o, dist/build/Development/Shake/Database.dyn_o )
1548.89 s
[shake] [68 of 73] Compiling Development.Shake.Internal.Demo ( src/Development/Shake/Internal/Demo.hs, dist/build/Development/Shake/Internal/Demo.o, dist/build/Development/Shake/Internal/Demo.dyn_o )
1548.89 s
[shake] [69 of 73] Compiling Development.Shake.Internal.Args ( src/Development/Shake/Internal/Args.hs, dist/build/Development/Shake/Internal/Args.o, dist/build/Development/Shake/Internal/Args.dyn_o )
1548.89 s
[shake] [70 of 73] Compiling Development.Shake ( src/Development/Shake.hs, dist/build/Development/Shake.o, dist/build/Development/Shake.dyn_o )
1548.89 s
[shake] [71 of 73] Compiling Development.Shake.Util ( src/Development/Shake/Util.hs, dist/build/Development/Shake/Util.o, dist/build/Development/Shake/Util.dyn_o )
1548.89 s
[shake] [72 of 73] Compiling Development.Shake.Forward ( src/Development/Shake/Forward.hs, dist/build/Development/Shake/Forward.o, dist/build/Development/Shake/Forward.dyn_o )
1548.89 s
[shake] [73 of 73] Compiling Development.Shake.Config ( src/Development/Shake/Config.hs, dist/build/Development/Shake/Config.o, dist/build/Development/Shake/Config.dyn_o )
1548.89 s
[unordered-containers] compare antisymmetric: OK (0.02s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] Ord => Eq: OK (0.18s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] Read/Show: OK (1.54s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] Foldable: OK (0.14s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] Hashable: OK (0.19s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] size: OK (0.14s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] member: OK (0.22s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] insert: OK (0.25s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] delete: OK (0.04s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] union: OK (0.17s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] map: OK (3.60s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] foldr: OK (0.20s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] foldl': OK (0.03s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] filter: OK (3.80s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] toList: OK (0.17s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] Data.HashMap.Internal.List
1548.89 s
[unordered-containers] isPermutationBy: OK (0.11s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.89 s
[unordered-containers] isPermutationBy of different length: OK (0.05s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests; 19 discarded.
1548.89 s
[unordered-containers] pUnorderedCompare: OK (0.26s)
1548.89 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] modelUnorderedCompare
1548.90 s
[unordered-containers] reflexive: OK (0.04s)
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] anti-symmetric: OK (0.10s)
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] transitive: OK (0.03s)
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] Regression tests
1548.90 s
[unordered-containers] issue32: OK
1548.90 s
[unordered-containers] issue39a: OK
1548.90 s
[unordered-containers] issue39b: OK (0.14s)
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] issue254 lazy: OK (0.05s)
1548.90 s
[unordered-containers] issue254 strict: OK (0.01s)
1548.90 s
[unordered-containers] issue379
1548.90 s
[unordered-containers] Lazy.unionWith: OK
1548.90 s
[unordered-containers] union: OK
1548.90 s
[unordered-containers] Strict.unionWith: OK
1548.90 s
[unordered-containers] Strict.unionWithKey: OK
1548.90 s
[unordered-containers] issue381
1548.90 s
[unordered-containers] mapMaybe: OK
1548.90 s
[unordered-containers] mapMaybeWithKey: OK
1548.90 s
[unordered-containers] issue382: OK (0.02s)
1548.90 s
[unordered-containers] issue383: OK
1548.90 s
[unordered-containers] issue420: OK
1548.90 s
[unordered-containers] Strictness
1548.90 s
[unordered-containers] HashMap.Strict
1548.90 s
[unordered-containers] singleton is key-strict: OK
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] singleton is value-strict: OK
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] member is key-strict: OK
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] lookup is key-strict: OK
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] lookupDefault is key-strict: OK
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] findWithDefault is key-strict: OK
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] ! is key-strict: OK
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] delete is key-strict: OK
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] adjust is key-strict: OK
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] adjust is value-strict: OK (0.17s)
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] insert is key-strict: OK (0.02s)
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] insert is value-strict: OK
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] insertWith is key-strict: OK (0.02s)
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] insertWith is value-strict: OK (0.05s)
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] fromList is key-strict: OK
1548.90 s
[unordered-containers] +++ OK, passed 1 test.
1548.90 s
[unordered-containers] fromList is value-strict: OK
1548.90 s
[unordered-containers] +++ OK, passed 100 tests.
1548.90 s
[unordered-containers] fromListWith is key-strict: OK
1548.90 s
[aeson] -9007199254740992: OK
1548.90 s
[aeson] 295147905179352830000: OK
1548.90 s
[aeson] 9.999999999999997e+22: OK
1548.91 s
[aeson] 1e+23: OK
1548.91 s
[aeson] 1.0000000000000001e+23: OK
1548.91 s
[aeson] 999999999999999700000: OK
1548.91 s
[aeson] 999999999999999900000: OK
1548.91 s
[aeson] 1e+21: OK
1548.91 s
[aeson] 9.999999999999997e-7: OK
1548.91 s
[aeson] 0.000001: OK
1548.91 s
[aeson] 333333333.3333332: OK
1548.91 s
[aeson] 333333333.33333325: OK
1548.91 s
[aeson] 333333333.3333333: OK
1548.91 s
[aeson] 333333333.3333334: OK
1548.91 s
[aeson] 333333333.33333343: OK
1548.91 s
[aeson] -0.0000033333333333333333: OK
1548.91 s
[aeson] 1424953923781206.2: OK
1548.91 s
[aeson] roundtrip: OK (0.07s)
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] castDoubleToWord64
1548.91 s
[aeson] 5e-324: OK
1548.91 s
[aeson] roundtrip1: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] roundtrip2: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] doubleToScientific
1548.91 s
[aeson] roundtrip1: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] roundtrip2: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] properties
1548.91 s
[aeson] encode
1548.91 s
[aeson] encodeDouble: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] encodeInteger: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] read . show = id: OK (0.82s)
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] roundTrip
1548.91 s
[aeson] (): OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] Value: OK (0.12s)
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] Bool: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] Double: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] Int: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] NonEmpty Char: OK (0.01s)
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] Integer: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] String: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] Text: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] Lazy Text: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] Foo: OK (0.24s)
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] Day: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] Month: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] Quarter: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] QuarterOfYear: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] BCE Day: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] DotNetTime: OK (0.02s)
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] LocalTime: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] TimeOfDay: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] UTCTime: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] ZonedTime: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] NominalDiffTime: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] DiffTime: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] DayOfWeek: OK
1548.91 s
[aeson] +++ OK, passed 100 tests.
1548.91 s
[aeson] SystemTime: OK
1548.91 s
[algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
1548.91 s
[algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
1548.91 s
[algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
1548.92 s
[algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
1548.92 s
[algebraic-graphs]
1548.92 s
[algebraic-graphs] ============ AdjacencyIntMap.closure ============
1548.92 s
[algebraic-graphs] OK: closure empty == empty
1548.92 s
[algebraic-graphs] OK: closure (vertex x) == edge x x
1548.92 s
[algebraic-graphs] OK: closure (edge x x) == edge x x
1548.92 s
[algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
1548.92 s
[algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
1548.92 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1548.92 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1548.92 s
[algebraic-graphs] OK: closure . closure == closure
1548.92 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1548.92 s
[algebraic-graphs]
1548.92 s
[algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
1548.92 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1548.92 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
1548.92 s
[algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
1548.92 s
[algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
1548.92 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1548.92 s
[algebraic-graphs]
1548.92 s
[algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
1548.92 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1548.92 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1548.92 s
[algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
1548.92 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1548.92 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1548.92 s
[algebraic-graphs]
1548.92 s
[algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
1548.92 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1548.92 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1548.92 s
[algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
1548.92 s
[algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
1548.92 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1548.92 s
[algebraic-graphs]
1548.92 s
[algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
1548.92 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
1548.92 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
1548.92 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
1548.92 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
1548.92 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
1548.92 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
1548.92 s
[algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
1548.92 s
[algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
1548.92 s
[algebraic-graphs] OK: bfsForest x [] == []
1548.92 s
[algebraic-graphs] OK: bfsForest empty vs == []
1548.92 s
[algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
1548.92 s
[algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
1548.92 s
[algebraic-graphs]
1548.92 s
[algebraic-graphs] ============ AdjacencyIntMap.bfs ============
1548.92 s
[algebraic-graphs] OK: bfs (edge 1 2) [0] == []
1548.92 s
[algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
1548.92 s
[algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
1548.92 s
[algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
1548.92 s
[algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
1548.92 s
[algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
1548.92 s
[algebraic-graphs] OK: bfs empty vs == []
1548.92 s
[algebraic-graphs] OK: bfs x [] == []
1548.92 s
[algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
1548.92 s
[algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
1548.92 s
[algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
1548.92 s
[algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
1548.92 s
[algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
1548.92 s
[algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
1548.92 s
[algebraic-graphs]
1548.92 s
[algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
1548.92 s
[algebraic-graphs] OK: forest $ dfsForest empty == empty
1548.92 s
[algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
1548.92 s
[algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
1548.92 s
[algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
1548.92 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
1548.92 s
[algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
1548.92 s
[algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
1548.92 s
[fuzzy] Phase: setupCompilerEnvironmentPhase
1548.92 s
[fuzzy] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1548.92 s
[fuzzy] Phase: unpackPhase
1548.92 s
[fuzzy] unpacking source archive /nix/store/wavjqvgbmq1q6aawwsk6iydx5lzi3p5l-fuzzy-0.1.1.0.tar.gz
1548.92 s
[fuzzy] source root is fuzzy-0.1.1.0
1548.92 s
[fuzzy] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "fuzzy-0.1.1.0/tests/tests.hs"
1548.92 s
[fuzzy] Phase: patchPhase
1548.92 s
[fuzzy] Phase: compileBuildDriverPhase
1548.92 s
[fuzzy] setupCompileFlags: -package-db=/build/tmp.vBIRnNht8J/setup-package.conf.d -threaded
1548.92 s
[fuzzy] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.vBIRnNht8J/Main.o )
1548.92 s
[fuzzy] [2 of 2] Linking Setup
1548.92 s
[kan-extensions] Warning: 'Identity' is ambiguous. It is defined
1548.92 s
[kan-extensions] * in ‘Data.Functor.Identity’
1548.92 s
[kan-extensions] * in ‘Data.Functor.Identity’
1548.92 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.92 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.92 s
[kan-extensions] Defaulting to the one defined in ‘Data.Functor.Identity’
1548.92 s
[kan-extensions] 20% ( 5 / 24) in 'Control.Monad.Co'
1548.92 s
[kan-extensions] Missing documentation for:
1548.92 s
[kan-extensions] Co (src/Control/Monad/Co.hs:72)
1548.92 s
[kan-extensions] co (src/Control/Monad/Co.hs:75)
1548.92 s
[kan-extensions] runCo (src/Control/Monad/Co.hs:78)
1548.92 s
[kan-extensions] liftCoT0 (src/Control/Monad/Co.hs:113)
1548.92 s
[kan-extensions] liftCoT0M (src/Control/Monad/Co.hs:149)
1548.92 s
[kan-extensions] lowerCoT0 (src/Control/Monad/Co.hs:116)
1548.92 s
[kan-extensions] lowerCo0 (src/Control/Monad/Co.hs:119)
1548.92 s
[kan-extensions] liftCoT1 (src/Control/Monad/Co.hs:122)
1548.92 s
[kan-extensions] liftCoT1M (src/Control/Monad/Co.hs:152)
1548.92 s
[kan-extensions] lowerCoT1 (src/Control/Monad/Co.hs:125)
1548.92 s
[kan-extensions] lowerCo1 (src/Control/Monad/Co.hs:128)
1548.92 s
[kan-extensions] diter (src/Control/Monad/Co.hs:155)
1548.92 s
[kan-extensions] dctrlM (src/Control/Monad/Co.hs:158)
1548.92 s
[kan-extensions] posW (src/Control/Monad/Co.hs:131)
1548.92 s
[kan-extensions] peekW (src/Control/Monad/Co.hs:134)
1548.92 s
[kan-extensions] peeksW (src/Control/Monad/Co.hs:137)
1548.92 s
[kan-extensions] askW (src/Control/Monad/Co.hs:140)
1548.92 s
[kan-extensions] asksW (src/Control/Monad/Co.hs:143)
1548.92 s
[kan-extensions] traceW (src/Control/Monad/Co.hs:146)
1548.92 s
[kan-extensions] Warning: 'Ran' is ambiguous. It is defined
1548.92 s
[kan-extensions] * at src/Data/Functor/Kan/Ran.hs:85:21
1548.92 s
[kan-extensions] * at src/Data/Functor/Kan/Ran.hs:85:1
1548.92 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.92 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.92 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Kan/Ran.hs:85:1
1548.92 s
[kan-extensions] Warning: 'Compose'' is out of scope.
1548.92 s
[kan-extensions] If you qualify the identifier, haddock can try to link it anyway.
1548.92 s
[kan-extensions] 53% ( 8 / 15) in 'Data.Functor.Kan.Ran'
1548.92 s
[kan-extensions] Missing documentation for:
1548.92 s
[kan-extensions] decomposeRan (src/Data/Functor/Kan/Ran.hs:116)
1548.92 s
[kan-extensions] ranToAdjoint (src/Data/Functor/Kan/Ran.hs:130)
1548.92 s
[kan-extensions] composedAdjointToRan (src/Data/Functor/Kan/Ran.hs:144)
1548.92 s
[kan-extensions] repToRan (src/Data/Functor/Kan/Ran.hs:153)
1548.92 s
[kan-extensions] ranToRep (src/Data/Functor/Kan/Ran.hs:157)
1548.93 s
[kan-extensions] composedRepToRan (src/Data/Functor/Kan/Ran.hs:165)
1548.93 s
[kan-extensions] ranToComposedRep (src/Data/Functor/Kan/Ran.hs:161)
1548.93 s
[kan-extensions] Warning: 'Codensity' is ambiguous. It is defined
1548.93 s
[kan-extensions] * at src/Control/Monad/Codensity.hs:66:44
1548.93 s
[kan-extensions] * at src/Control/Monad/Codensity.hs:66:1
1548.93 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.93 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.93 s
[kan-extensions] Defaulting to the one defined at src/Control/Monad/Codensity.hs:66:1
1548.93 s
[kan-extensions] Warning: 'Ran' is ambiguous. It is defined
1548.93 s
[kan-extensions] * at src/Data/Functor/Kan/Ran.hs:85:21
1548.93 s
[kan-extensions] * at src/Data/Functor/Kan/Ran.hs:85:1
1548.93 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.93 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.93 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Kan/Ran.hs:85:1
1548.93 s
[kan-extensions] 85% ( 12 / 14) in 'Control.Monad.Codensity'
1548.93 s
[kan-extensions] Missing documentation for:
1548.93 s
[kan-extensions] adjunctionToCodensity (src/Control/Monad/Codensity.hs:175)
1548.93 s
[kan-extensions] ranToCodensity (src/Control/Monad/Codensity.hs:216)
1548.93 s
[kan-extensions] Warning: 'Yoneda' is ambiguous. It is defined
1548.93 s
[kan-extensions] * at src/Data/Functor/Yoneda.hs:59:22
1548.93 s
[kan-extensions] * at src/Data/Functor/Yoneda.hs:59:1
1548.93 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.93 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.93 s
[kan-extensions] Defaulting to the one defined at src/Data/Functor/Yoneda.hs:59:1
1548.93 s
[kan-extensions] Warning: 'Identity' is ambiguous. It is defined
1548.93 s
[kan-extensions] * in ‘Data.Functor.Identity’
1548.93 s
[kan-extensions] * in ‘Data.Functor.Identity’
1548.93 s
[kan-extensions] You may be able to disambiguate the identifier by qualifying it or
1548.93 s
[kan-extensions] by specifying the type/value namespace explicitly.
1548.93 s
[kan-extensions] Defaulting to the one defined in ‘Data.Functor.Identity’
1548.93 s
[kan-extensions] 45% ( 5 / 11) in 'Data.Functor.Yoneda'
1548.93 s
[kan-extensions] Missing documentation for:
1548.93 s
[kan-extensions] lowerYoneda (src/Data/Functor/Yoneda.hs:85)
1548.93 s
[kan-extensions] maxF (src/Data/Functor/Yoneda.hs:194)
1548.93 s
[kan-extensions] minF (src/Data/Functor/Yoneda.hs:199)
1548.93 s
[kan-extensions] maxM (src/Data/Functor/Yoneda.hs:204)
1548.93 s
[kan-extensions] minM (src/Data/Functor/Yoneda.hs:209)
1548.93 s
[kan-extensions] ranToYoneda (src/Data/Functor/Yoneda.hs:103)
1548.93 s
[kan-extensions] Warning: Data.Functor.Contravariant.Coyoneda: could not find link destinations for:
1548.93 s
[kan-extensions] - Data.Functor.Contravariant.Coyoneda.D:R:RepCoyoneda
1548.93 s
[kan-extensions] Warning: Data.Functor.Contravariant.Day: could not find link destinations for:
1548.93 s
[kan-extensions] - Data.Functor.Contravariant.Day.D:R:RepDay
1548.93 s
[regex] [36 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.Text ( Text/RE/ZeInternals/SearchReplace/TDFA/Text.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/Text.p_o )
1548.93 s
[regex] [37 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.String ( Text/RE/ZeInternals/SearchReplace/TDFA/String.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/String.p_o )
1548.93 s
[regex] [38 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.Sequence ( Text/RE/ZeInternals/SearchReplace/TDFA/Sequence.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/Sequence.p_o )
1548.93 s
[regex] [39 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.ByteString.Lazy ( Text/RE/ZeInternals/SearchReplace/TDFA/ByteString/Lazy.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/ByteString/Lazy.p_o )
1548.93 s
[regex] [40 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.ByteString ( Text/RE/ZeInternals/SearchReplace/TDFA/ByteString.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA/ByteString.p_o )
1548.93 s
[regex] [41 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA ( Text/RE/ZeInternals/SearchReplace/TDFA.hs, dist/build/Text/RE/ZeInternals/SearchReplace/TDFA.p_o )
1548.93 s
[regex] [42 of 48] Compiling Text.RE.TDFA.Text.Lazy ( Text/RE/TDFA/Text/Lazy.hs, dist/build/Text/RE/TDFA/Text/Lazy.p_o )
1548.93 s
[regex] [43 of 48] Compiling Text.RE.TDFA.Text ( Text/RE/TDFA/Text.hs, dist/build/Text/RE/TDFA/Text.p_o )
1548.93 s
[regex] [44 of 48] Compiling Text.RE.TDFA.String ( Text/RE/TDFA/String.hs, dist/build/Text/RE/TDFA/String.p_o )
1548.93 s
[regex] [45 of 48] Compiling Text.RE.TDFA.Sequence ( Text/RE/TDFA/Sequence.hs, dist/build/Text/RE/TDFA/Sequence.p_o )
1548.93 s
[regex] [46 of 48] Compiling Text.RE.TDFA.ByteString.Lazy ( Text/RE/TDFA/ByteString/Lazy.hs, dist/build/Text/RE/TDFA/ByteString/Lazy.p_o )
1548.93 s
[regex] [47 of 48] Compiling Text.RE.TDFA.ByteString ( Text/RE/TDFA/ByteString.hs, dist/build/Text/RE/TDFA/ByteString.p_o )
1548.93 s
[regex] [48 of 48] Compiling Text.RE.TDFA ( Text/RE/TDFA.hs, dist/build/Text/RE/TDFA.p_o )
1548.93 s
[shake] [ 1 of 73] Compiling Development.Ninja.Env ( src/Development/Ninja/Env.hs, dist/build/Development/Ninja/Env.p_o )
1548.93 s
[shake] [ 2 of 73] Compiling Development.Ninja.Type ( src/Development/Ninja/Type.hs, dist/build/Development/Ninja/Type.p_o )
1548.93 s
[unordered-containers] +++ OK, passed 100 tests.
1548.93 s
[unordered-containers] fromListWith is value-strict: OK (0.02s)
1548.93 s
[unordered-containers] +++ OK, passed 100 tests.
1548.93 s
[unordered-containers]
1548.93 s
[unordered-containers] All 256 tests passed (9.32s)
1548.93 s
[unordered-containers] Test suite unordered-containers-tests: PASS
1548.93 s
[unordered-containers] Test suite logged to:
1548.93 s
[unordered-containers] dist/test/unordered-containers-0.2.20-unordered-containers-tests.log
1548.93 s
[unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
1548.93 s
[unordered-containers] checkPhase completed in 6 minutes 56 seconds
1548.93 s
[unordered-containers] Phase: haddockPhase
1548.93 s
[unordered-containers] Preprocessing library for unordered-containers-0.2.20..
1548.93 s
[unordered-containers] Running Haddock on library for unordered-containers-0.2.20..
1548.93 s
[unordered-containers] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1548.93 s
[unordered-containers]
1548.93 s
[unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning : [ GHC-53692 ] [ -Wdeprecated-flags ]
1548.93 s
[unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
1548.93 s
[unordered-containers] |
1548.93 s
[unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
1548.93 s
[unordered-containers] | ^^^^^^^^^^
1548.93 s
[unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
1548.93 s
[unordered-containers]
1548.93 s
[unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning : [ GHC-66111 ] [ -Wunused-imports ]
1548.93 s
[unordered-containers] The import of ‘Control.Applicative’ is redundant
1548.93 s
[unordered-containers] except perhaps to import instances from ‘Control.Applicative’
1548.93 s
[unordered-containers] To import instances alone, use: import Control.Applicative()
1548.93 s
[unordered-containers] |
1548.93 s
[unordered-containers] 83 | import Control.Applicative (liftA2)
1548.93 s
[unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1548.93 s
[unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
1548.93 s
[unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] CalendarDiffTime: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] CalendarDiffDays: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Version: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Natural: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Proxy: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Tagged: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Const: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] DList: OK (0.03s)
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Seq: OK (0.01s)
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Rational: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Ratio Int: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] UUID: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] These: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Fix: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Mu: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Nu: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Maybe: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Monoid.First: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Semigroup.Sum: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Semigroup.Product: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Semigroup.All: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Semigroup.Any: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Strict Pair: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Strict Either: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Strict These: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Strict Maybe: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Solo Int: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] ShortText: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] URI: OK (0.02s)
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] functors
1548.93 s
[aeson] Identity Char: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Identity Char: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Identity [Char]: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] [Identity Char]: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Compose I I Int: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Compose [] I Int: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Compose I [] Int: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Compose [] [] Int: OK (0.01s)
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Compose I I Char: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Compose [] I Char: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Compose I [] Char: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.93 s
[aeson] Compose [] [] Char: OK
1548.93 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3 I I I Char: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3 I [] I Char: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3 I I [] Char: OK (0.01s)
1548.94 s
[algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
1548.94 s
[algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
1548.94 s
[algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
1548.94 s
[algebraic-graphs]
1548.94 s
[algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
1548.94 s
[algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
1548.94 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
1548.94 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
1548.94 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
1548.94 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
1548.94 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
1548.94 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
1548.94 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
1548.94 s
[algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
1548.94 s
[algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
1548.94 s
[algebraic-graphs] OK: dfsForestFrom x [] == []
1548.94 s
[algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
1548.94 s
[algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
1548.94 s
[algebraic-graphs]
1548.94 s
[algebraic-graphs] ============ AdjacencyIntMap.dfs ============
1548.94 s
[algebraic-graphs] OK: dfs empty vs == []
1548.94 s
[algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
1548.94 s
[algebraic-graphs] OK: dfs (edge 1 2) [0] == []
1548.94 s
[algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
1548.94 s
[algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
1548.94 s
[algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
1548.94 s
[algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
1548.94 s
[algebraic-graphs] OK: dfs x [] == []
1548.94 s
[algebraic-graphs]
1548.94 s
[algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
1548.94 s
[algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
1548.94 s
[algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
1548.94 s
[algebraic-graphs]
1548.94 s
[algebraic-graphs] ============ AdjacencyIntMap.dfs ============
1548.94 s
[algebraic-graphs] OK: reachable empty x == []
1548.94 s
[algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
1548.94 s
[algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
1548.94 s
[algebraic-graphs] OK: reachable (edge 1 2) 0 == []
1548.94 s
[algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
1548.94 s
[algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
1548.94 s
[algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
1548.94 s
[algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
1548.94 s
[algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
1548.94 s
[algebraic-graphs]
1548.94 s
[algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
1548.94 s
[algebraic-graphs]
1548.94 s
[algebraic-graphs] ============ AdjacencyIntMap.topSort ============
1548.94 s
[algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
1548.94 s
[algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
1548.94 s
[algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
1548.94 s
[algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
1548.94 s
[algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
1548.94 s
[algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
1548.94 s
[algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
1548.94 s
[algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
1548.94 s
[algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
1548.94 s
[algebraic-graphs] OK: topSort . vertices == Right . nub . sort
1548.94 s
[algebraic-graphs]
1548.94 s
[algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
1548.94 s
[algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
1548.94 s
[algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
1548.94 s
[algebraic-graphs] OK: isAcyclic . circuit == null
1548.94 s
[algebraic-graphs] OK: isAcyclic == isRight . topSort
1548.94 s
[algebraic-graphs]
1548.94 s
[algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [] empty == True
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
1548.94 s
[kan-extensions] Warning: Data.Functor.Contravariant.Yoneda: could not find link destinations for:
1548.94 s
[kan-extensions] - Data.Functor.Contravariant.Yoneda.D:R:RepYoneda
1548.94 s
[kan-extensions] Warning: Data.Functor.Day: could not find link destinations for:
1548.94 s
[kan-extensions] - Data.Functor.Day.D:R:RepDay
1548.94 s
[kan-extensions] Warning: Data.Functor.Coyoneda: could not find link destinations for:
1548.94 s
[kan-extensions] - Data.Functor.Coyoneda.D:R:RepCoyoneda
1548.94 s
[kan-extensions] Warning: Data.Functor.Yoneda: could not find link destinations for:
1548.94 s
[kan-extensions] - Data.Functor.Yoneda.D:R:RepYoneda
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3 I [] [] Char: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3 [] I I Char: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3 [] [] I Char: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3 [] I [] Char: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3 [] [] [] Char: OK (0.01s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3' I I I Char: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3' I [] I Char: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3' I I [] Char: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3' I [] [] Char: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3' [] I I Char: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3' [] [] I Char: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3' [] I [] Char: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Compose3' [] [] [] Char: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] ghcGenerics
1548.94 s
[aeson] OneConstructor: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Product2: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Product6: OK (0.02s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Sum4: OK (0.07s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] roundTrip Key
1548.94 s
[aeson] Bool: OK (0.01s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Text: OK (0.20s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] String: OK (0.33s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Int: OK (0.04s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] [Text]: OK (0.18s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] (Int,Char): OK (0.03s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Integer: OK (0.02s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Natural: OK (0.02s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Float: OK (0.05s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Double: OK (0.06s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Day: OK (0.03s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] DayOfWeek: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Month: OK (0.03s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Quarter: OK (0.04s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] QuarterOfYear: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] LocalTime: OK (0.07s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] TimeOfDay: OK (0.08s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] UTCTime: OK (0.13s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Version: OK (0.18s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Lazy Text: OK (0.17s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] UUID: OK (0.10s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Const Text: OK (0.18s)
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] toFromJSON
1548.94 s
[aeson] Integer: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Double: OK
1548.94 s
[aeson] +++ OK, passed 100 tests.
1548.94 s
[aeson] Maybe Integer: OK
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
1548.94 s
[algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
1548.95 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
1548.95 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
1548.95 s
[algebraic-graphs]
1548.95 s
[algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
1548.95 s
[algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
1548.95 s
[algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
1548.95 s
[algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
1548.95 s
[algebraic-graphs] OK: isTopSortOf [] empty == True
1548.95 s
[algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
1548.95 s
[algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
1548.95 s
[algebraic-graphs]
1548.95 s
[algebraic-graphs] ============ AdjacencyMap ============
1548.95 s
[algebraic-graphs] OK: Axioms of graphs
1548.95 s
[algebraic-graphs]
1548.95 s
[algebraic-graphs] ============ AdjacencyMap.consistent ============
1548.95 s
[algebraic-graphs] OK: Consistency of the Arbitrary instance
1548.95 s
[algebraic-graphs]
1548.95 s
[algebraic-graphs] OK: consistent empty == True
1548.95 s
[algebraic-graphs] OK: consistent (vertex x) == True
1548.95 s
[algebraic-graphs] OK: consistent (overlay x y) == True
1548.95 s
[algebraic-graphs] OK: consistent (connect x y) == True
1548.95 s
[algebraic-graphs] OK: consistent (edge x y) == True
1548.95 s
[algebraic-graphs] OK: consistent (edges xs) == True
1548.95 s
[algebraic-graphs] OK: consistent (stars xs) == True
1548.95 s
[algebraic-graphs]
1548.95 s
[algebraic-graphs] ============ AdjacencyMap.Show ============
1548.95 s
[algebraic-graphs] OK: show (empty ) == "empty"
1548.95 s
[algebraic-graphs] OK: show (1 ) == "vertex 1"
1548.95 s
[algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
1548.95 s
[algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
1548.95 s
[algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
1548.95 s
[algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
1548.95 s
[algebraic-graphs]
1548.95 s
[algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
1548.95 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
1548.95 s
[algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
1548.95 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
1548.95 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
1548.95 s
[algebraic-graphs]
1548.95 s
[algebraic-graphs] ============ AdjacencyMap.Ord ============
1548.95 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1548.95 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1548.95 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1548.95 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1548.95 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1548.95 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1548.95 s
[algebraic-graphs] OK: x <= x + y
1548.95 s
[algebraic-graphs] OK: x + y <= x * y
1548.95 s
[algebraic-graphs]
1548.95 s
[algebraic-graphs] ============ AdjacencyMap.empty ============
1548.95 s
[algebraic-graphs] OK: isEmpty empty == True
1548.95 s
[algebraic-graphs] OK: hasVertex x empty == False
1548.95 s
[algebraic-graphs] OK: vertexCount empty == 0
1548.95 s
[algebraic-graphs] OK: edgeCount empty == 0
1548.95 s
[algebraic-graphs]
1548.95 s
[algebraic-graphs] ============ AdjacencyMap.vertex ============
1548.95 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1548.95 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1548.95 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1548.95 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1548.95 s
[algebraic-graphs]
1548.95 s
[algebraic-graphs] ============ AdjacencyMap.edge ============
1548.95 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1548.95 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1548.95 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1548.95 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1548.95 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1548.95 s
[algebraic-graphs]
1548.95 s
[algebraic-graphs] ============ AdjacencyMap.overlay ============
1548.95 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1548.95 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1548.95 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1548.95 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1548.95 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1548.95 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1548.95 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1548.95 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1548.95 s
[algebraic-graphs]
1548.95 s
[algebraic-graphs] ============ AdjacencyMap.connect ============
1548.95 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1548.95 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1548.95 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1548.95 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1548.95 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1548.95 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1548.95 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1548.95 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1548.95 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1548.95 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1548.95 s
[algebraic-graphs]
1548.95 s
[algebraic-graphs] ============ AdjacencyMap.vertices ============
1548.95 s
[algebraic-graphs] OK: vertices [] == empty
1548.95 s
[algebraic-graphs] OK: vertices [x] == vertex x
1548.95 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1548.95 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1548.95 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1548.95 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1548.95 s
[algebraic-graphs]
1548.95 s
[algebraic-graphs] ============ AdjacencyMap.edges ============
1548.95 s
[algebraic-graphs] OK: edges [] == empty
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] Either Integer Double: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] Either Integer Integer: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] failure messages
1548.95 s
[aeson] modify failure: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] parserThrowError: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] parserCatchError: OK (0.06s)
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] generic
1548.95 s
[aeson] toJSON
1548.95 s
[aeson] Nullary
1548.95 s
[aeson] string: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] 2ElemArray: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] TaggedObject: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] ObjectWithSingleField: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] roundTrip
1548.95 s
[aeson] string: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] 2ElemArray: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] TaggedObject: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] ObjectWithSingleField: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] EitherTextInt
1548.95 s
[aeson] UntaggedValue: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] roundtrip: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] SomeType
1548.95 s
[aeson] 2ElemArray: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] TaggedObject: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] ObjectWithSingleField: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] roundTrip
1548.95 s
[aeson] 2ElemArray: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] TaggedObject: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] ObjectWithSingleField: OK (0.03s)
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] 2ElemArray unary: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] TaggedObject unary: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] ObjectWithSingleField unary: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] OneConstructor
1548.95 s
[aeson] default: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] Tagged: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] roundTrip
1548.95 s
[aeson] default: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.95 s
[aeson] Tagged: OK
1548.95 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] toEncoding
1548.96 s
[aeson] NullaryString: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] Nullary2ElemArray: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] NullaryTaggedObject: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] NullaryObjectWithSingleField: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] ApproxDefault: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] EitherTextInt UntaggedValue: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] SomeType2ElemArray: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] SomeType2ElemArray unary: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] SomeType2ElemArray unary agree: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] SomeTypeTaggedObject: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] SomeTypeTaggedObject unary: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] SomeTypeTaggedObject unary agree: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] SomeTypeObjectWithSingleField: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1548.96 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1548.96 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1548.96 s
[algebraic-graphs]
1548.96 s
[algebraic-graphs] ============ AdjacencyMap.overlays ============
1548.96 s
[algebraic-graphs] OK: overlays [] == empty
1548.96 s
[algebraic-graphs] OK: overlays [x] == x
1548.96 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1548.96 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1548.96 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1548.96 s
[algebraic-graphs]
1548.96 s
[algebraic-graphs] ============ AdjacencyMap.connects ============
1548.96 s
[algebraic-graphs] OK: connects [] == empty
1548.96 s
[algebraic-graphs] OK: connects [x] == x
1548.96 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1548.96 s
[algebraic-graphs] OK: connects == foldr connect empty
1548.96 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1548.96 s
[algebraic-graphs]
1548.96 s
[algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
1548.96 s
[algebraic-graphs] OK: fromAdjacencySets [] == empty
1548.96 s
[algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
1548.96 s
[algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
1548.96 s
[algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
1548.96 s
[algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
1548.96 s
[algebraic-graphs]
1548.96 s
[algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
1548.96 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1548.96 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1548.96 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1548.96 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1548.96 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1548.96 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1548.96 s
[algebraic-graphs]
1548.96 s
[algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
1548.96 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1548.96 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1548.96 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1548.96 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1548.96 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1548.96 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1548.96 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1548.96 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1548.96 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1548.96 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1548.96 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1548.96 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1548.96 s
[algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
1548.96 s
[algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
1548.96 s
[algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
1548.96 s
[algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
1548.96 s
[algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
1548.96 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1548.96 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1548.96 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1548.96 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1548.96 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1548.96 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1548.96 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1548.96 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1548.96 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1548.96 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1548.96 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1548.96 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1548.96 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1548.96 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1548.96 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1548.96 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1548.96 s
[aeson] SomeTypeObjectWithSingleField unary: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] SomeTypeObjectWithSingleField unary agree: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] SomeTypeOmitNothingFields: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] OneConstructorDefault: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] OneConstructorTagged: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] template-haskell
1548.96 s
[aeson] toJSON
1548.96 s
[aeson] Nullary
1548.96 s
[aeson] string: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] 2ElemArray: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] TaggedObject: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] ObjectWithSingleField: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] roundTrip
1548.96 s
[aeson] string: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] 2ElemArray: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] TaggedObject: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] ObjectWithSingleField: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] EitherTextInt
1548.96 s
[aeson] UntaggedValue: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] roundtrip: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] SomeType
1548.96 s
[aeson] 2ElemArray: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] TaggedObject: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] ObjectWithSingleField: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] roundTrip
1548.96 s
[aeson] 2ElemArray: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] TaggedObject: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] ObjectWithSingleField: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] 2ElemArray unary: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] TaggedObject unary: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] ObjectWithSingleField unary: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] Approx
1548.96 s
[aeson] string: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] ObjectWithSingleField: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] roundTrip
1548.96 s
[aeson] string: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] ObjectWithSingleField: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] GADT
1548.96 s
[aeson] string: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] ObjectWithSingleField: OK
1548.96 s
[aeson] +++ OK, passed 100 tests.
1548.96 s
[aeson] roundTrip
1548.97 s
[aeson] string: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] ObjectWithSingleField: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] OneConstructor
1548.97 s
[aeson] default: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] Tagged: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] roundTrip
1548.97 s
[aeson] default: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] Tagged: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] toEncoding
1548.97 s
[aeson] NullaryString: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] Nullary2ElemArray: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] NullaryTaggedObject: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] NullaryObjectWithSingleField: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1548.97 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.foldg ============
1548.97 s
[algebraic-graphs] OK: foldg empty vertex overlay connect == id
1548.97 s
[algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
1548.97 s
[algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
1548.97 s
[algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.isEmpty ============
1548.97 s
[algebraic-graphs] OK: isEmpty empty == True
1548.97 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1548.97 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1548.97 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1548.97 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.hasVertex ============
1548.97 s
[algebraic-graphs] OK: hasVertex x empty == False
1548.97 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1548.97 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.hasEdge ============
1548.97 s
[algebraic-graphs] OK: hasEdge x y empty == False
1548.97 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1548.97 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1548.97 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1548.97 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.vertexCount ============
1548.97 s
[algebraic-graphs] OK: vertexCount empty == 0
1548.97 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1548.97 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1548.97 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.edgeCount ============
1548.97 s
[algebraic-graphs] OK: edgeCount empty == 0
1548.97 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1548.97 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1548.97 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.vertexList ============
1548.97 s
[algebraic-graphs] OK: vertexList empty == []
1548.97 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1548.97 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.vertexSet ============
1548.97 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1548.97 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1548.97 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
1548.97 s
[algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
1548.97 s
[algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
1548.97 s
[algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
1548.97 s
[algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.edgeList ============
1548.97 s
[algebraic-graphs] OK: edgeList empty == []
1548.97 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1548.97 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1548.97 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1548.97 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.edgeSet ============
1548.97 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1548.97 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1548.97 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1548.97 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
1548.97 s
[algebraic-graphs] OK: adjacencyList empty == []
1548.97 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1548.97 s
[algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
1548.97 s
[algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.preSet ============
1548.97 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1548.97 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1548.97 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1548.97 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.preIntSet ============
1548.97 s
[algebraic-graphs] OK: preIntSet x empty == IntSet.empty
1548.97 s
[algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
1548.97 s
[algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
1548.97 s
[algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.postSet ============
1548.97 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1548.97 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1548.97 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1548.97 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.postIntSet ============
1548.97 s
[algebraic-graphs] OK: postIntSet x empty == IntSet.empty
1548.97 s
[algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
1548.97 s
[algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
1548.97 s
[algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.path ============
1548.97 s
[algebraic-graphs] OK: path [] == empty
1548.97 s
[algebraic-graphs] OK: path [x] == vertex x
1548.97 s
[algebraic-graphs] OK: path [x,y] == edge x y
1548.97 s
[algebraic-graphs]
1548.97 s
[algebraic-graphs] ============ AdjacencyMap.circuit ============
1548.97 s
[algebraic-graphs] OK: circuit [] == empty
1548.97 s
[algebraic-graphs] OK: circuit [x] == edge x x
1548.97 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1548.97 s
[algebraic-graphs]
1548.97 s
[aeson] ApproxUnwrap: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] ApproxDefault: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] EitherTextInt UntaggedValue: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] SomeType2ElemArray: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] SomeType2ElemArray unary: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] SomeType2ElemArray unary agree: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] SomeTypeTaggedObject: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] SomeTypeTaggedObject unary: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] SomeTypeTaggedObject unary agree: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] SomeTypeObjectWithSingleField: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] SomeTypeObjectWithSingleField unary: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] SomeTypeObjectWithSingleField unary agree: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] OneConstructorDefault: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] OneConstructorTagged: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] QuickCheck
1548.97 s
[aeson] shrink terminates
1548.97 s
[aeson] Int: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] Bool: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] Integer: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] Char: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] Text: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] (Int,Int): OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] Scientific: OK
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] Value: OK (0.44s)
1548.97 s
[aeson] +++ OK, passed 100 tests.
1548.97 s
[aeson] unit
1548.97 s
[aeson] SerializationFormatSpec
1548.97 s
[aeson] From JSON representation
1548.97 s
[aeson] Nothing: OK
1548.97 s
[aeson] Just: OK
1548.97 s
[aeson] Just Nothing: OK
1548.97 s
[aeson] Word8 3: OK
1548.97 s
[aeson] Word8 3.00: OK
1548.97 s
[aeson] Word8 3.14: OK
1548.97 s
[aeson] Word8 -1: OK
1548.97 s
[aeson] Word8 300: OK
1548.97 s
[aeson] Day -0000-02-03: OK
1548.97 s
[aeson] Day; year too short: OK
1548.97 s
[aeson] Month; year too short: OK
1548.97 s
[aeson] To/From JSON representation
1548.97 s
[aeson] Either Left: OK
1548.97 s
[aeson] Either Right: OK
1548.97 s
[aeson] Nothing: OK
1548.97 s
[aeson] Just Nothing: OK
1548.98 s
[aeson] Just: OK
1548.98 s
[aeson] Proxy Int: OK
1548.98 s
[aeson] Tagged Char Int: OK
1548.98 s
[aeson] Tagged 123 Int: OK
1548.98 s
[aeson] Const Char Int: OK
1548.98 s
[aeson] Tuple: OK
1548.98 s
[aeson] NonEmpty: OK
1548.98 s
[aeson] Seq: OK
1548.98 s
[aeson] DList: OK
1548.98 s
[aeson] (): OK
1548.98 s
[aeson] Text: OK
1548.98 s
[aeson] Lazy Text: OK
1548.98 s
[aeson] ShortText: OK
1548.98 s
[aeson] HashMap Int Int: OK
1548.98 s
[aeson] Map Int Int: OK
1548.98 s
[aeson] Map (Tagged Int Int) Int: OK
1548.98 s
[aeson] Map [Int] Int: OK
1548.98 s
[aeson] Map [Char] Int: OK
1548.98 s
[algebraic-graphs] ============ AdjacencyMap.clique ============
1548.98 s
[algebraic-graphs] OK: clique [] == empty
1548.98 s
[algebraic-graphs] OK: clique [x] == vertex x
1548.98 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1548.98 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1548.98 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1548.98 s
[algebraic-graphs]
1548.98 s
[algebraic-graphs] ============ AdjacencyMap.biclique ============
1548.98 s
[algebraic-graphs] OK: biclique [] [] == empty
1548.98 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1548.98 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1548.98 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1548.98 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1548.98 s
[algebraic-graphs]
1548.98 s
[algebraic-graphs] ============ AdjacencyMap.star ============
1548.98 s
[algebraic-graphs] OK: star x [] == vertex x
1548.98 s
[algebraic-graphs] OK: star x [y] == edge x y
1548.98 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1548.98 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1548.98 s
[algebraic-graphs]
1548.98 s
[algebraic-graphs] ============ AdjacencyMap.stars ============
1548.98 s
[algebraic-graphs] OK: stars [] == empty
1548.98 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1548.98 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1548.98 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1548.98 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1548.98 s
[algebraic-graphs] OK: stars . adjacencyList == id
1548.98 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1548.98 s
[algebraic-graphs]
1548.98 s
[algebraic-graphs] ============ AdjacencyMap.tree ============
1548.98 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1548.98 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1548.98 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1548.98 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1548.98 s
[algebraic-graphs]
1548.98 s
[algebraic-graphs] ============ AdjacencyMap.forest ============
1548.98 s
[algebraic-graphs] OK: forest [] == empty
1548.98 s
[algebraic-graphs] OK: forest [x] == tree x
1548.98 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1548.98 s
[algebraic-graphs] OK: forest == overlays . map tree
1548.98 s
[algebraic-graphs]
1548.98 s
[algebraic-graphs] ============ AdjacencyMap.removeVertex ============
1548.98 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1548.98 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1548.98 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1548.98 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1548.98 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1548.98 s
[algebraic-graphs]
1548.98 s
[algebraic-graphs] ============ AdjacencyMap.removeEdge ============
1548.98 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1548.98 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1548.98 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1548.98 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1548.98 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1548.98 s
[algebraic-graphs]
1548.98 s
[algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
1548.98 s
[algebraic-graphs] OK: replaceVertex x x == id
1548.98 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1548.98 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1548.98 s
[algebraic-graphs]
1548.98 s
[algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
1548.98 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1548.98 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1548.98 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1548.98 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1548.98 s
[algebraic-graphs]
1548.98 s
[algebraic-graphs] ============ AdjacencyMap.transpose ============
1548.98 s
[algebraic-graphs] OK: transpose empty == empty
1548.98 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1548.98 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1548.98 s
[algebraic-graphs] OK: transpose . transpose == id
1548.98 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1548.98 s
[algebraic-graphs]
1548.98 s
[algebraic-graphs] ============ AdjacencyMap.gmap ============
1548.98 s
[algebraic-graphs] OK: gmap f empty == empty
1548.98 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1548.98 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1548.98 s
[algebraic-graphs] OK: gmap id == id
1548.98 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1548.98 s
[algebraic-graphs]
1548.98 s
[algebraic-graphs] ============ AdjacencyMap.induce ============
1548.98 s
[algebraic-graphs] OK: induce (const True ) x == x
1548.98 s
[algebraic-graphs] OK: induce (const False) x == empty
1548.98 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1548.98 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1548.98 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1548.98 s
[algebraic-graphs]
1548.98 s
[algebraic-graphs] ============ AdjacencyMap.compose ============
1548.98 s
[algebraic-graphs] OK: compose empty x == empty
1548.98 s
[algebraic-graphs] OK: compose x empty == empty
1548.99 s
[algebraic-graphs] OK: compose (vertex x) y == empty
1548.99 s
[algebraic-graphs] OK: compose x (vertex y) == empty
1548.99 s
[algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
1548.99 s
[aeson] Map [I Char] Int: OK
1548.99 s
[aeson] nan :: Double: OK
1548.99 s
[aeson] +inf :: Double: OK
1548.99 s
[aeson] -inf :: Double: OK
1548.99 s
[aeson] Ordering LT: OK
1548.99 s
[aeson] Ordering EQ: OK
1548.99 s
[aeson] Ordering GT: OK
1548.99 s
[aeson] Float: OK
1548.99 s
[aeson] Pico: OK
1548.99 s
[aeson] Scientific: OK
1548.99 s
[aeson] UUID: OK
1548.99 s
[aeson] Set Int: OK
1548.99 s
[aeson] IntSet: OK
1548.99 s
[aeson] IntMap: OK
1548.99 s
[aeson] Vector: OK
1548.99 s
[aeson] HashSet Int: OK
1548.99 s
[aeson] Tree Int: OK
1548.99 s
[aeson] HashMap Float Int, NaN: OK
1548.99 s
[aeson] HashMap Float Int, Infinity: OK
1548.99 s
[aeson] HashMap Float Int, +Infinity: OK
1548.99 s
[aeson] Identity Int: OK
1548.99 s
[aeson] Solo Int: OK
1548.99 s
[aeson] Identity Char: OK
1548.99 s
[aeson] Identity String: OK
1548.99 s
[aeson] [Identity Char]: OK
1548.99 s
[aeson] Solo Char: OK
1548.99 s
[aeson] Solo String: OK
1548.99 s
[aeson] [Solo Char]: OK
1548.99 s
[aeson] Maybe Char: OK
1548.99 s
[aeson] Maybe String: OK
1548.99 s
[aeson] Maybe [Identity Char]: OK
1548.99 s
[aeson] Day; year >= 10000: OK
1548.99 s
[aeson] Day; year >= 1000: OK
1548.99 s
[aeson] Day; year > 0 && < 1000: OK
1548.99 s
[aeson] Day; year == 0: OK
1548.99 s
[aeson] Day; year < 0: OK
1548.99 s
[aeson] Day; year < -1000: OK
1548.99 s
[aeson] Month; year >= 10000: OK
1548.99 s
[aeson] Month; year >= 1000: OK
1548.99 s
[aeson] Month; year > 0 && < 1000: OK
1548.99 s
[aeson] Month; year == 0: OK
1548.99 s
[aeson] Month; year < 0: OK
1548.99 s
[aeson] Month; year < -1000: OK
1548.99 s
[aeson] Quarter; year >= 1000: OK
1548.99 s
[aeson] Quarter; year > 0 && < 1000: OK
1548.99 s
[aeson] Quarter; year == 0: OK
1548.99 s
[aeson] Quarter; year < 0: OK
1548.99 s
[aeson] Quarter; year < -1000: OK
1548.99 s
[aeson] QuarterOfYear: OK
1548.99 s
[aeson] Product I Maybe Int: OK
1548.99 s
[aeson] Product I Maybe Int: OK
1548.99 s
[aeson] Product I [] Char: OK
1548.99 s
[aeson] Sum I [] Int: InL: OK
1548.99 s
[aeson] Sum I [] Int: InR: OK
1548.99 s
[aeson] Sum I [] Char: InR: OK
1548.99 s
[aeson] Compose I I Int: OK
1548.99 s
[aeson] Compose I [] Int: OK
1548.99 s
[aeson] Compose [] I Int: OK
1548.99 s
[aeson] Compose [] [] Int: OK
1548.99 s
[aeson] Compose I I Char: OK
1548.99 s
[aeson] Compose I [] Char: OK
1548.99 s
[aeson] Compose [] I Char: OK
1548.99 s
[aeson] Compose [] [] Char: OK
1548.99 s
[aeson] Compose3 I I I Char: OK
1548.99 s
[aeson] Compose3 I I [] Char: OK
1548.99 s
[aeson] Compose3 I [] I Char: OK
1548.99 s
[aeson] Compose3 I [] [] Char: OK
1548.99 s
[aeson] Compose3 [] I I Char: OK
1548.99 s
[aeson] Compose3 [] I [] Char: OK
1548.99 s
[aeson] Compose3 [] [] I Char: OK
1548.99 s
[aeson] Compose3 [] [] [] Char: OK
1548.99 s
[aeson] Compose3' I I I Char: OK
1548.99 s
[algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
1548.99 s
[algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
1548.99 s
[algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
1548.99 s
[algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
1548.99 s
[algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
1548.99 s
[algebraic-graphs]
1548.99 s
[algebraic-graphs] ============ AdjacencyMap.closure ============
1548.99 s
[algebraic-graphs] OK: closure empty == empty
1548.99 s
[algebraic-graphs] OK: closure (vertex x) == edge x x
1548.99 s
[algebraic-graphs] OK: closure (edge x x) == edge x x
1548.99 s
[algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
1548.99 s
[algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
1548.99 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1548.99 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1548.99 s
[algebraic-graphs] OK: closure . closure == closure
1548.99 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1548.99 s
[algebraic-graphs]
1548.99 s
[algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
1548.99 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1548.99 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
1548.99 s
[algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
1548.99 s
[algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
1548.99 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1548.99 s
[algebraic-graphs]
1548.99 s
[algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
1548.99 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1548.99 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1548.99 s
[algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
1548.99 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1548.99 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1548.99 s
[algebraic-graphs]
1548.99 s
[algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
1548.99 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1548.99 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1548.99 s
[algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
1548.99 s
[algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
1548.99 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1548.99 s
[algebraic-graphs]
1548.99 s
[algebraic-graphs] ============ AdjacencyMap.box ============
1548.99 s
[algebraic-graphs] OK: box x y ~~ box y x
1548.99 s
[algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
1548.99 s
[algebraic-graphs] OK: box x (vertex ()) ~~ x
1548.99 s
[algebraic-graphs] OK: box x empty ~~ empty
1548.99 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1548.99 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1548.99 s
[algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
1548.99 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1548.99 s
[algebraic-graphs]
1548.99 s
[algebraic-graphs] ============ AdjacencyMap.bfsForest ============
1548.99 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
1548.99 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
1548.99 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
1548.99 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
1548.99 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
1548.99 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
1548.99 s
[algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
1548.99 s
[algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
1548.99 s
[algebraic-graphs] OK: bfsForest x [] == []
1548.99 s
[algebraic-graphs] OK: bfsForest empty vs == []
1548.99 s
[algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
1548.99 s
[algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
1548.99 s
[algebraic-graphs]
1548.99 s
[algebraic-graphs] ============ AdjacencyMap.bfs ============
1548.99 s
[algebraic-graphs] OK: bfs (edge 1 2) [0] == []
1548.99 s
[algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
1548.99 s
[algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
1548.99 s
[algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
1548.99 s
[algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
1548.99 s
[algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
1548.99 s
[algebraic-graphs] OK: bfs empty vs == []
1549.00 s
[algebraic-graphs] OK: bfs x [] == []
1549.00 s
[algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
1549.00 s
[algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
1549.00 s
[algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
1549.00 s
[algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
1549.00 s
[algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
1549.00 s
[aeson] Compose3' I I [] Char: OK
1549.00 s
[aeson] Compose3' I [] I Char: OK
1549.00 s
[aeson] Compose3' I [] [] Char: OK
1549.00 s
[aeson] Compose3' [] I I Char: OK
1549.00 s
[aeson] Compose3' [] I [] Char: OK
1549.00 s
[aeson] Compose3' [] [] I Char: OK
1549.00 s
[aeson] Compose3' [] [] [] Char: OK
1549.00 s
[aeson] MyEither Int String: Left: OK
1549.00 s
[aeson] MyEither Int String: Right: OK
1549.00 s
[aeson] Monoid.Dual Int: OK
1549.00 s
[aeson] Monoid.First Int: OK
1549.00 s
[aeson] Monoid.Last Int: OK
1549.00 s
[aeson] Semigroup.Min Int: OK
1549.00 s
[aeson] Semigroup.Max Int: OK
1549.00 s
[aeson] Semigroup.First Int: OK
1549.00 s
[aeson] Semigroup.Last Int: OK
1549.00 s
[aeson] Semigroup.WrappedMonoid Int: OK
1549.00 s
[aeson] SystemTime: OK
1549.00 s
[aeson] SystemTime: OK
1549.00 s
[aeson] CalendarDiffTime: OK
1549.00 s
[aeson] CalendarDiffDays: OK
1549.00 s
[aeson] DayOfWeek: OK
1549.00 s
[aeson] These: This: OK
1549.00 s
[aeson] These: That: OK
1549.00 s
[aeson] These: OK
1549.00 s
[aeson] Fix Strict.These: OK
1549.00 s
[aeson] Mu Strict.These: OK
1549.00 s
[aeson] Nu Strict.These: OK
1549.00 s
[aeson] ErrorMessages
1549.00 s
[aeson] simple: OK
1549.00 s
[aeson] generic: OK
1549.00 s
[aeson] generic: OK
1549.00 s
[aeson] camelCase
1549.00 s
[aeson] camelTo: OK
1549.00 s
[aeson] camelTo: OK
1549.00 s
[aeson] camelTo: OK
1549.00 s
[aeson] camelTo: OK
1549.00 s
[aeson] camelTo2: OK
1549.00 s
[aeson] camelTo2: OK
1549.00 s
[aeson] camelTo2: OK
1549.00 s
[aeson] camelTo2: OK
1549.00 s
[aeson] encoding
1549.00 s
[aeson] goodProducer: OK
1549.00 s
[aeson] utctime
1549.00 s
[aeson] good: OK
1549.00 s
[aeson] bad: OK (0.01s)
1549.00 s
[aeson] 2000-01-01T12:13:00
1549.00 s
[aeson] 2000-01-01 12:13:00
1549.00 s
[aeson] 2000-01-01
1549.00 s
[aeson] 2000-01-01Z
1549.00 s
[aeson] 2015-01-01T12:30:00.00+00Z
1549.00 s
[aeson] 2015-01-01T12:30:00.00+00:00Z
1549.00 s
[aeson] 2015-01-03 12:13:00.Z
1549.00 s
[aeson] 2015-01-03 12:13.000Z
1549.00 s
[aeson] 2015-01-03 23:59:61Z
1549.00 s
[aeson] 2015-01-03 12:13:00 Z (0.01s)
1549.00 s
[aeson] 2015-01-03 12:13:00 +00:00
1549.00 s
[aeson] formatError
1549.00 s
[aeson] example 1: OK
1549.00 s
[aeson] .:, .:?, .:!
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] Hashable laws
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] Object construction
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] Nullary constructors
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[aeson] -: OK
1549.00 s
[algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
1549.00 s
[algebraic-graphs]
1549.00 s
[algebraic-graphs] ============ AdjacencyMap.dfsForest ============
1549.00 s
[algebraic-graphs] OK: forest $ dfsForest empty == empty
1549.00 s
[algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
1549.00 s
[algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
1549.00 s
[algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
1549.00 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
1549.00 s
[algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
1549.00 s
[algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
1549.00 s
[algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
1549.00 s
[algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
1549.00 s
[algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
1549.00 s
[algebraic-graphs]
1549.00 s
[algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
1549.00 s
[algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
1549.00 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
1549.00 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
1549.00 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
1549.00 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
1549.00 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
1549.00 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
1549.00 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
1549.00 s
[algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
1549.00 s
[algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
1549.00 s
[algebraic-graphs] OK: dfsForestFrom x [] == []
1549.00 s
[algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
1549.00 s
[algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
1549.00 s
[algebraic-graphs]
1549.00 s
[algebraic-graphs] ============ AdjacencyMap.dfs ============
1549.00 s
[algebraic-graphs] OK: dfs empty vs == []
1549.00 s
[algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
1549.00 s
[algebraic-graphs] OK: dfs (edge 1 2) [0] == []
1549.00 s
[algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
1549.00 s
[algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
1549.00 s
[algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
1549.00 s
[algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
1549.00 s
[algebraic-graphs] OK: dfs x [] == []
1549.00 s
[algebraic-graphs]
1549.00 s
[algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
1549.00 s
[algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
1549.00 s
[algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
1549.00 s
[algebraic-graphs]
1549.00 s
[algebraic-graphs] ============ AdjacencyMap.dfs ============
1549.00 s
[algebraic-graphs] OK: reachable empty x == []
1549.00 s
[algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
1549.00 s
[algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
1549.00 s
[algebraic-graphs] OK: reachable (edge 1 2) 0 == []
1549.00 s
[algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
1549.00 s
[algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
1549.00 s
[algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
1549.00 s
[algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
1549.00 s
[algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
1549.00 s
[algebraic-graphs]
1549.00 s
[algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
1549.00 s
[algebraic-graphs]
1549.00 s
[algebraic-graphs] ============ AdjacencyMap.topSort ============
1549.00 s
[algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
1549.00 s
[algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
1549.00 s
[algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
1549.00 s
[algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
1549.00 s
[algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
1549.00 s
[algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
1549.00 s
[algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
1549.00 s
[algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
1549.00 s
[algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
1549.00 s
[algebraic-graphs] OK: topSort . vertices == Right . nub . sort
1549.00 s
[algebraic-graphs]
1549.01 s
[algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
1549.01 s
[algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
1549.01 s
[algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
1549.01 s
[algebraic-graphs] OK: isAcyclic . circuit == null
1549.01 s
[algebraic-graphs] OK: isAcyclic == isRight . topSort
1549.01 s
[algebraic-graphs]
1549.01 s
[algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [] empty == True
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] FromJSONKey
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] -: OK
1549.01 s
[aeson] optional fields
1549.01 s
[aeson] Omit optional fields (Generics)
1549.01 s
[aeson] ordinary
1549.01 s
[aeson] omitNothingFields = True
1549.01 s
[aeson] JSON should include non-optional value.: OK
1549.01 s
[aeson] JSON should not include optional value.: OK
1549.01 s
[aeson] JSON decode including non-optional value: OK
1549.01 s
[aeson] JSON decode not including optional value: OK
1549.01 s
[aeson] JSON decode including optional value: OK
1549.01 s
[aeson] JSON decode including optional value 2: OK
1549.01 s
[aeson] omitNothingFields = False
1549.01 s
[aeson] JSON should include non-optional value.: OK
1549.01 s
[aeson] JSON should include optional value.: OK
1549.01 s
[aeson] JSON decode including non-optional value: OK
1549.01 s
[aeson] JSON decode not including optional value: OK
1549.01 s
[aeson] JSON decode including optional value: OK
1549.01 s
[aeson] JSON decode including optional value 2: OK
1549.01 s
[aeson] defaultOptions
1549.01 s
[aeson] JSON should include non-optional value.: OK
1549.01 s
[aeson] JSON should include optional value.: OK
1549.01 s
[aeson] JSON decode including non-optional value: OK
1549.01 s
[aeson] JSON decode not including optional value: OK
1549.01 s
[aeson] JSON decode including optional value: OK
1549.01 s
[aeson] JSON decode including optional value 2: OK
1549.01 s
[aeson] higher
1549.01 s
[aeson] omitNothingFields = True, higher
1549.01 s
[aeson] JSON should include non-optional value.: OK
1549.01 s
[aeson] JSON should not include optional value.: OK
1549.01 s
[aeson] JSON decode including non-optional value: OK
1549.01 s
[aeson] JSON decode not including optional value: OK
1549.01 s
[aeson] JSON decode including optional value: OK
1549.01 s
[aeson] JSON decode including optional value 2: OK
1549.01 s
[aeson] omitNothingFields = False, higher
1549.01 s
[aeson] JSON should include non-optional value.: OK
1549.01 s
[aeson] JSON should include optional value.: OK
1549.01 s
[aeson] JSON decode including non-optional value: OK
1549.01 s
[aeson] JSON decode not including optional value: OK
1549.01 s
[aeson] JSON decode including optional value: OK
1549.01 s
[aeson] JSON decode including optional value 2: OK
1549.01 s
[aeson] defaultOptions, higher
1549.01 s
[aeson] JSON should include non-optional value.: OK
1549.01 s
[aeson] JSON should include optional value.: OK
1549.01 s
[aeson] JSON decode including non-optional value: OK
1549.01 s
[aeson] JSON decode not including optional value: OK
1549.01 s
[aeson] JSON decode including optional value: OK
1549.01 s
[aeson] JSON decode including optional value 2: OK
1549.01 s
[aeson] Omit optional fields (TH)
1549.01 s
[aeson] ordinary
1549.01 s
[aeson] omitNothingFields = True
1549.01 s
[aeson] JSON should include non-optional value.: OK
1549.01 s
[aeson] JSON should not include optional value.: OK
1549.01 s
[aeson] JSON decode including non-optional value: OK
1549.01 s
[aeson] JSON decode not including optional value: OK
1549.01 s
[aeson] JSON decode including optional value: OK
1549.01 s
[aeson] JSON decode including optional value 2: OK
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
1549.01 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
1549.01 s
[algebraic-graphs]
1549.01 s
[algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
1549.01 s
[algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
1549.01 s
[algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
1549.01 s
[algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
1549.01 s
[algebraic-graphs] OK: isTopSortOf [] empty == True
1549.01 s
[algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
1549.01 s
[algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
1549.01 s
[algebraic-graphs]
1549.01 s
[algebraic-graphs] ============ AdjacencyMap.induceJust ============
1549.01 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1549.01 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1549.01 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1549.01 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1549.01 s
[algebraic-graphs]
1549.01 s
[algebraic-graphs] ============ AdjacencyMap.scc ============
1549.01 s
[algebraic-graphs] OK: scc empty == empty
1549.01 s
[algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
1549.01 s
[algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
1549.01 s
[algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
1549.01 s
[algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
1549.01 s
[algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
1549.01 s
[algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
1549.01 s
[algebraic-graphs] OK: isAcyclic . scc == const True
1549.01 s
[algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
1549.01 s
[algebraic-graphs] OK: scc g == KL.scc g
1549.02 s
[algebraic-graphs]
1549.02 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
1549.02 s
[algebraic-graphs] OK: 0 == rightVertex 0
1549.02 s
[algebraic-graphs] OK: swap 1 == leftVertex 1
1549.02 s
[algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
1549.02 s
[algebraic-graphs] OK: swap 1 * 2 == edge 1 2
1549.02 s
[algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
1549.02 s
[algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
1549.02 s
[algebraic-graphs]
1549.02 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
1549.02 s
[algebraic-graphs] OK: show empty == "empty"
1549.02 s
[algebraic-graphs] OK: show 1 == "rightVertex 1"
1549.02 s
[algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
1549.02 s
[algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
1549.02 s
[algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
1549.02 s
[algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
1549.02 s
[algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
1549.02 s
[algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
1549.02 s
[algebraic-graphs]
1549.02 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
1549.02 s
[algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
1549.02 s
[algebraic-graphs]
1549.02 s
[algebraic-graphs] OK: x + y == y + x
1549.02 s
[algebraic-graphs] OK: x + (y + z) == (x + y) + z
1549.02 s
[algebraic-graphs] OK: x * empty == x
1549.02 s
[algebraic-graphs] OK: empty * x == x
1549.02 s
[algebraic-graphs] OK: x * y == y * x
1549.02 s
[algebraic-graphs] OK: x * (y * z) == (x * y) * z
1549.02 s
[algebraic-graphs] OK: x * (y + z) == x * y + x * z
1549.02 s
[algebraic-graphs] OK: (x + y) * z == x * z + y * z
1549.02 s
[algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
1549.02 s
[algebraic-graphs] OK: x + empty == x
1549.02 s
[algebraic-graphs] OK: empty + x == x
1549.02 s
[algebraic-graphs] OK: x + x == x
1549.02 s
[algebraic-graphs] OK: x * y + x + y == x * y
1549.02 s
[algebraic-graphs] OK: x * x * x == x * x
1549.02 s
[algebraic-graphs]
1549.02 s
[algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
1549.02 s
[algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
1549.02 s
[algebraic-graphs]
1549.02 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
1549.02 s
[algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
1549.02 s
[algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
1549.02 s
[algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
1549.02 s
[algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
1549.02 s
[algebraic-graphs]
1549.02 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
1549.02 s
[algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
1549.02 s
[algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
1549.02 s
[aeson] omitNothingFields = False
1549.02 s
[aeson] JSON should include non-optional value.: OK
1549.02 s
[aeson] JSON should include optional value.: OK
1549.02 s
[aeson] JSON decode including non-optional value: OK
1549.02 s
[aeson] JSON decode not including optional value: OK
1549.02 s
[aeson] JSON decode including optional value: OK
1549.02 s
[aeson] JSON decode including optional value 2: OK
1549.02 s
[aeson] defaultOptions
1549.02 s
[aeson] JSON should include non-optional value.: OK
1549.02 s
[aeson] JSON should include optional value.: OK
1549.02 s
[aeson] JSON decode including non-optional value: OK
1549.02 s
[aeson] JSON decode not including optional value: OK
1549.02 s
[aeson] JSON decode including optional value: OK
1549.02 s
[aeson] JSON decode including optional value 2: OK
1549.02 s
[aeson] higher
1549.02 s
[aeson] omitNothingFields = True, higher
1549.02 s
[aeson] JSON should include non-optional value.: OK
1549.02 s
[aeson] JSON should not include optional value.: OK
1549.02 s
[aeson] JSON decode including non-optional value: OK
1549.02 s
[aeson] JSON decode not including optional value: OK
1549.02 s
[aeson] JSON decode including optional value: OK
1549.02 s
[aeson] JSON decode including optional value 2: OK
1549.02 s
[aeson] omitNothingFields = False, higher
1549.02 s
[aeson] JSON should include non-optional value.: OK
1549.02 s
[aeson] JSON should include optional value.: OK
1549.02 s
[aeson] JSON decode including non-optional value: OK
1549.02 s
[aeson] JSON decode not including optional value: OK
1549.02 s
[aeson] JSON decode including optional value: OK
1549.02 s
[aeson] JSON decode including optional value 2: OK
1549.02 s
[aeson] defaultOptions, higher
1549.02 s
[aeson] JSON should include non-optional value.: OK
1549.02 s
[aeson] JSON should include optional value.: OK
1549.02 s
[aeson] JSON decode including non-optional value: OK
1549.02 s
[aeson] JSON decode not including optional value: OK
1549.02 s
[aeson] JSON decode including optional value: OK
1549.02 s
[aeson] JSON decode including optional value 2: OK
1549.02 s
[aeson] Omit optional fields (Manual)
1549.02 s
[aeson] ordinary
1549.02 s
[aeson] omitNothingFields = True
1549.02 s
[aeson] JSON should include non-optional value.: OK
1549.02 s
[aeson] JSON should not include optional value.: OK
1549.02 s
[aeson] JSON decode including non-optional value: OK
1549.02 s
[aeson] JSON decode not including optional value: OK
1549.02 s
[aeson] JSON decode including optional value: OK
1549.02 s
[aeson] JSON decode including optional value 2: OK
1549.02 s
[aeson] omitNothingFields = False
1549.02 s
[aeson] JSON should include non-optional value.: OK
1549.02 s
[aeson] JSON should include optional value.: OK
1549.02 s
[aeson] JSON decode including non-optional value: OK
1549.02 s
[aeson] JSON decode not including optional value: OK
1549.02 s
[aeson] JSON decode including optional value: OK
1549.02 s
[aeson] JSON decode including optional value 2: OK
1549.02 s
[aeson] defaultOptions
1549.02 s
[aeson] JSON should include non-optional value.: OK
1549.02 s
[aeson] JSON should include optional value.: OK
1549.02 s
[aeson] JSON decode including non-optional value: OK
1549.02 s
[aeson] JSON decode not including optional value: OK
1549.02 s
[aeson] JSON decode including optional value: OK
1549.02 s
[aeson] JSON decode including optional value 2: OK
1549.02 s
[aeson] higher
1549.02 s
[aeson] omitNothingFields = True, higher
1549.02 s
[aeson] JSON should include non-optional value.: OK
1549.02 s
[aeson] JSON should not include optional value.: OK
1549.02 s
[aeson] JSON decode including non-optional value: OK
1549.02 s
[aeson] JSON decode not including optional value: OK
1549.02 s
[aeson] JSON decode including optional value: OK
1549.02 s
[aeson] JSON decode including optional value 2: OK
1549.02 s
[aeson] omitNothingFields = False, higher
1549.02 s
[aeson] JSON should include non-optional value.: OK
1549.02 s
[aeson] JSON should include optional value.: OK
1549.02 s
[aeson] JSON decode including non-optional value: OK
1549.02 s
[aeson] JSON decode not including optional value: OK
1549.02 s
[aeson] JSON decode including optional value: OK
1549.02 s
[aeson] JSON decode including optional value 2: OK
1549.02 s
[aeson] defaultOptions, higher
1549.02 s
[aeson] JSON should include non-optional value.: OK
1549.02 s
[aeson] JSON should include optional value.: OK
1549.02 s
[aeson] JSON decode including non-optional value: OK
1549.02 s
[algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
1549.02 s
[algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
1549.02 s
[algebraic-graphs]
1549.02 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
1549.02 s
[algebraic-graphs] OK: isEmpty empty == True
1549.02 s
[algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
1549.02 s
[algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
1549.02 s
[algebraic-graphs] OK: hasVertex x empty == False
1549.02 s
[algebraic-graphs]
1549.02 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
1549.02 s
[algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
1549.02 s
[algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
1549.02 s
[algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
1549.02 s
[algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
1549.02 s
[algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
1549.02 s
[algebraic-graphs]
1549.02 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
1549.02 s
[algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
1549.02 s
[algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
1549.02 s
[algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
1549.02 s
[algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
1549.02 s
[algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
1549.02 s
[algebraic-graphs]
1549.02 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
1549.02 s
[algebraic-graphs] OK: vertex . Left == leftVertex
1549.02 s
[algebraic-graphs] OK: vertex . Right == rightVertex
1549.02 s
[algebraic-graphs]
1549.02 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
1549.02 s
[algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
1549.02 s
[algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
1549.02 s
[algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
1549.02 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1549.02 s
[algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
1549.02 s
[algebraic-graphs]
1549.02 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
1549.02 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1549.02 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1549.02 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1549.02 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1549.02 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1549.02 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1549.02 s
[algebraic-graphs]
1549.02 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
1549.03 s
[algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
1549.03 s
[algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
1549.03 s
[algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
1549.03 s
[algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
1549.03 s
[algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
1549.03 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1549.03 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1549.03 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1549.03 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1549.03 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1549.03 s
[algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
1549.03 s
[algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
1549.03 s
[algebraic-graphs]
1549.03 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
1549.03 s
[algebraic-graphs] OK: vertices [] [] == empty
1549.03 s
[algebraic-graphs] OK: vertices [x] [] == leftVertex x
1549.03 s
[algebraic-graphs] OK: vertices [] [x] == rightVertex x
1549.03 s
[algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
1549.03 s
[algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
1549.03 s
[algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
1549.03 s
[algebraic-graphs]
1549.03 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
1549.03 s
[algebraic-graphs] OK: edges [] == empty
1549.03 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1549.03 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1549.03 s
[algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
1549.03 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1549.03 s
[algebraic-graphs]
1549.03 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
1549.03 s
[algebraic-graphs] OK: overlays [] == empty
1549.03 s
[algebraic-graphs] OK: overlays [x] == x
1549.03 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1549.03 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1549.03 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1549.03 s
[algebraic-graphs]
1549.03 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
1549.03 s
[algebraic-graphs] OK: connects [] == empty
1549.03 s
[algebraic-graphs] OK: connects [x] == x
1549.03 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1549.03 s
[algebraic-graphs] OK: connects == foldr connect empty
1549.03 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1549.03 s
[algebraic-graphs]
1549.03 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
1549.03 s
[aeson] JSON decode not including optional value: OK
1549.03 s
[aeson] JSON decode including optional value: OK
1549.03 s
[aeson] JSON decode including optional value 2: OK
1549.03 s
[aeson] Type-directed optional fields Proof of Concept
1549.03 s
[aeson] toJSON
1549.03 s
[aeson] x is not omitted when Nothing: OK
1549.03 s
[aeson] y is omitted when Nothing: OK
1549.03 s
[aeson] z is omitted when Nothing: OK
1549.03 s
[aeson] parseJSON
1549.03 s
[aeson] x can be null: OK
1549.03 s
[aeson] x cannot be omitted: OK
1549.03 s
[aeson] y can be omitted: OK
1549.03 s
[aeson] y cannot be null: OK
1549.03 s
[aeson] z can be null: OK
1549.03 s
[aeson] z can be omitted: OK
1549.03 s
[aeson] PR #455: OK
1549.03 s
[aeson] Unescape string (PR #477): OK (1.45s)
1549.03 s
[aeson] Show Options: OK
1549.03 s
[aeson] SingleMaybeField
1549.03 s
[aeson] generic: OK
1549.03 s
[aeson] th: OK
1549.03 s
[aeson] withEmbeddedJSON: OK
1549.03 s
[aeson] SingleFieldCon: OK
1549.03 s
[aeson] UnknownFields
1549.03 s
[aeson] unary-unknown-th: OK
1549.03 s
[aeson] unary-unknown-generic: OK
1549.03 s
[aeson] unary-unknown-tag-th: OK
1549.03 s
[aeson] unary-unknown-tag-generic: OK
1549.03 s
[aeson] unary-explicit-tag-th: OK
1549.03 s
[aeson] unary-explicit-tag-generic: OK
1549.03 s
[aeson] sum-tag-th: OK
1549.03 s
[aeson] sum-tag-generic: OK
1549.03 s
[aeson] sum-unknown-in-branch-th: OK
1549.03 s
[aeson] sum-unknown-in-branch-generic: OK
1549.03 s
[aeson] sum-unknown-th: OK
1549.03 s
[aeson] sum-unknown-generic: OK
1549.03 s
[aeson] unary-tagged-th: OK
1549.03 s
[aeson] unary-tagged-generic: OK
1549.03 s
[aeson] unary-tagged-notag-th: OK
1549.03 s
[aeson] unary-tagged-notag-generic: OK
1549.03 s
[aeson] unary-tagged-unknown-th: OK
1549.03 s
[aeson] unary-tagged-unknown-generic: OK
1549.03 s
[aeson] Ratio with denominator 0: OK
1549.03 s
[aeson] Rational parses number: OK
1549.03 s
[aeson] Big rational: OK
1549.03 s
[aeson] Small rational: OK
1549.03 s
[aeson] Big scientific exponent: OK
1549.03 s
[aeson] Big integer decoding: OK
1549.03 s
[aeson] Big natural decoding: OK
1549.03 s
[aeson] Big integer key decoding: OK
1549.03 s
[aeson] QQ.Simple
1549.03 s
[aeson] example: OK
1549.03 s
[aeson] MonadFix
1549.03 s
[aeson] Example1a: OK
1549.03 s
[aeson] Example2a: OK
1549.03 s
[aeson] Example3a: OK
1549.03 s
[aeson] Example4a: OK
1549.03 s
[aeson] Example1b: OK
1549.03 s
[aeson] Example2b: OK
1549.03 s
[aeson] Example3b: OK
1549.03 s
[aeson] Example4b: OK
1549.03 s
[aeson] Issue #351
1549.03 s
[aeson] -: OK
1549.03 s
[aeson] -: OK
1549.03 s
[aeson] -: OK
1549.03 s
[aeson] issue571: OK
1549.03 s
[aeson] issue687: OK
1549.03 s
[aeson] issue967: OK
1549.03 s
[aeson] KeyMap.insertWith: OK
1549.03 s
[aeson] omitNothingFields Note: OK
1549.03 s
[aeson] JSONTestSuite
1549.03 s
[aeson] i_number_double_huge_neg_exp.json
1549.03 s
[aeson] decode: OK
1549.03 s
[aeson] decode via tokens: OK
1549.03 s
[aeson] tokens bs: OK
1549.03 s
[aeson] tokens lbs: OK
1549.03 s
[aeson] tokens text: OK
1549.03 s
[aeson] i_number_huge_exp.json
1549.03 s
[aeson] decode: OK
1549.03 s
[algebraic-graphs] OK: swap empty == empty
1549.03 s
[algebraic-graphs] OK: swap . leftVertex == rightVertex
1549.03 s
[algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
1549.03 s
[algebraic-graphs] OK: swap (edge x y) == edge y x
1549.03 s
[algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
1549.03 s
[algebraic-graphs] OK: swap . swap == id
1549.03 s
[algebraic-graphs]
1549.03 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
1549.03 s
[algebraic-graphs] OK: toBipartite empty == empty
1549.03 s
[algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
1549.03 s
[algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
1549.03 s
[algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
1549.03 s
[algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
1549.03 s
[algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
1549.03 s
[algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
1549.03 s
[algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
1549.03 s
[algebraic-graphs] OK: toBipartite . fromBipartite == id
1549.03 s
[algebraic-graphs]
1549.03 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
1549.03 s
[algebraic-graphs] OK: toBipartiteWith f empty == empty
1549.03 s
[algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
1549.03 s
[algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
1549.03 s
[algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
1549.03 s
[algebraic-graphs] OK: toBipartiteWith id == toBipartite
1549.03 s
[algebraic-graphs]
1549.03 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
1549.03 s
[algebraic-graphs] OK: fromBipartite empty == empty
1549.03 s
[algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
1549.03 s
[algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
1549.03 s
[algebraic-graphs]
1549.03 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
1549.03 s
[algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
1549.03 s
[algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
1549.03 s
[algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
1549.03 s
[algebraic-graphs]
1549.03 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
1549.03 s
[algebraic-graphs] OK: isEmpty empty == True
1549.03 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1549.03 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1549.03 s
[algebraic-graphs] OK: isEmpty == (==) empty
1549.03 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
1549.04 s
[algebraic-graphs] OK: hasLeftVertex x empty == False
1549.04 s
[algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
1549.04 s
[algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
1549.04 s
[algebraic-graphs] OK: hasRightVertex x empty == False
1549.04 s
[algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
1549.04 s
[algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
1549.04 s
[algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
1549.04 s
[algebraic-graphs] OK: hasVertex . Right == hasRightVertex
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
1549.04 s
[algebraic-graphs] OK: hasEdge x y empty == False
1549.04 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1549.04 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1549.04 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
1549.04 s
[algebraic-graphs] OK: leftVertexCount empty == 0
1549.04 s
[algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
1549.04 s
[algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
1549.04 s
[algebraic-graphs] OK: leftVertexCount (edge x y) == 1
1549.04 s
[algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
1549.04 s
[algebraic-graphs] OK: rightVertexCount empty == 0
1549.04 s
[algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
1549.04 s
[algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
1549.04 s
[algebraic-graphs] OK: rightVertexCount (edge x y) == 1
1549.04 s
[algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
1549.04 s
[algebraic-graphs] OK: vertexCount empty == 0
1549.04 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1549.04 s
[algebraic-graphs] OK: vertexCount (edge x y) == 2
1549.04 s
[algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
1549.04 s
[algebraic-graphs] OK: edgeCount empty == 0
1549.04 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1549.04 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1549.04 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
1549.04 s
[algebraic-graphs] OK: leftVertexList empty == []
1549.04 s
[algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
1549.04 s
[algebraic-graphs] OK: leftVertexList (rightVertex x) == []
1549.04 s
[algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
1549.04 s
[algebraic-graphs] OK: rightVertexList empty == []
1549.04 s
[algebraic-graphs] OK: rightVertexList (leftVertex x) == []
1549.04 s
[aeson] decode via tokens: OK
1549.04 s
[aeson] tokens bs: OK
1549.04 s
[aeson] tokens lbs: OK
1549.04 s
[aeson] tokens text: OK
1549.04 s
[aeson] i_number_neg_int_huge_exp.json
1549.04 s
[aeson] decode: OK
1549.04 s
[aeson] decode via tokens: OK
1549.04 s
[aeson] tokens bs: OK
1549.04 s
[aeson] tokens lbs: OK
1549.04 s
[aeson] tokens text: OK
1549.04 s
[aeson] i_number_pos_double_huge_exp.json
1549.04 s
[aeson] decode: OK
1549.04 s
[aeson] decode via tokens: OK
1549.04 s
[aeson] tokens bs: OK
1549.04 s
[aeson] tokens lbs: OK
1549.04 s
[aeson] tokens text: OK
1549.04 s
[aeson] i_number_real_neg_overflow.json
1549.04 s
[aeson] decode: OK
1549.04 s
[aeson] decode via tokens: OK
1549.04 s
[aeson] tokens bs: OK
1549.04 s
[aeson] tokens lbs: OK (0.01s)
1549.04 s
[aeson] tokens text: OK
1549.04 s
[aeson] i_number_real_pos_overflow.json
1549.04 s
[aeson] decode: OK
1549.04 s
[aeson] decode via tokens: OK
1549.04 s
[aeson] tokens bs: OK
1549.04 s
[aeson] tokens lbs: OK
1549.04 s
[aeson] tokens text: OK
1549.04 s
[aeson] i_number_real_underflow.json
1549.04 s
[aeson] decode: OK
1549.04 s
[aeson] decode via tokens: OK
1549.04 s
[aeson] tokens bs: OK
1549.04 s
[aeson] tokens lbs: OK
1549.04 s
[aeson] tokens text: OK
1549.04 s
[aeson] i_number_too_big_neg_int.json
1549.04 s
[aeson] decode: OK
1549.04 s
[aeson] decode via tokens: OK
1549.04 s
[aeson] tokens bs: OK
1549.04 s
[aeson] tokens lbs: OK
1549.04 s
[aeson] tokens text: OK
1549.04 s
[aeson] i_number_too_big_pos_int.json
1549.04 s
[aeson] decode: OK
1549.04 s
[aeson] decode via tokens: OK
1549.04 s
[aeson] tokens bs: OK
1549.04 s
[aeson] tokens lbs: OK
1549.04 s
[aeson] tokens text: OK
1549.04 s
[aeson] i_number_very_big_negative_int.json
1549.04 s
[aeson] decode: OK
1549.04 s
[aeson] decode via tokens: OK
1549.04 s
[aeson] tokens bs: OK
1549.04 s
[aeson] tokens lbs: OK
1549.04 s
[aeson] tokens text: OK
1549.04 s
[aeson] i_object_key_lone_2nd_surrogate.json
1549.04 s
[aeson] decode: OK
1549.04 s
[aeson] tokens bs: OK
1549.04 s
[aeson] tokens lbs: OK
1549.04 s
[aeson] tokens text: OK
1549.04 s
[aeson] Golden file did not exist; created
1549.04 s
[aeson] i_string_1st_surrogate_but_2nd_missing.json
1549.04 s
[aeson] decode: OK
1549.04 s
[aeson] tokens bs: OK
1549.04 s
[aeson] tokens lbs: OK
1549.04 s
[aeson] tokens text: OK
1549.04 s
[aeson] Golden file did not exist; created
1549.04 s
[aeson] i_string_1st_valid_surrogate_2nd_invalid.json
1549.04 s
[aeson] decode: OK
1549.04 s
[aeson] tokens bs: OK
1549.04 s
[aeson] tokens lbs: OK
1549.04 s
[aeson] tokens text: OK
1549.04 s
[aeson] Golden file did not exist; created
1549.04 s
[aeson] i_string_UTF-16LE_with_BOM.json
1549.04 s
[aeson] decode: OK
1549.04 s
[aeson] tokens bs: OK
1549.04 s
[aeson] tokens lbs: OK
1549.04 s
[aeson] tokens text: OK
1549.04 s
[aeson] Golden file did not exist; created
1549.04 s
[aeson] i_string_UTF-8_invalid_sequence.json
1549.04 s
[algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
1549.04 s
[algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
1549.04 s
[algebraic-graphs] OK: vertexList empty == []
1549.04 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1549.04 s
[algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
1549.04 s
[algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
1549.04 s
[algebraic-graphs] OK: edgeList empty == []
1549.04 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1549.04 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1549.04 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
1549.04 s
[algebraic-graphs] OK: leftVertexSet empty == Set.empty
1549.04 s
[algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
1549.04 s
[algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
1549.04 s
[algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
1549.04 s
[algebraic-graphs] OK: rightVertexSet empty == Set.empty
1549.04 s
[algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
1549.04 s
[algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
1549.04 s
[algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
1549.04 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1549.04 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1549.04 s
[algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
1549.04 s
[algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
1549.04 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1549.04 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1549.04 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1549.04 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
1549.04 s
[algebraic-graphs] OK: leftAdjacencyList empty == []
1549.04 s
[algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
1549.04 s
[algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
1549.04 s
[algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
1549.04 s
[algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
1549.04 s
[algebraic-graphs] OK: rightAdjacencyList empty == []
1549.04 s
[algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
1549.04 s
[algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
1549.04 s
[algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
1549.04 s
[algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
1549.04 s
[algebraic-graphs]
1549.04 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
1549.04 s
[algebraic-graphs] OK: evenList [] == Nil
1549.04 s
[algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
1549.04 s
[algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
1549.05 s
[algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
1549.05 s
[algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
1549.05 s
[algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
1549.05 s
[algebraic-graphs] OK: path Nil == empty
1549.05 s
[algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
1549.05 s
[algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
1549.05 s
[algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
1549.05 s
[algebraic-graphs] OK: circuit [] == empty
1549.05 s
[algebraic-graphs] OK: circuit [(x,y)] == edge x y
1549.05 s
[algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
1549.05 s
[algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
1549.05 s
[algebraic-graphs] OK: biclique [] [] == empty
1549.05 s
[algebraic-graphs] OK: biclique xs [] == vertices xs []
1549.05 s
[algebraic-graphs] OK: biclique [] ys == vertices [] ys
1549.05 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
1549.05 s
[algebraic-graphs] OK: star x [] == leftVertex x
1549.05 s
[algebraic-graphs] OK: star x [y] == edge x y
1549.05 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1549.05 s
[algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
1549.05 s
[algebraic-graphs] OK: stars [] == empty
1549.05 s
[algebraic-graphs] OK: stars [(x, [])] == leftVertex x
1549.05 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1549.05 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.05 s
[aeson] tokens lbs: OK
1549.05 s
[aeson] tokens text: OK
1549.05 s
[aeson] Golden file did not exist; created
1549.05 s
[aeson] i_string_UTF8_surrogate_U+D800.json
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.05 s
[aeson] tokens lbs: OK
1549.05 s
[aeson] tokens text: OK
1549.05 s
[aeson] Golden file did not exist; created
1549.05 s
[aeson] i_string_incomplete_surrogate_and_escape_valid.json
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.05 s
[aeson] tokens lbs: OK
1549.05 s
[aeson] tokens text: OK
1549.05 s
[aeson] Golden file did not exist; created
1549.05 s
[aeson] i_string_incomplete_surrogate_pair.json
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.05 s
[aeson] tokens lbs: OK
1549.05 s
[aeson] tokens text: OK
1549.05 s
[aeson] Golden file did not exist; created
1549.05 s
[aeson] i_string_incomplete_surrogates_escape_valid.json
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.05 s
[aeson] tokens lbs: OK
1549.05 s
[aeson] tokens text: OK
1549.05 s
[aeson] Golden file did not exist; created
1549.05 s
[aeson] i_string_invalid_lonely_surrogate.json
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.05 s
[aeson] tokens lbs: OK
1549.05 s
[aeson] tokens text: OK
1549.05 s
[aeson] Golden file did not exist; created
1549.05 s
[aeson] i_string_invalid_surrogate.json
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.05 s
[aeson] tokens lbs: OK
1549.05 s
[aeson] tokens text: OK
1549.05 s
[aeson] Golden file did not exist; created
1549.05 s
[aeson] i_string_invalid_utf-8.json
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.05 s
[aeson] tokens lbs: OK
1549.05 s
[aeson] tokens text: OK
1549.05 s
[aeson] Golden file did not exist; created
1549.05 s
[aeson] i_string_inverted_surrogates_U+1D11E.json
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.05 s
[aeson] tokens lbs: OK
1549.05 s
[aeson] tokens text: OK
1549.05 s
[aeson] Golden file did not exist; created
1549.05 s
[aeson] i_string_iso_latin_1.json
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.05 s
[aeson] tokens lbs: OK
1549.05 s
[aeson] tokens text: OK
1549.05 s
[aeson] Golden file did not exist; created
1549.05 s
[aeson] i_string_lone_second_surrogate.json
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.05 s
[aeson] tokens lbs: OK
1549.05 s
[aeson] tokens text: OK
1549.05 s
[aeson] Golden file did not exist; created
1549.05 s
[aeson] i_string_lone_utf8_continuation_byte.json
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.05 s
[aeson] tokens lbs: OK
1549.05 s
[aeson] tokens text: OK
1549.05 s
[aeson] Golden file did not exist; created
1549.05 s
[aeson] i_string_not_in_unicode_range.json
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.05 s
[aeson] tokens lbs: OK
1549.05 s
[aeson] tokens text: OK
1549.05 s
[aeson] Golden file did not exist; created
1549.05 s
[aeson] i_string_overlong_sequence_2_bytes.json
1549.05 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1549.05 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1549.05 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
1549.05 s
[algebraic-graphs] OK: mesh xs [] == empty
1549.05 s
[algebraic-graphs] OK: mesh [] ys == empty
1549.05 s
[algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
1549.05 s
[algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
1549.05 s
[algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
1549.05 s
[algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
1549.05 s
[algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
1549.05 s
[algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
1549.05 s
[algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
1549.05 s
[algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
1549.05 s
[algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
1549.05 s
[algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
1549.05 s
[algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
1549.05 s
[algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
1549.05 s
[algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
1549.05 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
1549.05 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1549.05 s
[algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
1549.05 s
[algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
1549.05 s
[algebraic-graphs] OK: bimap f g empty == empty
1549.05 s
[algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
1549.05 s
[algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
1549.05 s
[algebraic-graphs] OK: bimap id id == id
1549.05 s
[algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
1549.05 s
[algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] OK: box x y ~~ box y x
1549.05 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1549.05 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1549.05 s
[algebraic-graphs] OK: box x (leftVertex ()) ~~ x
1549.05 s
[algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
1549.05 s
[algebraic-graphs] OK: box x empty ~~ empty
1549.05 s
[algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
1549.05 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
1549.05 s
[algebraic-graphs] OK: consistent empty == True
1549.05 s
[algebraic-graphs] OK: consistent (vertex x) == True
1549.05 s
[algebraic-graphs] OK: consistent (edge x y) == True
1549.05 s
[algebraic-graphs] OK: consistent (edges x) == True
1549.05 s
[algebraic-graphs] OK: consistent (toBipartite x) == True
1549.05 s
[algebraic-graphs] OK: consistent (swap x) == True
1549.05 s
[algebraic-graphs] OK: consistent (circuit xs) == True
1549.05 s
[algebraic-graphs] OK: consistent (biclique xs ys) == True
1549.05 s
[algebraic-graphs]
1549.05 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
1549.05 s
[algebraic-graphs] OK: detectParts empty == Right empty
1549.05 s
[algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
1549.05 s
[algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
1549.05 s
[algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
1549.05 s
[algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
1549.05 s
[algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
1549.05 s
[algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
1549.05 s
[algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
1549.05 s
[algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
1549.05 s
[algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
1549.05 s
[algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
1549.05 s
[algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
1549.05 s
[algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
1549.05 s
[algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.05 s
[aeson] tokens lbs: OK
1549.05 s
[aeson] tokens text: OK
1549.05 s
[aeson] Golden file did not exist; created
1549.05 s
[aeson] i_string_overlong_sequence_6_bytes.json
1549.05 s
[aeson] decode: OK
1549.05 s
[aeson] tokens bs: OK
1549.06 s
[aeson] tokens lbs: OK
1549.06 s
[aeson] tokens text: OK
1549.06 s
[aeson] Golden file did not exist; created
1549.06 s
[aeson] i_string_overlong_sequence_6_bytes_null.json
1549.06 s
[aeson] decode: OK
1549.06 s
[aeson] tokens bs: OK
1549.06 s
[aeson] tokens lbs: OK
1549.06 s
[aeson] tokens text: OK
1549.06 s
[aeson] Golden file did not exist; created
1549.06 s
[aeson] i_string_truncated-utf-8.json
1549.06 s
[aeson] decode: OK
1549.06 s
[aeson] tokens bs: OK
1549.06 s
[aeson] tokens lbs: OK
1549.06 s
[aeson] tokens text: OK
1549.06 s
[aeson] Golden file did not exist; created
1549.06 s
[aeson] i_string_utf16BE_no_BOM.json
1549.06 s
[aeson] decode: OK
1549.06 s
[aeson] tokens bs: OK
1549.06 s
[aeson] tokens lbs: OK
1549.06 s
[aeson] tokens text: OK
1549.06 s
[aeson] Golden file did not exist; created
1549.06 s
[aeson] i_string_utf16LE_no_BOM.json
1549.06 s
[aeson] decode: OK
1549.06 s
[aeson] tokens bs: OK
1549.06 s
[aeson] tokens lbs: OK
1549.06 s
[aeson] tokens text: OK
1549.06 s
[aeson] Golden file did not exist; created
1549.06 s
[aeson] i_structure_500_nested_arrays.json
1549.06 s
[aeson] decode: OK
1549.06 s
[aeson] decode via tokens: OK
1549.06 s
[aeson] tokens bs: OK
1549.06 s
[aeson] tokens lbs: OK
1549.06 s
[aeson] tokens text: OK
1549.06 s
[aeson] i_structure_UTF-8_BOM_empty_object.json
1549.06 s
[aeson] decode: OK
1549.06 s
[aeson] tokens bs: OK
1549.06 s
[aeson] tokens lbs: OK
1549.06 s
[aeson] tokens text: OK
1549.06 s
[aeson] Golden file did not exist; created
1549.06 s
[aeson] n_array_1_true_without_comma.json
1549.06 s
[aeson] decode: OK
1549.06 s
[aeson] tokens bs: OK
1549.06 s
[aeson] tokens lbs: OK
1549.06 s
[aeson] tokens text: OK
1549.06 s
[aeson] Golden file did not exist; created
1549.06 s
[aeson] n_array_a_invalid_utf8.json
1549.06 s
[aeson] decode: OK
1549.06 s
[aeson] tokens bs: OK
1549.06 s
[aeson] tokens lbs: OK
1549.06 s
[aeson] tokens text: OK
1549.06 s
[aeson] Golden file did not exist; created
1549.06 s
[aeson] n_array_colon_instead_of_comma.json
1549.06 s
[aeson] decode: OK
1549.06 s
[aeson] tokens bs: OK
1549.06 s
[aeson] tokens lbs: OK
1549.06 s
[aeson] tokens text: OK
1549.06 s
[aeson] Golden file did not exist; created
1549.06 s
[aeson] n_array_comma_after_close.json
1549.06 s
[aeson] decode: OK
1549.06 s
[aeson] tokens bs: OK
1549.06 s
[aeson] tokens lbs: OK
1549.06 s
[aeson] tokens text: OK
1549.06 s
[aeson] Golden file did not exist; created
1549.06 s
[aeson] n_array_comma_and_number.json
1549.06 s
[aeson] decode: OK
1549.06 s
[aeson] tokens bs: OK
1549.06 s
[aeson] tokens lbs: OK
1549.06 s
[aeson] tokens text: OK
1549.06 s
[aeson] Golden file did not exist; created
1549.06 s
[aeson] n_array_double_comma.json
1549.06 s
[aeson] decode: OK
1549.06 s
[algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
1549.06 s
[algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
1549.06 s
[algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
1549.06 s
[algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
1549.06 s
[algebraic-graphs]
1549.06 s
[algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
1549.06 s
[algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
1549.06 s
[algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
1549.06 s
[algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
1549.06 s
[algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
1549.06 s
[algebraic-graphs]
1549.06 s
[algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
1549.06 s
[algebraic-graphs] OK: show (matching []) == "matching []"
1549.06 s
[algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
1549.06 s
[algebraic-graphs]
1549.06 s
[algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
1549.06 s
[algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
1549.06 s
[algebraic-graphs]
1549.06 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
1549.06 s
[algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
1549.06 s
[algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
1549.06 s
[algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
1549.06 s
[algebraic-graphs]
1549.06 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
1549.06 s
[algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
1549.06 s
[algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
1549.06 s
[algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
1549.06 s
[algebraic-graphs]
1549.06 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
1549.06 s
[algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
1549.06 s
[algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
1549.06 s
[algebraic-graphs]
1549.06 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
1549.06 s
[algebraic-graphs] OK: isMatchingOf (matching []) x == True
1549.07 s
[algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
1549.07 s
[algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
1549.07 s
[algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
1549.07 s
[algebraic-graphs] OK: matchingSize (matching []) == 0
1549.07 s
[algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
1549.07 s
[algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
1549.07 s
[algebraic-graphs] OK: matchingSize (matching xs) <= length xs
1549.07 s
[algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
1549.07 s
[algebraic-graphs] OK: maxMatching empty == matching []
1549.07 s
[algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
1549.07 s
[algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
1549.07 s
[algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
1549.07 s
[algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
1549.07 s
[algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
1549.07 s
[algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
1549.07 s
[algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
1549.07 s
[algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
1549.07 s
[algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
1549.07 s
[algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
1549.07 s
[algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
1549.07 s
[algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_double_extra_comma.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_extra_close.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_extra_comma.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_incomplete.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_incomplete_invalid_value.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_inner_array_no_comma.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_invalid_utf8.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_items_separated_by_semicolon.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_just_comma.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_just_minus.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_missing_value.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_newlines_unclosed.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_number_and_comma.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
1549.07 s
[algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
1549.07 s
[algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
1549.07 s
[algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
1549.07 s
[algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
1549.07 s
[algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
1549.07 s
[algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
1549.07 s
[algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
1549.07 s
[algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
1549.07 s
[algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
1549.07 s
[algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
1549.07 s
[algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
1549.07 s
[algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
1549.07 s
[algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
1549.07 s
[algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
1549.07 s
[algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
1549.07 s
[algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
1549.07 s
[algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
1549.07 s
[algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
1549.07 s
[algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
1549.07 s
[algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
1549.07 s
[algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
1549.07 s
[algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
1549.07 s
[algebraic-graphs] OK: consistentMatching (matching xs) == True
1549.07 s
[algebraic-graphs] OK: consistentMatching (maxMatching x) == True
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Export.Eq ============
1549.07 s
[algebraic-graphs] OK: mempty /= literal ""
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Export.Ord ============
1549.07 s
[algebraic-graphs] OK: mempty < literal ""
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Export.isEmpty ============
1549.07 s
[algebraic-graphs] OK: isEmpty mempty == True
1549.07 s
[algebraic-graphs] OK: isEmpty (literal "") == False
1549.07 s
[algebraic-graphs] OK: isEmpty x == (x == mempty)
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Export.literal ============
1549.07 s
[algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
1549.07 s
[algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
1549.07 s
[algebraic-graphs] OK: render . literal == id
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Export.render ============
1549.07 s
[algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
1549.07 s
[algebraic-graphs] OK: render mempty == mempty
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Export.<+> ============
1549.07 s
[algebraic-graphs] OK: x <+> mempty == x
1549.07 s
[algebraic-graphs] OK: mempty <+> x == x
1549.07 s
[algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
1549.07 s
[algebraic-graphs] OK: "name" <+> "surname" == "name surname"
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Export.brackets ============
1549.07 s
[algebraic-graphs] OK: brackets "i" == "[i]"
1549.07 s
[algebraic-graphs] OK: brackets mempty == "[]"
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Export.doubleQuotes ============
1549.07 s
[algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
1549.07 s
[algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Export.indent ============
1549.07 s
[algebraic-graphs] OK: indent 0 == id
1549.07 s
[algebraic-graphs] OK: indent 1 mempty == " "
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Export.unlines ============
1549.07 s
[algebraic-graphs] OK: unlines [] == mempty
1549.07 s
[algebraic-graphs] OK: unlines [mempty] == "\n"
1549.07 s
[algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Export.export ============
1549.07 s
[algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] ============ Export.Dot.export ============
1549.07 s
[algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
1549.07 s
[algebraic-graphs]
1549.07 s
[algebraic-graphs] =========== Export.Dot.attributeQuoting ============
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_number_and_several_commas.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_spaces_vertical_tab_formfeed.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.07 s
[aeson] n_array_star_inside.json
1549.07 s
[aeson] decode: OK
1549.07 s
[aeson] tokens bs: OK
1549.07 s
[aeson] tokens lbs: OK
1549.07 s
[aeson] tokens text: OK
1549.07 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_array_unclosed.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_array_unclosed_trailing_comma.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_array_unclosed_with_new_lines.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_array_unclosed_with_object_inside.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_incomplete_false.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_incomplete_null.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_incomplete_true.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_multidigit_number_then_00.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_number_++.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_number_+1.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_number_+Inf.json
1549.08 s
[aeson] decode: OK
1549.08 s
[algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Export.Dot.exportAsIs ============
1549.08 s
[algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Export.Dot.exportViaShow ============
1549.08 s
[algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Graph ============
1549.08 s
[algebraic-graphs] OK: Axioms of graphs
1549.08 s
[algebraic-graphs] OK: Theorems of graphs
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Graph.Ord ============
1549.08 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1549.08 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1549.08 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1549.08 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1549.08 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1549.08 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1549.08 s
[algebraic-graphs] OK: x <= x + y
1549.08 s
[algebraic-graphs] OK: x + y <= x * y
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Graph.empty ============
1549.08 s
[algebraic-graphs] OK: isEmpty empty == True
1549.08 s
[algebraic-graphs] OK: hasVertex x empty == False
1549.08 s
[algebraic-graphs] OK: vertexCount empty == 0
1549.08 s
[algebraic-graphs] OK: edgeCount empty == 0
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Graph.vertex ============
1549.08 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1549.08 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1549.08 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1549.08 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Graph.edge ============
1549.08 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1549.08 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1549.08 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1549.08 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1549.08 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Graph.overlay ============
1549.08 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1549.08 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1549.08 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1549.08 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1549.08 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1549.08 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1549.08 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1549.08 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Graph.connect ============
1549.08 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1549.08 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1549.08 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1549.08 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1549.08 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1549.08 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1549.08 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1549.08 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1549.08 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1549.08 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Graph.vertices ============
1549.08 s
[algebraic-graphs] OK: vertices [] == empty
1549.08 s
[algebraic-graphs] OK: vertices [x] == vertex x
1549.08 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1549.08 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1549.08 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1549.08 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Graph.edges ============
1549.08 s
[algebraic-graphs] OK: edges [] == empty
1549.08 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1549.08 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1549.08 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Graph.overlays ============
1549.08 s
[algebraic-graphs] OK: overlays [] == empty
1549.08 s
[algebraic-graphs] OK: overlays [x] == x
1549.08 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1549.08 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1549.08 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Graph.connects ============
1549.08 s
[algebraic-graphs] OK: connects [] == empty
1549.08 s
[algebraic-graphs] OK: connects [x] == x
1549.08 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1549.08 s
[algebraic-graphs] OK: connects == foldr connect empty
1549.08 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Graph.isSubgraphOf ============
1549.08 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1549.08 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1549.08 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1549.08 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1549.08 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1549.08 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1549.08 s
[algebraic-graphs]
1549.08 s
[algebraic-graphs] ============ Graph.toGraph et al. ============
1549.08 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1549.08 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1549.08 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1549.08 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1549.08 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1549.08 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1549.08 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1549.08 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1549.08 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_number_-01.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_number_-NaN.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_number_0_capital_E+.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_number_0_capital_E.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_number_0e+.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_number_0e.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.08 s
[aeson] Golden file did not exist; created
1549.08 s
[aeson] n_number_1_000.json
1549.08 s
[aeson] decode: OK
1549.08 s
[aeson] tokens bs: OK
1549.08 s
[aeson] tokens lbs: OK
1549.08 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_1eE2.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_Inf.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_NaN.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_U+FF11_fullwidth_digit_one.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_expression.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_hex_1_digit.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_hex_2_digits.json
1549.09 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1549.09 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1549.09 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1549.09 s
[algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
1549.09 s
[algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
1549.09 s
[algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
1549.09 s
[algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
1549.09 s
[algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
1549.09 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1549.09 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1549.09 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1549.09 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1549.09 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1549.09 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1549.09 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1549.09 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1549.09 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1549.09 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1549.09 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1549.09 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1549.09 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1549.09 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1549.09 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1549.09 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1549.09 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1549.09 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1549.09 s
[algebraic-graphs]
1549.09 s
[algebraic-graphs] ============ Graph.foldg ============
1549.09 s
[algebraic-graphs] OK: foldg empty vertex overlay connect == id
1549.09 s
[algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
1549.09 s
[algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
1549.09 s
[algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
1549.09 s
[algebraic-graphs]
1549.09 s
[algebraic-graphs] ============ Graph.isEmpty ============
1549.09 s
[algebraic-graphs] OK: isEmpty empty == True
1549.09 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1549.09 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1549.09 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1549.09 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1549.09 s
[algebraic-graphs]
1549.09 s
[algebraic-graphs] ============ Graph.hasVertex ============
1549.09 s
[algebraic-graphs] OK: hasVertex x empty == False
1549.09 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1549.09 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1549.09 s
[algebraic-graphs]
1549.09 s
[algebraic-graphs] ============ Graph.hasEdge ============
1549.09 s
[algebraic-graphs] OK: hasEdge x y empty == False
1549.09 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1549.09 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1549.09 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1549.09 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1549.09 s
[algebraic-graphs]
1549.09 s
[algebraic-graphs] ============ Graph.vertexCount ============
1549.09 s
[algebraic-graphs] OK: vertexCount empty == 0
1549.09 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1549.09 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1549.09 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1549.09 s
[algebraic-graphs]
1549.09 s
[algebraic-graphs] ============ Graph.edgeCount ============
1549.09 s
[algebraic-graphs] OK: edgeCount empty == 0
1549.09 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1549.09 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1549.09 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1549.09 s
[algebraic-graphs]
1549.09 s
[algebraic-graphs] ============ Graph.vertexList ============
1549.09 s
[algebraic-graphs] OK: vertexList empty == []
1549.09 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1549.09 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1549.09 s
[algebraic-graphs]
1549.09 s
[algebraic-graphs] ============ Graph.vertexSet ============
1549.09 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1549.09 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1549.09 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1549.09 s
[algebraic-graphs]
1549.09 s
[algebraic-graphs] ============ Graph.vertexIntSet ============
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_infinity.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_invalid+-.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_invalid-negative-real.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK (0.01s)
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_invalid-utf-8-in-bigger-int.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_invalid-utf-8-in-exponent.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_invalid-utf-8-in-int.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK (0.01s)
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_minus_infinity.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_minus_sign_with_trailing_garbage.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_minus_space_1.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_neg_int_starting_with_zero.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_neg_real_without_int_part.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_neg_with_garbage_at_end.json
1549.09 s
[aeson] decode: OK
1549.09 s
[aeson] tokens bs: OK
1549.09 s
[aeson] tokens lbs: OK (0.01s)
1549.09 s
[aeson] tokens text: OK
1549.09 s
[aeson] Golden file did not exist; created
1549.09 s
[aeson] n_number_real_garbage_after_e.json
1549.09 s
[algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
1549.09 s
[algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
1549.09 s
[algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
1549.09 s
[algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.edgeList ============
1549.10 s
[algebraic-graphs] OK: edgeList empty == []
1549.10 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1549.10 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1549.10 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1549.10 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.edgeSet ============
1549.10 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1549.10 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1549.10 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1549.10 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.adjacencyList ============
1549.10 s
[algebraic-graphs] OK: adjacencyList empty == []
1549.10 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1549.10 s
[algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
1549.10 s
[algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.preSet ============
1549.10 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1549.10 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1549.10 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1549.10 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.preIntSet ============
1549.10 s
[algebraic-graphs] OK: preIntSet x empty == IntSet.empty
1549.10 s
[algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
1549.10 s
[algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
1549.10 s
[algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.postSet ============
1549.10 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1549.10 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1549.10 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1549.10 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.postIntSet ============
1549.10 s
[algebraic-graphs] OK: postIntSet x empty == IntSet.empty
1549.10 s
[algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
1549.10 s
[algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
1549.10 s
[algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.size ============
1549.10 s
[algebraic-graphs] OK: size empty == 1
1549.10 s
[algebraic-graphs] OK: size (vertex x) == 1
1549.10 s
[algebraic-graphs] OK: size (overlay x y) == size x + size y
1549.10 s
[algebraic-graphs] OK: size (connect x y) == size x + size y
1549.10 s
[algebraic-graphs] OK: size x >= 1
1549.10 s
[algebraic-graphs] OK: size x >= vertexCount x
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.path ============
1549.10 s
[algebraic-graphs] OK: path [] == empty
1549.10 s
[algebraic-graphs] OK: path [x] == vertex x
1549.10 s
[algebraic-graphs] OK: path [x,y] == edge x y
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.circuit ============
1549.10 s
[algebraic-graphs] OK: circuit [] == empty
1549.10 s
[algebraic-graphs] OK: circuit [x] == edge x x
1549.10 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.clique ============
1549.10 s
[algebraic-graphs] OK: clique [] == empty
1549.10 s
[algebraic-graphs] OK: clique [x] == vertex x
1549.10 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1549.10 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1549.10 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.biclique ============
1549.10 s
[algebraic-graphs] OK: biclique [] [] == empty
1549.10 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1549.10 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1549.10 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1549.10 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.star ============
1549.10 s
[algebraic-graphs] OK: star x [] == vertex x
1549.10 s
[algebraic-graphs] OK: star x [y] == edge x y
1549.10 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1549.10 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.stars ============
1549.10 s
[algebraic-graphs] OK: stars [] == empty
1549.10 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1549.10 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1549.10 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1549.10 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1549.10 s
[algebraic-graphs] OK: stars . adjacencyList == id
1549.10 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.tree ============
1549.10 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1549.10 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1549.10 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1549.10 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.forest ============
1549.10 s
[algebraic-graphs] OK: forest [] == empty
1549.10 s
[algebraic-graphs] OK: forest [x] == tree x
1549.10 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1549.10 s
[algebraic-graphs] OK: forest == overlays . map tree
1549.10 s
[algebraic-graphs]
1549.10 s
[algebraic-graphs] ============ Graph.removeVertex ============
1549.10 s
[aeson] decode: OK
1549.10 s
[aeson] tokens bs: OK (0.01s)
1549.10 s
[aeson] tokens lbs: OK
1549.10 s
[aeson] tokens text: OK
1549.10 s
[aeson] Golden file did not exist; created
1549.10 s
[aeson] n_number_real_with_invalid_utf8_after_e.json
1549.10 s
[aeson] decode: OK
1549.10 s
[aeson] tokens bs: OK
1549.10 s
[aeson] tokens lbs: OK
1549.10 s
[aeson] tokens text: OK
1549.10 s
[aeson] Golden file did not exist; created
1549.10 s
[aeson] n_number_real_without_fractional_part.json
1549.10 s
[aeson] decode: OK
1549.10 s
[aeson] tokens bs: OK
1549.10 s
[aeson] tokens lbs: OK (0.01s)
1549.10 s
[aeson] tokens text: OK
1549.10 s
[aeson] Golden file did not exist; created
1549.10 s
[aeson] n_number_starting_with_dot.json
1549.10 s
[aeson] decode: OK
1549.10 s
[aeson] tokens bs: OK
1549.10 s
[aeson] tokens lbs: OK (0.02s)
1549.10 s
[aeson] tokens text: OK
1549.10 s
[aeson] Golden file did not exist; created
1549.10 s
[aeson] n_number_with_alpha.json
1549.10 s
[aeson] decode: OK
1549.10 s
[aeson] tokens bs: OK
1549.10 s
[aeson] tokens lbs: OK
1549.10 s
[aeson] tokens text: OK
1549.10 s
[aeson] Golden file did not exist; created
1549.10 s
[aeson] n_number_with_alpha_char.json
1549.10 s
[aeson] decode: OK
1549.10 s
[aeson] tokens bs: OK
1549.10 s
[aeson] tokens lbs: OK
1549.10 s
[aeson] tokens text: OK
1549.10 s
[aeson] Golden file did not exist; created
1549.10 s
[aeson] n_number_with_leading_zero.json
1549.10 s
[aeson] decode: OK
1549.10 s
[aeson] tokens bs: OK
1549.10 s
[aeson] tokens lbs: OK
1549.10 s
[aeson] tokens text: OK
1549.10 s
[aeson] Golden file did not exist; created
1549.10 s
[aeson] n_object_bad_value.json
1549.10 s
[aeson] decode: OK
1549.10 s
[aeson] tokens bs: OK
1549.10 s
[aeson] tokens lbs: OK
1549.10 s
[aeson] tokens text: OK
1549.10 s
[aeson] Golden file did not exist; created
1549.10 s
[aeson] n_object_bracket_key.json
1549.10 s
[aeson] decode: OK
1549.10 s
[aeson] tokens bs: OK
1549.10 s
[aeson] tokens lbs: OK
1549.10 s
[aeson] tokens text: OK
1549.10 s
[aeson] Golden file did not exist; created
1549.11 s
[aeson] n_object_comma_instead_of_colon.json
1549.11 s
[aeson] decode: OK
1549.11 s
[aeson] tokens bs: OK
1549.11 s
[aeson] tokens lbs: OK
1549.11 s
[aeson] tokens text: OK
1549.11 s
[aeson] Golden file did not exist; created
1549.11 s
[aeson] n_object_double_colon.json
1549.11 s
[aeson] decode: OK
1549.11 s
[aeson] tokens bs: OK
1549.11 s
[aeson] tokens lbs: OK
1549.11 s
[aeson] tokens text: OK
1549.11 s
[aeson] Golden file did not exist; created
1549.11 s
[aeson] n_object_emoji.json
1549.11 s
[aeson] decode: OK
1549.11 s
[aeson] tokens bs: OK
1549.11 s
[aeson] tokens lbs: OK
1549.11 s
[aeson] tokens text: OK (0.16s)
1549.11 s
[aeson] Golden file did not exist; created
1549.11 s
[aeson] n_object_garbage_at_end.json
1549.11 s
[aeson] decode: OK
1549.11 s
[aeson] tokens bs: OK
1549.11 s
[aeson] tokens lbs: OK (0.01s)
1549.11 s
[aeson] tokens text: OK
1549.11 s
[aeson] Golden file did not exist; created
1549.11 s
[aeson] n_object_key_with_single_quotes.json
1549.11 s
[aeson] decode: OK
1549.11 s
[aeson] tokens bs: OK
1549.11 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1549.11 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1549.11 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1549.11 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1549.11 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1549.11 s
[algebraic-graphs]
1549.11 s
[algebraic-graphs] ============ Graph.removeEdge ============
1549.11 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1549.11 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1549.11 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1549.11 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1549.11 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1549.11 s
[algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
1549.11 s
[algebraic-graphs]
1549.11 s
[algebraic-graphs] ============ Graph.replaceVertex ============
1549.11 s
[algebraic-graphs] OK: replaceVertex x x == id
1549.11 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1549.11 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1549.11 s
[algebraic-graphs]
1549.11 s
[algebraic-graphs] ============ Graph.mergeVertices ============
1549.11 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1549.11 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1549.11 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1549.11 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1549.11 s
[algebraic-graphs]
1549.11 s
[algebraic-graphs] ============ Graph.transpose ============
1549.11 s
[algebraic-graphs] OK: transpose empty == empty
1549.11 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1549.11 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1549.11 s
[algebraic-graphs] OK: transpose . transpose == id
1549.11 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1549.11 s
[algebraic-graphs]
1549.11 s
[algebraic-graphs] ============ Graph.gmap ============
1549.11 s
[algebraic-graphs] OK: gmap f empty == empty
1549.11 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1549.11 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1549.11 s
[algebraic-graphs] OK: gmap id == id
1549.11 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1549.11 s
[algebraic-graphs]
1549.11 s
[algebraic-graphs] ============ Graph.induce ============
1549.11 s
[algebraic-graphs] OK: induce (const True ) x == x
1549.11 s
[algebraic-graphs] OK: induce (const False) x == empty
1549.11 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1549.11 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1549.11 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1549.11 s
[algebraic-graphs]
1549.11 s
[algebraic-graphs] ============ Graph.induceJust ============
1549.11 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1549.11 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1549.11 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1549.11 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1549.11 s
[algebraic-graphs]
1549.11 s
[algebraic-graphs] ============ Graph.compose ============
1549.11 s
[algebraic-graphs] OK: compose empty x == empty
1549.11 s
[algebraic-graphs] OK: compose x empty == empty
1549.11 s
[algebraic-graphs] OK: compose (vertex x) y == empty
1549.11 s
[algebraic-graphs] OK: compose x (vertex y) == empty
1549.11 s
[algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
1549.11 s
[algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
1549.11 s
[algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
1549.11 s
[algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
1549.11 s
[algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
1549.11 s
[algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
1549.11 s
[algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
1549.11 s
[algebraic-graphs]
1549.11 s
[algebraic-graphs] ============ Graph.(===) ============
1549.11 s
[algebraic-graphs] OK: x === x == True
1549.11 s
[algebraic-graphs] OK: x === x + empty == False
1549.11 s
[algebraic-graphs] OK: x + y === x + y == True
1549.11 s
[algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
1549.11 s
[algebraic-graphs] OK: x + y === x * y == False
1549.11 s
[algebraic-graphs]
1549.11 s
[algebraic-graphs] ============ Graph.mesh ============
1549.11 s
[algebraic-graphs] OK: mesh xs [] == empty
1549.11 s
[algebraic-graphs] OK: mesh [] ys == empty
1549.11 s
[algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
1549.11 s
[algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
1549.11 s
[algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
1549.11 s
[algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
1549.11 s
[algebraic-graphs]
1549.11 s
[algebraic-graphs] ============ Graph.torus ============
1549.11 s
[algebraic-graphs] OK: torus xs [] == empty
1549.11 s
[algebraic-graphs] OK: torus [] ys == empty
1549.11 s
[algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
1549.11 s
[algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
1549.12 s
[algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
1549.12 s
[algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Graph.deBruijn ============
1549.12 s
[algebraic-graphs] OK: deBruijn 0 xs == edge [] []
1549.12 s
[algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
1549.12 s
[algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
1549.12 s
[algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
1549.12 s
[algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
1549.12 s
[aeson] tokens lbs: OK
1549.12 s
[aeson] tokens text: OK
1549.12 s
[aeson] Golden file did not exist; created
1549.12 s
[aeson] n_object_lone_continuation_byte_in_key_and_trailing_comma.json
1549.12 s
[aeson] decode: OK
1549.12 s
[aeson] tokens bs: OK
1549.12 s
[aeson] tokens lbs: OK
1549.12 s
[aeson] tokens text: OK
1549.12 s
[aeson] Golden file did not exist; created
1549.12 s
[aeson] n_object_missing_colon.json
1549.12 s
[aeson] decode: OK
1549.12 s
[aeson] tokens bs: OK
1549.12 s
[aeson] tokens lbs: OK
1549.12 s
[aeson] tokens text: OK
1549.12 s
[aeson] Golden file did not exist; created
1549.12 s
[aeson] n_object_missing_key.json
1549.12 s
[aeson] decode: OK
1549.12 s
[aeson] tokens bs: OK
1549.12 s
[aeson] tokens lbs: OK (0.02s)
1549.12 s
[aeson] tokens text: OK
1549.12 s
[aeson] Golden file did not exist; created
1549.12 s
[aeson] n_object_missing_semicolon.json
1549.12 s
[aeson] decode: OK
1549.12 s
[aeson] tokens bs: OK
1549.12 s
[aeson] tokens lbs: OK
1549.12 s
[aeson] tokens text: OK
1549.12 s
[aeson] Golden file did not exist; created
1549.12 s
[aeson] n_object_missing_value.json
1549.12 s
[aeson] decode: OK
1549.12 s
[aeson] tokens bs: OK
1549.12 s
[aeson] tokens lbs: OK
1549.12 s
[aeson] tokens text: OK
1549.12 s
[aeson] Golden file did not exist; created
1549.12 s
[aeson] n_object_no-colon.json
1549.12 s
[aeson] decode: OK
1549.12 s
[aeson] tokens bs: OK
1549.12 s
[aeson] tokens lbs: OK
1549.12 s
[aeson] tokens text: OK
1549.12 s
[aeson] Golden file did not exist; created
1549.12 s
[aeson] n_object_non_string_key.json
1549.12 s
[aeson] decode: OK
1549.12 s
[aeson] tokens bs: OK
1549.12 s
[aeson] tokens lbs: OK
1549.12 s
[aeson] tokens text: OK
1549.12 s
[aeson] Golden file did not exist; created
1549.12 s
[aeson] n_object_non_string_key_but_huge_number_instead.json
1549.12 s
[aeson] decode: OK
1549.12 s
[aeson] tokens bs: OK
1549.12 s
[aeson] tokens lbs: OK
1549.12 s
[aeson] tokens text: OK
1549.12 s
[aeson] Golden file did not exist; created
1549.12 s
[aeson] n_object_repeated_null_null.json
1549.12 s
[aeson] decode: OK
1549.12 s
[aeson] tokens bs: OK
1549.12 s
[aeson] tokens lbs: OK
1549.12 s
[aeson] tokens text: OK
1549.12 s
[aeson] Golden file did not exist; created
1549.12 s
[aeson] n_object_several_trailing_commas.json
1549.12 s
[aeson] decode: OK
1549.12 s
[aeson] tokens bs: OK
1549.12 s
[aeson] tokens lbs: OK
1549.12 s
[aeson] tokens text: OK
1549.12 s
[aeson] Golden file did not exist; created
1549.12 s
[aeson] n_object_single_quote.json
1549.12 s
[aeson] decode: OK
1549.12 s
[aeson] tokens bs: OK
1549.12 s
[aeson] tokens lbs: OK
1549.12 s
[aeson] tokens text: OK
1549.12 s
[aeson] Golden file did not exist; created
1549.12 s
[aeson] n_object_trailing_comma.json
1549.12 s
[aeson] decode: OK
1549.12 s
[aeson] tokens bs: OK
1549.12 s
[aeson] tokens lbs: OK
1549.12 s
[aeson] tokens text: OK
1549.12 s
[aeson] Golden file did not exist; created
1549.12 s
[aeson] n_object_trailing_comment.json
1549.12 s
[aeson] decode: OK
1549.12 s
[aeson] tokens bs: OK
1549.12 s
[aeson] tokens lbs: OK
1549.12 s
[algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
1549.12 s
[algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
1549.12 s
[algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Graph.splitVertex ============
1549.12 s
[algebraic-graphs] OK: splitVertex x [] == removeVertex x
1549.12 s
[algebraic-graphs] OK: splitVertex x [x] == id
1549.12 s
[algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
1549.12 s
[algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Graph.bind ============
1549.12 s
[algebraic-graphs] OK: bind empty f == empty
1549.12 s
[algebraic-graphs] OK: bind (vertex x) f == f x
1549.12 s
[algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
1549.12 s
[algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
1549.12 s
[algebraic-graphs] OK: bind x (const empty) == empty
1549.12 s
[algebraic-graphs] OK: bind x vertex == x
1549.12 s
[algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Graph.simplify ============
1549.12 s
[algebraic-graphs] OK: simplify == id
1549.12 s
[algebraic-graphs] OK: size (simplify x) <= size x
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Graph.box ============
1549.12 s
[algebraic-graphs] OK: box x y ~~ box y x
1549.12 s
[algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
1549.12 s
[algebraic-graphs] OK: box x (vertex ()) ~~ x
1549.12 s
[algebraic-graphs] OK: box x empty ~~ empty
1549.12 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1549.12 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1549.12 s
[algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
1549.12 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Graph.sparsify ============
1549.12 s
[algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
1549.12 s
[algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
1549.12 s
[algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
1549.12 s
[algebraic-graphs] OK: size (sparsify x) <= 3 * size x
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Graph.sparsifyKL ============
1549.12 s
[algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
1549.12 s
[algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
1549.12 s
[algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Graph.context ============
1549.12 s
[algebraic-graphs] OK: context (const False) x == Nothing
1549.12 s
[algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
1549.12 s
[algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
1549.12 s
[algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
1549.12 s
[algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Graph.buildg ============
1549.12 s
[algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
1549.12 s
[algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
1549.12 s
[algebraic-graphs] OK: buildg (\e v o c -> o (foldg e v o c x) (foldg e v o c y)) == overlay x y
1549.12 s
[algebraic-graphs] OK: buildg (\e v o c -> c (foldg e v o c x) (foldg e v o c y)) == connect x y
1549.12 s
[algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
1549.12 s
[algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Internal.List ============
1549.12 s
[algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Graph.Label ============
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Any: instances ============
1549.12 s
[algebraic-graphs] OK: Semiring
1549.12 s
[algebraic-graphs] OK: StarSemiring
1549.12 s
[algebraic-graphs] OK: Dioid
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Distance Int: instances ============
1549.12 s
[algebraic-graphs] OK: Semiring
1549.12 s
[algebraic-graphs] OK: StarSemiring
1549.12 s
[algebraic-graphs] OK: Dioid
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Capacity Int: instances ============
1549.12 s
[algebraic-graphs] OK: Semiring
1549.12 s
[algebraic-graphs] OK: StarSemiring
1549.12 s
[algebraic-graphs] OK: Dioid
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Minimum (Path Int): instances ============
1549.12 s
[algebraic-graphs] OK: LeftNearRing
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ PowerSet (Path Int): instances ============
1549.12 s
[algebraic-graphs] OK: Semiring
1549.12 s
[algebraic-graphs] OK: Dioid
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Count Int: instances ============
1549.12 s
[algebraic-graphs] OK: Semiring
1549.12 s
[algebraic-graphs] OK: StarSemiring
1549.12 s
[algebraic-graphs]
1549.12 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
1549.12 s
[algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
1549.12 s
[algebraic-graphs] OK: empty
1549.12 s
[algebraic-graphs] OK: vertex
1549.12 s
[algebraic-graphs] OK: edge
1549.12 s
[algebraic-graphs] OK: overlay
1549.12 s
[algebraic-graphs] OK: connect
1549.12 s
[algebraic-graphs] OK: vertices
1549.12 s
[algebraic-graphs] OK: edges
1549.12 s
[algebraic-graphs] OK: overlays
1549.12 s
[algebraic-graphs] OK: fromAdjacencyMaps
1549.12 s
[algebraic-graphs] OK: removeVertex
1549.12 s
[algebraic-graphs] OK: removeEdge
1549.12 s
[algebraic-graphs] OK: replaceVertex
1549.12 s
[algebraic-graphs] OK: replaceEdge
1549.12 s
[algebraic-graphs] OK: transpose
1549.12 s
[algebraic-graphs] OK: gmap
1549.12 s
[algebraic-graphs] OK: emap
1549.12 s
[algebraic-graphs] OK: induce
1549.12 s
[algebraic-graphs] OK: closure
1549.12 s
[algebraic-graphs] OK: reflexiveClosure
1549.12 s
[algebraic-graphs] OK: symmetricClosure
1549.12 s
[algebraic-graphs] OK: transitiveClosure
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
1549.13 s
[algebraic-graphs] OK: isEmpty empty == True
1549.13 s
[algebraic-graphs] OK: hasVertex x empty == False
1549.13 s
[algebraic-graphs] OK: vertexCount empty == 0
1549.13 s
[algebraic-graphs] OK: edgeCount empty == 0
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
1549.13 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1549.13 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1549.13 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1549.13 s
[aeson] tokens text: OK
1549.13 s
[aeson] Golden file did not exist; created
1549.13 s
[aeson] n_object_trailing_comment_open.json
1549.13 s
[aeson] decode: OK
1549.13 s
[aeson] tokens bs: OK
1549.13 s
[aeson] tokens lbs: OK
1549.13 s
[aeson] tokens text: OK
1549.13 s
[aeson] Golden file did not exist; created
1549.13 s
[aeson] n_object_trailing_comment_slash_open.json
1549.13 s
[aeson] decode: OK
1549.13 s
[aeson] tokens bs: OK
1549.13 s
[aeson] tokens lbs: OK
1549.13 s
[aeson] tokens text: OK
1549.13 s
[aeson] Golden file did not exist; created
1549.13 s
[aeson] n_object_trailing_comment_slash_open_incomplete.json
1549.13 s
[aeson] decode: OK
1549.13 s
[aeson] tokens bs: OK
1549.13 s
[aeson] tokens lbs: OK
1549.13 s
[aeson] tokens text: OK
1549.13 s
[aeson] Golden file did not exist; created
1549.13 s
[aeson] n_object_two_commas_in_a_row.json
1549.13 s
[aeson] decode: OK
1549.13 s
[aeson] tokens bs: OK
1549.13 s
[aeson] tokens lbs: OK
1549.13 s
[aeson] tokens text: OK
1549.13 s
[aeson] Golden file did not exist; created
1549.13 s
[aeson] n_object_unquoted_key.json
1549.13 s
[aeson] decode: OK
1549.13 s
[aeson] tokens bs: OK
1549.13 s
[aeson] tokens lbs: OK
1549.13 s
[aeson] tokens text: OK
1549.13 s
[aeson] Golden file did not exist; created
1549.13 s
[aeson] n_object_unterminated-value.json
1549.13 s
[aeson] decode: OK
1549.13 s
[aeson] tokens bs: OK
1549.13 s
[aeson] tokens lbs: OK
1549.13 s
[aeson] tokens text: OK
1549.13 s
[aeson] Golden file did not exist; created
1549.13 s
[aeson] n_object_with_single_string.json
1549.13 s
[aeson] decode: OK
1549.13 s
[aeson] tokens bs: OK
1549.13 s
[aeson] tokens lbs: OK
1549.13 s
[aeson] tokens text: OK
1549.13 s
[aeson] Golden file did not exist; created
1549.13 s
[aeson] n_object_with_trailing_garbage.json
1549.13 s
[aeson] decode: OK
1549.13 s
[aeson] tokens bs: OK
1549.13 s
[aeson] tokens lbs: OK
1549.13 s
[aeson] tokens text: OK
1549.13 s
[aeson] Golden file did not exist; created
1549.13 s
[aeson] n_single_space.json
1549.13 s
[aeson] decode: OK
1549.13 s
[aeson] tokens bs: OK
1549.13 s
[aeson] tokens lbs: OK
1549.13 s
[aeson] tokens text: OK
1549.13 s
[aeson] Golden file did not exist; created
1549.13 s
[aeson] n_string_1_surrogate_then_escape.json
1549.13 s
[aeson] decode: OK
1549.13 s
[aeson] tokens bs: OK
1549.13 s
[aeson] tokens lbs: OK
1549.13 s
[aeson] tokens text: OK
1549.13 s
[aeson] Golden file did not exist; created
1549.13 s
[aeson] n_string_1_surrogate_then_escape_u.json
1549.13 s
[aeson] decode: OK
1549.13 s
[aeson] tokens bs: OK
1549.13 s
[aeson] tokens lbs: OK (0.02s)
1549.13 s
[aeson] tokens text: OK
1549.13 s
[aeson] Golden file did not exist; created
1549.13 s
[aeson] n_string_1_surrogate_then_escape_u1.json
1549.13 s
[aeson] decode: OK
1549.13 s
[aeson] tokens bs: OK
1549.13 s
[aeson] tokens lbs: OK
1549.13 s
[aeson] tokens text: OK
1549.13 s
[aeson] Golden file did not exist; created
1549.13 s
[aeson] n_string_1_surrogate_then_escape_u1x.json
1549.13 s
[aeson] decode: OK
1549.13 s
[aeson] tokens bs: OK
1549.13 s
[aeson] tokens lbs: OK
1549.13 s
[aeson] tokens text: OK
1549.13 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
1549.13 s
[algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
1549.13 s
[algebraic-graphs] OK: edge zero x y == vertices [x,y]
1549.13 s
[algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
1549.13 s
[algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
1549.13 s
[algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
1549.13 s
[algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
1549.13 s
[algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
1549.13 s
[algebraic-graphs] OK: x -<e>- y == edge e x y
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
1549.13 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1549.13 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1549.13 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1549.13 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1549.13 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1549.13 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1549.13 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1549.13 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
1549.13 s
[algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
1549.13 s
[algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
1549.13 s
[algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
1549.13 s
[algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
1549.13 s
[algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
1549.13 s
[algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
1549.13 s
[algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1549.13 s
[algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
1549.13 s
[algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
1549.13 s
[algebraic-graphs] OK: vertices [] == empty
1549.13 s
[algebraic-graphs] OK: vertices [x] == vertex x
1549.13 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1549.13 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1549.13 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1549.13 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
1549.13 s
[algebraic-graphs] OK: edges [] == empty
1549.13 s
[algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
1549.13 s
[algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
1549.13 s
[algebraic-graphs] OK: overlays [] == empty
1549.13 s
[algebraic-graphs] OK: overlays [x] == x
1549.13 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1549.13 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1549.13 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
1549.13 s
[algebraic-graphs] OK: fromAdjacencyMaps [] == empty
1549.13 s
[algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
1549.13 s
[algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
1549.13 s
[algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
1549.13 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1549.13 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1549.13 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
1549.13 s
[algebraic-graphs] OK: isEmpty empty == True
1549.13 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1549.13 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1549.13 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1549.13 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
1549.13 s
[algebraic-graphs] OK: hasVertex x empty == False
1549.13 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1549.13 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
1549.13 s
[algebraic-graphs] OK: hasEdge x y empty == False
1549.13 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1549.13 s
[algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
1549.13 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1549.13 s
[algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
1549.13 s
[algebraic-graphs]
1549.13 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
1549.13 s
[algebraic-graphs] OK: edgeLabel x y empty == zero
1549.13 s
[algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
1549.13 s
[algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
1549.13 s
[aeson] Golden file did not exist; created
1549.13 s
[aeson] n_string_accentuated_char_no_quotes.json
1549.13 s
[aeson] decode: OK
1549.14 s
[aeson] tokens bs: OK
1549.14 s
[aeson] tokens lbs: OK
1549.14 s
[aeson] tokens text: OK
1549.14 s
[aeson] Golden file did not exist; created
1549.14 s
[aeson] n_string_backslash_00.json
1549.14 s
[aeson] decode: OK
1549.14 s
[aeson] tokens bs: OK
1549.14 s
[aeson] tokens lbs: OK
1549.14 s
[aeson] tokens text: OK
1549.14 s
[aeson] Golden file did not exist; created
1549.14 s
[aeson] n_string_escape_x.json
1549.14 s
[aeson] decode: OK
1549.14 s
[aeson] tokens bs: OK
1549.14 s
[aeson] tokens lbs: OK
1549.14 s
[aeson] tokens text: OK
1549.14 s
[aeson] Golden file did not exist; created
1549.14 s
[aeson] n_string_escaped_backslash_bad.json
1549.14 s
[aeson] decode: OK
1549.14 s
[aeson] tokens bs: OK
1549.14 s
[aeson] tokens lbs: OK
1549.14 s
[aeson] tokens text: OK
1549.14 s
[aeson] Golden file did not exist; created
1549.14 s
[aeson] n_string_escaped_ctrl_char_tab.json
1549.14 s
[aeson] decode: OK
1549.14 s
[aeson] tokens bs: OK
1549.14 s
[aeson] tokens lbs: OK
1549.14 s
[aeson] tokens text: OK
1549.14 s
[aeson] Golden file did not exist; created
1549.14 s
[aeson] n_string_escaped_emoji.json
1549.14 s
[aeson] decode: OK
1549.14 s
[aeson] tokens bs: OK
1549.14 s
[aeson] tokens lbs: OK
1549.14 s
[aeson] tokens text: OK
1549.14 s
[aeson] Golden file did not exist; created
1549.14 s
[aeson] n_string_incomplete_escape.json
1549.14 s
[aeson] decode: OK
1549.14 s
[aeson] tokens bs: OK
1549.14 s
[aeson] tokens lbs: OK
1549.14 s
[aeson] tokens text: OK
1549.14 s
[aeson] Golden file did not exist; created
1549.14 s
[aeson] n_string_incomplete_escaped_character.json
1549.14 s
[aeson] decode: OK
1549.14 s
[aeson] tokens bs: OK
1549.14 s
[aeson] tokens lbs: OK
1549.14 s
[aeson] tokens text: OK
1549.14 s
[aeson] Golden file did not exist; created
1549.14 s
[aeson] n_string_incomplete_surrogate.json
1549.14 s
[aeson] decode: OK
1549.14 s
[aeson] tokens bs: OK
1549.14 s
[aeson] tokens lbs: OK
1549.14 s
[aeson] tokens text: OK
1549.14 s
[aeson] Golden file did not exist; created
1549.14 s
[aeson] n_string_incomplete_surrogate_escape_invalid.json
1549.14 s
[aeson] decode: OK
1549.14 s
[aeson] tokens bs: OK (0.01s)
1549.14 s
[aeson] tokens lbs: OK
1549.14 s
[aeson] tokens text: OK
1549.14 s
[aeson] Golden file did not exist; created
1549.14 s
[aeson] n_string_invalid-utf-8-in-escape.json
1549.14 s
[aeson] decode: OK
1549.14 s
[aeson] tokens bs: OK
1549.14 s
[aeson] tokens lbs: OK
1549.14 s
[aeson] tokens text: OK
1549.14 s
[aeson] Golden file did not exist; created
1549.14 s
[aeson] n_string_invalid_backslash_esc.json
1549.14 s
[aeson] decode: OK
1549.14 s
[aeson] tokens bs: OK
1549.14 s
[aeson] tokens lbs: OK
1549.14 s
[aeson] tokens text: OK
1549.14 s
[aeson] Golden file did not exist; created
1549.14 s
[aeson] n_string_invalid_unicode_escape.json
1549.14 s
[aeson] decode: OK
1549.14 s
[aeson] tokens bs: OK
1549.14 s
[aeson] tokens lbs: OK
1549.14 s
[aeson] tokens text: OK
1549.14 s
[aeson] Golden file did not exist; created
1549.14 s
[algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
1549.14 s
[algebraic-graphs] OK: vertexCount empty == 0
1549.14 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1549.14 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1549.14 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
1549.14 s
[algebraic-graphs] OK: edgeCount empty == 0
1549.14 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1549.14 s
[algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
1549.14 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
1549.14 s
[algebraic-graphs] OK: vertexList empty == []
1549.14 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1549.14 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
1549.14 s
[algebraic-graphs] OK: edgeList empty == []
1549.14 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1549.14 s
[algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
1549.14 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1549.14 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1549.14 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
1549.14 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1549.14 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1549.14 s
[algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
1549.14 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1549.14 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1549.14 s
[algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
1549.14 s
[algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
1549.14 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1549.14 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1549.14 s
[algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
1549.14 s
[algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
1549.14 s
[algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
1549.14 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1549.14 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1549.14 s
[algebraic-graphs] OK: removeVertex x (edge e x x) == empty
1549.14 s
[algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
1549.14 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
1549.14 s
[algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
1549.14 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1549.14 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1549.14 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1549.14 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
1549.14 s
[algebraic-graphs] OK: replaceVertex x x == id
1549.14 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1549.14 s
[algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
1549.14 s
[algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
1549.14 s
[algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
1549.14 s
[algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
1549.14 s
[algebraic-graphs] OK: transpose empty == empty
1549.14 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1549.14 s
[algebraic-graphs] OK: transpose (edge e x y) == edge e y x
1549.14 s
[algebraic-graphs] OK: transpose . transpose == id
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
1549.14 s
[algebraic-graphs] OK: gmap f empty == empty
1549.14 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1549.14 s
[algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
1549.14 s
[algebraic-graphs] OK: gmap id == id
1549.14 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
1549.14 s
[algebraic-graphs] OK: emap h empty == empty
1549.14 s
[algebraic-graphs] OK: emap h (vertex x) == vertex x
1549.14 s
[algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
1549.14 s
[algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
1549.14 s
[algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
1549.14 s
[algebraic-graphs] OK: emap id == id
1549.14 s
[algebraic-graphs] OK: emap g . emap h == emap (g . h)
1549.14 s
[algebraic-graphs]
1549.14 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
1549.14 s
[algebraic-graphs] OK: induce (const True ) x == x
1549.14 s
[algebraic-graphs] OK: induce (const False) x == empty
1549.14 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1549.14 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1549.14 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1549.14 s
[algebraic-graphs]
1549.14 s
[aeson] n_string_invalid_utf8_after_escape.json
1549.14 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_string_leading_uescaped_thinspace.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_string_no_quotes_with_bad_escape.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_string_single_doublequote.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_string_single_quote.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_string_single_string_no_double_quotes.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_string_start_escape_unclosed.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_string_unescaped_ctrl_char.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_string_unescaped_newline.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_string_unescaped_tab.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK (0.01s)
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_string_unicode_CapitalU.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_string_with_trailing_garbage.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_100000_opening_arrays.json
1549.15 s
[aeson] decode: OK (0.26s)
1549.15 s
[aeson] tokens bs: OK (0.14s)
1549.15 s
[aeson] tokens lbs: OK (0.10s)
1549.15 s
[aeson] tokens text: OK (0.06s)
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
1549.15 s
[aeson] n_structure_U+2060_word_joined.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_UTF8_BOM_no_data.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_angle_bracket_null.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_array_trailing_garbage.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_array_with_extra_array_close.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_array_with_unclosed_string.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_ascii-unicode-identifier.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_capitalized_True.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_close_unopened_array.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_comma_instead_of_closing_brace.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_double_array.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_end_array.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_incomplete_UTF8_BOM.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_lone-invalid-utf-8.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_lone-open-bracket.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_no_data.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_null-byte-outside-string.json
1549.15 s
[aeson] decode: OK
1549.15 s
[aeson] tokens bs: OK
1549.15 s
[aeson] tokens lbs: OK
1549.15 s
[aeson] tokens text: OK
1549.15 s
[aeson] Golden file did not exist; created
1549.15 s
[aeson] n_structure_number_with_trailing_garbage.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_object_followed_by_closing_object.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_object_unclosed_no_value.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_object_with_comment.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_object_with_trailing_garbage.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_open_array_apostrophe.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_open_array_comma.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_open_array_object.json
1549.16 s
[aeson] decode: OK (0.42s)
1549.16 s
[aeson] tokens bs: OK (0.20s)
1549.16 s
[aeson] tokens lbs: OK (0.16s)
1549.16 s
[aeson] tokens text: OK (0.20s)
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_open_array_open_object.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_open_array_open_string.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_open_array_string.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_open_object.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_open_object_close_array.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_open_object_comma.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_open_object_open_array.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_open_object_open_string.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_open_object_string_with_apostrophes.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_open_open.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_single_eacute.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_single_star.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_trailing_#.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_uescaped_LF_before_string.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_unclosed_array.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_unclosed_array_partial_null.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_unclosed_array_unfinished_false.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_unclosed_array_unfinished_true.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_unclosed_object.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_unicode-identifier.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_whitespace_U+2060_word_joiner.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] n_structure_whitespace_formfeed.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] Golden file did not exist; created
1549.16 s
[aeson] y_array_arraysWithSpaces.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] decode via tokens: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] y_array_empty-string.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] decode via tokens: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] y_array_empty.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] decode via tokens: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] y_array_ending_with_newline.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] decode via tokens: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] y_array_false.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] decode via tokens: OK
1549.16 s
[aeson] tokens bs: OK
1549.16 s
[aeson] tokens lbs: OK
1549.16 s
[aeson] tokens text: OK
1549.16 s
[aeson] y_array_heterogeneous.json
1549.16 s
[aeson] decode: OK
1549.16 s
[aeson] decode via tokens: OK
1549.16 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_array_null.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_array_with_1_and_newline.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_array_with_leading_space.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_array_with_several_null.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_array_with_trailing_space.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_0e+1.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_0e1.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_after_space.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_double_close_to_zero.json
1549.17 s
[aeson] decode: OK (0.01s)
1549.17 s
[aeson] decode via tokens: OK (0.01s)
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_int_with_exp.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_minus_zero.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_negative_int.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK (0.01s)
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_negative_one.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_negative_zero.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_real_capital_e.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK (0.01s)
1549.17 s
[aeson] y_number_real_capital_e_neg_exp.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_real_capital_e_pos_exp.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_real_exponent.json
1549.17 s
[aeson] decode: OK (0.01s)
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK (0.01s)
1549.17 s
[aeson] tokens lbs: OK (0.01s)
1549.17 s
[aeson] tokens text: OK (0.01s)
1549.17 s
[aeson] y_number_real_fraction_exponent.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_real_neg_exp.json
1549.17 s
[aeson] decode: OK (0.01s)
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_real_pos_exponent.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK (0.01s)
1549.17 s
[aeson] y_number_simple_int.json
1549.17 s
[aeson] decode: OK (0.01s)
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK (0.02s)
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_number_simple_real.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_object.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_object_basic.json
1549.17 s
[aeson] decode: OK (0.01s)
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_object_duplicated_key.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_object_duplicated_key_and_value.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_object_empty.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK (0.01s)
1549.17 s
[aeson] y_object_empty_key.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_object_escaped_null_in_key.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_object_extreme_numbers.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_object_long_strings.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_object_simple.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_object_string_unicode.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_object_with_newlines.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_string_1_2_3_bytes_UTF-8_sequences.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK
1549.17 s
[aeson] tokens text: OK
1549.17 s
[aeson] y_string_accepted_surrogate_pair.json
1549.17 s
[aeson] decode: OK
1549.17 s
[aeson] decode via tokens: OK
1549.17 s
[aeson] tokens bs: OK
1549.17 s
[aeson] tokens lbs: OK (0.01s)
1549.17 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_accepted_surrogate_pairs.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_allowed_escapes.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_backslash_and_u_escaped_zero.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_backslash_doublequotes.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_comments.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_double_escape_a.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_double_escape_n.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_escaped_control_character.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_escaped_noncharacter.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_in_array.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_in_array_with_leading_space.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_last_surrogates_1_and_2.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK (0.01s)
1549.18 s
[aeson] y_string_nbsp_uescaped.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_nonCharacterInUTF-8_U+10FFFF.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_nonCharacterInUTF-8_U+FFFF.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_null_escape.json
1549.18 s
[aeson] decode: OK (0.01s)
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK (0.02s)
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_one-byte-utf-8.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_pi.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_reservedCharacterInUTF-8_U+1BFFF.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_simple_ascii.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_space.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_surrogates_U+1D11E_MUSICAL_SYMBOL_G_CLEF.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_three-byte-utf-8.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_two-byte-utf-8.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_u+2028_line_sep.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_u+2029_par_sep.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_uEscape.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_uescaped_newline.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_unescaped_char_delete.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_unicode.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.18 s
[aeson] tokens lbs: OK
1549.18 s
[aeson] tokens text: OK
1549.18 s
[aeson] y_string_unicodeEscapedBackslash.json
1549.18 s
[aeson] decode: OK
1549.18 s
[aeson] decode via tokens: OK
1549.18 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_string_unicode_2.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_string_unicode_U+10FFFE_nonchar.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_string_unicode_U+1FFFE_nonchar.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_string_unicode_U+200B_ZERO_WIDTH_SPACE.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_string_unicode_U+2064_invisible_plus.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_string_unicode_U+FDD0_nonchar.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_string_unicode_U+FFFE_nonchar.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_string_unicode_escaped_double_quote.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_string_utf8.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK (0.01s)
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK (0.01s)
1549.19 s
[aeson] y_string_with_del_character.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK (0.04s)
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_structure_lonely_false.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK (0.03s)
1549.19 s
[aeson] y_structure_lonely_int.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_structure_lonely_negative_real.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_structure_lonely_null.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_structure_lonely_string.json
1549.19 s
[aeson] decode: OK (0.01s)
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK (0.01s)
1549.19 s
[aeson] y_structure_lonely_true.json
1549.19 s
[aeson] decode: OK (0.03s)
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_structure_string_empty.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_structure_trailing_newline.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_structure_true_in_array.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] y_structure_whitespace_array.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] number_-9223372036854775808.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] number_-9223372036854775809.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] number_1000000000000000.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] number_10000000000000000999.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] number_1e-999.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] number_1e6.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] number_9223372036854775807.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] number_9223372036854775808.json
1549.19 s
[aeson] decode: OK
1549.19 s
[aeson] decode via tokens: OK
1549.19 s
[aeson] tokens bs: OK
1549.19 s
[aeson] tokens lbs: OK
1549.19 s
[aeson] tokens text: OK
1549.19 s
[aeson] object_key_nfc_nfd.json
1549.19 s
[aeson] decode: OK
1549.20 s
[aeson] decode via tokens: OK
1549.20 s
[aeson] tokens bs: OK
1549.20 s
[aeson] tokens lbs: OK
1549.20 s
[aeson] tokens text: OK
1549.20 s
[aeson] object_key_nfd_nfc.json
1549.20 s
[aeson] decode: OK
1549.20 s
[aeson] decode via tokens: OK
1549.20 s
[aeson] tokens bs: OK
1549.20 s
[aeson] tokens lbs: OK
1549.20 s
[aeson] tokens text: OK
1549.20 s
[aeson] object_same_key_different_values.json
1549.20 s
[aeson] decode: OK
1549.20 s
[aeson] decode via tokens: OK
1549.20 s
[aeson] tokens bs: OK
1549.20 s
[aeson] tokens lbs: OK
1549.20 s
[aeson] tokens text: OK
1549.20 s
[aeson] object_same_key_same_value.json
1549.20 s
[aeson] decode: OK
1549.20 s
[aeson] decode via tokens: OK
1549.20 s
[aeson] tokens bs: OK
1549.20 s
[aeson] tokens lbs: OK
1549.20 s
[aeson] tokens text: OK
1549.20 s
[aeson] object_same_key_unclear_values.json
1549.20 s
[aeson] decode: OK
1549.20 s
[aeson] decode via tokens: OK
1549.20 s
[aeson] tokens bs: OK
1549.20 s
[aeson] tokens lbs: OK
1549.20 s
[aeson] tokens text: OK
1549.20 s
[aeson] string_1_escaped_invalid_codepoint.json
1549.20 s
[aeson] decode: OK
1549.20 s
[aeson] tokens bs: OK
1549.20 s
[aeson] tokens lbs: OK
1549.20 s
[aeson] tokens text: OK
1549.20 s
[aeson] Golden file did not exist; created
1549.20 s
[aeson] string_1_invalid_codepoint.json
1549.20 s
[aeson] decode: OK
1549.20 s
[aeson] tokens bs: OK
1549.20 s
[aeson] tokens lbs: OK
1549.20 s
[aeson] tokens text: OK
1549.20 s
[aeson] Golden file did not exist; created
1549.20 s
[aeson] string_2_escaped_invalid_codepoints.json
1549.20 s
[aeson] decode: OK
1549.20 s
[aeson] tokens bs: OK
1549.20 s
[aeson] tokens lbs: OK
1549.20 s
[aeson] tokens text: OK
1549.20 s
[aeson] Golden file did not exist; created
1549.20 s
[aeson] string_2_invalid_codepoints.json
1549.20 s
[aeson] decode: OK
1549.20 s
[aeson] tokens bs: OK
1549.20 s
[aeson] tokens lbs: OK
1549.20 s
[aeson] tokens text: OK
1549.20 s
[aeson] Golden file did not exist; created
1549.20 s
[aeson] string_3_escaped_invalid_codepoints.json
1549.20 s
[aeson] decode: OK
1549.20 s
[aeson] tokens bs: OK
1549.20 s
[aeson] tokens lbs: OK
1549.20 s
[aeson] tokens text: OK
1549.20 s
[aeson] Golden file did not exist; created
1549.20 s
[aeson] string_3_invalid_codepoints.json
1549.20 s
[aeson] decode: OK
1549.20 s
[aeson] tokens bs: OK
1549.20 s
[aeson] tokens lbs: OK
1549.20 s
[aeson] tokens text: OK
1549.20 s
[aeson] Golden file did not exist; created
1549.20 s
[aeson] string_with_escaped_NULL.json
1549.20 s
[aeson] decode: OK
1549.20 s
[aeson] decode via tokens: OK
1549.20 s
[aeson] tokens bs: OK
1549.20 s
[aeson] tokens lbs: OK
1549.20 s
[aeson] tokens text: OK
1549.20 s
[aeson] encoders
1549.20 s
[aeson] benchmarks/json-data/example.json: OK
1549.20 s
[aeson] benchmarks/json-data/integers.json: OK
1549.20 s
[aeson] benchmarks/json-data/jp100.json: OK (0.01s)
1549.20 s
[aeson] benchmarks/json-data/numbers.json: OK
1549.20 s
[aeson] benchmarks/json-data/twitter10.json: OK
1549.20 s
[aeson] benchmarks/json-data/twitter20.json: OK
1549.20 s
[aeson] benchmarks/json-data/geometry.json: OK (0.01s)
1549.20 s
[aeson] benchmarks/json-data/jp10.json: OK
1549.20 s
[aeson] benchmarks/json-data/jp50.json: OK
1549.20 s
[aeson] benchmarks/json-data/twitter1.json: OK
1549.20 s
[aeson] benchmarks/json-data/twitter100.json: OK
1549.20 s
[aeson] benchmarks/json-data/twitter50.json: OK
1549.20 s
[aeson]
1549.20 s
[aeson] All 2085 tests passed (295.03s)
1549.20 s
[aeson] Test suite aeson-tests: PASS
1549.20 s
[aeson] Test suite logged to: dist/test/aeson-2.2.3.0-aeson-tests.log
1549.20 s
[aeson] 1 of 1 test suites (1 of 1 test cases) passed.
1549.20 s
[aeson] checkPhase completed in 4 minutes 56 seconds
1549.20 s
[aeson] Phase: haddockPhase
1549.25 s
[regex] buildPhase completed in 7 minutes 6 seconds
1549.25 s
[regex] Phase: checkPhase
1549.31 s
[regex] Package has no test suites.
1549.33 s
[regex] Phase: haddockPhase
1549.50 s
[aeson] Preprocessing library for aeson-2.2.3.0..
1549.51 s
[aeson] Running Haddock on library for aeson-2.2.3.0..
1549.56 s
[aeson] Warning: The documentation for the following packages are not installed. No
1549.56 s
[aeson] links will be generated to these packages: vector-0.13.2.0
1549.61 s
[regex] Preprocessing library for regex-1.1.0.2..
1549.63 s
[regex] Running Haddock on library for regex-1.1.0.2..
1549.74 s
[aeson] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1549.77 s
[regex] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1549.81 s
[fuzzy] Phase: updateAutotoolsGnuConfigScriptsPhase
1549.83 s
[fuzzy] Phase: configurePhase
1549.84 s
[shake] [ 3 of 73] Compiling Development.Ninja.Lexer ( src/Development/Ninja/Lexer.hs, dist/build/Development/Ninja/Lexer.p_o )
1549.84 s
[fuzzy] configureFlags: --verbose --prefix=/nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/mpp7jvdkajhlawsdm92i7pwzryr24g1d-fuzzy-0.1.1.0-doc/share/doc/fuzzy-0.1.1.0 --with-gcc=gcc --package-db=/build/tmp.vBIRnNht8J/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1549.85 s
[fuzzy] Using Parsec parser
1549.85 s
[fuzzy] Configuring fuzzy-0.1.1.0...
1550.80 s
[unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
1550.84 s
[fuzzy] Dependency base >=4.8 && <5: using base-4.19.0.0
1550.84 s
[fuzzy] Dependency monoid-subclasses >0.4: using monoid-subclasses-1.2.6
1550.84 s
[fuzzy] Dependency HUnit >=1.2.5.0: using HUnit-1.6.2.0
1550.84 s
[fuzzy] Dependency base: using base-4.19.0.0
1550.84 s
[fuzzy] Dependency fuzzy: using fuzzy-0.1.1.0
1550.95 s
[unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
1551.17 s
[aeson] [ 1 of 32] Compiling Data.Aeson.Internal.ByteString ( src/Data/Aeson/Internal/ByteString.hs, nothing )
1551.29 s
[shake] [ 4 of 73] Compiling Development.Shake.Classes ( src/Development/Shake/Classes.hs, dist/build/Development/Shake/Classes.p_o )
1551.29 s
[shake] [ 5 of 73] Compiling Development.Shake.FilePath ( src/Development/Shake/FilePath.hs, dist/build/Development/Shake/FilePath.p_o )
1551.29 s
[shake] [ 6 of 73] Compiling Development.Shake.Internal.CmdOption ( src/Development/Shake/Internal/CmdOption.hs, dist/build/Development/Shake/Internal/CmdOption.p_o )
1551.29 s
[shake] [ 7 of 73] Compiling Development.Shake.Internal.History.Bloom ( src/Development/Shake/Internal/History/Bloom.hs, dist/build/Development/Shake/Internal/History/Bloom.p_o )
1551.29 s
[shake] [ 8 of 73] Compiling Development.Shake.Internal.History.Network ( src/Development/Shake/Internal/History/Network.hs, dist/build/Development/Shake/Internal/History/Network.p_o )
1551.29 s
[shake] [ 9 of 73] Compiling Development.Shake.Internal.History.Types ( src/Development/Shake/Internal/History/Types.hs, dist/build/Development/Shake/Internal/History/Types.p_o )
1551.29 s
[shake] [10 of 73] Compiling General.Bilist ( src/General/Bilist.hs, dist/build/General/Bilist.p_o )
1551.29 s
[shake] [11 of 73] Compiling General.Binary ( src/General/Binary.hs, dist/build/General/Binary.p_o )
1551.29 s
[shake] [12 of 73] Compiling Development.Shake.Internal.FileName ( src/Development/Shake/Internal/FileName.hs, dist/build/Development/Shake/Internal/FileName.p_o )
1551.29 s
[shake] [13 of 73] Compiling General.Cleanup ( src/General/Cleanup.hs, dist/build/General/Cleanup.p_o )
1551.29 s
[shake] [14 of 73] Compiling General.EscCodes ( src/General/EscCodes.hs, dist/build/General/EscCodes.p_o )
1551.29 s
[shake] [15 of 73] Compiling General.Extra ( src/General/Extra.hs, dist/build/General/Extra.p_o )
1551.29 s
[shake] [16 of 73] Compiling Development.Shake.Internal.History.Symlink ( src/Development/Shake/Internal/History/Symlink.hs, dist/build/Development/Shake/Internal/History/Symlink.p_o )
1551.29 s
[shake] [17 of 73] Compiling Development.Shake.Internal.Errors ( src/Development/Shake/Internal/Errors.hs, dist/build/Development/Shake/Internal/Errors.p_o )
1551.33 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1551.33 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1551.33 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1551.34 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1551.34 s
[algebraic-graphs]
1551.34 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
1551.34 s
[algebraic-graphs] OK: closure empty == empty
1551.34 s
[algebraic-graphs] OK: closure (vertex x) == edge one x x
1551.34 s
[algebraic-graphs] OK: closure (edge e x x) == edge one x x
1551.34 s
[algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
1551.34 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1551.34 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1551.34 s
[algebraic-graphs] OK: closure . closure == closure
1551.34 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1551.34 s
[algebraic-graphs]
1551.34 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
1551.34 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1551.34 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
1551.34 s
[algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
1551.34 s
[algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
1551.34 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1551.34 s
[algebraic-graphs]
1551.34 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
1551.34 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1551.34 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1551.34 s
[algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
1551.34 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1551.34 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1551.34 s
[algebraic-graphs]
1551.34 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
1551.34 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1551.34 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1551.34 s
[algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
1551.34 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1551.34 s
[algebraic-graphs]
1551.34 s
[algebraic-graphs] ============ Labelled.Graph.empty ============
1551.34 s
[algebraic-graphs] OK: isEmpty empty == True
1551.34 s
[algebraic-graphs] OK: hasVertex x empty == False
1551.34 s
[algebraic-graphs] OK: vertexCount empty == 0
1551.34 s
[algebraic-graphs] OK: edgeCount empty == 0
1551.34 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.vertex ============
1551.35 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1551.35 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1551.35 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1551.35 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.edge ============
1551.35 s
[algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
1551.35 s
[algebraic-graphs] OK: edge zero x y == vertices [x,y]
1551.35 s
[algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
1551.35 s
[algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
1551.35 s
[algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
1551.35 s
[algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
1551.35 s
[algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
1551.35 s
[algebraic-graphs] OK: x -<e>- y == edge e x y
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.overlay ============
1551.35 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1551.35 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1551.35 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1551.35 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1551.35 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1551.35 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1551.35 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1551.35 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
1551.35 s
[algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
1551.35 s
[algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.connect ============
1551.35 s
[algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
1551.35 s
[algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
1551.35 s
[algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
1551.35 s
[algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
1551.35 s
[algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1551.35 s
[algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
1551.35 s
[algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.vertices ============
1551.35 s
[algebraic-graphs] OK: vertices [] == empty
1551.35 s
[algebraic-graphs] OK: vertices [x] == vertex x
1551.35 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1551.35 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1551.35 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1551.35 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.edges ============
1551.35 s
[algebraic-graphs] OK: edges [] == empty
1551.35 s
[algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
1551.35 s
[algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.overlays ============
1551.35 s
[algebraic-graphs] OK: overlays [] == empty
1551.35 s
[algebraic-graphs] OK: overlays [x] == x
1551.35 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1551.35 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1551.35 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.foldg ============
1551.35 s
[algebraic-graphs] OK: foldg empty vertex connect == id
1551.35 s
[algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
1551.35 s
[algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
1551.35 s
[algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
1551.35 s
[algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
1551.35 s
[algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.buildg ============
1551.35 s
[algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
1551.35 s
[algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
1551.35 s
[algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
1551.35 s
[algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
1551.35 s
[algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
1551.35 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1551.35 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1551.35 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.isEmpty ============
1551.35 s
[algebraic-graphs] OK: isEmpty empty == True
1551.35 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1551.35 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1551.35 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1551.35 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.size ============
1551.35 s
[algebraic-graphs] OK: size empty == 1
1551.35 s
[algebraic-graphs] OK: size (vertex x) == 1
1551.35 s
[algebraic-graphs] OK: size (overlay x y) == size x + size y
1551.35 s
[algebraic-graphs] OK: size (connect x y) == size x + size y
1551.35 s
[algebraic-graphs] OK: size x >= 1
1551.35 s
[algebraic-graphs] OK: size x >= vertexCount x
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.hasVertex ============
1551.35 s
[algebraic-graphs] OK: hasVertex x empty == False
1551.35 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1551.35 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.hasEdge ============
1551.35 s
[algebraic-graphs] OK: hasEdge x y empty == False
1551.35 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1551.35 s
[algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
1551.35 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1551.35 s
[algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
1551.35 s
[algebraic-graphs] OK: edgeLabel x y empty == zero
1551.35 s
[algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
1551.35 s
[algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
1551.35 s
[algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.vertexCount ============
1551.35 s
[algebraic-graphs] OK: vertexCount empty == 0
1551.35 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1551.35 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1551.35 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.edgeCount ============
1551.35 s
[algebraic-graphs] OK: edgeCount empty == 0
1551.35 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1551.35 s
[algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
1551.35 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.vertexList ============
1551.35 s
[algebraic-graphs] OK: vertexList empty == []
1551.35 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1551.35 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.edgeList ============
1551.35 s
[algebraic-graphs] OK: edgeList empty == []
1551.35 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1551.35 s
[algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.vertexSet ============
1551.35 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1551.35 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1551.35 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.edgeSet ============
1551.35 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1551.35 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1551.35 s
[algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
1551.35 s
[algebraic-graphs]
1551.35 s
[algebraic-graphs] ============ Labelled.Graph.preSet ============
1551.35 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1551.35 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1551.47 s
[unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
1551.52 s
[aeson] [ 2 of 32] Compiling Data.Aeson.Internal.Functions ( src/Data/Aeson/Internal/Functions.hs, nothing )
1551.54 s
[fuzzy] Source component graph:
1551.54 s
[fuzzy] component lib
1551.54 s
[fuzzy] component test:tests dependency lib
1551.54 s
[fuzzy] Configured component graph:
1551.54 s
[fuzzy] component fuzzy-0.1.1.0-D07bwRyz1gP5AVa7hnmyim
1551.54 s
[fuzzy] include base-4.19.0.0-b960
1551.54 s
[fuzzy] include monoid-subclasses-1.2.6-Gfcvp0EfwKt1Ok9yeWcbEn
1551.54 s
[fuzzy] component fuzzy-0.1.1.0-D85gewNE771ACoWbKad1Ed-tests
1551.54 s
[fuzzy] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1551.54 s
[fuzzy] include base-4.19.0.0-b960
1551.54 s
[fuzzy] include fuzzy-0.1.1.0-D07bwRyz1gP5AVa7hnmyim
1551.54 s
[fuzzy] Linked component graph:
1551.54 s
[fuzzy] unit fuzzy-0.1.1.0-D07bwRyz1gP5AVa7hnmyim
1551.54 s
[fuzzy] include base-4.19.0.0-b960
1551.54 s
[fuzzy] include monoid-subclasses-1.2.6-Gfcvp0EfwKt1Ok9yeWcbEn
1551.54 s
[fuzzy] Text.Fuzzy=fuzzy-0.1.1.0-D07bwRyz1gP5AVa7hnmyim:Text.Fuzzy
1551.54 s
[fuzzy] unit fuzzy-0.1.1.0-D85gewNE771ACoWbKad1Ed-tests
1551.54 s
[fuzzy] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1551.54 s
[fuzzy] include base-4.19.0.0-b960
1551.54 s
[fuzzy] include fuzzy-0.1.1.0-D07bwRyz1gP5AVa7hnmyim
1551.54 s
[fuzzy] Ready component graph:
1551.54 s
[fuzzy] definite fuzzy-0.1.1.0-D07bwRyz1gP5AVa7hnmyim
1551.55 s
[fuzzy] depends base-4.19.0.0-b960
1551.55 s
[fuzzy] depends monoid-subclasses-1.2.6-Gfcvp0EfwKt1Ok9yeWcbEn
1551.55 s
[fuzzy] definite fuzzy-0.1.1.0-D85gewNE771ACoWbKad1Ed-tests
1551.55 s
[fuzzy] depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1551.55 s
[fuzzy] depends base-4.19.0.0-b960
1551.55 s
[fuzzy] depends fuzzy-0.1.1.0-D07bwRyz1gP5AVa7hnmyim
1551.55 s
[fuzzy] Using Cabal-3.10.2.0 compiled by ghc-9.8
1551.55 s
[fuzzy] Using compiler: ghc-9.8.1
1551.55 s
[fuzzy] Using install prefix:
1551.55 s
[fuzzy] /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0
1551.55 s
[fuzzy] Executables installed in:
1551.55 s
[fuzzy] /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0/bin
1551.55 s
[fuzzy] Libraries installed in:
1551.55 s
[fuzzy] /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/fuzzy-0.1.1.0-D07bwRyz1gP5AVa7hnmyim
1551.55 s
[fuzzy] Dynamic Libraries installed in:
1551.55 s
[fuzzy] /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1551.55 s
[fuzzy] Private executables installed in:
1551.55 s
[fuzzy] /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0/libexec/x86_64-linux-ghc-9.8.1/fuzzy-0.1.1.0
1551.55 s
[fuzzy] Data files installed in:
1551.55 s
[fuzzy] /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0/share/x86_64-linux-ghc-9.8.1/fuzzy-0.1.1.0
1551.55 s
[fuzzy] Documentation installed in:
1551.55 s
[fuzzy] /nix/store/mpp7jvdkajhlawsdm92i7pwzryr24g1d-fuzzy-0.1.1.0-doc/share/doc/fuzzy-0.1.1.0
1551.55 s
[fuzzy] Configuration files installed in:
1551.55 s
[fuzzy] /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0/etc
1551.55 s
[fuzzy] No alex found
1551.55 s
[fuzzy] Using ar found on system at:
1551.55 s
[fuzzy] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1551.55 s
[fuzzy] No c2hs found
1551.55 s
[fuzzy] No cpphs found
1551.55 s
[fuzzy] No doctest found
1551.55 s
[fuzzy] Using gcc version 14.3.0 given by user at:
1551.55 s
[fuzzy] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1551.55 s
[fuzzy] Using ghc version 9.8.1 found on system at:
1551.55 s
[fuzzy] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1551.55 s
[fuzzy] Using ghc-pkg version 9.8.1 found on system at:
1551.55 s
[fuzzy] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1551.55 s
[fuzzy] No ghcjs found
1551.55 s
[fuzzy] No ghcjs-pkg found
1551.55 s
[fuzzy] No greencard found
1551.55 s
[fuzzy] Using haddock version 2.30.0 found on system at:
1551.55 s
[fuzzy] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1551.55 s
[fuzzy] No happy found
1551.55 s
[fuzzy] Using haskell-suite found on system at: haskell-suite-dummy-location
1551.55 s
[fuzzy] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1551.55 s
[fuzzy] No hmake found
1551.55 s
[fuzzy] Using hpc version 0.69 found on system at:
1551.55 s
[fuzzy] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1551.55 s
[fuzzy] Using hsc2hs version 0.68.10 found on system at:
1551.55 s
[fuzzy] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1551.55 s
[fuzzy] Using hscolour version 1.25 found on system at:
1551.55 s
[fuzzy] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1551.55 s
[fuzzy] No jhc found
1551.55 s
[fuzzy] Using ld found on system at:
1551.55 s
[fuzzy] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1551.55 s
[fuzzy] No pkg-config found
1551.55 s
[fuzzy] Using runghc version 9.8.1 found on system at:
1551.55 s
[fuzzy] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1551.55 s
[fuzzy] Using strip version 2.44 found on system at:
1551.55 s
[fuzzy] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1551.55 s
[fuzzy] Using tar found on system at:
1551.55 s
[fuzzy] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1551.55 s
[fuzzy] No uhc found
1551.65 s
[aeson] [ 3 of 32] Compiling Data.Aeson.Internal.Prelude ( src/Data/Aeson/Internal/Prelude.hs, nothing )
1551.65 s
[shake] [18 of 73] Compiling Development.Shake.Internal.Value ( src/Development/Shake/Internal/Value.hs, dist/build/Development/Shake/Internal/Value.p_o )
1551.75 s
[unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
1551.77 s
[unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
1551.78 s
[unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
1551.79 s
[unordered-containers] Haddock coverage:
1551.81 s
[unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
1551.81 s
[unordered-containers] Missing documentation for:
1551.81 s
[unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
1551.81 s
[unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
1551.81 s
[unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
1551.81 s
[unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
1551.81 s
[unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
1551.81 s
[unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
1551.81 s
[unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
1551.81 s
[unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
1551.81 s
[unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
1551.81 s
[unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
1551.81 s
[unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
1551.81 s
[unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
1551.81 s
[unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
1551.81 s
[unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
1551.81 s
[unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
1551.81 s
[unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
1551.81 s
[unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
1551.81 s
[unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
1551.81 s
[unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
1551.81 s
[unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
1551.81 s
[unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
1551.81 s
[unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
1551.81 s
[unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
1551.81 s
[unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
1551.81 s
[unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
1551.81 s
[unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
1551.81 s
[unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
1551.82 s
[unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
1551.82 s
[unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
1551.82 s
[unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
1551.82 s
[unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
1551.82 s
[unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
1551.82 s
[unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
1551.82 s
[unordered-containers] Missing documentation for:
1551.82 s
[unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
1551.82 s
[unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
1551.82 s
[unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
1551.83 s
[unordered-containers] Warning: 'hash' is ambiguous. It is defined
1551.83 s
[unordered-containers] * in ‘Data.Hashable.Class’
1551.83 s
[unordered-containers] * at Data/HashMap/Internal.hs:183:1
1551.83 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1551.83 s
[unordered-containers] by specifying the type/value namespace explicitly.
1551.83 s
[unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:183:1
1551.84 s
[fuzzy] Phase: buildPhase
1551.84 s
[unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
1551.85 s
[unordered-containers] * at Data/HashMap/Internal.hs:225:7
1552.51 s
[unordered-containers] * at Data/HashMap/Internal.hs:185:1
1552.51 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.51 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.51 s
[unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:185:1
1552.51 s
[unordered-containers] Warning: 'lookup' is ambiguous. It is defined
1552.51 s
[unordered-containers] * in ‘GHC.List’
1552.51 s
[unordered-containers] * at Data/HashMap/Internal.hs:632:1
1552.51 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.51 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.51 s
[unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:632:1
1552.51 s
[unordered-containers] Warning: 'update' is ambiguous. It is defined
1552.51 s
[unordered-containers] * at Data/HashMap/Internal.hs:1289:1
1552.51 s
[unordered-containers] * at Data/HashMap/Internal/Array.hs:341:1
1552.51 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.51 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.51 s
[unordered-containers] Defaulting to the one defined at Data/HashMap/Internal/Array.hs:341:1
1552.51 s
[unordered-containers] Warning: 'at' is out of scope.
1552.51 s
[unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
1552.51 s
[regex] [ 1 of 48] Compiling Text.RE ( Text/RE.hs, nothing )
1552.51 s
[unordered-containers] Warning: '!?' is ambiguous. It is defined
1552.51 s
[unordered-containers] * in ‘GHC.List’
1552.51 s
[unordered-containers] * at Data/HashMap/Internal.hs:741:1
1552.51 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.51 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.51 s
[unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:741:1
1552.51 s
[unordered-containers] Warning: 'index' is ambiguous. It is defined
1552.51 s
[unordered-containers] * at Data/HashMap/Internal.hs:2460:1
1552.51 s
[unordered-containers] * at Data/HashMap/Internal/Array.hs:262:1
1552.51 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.51 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.51 s
[unordered-containers] Defaulting to the one defined at Data/HashMap/Internal/Array.hs:262:1
1552.52 s
[unordered-containers] Warning: 'union' is ambiguous. It is defined
1552.52 s
[unordered-containers] * in ‘Data.OldList’
1552.52 s
[unordered-containers] * at Data/HashMap/Internal.hs:1586:1
1552.52 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.52 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.52 s
[unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:1586:1
1552.52 s
[unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
1552.52 s
[unordered-containers] Missing documentation for:
1552.52 s
[unordered-containers] Leaf (Data/HashMap/Internal.hs:185)
1552.52 s
[unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1855)
1552.52 s
[unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2368)
1552.52 s
[unordered-containers] equalKeys (Data/HashMap/Internal.hs:511)
1552.52 s
[unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:495)
1552.52 s
[unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:678)
1552.52 s
[unordered-containers] LookupRes (Data/HashMap/Internal.hs:657)
1552.52 s
[unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:660)
1552.52 s
[unordered-containers] insert' (Data/HashMap/Internal.hs:806)
1552.52 s
[unordered-containers] delete' (Data/HashMap/Internal.hs:1124)
1552.52 s
[unordered-containers] insertNewKey (Data/HashMap/Internal.hs:848)
1552.52 s
[unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:883)
1552.52 s
[unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
1552.52 s
[unordered-containers] Missing documentation for:
1552.52 s
[unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
1552.52 s
[unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
1552.52 s
[unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
1552.52 s
[unordered-containers] Warning: 'update' is ambiguous. It is defined
1552.52 s
[unordered-containers] * at Data/HashMap/Internal.hs:1289:1
1552.52 s
[unordered-containers] * at Data/HashMap/Internal/Array.hs:341:1
1552.52 s
[unordered-containers] * at Data/HashMap/Internal/Strict.hs:296:1
1552.52 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.52 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.52 s
[unordered-containers] Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:296:1
1552.52 s
[unordered-containers] Warning: 'alter' is ambiguous. It is defined
1552.52 s
[unordered-containers] * at Data/HashMap/Internal.hs:1302:1
1552.52 s
[unordered-containers] * at Data/HashMap/Internal/Strict.hs:308:1
1552.52 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.52 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.52 s
[unordered-containers] Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:308:1
1552.52 s
[unordered-containers] Warning: 'lookup' is ambiguous. It is defined
1552.52 s
[unordered-containers] * in ‘GHC.List’
1552.52 s
[unordered-containers] * at Data/HashMap/Internal.hs:632:1
1552.52 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.52 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.52 s
[unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:632:1
1552.52 s
[unordered-containers] Warning: 'alterF' is ambiguous. It is defined
1552.52 s
[unordered-containers] * at Data/HashMap/Internal.hs:1333:1
1552.52 s
[unordered-containers] * at Data/HashMap/Internal/Strict.hs:339:1
1552.52 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.52 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.52 s
[unordered-containers] Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:339:1
1552.52 s
[unordered-containers] Warning: 'at' is out of scope.
1552.52 s
[unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
1552.52 s
[unordered-containers] Warning: 'map' is ambiguous. It is defined
1552.52 s
[unordered-containers] * in ‘GHC.Base’
1552.52 s
[unordered-containers] * at Data/HashMap/Internal.hs:1767:1
1552.52 s
[unordered-containers] * at Data/HashMap/Internal/Array.hs:461:1
1552.52 s
[unordered-containers] * at Data/HashMap/Internal/Strict.hs:557:1
1552.52 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.52 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.52 s
[unordered-containers] Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:557:1
1552.52 s
[regex] [ 2 of 48] Compiling Text.RE.REOptions ( Text/RE/REOptions.lhs, /build/ghc1345_0/ghc_70.o, /build/ghc1345_0/ghc_70.dyn_o )
1552.52 s
[unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
1552.52 s
[unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
1552.52 s
[unordered-containers] * at Data/HashSet/Internal.hs:112:21
1552.52 s
[unordered-containers] * at Data/HashSet/Internal.hs:112:1
1552.52 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.52 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.52 s
[unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
1552.52 s
[aeson] [ 4 of 32] Compiling Data.Aeson.Internal.Scientific ( src/Data/Aeson/Internal/Scientific.hs, nothing )
1552.52 s
[unordered-containers] Warning: 'empty' is ambiguous. It is defined
1552.52 s
[unordered-containers] * at Data/HashMap/Internal.hs:594:1
1552.52 s
[unordered-containers] * at Data/HashSet/Internal.hs:255:1
1552.52 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.52 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.52 s
[unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:255:1
1552.52 s
[unordered-containers] Warning: 'union' is ambiguous. It is defined
1552.52 s
[unordered-containers] * in ‘Data.OldList’
1552.52 s
[unordered-containers] * at Data/HashMap/Internal.hs:1586:1
1552.52 s
[unordered-containers] * at Data/HashSet/Internal.hs:310:1
1552.52 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.52 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.52 s
[unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:310:1
1552.52 s
[unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
1552.52 s
[unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
1552.52 s
[unordered-containers] * at Data/HashSet/Internal.hs:112:21
1552.52 s
[unordered-containers] * at Data/HashSet/Internal.hs:112:1
1552.52 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1552.52 s
[unordered-containers] by specifying the type/value namespace explicitly.
1552.52 s
[unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
1552.52 s
[unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
1552.52 s
[unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
1552.52 s
[unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
1552.52 s
[fuzzy] Preprocessing library for fuzzy-0.1.1.0..
1552.52 s
[fuzzy] Building library for fuzzy-0.1.1.0..
1552.52 s
[fuzzy] [1 of 1] Compiling Text.Fuzzy ( src/Text/Fuzzy.hs, dist/build/Text/Fuzzy.o, dist/build/Text/Fuzzy.dyn_o )
1552.52 s
[aeson] [ 5 of 32] Compiling Data.Aeson.Internal.TH ( src/Data/Aeson/Internal/TH.hs, nothing )
1552.52 s
[aeson] [ 6 of 32] Compiling Data.Aeson.Internal.Text ( src/Data/Aeson/Internal/Text.hs, nothing )
1552.53 s
[aeson] [ 7 of 32] Compiling Data.Aeson.Internal.Unescape ( src/Data/Aeson/Internal/Unescape.hs, nothing )
1552.53 s
[shake] [19 of 73] Compiling Development.Shake.Internal.FilePattern ( src/Development/Shake/Internal/FilePattern.hs, dist/build/Development/Shake/Internal/FilePattern.p_o )
1552.87 s
[regex] [ 3 of 48] Compiling Text.RE.ZeInternals.EscapeREString ( Text/RE/ZeInternals/EscapeREString.hs, nothing )
1552.90 s
[regex] [ 4 of 48] Compiling Text.RE.ZeInternals.QQ ( Text/RE/ZeInternals/QQ.hs, nothing )
1552.94 s
[regex] [ 5 of 48] Compiling Text.RE.ZeInternals.Types.Capture ( Text/RE/ZeInternals/Types/Capture.lhs, /build/ghc1345_0/ghc_72.o, /build/ghc1345_0/ghc_72.dyn_o )
1553.07 s
[unordered-containers] Warning: Data.HashMap.Internal: could not find link destinations for:
1553.07 s
[unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
1553.09 s
[unordered-containers] Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
1553.09 s
[unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
1553.11 s
[unordered-containers] Warning: Data.HashSet.Internal: could not find link destinations for:
1553.11 s
[unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
1553.12 s
[unordered-containers] Warning: Data.HashSet: could not find link destinations for:
1553.12 s
[unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
1553.12 s
[aeson] [ 8 of 32] Compiling Data.Aeson.Internal.UnescapeFromText ( src/Data/Aeson/Internal/UnescapeFromText.hs, nothing )
1553.14 s
[regex] [ 6 of 48] Compiling Text.RE.ZeInternals.Types.CaptureID ( Text/RE/ZeInternals/Types/CaptureID.hs, /build/ghc1345_0/ghc_74.o, /build/ghc1345_0/ghc_74.dyn_o )
1553.14 s
[unordered-containers] Warning: Data.HashMap.Strict: could not find link destinations for:
1553.14 s
[unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
1553.17 s
[unordered-containers] Warning: Data.HashMap.Lazy: could not find link destinations for:
1553.17 s
[unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
1553.42 s
[fuzzy] [1 of 1] Compiling Text.Fuzzy ( src/Text/Fuzzy.hs, dist/build/Text/Fuzzy.p_o )
1553.49 s
[aeson] [ 9 of 32] Compiling Data.Aeson.Key ( src/Data/Aeson/Key.hs, nothing )
1553.51 s
[regex] [ 7 of 48] Compiling Text.RE.ZeInternals.Types.LineNo ( Text/RE/ZeInternals/Types/LineNo.hs, nothing )
1553.53 s
[regex] [ 8 of 48] Compiling Text.RE.ZeInternals.Types.Match ( Text/RE/ZeInternals/Types/Match.lhs, /build/ghc1345_0/ghc_76.o, /build/ghc1345_0/ghc_76.dyn_o )
1553.64 s
[shake] [20 of 73] Compiling Development.Shake.Internal.Options ( src/Development/Shake/Internal/Options.hs, dist/build/Development/Shake/Internal/Options.p_o )
1553.96 s
[aeson] [10 of 32] Compiling Data.Aeson.Decoding.Tokens ( src/Data/Aeson/Decoding/Tokens.hs, nothing )
1554.23 s
[aeson] [11 of 32] Compiling Data.Aeson.Decoding.Internal ( src/Data/Aeson/Decoding/Internal.hs, nothing )
1554.25 s
[aeson] [12 of 32] Compiling Data.Aeson.Decoding.Text ( src/Data/Aeson/Decoding/Text.hs, nothing )
1554.54 s
[aeson] [13 of 32] Compiling Data.Aeson.Decoding.ByteString.Lazy ( src/Data/Aeson/Decoding/ByteString/Lazy.hs, nothing )
1554.68 s
[regex] [ 9 of 48] Compiling Text.RE.ZeInternals.Types.Matches ( Text/RE/ZeInternals/Types/Matches.lhs, /build/ghc1345_0/ghc_78.o, /build/ghc1345_0/ghc_78.dyn_o )
1554.87 s
[aeson] [14 of 32] Compiling Data.Aeson.Decoding.ByteString ( src/Data/Aeson/Decoding/ByteString.hs, nothing )
1554.93 s
[regex] [10 of 48] Compiling Text.RE.ZeInternals.Replace ( Text/RE/ZeInternals/Replace.lhs, nothing )
1555.19 s
[aeson] [15 of 32] Compiling Data.Aeson.KeyMap ( src/Data/Aeson/KeyMap.hs, nothing )
1555.68 s
[regex]
1555.69 s
[regex] Text/RE/ZeInternals/Replace.lhs:530:34: warning : [ GHC-63394 ] [ -Wx-partial ]
1555.69 s
[regex] In the use of ‘tail’
1555.69 s
[regex] (imported from Prelude.Compat, but defined in GHC.List):
1555.69 s
[regex] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1555.69 s
[regex] |
1555.69 s
[regex] 530 | chk xs = chk $ tail xs
1555.69 s
[regex] | ^^^^
1555.69 s
[regex] [11 of 48] Compiling Text.RE.ZeInternals.TestBench ( Text/RE/ZeInternals/TestBench.lhs, nothing )
1556.12 s
[regex] [12 of 48] Compiling Text.RE.ZeInternals.AddCaptureNames ( Text/RE/ZeInternals/AddCaptureNames.hs, nothing )
1556.15 s
[aeson] [16 of 32] Compiling Data.Aeson.Types.Generic ( src/Data/Aeson/Types/Generic.hs, nothing )
1556.16 s
[regex] [13 of 48] Compiling Text.RE.Replace ( Text/RE/Replace.hs, nothing )
1556.17 s
[regex] [14 of 48] Compiling Text.RE.ZeInternals.TestBench.Parsers ( Text/RE/ZeInternals/TestBench/Parsers.hs, nothing )
1556.20 s
[aeson] [17 of 32] Compiling Data.Aeson.Types.Internal ( src/Data/Aeson/Types/Internal.hs, nothing )
1556.29 s
[regex] [15 of 48] Compiling Text.RE.ZeInternals.PreludeMacros ( Text/RE/ZeInternals/PreludeMacros.hs, nothing )
1556.74 s
[regex] [16 of 48] Compiling Text.RE.TestBench.Parsers ( Text/RE/TestBench/Parsers.hs, nothing )
1556.74 s
[regex] [17 of 48] Compiling Text.RE.TestBench ( Text/RE/TestBench.hs, nothing )
1556.75 s
[regex] [18 of 48] Compiling Text.RE.ZeInternals.Types.Poss ( Text/RE/ZeInternals/Types/Poss.hs, nothing )
1556.89 s
[regex] [19 of 48] Compiling Text.RE.ZeInternals.Types.SearchReplace ( Text/RE/ZeInternals/Types/SearchReplace.lhs, nothing )
1556.90 s
[regex] [20 of 48] Compiling Text.RE.ZeInternals.Types.IsRegex ( Text/RE/ZeInternals/Types/IsRegex.lhs, nothing )
1556.93 s
[aeson] [18 of 32] Compiling Data.Aeson.Parser.Time ( src/Data/Aeson/Parser/Time.hs, nothing )
1556.94 s
[aeson] [19 of 32] Compiling Data.Aeson.Encoding.Builder ( src/Data/Aeson/Encoding/Builder.hs, nothing )
1557.15 s
[regex] [21 of 48] Compiling Text.RE.ZeInternals.Tools.Lex ( Text/RE/ZeInternals/Tools/Lex.lhs, nothing )
1557.18 s
[regex] [22 of 48] Compiling Text.RE.ZeInternals.NamedCaptures ( Text/RE/ZeInternals/NamedCaptures.lhs, nothing )
1557.22 s
[fuzzy] Preprocessing test suite 'tests' for fuzzy-0.1.1.0..
1557.22 s
[fuzzy] Building test suite 'tests' for fuzzy-0.1.1.0..
1557.28 s
[aeson] [20 of 32] Compiling Data.Aeson.Encoding.Internal ( src/Data/Aeson/Encoding/Internal.hs, nothing )
1557.39 s
[fuzzy] [1 of 1] Compiling Main ( tests/tests.hs, dist/build/tests/tests-tmp/Main.o )
1557.46 s
[aeson] [21 of 32] Compiling Data.Aeson.Encoding ( src/Data/Aeson/Encoding.hs, nothing )
1557.47 s
[fuzzy]
1557.47 s
[fuzzy] tests/tests.hs:48:16: warning : [ GHC-63394 ] [ -Wx-partial ]
1557.47 s
[fuzzy] In the use of ‘head’
1557.47 s
[fuzzy] (imported from Prelude, but defined in GHC.List):
1557.47 s
[fuzzy] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1557.47 s
[fuzzy] |
1557.47 s
[fuzzy] 48 | (@?=) (head (F.filter "cb" ["cab", "acb"] "" "" id True) )
1557.47 s
[fuzzy] | ^^^^
1557.47 s
[aeson] [22 of 32] Compiling Data.Aeson.Decoding.Conversion ( src/Data/Aeson/Decoding/Conversion.hs, nothing )
1557.47 s
[regex] [23 of 48] Compiling Text.RE.Tools.IsRegex ( Text/RE/Tools/IsRegex.hs, nothing )
1557.47 s
[fuzzy]
1557.47 s
[fuzzy] tests/tests.hs:49:16: warning : [ GHC-63394 ] [ -Wx-partial ]
1557.47 s
[fuzzy] In the use of ‘head’
1557.47 s
[fuzzy] (imported from Prelude, but defined in GHC.List):
1557.47 s
[fuzzy] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1557.47 s
[fuzzy] |
1557.47 s
[fuzzy] 49 | (head (F.filter "cb" ["acb"] "" "" id True))
1557.47 s
[fuzzy] | ^^^^
1557.47 s
[regex] [24 of 48] Compiling Text.RE.Tools.Lex ( Text/RE/Tools/Lex.hs, nothing )
1557.49 s
[regex] [25 of 48] Compiling Text.RE.Tools.Grep ( Text/RE/Tools/Grep.lhs, nothing )
1557.54 s
[aeson] [23 of 32] Compiling Data.Aeson.Types.FromJSON ( src/Data/Aeson/Types/FromJSON.hs, nothing )
1557.55 s
[regex] [26 of 48] Compiling Text.RE.Tools.Find ( Text/RE/Tools/Find.lhs, nothing )
1557.59 s
[regex] [27 of 48] Compiling Text.RE.Tools.Edit ( Text/RE/Tools/Edit.lhs, nothing )
1557.67 s
[regex] [28 of 48] Compiling Text.RE.Tools.Sed ( Text/RE/Tools/Sed.lhs, nothing )
1557.70 s
[regex] [29 of 48] Compiling Text.RE.Tools ( Text/RE/Tools.hs, nothing )
1557.72 s
[regex] [30 of 48] Compiling Text.RE.Summa ( Text/RE/Summa.hs, nothing )
1557.73 s
[regex] [31 of 48] Compiling Text.RE.ZeInternals.SearchReplace ( Text/RE/ZeInternals/SearchReplace.hs, nothing )
1557.78 s
[regex] [32 of 48] Compiling Text.RE.ZeInternals ( Text/RE/ZeInternals.hs, nothing )
1557.79 s
[regex] [33 of 48] Compiling Text.RE.ZeInternals.TDFA ( Text/RE/ZeInternals/TDFA.hs, nothing )
1557.95 s
[kan-extensions] Documentation created: dist/doc/html/kan-extensions/,
1557.95 s
[kan-extensions] dist/doc/html/kan-extensions/kan-extensions.txt
1557.97 s
[regex] [34 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFAEdPrime ( Text/RE/ZeInternals/SearchReplace/TDFAEdPrime.hs, nothing )
1558.00 s
[regex] [35 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.Text.Lazy ( Text/RE/ZeInternals/SearchReplace/TDFA/Text/Lazy.hs, nothing )
1558.03 s
[regex] [36 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.Text ( Text/RE/ZeInternals/SearchReplace/TDFA/Text.hs, nothing )
1558.03 s
[shake] [21 of 73] Compiling Development.Shake.Internal.FileInfo ( src/Development/Shake/Internal/FileInfo.hs, dist/build/Development/Shake/Internal/FileInfo.p_o )
1558.03 s
[shake] [22 of 73] Compiling Development.Shake.Internal.Core.Monad ( src/Development/Shake/Internal/Core/Monad.hs, dist/build/Development/Shake/Internal/Core/Monad.p_o )
1558.03 s
[shake] [23 of 73] Compiling Development.Ninja.Parse ( src/Development/Ninja/Parse.hs, dist/build/Development/Ninja/Parse.p_o )
1558.03 s
[shake] [24 of 73] Compiling General.Fence ( src/General/Fence.hs, dist/build/General/Fence.p_o )
1558.03 s
[shake] [25 of 73] Compiling General.FileLock ( src/General/FileLock.hs, dist/build/General/FileLock.p_o )
1558.03 s
[shake] [26 of 73] Compiling General.GetOpt ( src/General/GetOpt.hs, dist/build/General/GetOpt.p_o )
1558.03 s
[shake] [27 of 73] Compiling General.Intern ( src/General/Intern.hs, dist/build/General/Intern.p_o )
1558.03 s
[shake] [28 of 73] Compiling General.Ids ( src/General/Ids.hs, dist/build/General/Ids.p_o )
1558.03 s
[shake] [29 of 73] Compiling Development.Shake.Internal.History.Serialise ( src/Development/Shake/Internal/History/Serialise.hs, dist/build/Development/Shake/Internal/History/Serialise.p_o )
1558.03 s
[shake] [30 of 73] Compiling Development.Shake.Internal.History.Server ( src/Development/Shake/Internal/History/Server.hs, dist/build/Development/Shake/Internal/History/Server.p_o )
1558.03 s
[shake] [31 of 73] Compiling Development.Shake.Internal.Core.Database ( src/Development/Shake/Internal/Core/Database.hs, dist/build/Development/Shake/Internal/Core/Database.p_o )
1558.03 s
[shake] [32 of 73] Compiling General.ListBuilder ( src/General/ListBuilder.hs, dist/build/General/ListBuilder.p_o )
1558.03 s
[shake] [33 of 73] Compiling General.Makefile ( src/General/Makefile.hs, dist/build/General/Makefile.p_o )
1558.03 s
[shake] [34 of 73] Compiling General.Process ( src/General/Process.hs, dist/build/General/Process.p_o )
1558.03 s
[shake] [35 of 73] Compiling General.Thread ( src/General/Thread.hs, dist/build/General/Thread.p_o )
1558.03 s
[shake] [36 of 73] Compiling General.Chunks ( src/General/Chunks.hs, dist/build/General/Chunks.p_o )
1558.03 s
[shake] [37 of 73] Compiling General.Timing ( src/General/Timing.hs, dist/build/General/Timing.p_o )
1558.03 s
[shake] [38 of 73] Compiling General.Pool ( src/General/Pool.hs, dist/build/General/Pool.p_o )
1558.03 s
[shake] [39 of 73] Compiling Development.Shake.Internal.Core.Storage ( src/Development/Shake/Internal/Core/Storage.hs, dist/build/Development/Shake/Internal/Core/Storage.p_o )
1558.06 s
[regex] [37 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.String ( Text/RE/ZeInternals/SearchReplace/TDFA/String.hs, nothing )
1558.08 s
[regex] [38 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.Sequence ( Text/RE/ZeInternals/SearchReplace/TDFA/Sequence.hs, nothing )
1558.09 s
[kan-extensions] haddockPhase completed in 6 minutes 58 seconds
1558.09 s
[kan-extensions] Phase: installPhase
1558.10 s
[regex] [39 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.ByteString.Lazy ( Text/RE/ZeInternals/SearchReplace/TDFA/ByteString/Lazy.hs, nothing )
1558.13 s
[regex] [40 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA.ByteString ( Text/RE/ZeInternals/SearchReplace/TDFA/ByteString.hs, nothing )
1558.15 s
[regex] [41 of 48] Compiling Text.RE.ZeInternals.SearchReplace.TDFA ( Text/RE/ZeInternals/SearchReplace/TDFA.hs, nothing )
1558.17 s
[regex] [42 of 48] Compiling Text.RE.TDFA.Text.Lazy ( Text/RE/TDFA/Text/Lazy.hs, nothing )
1558.22 s
[algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
1558.22 s
[algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
1558.22 s
[algebraic-graphs]
1558.22 s
[algebraic-graphs] ============ Labelled.Graph.postSet ============
1558.22 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1558.22 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1558.22 s
[algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
1558.22 s
[algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
1558.22 s
[algebraic-graphs]
1558.22 s
[algebraic-graphs] ============ Labelled.Graph.removeVertex ============
1558.22 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1558.22 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1558.22 s
[algebraic-graphs] OK: removeVertex x (edge e x x) == empty
1558.22 s
[algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
1558.22 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1558.22 s
[algebraic-graphs]
1558.22 s
[algebraic-graphs] ============ Labelled.Graph.removeEdge ============
1558.22 s
[algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
1558.22 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1558.22 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1558.22 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1558.22 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1558.22 s
[algebraic-graphs]
1558.22 s
[algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
1558.22 s
[algebraic-graphs] OK: replaceVertex x x == id
1558.22 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1558.22 s
[algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
1558.22 s
[algebraic-graphs]
1558.22 s
[algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
1558.22 s
[algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
1558.22 s
[algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
1558.22 s
[algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
1558.22 s
[algebraic-graphs]
1558.22 s
[algebraic-graphs] ============ Labelled.Graph.transpose ============
1558.22 s
[algebraic-graphs] OK: transpose empty == empty
1558.22 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1558.23 s
[algebraic-graphs] OK: transpose (edge e x y) == edge e y x
1558.23 s
[algebraic-graphs] OK: transpose . transpose == id
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ Labelled.Graph.fmap ============
1558.23 s
[algebraic-graphs] OK: fmap f empty == empty
1558.23 s
[algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
1558.23 s
[algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
1558.23 s
[algebraic-graphs] OK: fmap id == id
1558.23 s
[algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ Labelled.Graph.emap ============
1558.23 s
[algebraic-graphs] OK: emap h empty == empty
1558.23 s
[algebraic-graphs] OK: emap h (vertex x) == vertex x
1558.23 s
[algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
1558.23 s
[algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
1558.23 s
[algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
1558.23 s
[algebraic-graphs] OK: emap id == id
1558.23 s
[algebraic-graphs] OK: emap g . emap h == emap (g . h)
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ Labelled.Graph.induce ============
1558.23 s
[algebraic-graphs] OK: induce (const True ) x == x
1558.23 s
[algebraic-graphs] OK: induce (const False) x == empty
1558.23 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1558.23 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1558.23 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ Labelled.Graph.induceJust ============
1558.23 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1558.23 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1558.23 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1558.23 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ Labelled.Graph.closure ============
1558.23 s
[algebraic-graphs] OK: closure empty == empty
1558.23 s
[algebraic-graphs] OK: closure (vertex x) == edge one x x
1558.23 s
[algebraic-graphs] OK: closure (edge e x x) == edge one x x
1558.23 s
[algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
1558.23 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1558.23 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1558.23 s
[algebraic-graphs] OK: closure . closure == closure
1558.23 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
1558.23 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1558.23 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
1558.23 s
[algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
1558.23 s
[algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
1558.23 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
1558.23 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1558.23 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1558.23 s
[algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
1558.23 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1558.23 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
1558.23 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1558.23 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1558.23 s
[algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
1558.23 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ Labelled.Graph.context ============
1558.23 s
[algebraic-graphs] OK: context (const False) x == Nothing
1558.23 s
[algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
1558.23 s
[algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
1558.23 s
[algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
1558.23 s
[algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
1558.23 s
[algebraic-graphs] OK: Axioms of non-empty graphs
1558.23 s
[algebraic-graphs] OK: Theorems of non-empty graphs
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
1558.23 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1558.23 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1558.23 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1558.23 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1558.23 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1558.23 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1558.23 s
[algebraic-graphs] OK: x <= x + y
1558.23 s
[algebraic-graphs] OK: x + y <= x * y
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
1558.23 s
[algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
1558.23 s
[algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
1558.23 s
[algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
1558.23 s
[algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
1558.23 s
[algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
1558.23 s
[algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
1558.23 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
1558.23 s
[algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
1558.23 s
[algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
1558.23 s
[algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
1558.23 s
[algebraic-graphs] OK: toNonEmpty empty == Nothing
1558.23 s
[algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
1558.23 s
[algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
1558.23 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1558.23 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1558.23 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
1558.23 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1558.23 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1558.23 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1558.23 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1558.23 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
1558.23 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1558.23 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1558.23 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1558.23 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1558.23 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1558.23 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1558.23 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
1558.23 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1558.23 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1558.23 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1558.23 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1558.23 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1558.23 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1558.23 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1558.23 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1558.23 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
1558.23 s
[algebraic-graphs] OK: vertices1 [x] == vertex x
1558.23 s
[algebraic-graphs] OK: hasVertex x . vertices1 == elem x
1558.23 s
[algebraic-graphs] OK: vertexCount . vertices1 == length . nub
1558.23 s
[algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
1558.23 s
[algebraic-graphs]
1558.23 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
1558.23 s
[algebraic-graphs] OK: edges1 [(x,y)] == edge x y
1558.23 s
[algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
1558.23 s
[algebraic-graphs] OK: edgeCount . edges1 == length . nub
1558.23 s
[algebraic-graphs]
1558.23 s
[regex] [43 of 48] Compiling Text.RE.TDFA.Text ( Text/RE/TDFA/Text.hs, nothing )
1558.26 s
[fuzzy] [2 of 2] Linking dist/build/tests/tests
1558.29 s
[kan-extensions] Installing library in /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An
1558.29 s
[regex] [44 of 48] Compiling Text.RE.TDFA.String ( Text/RE/TDFA/String.hs, nothing )
1558.34 s
[regex] [45 of 48] Compiling Text.RE.TDFA.Sequence ( Text/RE/TDFA/Sequence.hs, nothing )
1558.40 s
[regex] [46 of 48] Compiling Text.RE.TDFA.ByteString.Lazy ( Text/RE/TDFA/ByteString/Lazy.hs, nothing )
1558.46 s
[regex] [47 of 48] Compiling Text.RE.TDFA.ByteString ( Text/RE/TDFA/ByteString.hs, nothing )
1558.73 s
[regex] [48 of 48] Compiling Text.RE.TDFA ( Text/RE/TDFA.hs, nothing )
1558.77 s
[regex] Haddock coverage:
1558.78 s
[regex] 100% ( 7 / 7) in 'Text.RE'
1558.79 s
[regex] 90% ( 10 / 11) in 'Text.RE.REOptions'
1558.79 s
[regex] Missing documentation for:
1558.79 s
[regex] Module header
1558.79 s
[regex] Warning: 'CaptureOrdinal' is ambiguous. It is defined
1558.79 s
[regex] * at Text/RE/ZeInternals/Types/CaptureID.hs:36:26
1558.79 s
[regex] * at Text/RE/ZeInternals/Types/CaptureID.hs:36:1
1558.79 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.80 s
[regex] by specifying the type/value namespace explicitly.
1558.80 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/CaptureID.hs:36:1
1558.80 s
[regex] Warning: 'CaptureName' is ambiguous. It is defined
1558.80 s
[regex] * at Text/RE/ZeInternals/Types/CaptureID.hs:27:23
1558.80 s
[regex] * at Text/RE/ZeInternals/Types/CaptureID.hs:27:1
1558.80 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.80 s
[regex] by specifying the type/value namespace explicitly.
1558.80 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/CaptureID.hs:27:1
1558.81 s
[regex] Warning: 'Match' is ambiguous. It is defined
1558.81 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:60:3
1558.81 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.81 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.81 s
[regex] by specifying the type/value namespace explicitly.
1558.81 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.81 s
[regex] Warning: 'Match' is ambiguous. It is defined
1558.81 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:60:3
1558.81 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.81 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.81 s
[regex] by specifying the type/value namespace explicitly.
1558.81 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.81 s
[regex] Warning: 'Matches' is ambiguous. It is defined
1558.81 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:34:3
1558.81 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.81 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.81 s
[regex] by specifying the type/value namespace explicitly.
1558.81 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.81 s
[regex] Warning: 'phi' is out of scope.
1558.81 s
[regex] If you qualify the identifier, haddock can try to link it anyway.
1558.84 s
[regex] Warning: 'Matches' is ambiguous. It is defined
1558.84 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:34:3
1558.84 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.84 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.84 s
[regex] by specifying the type/value namespace explicitly.
1558.84 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.84 s
[regex] Warning: 'Match' is ambiguous. It is defined
1558.84 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:60:3
1558.84 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.84 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.84 s
[regex] by specifying the type/value namespace explicitly.
1558.84 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.84 s
[regex] 96% ( 54 / 56) in 'Text.RE.Replace'
1558.84 s
[regex] Missing documentation for:
1558.84 s
[regex] Module header
1558.84 s
[regex] replace (Text/RE/ZeInternals/Replace.lhs:194)
1558.84 s
[regex] Warning: 'MacroDescriptor' is ambiguous. It is defined
1558.84 s
[regex] * at Text/RE/ZeInternals/TestBench.lhs:101:3
1558.84 s
[regex] * at Text/RE/ZeInternals/TestBench.lhs:100:1
1558.84 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.84 s
[regex] by specifying the type/value namespace explicitly.
1558.84 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/TestBench.lhs:100:1
1558.84 s
[regex] 0% ( 0 / 20) in 'Text.RE.TestBench.Parsers'
1558.84 s
[regex] Missing documentation for:
1558.84 s
[regex] Module header
1558.84 s
[regex] parseInteger (Text/RE/ZeInternals/TestBench/Parsers.hs:63)
1558.84 s
[regex] parseHex (Text/RE/ZeInternals/TestBench/Parsers.hs:66)
1558.84 s
[regex] parseDouble (Text/RE/ZeInternals/TestBench/Parsers.hs:69)
1558.84 s
[regex] parseString (Text/RE/ZeInternals/TestBench/Parsers.hs:72)
1558.84 s
[regex] parseSimpleString (Text/RE/ZeInternals/TestBench/Parsers.hs:75)
1558.84 s
[regex] parseDate (Text/RE/ZeInternals/TestBench/Parsers.hs:97)
1558.84 s
[regex] parseSlashesDate (Text/RE/ZeInternals/TestBench/Parsers.hs:100)
1558.84 s
[regex] parseTimeOfDay (Text/RE/ZeInternals/TestBench/Parsers.hs:103)
1558.84 s
[regex] parseTimeZone (Text/RE/ZeInternals/TestBench/Parsers.hs:106)
1558.84 s
[regex] parseDateTime (Text/RE/ZeInternals/TestBench/Parsers.hs:109)
1558.84 s
[regex] parseDateTime8601 (Text/RE/ZeInternals/TestBench/Parsers.hs:112)
1558.84 s
[regex] parseDateTimeCLF (Text/RE/ZeInternals/TestBench/Parsers.hs:115)
1558.84 s
[regex] parseShortMonth (Text/RE/ZeInternals/TestBench/Parsers.hs:118)
1558.85 s
[regex] shortMonthArray (Text/RE/ZeInternals/TestBench/Parsers.hs:135)
1558.85 s
[regex] IPV4Address (Text/RE/ZeInternals/TestBench/Parsers.hs:138)
1558.85 s
[regex] parseIPv4Address (Text/RE/ZeInternals/TestBench/Parsers.hs:141)
1558.85 s
[regex] Severity (Text/RE/ZeInternals/TestBench/Parsers.hs:155)
1558.85 s
[regex] parseSeverity (Text/RE/ZeInternals/TestBench/Parsers.hs:167)
1558.85 s
[regex] severityKeywords (Text/RE/ZeInternals/TestBench/Parsers.hs:178)
1558.85 s
[regex] 82% ( 23 / 28) in 'Text.RE.TestBench'
1558.85 s
[regex] Missing documentation for:
1558.85 s
[regex] Module header
1558.85 s
[regex] presentRegexType (Text/RE/ZeInternals/TestBench.lhs:80)
1558.85 s
[regex] mdRegexSource (Text/RE/ZeInternals/TestBench.lhs:499)
1558.85 s
[regex] runTests (Text/RE/ZeInternals/TestBench.lhs:199)
1558.85 s
[regex] runTests' (Text/RE/ZeInternals/TestBench.lhs:211)
1558.85 s
[regex] 0% ( 0 / 4) in 'Text.RE.ZeInternals.Types.Poss'
1558.85 s
[regex] Missing documentation for:
1558.85 s
[regex] Module header
1558.85 s
[regex] Poss (Text/RE/ZeInternals/Types/Poss.hs:8)
1558.85 s
[regex] poss (Text/RE/ZeInternals/Types/Poss.hs:36)
1558.85 s
[regex] poss2either (Text/RE/ZeInternals/Types/Poss.hs:40)
1558.85 s
[regex] Warning: '$$' is out of scope.
1558.85 s
[regex] If you qualify the identifier, haddock can try to link it anyway.
1558.85 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1558.85 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1558.85 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.85 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.85 s
[regex] by specifying the type/value namespace explicitly.
1558.85 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.86 s
[regex] 85% ( 6 / 7) in 'Text.RE.Tools.IsRegex'
1558.86 s
[regex] Missing documentation for:
1558.86 s
[regex] Module header
1558.86 s
[regex] 91% ( 11 / 12) in 'Text.RE.Tools.Lex'
1558.86 s
[regex] Missing documentation for:
1558.86 s
[regex] Module header
1558.86 s
[regex] Warning: 'Line' is ambiguous. It is defined
1558.86 s
[regex] * at Text/RE/Tools/Grep.lhs:61:3
1558.86 s
[regex] * at Text/RE/Tools/Grep.lhs:60:1
1558.86 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.86 s
[regex] by specifying the type/value namespace explicitly.
1558.86 s
[regex] Defaulting to the one defined at Text/RE/Tools/Grep.lhs:60:1
1558.86 s
[regex] Warning: 'Matches' is ambiguous. It is defined
1558.86 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:34:3
1558.86 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.86 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.86 s
[regex] by specifying the type/value namespace explicitly.
1558.86 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.87 s
[regex] Warning: 'velocity' is out of scope.
1558.87 s
[regex] If you qualify the identifier, haddock can try to link it anyway.
1558.87 s
[regex] 95% ( 22 / 23) in 'Text.RE.Tools.Grep'
1558.87 s
[regex] Missing documentation for:
1558.87 s
[regex] Module header
1558.87 s
[regex] 92% ( 12 / 13) in 'Text.RE.Tools.Find'
1558.87 s
[regex] Missing documentation for:
1558.87 s
[regex] Module header
1558.88 s
[regex] Warning: 'LineEdit' is ambiguous. It is defined
1558.88 s
[regex] * at Text/RE/Tools/Edit.lhs:56:5
1558.88 s
[regex] * at Text/RE/Tools/Edit.lhs:61:1
1558.88 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.88 s
[regex] by specifying the type/value namespace explicitly.
1558.88 s
[regex] Defaulting to the one defined at Text/RE/Tools/Edit.lhs:61:1
1558.88 s
[regex] 95% ( 20 / 21) in 'Text.RE.Tools.Edit'
1558.88 s
[regex] Missing documentation for:
1558.88 s
[regex] Module header
1558.88 s
[regex] 95% ( 23 / 24) in 'Text.RE.Tools.Sed'
1558.88 s
[regex] Missing documentation for:
1558.88 s
[regex] Module header
1558.88 s
[regex] 97% ( 41 / 42) in 'Text.RE.Tools'
1558.88 s
[regex] Missing documentation for:
1558.88 s
[regex] Module header
1558.88 s
[regex] 83% ( 5 / 6) in 'Text.RE.Summa'
1558.88 s
[regex] Missing documentation for:
1558.88 s
[regex] Module header
1558.88 s
[regex] Warning: 'SearcgReplace' is out of scope.
1558.88 s
[regex] If you qualify the identifier, haddock can try to link it anyway.
1558.89 s
[regex] 87% ( 36 / 41) in 'Text.RE.ZeInternals'
1558.89 s
[regex] Missing documentation for:
1558.89 s
[regex] Module header
1558.89 s
[regex] formatTokens0 (Text/RE/ZeInternals/NamedCaptures.lhs:221)
1558.89 s
[regex] mkTDFA (Text/RE/ZeInternals/TestBench.lhs:76)
1558.89 s
[regex] mkPCRE (Text/RE/ZeInternals/TestBench.lhs:77)
1558.89 s
[regex] badMacros (Text/RE/ZeInternals/TestBench.lhs:185)
1558.89 s
[regex] Warning: 'REOptions' is ambiguous. It is defined
1558.89 s
[regex] * at Text/RE/REOptions.lhs:65:3
1558.89 s
[regex] * at Text/RE/ZeInternals/TDFA.hs:131:1
1558.89 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.89 s
[regex] by specifying the type/value namespace explicitly.
1558.89 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/TDFA.hs:131:1
1558.89 s
[regex] Warning: 'SimpleReOptions' is out of scope.
1558.89 s
[regex] If you qualify the identifier, haddock can try to link it anyway.
1558.89 s
[regex] Warning: 'RE' is ambiguous. It is defined
1558.89 s
[regex] * at Text/RE/ZeInternals/TDFA.hs:88:3
1558.89 s
[regex] * at Text/RE/ZeInternals/TDFA.hs:87:1
1558.89 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.89 s
[regex] by specifying the type/value namespace explicitly.
1558.89 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/TDFA.hs:87:1
1558.90 s
[regex] Warning: 's' is out of scope.
1558.90 s
[regex] If you qualify the identifier, haddock can try to link it anyway.
1558.90 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1558.90 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1558.90 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.90 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.90 s
[regex] by specifying the type/value namespace explicitly.
1558.90 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.90 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1558.90 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1558.90 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.90 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.90 s
[regex] by specifying the type/value namespace explicitly.
1558.90 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.91 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1558.91 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1558.91 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.91 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.91 s
[regex] by specifying the type/value namespace explicitly.
1558.91 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.91 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1558.91 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1558.92 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.92 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.92 s
[regex] by specifying the type/value namespace explicitly.
1558.92 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.92 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1558.92 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1558.92 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.92 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.92 s
[regex] by specifying the type/value namespace explicitly.
1558.92 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.92 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1558.92 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1558.92 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.92 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.92 s
[regex] by specifying the type/value namespace explicitly.
1558.92 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.93 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1558.93 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1558.93 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.93 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.93 s
[regex] by specifying the type/value namespace explicitly.
1558.93 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.94 s
[regex] Warning: 'Matches' is ambiguous. It is defined
1558.94 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:34:3
1558.94 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.95 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.95 s
[regex] by specifying the type/value namespace explicitly.
1558.95 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.95 s
[regex] Warning: 'Match' is ambiguous. It is defined
1558.95 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:60:3
1558.95 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.95 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.95 s
[regex] by specifying the type/value namespace explicitly.
1558.95 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.95 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1558.95 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1558.95 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.95 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.95 s
[regex] by specifying the type/value namespace explicitly.
1558.95 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.95 s
[regex] Warning: 'SimpleReOptions' is out of scope.
1558.95 s
[regex] If you qualify the identifier, haddock can try to link it anyway.
1558.95 s
[regex] 98% ( 70 / 71) in 'Text.RE.TDFA.Text.Lazy'
1558.95 s
[regex] Missing documentation for:
1558.95 s
[regex] Module header
1558.96 s
[regex] Warning: 'Matches' is ambiguous. It is defined
1558.96 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:34:3
1558.96 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.96 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.96 s
[regex] by specifying the type/value namespace explicitly.
1558.96 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.96 s
[regex] Warning: 'Match' is ambiguous. It is defined
1558.96 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:60:3
1558.96 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.96 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.96 s
[regex] by specifying the type/value namespace explicitly.
1558.96 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.96 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1558.96 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1558.96 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.96 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.96 s
[regex] by specifying the type/value namespace explicitly.
1558.96 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.96 s
[regex] Warning: 'SimpleReOptions' is out of scope.
1558.96 s
[regex] If you qualify the identifier, haddock can try to link it anyway.
1558.96 s
[regex] 98% ( 70 / 71) in 'Text.RE.TDFA.Text'
1558.96 s
[regex] Missing documentation for:
1558.96 s
[regex] Module header
1558.96 s
[regex] Warning: 'Matches' is ambiguous. It is defined
1558.96 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:34:3
1558.96 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.96 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.96 s
[regex] by specifying the type/value namespace explicitly.
1558.96 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.97 s
[regex] Warning: 'Match' is ambiguous. It is defined
1558.97 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:60:3
1558.97 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.97 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.97 s
[regex] by specifying the type/value namespace explicitly.
1558.97 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.97 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1558.97 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1558.97 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.97 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.97 s
[regex] by specifying the type/value namespace explicitly.
1558.97 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.97 s
[regex] Warning: 'SimpleReOptions' is out of scope.
1558.97 s
[regex] If you qualify the identifier, haddock can try to link it anyway.
1558.97 s
[regex] 98% ( 70 / 71) in 'Text.RE.TDFA.String'
1558.97 s
[regex] Missing documentation for:
1558.97 s
[regex] Module header
1558.97 s
[regex] Warning: 'Matches' is ambiguous. It is defined
1558.97 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:34:3
1558.97 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.97 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.97 s
[regex] by specifying the type/value namespace explicitly.
1558.97 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.97 s
[regex] Warning: 'Match' is ambiguous. It is defined
1558.98 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:60:3
1558.98 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.98 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.98 s
[regex] by specifying the type/value namespace explicitly.
1558.98 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.98 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1558.98 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1558.98 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.98 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.98 s
[regex] by specifying the type/value namespace explicitly.
1558.98 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.98 s
[regex] Warning: 'SimpleReOptions' is out of scope.
1558.98 s
[regex] If you qualify the identifier, haddock can try to link it anyway.
1558.98 s
[regex] 98% ( 70 / 71) in 'Text.RE.TDFA.Sequence'
1558.98 s
[regex] Missing documentation for:
1558.98 s
[regex] Module header
1558.98 s
[regex] Warning: 'Matches' is ambiguous. It is defined
1558.98 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:34:3
1558.98 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.98 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.99 s
[regex] by specifying the type/value namespace explicitly.
1558.99 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.99 s
[regex] Warning: 'Match' is ambiguous. It is defined
1558.99 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:60:3
1558.99 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.99 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.99 s
[regex] by specifying the type/value namespace explicitly.
1558.99 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.99 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1558.99 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1558.99 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.99 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.99 s
[regex] by specifying the type/value namespace explicitly.
1558.99 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.99 s
[regex] Warning: 'SimpleReOptions' is out of scope.
1558.99 s
[regex] If you qualify the identifier, haddock can try to link it anyway.
1558.99 s
[regex] 98% ( 70 / 71) in 'Text.RE.TDFA.ByteString.Lazy'
1558.99 s
[regex] Missing documentation for:
1558.99 s
[regex] Module header
1558.99 s
[regex] Warning: 'Matches' is ambiguous. It is defined
1558.99 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:34:3
1558.99 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.99 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.99 s
[regex] by specifying the type/value namespace explicitly.
1558.99 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1558.99 s
[regex] Warning: 'Match' is ambiguous. It is defined
1558.99 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:60:3
1558.99 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.99 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.99 s
[regex] by specifying the type/value namespace explicitly.
1558.99 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Match.lhs:59:1
1558.99 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1558.99 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1558.99 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1558.99 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1558.99 s
[regex] by specifying the type/value namespace explicitly.
1558.99 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1559.00 s
[regex] Warning: 'SimpleReOptions' is out of scope.
1559.00 s
[regex] If you qualify the identifier, haddock can try to link it anyway.
1559.00 s
[regex] 98% ( 70 / 71) in 'Text.RE.TDFA.ByteString'
1559.00 s
[regex] Missing documentation for:
1559.00 s
[regex] Module header
1559.01 s
[regex] Warning: 'Matches' is ambiguous. It is defined
1559.01 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:34:3
1559.01 s
[regex] * at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1559.01 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1559.01 s
[regex] by specifying the type/value namespace explicitly.
1559.01 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Matches.lhs:33:1
1559.01 s
[regex] Warning: 'Match' is ambiguous. It is defined
1559.01 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:60:3
1559.01 s
[regex] * at Text/RE/ZeInternals/Types/Match.lhs:59:1
1559.01 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1559.01 s
[regex] by specifying the type/value namespace explicitly.
1559.01 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/Match.lhs:59:1
1559.01 s
[regex] Warning: 'SearchReplace' is ambiguous. It is defined
1559.01 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:11:3
1559.01 s
[regex] * at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1559.01 s
[regex] You may be able to disambiguate the identifier by qualifying it or
1559.01 s
[regex] by specifying the type/value namespace explicitly.
1559.01 s
[regex] Defaulting to the one defined at Text/RE/ZeInternals/Types/SearchReplace.lhs:10:1
1559.01 s
[regex] Warning: 'SimpleReOptions' is out of scope.
1559.01 s
[regex] If you qualify the identifier, haddock can try to link it anyway.
1559.02 s
[regex] Cannot find documentation for: $prelude
1559.02 s
[regex] 98% ( 94 / 95) in 'Text.RE.TDFA'
1559.02 s
[regex] Missing documentation for:
1559.02 s
[regex] Module header
1559.15 s
[kan-extensions] Phase: fixupPhase
1559.19 s
[kan-extensions] shrinking RPATHs of ELF executables and libraries in /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6
1559.20 s
[kan-extensions] shrinking /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSkan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An-ghc9.8.1.so
1559.23 s
[kan-extensions] checking for references to /build/ in /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6...
1559.26 s
[kan-extensions] patching script interpreter paths in /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6
1559.27 s
[kan-extensions] stripping (with command strip and flags -S -p) in /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6/lib
1559.60 s
[kan-extensions] shrinking RPATHs of ELF executables and libraries in /nix/store/71fs2683vypxzjif0mirrkm6f2vva1gd-kan-extensions-5.2.6-doc
1559.62 s
[kan-extensions] checking for references to /build/ in /nix/store/71fs2683vypxzjif0mirrkm6f2vva1gd-kan-extensions-5.2.6-doc...
1559.64 s
[kan-extensions] patching script interpreter paths in /nix/store/71fs2683vypxzjif0mirrkm6f2vva1gd-kan-extensions-5.2.6-doc
1559.93 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/71fs2683vypxzjif0mirrkm6f2vva1gd-kan-extensions-5.2.6-doc /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6
1560.59 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1560.63 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/71fs2683vypxzjif0mirrkm6f2vva1gd-kan-extensions-5.2.6-doc /nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6
1560.72 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1560.79 s
[post-build-hook] copying 1 paths...
1560.79 s
[post-build-hook] copying path '/nix/store/msl13xmmk8ipngg0dw7yxgihm6fyzm11-kan-extensions-5.2.6' to 'https://cache.nix-ci.com'...
1564.44 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1564.67 s
[post-build-hook] copying 0 paths...
1564.74 s
Progress: 91 of 171 built (7 building), 395 of 395 downloaded from cache
1564.90 s
Building lens
1565.02 s
Building pointed
1565.02 s
[aeson] [24 of 32] Compiling Data.Aeson.Types.ToJSON ( src/Data/Aeson/Types/ToJSON.hs, nothing )
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
1565.02 s
[algebraic-graphs] OK: overlays1 [x] == x
1565.02 s
[algebraic-graphs] OK: overlays1 [x,y] == overlay x y
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
1565.02 s
[algebraic-graphs] OK: connects1 [x] == x
1565.02 s
[algebraic-graphs] OK: connects1 [x,y] == connect x y
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
1565.02 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1565.02 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1565.02 s
[algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
1565.02 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
1565.02 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
1565.02 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1565.02 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1565.02 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1565.02 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
1565.02 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1565.02 s
[algebraic-graphs] OK: vertexCount x >= 1
1565.02 s
[algebraic-graphs] OK: vertexCount == length . vertexList1
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
1565.02 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1565.02 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1565.02 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
1565.02 s
[algebraic-graphs] OK: vertexList1 (vertex x) == [x]
1565.02 s
[algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
1565.02 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1565.02 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1565.02 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1565.02 s
[algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
1565.02 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
1565.02 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1565.02 s
[algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
1565.02 s
[algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
1565.02 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1565.02 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1565.02 s
[algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
1565.02 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1565.02 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1565.02 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
1565.02 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1565.02 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1565.02 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
1565.02 s
[algebraic-graphs] OK: path1 [x] == vertex x
1565.02 s
[algebraic-graphs] OK: path1 [x,y] == edge x y
1565.02 s
[algebraic-graphs] OK: path1 . reverse == transpose . path1
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
1565.02 s
[algebraic-graphs] OK: circuit1 [x] == edge x x
1565.02 s
[algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
1565.02 s
[algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
1565.02 s
[algebraic-graphs] OK: clique1 [x] == vertex x
1565.02 s
[algebraic-graphs] OK: clique1 [x,y] == edge x y
1565.02 s
[algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
1565.02 s
[algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
1565.02 s
[algebraic-graphs] OK: clique1 . reverse == transpose . clique1
1565.02 s
[algebraic-graphs]
1565.02 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
1565.02 s
[algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1565.02 s
[algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
1565.02 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
1565.03 s
[algebraic-graphs] OK: star x [] == vertex x
1565.03 s
[algebraic-graphs] OK: star x [y] == edge x y
1565.03 s
[algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
1565.03 s
[algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
1565.03 s
[algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
1565.03 s
[algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
1565.03 s
[algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
1565.03 s
[algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
1565.03 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1565.03 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
1565.03 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1565.03 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
1565.03 s
[fuzzy] Phase: checkPhase
1565.03 s
[fuzzy] Running 1 test suites...
1565.03 s
[fuzzy] Test suite tests: RUNNING...
1565.03 s
[fuzzy] ### Failure in: 1:match:3:should be case sensitive is specified:0
1565.03 s
[fuzzy] tests/tests.hs:37
1565.03 s
[fuzzy] expected: Nothing
1565.03 s
[fuzzy] but got: Just (Fuzzy {original = "Haskell", rendered = "Haskell", score = 26})
1565.03 s
[fuzzy] Cases: 14 Tried: 14 Errors: 0 Failures: 1
1565.03 s
[fuzzy] Test suite tests: PASS
1565.03 s
[fuzzy] Test suite logged to: dist/test/fuzzy-0.1.1.0-tests.log
1565.03 s
[fuzzy] 1 of 1 test suites (1 of 1 test cases) passed.
1565.03 s
[fuzzy] Phase: haddockPhase
1565.03 s
[fuzzy] Preprocessing library for fuzzy-0.1.1.0..
1565.03 s
[fuzzy] Running Haddock on library for fuzzy-0.1.1.0..
1565.03 s
[fuzzy] Warning: The documentation for the following packages are not installed. No
1565.03 s
[fuzzy] links will be generated to these packages: vector-0.13.2.0
1565.03 s
[fuzzy] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1565.03 s
[fuzzy] [1 of 1] Compiling Text.Fuzzy ( src/Text/Fuzzy.hs, nothing )
1565.03 s
[fuzzy] Haddock coverage:
1565.03 s
[fuzzy] Warning: 'filter' is ambiguous. It is defined
1565.03 s
[fuzzy] * in ‘GHC.List’
1565.03 s
[fuzzy] * at src/Text/Fuzzy.hs:81:1
1565.03 s
[fuzzy] You may be able to disambiguate the identifier by qualifying it or
1565.03 s
[fuzzy] by specifying the type/value namespace explicitly.
1565.03 s
[fuzzy] Defaulting to the one defined at src/Text/Fuzzy.hs:81:1
1565.03 s
[fuzzy] 100% ( 6 / 6) in 'Text.Fuzzy'
1565.03 s
[regex] Warning: Text.RE.Replace: could not find link destinations for:
1565.03 s
[regex] - Text.RE.ZeInternals.Types.Match.RegexFix
1565.03 s
[regex] Warning: Text.RE.TestBench: could not find link destinations for:
1565.03 s
[regex] - Text.RE.ZeInternals.Types.Match.RegexFix
1565.03 s
[regex] - Text.RE.ZeInternals.TestBench.FunctionID
1565.03 s
[regex] - Text.RE.ZeInternals.TestBench.TestResult
1565.03 s
[regex] Warning: Text.RE.ZeInternals: could not find link destinations for:
1565.03 s
[regex] - Text.RE.ZeInternals.TestBench.TestBenchMatcher
1565.03 s
[regex] - Text.RE.ZeInternals.NamedCaptures.FormatTokenREOptions
1565.03 s
[regex] - Text.RE.ZeInternals.NamedCaptures.Rep_Token
1565.03 s
[regex] Warning: Text.RE.TDFA.Text.Lazy: could not find link destinations for:
1565.03 s
[regex] - Text.RE.ZeInternals.Types.Match.RegexFix
1565.03 s
[regex] Warning: Text.RE.TDFA.Text: could not find link destinations for:
1565.03 s
[regex] - Text.RE.ZeInternals.Types.Match.RegexFix
1565.03 s
[regex] Warning: Text.RE.TDFA.String: could not find link destinations for:
1565.03 s
[regex] - Text.RE.ZeInternals.Types.Match.RegexFix
1565.03 s
[regex] Warning: Text.RE.TDFA.Sequence: could not find link destinations for:
1565.03 s
[regex] - Text.RE.ZeInternals.Types.Match.RegexFix
1565.03 s
[regex] Warning: Text.RE.TDFA.ByteString.Lazy: could not find link destinations for:
1565.03 s
[regex] - Text.RE.ZeInternals.Types.Match.RegexFix
1565.03 s
[regex] Warning: Text.RE.TDFA.ByteString: could not find link destinations for:
1565.03 s
[regex] - Text.RE.ZeInternals.Types.Match.RegexFix
1565.03 s
[regex] Warning: Text.RE.TDFA: could not find link destinations for:
1565.03 s
[regex] - Text.RE.ZeInternals.Types.Match.RegexFix
1565.03 s
[shake] [40 of 73] Compiling General.TypeMap ( src/General/TypeMap.hs, dist/build/General/TypeMap.p_o )
1565.03 s
[shake] [41 of 73] Compiling General.Wait ( src/General/Wait.hs, dist/build/General/Wait.p_o )
1565.03 s
[shake] [42 of 73] Compiling Development.Shake.Internal.History.Shared ( src/Development/Shake/Internal/History/Shared.hs, dist/build/Development/Shake/Internal/History/Shared.p_o )
1565.03 s
[shake] [43 of 73] Compiling Development.Shake.Internal.History.Cloud ( src/Development/Shake/Internal/History/Cloud.hs, dist/build/Development/Shake/Internal/History/Cloud.p_o )
1565.03 s
[shake] [44 of 73] Compiling Development.Shake.Internal.Core.Types ( src/Development/Shake/Internal/Core/Types.hs, dist/build/Development/Shake/Internal/Core/Types.p_o )
1565.03 s
[shake] [45 of 73] Compiling Development.Shake.Internal.Core.Rules ( src/Development/Shake/Internal/Core/Rules.hs, dist/build/Development/Shake/Internal/Core/Rules.p_o )
1565.03 s
[shake] [46 of 73] Compiling Development.Shake.Internal.Core.Pool ( src/Development/Shake/Internal/Core/Pool.hs, dist/build/Development/Shake/Internal/Core/Pool.p_o )
1565.03 s
[shake] [47 of 73] Compiling Development.Shake.Internal.Core.Action ( src/Development/Shake/Internal/Core/Action.hs, dist/build/Development/Shake/Internal/Core/Action.p_o )
1565.03 s
[unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
1565.03 s
[unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
1565.03 s
[unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
1565.03 s
[unordered-containers] Phase: installPhase
1565.03 s
[unordered-containers] Installing library in /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1565.03 s
[algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
1565.03 s
[algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
1565.03 s
[algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
1565.03 s
[algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
1565.03 s
[algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
1565.03 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
1565.03 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1565.03 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1565.03 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
1565.03 s
[algebraic-graphs] OK: replaceVertex x x == id
1565.03 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1565.03 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
1565.03 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1565.03 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1565.03 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1565.03 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
1565.03 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1565.03 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1565.03 s
[algebraic-graphs] OK: transpose . transpose == id
1565.03 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
1565.03 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1565.03 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1565.03 s
[algebraic-graphs] OK: gmap id == id
1565.03 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
1565.03 s
[algebraic-graphs] OK: induce1 (const True ) x == Just x
1565.03 s
[algebraic-graphs] OK: induce1 (const False) x == Nothing
1565.03 s
[algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
1565.03 s
[algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
1565.03 s
[algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
1565.03 s
[algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
1565.03 s
[algebraic-graphs] OK: induceJust1 . gmap Just == Just
1565.03 s
[algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
1565.03 s
[algebraic-graphs] OK: closure (vertex x) == edge x x
1565.03 s
[algebraic-graphs] OK: closure (edge x x) == edge x x
1565.03 s
[algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
1565.03 s
[algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
1565.03 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1565.03 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1565.03 s
[algebraic-graphs] OK: closure . closure == closure
1565.03 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
1565.03 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
1565.03 s
[algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
1565.03 s
[algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
1565.03 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
1565.03 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1565.03 s
[algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
1565.03 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1565.03 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
1565.03 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1565.03 s
[algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
1565.03 s
[algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
1565.03 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1565.03 s
[algebraic-graphs]
1565.03 s
[algebraic-graphs] ============ NonEmpty.Graph.============
1565.04 s
[algebraic-graphs] OK: Axioms of non-empty graphs
1565.04 s
[algebraic-graphs] OK: Theorems of non-empty graphs
1565.04 s
[algebraic-graphs]
1565.04 s
[algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
1565.04 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1565.04 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1565.04 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1565.04 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1565.04 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1565.04 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1565.04 s
[algebraic-graphs] OK: x <= x + y
1565.04 s
[algebraic-graphs] OK: x + y <= x * y
1565.04 s
[algebraic-graphs]
1565.04 s
[algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
1565.04 s
[algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
1565.04 s
[algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
1565.04 s
[algebraic-graphs] OK: fmap id == id
1565.04 s
[algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
1565.04 s
[algebraic-graphs]
1565.04 s
[algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
1565.04 s
[algebraic-graphs] OK: (vertex x >>= f) == f x
1565.12 s
[unordered-containers] Phase: fixupPhase
1565.17 s
[unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20
1565.18 s
[unordered-containers] shrinking /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSunordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq-ghc9.8.1.so
1565.20 s
[unordered-containers] checking for references to /build/ in /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20...
1565.23 s
[unordered-containers] patching script interpreter paths in /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20
1565.26 s
[unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20/lib
1565.26 s
[pointed] Phase: setupCompilerEnvironmentPhase
1565.27 s
[aeson]
1565.27 s
[aeson] src/Data/Aeson/Types/ToJSON.hs:1615:23: warning : [ GHC-68441 ] [ -Wdeprecations ]
1565.28 s
[aeson] In the use of data constructor ‘Solo’
1565.28 s
[aeson] (imported from Data.Tuple.Solo, but defined in GHC.Tuple):
1565.28 s
[aeson] Deprecated: "The Solo constructor has been renamed to MkSolo to avoid punning."
1565.28 s
[aeson] |
1565.28 s
[aeson] 1615 | liftToJSON _ t _ (Solo a) = t a
1565.28 s
[aeson] | ^^^^
1565.28 s
[aeson]
1565.28 s
[aeson] src/Data/Aeson/Types/ToJSON.hs:1618:27: warning : [ GHC-68441 ] [ -Wdeprecations ]
1565.28 s
[aeson] In the use of data constructor ‘Solo’
1565.28 s
[aeson] (imported from Data.Tuple.Solo, but defined in GHC.Tuple):
1565.28 s
[aeson] Deprecated: "The Solo constructor has been renamed to MkSolo to avoid punning."
1565.28 s
[aeson] |
1565.28 s
[aeson] 1618 | liftToEncoding _ t _ (Solo a) = t a
1565.28 s
[aeson] | ^^^^
1565.28 s
[pointed] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1565.31 s
[lens] Phase: setupCompilerEnvironmentPhase
1565.32 s
[lens] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1565.33 s
[aeson] [25 of 32] Compiling Data.Aeson.Types.Class ( src/Data/Aeson/Types/Class.hs, nothing )
1565.36 s
[aeson] [26 of 32] Compiling Data.Aeson.Types ( src/Data/Aeson/Types.hs, nothing )
1565.37 s
[aeson] [27 of 32] Compiling Data.Aeson.Text ( src/Data/Aeson/Text.hs, nothing )
1565.44 s
[aeson] [28 of 32] Compiling Data.Aeson.Decoding ( src/Data/Aeson/Decoding.hs, nothing )
1565.54 s
[aeson] [29 of 32] Compiling Data.Aeson ( src/Data/Aeson.hs, nothing )
1565.67 s
[unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/w05py57xs6l3yqdyn4vf7shdkxabiy5h-unordered-containers-0.2.20-doc
1565.69 s
[unordered-containers] checking for references to /build/ in /nix/store/w05py57xs6l3yqdyn4vf7shdkxabiy5h-unordered-containers-0.2.20-doc...
1565.72 s
[unordered-containers] patching script interpreter paths in /nix/store/w05py57xs6l3yqdyn4vf7shdkxabiy5h-unordered-containers-0.2.20-doc
1566.02 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20 /nix/store/w05py57xs6l3yqdyn4vf7shdkxabiy5h-unordered-containers-0.2.20-doc
1566.87 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1566.99 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20 /nix/store/w05py57xs6l3yqdyn4vf7shdkxabiy5h-unordered-containers-0.2.20-doc
1567.14 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1567.24 s
[post-build-hook] copying 1 paths...
1567.24 s
[post-build-hook] copying path '/nix/store/h10gcld6qq126cr23lpyh6npw076wfk5-unordered-containers-0.2.20' to 'https://cache.nix-ci.com'...
1571.93 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1572.09 s
[post-build-hook] copying 0 paths...
1572.15 s
Progress: 92 of 171 built (8 building), 395 of 395 downloaded from cache
1572.33 s
Building quickcheck-instances
1572.33 s
[aeson] [30 of 32] Compiling Data.Aeson.RFC8785 ( src/Data/Aeson/RFC8785.hs, nothing )
1572.33 s
[aeson] [31 of 32] Compiling Data.Aeson.QQ.Simple ( src/Data/Aeson/QQ/Simple.hs, nothing )
1572.33 s
[aeson] [32 of 32] Compiling Data.Aeson.TH ( src/Data/Aeson/TH.hs, nothing )
1572.33 s
[aeson] Haddock coverage:
1572.33 s
[aeson] Warning: Data.Aeson.Internal.Prelude: Could not find documentation for exported module: Data.Vector
1572.33 s
[aeson] Warning: Data.Aeson.Internal.Prelude: Couldn't find .haddock for export Vector
1572.33 s
[aeson] Warning: 'letE' is out of scope.
1572.33 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.33 s
[aeson] Warning: 'Key' is ambiguous. It is defined
1572.33 s
[aeson] * at src/Data/Aeson/Key.hs:44:15
1572.33 s
[aeson] * at src/Data/Aeson/Key.hs:44:1
1572.33 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1572.33 s
[aeson] by specifying the type/value namespace explicitly.
1572.33 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Key.hs:44:1
1572.33 s
[aeson] Warning: 'Coercible' is out of scope.
1572.33 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.33 s
[aeson] Warning: 'coercing' is out of scope.
1572.33 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.33 s
[aeson] 44% ( 4 / 9) in 'Data.Aeson.Key'
1572.33 s
[aeson] Missing documentation for:
1572.33 s
[aeson] Key (src/Data/Aeson/Key.hs:44)
1572.33 s
[aeson] fromString (src/Data/Aeson/Key.hs:48)
1572.33 s
[aeson] toString (src/Data/Aeson/Key.hs:51)
1572.33 s
[aeson] toText (src/Data/Aeson/Key.hs:57)
1572.33 s
[aeson] fromText (src/Data/Aeson/Key.hs:54)
1572.33 s
[aeson] 100% ( 7 / 7) in 'Data.Aeson.Decoding.Tokens'
1572.33 s
[aeson] Warning: 'Text' is ambiguous. It is defined
1572.33 s
[aeson] * in ‘Data.Text.Internal’
1572.33 s
[aeson] * in ‘Data.Text.Internal’
1572.33 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1572.33 s
[aeson] by specifying the type/value namespace explicitly.
1572.33 s
[aeson] Defaulting to the one defined in ‘Data.Text.Internal’
1572.33 s
[aeson] Warning: 'ByteString' is out of scope.
1572.33 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.33 s
[aeson] 100% ( 2 / 2) in 'Data.Aeson.Decoding.Text'
1572.33 s
[aeson] Warning: 'ByteString' is ambiguous. It is defined
1572.33 s
[aeson] * in ‘Data.ByteString.Internal.Type’
1572.33 s
[aeson] * in ‘Data.ByteString.Lazy.Internal’
1572.33 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1572.33 s
[aeson] by specifying the type/value namespace explicitly.
1572.33 s
[aeson] Defaulting to the one defined in ‘Data.ByteString.Lazy.Internal’
1572.33 s
[aeson] 100% ( 2 / 2) in 'Data.Aeson.Decoding.ByteString.Lazy'
1572.33 s
[aeson] 100% ( 2 / 2) in 'Data.Aeson.Decoding.ByteString'
1572.33 s
[aeson] Warning: 'v' is out of scope.
1572.33 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.33 s
[aeson] Warning: 'alterF' is ambiguous. It is defined
1572.33 s
[aeson] * at src/Data/Aeson/KeyMap.hs:173:1
1572.33 s
[aeson] * in ‘Data.Map.Strict.Internal’
1572.33 s
[aeson] * in ‘Data.HashMap.Internal.Strict’
1572.33 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1572.33 s
[aeson] by specifying the type/value namespace explicitly.
1572.33 s
[aeson] Defaulting to the one defined at src/Data/Aeson/KeyMap.hs:173:1
1572.33 s
[aeson] Warning: 'KeyMap' is ambiguous. It is defined
1572.33 s
[aeson] * at src/Data/Aeson/KeyMap.hs:143:20
1572.33 s
[aeson] * at src/Data/Aeson/KeyMap.hs:143:1
1572.33 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1572.33 s
[aeson] by specifying the type/value namespace explicitly.
1572.33 s
[aeson] Defaulting to the one defined at src/Data/Aeson/KeyMap.hs:143:1
1572.33 s
[aeson] Warning: 'toAscList' is ambiguous. It is defined
1572.33 s
[aeson] * at src/Data/Aeson/KeyMap.hs:264:1
1572.33 s
[aeson] * in ‘Data.Map.Internal’
1572.33 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1572.33 s
[aeson] by specifying the type/value namespace explicitly.
1572.33 s
[aeson] Defaulting to the one defined at src/Data/Aeson/KeyMap.hs:264:1
1572.33 s
[aeson] Warning: 'union' is ambiguous. It is defined
1572.33 s
[aeson] * at src/Data/Aeson/KeyMap.hs:274:1
1572.33 s
[aeson] * in ‘Data.OldList’
1572.33 s
[aeson] * in ‘Data.Map.Internal’
1572.33 s
[aeson] * in ‘Data.HashMap.Internal’
1572.33 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1572.33 s
[aeson] by specifying the type/value namespace explicitly.
1572.34 s
[aeson] Defaulting to the one defined at src/Data/Aeson/KeyMap.hs:274:1
1572.34 s
[aeson] Warning: 'unionWith' is ambiguous. It is defined
1572.34 s
[aeson] * at src/Data/Aeson/KeyMap.hs:278:1
1572.34 s
[aeson] * in ‘Data.Map.Strict.Internal’
1572.34 s
[aeson] * in ‘Data.HashMap.Internal.Strict’
1572.34 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1572.34 s
[aeson] by specifying the type/value namespace explicitly.
1572.34 s
[algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
1572.34 s
[algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
1572.34 s
[algebraic-graphs] OK: (x >>= vertex) == x
1572.34 s
[algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
1572.34 s
[algebraic-graphs] OK: toNonEmpty empty == Nothing
1572.34 s
[algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.vertex ============
1572.34 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1572.34 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1572.34 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1572.34 s
[algebraic-graphs] OK: size (vertex x) == 1
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.edge ============
1572.34 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1572.34 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1572.34 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1572.34 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1572.34 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.overlay ============
1572.34 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1572.34 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1572.34 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1572.34 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1572.34 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1572.34 s
[algebraic-graphs] OK: size (overlay x y) == size x + size y
1572.34 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1572.34 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
1572.34 s
[algebraic-graphs] OK: overlay1 empty x == x
1572.34 s
[algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.connect ============
1572.34 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1572.34 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1572.34 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1572.34 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1572.34 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1572.34 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1572.34 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1572.34 s
[algebraic-graphs] OK: size (connect x y) == size x + size y
1572.34 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1572.34 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
1572.34 s
[algebraic-graphs] OK: vertices1 [x] == vertex x
1572.34 s
[algebraic-graphs] OK: hasVertex x . vertices1 == elem x
1572.34 s
[algebraic-graphs] OK: vertexCount . vertices1 == length . nub
1572.34 s
[algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
1572.34 s
[algebraic-graphs] OK: edges1 [(x,y)] == edge x y
1572.34 s
[algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
1572.34 s
[algebraic-graphs] OK: edgeCount . edges1 == length . nub
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
1572.34 s
[algebraic-graphs] OK: overlays1 [x] == x
1572.34 s
[algebraic-graphs] OK: overlays1 [x,y] == overlay x y
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
1572.34 s
[algebraic-graphs] OK: connects1 [x] == x
1572.34 s
[algebraic-graphs] OK: connects1 [x,y] == connect x y
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
1572.34 s
[algebraic-graphs] OK: foldg1 vertex overlay connect == id
1572.34 s
[algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
1572.34 s
[algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
1572.34 s
[algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
1572.34 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1572.34 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1572.34 s
[algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
1572.34 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.(===) ============
1572.34 s
[algebraic-graphs] OK: x === x == True
1572.34 s
[algebraic-graphs] OK: x + y === x + y == True
1572.34 s
[algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
1572.34 s
[algebraic-graphs] OK: x + y === x * y == False
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.size ============
1572.34 s
[algebraic-graphs] OK: size (vertex x) == 1
1572.34 s
[algebraic-graphs] OK: size (overlay x y) == size x + size y
1572.34 s
[algebraic-graphs] OK: size (connect x y) == size x + size y
1572.34 s
[algebraic-graphs] OK: size x >= 1
1572.34 s
[algebraic-graphs] OK: size x >= vertexCount x
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
1572.34 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
1572.34 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1572.34 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1572.34 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1572.34 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
1572.34 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1572.34 s
[algebraic-graphs] OK: vertexCount x >= 1
1572.34 s
[algebraic-graphs] OK: vertexCount == length . vertexList1
1572.34 s
[algebraic-graphs]
1572.34 s
[algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
1572.34 s
[fuzzy] Documentation created: dist/doc/html/fuzzy/, dist/doc/html/fuzzy/fuzzy.txt
1572.34 s
[fuzzy] Preprocessing test suite 'tests' for fuzzy-0.1.1.0..
1572.34 s
[fuzzy] Phase: installPhase
1572.34 s
[fuzzy] Installing library in /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/fuzzy-0.1.1.0-D07bwRyz1gP5AVa7hnmyim
1572.34 s
[fuzzy] Phase: fixupPhase
1572.34 s
[fuzzy] shrinking RPATHs of ELF executables and libraries in /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0
1572.34 s
[fuzzy] shrinking /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSfuzzy-0.1.1.0-D07bwRyz1gP5AVa7hnmyim-ghc9.8.1.so
1572.34 s
[fuzzy] checking for references to /build/ in /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0...
1572.34 s
[fuzzy] patching script interpreter paths in /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0
1572.34 s
[fuzzy] stripping (with command strip and flags -S -p) in /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0/lib
1572.34 s
[fuzzy] shrinking RPATHs of ELF executables and libraries in /nix/store/mpp7jvdkajhlawsdm92i7pwzryr24g1d-fuzzy-0.1.1.0-doc
1572.34 s
[fuzzy] checking for references to /build/ in /nix/store/mpp7jvdkajhlawsdm92i7pwzryr24g1d-fuzzy-0.1.1.0-doc...
1572.34 s
[fuzzy] patching script interpreter paths in /nix/store/mpp7jvdkajhlawsdm92i7pwzryr24g1d-fuzzy-0.1.1.0-doc
1572.34 s
[lens] Phase: unpackPhase
1572.34 s
[lens] unpacking source archive /nix/store/94srckviqabk285cpndqlgjy1zidzbf2-lens-5.3.4.tar.gz
1572.34 s
[lens] source root is lens-5.3.4
1572.34 s
[lens] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "lens-5.3.4/.vim.custom"
1572.34 s
[lens] Phase: patchPhase
1572.34 s
[lens] Phase: compileBuildDriverPhase
1572.34 s
[lens] setupCompileFlags: -package-db=/build/tmp.I0RKtkRE1K/setup-package.conf.d -threaded
1572.34 s
[lens] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.I0RKtkRE1K/Main.o )
1572.34 s
[lens] [2 of 2] Linking Setup
1572.34 s
[lens] Phase: updateAutotoolsGnuConfigScriptsPhase
1572.34 s
[lens] Phase: configurePhase
1572.34 s
[lens] configureFlags: --verbose --prefix=/nix/store/xm64yi40bcp0a1svvgspxj3mfi95zzfg-lens-5.3.4 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/81r7cwyhx4n6hr2094i81ibh71qp5mpd-lens-5.3.4-doc/share/doc/lens-5.3.4 --with-gcc=gcc --package-db=/build/tmp.I0RKtkRE1K/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1572.34 s
[lens] Using Parsec parser
1572.34 s
[lens] Configuring lens-5.3.4...
1572.34 s
[lens] Flags chosen: benchmark-uniplate=False, dump-splices=False, inlining=True,
1572.34 s
[lens] j=False, test-hunit=True, test-properties=True, test-templates=True,
1572.34 s
[lens] trustworthy=True
1572.34 s
[lens] Dependency array >=0.5.0.0 && <0.6: using array-0.5.6.0
1572.34 s
[lens] Dependency assoc >=1.0.2 && <1.2: using assoc-1.1.1
1572.34 s
[lens] Dependency base >=4.9 && <5: using base-4.19.0.0
1572.34 s
[lens] Dependency base-orphans >=0.5.2 && <1: using base-orphans-0.9.3
1572.34 s
[lens] Dependency bifunctors >=5.5.7 && <6: using bifunctors-5.6.2
1572.34 s
[lens] Dependency bytestring >=0.10.4.0 && <0.13: using bytestring-0.12.0.2
1572.34 s
[lens] Dependency call-stack >=0.1 && <0.5: using call-stack-0.4.0
1572.34 s
[lens] Dependency comonad >=5.0.7 && <6: using comonad-5.0.9
1572.34 s
[lens] Dependency containers >=0.5.5.1 && <0.9: using containers-0.6.8
1572.34 s
[lens] Dependency contravariant >=1.4 && <2: using contravariant-1.5.5
1572.34 s
[lens] Dependency distributive >=0.5.1 && <1: using distributive-0.6.2.1
1572.34 s
[lens] Dependency exceptions >=0.8.2.1 && <1: using exceptions-0.10.7
1572.34 s
[lens] Dependency filepath >=1.2.0.0 && <1.6: using filepath-1.4.100.4
1572.34 s
[lens] Dependency free >=5.1.5 && <6: using free-5.2
1572.34 s
[lens] Dependency ghc-prim: using ghc-prim-0.11.0
1572.34 s
[lens] Dependency hashable >=1.2.7.0 && <1.6: using hashable-1.4.7.0
1572.34 s
[lens] Dependency indexed-traversable >=0.1 && <0.2: using indexed-traversable-0.1.4
1572.34 s
[lens] Dependency indexed-traversable-instances >=0.1 && <0.2: using
1572.34 s
[lens] indexed-traversable-instances-0.1.2
1572.34 s
[lens] Dependency kan-extensions >=5 && <6: using kan-extensions-5.2.6
1572.34 s
[lens] Dependency mtl >=2.2.1 && <2.4: using mtl-2.3.1
1572.34 s
[lens] Dependency parallel >=3.2.1.0 && <3.3: using parallel-3.2.2.0
1572.34 s
[lens] Dependency profunctors >=5.5.2 && <6: using profunctors-5.6.2
1572.34 s
[lens] Dependency reflection >=2.1 && <3: using reflection-2.1.9
1572.34 s
[lens] Dependency semigroupoids >=5.0.1 && <7: using semigroupoids-6.0.1
1572.34 s
[lens] Dependency strict >=0.4 && <0.6: using strict-0.5.1
1572.34 s
[lens] Dependency tagged >=0.8.6 && <1: using tagged-0.8.8
1572.35 s
[lens] Dependency template-haskell >=2.11.1.0 && <2.24: using
1572.35 s
[lens] template-haskell-2.21.0.0
1572.35 s
[lens] Dependency text >=1.2.3.0 && <2.2: using text-2.1
1572.35 s
[lens] Dependency th-abstraction >=0.4.1 && <0.8: using th-abstraction-0.7.1.0
1572.35 s
[lens] Dependency these >=1.1.1.1 && <1.3: using these-1.2.1
1572.35 s
[lens] Dependency transformers >=0.5.0.0 && <0.7: using transformers-0.6.1.0
1572.35 s
[lens] Dependency transformers-compat >=0.5.0.4 && <1: using
1572.35 s
[pointed] Phase: unpackPhase
1572.35 s
[pointed] unpacking source archive /nix/store/3bqs3pyybjh308mn3bqh91670m0m7v5y-pointed-5.0.5.tar.gz
1572.35 s
[pointed] source root is pointed-5.0.5
1572.35 s
[pointed] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pointed-5.0.5/src/Data/Pointed.hs"
1572.35 s
[pointed] Phase: patchPhase
1572.35 s
[pointed] Replace Cabal file with edited version from mirror://hackage/pointed-5.0.5/revision/1.cabal.
1572.35 s
[pointed] Phase: compileBuildDriverPhase
1572.35 s
[pointed] setupCompileFlags: -package-db=/build/tmp.3i516Up2bv/setup-package.conf.d -threaded
1572.35 s
[pointed] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.3i516Up2bv/Main.o )
1572.35 s
[pointed] [2 of 2] Linking Setup
1572.35 s
[pointed] Phase: updateAutotoolsGnuConfigScriptsPhase
1572.35 s
[pointed] Phase: configurePhase
1572.35 s
[pointed] configureFlags: --verbose --prefix=/nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/wi1zwklwcq68c9ibyp049c4irci5m077-pointed-5.0.5-doc/share/doc/pointed-5.0.5 --with-gcc=gcc --package-db=/build/tmp.3i516Up2bv/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1572.35 s
[pointed] Using Parsec parser
1572.35 s
[pointed] Configuring pointed-5.0.5...
1572.35 s
[pointed] Flags chosen: comonad=True, containers=True, kan-extensions=True,
1572.35 s
[pointed] semigroupoids=True, stm=True, tagged=True, transformers=True,
1572.35 s
[pointed] unordered-containers=True
1572.35 s
[pointed] Dependency base >=4.9 && <5: using base-4.19.0.0
1572.35 s
[pointed] Dependency comonad >=5 && <6: using comonad-5.0.9
1572.35 s
[pointed] Dependency containers >=0.4 && <0.9: using containers-0.6.8
1572.35 s
[pointed] Dependency data-default-class >=0.0.1 && <0.3: using
1572.35 s
[pointed] data-default-class-0.1.2.2
1572.35 s
[pointed] Dependency hashable >=1.1 && <1.6: using hashable-1.4.7.0
1572.35 s
[pointed] Dependency kan-extensions >=5 && <6: using kan-extensions-5.2.6
1572.35 s
[pointed] Dependency semigroupoids >=4 && <7: using semigroupoids-6.0.1
1572.35 s
[pointed] Dependency stm >=2.1.2.1 && <2.6: using stm-2.5.2.1
1572.35 s
[pointed] Dependency tagged >=0.5 && <1: using tagged-0.8.8
1572.35 s
[pointed] Dependency transformers >=0.2 && <0.7: using transformers-0.6.1.0
1572.35 s
[pointed] Dependency transformers-compat >=0.3 && <1: using transformers-compat-0.7.2
1572.35 s
[pointed] Dependency unordered-containers >=0.2 && <0.3: using
1572.35 s
[pointed] unordered-containers-0.2.20
1572.35 s
[pointed] Source component graph: component lib
1572.35 s
[pointed] Configured component graph:
1572.35 s
[pointed] component pointed-5.0.5-ArcipP7cLHIAUvoaOddqJf
1572.35 s
[pointed] include base-4.19.0.0-b960
1572.35 s
[pointed] include comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1572.35 s
[pointed] include containers-0.6.8-4775
1572.35 s
[pointed] include data-default-class-0.1.2.2-HTxb2GzgoxNAqZUhgimqiq
1572.35 s
[pointed] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1572.35 s
[pointed] include kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An
1572.35 s
[pointed] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1572.35 s
[pointed] include stm-2.5.2.1-83fa
1572.35 s
[pointed] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1572.35 s
[pointed] include transformers-0.6.1.0-c3ec
1572.35 s
[pointed] include transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
1572.35 s
[pointed] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1572.35 s
[pointed] Linked component graph:
1572.35 s
[pointed] unit pointed-5.0.5-ArcipP7cLHIAUvoaOddqJf
1572.35 s
[pointed] include base-4.19.0.0-b960
1572.35 s
[pointed] include comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1572.35 s
[pointed] include containers-0.6.8-4775
1572.35 s
[pointed] include data-default-class-0.1.2.2-HTxb2GzgoxNAqZUhgimqiq
1572.35 s
[pointed] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1572.35 s
[shake] [48 of 73] Compiling Development.Shake.Internal.Resource ( src/Development/Shake/Internal/Resource.hs, dist/build/Development/Shake/Internal/Resource.p_o )
1572.35 s
[shake] [49 of 73] Compiling Development.Shake.Internal.Core.Build ( src/Development/Shake/Internal/Core/Build.hs, dist/build/Development/Shake/Internal/Core/Build.p_o )
1572.35 s
[shake] [50 of 73] Compiling Development.Shake.Rule ( src/Development/Shake/Rule.hs, dist/build/Development/Shake/Rule.p_o )
1572.35 s
[shake] [51 of 73] Compiling Development.Shake.Internal.Rules.Rerun ( src/Development/Shake/Internal/Rules/Rerun.hs, dist/build/Development/Shake/Internal/Rules/Rerun.p_o )
1572.35 s
[shake] [52 of 73] Compiling Development.Shake.Internal.Rules.Oracle ( src/Development/Shake/Internal/Rules/Oracle.hs, dist/build/Development/Shake/Internal/Rules/Oracle.p_o )
1572.35 s
[shake] [53 of 73] Compiling Development.Shake.Internal.Rules.File ( src/Development/Shake/Internal/Rules/File.hs, dist/build/Development/Shake/Internal/Rules/File.p_o )
1572.35 s
[aeson] Defaulting to the one defined at src/Data/Aeson/KeyMap.hs:278:1
1572.35 s
[aeson] Warning: 'const' is out of scope.
1572.35 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.35 s
[aeson] Warning: 'lookup' is ambiguous. It is defined
1572.35 s
[aeson] * at src/Data/Aeson/KeyMap.hs:178:1
1572.35 s
[aeson] * in ‘GHC.List’
1572.35 s
[aeson] * in ‘Data.Map.Internal’
1572.35 s
[aeson] * in ‘Data.HashMap.Internal’
1572.35 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1572.35 s
[aeson] by specifying the type/value namespace explicitly.
1572.35 s
[aeson] Defaulting to the one defined at src/Data/Aeson/KeyMap.hs:178:1
1572.35 s
[aeson] 88% ( 61 / 69) in 'Data.Aeson.KeyMap'
1572.35 s
[aeson] Missing documentation for:
1572.35 s
[aeson] coercionToHashMap (src/Data/Aeson/KeyMap.hs:317)
1572.35 s
[aeson] coercionToMap (src/Data/Aeson/KeyMap.hs:321)
1572.35 s
[aeson] foldr (src/Data/Aeson/KeyMap.hs:206)
1572.35 s
[aeson] foldr' (src/Data/Aeson/KeyMap.hs:209)
1572.35 s
[aeson] foldl (src/Data/Aeson/KeyMap.hs:212)
1572.35 s
[aeson] foldl' (src/Data/Aeson/KeyMap.hs:215)
1572.35 s
[aeson] foldMapWithKey (src/Data/Aeson/KeyMap.hs:203)
1572.35 s
[aeson] Key (src/Data/Aeson/Key.hs:44)
1572.35 s
[aeson] Warning: 'ToJSON1' is out of scope.
1572.35 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.35 s
[aeson] Warning: 'FromJSON1' is out of scope.
1572.35 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.35 s
[aeson] Warning: 'ToJSON' is out of scope.
1572.35 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.35 s
[aeson] Warning: 'FromJSON' is out of scope.
1572.35 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.35 s
[aeson] Warning: 'throwDecode' is out of scope.
1572.35 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.35 s
[aeson] Warning: 'Generic' is ambiguous. It is defined
1572.35 s
[aeson] * in ‘GHC.Generics’
1572.35 s
[aeson] * in ‘Data.Text.Lazy.Builder.RealFloat’
1572.35 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1572.35 s
[aeson] by specifying the type/value namespace explicitly.
1572.35 s
[aeson] Defaulting to the one defined in ‘GHC.Generics’
1572.35 s
[aeson] Warning: 'JSONKeyOptions' is ambiguous. It is defined
1572.35 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:804:23
1572.35 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:804:1
1572.35 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1572.35 s
[aeson] by specifying the type/value namespace explicitly.
1572.35 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:804:1
1572.35 s
[aeson] Warning: 'toLower' is ambiguous. It is defined
1572.35 s
[aeson] * in ‘GHC.Unicode’
1572.35 s
[aeson] * in ‘Data.Text’
1572.35 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1572.35 s
[aeson] by specifying the type/value namespace explicitly.
1572.35 s
[aeson] Defaulting to the one defined in ‘Data.Text’
1572.35 s
[aeson] Warning: 'ToJSONKey' is out of scope.
1572.35 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.35 s
[aeson] Warning: 'toJSONKey' is out of scope.
1572.35 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.35 s
[aeson] Warning: 'genericToJSONKey' is out of scope.
1572.35 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.35 s
[aeson] Warning: 'FromJSONKey' is out of scope.
1572.35 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.35 s
[aeson] Warning: 'fromJSONKey' is out of scope.
1572.35 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.35 s
[aeson] Warning: 'genericFromJSONKey' is out of scope.
1572.35 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.35 s
[aeson] Warning: 'omittedField' is out of scope.
1572.35 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.35 s
[aeson] Warning: 'allowOmittedFieds' is out of scope.
1572.35 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1572.35 s
[aeson] Warning: 'Object' is ambiguous. It is defined
1572.35 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:366:14
1572.35 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:360:1
1572.35 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1572.35 s
[aeson] by specifying the type/value namespace explicitly.
1572.35 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:360:1
1572.35 s
[aeson] Warning: 'Parser' is ambiguous. It is defined
1572.35 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:278:20
1572.35 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:278:1
1572.35 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1572.35 s
[aeson] by specifying the type/value namespace explicitly.
1572.35 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:278:1
1572.35 s
[aeson] Warning: 'Array' is ambiguous. It is defined
1572.35 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:367:14
1572.35 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1572.35 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1572.35 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1572.35 s
[algebraic-graphs]
1572.35 s
[algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
1572.35 s
[algebraic-graphs] OK: vertexList1 (vertex x) == [x]
1572.35 s
[algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
1572.35 s
[algebraic-graphs]
1572.35 s
[algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
1572.35 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1572.35 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1572.35 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1572.35 s
[algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
1572.35 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1572.35 s
[algebraic-graphs]
1572.35 s
[algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
1572.35 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1572.35 s
[algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
1572.35 s
[algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
1572.35 s
[algebraic-graphs]
1572.35 s
[algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
1572.35 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1572.35 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1572.35 s
[algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
1572.35 s
[algebraic-graphs]
1572.35 s
[algebraic-graphs] ============ NonEmpty.Graph.path1 ============
1572.35 s
[algebraic-graphs] OK: path1 [x] == vertex x
1572.35 s
[algebraic-graphs] OK: path1 [x,y] == edge x y
1572.35 s
[algebraic-graphs] OK: path1 . reverse == transpose . path1
1572.35 s
[algebraic-graphs]
1572.35 s
[algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
1572.35 s
[algebraic-graphs] OK: circuit1 [x] == edge x x
1572.35 s
[algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
1572.35 s
[algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
1572.35 s
[algebraic-graphs]
1572.35 s
[algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
1572.35 s
[algebraic-graphs] OK: clique1 [x] == vertex x
1572.35 s
[algebraic-graphs] OK: clique1 [x,y] == edge x y
1572.35 s
[algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
1572.35 s
[algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
1572.35 s
[algebraic-graphs] OK: clique1 . reverse == transpose . clique1
1572.35 s
[algebraic-graphs]
1572.35 s
[algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
1572.35 s
[algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1572.35 s
[algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
1572.35 s
[algebraic-graphs]
1572.35 s
[algebraic-graphs] ============ NonEmpty.Graph.star ============
1572.35 s
[algebraic-graphs] OK: star x [] == vertex x
1572.35 s
[algebraic-graphs] OK: star x [y] == edge x y
1572.35 s
[algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
1572.35 s
[algebraic-graphs]
1572.35 s
[algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
1572.35 s
[algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
1572.35 s
[algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
1572.35 s
[algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
1572.35 s
[algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
1572.35 s
[algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
1572.35 s
[algebraic-graphs]
1572.35 s
[algebraic-graphs] ============ NonEmpty.Graph.tree ============
1572.35 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1572.35 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
1572.35 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1572.35 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
1572.35 s
[algebraic-graphs]
1572.35 s
[algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
1572.35 s
[algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
1572.35 s
[algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
1572.35 s
[algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
1572.35 s
[algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
1572.35 s
[algebraic-graphs]
1572.35 s
[algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
1572.35 s
[algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
1572.35 s
[algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
1572.35 s
[algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
1572.36 s
[algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
1572.36 s
[algebraic-graphs]
1572.36 s
[algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
1572.36 s
[algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
1572.36 s
[algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
1572.36 s
[algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
1572.36 s
[algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
1572.36 s
[algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
1572.36 s
[algebraic-graphs]
1572.36 s
[algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
1572.36 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
1572.36 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1572.36 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1572.36 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1572.36 s
[algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
1572.36 s
[algebraic-graphs]
1572.36 s
[algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
1572.36 s
[algebraic-graphs] OK: replaceVertex x x == id
1572.36 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1572.36 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1572.36 s
[algebraic-graphs]
1572.36 s
[algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
1572.36 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1572.52 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0 /nix/store/mpp7jvdkajhlawsdm92i7pwzryr24g1d-fuzzy-0.1.1.0-doc
1573.35 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1573.40 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0 /nix/store/mpp7jvdkajhlawsdm92i7pwzryr24g1d-fuzzy-0.1.1.0-doc
1573.49 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1573.57 s
[post-build-hook] copying 1 paths...
1573.57 s
[post-build-hook] copying path '/nix/store/98zb4j4gb4zrfj7xs60sssb1fskvkva2-fuzzy-0.1.1.0' to 'https://cache.nix-ci.com'...
1573.83 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1573.99 s
[post-build-hook] copying 0 paths...
1574.05 s
Progress: 93 of 171 built (8 building), 395 of 395 downloaded from cache
1574.05 s
[lens] transformers-compat-0.7.2
1574.05 s
[lens] Dependency unordered-containers >=0.2.10 && <0.3: using
1574.05 s
[lens] unordered-containers-0.2.20
1574.05 s
[lens] Dependency vector >=0.12.1.2 && <0.14: using vector-0.13.2.0
1574.05 s
[lens] Dependency base: using base-4.19.0.0
1574.05 s
[lens] Dependency lens: using lens-5.3.4
1574.05 s
[lens] Dependency QuickCheck >=2.4: using QuickCheck-2.14.3
1574.05 s
[lens] Dependency base: using base-4.19.0.0
1574.05 s
[lens] Dependency lens: using lens-5.3.4
1574.05 s
[lens] Dependency test-framework >=0.6: using test-framework-0.8.2.2
1574.05 s
[lens] Dependency test-framework-quickcheck2 >=0.2: using
1574.05 s
[lens] test-framework-quickcheck2-0.3.0.6
1574.05 s
[lens] Dependency transformers: using transformers-0.6.1.0
1574.05 s
[lens] Dependency HUnit >=1.2: using HUnit-1.6.2.0
1574.05 s
[lens] Dependency base: using base-4.19.0.0
1574.05 s
[lens] Dependency bytestring: using bytestring-0.12.0.2
1574.05 s
[lens] Dependency containers: using containers-0.6.8
1574.05 s
[lens] Dependency lens: using lens-5.3.4
1574.05 s
[lens] Dependency mtl: using mtl-2.3.1
1574.05 s
[lens] Dependency test-framework >=0.6: using test-framework-0.8.2.2
1574.05 s
[lens] Dependency test-framework-hunit >=0.2: using test-framework-hunit-0.3.0.2
1574.05 s
[lens] Dependency text: using text-2.1
1574.05 s
[lens] Dependency base <5: using base-4.19.0.0
1574.05 s
[lens] Dependency deepseq: using deepseq-1.5.0.0
1574.05 s
[lens] Dependency simple-reflect >=0.3.1: using simple-reflect-0.3.3
1574.05 s
[lens] Source component graph:
1574.05 s
[lens] component test:doctests
1574.05 s
[lens] component lib
1574.05 s
[lens] component test:hunit dependency lib
1574.05 s
[lens] component test:properties dependency lib
1574.05 s
[lens] component test:templates dependency lib
1574.05 s
[lens] Configured component graph:
1574.05 s
[lens] component lens-5.3.4-3zEVcbMoV4w92SJxTLjw2n-doctests
1574.05 s
[lens] include base-4.19.0.0-b960
1574.05 s
[lens] include deepseq-1.5.0.0-412f
1574.05 s
[lens] include simple-reflect-0.3.3-AR1spJat8D8GQKEGiEBp4c
1574.05 s
[lens] component lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP
1574.05 s
[lens] include array-0.5.6.0-dc89
1574.05 s
[lens] include assoc-1.1.1-KeNPeQRDSq0BQe5AaTaTYX
1574.05 s
[lens] include base-4.19.0.0-b960
1574.05 s
[lens] include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
1574.05 s
[lens] include bifunctors-5.6.2-4fZuJfp0ftV1iKSQIeavLh
1574.05 s
[lens] include bytestring-0.12.0.2-4690
1574.05 s
[lens] include call-stack-0.4.0-KMB1wyYY1PO65qKaGY0Acl
1574.05 s
[lens] include comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1574.05 s
[lens] include containers-0.6.8-4775
1574.05 s
[lens] include contravariant-1.5.5-J4LLuUnbnVaBzsIx42BlgS
1574.05 s
[lens] include distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
1574.05 s
[lens] include exceptions-0.10.7-d3e7
1574.05 s
[lens] include filepath-1.4.100.4-fa1c
1574.05 s
[lens] include free-5.2-5jsicnVtm8y8KG9LMRezMp
1574.05 s
[lens] include ghc-prim-0.11.0-a69e
1574.05 s
[lens] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1574.05 s
[lens] include indexed-traversable-0.1.4-HhvObHiiVRhC9VCRLqXs4g
1574.05 s
[lens] include indexed-traversable-instances-0.1.2-Ir3T1QnJ6eVLrdWQiOT4vH
1574.05 s
[lens] include kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An
1574.05 s
[lens] include mtl-2.3.1-63a4
1574.05 s
[lens] include parallel-3.2.2.0-v8RtRKcg4i49eHpR9JBpP
1574.05 s
[lens] include profunctors-5.6.2-3nAHQARBXS12MCzIa3BzsU
1574.05 s
[lens] include reflection-2.1.9-DC8PTujMvD81aezCIxo6I
1574.05 s
[lens] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1574.05 s
[lens] include strict-0.5.1-GVSVdbGTOCS56r31yJq782
1574.05 s
[lens] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1574.05 s
[lens] include template-haskell-2.21.0.0-8831
1574.05 s
[lens] include text-2.1-c36a
1574.05 s
[lens] include th-abstraction-0.7.1.0-D2qAyomm2vvKhfkR0SrGAm
1574.05 s
[lens] include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
1574.05 s
[lens] include transformers-0.6.1.0-c3ec
1574.05 s
[lens] include transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
1574.05 s
[lens] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1574.05 s
[lens] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1574.05 s
[lens] component lens-5.3.4-4ID1NGtksILG8f76CHMisM-hunit
1574.05 s
[lens] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1574.05 s
[lens] include base-4.19.0.0-b960
1574.05 s
[lens] include bytestring-0.12.0.2-4690
1574.05 s
[lens] include containers-0.6.8-4775
1574.05 s
[lens] include lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP
1574.05 s
[lens] include mtl-2.3.1-63a4
1574.05 s
[lens] include test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
1574.05 s
[lens] include test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm
1574.05 s
[lens] include text-2.1-c36a
1574.05 s
[lens] component lens-5.3.4-6AlA95BIDVHB8XHEhHMrZQ-properties
1574.05 s
[lens] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1574.05 s
[lens] include base-4.19.0.0-b960
1574.05 s
[lens] include lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP
1574.05 s
[lens] include test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
1574.05 s
[pointed] include kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An
1574.05 s
[pointed] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1574.05 s
[pointed] include stm-2.5.2.1-83fa
1574.05 s
[pointed] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1574.05 s
[pointed] include transformers-0.6.1.0-c3ec
1574.05 s
[pointed] include transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
1574.05 s
[pointed] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1574.05 s
[pointed] Data.Copointed=pointed-5.0.5-ArcipP7cLHIAUvoaOddqJf:Data.Copointed,Data.Pointed=pointed-5.0.5-ArcipP7cLHIAUvoaOddqJf:Data.Pointed
1574.05 s
[pointed] Ready component graph:
1574.05 s
[pointed] definite pointed-5.0.5-ArcipP7cLHIAUvoaOddqJf
1574.05 s
[pointed] depends base-4.19.0.0-b960
1574.05 s
[pointed] depends comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1574.05 s
[pointed] depends containers-0.6.8-4775
1574.05 s
[pointed] depends data-default-class-0.1.2.2-HTxb2GzgoxNAqZUhgimqiq
1574.05 s
[pointed] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1574.05 s
[pointed] depends kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An
1574.05 s
[pointed] depends semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1574.05 s
[pointed] depends stm-2.5.2.1-83fa
1574.05 s
[pointed] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1574.05 s
[pointed] depends transformers-0.6.1.0-c3ec
1574.05 s
[pointed] depends transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
1574.05 s
[pointed] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1574.05 s
[pointed] Using Cabal-3.10.2.0 compiled by ghc-9.8
1574.05 s
[pointed] Using compiler: ghc-9.8.1
1574.05 s
[pointed] Using install prefix:
1574.05 s
[pointed] /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5
1574.05 s
[pointed] Executables installed in:
1574.05 s
[pointed] /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5/bin
1574.05 s
[pointed] Libraries installed in:
1574.05 s
[pointed] /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/pointed-5.0.5-ArcipP7cLHIAUvoaOddqJf
1574.05 s
[pointed] Dynamic Libraries installed in:
1574.05 s
[pointed] /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1574.05 s
[pointed] Private executables installed in:
1574.05 s
[pointed] /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5/libexec/x86_64-linux-ghc-9.8.1/pointed-5.0.5
1574.05 s
[pointed] Data files installed in:
1574.05 s
[pointed] /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5/share/x86_64-linux-ghc-9.8.1/pointed-5.0.5
1574.05 s
[pointed] Documentation installed in:
1574.05 s
[pointed] /nix/store/wi1zwklwcq68c9ibyp049c4irci5m077-pointed-5.0.5-doc/share/doc/pointed-5.0.5
1574.05 s
[pointed] Configuration files installed in:
1574.06 s
[pointed] /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5/etc
1574.06 s
[pointed] No alex found
1574.06 s
[pointed] Using ar found on system at:
1574.06 s
[pointed] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1574.06 s
[pointed] No c2hs found
1574.06 s
[pointed] No cpphs found
1574.06 s
[pointed] No doctest found
1574.06 s
[pointed] Using gcc version 14.3.0 given by user at:
1574.06 s
[pointed] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1574.06 s
[pointed] Using ghc version 9.8.1 found on system at:
1574.06 s
[pointed] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1574.06 s
[pointed] Using ghc-pkg version 9.8.1 found on system at:
1574.06 s
[pointed] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1574.06 s
[pointed] No ghcjs found
1574.06 s
[pointed] No ghcjs-pkg found
1574.06 s
[pointed] No greencard found
1574.06 s
[pointed] Using haddock version 2.30.0 found on system at:
1574.06 s
[pointed] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1574.06 s
[pointed] No happy found
1574.06 s
[pointed] Using haskell-suite found on system at: haskell-suite-dummy-location
1574.06 s
[pointed] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1574.06 s
[pointed] No hmake found
1574.06 s
[pointed] Using hpc version 0.69 found on system at:
1574.06 s
[pointed] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1574.06 s
[pointed] Using hsc2hs version 0.68.10 found on system at:
1574.06 s
[pointed] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1574.06 s
[pointed] Using hscolour version 1.25 found on system at:
1574.06 s
[pointed] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1574.06 s
[pointed] No jhc found
1574.06 s
[pointed] Using ld found on system at:
1574.06 s
[pointed] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1574.06 s
[pointed] No pkg-config found
1574.06 s
[pointed] Using runghc version 9.8.1 found on system at:
1574.06 s
[pointed] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1574.06 s
[pointed] Using strip version 2.44 found on system at:
1574.06 s
[pointed] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1574.06 s
[pointed] Using tar found on system at:
1574.06 s
[pointed] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1574.06 s
[pointed] No uhc found
1574.06 s
[pointed] Phase: buildPhase
1574.06 s
[pointed] Preprocessing library for pointed-5.0.5..
1574.06 s
[pointed] Building library for pointed-5.0.5..
1574.06 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:363:1
1574.06 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.06 s
[aeson] by specifying the type/value namespace explicitly.
1574.06 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:363:1
1574.06 s
[aeson] Warning: 'String' is ambiguous. It is defined
1574.06 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:368:14
1574.06 s
[aeson] * in ‘GHC.Base’
1574.06 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.06 s
[aeson] by specifying the type/value namespace explicitly.
1574.06 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:368:14
1574.06 s
[aeson] Warning: '(.:)' is out of scope.
1574.06 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.06 s
[aeson] Warning: '++' is ambiguous. It is defined
1574.06 s
[aeson] * in ‘GHC.Base’
1574.06 s
[aeson] * in ‘Data.Vector’
1574.06 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.06 s
[aeson] by specifying the type/value namespace explicitly.
1574.06 s
[aeson] Defaulting to the one defined in ‘Data.Vector’
1574.06 s
[aeson] Warning: 'Options' is ambiguous. It is defined
1574.06 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:705:16
1574.06 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:705:1
1574.06 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.06 s
[aeson] by specifying the type/value namespace explicitly.
1574.06 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:705:1
1574.06 s
[aeson] Warning: 'API' is out of scope.
1574.06 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.06 s
[aeson] Warning: 'hashable' is out of scope.
1574.06 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.06 s
[aeson] Warning: '.=' is out of scope.
1574.06 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.06 s
[aeson] Warning: 'Text' is ambiguous. It is defined
1574.06 s
[aeson] * in ‘Data.Text.Internal’
1574.06 s
[aeson] * in ‘Data.Text.Internal.Lazy’
1574.06 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.06 s
[aeson] by specifying the type/value namespace explicitly.
1574.06 s
[aeson] Defaulting to the one defined in ‘Data.Text.Internal.Lazy’
1574.06 s
[aeson] Warning: 'Value' is ambiguous. It is defined
1574.06 s
[aeson] * at src/Data/Aeson/Encoding/Internal.hs:130:15
1574.06 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:366:1
1574.06 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.06 s
[aeson] by specifying the type/value namespace explicitly.
1574.06 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:366:1
1574.06 s
[aeson] Warning: 'unsafePair' is out of scope.
1574.06 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.06 s
[aeson] 25% ( 21 / 82) in 'Data.Aeson.Encoding.Internal'
1574.06 s
[aeson] Missing documentation for:
1574.06 s
[aeson] Module header
1574.06 s
[aeson] encodingToLazyByteString (src/Data/Aeson/Encoding/Internal.hs:98)
1574.06 s
[aeson] retagEncoding (src/Data/Aeson/Encoding/Internal.hs:102)
1574.06 s
[aeson] pair (src/Data/Aeson/Encoding/Internal.hs:134)
1574.06 s
[aeson] pairStr (src/Data/Aeson/Encoding/Internal.hs:138)
1574.06 s
[aeson] pair' (src/Data/Aeson/Encoding/Internal.hs:142)
1574.06 s
[aeson] nullEncoding (src/Data/Aeson/Encoding/Internal.hs:168)
1574.06 s
[aeson] emptyArray_ (src/Data/Aeson/Encoding/Internal.hs:171)
1574.06 s
[aeson] emptyObject_ (src/Data/Aeson/Encoding/Internal.hs:174)
1574.06 s
[aeson] wrapObject (src/Data/Aeson/Encoding/Internal.hs:180)
1574.06 s
[aeson] wrapArray (src/Data/Aeson/Encoding/Internal.hs:177)
1574.06 s
[aeson] null_ (src/Data/Aeson/Encoding/Internal.hs:183)
1574.06 s
[aeson] bool (src/Data/Aeson/Encoding/Internal.hs:186)
1574.06 s
[aeson] key (src/Data/Aeson/Encoding/Internal.hs:247)
1574.06 s
[aeson] text (src/Data/Aeson/Encoding/Internal.hs:250)
1574.06 s
[aeson] lazyText (src/Data/Aeson/Encoding/Internal.hs:253)
1574.06 s
[aeson] string (src/Data/Aeson/Encoding/Internal.hs:266)
1574.06 s
[aeson] list (src/Data/Aeson/Encoding/Internal.hs:196)
1574.06 s
[aeson] empty (src/Data/Aeson/Encoding/Internal.hs:225)
1574.06 s
[aeson] >< (src/Data/Aeson/Encoding/Internal.hs:232)
1574.06 s
[aeson] econcat (src/Data/Aeson/Encoding/Internal.hs:228)
1574.06 s
[aeson] int8 (src/Data/Aeson/Encoding/Internal.hs:285)
1574.06 s
[aeson] int16 (src/Data/Aeson/Encoding/Internal.hs:288)
1574.06 s
[aeson] int32 (src/Data/Aeson/Encoding/Internal.hs:291)
1574.06 s
[aeson] int64 (src/Data/Aeson/Encoding/Internal.hs:294)
1574.06 s
[aeson] int (src/Data/Aeson/Encoding/Internal.hs:297)
1574.06 s
[aeson] word8 (src/Data/Aeson/Encoding/Internal.hs:300)
1574.06 s
[aeson] word16 (src/Data/Aeson/Encoding/Internal.hs:303)
1574.06 s
[aeson] word32 (src/Data/Aeson/Encoding/Internal.hs:306)
1574.06 s
[aeson] word64 (src/Data/Aeson/Encoding/Internal.hs:309)
1574.06 s
[aeson] word (src/Data/Aeson/Encoding/Internal.hs:312)
1574.06 s
[lens] include test-framework-quickcheck2-0.3.0.6-5y38glI8Mym9b8R1xyZzcz
1574.06 s
[lens] include transformers-0.6.1.0-c3ec
1574.06 s
[lens] component lens-5.3.4-97bnubYn1kRUwOwxWRnQn-templates
1574.06 s
[lens] include base-4.19.0.0-b960
1574.06 s
[lens] include lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP
1574.06 s
[lens] Linked component graph:
1574.06 s
[lens] unit lens-5.3.4-3zEVcbMoV4w92SJxTLjw2n-doctests
1574.06 s
[lens] include base-4.19.0.0-b960
1574.06 s
[lens] include deepseq-1.5.0.0-412f
1574.06 s
[lens] include simple-reflect-0.3.3-AR1spJat8D8GQKEGiEBp4c
1574.06 s
[lens] unit lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP
1574.06 s
[lens] include array-0.5.6.0-dc89
1574.06 s
[lens] include assoc-1.1.1-KeNPeQRDSq0BQe5AaTaTYX
1574.06 s
[lens] include base-4.19.0.0-b960
1574.06 s
[lens] include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
1574.06 s
[lens] include bifunctors-5.6.2-4fZuJfp0ftV1iKSQIeavLh
1574.06 s
[lens] include bytestring-0.12.0.2-4690
1574.06 s
[lens] include call-stack-0.4.0-KMB1wyYY1PO65qKaGY0Acl
1574.06 s
[lens] include comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1574.06 s
[lens] include containers-0.6.8-4775
1574.06 s
[lens] include contravariant-1.5.5-J4LLuUnbnVaBzsIx42BlgS
1574.06 s
[lens] include distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
1574.06 s
[lens] include exceptions-0.10.7-d3e7
1574.06 s
[lens] include filepath-1.4.100.4-fa1c
1574.06 s
[lens] include free-5.2-5jsicnVtm8y8KG9LMRezMp
1574.06 s
[lens] include ghc-prim-0.11.0-a69e
1574.06 s
[lens] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1574.06 s
[lens] include indexed-traversable-0.1.4-HhvObHiiVRhC9VCRLqXs4g
1574.06 s
[lens] include indexed-traversable-instances-0.1.2-Ir3T1QnJ6eVLrdWQiOT4vH
1574.06 s
[lens] include kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An
1574.06 s
[lens] include mtl-2.3.1-63a4
1574.06 s
[lens] include parallel-3.2.2.0-v8RtRKcg4i49eHpR9JBpP
1574.06 s
[lens] include profunctors-5.6.2-3nAHQARBXS12MCzIa3BzsU
1574.06 s
[lens] include reflection-2.1.9-DC8PTujMvD81aezCIxo6I
1574.06 s
[lens] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1574.06 s
[lens] include strict-0.5.1-GVSVdbGTOCS56r31yJq782
1574.06 s
[lens] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1574.06 s
[lens] include template-haskell-2.21.0.0-8831
1574.06 s
[lens] include text-2.1-c36a
1574.06 s
[lens] include th-abstraction-0.7.1.0-D2qAyomm2vvKhfkR0SrGAm
1574.06 s
[lens] include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
1574.06 s
[lens] include transformers-0.6.1.0-c3ec
1574.06 s
[lens] include transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
1574.06 s
[lens] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1574.06 s
[lens] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1574.06 s
[pointed] [1 of 2] Compiling Data.Copointed ( src/Data/Copointed.hs, dist/build/Data/Copointed.o, dist/build/Data/Copointed.dyn_o )
1574.06 s
[pointed] [2 of 2] Compiling Data.Pointed ( src/Data/Pointed.hs, dist/build/Data/Pointed.o, dist/build/Data/Pointed.dyn_o )
1574.06 s
[pointed] [1 of 2] Compiling Data.Copointed ( src/Data/Copointed.hs, dist/build/Data/Copointed.p_o )
1574.06 s
[pointed] [2 of 2] Compiling Data.Pointed ( src/Data/Pointed.hs, dist/build/Data/Pointed.p_o )
1574.06 s
[quickcheck-instances] Phase: setupCompilerEnvironmentPhase
1574.06 s
[quickcheck-instances] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1574.06 s
[quickcheck-instances] Phase: unpackPhase
1574.06 s
[quickcheck-instances] unpacking source archive /nix/store/kz0fzqcr8g42rvq6dwlwvzxmg8rjfhqn-quickcheck-instances-0.3.32.tar.gz
1574.06 s
[quickcheck-instances] source root is quickcheck-instances-0.3.32
1574.06 s
[quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.32/test/Tests.hs"
1574.06 s
[quickcheck-instances] Phase: patchPhase
1574.06 s
[quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.32/revision/1.cabal.
1574.06 s
[quickcheck-instances] Phase: compileBuildDriverPhase
1574.06 s
[quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.9frGfTtFku/setup-package.conf.d -threaded
1574.06 s
[quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.9frGfTtFku/Main.o )
1574.06 s
[quickcheck-instances] [2 of 2] Linking Setup
1574.06 s
[regex] Documentation created: dist/doc/html/regex/, dist/doc/html/regex/regex.txt
1574.06 s
[regex] Phase: installPhase
1574.06 s
[regex] Installing library in /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/regex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z
1574.06 s
[shake] [54 of 73] Compiling Development.Shake.Internal.Rules.OrderOnly ( src/Development/Shake/Internal/Rules/OrderOnly.hs, dist/build/Development/Shake/Internal/Rules/OrderOnly.p_o )
1574.06 s
[shake] [55 of 73] Compiling Development.Shake.Internal.Rules.Files ( src/Development/Shake/Internal/Rules/Files.hs, dist/build/Development/Shake/Internal/Rules/Files.p_o )
1574.06 s
[aeson] integer (src/Data/Aeson/Encoding/Internal.hs:315)
1574.06 s
[aeson] float (src/Data/Aeson/Encoding/Internal.hs:318)
1574.06 s
[aeson] scientific (src/Data/Aeson/Encoding/Internal.hs:338)
1574.06 s
[aeson] int8Text (src/Data/Aeson/Encoding/Internal.hs:352)
1574.06 s
[aeson] int16Text (src/Data/Aeson/Encoding/Internal.hs:355)
1574.06 s
[aeson] int32Text (src/Data/Aeson/Encoding/Internal.hs:358)
1574.06 s
[aeson] int64Text (src/Data/Aeson/Encoding/Internal.hs:361)
1574.06 s
[aeson] intText (src/Data/Aeson/Encoding/Internal.hs:364)
1574.06 s
[aeson] word8Text (src/Data/Aeson/Encoding/Internal.hs:367)
1574.07 s
[aeson] word16Text (src/Data/Aeson/Encoding/Internal.hs:370)
1574.07 s
[aeson] word32Text (src/Data/Aeson/Encoding/Internal.hs:373)
1574.07 s
[aeson] word64Text (src/Data/Aeson/Encoding/Internal.hs:376)
1574.07 s
[aeson] wordText (src/Data/Aeson/Encoding/Internal.hs:379)
1574.07 s
[aeson] integerText (src/Data/Aeson/Encoding/Internal.hs:382)
1574.07 s
[aeson] floatText (src/Data/Aeson/Encoding/Internal.hs:385)
1574.07 s
[aeson] scientificText (src/Data/Aeson/Encoding/Internal.hs:409)
1574.07 s
[aeson] day (src/Data/Aeson/Encoding/Internal.hs:416)
1574.07 s
[aeson] month (src/Data/Aeson/Encoding/Internal.hs:419)
1574.07 s
[aeson] quarter (src/Data/Aeson/Encoding/Internal.hs:422)
1574.07 s
[aeson] localTime (src/Data/Aeson/Encoding/Internal.hs:425)
1574.07 s
[aeson] utcTime (src/Data/Aeson/Encoding/Internal.hs:428)
1574.07 s
[aeson] timeOfDay (src/Data/Aeson/Encoding/Internal.hs:431)
1574.07 s
[aeson] zonedTime (src/Data/Aeson/Encoding/Internal.hs:434)
1574.07 s
[aeson] value (src/Data/Aeson/Encoding/Internal.hs:441)
1574.07 s
[aeson] comma (src/Data/Aeson/Encoding/Internal.hs:273)
1574.07 s
[aeson] colon (src/Data/Aeson/Encoding/Internal.hs:274)
1574.07 s
[aeson] openBracket (src/Data/Aeson/Encoding/Internal.hs:275)
1574.07 s
[aeson] closeBracket (src/Data/Aeson/Encoding/Internal.hs:276)
1574.07 s
[aeson] openCurly (src/Data/Aeson/Encoding/Internal.hs:277)
1574.07 s
[aeson] closeCurly (src/Data/Aeson/Encoding/Internal.hs:278)
1574.07 s
[aeson] Warning: 'Encoding' is ambiguous. It is defined
1574.07 s
[aeson] * at src/Data/Aeson/Encoding/Internal.hs:82:25
1574.07 s
[aeson] * at src/Data/Aeson/Encoding/Internal.hs:88:1
1574.07 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.07 s
[aeson] by specifying the type/value namespace explicitly.
1574.07 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Encoding/Internal.hs:88:1
1574.07 s
[aeson] Warning: 'Text' is out of scope.
1574.07 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.07 s
[aeson] 27% ( 18 / 65) in 'Data.Aeson.Encoding'
1574.07 s
[aeson] Missing documentation for:
1574.07 s
[aeson] encodingToLazyByteString (src/Data/Aeson/Encoding/Internal.hs:98)
1574.07 s
[aeson] pair (src/Data/Aeson/Encoding/Internal.hs:134)
1574.07 s
[aeson] pairStr (src/Data/Aeson/Encoding/Internal.hs:138)
1574.07 s
[aeson] pair' (src/Data/Aeson/Encoding/Internal.hs:142)
1574.07 s
[aeson] nullEncoding (src/Data/Aeson/Encoding/Internal.hs:168)
1574.07 s
[aeson] emptyArray_ (src/Data/Aeson/Encoding/Internal.hs:171)
1574.07 s
[aeson] emptyObject_ (src/Data/Aeson/Encoding/Internal.hs:174)
1574.07 s
[aeson] text (src/Data/Aeson/Encoding/Internal.hs:250)
1574.07 s
[aeson] lazyText (src/Data/Aeson/Encoding/Internal.hs:253)
1574.07 s
[aeson] string (src/Data/Aeson/Encoding/Internal.hs:266)
1574.07 s
[aeson] list (src/Data/Aeson/Encoding/Internal.hs:196)
1574.07 s
[aeson] null_ (src/Data/Aeson/Encoding/Internal.hs:183)
1574.07 s
[aeson] bool (src/Data/Aeson/Encoding/Internal.hs:186)
1574.07 s
[aeson] int8 (src/Data/Aeson/Encoding/Internal.hs:285)
1574.07 s
[aeson] int16 (src/Data/Aeson/Encoding/Internal.hs:288)
1574.07 s
[aeson] int32 (src/Data/Aeson/Encoding/Internal.hs:291)
1574.07 s
[aeson] int64 (src/Data/Aeson/Encoding/Internal.hs:294)
1574.07 s
[aeson] int (src/Data/Aeson/Encoding/Internal.hs:297)
1574.07 s
[aeson] word8 (src/Data/Aeson/Encoding/Internal.hs:300)
1574.07 s
[aeson] word16 (src/Data/Aeson/Encoding/Internal.hs:303)
1574.07 s
[aeson] word32 (src/Data/Aeson/Encoding/Internal.hs:306)
1574.07 s
[aeson] word64 (src/Data/Aeson/Encoding/Internal.hs:309)
1574.07 s
[aeson] word (src/Data/Aeson/Encoding/Internal.hs:312)
1574.07 s
[aeson] integer (src/Data/Aeson/Encoding/Internal.hs:315)
1574.07 s
[aeson] float (src/Data/Aeson/Encoding/Internal.hs:318)
1574.07 s
[aeson] scientific (src/Data/Aeson/Encoding/Internal.hs:338)
1574.07 s
[aeson] int8Text (src/Data/Aeson/Encoding/Internal.hs:352)
1574.07 s
[aeson] int16Text (src/Data/Aeson/Encoding/Internal.hs:355)
1574.07 s
[aeson] int32Text (src/Data/Aeson/Encoding/Internal.hs:358)
1574.07 s
[aeson] int64Text (src/Data/Aeson/Encoding/Internal.hs:361)
1574.07 s
[aeson] intText (src/Data/Aeson/Encoding/Internal.hs:364)
1574.07 s
[aeson] word8Text (src/Data/Aeson/Encoding/Internal.hs:367)
1574.07 s
[aeson] word16Text (src/Data/Aeson/Encoding/Internal.hs:370)
1574.07 s
[aeson] word32Text (src/Data/Aeson/Encoding/Internal.hs:373)
1574.07 s
[aeson] word64Text (src/Data/Aeson/Encoding/Internal.hs:376)
1574.07 s
[aeson] wordText (src/Data/Aeson/Encoding/Internal.hs:379)
1574.07 s
[aeson] integerText (src/Data/Aeson/Encoding/Internal.hs:382)
1574.07 s
[aeson] floatText (src/Data/Aeson/Encoding/Internal.hs:385)
1574.07 s
[aeson] scientificText (src/Data/Aeson/Encoding/Internal.hs:409)
1574.07 s
[aeson] day (src/Data/Aeson/Encoding/Internal.hs:416)
1574.07 s
[aeson] month (src/Data/Aeson/Encoding/Internal.hs:419)
1574.07 s
[aeson] quarter (src/Data/Aeson/Encoding/Internal.hs:422)
1574.07 s
[aeson] localTime (src/Data/Aeson/Encoding/Internal.hs:425)
1574.07 s
[aeson] utcTime (src/Data/Aeson/Encoding/Internal.hs:428)
1574.07 s
[aeson] timeOfDay (src/Data/Aeson/Encoding/Internal.hs:431)
1574.07 s
[aeson] zonedTime (src/Data/Aeson/Encoding/Internal.hs:434)
1574.07 s
[aeson] value (src/Data/Aeson/Encoding/Internal.hs:441)
1574.07 s
[aeson] Warning: 'ConsParseJSON' is out of scope.
1574.07 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.07 s
[aeson] Warning: 'Generically1' is ambiguous. It is defined
1574.07 s
[aeson] * in ‘GHC.Generics’
1574.07 s
[aeson] * in ‘GHC.Generics’
1574.07 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.07 s
[aeson] by specifying the type/value namespace explicitly.
1574.07 s
[aeson] Defaulting to the one defined in ‘GHC.Generics’
1574.07 s
[aeson] Warning: 'map' is ambiguous. It is defined
1574.07 s
[aeson] * at src/Data/Aeson/KeyMap.hs:194:1
1574.07 s
[aeson] * in ‘GHC.Base’
1574.07 s
[aeson] * in ‘Data.ByteString.Lazy’
1574.07 s
[aeson] * in ‘Data.IntMap.Internal’
1574.07 s
[aeson] * in ‘Data.IntSet.Internal’
1574.07 s
[aeson] * in ‘Data.Map.Internal’
1574.07 s
[aeson] * in ‘Data.Set.Internal’
1574.07 s
[aeson] * in ‘Data.DList.DNonEmpty.Internal’
1574.07 s
[aeson] * in ‘Data.DList.Internal’
1574.07 s
[aeson] * in ‘Data.Text’
1574.07 s
[aeson] * in ‘Data.Text.Lazy’
1574.07 s
[aeson] * in ‘Data.HashMap.Internal.Strict’
1574.07 s
[aeson] * in ‘Data.HashSet.Internal’
1574.07 s
[aeson] * in ‘Data.Vector’
1574.07 s
[aeson] * in ‘Data.Vector.Generic’
1574.07 s
[aeson] * in ‘Data.Vector.Primitive’
1574.07 s
[aeson] * in ‘Data.Vector.Storable’
1574.07 s
[aeson] * in ‘Data.Vector.Unboxed’
1574.07 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.07 s
[aeson] by specifying the type/value namespace explicitly.
1574.07 s
[aeson] Defaulting to the one defined at src/Data/Aeson/KeyMap.hs:194:1
1574.07 s
[aeson] Warning: 'ToJSONKeyFunction' is out of scope.
1574.07 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.07 s
[aeson] Warning: 'ToJSONKeyValue' is out of scope.
1574.07 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.07 s
[aeson] Warning: 'ToJSONKey' is out of scope.
1574.07 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.07 s
[aeson] Warning: 'ToJSONKeyText' is out of scope.
1574.07 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.07 s
[aeson] Warning: 'Text' is ambiguous. It is defined
1574.07 s
[aeson] * in ‘Data.Text.Internal’
1574.07 s
[aeson] * in ‘Data.Text.Internal.Lazy’
1574.07 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.07 s
[aeson] by specifying the type/value namespace explicitly.
1574.07 s
[aeson] Defaulting to the one defined in ‘Data.Text.Internal.Lazy’
1574.07 s
[aeson] Warning: 'String' is ambiguous. It is defined
1574.07 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:368:14
1574.07 s
[aeson] * in ‘GHC.Base’
1574.07 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.07 s
[aeson] by specifying the type/value namespace explicitly.
1574.07 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:368:14
1574.07 s
[aeson] Warning: 'Object' is ambiguous. It is defined
1574.07 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:366:14
1574.07 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:360:1
1574.07 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.07 s
[aeson] by specifying the type/value namespace explicitly.
1574.07 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:360:1
1574.07 s
[aeson] Warning: 'Array' is ambiguous. It is defined
1574.07 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:367:14
1574.07 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:363:1
1574.07 s
[aeson] * in ‘Data.Primitive.Array’
1574.07 s
[aeson] * in ‘Data.Primitive.Array’
1574.07 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.07 s
[aeson] by specifying the type/value namespace explicitly.
1574.07 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:363:1
1574.07 s
[aeson] Warning: 'Generic' is ambiguous. It is defined
1574.07 s
[aeson] * in ‘GHC.Generics’
1574.07 s
[aeson] * in ‘Data.Text.Lazy.Builder.RealFloat’
1574.07 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.07 s
[aeson] by specifying the type/value namespace explicitly.
1574.07 s
[aeson] Defaulting to the one defined in ‘GHC.Generics’
1574.07 s
[aeson] Warning: 'Generically' is ambiguous. It is defined
1574.07 s
[lens] Control.Exception.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Exception.Lens,Control.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens,Control.Lens.At=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.At,Control.Lens.Combinators=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Combinators,Control.Lens.Cons=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Cons,Control.Lens.Each=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Each,Control.Lens.Empty=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Empty,Control.Lens.Equality=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Equality,Control.Lens.Extras=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Extras,Control.Lens.Fold=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Fold,Control.Lens.Getter=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Getter,Control.Lens.Indexed=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Indexed,Control.Lens.Internal=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal,Control.Lens.Internal.Bazaar=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Bazaar,Control.Lens.Internal.ByteString=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.ByteString,Control.Lens.Internal.CTypes=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.CTypes,Control.Lens.Internal.Context=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Context,Control.Lens.Internal.Deque=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Deque,Control.Lens.Internal.Doctest=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Doctest,Control.Lens.Internal.Exception=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Exception,Control.Lens.Internal.FieldTH=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.FieldTH,Control.Lens.Internal.Fold=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Fold,Control.Lens.Internal.Getter=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Getter,Control.Lens.Internal.Indexed=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Indexed,Control.Lens.Internal.Instances=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Instances,Control.Lens.Internal.Iso=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Iso,Control.Lens.Internal.Level=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Level,Control.Lens.Internal.List=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.List,Control.Lens.Internal.Magma=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Magma,Control.Lens.Internal.Prism=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Prism,Control.Lens.Internal.PrismTH=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.PrismTH,Control.Lens.Internal.Profunctor=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Profunctor,Control.Lens.Internal.Review=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Review,Control.Lens.Internal.Setter=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Setter,Control.Lens.Internal.TH=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.TH,Control.Lens.Internal.Zoom=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Internal.Zoom,Control.Lens.Iso=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Iso,Control.Lens.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Lens,Control.Lens.Level=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Level,Control.Lens.Operators=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Operators,Control.Lens.Plated=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Plated,Control.Lens.Prism=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Prism,Control.Lens.Profunctor=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Profunctor,Control.Lens.Reified=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Reified,Control.Lens.Review=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Review,Control.Lens.Setter=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Setter,Control.Lens.TH=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.TH,Control.Lens.Traversal=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Traversal,Control.Lens.Tuple=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Tuple,Control.Lens.Type=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Type,Control.Lens.Unsound=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Unsound,Control.Lens.Wrapped=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Wrapped,Control.Lens.Zoom=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Lens.Zoom,Control.Monad.Error.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Monad.Error.Lens,Control.Parallel.Strategies.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Parallel.Strategies.Lens,Control.Seq.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Control.Seq.Lens,Data.Array.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Array.Lens,Data.Bits.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Bits.Lens,Data.ByteString.Lazy.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.ByteString.Lazy.Lens,Data.ByteString.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.ByteString.Lens,Data.ByteString.Strict.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.ByteString.Strict.Lens,Data.Complex.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Complex.Lens,Data.Data.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Data.Lens,Data.Dynamic.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Dynamic.Lens,Data.HashSet.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.HashSet.Lens,Data.IntSet.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.IntSet.Lens,Data.List.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.List.Lens,Data.Map.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Map.Lens,Data.Sequence.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Sequence.Lens,Data.Set.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Set.Lens,Data.Text.Lazy.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Text.Lazy.Lens,Data.Text.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Text.Lens,Data.Text.Strict.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Text.Strict.Lens,Data.Tree.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Tree.Lens,Data.Typeable.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Typeable.Lens,Data.Vector.Generic.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Vector.Generic.Lens,Data.Vector.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Data.Vector.Lens,GHC.Generics.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:GHC.Generics.Lens,Language.Haskell.TH.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Language.Haskell.TH.Lens,Numeric.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Numeric.Lens,Numeric.Natural.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:Numeric.Natural.Lens,System.Exit.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:System.Exit.Lens,System.FilePath.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:System.FilePath.Lens,System.IO.Error.Lens=lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP:System.IO.Error.Lens
1574.07 s
[lens] unit lens-5.3.4-4ID1NGtksILG8f76CHMisM-hunit
1574.07 s
[lens] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1574.07 s
[lens] include base-4.19.0.0-b960
1574.07 s
[lens] include bytestring-0.12.0.2-4690
1574.07 s
[lens] include containers-0.6.8-4775
1574.07 s
[lens] include lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP
1574.07 s
[lens] include mtl-2.3.1-63a4
1574.07 s
[lens] include test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
1574.07 s
[lens] include test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm
1574.07 s
[lens] include text-2.1-c36a
1574.07 s
[lens] unit lens-5.3.4-6AlA95BIDVHB8XHEhHMrZQ-properties
1574.07 s
[lens] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1574.07 s
[lens] include base-4.19.0.0-b960
1574.07 s
[lens] include lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP
1574.07 s
[lens] include test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
1574.08 s
[lens] include test-framework-quickcheck2-0.3.0.6-5y38glI8Mym9b8R1xyZzcz
1574.08 s
[lens] include transformers-0.6.1.0-c3ec
1574.08 s
[lens] unit lens-5.3.4-97bnubYn1kRUwOwxWRnQn-templates
1574.08 s
[lens] include base-4.19.0.0-b960
1574.08 s
[lens] include lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP
1574.08 s
[lens] Ready component graph:
1574.08 s
[lens] definite lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP
1574.08 s
[lens] depends array-0.5.6.0-dc89
1574.08 s
[lens] depends assoc-1.1.1-KeNPeQRDSq0BQe5AaTaTYX
1574.08 s
[lens] depends base-4.19.0.0-b960
1574.08 s
[lens] depends base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
1574.08 s
[lens] depends bifunctors-5.6.2-4fZuJfp0ftV1iKSQIeavLh
1574.08 s
[lens] depends bytestring-0.12.0.2-4690
1574.08 s
[lens] depends call-stack-0.4.0-KMB1wyYY1PO65qKaGY0Acl
1574.08 s
[lens] depends comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1574.08 s
[lens] depends containers-0.6.8-4775
1574.08 s
[lens] depends contravariant-1.5.5-J4LLuUnbnVaBzsIx42BlgS
1574.08 s
[lens] depends distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
1574.08 s
[lens] depends exceptions-0.10.7-d3e7
1574.08 s
[lens] depends filepath-1.4.100.4-fa1c
1574.08 s
[lens] depends free-5.2-5jsicnVtm8y8KG9LMRezMp
1574.08 s
[lens] depends ghc-prim-0.11.0-a69e
1574.08 s
[lens] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1574.08 s
[lens] depends indexed-traversable-0.1.4-HhvObHiiVRhC9VCRLqXs4g
1574.08 s
[lens] depends indexed-traversable-instances-0.1.2-Ir3T1QnJ6eVLrdWQiOT4vH
1574.08 s
[lens] depends kan-extensions-5.2.6-JGNnTtwcF07ETumkjoP5An
1574.08 s
[lens] depends mtl-2.3.1-63a4
1574.08 s
[lens] depends parallel-3.2.2.0-v8RtRKcg4i49eHpR9JBpP
1574.08 s
[lens] depends profunctors-5.6.2-3nAHQARBXS12MCzIa3BzsU
1574.08 s
[lens] depends reflection-2.1.9-DC8PTujMvD81aezCIxo6I
1574.08 s
[lens] depends semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1574.08 s
[lens] depends strict-0.5.1-GVSVdbGTOCS56r31yJq782
1574.08 s
[lens] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1574.08 s
[lens] depends template-haskell-2.21.0.0-8831
1574.08 s
[lens] depends text-2.1-c36a
1574.08 s
[lens] depends th-abstraction-0.7.1.0-D2qAyomm2vvKhfkR0SrGAm
1574.08 s
[lens] depends these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
1574.08 s
[lens] depends transformers-0.6.1.0-c3ec
1574.08 s
[lens] depends transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
1574.08 s
[lens] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1574.08 s
[lens] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
1574.08 s
[lens] definite lens-5.3.4-97bnubYn1kRUwOwxWRnQn-templates
1574.08 s
[lens] depends base-4.19.0.0-b960
1574.08 s
[lens] depends lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP
1574.08 s
[lens] definite lens-5.3.4-6AlA95BIDVHB8XHEhHMrZQ-properties
1574.08 s
[lens] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1574.08 s
[lens] depends base-4.19.0.0-b960
1574.08 s
[lens] depends lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP
1574.08 s
[lens] depends test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
1574.08 s
[lens] depends test-framework-quickcheck2-0.3.0.6-5y38glI8Mym9b8R1xyZzcz
1574.08 s
[lens] depends transformers-0.6.1.0-c3ec
1574.08 s
[lens] definite lens-5.3.4-4ID1NGtksILG8f76CHMisM-hunit
1574.08 s
[lens] depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1574.08 s
[lens] depends base-4.19.0.0-b960
1574.08 s
[lens] depends bytestring-0.12.0.2-4690
1574.08 s
[aeson] * in ‘GHC.Generics’
1574.08 s
[aeson] * in ‘GHC.Generics’
1574.08 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.08 s
[aeson] by specifying the type/value namespace explicitly.
1574.08 s
[aeson] Defaulting to the one defined in ‘GHC.Generics’
1574.08 s
[aeson] Warning: 'One' is ambiguous. It is defined
1574.08 s
[aeson] * at src/Data/Aeson/Types/Generic.hs:92:1
1574.08 s
[aeson] * in ‘GHC.Types’
1574.08 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.08 s
[aeson] by specifying the type/value namespace explicitly.
1574.08 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Generic.hs:92:1
1574.08 s
[aeson] Warning: 'genericToJSONKey' is out of scope.
1574.08 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.08 s
[aeson] Warning: 'Bool' is ambiguous. It is defined
1574.08 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:370:14
1574.08 s
[aeson] * in ‘GHC.Types’
1574.08 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.08 s
[aeson] by specifying the type/value namespace explicitly.
1574.08 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:370:14
1574.08 s
[aeson] Warning: 'Boolean' is out of scope.
1574.08 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.08 s
[aeson] Warning: 'empty' is ambiguous. It is defined
1574.08 s
[aeson] * at src/Data/Aeson/KeyMap.hs:149:1
1574.08 s
[aeson] * in ‘GHC.Base’
1574.08 s
[aeson] * in ‘Data.ByteString.Lazy’
1574.08 s
[aeson] * in ‘Data.IntMap.Internal’
1574.08 s
[aeson] * in ‘Data.IntSet.Internal’
1574.08 s
[aeson] * in ‘Data.Map.Internal’
1574.08 s
[aeson] * in ‘Data.Sequence.Internal’
1574.08 s
[aeson] * in ‘Data.Set.Internal’
1574.08 s
[aeson] * in ‘Data.DList.Internal’
1574.08 s
[aeson] * in ‘Data.Text.Internal’
1574.08 s
[aeson] * in ‘Data.Text.Internal.Lazy’
1574.08 s
[aeson] * in ‘Data.Text.Short’
1574.08 s
[aeson] * in ‘Data.HashMap.Internal’
1574.08 s
[aeson] * in ‘Data.HashSet.Internal’
1574.08 s
[aeson] * in ‘Data.Vector’
1574.08 s
[aeson] * in ‘Data.Vector.Generic’
1574.08 s
[aeson] * in ‘Data.Vector.Primitive’
1574.08 s
[aeson] * in ‘Data.Vector.Storable’
1574.08 s
[aeson] * in ‘Data.Vector.Unboxed’
1574.08 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.08 s
[aeson] by specifying the type/value namespace explicitly.
1574.08 s
[aeson] Defaulting to the one defined at src/Data/Aeson/KeyMap.hs:149:1
1574.08 s
[aeson] Warning: 'Nothing' is ambiguous. It is defined
1574.08 s
[aeson] * in ‘Data.Strict.Maybe’
1574.08 s
[aeson] * in ‘GHC.Maybe’
1574.08 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.08 s
[aeson] by specifying the type/value namespace explicitly.
1574.08 s
[aeson] Defaulting to the one defined in ‘GHC.Maybe’
1574.08 s
[aeson] Warning: 'Just' is ambiguous. It is defined
1574.08 s
[aeson] * in ‘Data.Strict.Maybe’
1574.08 s
[aeson] * in ‘GHC.Maybe’
1574.08 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.08 s
[aeson] by specifying the type/value namespace explicitly.
1574.08 s
[aeson] Defaulting to the one defined in ‘GHC.Maybe’
1574.08 s
[aeson] Warning: 'map' is ambiguous. It is defined
1574.08 s
[aeson] * at src/Data/Aeson/KeyMap.hs:194:1
1574.08 s
[aeson] * in ‘Data.List.NonEmpty’
1574.08 s
[aeson] * in ‘GHC.Base’
1574.08 s
[aeson] * in ‘Data.ByteString.Lazy’
1574.08 s
[aeson] * in ‘Data.IntMap.Internal’
1574.08 s
[aeson] * in ‘Data.IntSet.Internal’
1574.08 s
[aeson] * in ‘Data.Map.Internal’
1574.08 s
[aeson] * in ‘Data.Set.Internal’
1574.08 s
[aeson] * in ‘Data.DList.DNonEmpty.Internal’
1574.08 s
[aeson] * in ‘Data.DList.Internal’
1574.08 s
[aeson] * in ‘Data.Text’
1574.08 s
[aeson] * in ‘Data.Text.Lazy’
1574.08 s
[aeson] * in ‘Data.HashMap.Internal.Strict’
1574.08 s
[aeson] * in ‘Data.HashSet.Internal’
1574.08 s
[aeson] * in ‘Data.Vector’
1574.08 s
[aeson] * in ‘Data.Vector.Generic’
1574.08 s
[aeson] * in ‘Data.Vector.Primitive’
1574.08 s
[aeson] * in ‘Data.Vector.Storable’
1574.08 s
[aeson] * in ‘Data.Vector.Unboxed’
1574.08 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.08 s
[aeson] by specifying the type/value namespace explicitly.
1574.08 s
[aeson] Defaulting to the one defined at src/Data/Aeson/KeyMap.hs:194:1
1574.08 s
[aeson] Warning: 'Text' is ambiguous. It is defined
1574.08 s
[aeson] * in ‘Data.Text.Internal’
1574.08 s
[aeson] * in ‘Data.Text.Internal.Lazy’
1574.08 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.08 s
[aeson] by specifying the type/value namespace explicitly.
1574.08 s
[aeson] Defaulting to the one defined in ‘Data.Text.Internal.Lazy’
1574.08 s
[aeson] Warning: 'FromJSONKey' is out of scope.
1574.08 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.08 s
[aeson] Warning: 'Foo' is out of scope.
1574.08 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.08 s
[aeson] Warning: 'String' is ambiguous. It is defined
1574.08 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:368:14
1574.08 s
[aeson] * in ‘GHC.Base’
1574.08 s
[lens] depends containers-0.6.8-4775
1574.08 s
[lens] depends lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP
1574.08 s
[lens] depends mtl-2.3.1-63a4
1574.08 s
[lens] depends test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
1574.08 s
[lens] depends test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm
1574.08 s
[lens] depends text-2.1-c36a
1574.08 s
[lens] definite lens-5.3.4-3zEVcbMoV4w92SJxTLjw2n-doctests
1574.08 s
[lens] depends base-4.19.0.0-b960
1574.08 s
[lens] depends deepseq-1.5.0.0-412f
1574.08 s
[lens] depends simple-reflect-0.3.3-AR1spJat8D8GQKEGiEBp4c
1574.08 s
[lens] Using Cabal-3.10.2.0 compiled by ghc-9.8
1574.08 s
[lens] Using compiler: ghc-9.8.1
1574.08 s
[lens] Using install prefix: /nix/store/xm64yi40bcp0a1svvgspxj3mfi95zzfg-lens-5.3.4
1574.08 s
[lens] Executables installed in:
1574.08 s
[lens] /nix/store/xm64yi40bcp0a1svvgspxj3mfi95zzfg-lens-5.3.4/bin
1574.08 s
[lens] Libraries installed in:
1574.08 s
[lens] /nix/store/xm64yi40bcp0a1svvgspxj3mfi95zzfg-lens-5.3.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/lens-5.3.4-KjreUrpYEiwDzpOm8K1SLP
1574.08 s
[lens] Dynamic Libraries installed in:
1574.08 s
[lens] /nix/store/xm64yi40bcp0a1svvgspxj3mfi95zzfg-lens-5.3.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1574.08 s
[lens] Private executables installed in:
1574.08 s
[lens] /nix/store/xm64yi40bcp0a1svvgspxj3mfi95zzfg-lens-5.3.4/libexec/x86_64-linux-ghc-9.8.1/lens-5.3.4
1574.08 s
[lens] Data files installed in:
1574.08 s
[lens] /nix/store/xm64yi40bcp0a1svvgspxj3mfi95zzfg-lens-5.3.4/share/x86_64-linux-ghc-9.8.1/lens-5.3.4
1574.08 s
[lens] Documentation installed in:
1574.08 s
[lens] /nix/store/81r7cwyhx4n6hr2094i81ibh71qp5mpd-lens-5.3.4-doc/share/doc/lens-5.3.4
1574.08 s
[lens] Configuration files installed in:
1574.08 s
[lens] /nix/store/xm64yi40bcp0a1svvgspxj3mfi95zzfg-lens-5.3.4/etc
1574.08 s
[lens] No alex found
1574.08 s
[lens] Using ar found on system at:
1574.08 s
[lens] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1574.08 s
[lens] No c2hs found
1574.08 s
[lens] No cpphs found
1574.08 s
[lens] No doctest found
1574.08 s
[lens] Using gcc version 14.3.0 given by user at:
1574.08 s
[lens] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1574.08 s
[lens] Using ghc version 9.8.1 found on system at:
1574.08 s
[lens] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1574.08 s
[lens] Using ghc-pkg version 9.8.1 found on system at:
1574.08 s
[lens] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1574.08 s
[lens] No ghcjs found
1574.08 s
[lens] No ghcjs-pkg found
1574.08 s
[lens] No greencard found
1574.08 s
[lens] Using haddock version 2.30.0 found on system at:
1574.08 s
[lens] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1574.08 s
[lens] No happy found
1574.08 s
[lens] Using haskell-suite found on system at: haskell-suite-dummy-location
1574.08 s
[lens] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1574.08 s
[lens] No hmake found
1574.08 s
[lens] Using hpc version 0.69 found on system at:
1574.08 s
[lens] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1574.08 s
[lens] Using hsc2hs version 0.68.10 found on system at:
1574.08 s
[lens] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1574.08 s
[lens] Using hscolour version 1.25 found on system at:
1574.08 s
[lens] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1574.08 s
[lens] No jhc found
1574.08 s
[lens] Using ld found on system at:
1574.08 s
[lens] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1574.08 s
[lens] No pkg-config found
1574.08 s
[lens] Using runghc version 9.8.1 found on system at:
1574.08 s
[lens] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1574.08 s
[lens] Using strip version 2.44 found on system at:
1574.08 s
[lens] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1574.08 s
[lens] Using tar found on system at:
1574.08 s
[lens] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1574.08 s
[lens] No uhc found
1574.08 s
[lens] Phase: buildPhase
1574.08 s
[lens] Preprocessing library for lens-5.3.4..
1574.08 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.08 s
[aeson] by specifying the type/value namespace explicitly.
1574.08 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:368:14
1574.09 s
[aeson] Warning: 'showsList' is out of scope.
1574.09 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.09 s
[aeson] Warning: 'object' is ambiguous. It is defined
1574.09 s
[aeson] * at src/Data/Aeson/Encoding/Builder.hs:96:1
1574.09 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:639:1
1574.09 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.09 s
[aeson] by specifying the type/value namespace explicitly.
1574.09 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:639:1
1574.09 s
[aeson] Warning: 'Generic' is ambiguous. It is defined
1574.09 s
[aeson] * in ‘GHC.Generics’
1574.09 s
[aeson] * in ‘Data.Text.Lazy.Builder.RealFloat’
1574.09 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.09 s
[aeson] by specifying the type/value namespace explicitly.
1574.09 s
[aeson] Defaulting to the one defined in ‘GHC.Generics’
1574.09 s
[aeson] Warning: 'Generically' is ambiguous. It is defined
1574.09 s
[aeson] * in ‘GHC.Generics’
1574.09 s
[aeson] * in ‘GHC.Generics’
1574.09 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.09 s
[aeson] by specifying the type/value namespace explicitly.
1574.09 s
[aeson] Defaulting to the one defined in ‘GHC.Generics’
1574.09 s
[aeson] Warning: 'One' is ambiguous. It is defined
1574.09 s
[aeson] * at src/Data/Aeson/Types/Generic.hs:92:1
1574.09 s
[aeson] * in ‘GHC.Types’
1574.09 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.09 s
[aeson] by specifying the type/value namespace explicitly.
1574.09 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Generic.hs:92:1
1574.09 s
[aeson] Warning: 'Object' is ambiguous. It is defined
1574.09 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:366:14
1574.09 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:360:1
1574.09 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.09 s
[aeson] by specifying the type/value namespace explicitly.
1574.09 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:360:1
1574.09 s
[aeson] 93% (138 /148) in 'Data.Aeson.Types'
1574.09 s
[aeson] Missing documentation for:
1574.09 s
[aeson] Key (src/Data/Aeson/Key.hs:44)
1574.09 s
[aeson] ToJSONKeyFunction (src/Data/Aeson/Types/ToJSON.hs:532)
1574.09 s
[aeson] GToJSONKey (src/Data/Aeson/Types/ToJSON.hs:596)
1574.09 s
[aeson] genericToJSONKey (src/Data/Aeson/Types/ToJSON.hs:594)
1574.09 s
[aeson] GFromJSONKey (src/Data/Aeson/Types/FromJSON.hs:521)
1574.09 s
[aeson] omitField1 (src/Data/Aeson/Types/ToJSON.hs:691)
1574.09 s
[aeson] omitField2 (src/Data/Aeson/Types/ToJSON.hs:724)
1574.09 s
[aeson] GToJSON (src/Data/Aeson/Types/Class.hs:120)
1574.09 s
[aeson] GToEncoding (src/Data/Aeson/Types/Class.hs:121)
1574.09 s
[aeson] JSONPath (src/Data/Aeson/Types/Internal.hs:116)
1574.09 s
[aeson] Warning: 'encode' is out of scope.
1574.09 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.09 s
[aeson] Warning: 'fromEncoding' is out of scope.
1574.09 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.09 s
[aeson] 100% ( 3 / 3) in 'Data.Aeson.Text'
1574.09 s
[aeson] Warning: 'AesonException' is ambiguous. It is defined
1574.09 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:923:26
1574.09 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:923:1
1574.09 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.09 s
[aeson] by specifying the type/value namespace explicitly.
1574.09 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:923:1
1574.09 s
[aeson] 100% ( 12 / 12) in 'Data.Aeson.Decoding'
1574.09 s
[aeson] Warning: 'json' is out of scope.
1574.09 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.09 s
[aeson] Warning: 'AesonException' is ambiguous. It is defined
1574.09 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:923:26
1574.09 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:923:1
1574.09 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.09 s
[aeson] by specifying the type/value namespace explicitly.
1574.09 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:923:1
1574.09 s
[aeson] Warning: 'Generic' is out of scope.
1574.09 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.09 s
[aeson] Warning: 'name' is out of scope.
1574.09 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.09 s
[aeson] Warning: 'Object' is ambiguous. It is defined
1574.09 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:366:14
1574.09 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:360:1
1574.09 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.09 s
[aeson] by specifying the type/value namespace explicitly.
1574.09 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:360:1
1574.09 s
[lens] Building library for lens-5.3.4..
1574.09 s
[aeson] Cannot find documentation for: $optionsFields
1574.09 s
[aeson] 92% (132 /143) in 'Data.Aeson'
1574.09 s
[aeson] Missing documentation for:
1574.09 s
[aeson] Key (src/Data/Aeson/Key.hs:44)
1574.09 s
[aeson] JSONPath (src/Data/Aeson/Types/Internal.hs:116)
1574.09 s
[aeson] ToJSONKeyFunction (src/Data/Aeson/Types/ToJSON.hs:532)
1574.09 s
[aeson] GToJSONKey (src/Data/Aeson/Types/ToJSON.hs:596)
1574.09 s
[aeson] genericToJSONKey (src/Data/Aeson/Types/ToJSON.hs:594)
1574.09 s
[aeson] GFromJSONKey (src/Data/Aeson/Types/FromJSON.hs:521)
1574.09 s
[aeson] omitField1 (src/Data/Aeson/Types/ToJSON.hs:691)
1574.09 s
[aeson] omitField2 (src/Data/Aeson/Types/ToJSON.hs:724)
1574.09 s
[aeson] GToJSON (src/Data/Aeson/Types/Class.hs:120)
1574.09 s
[aeson] GToEncoding (src/Data/Aeson/Types/Class.hs:121)
1574.09 s
[aeson] parseIndexedJSON (src/Data/Aeson/Types/FromJSON.hs:171)
1574.09 s
[aeson] Warning: 'Value' is ambiguous. It is defined
1574.09 s
[aeson] * at src/Data/Aeson/Encoding/Internal.hs:130:15
1574.09 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:366:1
1574.09 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.09 s
[aeson] by specifying the type/value namespace explicitly.
1574.09 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:366:1
1574.10 s
[aeson] 100% ( 2 / 2) in 'Data.Aeson.RFC8785'
1574.10 s
[aeson] 100% ( 2 / 2) in 'Data.Aeson.QQ.Simple'
1574.10 s
[aeson] Warning: 'ToJSON' is ambiguous. It is defined
1574.10 s
[aeson] * at src/Data/Aeson/TH.hs:1906:16
1574.10 s
[aeson] * at src/Data/Aeson/Types/ToJSON.hs:291:1
1574.10 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.10 s
[aeson] by specifying the type/value namespace explicitly.
1574.10 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/ToJSON.hs:291:1
1574.10 s
[aeson] Warning: 'drop' is ambiguous. It is defined
1574.10 s
[aeson] * in ‘GHC.List’
1574.10 s
[aeson] * in ‘Data.Text.Short’
1574.10 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.10 s
[aeson] by specifying the type/value namespace explicitly.
1574.10 s
[aeson] Defaulting to the one defined in ‘Data.Text.Short’
1574.11 s
[aeson] Warning: 'Value' is ambiguous. It is defined
1574.11 s
[aeson] * at src/Data/Aeson/Encoding/Internal.hs:130:15
1574.11 s
[aeson] * at src/Data/Aeson/TH.hs:1909:18
1574.11 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:366:1
1574.11 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.11 s
[aeson] by specifying the type/value namespace explicitly.
1574.11 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:366:1
1574.11 s
[aeson] Warning: 'Encoding' is ambiguous. It is defined
1574.11 s
[aeson] * at src/Data/Aeson/Encoding/Internal.hs:82:25
1574.11 s
[aeson] * at src/Data/Aeson/Encoding/Internal.hs:88:1
1574.11 s
[aeson] * at src/Data/Aeson/TH.hs:1909:26
1574.11 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.11 s
[aeson] by specifying the type/value namespace explicitly.
1574.11 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Encoding/Internal.hs:88:1
1574.11 s
[aeson] Warning: 'Object' is ambiguous. It is defined
1574.11 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:366:14
1574.11 s
[aeson] * at src/Data/Aeson/Types/Internal.hs:360:1
1574.11 s
[aeson] You may be able to disambiguate the identifier by qualifying it or
1574.11 s
[aeson] by specifying the type/value namespace explicitly.
1574.11 s
[aeson] Defaulting to the one defined at src/Data/Aeson/Types/Internal.hs:360:1
1574.12 s
[shake] [56 of 73] Compiling Development.Shake.Internal.Derived ( src/Development/Shake/Internal/Derived.hs, dist/build/Development/Shake/Internal/Derived.p_o )
1574.12 s
[shake] [57 of 73] Compiling Development.Shake.Command ( src/Development/Shake/Command.hs, dist/build/Development/Shake/Command.p_o )
1574.13 s
[aeson] Warning: 'FromJSON3' is out of scope.
1574.13 s
[aeson] If you qualify the identifier, haddock can try to link it anyway.
1574.14 s
[aeson] 100% ( 25 / 25) in 'Data.Aeson.TH'
1574.81 s
[regex] Phase: fixupPhase
1574.84 s
[regex] shrinking RPATHs of ELF executables and libraries in /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2
1574.89 s
[regex] shrinking /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSregex-1.1.0.2-CcXhb3THPw21CwYl9RHl1Z-ghc9.8.1.so
1575.01 s
[regex] checking for references to /build/ in /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2...
1575.08 s
[regex] patching script interpreter paths in /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2
1575.09 s
[regex] stripping (with command strip and flags -S -p) in /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2/lib
1575.63 s
[aeson] Warning: Data.Aeson.KeyMap: could not find link destinations for:
1575.63 s
[aeson] - Data.Aeson.KeyMap.D:R:ItemKeyMap
1575.65 s
[aeson] Warning: Data.Aeson.Encoding.Internal: could not find link destinations for:
1575.65 s
[aeson] - Data.Aeson.Types.ToJSON.EncodeProduct
1575.65 s
[aeson] - Data.Aeson.Types.ToJSON.gToJSON
1575.66 s
[aeson] Warning: Data.Aeson.Encoding: could not find link destinations for:
1575.66 s
[aeson] - Data.Aeson.Types.ToJSON.EncodeProduct
1575.66 s
[aeson] - Data.Aeson.Types.ToJSON.gToJSON
1575.73 s
[regex] shrinking RPATHs of ELF executables and libraries in /nix/store/29dzdfdjmihjak00g3p2xwdqgnihm3r8-regex-1.1.0.2-doc
1575.76 s
[regex] checking for references to /build/ in /nix/store/29dzdfdjmihjak00g3p2xwdqgnihm3r8-regex-1.1.0.2-doc...
1575.80 s
[regex] patching script interpreter paths in /nix/store/29dzdfdjmihjak00g3p2xwdqgnihm3r8-regex-1.1.0.2-doc
1576.15 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2 /nix/store/29dzdfdjmihjak00g3p2xwdqgnihm3r8-regex-1.1.0.2-doc
1576.82 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1576.87 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2 /nix/store/29dzdfdjmihjak00g3p2xwdqgnihm3r8-regex-1.1.0.2-doc
1576.96 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1577.03 s
[post-build-hook] copying 7 paths...
1577.03 s
[post-build-hook] copying path '/nix/store/fia23lf0hm023fx0rjdnvv0wb73g9g3b-time-locale-compat-0.1.1.5-doc' to 'https://cache.nix-ci.com'...
1577.03 s
[post-build-hook] copying path '/nix/store/3lfdn4b64alii2a83cp79rawkmgbh9jy-utf8-string-1.0.2-doc' to 'https://cache.nix-ci.com'...
1577.03 s
[post-build-hook] copying path '/nix/store/l4zjz3y9yx8xplrk4zw934ffb70sm4r5-regex-pcre-builtin-0.95.2.3.8.44-doc' to 'https://cache.nix-ci.com'...
1577.17 s
[post-build-hook] copying path '/nix/store/vg0b7qkf4013vgf2mzaadlnlqxrhsw1a-time-locale-compat-0.1.1.5' to 'https://cache.nix-ci.com'...
1577.65 s
[post-build-hook] copying path '/nix/store/frxfhjlp9zgi4vaylqfkspl000njgdhd-utf8-string-1.0.2' to 'https://cache.nix-ci.com'...
1577.65 s
[post-build-hook] copying path '/nix/store/kf16zz3xhmlrf2i22piqbcj1jyx73jpi-regex-pcre-builtin-0.95.2.3.8.44' to 'https://cache.nix-ci.com'...
1579.62 s
[post-build-hook] copying path '/nix/store/0a6ynk5pvl405zyj15cr1dyhr6m945sb-regex-1.1.0.2' to 'https://cache.nix-ci.com'...
1586.01 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1586.16 s
[post-build-hook] copying 0 paths...
1586.21 s
Progress: 94 of 171 built (7 building), 395 of 395 downloaded from cache
1586.21 s
[aeson] Warning: Data.Aeson.Types: could not find link destinations for:
1586.21 s
[aeson] - Data.Vector.++
1586.21 s
[aeson] - Data.Vector.Vector
1586.21 s
[aeson] - Data.Vector.Generic.Base.Vector
1586.21 s
[aeson] - Data.Aeson.Types.Generic.ProductSize
1586.21 s
[aeson] - Data.Aeson.Types.Generic.AllNullary
1586.21 s
[aeson] - Data.Aeson.Types.Internal.Rep_Value
1586.21 s
[aeson] - Data.Vector.Primitive.Vector
1586.21 s
[aeson] - Data.Vector.Storable.Vector
1586.21 s
[aeson] - Data.Vector.Unboxed.Base.Vector
1586.21 s
[aeson] - Data.Aeson.Types.FromJSON.ConstructorNames
1586.21 s
[aeson] - Data.Aeson.Types.FromJSON.SumFromString
1586.21 s
[aeson] - Data.Aeson.Types.FromJSON.GFromJSON'
1586.21 s
[aeson] - Data.Aeson.Types.FromJSON.gParseJSON
1586.21 s
[aeson] - Data.Aeson.Types.FromJSON.withBoundedScientific
1586.21 s
[aeson] - Data.Aeson.Types.ToJSON.EncodeProduct
1586.21 s
[aeson] - Data.Aeson.Types.ToJSON.WriteProduct
1586.21 s
[aeson] - Data.Aeson.Types.ToJSON.ConsToJSON
1586.21 s
[aeson] - Data.Aeson.Types.ToJSON.GetConName
1586.21 s
[aeson] - Data.Aeson.Types.ToJSON.SumToJSON
1586.21 s
[aeson] - Data.Aeson.Types.ToJSON.gToJSON
1586.21 s
[aeson] Warning: Data.Aeson: could not find link destinations for:
1586.21 s
[aeson] - Data.Vector.Vector
1586.21 s
[aeson] - Data.Vector.Generic.Base.Vector
1586.21 s
[aeson] - Data.Aeson.Types.Generic.ProductSize
1586.21 s
[aeson] - Data.Aeson.Types.Generic.AllNullary
1586.21 s
[aeson] - Data.Aeson.Types.Internal.Rep_Value
1586.21 s
[aeson] - Data.Vector.Primitive.Vector
1586.21 s
[aeson] - Data.Vector.Storable.Vector
1586.21 s
[aeson] - Data.Vector.Unboxed.Base.Vector
1586.21 s
[aeson] - Data.Aeson.Types.FromJSON.ConstructorNames
1586.21 s
[aeson] - Data.Aeson.Types.FromJSON.SumFromString
1586.21 s
[aeson] - Data.Aeson.Types.FromJSON.GFromJSON'
1586.22 s
[aeson] - Data.Aeson.Types.FromJSON.gParseJSON
1586.22 s
[aeson] - Data.Aeson.Types.FromJSON.withBoundedScientific
1586.22 s
[aeson] - Data.Aeson.Types.ToJSON.EncodeProduct
1586.22 s
[aeson] - Data.Aeson.Types.ToJSON.WriteProduct
1586.22 s
[aeson] - Data.Aeson.Types.ToJSON.ConsToJSON
1586.22 s
[aeson] - Data.Aeson.Types.ToJSON.GetConName
1586.22 s
[aeson] - Data.Aeson.Types.ToJSON.SumToJSON
1586.22 s
[aeson] - Data.Aeson.Types.ToJSON.gToJSON
1586.22 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1586.22 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1586.22 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
1586.22 s
[algebraic-graphs] OK: splitVertex1 x [x] == id
1586.22 s
[algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
1586.22 s
[algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] ============ NonEmpty.Graph.transpose ============
1586.22 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1586.22 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1586.22 s
[algebraic-graphs] OK: transpose . transpose == id
1586.22 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1586.22 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
1586.22 s
[algebraic-graphs] OK: induce1 (const True ) x == Just x
1586.22 s
[algebraic-graphs] OK: induce1 (const False) x == Nothing
1586.22 s
[algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
1586.22 s
[algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
1586.22 s
[algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
1586.22 s
[algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
1586.22 s
[algebraic-graphs] OK: induceJust1 . fmap Just == Just
1586.22 s
[algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] ============ NonEmpty.Graph.simplify ============
1586.22 s
[algebraic-graphs] OK: simplify == id
1586.22 s
[algebraic-graphs] OK: size (simplify x) <= size x
1586.22 s
[algebraic-graphs] OK: simplify 1 === 1
1586.22 s
[algebraic-graphs] OK: simplify (1 + 1) === 1
1586.22 s
[algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
1586.22 s
[algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
1586.22 s
[algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
1586.22 s
[algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
1586.22 s
[algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
1586.22 s
[algebraic-graphs] OK: size (sparsify x) <= 3 * size x
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
1586.22 s
[algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
1586.22 s
[algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
1586.22 s
[algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] ============ NonEmpty.Graph.box ============
1586.22 s
[algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
1586.22 s
[algebraic-graphs] OK: box x y ~~ box y x
1586.22 s
[algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
1586.22 s
[algebraic-graphs] OK: box x (vertex ()) ~~ x
1586.22 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1586.22 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1586.22 s
[algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
1586.22 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] ============ Relation ============
1586.22 s
[algebraic-graphs] OK: Axioms of graphs
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] ============ Relation.consistent ============
1586.22 s
[algebraic-graphs] OK: Consistency of the Arbitrary instance
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] OK: consistent empty == True
1586.22 s
[algebraic-graphs] OK: consistent (vertex x) == True
1586.22 s
[algebraic-graphs] OK: consistent (overlay x y) == True
1586.22 s
[algebraic-graphs] OK: consistent (connect x y) == True
1586.22 s
[algebraic-graphs] OK: consistent (edge x y) == True
1586.22 s
[algebraic-graphs] OK: consistent (edges xs) == True
1586.22 s
[algebraic-graphs] OK: consistent (stars xs) == True
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] ============ Relation.Show ============
1586.22 s
[algebraic-graphs] OK: show (empty ) == "empty"
1586.22 s
[algebraic-graphs] OK: show (1 ) == "vertex 1"
1586.22 s
[algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
1586.22 s
[algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
1586.22 s
[algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
1586.22 s
[algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
1586.22 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
1586.22 s
[algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
1586.22 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
1586.22 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] ============ Relation.Ord ============
1586.22 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1586.22 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1586.22 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1586.22 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1586.22 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1586.22 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1586.22 s
[algebraic-graphs] OK: x <= x + y
1586.22 s
[algebraic-graphs] OK: x + y <= x * y
1586.22 s
[algebraic-graphs]
1586.22 s
[algebraic-graphs] ============ Relation.empty ============
1586.22 s
[algebraic-graphs] OK: isEmpty empty == True
1586.22 s
[algebraic-graphs] OK: hasVertex x empty == False
1586.22 s
[algebraic-graphs] OK: vertexCount empty == 0
1586.22 s
[algebraic-graphs] OK: edgeCount empty == 0
1586.22 s
[algebraic-graphs]
1586.22 s
[lens] [ 1 of 85] Compiling Control.Lens.Internal.CTypes ( src/Control/Lens/Internal/CTypes.hs, dist/build/Control/Lens/Internal/CTypes.o, dist/build/Control/Lens/Internal/CTypes.dyn_o )
1586.22 s
[lens] [ 2 of 85] Compiling Control.Lens.Internal.Doctest ( src/Control/Lens/Internal/Doctest.hs, dist/build/Control/Lens/Internal/Doctest.o, dist/build/Control/Lens/Internal/Doctest.dyn_o )
1586.22 s
[lens] [ 3 of 85] Compiling Control.Lens.Internal.Instances ( src/Control/Lens/Internal/Instances.hs, dist/build/Control/Lens/Internal/Instances.o, dist/build/Control/Lens/Internal/Instances.dyn_o )
1586.22 s
[lens] [ 4 of 85] Compiling Control.Lens.Internal.Iso ( src/Control/Lens/Internal/Iso.hs, dist/build/Control/Lens/Internal/Iso.o, dist/build/Control/Lens/Internal/Iso.dyn_o )
1586.22 s
[lens] [ 5 of 85] Compiling Control.Lens.Internal.List ( src/Control/Lens/Internal/List.hs, dist/build/Control/Lens/Internal/List.o, dist/build/Control/Lens/Internal/List.dyn_o )
1586.22 s
[lens] [ 6 of 85] Compiling Control.Lens.Internal.Prelude ( src/Control/Lens/Internal/Prelude.hs, dist/build/Control/Lens/Internal/Prelude.o, dist/build/Control/Lens/Internal/Prelude.dyn_o )
1586.22 s
[lens] [ 7 of 85] Compiling Control.Lens.Internal.Level ( src/Control/Lens/Internal/Level.hs, dist/build/Control/Lens/Internal/Level.o, dist/build/Control/Lens/Internal/Level.dyn_o )
1586.22 s
[lens] [ 8 of 85] Compiling Control.Lens.Internal.Indexed ( src/Control/Lens/Internal/Indexed.hs, dist/build/Control/Lens/Internal/Indexed.o, dist/build/Control/Lens/Internal/Indexed.dyn_o )
1586.22 s
[lens] [ 9 of 85] Compiling Control.Lens.Internal.Getter ( src/Control/Lens/Internal/Getter.hs, dist/build/Control/Lens/Internal/Getter.o, dist/build/Control/Lens/Internal/Getter.dyn_o )
1586.22 s
[lens] [10 of 85] Compiling Control.Lens.Internal.Fold ( src/Control/Lens/Internal/Fold.hs, dist/build/Control/Lens/Internal/Fold.o, dist/build/Control/Lens/Internal/Fold.dyn_o )
1586.22 s
[lens] [11 of 85] Compiling Control.Lens.Internal.Context ( src/Control/Lens/Internal/Context.hs, dist/build/Control/Lens/Internal/Context.o, dist/build/Control/Lens/Internal/Context.dyn_o )
1586.22 s
[lens] [12 of 85] Compiling Control.Lens.Internal.Bazaar ( src/Control/Lens/Internal/Bazaar.hs, dist/build/Control/Lens/Internal/Bazaar.o, dist/build/Control/Lens/Internal/Bazaar.dyn_o )
1586.22 s
[lens] [13 of 85] Compiling Control.Lens.Internal.Magma ( src/Control/Lens/Internal/Magma.hs, dist/build/Control/Lens/Internal/Magma.o, dist/build/Control/Lens/Internal/Magma.dyn_o )
1586.22 s
[lens] [14 of 85] Compiling Control.Lens.Internal.Prism ( src/Control/Lens/Internal/Prism.hs, dist/build/Control/Lens/Internal/Prism.o, dist/build/Control/Lens/Internal/Prism.dyn_o )
1586.22 s
[lens] [15 of 85] Compiling Control.Lens.Internal.Profunctor ( src/Control/Lens/Internal/Profunctor.hs, dist/build/Control/Lens/Internal/Profunctor.o, dist/build/Control/Lens/Internal/Profunctor.dyn_o )
1586.22 s
[lens] [16 of 85] Compiling Control.Lens.Internal.Review ( src/Control/Lens/Internal/Review.hs, dist/build/Control/Lens/Internal/Review.o, dist/build/Control/Lens/Internal/Review.dyn_o )
1586.22 s
[lens] [17 of 85] Compiling Control.Lens.Internal.Setter ( src/Control/Lens/Internal/Setter.hs, dist/build/Control/Lens/Internal/Setter.o, dist/build/Control/Lens/Internal/Setter.dyn_o )
1586.22 s
[lens] [18 of 85] Compiling Control.Lens.Internal.Zoom ( src/Control/Lens/Internal/Zoom.hs, dist/build/Control/Lens/Internal/Zoom.o, dist/build/Control/Lens/Internal/Zoom.dyn_o )
1586.22 s
[lens] [19 of 85] Compiling Control.Lens.Internal ( src/Control/Lens/Internal.hs, dist/build/Control/Lens/Internal.o, dist/build/Control/Lens/Internal.dyn_o )
1586.22 s
[lens] [20 of 85] Compiling Control.Lens.Type ( src/Control/Lens/Type.hs, dist/build/Control/Lens/Type.o, dist/build/Control/Lens/Type.dyn_o )
1586.22 s
[lens] [21 of 85] Compiling Control.Lens.Setter ( src/Control/Lens/Setter.hs, dist/build/Control/Lens/Setter.o, dist/build/Control/Lens/Setter.dyn_o )
1586.22 s
[lens] [22 of 85] Compiling Control.Lens.Lens ( src/Control/Lens/Lens.hs, dist/build/Control/Lens/Lens.o, dist/build/Control/Lens/Lens.dyn_o )
1586.22 s
[lens] [23 of 85] Compiling Control.Lens.Tuple ( src/Control/Lens/Tuple.hs, dist/build/Control/Lens/Tuple.o, dist/build/Control/Lens/Tuple.dyn_o )
1586.22 s
[pointed] Phase: checkPhase
1586.22 s
[pointed] Package has no test suites.
1586.22 s
[pointed] Phase: haddockPhase
1586.22 s
[pointed] Preprocessing library for pointed-5.0.5..
1586.22 s
[pointed] Running Haddock on library for pointed-5.0.5..
1586.22 s
[pointed] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1586.22 s
[pointed] [1 of 2] Compiling Data.Copointed ( src/Data/Copointed.hs, nothing )
1586.22 s
[pointed] [2 of 2] Compiling Data.Pointed ( src/Data/Pointed.hs, nothing )
1586.22 s
[pointed] Haddock coverage:
1586.22 s
[pointed] 50% ( 1 / 2) in 'Data.Copointed'
1586.22 s
[pointed] Missing documentation for:
1586.22 s
[pointed] Module header
1586.22 s
[pointed] 0% ( 0 / 2) in 'Data.Pointed'
1586.22 s
[pointed] Missing documentation for:
1586.22 s
[pointed] Module header
1586.22 s
[pointed] Pointed (src/Data/Pointed.hs:88)
1586.22 s
[pointed] Documentation created: dist/doc/html/pointed/,
1586.22 s
[pointed] dist/doc/html/pointed/pointed.txt
1586.22 s
[pointed] Phase: installPhase
1586.22 s
[pointed] Installing library in /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/pointed-5.0.5-ArcipP7cLHIAUvoaOddqJf
1586.22 s
[pointed] Phase: fixupPhase
1586.22 s
[pointed] shrinking RPATHs of ELF executables and libraries in /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5
1586.22 s
[pointed] shrinking /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSpointed-5.0.5-ArcipP7cLHIAUvoaOddqJf-ghc9.8.1.so
1586.22 s
[pointed] checking for references to /build/ in /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5...
1586.22 s
[pointed] patching script interpreter paths in /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5
1586.22 s
[pointed] stripping (with command strip and flags -S -p) in /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5/lib
1586.22 s
[pointed] shrinking RPATHs of ELF executables and libraries in /nix/store/wi1zwklwcq68c9ibyp049c4irci5m077-pointed-5.0.5-doc
1586.23 s
[pointed] checking for references to /build/ in /nix/store/wi1zwklwcq68c9ibyp049c4irci5m077-pointed-5.0.5-doc...
1586.23 s
[pointed] patching script interpreter paths in /nix/store/wi1zwklwcq68c9ibyp049c4irci5m077-pointed-5.0.5-doc
1586.23 s
[quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
1586.23 s
[quickcheck-instances] Phase: configurePhase
1586.23 s
[quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/f8nlxfwdl2jjbrn5va2sqgx05ays6zc1-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32 --with-gcc=gcc --package-db=/build/tmp.9frGfTtFku/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1586.23 s
[quickcheck-instances] Using Parsec parser
1586.23 s
[quickcheck-instances] Configuring quickcheck-instances-0.3.32...
1586.23 s
[quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
1586.23 s
[quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.15.1: using QuickCheck-2.14.3
1586.23 s
[quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.6.0
1586.23 s
[quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.19.0.0
1586.23 s
[quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.0.2
1586.23 s
[quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
1586.23 s
[quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.8
1586.23 s
[quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
1586.23 s
[quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
1586.23 s
[quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
1586.23 s
[quickcheck-instances] integer-logarithms-1.0.4
1586.23 s
[quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
1586.23 s
[quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
1586.23 s
[quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
1586.23 s
[quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.1
1586.23 s
[quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
1586.23 s
[quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.8
1586.23 s
[quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1
1586.23 s
[quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
1586.23 s
[quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
1586.23 s
[quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.7
1586.23 s
[quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.0
1586.23 s
[quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
1586.23 s
[quickcheck-instances] unordered-containers-0.2.20
1586.23 s
[quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
1586.23 s
[quickcheck-instances] Dependency vector >=0.13.1.0 && <0.14: using vector-0.13.2.0
1586.23 s
[quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.14.3
1586.23 s
[quickcheck-instances] Dependency base: using base-4.19.0.0
1586.23 s
[quickcheck-instances] Dependency containers: using containers-0.6.8
1586.23 s
[quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
1586.23 s
[quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.32
1586.23 s
[quickcheck-instances] Dependency tagged: using tagged-0.8.8
1586.23 s
[quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
1586.23 s
[quickcheck-instances] Source component graph:
1586.23 s
[quickcheck-instances] component lib
1586.23 s
[quickcheck-instances] component test:self-test dependency lib
1586.23 s
[quickcheck-instances] Configured component graph:
1586.23 s
[quickcheck-instances] component quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
1586.23 s
[quickcheck-instances] include OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
1586.23 s
[quickcheck-instances] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1586.23 s
[quickcheck-instances] include array-0.5.6.0-dc89
1586.23 s
[quickcheck-instances] include base-4.19.0.0-b960
1586.23 s
[quickcheck-instances] include bytestring-0.12.0.2-4690
1586.23 s
[quickcheck-instances] include case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
1586.23 s
[quickcheck-instances] include containers-0.6.8-4775
1586.23 s
[quickcheck-instances] include data-fix-0.3.4-90kAYHfhdX433d7z3npPya
1586.23 s
[quickcheck-instances] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1586.23 s
[quickcheck-instances] include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
1586.23 s
[quickcheck-instances] include old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
1586.23 s
[quickcheck-instances] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1586.23 s
[quickcheck-instances] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1586.23 s
[shake] [58 of 73] Compiling Development.Shake.Internal.Rules.Directory ( src/Development/Shake/Internal/Rules/Directory.hs, dist/build/Development/Shake/Internal/Rules/Directory.p_o )
1586.23 s
[shake] [59 of 73] Compiling Development.Shake.Internal.Rules.Default ( src/Development/Shake/Internal/Rules/Default.hs, dist/build/Development/Shake/Internal/Rules/Default.p_o )
1586.23 s
[shake] [60 of 73] Compiling Paths_shake ( dist/build/autogen/Paths_shake.hs, dist/build/Paths_shake.p_o )
1586.23 s
[shake] [61 of 73] Compiling Development.Shake.Internal.Paths ( src/Development/Shake/Internal/Paths.hs, dist/build/Development/Shake/Internal/Paths.p_o )
1586.23 s
[shake] [62 of 73] Compiling General.Template ( src/General/Template.hs, dist/build/General/Template.p_o )
1586.23 s
[shake] [63 of 73] Compiling Development.Shake.Internal.Progress ( src/Development/Shake/Internal/Progress.hs, dist/build/Development/Shake/Internal/Progress.p_o )
1586.23 s
[shake] [64 of 73] Compiling Development.Shake.Internal.CompactUI ( src/Development/Shake/Internal/CompactUI.hs, dist/build/Development/Shake/Internal/CompactUI.p_o )
1586.23 s
[shake] [65 of 73] Compiling Development.Shake.Internal.Profile ( src/Development/Shake/Internal/Profile.hs, dist/build/Development/Shake/Internal/Profile.p_o )
1586.23 s
[shake] [66 of 73] Compiling Development.Shake.Internal.Core.Run ( src/Development/Shake/Internal/Core/Run.hs, dist/build/Development/Shake/Internal/Core/Run.p_o )
1586.23 s
[shake] [67 of 73] Compiling Development.Shake.Database ( src/Development/Shake/Database.hs, dist/build/Development/Shake/Database.p_o )
1586.23 s
[shake] [68 of 73] Compiling Development.Shake.Internal.Demo ( src/Development/Shake/Internal/Demo.hs, dist/build/Development/Shake/Internal/Demo.p_o )
1586.23 s
[shake] [69 of 73] Compiling Development.Shake.Internal.Args ( src/Development/Shake/Internal/Args.hs, dist/build/Development/Shake/Internal/Args.p_o )
1586.23 s
[shake] [70 of 73] Compiling Development.Shake ( src/Development/Shake.hs, dist/build/Development/Shake.p_o )
1586.23 s
[shake] [71 of 73] Compiling Development.Shake.Util ( src/Development/Shake/Util.hs, dist/build/Development/Shake/Util.p_o )
1586.23 s
[shake] [72 of 73] Compiling Development.Shake.Forward ( src/Development/Shake/Forward.hs, dist/build/Development/Shake/Forward.p_o )
1586.23 s
[shake] [73 of 73] Compiling Development.Shake.Config ( src/Development/Shake/Config.hs, dist/build/Development/Shake/Config.p_o )
1586.23 s
[shake] buildPhase completed in 8 minutes 15 seconds
1586.23 s
[shake] Phase: haddockPhase
1586.23 s
[shake] Preprocessing executable 'shake' for shake-0.19.8..
1586.23 s
[shake] Preprocessing library for shake-0.19.8..
1586.23 s
[shake] Running Haddock on library for shake-0.19.8..
1586.23 s
[shake] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1586.23 s
[algebraic-graphs] ============ Relation.vertex ============
1586.23 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1586.23 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1586.23 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1586.23 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1586.23 s
[algebraic-graphs]
1586.23 s
[algebraic-graphs] ============ Relation.edge ============
1586.23 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1586.23 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1586.23 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1586.23 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1586.23 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1586.23 s
[algebraic-graphs]
1586.23 s
[algebraic-graphs] ============ Relation.overlay ============
1586.23 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1586.23 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1586.23 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1586.23 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1586.23 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1586.23 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1586.23 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1586.23 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1586.23 s
[algebraic-graphs]
1586.23 s
[algebraic-graphs] ============ Relation.connect ============
1586.23 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1586.23 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1586.23 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1586.23 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1586.23 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1586.23 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1586.23 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1586.23 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1586.23 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1586.23 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1586.23 s
[algebraic-graphs]
1586.23 s
[algebraic-graphs] ============ Relation.vertices ============
1586.23 s
[algebraic-graphs] OK: vertices [] == empty
1586.23 s
[algebraic-graphs] OK: vertices [x] == vertex x
1586.23 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1586.23 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1586.23 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1586.23 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1586.23 s
[algebraic-graphs]
1586.23 s
[algebraic-graphs] ============ Relation.edges ============
1586.23 s
[algebraic-graphs] OK: edges [] == empty
1586.23 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1586.23 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1586.23 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1586.23 s
[algebraic-graphs]
1586.23 s
[algebraic-graphs] ============ Relation.overlays ============
1586.23 s
[algebraic-graphs] OK: overlays [] == empty
1586.23 s
[algebraic-graphs] OK: overlays [x] == x
1586.23 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1586.23 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1586.23 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1586.23 s
[algebraic-graphs]
1586.23 s
[algebraic-graphs] ============ Relation.connects ============
1586.23 s
[algebraic-graphs] OK: connects [] == empty
1586.23 s
[algebraic-graphs] OK: connects [x] == x
1586.23 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1586.23 s
[algebraic-graphs] OK: connects == foldr connect empty
1586.23 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1586.23 s
[algebraic-graphs]
1586.23 s
[algebraic-graphs] ============ Relation.isSubgraphOf ============
1586.23 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1586.23 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1586.23 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1586.23 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1586.23 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1586.23 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1586.23 s
[algebraic-graphs]
1586.23 s
[algebraic-graphs] ============ Relation.toGraph et al. ============
1586.23 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1586.23 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1586.23 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1586.23 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1586.23 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1586.23 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1586.23 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1586.23 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1586.23 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1586.23 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1586.23 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1586.24 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1586.24 s
[algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
1586.24 s
[algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
1586.24 s
[algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
1586.24 s
[algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
1586.24 s
[algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
1586.37 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5 /nix/store/wi1zwklwcq68c9ibyp049c4irci5m077-pointed-5.0.5-doc
1587.06 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1587.10 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5 /nix/store/wi1zwklwcq68c9ibyp049c4irci5m077-pointed-5.0.5-doc
1587.31 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1587.41 s
[post-build-hook] copying 1 paths...
1587.41 s
[post-build-hook] copying path '/nix/store/a2ai411cdf1923ikz8illlqasix5xjh7-pointed-5.0.5' to 'https://cache.nix-ci.com'...
1588.11 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1588.35 s
[post-build-hook] copying 0 paths...
1588.51 s
Progress: 95 of 171 built (6 building), 395 of 395 downloaded from cache
1588.51 s
[quickcheck-instances] include splitmix-0.1.1-AoP57hqMhOYD9c7s1NlK2Y
1588.51 s
[quickcheck-instances] include strict-0.5.1-GVSVdbGTOCS56r31yJq782
1588.51 s
[quickcheck-instances] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1588.52 s
[quickcheck-instances] include text-2.1-c36a
1588.52 s
[quickcheck-instances] include text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
1588.52 s
[quickcheck-instances] include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
1588.52 s
[quickcheck-instances] include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
1588.52 s
[quickcheck-instances] include transformers-0.6.1.0-c3ec
1588.52 s
[quickcheck-instances] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1588.52 s
[quickcheck-instances] include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
1588.52 s
[quickcheck-instances] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1588.52 s
[quickcheck-instances] component quickcheck-instances-0.3.32-EqnsGjJX1nY9SmASoFIwTc-self-test
1588.52 s
[quickcheck-instances] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1588.52 s
[quickcheck-instances] include base-4.19.0.0-b960
1588.52 s
[quickcheck-instances] include containers-0.6.8-4775
1588.52 s
[quickcheck-instances] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1588.52 s
[quickcheck-instances] include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
1588.52 s
[quickcheck-instances] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1588.52 s
[quickcheck-instances] include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
1588.52 s
[quickcheck-instances] Linked component graph:
1588.52 s
[quickcheck-instances] unit quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
1588.52 s
[quickcheck-instances] include OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
1588.52 s
[quickcheck-instances] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1588.52 s
[quickcheck-instances] include array-0.5.6.0-dc89
1588.52 s
[quickcheck-instances] include base-4.19.0.0-b960
1588.52 s
[quickcheck-instances] include bytestring-0.12.0.2-4690
1588.52 s
[quickcheck-instances] include case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
1588.52 s
[quickcheck-instances] include containers-0.6.8-4775
1588.52 s
[quickcheck-instances] include data-fix-0.3.4-90kAYHfhdX433d7z3npPya
1588.52 s
[quickcheck-instances] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1588.52 s
[quickcheck-instances] include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
1588.52 s
[quickcheck-instances] include old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
1588.52 s
[quickcheck-instances] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1588.52 s
[quickcheck-instances] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1588.52 s
[quickcheck-instances] include splitmix-0.1.1-AoP57hqMhOYD9c7s1NlK2Y
1588.52 s
[quickcheck-instances] include strict-0.5.1-GVSVdbGTOCS56r31yJq782
1588.52 s
[quickcheck-instances] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1588.52 s
[quickcheck-instances] include text-2.1-c36a
1588.52 s
[quickcheck-instances] include text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
1588.52 s
[quickcheck-instances] include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
1588.52 s
[quickcheck-instances] include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
1588.52 s
[quickcheck-instances] include transformers-0.6.1.0-c3ec
1588.52 s
[quickcheck-instances] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1588.52 s
[quickcheck-instances] include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
1588.52 s
[quickcheck-instances] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1588.68 s
Building vector-instances
1588.68 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1588.68 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1588.68 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1588.68 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1588.68 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1588.68 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1588.68 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1588.68 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1588.68 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1588.68 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1588.68 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1588.68 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1588.68 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1588.68 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1588.68 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1588.68 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1588.68 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1588.68 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1588.68 s
[algebraic-graphs]
1588.68 s
[algebraic-graphs] ============ Relation.foldg ============
1588.68 s
[algebraic-graphs] OK: foldg empty vertex overlay connect == id
1588.68 s
[algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
1588.68 s
[algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
1588.68 s
[algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
1588.68 s
[algebraic-graphs]
1588.68 s
[algebraic-graphs] ============ Relation.isEmpty ============
1588.68 s
[algebraic-graphs] OK: isEmpty empty == True
1588.68 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1588.68 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1588.68 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1588.68 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1588.68 s
[algebraic-graphs]
1588.68 s
[algebraic-graphs] ============ Relation.hasVertex ============
1588.68 s
[algebraic-graphs] OK: hasVertex x empty == False
1588.68 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1588.68 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1588.68 s
[algebraic-graphs]
1588.68 s
[algebraic-graphs] ============ Relation.hasEdge ============
1588.68 s
[algebraic-graphs] OK: hasEdge x y empty == False
1588.68 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1588.68 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1588.68 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1588.68 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1588.68 s
[algebraic-graphs]
1588.68 s
[algebraic-graphs] ============ Relation.vertexCount ============
1588.68 s
[algebraic-graphs] OK: vertexCount empty == 0
1588.68 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1588.68 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1588.68 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1588.68 s
[algebraic-graphs]
1588.68 s
[algebraic-graphs] ============ Relation.edgeCount ============
1588.68 s
[algebraic-graphs] OK: edgeCount empty == 0
1588.68 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1588.68 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1588.68 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1588.68 s
[algebraic-graphs]
1588.68 s
[algebraic-graphs] ============ Relation.vertexList ============
1588.68 s
[algebraic-graphs] OK: vertexList empty == []
1588.68 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1588.68 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1588.68 s
[algebraic-graphs]
1588.68 s
[algebraic-graphs] ============ Relation.vertexSet ============
1588.68 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1588.68 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1588.68 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1588.68 s
[algebraic-graphs]
1588.68 s
[algebraic-graphs] ============ Relation.vertexIntSet ============
1588.68 s
[algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
1588.68 s
[algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
1588.68 s
[algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
1588.68 s
[algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
1588.69 s
[algebraic-graphs]
1588.69 s
[algebraic-graphs] ============ Relation.edgeList ============
1588.69 s
[algebraic-graphs] OK: edgeList empty == []
1588.69 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1588.69 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1588.69 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1588.69 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1588.69 s
[algebraic-graphs]
1588.69 s
[algebraic-graphs] ============ Relation.edgeSet ============
1588.69 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1588.69 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1588.69 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1588.69 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1588.69 s
[algebraic-graphs]
1588.69 s
[algebraic-graphs] ============ Relation.adjacencyList ============
1588.69 s
[quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Void
1588.69 s
[quickcheck-instances] unit quickcheck-instances-0.3.32-EqnsGjJX1nY9SmASoFIwTc-self-test
1588.69 s
[quickcheck-instances] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1588.69 s
[quickcheck-instances] include base-4.19.0.0-b960
1588.69 s
[quickcheck-instances] include containers-0.6.8-4775
1588.69 s
[quickcheck-instances] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1588.69 s
[quickcheck-instances] include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
1588.69 s
[quickcheck-instances] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1588.69 s
[quickcheck-instances] include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
1588.69 s
[quickcheck-instances] Ready component graph:
1588.69 s
[quickcheck-instances] definite quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
1588.69 s
[quickcheck-instances] depends OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
1588.69 s
[quickcheck-instances] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1588.69 s
[quickcheck-instances] depends array-0.5.6.0-dc89
1588.69 s
[quickcheck-instances] depends base-4.19.0.0-b960
1588.69 s
[quickcheck-instances] depends bytestring-0.12.0.2-4690
1588.69 s
[quickcheck-instances] depends case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
1588.69 s
[quickcheck-instances] depends containers-0.6.8-4775
1588.69 s
[quickcheck-instances] depends data-fix-0.3.4-90kAYHfhdX433d7z3npPya
1588.69 s
[quickcheck-instances] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1588.69 s
[quickcheck-instances] depends integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
1588.69 s
[quickcheck-instances] depends old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
1588.69 s
[quickcheck-instances] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1588.69 s
[quickcheck-instances] depends scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1588.69 s
[quickcheck-instances] depends splitmix-0.1.1-AoP57hqMhOYD9c7s1NlK2Y
1588.69 s
[quickcheck-instances] depends strict-0.5.1-GVSVdbGTOCS56r31yJq782
1588.69 s
[quickcheck-instances] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1588.69 s
[quickcheck-instances] depends text-2.1-c36a
1588.69 s
[quickcheck-instances] depends text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
1588.69 s
[quickcheck-instances] depends these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
1588.69 s
[quickcheck-instances] depends time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
1588.69 s
[quickcheck-instances] depends transformers-0.6.1.0-c3ec
1588.69 s
[quickcheck-instances] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1588.69 s
[quickcheck-instances] depends uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
1588.69 s
[quickcheck-instances] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
1588.69 s
[quickcheck-instances] definite quickcheck-instances-0.3.32-EqnsGjJX1nY9SmASoFIwTc-self-test
1588.69 s
[quickcheck-instances] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1588.69 s
[quickcheck-instances] depends base-4.19.0.0-b960
1588.69 s
[quickcheck-instances] depends containers-0.6.8-4775
1588.69 s
[quickcheck-instances] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1588.69 s
[quickcheck-instances] depends quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
1588.69 s
[quickcheck-instances] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1588.69 s
[quickcheck-instances] depends uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
1588.69 s
[quickcheck-instances] Using Cabal-3.10.2.0 compiled by ghc-9.8
1588.69 s
[quickcheck-instances] Using compiler: ghc-9.8.1
1588.69 s
[quickcheck-instances] Using install prefix:
1588.69 s
[quickcheck-instances] /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32
1588.69 s
[quickcheck-instances] Executables installed in:
1588.69 s
[quickcheck-instances] /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32/bin
1588.69 s
[quickcheck-instances] Libraries installed in:
1588.69 s
[quickcheck-instances] /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
1588.69 s
[quickcheck-instances] Dynamic Libraries installed in:
1588.69 s
[quickcheck-instances] /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1588.69 s
[quickcheck-instances] Private executables installed in:
1588.69 s
[shake] [ 1 of 73] Compiling Development.Ninja.Env ( src/Development/Ninja/Env.hs, nothing )
1588.69 s
[shake] [ 2 of 73] Compiling Development.Ninja.Type ( src/Development/Ninja/Type.hs, nothing )
1588.69 s
[shake] [ 3 of 73] Compiling Development.Ninja.Lexer ( src/Development/Ninja/Lexer.hs, nothing )
1588.69 s
[shake] [ 4 of 73] Compiling Development.Shake.Classes ( src/Development/Shake/Classes.hs, nothing )
1588.69 s
[shake] [ 5 of 73] Compiling Development.Shake.FilePath ( src/Development/Shake/FilePath.hs, nothing )
1588.69 s
[shake] [ 6 of 73] Compiling Development.Shake.Internal.CmdOption ( src/Development/Shake/Internal/CmdOption.hs, nothing )
1588.69 s
[shake] [ 7 of 73] Compiling Development.Shake.Internal.History.Bloom ( src/Development/Shake/Internal/History/Bloom.hs, nothing )
1588.69 s
[shake] [ 8 of 73] Compiling Development.Shake.Internal.History.Network ( src/Development/Shake/Internal/History/Network.hs, nothing )
1588.69 s
[shake] [ 9 of 73] Compiling Development.Shake.Internal.History.Types ( src/Development/Shake/Internal/History/Types.hs, nothing )
1588.69 s
[shake] [10 of 73] Compiling General.Bilist ( src/General/Bilist.hs, nothing )
1588.69 s
[shake] [11 of 73] Compiling General.Binary ( src/General/Binary.hs, nothing )
1588.69 s
[shake] [12 of 73] Compiling Development.Shake.Internal.FileName ( src/Development/Shake/Internal/FileName.hs, nothing )
1588.69 s
[shake] [13 of 73] Compiling General.Cleanup ( src/General/Cleanup.hs, nothing )
1588.69 s
[shake] [14 of 73] Compiling General.EscCodes ( src/General/EscCodes.hs, nothing )
1588.69 s
[shake] [15 of 73] Compiling General.Extra ( src/General/Extra.hs, nothing )
1588.69 s
[algebraic-graphs] OK: adjacencyList empty == []
1588.69 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1588.69 s
[algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
1588.69 s
[algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
1588.69 s
[algebraic-graphs]
1588.69 s
[algebraic-graphs] ============ Relation.preSet ============
1588.69 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1588.69 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1588.69 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1588.69 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1588.69 s
[algebraic-graphs]
1588.69 s
[algebraic-graphs] ============ Relation.preIntSet ============
1588.69 s
[algebraic-graphs] OK: preIntSet x empty == IntSet.empty
1588.69 s
[algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
1588.69 s
[algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
1588.69 s
[algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
1588.69 s
[algebraic-graphs]
1588.69 s
[algebraic-graphs] ============ Relation.postSet ============
1588.69 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1588.69 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1588.69 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1588.69 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1588.69 s
[algebraic-graphs]
1588.69 s
[algebraic-graphs] ============ Relation.postIntSet ============
1588.69 s
[algebraic-graphs] OK: postIntSet x empty == IntSet.empty
1588.69 s
[algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
1588.69 s
[algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
1588.69 s
[algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
1588.69 s
[algebraic-graphs]
1588.69 s
[algebraic-graphs] ============ Relation.path ============
1588.69 s
[algebraic-graphs] OK: path [] == empty
1588.69 s
[algebraic-graphs] OK: path [x] == vertex x
1588.69 s
[algebraic-graphs] OK: path [x,y] == edge x y
1588.69 s
[algebraic-graphs]
1588.69 s
[algebraic-graphs] ============ Relation.circuit ============
1588.69 s
[algebraic-graphs] OK: circuit [] == empty
1588.69 s
[algebraic-graphs] OK: circuit [x] == edge x x
1588.69 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1588.69 s
[algebraic-graphs]
1588.69 s
[algebraic-graphs] ============ Relation.clique ============
1588.69 s
[algebraic-graphs] OK: clique [] == empty
1588.69 s
[algebraic-graphs] OK: clique [x] == vertex x
1588.69 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1588.69 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1588.69 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1588.69 s
[algebraic-graphs]
1588.69 s
[algebraic-graphs] ============ Relation.biclique ============
1588.69 s
[algebraic-graphs] OK: biclique [] [] == empty
1588.69 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1588.69 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1588.69 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1588.69 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1588.69 s
[algebraic-graphs]
1588.69 s
[algebraic-graphs] ============ Relation.star ============
1588.69 s
[algebraic-graphs] OK: star x [] == vertex x
1588.69 s
[algebraic-graphs] OK: star x [y] == edge x y
1588.69 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1588.69 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1588.69 s
[algebraic-graphs]
1588.69 s
[algebraic-graphs] ============ Relation.stars ============
1588.69 s
[algebraic-graphs] OK: stars [] == empty
1588.69 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1588.69 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1588.70 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1588.70 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1588.70 s
[algebraic-graphs] OK: stars . adjacencyList == id
1588.70 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1588.70 s
[algebraic-graphs]
1588.70 s
[algebraic-graphs] ============ Relation.tree ============
1588.70 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1588.70 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1588.70 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1588.70 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1588.70 s
[algebraic-graphs]
1588.70 s
[algebraic-graphs] ============ Relation.forest ============
1588.70 s
[algebraic-graphs] OK: forest [] == empty
1588.70 s
[algebraic-graphs] OK: forest [x] == tree x
1588.70 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1588.70 s
[algebraic-graphs] OK: forest == overlays . map tree
1588.70 s
[algebraic-graphs]
1588.70 s
[algebraic-graphs] ============ Relation.removeVertex ============
1588.70 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1588.70 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1588.70 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1588.70 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1588.70 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1588.70 s
[algebraic-graphs]
1588.70 s
[algebraic-graphs] ============ Relation.removeEdge ============
1588.70 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1588.70 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1588.70 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1588.70 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1588.70 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1588.70 s
[algebraic-graphs]
1588.70 s
[algebraic-graphs] ============ Relation.replaceVertex ============
1588.70 s
[algebraic-graphs] OK: replaceVertex x x == id
1588.70 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1588.70 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1588.70 s
[algebraic-graphs]
1588.70 s
[algebraic-graphs] ============ Relation.mergeVertices ============
1588.70 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1588.70 s
[quickcheck-instances] /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32/libexec/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32
1588.70 s
[quickcheck-instances] Data files installed in:
1588.70 s
[quickcheck-instances] /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32/share/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32
1588.70 s
[quickcheck-instances] Documentation installed in:
1588.70 s
[quickcheck-instances] /nix/store/f8nlxfwdl2jjbrn5va2sqgx05ays6zc1-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32
1588.70 s
[quickcheck-instances] Configuration files installed in:
1588.70 s
[quickcheck-instances] /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32/etc
1588.70 s
[quickcheck-instances] No alex found
1588.70 s
[quickcheck-instances] Using ar found on system at:
1588.70 s
[quickcheck-instances] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1588.70 s
[quickcheck-instances] No c2hs found
1588.70 s
[quickcheck-instances] No cpphs found
1588.70 s
[quickcheck-instances] No doctest found
1588.70 s
[quickcheck-instances] Using gcc version 14.3.0 given by user at:
1588.70 s
[quickcheck-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1588.70 s
[quickcheck-instances] Using ghc version 9.8.1 found on system at:
1588.70 s
[quickcheck-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1588.70 s
[quickcheck-instances] Using ghc-pkg version 9.8.1 found on system at:
1588.70 s
[quickcheck-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1588.70 s
[quickcheck-instances] No ghcjs found
1588.70 s
[quickcheck-instances] No ghcjs-pkg found
1588.70 s
[quickcheck-instances] No greencard found
1588.70 s
[quickcheck-instances] Using haddock version 2.30.0 found on system at:
1588.70 s
[quickcheck-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1588.70 s
[quickcheck-instances] No happy found
1588.70 s
[quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
1588.70 s
[quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1588.70 s
[quickcheck-instances] No hmake found
1588.70 s
[quickcheck-instances] Using hpc version 0.69 found on system at:
1588.70 s
[quickcheck-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1588.70 s
[quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
1588.70 s
[quickcheck-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1588.70 s
[quickcheck-instances] Using hscolour version 1.25 found on system at:
1588.70 s
[quickcheck-instances] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1588.70 s
[quickcheck-instances] No jhc found
1588.70 s
[quickcheck-instances] Using ld found on system at:
1588.70 s
[quickcheck-instances] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1588.70 s
[quickcheck-instances] No pkg-config found
1588.70 s
[quickcheck-instances] Using runghc version 9.8.1 found on system at:
1588.70 s
[quickcheck-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1588.70 s
[quickcheck-instances] Using strip version 2.44 found on system at:
1588.70 s
[quickcheck-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1588.70 s
[quickcheck-instances] Using tar found on system at:
1588.70 s
[quickcheck-instances] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1588.70 s
[quickcheck-instances] No uhc found
1588.70 s
[quickcheck-instances] Phase: buildPhase
1588.70 s
[quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.32..
1588.70 s
[quickcheck-instances] Building library for quickcheck-instances-0.3.32..
1588.70 s
[quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.o, dist/build/Test/QuickCheck/Instances/Containers.dyn_o )
1588.70 s
[quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.o, dist/build/Test/QuickCheck/Instances/CustomPrelude.dyn_o )
1588.70 s
[quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.o, dist/build/Test/QuickCheck/Instances/CaseInsensitive.dyn_o )
1588.70 s
[quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.o, dist/build/Test/QuickCheck/Instances/ByteString.dyn_o )
1588.70 s
[quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.o, dist/build/Test/QuickCheck/Instances/Array.dyn_o )
1588.75 s
[quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.o, dist/build/Test/QuickCheck/Instances/DataFix.dyn_o )
1588.75 s
[quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.o, dist/build/Test/QuickCheck/Instances/Hashable.dyn_o )
1588.76 s
[quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.o, dist/build/Test/QuickCheck/Instances/Natural.dyn_o )
1588.76 s
[quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.o, dist/build/Test/QuickCheck/Instances/OldTime.dyn_o )
1588.76 s
[quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.o, dist/build/Test/QuickCheck/Instances/Primitive.dyn_o )
1588.76 s
[quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, dist/build/Test/QuickCheck/Instances/Array/Byte.o, dist/build/Test/QuickCheck/Instances/Array/Byte.dyn_o )
1588.76 s
[quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.o, dist/build/Test/QuickCheck/Instances/Scientific.dyn_o )
1588.76 s
[quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.o, dist/build/Test/QuickCheck/Instances/Semigroup.dyn_o )
1588.76 s
[quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.o, dist/build/Test/QuickCheck/Instances/Solo.dyn_o )
1588.76 s
[quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.o, dist/build/Test/QuickCheck/Instances/Strict.dyn_o )
1588.93 s
[shake] [16 of 73] Compiling Development.Shake.Internal.History.Symlink ( src/Development/Shake/Internal/History/Symlink.hs, nothing )
1588.97 s
[vector-instances] Phase: setupCompilerEnvironmentPhase
1588.98 s
[vector-instances] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1589.12 s
[quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.o, dist/build/Test/QuickCheck/Instances/Tagged.dyn_o )
1589.12 s
[quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.o, dist/build/Test/QuickCheck/Instances/Text.dyn_o )
1589.12 s
[quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, dist/build/Test/QuickCheck/Instances/Text/Short.o, dist/build/Test/QuickCheck/Instances/Text/Short.dyn_o )
1589.12 s
[quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.o, dist/build/Test/QuickCheck/Instances/These.dyn_o )
1589.18 s
[shake] [17 of 73] Compiling Development.Shake.Internal.Errors ( src/Development/Shake/Internal/Errors.hs, nothing )
1589.18 s
[quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.o, dist/build/Test/QuickCheck/Instances/Time.dyn_o )
1589.25 s
[shake] [18 of 73] Compiling Development.Shake.Internal.Value ( src/Development/Shake/Internal/Value.hs, nothing )
1589.32 s
[shake] [19 of 73] Compiling Development.Shake.Internal.FilePattern ( src/Development/Shake/Internal/FilePattern.hs, nothing )
1589.40 s
[vector-instances] Phase: unpackPhase
1589.41 s
[vector-instances] unpacking source archive /nix/store/nqfgw14d48gylm57fvgdbpjxc79yrsqj-vector-instances-3.4.2.tar.gz
1589.42 s
[vector-instances] source root is vector-instances-3.4.2
1589.43 s
[vector-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-instances-3.4.2/.vim.custom"
1589.44 s
[vector-instances] Phase: patchPhase
1589.46 s
[vector-instances] Phase: compileBuildDriverPhase
1589.47 s
[vector-instances] setupCompileFlags: -package-db=/build/tmp.LxbhTTApWm/setup-package.conf.d -threaded
1589.57 s
[vector-instances] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.LxbhTTApWm/Main.o )
1589.58 s
[shake] [20 of 73] Compiling Development.Shake.Internal.Options ( src/Development/Shake/Internal/Options.hs, nothing )
1589.78 s
[vector-instances] [2 of 2] Linking Setup
1589.87 s
[quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.o, dist/build/Test/QuickCheck/Instances/Transformer.dyn_o )
1589.87 s
[quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.o, dist/build/Test/QuickCheck/Instances/UUID.dyn_o )
1589.87 s
[quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.o, dist/build/Test/QuickCheck/Instances/UnorderedContainers.dyn_o )
1589.87 s
[quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.o, dist/build/Test/QuickCheck/Instances/Vector.dyn_o )
1589.87 s
[quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.o, dist/build/Test/QuickCheck/Instances/Void.dyn_o )
1589.87 s
[quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.o, dist/build/Test/QuickCheck/Instances.dyn_o )
1590.06 s
[shake] [21 of 73] Compiling Development.Shake.Internal.FileInfo ( src/Development/Shake/Internal/FileInfo.hs, nothing )
1590.07 s
[lens] [24 of 85] Compiling Control.Lens.Getter ( src/Control/Lens/Getter.hs, dist/build/Control/Lens/Getter.o, dist/build/Control/Lens/Getter.dyn_o )
1590.07 s
[lens] [25 of 85] Compiling Control.Lens.Review ( src/Control/Lens/Review.hs, dist/build/Control/Lens/Review.o, dist/build/Control/Lens/Review.dyn_o )
1590.07 s
[lens] [26 of 85] Compiling Control.Lens.Prism ( src/Control/Lens/Prism.hs, dist/build/Control/Lens/Prism.o, dist/build/Control/Lens/Prism.dyn_o )
1590.07 s
[lens] [27 of 85] Compiling Control.Lens.Fold ( src/Control/Lens/Fold.hs, dist/build/Control/Lens/Fold.o, dist/build/Control/Lens/Fold.dyn_o )
1590.07 s
[lens] [28 of 85] Compiling Control.Lens.Traversal ( src/Control/Lens/Traversal.hs, dist/build/Control/Lens/Traversal.o, dist/build/Control/Lens/Traversal.dyn_o )
1590.07 s
[lens] [29 of 85] Compiling Control.Lens.Level ( src/Control/Lens/Level.hs, dist/build/Control/Lens/Level.o, dist/build/Control/Lens/Level.dyn_o )
1590.07 s
[lens] [30 of 85] Compiling Control.Lens.Reified ( src/Control/Lens/Reified.hs, dist/build/Control/Lens/Reified.o, dist/build/Control/Lens/Reified.dyn_o )
1590.15 s
[shake] [22 of 73] Compiling Development.Shake.Internal.Core.Monad ( src/Development/Shake/Internal/Core/Monad.hs, nothing )
1590.35 s
[shake] [23 of 73] Compiling Development.Ninja.Parse ( src/Development/Ninja/Parse.hs, nothing )
1590.50 s
[quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.p_o )
1590.66 s
[shake] [24 of 73] Compiling General.Fence ( src/General/Fence.hs, nothing )
1590.73 s
[shake] [25 of 73] Compiling General.FileLock ( src/General/FileLock.hs, nothing )
1590.75 s
[shake] [26 of 73] Compiling General.GetOpt ( src/General/GetOpt.hs, nothing )
1590.77 s
[quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.p_o )
1590.82 s
[shake] [27 of 73] Compiling General.Intern ( src/General/Intern.hs, nothing )
1590.87 s
[shake] [28 of 73] Compiling General.Ids ( src/General/Ids.hs, nothing )
1590.98 s
[shake] [29 of 73] Compiling Development.Shake.Internal.History.Serialise ( src/Development/Shake/Internal/History/Serialise.hs, nothing )
1591.00 s
[aeson] Documentation created: dist/doc/html/aeson/, dist/doc/html/aeson/aeson.txt
1591.03 s
[lens] [31 of 85] Compiling Control.Lens.Internal.Exception ( src/Control/Lens/Internal/Exception.hs, dist/build/Control/Lens/Internal/Exception.o, dist/build/Control/Lens/Internal/Exception.dyn_o )
1591.10 s
[lens] [32 of 85] Compiling Control.Lens.Indexed ( src/Control/Lens/Indexed.hs, dist/build/Control/Lens/Indexed.o, dist/build/Control/Lens/Indexed.dyn_o )
1591.10 s
[lens] [33 of 85] Compiling Control.Lens.Internal.ByteString ( src/Control/Lens/Internal/ByteString.hs, dist/build/Control/Lens/Internal/ByteString.o, dist/build/Control/Lens/Internal/ByteString.dyn_o )
1591.10 s
[lens] [34 of 85] Compiling Control.Lens.Equality ( src/Control/Lens/Equality.hs, dist/build/Control/Lens/Equality.o, dist/build/Control/Lens/Equality.dyn_o )
1591.10 s
[lens] [35 of 85] Compiling Control.Lens.Iso ( src/Control/Lens/Iso.hs, dist/build/Control/Lens/Iso.o, dist/build/Control/Lens/Iso.dyn_o )
1591.10 s
[lens] [36 of 85] Compiling Control.Lens.Empty ( src/Control/Lens/Empty.hs, dist/build/Control/Lens/Empty.o, dist/build/Control/Lens/Empty.dyn_o )
1591.10 s
[lens] [37 of 85] Compiling Control.Lens.Cons ( src/Control/Lens/Cons.hs, dist/build/Control/Lens/Cons.o, dist/build/Control/Lens/Cons.dyn_o )
1591.10 s
[shake] [30 of 73] Compiling Development.Shake.Internal.History.Server ( src/Development/Shake/Internal/History/Server.hs, nothing )
1591.10 s
[shake] [31 of 73] Compiling Development.Shake.Internal.Core.Database ( src/Development/Shake/Internal/Core/Database.hs, nothing )
1591.12 s
[aeson] Preprocessing test suite 'aeson-tests' for aeson-2.2.3.0..
1591.15 s
[aeson] haddockPhase completed in 42 seconds
1591.15 s
[aeson] Phase: installPhase
1591.15 s
[shake] [32 of 73] Compiling General.ListBuilder ( src/General/ListBuilder.hs, nothing )
1591.19 s
[shake] [33 of 73] Compiling General.Makefile ( src/General/Makefile.hs, nothing )
1591.21 s
[shake] [34 of 73] Compiling General.Process ( src/General/Process.hs, nothing )
1591.44 s
[aeson] Installing library in /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1591.47 s
[shake] [35 of 73] Compiling General.Thread ( src/General/Thread.hs, nothing )
1591.52 s
[shake] [36 of 73] Compiling General.Chunks ( src/General/Chunks.hs, nothing )
1591.56 s
[quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.p_o )
1591.62 s
[shake] [37 of 73] Compiling General.Timing ( src/General/Timing.hs, nothing )
1591.66 s
[shake] [38 of 73] Compiling General.Pool ( src/General/Pool.hs, nothing )
1591.77 s
[shake] [39 of 73] Compiling Development.Shake.Internal.Core.Storage ( src/Development/Shake/Internal/Core/Storage.hs, nothing )
1592.24 s
[shake] [40 of 73] Compiling General.TypeMap ( src/General/TypeMap.hs, nothing )
1592.25 s
[quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.p_o )
1592.25 s
[quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.p_o )
1592.26 s
[quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.p_o )
1592.28 s
[shake] [41 of 73] Compiling General.Wait ( src/General/Wait.hs, nothing )
1592.38 s
[vector-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
1592.41 s
[vector-instances] Phase: configurePhase
1592.42 s
[vector-instances] configureFlags: --verbose --prefix=/nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/g4whsxwjc10y7bcivqfhcziz34dr9j2i-vector-instances-3.4.2-doc/share/doc/vector-instances-3.4.2 --with-gcc=gcc --package-db=/build/tmp.LxbhTTApWm/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1592.43 s
[vector-instances] Using Parsec parser
1592.43 s
[vector-instances] Configuring vector-instances-3.4.2...
1592.44 s
[shake] [42 of 73] Compiling Development.Shake.Internal.History.Shared ( src/Development/Shake/Internal/History/Shared.hs, nothing )
1592.63 s
[quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.p_o )
1592.64 s
[quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.p_o )
1592.64 s
[quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.p_o )
1592.64 s
[quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.p_o )
1592.64 s
[quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, dist/build/Test/QuickCheck/Instances/Array/Byte.p_o )
1592.64 s
[quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.p_o )
1592.64 s
[quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.p_o )
1592.64 s
[quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.p_o )
1592.64 s
[quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.p_o )
1592.66 s
[shake] [43 of 73] Compiling Development.Shake.Internal.History.Cloud ( src/Development/Shake/Internal/History/Cloud.hs, nothing )
1592.73 s
[quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.p_o )
1592.74 s
[quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.p_o )
1592.74 s
[quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, dist/build/Test/QuickCheck/Instances/Text/Short.p_o )
1592.74 s
[quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.p_o )
1592.74 s
[shake] [44 of 73] Compiling Development.Shake.Internal.Core.Types ( src/Development/Shake/Internal/Core/Types.hs, nothing )
1592.88 s
[quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.p_o )
1593.10 s
[vector-instances] Flags chosen: hashable=True
1593.10 s
[vector-instances] Dependency base >=4.9 && <5: using base-4.19.0.0
1593.10 s
[vector-instances] Dependency comonad >=3: using comonad-5.0.9
1593.10 s
[vector-instances] Dependency hashable >=1.2.5.0: using hashable-1.4.7.0
1593.10 s
[vector-instances] Dependency keys >=3: using keys-3.12.4
1593.10 s
[vector-instances] Dependency pointed >=3: using pointed-5.0.5
1593.10 s
[vector-instances] Dependency semigroupoids >=3: using semigroupoids-6.0.1
1593.10 s
[vector-instances] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
1593.11 s
[shake] [45 of 73] Compiling Development.Shake.Internal.Core.Rules ( src/Development/Shake/Internal/Core/Rules.hs, nothing )
1593.18 s
[lens] [38 of 85] Compiling Control.Lens.Internal.Deque ( src/Control/Lens/Internal/Deque.hs, dist/build/Control/Lens/Internal/Deque.o, dist/build/Control/Lens/Internal/Deque.dyn_o )
1593.25 s
[quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.p_o )
1593.25 s
[quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.p_o )
1593.25 s
[quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.p_o )
1593.25 s
[quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.p_o )
1593.25 s
[quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.p_o )
1593.25 s
[quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
1593.36 s
[shake] [46 of 73] Compiling Development.Shake.Internal.Core.Pool ( src/Development/Shake/Internal/Core/Pool.hs, nothing )
1593.40 s
[shake] [47 of 73] Compiling Development.Shake.Internal.Core.Action ( src/Development/Shake/Internal/Core/Action.hs, nothing )
1593.43 s
[vector-instances] Source component graph: component lib
1593.43 s
[vector-instances] Configured component graph:
1593.43 s
[vector-instances] component vector-instances-3.4.2-IrMPeDkXsTAHmZR7rP06of
1593.43 s
[vector-instances] include base-4.19.0.0-b960
1593.43 s
[vector-instances] include comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1593.43 s
[vector-instances] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1593.43 s
[vector-instances] include keys-3.12.4-9pIWSPQD3dgEmDN6rrDseM
1593.43 s
[vector-instances] include pointed-5.0.5-ArcipP7cLHIAUvoaOddqJf
1593.43 s
[vector-instances] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1593.43 s
[vector-instances] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1593.43 s
[vector-instances] Linked component graph:
1593.43 s
[vector-instances] unit vector-instances-3.4.2-IrMPeDkXsTAHmZR7rP06of
1593.43 s
[vector-instances] include base-4.19.0.0-b960
1593.43 s
[vector-instances] include comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1593.43 s
[vector-instances] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1593.43 s
[vector-instances] include keys-3.12.4-9pIWSPQD3dgEmDN6rrDseM
1593.43 s
[vector-instances] include pointed-5.0.5-ArcipP7cLHIAUvoaOddqJf
1593.43 s
[vector-instances] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1593.43 s
[vector-instances] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1593.43 s
[vector-instances] Data.Vector.Instances=vector-instances-3.4.2-IrMPeDkXsTAHmZR7rP06of:Data.Vector.Instances
1593.43 s
[vector-instances] Ready component graph:
1593.43 s
[vector-instances] definite vector-instances-3.4.2-IrMPeDkXsTAHmZR7rP06of
1593.43 s
[vector-instances] depends base-4.19.0.0-b960
1593.43 s
[vector-instances] depends comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1593.43 s
[vector-instances] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1593.43 s
[vector-instances] depends keys-3.12.4-9pIWSPQD3dgEmDN6rrDseM
1593.43 s
[vector-instances] depends pointed-5.0.5-ArcipP7cLHIAUvoaOddqJf
1593.43 s
[vector-instances] depends semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1593.43 s
[vector-instances] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
1593.43 s
[vector-instances] Using Cabal-3.10.2.0 compiled by ghc-9.8
1593.43 s
[vector-instances] Using compiler: ghc-9.8.1
1593.43 s
[vector-instances] Using install prefix:
1593.43 s
[vector-instances] /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2
1593.43 s
[vector-instances] Executables installed in:
1593.43 s
[vector-instances] /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2/bin
1593.43 s
[vector-instances] Libraries installed in:
1593.43 s
[vector-instances] /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/vector-instances-3.4.2-IrMPeDkXsTAHmZR7rP06of
1593.43 s
[vector-instances] Dynamic Libraries installed in:
1593.43 s
[vector-instances] /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1593.43 s
[vector-instances] Private executables installed in:
1593.43 s
[vector-instances] /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2/libexec/x86_64-linux-ghc-9.8.1/vector-instances-3.4.2
1593.43 s
[vector-instances] Data files installed in:
1593.43 s
[vector-instances] /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2/share/x86_64-linux-ghc-9.8.1/vector-instances-3.4.2
1593.43 s
[vector-instances] Documentation installed in:
1593.43 s
[vector-instances] /nix/store/g4whsxwjc10y7bcivqfhcziz34dr9j2i-vector-instances-3.4.2-doc/share/doc/vector-instances-3.4.2
1593.43 s
[vector-instances] Configuration files installed in:
1593.43 s
[vector-instances] /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2/etc
1593.43 s
[vector-instances] No alex found
1593.43 s
[vector-instances] Using ar found on system at:
1593.43 s
[vector-instances] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1593.43 s
[vector-instances] No c2hs found
1593.43 s
[vector-instances] No cpphs found
1593.43 s
[vector-instances] No doctest found
1593.43 s
[vector-instances] Using gcc version 14.3.0 given by user at:
1593.43 s
[vector-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1593.43 s
[vector-instances] Using ghc version 9.8.1 found on system at:
1593.43 s
[vector-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1593.43 s
[vector-instances] Using ghc-pkg version 9.8.1 found on system at:
1593.43 s
[vector-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1593.43 s
[vector-instances] No ghcjs found
1593.43 s
[vector-instances] No ghcjs-pkg found
1593.43 s
[vector-instances] No greencard found
1593.43 s
[vector-instances] Using haddock version 2.30.0 found on system at:
1593.43 s
[vector-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1593.43 s
[vector-instances] No happy found
1593.43 s
[vector-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
1593.43 s
[vector-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1593.43 s
[vector-instances] No hmake found
1593.43 s
[vector-instances] Using hpc version 0.69 found on system at:
1593.43 s
[vector-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1593.43 s
[vector-instances] Using hsc2hs version 0.68.10 found on system at:
1593.43 s
[vector-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1593.43 s
[vector-instances] Using hscolour version 1.25 found on system at:
1593.43 s
[vector-instances] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1593.43 s
[vector-instances] No jhc found
1593.43 s
[vector-instances] Using ld found on system at:
1593.43 s
[vector-instances] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1593.43 s
[vector-instances] No pkg-config found
1593.43 s
[vector-instances] Using runghc version 9.8.1 found on system at:
1593.43 s
[vector-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1593.43 s
[vector-instances] Using strip version 2.44 found on system at:
1593.43 s
[vector-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1593.43 s
[vector-instances] Using tar found on system at:
1593.43 s
[vector-instances] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1593.43 s
[vector-instances] No uhc found
1593.60 s
[aeson] Phase: fixupPhase
1593.60 s
[vector-instances] Phase: buildPhase
1593.62 s
[aeson] shrinking RPATHs of ELF executables and libraries in /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0
1593.63 s
[aeson] shrinking /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSaeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15-ghc9.8.1.so
1593.69 s
[vector-instances] Preprocessing library for vector-instances-3.4.2..
1593.69 s
[vector-instances] Building library for vector-instances-3.4.2..
1593.70 s
[aeson] checking for references to /build/ in /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0...
1593.74 s
[aeson] patching script interpreter paths in /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0
1593.76 s
[aeson] stripping (with command strip and flags -S -p) in /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0/lib
1593.85 s
[vector-instances] [1 of 1] Compiling Data.Vector.Instances ( src/Data/Vector/Instances.hs, dist/build/Data/Vector/Instances.o, dist/build/Data/Vector/Instances.dyn_o )
1593.85 s
[shake] [48 of 73] Compiling Development.Shake.Internal.Resource ( src/Development/Shake/Internal/Resource.hs, nothing )
1594.01 s
[shake] [49 of 73] Compiling Development.Shake.Internal.Core.Build ( src/Development/Shake/Internal/Core/Build.hs, nothing )
1594.40 s
[shake] [50 of 73] Compiling Development.Shake.Rule ( src/Development/Shake/Rule.hs, nothing )
1594.42 s
[shake] [51 of 73] Compiling Development.Shake.Internal.Rules.Rerun ( src/Development/Shake/Internal/Rules/Rerun.hs, nothing )
1594.45 s
[shake] [52 of 73] Compiling Development.Shake.Internal.Rules.Oracle ( src/Development/Shake/Internal/Rules/Oracle.hs, nothing )
1594.60 s
[shake] [53 of 73] Compiling Development.Shake.Internal.Rules.File ( src/Development/Shake/Internal/Rules/File.hs, nothing )
1595.40 s
[shake] [54 of 73] Compiling Development.Shake.Internal.Rules.OrderOnly ( src/Development/Shake/Internal/Rules/OrderOnly.hs, nothing )
1595.41 s
[aeson] shrinking RPATHs of ELF executables and libraries in /nix/store/ljr3rnwd8s1fggbaiwd22941awg4hks7-aeson-2.2.3.0-doc
1595.42 s
[shake] [55 of 73] Compiling Development.Shake.Internal.Rules.Files ( src/Development/Shake/Internal/Rules/Files.hs, nothing )
1595.44 s
[aeson] checking for references to /build/ in /nix/store/ljr3rnwd8s1fggbaiwd22941awg4hks7-aeson-2.2.3.0-doc...
1595.48 s
[aeson] patching script interpreter paths in /nix/store/ljr3rnwd8s1fggbaiwd22941awg4hks7-aeson-2.2.3.0-doc
1596.13 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0 /nix/store/ljr3rnwd8s1fggbaiwd22941awg4hks7-aeson-2.2.3.0-doc
1597.15 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1597.27 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0 /nix/store/ljr3rnwd8s1fggbaiwd22941awg4hks7-aeson-2.2.3.0-doc
1597.47 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1597.63 s
[post-build-hook] copying 9 paths...
1597.63 s
[post-build-hook] copying path '/nix/store/kfd6lp109n56wgks0f7ydm06sssfw824-th-compat-0.1.6-doc' to 'https://cache.nix-ci.com'...
1597.63 s
[post-build-hook] copying path '/nix/store/aarv4jl074q5in6l8vd4i5az0gn3xsyx-generically-0.1.1-doc' to 'https://cache.nix-ci.com'...
1597.63 s
[post-build-hook] copying path '/nix/store/blqgy45h759lyaw2byas6kgj75ijlbar-character-ps-0.1-doc' to 'https://cache.nix-ci.com'...
1597.87 s
[post-build-hook] copying path '/nix/store/klrvqqi9i93in6336gnsygf2160rs07f-generically-0.1.1' to 'https://cache.nix-ci.com'...
1598.00 s
[post-build-hook] copying path '/nix/store/4yx9489rjmy6gg4sqxpmbfkarnklfccg-th-compat-0.1.6' to 'https://cache.nix-ci.com'...
1598.00 s
[post-build-hook] copying path '/nix/store/c9776xc51dwdz6nm01aia6q5xpbkygq2-network-uri-2.6.4.2-doc' to 'https://cache.nix-ci.com'...
1598.11 s
[post-build-hook] copying path '/nix/store/lwybghcg0lc29pbnsm29klaby26xaq9j-character-ps-0.1' to 'https://cache.nix-ci.com'...
1598.52 s
[post-build-hook] copying path '/nix/store/93sb7vmy446nd6l6i67sp4x6bp6j7ljq-network-uri-2.6.4.2' to 'https://cache.nix-ci.com'...
1601.83 s
[post-build-hook] copying path '/nix/store/ib4j7ml5vs3xlp1rgws8nbs3a607xm57-aeson-2.2.3.0' to 'https://cache.nix-ci.com'...
1626.16 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1626.38 s
[post-build-hook] copying 0 paths...
1626.61 s
Progress: 96 of 171 built (6 building), 395 of 395 downloaded from cache
1627.07 s
Building HTF
1627.18 s
Building HsYAML-aeson
1627.29 s
Building attoparsec-aeson
1627.44 s
Building binary-instances
1627.55 s
Building constraints-extras
1627.67 s
Building deriving-aeson
1627.79 s
Building doctest-discover
1627.91 s
Building enummapset
1628.10 s
Building microaeson
1628.27 s
Building path
1628.27 s
[HTF] Phase: setupCompilerEnvironmentPhase
1628.27 s
[HTF] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1628.27 s
[HTF] Phase: unpackPhase
1628.27 s
[HTF] unpacking source archive /nix/store/qhlbkn34py2ici8vb4ykayfpi5yy6adh-HTF-0.15.0.2.tar.gz
1628.27 s
[HTF] source root is HTF-0.15.0.2
1628.27 s
[HTF] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "HTF-0.15.0.2/tests/Tutorial.hs"
1628.27 s
[HTF] Phase: patchPhase
1628.27 s
[HTF] Phase: compileBuildDriverPhase
1628.27 s
[HTF] setupCompileFlags: -package-db=/build/tmp.KAdLTPGk1j/setup-package.conf.d -threaded
1628.27 s
[HsYAML-aeson] Phase: setupCompilerEnvironmentPhase
1628.27 s
[HsYAML-aeson] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1628.27 s
[HsYAML-aeson] Phase: unpackPhase
1628.27 s
[HsYAML-aeson] unpacking source archive /nix/store/fi7z7r8fgfnrkn7ydjs7znlgnbyb60z6-HsYAML-aeson-0.2.0.2.tar.gz
1628.27 s
[HsYAML-aeson] source root is HsYAML-aeson-0.2.0.2
1628.27 s
[HsYAML-aeson] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "HsYAML-aeson-0.2.0.2/src-test/Main.hs"
1628.27 s
[HsYAML-aeson] Phase: patchPhase
1628.27 s
[attoparsec-aeson] Phase: setupCompilerEnvironmentPhase
1628.27 s
[attoparsec-aeson] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1628.27 s
[binary-instances] Phase: setupCompilerEnvironmentPhase
1628.27 s
[binary-instances] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1628.27 s
[constraints-extras] Phase: setupCompilerEnvironmentPhase
1628.27 s
[constraints-extras] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1628.27 s
[deriving-aeson] Phase: setupCompilerEnvironmentPhase
1628.27 s
[deriving-aeson] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1628.27 s
[doctest-discover] Phase: setupCompilerEnvironmentPhase
1628.27 s
[doctest-discover] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1628.27 s
[enummapset] Phase: setupCompilerEnvironmentPhase
1628.27 s
[enummapset] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1628.27 s
[lens] [39 of 85] Compiling Control.Lens.Wrapped ( src/Control/Lens/Wrapped.hs, dist/build/Control/Lens/Wrapped.o, dist/build/Control/Lens/Wrapped.dyn_o )
1628.27 s
[lens] [40 of 85] Compiling Control.Lens.Internal.TH ( src/Control/Lens/Internal/TH.hs, dist/build/Control/Lens/Internal/TH.o, dist/build/Control/Lens/Internal/TH.dyn_o )
1628.27 s
[lens] [41 of 85] Compiling Control.Lens.Zoom ( src/Control/Lens/Zoom.hs, dist/build/Control/Lens/Zoom.o, dist/build/Control/Lens/Zoom.dyn_o )
1628.27 s
[lens] [42 of 85] Compiling Data.Data.Lens ( src/Data/Data/Lens.hs, dist/build/Data/Data/Lens.o, dist/build/Data/Data/Lens.dyn_o )
1628.27 s
[lens] [43 of 85] Compiling Control.Lens.Plated ( src/Control/Lens/Plated.hs, dist/build/Control/Lens/Plated.o, dist/build/Control/Lens/Plated.dyn_o )
1628.28 s
[lens] [44 of 85] Compiling Data.HashSet.Lens ( src/Data/HashSet/Lens.hs, dist/build/Data/HashSet/Lens.o, dist/build/Data/HashSet/Lens.dyn_o )
1628.28 s
[lens] [45 of 85] Compiling Data.List.Lens ( src/Data/List/Lens.hs, dist/build/Data/List/Lens.o, dist/build/Data/List/Lens.dyn_o )
1628.28 s
[lens] [46 of 85] Compiling Data.Map.Lens ( src/Data/Map/Lens.hs, dist/build/Data/Map/Lens.o, dist/build/Data/Map/Lens.dyn_o )
1628.28 s
[lens] [47 of 85] Compiling Data.Set.Lens ( src/Data/Set/Lens.hs, dist/build/Data/Set/Lens.o, dist/build/Data/Set/Lens.dyn_o )
1628.28 s
[lens] [48 of 85] Compiling Data.Text.Lazy.Lens ( src/Data/Text/Lazy/Lens.hs, dist/build/Data/Text/Lazy/Lens.o, dist/build/Data/Text/Lazy/Lens.dyn_o )
1628.28 s
[lens] [49 of 85] Compiling Data.Text.Strict.Lens ( src/Data/Text/Strict/Lens.hs, dist/build/Data/Text/Strict/Lens.o, dist/build/Data/Text/Strict/Lens.dyn_o )
1628.28 s
[lens] [50 of 85] Compiling Data.Text.Lens ( src/Data/Text/Lens.hs, dist/build/Data/Text/Lens.o, dist/build/Data/Text/Lens.dyn_o )
1628.28 s
[lens] [51 of 85] Compiling Data.Vector.Generic.Lens ( src/Data/Vector/Generic/Lens.hs, dist/build/Data/Vector/Generic/Lens.o, dist/build/Data/Vector/Generic/Lens.dyn_o )
1628.28 s
[lens] [52 of 85] Compiling Control.Lens.Each ( src/Control/Lens/Each.hs, dist/build/Control/Lens/Each.o, dist/build/Control/Lens/Each.dyn_o )
1628.28 s
[lens] [53 of 85] Compiling Control.Lens.At ( src/Control/Lens/At.hs, dist/build/Control/Lens/At.o, dist/build/Control/Lens/At.dyn_o )
1628.28 s
[lens] [54 of 85] Compiling Language.Haskell.TH.Lens ( src/Language/Haskell/TH/Lens.hs, dist/build/Language/Haskell/TH/Lens.o, dist/build/Language/Haskell/TH/Lens.dyn_o )
1628.28 s
[lens] [55 of 85] Compiling Control.Lens.Internal.PrismTH ( src/Control/Lens/Internal/PrismTH.hs, dist/build/Control/Lens/Internal/PrismTH.o, dist/build/Control/Lens/Internal/PrismTH.dyn_o )
1628.28 s
[lens] [56 of 85] Compiling Control.Lens.Internal.FieldTH ( src/Control/Lens/Internal/FieldTH.hs, dist/build/Control/Lens/Internal/FieldTH.o, dist/build/Control/Lens/Internal/FieldTH.dyn_o )
1628.28 s
[lens] [57 of 85] Compiling Control.Lens.TH ( src/Control/Lens/TH.hs, dist/build/Control/Lens/TH.o, dist/build/Control/Lens/TH.dyn_o )
1628.28 s
[lens] [58 of 85] Compiling Control.Lens ( src/Control/Lens.hs, dist/build/Control/Lens.o, dist/build/Control/Lens.dyn_o )
1628.28 s
[lens] [59 of 85] Compiling GHC.Generics.Lens ( src/GHC/Generics/Lens.hs, dist/build/GHC/Generics/Lens.o, dist/build/GHC/Generics/Lens.dyn_o )
1628.28 s
[lens] [60 of 85] Compiling Data.Vector.Lens ( src/Data/Vector/Lens.hs, dist/build/Data/Vector/Lens.o, dist/build/Data/Vector/Lens.dyn_o )
1628.28 s
[lens] [61 of 85] Compiling Data.Typeable.Lens ( src/Data/Typeable/Lens.hs, dist/build/Data/Typeable/Lens.o, dist/build/Data/Typeable/Lens.dyn_o )
1628.28 s
[lens] [62 of 85] Compiling Data.Tree.Lens ( src/Data/Tree/Lens.hs, dist/build/Data/Tree/Lens.o, dist/build/Data/Tree/Lens.dyn_o )
1628.28 s
[lens] [63 of 85] Compiling Data.Sequence.Lens ( src/Data/Sequence/Lens.hs, dist/build/Data/Sequence/Lens.o, dist/build/Data/Sequence/Lens.dyn_o )
1628.28 s
[lens] [64 of 85] Compiling Data.IntSet.Lens ( src/Data/IntSet/Lens.hs, dist/build/Data/IntSet/Lens.o, dist/build/Data/IntSet/Lens.dyn_o )
1628.28 s
[lens] [65 of 85] Compiling Data.Complex.Lens ( src/Data/Complex/Lens.hs, dist/build/Data/Complex/Lens.o, dist/build/Data/Complex/Lens.dyn_o )
1628.28 s
[lens] [66 of 85] Compiling Data.ByteString.Strict.Lens ( src/Data/ByteString/Strict/Lens.hs, dist/build/Data/ByteString/Strict/Lens.o, dist/build/Data/ByteString/Strict/Lens.dyn_o )
1628.28 s
[quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32..
1628.28 s
[quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.32..
1628.28 s
[quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
1628.28 s
[quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
1628.28 s
[quickcheck-instances] Phase: checkPhase
1628.28 s
[quickcheck-instances] Running 1 test suites...
1628.28 s
[quickcheck-instances] Test suite self-test: RUNNING...
1628.28 s
[quickcheck-instances] +++ OK, passed 100 tests.
1628.28 s
[quickcheck-instances] +++ OK, passed 100 tests.
1628.28 s
[quickcheck-instances] +++ OK, passed 100 tests.
1628.28 s
[quickcheck-instances] +++ OK, passed 100 tests.
1628.28 s
[quickcheck-instances] +++ OK, passed 100 tests.
1628.28 s
[quickcheck-instances] Test suite self-test: PASS
1628.28 s
[quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.32-self-test.log
1628.28 s
[quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
1628.28 s
[quickcheck-instances] Phase: haddockPhase
1628.28 s
[quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.32..
1628.28 s
[quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.32..
1628.28 s
[quickcheck-instances] Warning: The documentation for the following packages are not installed. No
1628.28 s
[quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
1628.28 s
[quickcheck-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1628.28 s
[quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
1628.28 s
[quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
1628.28 s
[quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
1628.28 s
[quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
1628.28 s
[quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
1628.28 s
[quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
1628.28 s
[quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
1628.28 s
[quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
1628.28 s
[quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
1628.28 s
[quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
1628.29 s
[quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
1628.29 s
[quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
1628.29 s
[quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
1628.29 s
[quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
1628.29 s
[quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
1628.29 s
[quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
1628.29 s
[quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
1628.29 s
[quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
1628.29 s
[quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
1628.29 s
[quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
1628.29 s
[quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
1628.29 s
[quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
1628.29 s
[quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
1628.29 s
[quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
1628.29 s
[quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
1628.29 s
[quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
1628.29 s
[quickcheck-instances] Haddock coverage:
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[shake] [56 of 73] Compiling Development.Shake.Internal.Derived ( src/Development/Shake/Internal/Derived.hs, nothing )
1628.29 s
[shake] [57 of 73] Compiling Development.Shake.Command ( src/Development/Shake/Command.hs, nothing )
1628.29 s
[shake] [58 of 73] Compiling Development.Shake.Internal.Rules.Directory ( src/Development/Shake/Internal/Rules/Directory.hs, nothing )
1628.29 s
[shake] [59 of 73] Compiling Development.Shake.Internal.Rules.Default ( src/Development/Shake/Internal/Rules/Default.hs, nothing )
1628.29 s
[shake] [60 of 73] Compiling Paths_shake ( dist/build/autogen/Paths_shake.hs, nothing )
1628.29 s
[shake] [61 of 73] Compiling Development.Shake.Internal.Paths ( src/Development/Shake/Internal/Paths.hs, nothing )
1628.29 s
[shake] [62 of 73] Compiling General.Template ( src/General/Template.hs, nothing )
1628.29 s
[shake] [63 of 73] Compiling Development.Shake.Internal.Progress ( src/Development/Shake/Internal/Progress.hs, nothing )
1628.29 s
[shake] [64 of 73] Compiling Development.Shake.Internal.CompactUI ( src/Development/Shake/Internal/CompactUI.hs, nothing )
1628.29 s
[shake] [65 of 73] Compiling Development.Shake.Internal.Profile ( src/Development/Shake/Internal/Profile.hs, nothing )
1628.29 s
[shake] [66 of 73] Compiling Development.Shake.Internal.Core.Run ( src/Development/Shake/Internal/Core/Run.hs, nothing )
1628.29 s
[shake] [67 of 73] Compiling Development.Shake.Database ( src/Development/Shake/Database.hs, nothing )
1628.29 s
[shake] [68 of 73] Compiling Development.Shake.Internal.Demo ( src/Development/Shake/Internal/Demo.hs, nothing )
1628.29 s
[shake] [69 of 73] Compiling Development.Shake.Internal.Args ( src/Development/Shake/Internal/Args.hs, nothing )
1628.29 s
[shake] [70 of 73] Compiling Development.Shake ( src/Development/Shake.hs, nothing )
1628.29 s
[shake] [71 of 73] Compiling Development.Shake.Util ( src/Development/Shake/Util.hs, nothing )
1628.29 s
[shake] [72 of 73] Compiling Development.Shake.Forward ( src/Development/Shake/Forward.hs, nothing )
1628.29 s
[shake] [73 of 73] Compiling Development.Shake.Config ( src/Development/Shake/Config.hs, nothing )
1628.29 s
[shake] Haddock coverage:
1628.29 s
[shake] Warning: 'ShakeValue' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] 100% ( 7 / 7) in 'Development.Shake.Classes'
1628.29 s
[shake] 100% ( 62 / 62) in 'Development.Shake.FilePath'
1628.29 s
[shake] Warning: 'command' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'cmd' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'traced' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'interruptProcessGroupOf' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'terminateProcess' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'Stdout' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'Stderr' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'shakeLintInside' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'normaliseEx' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'Hidden' is ambiguous. It is defined
1628.29 s
[shake] * at src/Development/Shake/Internal/Options.hs:298:20
1628.29 s
[shake] * at src/Development/Shake/Internal/Options.hs:298:1
1628.29 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1628.29 s
[shake] by specifying the type/value namespace explicitly.
1628.29 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Options.hs:298:1
1628.29 s
[shake] Warning: 'addShakeExtra' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'getShakeExtra' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'putStrLn' is ambiguous. It is defined
1628.29 s
[shake] * in ‘System.IO’
1628.29 s
[shake] * in ‘Data.ByteString.Char8’
1628.29 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1628.29 s
[shake] by specifying the type/value namespace explicitly.
1628.29 s
[shake] Defaulting to the one defined in ‘Data.ByteString.Char8’
1628.29 s
[shake] Warning: 'progressSimple' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'Progress' is ambiguous. It is defined
1628.29 s
[vector-instances] [1 of 1] Compiling Data.Vector.Instances ( src/Data/Vector/Instances.hs, dist/build/Data/Vector/Instances.p_o )
1628.29 s
[vector-instances] Phase: checkPhase
1628.29 s
[vector-instances] Package has no test suites.
1628.29 s
[vector-instances] Phase: haddockPhase
1628.29 s
[vector-instances] Preprocessing library for vector-instances-3.4.2..
1628.29 s
[vector-instances] Running Haddock on library for vector-instances-3.4.2..
1628.29 s
[vector-instances] Warning: The documentation for the following packages are not installed. No
1628.29 s
[vector-instances] links will be generated to these packages: vector-0.13.2.0
1628.29 s
[vector-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1628.29 s
[vector-instances] [1 of 1] Compiling Data.Vector.Instances ( src/Data/Vector/Instances.hs, nothing )
1628.29 s
[vector-instances] Haddock coverage:
1628.29 s
[vector-instances] 100% ( 1 / 1) in 'Data.Vector.Instances'
1628.29 s
[vector-instances] Warning: Data.Vector.Instances: could not find link destinations for:
1628.29 s
[vector-instances] - Data.Vector.Vector
1628.29 s
[vector-instances] - Data.Vector.Unboxed.Base.Unbox
1628.29 s
[vector-instances] - Data.Vector.Unboxed.Base.Vector
1628.29 s
[vector-instances] - Data.Vector.Storable.Vector
1628.29 s
[vector-instances] - Data.Vector.Primitive.Vector
1628.29 s
[vector-instances] Documentation created: dist/doc/html/vector-instances/,
1628.29 s
[vector-instances] dist/doc/html/vector-instances/vector-instances.txt
1628.29 s
[vector-instances] Phase: installPhase
1628.29 s
[vector-instances] Installing library in /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/vector-instances-3.4.2-IrMPeDkXsTAHmZR7rP06of
1628.29 s
[vector-instances] Phase: fixupPhase
1628.29 s
[vector-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2
1628.29 s
[vector-instances] shrinking /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSvector-instances-3.4.2-IrMPeDkXsTAHmZR7rP06of-ghc9.8.1.so
1628.29 s
[vector-instances] checking for references to /build/ in /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2...
1628.29 s
[vector-instances] patching script interpreter paths in /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2
1628.29 s
[vector-instances] stripping (with command strip and flags -S -p) in /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2/lib
1628.29 s
[vector-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/g4whsxwjc10y7bcivqfhcziz34dr9j2i-vector-instances-3.4.2-doc
1628.29 s
[vector-instances] checking for references to /build/ in /nix/store/g4whsxwjc10y7bcivqfhcziz34dr9j2i-vector-instances-3.4.2-doc...
1628.29 s
[vector-instances] patching script interpreter paths in /nix/store/g4whsxwjc10y7bcivqfhcziz34dr9j2i-vector-instances-3.4.2-doc
1628.29 s
[HsYAML-aeson] Phase: compileBuildDriverPhase
1628.29 s
[lens] [67 of 85] Compiling Data.ByteString.Lazy.Lens ( src/Data/ByteString/Lazy/Lens.hs, dist/build/Data/ByteString/Lazy/Lens.o, dist/build/Data/ByteString/Lazy/Lens.dyn_o )
1628.29 s
[lens] [68 of 85] Compiling Data.ByteString.Lens ( src/Data/ByteString/Lens.hs, dist/build/Data/ByteString/Lens.o, dist/build/Data/ByteString/Lens.dyn_o )
1628.29 s
[lens] [69 of 85] Compiling Data.Bits.Lens ( src/Data/Bits/Lens.hs, dist/build/Data/Bits/Lens.o, dist/build/Data/Bits/Lens.dyn_o )
1628.29 s
[lens] [70 of 85] Compiling Data.Array.Lens ( src/Data/Array/Lens.hs, dist/build/Data/Array/Lens.o, dist/build/Data/Array/Lens.dyn_o )
1628.29 s
[lens] [71 of 85] Compiling Control.Seq.Lens ( src/Control/Seq/Lens.hs, dist/build/Control/Seq/Lens.o, dist/build/Control/Seq/Lens.dyn_o )
1628.29 s
[lens] [72 of 85] Compiling Control.Parallel.Strategies.Lens ( src/Control/Parallel/Strategies/Lens.hs, dist/build/Control/Parallel/Strategies/Lens.o, dist/build/Control/Parallel/Strategies/Lens.dyn_o )
1628.29 s
[lens] [73 of 85] Compiling Control.Monad.Error.Lens ( src/Control/Monad/Error/Lens.hs, dist/build/Control/Monad/Error/Lens.o, dist/build/Control/Monad/Error/Lens.dyn_o )
1628.29 s
[lens] [74 of 85] Compiling Control.Lens.Unsound ( src/Control/Lens/Unsound.hs, dist/build/Control/Lens/Unsound.o, dist/build/Control/Lens/Unsound.dyn_o )
1628.29 s
[lens] [75 of 85] Compiling Control.Lens.Profunctor ( src/Control/Lens/Profunctor.hs, dist/build/Control/Lens/Profunctor.o, dist/build/Control/Lens/Profunctor.dyn_o )
1628.29 s
[lens] [76 of 85] Compiling Control.Lens.Operators ( src/Control/Lens/Operators.hs, dist/build/Control/Lens/Operators.o, dist/build/Control/Lens/Operators.dyn_o )
1628.29 s
[lens] [77 of 85] Compiling Control.Lens.Extras ( src/Control/Lens/Extras.hs, dist/build/Control/Lens/Extras.o, dist/build/Control/Lens/Extras.dyn_o )
1628.29 s
[lens] [78 of 85] Compiling Control.Lens.Combinators ( src/Control/Lens/Combinators.hs, dist/build/Control/Lens/Combinators.o, dist/build/Control/Lens/Combinators.dyn_o )
1628.29 s
[lens] [79 of 85] Compiling Control.Exception.Lens ( src/Control/Exception/Lens.hs, dist/build/Control/Exception/Lens.o, dist/build/Control/Exception/Lens.dyn_o )
1628.29 s
[lens] [80 of 85] Compiling Data.Dynamic.Lens ( src/Data/Dynamic/Lens.hs, dist/build/Data/Dynamic/Lens.o, dist/build/Data/Dynamic/Lens.dyn_o )
1628.29 s
[lens] [81 of 85] Compiling Numeric.Lens ( src/Numeric/Lens.hs, dist/build/Numeric/Lens.o, dist/build/Numeric/Lens.dyn_o )
1628.29 s
[lens] [82 of 85] Compiling Numeric.Natural.Lens ( src/Numeric/Natural/Lens.hs, dist/build/Numeric/Natural/Lens.o, dist/build/Numeric/Natural/Lens.dyn_o )
1628.29 s
[lens] [83 of 85] Compiling System.Exit.Lens ( src/System/Exit/Lens.hs, dist/build/System/Exit/Lens.o, dist/build/System/Exit/Lens.dyn_o )
1628.29 s
[lens] [84 of 85] Compiling System.FilePath.Lens ( src/System/FilePath/Lens.hs, dist/build/System/FilePath/Lens.o, dist/build/System/FilePath/Lens.dyn_o )
1628.29 s
[lens] [85 of 85] Compiling System.IO.Error.Lens ( src/System/IO/Error/Lens.hs, dist/build/System/IO/Error/Lens.o, dist/build/System/IO/Error/Lens.dyn_o )
1628.29 s
[lens] [ 1 of 85] Compiling Control.Lens.Internal.CTypes ( src/Control/Lens/Internal/CTypes.hs, dist/build/Control/Lens/Internal/CTypes.p_o )
1628.29 s
[lens] [ 2 of 85] Compiling Control.Lens.Internal.Doctest ( src/Control/Lens/Internal/Doctest.hs, dist/build/Control/Lens/Internal/Doctest.p_o )
1628.29 s
[lens] [ 3 of 85] Compiling Control.Lens.Internal.Instances ( src/Control/Lens/Internal/Instances.hs, dist/build/Control/Lens/Internal/Instances.p_o )
1628.29 s
[lens] [ 4 of 85] Compiling Control.Lens.Internal.Iso ( src/Control/Lens/Internal/Iso.hs, dist/build/Control/Lens/Internal/Iso.p_o )
1628.29 s
[lens] [ 5 of 85] Compiling Control.Lens.Internal.List ( src/Control/Lens/Internal/List.hs, dist/build/Control/Lens/Internal/List.p_o )
1628.29 s
[lens] [ 6 of 85] Compiling Control.Lens.Internal.Prelude ( src/Control/Lens/Internal/Prelude.hs, dist/build/Control/Lens/Internal/Prelude.p_o )
1628.29 s
[lens] [ 7 of 85] Compiling Control.Lens.Internal.Level ( src/Control/Lens/Internal/Level.hs, dist/build/Control/Lens/Internal/Level.p_o )
1628.29 s
[lens] [ 8 of 85] Compiling Control.Lens.Internal.Indexed ( src/Control/Lens/Internal/Indexed.hs, dist/build/Control/Lens/Internal/Indexed.p_o )
1628.29 s
[lens] [ 9 of 85] Compiling Control.Lens.Internal.Getter ( src/Control/Lens/Internal/Getter.hs, dist/build/Control/Lens/Internal/Getter.p_o )
1628.29 s
[lens] [10 of 85] Compiling Control.Lens.Internal.Fold ( src/Control/Lens/Internal/Fold.hs, dist/build/Control/Lens/Internal/Fold.p_o )
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
1628.29 s
[quickcheck-instances] Missing documentation for:
1628.29 s
[quickcheck-instances] Module header
1628.29 s
[quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
1628.29 s
[quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
1628.29 s
[quickcheck-instances] - Data.Vector.Vector
1628.29 s
[quickcheck-instances] - Data.Vector.Primitive.Vector
1628.29 s
[quickcheck-instances] - Data.Vector.Storable.Vector
1628.29 s
[quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
1628.29 s
[quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
1628.29 s
[quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
1628.29 s
[quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
1628.29 s
[quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32..
1628.29 s
[quickcheck-instances] Phase: installPhase
1628.29 s
[quickcheck-instances] Installing library in /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
1628.29 s
[quickcheck-instances] Phase: fixupPhase
1628.29 s
[quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32
1628.29 s
[quickcheck-instances] shrinking /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSquickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA-ghc9.8.1.so
1628.29 s
[quickcheck-instances] checking for references to /build/ in /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32...
1628.29 s
[quickcheck-instances] patching script interpreter paths in /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32
1628.29 s
[quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32/lib
1628.29 s
[quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/f8nlxfwdl2jjbrn5va2sqgx05ays6zc1-quickcheck-instances-0.3.32-doc
1628.29 s
[shake] * at src/Development/Shake/Internal/Options.hs:94:17
1628.29 s
[shake] * at src/Development/Shake/Internal/Options.hs:94:1
1628.29 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1628.29 s
[shake] by specifying the type/value namespace explicitly.
1628.29 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Options.hs:94:1
1628.29 s
[shake] Warning: 'stdout' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'stderr' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'getShakeOptions' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'progressDisplay' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'needed' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'ShakeOptions' is ambiguous. It is defined
1628.29 s
[shake] * at src/Development/Shake/Internal/Options.hs:137:21
1628.29 s
[shake] * at src/Development/Shake/Internal/Options.hs:137:1
1628.29 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1628.29 s
[shake] by specifying the type/value namespace explicitly.
1628.29 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Options.hs:137:1
1628.29 s
[shake] Warning: 'Fence' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'writeChunks' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'addPoolException' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'addPoolResume' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'addPoolStart' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'addPoolBatch' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'Fence' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'lintTrackWrite' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'lintTrackRead' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'UserRule' is ambiguous. It is defined
1628.29 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:400:7
1628.29 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:393:1
1628.29 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1628.29 s
[shake] by specifying the type/value namespace explicitly.
1628.29 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Core/Types.hs:393:1
1628.29 s
[shake] Warning: 'addUserRule' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'Rules' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'priority' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'alternatives' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'versioned' is out of scope.
1628.29 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.29 s
[shake] Warning: 'RunResult' is ambiguous. It is defined
1628.29 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:103:24
1628.29 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:103:1
1628.29 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1628.29 s
[shake] by specifying the type/value namespace explicitly.
1628.29 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Core/Types.hs:103:1
1628.29 s
[shake] Warning: 'Action' is ambiguous. It is defined
1628.29 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:65:20
1628.29 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:65:1
1628.30 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1628.30 s
[shake] by specifying the type/value namespace explicitly.
1628.30 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Core/Types.hs:65:1
1628.30 s
[shake] Warning: 'action' is out of scope.
1628.30 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1628.30 s
[shake] Warning: 'need' is out of scope.
1628.53 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/g4whsxwjc10y7bcivqfhcziz34dr9j2i-vector-instances-3.4.2-doc /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2
1629.58 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1629.72 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/g4whsxwjc10y7bcivqfhcziz34dr9j2i-vector-instances-3.4.2-doc /nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2
1630.11 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1630.28 s
[post-build-hook] copying 1 paths...
1630.28 s
[post-build-hook] copying path '/nix/store/hbdllj085653j0ipi2sy3zr0hax7yszw-vector-instances-3.4.2' to 'https://cache.nix-ci.com'...
1631.56 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1632.35 s
[post-build-hook] copying 0 paths...
1632.61 s
Progress: 97 of 171 built (15 building), 395 of 395 downloaded from cache
1632.79 s
Building quickcheck-classes
1632.83 s
[HTF] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.KAdLTPGk1j/Main.o )
1632.83 s
[HTF] [2 of 2] Linking Setup
1632.83 s
[HTF] Phase: updateAutotoolsGnuConfigScriptsPhase
1632.83 s
[HTF] Phase: configurePhase
1632.83 s
[HTF] configureFlags: --verbose --prefix=/nix/store/h1prxycrl278ln7f0yfyjfnxi8q3801y-HTF-0.15.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/ib0zwkg6dg1bk0k7wir4vfvzm55qh5fy-HTF-0.15.0.2-doc/share/doc/HTF-0.15.0.2 --with-gcc=gcc --package-db=/build/tmp.KAdLTPGk1j/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --disable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1632.83 s
[HTF] Using Parsec parser
1632.83 s
[HTF] Configuring HTF-0.15.0.2...
1632.83 s
[HsYAML-aeson] setupCompileFlags: -package-db=/build/tmp.KvBdcfmRL2/setup-package.conf.d -threaded
1632.83 s
[HsYAML-aeson] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.KvBdcfmRL2/Main.o )
1632.83 s
[HsYAML-aeson] [2 of 2] Linking Setup
1632.83 s
[HsYAML-aeson] Phase: updateAutotoolsGnuConfigScriptsPhase
1632.83 s
[HsYAML-aeson] Phase: configurePhase
1632.83 s
[HsYAML-aeson] configureFlags: --verbose --prefix=/nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/5gy8nldkva3lwv05h83rpf5nimlfz5bs-HsYAML-aeson-0.2.0.2-doc/share/doc/HsYAML-aeson-0.2.0.2 --with-gcc=gcc --package-db=/build/tmp.KvBdcfmRL2/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1632.83 s
[HsYAML-aeson] Using Parsec parser
1632.83 s
[HsYAML-aeson] Configuring HsYAML-aeson-0.2.0.2...
1632.83 s
[attoparsec-aeson] Phase: unpackPhase
1632.83 s
[attoparsec-aeson] unpacking source archive /nix/store/5rb5wpjl9np13rv3zw09x0ihmgyz3gi8-attoparsec-aeson-2.2.2.0.tar.gz
1632.83 s
[attoparsec-aeson] source root is attoparsec-aeson-2.2.2.0
1632.83 s
[attoparsec-aeson] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "attoparsec-aeson-2.2.2.0/src/Data/Aeson/Parser/Internal.hs"
1632.83 s
[attoparsec-aeson] Phase: patchPhase
1632.83 s
[attoparsec-aeson] Phase: compileBuildDriverPhase
1632.83 s
[attoparsec-aeson] setupCompileFlags: -package-db=/build/tmp.B7MaFBPXUl/setup-package.conf.d -threaded
1632.83 s
[attoparsec-aeson] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.B7MaFBPXUl/Main.o )
1632.83 s
[attoparsec-aeson] [2 of 2] Linking Setup
1632.83 s
[attoparsec-aeson] Phase: updateAutotoolsGnuConfigScriptsPhase
1632.83 s
[attoparsec-aeson] Phase: configurePhase
1632.83 s
[attoparsec-aeson] configureFlags: --verbose --prefix=/nix/store/jwz1sjq5mx2qzd09vc5md7zvkg7kbkjw-attoparsec-aeson-2.2.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/c5r8g8hlv01ldcbmqxrw8i91x2rh4ml3-attoparsec-aeson-2.2.2.0-doc/share/doc/attoparsec-aeson-2.2.2.0 --with-gcc=gcc --package-db=/build/tmp.B7MaFBPXUl/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1632.83 s
[attoparsec-aeson] Using Parsec parser
1632.83 s
[attoparsec-aeson] Configuring attoparsec-aeson-2.2.2.0...
1632.83 s
[binary-instances] Phase: unpackPhase
1632.83 s
[binary-instances] unpacking source archive /nix/store/6r2l3jb7n340fq6gn4pcsbnq9iy8nq5s-binary-instances-1.0.6.tar.gz
1632.83 s
[binary-instances] source root is binary-instances-1.0.6
1632.83 s
[binary-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "binary-instances-1.0.6/test/Tests.hs"
1632.83 s
[binary-instances] Phase: patchPhase
1632.83 s
[binary-instances] Phase: compileBuildDriverPhase
1632.83 s
[binary-instances] setupCompileFlags: -package-db=/build/tmp.3suPR34YFL/setup-package.conf.d -threaded
1632.83 s
[binary-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.3suPR34YFL/Main.o )
1632.83 s
[binary-instances] [2 of 2] Linking Setup
1632.83 s
[constraints-extras] Phase: unpackPhase
1632.83 s
[constraints-extras] unpacking source archive /nix/store/r1hndpvyfxs48509mabl0cshsw79a5yb-constraints-extras-0.4.0.2.tar.gz
1632.83 s
[constraints-extras] source root is constraints-extras-0.4.0.2
1632.83 s
[constraints-extras] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "constraints-extras-0.4.0.2/src/Data/Constraint/Flip.hs"
1632.83 s
[constraints-extras] Phase: patchPhase
1632.83 s
[constraints-extras] Phase: compileBuildDriverPhase
1632.83 s
[constraints-extras] setupCompileFlags: -package-db=/build/tmp.iT3LrMmpPC/setup-package.conf.d -threaded
1632.83 s
[constraints-extras] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.iT3LrMmpPC/Main.o )
1632.83 s
[constraints-extras] [2 of 2] Linking Setup
1632.83 s
[constraints-extras] Phase: updateAutotoolsGnuConfigScriptsPhase
1632.83 s
[constraints-extras] Phase: configurePhase
1632.83 s
[constraints-extras] configureFlags: --verbose --prefix=/nix/store/avhd0nqxysf32zw4x2zsshgsqblgyzii-constraints-extras-0.4.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/p07hq4lcx620qiwxmgpn2yi80qi6wx56-constraints-extras-0.4.0.2-doc/share/doc/constraints-extras-0.4.0.2 --with-gcc=gcc --package-db=/build/tmp.iT3LrMmpPC/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1632.83 s
[constraints-extras] Using Parsec parser
1632.83 s
[constraints-extras] Configuring constraints-extras-0.4.0.2...
1632.83 s
[deriving-aeson] Phase: unpackPhase
1632.84 s
[deriving-aeson] unpacking source archive /nix/store/l88yyksp9a5lqpl3sqhcbbj8xh0jl40z-deriving-aeson-0.2.10.tar.gz
1632.84 s
[deriving-aeson] source root is deriving-aeson-0.2.10
1632.84 s
[deriving-aeson] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "deriving-aeson-0.2.10/tests/test.hs"
1632.84 s
[deriving-aeson] Phase: patchPhase
1632.84 s
[deriving-aeson] Phase: compileBuildDriverPhase
1632.84 s
[deriving-aeson] setupCompileFlags: -package-db=/build/tmp.V6oijdXB6z/setup-package.conf.d -threaded
1632.84 s
[deriving-aeson] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.V6oijdXB6z/Main.o )
1632.84 s
[deriving-aeson] [2 of 2] Linking Setup
1632.84 s
[doctest-discover] Phase: unpackPhase
1632.84 s
[doctest-discover] unpacking source archive /nix/store/x01941jdrxhhgq4jmkbdnk5zqxnjwf1y-doctest-discover-0.2.0.0.tar.gz
1632.84 s
[doctest-discover] source root is doctest-discover-0.2.0.0
1632.84 s
[doctest-discover] setting SOURCE_DATE_EPOCH to timestamp 1532301813 of file "doctest-discover-0.2.0.0/doctest-discover.cabal"
1632.84 s
[doctest-discover] Phase: patchPhase
1632.84 s
[doctest-discover] Phase: compileBuildDriverPhase
1632.84 s
[doctest-discover] setupCompileFlags: -package-db=/build/tmp.cu6f9NnL2D/setup-package.conf.d -threaded
1632.84 s
[doctest-discover] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.cu6f9NnL2D/Main.o )
1632.84 s
[doctest-discover] [2 of 2] Linking Setup
1632.84 s
[enummapset] Phase: unpackPhase
1632.84 s
[enummapset] unpacking source archive /nix/store/rszqn2a7yk0vpfrf489srbz5kng0zdsl-enummapset-0.7.3.0.tar.gz
1632.84 s
[enummapset] source root is enummapset-0.7.3.0
1632.84 s
[enummapset] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "enummapset-0.7.3.0/tests/Json.hs"
1632.84 s
[enummapset] Phase: patchPhase
1632.84 s
[enummapset] Phase: compileBuildDriverPhase
1632.84 s
[enummapset] setupCompileFlags: -package-db=/build/tmp.sHed2qOi2K/setup-package.conf.d -threaded
1632.84 s
[enummapset] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.sHed2qOi2K/Main.o )
1632.84 s
[enummapset] [2 of 2] Linking Setup
1632.84 s
[lens] [11 of 85] Compiling Control.Lens.Internal.Context ( src/Control/Lens/Internal/Context.hs, dist/build/Control/Lens/Internal/Context.p_o )
1632.84 s
[lens] [12 of 85] Compiling Control.Lens.Internal.Bazaar ( src/Control/Lens/Internal/Bazaar.hs, dist/build/Control/Lens/Internal/Bazaar.p_o )
1632.84 s
[lens] [13 of 85] Compiling Control.Lens.Internal.Magma ( src/Control/Lens/Internal/Magma.hs, dist/build/Control/Lens/Internal/Magma.p_o )
1632.84 s
[microaeson] Phase: setupCompilerEnvironmentPhase
1632.84 s
[microaeson] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1632.84 s
[microaeson] Phase: unpackPhase
1632.84 s
[microaeson] unpacking source archive /nix/store/dxv9hqm6jsvq0gyi2yjrc2821rd12q5n-microaeson-0.1.0.2.tar.gz
1632.84 s
[microaeson] source root is microaeson-0.1.0.2
1632.84 s
[microaeson] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "microaeson-0.1.0.2/src-tests/tests.hs"
1632.84 s
[microaeson] Phase: patchPhase
1632.84 s
[microaeson] Replace Cabal file with edited version from mirror://hackage/microaeson-0.1.0.2/revision/1.cabal.
1632.84 s
[microaeson] Phase: compileBuildDriverPhase
1632.84 s
[microaeson] setupCompileFlags: -package-db=/build/tmp.9xjPRFznh7/setup-package.conf.d -threaded
1632.84 s
[microaeson] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.9xjPRFznh7/Main.o )
1632.84 s
[microaeson] [2 of 2] Linking Setup
1632.84 s
[path] Phase: setupCompilerEnvironmentPhase
1632.84 s
[path] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1632.84 s
[path] Phase: unpackPhase
1632.84 s
[path] unpacking source archive /nix/store/lwci43w7gzk8lmmp4inn94bqn32r86iz-path-0.9.5.tar.gz
1632.84 s
[path] source root is path-0.9.5
1632.84 s
[path] setting SOURCE_DATE_EPOCH to timestamp 1697620144 of file "path-0.9.5/CHANGELOG"
1632.84 s
[path] Phase: patchPhase
1632.84 s
[path] Phase: compileBuildDriverPhase
1632.84 s
[path] setupCompileFlags: -package-db=/build/tmp.1ZpmvKvDkB/setup-package.conf.d -threaded
1632.84 s
[path] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.1ZpmvKvDkB/Main.o )
1632.84 s
[path] [2 of 2] Linking Setup
1632.84 s
[quickcheck-instances] checking for references to /build/ in /nix/store/f8nlxfwdl2jjbrn5va2sqgx05ays6zc1-quickcheck-instances-0.3.32-doc...
1632.84 s
[quickcheck-instances] patching script interpreter paths in /nix/store/f8nlxfwdl2jjbrn5va2sqgx05ays6zc1-quickcheck-instances-0.3.32-doc
1632.84 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1632.84 s
[shake] Warning: 'ShakeOptions' is ambiguous. It is defined
1632.84 s
[shake] * at src/Development/Shake/Internal/Options.hs:137:21
1632.84 s
[shake] * at src/Development/Shake/Internal/Options.hs:137:1
1632.84 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1632.84 s
[shake] by specifying the type/value namespace explicitly.
1632.84 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Options.hs:137:1
1632.84 s
[shake] Warning: 'Rules' is ambiguous. It is defined
1632.84 s
[shake] * at src/Development/Shake/Internal/Core/Rules.hs:114:19
1632.84 s
[shake] * at src/Development/Shake/Internal/Core/Rules.hs:114:1
1632.84 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1632.84 s
[shake] by specifying the type/value namespace explicitly.
1632.84 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Core/Rules.hs:114:1
1632.84 s
[shake] Warning: 'BinaryOp' is ambiguous. It is defined
1632.84 s
[shake] * at src/General/Binary.hs:34:19
1632.84 s
[shake] * at src/General/Binary.hs:34:1
1632.84 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1632.84 s
[shake] by specifying the type/value namespace explicitly.
1632.84 s
[shake] Defaulting to the one defined at src/General/Binary.hs:34:1
1632.84 s
[shake] Warning: 'writeFile'' is out of scope.
1632.84 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1632.84 s
[shake] Warning: 'Action' is ambiguous. It is defined
1632.84 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:65:20
1632.84 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:65:1
1632.84 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1632.84 s
[shake] by specifying the type/value namespace explicitly.
1632.84 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Core/Types.hs:65:1
1632.84 s
[shake] Warning: 'need' is out of scope.
1632.84 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1632.84 s
[shake] Warning: 'ShakeOptions' is ambiguous. It is defined
1632.84 s
[shake] * at src/Development/Shake/Internal/Options.hs:137:21
1632.84 s
[shake] * at src/Development/Shake/Internal/Options.hs:137:1
1632.84 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1632.84 s
[shake] by specifying the type/value namespace explicitly.
1632.84 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Options.hs:137:1
1632.84 s
[shake] Warning: 'Progress' is ambiguous. It is defined
1632.84 s
[shake] * at src/Development/Shake/Internal/Options.hs:94:17
1632.84 s
[shake] * at src/Development/Shake/Internal/Options.hs:94:1
1632.84 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1632.84 s
[shake] by specifying the type/value namespace explicitly.
1632.84 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Options.hs:94:1
1632.84 s
[shake] Warning: 'alwaysRerun' is out of scope.
1632.84 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1632.84 s
[shake] Warning: 'produces' is out of scope.
1632.84 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1632.84 s
[shake] Warning: 'orderOnly' is out of scope.
1632.85 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1632.85 s
[shake] Warning: 'withResource' is out of scope.
1632.85 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1632.85 s
[shake] Warning: 'cmd' is out of scope.
1632.85 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1632.85 s
[shake] Warning: 'command' is out of scope.
1632.85 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1632.85 s
[shake] Warning: 'apply' is out of scope.
1632.85 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1632.85 s
[shake] Warning: '-<.>' is out of scope.
1632.85 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1632.85 s
[shake] Warning: '%>' is out of scope.
1632.85 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1632.85 s
[shake] Warning: 'Resource' is ambiguous. It is defined
1632.85 s
[shake] * at src/Development/Shake/Internal/Resource.hs:73:17
1632.85 s
[shake] * at src/Development/Shake/Internal/Resource.hs:73:1
1632.85 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1632.85 s
[shake] by specifying the type/value namespace explicitly.
1632.85 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Resource.hs:73:1
1632.85 s
[shake] Warning: 'need' is out of scope.
1632.85 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1632.85 s
[shake] Warning: 'Action' is ambiguous. It is defined
1632.85 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:65:20
1632.85 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:65:1
1633.19 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/f8nlxfwdl2jjbrn5va2sqgx05ays6zc1-quickcheck-instances-0.3.32-doc /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32
1634.48 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1634.58 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/f8nlxfwdl2jjbrn5va2sqgx05ays6zc1-quickcheck-instances-0.3.32-doc /nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32
1634.93 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1635.27 s
[post-build-hook] copying 1 paths...
1635.27 s
[post-build-hook] copying path '/nix/store/kzdw6csyxz27zmcbrz6yvi70v54x3c81-quickcheck-instances-0.3.32' to 'https://cache.nix-ci.com'...
1638.20 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1638.52 s
[post-build-hook] copying 0 paths...
1639.19 s
Progress: 98 of 171 built (15 building), 395 of 395 downloaded from cache
1639.19 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.19 s
[shake] by specifying the type/value namespace explicitly.
1639.19 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Core/Types.hs:65:1
1639.19 s
[shake] Warning: 'produces' is out of scope.
1639.19 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.19 s
[shake] Warning: 'need' is out of scope.
1639.19 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.19 s
[shake] Warning: 'ByteString' is out of scope.
1639.19 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.19 s
[shake] Warning: 'RunResult' is ambiguous. It is defined
1639.19 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:103:24
1639.19 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:103:1
1639.19 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.19 s
[shake] by specifying the type/value namespace explicitly.
1639.19 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Core/Types.hs:103:1
1639.19 s
[shake] 100% ( 38 / 38) in 'Development.Shake.Rule'
1639.19 s
[shake] Warning: 'newCache' is out of scope.
1639.19 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.19 s
[shake] Warning: 'getDirectoryFiles' is out of scope.
1639.19 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.19 s
[shake] Warning: 'getEnv' is out of scope.
1639.19 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.19 s
[shake] Warning: 'Action' is ambiguous. It is defined
1639.19 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:65:20
1639.19 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:65:1
1639.19 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.19 s
[shake] by specifying the type/value namespace explicitly.
1639.19 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Core/Types.hs:65:1
1639.19 s
[shake] Warning: 'cmd_' is out of scope.
1639.19 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.19 s
[shake] Warning: 'neededMakefileDependencies' is out of scope.
1639.19 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.19 s
[shake] Warning: 'needMakefileDependencies' is out of scope.
1639.19 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.19 s
[shake] Warning: 'shakeArgs' is out of scope.
1639.19 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.19 s
[shake] Warning: 'Action' is ambiguous. It is defined
1639.19 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:65:20
1639.19 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:65:1
1639.19 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.19 s
[shake] by specifying the type/value namespace explicitly.
1639.19 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Core/Types.hs:65:1
1639.19 s
[shake] Warning: 'readFile'' is ambiguous. It is defined
1639.19 s
[shake] * in ‘System.IO’
1639.19 s
[shake] * at src/Development/Shake/Internal/Derived.hs:118:1
1639.19 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.19 s
[shake] by specifying the type/value namespace explicitly.
1639.19 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Derived.hs:118:1
1639.19 s
[shake] Warning: 'withTempDir' is ambiguous. It is defined
1639.19 s
[shake] * in ‘System.IO.Extra’
1639.19 s
[shake] * at src/Development/Shake/Internal/Derived.hs:179:1
1639.19 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.19 s
[shake] by specifying the type/value namespace explicitly.
1639.19 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Derived.hs:179:1
1639.19 s
[shake] Warning: 'withTempFile' is ambiguous. It is defined
1639.19 s
[shake] * in ‘System.IO.Extra’
1639.19 s
[shake] * at src/Development/Shake/Internal/Derived.hs:159:1
1639.19 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.19 s
[shake] by specifying the type/value namespace explicitly.
1639.19 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Derived.hs:159:1
1639.19 s
[shake] Warning: 'dropExtension' is out of scope.
1639.19 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.19 s
[shake] Warning: 'Stdout' is ambiguous. It is defined
1639.19 s
[shake] * at src/Development/Shake/Command.hs:501:20
1639.19 s
[shake] * at src/Development/Shake/Command.hs:501:1
1639.19 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.19 s
[shake] by specifying the type/value namespace explicitly.
1639.19 s
[shake] Defaulting to the one defined at src/Development/Shake/Command.hs:501:1
1639.19 s
[shake] Warning: 'Stderr' is ambiguous. It is defined
1639.19 s
[shake] * at src/Development/Shake/Command.hs:509:20
1639.19 s
[shake] * at src/Development/Shake/Command.hs:509:1
1639.19 s
Building rebase
1639.19 s
[HTF] Dependency Diff >=0.3: using Diff-0.5
1639.19 s
[HTF] Dependency HUnit >=1.2.5: using HUnit-1.6.2.0
1639.19 s
[HTF] Dependency QuickCheck >=2.3: using QuickCheck-2.14.3
1639.19 s
[HTF] Dependency aeson >=0.11: using aeson-2.2.3.0
1639.19 s
[HTF] Dependency array: using array-0.5.6.0
1639.19 s
[HTF] Dependency base >=4.10 && <5: using base-4.19.0.0
1639.19 s
[HTF] Dependency base64-bytestring: using base64-bytestring-1.2.1.0
1639.19 s
[HTF] Dependency bytestring >=0.9: using bytestring-0.12.0.2
1639.19 s
[HTF] Dependency containers >=0.5: using containers-0.6.8
1639.19 s
[HTF] Dependency cpphs >=1.19: using cpphs-1.20.9.1
1639.20 s
[HTF] Dependency directory >=1.0: using directory-1.3.8.1
1639.20 s
[HTF] Dependency haskell-src: using haskell-src-1.0.4.1
1639.20 s
[HTF] Dependency lifted-base >=0.1: using lifted-base-0.2.3.12
1639.20 s
[HTF] Dependency monad-control >=0.3: using monad-control-1.0.3.1
1639.20 s
[HTF] Dependency mtl >=1.1: using mtl-2.3.1
1639.20 s
[HTF] Dependency old-time >=1.0: using old-time-1.1.0.4
1639.20 s
[HTF] Dependency pretty >=1.0: using pretty-1.1.3.6
1639.20 s
[HTF] Dependency process >=1.0: using process-1.6.18.0
1639.20 s
[HTF] Dependency random >=1.0: using random-1.2.1.3
1639.20 s
[HTF] Dependency regex-compat >=0.92: using regex-compat-0.95.2.2
1639.20 s
[HTF] Dependency text >=0.11: using text-2.1
1639.20 s
[HTF] Dependency time: using time-1.12.2
1639.20 s
[HTF] Dependency unix >=2.4: using unix-2.8.3.0
1639.20 s
[HTF] Dependency vector: using vector-0.13.2.0
1639.20 s
[HTF] Dependency xmlgen >=0.6: using xmlgen-0.6.2.2
1639.20 s
[HTF] Dependency HTF: using HTF-0.15.0.2
1639.20 s
[HTF] Dependency HUnit: using HUnit-1.6.2.0
1639.20 s
[HTF] Dependency array: using array-0.5.6.0
1639.20 s
[HTF] Dependency base >=4.10 && <5: using base-4.19.0.0
1639.20 s
[HTF] Dependency cpphs >=1.19: using cpphs-1.20.9.1
1639.20 s
[HTF] Dependency directory >=1.0: using directory-1.3.8.1
1639.20 s
[HTF] Dependency mtl >=1.1: using mtl-2.3.1
1639.20 s
[HTF] Dependency old-time >=1.0: using old-time-1.1.0.4
1639.20 s
[HTF] Dependency random >=1.0: using random-1.2.1.3
1639.20 s
[HTF] Dependency text >=0.11: using text-2.1
1639.20 s
[HTF] Source component graph:
1639.20 s
[HTF] component lib
1639.20 s
[HTF] component exe:htfpp dependency lib
1639.20 s
[HTF] Configured component graph:
1639.20 s
[HTF] component HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA
1639.20 s
[HTF] include Diff-0.5-4nPoK53PkizD5e0dTbCPv7
1639.20 s
[HTF] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1639.20 s
[HTF] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.20 s
[HTF] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.20 s
[HTF] include array-0.5.6.0-dc89
1639.20 s
[HTF] include base-4.19.0.0-b960
1639.20 s
[HTF] include base64-bytestring-1.2.1.0-1qR3QVAtzfk4y9K7iqu3ou
1639.20 s
[HTF] include bytestring-0.12.0.2-4690
1639.20 s
[HTF] include containers-0.6.8-4775
1639.20 s
[HTF] include cpphs-1.20.9.1-E9p97sJCo9vBonNKfkaXhU
1639.20 s
[HTF] include directory-1.3.8.1-6a8e
1639.20 s
[HTF] include haskell-src-1.0.4.1-1lQI86ecaIUAoElc0pB2CK
1639.20 s
[HTF] include lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ
1639.20 s
[HTF] include monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
1639.20 s
[HTF] include mtl-2.3.1-63a4
1639.20 s
[HTF] include old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
1639.20 s
[HTF] include pretty-1.1.3.6-0c70
1639.20 s
[HTF] include process-1.6.18.0-26fa
1639.20 s
[HTF] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1639.20 s
[HTF] include regex-compat-0.95.2.2-7bidefGXMVCG2qJiDbfeWo
1639.20 s
[HTF] include text-2.1-c36a
1639.20 s
[HTF] include time-1.12.2-d26d
1639.20 s
[HTF] include unix-2.8.3.0-8aa6
1639.20 s
[HTF] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.20 s
[HTF] include xmlgen-0.6.2.2-DJtxksEno4uBwwEuRLqyk4
1639.20 s
[HTF] component HTF-0.15.0.2-GcDWKGxFAyyLK6BrVBhjlu-htfpp
1639.20 s
[HTF] include HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA
1639.20 s
[HTF] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1639.20 s
[HTF] include array-0.5.6.0-dc89
1639.20 s
[HTF] include base-4.19.0.0-b960
1639.20 s
[HTF] include cpphs-1.20.9.1-E9p97sJCo9vBonNKfkaXhU
1639.20 s
[HTF] include directory-1.3.8.1-6a8e
1639.20 s
[HTF] include mtl-2.3.1-63a4
1639.20 s
[HTF] include old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
1639.20 s
[HTF] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1639.20 s
[HTF] include text-2.1-c36a
1639.20 s
[HTF] Linked component graph:
1639.20 s
[HTF] unit HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA
1639.20 s
[HTF] include Diff-0.5-4nPoK53PkizD5e0dTbCPv7
1639.20 s
[HTF] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1639.20 s
[HTF] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.20 s
[HTF] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.20 s
[HTF] include array-0.5.6.0-dc89
1639.20 s
[HTF] include base-4.19.0.0-b960
1639.20 s
[HTF] include base64-bytestring-1.2.1.0-1qR3QVAtzfk4y9K7iqu3ou
1639.20 s
[HTF] include bytestring-0.12.0.2-4690
1639.20 s
[HTF] include containers-0.6.8-4775
1639.20 s
[HTF] include cpphs-1.20.9.1-E9p97sJCo9vBonNKfkaXhU
1639.20 s
[HTF] include directory-1.3.8.1-6a8e
1639.20 s
[HsYAML-aeson] Flags chosen: exe=False
1639.20 s
[HsYAML-aeson] Dependency HsYAML >=0.2.0 && <0.3: using HsYAML-0.2.1.5
1639.20 s
[HsYAML-aeson] Dependency aeson >=1.4.0.0 && <1.5 || >=1.5.0.0 && <1.6 || >=2.0.0.0 && <2.1
1639.20 s
[HsYAML-aeson] || >=2.1.0.0 && <2.2 || >=2.2.0.0 && <2.3: using aeson-2.2.3.0
1639.20 s
[HsYAML-aeson] Dependency base >=4.9 && <5: using base-4.19.0.0
1639.20 s
[HsYAML-aeson] Dependency bytestring >=0.10.8.1 && <0.13: using bytestring-0.12.0.2
1639.20 s
[HsYAML-aeson] Dependency containers >=0.5.7.1 && <1: using containers-0.6.8
1639.20 s
[HsYAML-aeson] Dependency mtl >=2.2.1 && <2.3 || >=2.3.1 && <2.4: using mtl-2.3.1
1639.20 s
[HsYAML-aeson] Dependency scientific >=0.3.6.2 && <0.4: using scientific-0.3.8.0
1639.20 s
[HsYAML-aeson] Dependency text >=1.2.3 && <1.3 || >=2.0 && <2.2: using text-2.1
1639.20 s
[HsYAML-aeson] Dependency unordered-containers >=0.2 && <0.3: using
1639.20 s
[HsYAML-aeson] unordered-containers-0.2.20
1639.20 s
[HsYAML-aeson] Dependency vector >=0.12.0.2 && <0.13 || >=0.13.0.0 && <0.14: using
1639.20 s
[HsYAML-aeson] vector-0.13.2.0
1639.20 s
[HsYAML-aeson] Source component graph: component lib
1639.20 s
[HsYAML-aeson] Configured component graph:
1639.20 s
[HsYAML-aeson] component HsYAML-aeson-0.2.0.2-HAxVVGatvNS4fTgBVNCkaF
1639.20 s
[HsYAML-aeson] include HsYAML-0.2.1.5-1OYadaKMTKx2YjxPtd8Rfm
1639.20 s
[HsYAML-aeson] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.20 s
[HsYAML-aeson] include base-4.19.0.0-b960
1639.20 s
[HsYAML-aeson] include bytestring-0.12.0.2-4690
1639.20 s
[HsYAML-aeson] include containers-0.6.8-4775
1639.20 s
[HsYAML-aeson] include mtl-2.3.1-63a4
1639.20 s
[HsYAML-aeson] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1639.20 s
[HsYAML-aeson] include text-2.1-c36a
1639.20 s
[HsYAML-aeson] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1639.20 s
[HsYAML-aeson] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.20 s
[HsYAML-aeson] Linked component graph:
1639.20 s
[HsYAML-aeson] unit HsYAML-aeson-0.2.0.2-HAxVVGatvNS4fTgBVNCkaF
1639.20 s
[HsYAML-aeson] include HsYAML-0.2.1.5-1OYadaKMTKx2YjxPtd8Rfm
1639.20 s
[HsYAML-aeson] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.20 s
[HsYAML-aeson] include base-4.19.0.0-b960
1639.20 s
[HsYAML-aeson] include bytestring-0.12.0.2-4690
1639.20 s
[HsYAML-aeson] include containers-0.6.8-4775
1639.20 s
[HsYAML-aeson] include mtl-2.3.1-63a4
1639.20 s
[HsYAML-aeson] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1639.20 s
[HsYAML-aeson] include text-2.1-c36a
1639.20 s
[HsYAML-aeson] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1639.20 s
[HsYAML-aeson] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.20 s
[HsYAML-aeson] Data.YAML.Aeson=HsYAML-aeson-0.2.0.2-HAxVVGatvNS4fTgBVNCkaF:Data.YAML.Aeson
1639.20 s
[HsYAML-aeson] Ready component graph:
1639.20 s
[HsYAML-aeson] definite HsYAML-aeson-0.2.0.2-HAxVVGatvNS4fTgBVNCkaF
1639.20 s
[HsYAML-aeson] depends HsYAML-0.2.1.5-1OYadaKMTKx2YjxPtd8Rfm
1639.20 s
[HsYAML-aeson] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.20 s
[HsYAML-aeson] depends base-4.19.0.0-b960
1639.20 s
[HsYAML-aeson] depends bytestring-0.12.0.2-4690
1639.20 s
[HsYAML-aeson] depends containers-0.6.8-4775
1639.20 s
[HsYAML-aeson] depends mtl-2.3.1-63a4
1639.20 s
[HsYAML-aeson] depends scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1639.20 s
[HsYAML-aeson] depends text-2.1-c36a
1639.20 s
[HsYAML-aeson] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1639.20 s
[HsYAML-aeson] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.20 s
[HsYAML-aeson] Using Cabal-3.10.2.0 compiled by ghc-9.8
1639.20 s
[HsYAML-aeson] Using compiler: ghc-9.8.1
1639.20 s
[HsYAML-aeson] Using install prefix:
1639.20 s
[HsYAML-aeson] /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2
1639.20 s
[HsYAML-aeson] Executables installed in:
1639.20 s
[HsYAML-aeson] /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2/bin
1639.20 s
[HsYAML-aeson] Libraries installed in:
1639.20 s
[HsYAML-aeson] /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/HsYAML-aeson-0.2.0.2-HAxVVGatvNS4fTgBVNCkaF
1639.20 s
[HsYAML-aeson] Dynamic Libraries installed in:
1639.20 s
[HsYAML-aeson] /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1639.20 s
[HsYAML-aeson] Private executables installed in:
1639.20 s
[HsYAML-aeson] /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2/libexec/x86_64-linux-ghc-9.8.1/HsYAML-aeson-0.2.0.2
1639.20 s
[HsYAML-aeson] Data files installed in:
1639.20 s
[HsYAML-aeson] /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2/share/x86_64-linux-ghc-9.8.1/HsYAML-aeson-0.2.0.2
1639.20 s
[HsYAML-aeson] Documentation installed in:
1639.20 s
[HsYAML-aeson] /nix/store/5gy8nldkva3lwv05h83rpf5nimlfz5bs-HsYAML-aeson-0.2.0.2-doc/share/doc/HsYAML-aeson-0.2.0.2
1639.20 s
[HsYAML-aeson] Configuration files installed in:
1639.20 s
[HsYAML-aeson] /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2/etc
1639.20 s
[HsYAML-aeson] No alex found
1639.20 s
[HsYAML-aeson] Using ar found on system at:
1639.20 s
[HsYAML-aeson] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1639.20 s
[HsYAML-aeson] No c2hs found
1639.20 s
[HsYAML-aeson] No cpphs found
1639.20 s
[HsYAML-aeson] No doctest found
1639.20 s
[HsYAML-aeson] Using gcc version 14.3.0 given by user at:
1639.20 s
[HsYAML-aeson] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1639.20 s
[HsYAML-aeson] Using ghc version 9.8.1 found on system at:
1639.20 s
[HsYAML-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1639.20 s
[HsYAML-aeson] Using ghc-pkg version 9.8.1 found on system at:
1639.20 s
[attoparsec-aeson] Dependency aeson >=2.2.2.0 && <2.3: using aeson-2.2.3.0
1639.20 s
[attoparsec-aeson] Dependency attoparsec >=0.14.2 && <0.15: using attoparsec-0.14.4
1639.20 s
[attoparsec-aeson] Dependency base >=4.12.0.0 && <5: using base-4.19.0.0
1639.20 s
[attoparsec-aeson] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.0.2
1639.20 s
[attoparsec-aeson] Dependency character-ps >=0.1 && <0.2: using character-ps-0.1
1639.21 s
[attoparsec-aeson] Dependency integer-conversion >=0.1 && <0.2: using integer-conversion-0.1.1
1639.21 s
[attoparsec-aeson] Dependency primitive >=0.8.0.0 && <0.10: using primitive-0.9.1.0
1639.21 s
[attoparsec-aeson] Dependency scientific >=0.3.7.0 && <0.4: using scientific-0.3.8.0
1639.21 s
[attoparsec-aeson] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1
1639.21 s
[attoparsec-aeson] Dependency vector >=0.12.0.1 && <0.14: using vector-0.13.2.0
1639.21 s
[attoparsec-aeson] Source component graph: component lib
1639.21 s
[attoparsec-aeson] Configured component graph:
1639.21 s
[attoparsec-aeson] component attoparsec-aeson-2.2.2.0-3R0fTMXvK3710bMZ24kuaX
1639.21 s
[attoparsec-aeson] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.21 s
[attoparsec-aeson] include attoparsec-0.14.4-C7aHI3pddOC9iYSiyhYSYZ
1639.21 s
[attoparsec-aeson] include base-4.19.0.0-b960
1639.21 s
[attoparsec-aeson] include bytestring-0.12.0.2-4690
1639.21 s
[attoparsec-aeson] include character-ps-0.1-5NZ4UJdXHV93lSpc31BgaQ
1639.21 s
[attoparsec-aeson] include integer-conversion-0.1.1-AEc8Mc86KpxKTurcpgT6s2
1639.21 s
[attoparsec-aeson] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.21 s
[attoparsec-aeson] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1639.21 s
[attoparsec-aeson] include text-2.1-c36a
1639.21 s
[attoparsec-aeson] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.21 s
[attoparsec-aeson] Linked component graph:
1639.21 s
[attoparsec-aeson] unit attoparsec-aeson-2.2.2.0-3R0fTMXvK3710bMZ24kuaX
1639.21 s
[attoparsec-aeson] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.21 s
[attoparsec-aeson] include attoparsec-0.14.4-C7aHI3pddOC9iYSiyhYSYZ
1639.21 s
[attoparsec-aeson] include base-4.19.0.0-b960
1639.21 s
[attoparsec-aeson] include bytestring-0.12.0.2-4690
1639.21 s
[attoparsec-aeson] include character-ps-0.1-5NZ4UJdXHV93lSpc31BgaQ
1639.21 s
[attoparsec-aeson] include integer-conversion-0.1.1-AEc8Mc86KpxKTurcpgT6s2
1639.21 s
[attoparsec-aeson] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.21 s
[attoparsec-aeson] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1639.21 s
[attoparsec-aeson] include text-2.1-c36a
1639.21 s
[attoparsec-aeson] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.21 s
[attoparsec-aeson] Data.Aeson.Parser=attoparsec-aeson-2.2.2.0-3R0fTMXvK3710bMZ24kuaX:Data.Aeson.Parser,Data.Aeson.Parser.Internal=attoparsec-aeson-2.2.2.0-3R0fTMXvK3710bMZ24kuaX:Data.Aeson.Parser.Internal
1639.21 s
[attoparsec-aeson] Ready component graph:
1639.21 s
[attoparsec-aeson] definite attoparsec-aeson-2.2.2.0-3R0fTMXvK3710bMZ24kuaX
1639.21 s
[attoparsec-aeson] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.21 s
[attoparsec-aeson] depends attoparsec-0.14.4-C7aHI3pddOC9iYSiyhYSYZ
1639.21 s
[attoparsec-aeson] depends base-4.19.0.0-b960
1639.21 s
[attoparsec-aeson] depends bytestring-0.12.0.2-4690
1639.21 s
[attoparsec-aeson] depends character-ps-0.1-5NZ4UJdXHV93lSpc31BgaQ
1639.21 s
[attoparsec-aeson] depends integer-conversion-0.1.1-AEc8Mc86KpxKTurcpgT6s2
1639.21 s
[attoparsec-aeson] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.21 s
[attoparsec-aeson] depends scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1639.21 s
[attoparsec-aeson] depends text-2.1-c36a
1639.21 s
[attoparsec-aeson] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.21 s
[attoparsec-aeson] Using Cabal-3.10.2.0 compiled by ghc-9.8
1639.21 s
[attoparsec-aeson] Using compiler: ghc-9.8.1
1639.21 s
[attoparsec-aeson] Using install prefix:
1639.21 s
[attoparsec-aeson] /nix/store/jwz1sjq5mx2qzd09vc5md7zvkg7kbkjw-attoparsec-aeson-2.2.2.0
1639.21 s
[attoparsec-aeson] Executables installed in:
1639.21 s
[attoparsec-aeson] /nix/store/jwz1sjq5mx2qzd09vc5md7zvkg7kbkjw-attoparsec-aeson-2.2.2.0/bin
1639.21 s
[attoparsec-aeson] Libraries installed in:
1639.21 s
[attoparsec-aeson] /nix/store/jwz1sjq5mx2qzd09vc5md7zvkg7kbkjw-attoparsec-aeson-2.2.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/attoparsec-aeson-2.2.2.0-3R0fTMXvK3710bMZ24kuaX
1639.21 s
[attoparsec-aeson] Dynamic Libraries installed in:
1639.21 s
[attoparsec-aeson] /nix/store/jwz1sjq5mx2qzd09vc5md7zvkg7kbkjw-attoparsec-aeson-2.2.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1639.21 s
[attoparsec-aeson] Private executables installed in:
1639.21 s
[attoparsec-aeson] /nix/store/jwz1sjq5mx2qzd09vc5md7zvkg7kbkjw-attoparsec-aeson-2.2.2.0/libexec/x86_64-linux-ghc-9.8.1/attoparsec-aeson-2.2.2.0
1639.21 s
[attoparsec-aeson] Data files installed in:
1639.21 s
[attoparsec-aeson] /nix/store/jwz1sjq5mx2qzd09vc5md7zvkg7kbkjw-attoparsec-aeson-2.2.2.0/share/x86_64-linux-ghc-9.8.1/attoparsec-aeson-2.2.2.0
1639.21 s
[attoparsec-aeson] Documentation installed in:
1639.21 s
[attoparsec-aeson] /nix/store/c5r8g8hlv01ldcbmqxrw8i91x2rh4ml3-attoparsec-aeson-2.2.2.0-doc/share/doc/attoparsec-aeson-2.2.2.0
1639.21 s
[attoparsec-aeson] Configuration files installed in:
1639.21 s
[attoparsec-aeson] /nix/store/jwz1sjq5mx2qzd09vc5md7zvkg7kbkjw-attoparsec-aeson-2.2.2.0/etc
1639.21 s
[attoparsec-aeson] No alex found
1639.21 s
[attoparsec-aeson] Using ar found on system at:
1639.21 s
[attoparsec-aeson] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1639.21 s
[attoparsec-aeson] No c2hs found
1639.21 s
[attoparsec-aeson] No cpphs found
1639.21 s
[attoparsec-aeson] No doctest found
1639.21 s
[attoparsec-aeson] Using gcc version 14.3.0 given by user at:
1639.21 s
[attoparsec-aeson] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1639.21 s
[attoparsec-aeson] Using ghc version 9.8.1 found on system at:
1639.21 s
[binary-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
1639.21 s
[binary-instances] Phase: configurePhase
1639.21 s
[binary-instances] configureFlags: --verbose --prefix=/nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/0mq6h5i78pkchwslvz24gnjprbdm1g1h-binary-instances-1.0.6-doc/share/doc/binary-instances-1.0.6 --with-gcc=gcc --package-db=/build/tmp.3suPR34YFL/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --disable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1639.21 s
[binary-instances] Using Parsec parser
1639.21 s
[binary-instances] Configuring binary-instances-1.0.6...
1639.21 s
[binary-instances] Dependency aeson >=2.2.2.0 && <2.3: using aeson-2.2.3.0
1639.21 s
[binary-instances] Dependency base >=4.6.0.1 && <4.22: using base-4.19.0.0
1639.21 s
[binary-instances] Dependency binary >=0.5.1.1 && <0.8.10: using binary-0.8.9.1
1639.21 s
[binary-instances] Dependency binary-orphans >=1.0.5 && <1.1: using binary-orphans-1.0.5
1639.21 s
[binary-instances] Dependency case-insensitive >=1.2.1.0 && <1.2.2: using
1639.21 s
[binary-instances] case-insensitive-1.2.1.0
1639.21 s
[binary-instances] Dependency hashable >=1.4.4.0 && <1.5 || >=1.5.0.0 && <1.6: using
1639.21 s
[binary-instances] hashable-1.4.7.0
1639.21 s
[binary-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
1639.21 s
[binary-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
1639.21 s
[binary-instances] Dependency tagged >=0.8.8 && <0.8.10: using tagged-0.8.8
1639.21 s
[binary-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1
1639.21 s
[binary-instances] Dependency time-compat >=1.9.7 && <1.10: using time-compat-1.9.7
1639.21 s
[binary-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
1639.21 s
[binary-instances] unordered-containers-0.2.20
1639.21 s
[binary-instances] Dependency vector >=0.13.1.0 && <0.14: using vector-0.13.2.0
1639.21 s
[binary-instances] Dependency vector-binary-instances >=0.2.5.2 && <0.3: using
1639.21 s
[binary-instances] vector-binary-instances-0.2.5.2
1639.21 s
[binary-instances] Source component graph: component lib
1639.21 s
[binary-instances] Configured component graph:
1639.21 s
[binary-instances] component binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i
1639.21 s
[binary-instances] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.21 s
[binary-instances] include base-4.19.0.0-b960
1639.21 s
[binary-instances] include binary-0.8.9.1-0e3e
1639.21 s
[binary-instances] include binary-orphans-1.0.5-61ybqda84S3LOEZCUDvws7
1639.21 s
[binary-instances] include case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
1639.21 s
[binary-instances] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1639.21 s
[binary-instances] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.21 s
[binary-instances] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1639.21 s
[binary-instances] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1639.21 s
[binary-instances] include text-2.1-c36a
1639.21 s
[binary-instances] include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
1639.21 s
[binary-instances] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1639.21 s
[binary-instances] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.21 s
[binary-instances] include vector-binary-instances-0.2.5.2-13DxExfDkax1fM7oBxJISJ
1639.21 s
[binary-instances] Linked component graph:
1639.21 s
[binary-instances] unit binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i
1639.21 s
[binary-instances] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.21 s
[binary-instances] include base-4.19.0.0-b960
1639.21 s
[binary-instances] include binary-0.8.9.1-0e3e
1639.21 s
[binary-instances] include binary-orphans-1.0.5-61ybqda84S3LOEZCUDvws7
1639.21 s
[binary-instances] include case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
1639.21 s
[binary-instances] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1639.22 s
[binary-instances] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.22 s
[binary-instances] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1639.22 s
[binary-instances] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1639.22 s
[binary-instances] include text-2.1-c36a
1639.22 s
[binary-instances] include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
1639.22 s
[binary-instances] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1639.22 s
[binary-instances] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.22 s
[binary-instances] include vector-binary-instances-0.2.5.2-13DxExfDkax1fM7oBxJISJ
1639.22 s
[constraints-extras] Flags chosen: build-readme=True
1639.22 s
[constraints-extras] Dependency base >=4.9 && <4.23: using base-4.19.0.0
1639.22 s
[constraints-extras] Dependency constraints >=0.9 && <0.15: using constraints-0.14.2
1639.22 s
[constraints-extras] Dependency template-haskell >=2.11 && <2.24: using template-haskell-2.21.0.0
1639.22 s
[constraints-extras] Dependency aeson: using aeson-2.2.3.0
1639.22 s
[constraints-extras] Dependency base: using base-4.19.0.0
1639.22 s
[constraints-extras] Dependency constraints: using constraints-0.14.2
1639.22 s
[constraints-extras] Dependency constraints-extras: using constraints-extras-0.4.0.2
1639.22 s
[constraints-extras] Source component graph:
1639.22 s
[constraints-extras] component lib
1639.22 s
[constraints-extras] component exe:readme dependency lib
1639.22 s
[constraints-extras] Configured component graph:
1639.22 s
[constraints-extras] component constraints-extras-0.4.0.2-CBhGvzt6FDZAi7EEoGyDr1
1639.22 s
[constraints-extras] include base-4.19.0.0-b960
1639.22 s
[constraints-extras] include constraints-0.14.2-KUNuLo3MvfPCZVbsJ0eyhG
1639.22 s
[constraints-extras] include template-haskell-2.21.0.0-8831
1639.22 s
[constraints-extras] component constraints-extras-0.4.0.2-6NeQB4ppgQk8lj0iwUavDJ-readme
1639.22 s
[constraints-extras] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.22 s
[constraints-extras] include base-4.19.0.0-b960
1639.22 s
[constraints-extras] include constraints-0.14.2-KUNuLo3MvfPCZVbsJ0eyhG
1639.22 s
[constraints-extras] include constraints-extras-0.4.0.2-CBhGvzt6FDZAi7EEoGyDr1
1639.22 s
[constraints-extras] Linked component graph:
1639.22 s
[constraints-extras] unit constraints-extras-0.4.0.2-CBhGvzt6FDZAi7EEoGyDr1
1639.22 s
[constraints-extras] include base-4.19.0.0-b960
1639.22 s
[constraints-extras] include constraints-0.14.2-KUNuLo3MvfPCZVbsJ0eyhG
1639.22 s
[constraints-extras] include template-haskell-2.21.0.0-8831
1639.22 s
[constraints-extras] Data.Constraint.Compose=constraints-extras-0.4.0.2-CBhGvzt6FDZAi7EEoGyDr1:Data.Constraint.Compose,Data.Constraint.Extras=constraints-extras-0.4.0.2-CBhGvzt6FDZAi7EEoGyDr1:Data.Constraint.Extras,Data.Constraint.Extras.TH=constraints-extras-0.4.0.2-CBhGvzt6FDZAi7EEoGyDr1:Data.Constraint.Extras.TH,Data.Constraint.Flip=constraints-extras-0.4.0.2-CBhGvzt6FDZAi7EEoGyDr1:Data.Constraint.Flip
1639.22 s
[constraints-extras] unit constraints-extras-0.4.0.2-6NeQB4ppgQk8lj0iwUavDJ-readme
1639.22 s
[constraints-extras] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.22 s
[constraints-extras] include base-4.19.0.0-b960
1639.22 s
[constraints-extras] include constraints-0.14.2-KUNuLo3MvfPCZVbsJ0eyhG
1639.23 s
[constraints-extras] include constraints-extras-0.4.0.2-CBhGvzt6FDZAi7EEoGyDr1
1639.23 s
[constraints-extras] Ready component graph:
1639.23 s
[constraints-extras] definite constraints-extras-0.4.0.2-CBhGvzt6FDZAi7EEoGyDr1
1639.23 s
[constraints-extras] depends base-4.19.0.0-b960
1639.23 s
[constraints-extras] depends constraints-0.14.2-KUNuLo3MvfPCZVbsJ0eyhG
1639.23 s
[constraints-extras] depends template-haskell-2.21.0.0-8831
1639.23 s
[constraints-extras] definite constraints-extras-0.4.0.2-6NeQB4ppgQk8lj0iwUavDJ-readme
1639.23 s
[constraints-extras] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.23 s
[constraints-extras] depends base-4.19.0.0-b960
1639.23 s
[constraints-extras] depends constraints-0.14.2-KUNuLo3MvfPCZVbsJ0eyhG
1639.23 s
[constraints-extras] depends constraints-extras-0.4.0.2-CBhGvzt6FDZAi7EEoGyDr1
1639.23 s
[constraints-extras] Using Cabal-3.10.2.0 compiled by ghc-9.8
1639.23 s
[constraints-extras] Using compiler: ghc-9.8.1
1639.23 s
[constraints-extras] Using install prefix:
1639.23 s
[constraints-extras] /nix/store/avhd0nqxysf32zw4x2zsshgsqblgyzii-constraints-extras-0.4.0.2
1639.23 s
[constraints-extras] Executables installed in:
1639.23 s
[constraints-extras] /nix/store/avhd0nqxysf32zw4x2zsshgsqblgyzii-constraints-extras-0.4.0.2/bin
1639.23 s
[constraints-extras] Libraries installed in:
1639.23 s
[constraints-extras] /nix/store/avhd0nqxysf32zw4x2zsshgsqblgyzii-constraints-extras-0.4.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/constraints-extras-0.4.0.2-CBhGvzt6FDZAi7EEoGyDr1
1639.23 s
[constraints-extras] Dynamic Libraries installed in:
1639.23 s
[constraints-extras] /nix/store/avhd0nqxysf32zw4x2zsshgsqblgyzii-constraints-extras-0.4.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1639.23 s
[constraints-extras] Private executables installed in:
1639.23 s
[constraints-extras] /nix/store/avhd0nqxysf32zw4x2zsshgsqblgyzii-constraints-extras-0.4.0.2/libexec/x86_64-linux-ghc-9.8.1/constraints-extras-0.4.0.2
1639.23 s
[constraints-extras] Data files installed in:
1639.23 s
[constraints-extras] /nix/store/avhd0nqxysf32zw4x2zsshgsqblgyzii-constraints-extras-0.4.0.2/share/x86_64-linux-ghc-9.8.1/constraints-extras-0.4.0.2
1639.23 s
[constraints-extras] Documentation installed in:
1639.23 s
[constraints-extras] /nix/store/p07hq4lcx620qiwxmgpn2yi80qi6wx56-constraints-extras-0.4.0.2-doc/share/doc/constraints-extras-0.4.0.2
1639.23 s
[constraints-extras] Configuration files installed in:
1639.23 s
[constraints-extras] /nix/store/avhd0nqxysf32zw4x2zsshgsqblgyzii-constraints-extras-0.4.0.2/etc
1639.23 s
[constraints-extras] No alex found
1639.23 s
[constraints-extras] Using ar found on system at:
1639.23 s
[constraints-extras] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1639.23 s
[constraints-extras] No c2hs found
1639.23 s
[constraints-extras] No cpphs found
1639.23 s
[constraints-extras] No doctest found
1639.23 s
[constraints-extras] Using gcc version 14.3.0 given by user at:
1639.23 s
[constraints-extras] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1639.23 s
[constraints-extras] Using ghc version 9.8.1 found on system at:
1639.23 s
[constraints-extras] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1639.23 s
[constraints-extras] Using ghc-pkg version 9.8.1 found on system at:
1639.23 s
[constraints-extras] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1639.23 s
[constraints-extras] No ghcjs found
1639.23 s
[deriving-aeson] Phase: updateAutotoolsGnuConfigScriptsPhase
1639.23 s
[deriving-aeson] Phase: configurePhase
1639.23 s
[deriving-aeson] configureFlags: --verbose --prefix=/nix/store/pbbfq6jmjkamdbpp9zmdvjnkp3h16nzb-deriving-aeson-0.2.10 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/fzrg1x3rqiivvry8wcid6yw988ckspyi-deriving-aeson-0.2.10-doc/share/doc/deriving-aeson-0.2.10 --with-gcc=gcc --package-db=/build/tmp.V6oijdXB6z/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1639.23 s
[deriving-aeson] Using Parsec parser
1639.23 s
[deriving-aeson] Configuring deriving-aeson-0.2.10...
1639.23 s
[deriving-aeson] Dependency aeson >=1.4.7.0 && <2.3: using aeson-2.2.3.0
1639.23 s
[deriving-aeson] Dependency base >=4.12 && <5: using base-4.19.0.0
1639.23 s
[deriving-aeson] Dependency aeson: using aeson-2.2.3.0
1639.23 s
[deriving-aeson] Dependency base: using base-4.19.0.0
1639.23 s
[deriving-aeson] Dependency bytestring: using bytestring-0.12.0.2
1639.23 s
[deriving-aeson] Dependency deriving-aeson: using deriving-aeson-0.2.10
1639.23 s
[deriving-aeson] Source component graph:
1639.23 s
[deriving-aeson] component lib
1639.23 s
[deriving-aeson] component test:test dependency lib
1639.23 s
[deriving-aeson] Configured component graph:
1639.23 s
[deriving-aeson] component deriving-aeson-0.2.10-6RHmuanEpWH1lgvtVUMgnG
1639.23 s
[deriving-aeson] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.23 s
[deriving-aeson] include base-4.19.0.0-b960
1639.23 s
[deriving-aeson] component deriving-aeson-0.2.10-JGArHFF57Aa1ppxVslt8zZ-test
1639.23 s
[deriving-aeson] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.23 s
[deriving-aeson] include base-4.19.0.0-b960
1639.23 s
[deriving-aeson] include bytestring-0.12.0.2-4690
1639.23 s
[deriving-aeson] include deriving-aeson-0.2.10-6RHmuanEpWH1lgvtVUMgnG
1639.23 s
[deriving-aeson] Linked component graph:
1639.23 s
[deriving-aeson] unit deriving-aeson-0.2.10-6RHmuanEpWH1lgvtVUMgnG
1639.23 s
[deriving-aeson] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.23 s
[deriving-aeson] include base-4.19.0.0-b960
1639.23 s
[deriving-aeson] Deriving.Aeson=deriving-aeson-0.2.10-6RHmuanEpWH1lgvtVUMgnG:Deriving.Aeson,Deriving.Aeson.Stock=deriving-aeson-0.2.10-6RHmuanEpWH1lgvtVUMgnG:Deriving.Aeson.Stock
1639.23 s
[deriving-aeson] unit deriving-aeson-0.2.10-JGArHFF57Aa1ppxVslt8zZ-test
1639.23 s
[deriving-aeson] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.23 s
[deriving-aeson] include base-4.19.0.0-b960
1639.23 s
[deriving-aeson] include bytestring-0.12.0.2-4690
1639.23 s
[deriving-aeson] include deriving-aeson-0.2.10-6RHmuanEpWH1lgvtVUMgnG
1639.23 s
[deriving-aeson] Ready component graph:
1639.23 s
[deriving-aeson] definite deriving-aeson-0.2.10-6RHmuanEpWH1lgvtVUMgnG
1639.23 s
[deriving-aeson] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.23 s
[deriving-aeson] depends base-4.19.0.0-b960
1639.23 s
[deriving-aeson] definite deriving-aeson-0.2.10-JGArHFF57Aa1ppxVslt8zZ-test
1639.23 s
[deriving-aeson] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.23 s
[deriving-aeson] depends base-4.19.0.0-b960
1639.24 s
[deriving-aeson] depends bytestring-0.12.0.2-4690
1639.24 s
[deriving-aeson] depends deriving-aeson-0.2.10-6RHmuanEpWH1lgvtVUMgnG
1639.24 s
[deriving-aeson] Using Cabal-3.10.2.0 compiled by ghc-9.8
1639.24 s
[deriving-aeson] Using compiler: ghc-9.8.1
1639.24 s
[deriving-aeson] Using install prefix:
1639.24 s
[deriving-aeson] /nix/store/pbbfq6jmjkamdbpp9zmdvjnkp3h16nzb-deriving-aeson-0.2.10
1639.24 s
[deriving-aeson] Executables installed in:
1639.24 s
[deriving-aeson] /nix/store/pbbfq6jmjkamdbpp9zmdvjnkp3h16nzb-deriving-aeson-0.2.10/bin
1639.24 s
[deriving-aeson] Libraries installed in:
1639.24 s
[deriving-aeson] /nix/store/pbbfq6jmjkamdbpp9zmdvjnkp3h16nzb-deriving-aeson-0.2.10/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/deriving-aeson-0.2.10-6RHmuanEpWH1lgvtVUMgnG
1639.24 s
[deriving-aeson] Dynamic Libraries installed in:
1639.24 s
[deriving-aeson] /nix/store/pbbfq6jmjkamdbpp9zmdvjnkp3h16nzb-deriving-aeson-0.2.10/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1639.24 s
[deriving-aeson] Private executables installed in:
1639.24 s
[deriving-aeson] /nix/store/pbbfq6jmjkamdbpp9zmdvjnkp3h16nzb-deriving-aeson-0.2.10/libexec/x86_64-linux-ghc-9.8.1/deriving-aeson-0.2.10
1639.24 s
[deriving-aeson] Data files installed in:
1639.24 s
[deriving-aeson] /nix/store/pbbfq6jmjkamdbpp9zmdvjnkp3h16nzb-deriving-aeson-0.2.10/share/x86_64-linux-ghc-9.8.1/deriving-aeson-0.2.10
1639.24 s
[deriving-aeson] Documentation installed in:
1639.24 s
[doctest-discover] Phase: updateAutotoolsGnuConfigScriptsPhase
1639.24 s
[doctest-discover] Phase: configurePhase
1639.24 s
[doctest-discover] configureFlags: --verbose --prefix=/nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.cu6f9NnL2D/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --disable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/lib
1639.24 s
[doctest-discover] Using Parsec parser
1639.24 s
[doctest-discover] Configuring doctest-discover-0.2.0.0...
1639.24 s
[doctest-discover] Dependency aeson: using aeson-2.2.3.0
1639.24 s
[doctest-discover] Dependency base >=4.7 && <5: using base-4.19.0.0
1639.24 s
[doctest-discover] Dependency bytestring: using bytestring-0.12.0.2
1639.24 s
[doctest-discover] Dependency directory: using directory-1.3.8.1
1639.24 s
[doctest-discover] Dependency doctest: using doctest-0.22.6
1639.24 s
[doctest-discover] Dependency filepath: using filepath-1.4.100.4
1639.24 s
[doctest-discover] Dependency aeson: using aeson-2.2.3.0
1639.24 s
[doctest-discover] Dependency base >=4.7 && <5: using base-4.19.0.0
1639.24 s
[doctest-discover] Dependency bytestring: using bytestring-0.12.0.2
1639.24 s
[doctest-discover] Dependency directory: using directory-1.3.8.1
1639.24 s
[doctest-discover] Dependency doctest: using doctest-0.22.6
1639.24 s
[doctest-discover] Dependency filepath: using filepath-1.4.100.4
1639.24 s
[doctest-discover] Source component graph:
1639.24 s
[doctest-discover] component exe:doctest-discover
1639.24 s
[doctest-discover] component lib
1639.24 s
[doctest-discover] Configured component graph:
1639.24 s
[doctest-discover] component doctest-discover-0.2.0.0-6eTCXWyk0f9BQAfTjU75ze-doctest-discover
1639.24 s
[doctest-discover] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.24 s
[doctest-discover] include base-4.19.0.0-b960
1639.24 s
[doctest-discover] include bytestring-0.12.0.2-4690
1639.24 s
[doctest-discover] include directory-1.3.8.1-6a8e
1639.24 s
[doctest-discover] include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
1639.24 s
[doctest-discover] include filepath-1.4.100.4-fa1c
1639.24 s
[doctest-discover] component doctest-discover-0.2.0.0-Kspce9ghb8Y3s7cOogl3rI
1639.24 s
[doctest-discover] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.24 s
[doctest-discover] include base-4.19.0.0-b960
1639.24 s
[doctest-discover] include bytestring-0.12.0.2-4690
1639.24 s
[doctest-discover] include directory-1.3.8.1-6a8e
1639.24 s
[doctest-discover] include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
1639.24 s
[doctest-discover] include filepath-1.4.100.4-fa1c
1639.24 s
[doctest-discover] Linked component graph:
1639.24 s
[doctest-discover] unit doctest-discover-0.2.0.0-6eTCXWyk0f9BQAfTjU75ze-doctest-discover
1639.24 s
[doctest-discover] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.24 s
[doctest-discover] include base-4.19.0.0-b960
1639.24 s
[doctest-discover] include bytestring-0.12.0.2-4690
1639.24 s
[doctest-discover] include directory-1.3.8.1-6a8e
1639.24 s
[doctest-discover] include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
1639.25 s
[doctest-discover] include filepath-1.4.100.4-fa1c
1639.25 s
[doctest-discover] unit doctest-discover-0.2.0.0-Kspce9ghb8Y3s7cOogl3rI
1639.25 s
[doctest-discover] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.25 s
[doctest-discover] include base-4.19.0.0-b960
1639.25 s
[doctest-discover] include bytestring-0.12.0.2-4690
1639.25 s
[doctest-discover] include directory-1.3.8.1-6a8e
1639.25 s
[doctest-discover] include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
1639.25 s
[doctest-discover] include filepath-1.4.100.4-fa1c
1639.25 s
[doctest-discover] Ready component graph:
1639.25 s
[doctest-discover] definite doctest-discover-0.2.0.0-Kspce9ghb8Y3s7cOogl3rI
1639.25 s
[doctest-discover] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.25 s
[doctest-discover] depends base-4.19.0.0-b960
1639.25 s
[doctest-discover] depends bytestring-0.12.0.2-4690
1639.25 s
[doctest-discover] depends directory-1.3.8.1-6a8e
1639.25 s
[doctest-discover] depends doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
1639.25 s
[doctest-discover] depends filepath-1.4.100.4-fa1c
1639.25 s
[doctest-discover] definite doctest-discover-0.2.0.0-6eTCXWyk0f9BQAfTjU75ze-doctest-discover
1639.25 s
[doctest-discover] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.25 s
[doctest-discover] depends base-4.19.0.0-b960
1639.25 s
[doctest-discover] depends bytestring-0.12.0.2-4690
1639.25 s
[doctest-discover] depends directory-1.3.8.1-6a8e
1639.25 s
[doctest-discover] depends doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
1639.25 s
[doctest-discover] depends filepath-1.4.100.4-fa1c
1639.25 s
[doctest-discover] Using Cabal-3.10.2.0 compiled by ghc-9.8
1639.25 s
[doctest-discover] Using compiler: ghc-9.8.1
1639.25 s
[doctest-discover] Using install prefix:
1639.25 s
[enummapset] Phase: updateAutotoolsGnuConfigScriptsPhase
1639.25 s
[enummapset] Phase: configurePhase
1639.25 s
[enummapset] configureFlags: --verbose --prefix=/nix/store/cfv752y8aqh258m0xkwy95rp6c5b4ssl-enummapset-0.7.3.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/61ninz5fx4k4a0wdmgfxm53c6kg67q1a-enummapset-0.7.3.0-doc/share/doc/enummapset-0.7.3.0 --with-gcc=gcc --package-db=/build/tmp.sHed2qOi2K/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1639.25 s
[enummapset] Using Parsec parser
1639.25 s
[enummapset] Configuring enummapset-0.7.3.0...
1639.25 s
[enummapset] Flags chosen: debug=False
1639.25 s
[enummapset] Dependency aeson >=1.3 && <2.3: using aeson-2.2.3.0
1639.25 s
[enummapset] Dependency base >=4.6 && <5: using base-4.19.0.0
1639.25 s
[enummapset] Dependency containers >=0.5.11 && <0.8: using containers-0.6.8
1639.25 s
[enummapset] Dependency deepseq >=1.2 && <1.6: using deepseq-1.5.0.0
1639.25 s
[enummapset] Dependency HUnit: using HUnit-1.6.2.0
1639.25 s
[enummapset] Dependency QuickCheck >=2.7.1: using QuickCheck-2.14.3
1639.25 s
[enummapset] Dependency aeson: using aeson-2.2.3.0
1639.25 s
[enummapset] Dependency array >=0.4.0.0: using array-0.5.6.0
1639.25 s
[enummapset] Dependency base >=4.6 && <5: using base-4.19.0.0
1639.25 s
[enummapset] Dependency containers: using containers-0.6.8
1639.25 s
[enummapset] Dependency deepseq: using deepseq-1.5.0.0
1639.25 s
[enummapset] Dependency ghc-prim: using ghc-prim-0.11.0
1639.25 s
[enummapset] Dependency test-framework: using test-framework-0.8.2.2
1639.25 s
[enummapset] Dependency test-framework-hunit: using test-framework-hunit-0.3.0.2
1639.25 s
[enummapset] Dependency test-framework-quickcheck2: using
1639.25 s
[enummapset] test-framework-quickcheck2-0.3.0.6
1639.25 s
[enummapset] Source component graph:
1639.25 s
[enummapset] component test:intset-properties
1639.25 s
[enummapset] component lib
1639.25 s
[enummapset] Configured component graph:
1639.25 s
[enummapset] component enummapset-0.7.3.0-JaPRqc7QksNJmdaXFJ2Zj2-intset-properties
1639.25 s
[enummapset] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1639.25 s
[enummapset] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.25 s
[enummapset] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.25 s
[enummapset] include array-0.5.6.0-dc89
1639.25 s
[enummapset] include base-4.19.0.0-b960
1639.25 s
[enummapset] include containers-0.6.8-4775
1639.25 s
[enummapset] include deepseq-1.5.0.0-412f
1639.25 s
[enummapset] include ghc-prim-0.11.0-a69e
1639.25 s
[enummapset] include test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
1639.25 s
[enummapset] include test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm
1639.25 s
[enummapset] include test-framework-quickcheck2-0.3.0.6-5y38glI8Mym9b8R1xyZzcz
1639.25 s
[enummapset] component enummapset-0.7.3.0-At7csTVcExqDUoJlj7yCY8
1639.25 s
[enummapset] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.25 s
[enummapset] include base-4.19.0.0-b960
1639.25 s
[enummapset] include containers-0.6.8-4775
1639.25 s
[enummapset] include deepseq-1.5.0.0-412f
1639.25 s
[enummapset] Linked component graph:
1639.25 s
[enummapset] unit enummapset-0.7.3.0-JaPRqc7QksNJmdaXFJ2Zj2-intset-properties
1639.25 s
[enummapset] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1639.25 s
[enummapset] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.25 s
[enummapset] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.25 s
[enummapset] include array-0.5.6.0-dc89
1639.25 s
[enummapset] include base-4.19.0.0-b960
1639.25 s
[enummapset] include containers-0.6.8-4775
1639.25 s
[enummapset] include deepseq-1.5.0.0-412f
1639.25 s
[enummapset] include ghc-prim-0.11.0-a69e
1639.26 s
[enummapset] include test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
1639.26 s
[enummapset] include test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm
1639.26 s
[enummapset] include test-framework-quickcheck2-0.3.0.6-5y38glI8Mym9b8R1xyZzcz
1639.26 s
[enummapset] unit enummapset-0.7.3.0-At7csTVcExqDUoJlj7yCY8
1639.26 s
[enummapset] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.26 s
[enummapset] include base-4.19.0.0-b960
1639.26 s
[enummapset] include containers-0.6.8-4775
1639.26 s
[enummapset] include deepseq-1.5.0.0-412f
1639.26 s
[lens] [14 of 85] Compiling Control.Lens.Internal.Prism ( src/Control/Lens/Internal/Prism.hs, dist/build/Control/Lens/Internal/Prism.p_o )
1639.26 s
[lens] [15 of 85] Compiling Control.Lens.Internal.Profunctor ( src/Control/Lens/Internal/Profunctor.hs, dist/build/Control/Lens/Internal/Profunctor.p_o )
1639.26 s
[lens] [16 of 85] Compiling Control.Lens.Internal.Review ( src/Control/Lens/Internal/Review.hs, dist/build/Control/Lens/Internal/Review.p_o )
1639.26 s
[lens] [17 of 85] Compiling Control.Lens.Internal.Setter ( src/Control/Lens/Internal/Setter.hs, dist/build/Control/Lens/Internal/Setter.p_o )
1639.26 s
[lens] [18 of 85] Compiling Control.Lens.Internal.Zoom ( src/Control/Lens/Internal/Zoom.hs, dist/build/Control/Lens/Internal/Zoom.p_o )
1639.26 s
[lens] [19 of 85] Compiling Control.Lens.Internal ( src/Control/Lens/Internal.hs, dist/build/Control/Lens/Internal.p_o )
1639.26 s
[lens] [20 of 85] Compiling Control.Lens.Type ( src/Control/Lens/Type.hs, dist/build/Control/Lens/Type.p_o )
1639.26 s
[lens] [21 of 85] Compiling Control.Lens.Setter ( src/Control/Lens/Setter.hs, dist/build/Control/Lens/Setter.p_o )
1639.26 s
[lens] [22 of 85] Compiling Control.Lens.Lens ( src/Control/Lens/Lens.hs, dist/build/Control/Lens/Lens.p_o )
1639.26 s
[lens] [23 of 85] Compiling Control.Lens.Tuple ( src/Control/Lens/Tuple.hs, dist/build/Control/Lens/Tuple.p_o )
1639.26 s
[microaeson] Phase: updateAutotoolsGnuConfigScriptsPhase
1639.26 s
[microaeson] Phase: configurePhase
1639.26 s
[microaeson] configureFlags: --verbose --prefix=/nix/store/ahfgvdy8c4lmmpyr05r2z5arpac1634z-microaeson-0.1.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/nhm7psn67cyhl2ynip0i2hwx1an3y27y-microaeson-0.1.0.2-doc/share/doc/microaeson-0.1.0.2 --with-gcc=gcc --package-db=/build/tmp.9xjPRFznh7/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1639.26 s
[microaeson] Using Parsec parser
1639.26 s
[microaeson] Configuring microaeson-0.1.0.2...
1639.26 s
[microaeson] Dependency array >=0.5.1.1 && <0.6: using array-0.5.6.0
1639.26 s
[microaeson] Dependency base >=4.9.0.0 && <5: using base-4.19.0.0
1639.26 s
[microaeson] Dependency bytestring >=0.10.8.0 && <0.13: using bytestring-0.12.0.2
1639.26 s
[microaeson] Dependency containers >=0.5.7.1 && <1: using containers-0.6.8
1639.26 s
[microaeson] Dependency deepseq >=1.4.2.0 && <1.6: using deepseq-1.5.0.0
1639.26 s
[microaeson] Dependency fail >=4.9.0.0 && <4.10: using fail-4.9.0.0
1639.26 s
[microaeson] Dependency text >=1.2.2.2 && <1.3 || >=2.0 && <3: using text-2.1
1639.26 s
[microaeson] Dependency QuickCheck >=2.11.3 && <2.16: using QuickCheck-2.14.3
1639.26 s
[microaeson] Dependency aeson >=1.3.1.0 && <2.3: using aeson-2.2.3.0
1639.26 s
[microaeson] Dependency base: using base-4.19.0.0
1639.26 s
[microaeson] Dependency bytestring: using bytestring-0.12.0.2
1639.26 s
[microaeson] Dependency containers: using containers-0.6.8
1639.26 s
[microaeson] Dependency microaeson: using microaeson-0.1.0.2
1639.26 s
[microaeson] Dependency quickcheck-instances >=0.3.16 && <0.4: using
1639.26 s
[microaeson] quickcheck-instances-0.3.32
1639.26 s
[microaeson] Dependency tasty >=1.0.1.1 && <1.6: using tasty-1.5.3
1639.26 s
[microaeson] Dependency tasty-quickcheck >=0.10 && <1: using tasty-quickcheck-0.11
1639.26 s
[microaeson] Dependency text: using text-2.1
1639.26 s
[microaeson] Dependency unordered-containers >=0.2.8.0 && <0.3: using
1639.26 s
[microaeson] unordered-containers-0.2.20
1639.26 s
[microaeson] Dependency vector >=0.12.0.1 && <0.13 || >=0.13.0.0 && <0.14: using
1639.26 s
[microaeson] vector-0.13.2.0
1639.26 s
[microaeson] Source component graph:
1639.26 s
[microaeson] component lib
1639.26 s
[microaeson] component test:microaeson dependency lib
1639.26 s
[microaeson] Configured component graph:
1639.26 s
[microaeson] component microaeson-0.1.0.2-5UvXXCrS6PVHpaScZRd5m
1639.26 s
[microaeson] include array-0.5.6.0-dc89
1639.26 s
[microaeson] include base-4.19.0.0-b960
1639.26 s
[microaeson] include bytestring-0.12.0.2-4690
1639.26 s
[microaeson] include containers-0.6.8-4775
1639.26 s
[microaeson] include deepseq-1.5.0.0-412f
1639.26 s
[microaeson] include fail-4.9.0.0-BAHmj60kS5K7NVhhKpm9J5
1639.26 s
[microaeson] include text-2.1-c36a
1639.26 s
[microaeson] component microaeson-0.1.0.2-LFX1HiwyyqDCRd5n9mhimC-microaeson
1639.26 s
[microaeson] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.26 s
[microaeson] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.26 s
[microaeson] include base-4.19.0.0-b960
1639.26 s
[microaeson] include bytestring-0.12.0.2-4690
1639.26 s
[microaeson] include containers-0.6.8-4775
1639.26 s
[microaeson] include microaeson-0.1.0.2-5UvXXCrS6PVHpaScZRd5m
1639.26 s
[microaeson] include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
1639.26 s
[microaeson] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1639.26 s
[microaeson] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
1639.26 s
[microaeson] include text-2.1-c36a
1639.26 s
[microaeson] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1639.26 s
[microaeson] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.26 s
[microaeson] Linked component graph:
1639.26 s
[microaeson] unit microaeson-0.1.0.2-5UvXXCrS6PVHpaScZRd5m
1639.26 s
[microaeson] include array-0.5.6.0-dc89
1639.26 s
[microaeson] include base-4.19.0.0-b960
1639.26 s
[microaeson] include bytestring-0.12.0.2-4690
1639.26 s
[microaeson] include containers-0.6.8-4775
1639.26 s
[microaeson] include deepseq-1.5.0.0-412f
1639.26 s
[microaeson] include fail-4.9.0.0-BAHmj60kS5K7NVhhKpm9J5
1639.26 s
[microaeson] include text-2.1-c36a
1639.26 s
[microaeson] Data.Aeson.Micro=microaeson-0.1.0.2-5UvXXCrS6PVHpaScZRd5m:Data.Aeson.Micro
1639.26 s
[microaeson] unit microaeson-0.1.0.2-LFX1HiwyyqDCRd5n9mhimC-microaeson
1639.26 s
[path] Phase: updateAutotoolsGnuConfigScriptsPhase
1639.26 s
[path] Phase: configurePhase
1639.26 s
[path] configureFlags: --verbose --prefix=/nix/store/8l8kfl61bmswfj1a8h0n7azgrxd9fzs8-path-0.9.5 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/6lxg38633h4xvplvm145w89cbnkvicsd-path-0.9.5-doc/share/doc/path-0.9.5 --with-gcc=gcc --package-db=/build/tmp.1ZpmvKvDkB/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1639.26 s
[path] Using Parsec parser
1639.26 s
[path] Configuring path-0.9.5...
1639.26 s
[path] Flags chosen: dev=False
1639.26 s
[path] Dependency aeson: using aeson-2.2.3.0
1639.26 s
[path] Dependency base >=4.12 && <5: using base-4.19.0.0
1639.26 s
[path] Dependency deepseq: using deepseq-1.5.0.0
1639.26 s
[path] Dependency exceptions >=0.4 && <0.11: using exceptions-0.10.7
1639.26 s
[path] Dependency filepath <1.2.0.1 || >=1.3: using filepath-1.4.100.4
1639.26 s
[path] Dependency hashable >=1.2 && <1.5: using hashable-1.4.7.0
1639.26 s
[path] Dependency template-haskell: using template-haskell-2.21.0.0
1639.26 s
[path] Dependency text: using text-2.1
1639.26 s
[path] Dependency aeson: using aeson-2.2.3.0
1639.26 s
[path] Dependency base >=4.12 && <5: using base-4.19.0.0
1639.26 s
[path] Dependency bytestring: using bytestring-0.12.0.2
1639.26 s
[path] Dependency filepath <1.2.0.1 || >=1.3: using filepath-1.4.100.4
1639.26 s
[path] Dependency hspec >=2.0 && <3: using hspec-2.11.12
1639.26 s
[path] Dependency mtl >=2.0 && <3: using mtl-2.3.1
1639.26 s
[path] Dependency path: using path-0.9.5
1639.26 s
[path] Dependency template-haskell: using template-haskell-2.21.0.0
1639.26 s
[path] Dependency QuickCheck: using QuickCheck-2.14.3
1639.27 s
[path] Dependency aeson: using aeson-2.2.3.0
1639.27 s
[path] Dependency base >=4.12 && <5: using base-4.19.0.0
1639.27 s
[path] Dependency bytestring: using bytestring-0.12.0.2
1639.27 s
[path] Dependency filepath <1.2.0.1 || >=1.3: using filepath-1.4.100.4
1639.27 s
[path] Dependency genvalidity >=1.0: using genvalidity-1.1.1.0
1639.27 s
[path] Dependency genvalidity-hspec >=0.7: using genvalidity-hspec-1.0.0.3
1639.27 s
[path] Dependency genvalidity-property >=0.4: using genvalidity-property-1.0.0.0
1639.27 s
[path] Dependency hspec >=2.0 && <3: using hspec-2.11.12
1639.27 s
[path] Dependency mtl >=2.0 && <3: using mtl-2.3.1
1639.27 s
[path] Dependency path: using path-0.9.5
1639.27 s
[path] Dependency validity >=0.8.0.0: using validity-0.12.1.0
1639.27 s
[path] Source component graph:
1639.27 s
[path] component lib
1639.27 s
[path] component test:test dependency lib
1639.27 s
[path] component test:validity-test dependency lib
1639.27 s
[path] Configured component graph:
1639.27 s
[path] component path-0.9.5-LJKrh1JPplx9anWlAVM9D9
1639.27 s
[path] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.27 s
[path] include base-4.19.0.0-b960
1639.27 s
[path] include deepseq-1.5.0.0-412f
1639.27 s
[path] include exceptions-0.10.7-d3e7
1639.27 s
[path] include filepath-1.4.100.4-fa1c
1639.27 s
[path] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1639.27 s
[path] include template-haskell-2.21.0.0-8831
1639.27 s
[path] include text-2.1-c36a
1639.27 s
[path] component path-0.9.5-5xgMEwytiI92ecgD13mqa0-test
1639.27 s
[path] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.27 s
[path] include base-4.19.0.0-b960
1639.27 s
[path] include bytestring-0.12.0.2-4690
1639.27 s
[path] include filepath-1.4.100.4-fa1c
1639.27 s
[path] include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
1639.27 s
[path] include mtl-2.3.1-63a4
1639.27 s
[path] include path-0.9.5-LJKrh1JPplx9anWlAVM9D9
1639.27 s
[path] include template-haskell-2.21.0.0-8831
1639.27 s
[path] component path-0.9.5-CvfUTdZSrvDExosNiiswpx-validity-test
1639.27 s
[path] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.27 s
[path] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.27 s
[path] include base-4.19.0.0-b960
1639.27 s
[path] include bytestring-0.12.0.2-4690
1639.27 s
[path] include filepath-1.4.100.4-fa1c
1639.27 s
[path] include genvalidity-1.1.1.0-G9MzQHZulP320ETzLlBD0f
1639.27 s
[quickcheck-classes] Phase: setupCompilerEnvironmentPhase
1639.27 s
[quickcheck-classes] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1639.27 s
[quickcheck-classes] Phase: unpackPhase
1639.27 s
[quickcheck-classes] unpacking source archive /nix/store/70svcd4pr6fk316qgsjy75k11hfi1yhl-quickcheck-classes-0.6.5.0.tar.gz
1639.27 s
[quickcheck-classes] source root is quickcheck-classes-0.6.5.0
1639.27 s
[quickcheck-classes] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-classes-0.6.5.0/test/Spec/ShowRead.hs"
1639.27 s
[quickcheck-classes] Phase: patchPhase
1639.27 s
[quickcheck-classes] Replace Cabal file with edited version from mirror://hackage/quickcheck-classes-0.6.5.0/revision/3.cabal.
1639.27 s
[quickcheck-classes] Phase: compileBuildDriverPhase
1639.27 s
[quickcheck-classes] setupCompileFlags: -package-db=/build/tmp.XKbvIgUH8I/setup-package.conf.d -threaded
1639.27 s
[quickcheck-classes] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.XKbvIgUH8I/Main.o )
1639.27 s
[quickcheck-classes] [2 of 2] Linking Setup
1639.27 s
[quickcheck-classes] Phase: updateAutotoolsGnuConfigScriptsPhase
1639.27 s
[quickcheck-classes] Phase: configurePhase
1639.27 s
[quickcheck-classes] configureFlags: --verbose --prefix=/nix/store/0ix1pd63j0bkqidslf6chsvb6qzd4nqp-quickcheck-classes-0.6.5.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/n04cxm3v83r4kzyll36px3gfhp3jkgbb-quickcheck-classes-0.6.5.0-doc/share/doc/quickcheck-classes-0.6.5.0 --with-gcc=gcc --package-db=/build/tmp.XKbvIgUH8I/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1639.27 s
[quickcheck-classes] Using Parsec parser
1639.27 s
[quickcheck-classes] Configuring quickcheck-classes-0.6.5.0...
1639.27 s
[quickcheck-classes] Flags chosen: aeson=True, binary-laws=True, semigroupoids=True,
1639.28 s
[quickcheck-classes] semirings=True, unary-laws=True, vector=True
1639.28 s
[quickcheck-classes] Dependency QuickCheck >=2.10.0: using QuickCheck-2.14.3
1639.28 s
[quickcheck-classes] Dependency aeson >=0.9: using aeson-2.2.3.0
1639.28 s
[quickcheck-classes] Dependency base >=4.5 && <5: using base-4.19.0.0
1639.28 s
[quickcheck-classes] Dependency containers >=0.4.2.1: using containers-0.6.8
1639.28 s
[quickcheck-classes] Dependency primitive >=0.6.4 && <0.10: using primitive-0.9.1.0
1639.28 s
[quickcheck-classes] Dependency primitive-addr >=0.1.0.2 && <0.2: using primitive-addr-0.1.0.3
1639.28 s
[quickcheck-classes] Dependency quickcheck-classes-base >=0.6.2 && <0.7: using
1639.28 s
[quickcheck-classes] quickcheck-classes-base-0.6.2.0
1639.28 s
[quickcheck-classes] Dependency semigroupoids: using semigroupoids-6.0.1
1639.28 s
[quickcheck-classes] Dependency semirings >=0.4.2: using semirings-0.7
1639.28 s
[quickcheck-classes] Dependency transformers >=0.5.0 && <0.7: using transformers-0.6.1.0
1639.28 s
[quickcheck-classes] Dependency vector >=0.12: using vector-0.13.2.0
1639.28 s
[quickcheck-classes] Dependency QuickCheck: using QuickCheck-2.14.3
1639.28 s
[quickcheck-classes] Dependency aeson: using aeson-2.2.3.0
1639.28 s
[quickcheck-classes] Dependency base: using base-4.19.0.0
1639.28 s
[quickcheck-classes] Dependency base-orphans >=0.5: using base-orphans-0.9.3
1639.28 s
[quickcheck-classes] Dependency containers: using containers-0.6.8
1639.28 s
[quickcheck-classes] Dependency primitive: using primitive-0.9.1.0
1639.28 s
[quickcheck-classes] Dependency quickcheck-classes: using quickcheck-classes-0.6.5.0
1639.28 s
[quickcheck-classes] Dependency semigroupoids: using semigroupoids-6.0.1
1639.28 s
[quickcheck-classes] Dependency tagged: using tagged-0.8.8
1639.28 s
[quickcheck-classes] Dependency transformers: using transformers-0.6.1.0
1639.28 s
[quickcheck-classes] Dependency vector >=0.12: using vector-0.13.2.0
1639.28 s
[quickcheck-classes] Dependency QuickCheck: using QuickCheck-2.14.3
1639.28 s
[quickcheck-classes] Dependency base >=4.12: using base-4.19.0.0
1639.28 s
[quickcheck-classes] Dependency base-orphans >=0.5: using base-orphans-0.9.3
1639.28 s
[quickcheck-classes] Dependency containers: using containers-0.6.8
1639.28 s
[quickcheck-classes] Dependency primitive: using primitive-0.9.1.0
1639.28 s
[quickcheck-classes] Dependency quickcheck-classes: using quickcheck-classes-0.6.5.0
1639.28 s
[quickcheck-classes] Dependency tagged: using tagged-0.8.8
1639.28 s
[quickcheck-classes] Dependency tasty: using tasty-1.5.3
1639.28 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.28 s
[shake] by specifying the type/value namespace explicitly.
1639.28 s
[shake] Defaulting to the one defined at src/Development/Shake/Command.hs:509:1
1639.28 s
[shake] Warning: 'Exit' is ambiguous. It is defined
1639.28 s
[shake] * at src/Development/Shake/Command.hs:518:16
1639.28 s
[shake] * at src/Development/Shake/Command.hs:518:1
1639.28 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.28 s
[shake] by specifying the type/value namespace explicitly.
1639.28 s
[shake] Defaulting to the one defined at src/Development/Shake/Command.hs:518:1
1639.28 s
[shake] Warning: 'CmdLine' is ambiguous. It is defined
1639.28 s
[shake] * at src/Development/Shake/Command.hs:542:19
1639.28 s
[shake] * at src/Development/Shake/Command.hs:542:1
1639.28 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.28 s
[shake] by specifying the type/value namespace explicitly.
1639.28 s
[shake] Defaulting to the one defined at src/Development/Shake/Command.hs:542:1
1639.28 s
[shake] Warning: 'CmdTime' is ambiguous. It is defined
1639.28 s
[shake] * at src/Development/Shake/Command.hs:538:19
1639.28 s
[shake] * at src/Development/Shake/Command.hs:538:1
1639.28 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.28 s
[shake] by specifying the type/value namespace explicitly.
1639.28 s
[shake] Defaulting to the one defined at src/Development/Shake/Command.hs:538:1
1639.28 s
[shake] Warning: 'ByteString' is ambiguous. It is defined
1639.28 s
[shake] * in ‘Data.ByteString.Internal.Type’
1639.28 s
[shake] * in ‘Data.ByteString.Lazy.Internal’
1639.28 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.28 s
[shake] by specifying the type/value namespace explicitly.
1639.28 s
[shake] Defaulting to the one defined in ‘Data.ByteString.Lazy.Internal’
1639.28 s
[shake] Warning: 'StdoutTrim' is ambiguous. It is defined
1639.28 s
[shake] * at src/Development/Shake/Command.hs:504:24
1639.28 s
[shake] * at src/Development/Shake/Command.hs:504:1
1639.28 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.28 s
[shake] by specifying the type/value namespace explicitly.
1639.28 s
[shake] Defaulting to the one defined at src/Development/Shake/Command.hs:504:1
1639.28 s
[shake] Warning: 'CmdArgument' is ambiguous. It is defined
1639.28 s
[shake] * at src/Development/Shake/Command.hs:721:23
1639.28 s
[shake] * at src/Development/Shake/Command.hs:721:1
1639.28 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.28 s
[shake] by specifying the type/value namespace explicitly.
1639.28 s
[shake] Defaulting to the one defined at src/Development/Shake/Command.hs:721:1
1639.28 s
[shake] Warning: 'Action' is ambiguous. It is defined
1639.28 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:65:20
1639.28 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:65:1
1639.28 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.28 s
[shake] by specifying the type/value namespace explicitly.
1639.28 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Core/Types.hs:65:1
1639.28 s
[shake] 100% ( 24 / 24) in 'Development.Shake.Command'
1639.28 s
[shake] Warning: 'doesFileExist' is ambiguous. It is defined
1639.28 s
[shake] * in ‘System.Directory’
1639.28 s
[shake] * at src/Development/Shake/Internal/Rules/Directory.hs:176:1
1639.28 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.28 s
[shake] by specifying the type/value namespace explicitly.
1639.28 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Rules/Directory.hs:176:1
1639.28 s
[shake] Warning: 'doesDirectoryExist' is ambiguous. It is defined
1639.28 s
[shake] * in ‘System.Directory’
1639.28 s
[shake] * at src/Development/Shake/Internal/Rules/Directory.hs:184:1
1639.28 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.28 s
[shake] by specifying the type/value namespace explicitly.
1639.28 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Rules/Directory.hs:184:1
1639.28 s
[shake] Warning: 'getEnv' is ambiguous. It is defined
1639.28 s
[shake] * in ‘System.Environment’
1639.28 s
[shake] * at src/Development/Shake/Internal/Rules/Directory.hs:196:1
1639.28 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.28 s
[shake] by specifying the type/value namespace explicitly.
1639.28 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Rules/Directory.hs:196:1
1639.28 s
[shake] Warning: 'cmd' is out of scope.
1639.28 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.28 s
[shake] Warning: 'phony' is out of scope.
1639.28 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.28 s
[shake] Warning: 'shakeFiles' is out of scope.
1639.28 s
[HTF] include haskell-src-1.0.4.1-1lQI86ecaIUAoElc0pB2CK
1639.28 s
[HTF] include lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ
1639.28 s
[HTF] include monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
1639.28 s
[HTF] include mtl-2.3.1-63a4
1639.28 s
[HTF] include old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
1639.28 s
[HTF] include pretty-1.1.3.6-0c70
1639.28 s
[HTF] include process-1.6.18.0-26fa
1639.28 s
[HTF] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1639.28 s
[HTF] include regex-compat-0.95.2.2-7bidefGXMVCG2qJiDbfeWo
1639.28 s
[HTF] include text-2.1-c36a
1639.28 s
[HTF] include time-1.12.2-d26d
1639.28 s
[HTF] include unix-2.8.3.0-8aa6
1639.28 s
[HTF] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.28 s
[HTF] include xmlgen-0.6.2.2-DJtxksEno4uBwwEuRLqyk4
1639.28 s
[HTF] Test.Framework=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework,Test.Framework.AssertM=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.AssertM,Test.Framework.BlackBoxTest=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.BlackBoxTest,Test.Framework.HUnitWrapper=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.HUnitWrapper,Test.Framework.History=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.History,Test.Framework.JsonOutput=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.JsonOutput,Test.Framework.Location=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.Location,Test.Framework.Preprocessor=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.Preprocessor,Test.Framework.Pretty=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.Pretty,Test.Framework.PrettyHaskell=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.PrettyHaskell,Test.Framework.QuickCheckWrapper=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.QuickCheckWrapper,Test.Framework.TestInterface=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.TestInterface,Test.Framework.TestManager=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.TestManager,Test.Framework.TestTypes=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.TestTypes,Test.Framework.ThreadPool=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.ThreadPool,Test.Framework.Tutorial=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.Tutorial,Test.Framework.XmlOutput=HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA:Test.Framework.XmlOutput
1639.28 s
[HTF] unit HTF-0.15.0.2-GcDWKGxFAyyLK6BrVBhjlu-htfpp
1639.28 s
[HTF] include HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA
1639.28 s
[HTF] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1639.28 s
[HTF] include array-0.5.6.0-dc89
1639.28 s
[HTF] include base-4.19.0.0-b960
1639.28 s
[HTF] include cpphs-1.20.9.1-E9p97sJCo9vBonNKfkaXhU
1639.28 s
[HTF] include directory-1.3.8.1-6a8e
1639.29 s
[HTF] include mtl-2.3.1-63a4
1639.29 s
[HTF] include old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
1639.29 s
[HTF] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1639.29 s
[HTF] include text-2.1-c36a
1639.29 s
[HTF] Ready component graph:
1639.29 s
[HTF] definite HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA
1639.29 s
[HTF] depends Diff-0.5-4nPoK53PkizD5e0dTbCPv7
1639.29 s
[HTF] depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1639.29 s
[HTF] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.29 s
[HTF] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.29 s
[HTF] depends array-0.5.6.0-dc89
1639.29 s
[HTF] depends base-4.19.0.0-b960
1639.29 s
[HTF] depends base64-bytestring-1.2.1.0-1qR3QVAtzfk4y9K7iqu3ou
1639.29 s
[HTF] depends bytestring-0.12.0.2-4690
1639.29 s
[HTF] depends containers-0.6.8-4775
1639.29 s
[HTF] depends cpphs-1.20.9.1-E9p97sJCo9vBonNKfkaXhU
1639.29 s
[HTF] depends directory-1.3.8.1-6a8e
1639.29 s
[HTF] depends haskell-src-1.0.4.1-1lQI86ecaIUAoElc0pB2CK
1639.29 s
[HTF] depends lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ
1639.29 s
[HTF] depends monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
1639.29 s
[HTF] depends mtl-2.3.1-63a4
1639.29 s
[HTF] depends old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
1639.29 s
[HTF] depends pretty-1.1.3.6-0c70
1639.29 s
[HTF] depends process-1.6.18.0-26fa
1639.29 s
[HTF] depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1639.29 s
[HTF] depends regex-compat-0.95.2.2-7bidefGXMVCG2qJiDbfeWo
1639.29 s
[HTF] depends text-2.1-c36a
1639.29 s
[HTF] depends time-1.12.2-d26d
1639.29 s
[HTF] depends unix-2.8.3.0-8aa6
1639.29 s
[HTF] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.29 s
[HTF] depends xmlgen-0.6.2.2-DJtxksEno4uBwwEuRLqyk4
1639.29 s
[HTF] definite HTF-0.15.0.2-GcDWKGxFAyyLK6BrVBhjlu-htfpp
1639.29 s
[HTF] depends HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA
1639.29 s
[HTF] depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1639.29 s
[HTF] depends array-0.5.6.0-dc89
1639.29 s
[HTF] depends base-4.19.0.0-b960
1639.29 s
[HsYAML-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1639.29 s
[HsYAML-aeson] No ghcjs found
1639.29 s
[HsYAML-aeson] No ghcjs-pkg found
1639.29 s
[HsYAML-aeson] No greencard found
1639.29 s
[HsYAML-aeson] Using haddock version 2.30.0 found on system at:
1639.29 s
[HsYAML-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1639.29 s
[HsYAML-aeson] No happy found
1639.29 s
[HsYAML-aeson] Using haskell-suite found on system at: haskell-suite-dummy-location
1639.29 s
[HsYAML-aeson] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1639.29 s
[HsYAML-aeson] No hmake found
1639.29 s
[HsYAML-aeson] Using hpc version 0.69 found on system at:
1639.29 s
[HsYAML-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1639.29 s
[HsYAML-aeson] Using hsc2hs version 0.68.10 found on system at:
1639.29 s
[HsYAML-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1639.29 s
[HsYAML-aeson] Using hscolour version 1.25 found on system at:
1639.29 s
[HsYAML-aeson] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1639.29 s
[HsYAML-aeson] No jhc found
1639.29 s
[HsYAML-aeson] Using ld found on system at:
1639.29 s
[HsYAML-aeson] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1639.29 s
[HsYAML-aeson] No pkg-config found
1639.29 s
[HsYAML-aeson] Using runghc version 9.8.1 found on system at:
1639.29 s
[HsYAML-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1639.29 s
[HsYAML-aeson] Using strip version 2.44 found on system at:
1639.29 s
[HsYAML-aeson] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1639.29 s
[HsYAML-aeson] Using tar found on system at:
1639.29 s
[HsYAML-aeson] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1639.29 s
[HsYAML-aeson] No uhc found
1639.29 s
[HsYAML-aeson] Phase: buildPhase
1639.29 s
[HsYAML-aeson] Preprocessing library for HsYAML-aeson-0.2.0.2..
1639.29 s
[HsYAML-aeson] Building library for HsYAML-aeson-0.2.0.2..
1639.29 s
[HsYAML-aeson] [1 of 1] Compiling Data.YAML.Aeson ( src/Data/YAML/Aeson.hs, dist/build/Data/YAML/Aeson.o, dist/build/Data/YAML/Aeson.dyn_o )
1639.30 s
[HsYAML-aeson] [1 of 1] Compiling Data.YAML.Aeson ( src/Data/YAML/Aeson.hs, dist/build/Data/YAML/Aeson.p_o )
1639.30 s
[attoparsec-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1639.30 s
[attoparsec-aeson] Using ghc-pkg version 9.8.1 found on system at:
1639.30 s
[attoparsec-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1639.30 s
[attoparsec-aeson] No ghcjs found
1639.30 s
[attoparsec-aeson] No ghcjs-pkg found
1639.30 s
[attoparsec-aeson] No greencard found
1639.30 s
[attoparsec-aeson] Using haddock version 2.30.0 found on system at:
1639.30 s
[attoparsec-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1639.30 s
[attoparsec-aeson] No happy found
1639.30 s
[attoparsec-aeson] Using haskell-suite found on system at: haskell-suite-dummy-location
1639.30 s
[attoparsec-aeson] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1639.30 s
[attoparsec-aeson] No hmake found
1639.30 s
[attoparsec-aeson] Using hpc version 0.69 found on system at:
1639.30 s
[attoparsec-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1639.30 s
[attoparsec-aeson] Using hsc2hs version 0.68.10 found on system at:
1639.30 s
[attoparsec-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1639.30 s
[attoparsec-aeson] Using hscolour version 1.25 found on system at:
1639.30 s
[attoparsec-aeson] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1639.30 s
[attoparsec-aeson] No jhc found
1639.30 s
[attoparsec-aeson] Using ld found on system at:
1639.30 s
[attoparsec-aeson] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1639.30 s
[attoparsec-aeson] No pkg-config found
1639.30 s
[attoparsec-aeson] Using runghc version 9.8.1 found on system at:
1639.30 s
[attoparsec-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1639.30 s
[attoparsec-aeson] Using strip version 2.44 found on system at:
1639.30 s
[attoparsec-aeson] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1639.30 s
[attoparsec-aeson] Using tar found on system at:
1639.30 s
[attoparsec-aeson] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1639.30 s
[attoparsec-aeson] No uhc found
1639.30 s
[attoparsec-aeson] Phase: buildPhase
1639.30 s
[attoparsec-aeson] Preprocessing library for attoparsec-aeson-2.2.2.0..
1639.30 s
[attoparsec-aeson] Building library for attoparsec-aeson-2.2.2.0..
1639.30 s
[attoparsec-aeson] [1 of 4] Compiling Data.Aeson.Internal.ByteString ( src/Data/Aeson/Internal/ByteString.hs, dist/build/Data/Aeson/Internal/ByteString.o, dist/build/Data/Aeson/Internal/ByteString.dyn_o )
1639.30 s
[attoparsec-aeson] [2 of 4] Compiling Data.Aeson.Internal.Text ( src/Data/Aeson/Internal/Text.hs, dist/build/Data/Aeson/Internal/Text.o, dist/build/Data/Aeson/Internal/Text.dyn_o )
1639.30 s
[attoparsec-aeson] [3 of 4] Compiling Data.Aeson.Parser.Internal ( src/Data/Aeson/Parser/Internal.hs, dist/build/Data/Aeson/Parser/Internal.o, dist/build/Data/Aeson/Parser/Internal.dyn_o )
1639.30 s
[binary-instances] Data.Binary.Instances=binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i:Data.Binary.Instances,Data.Binary.Instances.Aeson=binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i:Data.Binary.Instances.Aeson,Data.Binary.Instances.CaseInsensitive=binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i:Data.Binary.Instances.CaseInsensitive,Data.Binary.Instances.Hashable=binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i:Data.Binary.Instances.Hashable,Data.Binary.Instances.Primitive=binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i:Data.Binary.Instances.Primitive,Data.Binary.Instances.Scientific=binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i:Data.Binary.Instances.Scientific,Data.Binary.Instances.Tagged=binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i:Data.Binary.Instances.Tagged,Data.Binary.Instances.Text=binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i:Data.Binary.Instances.Text,Data.Binary.Instances.Time=binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i:Data.Binary.Instances.Time,Data.Binary.Instances.UnorderedContainers=binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i:Data.Binary.Instances.UnorderedContainers,Data.Binary.Instances.Vector=binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i:Data.Binary.Instances.Vector
1639.30 s
[binary-instances] Ready component graph:
1639.30 s
[binary-instances] definite binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i
1639.30 s
[binary-instances] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.30 s
[binary-instances] depends base-4.19.0.0-b960
1639.30 s
[binary-instances] depends binary-0.8.9.1-0e3e
1639.30 s
[binary-instances] depends binary-orphans-1.0.5-61ybqda84S3LOEZCUDvws7
1639.30 s
[binary-instances] depends case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
1639.30 s
[binary-instances] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1639.30 s
[binary-instances] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.30 s
[binary-instances] depends scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1639.30 s
[binary-instances] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1639.30 s
[binary-instances] depends text-2.1-c36a
1639.30 s
[binary-instances] depends time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
1639.30 s
[binary-instances] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1639.30 s
[binary-instances] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.30 s
[binary-instances] depends vector-binary-instances-0.2.5.2-13DxExfDkax1fM7oBxJISJ
1639.30 s
[binary-instances] Using Cabal-3.10.2.0 compiled by ghc-9.8
1639.30 s
[binary-instances] Using compiler: ghc-9.8.1
1639.30 s
[binary-instances] Using install prefix:
1639.30 s
[binary-instances] /nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6
1639.30 s
[binary-instances] Executables installed in:
1639.30 s
[binary-instances] /nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6/bin
1639.30 s
[binary-instances] Libraries installed in:
1639.30 s
[binary-instances] /nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i
1639.30 s
[binary-instances] Dynamic Libraries installed in:
1639.30 s
[binary-instances] /nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1639.30 s
[binary-instances] Private executables installed in:
1639.30 s
[binary-instances] /nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6/libexec/x86_64-linux-ghc-9.8.1/binary-instances-1.0.6
1639.30 s
[binary-instances] Data files installed in:
1639.30 s
[binary-instances] /nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6/share/x86_64-linux-ghc-9.8.1/binary-instances-1.0.6
1639.30 s
[binary-instances] Documentation installed in:
1639.30 s
[binary-instances] /nix/store/0mq6h5i78pkchwslvz24gnjprbdm1g1h-binary-instances-1.0.6-doc/share/doc/binary-instances-1.0.6
1639.30 s
[binary-instances] Configuration files installed in:
1639.30 s
[binary-instances] /nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6/etc
1639.30 s
[binary-instances] No alex found
1639.30 s
[binary-instances] Using ar found on system at:
1639.30 s
[binary-instances] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1639.30 s
[binary-instances] No c2hs found
1639.30 s
[binary-instances] No cpphs found
1639.30 s
[binary-instances] No doctest found
1639.30 s
[binary-instances] Using gcc version 14.3.0 given by user at:
1639.30 s
[binary-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1639.30 s
[binary-instances] Using ghc version 9.8.1 found on system at:
1639.30 s
[binary-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1639.30 s
[binary-instances] Using ghc-pkg version 9.8.1 found on system at:
1639.30 s
[binary-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1639.30 s
[binary-instances] No ghcjs found
1639.30 s
[binary-instances] No ghcjs-pkg found
1639.30 s
[binary-instances] No greencard found
1639.30 s
[binary-instances] Using haddock version 2.30.0 found on system at:
1639.30 s
[binary-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1639.30 s
[binary-instances] No happy found
1639.30 s
[binary-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
1639.30 s
[binary-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1639.30 s
[binary-instances] No hmake found
1639.30 s
[binary-instances] Using hpc version 0.69 found on system at:
1639.30 s
[binary-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1639.30 s
[binary-instances] Using hsc2hs version 0.68.10 found on system at:
1639.30 s
[constraints-extras] No ghcjs-pkg found
1639.30 s
[constraints-extras] No greencard found
1639.30 s
[constraints-extras] Using haddock version 2.30.0 found on system at:
1639.30 s
[constraints-extras] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1639.30 s
[constraints-extras] No happy found
1639.31 s
[constraints-extras] Using haskell-suite found on system at: haskell-suite-dummy-location
1639.31 s
[constraints-extras] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1639.31 s
[constraints-extras] No hmake found
1639.31 s
[constraints-extras] Using hpc version 0.69 found on system at:
1639.31 s
[constraints-extras] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1639.31 s
[constraints-extras] Using hsc2hs version 0.68.10 found on system at:
1639.31 s
[constraints-extras] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1639.31 s
[constraints-extras] Using hscolour version 1.25 found on system at:
1639.31 s
[constraints-extras] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1639.31 s
[constraints-extras] No jhc found
1639.31 s
[constraints-extras] Using ld found on system at:
1639.31 s
[constraints-extras] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1639.31 s
[constraints-extras] No pkg-config found
1639.31 s
[constraints-extras] Using runghc version 9.8.1 found on system at:
1639.31 s
[constraints-extras] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1639.31 s
[constraints-extras] Using strip version 2.44 found on system at:
1639.31 s
[constraints-extras] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1639.31 s
[constraints-extras] Using tar found on system at:
1639.31 s
[constraints-extras] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1639.31 s
[constraints-extras] No uhc found
1639.31 s
[constraints-extras] Phase: buildPhase
1639.31 s
[constraints-extras] Preprocessing library for constraints-extras-0.4.0.2..
1639.31 s
[constraints-extras] Building library for constraints-extras-0.4.0.2..
1639.31 s
[constraints-extras] [1 of 4] Compiling Data.Constraint.Compose ( src/Data/Constraint/Compose.hs, dist/build/Data/Constraint/Compose.o, dist/build/Data/Constraint/Compose.dyn_o )
1639.31 s
[constraints-extras] [2 of 4] Compiling Data.Constraint.Flip ( src/Data/Constraint/Flip.hs, dist/build/Data/Constraint/Flip.o, dist/build/Data/Constraint/Flip.dyn_o )
1639.31 s
[constraints-extras] [3 of 4] Compiling Data.Constraint.Extras ( src/Data/Constraint/Extras.hs, dist/build/Data/Constraint/Extras.o, dist/build/Data/Constraint/Extras.dyn_o )
1639.31 s
[constraints-extras] [4 of 4] Compiling Data.Constraint.Extras.TH ( src/Data/Constraint/Extras/TH.hs, dist/build/Data/Constraint/Extras/TH.o, dist/build/Data/Constraint/Extras/TH.dyn_o )
1639.31 s
[deriving-aeson] /nix/store/fzrg1x3rqiivvry8wcid6yw988ckspyi-deriving-aeson-0.2.10-doc/share/doc/deriving-aeson-0.2.10
1639.31 s
[deriving-aeson] Configuration files installed in:
1639.31 s
[deriving-aeson] /nix/store/pbbfq6jmjkamdbpp9zmdvjnkp3h16nzb-deriving-aeson-0.2.10/etc
1639.31 s
[deriving-aeson] No alex found
1639.31 s
[deriving-aeson] Using ar found on system at:
1639.31 s
[deriving-aeson] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1639.31 s
[deriving-aeson] No c2hs found
1639.31 s
[deriving-aeson] No cpphs found
1639.31 s
[deriving-aeson] No doctest found
1639.31 s
[deriving-aeson] Using gcc version 14.3.0 given by user at:
1639.31 s
[deriving-aeson] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1639.31 s
[deriving-aeson] Using ghc version 9.8.1 found on system at:
1639.31 s
[deriving-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1639.31 s
[deriving-aeson] Using ghc-pkg version 9.8.1 found on system at:
1639.31 s
[deriving-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1639.31 s
[deriving-aeson] No ghcjs found
1639.31 s
[deriving-aeson] No ghcjs-pkg found
1639.31 s
[deriving-aeson] No greencard found
1639.31 s
[deriving-aeson] Using haddock version 2.30.0 found on system at:
1639.31 s
[deriving-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1639.31 s
[deriving-aeson] No happy found
1639.31 s
[deriving-aeson] Using haskell-suite found on system at: haskell-suite-dummy-location
1639.31 s
[deriving-aeson] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1639.31 s
[deriving-aeson] No hmake found
1639.31 s
[deriving-aeson] Using hpc version 0.69 found on system at:
1639.31 s
[deriving-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1639.31 s
[deriving-aeson] Using hsc2hs version 0.68.10 found on system at:
1639.31 s
[deriving-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1639.31 s
[deriving-aeson] Using hscolour version 1.25 found on system at:
1639.31 s
[deriving-aeson] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1639.31 s
[deriving-aeson] No jhc found
1639.31 s
[deriving-aeson] Using ld found on system at:
1639.31 s
[deriving-aeson] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1639.31 s
[deriving-aeson] No pkg-config found
1639.31 s
[deriving-aeson] Using runghc version 9.8.1 found on system at:
1639.31 s
[deriving-aeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1639.31 s
[deriving-aeson] Using strip version 2.44 found on system at:
1639.31 s
[deriving-aeson] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1639.31 s
[deriving-aeson] Using tar found on system at:
1639.31 s
[deriving-aeson] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1639.31 s
[deriving-aeson] No uhc found
1639.31 s
[deriving-aeson] Phase: buildPhase
1639.31 s
[deriving-aeson] Preprocessing library for deriving-aeson-0.2.10..
1639.31 s
[deriving-aeson] Building library for deriving-aeson-0.2.10..
1639.31 s
[deriving-aeson] [1 of 2] Compiling Deriving.Aeson ( src/Deriving/Aeson.hs, dist/build/Deriving/Aeson.o, dist/build/Deriving/Aeson.dyn_o )
1639.31 s
[deriving-aeson] [2 of 2] Compiling Deriving.Aeson.Stock ( src/Deriving/Aeson/Stock.hs, dist/build/Deriving/Aeson/Stock.o, dist/build/Deriving/Aeson/Stock.dyn_o )
1639.31 s
[deriving-aeson] [1 of 2] Compiling Deriving.Aeson ( src/Deriving/Aeson.hs, dist/build/Deriving/Aeson.p_o )
1639.31 s
[doctest-discover] /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0
1639.31 s
[doctest-discover] Executables installed in:
1639.31 s
[doctest-discover] /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0/bin
1639.31 s
[doctest-discover] Libraries installed in:
1639.31 s
[doctest-discover] /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/doctest-discover-0.2.0.0-Kspce9ghb8Y3s7cOogl3rI
1639.31 s
[doctest-discover] Dynamic Libraries installed in:
1639.31 s
[doctest-discover] /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1639.31 s
[doctest-discover] Private executables installed in:
1639.31 s
[doctest-discover] /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0/libexec/x86_64-linux-ghc-9.8.1/doctest-discover-0.2.0.0
1639.31 s
[doctest-discover] Data files installed in:
1639.31 s
[doctest-discover] /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0/share/x86_64-linux-ghc-9.8.1/doctest-discover-0.2.0.0
1639.31 s
[doctest-discover] Documentation installed in:
1639.31 s
[doctest-discover] /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0/share/doc/x86_64-linux-ghc-9.8.1/doctest-discover-0.2.0.0
1639.31 s
[doctest-discover] Configuration files installed in:
1639.31 s
[doctest-discover] /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0/etc
1639.31 s
[doctest-discover] No alex found
1639.31 s
[doctest-discover] Using ar found on system at:
1639.31 s
[doctest-discover] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1639.31 s
[doctest-discover] No c2hs found
1639.31 s
[doctest-discover] No cpphs found
1639.31 s
[doctest-discover] Using doctest version 0.22.6 found on system at:
1639.31 s
[doctest-discover] /nix/store/5b1p4pwqjyd7hm6rr4ill4mcxhy3cgwg-doctest-0.22.6/bin/doctest
1639.31 s
[doctest-discover] Using gcc version 14.3.0 given by user at:
1639.31 s
[doctest-discover] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1639.31 s
[doctest-discover] Using ghc version 9.8.1 found on system at:
1639.31 s
[doctest-discover] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1639.31 s
[doctest-discover] Using ghc-pkg version 9.8.1 found on system at:
1639.31 s
[doctest-discover] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1639.31 s
[doctest-discover] No ghcjs found
1639.32 s
[doctest-discover] No ghcjs-pkg found
1639.32 s
[doctest-discover] No greencard found
1639.32 s
[doctest-discover] Using haddock version 2.30.0 found on system at:
1639.32 s
[doctest-discover] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1639.32 s
[doctest-discover] No happy found
1639.32 s
[doctest-discover] Using haskell-suite found on system at: haskell-suite-dummy-location
1639.32 s
[doctest-discover] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1639.32 s
[doctest-discover] No hmake found
1639.32 s
[doctest-discover] Using hpc version 0.69 found on system at:
1639.32 s
[doctest-discover] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1639.32 s
[doctest-discover] Using hsc2hs version 0.68.10 found on system at:
1639.32 s
[doctest-discover] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1639.32 s
[doctest-discover] Using hscolour version 1.25 found on system at:
1639.32 s
[doctest-discover] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1639.32 s
[doctest-discover] No jhc found
1639.32 s
[doctest-discover] Using ld found on system at:
1639.32 s
[doctest-discover] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1639.32 s
[doctest-discover] No pkg-config found
1639.32 s
[doctest-discover] Using runghc version 9.8.1 found on system at:
1639.32 s
[doctest-discover] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1639.32 s
[doctest-discover] Using strip version 2.44 found on system at:
1639.32 s
[doctest-discover] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1639.32 s
[doctest-discover] Using tar found on system at:
1639.32 s
[doctest-discover] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1639.32 s
[doctest-discover] No uhc found
1639.32 s
[doctest-discover] Phase: buildPhase
1639.32 s
[doctest-discover] Preprocessing library for doctest-discover-0.2.0.0..
1639.32 s
[doctest-discover] Building library for doctest-discover-0.2.0.0..
1639.32 s
[doctest-discover] Preprocessing executable 'doctest-discover' for doctest-discover-0.2.0.0..
1639.32 s
[doctest-discover] Building executable 'doctest-discover' for doctest-discover-0.2.0.0..
1639.32 s
[doctest-discover] [1 of 3] Compiling Config ( src/Config.hs, dist/build/doctest-discover/doctest-discover-tmp/Config.o )
1639.32 s
[doctest-discover] [2 of 3] Compiling Runner ( src/Runner.hs, dist/build/doctest-discover/doctest-discover-tmp/Runner.o )
1639.32 s
[doctest-discover] [3 of 3] Compiling Main ( src/Main.hs, dist/build/doctest-discover/doctest-discover-tmp/Main.o )
1639.32 s
[enummapset] Data.EnumMap=enummapset-0.7.3.0-At7csTVcExqDUoJlj7yCY8:Data.EnumMap,Data.EnumMap.Lazy=enummapset-0.7.3.0-At7csTVcExqDUoJlj7yCY8:Data.EnumMap.Lazy,Data.EnumMap.Strict=enummapset-0.7.3.0-At7csTVcExqDUoJlj7yCY8:Data.EnumMap.Strict,Data.EnumSet=enummapset-0.7.3.0-At7csTVcExqDUoJlj7yCY8:Data.EnumSet
1639.32 s
[enummapset] Ready component graph:
1639.32 s
[enummapset] definite enummapset-0.7.3.0-JaPRqc7QksNJmdaXFJ2Zj2-intset-properties
1639.32 s
[enummapset] depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
1639.32 s
[enummapset] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.32 s
[enummapset] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.32 s
[enummapset] depends array-0.5.6.0-dc89
1639.32 s
[enummapset] depends base-4.19.0.0-b960
1639.32 s
[enummapset] depends containers-0.6.8-4775
1639.32 s
[enummapset] depends deepseq-1.5.0.0-412f
1639.32 s
[enummapset] depends ghc-prim-0.11.0-a69e
1639.32 s
[enummapset] depends test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
1639.32 s
[enummapset] depends test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm
1639.32 s
[enummapset] depends test-framework-quickcheck2-0.3.0.6-5y38glI8Mym9b8R1xyZzcz
1639.32 s
[enummapset] definite enummapset-0.7.3.0-At7csTVcExqDUoJlj7yCY8
1639.32 s
[enummapset] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.32 s
[enummapset] depends base-4.19.0.0-b960
1639.32 s
[enummapset] depends containers-0.6.8-4775
1639.32 s
[enummapset] depends deepseq-1.5.0.0-412f
1639.32 s
[enummapset] Using Cabal-3.10.2.0 compiled by ghc-9.8
1639.32 s
[enummapset] Using compiler: ghc-9.8.1
1639.32 s
[enummapset] Using install prefix:
1639.32 s
[enummapset] /nix/store/cfv752y8aqh258m0xkwy95rp6c5b4ssl-enummapset-0.7.3.0
1639.32 s
[enummapset] Executables installed in:
1639.32 s
[enummapset] /nix/store/cfv752y8aqh258m0xkwy95rp6c5b4ssl-enummapset-0.7.3.0/bin
1639.32 s
[enummapset] Libraries installed in:
1639.32 s
[enummapset] /nix/store/cfv752y8aqh258m0xkwy95rp6c5b4ssl-enummapset-0.7.3.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/enummapset-0.7.3.0-At7csTVcExqDUoJlj7yCY8
1639.32 s
[enummapset] Dynamic Libraries installed in:
1639.32 s
[enummapset] /nix/store/cfv752y8aqh258m0xkwy95rp6c5b4ssl-enummapset-0.7.3.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1639.32 s
[enummapset] Private executables installed in:
1639.32 s
[enummapset] /nix/store/cfv752y8aqh258m0xkwy95rp6c5b4ssl-enummapset-0.7.3.0/libexec/x86_64-linux-ghc-9.8.1/enummapset-0.7.3.0
1639.32 s
[enummapset] Data files installed in:
1639.32 s
[enummapset] /nix/store/cfv752y8aqh258m0xkwy95rp6c5b4ssl-enummapset-0.7.3.0/share/x86_64-linux-ghc-9.8.1/enummapset-0.7.3.0
1639.32 s
[enummapset] Documentation installed in:
1639.32 s
[enummapset] /nix/store/61ninz5fx4k4a0wdmgfxm53c6kg67q1a-enummapset-0.7.3.0-doc/share/doc/enummapset-0.7.3.0
1639.32 s
[enummapset] Configuration files installed in:
1639.32 s
[enummapset] /nix/store/cfv752y8aqh258m0xkwy95rp6c5b4ssl-enummapset-0.7.3.0/etc
1639.32 s
[enummapset] No alex found
1639.32 s
[enummapset] Using ar found on system at:
1639.32 s
[enummapset] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1639.32 s
[enummapset] No c2hs found
1639.32 s
[enummapset] No cpphs found
1639.32 s
[enummapset] No doctest found
1639.32 s
[enummapset] Using gcc version 14.3.0 given by user at:
1639.32 s
[enummapset] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1639.32 s
[enummapset] Using ghc version 9.8.1 found on system at:
1639.32 s
[enummapset] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1639.32 s
[enummapset] Using ghc-pkg version 9.8.1 found on system at:
1639.32 s
[enummapset] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1639.32 s
[enummapset] No ghcjs found
1639.32 s
[enummapset] No ghcjs-pkg found
1639.32 s
[enummapset] No greencard found
1639.32 s
[enummapset] Using haddock version 2.30.0 found on system at:
1639.32 s
[enummapset] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1639.32 s
[enummapset] No happy found
1639.32 s
[enummapset] Using haskell-suite found on system at: haskell-suite-dummy-location
1639.32 s
[enummapset] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1639.32 s
[enummapset] No hmake found
1639.32 s
[enummapset] Using hpc version 0.69 found on system at:
1639.32 s
[enummapset] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1639.32 s
[enummapset] Using hsc2hs version 0.68.10 found on system at:
1639.32 s
[enummapset] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1639.32 s
[enummapset] Using hscolour version 1.25 found on system at:
1639.32 s
[enummapset] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1639.32 s
[enummapset] No jhc found
1639.32 s
[enummapset] Using ld found on system at:
1639.32 s
[enummapset] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1639.32 s
[enummapset] No pkg-config found
1639.32 s
[enummapset] Using runghc version 9.8.1 found on system at:
1639.32 s
[enummapset] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1639.32 s
[enummapset] Using strip version 2.44 found on system at:
1639.32 s
[enummapset] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1639.32 s
[enummapset] Using tar found on system at:
1639.32 s
[enummapset] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1639.32 s
[enummapset] No uhc found
1639.32 s
[enummapset] Phase: buildPhase
1639.32 s
[enummapset] Preprocessing test suite 'intset-properties' for enummapset-0.7.3.0..
1639.32 s
[enummapset] Building test suite 'intset-properties' for enummapset-0.7.3.0..
1639.32 s
[microaeson] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.32 s
[microaeson] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.32 s
[microaeson] include base-4.19.0.0-b960
1639.32 s
[microaeson] include bytestring-0.12.0.2-4690
1639.32 s
[microaeson] include containers-0.6.8-4775
1639.32 s
[microaeson] include microaeson-0.1.0.2-5UvXXCrS6PVHpaScZRd5m
1639.32 s
[microaeson] include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
1639.32 s
[microaeson] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1639.32 s
[microaeson] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
1639.32 s
[microaeson] include text-2.1-c36a
1639.32 s
[microaeson] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1639.32 s
[microaeson] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.32 s
[microaeson] Ready component graph:
1639.32 s
[microaeson] definite microaeson-0.1.0.2-5UvXXCrS6PVHpaScZRd5m
1639.32 s
[microaeson] depends array-0.5.6.0-dc89
1639.32 s
[microaeson] depends base-4.19.0.0-b960
1639.32 s
[microaeson] depends bytestring-0.12.0.2-4690
1639.32 s
[microaeson] depends containers-0.6.8-4775
1639.32 s
[microaeson] depends deepseq-1.5.0.0-412f
1639.32 s
[microaeson] depends fail-4.9.0.0-BAHmj60kS5K7NVhhKpm9J5
1639.32 s
[microaeson] depends text-2.1-c36a
1639.32 s
[microaeson] definite microaeson-0.1.0.2-LFX1HiwyyqDCRd5n9mhimC-microaeson
1639.32 s
[microaeson] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.32 s
[microaeson] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.32 s
[microaeson] depends base-4.19.0.0-b960
1639.32 s
[microaeson] depends bytestring-0.12.0.2-4690
1639.33 s
[microaeson] depends containers-0.6.8-4775
1639.33 s
[microaeson] depends microaeson-0.1.0.2-5UvXXCrS6PVHpaScZRd5m
1639.33 s
[microaeson] depends quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
1639.33 s
[microaeson] depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1639.33 s
[microaeson] depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
1639.33 s
[microaeson] depends text-2.1-c36a
1639.33 s
[microaeson] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1639.33 s
[microaeson] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.33 s
[microaeson] Using Cabal-3.10.2.0 compiled by ghc-9.8
1639.33 s
[microaeson] Using compiler: ghc-9.8.1
1639.33 s
[microaeson] Using install prefix:
1639.33 s
[microaeson] /nix/store/ahfgvdy8c4lmmpyr05r2z5arpac1634z-microaeson-0.1.0.2
1639.33 s
[microaeson] Executables installed in:
1639.33 s
[microaeson] /nix/store/ahfgvdy8c4lmmpyr05r2z5arpac1634z-microaeson-0.1.0.2/bin
1639.33 s
[microaeson] Libraries installed in:
1639.33 s
[microaeson] /nix/store/ahfgvdy8c4lmmpyr05r2z5arpac1634z-microaeson-0.1.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/microaeson-0.1.0.2-5UvXXCrS6PVHpaScZRd5m
1639.33 s
[microaeson] Dynamic Libraries installed in:
1639.33 s
[microaeson] /nix/store/ahfgvdy8c4lmmpyr05r2z5arpac1634z-microaeson-0.1.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1639.33 s
[microaeson] Private executables installed in:
1639.33 s
[microaeson] /nix/store/ahfgvdy8c4lmmpyr05r2z5arpac1634z-microaeson-0.1.0.2/libexec/x86_64-linux-ghc-9.8.1/microaeson-0.1.0.2
1639.33 s
[microaeson] Data files installed in:
1639.33 s
[microaeson] /nix/store/ahfgvdy8c4lmmpyr05r2z5arpac1634z-microaeson-0.1.0.2/share/x86_64-linux-ghc-9.8.1/microaeson-0.1.0.2
1639.33 s
[microaeson] Documentation installed in:
1639.33 s
[microaeson] /nix/store/nhm7psn67cyhl2ynip0i2hwx1an3y27y-microaeson-0.1.0.2-doc/share/doc/microaeson-0.1.0.2
1639.33 s
[microaeson] Configuration files installed in:
1639.33 s
[microaeson] /nix/store/ahfgvdy8c4lmmpyr05r2z5arpac1634z-microaeson-0.1.0.2/etc
1639.33 s
[microaeson] Using alex version 3.5.3.0 found on system at:
1639.33 s
[microaeson] /nix/store/whdwmjaiqdrd3y3pms6a2p80i6ai01yi-alex-3.5.3.0/bin/alex
1639.33 s
[microaeson] Using ar found on system at:
1639.33 s
[microaeson] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1639.33 s
[microaeson] No c2hs found
1639.33 s
[microaeson] No cpphs found
1639.33 s
[microaeson] No doctest found
1639.33 s
[microaeson] Using gcc version 14.3.0 given by user at:
1639.33 s
[microaeson] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1639.33 s
[microaeson] Using ghc version 9.8.1 found on system at:
1639.33 s
[microaeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1639.33 s
[microaeson] Using ghc-pkg version 9.8.1 found on system at:
1639.33 s
[microaeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1639.33 s
[microaeson] No ghcjs found
1639.33 s
[microaeson] No ghcjs-pkg found
1639.33 s
[microaeson] No greencard found
1639.33 s
[microaeson] Using haddock version 2.30.0 found on system at:
1639.33 s
[microaeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1639.33 s
[microaeson] No happy found
1639.33 s
[microaeson] Using haskell-suite found on system at: haskell-suite-dummy-location
1639.33 s
[microaeson] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1639.33 s
[microaeson] No hmake found
1639.33 s
[microaeson] Using hpc version 0.69 found on system at:
1639.33 s
[microaeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1639.33 s
[microaeson] Using hsc2hs version 0.68.10 found on system at:
1639.33 s
[microaeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1639.33 s
[microaeson] Using hscolour version 1.25 found on system at:
1639.33 s
[microaeson] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1639.33 s
[microaeson] No jhc found
1639.33 s
[microaeson] Using ld found on system at:
1639.33 s
[path] include genvalidity-hspec-1.0.0.3-495IM0jG3t89DOsLBvnrWV
1639.33 s
[path] include genvalidity-property-1.0.0.0-86f4QlnnP2bGKNNkhr8gFT
1639.33 s
[path] include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
1639.33 s
[path] include mtl-2.3.1-63a4
1639.33 s
[path] include path-0.9.5-LJKrh1JPplx9anWlAVM9D9
1639.33 s
[path] include validity-0.12.1.0-KxQEzJRkac7TmqtKHjLfC
1639.33 s
[path] Linked component graph:
1639.33 s
[path] unit path-0.9.5-LJKrh1JPplx9anWlAVM9D9
1639.33 s
[path] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.33 s
[path] include base-4.19.0.0-b960
1639.33 s
[path] include deepseq-1.5.0.0-412f
1639.33 s
[path] include exceptions-0.10.7-d3e7
1639.33 s
[path] include filepath-1.4.100.4-fa1c
1639.33 s
[path] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1639.33 s
[path] include template-haskell-2.21.0.0-8831
1639.33 s
[path] include text-2.1-c36a
1639.33 s
[path] Path=path-0.9.5-LJKrh1JPplx9anWlAVM9D9:Path,Path.Internal=path-0.9.5-LJKrh1JPplx9anWlAVM9D9:Path.Internal,Path.Internal.Posix=path-0.9.5-LJKrh1JPplx9anWlAVM9D9:Path.Internal.Posix,Path.Internal.Windows=path-0.9.5-LJKrh1JPplx9anWlAVM9D9:Path.Internal.Windows,Path.Posix=path-0.9.5-LJKrh1JPplx9anWlAVM9D9:Path.Posix,Path.Windows=path-0.9.5-LJKrh1JPplx9anWlAVM9D9:Path.Windows
1639.33 s
[path] unit path-0.9.5-5xgMEwytiI92ecgD13mqa0-test
1639.33 s
[path] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.33 s
[path] include base-4.19.0.0-b960
1639.33 s
[path] include bytestring-0.12.0.2-4690
1639.33 s
[path] include filepath-1.4.100.4-fa1c
1639.33 s
[path] include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
1639.33 s
[path] include mtl-2.3.1-63a4
1639.33 s
[path] include path-0.9.5-LJKrh1JPplx9anWlAVM9D9
1639.33 s
[path] include template-haskell-2.21.0.0-8831
1639.33 s
[path] unit path-0.9.5-CvfUTdZSrvDExosNiiswpx-validity-test
1639.33 s
[path] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.33 s
[path] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.33 s
[path] include base-4.19.0.0-b960
1639.33 s
[path] include bytestring-0.12.0.2-4690
1639.33 s
[path] include filepath-1.4.100.4-fa1c
1639.33 s
[path] include genvalidity-1.1.1.0-G9MzQHZulP320ETzLlBD0f
1639.33 s
[path] include genvalidity-hspec-1.0.0.3-495IM0jG3t89DOsLBvnrWV
1639.33 s
[path] include genvalidity-property-1.0.0.0-86f4QlnnP2bGKNNkhr8gFT
1639.33 s
[path] include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
1639.33 s
[path] include mtl-2.3.1-63a4
1639.33 s
[path] include path-0.9.5-LJKrh1JPplx9anWlAVM9D9
1639.33 s
[path] include validity-0.12.1.0-KxQEzJRkac7TmqtKHjLfC
1639.33 s
[path] Ready component graph:
1639.33 s
[path] definite path-0.9.5-LJKrh1JPplx9anWlAVM9D9
1639.33 s
[path] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.33 s
[path] depends base-4.19.0.0-b960
1639.33 s
[path] depends deepseq-1.5.0.0-412f
1639.34 s
[path] depends exceptions-0.10.7-d3e7
1639.34 s
[path] depends filepath-1.4.100.4-fa1c
1639.34 s
[path] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1639.34 s
[path] depends template-haskell-2.21.0.0-8831
1639.34 s
[path] depends text-2.1-c36a
1639.34 s
[path] definite path-0.9.5-CvfUTdZSrvDExosNiiswpx-validity-test
1639.34 s
[path] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.34 s
[path] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.34 s
[path] depends base-4.19.0.0-b960
1639.34 s
[path] depends bytestring-0.12.0.2-4690
1639.34 s
[path] depends filepath-1.4.100.4-fa1c
1639.34 s
[path] depends genvalidity-1.1.1.0-G9MzQHZulP320ETzLlBD0f
1639.34 s
[path] depends genvalidity-hspec-1.0.0.3-495IM0jG3t89DOsLBvnrWV
1639.34 s
[path] depends genvalidity-property-1.0.0.0-86f4QlnnP2bGKNNkhr8gFT
1639.34 s
[path] depends hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
1639.34 s
[path] depends mtl-2.3.1-63a4
1639.34 s
[path] depends path-0.9.5-LJKrh1JPplx9anWlAVM9D9
1639.34 s
[path] depends validity-0.12.1.0-KxQEzJRkac7TmqtKHjLfC
1639.34 s
[path] definite path-0.9.5-5xgMEwytiI92ecgD13mqa0-test
1639.34 s
[path] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.34 s
[path] depends base-4.19.0.0-b960
1639.34 s
[path] depends bytestring-0.12.0.2-4690
1639.34 s
[path] depends filepath-1.4.100.4-fa1c
1639.34 s
[path] depends hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
1639.34 s
[path] depends mtl-2.3.1-63a4
1639.34 s
[path] depends path-0.9.5-LJKrh1JPplx9anWlAVM9D9
1639.34 s
[path] depends template-haskell-2.21.0.0-8831
1639.34 s
[path] Using Cabal-3.10.2.0 compiled by ghc-9.8
1639.34 s
[path] Using compiler: ghc-9.8.1
1639.34 s
[path] Using install prefix: /nix/store/8l8kfl61bmswfj1a8h0n7azgrxd9fzs8-path-0.9.5
1639.34 s
[path] Executables installed in:
1639.34 s
[path] /nix/store/8l8kfl61bmswfj1a8h0n7azgrxd9fzs8-path-0.9.5/bin
1639.34 s
[path] Libraries installed in:
1639.34 s
[path] /nix/store/8l8kfl61bmswfj1a8h0n7azgrxd9fzs8-path-0.9.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/path-0.9.5-LJKrh1JPplx9anWlAVM9D9
1639.34 s
[path] Dynamic Libraries installed in:
1639.34 s
[quickcheck-classes] Dependency tasty-quickcheck: using tasty-quickcheck-0.11
1639.34 s
[quickcheck-classes] Dependency transformers: using transformers-0.6.1.0
1639.34 s
[quickcheck-classes] Dependency vector: using vector-0.13.2.0
1639.34 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.34 s
[shake] Warning: 'ShakeOptions' is ambiguous. It is defined
1639.34 s
[shake] * at src/Development/Shake/Internal/Options.hs:137:21
1639.34 s
[shake] * at src/Development/Shake/Internal/Options.hs:137:1
1639.34 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.34 s
[shake] by specifying the type/value namespace explicitly.
1639.34 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Options.hs:137:1
1639.34 s
[shake] Warning: 'ShakeDatabase' is ambiguous. It is defined
1639.34 s
[shake] * at src/Development/Shake/Database.hs:52:22
1639.34 s
[shake] * at src/Development/Shake/Database.hs:52:1
1639.34 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.34 s
[shake] by specifying the type/value namespace explicitly.
1639.34 s
[shake] Defaulting to the one defined at src/Development/Shake/Database.hs:52:1
1639.34 s
[shake] Warning: 'SomeException' is ambiguous. It is defined
1639.34 s
[shake] * in ‘GHC.Exception.Type’
1639.34 s
[shake] * in ‘GHC.Exception.Type’
1639.34 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.34 s
[shake] by specifying the type/value namespace explicitly.
1639.34 s
[shake] Defaulting to the one defined in ‘GHC.Exception.Type’
1639.34 s
[shake] Warning: 'ShakeException' is ambiguous. It is defined
1639.34 s
[shake] * at src/Development/Shake/Internal/Errors.hs:130:23
1639.34 s
[shake] * at src/Development/Shake/Internal/Errors.hs:130:1
1639.34 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.34 s
[shake] by specifying the type/value namespace explicitly.
1639.34 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Errors.hs:130:1
1639.34 s
[shake] Warning: 'Action' is ambiguous. It is defined
1639.34 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:65:20
1639.34 s
[shake] * at src/Development/Shake/Internal/Core/Types.hs:65:1
1639.34 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.34 s
[shake] by specifying the type/value namespace explicitly.
1639.34 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Core/Types.hs:65:1
1639.34 s
[shake] 100% ( 10 / 10) in 'Development.Shake.Database'
1639.34 s
[shake] Warning: 'ShakeOptions' is ambiguous. It is defined
1639.34 s
[shake] * at src/Development/Shake/Internal/Options.hs:137:21
1639.34 s
[shake] * at src/Development/Shake/Internal/Options.hs:137:1
1639.34 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.34 s
[shake] by specifying the type/value namespace explicitly.
1639.34 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Options.hs:137:1
1639.34 s
[shake] Warning: 'cmd' is out of scope.
1639.34 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.34 s
[shake] Warning: 'Binary' is out of scope.
1639.34 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.34 s
[shake] Warning: 'Hashable' is out of scope.
1639.34 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.34 s
[shake] Warning: 'NFData' is out of scope.
1639.34 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.34 s
[shake] 100% (173 /173) in 'Development.Shake'
1639.34 s
[shake] 100% ( 7 / 7) in 'Development.Shake.Util'
1639.34 s
[shake] Warning: 'ShakeOptions' is ambiguous. It is defined
1639.34 s
[shake] * at src/Development/Shake/Internal/Options.hs:137:21
1639.34 s
[shake] * at src/Development/Shake/Internal/Options.hs:137:1
1639.34 s
[shake] You may be able to disambiguate the identifier by qualifying it or
1639.34 s
[shake] by specifying the type/value namespace explicitly.
1639.34 s
[shake] Defaulting to the one defined at src/Development/Shake/Internal/Options.hs:137:1
1639.34 s
[shake] 100% ( 8 / 8) in 'Development.Shake.Forward'
1639.34 s
[shake] Warning: '-<.>' is out of scope.
1639.34 s
[shake] If you qualify the identifier, haddock can try to link it anyway.
1639.34 s
[shake] 100% ( 7 / 7) in 'Development.Shake.Config'
1639.34 s
[shake] Warning: Development.Shake.Classes: could not find link destinations for:
1639.34 s
[shake] - GHC.IOPort.IOPort
1639.34 s
[shake] - Data.ByteString.Builder.RealFloat.FormatMode
1639.34 s
[shake] - Control.DeepSeq.GNFData
1639.35 s
[shake] - System.FilePattern.Core.Path
1639.35 s
[shake] - System.FilePattern.Core.Pattern
1639.35 s
[shake] - Control.DeepSeq.Zero
1639.35 s
[shake] - Data.List.Extra.RB
1639.35 s
[shake] - System.Time.Extra.Timeout
1639.35 s
[shake] - Data.Heap.Forest
1639.35 s
[shake] - Data.Heap.Tree
1639.35 s
[shake] - GHC.IOPort.IOPortException
1639.35 s
[shake] Warning: Development.Shake.Command: could not find link destinations for:
1639.35 s
[shake] - Development.Shake.Command.cmdResult
1639.35 s
[shake] - Development.Shake.Command.Unit
1639.35 s
[shake] - Development.Shake.Command.cmdString
1639.35 s
[shake] - Development.Shake.Command.Result
1639.35 s
[shake] - Development.Shake.Command.Str
1639.35 s
[shake] Warning: Development.Shake: could not find link destinations for:
1639.35 s
[shake] - General.Extra.Located
1639.35 s
[shake] - Development.Shake.Internal.Options.Hidden
1639.35 s
[HTF] depends cpphs-1.20.9.1-E9p97sJCo9vBonNKfkaXhU
1639.35 s
[HTF] depends directory-1.3.8.1-6a8e
1639.35 s
[HTF] depends mtl-2.3.1-63a4
1639.35 s
[HTF] depends old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
1639.35 s
[HTF] depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
1639.35 s
[HTF] depends text-2.1-c36a
1639.35 s
[HTF] Using Cabal-3.10.2.0 compiled by ghc-9.8
1639.35 s
[HTF] Using compiler: ghc-9.8.1
1639.35 s
[HTF] Using install prefix: /nix/store/h1prxycrl278ln7f0yfyjfnxi8q3801y-HTF-0.15.0.2
1639.35 s
[HTF] Executables installed in:
1639.35 s
[HTF] /nix/store/h1prxycrl278ln7f0yfyjfnxi8q3801y-HTF-0.15.0.2/bin
1639.35 s
[HTF] Libraries installed in:
1639.35 s
[HTF] /nix/store/h1prxycrl278ln7f0yfyjfnxi8q3801y-HTF-0.15.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/HTF-0.15.0.2-Icng5aSL6omD7QnmWwN8NA
1639.35 s
[HTF] Dynamic Libraries installed in:
1639.35 s
[HTF] /nix/store/h1prxycrl278ln7f0yfyjfnxi8q3801y-HTF-0.15.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1639.35 s
[HTF] Private executables installed in:
1639.35 s
[HTF] /nix/store/h1prxycrl278ln7f0yfyjfnxi8q3801y-HTF-0.15.0.2/libexec/x86_64-linux-ghc-9.8.1/HTF-0.15.0.2
1639.35 s
[HTF] Data files installed in:
1639.35 s
[HTF] /nix/store/h1prxycrl278ln7f0yfyjfnxi8q3801y-HTF-0.15.0.2/share/x86_64-linux-ghc-9.8.1/HTF-0.15.0.2
1639.35 s
[HTF] Documentation installed in:
1639.35 s
[HTF] /nix/store/ib0zwkg6dg1bk0k7wir4vfvzm55qh5fy-HTF-0.15.0.2-doc/share/doc/HTF-0.15.0.2
1639.35 s
[HTF] Configuration files installed in:
1639.35 s
[HTF] /nix/store/h1prxycrl278ln7f0yfyjfnxi8q3801y-HTF-0.15.0.2/etc
1639.35 s
[HTF] No alex found
1639.35 s
[HTF] Using ar found on system at:
1639.35 s
[HTF] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1639.35 s
[HTF] No c2hs found
1639.35 s
[HTF] Using cpphs version 1.20.9 found on system at:
1639.35 s
[HTF] /nix/store/v81zi8dgm8d6635cj6lmx2d2m376afsv-cpphs-1.20.9.1/bin/cpphs
1639.35 s
[HTF] No doctest found
1639.35 s
[HTF] Using gcc version 14.3.0 given by user at:
1639.35 s
[HTF] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1639.35 s
[HTF] Using ghc version 9.8.1 found on system at:
1639.35 s
[HTF] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1639.35 s
[HTF] Using ghc-pkg version 9.8.1 found on system at:
1639.35 s
[HTF] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1639.35 s
[HTF] No ghcjs found
1639.35 s
[HTF] No ghcjs-pkg found
1639.35 s
[HTF] No greencard found
1639.35 s
[HTF] Using haddock version 2.30.0 found on system at:
1639.35 s
[HTF] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1639.35 s
[HTF] No happy found
1639.35 s
[HTF] Using haskell-suite found on system at: haskell-suite-dummy-location
1639.35 s
[HTF] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1639.35 s
[HTF] No hmake found
1639.35 s
[HTF] Using hpc version 0.69 found on system at:
1639.35 s
[HTF] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1639.35 s
[HTF] Using hsc2hs version 0.68.10 found on system at:
1639.35 s
[HTF] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1639.35 s
[HTF] Using hscolour version 1.25 found on system at:
1639.35 s
[HTF] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1639.35 s
[HTF] No jhc found
1639.35 s
[HTF] Using ld found on system at:
1639.35 s
[HTF] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1639.35 s
[HTF] No pkg-config found
1639.35 s
[HTF] Using runghc version 9.8.1 found on system at:
1639.35 s
[HTF] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1639.35 s
[HTF] Using strip version 2.44 found on system at:
1639.35 s
[HTF] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1639.35 s
[HTF] Using tar found on system at:
1639.35 s
[HTF] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1639.35 s
[HTF] No uhc found
1639.35 s
[HTF] Phase: buildPhase
1639.35 s
[HTF] patching script interpreter paths in scripts
1639.35 s
[HTF] Preprocessing library for HTF-0.15.0.2..
1639.35 s
[HTF] Building library for HTF-0.15.0.2..
1639.35 s
[HTF] [ 1 of 24] Compiling Paths_HTF ( dist/build/autogen/Paths_HTF.hs, dist/build/Paths_HTF.o, dist/build/Paths_HTF.dyn_o )
1639.35 s
[binary-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1639.35 s
[binary-instances] Using hscolour version 1.25 found on system at:
1639.35 s
[binary-instances] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1639.35 s
[binary-instances] No jhc found
1639.35 s
[binary-instances] Using ld found on system at:
1639.35 s
[binary-instances] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1639.35 s
[binary-instances] No pkg-config found
1639.35 s
[binary-instances] Using runghc version 9.8.1 found on system at:
1639.35 s
[binary-instances] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1639.35 s
[binary-instances] Using strip version 2.44 found on system at:
1639.35 s
[binary-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1639.35 s
[binary-instances] Using tar found on system at:
1639.35 s
[binary-instances] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1639.35 s
[binary-instances] No uhc found
1639.35 s
[binary-instances] Phase: buildPhase
1639.35 s
[binary-instances] Preprocessing library for binary-instances-1.0.6..
1639.35 s
[binary-instances] Building library for binary-instances-1.0.6..
1639.35 s
[binary-instances] [ 1 of 11] Compiling Data.Binary.Instances.CaseInsensitive ( src/Data/Binary/Instances/CaseInsensitive.hs, dist/build/Data/Binary/Instances/CaseInsensitive.o, dist/build/Data/Binary/Instances/CaseInsensitive.dyn_o )
1639.35 s
[binary-instances] [ 2 of 11] Compiling Data.Binary.Instances.Hashable ( src/Data/Binary/Instances/Hashable.hs, dist/build/Data/Binary/Instances/Hashable.o, dist/build/Data/Binary/Instances/Hashable.dyn_o )
1639.35 s
[binary-instances] [ 3 of 11] Compiling Data.Binary.Instances.Primitive ( src/Data/Binary/Instances/Primitive.hs, dist/build/Data/Binary/Instances/Primitive.o, dist/build/Data/Binary/Instances/Primitive.dyn_o )
1639.35 s
[binary-instances] [ 4 of 11] Compiling Data.Binary.Instances.Scientific ( src/Data/Binary/Instances/Scientific.hs, dist/build/Data/Binary/Instances/Scientific.o, dist/build/Data/Binary/Instances/Scientific.dyn_o )
1639.35 s
[binary-instances] [ 5 of 11] Compiling Data.Binary.Instances.Tagged ( src/Data/Binary/Instances/Tagged.hs, dist/build/Data/Binary/Instances/Tagged.o, dist/build/Data/Binary/Instances/Tagged.dyn_o )
1639.35 s
[binary-instances] [ 6 of 11] Compiling Data.Binary.Instances.Text ( src/Data/Binary/Instances/Text.hs, dist/build/Data/Binary/Instances/Text.o, dist/build/Data/Binary/Instances/Text.dyn_o )
1639.35 s
[binary-instances] [ 7 of 11] Compiling Data.Binary.Instances.Time ( src/Data/Binary/Instances/Time.hs, dist/build/Data/Binary/Instances/Time.o, dist/build/Data/Binary/Instances/Time.dyn_o )
1639.35 s
[enummapset] [1 of 7] Compiling Data.EnumSet ( Data/EnumSet.hs, dist/build/intset-properties/intset-properties-tmp/Data/EnumSet.o )
1639.35 s
[enummapset] [2 of 7] Compiling Data.EnumMap.Base ( Data/EnumMap/Base.hs, dist/build/intset-properties/intset-properties-tmp/Data/EnumMap/Base.o )
1639.35 s
[microaeson] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1639.35 s
[microaeson] No pkg-config found
1639.35 s
[microaeson] Using runghc version 9.8.1 found on system at:
1639.35 s
[microaeson] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1639.35 s
[microaeson] Using strip version 2.44 found on system at:
1639.35 s
[microaeson] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1639.35 s
[microaeson] Using tar found on system at:
1639.35 s
[microaeson] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1639.35 s
[microaeson] No uhc found
1639.35 s
[microaeson] Phase: buildPhase
1639.35 s
[microaeson] Preprocessing library for microaeson-0.1.0.2..
1639.35 s
[microaeson] Building library for microaeson-0.1.0.2..
1639.35 s
[microaeson] [1 of 3] Compiling Data.Aeson.Micro.Parser ( src/Data/Aeson/Micro/Parser.hs, dist/build/Data/Aeson/Micro/Parser.o, dist/build/Data/Aeson/Micro/Parser.dyn_o )
1639.35 s
[microaeson] [2 of 3] Compiling Data.Aeson.Micro.Scanner ( dist/build/Data/Aeson/Micro/Scanner.hs, dist/build/Data/Aeson/Micro/Scanner.o, dist/build/Data/Aeson/Micro/Scanner.dyn_o )
1639.35 s
[microaeson] [3 of 3] Compiling Data.Aeson.Micro ( src/Data/Aeson/Micro.hs, dist/build/Data/Aeson/Micro.o, dist/build/Data/Aeson/Micro.dyn_o )
1639.35 s
[path] /nix/store/8l8kfl61bmswfj1a8h0n7azgrxd9fzs8-path-0.9.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1639.35 s
[path] Private executables installed in:
1639.35 s
[path] /nix/store/8l8kfl61bmswfj1a8h0n7azgrxd9fzs8-path-0.9.5/libexec/x86_64-linux-ghc-9.8.1/path-0.9.5
1639.35 s
[path] Data files installed in:
1639.35 s
[path] /nix/store/8l8kfl61bmswfj1a8h0n7azgrxd9fzs8-path-0.9.5/share/x86_64-linux-ghc-9.8.1/path-0.9.5
1639.35 s
[path] Documentation installed in:
1639.35 s
[path] /nix/store/6lxg38633h4xvplvm145w89cbnkvicsd-path-0.9.5-doc/share/doc/path-0.9.5
1639.35 s
[path] Configuration files installed in:
1639.35 s
[path] /nix/store/8l8kfl61bmswfj1a8h0n7azgrxd9fzs8-path-0.9.5/etc
1639.35 s
[path] No alex found
1639.35 s
[path] Using ar found on system at:
1639.35 s
[path] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1639.35 s
[path] No c2hs found
1639.35 s
[path] No cpphs found
1639.35 s
[path] No doctest found
1639.35 s
[path] Using gcc version 14.3.0 given by user at:
1639.35 s
[path] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1639.36 s
[path] Using ghc version 9.8.1 found on system at:
1639.36 s
[path] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1639.36 s
[path] Using ghc-pkg version 9.8.1 found on system at:
1639.36 s
[path] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1639.36 s
[path] No ghcjs found
1639.36 s
[path] No ghcjs-pkg found
1639.36 s
[path] No greencard found
1639.36 s
[path] Using haddock version 2.30.0 found on system at:
1639.36 s
[path] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1639.36 s
[path] No happy found
1639.36 s
[path] Using haskell-suite found on system at: haskell-suite-dummy-location
1639.36 s
[path] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1639.36 s
[path] No hmake found
1639.36 s
[path] Using hpc version 0.69 found on system at:
1639.36 s
[path] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1639.36 s
[path] Using hsc2hs version 0.68.10 found on system at:
1639.36 s
[path] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1639.36 s
[path] Using hscolour version 1.25 found on system at:
1639.36 s
[path] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1639.36 s
[path] No jhc found
1639.36 s
[path] Using ld found on system at:
1639.36 s
[path] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1639.36 s
[path] No pkg-config found
1639.36 s
[path] Using runghc version 9.8.1 found on system at:
1639.36 s
[path] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1639.36 s
[path] Using strip version 2.44 found on system at:
1639.36 s
[path] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1639.36 s
[path] Using tar found on system at:
1639.36 s
[path] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1639.36 s
[path] No uhc found
1639.36 s
[path] Phase: buildPhase
1639.36 s
[path] Preprocessing library for path-0.9.5..
1639.36 s
[path] Building library for path-0.9.5..
1639.36 s
[path] [1 of 6] Compiling Path.Internal.Posix ( src/Path/Internal/Posix.hs, dist/build/Path/Internal/Posix.o, dist/build/Path/Internal/Posix.dyn_o )
1639.36 s
[shake] - Development.Shake.Command.cmdResult
1639.36 s
[shake] - Development.Shake.Command.Unit
1639.36 s
[shake] - Development.Shake.Command.cmdString
1639.36 s
[shake] - Development.Shake.Command.Result
1639.36 s
[shake] - Development.Shake.Command.Str
1639.47 s
[rebase] Phase: setupCompilerEnvironmentPhase
1639.47 s
[rebase] Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
1639.73 s
[constraints-extras] [1 of 4] Compiling Data.Constraint.Compose ( src/Data/Constraint/Compose.hs, dist/build/Data/Constraint/Compose.p_o )
1639.87 s
[HTF] [ 2 of 24] Compiling Test.Framework.Colors ( Test/Framework/Colors.hs, dist/build/Test/Framework/Colors.o, dist/build/Test/Framework/Colors.dyn_o )
1639.92 s
[quickcheck-classes] Source component graph:
1639.92 s
[quickcheck-classes] component lib
1639.92 s
[quickcheck-classes] component test:advanced dependency lib
1639.92 s
[quickcheck-classes] component test:basic dependency lib
1639.92 s
[quickcheck-classes] Configured component graph:
1639.92 s
[quickcheck-classes] component quickcheck-classes-0.6.5.0-BbngBuB6nit7bCpy2atmsb
1639.92 s
[quickcheck-classes] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.92 s
[quickcheck-classes] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.92 s
[quickcheck-classes] include base-4.19.0.0-b960
1639.92 s
[quickcheck-classes] include containers-0.6.8-4775
1639.92 s
[quickcheck-classes] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.92 s
[quickcheck-classes] include primitive-addr-0.1.0.3-Jw7pnn5knPg8Bu29xjoDVE
1639.92 s
[quickcheck-classes] include quickcheck-classes-base-0.6.2.0-LFuzUAQAQc3LjZnHGtUJjA
1639.92 s
[quickcheck-classes] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1639.92 s
[quickcheck-classes] include semirings-0.7-9kfVu697TaJIFSArt1zVBs
1639.92 s
[quickcheck-classes] include transformers-0.6.1.0-c3ec
1639.92 s
[quickcheck-classes] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.92 s
[quickcheck-classes] component quickcheck-classes-0.6.5.0-Ctn92XFcHXzImhmn4IQlCy-advanced
1639.92 s
[quickcheck-classes] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.92 s
[quickcheck-classes] include base-4.19.0.0-b960
1639.92 s
[quickcheck-classes] include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
1639.92 s
[quickcheck-classes] include containers-0.6.8-4775
1639.92 s
[quickcheck-classes] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.92 s
[quickcheck-classes] include quickcheck-classes-0.6.5.0-BbngBuB6nit7bCpy2atmsb
1639.92 s
[quickcheck-classes] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1639.92 s
[quickcheck-classes] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1639.92 s
[quickcheck-classes] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
1639.92 s
[quickcheck-classes] include transformers-0.6.1.0-c3ec
1639.92 s
[quickcheck-classes] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.92 s
[quickcheck-classes] component quickcheck-classes-0.6.5.0-1hXH24DVMfuEDqZwBoDPY-basic
1639.92 s
[quickcheck-classes] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.92 s
[quickcheck-classes] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.92 s
[quickcheck-classes] include base-4.19.0.0-b960
1639.92 s
[quickcheck-classes] include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
1639.92 s
[quickcheck-classes] include containers-0.6.8-4775
1639.92 s
[quickcheck-classes] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.92 s
[quickcheck-classes] include quickcheck-classes-0.6.5.0-BbngBuB6nit7bCpy2atmsb
1639.92 s
[quickcheck-classes] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1639.92 s
[quickcheck-classes] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1639.92 s
[quickcheck-classes] include transformers-0.6.1.0-c3ec
1639.92 s
[quickcheck-classes] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.92 s
[quickcheck-classes] Linked component graph:
1639.92 s
[quickcheck-classes] unit quickcheck-classes-0.6.5.0-BbngBuB6nit7bCpy2atmsb
1639.92 s
[quickcheck-classes] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.92 s
[quickcheck-classes] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.92 s
[quickcheck-classes] include base-4.19.0.0-b960
1639.92 s
[quickcheck-classes] include containers-0.6.8-4775
1639.92 s
[quickcheck-classes] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.92 s
[quickcheck-classes] include primitive-addr-0.1.0.3-Jw7pnn5knPg8Bu29xjoDVE
1639.92 s
[quickcheck-classes] include quickcheck-classes-base-0.6.2.0-LFuzUAQAQc3LjZnHGtUJjA
1639.92 s
[quickcheck-classes] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1639.92 s
[quickcheck-classes] include semirings-0.7-9kfVu697TaJIFSArt1zVBs
1639.92 s
[quickcheck-classes] include transformers-0.6.1.0-c3ec
1639.92 s
[quickcheck-classes] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.92 s
[quickcheck-classes] Test.QuickCheck.Classes=quickcheck-classes-0.6.5.0-BbngBuB6nit7bCpy2atmsb:Test.QuickCheck.Classes,Test.QuickCheck.Classes.IsList=quickcheck-classes-0.6.5.0-BbngBuB6nit7bCpy2atmsb:Test.QuickCheck.Classes.IsList
1639.92 s
[quickcheck-classes] unit quickcheck-classes-0.6.5.0-Ctn92XFcHXzImhmn4IQlCy-advanced
1639.92 s
[quickcheck-classes] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.92 s
[quickcheck-classes] include base-4.19.0.0-b960
1639.92 s
[quickcheck-classes] include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
1639.92 s
[quickcheck-classes] include containers-0.6.8-4775
1639.92 s
[quickcheck-classes] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.92 s
[quickcheck-classes] include quickcheck-classes-0.6.5.0-BbngBuB6nit7bCpy2atmsb
1639.92 s
[quickcheck-classes] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1639.92 s
[quickcheck-classes] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1639.92 s
[quickcheck-classes] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
1639.92 s
[quickcheck-classes] include transformers-0.6.1.0-c3ec
1639.92 s
[quickcheck-classes] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.92 s
[quickcheck-classes] unit quickcheck-classes-0.6.5.0-1hXH24DVMfuEDqZwBoDPY-basic
1639.92 s
[quickcheck-classes] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.92 s
[quickcheck-classes] include aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.92 s
[quickcheck-classes] include base-4.19.0.0-b960
1639.92 s
[quickcheck-classes] include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
1639.92 s
[quickcheck-classes] include containers-0.6.8-4775
1639.92 s
[quickcheck-classes] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.92 s
[quickcheck-classes] include quickcheck-classes-0.6.5.0-BbngBuB6nit7bCpy2atmsb
1639.92 s
[quickcheck-classes] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1639.92 s
[quickcheck-classes] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1639.92 s
[quickcheck-classes] include transformers-0.6.1.0-c3ec
1639.92 s
[quickcheck-classes] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.92 s
[quickcheck-classes] Ready component graph:
1639.92 s
[quickcheck-classes] definite quickcheck-classes-0.6.5.0-BbngBuB6nit7bCpy2atmsb
1639.92 s
[quickcheck-classes] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.92 s
[quickcheck-classes] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.92 s
[quickcheck-classes] depends base-4.19.0.0-b960
1639.92 s
[quickcheck-classes] depends containers-0.6.8-4775
1639.92 s
[quickcheck-classes] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.92 s
[quickcheck-classes] depends primitive-addr-0.1.0.3-Jw7pnn5knPg8Bu29xjoDVE
1639.92 s
[quickcheck-classes] depends quickcheck-classes-base-0.6.2.0-LFuzUAQAQc3LjZnHGtUJjA
1639.92 s
[quickcheck-classes] depends semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1639.92 s
[quickcheck-classes] depends semirings-0.7-9kfVu697TaJIFSArt1zVBs
1639.92 s
[quickcheck-classes] depends transformers-0.6.1.0-c3ec
1639.92 s
[quickcheck-classes] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.92 s
[quickcheck-classes] definite quickcheck-classes-0.6.5.0-Ctn92XFcHXzImhmn4IQlCy-advanced
1639.92 s
[quickcheck-classes] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.92 s
[quickcheck-classes] depends base-4.19.0.0-b960
1639.92 s
[quickcheck-classes] depends base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
1639.92 s
[quickcheck-classes] depends containers-0.6.8-4775
1639.92 s
[quickcheck-classes] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.92 s
[quickcheck-classes] depends quickcheck-classes-0.6.5.0-BbngBuB6nit7bCpy2atmsb
1639.92 s
[quickcheck-classes] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1639.92 s
[quickcheck-classes] depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
1639.92 s
[quickcheck-classes] depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
1639.92 s
[quickcheck-classes] depends transformers-0.6.1.0-c3ec
1639.92 s
[quickcheck-classes] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.92 s
[quickcheck-classes] definite quickcheck-classes-0.6.5.0-1hXH24DVMfuEDqZwBoDPY-basic
1639.92 s
[quickcheck-classes] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
1639.92 s
[quickcheck-classes] depends aeson-2.2.3.0-LCyloVtIJ2O9pmmC0pkj15
1639.92 s
[quickcheck-classes] depends base-4.19.0.0-b960
1639.92 s
[quickcheck-classes] depends base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
1639.92 s
[quickcheck-classes] depends containers-0.6.8-4775
1639.92 s
[quickcheck-classes] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
1639.92 s
[quickcheck-classes] depends quickcheck-classes-0.6.5.0-BbngBuB6nit7bCpy2atmsb
1639.92 s
[quickcheck-classes] depends semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1639.92 s
[quickcheck-classes] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
1639.92 s
[quickcheck-classes] depends transformers-0.6.1.0-c3ec
1639.93 s
[quickcheck-classes] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
1639.93 s
[quickcheck-classes] Using Cabal-3.10.2.0 compiled by ghc-9.8
1639.93 s
[quickcheck-classes] Using compiler: ghc-9.8.1
1639.93 s
[quickcheck-classes] Using install prefix:
1639.93 s
[quickcheck-classes] /nix/store/0ix1pd63j0bkqidslf6chsvb6qzd4nqp-quickcheck-classes-0.6.5.0
1639.93 s
[quickcheck-classes] Executables installed in:
1639.93 s
[quickcheck-classes] /nix/store/0ix1pd63j0bkqidslf6chsvb6qzd4nqp-quickcheck-classes-0.6.5.0/bin
1639.93 s
[quickcheck-classes] Libraries installed in:
1639.93 s
[quickcheck-classes] /nix/store/0ix1pd63j0bkqidslf6chsvb6qzd4nqp-quickcheck-classes-0.6.5.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/quickcheck-classes-0.6.5.0-BbngBuB6nit7bCpy2atmsb
1639.93 s
[quickcheck-classes] Dynamic Libraries installed in:
1639.93 s
[quickcheck-classes] /nix/store/0ix1pd63j0bkqidslf6chsvb6qzd4nqp-quickcheck-classes-0.6.5.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
1639.93 s
[quickcheck-classes] Private executables installed in:
1639.93 s
[quickcheck-classes] /nix/store/0ix1pd63j0bkqidslf6chsvb6qzd4nqp-quickcheck-classes-0.6.5.0/libexec/x86_64-linux-ghc-9.8.1/quickcheck-classes-0.6.5.0
1639.93 s
[quickcheck-classes] Data files installed in:
1639.93 s
[quickcheck-classes] /nix/store/0ix1pd63j0bkqidslf6chsvb6qzd4nqp-quickcheck-classes-0.6.5.0/share/x86_64-linux-ghc-9.8.1/quickcheck-classes-0.6.5.0
1639.93 s
[quickcheck-classes] Documentation installed in:
1639.93 s
[quickcheck-classes] /nix/store/n04cxm3v83r4kzyll36px3gfhp3jkgbb-quickcheck-classes-0.6.5.0-doc/share/doc/quickcheck-classes-0.6.5.0
1639.93 s
[quickcheck-classes] Configuration files installed in:
1639.93 s
[quickcheck-classes] /nix/store/0ix1pd63j0bkqidslf6chsvb6qzd4nqp-quickcheck-classes-0.6.5.0/etc
1639.93 s
[quickcheck-classes] No alex found
1639.93 s
[quickcheck-classes] Using ar found on system at:
1639.93 s
[quickcheck-classes] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
1639.93 s
[quickcheck-classes] No c2hs found
1639.93 s
[quickcheck-classes] No cpphs found
1639.93 s
[quickcheck-classes] No doctest found
1639.93 s
[quickcheck-classes] Using gcc version 14.3.0 given by user at:
1639.93 s
[quickcheck-classes] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
1639.93 s
[quickcheck-classes] Using ghc version 9.8.1 found on system at:
1639.93 s
[quickcheck-classes] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
1639.93 s
[quickcheck-classes] Using ghc-pkg version 9.8.1 found on system at:
1639.93 s
[quickcheck-classes] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
1639.93 s
[quickcheck-classes] No ghcjs found
1639.93 s
[quickcheck-classes] No ghcjs-pkg found
1639.93 s
[quickcheck-classes] No greencard found
1639.93 s
[quickcheck-classes] Using haddock version 2.30.0 found on system at:
1639.93 s
[quickcheck-classes] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
1639.93 s
[quickcheck-classes] No happy found
1639.93 s
[quickcheck-classes] Using haskell-suite found on system at: haskell-suite-dummy-location
1639.93 s
[quickcheck-classes] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1640.04 s
[quickcheck-classes] No hmake found
1640.04 s
[quickcheck-classes] Using hpc version 0.69 found on system at:
1640.04 s
[quickcheck-classes] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
1640.04 s
[quickcheck-classes] Using hsc2hs version 0.68.10 found on system at:
1640.04 s
[quickcheck-classes] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
1640.04 s
[quickcheck-classes] Using hscolour version 1.25 found on system at:
1640.04 s
[quickcheck-classes] /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
1640.04 s
[quickcheck-classes] No jhc found
1640.04 s
[quickcheck-classes] Using ld found on system at:
1640.04 s
[quickcheck-classes] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
1640.04 s
[quickcheck-classes] No pkg-config found
1640.04 s
[quickcheck-classes] Using runghc version 9.8.1 found on system at:
1640.04 s
[quickcheck-classes] /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
1640.04 s
[quickcheck-classes] Using strip version 2.44 found on system at:
1640.04 s
[quickcheck-classes] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
1640.04 s
[quickcheck-classes] Using tar found on system at:
1640.04 s
[quickcheck-classes] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
1640.04 s
[quickcheck-classes] No uhc found
1640.07 s
[doctest-discover] [4 of 4] Linking dist/build/doctest-discover/doctest-discover
1640.54 s
[rebase] Phase: unpackPhase
1640.57 s
[rebase] unpacking source archive /nix/store/ydg6rqk9c52jwsc5yynv43iarp45m1i0-rebase-1.21.2.tar.gz
1640.61 s
[rebase] source root is rebase-1.21.2
1640.66 s
[rebase] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "rebase-1.21.2/rebase.cabal"
1640.68 s
[rebase] Phase: patchPhase
1640.72 s
[rebase] Phase: compileBuildDriverPhase
1640.74 s
[rebase] setupCompileFlags: -package-db=/build/tmp.ywhHOfhkjj/setup-package.conf.d -threaded
1640.75 s
[constraints-extras] [2 of 4] Compiling Data.Constraint.Flip ( src/Data/Constraint/Flip.hs, dist/build/Data/Constraint/Flip.p_o )
1640.75 s
[constraints-extras] [3 of 4] Compiling Data.Constraint.Extras ( src/Data/Constraint/Extras.hs, dist/build/Data/Constraint/Extras.p_o )
1640.84 s
[deriving-aeson] [2 of 2] Compiling Deriving.Aeson.Stock ( src/Deriving/Aeson/Stock.hs, dist/build/Deriving/Aeson/Stock.p_o )
1640.90 s
[quickcheck-classes] Phase: buildPhase
1640.93 s
[rebase] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.ywhHOfhkjj/Main.o )
1641.31 s
[rebase] [2 of 2] Linking Setup
1641.42 s
[quickcheck-classes] Preprocessing library for quickcheck-classes-0.6.5.0..
1641.43 s
[quickcheck-classes] Building library for quickcheck-classes-0.6.5.0..
1641.66 s
[constraints-extras] [4 of 4] Compiling Data.Constraint.Extras.TH ( src/Data/Constraint/Extras/TH.hs, dist/build/Data/Constraint/Extras/TH.p_o )
1643.23 s
[enummapset] [3 of 7] Compiling Data.EnumMap.Lazy ( Data/EnumMap/Lazy.hs, dist/build/intset-properties/intset-properties-tmp/Data/EnumMap/Lazy.o )
1643.28 s
[enummapset] [4 of 7] Compiling Data.EnumMap ( Data/EnumMap.hs, dist/build/intset-properties/intset-properties-tmp/Data/EnumMap.o )
1643.55 s
[enummapset] [5 of 7] Compiling IntSetValidity ( tests/IntSetValidity.hs, dist/build/intset-properties/intset-properties-tmp/IntSetValidity.o )
1643.75 s
[enummapset] [6 of 7] Compiling Json ( tests/Json.hs, dist/build/intset-properties/intset-properties-tmp/Json.o )
1643.75 s
[quickcheck-classes] [ 1 of 12] Compiling Test.QuickCheck.Classes.Alt ( src/Test/QuickCheck/Classes/Alt.hs, dist/build/Test/QuickCheck/Classes/Alt.o, dist/build/Test/QuickCheck/Classes/Alt.dyn_o )
1644.24 s
[doctest-discover] Phase: haddockPhase
1644.28 s
[doctest-discover] Phase: installPhase
1644.84 s
[microaeson] [1 of 3] Compiling Data.Aeson.Micro.Parser ( src/Data/Aeson/Micro/Parser.hs, dist/build/Data/Aeson/Micro/Parser.p_o )
1644.95 s
[doctest-discover] Installing library in /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/doctest-discover-0.2.0.0-Kspce9ghb8Y3s7cOogl3rI
1644.95 s
[doctest-discover] Installing executable doctest-discover in /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0/bin
1644.96 s
[doctest-discover] Warning: The directory
1644.96 s
[doctest-discover] /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0/bin is
1644.96 s
[doctest-discover] not in the system search path.
1645.26 s
[path] [2 of 6] Compiling Path.Internal ( src/Path/Internal.hs, dist/build/Path/Internal.o, dist/build/Path/Internal.dyn_o )
1645.87 s
[path] [3 of 6] Compiling Path.Internal.Windows ( src/Path/Internal/Windows.hs, dist/build/Path/Internal/Windows.o, dist/build/Path/Internal/Windows.dyn_o )
1645.87 s
[path] [4 of 6] Compiling Path.Posix ( src/Path/Posix.hs, dist/build/Path/Posix.o, dist/build/Path/Posix.dyn_o )
1645.87 s
[path]
1645.87 s
[path] src/Path/Include.hs:486:11: warning : [ GHC-53633 ] [ -Woverlapping-patterns ]
1645.87 s
[path] Pattern match is redundant
1645.87 s
[path] In an equation for ‘normalizeDrive’: normalizeDrive | False = ...
1645.87 s
[path] |
1645.87 s
[path] 486 | | IS_WI NDOWS = normalizeTrailingSeps
1645.87 s
[path] | ^^^^^
1645.87 s
[path]
1645.87 s
[path] src/Path/Include.hs:850:5: warning : [ GHC-53633 ] [ -Woverlapping-patterns ]
1645.87 s
[path] Pattern match is redundant
1645.87 s
[path] In an equation for ‘normalizeFilePath’:
1645.87 s
[path] normalizeFilePath | False = ...
1645.87 s
[path] |
1645.87 s
[path] 850 | | IS_WI NDOWS = normalizeWindowsSeps . FilePath.normalise
1645.87 s
[path] | ^^^^^
1646.12 s
[doctest-discover] Phase: fixupPhase
1646.44 s
[doctest-discover] shrinking RPATHs of ELF executables and libraries in /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0
1646.45 s
[doctest-discover] shrinking /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0/bin/doctest-discover
1646.62 s
[rebase] Phase: updateAutotoolsGnuConfigScriptsPhase
1647.16 s
[doctest-discover] checking for references to /build/ in /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0...
1647.18 s
[rebase] Phase: configurePhase
1647.20 s
[rebase] configureFlags: --verbose --prefix=/nix/store/nz4ns4b6qh293800fgl2g75s2m5b7h01-rebase-1.21.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/4lk673wdb0mn9qaz01yi202b3d11m5cm-rebase-1.21.2-doc/share/doc/rebase-1.21.2 --with-gcc=gcc --package-db=/build/tmp.ywhHOfhkjj/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
1647.26 s
[doctest-discover] patching script interpreter paths in /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0
1647.29 s
[doctest-discover] stripping (with command strip and flags -S -p) in /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0/lib /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0/bin
1647.34 s
[rebase] Using Parsec parser
1647.34 s
[rebase] Configuring rebase-1.21.2...
1647.39 s
[quickcheck-classes]
1647.39 s
[quickcheck-classes] src/Test/QuickCheck/Classes/Alt.hs:18:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1647.39 s
[quickcheck-classes] The import of ‘Data.Functor’ is redundant
1647.39 s
[quickcheck-classes] except perhaps to import instances from ‘Data.Functor’
1647.39 s
[quickcheck-classes] To import instances alone, use: import Data.Functor()
1647.39 s
[quickcheck-classes] |
1647.39 s
[quickcheck-classes] 18 | import Data.Functor
1647.39 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^
1647.39 s
[quickcheck-classes]
1647.39 s
[quickcheck-classes] src/Test/QuickCheck/Classes/Alt.hs:22:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1647.39 s
[quickcheck-classes] The import of ‘Test.QuickCheck.Arbitrary’ is redundant
1647.39 s
[quickcheck-classes] except perhaps to import instances from ‘Test.QuickCheck.Arbitrary’
1647.39 s
[quickcheck-classes] To import instances alone, use: import Test.QuickCheck.Arbitrary()
1647.39 s
[quickcheck-classes] |
1647.39 s
[quickcheck-classes] 22 | import Test.QuickCheck.Arbitrary (Arbitrary1(..))
1647.39 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1647.39 s
[quickcheck-classes]
1647.39 s
[quickcheck-classes] src/Test/QuickCheck/Classes/Alt.hs:23:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1647.39 s
[quickcheck-classes] The import of ‘Data.Functor.Classes’ is redundant
1647.39 s
[quickcheck-classes] except perhaps to import instances from ‘Data.Functor.Classes’
1647.39 s
[quickcheck-classes] To import instances alone, use: import Data.Functor.Classes()
1647.39 s
[quickcheck-classes] |
1647.39 s
[quickcheck-classes] 23 | import Data.Functor.Classes (Eq1,Show1)
1647.39 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1647.39 s
[quickcheck-classes]
1647.39 s
[quickcheck-classes] src/Test/QuickCheck/Classes/Alt.hs:24:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1647.39 s
[quickcheck-classes] The import of ‘Test.QuickCheck.Property’ is redundant
1647.39 s
[quickcheck-classes] except perhaps to import instances from ‘Test.QuickCheck.Property’
1647.39 s
[quickcheck-classes] To import instances alone, use: import Test.QuickCheck.Property()
1647.39 s
[quickcheck-classes] |
1647.39 s
[quickcheck-classes] 24 | import Test.QuickCheck.Property (Property)
1647.39 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1647.56 s
[enummapset] [7 of 7] Compiling Main ( tests/intset-properties.hs, dist/build/intset-properties/intset-properties-tmp/Main.o )
1647.58 s
[HTF] [ 3 of 24] Compiling Test.Framework.Diff ( Test/Framework/Diff.hs, dist/build/Test/Framework/Diff.o, dist/build/Test/Framework/Diff.dyn_o )
1647.76 s
[enummapset]
1647.76 s
[enummapset] tests/intset-properties.hs:184:57: warning : [ GHC-63394 ] [ -Wx-partial ]
1647.76 s
[enummapset] In the use of ‘head’
1647.76 s
[enummapset] (imported from Prelude, but defined in GHC.List):
1647.76 s
[enummapset] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1647.76 s
[enummapset] |
1647.76 s
[enummapset] 184 | | otherwise -> lookup' x t == Just (head cs) -- we want smallest such element
1647.76 s
[enummapset] | ^^^^
1647.76 s
[enummapset]
1647.76 s
[enummapset] tests/intset-properties.hs:280:32: warning : [ GHC-63394 ] [ -Wx-partial ]
1647.76 s
[enummapset] In the use of ‘head’
1647.76 s
[enummapset] (imported from Data.List, but defined in GHC.List):
1647.76 s
[enummapset] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1647.76 s
[enummapset] |
1647.76 s
[enummapset] 280 | nub_sort_xs = List.map List.head $ List.group sort_xs
1647.76 s
[enummapset] | ^^^^^^^^^
1648.17 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0
1649.95 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1650.25 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0
1650.96 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1651.09 s
[post-build-hook] copying 3 paths...
1651.09 s
[post-build-hook] copying path '/nix/store/msrf8g4zk8blzsj69wkwph5rq3k8lz7j-doctest-0.22.6-doc' to 'https://cache.nix-ci.com'...
1652.50 s
[post-build-hook] copying path '/nix/store/5b1p4pwqjyd7hm6rr4ill4mcxhy3cgwg-doctest-0.22.6' to 'https://cache.nix-ci.com'...
1735.35 s
[post-build-hook] copying path '/nix/store/c8jv4ph4dji7dhi3fjapmdh4340lw0wg-doctest-discover-0.2.0.0' to 'https://cache.nix-ci.com'...
1737.08 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1737.66 s
[post-build-hook] copying 0 paths...
1737.96 s
Progress: 99 of 171 built (15 building), 395 of 395 downloaded from cache
1738.12 s
Building cassava
1738.16 s
[HTF] [ 4 of 24] Compiling Test.Framework.Location ( Test/Framework/Location.hs, dist/build/Test/Framework/Location.o, dist/build/Test/Framework/Location.dyn_o )
1738.16 s
[HTF] [ 5 of 24] Compiling Test.Framework.Preprocessor ( Test/Framework/Preprocessor.hs, dist/build/Test/Framework/Preprocessor.o, dist/build/Test/Framework/Preprocessor.dyn_o )
1738.16 s
[HTF] [ 6 of 24] Compiling Test.Framework.Pretty ( Test/Framework/Pretty.hs, dist/build/Test/Framework/Pretty.o, dist/build/Test/Framework/Pretty.dyn_o )
1738.16 s
[HTF] [ 7 of 24] Compiling Test.Framework.Process ( Test/Framework/Process.hs, dist/build/Test/Framework/Process.o, dist/build/Test/Framework/Process.dyn_o )
1738.16 s
[HTF] [ 8 of 24] Compiling Test.Framework.TestInterface ( Test/Framework/TestInterface.hs, dist/build/Test/Framework/TestInterface.o, dist/build/Test/Framework/TestInterface.dyn_o )
1738.16 s
[HTF] [ 9 of 24] Compiling Test.Framework.History ( Test/Framework/History.hs, dist/build/Test/Framework/History.o, dist/build/Test/Framework/History.dyn_o )
1738.16 s
[HTF] [10 of 24] Compiling Test.Framework.AssertM ( Test/Framework/AssertM.hs, dist/build/Test/Framework/AssertM.o, dist/build/Test/Framework/AssertM.dyn_o )
1738.16 s
[HTF]
1738.16 s
[HTF] Test/Framework/AssertM.hs:64:5: warning : [ GHC-22705 ] [ -Wnoncanonical-monad-instances ]
1738.16 s
[HTF] Noncanonical ‘return’ definition detected
1738.16 s
[HTF] in the instance declaration for ‘Monad AssertBool’.
1738.16 s
[HTF] ‘return’ will eventually be removed in favour of ‘pure’
1738.16 s
[HTF] Suggested fix:
1738.16 s
[HTF] Either remove definition for ‘return’ (recommended) or define as ‘return = pure’
1738.16 s
[HTF] See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return
1738.16 s
[HTF] |
1738.16 s
[HTF] 64 | return = AssertOk
1738.16 s
[HTF] | ^^^^^^^^^^^^^^^^^
1738.16 s
[HTF] [11 of 24] Compiling Test.Framework.TestTypes ( Test/Framework/TestTypes.hs, dist/build/Test/Framework/TestTypes.o, dist/build/Test/Framework/TestTypes.dyn_o )
1738.16 s
[HTF] [12 of 24] Compiling Test.Framework.JsonOutput ( Test/Framework/JsonOutput.hs, dist/build/Test/Framework/JsonOutput.o, dist/build/Test/Framework/JsonOutput.dyn_o )
1738.16 s
[HTF] [13 of 24] Compiling Test.Framework.ThreadPool ( Test/Framework/ThreadPool.hs, dist/build/Test/Framework/ThreadPool.o, dist/build/Test/Framework/ThreadPool.dyn_o )
1738.16 s
[HTF] [14 of 24] Compiling Test.Framework.Tutorial ( Test/Framework/Tutorial.hs, dist/build/Test/Framework/Tutorial.o, dist/build/Test/Framework/Tutorial.dyn_o )
1738.16 s
[HTF] [15 of 24] Compiling Test.Framework.Utils ( Test/Framework/Utils.hs, dist/build/Test/Framework/Utils.o, dist/build/Test/Framework/Utils.dyn_o )
1738.16 s
[HTF]
1738.16 s
[HTF] Test/Framework/Utils.hs:62:26: warning : [ GHC-63394 ] [ -Wx-partial ]
1738.16 s
[HTF] In the use of ‘tail’
1738.16 s
[HTF] (imported from Prelude, but defined in GHC.List):
1738.16 s
[HTF] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1738.16 s
[HTF] |
1738.16 s
[HTF] 62 | dropSuffix f = reverse . tail . dropWhile (/= '.') $ reverse f
1738.16 s
[HTF] | ^^^^
1738.16 s
[HTF] [16 of 24] Compiling Test.Framework.QuickCheckWrapper ( Test/Framework/QuickCheckWrapper.hs, dist/build/Test/Framework/QuickCheckWrapper.o, dist/build/Test/Framework/QuickCheckWrapper.dyn_o )
1738.16 s
[HTF] [17 of 24] Compiling Test.Framework.PrettyHaskell ( Test/Framework/PrettyHaskell.hs, dist/build/Test/Framework/PrettyHaskell.o, dist/build/Test/Framework/PrettyHaskell.dyn_o )
1738.16 s
[HTF] [18 of 24] Compiling Test.Framework.HUnitWrapper ( Test/Framework/HUnitWrapper.hs, dist/build/Test/Framework/HUnitWrapper.o, dist/build/Test/Framework/HUnitWrapper.dyn_o )
1738.16 s
[HTF] [19 of 24] Compiling Test.Framework.XmlOutput ( Test/Framework/XmlOutput.hs, dist/build/Test/Framework/XmlOutput.o, dist/build/Test/Framework/XmlOutput.dyn_o )
1738.16 s
[HsYAML-aeson] Phase: checkPhase
1738.16 s
[HsYAML-aeson] Package has no test suites.
1738.16 s
[HsYAML-aeson] Phase: haddockPhase
1738.16 s
[HsYAML-aeson] Preprocessing library for HsYAML-aeson-0.2.0.2..
1738.16 s
[HsYAML-aeson] Running Haddock on library for HsYAML-aeson-0.2.0.2..
1738.16 s
[HsYAML-aeson] Warning: The documentation for the following packages are not installed. No
1738.16 s
[HsYAML-aeson] links will be generated to these packages: vector-0.13.2.0
1738.16 s
[HsYAML-aeson] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1738.16 s
[HsYAML-aeson] [1 of 1] Compiling Data.YAML.Aeson ( src/Data/YAML/Aeson.hs, nothing )
1738.16 s
[HsYAML-aeson] Haddock coverage:
1738.16 s
[HsYAML-aeson] Warning: 'Pos' is ambiguous. It is defined
1738.16 s
[HsYAML-aeson] * in ‘Data.YAML.Pos’
1738.17 s
[HsYAML-aeson] * in ‘Data.YAML.Pos’
1738.17 s
[HsYAML-aeson] You may be able to disambiguate the identifier by qualifying it or
1738.17 s
[HsYAML-aeson] by specifying the type/value namespace explicitly.
1738.17 s
[HsYAML-aeson] Defaulting to the one defined in ‘Data.YAML.Pos’
1738.17 s
[HsYAML-aeson] Warning: 'SchemaResolver' is ambiguous. It is defined
1738.17 s
[HsYAML-aeson] * in ‘Data.YAML.Schema.Internal’
1738.17 s
[HsYAML-aeson] * in ‘Data.YAML.Schema.Internal’
1738.17 s
[HsYAML-aeson] You may be able to disambiguate the identifier by qualifying it or
1738.17 s
[HsYAML-aeson] by specifying the type/value namespace explicitly.
1738.17 s
[HsYAML-aeson] Defaulting to the one defined in ‘Data.YAML.Schema.Internal’
1738.17 s
[HsYAML-aeson] 100% ( 15 / 15) in 'Data.YAML.Aeson'
1738.17 s
[HsYAML-aeson] Documentation created: dist/doc/html/HsYAML-aeson/,
1738.17 s
[HsYAML-aeson] dist/doc/html/HsYAML-aeson/HsYAML-aeson.txt
1738.17 s
[HsYAML-aeson] Phase: installPhase
1738.17 s
[HsYAML-aeson] Installing library in /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/HsYAML-aeson-0.2.0.2-HAxVVGatvNS4fTgBVNCkaF
1738.17 s
[HsYAML-aeson] Phase: fixupPhase
1738.17 s
[HsYAML-aeson] shrinking RPATHs of ELF executables and libraries in /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2
1738.17 s
[HsYAML-aeson] shrinking /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSHsYAML-aeson-0.2.0.2-HAxVVGatvNS4fTgBVNCkaF-ghc9.8.1.so
1738.17 s
[HsYAML-aeson] checking for references to /build/ in /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2...
1738.17 s
[HsYAML-aeson] patching script interpreter paths in /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2
1738.17 s
[HsYAML-aeson] stripping (with command strip and flags -S -p) in /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2/lib
1738.17 s
[HsYAML-aeson] shrinking RPATHs of ELF executables and libraries in /nix/store/5gy8nldkva3lwv05h83rpf5nimlfz5bs-HsYAML-aeson-0.2.0.2-doc
1738.17 s
[HsYAML-aeson] checking for references to /build/ in /nix/store/5gy8nldkva3lwv05h83rpf5nimlfz5bs-HsYAML-aeson-0.2.0.2-doc...
1738.17 s
[HsYAML-aeson] patching script interpreter paths in /nix/store/5gy8nldkva3lwv05h83rpf5nimlfz5bs-HsYAML-aeson-0.2.0.2-doc
1738.17 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1738.17 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1738.17 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] ============ Relation.transpose ============
1738.17 s
[algebraic-graphs] OK: transpose empty == empty
1738.17 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1738.17 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1738.17 s
[algebraic-graphs] OK: transpose . transpose == id
1738.17 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] ============ Relation.gmap ============
1738.17 s
[algebraic-graphs] OK: gmap f empty == empty
1738.17 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1738.17 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1738.17 s
[algebraic-graphs] OK: gmap id == id
1738.17 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] ============ Relation.induce ============
1738.17 s
[algebraic-graphs] OK: induce (const True ) x == x
1738.17 s
[algebraic-graphs] OK: induce (const False) x == empty
1738.17 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1738.17 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1738.17 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] ============ Relation.compose ============
1738.17 s
[algebraic-graphs] OK: compose empty x == empty
1738.17 s
[algebraic-graphs] OK: compose x empty == empty
1738.17 s
[algebraic-graphs] OK: compose (vertex x) y == empty
1738.17 s
[algebraic-graphs] OK: compose x (vertex y) == empty
1738.17 s
[algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
1738.17 s
[algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
1738.17 s
[algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
1738.17 s
[algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
1738.17 s
[algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
1738.17 s
[algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] ============ Relation.closure ============
1738.17 s
[algebraic-graphs] OK: closure empty == empty
1738.17 s
[algebraic-graphs] OK: closure (vertex x) == edge x x
1738.17 s
[algebraic-graphs] OK: closure (edge x x) == edge x x
1738.17 s
[algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
1738.17 s
[algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
1738.17 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1738.17 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1738.17 s
[algebraic-graphs] OK: closure . closure == closure
1738.17 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] ============ Relation.reflexiveClosure ============
1738.17 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1738.17 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
1738.17 s
[algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
1738.17 s
[algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
1738.17 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] ============ Relation.symmetricClosure ============
1738.17 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1738.17 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1738.17 s
[algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
1738.17 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1738.17 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] ============ Relation.transitiveClosure ============
1738.17 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1738.17 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1738.17 s
[algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
1738.17 s
[algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
1738.17 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] ============ Relation.induceJust ============
1738.17 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1738.17 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1738.17 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1738.17 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] ============ ReflexiveRelation ============
1738.17 s
[algebraic-graphs] OK: Axioms of reflexive graphs
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] ============ TransitiveRelation ============
1738.17 s
[algebraic-graphs] OK: Axioms of transitive graphs
1738.17 s
[algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] ============ PreorderRelation ============
1738.17 s
[algebraic-graphs] OK: Axioms of preorder graphs
1738.17 s
[algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] ============ Symmetric.Relation ============
1738.17 s
[algebraic-graphs] OK: Axioms of undirected graphs
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] ============ Symmetric.Relation.consistent ============
1738.17 s
[algebraic-graphs] OK: Consistency of the Arbitrary instance
1738.17 s
[algebraic-graphs]
1738.17 s
[algebraic-graphs] OK: consistent empty == True
1738.18 s
[algebraic-graphs] OK: consistent (vertex x) == True
1738.18 s
[algebraic-graphs] OK: consistent (overlay x y) == True
1738.18 s
[algebraic-graphs] OK: consistent (connect x y) == True
1738.18 s
[attoparsec-aeson] [4 of 4] Compiling Data.Aeson.Parser ( src/Data/Aeson/Parser.hs, dist/build/Data/Aeson/Parser.o, dist/build/Data/Aeson/Parser.dyn_o )
1738.18 s
[attoparsec-aeson] [1 of 4] Compiling Data.Aeson.Internal.ByteString ( src/Data/Aeson/Internal/ByteString.hs, dist/build/Data/Aeson/Internal/ByteString.p_o )
1738.18 s
[attoparsec-aeson] [2 of 4] Compiling Data.Aeson.Internal.Text ( src/Data/Aeson/Internal/Text.hs, dist/build/Data/Aeson/Internal/Text.p_o )
1738.18 s
[attoparsec-aeson] [3 of 4] Compiling Data.Aeson.Parser.Internal ( src/Data/Aeson/Parser/Internal.hs, dist/build/Data/Aeson/Parser/Internal.p_o )
1738.18 s
[attoparsec-aeson] [4 of 4] Compiling Data.Aeson.Parser ( src/Data/Aeson/Parser.hs, dist/build/Data/Aeson/Parser.p_o )
1738.18 s
[attoparsec-aeson] buildPhase completed in 1 minutes 18 seconds
1738.18 s
[attoparsec-aeson] Phase: checkPhase
1738.18 s
[attoparsec-aeson] Package has no test suites.
1738.18 s
[attoparsec-aeson] Phase: haddockPhase
1738.18 s
[attoparsec-aeson] Preprocessing library for attoparsec-aeson-2.2.2.0..
1738.18 s
[attoparsec-aeson] Running Haddock on library for attoparsec-aeson-2.2.2.0..
1738.18 s
[attoparsec-aeson] Warning: The documentation for the following packages are not installed. No
1738.18 s
[attoparsec-aeson] links will be generated to these packages: attoparsec-0.14.4,
1738.18 s
[attoparsec-aeson] attoparsec-0.14.4, vector-0.13.2.0
1738.18 s
[attoparsec-aeson] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1738.18 s
[attoparsec-aeson] [1 of 4] Compiling Data.Aeson.Internal.ByteString ( src/Data/Aeson/Internal/ByteString.hs, nothing )
1738.18 s
[attoparsec-aeson] [2 of 4] Compiling Data.Aeson.Internal.Text ( src/Data/Aeson/Internal/Text.hs, nothing )
1738.18 s
[attoparsec-aeson] [3 of 4] Compiling Data.Aeson.Parser.Internal ( src/Data/Aeson/Parser/Internal.hs, nothing )
1738.18 s
[attoparsec-aeson] [4 of 4] Compiling Data.Aeson.Parser ( src/Data/Aeson/Parser.hs, nothing )
1738.18 s
[attoparsec-aeson] Haddock coverage:
1738.18 s
[attoparsec-aeson] Warning: 'Object' is ambiguous. It is defined
1738.18 s
[attoparsec-aeson] * in ‘Data.Aeson.Types.Internal’
1738.18 s
[attoparsec-aeson] * in ‘Data.Aeson.Types.Internal’
1738.18 s
[attoparsec-aeson] You may be able to disambiguate the identifier by qualifying it or
1738.18 s
[attoparsec-aeson] by specifying the type/value namespace explicitly.
1738.18 s
[attoparsec-aeson] Defaulting to the one defined in ‘Data.Aeson.Types.Internal’
1738.18 s
[attoparsec-aeson] Warning: 'fromListNoDup' is out of scope.
1738.18 s
[attoparsec-aeson] If you qualify the identifier, haddock can try to link it anyway.
1738.18 s
[attoparsec-aeson] 86% ( 26 / 30) in 'Data.Aeson.Parser.Internal'
1738.18 s
[attoparsec-aeson] Missing documentation for:
1738.18 s
[attoparsec-aeson] decodeWith (src/Data/Aeson/Parser/Internal.hs:349)
1738.18 s
[attoparsec-aeson] decodeStrictWith (src/Data/Aeson/Parser/Internal.hs:359)
1738.18 s
[attoparsec-aeson] eitherDecodeWith (src/Data/Aeson/Parser/Internal.hs:367)
1738.18 s
[attoparsec-aeson] eitherDecodeStrictWith (src/Data/Aeson/Parser/Internal.hs:403)
1738.18 s
[attoparsec-aeson] 84% ( 22 / 26) in 'Data.Aeson.Parser'
1738.18 s
[attoparsec-aeson] Missing documentation for:
1738.18 s
[attoparsec-aeson] decodeWith (src/Data/Aeson/Parser/Internal.hs:349)
1738.18 s
[attoparsec-aeson] decodeStrictWith (src/Data/Aeson/Parser/Internal.hs:359)
1738.18 s
[attoparsec-aeson] eitherDecodeWith (src/Data/Aeson/Parser/Internal.hs:367)
1738.18 s
[attoparsec-aeson] eitherDecodeStrictWith (src/Data/Aeson/Parser/Internal.hs:403)
1738.18 s
[attoparsec-aeson] Warning: Data.Aeson.Parser.Internal: could not find link destinations for:
1738.18 s
[attoparsec-aeson] - Data.Attoparsec.ByteString.Internal.Parser
1738.18 s
[attoparsec-aeson] Warning: Data.Aeson.Parser: could not find link destinations for:
1738.18 s
[attoparsec-aeson] - Data.Attoparsec.ByteString.Internal.Parser
1738.18 s
[binary-instances] [ 8 of 11] Compiling Data.Binary.Instances.UnorderedContainers ( src/Data/Binary/Instances/UnorderedContainers.hs, dist/build/Data/Binary/Instances/UnorderedContainers.o, dist/build/Data/Binary/Instances/UnorderedContainers.dyn_o )
1738.18 s
[binary-instances] [ 9 of 11] Compiling Data.Binary.Instances.Vector ( src/Data/Binary/Instances/Vector.hs, dist/build/Data/Binary/Instances/Vector.o, dist/build/Data/Binary/Instances/Vector.dyn_o )
1738.18 s
[binary-instances] [10 of 11] Compiling Data.Binary.Instances.Aeson ( src/Data/Binary/Instances/Aeson.hs, dist/build/Data/Binary/Instances/Aeson.o, dist/build/Data/Binary/Instances/Aeson.dyn_o )
1738.18 s
[binary-instances] [11 of 11] Compiling Data.Binary.Instances ( src/Data/Binary/Instances.hs, dist/build/Data/Binary/Instances.o, dist/build/Data/Binary/Instances.dyn_o )
1738.18 s
[binary-instances] [ 1 of 11] Compiling Data.Binary.Instances.CaseInsensitive ( src/Data/Binary/Instances/CaseInsensitive.hs, dist/build/Data/Binary/Instances/CaseInsensitive.p_o )
1738.18 s
[binary-instances] [ 2 of 11] Compiling Data.Binary.Instances.Hashable ( src/Data/Binary/Instances/Hashable.hs, dist/build/Data/Binary/Instances/Hashable.p_o )
1738.18 s
[binary-instances] [ 3 of 11] Compiling Data.Binary.Instances.Primitive ( src/Data/Binary/Instances/Primitive.hs, dist/build/Data/Binary/Instances/Primitive.p_o )
1738.18 s
[binary-instances] [ 4 of 11] Compiling Data.Binary.Instances.Scientific ( src/Data/Binary/Instances/Scientific.hs, dist/build/Data/Binary/Instances/Scientific.p_o )
1738.18 s
[binary-instances] [ 5 of 11] Compiling Data.Binary.Instances.Tagged ( src/Data/Binary/Instances/Tagged.hs, dist/build/Data/Binary/Instances/Tagged.p_o )
1738.18 s
[binary-instances] [ 6 of 11] Compiling Data.Binary.Instances.Text ( src/Data/Binary/Instances/Text.hs, dist/build/Data/Binary/Instances/Text.p_o )
1738.18 s
[binary-instances] [ 7 of 11] Compiling Data.Binary.Instances.Time ( src/Data/Binary/Instances/Time.hs, dist/build/Data/Binary/Instances/Time.p_o )
1738.18 s
[binary-instances] [ 8 of 11] Compiling Data.Binary.Instances.UnorderedContainers ( src/Data/Binary/Instances/UnorderedContainers.hs, dist/build/Data/Binary/Instances/UnorderedContainers.p_o )
1738.18 s
[binary-instances] [ 9 of 11] Compiling Data.Binary.Instances.Vector ( src/Data/Binary/Instances/Vector.hs, dist/build/Data/Binary/Instances/Vector.p_o )
1738.18 s
[binary-instances] [10 of 11] Compiling Data.Binary.Instances.Aeson ( src/Data/Binary/Instances/Aeson.hs, dist/build/Data/Binary/Instances/Aeson.p_o )
1738.18 s
[binary-instances] [11 of 11] Compiling Data.Binary.Instances ( src/Data/Binary/Instances.hs, dist/build/Data/Binary/Instances.p_o )
1738.18 s
[binary-instances] buildPhase completed in 40 seconds
1738.18 s
[binary-instances] Phase: haddockPhase
1738.18 s
[binary-instances] Preprocessing library for binary-instances-1.0.6..
1738.18 s
[binary-instances] Running Haddock on library for binary-instances-1.0.6..
1738.18 s
[binary-instances] Warning: The documentation for the following packages are not installed. No
1738.18 s
[binary-instances] links will be generated to these packages: vector-0.13.2.0
1738.18 s
[binary-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1738.18 s
[binary-instances] [ 1 of 11] Compiling Data.Binary.Instances.CaseInsensitive ( src/Data/Binary/Instances/CaseInsensitive.hs, nothing )
1738.18 s
[binary-instances] [ 2 of 11] Compiling Data.Binary.Instances.Hashable ( src/Data/Binary/Instances/Hashable.hs, nothing )
1738.18 s
[binary-instances] [ 3 of 11] Compiling Data.Binary.Instances.Primitive ( src/Data/Binary/Instances/Primitive.hs, nothing )
1738.18 s
[binary-instances] [ 4 of 11] Compiling Data.Binary.Instances.Scientific ( src/Data/Binary/Instances/Scientific.hs, nothing )
1738.18 s
[binary-instances] [ 5 of 11] Compiling Data.Binary.Instances.Tagged ( src/Data/Binary/Instances/Tagged.hs, nothing )
1738.18 s
[binary-instances] [ 6 of 11] Compiling Data.Binary.Instances.Text ( src/Data/Binary/Instances/Text.hs, nothing )
1738.18 s
[binary-instances] [ 7 of 11] Compiling Data.Binary.Instances.Time ( src/Data/Binary/Instances/Time.hs, nothing )
1738.18 s
[binary-instances] [ 8 of 11] Compiling Data.Binary.Instances.UnorderedContainers ( src/Data/Binary/Instances/UnorderedContainers.hs, nothing )
1738.18 s
[binary-instances] [ 9 of 11] Compiling Data.Binary.Instances.Vector ( src/Data/Binary/Instances/Vector.hs, nothing )
1738.18 s
[binary-instances] [10 of 11] Compiling Data.Binary.Instances.Aeson ( src/Data/Binary/Instances/Aeson.hs, nothing )
1738.18 s
[binary-instances] [11 of 11] Compiling Data.Binary.Instances ( src/Data/Binary/Instances.hs, nothing )
1738.18 s
[binary-instances] Haddock coverage:
1738.18 s
[binary-instances] 0% ( 0 / 1) in 'Data.Binary.Instances.CaseInsensitive'
1738.18 s
[binary-instances] Missing documentation for:
1738.18 s
[binary-instances] Module header
1738.18 s
[binary-instances] 0% ( 0 / 1) in 'Data.Binary.Instances.Hashable'
1738.18 s
[binary-instances] Missing documentation for:
1738.18 s
[binary-instances] Module header
1738.18 s
[constraints-extras] Preprocessing executable 'readme' for constraints-extras-0.4.0.2..
1738.18 s
[constraints-extras] Building executable 'readme' for constraints-extras-0.4.0.2..
1738.18 s
[constraints-extras] [1 of 1] Compiling Main ( README.lhs, dist/build/readme/readme-tmp/Main.o )
1738.18 s
[constraints-extras]
1738.18 s
[constraints-extras] README.lhs:29:13: warning : [ GHC-39567 ] [ -Wstar-is-type ]
1738.18 s
[constraints-extras] Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
1738.18 s
[constraints-extras] relies on the StarIsType extension, which will become
1738.18 s
[constraints-extras] deprecated in the future.
1738.18 s
[constraints-extras] Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.
1738.18 s
[constraints-extras] |
1738.18 s
[constraints-extras] 29 | > data A :: * -> * where
1738.18 s
[constraints-extras] | ^
1738.18 s
[constraints-extras]
1738.18 s
[constraints-extras] README.lhs:29:18: warning : [ GHC-39567 ] [ -Wstar-is-type ]
1738.18 s
[constraints-extras] Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
1738.18 s
[constraints-extras] relies on the StarIsType extension, which will become
1738.18 s
[constraints-extras] deprecated in the future.
1738.18 s
[constraints-extras] Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.
1738.18 s
[constraints-extras] |
1738.18 s
[constraints-extras] 29 | > data A :: * -> * where
1738.18 s
[constraints-extras] | ^
1738.18 s
[constraints-extras]
1738.19 s
[constraints-extras] README.lhs:35:13: warning : [ GHC-39567 ] [ -Wstar-is-type ]
1738.19 s
[constraints-extras] Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
1738.19 s
[constraints-extras] relies on the StarIsType extension, which will become
1738.19 s
[constraints-extras] deprecated in the future.
1738.19 s
[constraints-extras] Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.
1738.19 s
[constraints-extras] |
1738.19 s
[constraints-extras] 35 | > data B :: * -> * where
1738.19 s
[constraints-extras] | ^
1738.19 s
[constraints-extras]
1738.19 s
[constraints-extras] README.lhs:35:18: warning : [ GHC-39567 ] [ -Wstar-is-type ]
1738.19 s
[constraints-extras] Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
1738.19 s
[constraints-extras] relies on the StarIsType extension, which will become
1738.19 s
[constraints-extras] deprecated in the future.
1738.19 s
[constraints-extras] Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.
1738.19 s
[constraints-extras] |
1738.19 s
[constraints-extras] 35 | > data B :: * -> * where
1738.19 s
[constraints-extras] | ^
1738.19 s
[constraints-extras]
1738.19 s
[constraints-extras] README.lhs:41:14: warning : [ GHC-39567 ] [ -Wstar-is-type ]
1738.19 s
[constraints-extras] Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
1738.19 s
[constraints-extras] relies on the StarIsType extension, which will become
1738.19 s
[constraints-extras] deprecated in the future.
1738.19 s
[constraints-extras] Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.
1738.19 s
[constraints-extras] |
1738.19 s
[constraints-extras] 41 | > data V :: (* -> *) -> * where
1738.19 s
[constraints-extras] | ^
1738.19 s
[constraints-extras]
1738.19 s
[constraints-extras] README.lhs:41:19: warning : [ GHC-39567 ] [ -Wstar-is-type ]
1738.19 s
[constraints-extras] Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
1738.19 s
[constraints-extras] relies on the StarIsType extension, which will become
1738.19 s
[constraints-extras] deprecated in the future.
1738.19 s
[constraints-extras] Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.
1738.19 s
[constraints-extras] |
1738.19 s
[constraints-extras] 41 | > data V :: (* -> * ) -> * where
1738.19 s
[constraints-extras] | ^
1738.19 s
[constraints-extras]
1738.19 s
[constraints-extras] README.lhs:41:25: warning : [ GHC-39567 ] [ -Wstar-is-type ]
1738.19 s
[constraints-extras] Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
1738.19 s
[constraints-extras] relies on the StarIsType extension, which will become
1738.19 s
[constraints-extras] deprecated in the future.
1738.19 s
[constraints-extras] Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.
1738.19 s
[constraints-extras] |
1738.19 s
[constraints-extras] 41 | > data V :: (* -> *) -> * where
1738.19 s
[constraints-extras] | ^
1738.19 s
[constraints-extras]
1738.19 s
[constraints-extras] README.lhs:46:24: warning : [ GHC-39567 ] [ -Wstar-is-type ]
1738.19 s
[deriving-aeson] Preprocessing test suite 'test' for deriving-aeson-0.2.10..
1738.19 s
[deriving-aeson] Building test suite 'test' for deriving-aeson-0.2.10..
1738.19 s
[deriving-aeson] [1 of 1] Compiling Main ( tests/test.hs, dist/build/test/test-tmp/Main.o )
1738.19 s
[deriving-aeson] [2 of 2] Linking dist/build/test/test
1738.19 s
[deriving-aeson] buildPhase completed in 1 minutes 5 seconds
1738.19 s
[deriving-aeson] Phase: checkPhase
1738.19 s
[deriving-aeson] Running 1 test suites...
1738.19 s
[deriving-aeson] Test suite test: RUNNING...
1738.19 s
[deriving-aeson] [{"id":42,"name":"Alice","user_type":"human"},{"id":43,"name":"Bob","api_token":"xyz","user_type":"bot"}]
1738.19 s
[deriving-aeson] {"Foo":0,"Bar":1}
1738.19 s
[deriving-aeson] {"something":0,"somethingElse":1}
1738.19 s
[deriving-aeson] Test suite test: PASS
1738.19 s
[deriving-aeson] Test suite logged to: dist/test/deriving-aeson-0.2.10-test.log
1738.19 s
[deriving-aeson] 1 of 1 test suites (1 of 1 test cases) passed.
1738.19 s
[deriving-aeson] Phase: haddockPhase
1738.19 s
[deriving-aeson] Preprocessing library for deriving-aeson-0.2.10..
1738.19 s
[deriving-aeson] Running Haddock on library for deriving-aeson-0.2.10..
1738.19 s
[deriving-aeson] Warning: The documentation for the following packages are not installed. No
1738.19 s
[deriving-aeson] links will be generated to these packages: vector-0.13.2.0
1738.19 s
[deriving-aeson] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1738.19 s
[deriving-aeson] [1 of 2] Compiling Deriving.Aeson ( src/Deriving/Aeson.hs, nothing )
1738.19 s
[deriving-aeson] [2 of 2] Compiling Deriving.Aeson.Stock ( src/Deriving/Aeson/Stock.hs, nothing )
1738.19 s
[deriving-aeson] Haddock coverage:
1738.19 s
[deriving-aeson] 100% ( 28 / 28) in 'Deriving.Aeson'
1738.19 s
[deriving-aeson] 91% ( 11 / 12) in 'Deriving.Aeson.Stock'
1738.19 s
[deriving-aeson] Missing documentation for:
1738.19 s
[deriving-aeson] Module header
1738.19 s
[deriving-aeson] Warning: Deriving.Aeson: could not find link destinations for:
1738.19 s
[deriving-aeson] - Data.Vector.Vector
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Fingerprint
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_GeneralCategory
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_SrcLoc
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Down
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Tuple15
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Tuple14
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Tuple13
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Tuple12
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Tuple11
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Tuple10
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Tuple9
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Tuple8
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Tuple7
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Tuple6
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Tuple5
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Tuple4
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Tuple3
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Tuple2
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Solo
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Unit
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Proxy
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Ordering
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Bool
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Either
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Maybe
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_NonEmpty
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_List
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Void
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_M1
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_V1
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_U1
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Par1
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Rec1
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_K1
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_:+:
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_:*:
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_:.:
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_R:UReckWordp
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_R:UReckIntp
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_R:UReckDoublep
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_R:UReckCharp
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_R:UReckPtrp
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Fixity
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_Associativity
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_SourceUnpackedness
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_SourceStrictness
1738.19 s
[deriving-aeson] - GHC.Generics.Rep_DecidedStrictness
1738.19 s
[deriving-aeson] - Data.Monoid.Rep_Ap
1738.19 s
[deriving-aeson] - Data.Monoid.Rep_Last
1738.19 s
[deriving-aeson] - Data.Monoid.Rep_First
1738.19 s
[deriving-aeson] - Data.Functor.Const.Rep_Const
1738.20 s
[deriving-aeson] - GHC.RTS.Flags.Rep_RTSFlags
1738.20 s
[deriving-aeson] - GHC.RTS.Flags.Rep_ParFlags
1738.20 s
[deriving-aeson] - GHC.RTS.Flags.Rep_TickyFlags
1738.20 s
[deriving-aeson] - GHC.RTS.Flags.Rep_TraceFlags
1738.20 s
[deriving-aeson] - GHC.RTS.Flags.Rep_DoTrace
1738.20 s
[deriving-aeson] - GHC.RTS.Flags.Rep_ProfFlags
1738.20 s
[deriving-aeson] - GHC.RTS.Flags.Rep_DoHeapProfile
1738.20 s
[deriving-aeson] - GHC.RTS.Flags.Rep_CCFlags
1738.20 s
[deriving-aeson] - GHC.RTS.Flags.Rep_DoCostCentres
1738.20 s
[deriving-aeson] - GHC.RTS.Flags.Rep_DebugFlags
1738.20 s
[deriving-aeson] - GHC.RTS.Flags.Rep_MiscFlags
1738.20 s
[deriving-aeson] - GHC.RTS.Flags.Rep_ConcFlags
1738.20 s
[deriving-aeson] - GHC.RTS.Flags.Rep_GCFlags
1738.20 s
[deriving-aeson] - GHC.RTS.Flags.Rep_GiveGCStats
1738.20 s
[deriving-aeson] - Data.Functor.Identity.Rep_Identity
1738.20 s
[deriving-aeson] - Control.Arrow.Rep_Kleisli
1738.20 s
[deriving-aeson] - Control.Applicative.Rep_ZipList
1738.20 s
[deriving-aeson] - Control.Applicative.Rep_WrappedArrow
1738.20 s
[deriving-aeson] - Control.Applicative.Rep_WrappedMonad
1738.20 s
[deriving-aeson] - Data.Version.Rep_Version
1738.20 s
[deriving-aeson] - GHC.ByteOrder.Rep_ByteOrder
1738.20 s
[deriving-aeson] - GHC.Stats.Rep_RTSStats
1738.20 s
[deriving-aeson] - GHC.Stats.Rep_GCDetails
1738.20 s
[deriving-aeson] - Data.Semigroup.Rep_WrappedMonoid
1738.20 s
[deriving-aeson] - Data.Semigroup.Rep_Last
1738.20 s
[deriving-aeson] - Data.Semigroup.Rep_First
1738.20 s
[deriving-aeson] - Data.Semigroup.Rep_Arg
1738.20 s
[deriving-aeson] - Data.Semigroup.Rep_Max
1738.20 s
[deriving-aeson] - Data.Semigroup.Rep_Min
1738.20 s
[deriving-aeson] - Data.Complex.Rep_Complex
1738.20 s
[deriving-aeson] - Data.Functor.Sum.Rep_Sum
1738.20 s
[deriving-aeson] - Data.Functor.Product.Rep_Product
1738.20 s
[deriving-aeson] - Data.Functor.Compose.Rep_Compose
1738.20 s
[deriving-aeson] - GHC.Generics.Rep_R:UReckFloatp
1738.20 s
[deriving-aeson] - Data.Vector.Generic.Base.Vector
1738.20 s
[deriving-aeson] - Data.Vector.Unboxed.Base.Vector
1738.20 s
[deriving-aeson] - Deriving.Aeson.NonEmptyString
1738.20 s
[enummapset] [8 of 8] Linking dist/build/intset-properties/intset-properties
1738.20 s
[enummapset] Preprocessing library for enummapset-0.7.3.0..
1738.20 s
[enummapset] Building library for enummapset-0.7.3.0..
1738.20 s
[enummapset] [1 of 5] Compiling Data.EnumSet ( Data/EnumSet.hs, dist/build/Data/EnumSet.o, dist/build/Data/EnumSet.dyn_o )
1738.20 s
[enummapset] [2 of 5] Compiling Data.EnumMap.Base ( Data/EnumMap/Base.hs, dist/build/Data/EnumMap/Base.o, dist/build/Data/EnumMap/Base.dyn_o )
1738.20 s
[enummapset] [3 of 5] Compiling Data.EnumMap.Strict ( Data/EnumMap/Strict.hs, dist/build/Data/EnumMap/Strict.o, dist/build/Data/EnumMap/Strict.dyn_o )
1738.20 s
[enummapset] [4 of 5] Compiling Data.EnumMap.Lazy ( Data/EnumMap/Lazy.hs, dist/build/Data/EnumMap/Lazy.o, dist/build/Data/EnumMap/Lazy.dyn_o )
1738.20 s
[enummapset] [5 of 5] Compiling Data.EnumMap ( Data/EnumMap.hs, dist/build/Data/EnumMap.o, dist/build/Data/EnumMap.dyn_o )
1738.20 s
[enummapset] [1 of 5] Compiling Data.EnumSet ( Data/EnumSet.hs, dist/build/Data/EnumSet.p_o )
1738.20 s
[enummapset] [2 of 5] Compiling Data.EnumMap.Base ( Data/EnumMap/Base.hs, dist/build/Data/EnumMap/Base.p_o )
1738.20 s
[enummapset] [3 of 5] Compiling Data.EnumMap.Strict ( Data/EnumMap/Strict.hs, dist/build/Data/EnumMap/Strict.p_o )
1738.20 s
[enummapset] [4 of 5] Compiling Data.EnumMap.Lazy ( Data/EnumMap/Lazy.hs, dist/build/Data/EnumMap/Lazy.p_o )
1738.20 s
[enummapset] [5 of 5] Compiling Data.EnumMap ( Data/EnumMap.hs, dist/build/Data/EnumMap.p_o )
1738.20 s
[enummapset] buildPhase completed in 1 minutes 3 seconds
1738.20 s
[enummapset] Phase: checkPhase
1738.20 s
[enummapset] Running 1 test suites...
1738.20 s
[enummapset] Test suite intset-properties: RUNNING...
1738.20 s
[enummapset] lookupLT: [OK]
1738.20 s
[enummapset] lookupGT: [OK]
1738.20 s
[enummapset] lookupLE: [OK]
1738.20 s
[enummapset] lookupGE: [OK]
1738.20 s
[enummapset] split: [OK]
1738.20 s
[enummapset] encode set: [OK]
1738.20 s
[enummapset] encode map: [OK]
1738.20 s
[enummapset] decode set: [OK]
1738.20 s
[enummapset] decode map: [OK]
1738.20 s
[enummapset] prop_json_trip_set: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_json_trip_map: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_json_trip_map2: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_Valid: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_EmptyValid: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_SingletonValid: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_InsertIntoEmptyValid: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_Single: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_Member: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_NotMember: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_LookupLT: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_LookupGT: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_LookupLE: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_LookupGE: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_InsertDelete: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_MemberFromList: [OK, passed 100 tests]
1738.20 s
[enummapset] prop_UnionInsert: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_UnionAssoc: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_UnionComm: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_Diff: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_Int: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_Ordered: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_List: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_DescList: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_AscDescList: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_fromList: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_isProperSubsetOf: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_isProperSubsetOf2: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_isSubsetOf: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_isSubsetOf2: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_size: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_findMax: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_findMin: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_ord: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_readShow: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_foldR: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_foldR': [OK, passed 100 tests]
1738.21 s
[enummapset] prop_foldL: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_foldL': [OK, passed 100 tests]
1738.21 s
[enummapset] prop_map: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_maxView: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_minView: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_split: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_splitMember: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_partition: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_filter: [OK, passed 100 tests]
1738.21 s
[enummapset] prop_bitcount: [OK, passed 100 tests]
1738.21 s
[enummapset]
1738.21 s
[enummapset] Properties Test Cases Total
1738.21 s
[enummapset] Passed 47 9 56
1738.21 s
[enummapset] Failed 0 0 0
1738.21 s
[enummapset] Total 47 9 56
1738.21 s
[enummapset] Test suite intset-properties: PASS
1738.21 s
[enummapset] Test suite logged to: dist/test/enummapset-0.7.3.0-intset-properties.log
1738.21 s
[enummapset] 1 of 1 test suites (1 of 1 test cases) passed.
1738.21 s
[enummapset] Phase: haddockPhase
1738.21 s
[enummapset] Preprocessing test suite 'intset-properties' for enummapset-0.7.3.0..
1738.21 s
[enummapset] Preprocessing library for enummapset-0.7.3.0..
1738.21 s
[enummapset] Running Haddock on library for enummapset-0.7.3.0..
1738.21 s
[enummapset] Warning: The documentation for the following packages are not installed. No
1738.21 s
[enummapset] links will be generated to these packages: vector-0.13.2.0
1738.21 s
[lens] [24 of 85] Compiling Control.Lens.Getter ( src/Control/Lens/Getter.hs, dist/build/Control/Lens/Getter.p_o )
1738.21 s
[lens] [25 of 85] Compiling Control.Lens.Review ( src/Control/Lens/Review.hs, dist/build/Control/Lens/Review.p_o )
1738.21 s
[lens] [26 of 85] Compiling Control.Lens.Prism ( src/Control/Lens/Prism.hs, dist/build/Control/Lens/Prism.p_o )
1738.21 s
[lens] [27 of 85] Compiling Control.Lens.Fold ( src/Control/Lens/Fold.hs, dist/build/Control/Lens/Fold.p_o )
1738.21 s
[lens] [28 of 85] Compiling Control.Lens.Traversal ( src/Control/Lens/Traversal.hs, dist/build/Control/Lens/Traversal.p_o )
1738.21 s
[lens] [29 of 85] Compiling Control.Lens.Level ( src/Control/Lens/Level.hs, dist/build/Control/Lens/Level.p_o )
1738.21 s
[lens] [30 of 85] Compiling Control.Lens.Reified ( src/Control/Lens/Reified.hs, dist/build/Control/Lens/Reified.p_o )
1738.21 s
[lens] [31 of 85] Compiling Control.Lens.Internal.Exception ( src/Control/Lens/Internal/Exception.hs, dist/build/Control/Lens/Internal/Exception.p_o )
1738.21 s
[lens] [32 of 85] Compiling Control.Lens.Indexed ( src/Control/Lens/Indexed.hs, dist/build/Control/Lens/Indexed.p_o )
1738.21 s
[lens] [33 of 85] Compiling Control.Lens.Internal.ByteString ( src/Control/Lens/Internal/ByteString.hs, dist/build/Control/Lens/Internal/ByteString.p_o )
1738.21 s
[lens] [34 of 85] Compiling Control.Lens.Equality ( src/Control/Lens/Equality.hs, dist/build/Control/Lens/Equality.p_o )
1738.21 s
[lens] [35 of 85] Compiling Control.Lens.Iso ( src/Control/Lens/Iso.hs, dist/build/Control/Lens/Iso.p_o )
1738.21 s
[lens] [36 of 85] Compiling Control.Lens.Empty ( src/Control/Lens/Empty.hs, dist/build/Control/Lens/Empty.p_o )
1738.21 s
[lens] [37 of 85] Compiling Control.Lens.Cons ( src/Control/Lens/Cons.hs, dist/build/Control/Lens/Cons.p_o )
1738.21 s
[lens] [38 of 85] Compiling Control.Lens.Internal.Deque ( src/Control/Lens/Internal/Deque.hs, dist/build/Control/Lens/Internal/Deque.p_o )
1738.21 s
[lens] [39 of 85] Compiling Control.Lens.Wrapped ( src/Control/Lens/Wrapped.hs, dist/build/Control/Lens/Wrapped.p_o )
1738.21 s
[lens] [40 of 85] Compiling Control.Lens.Internal.TH ( src/Control/Lens/Internal/TH.hs, dist/build/Control/Lens/Internal/TH.p_o )
1738.21 s
[lens] [41 of 85] Compiling Control.Lens.Zoom ( src/Control/Lens/Zoom.hs, dist/build/Control/Lens/Zoom.p_o )
1738.21 s
[lens] [42 of 85] Compiling Data.Data.Lens ( src/Data/Data/Lens.hs, dist/build/Data/Data/Lens.p_o )
1738.21 s
[lens] [43 of 85] Compiling Control.Lens.Plated ( src/Control/Lens/Plated.hs, dist/build/Control/Lens/Plated.p_o )
1738.21 s
[lens] [44 of 85] Compiling Data.HashSet.Lens ( src/Data/HashSet/Lens.hs, dist/build/Data/HashSet/Lens.p_o )
1738.21 s
[lens] [45 of 85] Compiling Data.List.Lens ( src/Data/List/Lens.hs, dist/build/Data/List/Lens.p_o )
1738.21 s
[lens] [46 of 85] Compiling Data.Map.Lens ( src/Data/Map/Lens.hs, dist/build/Data/Map/Lens.p_o )
1738.21 s
[lens] [47 of 85] Compiling Data.Set.Lens ( src/Data/Set/Lens.hs, dist/build/Data/Set/Lens.p_o )
1738.21 s
[lens] [48 of 85] Compiling Data.Text.Lazy.Lens ( src/Data/Text/Lazy/Lens.hs, dist/build/Data/Text/Lazy/Lens.p_o )
1738.21 s
[lens] [49 of 85] Compiling Data.Text.Strict.Lens ( src/Data/Text/Strict/Lens.hs, dist/build/Data/Text/Strict/Lens.p_o )
1738.21 s
[lens] [50 of 85] Compiling Data.Text.Lens ( src/Data/Text/Lens.hs, dist/build/Data/Text/Lens.p_o )
1738.21 s
[lens] [51 of 85] Compiling Data.Vector.Generic.Lens ( src/Data/Vector/Generic/Lens.hs, dist/build/Data/Vector/Generic/Lens.p_o )
1738.21 s
[lens] [52 of 85] Compiling Control.Lens.Each ( src/Control/Lens/Each.hs, dist/build/Control/Lens/Each.p_o )
1738.21 s
[lens] [53 of 85] Compiling Control.Lens.At ( src/Control/Lens/At.hs, dist/build/Control/Lens/At.p_o )
1738.21 s
[lens] [54 of 85] Compiling Language.Haskell.TH.Lens ( src/Language/Haskell/TH/Lens.hs, dist/build/Language/Haskell/TH/Lens.p_o )
1738.21 s
[lens] [55 of 85] Compiling Control.Lens.Internal.PrismTH ( src/Control/Lens/Internal/PrismTH.hs, dist/build/Control/Lens/Internal/PrismTH.p_o )
1738.21 s
[lens] [56 of 85] Compiling Control.Lens.Internal.FieldTH ( src/Control/Lens/Internal/FieldTH.hs, dist/build/Control/Lens/Internal/FieldTH.p_o )
1738.21 s
[lens] [57 of 85] Compiling Control.Lens.TH ( src/Control/Lens/TH.hs, dist/build/Control/Lens/TH.p_o )
1738.21 s
[microaeson] [2 of 3] Compiling Data.Aeson.Micro.Scanner ( dist/build/Data/Aeson/Micro/Scanner.hs, dist/build/Data/Aeson/Micro/Scanner.p_o )
1738.21 s
[microaeson] [3 of 3] Compiling Data.Aeson.Micro ( src/Data/Aeson/Micro.hs, dist/build/Data/Aeson/Micro.p_o )
1738.21 s
[microaeson] Preprocessing test suite 'microaeson' for microaeson-0.1.0.2..
1738.21 s
[microaeson] Building test suite 'microaeson' for microaeson-0.1.0.2..
1738.21 s
[microaeson] [1 of 1] Compiling Main ( src-tests/tests.hs, dist/build/microaeson/microaeson-tmp/Main.o )
1738.21 s
[microaeson] [2 of 2] Linking dist/build/microaeson/microaeson
1738.21 s
[microaeson] buildPhase completed in 31 seconds
1738.21 s
[microaeson] Phase: checkPhase
1738.21 s
[microaeson] Running 1 test suites...
1738.21 s
[microaeson] Test suite microaeson: RUNNING...
1738.21 s
[microaeson] Tests
1738.21 s
[microaeson] QC
1738.21 s
[microaeson] roundtrip(ref/ref): OK (20.25s)
1738.21 s
[microaeson] +++ OK, passed 100 tests.
1738.21 s
[microaeson] roundtrip(ref/iut): OK (11.52s)
1738.21 s
[microaeson] +++ OK, passed 100 tests.
1738.21 s
[microaeson] roundtrip(iut/ref): OK (10.80s)
1738.21 s
[microaeson] +++ OK, passed 100 tests.
1738.21 s
[microaeson] roundtrip(iut/iut): OK (13.61s)
1738.21 s
[microaeson] +++ OK, passed 100 tests.
1738.21 s
[microaeson]
1738.21 s
[microaeson] All 4 tests passed (56.18s)
1738.21 s
[microaeson] Test suite microaeson: PASS
1738.21 s
[microaeson] Test suite logged to: dist/test/microaeson-0.1.0.2-microaeson.log
1738.21 s
[microaeson] 1 of 1 test suites (1 of 1 test cases) passed.
1738.21 s
[microaeson] checkPhase completed in 57 seconds
1738.21 s
[microaeson] Phase: haddockPhase
1738.21 s
[microaeson] Preprocessing library for microaeson-0.1.0.2..
1738.21 s
[microaeson] Running Haddock on library for microaeson-0.1.0.2..
1738.21 s
[microaeson] Warning: The documentation for the following packages are not installed. No
1738.21 s
[microaeson] links will be generated to these packages: fail-4.9.0.0
1738.21 s
[microaeson] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1738.21 s
[microaeson] [1 of 3] Compiling Data.Aeson.Micro.Parser ( src/Data/Aeson/Micro/Parser.hs, nothing )
1738.21 s
[microaeson] [2 of 3] Compiling Data.Aeson.Micro.Scanner ( dist/build/Data/Aeson/Micro/Scanner.hs, nothing )
1738.21 s
[microaeson] [3 of 3] Compiling Data.Aeson.Micro ( src/Data/Aeson/Micro.hs, nothing )
1738.21 s
[microaeson] Haddock coverage:
1738.21 s
[microaeson] Warning: 'String' is ambiguous. It is defined
1738.21 s
[microaeson] * at src/Data/Aeson/Micro.hs:103:14
1738.21 s
[microaeson] * in ‘GHC.Base’
1738.21 s
[microaeson] You may be able to disambiguate the identifier by qualifying it or
1738.21 s
[microaeson] by specifying the type/value namespace explicitly.
1738.21 s
[microaeson] Defaulting to the one defined at src/Data/Aeson/Micro.hs:103:14
1738.21 s
[microaeson] Warning: 'Object' is ambiguous. It is defined
1738.21 s
[microaeson] * at src/Data/Aeson/Micro.hs:101:14
1738.21 s
[microaeson] * at src/Data/Aeson/Micro.hs:118:1
1738.21 s
[microaeson] You may be able to disambiguate the identifier by qualifying it or
1738.21 s
[microaeson] by specifying the type/value namespace explicitly.
1738.21 s
[microaeson] Defaulting to the one defined at src/Data/Aeson/Micro.hs:118:1
1738.21 s
[microaeson] Warning: 'HashMap' is out of scope.
1738.21 s
[microaeson] If you qualify the identifier, haddock can try to link it anyway.
1738.21 s
[microaeson] Warning: 'Vector' is out of scope.
1738.22 s
[microaeson] If you qualify the identifier, haddock can try to link it anyway.
1738.22 s
[microaeson] Warning: 'Scientific' is out of scope.
1738.22 s
[microaeson] If you qualify the identifier, haddock can try to link it anyway.
1738.22 s
[microaeson] 72% ( 24 / 33) in 'Data.Aeson.Micro'
1738.22 s
[microaeson] Missing documentation for:
1738.22 s
[microaeson] .: (src/Data/Aeson/Micro.hs:141)
1738.22 s
[microaeson] .:? (src/Data/Aeson/Micro.hs:144)
1738.22 s
[microaeson] .:! (src/Data/Aeson/Micro.hs:147)
1738.22 s
[microaeson] .!= (src/Data/Aeson/Micro.hs:150)
1738.22 s
[microaeson] withObject (src/Data/Aeson/Micro.hs:437)
1738.22 s
[microaeson] withText (src/Data/Aeson/Micro.hs:429)
1738.22 s
[microaeson] withArray (src/Data/Aeson/Micro.hs:433)
1738.22 s
[microaeson] withNumber (src/Data/Aeson/Micro.hs:441)
1738.22 s
[microaeson] withBool (src/Data/Aeson/Micro.hs:425)
1738.22 s
[microaeson] Warning: Data.Aeson.Micro: could not find link destinations for:
1738.22 s
[microaeson] - Data.Aeson.Micro.Rep_Value
1738.22 s
[path] [5 of 6] Compiling Path ( src/Path.hs, dist/build/Path.o, dist/build/Path.dyn_o )
1738.22 s
[path] [6 of 6] Compiling Path.Windows ( src/Path/Windows.hs, dist/build/Path/Windows.o, dist/build/Path/Windows.dyn_o )
1738.22 s
[path]
1738.22 s
[path] src/Path/Include.hs:487:11: warning : [ GHC-53633 ] [ -Woverlapping-patterns ]
1738.22 s
[path] Pattern match is redundant
1738.22 s
[path] In an equation for ‘normalizeDrive’:
1738.22 s
[path] normalizeDrive | otherwise = ...
1738.22 s
[path] |
1738.22 s
[path] 487 | | otherwise = id
1738.22 s
[path] | ^^^^^^^^^
1738.22 s
[path]
1738.22 s
[path] src/Path/Include.hs:851:5: warning : [ GHC-53633 ] [ -Woverlapping-patterns ]
1738.22 s
[path] Pattern match is redundant
1738.22 s
[path] In an equation for ‘normalizeFilePath’:
1738.22 s
[path] normalizeFilePath | otherwise = ...
1738.22 s
[path] |
1738.22 s
[path] 851 | | otherwise = normalizeLeadingSeps . FilePath.normalise
1738.22 s
[path] | ^^^^^^^^^
1738.22 s
[path] [1 of 6] Compiling Path.Internal.Posix ( src/Path/Internal/Posix.hs, dist/build/Path/Internal/Posix.p_o )
1738.22 s
[path] [2 of 6] Compiling Path.Internal ( src/Path/Internal.hs, dist/build/Path/Internal.p_o )
1738.22 s
[path] [3 of 6] Compiling Path.Internal.Windows ( src/Path/Internal/Windows.hs, dist/build/Path/Internal/Windows.p_o )
1738.22 s
[path] [4 of 6] Compiling Path.Posix ( src/Path/Posix.hs, dist/build/Path/Posix.p_o )
1738.22 s
[path]
1738.22 s
[path] src/Path/Include.hs:486:11: warning : [ GHC-53633 ] [ -Woverlapping-patterns ]
1738.22 s
[path] Pattern match is redundant
1738.22 s
[path] In an equation for ‘normalizeDrive’: normalizeDrive | False = ...
1738.22 s
[path] |
1738.22 s
[path] 486 | | IS_WI NDOWS = normalizeTrailingSeps
1738.22 s
[path] | ^^^^^
1738.22 s
[path]
1738.22 s
[path] src/Path/Include.hs:850:5: warning : [ GHC-53633 ] [ -Woverlapping-patterns ]
1738.22 s
[path] Pattern match is redundant
1738.22 s
[path] In an equation for ‘normalizeFilePath’:
1738.22 s
[path] normalizeFilePath | False = ...
1738.22 s
[path] |
1738.22 s
[path] 850 | | IS_WI NDOWS = normalizeWindowsSeps . FilePath.normalise
1738.22 s
[path] | ^^^^^
1738.22 s
[path] [5 of 6] Compiling Path ( src/Path.hs, dist/build/Path.p_o )
1738.22 s
[path] [6 of 6] Compiling Path.Windows ( src/Path/Windows.hs, dist/build/Path/Windows.p_o )
1738.22 s
[path]
1738.22 s
[path] src/Path/Include.hs:487:11: warning : [ GHC-53633 ] [ -Woverlapping-patterns ]
1738.22 s
[path] Pattern match is redundant
1738.22 s
[path] In an equation for ‘normalizeDrive’:
1738.22 s
[path] normalizeDrive | otherwise = ...
1738.22 s
[path] |
1738.22 s
[path] 487 | | otherwise = id
1738.22 s
[path] | ^^^^^^^^^
1738.22 s
[path]
1738.22 s
[path] src/Path/Include.hs:851:5: warning : [ GHC-53633 ] [ -Woverlapping-patterns ]
1738.22 s
[path] Pattern match is redundant
1738.22 s
[path] In an equation for ‘normalizeFilePath’:
1738.22 s
[path] normalizeFilePath | otherwise = ...
1738.22 s
[path] |
1738.22 s
[path] 851 | | otherwise = normalizeLeadingSeps . FilePath.normalise
1738.22 s
[path] | ^^^^^^^^^
1738.22 s
[path] Preprocessing test suite 'validity-test' for path-0.9.5..
1738.22 s
[path] Building test suite 'validity-test' for path-0.9.5..
1738.22 s
[path] [1 of 2] Compiling Path.Gen ( test/Path/Gen.hs, dist/build/validity-test/validity-test-tmp/Path/Gen.o, dist/build/validity-test/validity-test-tmp/Path/Gen.dyn_o )
1738.22 s
[path] [2 of 2] Compiling Main ( test/ValidityTest.hs, dist/build/validity-test/validity-test-tmp/Main.o )
1738.22 s
[path] [3 of 3] Linking dist/build/validity-test/validity-test
1738.22 s
[path] Preprocessing test suite 'test' for path-0.9.5..
1738.22 s
[path] Building test suite 'test' for path-0.9.5..
1738.22 s
[quickcheck-classes] [ 2 of 12] Compiling Test.QuickCheck.Classes.Apply ( src/Test/QuickCheck/Classes/Apply.hs, dist/build/Test/QuickCheck/Classes/Apply.o, dist/build/Test/QuickCheck/Classes/Apply.dyn_o )
1738.22 s
[quickcheck-classes]
1738.22 s
[quickcheck-classes] src/Test/QuickCheck/Classes/Apply.hs:19:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1738.22 s
[quickcheck-classes] The import of ‘Data.Functor’ is redundant
1738.22 s
[quickcheck-classes] except perhaps to import instances from ‘Data.Functor’
1738.22 s
[quickcheck-classes] To import instances alone, use: import Data.Functor()
1738.22 s
[quickcheck-classes] |
1738.22 s
[quickcheck-classes] 19 | import Data.Functor
1738.22 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^
1738.22 s
[quickcheck-classes]
1738.22 s
[quickcheck-classes] src/Test/QuickCheck/Classes/Apply.hs:22:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1738.22 s
[quickcheck-classes] The import of ‘Test.QuickCheck.Arbitrary’ is redundant
1738.22 s
[quickcheck-classes] except perhaps to import instances from ‘Test.QuickCheck.Arbitrary’
1738.22 s
[quickcheck-classes] To import instances alone, use: import Test.QuickCheck.Arbitrary()
1738.22 s
[quickcheck-classes] |
1738.22 s
[quickcheck-classes] 22 | import Test.QuickCheck.Arbitrary (Arbitrary1(..))
1738.22 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1738.22 s
[quickcheck-classes]
1738.22 s
[quickcheck-classes] src/Test/QuickCheck/Classes/Apply.hs:23:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1738.22 s
[quickcheck-classes] The import of ‘Data.Functor.Classes’ is redundant
1738.22 s
[quickcheck-classes] except perhaps to import instances from ‘Data.Functor.Classes’
1738.22 s
[quickcheck-classes] To import instances alone, use: import Data.Functor.Classes()
1738.22 s
[quickcheck-classes] |
1738.22 s
[quickcheck-classes] 23 | import Data.Functor.Classes (Eq1,Show1)
1738.22 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1738.22 s
[quickcheck-classes]
1738.22 s
[quickcheck-classes] src/Test/QuickCheck/Classes/Apply.hs:24:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1738.22 s
[quickcheck-classes] The import of ‘Test.QuickCheck.Property’ is redundant
1738.22 s
[quickcheck-classes] except perhaps to import instances from ‘Test.QuickCheck.Property’
1738.22 s
[quickcheck-classes] To import instances alone, use: import Test.QuickCheck.Property()
1738.22 s
[quickcheck-classes] |
1738.22 s
[quickcheck-classes] 24 | import Test.QuickCheck.Property (Property)
1738.22 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1738.22 s
[quickcheck-classes] [ 3 of 12] Compiling Test.QuickCheck.Classes.Euclidean ( src/Test/QuickCheck/Classes/Euclidean.hs, dist/build/Test/QuickCheck/Classes/Euclidean.o, dist/build/Test/QuickCheck/Classes/Euclidean.dyn_o )
1738.22 s
[quickcheck-classes]
1738.22 s
[quickcheck-classes] src/Test/QuickCheck/Classes/Euclidean.hs:29:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1738.22 s
[quickcheck-classes] The import of ‘Test.QuickCheck.Property’ is redundant
1738.22 s
[quickcheck-classes] except perhaps to import instances from ‘Test.QuickCheck.Property’
1738.22 s
[quickcheck-classes] To import instances alone, use: import Test.QuickCheck.Property()
1738.22 s
[quickcheck-classes] |
1738.22 s
[quickcheck-classes] 29 | import Test.QuickCheck.Property (Property)
1738.22 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1738.22 s
[quickcheck-classes] [ 4 of 12] Compiling Test.QuickCheck.Classes.IsList ( src/Test/QuickCheck/Classes/IsList.hs, dist/build/Test/QuickCheck/Classes/IsList.o, dist/build/Test/QuickCheck/Classes/IsList.dyn_o )
1738.23 s
[quickcheck-classes] [ 5 of 12] Compiling Test.QuickCheck.Classes.Json ( src/Test/QuickCheck/Classes/Json.hs, dist/build/Test/QuickCheck/Classes/Json.o, dist/build/Test/QuickCheck/Classes/Json.dyn_o )
1738.23 s
[quickcheck-classes] [ 6 of 12] Compiling Test.QuickCheck.Classes.MVector ( src/Test/QuickCheck/Classes/MVector.hs, dist/build/Test/QuickCheck/Classes/MVector.o, dist/build/Test/QuickCheck/Classes/MVector.dyn_o )
1738.23 s
[quickcheck-classes]
1738.23 s
[quickcheck-classes] src/Test/QuickCheck/Classes/MVector.hs:20:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1738.23 s
[quickcheck-classes] The import of ‘Control.Applicative’ is redundant
1738.23 s
[quickcheck-classes] except perhaps to import instances from ‘Control.Applicative’
1738.23 s
[rebase] Dependency base >=4.13 && <5: using base-4.19.0.0
1738.23 s
[rebase] Dependency bifunctors >=5.6 && <5.7: using bifunctors-5.6.2
1738.23 s
[rebase] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.0.2
1738.23 s
[rebase] Dependency comonad >=5 && <5.1: using comonad-5.0.9
1738.23 s
[rebase] Dependency containers >=0.6 && <0.8: using containers-0.6.8
1738.23 s
[rebase] Dependency contravariant >=1.5 && <1.6: using contravariant-1.5.5
1738.23 s
[rebase] Dependency deepseq >=1.4 && <1.6: using deepseq-1.5.0.0
1738.23 s
[rebase] Dependency dlist >=0.8 && <1.1: using dlist-1.0
1738.23 s
[rebase] Dependency either >=5 && <5.1: using either-5.0.2
1738.23 s
[rebase] Dependency groups >=0.5.3 && <0.6: using groups-0.5.3
1738.23 s
[rebase] Dependency hashable >=1.3 && <1.6: using hashable-1.4.7.0
1738.23 s
[rebase] Dependency invariant >=0.5.5 && <0.7: using invariant-0.6.4
1738.23 s
[rebase] Dependency mtl >=2.2 && <2.4: using mtl-2.3.1
1738.23 s
[rebase] Dependency profunctors >=5.6 && <5.7: using profunctors-5.6.2
1738.23 s
[rebase] Dependency scientific >=0.3 && <0.4: using scientific-0.3.8.0
1738.23 s
[rebase] Dependency selective >=0.7 && <0.8: using selective-0.7.0.1
1738.23 s
[rebase] Dependency semigroupoids >=6 && <7: using semigroupoids-6.0.1
1738.23 s
[rebase] Dependency stm >=2.5 && <2.6: using stm-2.5.2.1
1738.23 s
[rebase] Dependency text >=1.2 && <1.3 || >=2.0 && <2.2: using text-2.1
1738.23 s
[rebase] Dependency time >=1.9 && <1.15: using time-1.12.2
1738.23 s
[rebase] Dependency time-compat >=1.9.6.1 && <1.10: using time-compat-1.9.7
1738.23 s
[rebase] Dependency transformers >=0.5 && <0.7: using transformers-0.6.1.0
1738.23 s
[rebase] Dependency unordered-containers >=0.2.13 && <0.3: using
1738.23 s
[rebase] unordered-containers-0.2.20
1738.23 s
[rebase] Dependency uuid-types >=1.0 && <1.1: using uuid-types-1.0.6
1738.23 s
[rebase] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
1738.23 s
[rebase] Dependency vector-instances >=3.4 && <3.5: using vector-instances-3.4.2
1738.23 s
[rebase] Dependency void >=0.7 && <0.8: using void-0.7.3
1738.23 s
[rebase] Source component graph: component lib
1738.23 s
[rebase] Configured component graph:
1738.23 s
[rebase] component rebase-1.21.2-KoV4eXp2MNG86hbSiMdeg8
1738.23 s
[rebase] include base-4.19.0.0-b960
1738.23 s
[rebase] include bifunctors-5.6.2-4fZuJfp0ftV1iKSQIeavLh
1738.23 s
[rebase] include bytestring-0.12.0.2-4690
1738.23 s
[rebase] include comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1738.23 s
[rebase] include containers-0.6.8-4775
1738.23 s
[rebase] include contravariant-1.5.5-J4LLuUnbnVaBzsIx42BlgS
1738.23 s
[rebase] include deepseq-1.5.0.0-412f
1738.23 s
[rebase] include dlist-1.0-92EE3VRf6S86YM2NLYx7Zz
1738.23 s
[rebase] include either-5.0.2-Bq2GyP4oSURC8Bdp8bx9G6
1738.23 s
[rebase] include groups-0.5.3-w2UxgtGTCPHU1qvFEu0AE
1738.23 s
[rebase] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1738.23 s
[rebase] include invariant-0.6.4-9MdOxjYVRq95RCcv5wEaad
1738.23 s
[rebase] include mtl-2.3.1-63a4
1738.23 s
[rebase] include profunctors-5.6.2-3nAHQARBXS12MCzIa3BzsU
1738.23 s
[rebase] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1738.23 s
[rebase] include selective-0.7.0.1-AfSp7zmUuG42sRImdE2FDY
1738.23 s
[rebase] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1738.23 s
[rebase] include stm-2.5.2.1-83fa
1738.23 s
[rebase] include text-2.1-c36a
1738.23 s
[rebase] include time-1.12.2-d26d
1738.23 s
[rebase] include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
1738.23 s
[rebase] include transformers-0.6.1.0-c3ec
1738.23 s
[rebase] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1738.23 s
[rebase] include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
1738.23 s
[rebase] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1738.23 s
[rebase] include vector-instances-3.4.2-IrMPeDkXsTAHmZR7rP06of
1738.23 s
[rebase] include void-0.7.3-5yU89rtcFpHDt8FMuiMLJt
1738.23 s
[rebase] Linked component graph:
1738.23 s
[rebase] unit rebase-1.21.2-KoV4eXp2MNG86hbSiMdeg8
1738.23 s
[rebase] include base-4.19.0.0-b960
1738.23 s
[rebase] include bifunctors-5.6.2-4fZuJfp0ftV1iKSQIeavLh
1738.23 s
[rebase] include bytestring-0.12.0.2-4690
1738.23 s
[rebase] include comonad-5.0.9-ESq2E8gYtBx3byXmKAW1hW
1738.23 s
[rebase] include containers-0.6.8-4775
1738.23 s
[rebase] include contravariant-1.5.5-J4LLuUnbnVaBzsIx42BlgS
1738.23 s
[rebase] include deepseq-1.5.0.0-412f
1738.23 s
[rebase] include dlist-1.0-92EE3VRf6S86YM2NLYx7Zz
1738.23 s
[rebase] include either-5.0.2-Bq2GyP4oSURC8Bdp8bx9G6
1738.23 s
[rebase] include groups-0.5.3-w2UxgtGTCPHU1qvFEu0AE
1738.23 s
[rebase] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
1738.23 s
[rebase] include invariant-0.6.4-9MdOxjYVRq95RCcv5wEaad
1738.23 s
[rebase] include mtl-2.3.1-63a4
1738.23 s
[rebase] include profunctors-5.6.2-3nAHQARBXS12MCzIa3BzsU
1738.23 s
[rebase] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
1738.23 s
[rebase] include selective-0.7.0.1-AfSp7zmUuG42sRImdE2FDY
1738.23 s
[rebase] include semigroupoids-6.0.1-J9J1eOvotnkFeF6NoO7rrj
1738.23 s
[rebase] include stm-2.5.2.1-83fa
1738.23 s
[rebase] include text-2.1-c36a
1738.23 s
[rebase] include time-1.12.2-d26d
1738.23 s
[shake] Documentation created: dist/doc/html/shake/, dist/doc/html/shake/shake.txt
1738.23 s
[shake] haddockPhase completed in 1 minutes 7 seconds
1738.23 s
[shake] Phase: installPhase
1738.23 s
[shake] Installing executable shake in /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8/bin
1738.23 s
[shake] Warning: The directory
1738.23 s
[shake] /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8/bin is not in the
1738.23 s
[shake] system search path.
1738.23 s
[shake] Installing library in /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/shake-0.19.8-3FCaRvebiS3CdqCMPQhT3v
1738.23 s
[shake] Phase: fixupPhase
1738.23 s
[shake] shrinking RPATHs of ELF executables and libraries in /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8
1738.23 s
[shake] shrinking /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSshake-0.19.8-3FCaRvebiS3CdqCMPQhT3v-ghc9.8.1.so
1738.23 s
[shake] shrinking /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8/bin/shake
1738.23 s
[shake] checking for references to /build/ in /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8...
1738.23 s
[shake] patching script interpreter paths in /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8
1738.23 s
[shake] stripping (with command strip and flags -S -p) in /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8/lib /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8/bin
1738.23 s
[shake] shrinking RPATHs of ELF executables and libraries in /nix/store/iq8l5cy2qzvrc55zfs8wxjss7qblrjyr-shake-0.19.8-data
1738.23 s
[shake] checking for references to /build/ in /nix/store/iq8l5cy2qzvrc55zfs8wxjss7qblrjyr-shake-0.19.8-data...
1738.23 s
[shake] patching script interpreter paths in /nix/store/iq8l5cy2qzvrc55zfs8wxjss7qblrjyr-shake-0.19.8-data
1738.23 s
[shake] shrinking RPATHs of ELF executables and libraries in /nix/store/xxzinarv27ih7cg9yzhi0kznc3mxvr34-shake-0.19.8-doc
1738.23 s
[shake] checking for references to /build/ in /nix/store/xxzinarv27ih7cg9yzhi0kznc3mxvr34-shake-0.19.8-doc...
1738.23 s
[shake] patching script interpreter paths in /nix/store/xxzinarv27ih7cg9yzhi0kznc3mxvr34-shake-0.19.8-doc
1738.23 s
[HTF] [20 of 24] Compiling Test.Framework.TestReporter ( Test/Framework/TestReporter.hs, dist/build/Test/Framework/TestReporter.o, dist/build/Test/Framework/TestReporter.dyn_o )
1738.23 s
[HTF] [21 of 24] Compiling Test.Framework.CmdlineOptions ( Test/Framework/CmdlineOptions.hs, dist/build/Test/Framework/CmdlineOptions.o, dist/build/Test/Framework/CmdlineOptions.dyn_o )
1738.23 s
[HTF] [22 of 24] Compiling Test.Framework.TestManager ( Test/Framework/TestManager.hs, dist/build/Test/Framework/TestManager.o, dist/build/Test/Framework/TestManager.dyn_o )
1738.23 s
[HTF] [23 of 24] Compiling Test.Framework.BlackBoxTest ( Test/Framework/BlackBoxTest.hs, dist/build/Test/Framework/BlackBoxTest.o, dist/build/Test/Framework/BlackBoxTest.dyn_o )
1738.23 s
[HTF] [24 of 24] Compiling Test.Framework ( Test/Framework.hs, dist/build/Test/Framework.o, dist/build/Test/Framework.dyn_o )
1738.23 s
[HTF] [ 1 of 24] Compiling Paths_HTF ( dist/build/autogen/Paths_HTF.hs, dist/build/Paths_HTF.p_o )
1738.23 s
[HTF] [ 2 of 24] Compiling Test.Framework.Colors ( Test/Framework/Colors.hs, dist/build/Test/Framework/Colors.p_o )
1738.23 s
[HTF] [ 3 of 24] Compiling Test.Framework.Diff ( Test/Framework/Diff.hs, dist/build/Test/Framework/Diff.p_o )
1738.23 s
[HTF] [ 4 of 24] Compiling Test.Framework.Location ( Test/Framework/Location.hs, dist/build/Test/Framework/Location.p_o )
1738.23 s
[HTF] [ 5 of 24] Compiling Test.Framework.Preprocessor ( Test/Framework/Preprocessor.hs, dist/build/Test/Framework/Preprocessor.p_o )
1738.23 s
[HTF] [ 6 of 24] Compiling Test.Framework.Pretty ( Test/Framework/Pretty.hs, dist/build/Test/Framework/Pretty.p_o )
1738.23 s
[HTF] [ 7 of 24] Compiling Test.Framework.Process ( Test/Framework/Process.hs, dist/build/Test/Framework/Process.p_o )
1738.23 s
[HTF] [ 8 of 24] Compiling Test.Framework.TestInterface ( Test/Framework/TestInterface.hs, dist/build/Test/Framework/TestInterface.p_o )
1738.23 s
[HTF] [ 9 of 24] Compiling Test.Framework.History ( Test/Framework/History.hs, dist/build/Test/Framework/History.p_o )
1738.23 s
[HTF] [10 of 24] Compiling Test.Framework.AssertM ( Test/Framework/AssertM.hs, dist/build/Test/Framework/AssertM.p_o )
1738.23 s
[HTF]
1738.23 s
[HTF] Test/Framework/AssertM.hs:64:5: warning : [ GHC-22705 ] [ -Wnoncanonical-monad-instances ]
1738.23 s
[HTF] Noncanonical ‘return’ definition detected
1738.24 s
[HTF] in the instance declaration for ‘Monad AssertBool’.
1738.24 s
[HTF] ‘return’ will eventually be removed in favour of ‘pure’
1738.24 s
[HTF] Suggested fix:
1738.24 s
[HTF] Either remove definition for ‘return’ (recommended) or define as ‘return = pure’
1738.24 s
[HTF] See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return
1738.24 s
[HTF] |
1738.24 s
[HTF] 64 | return = AssertOk
1738.24 s
[HTF] | ^^^^^^^^^^^^^^^^^
1738.24 s
[HTF] [11 of 24] Compiling Test.Framework.TestTypes ( Test/Framework/TestTypes.hs, dist/build/Test/Framework/TestTypes.p_o )
1738.24 s
[HTF] [12 of 24] Compiling Test.Framework.JsonOutput ( Test/Framework/JsonOutput.hs, dist/build/Test/Framework/JsonOutput.p_o )
1738.24 s
[HTF] [13 of 24] Compiling Test.Framework.ThreadPool ( Test/Framework/ThreadPool.hs, dist/build/Test/Framework/ThreadPool.p_o )
1738.24 s
[HTF] [14 of 24] Compiling Test.Framework.Tutorial ( Test/Framework/Tutorial.hs, dist/build/Test/Framework/Tutorial.p_o )
1738.24 s
[HTF] [15 of 24] Compiling Test.Framework.Utils ( Test/Framework/Utils.hs, dist/build/Test/Framework/Utils.p_o )
1738.24 s
[HTF]
1738.24 s
[HTF] Test/Framework/Utils.hs:62:26: warning : [ GHC-63394 ] [ -Wx-partial ]
1738.24 s
[HTF] In the use of ‘tail’
1738.24 s
[HTF] (imported from Prelude, but defined in GHC.List):
1738.24 s
[HTF] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1738.24 s
[HTF] |
1738.24 s
[HTF] 62 | dropSuffix f = reverse . tail . dropWhile (/= '.') $ reverse f
1738.24 s
[HTF] | ^^^^
1738.24 s
[HTF] [16 of 24] Compiling Test.Framework.QuickCheckWrapper ( Test/Framework/QuickCheckWrapper.hs, dist/build/Test/Framework/QuickCheckWrapper.p_o )
1738.24 s
[HTF] [17 of 24] Compiling Test.Framework.PrettyHaskell ( Test/Framework/PrettyHaskell.hs, dist/build/Test/Framework/PrettyHaskell.p_o )
1738.52 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/5gy8nldkva3lwv05h83rpf5nimlfz5bs-HsYAML-aeson-0.2.0.2-doc /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2
1740.33 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1740.47 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/5gy8nldkva3lwv05h83rpf5nimlfz5bs-HsYAML-aeson-0.2.0.2-doc /nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2
1740.96 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1741.25 s
[post-build-hook] copying 3 paths...
1741.25 s
[post-build-hook] copying path '/nix/store/dsriaxx4r9671nyfqjd8vhwbg0i8z7ld-HsYAML-0.2.1.5-doc' to 'https://cache.nix-ci.com'...
1743.78 s
[post-build-hook] copying path '/nix/store/8p6zbx9avnqdr3n73pff594bhkzgm433-HsYAML-0.2.1.5' to 'https://cache.nix-ci.com'...
1754.85 s
[post-build-hook] copying path '/nix/store/7yr32py3inrf39s64q3mxxbm6fxqaixp-HsYAML-aeson-0.2.0.2' to 'https://cache.nix-ci.com'...
1755.86 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1756.24 s
[post-build-hook] copying 0 paths...
1756.52 s
Progress: 100 of 171 built (15 building), 395 of 395 downloaded from cache
1756.52 s
[algebraic-graphs] OK: consistent (edge x y) == True
1756.52 s
[algebraic-graphs] OK: consistent (edges xs) == True
1756.52 s
[algebraic-graphs] OK: consistent (stars xs) == True
1756.52 s
[algebraic-graphs]
1756.52 s
[algebraic-graphs] ============ Symmetric.Relation.Show ============
1756.52 s
[algebraic-graphs] OK: show (empty ) == "empty"
1756.52 s
[algebraic-graphs] OK: show (1 ) == "vertex 1"
1756.52 s
[algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
1756.52 s
[algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
1756.52 s
[algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
1756.52 s
[algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
1756.52 s
[algebraic-graphs]
1756.52 s
[algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
1756.52 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
1756.52 s
[algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
1756.52 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
1756.52 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
1756.52 s
[algebraic-graphs]
1756.52 s
[algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
1756.52 s
[algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
1756.52 s
[algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
1756.52 s
[algebraic-graphs]
1756.52 s
[algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
1756.52 s
[algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
1756.52 s
[algebraic-graphs] OK: toSymmetric . fromSymmetric == id
1756.52 s
[algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
1756.52 s
[algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
1756.52 s
[algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
1756.52 s
[algebraic-graphs]
1756.52 s
[algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
1756.52 s
[algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
1756.52 s
[algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
1756.52 s
[algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
1756.52 s
[algebraic-graphs]
1756.52 s
[algebraic-graphs] ============ Symmetric.Relation.Ord ============
1756.52 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1756.53 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1756.53 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1756.53 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1756.53 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1756.53 s
[algebraic-graphs] OK: edge 2 1 < edge 1 3
1756.53 s
[algebraic-graphs] OK: edge 1 2 == edge 2 1
1756.53 s
[algebraic-graphs] OK: x <= x + y
1756.53 s
[algebraic-graphs] OK: x + y <= x * y
1756.53 s
[algebraic-graphs]
1756.53 s
[algebraic-graphs] ============ Symmetric.Relation.empty ============
1756.53 s
[algebraic-graphs] OK: isEmpty empty == True
1756.53 s
[algebraic-graphs] OK: hasVertex x empty == False
1756.53 s
[algebraic-graphs] OK: vertexCount empty == 0
1756.53 s
[algebraic-graphs] OK: edgeCount empty == 0
1756.53 s
[algebraic-graphs]
1756.53 s
[algebraic-graphs] ============ Symmetric.Relation.vertex ============
1756.53 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1756.53 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1756.53 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1756.53 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1756.53 s
[algebraic-graphs]
1756.53 s
[algebraic-graphs] ============ Symmetric.Relation.edge ============
1756.53 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1756.53 s
[algebraic-graphs] OK: edge x y == edge y x
1756.53 s
[algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
1756.53 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1756.53 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1756.53 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1756.53 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1756.53 s
[algebraic-graphs]
1756.53 s
[algebraic-graphs] ============ Symmetric.Relation.overlay ============
1756.53 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1756.53 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1756.53 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1756.53 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1756.53 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1756.53 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1756.53 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1756.53 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1756.53 s
[algebraic-graphs]
1756.53 s
[algebraic-graphs] ============ Symmetric.Relation.connect ============
1756.53 s
[algebraic-graphs] OK: connect x y == connect y x
1756.53 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1756.53 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1756.53 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1756.53 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1756.53 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1756.53 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1756.53 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
1756.53 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1756.53 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1756.53 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1756.53 s
[algebraic-graphs]
1756.53 s
[algebraic-graphs] ============ Symmetric.Relation.vertices ============
1756.53 s
[algebraic-graphs] OK: vertices [] == empty
1756.53 s
[algebraic-graphs] OK: vertices [x] == vertex x
1756.53 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1756.53 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1756.53 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1756.53 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1756.53 s
[algebraic-graphs]
1756.53 s
[algebraic-graphs] ============ Symmetric.Relation.edges ============
1756.53 s
[algebraic-graphs] OK: edges [] == empty
1756.53 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1756.53 s
[algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
1756.53 s
[algebraic-graphs]
1756.53 s
[algebraic-graphs] ============ Symmetric.Relation.overlays ============
1756.53 s
[algebraic-graphs] OK: overlays [] == empty
1756.53 s
[binary-instances] 0% ( 0 / 1) in 'Data.Binary.Instances.Primitive'
1756.53 s
[binary-instances] Missing documentation for:
1756.53 s
[binary-instances] Module header
1756.53 s
[binary-instances] 0% ( 0 / 1) in 'Data.Binary.Instances.Scientific'
1756.53 s
[binary-instances] Missing documentation for:
1756.53 s
[binary-instances] Module header
1756.53 s
[binary-instances] 0% ( 0 / 1) in 'Data.Binary.Instances.Tagged'
1756.53 s
[binary-instances] Missing documentation for:
1756.53 s
[binary-instances] Module header
1756.53 s
[binary-instances] 0% ( 0 / 1) in 'Data.Binary.Instances.Text'
1756.53 s
[binary-instances] Missing documentation for:
1756.53 s
[binary-instances] Module header
1756.53 s
[binary-instances] 0% ( 0 / 1) in 'Data.Binary.Instances.Time'
1756.53 s
[binary-instances] Missing documentation for:
1756.53 s
[binary-instances] Module header
1756.53 s
[binary-instances] 0% ( 0 / 1) in 'Data.Binary.Instances.UnorderedContainers'
1756.53 s
[binary-instances] Missing documentation for:
1756.53 s
[binary-instances] Module header
1756.53 s
[binary-instances] 0% ( 0 / 1) in 'Data.Binary.Instances.Vector'
1756.53 s
[binary-instances] Missing documentation for:
1756.53 s
[binary-instances] Module header
1756.53 s
[binary-instances] 0% ( 0 / 1) in 'Data.Binary.Instances.Aeson'
1756.53 s
[binary-instances] Missing documentation for:
1756.53 s
[binary-instances] Module header
1756.53 s
[binary-instances] Warning: 'Binary' is out of scope.
1756.53 s
[binary-instances] If you qualify the identifier, haddock can try to link it anyway.
1756.53 s
[binary-instances] 100% ( 1 / 1) in 'Data.Binary.Instances'
1756.53 s
[binary-instances] Documentation created: dist/doc/html/binary-instances/,
1756.53 s
[binary-instances] dist/doc/html/binary-instances/binary-instances.txt
1756.53 s
[binary-instances] Phase: installPhase
1756.53 s
[binary-instances] Installing library in /nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/binary-instances-1.0.6-9BVslbft3sTFpByzWjX82i
1756.53 s
[binary-instances] Phase: fixupPhase
1756.53 s
[binary-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6
1756.53 s
[binary-instances] shrinking /nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSbinary-instances-1.0.6-9BVslbft3sTFpByzWjX82i-ghc9.8.1.so
1756.53 s
[binary-instances] checking for references to /build/ in /nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6...
1756.53 s
[binary-instances] patching script interpreter paths in /nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6
1756.53 s
[binary-instances] stripping (with command strip and flags -S -p) in /nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6/lib
1756.53 s
[binary-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/0mq6h5i78pkchwslvz24gnjprbdm1g1h-binary-instances-1.0.6-doc
1756.53 s
[binary-instances] checking for references to /build/ in /nix/store/0mq6h5i78pkchwslvz24gnjprbdm1g1h-binary-instances-1.0.6-doc...
1756.53 s
[binary-instances] patching script interpreter paths in /nix/store/0mq6h5i78pkchwslvz24gnjprbdm1g1h-binary-instances-1.0.6-doc
1756.53 s
[constraints-extras] Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
1756.53 s
[constraints-extras] relies on the StarIsType extension, which will become
1756.53 s
[constraints-extras] deprecated in the future.
1756.53 s
[constraints-extras] Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.
1756.53 s
[constraints-extras] |
1756.53 s
[constraints-extras] 46 | > data family Fam a :: * -> *
1756.53 s
[constraints-extras] | ^
1756.53 s
[constraints-extras]
1756.53 s
[constraints-extras] README.lhs:46:29: warning : [ GHC-39567 ] [ -Wstar-is-type ]
1756.53 s
[constraints-extras] Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
1756.53 s
[constraints-extras] relies on the StarIsType extension, which will become
1756.53 s
[constraints-extras] deprecated in the future.
1756.53 s
[constraints-extras] Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.
1756.53 s
[constraints-extras] |
1756.54 s
[constraints-extras] 46 | > data family Fam a :: * -> *
1756.54 s
[constraints-extras] | ^
1756.54 s
[constraints-extras]
1756.54 s
[constraints-extras] README.lhs:47:27: warning : [ GHC-39567 ] [ -Wstar-is-type ]
1756.54 s
[constraints-extras] Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
1756.54 s
[constraints-extras] relies on the StarIsType extension, which will become
1756.54 s
[constraints-extras] deprecated in the future.
1756.54 s
[constraints-extras] Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.
1756.54 s
[constraints-extras] |
1756.54 s
[constraints-extras] 47 | > data instance Fam () :: * -> * where
1756.54 s
[constraints-extras] | ^
1756.54 s
[constraints-extras]
1756.54 s
[constraints-extras] README.lhs:47:32: warning : [ GHC-39567 ] [ -Wstar-is-type ]
1756.54 s
[constraints-extras] Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
1756.54 s
[constraints-extras] relies on the StarIsType extension, which will become
1756.54 s
[constraints-extras] deprecated in the future.
1756.54 s
[constraints-extras] Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.
1756.54 s
[constraints-extras] |
1756.54 s
[constraints-extras] 47 | > data instance Fam () :: * -> * where
1756.54 s
[constraints-extras] | ^
1756.54 s
[constraints-extras] [2 of 2] Linking dist/build/readme/readme
1756.54 s
[constraints-extras] Phase: checkPhase
1756.54 s
[constraints-extras] Package has no test suites.
1756.54 s
[constraints-extras] Phase: haddockPhase
1756.54 s
[constraints-extras] Preprocessing library for constraints-extras-0.4.0.2..
1756.54 s
[constraints-extras] Running Haddock on library for constraints-extras-0.4.0.2..
1756.54 s
[constraints-extras] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1756.54 s
[constraints-extras] [1 of 4] Compiling Data.Constraint.Compose ( src/Data/Constraint/Compose.hs, /build/ghc626_0/ghc_8.o, /build/ghc626_0/ghc_8.dyn_o )
1756.54 s
[constraints-extras] [2 of 4] Compiling Data.Constraint.Flip ( src/Data/Constraint/Flip.hs, /build/ghc626_0/ghc_12.o, /build/ghc626_0/ghc_12.dyn_o )
1756.54 s
[constraints-extras] [3 of 4] Compiling Data.Constraint.Extras ( src/Data/Constraint/Extras.hs, /build/ghc626_0/ghc_10.o, /build/ghc626_0/ghc_10.dyn_o )
1756.54 s
[constraints-extras] [4 of 4] Compiling Data.Constraint.Extras.TH ( src/Data/Constraint/Extras/TH.hs, nothing )
1756.54 s
[constraints-extras] Haddock coverage:
1756.54 s
[constraints-extras] 50% ( 1 / 2) in 'Data.Constraint.Compose'
1756.54 s
[constraints-extras] Missing documentation for:
1756.54 s
[constraints-extras] Module header
1756.54 s
[constraints-extras] 50% ( 1 / 2) in 'Data.Constraint.Flip'
1756.54 s
[constraints-extras] Missing documentation for:
1756.54 s
[constraints-extras] Module header
1756.54 s
[constraints-extras] 100% ( 13 / 13) in 'Data.Constraint.Extras'
1756.55 s
[constraints-extras] 0% ( 0 / 4) in 'Data.Constraint.Extras.TH'
1756.55 s
[constraints-extras] Missing documentation for:
1756.55 s
[constraints-extras] Module header
1756.55 s
[constraints-extras] deriveArgDict (src/Data/Constraint/Extras/TH.hs:15)
1756.55 s
[constraints-extras] deriveArgDictV (src/Data/Constraint/Extras/TH.hs:30)
1756.55 s
[constraints-extras] gadtIndices (src/Data/Constraint/Extras/TH.hs:110)
1756.55 s
[constraints-extras] Documentation created: dist/doc/html/constraints-extras/,
1756.55 s
[constraints-extras] dist/doc/html/constraints-extras/constraints-extras.txt
1756.55 s
[constraints-extras] Preprocessing executable 'readme' for constraints-extras-0.4.0.2..
1756.55 s
[constraints-extras] Phase: installPhase
1756.55 s
[constraints-extras] Installing library in /nix/store/avhd0nqxysf32zw4x2zsshgsqblgyzii-constraints-extras-0.4.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/constraints-extras-0.4.0.2-CBhGvzt6FDZAi7EEoGyDr1
1756.55 s
[constraints-extras] Installing executable readme in /nix/store/avhd0nqxysf32zw4x2zsshgsqblgyzii-constraints-extras-0.4.0.2/bin
1756.55 s
[constraints-extras] Warning: The directory
1756.55 s
[constraints-extras] /nix/store/avhd0nqxysf32zw4x2zsshgsqblgyzii-constraints-extras-0.4.0.2/bin is
1756.55 s
[constraints-extras] not in the system search path.
1756.55 s
[deriving-aeson] - Data.Vector.Primitive.Vector
1756.55 s
[deriving-aeson] - Data.Vector.Storable.Vector
1756.55 s
[deriving-aeson] - Data.Aeson.Types.Internal.Rep_Value
1756.55 s
[deriving-aeson] - GHC.IO.Exception.Rep_ExitCode
1756.55 s
[deriving-aeson] Warning: Deriving.Aeson.Stock: could not find link destinations for:
1756.55 s
[deriving-aeson] - Data.Vector.Vector
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Fingerprint
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_GeneralCategory
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_SrcLoc
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Down
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Tuple15
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Tuple14
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Tuple13
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Tuple12
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Tuple11
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Tuple10
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Tuple9
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Tuple8
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Tuple7
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Tuple6
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Tuple5
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Tuple4
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Tuple3
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Tuple2
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Solo
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Unit
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Proxy
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Ordering
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Bool
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Either
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Maybe
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_NonEmpty
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_List
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Void
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_M1
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_V1
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_U1
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Par1
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Rec1
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_K1
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_:+:
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_:*:
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_:.:
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_R:UReckWordp
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_R:UReckIntp
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_R:UReckDoublep
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_R:UReckCharp
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_R:UReckPtrp
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Fixity
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_Associativity
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_SourceUnpackedness
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_SourceStrictness
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_DecidedStrictness
1756.55 s
[deriving-aeson] - Data.Monoid.Rep_Ap
1756.55 s
[deriving-aeson] - Data.Monoid.Rep_Last
1756.55 s
[deriving-aeson] - Data.Monoid.Rep_First
1756.55 s
[deriving-aeson] - Data.Functor.Const.Rep_Const
1756.55 s
[deriving-aeson] - GHC.RTS.Flags.Rep_RTSFlags
1756.55 s
[deriving-aeson] - GHC.RTS.Flags.Rep_ParFlags
1756.55 s
[deriving-aeson] - GHC.RTS.Flags.Rep_TickyFlags
1756.55 s
[deriving-aeson] - GHC.RTS.Flags.Rep_TraceFlags
1756.55 s
[deriving-aeson] - GHC.RTS.Flags.Rep_DoTrace
1756.55 s
[deriving-aeson] - GHC.RTS.Flags.Rep_ProfFlags
1756.55 s
[deriving-aeson] - GHC.RTS.Flags.Rep_DoHeapProfile
1756.55 s
[deriving-aeson] - GHC.RTS.Flags.Rep_CCFlags
1756.55 s
[deriving-aeson] - GHC.RTS.Flags.Rep_DoCostCentres
1756.55 s
[deriving-aeson] - GHC.RTS.Flags.Rep_DebugFlags
1756.55 s
[deriving-aeson] - GHC.RTS.Flags.Rep_MiscFlags
1756.55 s
[deriving-aeson] - GHC.RTS.Flags.Rep_ConcFlags
1756.55 s
[deriving-aeson] - GHC.RTS.Flags.Rep_GCFlags
1756.55 s
[deriving-aeson] - GHC.RTS.Flags.Rep_GiveGCStats
1756.55 s
[deriving-aeson] - Data.Functor.Identity.Rep_Identity
1756.55 s
[deriving-aeson] - Control.Arrow.Rep_Kleisli
1756.55 s
[deriving-aeson] - Control.Applicative.Rep_ZipList
1756.55 s
[deriving-aeson] - Control.Applicative.Rep_WrappedArrow
1756.55 s
[deriving-aeson] - Control.Applicative.Rep_WrappedMonad
1756.55 s
[deriving-aeson] - Data.Version.Rep_Version
1756.55 s
[deriving-aeson] - GHC.ByteOrder.Rep_ByteOrder
1756.55 s
[deriving-aeson] - GHC.Stats.Rep_RTSStats
1756.55 s
[deriving-aeson] - GHC.Stats.Rep_GCDetails
1756.55 s
[deriving-aeson] - Data.Semigroup.Rep_WrappedMonoid
1756.55 s
[deriving-aeson] - Data.Semigroup.Rep_Last
1756.55 s
[deriving-aeson] - Data.Semigroup.Rep_First
1756.55 s
[deriving-aeson] - Data.Semigroup.Rep_Arg
1756.55 s
[deriving-aeson] - Data.Semigroup.Rep_Max
1756.55 s
[deriving-aeson] - Data.Semigroup.Rep_Min
1756.55 s
[deriving-aeson] - Data.Complex.Rep_Complex
1756.55 s
[deriving-aeson] - Data.Functor.Sum.Rep_Sum
1756.55 s
[deriving-aeson] - Data.Functor.Product.Rep_Product
1756.55 s
[deriving-aeson] - Data.Functor.Compose.Rep_Compose
1756.55 s
[deriving-aeson] - GHC.Generics.Rep_R:UReckFloatp
1756.55 s
[deriving-aeson] - Data.Vector.Generic.Base.Vector
1756.55 s
[deriving-aeson] - Data.Vector.Unboxed.Base.Vector
1756.55 s
[deriving-aeson] - Data.Vector.Primitive.Vector
1756.55 s
[deriving-aeson] - Data.Vector.Storable.Vector
1756.55 s
[deriving-aeson] - Data.Aeson.Types.Internal.Rep_Value
1756.55 s
[deriving-aeson] - GHC.IO.Exception.Rep_ExitCode
1756.55 s
[deriving-aeson] Documentation created: dist/doc/html/deriving-aeson/,
1756.55 s
[deriving-aeson] dist/doc/html/deriving-aeson/deriving-aeson.txt
1756.56 s
[deriving-aeson] Preprocessing test suite 'test' for deriving-aeson-0.2.10..
1756.56 s
[deriving-aeson] Phase: installPhase
1756.56 s
[deriving-aeson] Installing library in /nix/store/pbbfq6jmjkamdbpp9zmdvjnkp3h16nzb-deriving-aeson-0.2.10/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/deriving-aeson-0.2.10-6RHmuanEpWH1lgvtVUMgnG
1756.56 s
[deriving-aeson] Phase: fixupPhase
1756.56 s
[deriving-aeson] shrinking RPATHs of ELF executables and libraries in /nix/store/pbbfq6jmjkamdbpp9zmdvjnkp3h16nzb-deriving-aeson-0.2.10
1756.56 s
[deriving-aeson] shrinking /nix/store/pbbfq6jmjkamdbpp9zmdvjnkp3h16nzb-deriving-aeson-0.2.10/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSderiving-aeson-0.2.10-6RHmuanEpWH1lgvtVUMgnG-ghc9.8.1.so
1756.56 s
[deriving-aeson] checking for references to /build/ in /nix/store/pbbfq6jmjkamdbpp9zmdvjnkp3h16nzb-deriving-aeson-0.2.10...
1756.56 s
[deriving-aeson] patching script interpreter paths in /nix/store/pbbfq6jmjkamdbpp9zmdvjnkp3h16nzb-deriving-aeson-0.2.10
1756.56 s
[deriving-aeson] stripping (with command strip and flags -S -p) in /nix/store/pbbfq6jmjkamdbpp9zmdvjnkp3h16nzb-deriving-aeson-0.2.10/lib
1756.56 s
[enummapset] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1756.56 s
[enummapset] [1 of 5] Compiling Data.EnumSet ( Data/EnumSet.hs, nothing )
1756.56 s
[enummapset] [2 of 5] Compiling Data.EnumMap.Base ( Data/EnumMap/Base.hs, nothing )
1756.56 s
[enummapset] [3 of 5] Compiling Data.EnumMap.Strict ( Data/EnumMap/Strict.hs, nothing )
1756.56 s
[enummapset] [4 of 5] Compiling Data.EnumMap.Lazy ( Data/EnumMap/Lazy.hs, nothing )
1756.56 s
[enummapset] [5 of 5] Compiling Data.EnumMap ( Data/EnumMap.hs, nothing )
1756.56 s
[enummapset] Haddock coverage:
1756.56 s
[enummapset] 29% ( 18 / 62) in 'Data.EnumSet'
1756.56 s
[enummapset] Missing documentation for:
1756.56 s
[enummapset] \\ (Data/EnumSet.hs:176)
1756.56 s
[enummapset] null (Data/EnumSet.hs:180)
1756.57 s
[enummapset] size (Data/EnumSet.hs:184)
1756.57 s
[enummapset] member (Data/EnumSet.hs:188)
1756.57 s
[enummapset] notMember (Data/EnumSet.hs:192)
1756.57 s
[enummapset] lookupLT (Data/EnumSet.hs:196)
1756.57 s
[enummapset] lookupGT (Data/EnumSet.hs:200)
1756.57 s
[enummapset] lookupLE (Data/EnumSet.hs:204)
1756.57 s
[enummapset] lookupGE (Data/EnumSet.hs:208)
1756.57 s
[enummapset] isSubsetOf (Data/EnumSet.hs:248)
1756.57 s
[enummapset] isProperSubsetOf (Data/EnumSet.hs:244)
1756.57 s
[enummapset] empty (Data/EnumSet.hs:212)
1756.57 s
[enummapset] singleton (Data/EnumSet.hs:216)
1756.57 s
[enummapset] insert (Data/EnumSet.hs:220)
1756.57 s
[enummapset] delete (Data/EnumSet.hs:224)
1756.57 s
[enummapset] union (Data/EnumSet.hs:232)
1756.57 s
[enummapset] unions (Data/EnumSet.hs:228)
1756.57 s
[enummapset] difference (Data/EnumSet.hs:236)
1756.57 s
[enummapset] intersection (Data/EnumSet.hs:240)
1756.57 s
[enummapset] filter (Data/EnumSet.hs:252)
1756.57 s
[enummapset] partition (Data/EnumSet.hs:256)
1756.57 s
[enummapset] split (Data/EnumSet.hs:260)
1756.57 s
[enummapset] splitMember (Data/EnumSet.hs:264)
1756.57 s
[enummapset] map (Data/EnumSet.hs:302)
1756.57 s
[enummapset] foldr (Data/EnumSet.hs:306)
1756.57 s
[enummapset] foldl (Data/EnumSet.hs:310)
1756.57 s
[enummapset] foldr' (Data/EnumSet.hs:314)
1756.57 s
[enummapset] foldl' (Data/EnumSet.hs:318)
1756.57 s
[enummapset] fold (Data/EnumSet.hs:322)
1756.57 s
[enummapset] findMin (Data/EnumSet.hs:286)
1756.57 s
[enummapset] findMax (Data/EnumSet.hs:290)
1756.57 s
[enummapset] deleteMin (Data/EnumSet.hs:294)
1756.57 s
[enummapset] deleteMax (Data/EnumSet.hs:298)
1756.57 s
[enummapset] deleteFindMin (Data/EnumSet.hs:278)
1756.57 s
[enummapset] deleteFindMax (Data/EnumSet.hs:282)
1756.57 s
[enummapset] maxView (Data/EnumSet.hs:270)
1756.57 s
[enummapset] minView (Data/EnumSet.hs:274)
1756.57 s
[enummapset] elems (Data/EnumSet.hs:326)
1756.57 s
[enummapset] toList (Data/EnumSet.hs:330)
1756.57 s
[enummapset] fromList (Data/EnumSet.hs:342)
1756.57 s
[enummapset] toAscList (Data/EnumSet.hs:334)
1756.57 s
[enummapset] toDescList (Data/EnumSet.hs:338)
1756.57 s
[enummapset] fromAscList (Data/EnumSet.hs:346)
1756.57 s
[enummapset] fromDistinctAscList (Data/EnumSet.hs:350)
1756.57 s
[enummapset] 19% ( 25 /127) in 'Data.EnumMap.Strict'
1756.57 s
[enummapset] Missing documentation for:
1756.57 s
[enummapset] ! (Data/EnumMap/Base.hs:241)
1756.57 s
[enummapset] \\ (Data/EnumMap/Base.hs:245)
1756.57 s
[enummapset] null (Data/EnumMap/Base.hs:249)
1756.57 s
[enummapset] size (Data/EnumMap/Base.hs:253)
1756.57 s
[enummapset] member (Data/EnumMap/Base.hs:257)
1756.57 s
[enummapset] notMember (Data/EnumMap/Base.hs:261)
1756.57 s
[enummapset] lookup (Data/EnumMap/Base.hs:265)
1756.57 s
[enummapset] findWithDefault (Data/EnumMap/Strict.hs:193)
1756.57 s
[enummapset] lookupLT (Data/EnumMap/Base.hs:273)
1756.57 s
[enummapset] lookupGT (Data/EnumMap/Base.hs:277)
1756.57 s
[enummapset] lookupLE (Data/EnumMap/Base.hs:281)
1756.57 s
[enummapset] lookupGE (Data/EnumMap/Base.hs:285)
1756.57 s
[enummapset] empty (Data/EnumMap/Base.hs:289)
1756.57 s
[enummapset] singleton (Data/EnumMap/Strict.hs:197)
1756.57 s
[enummapset] insert (Data/EnumMap/Strict.hs:201)
1756.57 s
[enummapset] insertWith (Data/EnumMap/Strict.hs:205)
1756.57 s
[enummapset] insertWithKey (Data/EnumMap/Strict.hs:210)
1756.57 s
[enummapset] insertLookupWithKey (Data/EnumMap/Strict.hs:216)
1756.57 s
[enummapset] delete (Data/EnumMap/Base.hs:316)
1756.57 s
[enummapset] adjust (Data/EnumMap/Strict.hs:221)
1756.57 s
[enummapset] adjustWithKey (Data/EnumMap/Strict.hs:225)
1756.57 s
[enummapset] update (Data/EnumMap/Strict.hs:288)
1756.57 s
[enummapset] updateWithKey (Data/EnumMap/Strict.hs:293)
1756.57 s
[enummapset] updateLookupWithKey (Data/EnumMap/Strict.hs:298)
1756.57 s
[enummapset] alter (Data/EnumMap/Strict.hs:229)
1756.57 s
[enummapset] alterF (Data/EnumMap/Strict.hs:233)
1756.57 s
[enummapset] union (Data/EnumMap/Base.hs:358)
1756.57 s
[enummapset] unionWith (Data/EnumMap/Strict.hs:241)
1756.57 s
[enummapset] unionWithKey (Data/EnumMap/Strict.hs:246)
1756.57 s
[enummapset] unions (Data/EnumMap/Base.hs:350)
1756.57 s
[enummapset] unionsWith (Data/EnumMap/Strict.hs:237)
1756.57 s
[enummapset] difference (Data/EnumMap/Base.hs:372)
1756.57 s
[enummapset] differenceWith (Data/EnumMap/Strict.hs:251)
1756.57 s
[enummapset] differenceWithKey (Data/EnumMap/Strict.hs:257)
1756.57 s
[enummapset] intersection (Data/EnumMap/Base.hs:387)
1756.57 s
[enummapset] intersectionWith (Data/EnumMap/Strict.hs:262)
1756.57 s
[enummapset] intersectionWithKey (Data/EnumMap/Strict.hs:268)
1756.57 s
[enummapset] mergeWithKey (Data/EnumMap/Strict.hs:279)
1756.57 s
[enummapset] map (Data/EnumMap/Strict.hs:319)
1756.57 s
[enummapset] mapWithKey (Data/EnumMap/Strict.hs:323)
1756.57 s
[enummapset] traverseWithKey (Data/EnumMap/Base.hs:510)
1756.57 s
[enummapset] mapAccum (Data/EnumMap/Strict.hs:327)
1756.57 s
[enummapset] mapAccumWithKey (Data/EnumMap/Strict.hs:332)
1756.57 s
[enummapset] mapAccumRWithKey (Data/EnumMap/Strict.hs:338)
1756.57 s
[enummapset] mapKeys (Data/EnumMap/Base.hs:530)
1756.57 s
[enummapset] mapKeysWith (Data/EnumMap/Strict.hs:343)
1756.57 s
[path] [1 of 5] Compiling Common.Posix ( test/Common/Posix.hs, dist/build/test/test-tmp/Common/Posix.o, dist/build/test/test-tmp/Common/Posix.dyn_o )
1756.57 s
[path]
1756.57 s
[path] test/Common/Include.hs:21:5: warning : [ GHC-40910 ] [ -Wunused-top-binds ]
1756.58 s
[path] Defined but not used: ‘foo’
1756.58 s
[path] |
1756.58 s
[path] 21 | foo :: Path a b -> FilePath
1756.58 s
[path] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^
1756.58 s
[path]
1756.58 s
[path] test/Common/Include.hs:30:1: warning : [ GHC-40910 ] [ -Wunused-top-binds ]
1756.58 s
[path] Defined but not used: ‘qqRelDir’
1756.58 s
[path] |
1756.58 s
[path] 30 | qqRelDir = foo [reldir|foo/|]
1756.58 s
[path] | ^^^^^^^^
1756.58 s
[path]
1756.58 s
[path] test/Common/Include.hs:33:1: warning : [ GHC-40910 ] [ -Wunused-top-binds ]
1756.58 s
[path] Defined but not used: ‘qqRelFile’
1756.58 s
[path] |
1756.58 s
[path] 33 | qqRelFile = foo [relfile|foo|]
1756.58 s
[path] | ^^^^^^^^^
1756.58 s
[path]
1756.58 s
[path] test/Common/Include.hs:36:1: warning : [ GHC-40910 ] [ -Wunused-top-binds ]
1756.58 s
[path] Defined but not used: ‘thRelDir’
1756.58 s
[path] |
1756.58 s
[path] 36 | thRelDir = foo $(mkRelDir "foo/")
1756.58 s
[path] | ^^^^^^^^
1756.58 s
[path]
1756.58 s
[path] test/Common/Include.hs:39:1: warning : [ GHC-40910 ] [ -Wunused-top-binds ]
1756.58 s
[path] Defined but not used: ‘thRelFile’
1756.58 s
[path] |
1756.58 s
[path] 39 | thRelFile = foo $(mkRelFile "foo")
1756.58 s
[path] | ^^^^^^^^^
1756.58 s
[path]
1756.58 s
[path] test/Common/Include.hs:42:1: warning : [ GHC-40910 ] [ -Wunused-top-binds ]
1756.58 s
[path] Defined but not used: ‘liftRelDir’
1756.58 s
[path] |
1756.58 s
[path] 42 | liftRelDir = foo $(TH.lift (Path "foo/" :: Path Rel Dir))
1756.58 s
[path] | ^^^^^^^^^^
1756.58 s
[path]
1756.58 s
[path] test/Common/Include.hs:45:1: warning : [ GHC-40910 ] [ -Wunused-top-binds ]
1756.58 s
[path] Defined but not used: ‘liftRelFile’
1756.58 s
[path] |
1756.58 s
[path] 45 | liftRelFile = foo $(TH.lift (Path "foo" :: Path Rel File))
1756.58 s
[path] | ^^^^^^^^^^^
1756.58 s
[path]
1756.58 s
[path] test/Common/Posix.hs:9:1: warning : [ GHC-40910 ] [ -Wunused-top-binds ]
1756.58 s
[path] Defined but not used: ‘qqAbsDir’
1756.58 s
[path] |
1756.58 s
[path] 9 | qqAbsDir = foo [absdir|/foo/|]
1756.58 s
[path] | ^^^^^^^^
1756.58 s
[path]
1756.58 s
[path] test/Common/Posix.hs:12:1: warning : [ GHC-40910 ] [ -Wunused-top-binds ]
1756.58 s
[path] Defined but not used: ‘qqAbsFile’
1756.58 s
[path] |
1756.58 s
[path] 12 | qqAbsFile = foo [absdir|/foo|]
1756.58 s
[path] | ^^^^^^^^^
1756.58 s
[path]
1756.58 s
[path] test/Common/Posix.hs:15:1: warning : [ GHC-40910 ] [ -Wunused-top-binds ]
1756.58 s
[path] Defined but not used: ‘thAbsDir’
1756.58 s
[path] |
1756.58 s
[path] 15 | thAbsDir = foo $(mkAbsDir "/foo/")
1756.58 s
[path] | ^^^^^^^^
1756.58 s
[path]
1756.58 s
[path] test/Common/Posix.hs:18:1: warning : [ GHC-40910 ] [ -Wunused-top-binds ]
1756.58 s
[path] Defined but not used: ‘thAbsFile’
1756.58 s
[path] |
1756.58 s
[path] 18 | thAbsFile = foo $(mkAbsFile "/foo")
1756.58 s
[path] | ^^^^^^^^^
1756.58 s
[path]
1756.58 s
[quickcheck-classes] To import instances alone, use: import Control.Applicative()
1756.58 s
[quickcheck-classes] |
1756.58 s
[quickcheck-classes] 20 | import Control.Applicative
1756.58 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^^^^^^^^
1756.58 s
[quickcheck-classes]
1756.58 s
[quickcheck-classes] src/Test/QuickCheck/Classes/MVector.hs:23:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1756.58 s
[quickcheck-classes] The import of ‘Data.Functor’ is redundant
1756.58 s
[quickcheck-classes] except perhaps to import instances from ‘Data.Functor’
1756.58 s
[quickcheck-classes] To import instances alone, use: import Data.Functor()
1756.58 s
[quickcheck-classes] |
1756.58 s
[quickcheck-classes] 23 | import Data.Functor
1756.58 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^
1756.58 s
[quickcheck-classes]
1756.58 s
[quickcheck-classes] src/Test/QuickCheck/Classes/MVector.hs:29:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1756.58 s
[quickcheck-classes] The import of ‘Test.QuickCheck.Property’ is redundant
1756.58 s
[quickcheck-classes] except perhaps to import instances from ‘Test.QuickCheck.Property’
1756.58 s
[quickcheck-classes] To import instances alone, use: import Test.QuickCheck.Property()
1756.58 s
[quickcheck-classes] |
1756.58 s
[quickcheck-classes] 29 | import Test.QuickCheck.Property (Property)
1756.58 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1756.58 s
[quickcheck-classes] [ 7 of 12] Compiling Test.QuickCheck.Classes.Plus ( src/Test/QuickCheck/Classes/Plus.hs, dist/build/Test/QuickCheck/Classes/Plus.o, dist/build/Test/QuickCheck/Classes/Plus.dyn_o )
1756.58 s
[quickcheck-classes]
1756.58 s
[quickcheck-classes] src/Test/QuickCheck/Classes/Plus.hs:19:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1756.58 s
[quickcheck-classes] The import of ‘Data.Functor’ is redundant
1756.58 s
[quickcheck-classes] except perhaps to import instances from ‘Data.Functor’
1756.58 s
[quickcheck-classes] To import instances alone, use: import Data.Functor()
1756.58 s
[quickcheck-classes] |
1756.58 s
[quickcheck-classes] 19 | import Data.Functor
1756.58 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^
1756.58 s
[quickcheck-classes]
1756.58 s
[quickcheck-classes] src/Test/QuickCheck/Classes/Plus.hs:20:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1756.58 s
[quickcheck-classes] The import of ‘Data.Functor.Alt’ is redundant
1756.58 s
[quickcheck-classes] except perhaps to import instances from ‘Data.Functor.Alt’
1756.58 s
[quickcheck-classes] To import instances alone, use: import Data.Functor.Alt()
1756.58 s
[quickcheck-classes] |
1756.58 s
[quickcheck-classes] 20 | import Data.Functor.Alt (Alt)
1756.58 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1756.58 s
[quickcheck-classes]
1756.58 s
[quickcheck-classes] src/Test/QuickCheck/Classes/Plus.hs:26:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1756.58 s
[quickcheck-classes] The import of ‘Test.QuickCheck.Arbitrary’ is redundant
1756.58 s
[quickcheck-classes] except perhaps to import instances from ‘Test.QuickCheck.Arbitrary’
1756.59 s
[quickcheck-classes] To import instances alone, use: import Test.QuickCheck.Arbitrary()
1756.59 s
[quickcheck-classes] |
1756.59 s
[quickcheck-classes] 26 | import Test.QuickCheck.Arbitrary (Arbitrary1(..))
1756.59 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1756.59 s
[quickcheck-classes]
1756.59 s
[quickcheck-classes] src/Test/QuickCheck/Classes/Plus.hs:27:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1756.59 s
[quickcheck-classes] The import of ‘Data.Functor.Classes’ is redundant
1756.59 s
[quickcheck-classes] except perhaps to import instances from ‘Data.Functor.Classes’
1756.59 s
[quickcheck-classes] To import instances alone, use: import Data.Functor.Classes()
1756.59 s
[quickcheck-classes] |
1756.59 s
[quickcheck-classes] 27 | import Data.Functor.Classes (Eq1,Show1)
1756.59 s
[quickcheck-classes] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1756.59 s
[quickcheck-classes]
1756.59 s
[quickcheck-classes] src/Test/QuickCheck/Classes/Plus.hs:29:1: warning : [ GHC-66111 ] [ -Wunused-imports ]
1756.59 s
[quickcheck-classes] The import of ‘Test.QuickCheck.Property’ is redundant
1756.59 s
[quickcheck-classes] except perhaps to import instances from ‘Test.QuickCheck.Property’
1756.59 s
[quickcheck-classes] To import instances alone, use: import Test.QuickCheck.Property()
1756.59 s
[quickcheck-classes] |
1756.59 s
[rebase] include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
1756.59 s
[rebase] include transformers-0.6.1.0-c3ec
1756.59 s
[rebase] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
1756.59 s
[rebase] include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
1756.59 s
[rebase] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
1756.59 s
[rebase] include vector-instances-3.4.2-IrMPeDkXsTAHmZR7rP06of
1756.59 s
[rebase] include void-0.7.3-5yU89rtcFpHDt8FMuiMLJt
1757.24 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8 /nix/store/iq8l5cy2qzvrc55zfs8wxjss7qblrjyr-shake-0.19.8-data /nix/store/xxzinarv27ih7cg9yzhi0kznc3mxvr34-shake-0.19.8-doc
1758.72 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1758.93 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8 /nix/store/iq8l5cy2qzvrc55zfs8wxjss7qblrjyr-shake-0.19.8-data /nix/store/xxzinarv27ih7cg9yzhi0kznc3mxvr34-shake-0.19.8-doc
1759.30 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1759.51 s
[post-build-hook] copying 12 paths...
1759.51 s
[post-build-hook] copying path '/nix/store/1gygzf2q3z61y5v8kfy4il3c4pya33x9-js-jquery-3.3.1-data' to 'https://cache.nix-ci.com'...
1759.51 s
[post-build-hook] copying path '/nix/store/lzd6afjgbydkjj5x96q33w6zp7vqy1d3-heaps-0.4.1-doc' to 'https://cache.nix-ci.com'...
1759.51 s
[post-build-hook] copying path '/nix/store/82zv2lz9fwyq6pz688qrm7jw63j9j48d-js-dgtable-0.5.2-data' to 'https://cache.nix-ci.com'...
1759.51 s
[post-build-hook] copying path '/nix/store/x7r1wqaiamlyzpqmdmmvd4zd9lrw1cip-js-flot-0.8.3-data' to 'https://cache.nix-ci.com'...
1759.77 s
[post-build-hook] copying path '/nix/store/zqzfi6s09n6v3kxda5k21cjc30lsrllx-js-jquery-3.3.1-doc' to 'https://cache.nix-ci.com'...
1759.90 s
[post-build-hook] copying path '/nix/store/raa640hmy9ym4vip2wr0yplqwyj0affr-js-dgtable-0.5.2-doc' to 'https://cache.nix-ci.com'...
1760.00 s
[post-build-hook] copying path '/nix/store/s8aia0bnpwgasd8zmbjj91sh4lq2q7sc-js-flot-0.8.3-doc' to 'https://cache.nix-ci.com'...
1760.08 s
[post-build-hook] copying path '/nix/store/w3hrz5nfi3rgwhjl02cm0fwg5n17m0cg-js-jquery-3.3.1' to 'https://cache.nix-ci.com'...
1760.26 s
[post-build-hook] copying path '/nix/store/0k789617alx3kvr1pzjv69qdmawrn5p4-js-dgtable-0.5.2' to 'https://cache.nix-ci.com'...
1760.29 s
[post-build-hook] copying path '/nix/store/37qkpv7v9kb93hrbsil1pln8q89wv6zi-js-flot-0.8.3' to 'https://cache.nix-ci.com'...
1760.30 s
[post-build-hook] copying path '/nix/store/ngd5m2syds6c6vd2rn2anv92zl3znxmd-heaps-0.4.1' to 'https://cache.nix-ci.com'...
1762.07 s
[post-build-hook] copying path '/nix/store/3c2sbr4b6mhgbnykhzda6zfv8djjrk67-shake-0.19.8' to 'https://cache.nix-ci.com'...
1797.61 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1798.01 s
[post-build-hook] copying 0 paths...
1798.12 s
Progress: 101 of 172 built (14 building), 395 of 395 downloaded from cache
1798.31 s
Building hw-hspec-hedgehog
1798.49 s
Building stylish-haskell
1798.49 s
[HTF] [18 of 24] Compiling Test.Framework.HUnitWrapper ( Test/Framework/HUnitWrapper.hs, dist/build/Test/Framework/HUnitWrapper.p_o )
1798.49 s
[HTF] [19 of 24] Compiling Test.Framework.XmlOutput ( Test/Framework/XmlOutput.hs, dist/build/Test/Framework/XmlOutput.p_o )
1798.49 s
[HTF] [20 of 24] Compiling Test.Framework.TestReporter ( Test/Framework/TestReporter.hs, dist/build/Test/Framework/TestReporter.p_o )
1798.49 s
[HTF] [21 of 24] Compiling Test.Framework.CmdlineOptions ( Test/Framework/CmdlineOptions.hs, dist/build/Test/Framework/CmdlineOptions.p_o )
1798.49 s
[HTF] [22 of 24] Compiling Test.Framework.TestManager ( Test/Framework/TestManager.hs, dist/build/Test/Framework/TestManager.p_o )
1798.49 s
[HTF] [23 of 24] Compiling Test.Framework.BlackBoxTest ( Test/Framework/BlackBoxTest.hs, dist/build/Test/Framework/BlackBoxTest.p_o )
1798.49 s
[HTF] [24 of 24] Compiling Test.Framework ( Test/Framework.hs, dist/build/Test/Framework.p_o )
1798.49 s
[HTF] Preprocessing executable 'htfpp' for HTF-0.15.0.2..
1798.49 s
[HTF] Building executable 'htfpp' for HTF-0.15.0.2..
1798.49 s
[HTF] [1 of 4] Compiling Paths_HTF ( dist/build/htfpp/autogen/Paths_HTF.hs, dist/build/htfpp/htfpp-tmp/Paths_HTF.o )
1798.49 s
[HTF] [2 of 4] Compiling Test.Framework.Location ( Test/Framework/Location.hs, dist/build/htfpp/htfpp-tmp/Test/Framework/Location.o )
1798.49 s
[HTF] [3 of 4] Compiling Test.Framework.Preprocessor ( Test/Framework/Preprocessor.hs, dist/build/htfpp/htfpp-tmp/Test/Framework/Preprocessor.o )
1798.49 s
[HTF] [4 of 4] Compiling Main ( HTFPP.hs, dist/build/htfpp/htfpp-tmp/Main.o )
1798.49 s
[HTF] [5 of 5] Linking dist/build/htfpp/htfpp
1798.49 s
[HTF] buildPhase completed in 1 minutes 58 seconds
1798.49 s
[HTF] Phase: haddockPhase
1798.49 s
[HTF] Preprocessing library for HTF-0.15.0.2..
1798.49 s
[HTF] Running Haddock on library for HTF-0.15.0.2..
1798.49 s
[HTF] Warning: The documentation for the following packages are not installed. No
1798.49 s
[HTF] links will be generated to these packages: vector-0.13.2.0
1798.49 s
[HTF] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1798.49 s
[HTF] [ 1 of 24] Compiling Paths_HTF ( dist/build/autogen/Paths_HTF.hs, nothing )
1798.49 s
[HTF] [ 2 of 24] Compiling Test.Framework.Colors ( Test/Framework/Colors.hs, /build/ghc1070_0/ghc_26.o, /build/ghc1070_0/ghc_26.dyn_o )
1798.49 s
[HTF] [ 3 of 24] Compiling Test.Framework.Diff ( Test/Framework/Diff.hs, nothing )
1798.50 s
[HTF] [ 4 of 24] Compiling Test.Framework.Location ( Test/Framework/Location.hs, /build/ghc1070_0/ghc_28.o, /build/ghc1070_0/ghc_28.dyn_o )
1798.50 s
[HTF] [ 5 of 24] Compiling Test.Framework.Preprocessor ( Test/Framework/Preprocessor.hs, nothing )
1798.50 s
[HTF] [ 6 of 24] Compiling Test.Framework.Pretty ( Test/Framework/Pretty.hs, nothing )
1798.50 s
[HTF] [ 7 of 24] Compiling Test.Framework.Process ( Test/Framework/Process.hs, nothing )
1798.50 s
[HTF] [ 8 of 24] Compiling Test.Framework.TestInterface ( Test/Framework/TestInterface.hs, /build/ghc1070_0/ghc_30.o, /build/ghc1070_0/ghc_30.dyn_o )
1798.50 s
[HTF] [ 9 of 24] Compiling Test.Framework.History ( Test/Framework/History.hs, nothing )
1798.50 s
[HTF] [10 of 24] Compiling Test.Framework.AssertM ( Test/Framework/AssertM.hs, nothing )
1798.50 s
[HTF]
1798.50 s
[HTF] Test/Framework/AssertM.hs:64:5: warning : [ GHC-22705 ] [ -Wnoncanonical-monad-instances ]
1798.50 s
[HTF] Noncanonical ‘return’ definition detected
1798.50 s
[HTF] in the instance declaration for ‘Monad AssertBool’.
1798.50 s
[HTF] ‘return’ will eventually be removed in favour of ‘pure’
1798.50 s
[HTF] Suggested fix:
1798.50 s
[HTF] Either remove definition for ‘return’ (recommended) or define as ‘return = pure’
1798.50 s
[HTF] See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return
1798.50 s
[HTF] |
1798.50 s
[HTF] 64 | return = AssertOk
1798.50 s
[HTF] | ^^^^^^^^^^^^^^^^^
1798.50 s
[HTF] [11 of 24] Compiling Test.Framework.TestTypes ( Test/Framework/TestTypes.hs, nothing )
1798.50 s
[HTF] [12 of 24] Compiling Test.Framework.JsonOutput ( Test/Framework/JsonOutput.hs, nothing )
1798.50 s
[HTF] [13 of 24] Compiling Test.Framework.ThreadPool ( Test/Framework/ThreadPool.hs, nothing )
1798.50 s
[HTF] [14 of 24] Compiling Test.Framework.Tutorial ( Test/Framework/Tutorial.hs, nothing )
1798.50 s
[HTF] [15 of 24] Compiling Test.Framework.Utils ( Test/Framework/Utils.hs, nothing )
1798.50 s
[HTF]
1798.50 s
[HTF] Test/Framework/Utils.hs:62:26: warning : [ GHC-63394 ] [ -Wx-partial ]
1798.50 s
[algebraic-graphs] OK: overlays [x] == x
1798.50 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1798.50 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1798.50 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1798.50 s
[algebraic-graphs]
1798.50 s
[algebraic-graphs] ============ Symmetric.Relation.connects ============
1798.50 s
[algebraic-graphs] OK: connects [] == empty
1798.50 s
[algebraic-graphs] OK: connects [x] == x
1798.50 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1798.50 s
[algebraic-graphs] OK: connects == foldr connect empty
1798.50 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1798.50 s
[algebraic-graphs] OK: connects == connects . reverse
1798.50 s
[algebraic-graphs]
1798.50 s
[algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
1798.50 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1798.50 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1798.50 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1798.50 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1798.50 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1798.50 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1798.50 s
[algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
1798.50 s
[algebraic-graphs]
1798.50 s
[algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
1798.50 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1798.50 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1798.50 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1798.50 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1798.50 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1798.50 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1798.50 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1798.50 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1798.50 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1798.50 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1798.50 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1798.50 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1798.50 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1798.50 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1798.50 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1798.50 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1798.50 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1798.50 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1798.50 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1798.50 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1798.50 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1798.50 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1798.50 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1798.50 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1798.50 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1798.50 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1798.50 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1798.50 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1798.50 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1798.50 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1798.50 s
[algebraic-graphs]
1798.50 s
[algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
1798.50 s
[algebraic-graphs] OK: isEmpty empty == True
1798.50 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1798.50 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1798.50 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1798.50 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1798.50 s
[algebraic-graphs]
1798.50 s
[algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
1798.50 s
[algebraic-graphs] OK: hasVertex x empty == False
1798.50 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1798.50 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1798.50 s
[algebraic-graphs]
1798.50 s
[algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
1798.50 s
[algebraic-graphs] OK: hasEdge x y empty == False
1798.50 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1798.50 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1798.50 s
[algebraic-graphs] OK: hasEdge x y (edge y x) == True
1798.50 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1798.50 s
[attoparsec-aeson] Documentation created: dist/doc/html/attoparsec-aeson/,
1798.50 s
[attoparsec-aeson] dist/doc/html/attoparsec-aeson/attoparsec-aeson.txt
1798.50 s
[attoparsec-aeson] Phase: installPhase
1798.50 s
[attoparsec-aeson] Installing library in /nix/store/jwz1sjq5mx2qzd09vc5md7zvkg7kbkjw-attoparsec-aeson-2.2.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/attoparsec-aeson-2.2.2.0-3R0fTMXvK3710bMZ24kuaX
1798.50 s
[attoparsec-aeson] Phase: fixupPhase
1798.50 s
[attoparsec-aeson] shrinking RPATHs of ELF executables and libraries in /nix/store/jwz1sjq5mx2qzd09vc5md7zvkg7kbkjw-attoparsec-aeson-2.2.2.0
1798.50 s
[attoparsec-aeson] shrinking /nix/store/jwz1sjq5mx2qzd09vc5md7zvkg7kbkjw-attoparsec-aeson-2.2.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSattoparsec-aeson-2.2.2.0-3R0fTMXvK3710bMZ24kuaX-ghc9.8.1.so
1798.50 s
[attoparsec-aeson] checking for references to /build/ in /nix/store/jwz1sjq5mx2qzd09vc5md7zvkg7kbkjw-attoparsec-aeson-2.2.2.0...
1798.50 s
[attoparsec-aeson] patching script interpreter paths in /nix/store/jwz1sjq5mx2qzd09vc5md7zvkg7kbkjw-attoparsec-aeson-2.2.2.0
1798.50 s
[attoparsec-aeson] stripping (with command strip and flags -S -p) in /nix/store/jwz1sjq5mx2qzd09vc5md7zvkg7kbkjw-attoparsec-aeson-2.2.2.0/lib
1798.50 s
[attoparsec-aeson] shrinking RPATHs of ELF executables and libraries in /nix/store/c5r8g8hlv01ldcbmqxrw8i91x2rh4ml3-attoparsec-aeson-2.2.2.0-doc
1798.50 s
[attoparsec-aeson] checking for references to /build/ in /nix/store/c5r8g8hlv01ldcbmqxrw8i91x2rh4ml3-attoparsec-aeson-2.2.2.0-doc...
1798.50 s
[attoparsec-aeson] patching script interpreter paths in /nix/store/c5r8g8hlv01ldcbmqxrw8i91x2rh4ml3-attoparsec-aeson-2.2.2.0-doc
1798.78 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/0mq6h5i78pkchwslvz24gnjprbdm1g1h-binary-instances-1.0.6-doc /nix/store/gkd1r1hnp9k3ifhvq164nxxyxm8q94m4-binary-instances-1.0.6
1800.00 s
[post-build-hook] Nothing to push - all store paths are already on Cachix.
1800.07 s
interrupted by the user