1. 0.04 s $ /nix/store/vzx1mi9c0xfadmsm9dhd83d005cb1qs9-coreutils-9.8/bin/timeout --kill-after=15s 1800s /nix/store/99b1z08awpxj8b6mzggn59gp1shljnff-nix-2.34.5/bin/nix --extra-experimental-features nix-command --extra-experimental-features flakes --log-format internal-json build --no-link git+https://github.com/sellout/duoids?ref=renovate%2Flock-file-maintenance&rev=efcb599e94b311c8c6f8c2a5caf56f3137bbef9a#devShells.x86_64-linux.ghc967 --print-build-logs
  2. 0.07 s warning: ignoring untrusted flake configuration setting 'allow-import-from-derivation'.
  3. 0.07 s Pass '--accept-flake-config' to trust it
  4. 0.07 s warning: ignoring untrusted flake configuration setting 'extra-experimental-features'.
  5. 0.07 s Pass '--accept-flake-config' to trust it
  6. 0.07 s warning: ignoring untrusted flake configuration setting 'extra-substituters'.
  7. 0.07 s Pass '--accept-flake-config' to trust it
  8. 0.07 s warning: ignoring untrusted flake configuration setting 'extra-trusted-public-keys'.
  9. 0.07 s Pass '--accept-flake-config' to trust it
  10. 0.07 s warning: ignoring untrusted flake configuration setting 'sandbox'.
  11. 0.07 s Pass '--accept-flake-config' to trust it
  12. 0.07 s warning: ignoring untrusted flake configuration setting 'use-registries'.
  13. 0.07 s Pass '--accept-flake-config' to trust it
  14. 0.08 s error (ignored): SQLite database '/var/cache/private/nix-ci-worker/eval-cache-v6/19f80154faf27ddfad5dcb3251253294aea6c838e143ff7a5a949b25d9d532ff.sqlite' is busy
  15. 0.53 s 'system' has been renamed to/replaced by 'stdenv.hostPlatform.system'
  16. 1.39 s
  17. 6.99 s Building haskell-language-server
  18. 7.03 s Building algebraic-graphs
  19. 7.10 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  20. 7.10 s [algebraic-graphs] Build with /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7.
  21. 7.24 s [algebraic-graphs] Phase: unpackPhase
  22. 7.25 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  23. 7.25 s [algebraic-graphs] source root is algebraic-graphs-0.7
  24. 7.26 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  25. 7.26 s [algebraic-graphs] Phase: patchPhase
  26. 7.27 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  27. 7.27 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  28. 7.27 s [algebraic-graphs] patching file algebraic-graphs.cabal
  29. 7.28 s [algebraic-graphs] Phase: compileBuildDriverPhase
  30. 7.28 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.8LLTLQvQ4z/setup-package.conf.d -threaded
  31. 7.32 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.8LLTLQvQ4z/Main.o )
  32. 7.38 s [algebraic-graphs] [2 of 2] Linking Setup
  33. 7.97 s [haskell-language-server] Phase: setupCompilerEnvironmentPhase
  34. 7.97 s [haskell-language-server] Build with /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7.
  35. 8.47 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  36. 8.49 s [algebraic-graphs] Phase: configurePhase
  37. 8.49 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.8LLTLQvQ4z/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/lib
  38. 8.50 s [algebraic-graphs] Using Parsec parser
  39. 8.50 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  40. 8.79 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  41. 8.79 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.18.3.0
  42. 8.79 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
  43. 8.79 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.1
  44. 8.79 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  45. 8.79 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  46. 8.79 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  47. 8.79 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  48. 8.79 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.18.3.0
  49. 8.79 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
  50. 8.79 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.1
  51. 8.79 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  52. 8.79 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  53. 8.79 s [algebraic-graphs] inspection-testing-0.6.2
  54. 8.79 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  55. 8.82 s [haskell-language-server] Phase: unpackPhase
  56. 8.82 s [haskell-language-server] unpacking source archive /nix/store/kqr4dg4wyp0h2dbm7y21zlbp3chihj6k-haskell-language-server-2.12.0.0.tar.gz
  57. 8.88 s [haskell-language-server] source root is haskell-language-server-2.12.0.0
  58. 8.92 s [haskell-language-server] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "haskell-language-server-2.12.0.0/test/wrapper/Main.hs"
  59. 8.93 s [haskell-language-server] Phase: patchPhase
  60. 8.94 s [haskell-language-server] Phase: compileBuildDriverPhase
  61. 8.95 s [haskell-language-server] setupCompileFlags: -package-db=/build/tmp.ahi0eJk2Ab/setup-package.conf.d -threaded
  62. 9.01 s [haskell-language-server] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.ahi0eJk2Ab/Main.o )
  63. 9.06 s [haskell-language-server] [2 of 2] Linking Setup
  64. 9.07 s [algebraic-graphs] Source component graph:
  65. 9.07 s [algebraic-graphs] component lib
  66. 9.07 s [algebraic-graphs] component test:main dependency lib
  67. 9.07 s [algebraic-graphs] Configured component graph:
  68. 9.07 s [algebraic-graphs] component algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  69. 9.07 s [algebraic-graphs] include array-0.5.8.0
  70. 9.07 s [algebraic-graphs] include base-4.18.3.0
  71. 9.07 s [algebraic-graphs] include containers-0.6.7
  72. 9.07 s [algebraic-graphs] include deepseq-1.4.8.1
  73. 9.07 s [algebraic-graphs] include transformers-0.6.1.0
  74. 9.07 s [algebraic-graphs] component algebraic-graphs-0.7-Hb7qr09bMx9JHq5kA09kif-main
  75. 9.07 s [algebraic-graphs] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  76. 9.07 s [algebraic-graphs] include algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  77. 9.07 s [algebraic-graphs] include array-0.5.8.0
  78. 9.07 s [algebraic-graphs] include base-4.18.3.0
  79. 9.07 s [algebraic-graphs] include containers-0.6.7
  80. 9.07 s [algebraic-graphs] include deepseq-1.4.8.1
  81. 9.07 s [algebraic-graphs] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  82. 9.07 s [algebraic-graphs] include inspection-testing-0.6.2-3QX2depSWaUFw922pdySLQ
  83. 9.07 s [algebraic-graphs] include transformers-0.6.1.0
  84. 9.07 s [algebraic-graphs] Linked component graph:
  85. 9.07 s [algebraic-graphs] unit algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  86. 9.07 s [algebraic-graphs] include array-0.5.8.0
  87. 9.08 s [algebraic-graphs] include base-4.18.3.0
  88. 9.08 s [algebraic-graphs] include containers-0.6.7
  89. 9.08 s [algebraic-graphs] include deepseq-1.4.8.1
  90. 9.08 s [algebraic-graphs] include transformers-0.6.1.0
  91. 9.08 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Data.Graph.Typed
  92. 9.08 s [algebraic-graphs] unit algebraic-graphs-0.7-Hb7qr09bMx9JHq5kA09kif-main
  93. 9.08 s [algebraic-graphs] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  94. 9.08 s [algebraic-graphs] include algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  95. 9.08 s [algebraic-graphs] include array-0.5.8.0
  96. 9.08 s [algebraic-graphs] include base-4.18.3.0
  97. 9.08 s [algebraic-graphs] include containers-0.6.7
  98. 9.08 s [algebraic-graphs] include deepseq-1.4.8.1
  99. 9.08 s [algebraic-graphs] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  100. 9.08 s [algebraic-graphs] include inspection-testing-0.6.2-3QX2depSWaUFw922pdySLQ
  101. 9.08 s [algebraic-graphs] include transformers-0.6.1.0
  102. 9.08 s [algebraic-graphs] Ready component graph:
  103. 9.08 s [algebraic-graphs] definite algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  104. 9.08 s [algebraic-graphs] depends array-0.5.8.0
  105. 9.08 s [algebraic-graphs] depends base-4.18.3.0
  106. 9.08 s [algebraic-graphs] depends containers-0.6.7
  107. 9.08 s [algebraic-graphs] depends deepseq-1.4.8.1
  108. 9.08 s [algebraic-graphs] depends transformers-0.6.1.0
  109. 9.08 s [algebraic-graphs] definite algebraic-graphs-0.7-Hb7qr09bMx9JHq5kA09kif-main
  110. 9.08 s [algebraic-graphs] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  111. 9.08 s [algebraic-graphs] depends algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  112. 9.08 s [algebraic-graphs] depends array-0.5.8.0
  113. 9.08 s [algebraic-graphs] depends base-4.18.3.0
  114. 9.08 s [algebraic-graphs] depends containers-0.6.7
  115. 9.08 s [algebraic-graphs] depends deepseq-1.4.8.1
  116. 9.08 s [algebraic-graphs] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  117. 9.08 s [algebraic-graphs] depends inspection-testing-0.6.2-3QX2depSWaUFw922pdySLQ
  118. 9.08 s [algebraic-graphs] depends transformers-0.6.1.0
  119. 9.08 s [algebraic-graphs] Using Cabal-3.10.3.0 compiled by ghc-9.6
  120. 9.08 s [algebraic-graphs] Using compiler: ghc-9.6.7
  121. 9.08 s [algebraic-graphs] Using install prefix:
  122. 9.08 s [algebraic-graphs] /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7
  123. 9.08 s [algebraic-graphs] Executables installed in:
  124. 9.08 s [algebraic-graphs] /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/bin
  125. 9.08 s [algebraic-graphs] Libraries installed in:
  126. 9.08 s [algebraic-graphs] /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  127. 9.08 s [algebraic-graphs] Dynamic Libraries installed in:
  128. 9.08 s [algebraic-graphs] /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  129. 9.08 s [algebraic-graphs] Private executables installed in:
  130. 9.08 s [algebraic-graphs] /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7
  131. 9.08 s [algebraic-graphs] Data files installed in:
  132. 9.08 s [algebraic-graphs] /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7
  133. 9.08 s [algebraic-graphs] Documentation installed in:
  134. 9.08 s [algebraic-graphs] /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  135. 9.08 s [algebraic-graphs] Configuration files installed in:
  136. 9.08 s [algebraic-graphs] /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/etc
  137. 9.08 s [algebraic-graphs] No alex found
  138. 9.08 s [algebraic-graphs] Using ar found on system at:
  139. 9.08 s [algebraic-graphs] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  140. 9.08 s [algebraic-graphs] No c2hs found
  141. 9.08 s [algebraic-graphs] No cpphs found
  142. 9.08 s [algebraic-graphs] No doctest found
  143. 9.08 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  144. 9.08 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  145. 9.08 s [algebraic-graphs] Using ghc version 9.6.7 found on system at:
  146. 9.08 s [algebraic-graphs] /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/ghc
  147. 9.08 s [algebraic-graphs] Using ghc-pkg version 9.6.7 found on system at:
  148. 9.08 s [algebraic-graphs] /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/ghc-pkg-9.6.7
  149. 9.08 s [algebraic-graphs] No ghcjs found
  150. 9.08 s [algebraic-graphs] No ghcjs-pkg found
  151. 9.08 s [algebraic-graphs] No greencard found
  152. 9.08 s [algebraic-graphs] Using haddock version 2.29.2 found on system at:
  153. 9.08 s [algebraic-graphs] /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/haddock-ghc-9.6.7
  154. 9.08 s [algebraic-graphs] No happy found
  155. 9.08 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  156. 9.08 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  157. 9.08 s [algebraic-graphs] No hmake found
  158. 9.08 s [algebraic-graphs] Using hpc version 0.68 found on system at:
  159. 9.08 s [algebraic-graphs] /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/hpc-ghc-9.6.7
  160. 9.08 s [algebraic-graphs] Using hsc2hs version 0.68.9 found on system at:
  161. 9.08 s [algebraic-graphs] /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  162. 9.08 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  163. 9.08 s [algebraic-graphs] /nix/store/na3h6k2pdvfb6kjn5dhiqi3z5l8cfdqx-hscolour-1.25/bin/HsColour
  164. 9.08 s [algebraic-graphs] No jhc found
  165. 9.08 s [algebraic-graphs] Using ld found on system at:
  166. 9.08 s [algebraic-graphs] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  167. 9.08 s [algebraic-graphs] No pkg-config found
  168. 9.08 s [algebraic-graphs] Using runghc version 9.6.7 found on system at:
  169. 9.08 s [algebraic-graphs] /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/runghc-9.6.7
  170. 9.08 s [algebraic-graphs] Using strip version 2.44 found on system at:
  171. 9.08 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  172. 9.08 s [algebraic-graphs] Using tar found on system at:
  173. 9.08 s [algebraic-graphs] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  174. 9.08 s [algebraic-graphs] No uhc found
  175. 9.21 s [algebraic-graphs] Phase: buildPhase
  176. 9.28 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  177. 9.29 s [algebraic-graphs] Building library for algebraic-graphs-0.7..
  178. 9.39 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 )
  179. 10.12 s [haskell-language-server] Phase: updateAutotoolsGnuConfigScriptsPhase
  180. 10.15 s [haskell-language-server] Phase: configurePhase
  181. 10.15 s [haskell-language-server] configureFlags: --verbose --prefix=/nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.ahi0eJk2Ab/package.conf.d --ghc-option=-optl=-Wl,-rpath=/nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/haskell-language-server-2.12.0.0 --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 --enable-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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/lib
  182. 10.18 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 )
  183. 10.20 s [haskell-language-server] Using Parsec parser
  184. 10.20 s [haskell-language-server] Configuring haskell-language-server-2.12.0.0...
  185. 10.69 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 )
  186. 10.90 s [haskell-language-server] Flags chosen: alternatenumberformat=True, cabal=True, cabalfmt=True,
  187. 10.90 s [haskell-language-server] cabalgild=True, callhierarchy=True, changetypesignature=True, class=True,
  188. 10.90 s [haskell-language-server] coderange=True, dynamic=True, eval=True, explicitfields=True,
  189. 10.90 s [haskell-language-server] explicitfixity=True, floskell=True, fourmolu=True, gadt=True, ghc-lib=True,
  190. 10.90 s [haskell-language-server] ghcide-bench=True, hlint=True, ignore-plugins-ghc-bounds=False,
  191. 10.90 s [haskell-language-server] importlens=True, isolatecabalfmttests=False, isolatecabalgildtests=False,
  192. 10.90 s [haskell-language-server] modulename=True, notes=True, ormolu=True, overloadedrecorddot=True,
  193. 10.90 s [haskell-language-server] pedantic=False, pragmas=True, qualifyimportednames=True, refactor=True,
  194. 10.90 s [haskell-language-server] rename=True, retrie=True, semantictokens=True, signaturehelp=True,
  195. 10.90 s [haskell-language-server] splice=True, stan=True, stylishhaskell=True, test-exe=True
  196. 10.90 s [haskell-language-server] Dependency aeson-pretty: using aeson-pretty-0.8.10
  197. 10.90 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  198. 10.90 s [haskell-language-server] Dependency data-default: using data-default-0.8.0.1
  199. 10.90 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  200. 10.90 s [haskell-language-server] Dependency extra: using extra-1.8.1
  201. 10.90 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  202. 10.90 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  203. 10.90 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  204. 10.90 s [haskell-language-server] Dependency githash >=0.1.6.1: using githash-0.1.7.0
  205. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  206. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  207. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  208. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  209. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  210. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  211. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  212. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  213. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  214. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  215. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  216. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  217. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  218. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  219. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  220. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  221. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  222. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  223. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  224. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  225. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  226. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  227. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  228. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  229. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  230. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  231. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  232. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  233. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  234. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  235. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  236. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  237. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  238. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  239. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  240. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  241. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  242. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  243. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  244. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  245. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  246. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  247. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  248. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  249. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  250. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  251. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  252. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  253. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  254. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  255. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  256. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  257. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  258. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  259. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  260. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  261. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  262. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  263. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  264. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  265. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  266. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  267. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  268. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  269. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  270. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  271. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  272. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  273. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  274. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  275. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  276. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  277. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  278. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  279. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  280. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  281. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  282. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  283. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  284. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  285. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  286. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  287. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  288. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  289. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  290. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  291. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  292. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  293. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  294. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  295. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  296. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  297. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  298. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  299. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  300. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  301. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  302. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  303. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  304. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  305. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  306. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  307. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  308. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  309. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  310. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  311. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  312. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  313. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  314. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  315. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  316. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  317. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  318. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  319. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  320. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  321. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  322. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  323. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  324. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  325. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  326. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  327. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  328. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  329. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  330. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  331. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  332. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  333. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  334. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  335. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  336. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  337. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  338. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  339. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  340. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  341. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  342. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  343. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  344. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  345. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  346. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  347. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  348. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  349. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  350. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  351. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  352. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  353. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  354. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  355. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  356. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  357. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  358. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  359. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  360. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  361. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  362. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  363. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  364. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  365. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  366. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  367. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  368. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  369. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  370. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  371. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  372. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  373. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  374. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  375. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  376. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  377. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  378. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  379. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  380. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  381. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  382. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  383. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  384. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  385. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  386. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  387. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  388. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  389. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  390. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  391. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  392. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  393. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  394. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  395. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  396. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  397. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  398. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  399. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  400. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  401. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  402. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  403. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  404. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  405. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  406. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  407. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  408. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  409. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  410. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  411. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  412. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  413. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  414. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  415. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  416. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  417. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  418. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  419. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  420. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  421. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  422. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  423. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  424. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  425. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  426. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  427. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  428. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  429. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  430. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  431. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  432. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  433. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  434. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  435. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  436. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  437. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  438. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  439. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  440. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  441. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  442. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  443. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  444. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  445. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  446. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  447. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  448. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  449. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  450. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  451. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  452. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  453. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  454. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  455. 10.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  456. 10.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  457. 10.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  458. 10.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  459. 10.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  460. 10.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  461. 10.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  462. 10.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  463. 10.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  464. 10.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  465. 10.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  466. 10.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  467. 10.91 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  468. 10.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  469. 10.91 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  470. 10.91 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  471. 10.91 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  472. 10.91 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  473. 10.91 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  474. 10.91 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  475. 10.91 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  476. 10.91 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  477. 10.91 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  478. 10.91 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  479. 10.91 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  480. 10.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  481. 10.91 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  482. 10.91 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  483. 10.91 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  484. 10.91 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  485. 10.91 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  486. 10.91 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  487. 10.91 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  488. 10.91 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  489. 10.91 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  490. 10.91 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  491. 10.91 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  492. 10.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  493. 10.91 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  494. 10.91 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  495. 10.91 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  496. 10.91 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  497. 10.91 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  498. 10.91 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  499. 10.91 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  500. 10.91 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  501. 10.91 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  502. 10.91 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  503. 10.91 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  504. 10.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  505. 10.91 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  506. 10.91 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  507. 10.91 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  508. 10.91 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  509. 10.91 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  510. 10.91 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  511. 10.91 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  512. 10.91 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  513. 10.91 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  514. 10.91 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  515. 10.91 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  516. 10.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  517. 10.91 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  518. 10.91 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  519. 10.91 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  520. 10.91 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  521. 10.91 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  522. 10.91 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  523. 10.91 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  524. 10.91 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  525. 10.91 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  526. 10.91 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  527. 10.91 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  528. 10.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  529. 10.91 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  530. 10.91 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  531. 10.91 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  532. 10.91 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  533. 10.91 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  534. 10.91 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  535. 10.91 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  536. 10.91 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  537. 10.91 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  538. 10.91 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  539. 10.91 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  540. 10.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  541. 10.91 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  542. 10.91 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  543. 10.91 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  544. 10.91 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  545. 10.91 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  546. 10.91 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  547. 10.91 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  548. 10.91 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  549. 10.91 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  550. 10.91 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  551. 10.91 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  552. 10.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  553. 10.91 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  554. 10.91 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  555. 10.91 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  556. 10.91 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  557. 10.91 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  558. 10.91 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  559. 10.91 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  560. 10.91 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  561. 10.91 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  562. 10.91 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  563. 10.91 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  564. 10.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  565. 10.91 s [haskell-language-server] Dependency hie-bios: using hie-bios-0.17.0
  566. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  567. 10.91 s [haskell-language-server] Dependency optparse-applicative: using optparse-applicative-0.18.1.0
  568. 10.91 s [haskell-language-server] Dependency optparse-simple: using optparse-simple-0.1.1.4
  569. 10.91 s [haskell-language-server] Dependency prettyprinter >=1.7: using prettyprinter-1.7.1
  570. 10.91 s [haskell-language-server] Dependency process: using process-1.6.19.0
  571. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  572. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  573. 10.91 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  574. 10.91 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  575. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  576. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  577. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  578. 10.91 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  579. 10.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  580. 10.91 s [haskell-language-server] Dependency process-extras: using process-extras-0.7.4
  581. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  582. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  583. 10.91 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  584. 10.91 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  585. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  586. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  587. 10.91 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  588. 10.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  589. 10.91 s [haskell-language-server] Dependency process-extras: using process-extras-0.7.4
  590. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  591. 10.91 s [haskell-language-server] Dependency Cabal: using Cabal-3.10.3.0
  592. 10.91 s [haskell-language-server] Dependency Cabal-syntax >=3.7: using Cabal-syntax-3.10.3.0
  593. 10.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  594. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  595. 10.91 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  596. 10.91 s [haskell-language-server] Dependency cabal-add >=0.2 && <0.3: using cabal-add-0.2
  597. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  598. 10.91 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  599. 10.91 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  600. 10.91 s [haskell-language-server] Dependency extra >=1.7.4: using extra-1.8.1
  601. 10.91 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  602. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  603. 10.91 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  604. 10.91 s [haskell-language-server] Dependency hls-graph ==2.12.0.0: using hls-graph-2.12.0.0
  605. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  606. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  607. 10.91 s [haskell-language-server] Dependency lsp >=2.7 && <2.8: using lsp-2.7.0.1
  608. 10.91 s [haskell-language-server] Dependency lsp-types >=2.3 && <2.4: using lsp-types-2.3.0.1
  609. 10.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  610. 10.91 s [haskell-language-server] Dependency pretty: using pretty-1.1.3.6
  611. 10.91 s [haskell-language-server] Dependency regex-tdfa >=1.3.1 && <1.4: using regex-tdfa-1.3.2.5
  612. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  613. 10.91 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  614. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  615. 10.91 s [haskell-language-server] Dependency unordered-containers >=0.2.10.0: using
  616. 10.91 s [haskell-language-server] unordered-containers-0.2.20.1
  617. 10.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  618. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  619. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  620. 10.91 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  621. 10.91 s [haskell-language-server] Dependency extra: using extra-1.8.1
  622. 10.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  623. 10.91 s [haskell-language-server] Dependency ghc-exactprint >=1.5 && <1.13.0.0: using ghc-exactprint-1.7.1.0
  624. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  625. 10.91 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  626. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  627. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  628. 10.91 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  629. 10.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  630. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  631. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  632. 10.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  633. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  634. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  635. 10.91 s [haskell-language-server] Dependency extra: using extra-1.8.1
  636. 10.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  637. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  638. 10.91 s [haskell-language-server] Dependency hiedb >=0.7.0.0 && <0.8: using hiedb-0.7.0.0
  639. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  640. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  641. 10.91 s [haskell-language-server] Dependency lsp >=2.7: using lsp-2.7.0.1
  642. 10.91 s [haskell-language-server] Dependency sqlite-simple: using sqlite-simple-0.4.19.0
  643. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  644. 10.91 s [haskell-language-server] Dependency Diff >=0.5 && <0.6 || >=1.0.0 && <1.1: using Diff-1.0.2
  645. 10.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  646. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  647. 10.91 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  648. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  649. 10.91 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  650. 10.91 s [haskell-language-server] Dependency dlist: using dlist-1.0
  651. 10.91 s [haskell-language-server] Dependency extra: using extra-1.8.1
  652. 10.91 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  653. 10.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  654. 10.91 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.6.7
  655. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  656. 10.91 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  657. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  658. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  659. 10.91 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  660. 10.91 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  661. 10.91 s [haskell-language-server] Dependency megaparsec >=9.0: using megaparsec-9.7.0
  662. 10.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  663. 10.91 s [haskell-language-server] Dependency parser-combinators >=1.2: using parser-combinators-1.3.0
  664. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  665. 10.91 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  666. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  667. 10.91 s [haskell-language-server] Dependency unliftio: using unliftio-0.2.25.1
  668. 10.91 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  669. 10.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  670. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  671. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  672. 10.91 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  673. 10.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  674. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  675. 10.91 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  676. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  677. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  678. 10.91 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  679. 10.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  680. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  681. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  682. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  683. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  684. 10.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  685. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  686. 10.91 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  687. 10.91 s [haskell-language-server] Dependency haskell-language-server:hls-refactor-plugin: using
  688. 10.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  689. 10.91 s [haskell-language-server] Dependency hiedb >=0.7.0.0 && <0.8: using hiedb-0.7.0.0
  690. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  691. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  692. 10.91 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  693. 10.91 s [haskell-language-server] Dependency mod: using mod-0.2.1.0
  694. 10.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  695. 10.91 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  696. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  697. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  698. 10.91 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  699. 10.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  700. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  701. 10.91 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  702. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  703. 10.91 s [haskell-language-server] Dependency extra: using extra-1.8.1
  704. 10.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  705. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  706. 10.91 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  707. 10.91 s [haskell-language-server] Dependency haskell-language-server:hls-refactor-plugin: using
  708. 10.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  709. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  710. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  711. 10.91 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  712. 10.91 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  713. 10.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  714. 10.91 s [haskell-language-server] Dependency retrie >=0.1.1.0: using retrie-1.2.3
  715. 10.91 s [haskell-language-server] Dependency safe-exceptions: using safe-exceptions-0.1.7.4
  716. 10.91 s [haskell-language-server] Dependency stm: using stm-2.5.1.0
  717. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  718. 10.91 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  719. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  720. 10.91 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  721. 10.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  722. 10.91 s [haskell-language-server] Dependency apply-refact: using apply-refact-0.15.0.0
  723. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  724. 10.91 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  725. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  726. 10.91 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  727. 10.91 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  728. 10.91 s [haskell-language-server] Dependency ghc-lib-parser: using ghc-lib-parser-9.8.5.20250214
  729. 10.91 s [haskell-language-server] Dependency ghc-lib-parser-ex: using ghc-lib-parser-ex-9.8.0.2
  730. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  731. 10.91 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  732. 10.91 s [haskell-language-server] Dependency hlint >=3.5 && <3.11: using hlint-3.8
  733. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  734. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  735. 10.91 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  736. 10.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  737. 10.91 s [haskell-language-server] Dependency refact: using refact-0.3.0.2
  738. 10.91 s [haskell-language-server] Dependency regex-tdfa: using regex-tdfa-1.3.2.5
  739. 10.91 s [haskell-language-server] Dependency stm: using stm-2.5.1.0
  740. 10.91 s [haskell-language-server] Dependency temporary: using temporary-1.3
  741. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  742. 10.91 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  743. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  744. 10.91 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  745. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  746. 10.91 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  747. 10.91 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  748. 10.91 s [haskell-language-server] Dependency ghcide: using ghcide-2.12.0.0
  749. 10.91 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  750. 10.91 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  751. 10.91 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  752. 10.91 s [haskell-language-server] Dependency stan >=0.2.1.0: using stan-0.2.1.0
  753. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  754. 10.91 s [haskell-language-server] Dependency trial: using trial-0.0.0.0
  755. 10.91 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  756. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  757. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  758. 10.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  759. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  760. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  761. 10.91 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  762. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  763. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  764. 10.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  765. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  766. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  767. 10.91 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  768. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  769. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  770. 10.91 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  771. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  772. 10.91 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  773. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  774. 10.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  775. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  776. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  777. 10.91 s [haskell-language-server] Dependency extra: using extra-1.8.1
  778. 10.91 s [haskell-language-server] Dependency fuzzy: using fuzzy-0.1.1.0
  779. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  780. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  781. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  782. 10.91 s [haskell-language-server] Dependency lens-aeson: using lens-aeson-1.2.3
  783. 10.91 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  784. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  785. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  786. 10.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  787. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  788. 10.91 s [haskell-language-server] Dependency extra: using extra-1.8.1
  789. 10.91 s [haskell-language-server] Dependency foldl: using foldl-1.4.18
  790. 10.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  791. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  792. 10.91 s [haskell-language-server] Dependency haskell-language-server:hls-refactor-plugin: using
  793. 10.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  794. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  795. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  796. 10.91 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  797. 10.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  798. 10.91 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  799. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  800. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  801. 10.91 s [haskell-language-server] Dependency unliftio-core: using unliftio-core-0.2.1.0
  802. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  803. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  804. 10.91 s [haskell-language-server] Dependency extra: using extra-1.8.1
  805. 10.91 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.6.7
  806. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  807. 10.91 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  808. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  809. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  810. 10.91 s [haskell-language-server] Dependency lsp >=2.7 && <2.8: using lsp-2.7.0.1
  811. 10.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  812. 10.91 s [haskell-language-server] Dependency regex-tdfa: using regex-tdfa-1.3.2.5
  813. 10.91 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  814. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  815. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  816. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  817. 10.91 s [haskell-language-server] Dependency dlist: using dlist-1.0
  818. 10.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  819. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  820. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  821. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  822. 10.91 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  823. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  824. 10.91 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  825. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  826. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  827. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  828. 10.91 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  829. 10.91 s [haskell-language-server] Dependency extra: using extra-1.8.1
  830. 10.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  831. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  832. 10.91 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  833. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  834. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  835. 10.91 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  836. 10.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  837. 10.91 s [haskell-language-server] Dependency semigroupoids: using semigroupoids-6.0.1
  838. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  839. 10.91 s [haskell-language-server] Dependency vector: using vector-0.13.2.0
  840. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  841. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  842. 10.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  843. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  844. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  845. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  846. 10.91 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  847. 10.91 s [haskell-language-server] Dependency regex-tdfa: using regex-tdfa-1.3.2.5
  848. 10.91 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  849. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  850. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  851. 10.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  852. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  853. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  854. 10.91 s [haskell-language-server] Dependency extra: using extra-1.8.1
  855. 10.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  856. 10.91 s [haskell-language-server] Dependency ghc-exactprint: using ghc-exactprint-1.7.1.0
  857. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  858. 10.91 s [haskell-language-server] Dependency haskell-language-server:hls-refactor-plugin: using
  859. 10.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  860. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  861. 10.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  862. 10.91 s [haskell-language-server] Dependency lsp >=2.7: using lsp-2.7.0.1
  863. 10.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  864. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  865. 10.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  866. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  867. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  868. 10.91 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  869. 10.91 s [haskell-language-server] Dependency extra: using extra-1.8.1
  870. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  871. 10.91 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  872. 10.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  873. 10.91 s [haskell-language-server] Dependency lsp >=2.7: using lsp-2.7.0.1
  874. 10.91 s [haskell-language-server] Dependency text: using text-2.0.2
  875. 10.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  876. 10.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  877. 10.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  878. 10.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  879. 10.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  880. 10.92 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  881. 10.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  882. 10.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  883. 10.92 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  884. 10.92 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  885. 10.92 s [haskell-language-server] Dependency text: using text-2.0.2
  886. 10.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  887. 10.92 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  888. 10.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  889. 10.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  890. 10.92 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  891. 10.92 s [haskell-language-server] Dependency ghcide: using ghcide-2.12.0.0
  892. 10.92 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  893. 10.92 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  894. 10.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  895. 10.92 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  896. 10.92 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  897. 10.92 s [haskell-language-server] Dependency text: using text-2.0.2
  898. 10.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  899. 10.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  900. 10.92 s [haskell-language-server] Dependency floskell >=0.11.0 && <0.12: using floskell-0.11.1
  901. 10.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  902. 10.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  903. 10.92 s [haskell-language-server] Dependency lsp-types >=2.3 && <2.4: using lsp-types-2.3.0.1
  904. 10.92 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  905. 10.92 s [haskell-language-server] Dependency text: using text-2.0.2
  906. 10.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  907. 10.92 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  908. 10.92 s [haskell-language-server] Dependency fourmolu >=0.14 && <0.20: using fourmolu-0.15.0.0
  909. 10.92 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.6.7
  910. 10.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  911. 10.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  912. 10.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  913. 10.92 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  914. 10.92 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  915. 10.92 s [haskell-language-server] Dependency process-extras >=0.7.1: using process-extras-0.7.4
  916. 10.92 s [haskell-language-server] Dependency text: using text-2.0.2
  917. 10.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  918. 10.92 s [haskell-language-server] Dependency yaml: using yaml-0.11.11.2
  919. 10.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  920. 10.92 s [haskell-language-server] Dependency extra: using extra-1.8.1
  921. 10.92 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  922. 10.92 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.6.7
  923. 10.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  924. 10.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  925. 10.92 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  926. 10.92 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  927. 10.92 s [haskell-language-server] Dependency ormolu >=0.5.3 && <0.9: using ormolu-0.7.4.0
  928. 10.92 s [haskell-language-server] Dependency process-extras >=0.7.1: using process-extras-0.7.4
  929. 10.92 s [haskell-language-server] Dependency text: using text-2.0.2
  930. 10.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  931. 10.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  932. 10.92 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  933. 10.92 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  934. 10.92 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.6.7
  935. 10.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  936. 10.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  937. 10.92 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  938. 10.92 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  939. 10.92 s [haskell-language-server] Dependency stylish-haskell >=0.12 && <0.16: using stylish-haskell-0.14.6.0
  940. 10.92 s [haskell-language-server] Dependency text: using text-2.0.2
  941. 10.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  942. 10.92 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  943. 10.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  944. 10.92 s [haskell-language-server] Dependency data-default: using data-default-0.8.0.1
  945. 10.92 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  946. 10.92 s [haskell-language-server] Dependency dlist: using dlist-1.0
  947. 10.92 s [haskell-language-server] Dependency extra: using extra-1.8.1
  948. 10.92 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  949. 10.92 s [haskell-language-server] Dependency ghc-boot: using ghc-boot-9.6.7
  950. 10.92 s [haskell-language-server] Dependency ghc-exactprint <1 || >=1.4: using ghc-exactprint-1.7.1.0
  951. 10.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  952. 10.92 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  953. 10.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  954. 10.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  955. 10.92 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  956. 10.92 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  957. 10.92 s [haskell-language-server] Dependency parser-combinators: using parser-combinators-1.3.0
  958. 10.92 s [haskell-language-server] Dependency regex-applicative: using regex-applicative-0.3.4
  959. 10.92 s [haskell-language-server] Dependency regex-tdfa: using regex-tdfa-1.3.2.5
  960. 10.92 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  961. 10.92 s [haskell-language-server] Dependency text: using text-2.0.2
  962. 10.92 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  963. 10.92 s [haskell-language-server] Dependency time: using time-1.12.2
  964. 10.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  965. 10.92 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  966. 10.92 s [haskell-language-server] Dependency array: using array-0.5.8.0
  967. 10.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  968. 10.92 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  969. 10.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  970. 10.92 s [haskell-language-server] Dependency data-default: using data-default-0.8.0.1
  971. 10.92 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  972. 10.92 s [haskell-language-server] Dependency dlist: using dlist-1.0
  973. 10.92 s [haskell-language-server] Dependency extra: using extra-1.8.1
  974. 10.92 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  975. 10.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  976. 10.92 s [haskell-language-server] Dependency hls-graph ==2.12.0.0: using hls-graph-2.12.0.0
  977. 10.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  978. 10.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  979. 10.92 s [haskell-language-server] Dependency lsp >=2.6: using lsp-2.7.0.1
  980. 10.92 s [haskell-language-server] Dependency mtl >=2.2: using mtl-2.3.1
  981. 10.92 s [haskell-language-server] Dependency stm: using stm-2.5.1.0
  982. 10.92 s [haskell-language-server] Dependency stm-containers: using stm-containers-1.2.1.1
  983. 10.92 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  984. 10.92 s [haskell-language-server] Dependency template-haskell: using template-haskell-2.20.0.0
  985. 10.92 s [haskell-language-server] Dependency text: using text-2.0.2
  986. 10.92 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  987. 10.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  988. 10.92 s [haskell-language-server] Dependency array: using array-0.5.8.0
  989. 10.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  990. 10.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  991. 10.92 s [haskell-language-server] Dependency hls-graph ==2.12.0.0: using hls-graph-2.12.0.0
  992. 10.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  993. 10.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  994. 10.92 s [haskell-language-server] Dependency lsp >=2.7: using lsp-2.7.0.1
  995. 10.92 s [haskell-language-server] Dependency mtl >=2.2: using mtl-2.3.1
  996. 10.92 s [haskell-language-server] Dependency regex-tdfa >=1.3.1: using regex-tdfa-1.3.2.5
  997. 10.92 s [haskell-language-server] Dependency text: using text-2.0.2
  998. 10.92 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  999. 10.92 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  1000. 10.92 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  1001. 10.92 s [haskell-language-server] Dependency async: using async-2.2.5
  1002. 10.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  1003. 10.92 s [haskell-language-server] Dependency binary: using binary-0.8.9.1
  1004. 10.92 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  1005. 10.92 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  1006. 10.92 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  1007. 10.92 s [haskell-language-server] Dependency extra: using extra-1.8.1
  1008. 10.92 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  1009. 10.92 s [haskell-language-server] Dependency ghcide: using ghcide-2.12.0.0
  1010. 10.92 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  1011. 10.92 s [haskell-language-server] Dependency hls-test-utils: using hls-test-utils-2.12.0.0
  1012. 10.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  1013. 10.92 s [haskell-language-server] Dependency lsp-test: using lsp-test-0.17.1.1
  1014. 10.92 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  1015. 10.92 s [haskell-language-server] Dependency optparse-applicative: using optparse-applicative-0.18.1.0
  1016. 10.92 s [haskell-language-server] Dependency parser-combinators: using parser-combinators-1.3.0
  1017. 10.92 s [haskell-language-server] Dependency process: using process-1.6.19.0
  1018. 10.92 s [haskell-language-server] Dependency row-types: using row-types-1.0.1.2
  1019. 10.92 s [haskell-language-server] Dependency safe-exceptions: using safe-exceptions-0.1.7.4
  1020. 10.92 s [haskell-language-server] Dependency shake: using shake-0.19.8
  1021. 10.92 s [haskell-language-server] Dependency text: using text-2.0.2
  1022. 10.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  1023. 10.92 s [haskell-language-server] Dependency haskell-language-server: using haskell-language-server-2.12.0.0
  1024. 10.92 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  1025. 10.92 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  1026. 10.92 s [haskell-language-server] Dependency prettyprinter >=1.7: using prettyprinter-1.7.1
  1027. 10.92 s [haskell-language-server] Dependency text: using text-2.0.2
  1028. 10.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  1029. 10.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  1030. 10.92 s [haskell-language-server] Dependency data-default: using data-default-0.8.0.1
  1031. 10.92 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  1032. 10.92 s [haskell-language-server] Dependency extra: using extra-1.8.1
  1033. 10.92 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  1034. 10.92 s [haskell-language-server] Dependency ghcide: using ghcide-2.12.0.0
  1035. 10.92 s [haskell-language-server] Dependency haskell-language-server: using haskell-language-server-2.12.0.0
  1036. 10.92 s [haskell-language-server] Dependency hie-bios: using hie-bios-0.17.0
  1037. 10.92 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  1038. 10.92 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  1039. 10.92 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  1040. 10.92 s [haskell-language-server] Dependency text: using text-2.0.2
  1041. 10.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  1042. 10.92 s [haskell-language-server] Dependency unix: using unix-2.8.6.0
  1043. 10.92 s [haskell-language-server] Dependency unliftio-core: using unliftio-core-0.2.1.0
  1044. 10.92 s [haskell-language-server] Dependency base >=4 && <5: using base-4.18.3.0
  1045. 10.92 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  1046. 10.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  1047. 10.92 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  1048. 10.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  1049. 10.92 s [haskell-language-server] Dependency data-default: using data-default-0.8.0.1
  1050. 10.92 s [haskell-language-server] Dependency extra: using extra-1.8.1
  1051. 10.92 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  1052. 10.92 s [haskell-language-server] Dependency haskell-language-server:ghcide-bench-lib: using
  1053. 10.92 s [haskell-language-server] haskell-language-server-2.12.0.0
  1054. 10.92 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  1055. 10.92 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  1056. 10.92 s [haskell-language-server] Dependency hls-test-utils: using hls-test-utils-2.12.0.0
  1057. 10.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  1058. 10.92 s [haskell-language-server] Dependency lsp-test: using lsp-test-0.17.1.1
  1059. 10.92 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  1060. 10.92 s [haskell-language-server] Dependency optparse-applicative: using optparse-applicative-0.18.1.0
  1061. 10.92 s [haskell-language-server] Dependency process: using process-1.6.19.0
  1062. 10.92 s [haskell-language-server] Dependency safe-exceptions: using safe-exceptions-0.1.7.4
  1063. 10.92 s [haskell-language-server] Dependency shake: using shake-0.19.8
  1064. 10.92 s [haskell-language-server] Dependency tasty-hunit >=0.10: using tasty-hunit-0.10.2
  1065. 10.92 s [haskell-language-server] Dependency text: using text-2.0.2
  1066. 10.92 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  1067. 10.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  1068. 10.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  1069. 10.92 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  1070. 10.92 s [haskell-language-server] Dependency ghcide: using ghcide-2.12.0.0
  1071. 10.92 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  1072. 10.92 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  1073. 10.92 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  1074. 10.92 s [haskell-language-server] Dependency markdown-unlit: using markdown-unlit-0.6.0
  1075. 10.92 s [haskell-language-server] Dependency text: using text-2.0.2
  1076. 10.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  1077. 10.92 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  1078. 10.98 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 )
  1079. 10.98 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  1080. 11.25 s [haskell-language-server] Source component graph:
  1081. 11.25 s [haskell-language-server] component exe:plugin-tutorial
  1082. 11.25 s [haskell-language-server] component exe:ghcide-test-preprocessor
  1083. 11.25 s [haskell-language-server] component lib:hls-stylish-haskell-plugin
  1084. 11.25 s [haskell-language-server] component lib:hls-stan-plugin
  1085. 11.25 s [haskell-language-server] component lib:hls-signature-help-plugin
  1086. 11.25 s [haskell-language-server] component lib:hls-semantic-tokens-plugin
  1087. 11.25 s [haskell-language-server] component lib:hls-refactor-plugin
  1088. 11.25 s [haskell-language-server] component lib:hls-rename-plugin dependency lib:hls-refactor-plugin
  1089. 11.25 s [haskell-language-server] component lib:hls-retrie-plugin dependency lib:hls-refactor-plugin
  1090. 11.25 s [haskell-language-server] component lib:hls-splice-plugin dependency lib:hls-refactor-plugin
  1091. 11.25 s [haskell-language-server] component lib:hls-qualify-imported-names-plugin
  1092. 11.25 s [haskell-language-server] component lib:hls-pragmas-plugin
  1093. 11.25 s [haskell-language-server] component lib:hls-overloaded-record-dot-plugin
  1094. 11.25 s [haskell-language-server] component lib:hls-ormolu-plugin
  1095. 11.25 s [haskell-language-server] component lib:hls-notes-plugin
  1096. 11.25 s [haskell-language-server] component lib:hls-module-name-plugin
  1097. 11.25 s [haskell-language-server] component lib:hls-hlint-plugin
  1098. 11.25 s [haskell-language-server] component lib:hls-gadt-plugin dependency lib:hls-refactor-plugin
  1099. 11.25 s [haskell-language-server] component lib:hls-fourmolu-plugin
  1100. 11.25 s [haskell-language-server] component lib:hls-floskell-plugin
  1101. 11.25 s [haskell-language-server] component lib:hls-explicit-record-fields-plugin
  1102. 11.25 s [haskell-language-server] component lib:hls-explicit-imports-plugin
  1103. 11.25 s [haskell-language-server] component lib:hls-explicit-fixity-plugin
  1104. 11.25 s [haskell-language-server] component lib:hls-eval-plugin
  1105. 11.25 s [haskell-language-server] component lib:hls-code-range-plugin
  1106. 11.25 s [haskell-language-server] component lib:hls-class-plugin
  1107. 11.25 s [haskell-language-server] component lib:hls-change-type-signature-plugin
  1108. 11.25 s [haskell-language-server] component lib:hls-call-hierarchy-plugin
  1109. 11.25 s [haskell-language-server] component lib:hls-cabal-plugin
  1110. 11.25 s [haskell-language-server] component lib:hls-cabal-gild-plugin
  1111. 11.25 s [haskell-language-server] component lib:hls-cabal-fmt-plugin
  1112. 11.25 s [haskell-language-server] component lib:hls-alternate-number-format-plugin
  1113. 11.25 s [haskell-language-server] component lib:ghcide-bench-lib
  1114. 11.25 s [haskell-language-server] component exe:ghcide-bench dependency lib:ghcide-bench-lib
  1115. 11.25 s [haskell-language-server] component lib
  1116. 11.25 s [haskell-language-server] dependency lib:hls-alternate-number-format-plugin
  1117. 11.25 s [haskell-language-server] dependency lib:hls-cabal-fmt-plugin
  1118. 11.25 s [haskell-language-server] dependency lib:hls-cabal-gild-plugin
  1119. 11.25 s [haskell-language-server] dependency lib:hls-cabal-plugin
  1120. 11.25 s [haskell-language-server] dependency lib:hls-call-hierarchy-plugin
  1121. 11.25 s [haskell-language-server] dependency lib:hls-change-type-signature-plugin
  1122. 11.25 s [haskell-language-server] dependency lib:hls-class-plugin
  1123. 11.25 s [haskell-language-server] dependency lib:hls-code-range-plugin
  1124. 11.25 s [haskell-language-server] dependency lib:hls-eval-plugin
  1125. 11.25 s [haskell-language-server] dependency lib:hls-explicit-fixity-plugin
  1126. 11.25 s [haskell-language-server] dependency lib:hls-explicit-imports-plugin
  1127. 11.25 s [haskell-language-server] dependency lib:hls-explicit-record-fields-plugin
  1128. 11.25 s [haskell-language-server] dependency lib:hls-floskell-plugin
  1129. 11.25 s [haskell-language-server] dependency lib:hls-fourmolu-plugin
  1130. 11.25 s [haskell-language-server] dependency lib:hls-gadt-plugin
  1131. 11.25 s [haskell-language-server] dependency lib:hls-hlint-plugin
  1132. 11.25 s [haskell-language-server] dependency lib:hls-module-name-plugin
  1133. 11.25 s [haskell-language-server] dependency lib:hls-notes-plugin
  1134. 11.25 s [haskell-language-server] dependency lib:hls-ormolu-plugin
  1135. 11.25 s [haskell-language-server] dependency lib:hls-overloaded-record-dot-plugin
  1136. 11.25 s [haskell-language-server] dependency lib:hls-pragmas-plugin
  1137. 11.25 s [haskell-language-server] dependency lib:hls-qualify-imported-names-plugin
  1138. 11.25 s [haskell-language-server] dependency lib:hls-refactor-plugin
  1139. 11.25 s [haskell-language-server] dependency lib:hls-rename-plugin
  1140. 11.25 s [haskell-language-server] dependency lib:hls-retrie-plugin
  1141. 11.25 s [haskell-language-server] dependency lib:hls-semantic-tokens-plugin
  1142. 11.25 s [haskell-language-server] dependency lib:hls-signature-help-plugin
  1143. 11.25 s [haskell-language-server] dependency lib:hls-splice-plugin
  1144. 11.25 s [haskell-language-server] dependency lib:hls-stan-plugin
  1145. 11.25 s [haskell-language-server] dependency lib:hls-stylish-haskell-plugin
  1146. 11.25 s [haskell-language-server] component exe:haskell-language-server dependency lib
  1147. 11.25 s [haskell-language-server] component exe:haskell-language-server-wrapper dependency lib
  1148. 11.25 s [haskell-language-server] Configured component graph:
  1149. 11.25 s [haskell-language-server] component haskell-language-server-2.12.0.0-4pY5yY1pY4d8Hs1Q2a6ukB-plugin-tutorial
  1150. 11.25 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1151. 11.25 s [haskell-language-server] include base-4.18.3.0
  1152. 11.25 s [haskell-language-server] include containers-0.6.7
  1153. 11.25 s [haskell-language-server] include ghc-9.6.7
  1154. 11.25 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1155. 11.25 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1156. 11.25 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1157. 11.25 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1158. 11.25 s [haskell-language-server] include markdown-unlit-0.6.0-5809pVajWVb2gBk7RWYi4C
  1159. 11.25 s [haskell-language-server] include text-2.0.2
  1160. 11.25 s [haskell-language-server] include transformers-0.6.1.0
  1161. 11.25 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1162. 11.25 s [haskell-language-server] component haskell-language-server-2.12.0.0-JHhSHT2pml8BalYIyFTgc7-ghcide-test-preprocessor
  1163. 11.25 s [haskell-language-server] include base-4.18.3.0
  1164. 11.25 s [haskell-language-server] component haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  1165. 11.25 s [haskell-language-server] include base-4.18.3.0
  1166. 11.25 s [haskell-language-server] include directory-1.3.8.5
  1167. 11.25 s [haskell-language-server] include filepath-1.4.301.0
  1168. 11.25 s [haskell-language-server] include ghc-boot-th-9.6.7
  1169. 11.25 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1170. 11.25 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1171. 11.25 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1172. 11.25 s [haskell-language-server] include mtl-2.3.1
  1173. 11.25 s [haskell-language-server] include stylish-haskell-0.14.6.0-LLvgSofQOCY3hHahYzFIC6
  1174. 11.25 s [haskell-language-server] include text-2.0.2
  1175. 11.25 s [haskell-language-server] component haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  1176. 11.25 s [haskell-language-server] include base-4.18.3.0
  1177. 11.25 s [haskell-language-server] include deepseq-1.4.8.1
  1178. 11.25 s [haskell-language-server] include directory-1.3.8.5
  1179. 11.25 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1180. 11.25 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  1181. 11.25 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1182. 11.25 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1183. 11.25 s [haskell-language-server] include stan-0.2.1.0-B6pDZR8PjMBItDLFTHk8I9
  1184. 11.25 s [haskell-language-server] include text-2.0.2
  1185. 11.25 s [haskell-language-server] include trial-0.0.0.0-4bVaCFWxanU7Vl3nRX6Yi0
  1186. 11.25 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1187. 11.25 s [haskell-language-server] component haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  1188. 11.25 s [haskell-language-server] include base-4.18.3.0
  1189. 11.25 s [haskell-language-server] include containers-0.6.7
  1190. 11.25 s [haskell-language-server] include ghc-9.6.7
  1191. 11.25 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1192. 11.25 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1193. 11.25 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1194. 11.25 s [haskell-language-server] include text-2.0.2
  1195. 11.25 s [haskell-language-server] include transformers-0.6.1.0
  1196. 11.25 s [haskell-language-server] component haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  1197. 11.25 s [haskell-language-server] include array-0.5.8.0
  1198. 11.25 s [haskell-language-server] include base-4.18.3.0
  1199. 11.25 s [haskell-language-server] include bytestring-0.11.5.4
  1200. 11.25 s [haskell-language-server] include containers-0.6.7
  1201. 11.25 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  1202. 11.25 s [haskell-language-server] include deepseq-1.4.8.1
  1203. 11.25 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  1204. 11.25 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1205. 11.25 s [haskell-language-server] include ghc-9.6.7
  1206. 11.25 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1207. 11.25 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1208. 11.25 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1209. 11.25 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1210. 11.25 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1211. 11.25 s [haskell-language-server] include mtl-2.3.1
  1212. 11.25 s [haskell-language-server] include stm-2.5.1.0
  1213. 11.25 s [haskell-language-server] include stm-containers-1.2.1.1-JDBpT36aDZ4CUdJ1Aus6oe
  1214. 11.25 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  1215. 11.25 s [haskell-language-server] include template-haskell-2.20.0.0
  1216. 11.25 s [haskell-language-server] include text-2.0.2
  1217. 11.25 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1218. 11.25 s [haskell-language-server] include transformers-0.6.1.0
  1219. 11.25 s [haskell-language-server] component haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  1220. 11.25 s [haskell-language-server] include base-4.18.3.0
  1221. 11.25 s [haskell-language-server] include bytestring-0.11.5.4
  1222. 11.25 s [haskell-language-server] include containers-0.6.7
  1223. 11.25 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  1224. 11.25 s [haskell-language-server] include deepseq-1.4.8.1
  1225. 11.25 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  1226. 11.25 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1227. 11.25 s [haskell-language-server] include ghc-9.6.7
  1228. 11.25 s [haskell-language-server] include ghc-boot-9.6.7
  1229. 11.25 s [haskell-language-server] include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  1230. 11.25 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1231. 11.25 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1232. 11.25 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1233. 11.25 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1234. 11.25 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1235. 11.25 s [haskell-language-server] include mtl-2.3.1
  1236. 11.25 s [haskell-language-server] include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  1237. 11.25 s [haskell-language-server] include regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM
  1238. 11.25 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  1239. 11.25 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  1240. 11.25 s [haskell-language-server] include text-2.0.2
  1241. 11.25 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1242. 11.25 s [haskell-language-server] include time-1.12.2
  1243. 11.25 s [haskell-language-server] include transformers-0.6.1.0
  1244. 11.25 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1245. 11.25 s [haskell-language-server] component haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  1246. 11.25 s [haskell-language-server] include base-4.18.3.0
  1247. 11.25 s [haskell-language-server] include containers-0.6.7
  1248. 11.25 s [haskell-language-server] include ghc-9.6.7
  1249. 11.25 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1250. 11.25 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  1251. 11.25 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  1252. 11.25 s [haskell-language-server] include hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
  1253. 11.26 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1254. 11.26 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1255. 11.26 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1256. 11.26 s [haskell-language-server] include mod-0.2.1.0-AEqKlJqNyYNGsAQxMMfOED
  1257. 11.26 s [haskell-language-server] include mtl-2.3.1
  1258. 11.26 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  1259. 11.26 s [haskell-language-server] include text-2.0.2
  1260. 11.26 s [haskell-language-server] include transformers-0.6.1.0
  1261. 11.26 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1262. 11.26 s [haskell-language-server] component haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  1263. 11.26 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1264. 11.26 s [haskell-language-server] include base-4.18.3.0
  1265. 11.26 s [haskell-language-server] include bytestring-0.11.5.4
  1266. 11.26 s [haskell-language-server] include containers-0.6.7
  1267. 11.26 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1268. 11.26 s [haskell-language-server] include ghc-9.6.7
  1269. 11.26 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1270. 11.26 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  1271. 11.26 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  1272. 11.26 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1273. 11.26 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1274. 11.26 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1275. 11.26 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1276. 11.26 s [haskell-language-server] include mtl-2.3.1
  1277. 11.26 s [haskell-language-server] include retrie-1.2.3-4syE2wloz6UAMXGW9FTmsG
  1278. 11.26 s [haskell-language-server] include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  1279. 11.26 s [haskell-language-server] include stm-2.5.1.0
  1280. 11.26 s [haskell-language-server] include text-2.0.2
  1281. 11.26 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1282. 11.26 s [haskell-language-server] include transformers-0.6.1.0
  1283. 11.26 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1284. 11.26 s [haskell-language-server] component haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  1285. 11.26 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1286. 11.26 s [haskell-language-server] include base-4.18.3.0
  1287. 11.26 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1288. 11.26 s [haskell-language-server] include foldl-1.4.18-Bjs3RPGa3QC5Zp1aPynHUe
  1289. 11.26 s [haskell-language-server] include ghc-9.6.7
  1290. 11.26 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1291. 11.26 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  1292. 11.26 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1293. 11.26 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1294. 11.26 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1295. 11.26 s [haskell-language-server] include mtl-2.3.1
  1296. 11.26 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  1297. 11.26 s [haskell-language-server] include text-2.0.2
  1298. 11.26 s [haskell-language-server] include transformers-0.6.1.0
  1299. 11.26 s [haskell-language-server] include unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
  1300. 11.26 s [haskell-language-server] component haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  1301. 11.26 s [haskell-language-server] include base-4.18.3.0
  1302. 11.26 s [haskell-language-server] include containers-0.6.7
  1303. 11.26 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  1304. 11.26 s [haskell-language-server] include ghc-9.6.7
  1305. 11.26 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1306. 11.26 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1307. 11.26 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1308. 11.26 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1309. 11.26 s [haskell-language-server] include text-2.0.2
  1310. 11.26 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1311. 11.26 s [haskell-language-server] include transformers-0.6.1.0
  1312. 11.26 s [haskell-language-server] component haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  1313. 11.26 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1314. 11.26 s [haskell-language-server] include base-4.18.3.0
  1315. 11.26 s [haskell-language-server] include containers-0.6.7
  1316. 11.26 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1317. 11.26 s [haskell-language-server] include fuzzy-0.1.1.0-LlERYC6Fg0O5zdG1C09qam
  1318. 11.26 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1319. 11.26 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1320. 11.26 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1321. 11.26 s [haskell-language-server] include lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6
  1322. 11.26 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1323. 11.26 s [haskell-language-server] include text-2.0.2
  1324. 11.26 s [haskell-language-server] include transformers-0.6.1.0
  1325. 11.26 s [haskell-language-server] component haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  1326. 11.26 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1327. 11.26 s [haskell-language-server] include base-4.18.3.0
  1328. 11.26 s [haskell-language-server] include containers-0.6.7
  1329. 11.26 s [haskell-language-server] include deepseq-1.4.8.1
  1330. 11.26 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1331. 11.26 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1332. 11.26 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1333. 11.26 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1334. 11.26 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1335. 11.26 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  1336. 11.26 s [haskell-language-server] include text-2.0.2
  1337. 11.26 s [haskell-language-server] include transformers-0.6.1.0
  1338. 11.26 s [haskell-language-server] component haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  1339. 11.26 s [haskell-language-server] include base-4.18.3.0
  1340. 11.26 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1341. 11.26 s [haskell-language-server] include filepath-1.4.301.0
  1342. 11.26 s [haskell-language-server] include ghc-boot-th-9.6.7
  1343. 11.26 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1344. 11.26 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1345. 11.26 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1346. 11.26 s [haskell-language-server] include mtl-2.3.1
  1347. 11.26 s [haskell-language-server] include ormolu-0.7.4.0-LIXgtWG5aD28NbkYgiUJ8V
  1348. 11.26 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  1349. 11.26 s [haskell-language-server] include text-2.0.2
  1350. 11.26 s [haskell-language-server] include transformers-0.6.1.0
  1351. 11.26 s [haskell-language-server] component haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  1352. 11.26 s [haskell-language-server] include array-0.5.8.0
  1353. 11.26 s [haskell-language-server] include base-4.18.3.0
  1354. 11.26 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1355. 11.26 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1356. 11.26 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1357. 11.26 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1358. 11.26 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1359. 11.26 s [haskell-language-server] include mtl-2.3.1
  1360. 11.26 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  1361. 11.26 s [haskell-language-server] include text-2.0.2
  1362. 11.26 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1363. 11.26 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1364. 11.26 s [haskell-language-server] component haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  1365. 11.26 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1366. 11.26 s [haskell-language-server] include base-4.18.3.0
  1367. 11.26 s [haskell-language-server] include containers-0.6.7
  1368. 11.26 s [haskell-language-server] include filepath-1.4.301.0
  1369. 11.26 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1370. 11.26 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1371. 11.26 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1372. 11.26 s [haskell-language-server] include text-2.0.2
  1373. 11.26 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1374. 11.26 s [haskell-language-server] include transformers-0.6.1.0
  1375. 11.26 s [haskell-language-server] component haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  1376. 11.26 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1377. 11.26 s [haskell-language-server] include apply-refact-0.15.0.0-4MjkBELToDe5NAkQSrxtCU
  1378. 11.26 s [haskell-language-server] include base-4.18.3.0
  1379. 11.26 s [haskell-language-server] include bytestring-0.11.5.4
  1380. 11.26 s [haskell-language-server] include containers-0.6.7
  1381. 11.26 s [haskell-language-server] include deepseq-1.4.8.1
  1382. 11.26 s [haskell-language-server] include filepath-1.4.301.0
  1383. 11.26 s [haskell-language-server] include ghc-lib-parser-9.8.5.20250214-2sNjHbGivPe3WF6GmRwnfJ
  1384. 11.26 s [haskell-language-server] include ghc-lib-parser-ex-9.8.0.2-6MMs82JSbM38IX9LmoVjK4
  1385. 11.26 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1386. 11.26 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  1387. 11.26 s [haskell-language-server] include hlint-3.8-41jUuJncsTy84zuKEBa9b
  1388. 11.26 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1389. 11.26 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1390. 11.26 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1391. 11.26 s [haskell-language-server] include mtl-2.3.1
  1392. 11.26 s [haskell-language-server] include refact-0.3.0.2-8O04sJZgp6Q4KcGxjYVPmG
  1393. 11.26 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  1394. 11.26 s [haskell-language-server] include stm-2.5.1.0
  1395. 11.26 s [haskell-language-server] include temporary-1.3-HdHuOgtZUl4D7UgDABDcym
  1396. 11.26 s [haskell-language-server] include text-2.0.2
  1397. 11.26 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1398. 11.26 s [haskell-language-server] include transformers-0.6.1.0
  1399. 11.26 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1400. 11.26 s [haskell-language-server] component haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  1401. 11.26 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1402. 11.26 s [haskell-language-server] include base-4.18.3.0
  1403. 11.26 s [haskell-language-server] include containers-0.6.7
  1404. 11.26 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1405. 11.26 s [haskell-language-server] include ghc-9.6.7
  1406. 11.26 s [haskell-language-server] include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  1407. 11.26 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1408. 11.26 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  1409. 11.26 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1410. 11.26 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1411. 11.26 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1412. 11.26 s [haskell-language-server] include mtl-2.3.1
  1413. 11.26 s [haskell-language-server] include text-2.0.2
  1414. 11.26 s [haskell-language-server] include transformers-0.6.1.0
  1415. 11.26 s [haskell-language-server] component haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  1416. 11.26 s [haskell-language-server] include base-4.18.3.0
  1417. 11.26 s [haskell-language-server] include filepath-1.4.301.0
  1418. 11.26 s [haskell-language-server] include fourmolu-0.15.0.0-EEltZEsw4M5ydl0dR88pq
  1419. 11.26 s [haskell-language-server] include ghc-boot-th-9.6.7
  1420. 11.27 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1421. 11.27 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1422. 11.27 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1423. 11.27 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1424. 11.27 s [haskell-language-server] include mtl-2.3.1
  1425. 11.27 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  1426. 11.27 s [haskell-language-server] include text-2.0.2
  1427. 11.27 s [haskell-language-server] include transformers-0.6.1.0
  1428. 11.27 s [haskell-language-server] include yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy
  1429. 11.27 s [haskell-language-server] component haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  1430. 11.27 s [haskell-language-server] include base-4.18.3.0
  1431. 11.27 s [haskell-language-server] include floskell-0.11.1-F2B6NOVmKxJBuRX1YeIXI3
  1432. 11.27 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1433. 11.27 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1434. 11.27 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1435. 11.27 s [haskell-language-server] include mtl-2.3.1
  1436. 11.27 s [haskell-language-server] include text-2.0.2
  1437. 11.27 s [haskell-language-server] component haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  1438. 11.27 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1439. 11.27 s [haskell-language-server] include base-4.18.3.0
  1440. 11.27 s [haskell-language-server] include containers-0.6.7
  1441. 11.27 s [haskell-language-server] include ghc-9.6.7
  1442. 11.27 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1443. 11.27 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1444. 11.27 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1445. 11.27 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1446. 11.27 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1447. 11.27 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  1448. 11.27 s [haskell-language-server] include text-2.0.2
  1449. 11.27 s [haskell-language-server] include transformers-0.6.1.0
  1450. 11.27 s [haskell-language-server] component haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  1451. 11.27 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1452. 11.27 s [haskell-language-server] include base-4.18.3.0
  1453. 11.27 s [haskell-language-server] include containers-0.6.7
  1454. 11.27 s [haskell-language-server] include deepseq-1.4.8.1
  1455. 11.27 s [haskell-language-server] include ghc-9.6.7
  1456. 11.27 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1457. 11.27 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1458. 11.27 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1459. 11.27 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1460. 11.27 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1461. 11.27 s [haskell-language-server] include mtl-2.3.1
  1462. 11.27 s [haskell-language-server] include text-2.0.2
  1463. 11.27 s [haskell-language-server] include transformers-0.6.1.0
  1464. 11.27 s [haskell-language-server] component haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  1465. 11.27 s [haskell-language-server] include base-4.18.3.0
  1466. 11.27 s [haskell-language-server] include containers-0.6.7
  1467. 11.27 s [haskell-language-server] include deepseq-1.4.8.1
  1468. 11.27 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1469. 11.27 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1470. 11.27 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  1471. 11.27 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1472. 11.27 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1473. 11.27 s [haskell-language-server] include text-2.0.2
  1474. 11.27 s [haskell-language-server] component haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  1475. 11.27 s [haskell-language-server] include Diff-1.0.2-dzGetap2ECL5JRsgOkhmm
  1476. 11.27 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1477. 11.27 s [haskell-language-server] include base-4.18.3.0
  1478. 11.27 s [haskell-language-server] include bytestring-0.11.5.4
  1479. 11.27 s [haskell-language-server] include containers-0.6.7
  1480. 11.27 s [haskell-language-server] include deepseq-1.4.8.1
  1481. 11.27 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  1482. 11.27 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1483. 11.27 s [haskell-language-server] include filepath-1.4.301.0
  1484. 11.27 s [haskell-language-server] include ghc-9.6.7
  1485. 11.27 s [haskell-language-server] include ghc-boot-th-9.6.7
  1486. 11.27 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1487. 11.27 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1488. 11.27 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1489. 11.27 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1490. 11.27 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1491. 11.27 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1492. 11.27 s [haskell-language-server] include megaparsec-9.7.0-9FWtFuoAKCoJPEfZ8OP0ob
  1493. 11.27 s [haskell-language-server] include mtl-2.3.1
  1494. 11.27 s [haskell-language-server] include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  1495. 11.27 s [haskell-language-server] include text-2.0.2
  1496. 11.27 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1497. 11.27 s [haskell-language-server] include transformers-0.6.1.0
  1498. 11.27 s [haskell-language-server] include unliftio-0.2.25.1-5MZwHIZimta75d0AbqTI9h
  1499. 11.27 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1500. 11.27 s [haskell-language-server] component haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  1501. 11.27 s [haskell-language-server] include base-4.18.3.0
  1502. 11.27 s [haskell-language-server] include containers-0.6.7
  1503. 11.27 s [haskell-language-server] include deepseq-1.4.8.1
  1504. 11.27 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1505. 11.27 s [haskell-language-server] include ghc-9.6.7
  1506. 11.27 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1507. 11.27 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  1508. 11.27 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1509. 11.27 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1510. 11.27 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1511. 11.27 s [haskell-language-server] include mtl-2.3.1
  1512. 11.27 s [haskell-language-server] include semigroupoids-6.0.1-54VzK0HQ3Xs4SWz0qFeA7J
  1513. 11.27 s [haskell-language-server] include transformers-0.6.1.0
  1514. 11.27 s [haskell-language-server] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1515. 11.27 s [haskell-language-server] component haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  1516. 11.27 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1517. 11.27 s [haskell-language-server] include base-4.18.3.0
  1518. 11.27 s [haskell-language-server] include containers-0.6.7
  1519. 11.27 s [haskell-language-server] include deepseq-1.4.8.1
  1520. 11.27 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1521. 11.27 s [haskell-language-server] include ghc-9.6.7
  1522. 11.27 s [haskell-language-server] include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  1523. 11.27 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1524. 11.27 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1525. 11.27 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1526. 11.27 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1527. 11.27 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1528. 11.27 s [haskell-language-server] include mtl-2.3.1
  1529. 11.27 s [haskell-language-server] include text-2.0.2
  1530. 11.27 s [haskell-language-server] include transformers-0.6.1.0
  1531. 11.27 s [haskell-language-server] component haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  1532. 11.27 s [haskell-language-server] include base-4.18.3.0
  1533. 11.27 s [haskell-language-server] include containers-0.6.7
  1534. 11.27 s [haskell-language-server] include ghc-9.6.7
  1535. 11.27 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1536. 11.27 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1537. 11.27 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1538. 11.27 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1539. 11.27 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  1540. 11.27 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  1541. 11.27 s [haskell-language-server] include text-2.0.2
  1542. 11.27 s [haskell-language-server] include transformers-0.6.1.0
  1543. 11.27 s [haskell-language-server] component haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  1544. 11.27 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1545. 11.27 s [haskell-language-server] include base-4.18.3.0
  1546. 11.27 s [haskell-language-server] include containers-0.6.7
  1547. 11.27 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1548. 11.27 s [haskell-language-server] include ghc-9.6.7
  1549. 11.27 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1550. 11.27 s [haskell-language-server] include hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
  1551. 11.27 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1552. 11.27 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1553. 11.27 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1554. 11.27 s [haskell-language-server] include sqlite-simple-0.4.19.0-2fdDxNmUdI02n2D93fGkOA
  1555. 11.27 s [haskell-language-server] include text-2.0.2
  1556. 11.27 s [haskell-language-server] component haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  1557. 11.27 s [haskell-language-server] include Cabal-3.10.3.0-97VZ3uVCyHhIgysI2tHjj1
  1558. 11.27 s [haskell-language-server] include Cabal-syntax-3.10.3.0-IhRvyLmXl1UIaCkYCiWa3f
  1559. 11.27 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1560. 11.27 s [haskell-language-server] include base-4.18.3.0
  1561. 11.27 s [haskell-language-server] include bytestring-0.11.5.4
  1562. 11.27 s [haskell-language-server] include cabal-add-0.2-8fogMBtEehK7vh7o2bjwgw
  1563. 11.27 s [haskell-language-server] include containers-0.6.7
  1564. 11.27 s [haskell-language-server] include deepseq-1.4.8.1
  1565. 11.27 s [haskell-language-server] include directory-1.3.8.5
  1566. 11.27 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1567. 11.27 s [haskell-language-server] include filepath-1.4.301.0
  1568. 11.27 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1569. 11.27 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  1570. 11.27 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1571. 11.27 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1572. 11.27 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1573. 11.27 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1574. 11.27 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1575. 11.27 s [haskell-language-server] include mtl-2.3.1
  1576. 11.27 s [haskell-language-server] include pretty-1.1.3.6
  1577. 11.27 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  1578. 11.27 s [haskell-language-server] include text-2.0.2
  1579. 11.27 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1580. 11.27 s [haskell-language-server] include transformers-0.6.1.0
  1581. 11.27 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1582. 11.27 s [haskell-language-server] component haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  1583. 11.27 s [haskell-language-server] include base-4.18.3.0
  1584. 11.27 s [haskell-language-server] include directory-1.3.8.5
  1585. 11.27 s [haskell-language-server] include filepath-1.4.301.0
  1586. 11.27 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1587. 11.27 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1588. 11.27 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1589. 11.27 s [haskell-language-server] include mtl-2.3.1
  1590. 11.27 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  1591. 11.28 s [haskell-language-server] include text-2.0.2
  1592. 11.28 s [haskell-language-server] component haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  1593. 11.28 s [haskell-language-server] include base-4.18.3.0
  1594. 11.28 s [haskell-language-server] include directory-1.3.8.5
  1595. 11.28 s [haskell-language-server] include filepath-1.4.301.0
  1596. 11.28 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1597. 11.28 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1598. 11.28 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1599. 11.28 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1600. 11.28 s [haskell-language-server] include mtl-2.3.1
  1601. 11.28 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  1602. 11.28 s [haskell-language-server] include text-2.0.2
  1603. 11.28 s [haskell-language-server] component haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  1604. 11.28 s [haskell-language-server] include base-4.18.3.0
  1605. 11.28 s [haskell-language-server] include containers-0.6.7
  1606. 11.28 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1607. 11.28 s [haskell-language-server] include ghc-boot-th-9.6.7
  1608. 11.28 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1609. 11.28 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1610. 11.28 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1611. 11.28 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1612. 11.28 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1613. 11.28 s [haskell-language-server] include mtl-2.3.1
  1614. 11.28 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  1615. 11.28 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  1616. 11.28 s [haskell-language-server] include text-2.0.2
  1617. 11.28 s [haskell-language-server] component haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  1618. 11.28 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1619. 11.28 s [haskell-language-server] include async-2.2.5-FhKLzi3ZfBSDzHnPPPs0JV
  1620. 11.28 s [haskell-language-server] include base-4.18.3.0
  1621. 11.28 s [haskell-language-server] include binary-0.8.9.1
  1622. 11.28 s [haskell-language-server] include bytestring-0.11.5.4
  1623. 11.28 s [haskell-language-server] include deepseq-1.4.8.1
  1624. 11.28 s [haskell-language-server] include directory-1.3.8.5
  1625. 11.28 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1626. 11.28 s [haskell-language-server] include filepath-1.4.301.0
  1627. 11.28 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1628. 11.28 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  1629. 11.28 s [haskell-language-server] include hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
  1630. 11.28 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1631. 11.28 s [haskell-language-server] include lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
  1632. 11.28 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1633. 11.28 s [haskell-language-server] include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  1634. 11.28 s [haskell-language-server] include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  1635. 11.28 s [haskell-language-server] include process-1.6.19.0
  1636. 11.28 s [haskell-language-server] include row-types-1.0.1.2-GohFLjwnT9fE3Oyg9BLD2E
  1637. 11.28 s [haskell-language-server] include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  1638. 11.28 s [haskell-language-server] include shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
  1639. 11.28 s [haskell-language-server] include text-2.0.2
  1640. 11.28 s [haskell-language-server] component haskell-language-server-2.12.0.0-1eqeWxapPHfKHhYNK0JT0S-ghcide-bench
  1641. 11.28 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1642. 11.28 s [haskell-language-server] include base-4.18.3.0
  1643. 11.28 s [haskell-language-server] include bytestring-0.11.5.4
  1644. 11.28 s [haskell-language-server] include containers-0.6.7
  1645. 11.28 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  1646. 11.28 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1647. 11.28 s [haskell-language-server] include filepath-1.4.301.0
  1648. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  1649. 11.28 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1650. 11.28 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1651. 11.28 s [haskell-language-server] include hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
  1652. 11.28 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1653. 11.28 s [haskell-language-server] include lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
  1654. 11.28 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1655. 11.28 s [haskell-language-server] include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  1656. 11.28 s [haskell-language-server] include process-1.6.19.0
  1657. 11.28 s [haskell-language-server] include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  1658. 11.28 s [haskell-language-server] include shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
  1659. 11.28 s [haskell-language-server] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  1660. 11.28 s [haskell-language-server] include text-2.0.2
  1661. 11.28 s [haskell-language-server] component haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  1662. 11.28 s [haskell-language-server] include aeson-pretty-0.8.10-BgtEeo7358D7lyXwmTUOLk
  1663. 11.28 s [haskell-language-server] include base-4.18.3.0
  1664. 11.28 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  1665. 11.28 s [haskell-language-server] include directory-1.3.8.5
  1666. 11.28 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1667. 11.28 s [haskell-language-server] include filepath-1.4.301.0
  1668. 11.28 s [haskell-language-server] include ghc-9.6.7
  1669. 11.28 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1670. 11.28 s [haskell-language-server] include githash-0.1.7.0-5BWjRCNZB9NEtAb5878P8j
  1671. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  1672. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  1673. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  1674. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  1675. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  1676. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  1677. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  1678. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  1679. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  1680. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  1681. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  1682. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  1683. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  1684. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  1685. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  1686. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  1687. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  1688. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  1689. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  1690. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  1691. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  1692. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  1693. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  1694. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  1695. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  1696. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  1697. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  1698. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  1699. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  1700. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  1701. 11.28 s [haskell-language-server] include hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
  1702. 11.28 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1703. 11.28 s [haskell-language-server] include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  1704. 11.28 s [haskell-language-server] include optparse-simple-0.1.1.4-9HAULKOjTA6J0lHNdRD2x7
  1705. 11.28 s [haskell-language-server] include prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
  1706. 11.28 s [haskell-language-server] include process-1.6.19.0
  1707. 11.28 s [haskell-language-server] include text-2.0.2
  1708. 11.28 s [haskell-language-server] component haskell-language-server-2.12.0.0-ITpYpQVRS0qLya2XUJnu55-haskell-language-server
  1709. 11.28 s [haskell-language-server] include base-4.18.3.0
  1710. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  1711. 11.28 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1712. 11.28 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1713. 11.28 s [haskell-language-server] include prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
  1714. 11.28 s [haskell-language-server] include text-2.0.2
  1715. 11.28 s [haskell-language-server] component haskell-language-server-2.12.0.0-6OQdnWIBVJU7LMih85tfjb-haskell-language-server-wrapper
  1716. 11.28 s [haskell-language-server] include base-4.18.3.0
  1717. 11.28 s [haskell-language-server] include containers-0.6.7
  1718. 11.28 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  1719. 11.28 s [haskell-language-server] include directory-1.3.8.5
  1720. 11.28 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1721. 11.28 s [haskell-language-server] include filepath-1.4.301.0
  1722. 11.28 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1723. 11.28 s [haskell-language-server] include haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  1724. 11.28 s [haskell-language-server] include hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
  1725. 11.28 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1726. 11.32 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1727. 11.32 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1728. 11.32 s [haskell-language-server] include text-2.0.2
  1729. 11.32 s [haskell-language-server] include transformers-0.6.1.0
  1730. 11.32 s [haskell-language-server] include unix-2.8.6.0
  1731. 11.32 s [haskell-language-server] include unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
  1732. 11.32 s [haskell-language-server] Linked component graph:
  1733. 11.32 s [haskell-language-server] unit haskell-language-server-2.12.0.0-4pY5yY1pY4d8Hs1Q2a6ukB-plugin-tutorial
  1734. 11.32 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1735. 11.32 s [haskell-language-server] include base-4.18.3.0
  1736. 11.32 s [haskell-language-server] include containers-0.6.7
  1737. 11.32 s [haskell-language-server] include ghc-9.6.7
  1738. 11.32 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1739. 11.32 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1740. 11.32 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1741. 11.32 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1742. 11.32 s [haskell-language-server] include markdown-unlit-0.6.0-5809pVajWVb2gBk7RWYi4C
  1743. 11.32 s [haskell-language-server] include text-2.0.2
  1744. 11.32 s [haskell-language-server] include transformers-0.6.1.0
  1745. 11.32 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1746. 11.32 s [haskell-language-server] unit haskell-language-server-2.12.0.0-JHhSHT2pml8BalYIyFTgc7-ghcide-test-preprocessor
  1747. 11.32 s [haskell-language-server] include base-4.18.3.0
  1748. 11.32 s [haskell-language-server] unit haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  1749. 11.32 s [haskell-language-server] include base-4.18.3.0
  1750. 11.32 s [haskell-language-server] include directory-1.3.8.5
  1751. 11.32 s [haskell-language-server] include filepath-1.4.301.0
  1752. 11.32 s [haskell-language-server] include ghc-boot-th-9.6.7
  1753. 11.32 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1754. 11.32 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1755. 11.32 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1756. 11.32 s [haskell-language-server] include mtl-2.3.1
  1757. 11.32 s [haskell-language-server] include stylish-haskell-0.14.6.0-LLvgSofQOCY3hHahYzFIC6
  1758. 11.32 s [haskell-language-server] include text-2.0.2
  1759. 11.32 s [haskell-language-server] Ide.Plugin.StylishHaskell=haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin:Ide.Plugin.StylishHaskell
  1760. 11.32 s [haskell-language-server] unit haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  1761. 11.32 s [haskell-language-server] include base-4.18.3.0
  1762. 11.32 s [haskell-language-server] include deepseq-1.4.8.1
  1763. 11.32 s [haskell-language-server] include directory-1.3.8.5
  1764. 11.32 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1765. 11.32 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  1766. 11.32 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1767. 11.32 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1768. 11.32 s [haskell-language-server] include stan-0.2.1.0-B6pDZR8PjMBItDLFTHk8I9
  1769. 11.32 s [haskell-language-server] include text-2.0.2
  1770. 11.32 s [haskell-language-server] include trial-0.0.0.0-4bVaCFWxanU7Vl3nRX6Yi0
  1771. 11.32 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1772. 11.32 s [haskell-language-server] Ide.Plugin.Stan=haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin:Ide.Plugin.Stan
  1773. 11.32 s [haskell-language-server] unit haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  1774. 11.32 s [haskell-language-server] include base-4.18.3.0
  1775. 11.32 s [haskell-language-server] include containers-0.6.7
  1776. 11.32 s [haskell-language-server] include ghc-9.6.7
  1777. 11.32 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1778. 11.32 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1779. 11.32 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1780. 11.32 s [haskell-language-server] include text-2.0.2
  1781. 11.32 s [haskell-language-server] include transformers-0.6.1.0
  1782. 11.32 s [haskell-language-server] Ide.Plugin.SignatureHelp=haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin:Ide.Plugin.SignatureHelp
  1783. 11.32 s [haskell-language-server] unit haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  1784. 11.32 s [haskell-language-server] include array-0.5.8.0
  1785. 11.32 s [haskell-language-server] include base-4.18.3.0
  1786. 11.32 s [haskell-language-server] include bytestring-0.11.5.4
  1787. 11.32 s [haskell-language-server] include containers-0.6.7
  1788. 11.32 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  1789. 11.32 s [haskell-language-server] include deepseq-1.4.8.1
  1790. 11.32 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  1791. 11.32 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1792. 11.32 s [haskell-language-server] include ghc-9.6.7
  1793. 11.32 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1794. 11.32 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1795. 11.32 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1796. 11.32 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1797. 11.32 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1798. 11.32 s [haskell-language-server] include mtl-2.3.1
  1799. 11.32 s [haskell-language-server] include stm-2.5.1.0
  1800. 11.32 s [haskell-language-server] include stm-containers-1.2.1.1-JDBpT36aDZ4CUdJ1Aus6oe
  1801. 11.32 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  1802. 11.32 s [haskell-language-server] include template-haskell-2.20.0.0
  1803. 11.32 s [haskell-language-server] include text-2.0.2
  1804. 11.32 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1805. 11.32 s [haskell-language-server] include transformers-0.6.1.0
  1806. 11.32 s [haskell-language-server] Ide.Plugin.SemanticTokens=haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin:Ide.Plugin.SemanticTokens,Ide.Plugin.SemanticTokens.Mappings=haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin:Ide.Plugin.SemanticTokens.Mappings,Ide.Plugin.SemanticTokens.Types=haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin:Ide.Plugin.SemanticTokens.Types
  1807. 11.32 s [haskell-language-server] unit haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  1808. 11.32 s [haskell-language-server] include base-4.18.3.0
  1809. 11.32 s [haskell-language-server] include bytestring-0.11.5.4
  1810. 11.32 s [haskell-language-server] include containers-0.6.7
  1811. 11.32 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  1812. 11.32 s [haskell-language-server] include deepseq-1.4.8.1
  1813. 11.32 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  1814. 11.32 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1815. 11.32 s [haskell-language-server] include ghc-9.6.7
  1816. 11.32 s [haskell-language-server] include ghc-boot-9.6.7
  1817. 11.32 s [haskell-language-server] include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  1818. 11.32 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1819. 11.32 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1820. 11.32 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1821. 11.32 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1822. 11.32 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1823. 11.32 s [haskell-language-server] include mtl-2.3.1
  1824. 11.32 s [haskell-language-server] include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  1825. 11.32 s [haskell-language-server] include regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM
  1826. 11.32 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  1827. 11.32 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  1828. 11.32 s [haskell-language-server] include text-2.0.2
  1829. 11.32 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1830. 11.32 s [haskell-language-server] include time-1.12.2
  1831. 11.32 s [haskell-language-server] include transformers-0.6.1.0
  1832. 11.32 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1833. 11.32 s [haskell-language-server] Development.IDE.GHC.Compat.ExactPrint=haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin:Development.IDE.GHC.Compat.ExactPrint,Development.IDE.GHC.Dump=haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin:Development.IDE.GHC.Dump,Development.IDE.GHC.ExactPrint=haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin:Development.IDE.GHC.ExactPrint,Development.IDE.Plugin.CodeAction=haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin:Development.IDE.Plugin.CodeAction,Development.IDE.Plugin.CodeAction.Util=haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin:Development.IDE.Plugin.CodeAction.Util
  1834. 11.32 s [haskell-language-server] unit haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  1835. 11.32 s [haskell-language-server] include base-4.18.3.0
  1836. 11.32 s [haskell-language-server] include containers-0.6.7
  1837. 11.32 s [haskell-language-server] include ghc-9.6.7
  1838. 11.32 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1839. 11.32 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  1840. 11.32 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  1841. 11.32 s [haskell-language-server] include hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
  1842. 11.32 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1843. 11.32 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1844. 11.32 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1845. 11.32 s [haskell-language-server] include mod-0.2.1.0-AEqKlJqNyYNGsAQxMMfOED
  1846. 11.32 s [haskell-language-server] include mtl-2.3.1
  1847. 11.32 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  1848. 11.32 s [haskell-language-server] include text-2.0.2
  1849. 11.32 s [haskell-language-server] include transformers-0.6.1.0
  1850. 11.32 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1851. 11.32 s [haskell-language-server] Ide.Plugin.Rename=haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin:Ide.Plugin.Rename
  1852. 11.32 s [haskell-language-server] unit haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  1853. 11.32 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1854. 11.32 s [haskell-language-server] include base-4.18.3.0
  1855. 11.32 s [haskell-language-server] include bytestring-0.11.5.4
  1856. 11.32 s [haskell-language-server] include containers-0.6.7
  1857. 11.32 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1858. 11.32 s [haskell-language-server] include ghc-9.6.7
  1859. 11.32 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1860. 11.32 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  1861. 11.32 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  1862. 11.32 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1863. 11.32 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1864. 11.32 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1865. 11.32 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1866. 11.32 s [haskell-language-server] include mtl-2.3.1
  1867. 11.32 s [haskell-language-server] include retrie-1.2.3-4syE2wloz6UAMXGW9FTmsG
  1868. 11.32 s [haskell-language-server] include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  1869. 11.32 s [haskell-language-server] include stm-2.5.1.0
  1870. 11.32 s [haskell-language-server] include text-2.0.2
  1871. 11.32 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1872. 11.32 s [haskell-language-server] include transformers-0.6.1.0
  1873. 11.32 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1874. 11.32 s [haskell-language-server] Ide.Plugin.Retrie=haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin:Ide.Plugin.Retrie
  1875. 11.32 s [haskell-language-server] unit haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  1876. 11.32 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1877. 11.32 s [haskell-language-server] include base-4.18.3.0
  1878. 11.32 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1879. 11.32 s [haskell-language-server] include foldl-1.4.18-Bjs3RPGa3QC5Zp1aPynHUe
  1880. 11.32 s [haskell-language-server] include ghc-9.6.7
  1881. 11.32 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1882. 11.32 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  1883. 11.32 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1884. 11.32 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1885. 11.32 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1886. 11.32 s [haskell-language-server] include mtl-2.3.1
  1887. 11.32 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  1888. 11.32 s [haskell-language-server] include text-2.0.2
  1889. 11.32 s [haskell-language-server] include transformers-0.6.1.0
  1890. 11.32 s [haskell-language-server] include unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
  1891. 11.32 s [haskell-language-server] Ide.Plugin.Splice=haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin:Ide.Plugin.Splice,Ide.Plugin.Splice.Types=haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin:Ide.Plugin.Splice.Types
  1892. 11.32 s [haskell-language-server] unit haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  1893. 11.32 s [haskell-language-server] include base-4.18.3.0
  1894. 11.32 s [haskell-language-server] include containers-0.6.7
  1895. 11.32 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  1896. 11.32 s [haskell-language-server] include ghc-9.6.7
  1897. 11.32 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1898. 11.32 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1899. 11.32 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1900. 11.32 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1901. 11.32 s [haskell-language-server] include text-2.0.2
  1902. 11.32 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1903. 11.32 s [haskell-language-server] include transformers-0.6.1.0
  1904. 11.32 s [haskell-language-server] Ide.Plugin.QualifyImportedNames=haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin:Ide.Plugin.QualifyImportedNames
  1905. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  1906. 11.33 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1907. 11.33 s [haskell-language-server] include base-4.18.3.0
  1908. 11.33 s [haskell-language-server] include containers-0.6.7
  1909. 11.33 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1910. 11.33 s [haskell-language-server] include fuzzy-0.1.1.0-LlERYC6Fg0O5zdG1C09qam
  1911. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1912. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1913. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1914. 11.33 s [haskell-language-server] include lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6
  1915. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1916. 11.33 s [haskell-language-server] include text-2.0.2
  1917. 11.33 s [haskell-language-server] include transformers-0.6.1.0
  1918. 11.33 s [haskell-language-server] Ide.Plugin.Pragmas=haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin:Ide.Plugin.Pragmas
  1919. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  1920. 11.33 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1921. 11.33 s [haskell-language-server] include base-4.18.3.0
  1922. 11.33 s [haskell-language-server] include containers-0.6.7
  1923. 11.33 s [haskell-language-server] include deepseq-1.4.8.1
  1924. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1925. 11.33 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1926. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1927. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1928. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1929. 11.33 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  1930. 11.33 s [haskell-language-server] include text-2.0.2
  1931. 11.33 s [haskell-language-server] include transformers-0.6.1.0
  1932. 11.33 s [haskell-language-server] Ide.Plugin.OverloadedRecordDot=haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin:Ide.Plugin.OverloadedRecordDot
  1933. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  1934. 11.33 s [haskell-language-server] include base-4.18.3.0
  1935. 11.33 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  1936. 11.33 s [haskell-language-server] include filepath-1.4.301.0
  1937. 11.33 s [haskell-language-server] include ghc-boot-th-9.6.7
  1938. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1939. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1940. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1941. 11.33 s [haskell-language-server] include mtl-2.3.1
  1942. 11.33 s [haskell-language-server] include ormolu-0.7.4.0-LIXgtWG5aD28NbkYgiUJ8V
  1943. 11.33 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  1944. 11.33 s [haskell-language-server] include text-2.0.2
  1945. 11.33 s [haskell-language-server] include transformers-0.6.1.0
  1946. 11.33 s [haskell-language-server] Ide.Plugin.Ormolu=haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin:Ide.Plugin.Ormolu
  1947. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  1948. 11.33 s [haskell-language-server] include array-0.5.8.0
  1949. 11.33 s [haskell-language-server] include base-4.18.3.0
  1950. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1951. 11.33 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  1952. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1953. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1954. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1955. 11.33 s [haskell-language-server] include mtl-2.3.1
  1956. 11.33 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  1957. 11.33 s [haskell-language-server] include text-2.0.2
  1958. 11.33 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1959. 11.33 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1960. 11.33 s [haskell-language-server] Ide.Plugin.Notes=haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin:Ide.Plugin.Notes
  1961. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  1962. 11.33 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1963. 11.33 s [haskell-language-server] include base-4.18.3.0
  1964. 11.33 s [haskell-language-server] include containers-0.6.7
  1965. 11.33 s [haskell-language-server] include filepath-1.4.301.0
  1966. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1967. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1968. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  1969. 11.33 s [haskell-language-server] include text-2.0.2
  1970. 11.33 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1971. 11.33 s [haskell-language-server] include transformers-0.6.1.0
  1972. 11.33 s [haskell-language-server] Ide.Plugin.ModuleName=haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin:Ide.Plugin.ModuleName
  1973. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  1974. 11.33 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  1975. 11.33 s [haskell-language-server] include apply-refact-0.15.0.0-4MjkBELToDe5NAkQSrxtCU
  1976. 11.33 s [haskell-language-server] include base-4.18.3.0
  1977. 11.33 s [haskell-language-server] include bytestring-0.11.5.4
  1978. 11.33 s [haskell-language-server] include containers-0.6.7
  1979. 11.33 s [haskell-language-server] include deepseq-1.4.8.1
  1980. 11.33 s [haskell-language-server] include filepath-1.4.301.0
  1981. 11.33 s [haskell-language-server] include ghc-lib-parser-9.8.5.20250214-2sNjHbGivPe3WF6GmRwnfJ
  1982. 11.33 s [haskell-language-server] include ghc-lib-parser-ex-9.8.0.2-6MMs82JSbM38IX9LmoVjK4
  1983. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  1984. 11.33 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  1985. 11.33 s [haskell-language-server] include hlint-3.8-41jUuJncsTy84zuKEBa9b
  1986. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  1987. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  1988. 11.33 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  1989. 11.33 s [haskell-language-server] include mtl-2.3.1
  1990. 11.33 s [haskell-language-server] include refact-0.3.0.2-8O04sJZgp6Q4KcGxjYVPmG
  1991. 11.33 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  1992. 11.33 s [haskell-language-server] include stm-2.5.1.0
  1993. 11.33 s [haskell-language-server] include temporary-1.3-HdHuOgtZUl4D7UgDABDcym
  1994. 11.33 s [haskell-language-server] include text-2.0.2
  1995. 11.33 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  1996. 11.33 s [haskell-language-server] include transformers-0.6.1.0
  1997. 11.33 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  1998. 11.33 s [haskell-language-server] Ide.Plugin.Hlint=haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin:Ide.Plugin.Hlint
  1999. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  2000. 11.33 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2001. 11.33 s [haskell-language-server] include base-4.18.3.0
  2002. 11.33 s [haskell-language-server] include containers-0.6.7
  2003. 11.33 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2004. 11.33 s [haskell-language-server] include ghc-9.6.7
  2005. 11.33 s [haskell-language-server] include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  2006. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2007. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  2008. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2009. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2010. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2011. 11.33 s [haskell-language-server] include mtl-2.3.1
  2012. 11.33 s [haskell-language-server] include text-2.0.2
  2013. 11.33 s [haskell-language-server] include transformers-0.6.1.0
  2014. 11.33 s [haskell-language-server] Ide.Plugin.GADT=haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin:Ide.Plugin.GADT
  2015. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  2016. 11.33 s [haskell-language-server] include base-4.18.3.0
  2017. 11.33 s [haskell-language-server] include filepath-1.4.301.0
  2018. 11.33 s [haskell-language-server] include fourmolu-0.15.0.0-EEltZEsw4M5ydl0dR88pq
  2019. 11.33 s [haskell-language-server] include ghc-boot-th-9.6.7
  2020. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2021. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2022. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2023. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2024. 11.33 s [haskell-language-server] include mtl-2.3.1
  2025. 11.33 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  2026. 11.33 s [haskell-language-server] include text-2.0.2
  2027. 11.33 s [haskell-language-server] include transformers-0.6.1.0
  2028. 11.33 s [haskell-language-server] include yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy
  2029. 11.33 s [haskell-language-server] Ide.Plugin.Fourmolu=haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin:Ide.Plugin.Fourmolu
  2030. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  2031. 11.33 s [haskell-language-server] include base-4.18.3.0
  2032. 11.33 s [haskell-language-server] include floskell-0.11.1-F2B6NOVmKxJBuRX1YeIXI3
  2033. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2034. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2035. 11.33 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2036. 11.33 s [haskell-language-server] include mtl-2.3.1
  2037. 11.33 s [haskell-language-server] include text-2.0.2
  2038. 11.33 s [haskell-language-server] Ide.Plugin.Floskell=haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin:Ide.Plugin.Floskell
  2039. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  2040. 11.33 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2041. 11.33 s [haskell-language-server] include base-4.18.3.0
  2042. 11.33 s [haskell-language-server] include containers-0.6.7
  2043. 11.33 s [haskell-language-server] include ghc-9.6.7
  2044. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2045. 11.33 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2046. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2047. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2048. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2049. 11.33 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  2050. 11.33 s [haskell-language-server] include text-2.0.2
  2051. 11.33 s [haskell-language-server] include transformers-0.6.1.0
  2052. 11.33 s [haskell-language-server] Ide.Plugin.ExplicitFields=haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin:Ide.Plugin.ExplicitFields
  2053. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  2054. 11.33 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2055. 11.33 s [haskell-language-server] include base-4.18.3.0
  2056. 11.33 s [haskell-language-server] include containers-0.6.7
  2057. 11.33 s [haskell-language-server] include deepseq-1.4.8.1
  2058. 11.33 s [haskell-language-server] include ghc-9.6.7
  2059. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2060. 11.33 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2061. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2062. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2063. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2064. 11.33 s [haskell-language-server] include mtl-2.3.1
  2065. 11.33 s [haskell-language-server] include text-2.0.2
  2066. 11.33 s [haskell-language-server] include transformers-0.6.1.0
  2067. 11.33 s [haskell-language-server] Ide.Plugin.ExplicitImports=haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin:Ide.Plugin.ExplicitImports
  2068. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  2069. 11.33 s [haskell-language-server] include base-4.18.3.0
  2070. 11.33 s [haskell-language-server] include containers-0.6.7
  2071. 11.33 s [haskell-language-server] include deepseq-1.4.8.1
  2072. 11.33 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2073. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2074. 11.33 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  2075. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2076. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2077. 11.33 s [haskell-language-server] include text-2.0.2
  2078. 11.33 s [haskell-language-server] Ide.Plugin.ExplicitFixity=haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin:Ide.Plugin.ExplicitFixity
  2079. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  2080. 11.33 s [haskell-language-server] include Diff-1.0.2-dzGetap2ECL5JRsgOkhmm
  2081. 11.33 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2082. 11.33 s [haskell-language-server] include base-4.18.3.0
  2083. 11.33 s [haskell-language-server] include bytestring-0.11.5.4
  2084. 11.33 s [haskell-language-server] include containers-0.6.7
  2085. 11.33 s [haskell-language-server] include deepseq-1.4.8.1
  2086. 11.33 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  2087. 11.33 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2088. 11.33 s [haskell-language-server] include filepath-1.4.301.0
  2089. 11.33 s [haskell-language-server] include ghc-9.6.7
  2090. 11.33 s [haskell-language-server] include ghc-boot-th-9.6.7
  2091. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2092. 11.33 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2093. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2094. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2095. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2096. 11.33 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2097. 11.33 s [haskell-language-server] include megaparsec-9.7.0-9FWtFuoAKCoJPEfZ8OP0ob
  2098. 11.33 s [haskell-language-server] include mtl-2.3.1
  2099. 11.33 s [haskell-language-server] include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  2100. 11.33 s [haskell-language-server] include text-2.0.2
  2101. 11.33 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  2102. 11.33 s [haskell-language-server] include transformers-0.6.1.0
  2103. 11.33 s [haskell-language-server] include unliftio-0.2.25.1-5MZwHIZimta75d0AbqTI9h
  2104. 11.33 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  2105. 11.33 s [haskell-language-server] Ide.Plugin.Eval=haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin:Ide.Plugin.Eval,Ide.Plugin.Eval.Types=haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin:Ide.Plugin.Eval.Types
  2106. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  2107. 11.33 s [haskell-language-server] include base-4.18.3.0
  2108. 11.33 s [haskell-language-server] include containers-0.6.7
  2109. 11.33 s [haskell-language-server] include deepseq-1.4.8.1
  2110. 11.33 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2111. 11.33 s [haskell-language-server] include ghc-9.6.7
  2112. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2113. 11.33 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  2114. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2115. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2116. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2117. 11.33 s [haskell-language-server] include mtl-2.3.1
  2118. 11.33 s [haskell-language-server] include semigroupoids-6.0.1-54VzK0HQ3Xs4SWz0qFeA7J
  2119. 11.33 s [haskell-language-server] include transformers-0.6.1.0
  2120. 11.33 s [haskell-language-server] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  2121. 11.33 s [haskell-language-server] Ide.Plugin.CodeRange=haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin:Ide.Plugin.CodeRange,Ide.Plugin.CodeRange.Rules=haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin:Ide.Plugin.CodeRange.Rules
  2122. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  2123. 11.33 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2124. 11.33 s [haskell-language-server] include base-4.18.3.0
  2125. 11.33 s [haskell-language-server] include containers-0.6.7
  2126. 11.33 s [haskell-language-server] include deepseq-1.4.8.1
  2127. 11.33 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2128. 11.33 s [haskell-language-server] include ghc-9.6.7
  2129. 11.33 s [haskell-language-server] include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  2130. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2131. 11.33 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2132. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2133. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2134. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2135. 11.33 s [haskell-language-server] include mtl-2.3.1
  2136. 11.33 s [haskell-language-server] include text-2.0.2
  2137. 11.33 s [haskell-language-server] include transformers-0.6.1.0
  2138. 11.33 s [haskell-language-server] Ide.Plugin.Class=haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin:Ide.Plugin.Class
  2139. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  2140. 11.33 s [haskell-language-server] include base-4.18.3.0
  2141. 11.33 s [haskell-language-server] include containers-0.6.7
  2142. 11.33 s [haskell-language-server] include ghc-9.6.7
  2143. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2144. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2145. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2146. 11.33 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2147. 11.33 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  2148. 11.33 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  2149. 11.33 s [haskell-language-server] include text-2.0.2
  2150. 11.33 s [haskell-language-server] include transformers-0.6.1.0
  2151. 11.33 s [haskell-language-server] Ide.Plugin.ChangeTypeSignature=haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin:Ide.Plugin.ChangeTypeSignature
  2152. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  2153. 11.33 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2154. 11.33 s [haskell-language-server] include base-4.18.3.0
  2155. 11.33 s [haskell-language-server] include containers-0.6.7
  2156. 11.33 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2157. 11.33 s [haskell-language-server] include ghc-9.6.7
  2158. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2159. 11.33 s [haskell-language-server] include hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
  2160. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2161. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2162. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2163. 11.33 s [haskell-language-server] include sqlite-simple-0.4.19.0-2fdDxNmUdI02n2D93fGkOA
  2164. 11.33 s [haskell-language-server] include text-2.0.2
  2165. 11.33 s [haskell-language-server] Ide.Plugin.CallHierarchy=haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin:Ide.Plugin.CallHierarchy
  2166. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  2167. 11.33 s [haskell-language-server] include Cabal-3.10.3.0-97VZ3uVCyHhIgysI2tHjj1
  2168. 11.33 s [haskell-language-server] include Cabal-syntax-3.10.3.0-IhRvyLmXl1UIaCkYCiWa3f
  2169. 11.33 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2170. 11.33 s [haskell-language-server] include base-4.18.3.0
  2171. 11.33 s [haskell-language-server] include bytestring-0.11.5.4
  2172. 11.33 s [haskell-language-server] include cabal-add-0.2-8fogMBtEehK7vh7o2bjwgw
  2173. 11.33 s [haskell-language-server] include containers-0.6.7
  2174. 11.33 s [haskell-language-server] include deepseq-1.4.8.1
  2175. 11.33 s [haskell-language-server] include directory-1.3.8.5
  2176. 11.33 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2177. 11.33 s [haskell-language-server] include filepath-1.4.301.0
  2178. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2179. 11.33 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  2180. 11.33 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2181. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2182. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2183. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2184. 11.33 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2185. 11.33 s [haskell-language-server] include mtl-2.3.1
  2186. 11.33 s [haskell-language-server] include pretty-1.1.3.6
  2187. 11.33 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  2188. 11.33 s [haskell-language-server] include text-2.0.2
  2189. 11.33 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  2190. 11.33 s [haskell-language-server] include transformers-0.6.1.0
  2191. 11.33 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  2192. 11.33 s [haskell-language-server] Ide.Plugin.Cabal=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal,Ide.Plugin.Cabal.CabalAdd.CodeAction=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.CabalAdd.CodeAction,Ide.Plugin.Cabal.CabalAdd.Command=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.CabalAdd.Command,Ide.Plugin.Cabal.CabalAdd.Types=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.CabalAdd.Types,Ide.Plugin.Cabal.Completion.CabalFields=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.CabalFields,Ide.Plugin.Cabal.Completion.Completer.FilePath=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.FilePath,Ide.Plugin.Cabal.Completion.Completer.Module=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Module,Ide.Plugin.Cabal.Completion.Completer.Paths=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Paths,Ide.Plugin.Cabal.Completion.Completer.Simple=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Simple,Ide.Plugin.Cabal.Completion.Completer.Snippet=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Snippet,Ide.Plugin.Cabal.Completion.Completer.Types=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Types,Ide.Plugin.Cabal.Completion.Completions=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completions,Ide.Plugin.Cabal.Completion.Data=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Data,Ide.Plugin.Cabal.Completion.Types=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Types,Ide.Plugin.Cabal.Definition=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Definition,Ide.Plugin.Cabal.Diagnostics=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Diagnostics,Ide.Plugin.Cabal.FieldSuggest=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.FieldSuggest,Ide.Plugin.Cabal.Files=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Files,Ide.Plugin.Cabal.LicenseSuggest=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.LicenseSuggest,Ide.Plugin.Cabal.OfInterest=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.OfInterest,Ide.Plugin.Cabal.Orphans=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Orphans,Ide.Plugin.Cabal.Outline=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Outline,Ide.Plugin.Cabal.Parse=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Parse,Ide.Plugin.Cabal.Rules=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Rules
  2193. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  2194. 11.33 s [haskell-language-server] include base-4.18.3.0
  2195. 11.33 s [haskell-language-server] include directory-1.3.8.5
  2196. 11.33 s [haskell-language-server] include filepath-1.4.301.0
  2197. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2198. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2199. 11.33 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2200. 11.33 s [haskell-language-server] include mtl-2.3.1
  2201. 11.33 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  2202. 11.33 s [haskell-language-server] include text-2.0.2
  2203. 11.33 s [haskell-language-server] Ide.Plugin.CabalGild=haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin:Ide.Plugin.CabalGild
  2204. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  2205. 11.33 s [haskell-language-server] include base-4.18.3.0
  2206. 11.33 s [haskell-language-server] include directory-1.3.8.5
  2207. 11.33 s [haskell-language-server] include filepath-1.4.301.0
  2208. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2209. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2210. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2211. 11.33 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2212. 11.33 s [haskell-language-server] include mtl-2.3.1
  2213. 11.33 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  2214. 11.33 s [haskell-language-server] include text-2.0.2
  2215. 11.33 s [haskell-language-server] Ide.Plugin.CabalFmt=haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin:Ide.Plugin.CabalFmt
  2216. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  2217. 11.33 s [haskell-language-server] include base-4.18.3.0
  2218. 11.33 s [haskell-language-server] include containers-0.6.7
  2219. 11.33 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2220. 11.33 s [haskell-language-server] include ghc-boot-th-9.6.7
  2221. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2222. 11.33 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2223. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2224. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2225. 11.33 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2226. 11.33 s [haskell-language-server] include mtl-2.3.1
  2227. 11.33 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  2228. 11.33 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  2229. 11.33 s [haskell-language-server] include text-2.0.2
  2230. 11.33 s [haskell-language-server] Ide.Plugin.AlternateNumberFormat=haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin:Ide.Plugin.AlternateNumberFormat,Ide.Plugin.Conversion=haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin:Ide.Plugin.Conversion
  2231. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  2232. 11.33 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2233. 11.33 s [haskell-language-server] include async-2.2.5-FhKLzi3ZfBSDzHnPPPs0JV
  2234. 11.33 s [haskell-language-server] include base-4.18.3.0
  2235. 11.33 s [haskell-language-server] include binary-0.8.9.1
  2236. 11.33 s [haskell-language-server] include bytestring-0.11.5.4
  2237. 11.33 s [haskell-language-server] include deepseq-1.4.8.1
  2238. 11.33 s [haskell-language-server] include directory-1.3.8.5
  2239. 11.33 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2240. 11.33 s [haskell-language-server] include filepath-1.4.301.0
  2241. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2242. 11.33 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  2243. 11.33 s [haskell-language-server] include hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
  2244. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2245. 11.33 s [haskell-language-server] include lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
  2246. 11.33 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2247. 11.33 s [haskell-language-server] include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  2248. 11.33 s [haskell-language-server] include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  2249. 11.33 s [haskell-language-server] include process-1.6.19.0
  2250. 11.33 s [haskell-language-server] include row-types-1.0.1.2-GohFLjwnT9fE3Oyg9BLD2E
  2251. 11.33 s [haskell-language-server] include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  2252. 11.33 s [haskell-language-server] include shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
  2253. 11.33 s [haskell-language-server] include text-2.0.2
  2254. 11.33 s [haskell-language-server] Experiments=haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib:Experiments,Experiments.Types=haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib:Experiments.Types
  2255. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-1eqeWxapPHfKHhYNK0JT0S-ghcide-bench
  2256. 11.33 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2257. 11.33 s [haskell-language-server] include base-4.18.3.0
  2258. 11.33 s [haskell-language-server] include bytestring-0.11.5.4
  2259. 11.33 s [haskell-language-server] include containers-0.6.7
  2260. 11.33 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  2261. 11.33 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2262. 11.33 s [haskell-language-server] include filepath-1.4.301.0
  2263. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  2264. 11.33 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2265. 11.33 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2266. 11.33 s [haskell-language-server] include hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
  2267. 11.33 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2268. 11.33 s [haskell-language-server] include lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
  2269. 11.33 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2270. 11.33 s [haskell-language-server] include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  2271. 11.33 s [haskell-language-server] include process-1.6.19.0
  2272. 11.33 s [haskell-language-server] include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  2273. 11.33 s [haskell-language-server] include shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
  2274. 11.33 s [haskell-language-server] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  2275. 11.33 s [haskell-language-server] include text-2.0.2
  2276. 11.33 s [haskell-language-server] unit haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  2277. 11.33 s [haskell-language-server] include aeson-pretty-0.8.10-BgtEeo7358D7lyXwmTUOLk
  2278. 11.33 s [haskell-language-server] include base-4.18.3.0
  2279. 11.33 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  2280. 11.33 s [haskell-language-server] include directory-1.3.8.5
  2281. 11.33 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2282. 11.33 s [haskell-language-server] include filepath-1.4.301.0
  2283. 11.33 s [haskell-language-server] include ghc-9.6.7
  2284. 11.33 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2285. 11.33 s [haskell-language-server] include githash-0.1.7.0-5BWjRCNZB9NEtAb5878P8j
  2286. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  2287. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  2288. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  2289. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  2290. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  2291. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  2292. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  2293. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  2294. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  2295. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  2296. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  2297. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  2298. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  2299. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  2300. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  2301. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  2302. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  2303. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  2304. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  2305. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  2306. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  2307. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  2308. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  2309. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  2310. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  2311. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  2312. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  2313. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  2314. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  2315. 11.33 s [haskell-language-server] include haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  2316. 11.33 s [haskell-language-server] include hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
  2317. 11.34 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2318. 11.34 s [haskell-language-server] include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  2319. 11.34 s [haskell-language-server] include optparse-simple-0.1.1.4-9HAULKOjTA6J0lHNdRD2x7
  2320. 11.34 s [haskell-language-server] include prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
  2321. 11.34 s [haskell-language-server] include process-1.6.19.0
  2322. 11.34 s [haskell-language-server] include text-2.0.2
  2323. 11.34 s [haskell-language-server] HlsPlugins=haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF:HlsPlugins,Ide.Arguments=haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF:Ide.Arguments,Ide.Main=haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF:Ide.Main,Ide.Version=haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF:Ide.Version
  2324. 11.34 s [haskell-language-server] unit haskell-language-server-2.12.0.0-ITpYpQVRS0qLya2XUJnu55-haskell-language-server
  2325. 11.34 s [haskell-language-server] include base-4.18.3.0
  2326. 11.34 s [haskell-language-server] include haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  2327. 11.34 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2328. 11.34 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2329. 11.34 s [haskell-language-server] include prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
  2330. 11.34 s [haskell-language-server] include text-2.0.2
  2331. 11.34 s [haskell-language-server] unit haskell-language-server-2.12.0.0-6OQdnWIBVJU7LMih85tfjb-haskell-language-server-wrapper
  2332. 11.34 s [haskell-language-server] include base-4.18.3.0
  2333. 11.34 s [haskell-language-server] include containers-0.6.7
  2334. 11.34 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  2335. 11.34 s [haskell-language-server] include directory-1.3.8.5
  2336. 11.34 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2337. 11.34 s [haskell-language-server] include filepath-1.4.301.0
  2338. 11.34 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2339. 11.34 s [haskell-language-server] include haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  2340. 11.34 s [haskell-language-server] include hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
  2341. 11.34 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2342. 11.34 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2343. 11.34 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2344. 11.34 s [haskell-language-server] include text-2.0.2
  2345. 11.34 s [haskell-language-server] include transformers-0.6.1.0
  2346. 11.34 s [haskell-language-server] include unix-2.8.6.0
  2347. 11.34 s [haskell-language-server] include unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
  2348. 11.34 s [haskell-language-server] Ready component graph:
  2349. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  2350. 11.34 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2351. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2352. 11.34 s [haskell-language-server] depends containers-0.6.7
  2353. 11.34 s [haskell-language-server] depends deepseq-1.4.8.1
  2354. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2355. 11.34 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2356. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2357. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2358. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2359. 11.34 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  2360. 11.34 s [haskell-language-server] depends text-2.0.2
  2361. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2362. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  2363. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2364. 11.34 s [haskell-language-server] depends containers-0.6.7
  2365. 11.34 s [haskell-language-server] depends ghc-9.6.7
  2366. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2367. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2368. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2369. 11.34 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2370. 11.34 s [haskell-language-server] depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  2371. 11.34 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  2372. 11.34 s [haskell-language-server] depends text-2.0.2
  2373. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2374. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  2375. 11.34 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2376. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2377. 11.34 s [haskell-language-server] depends containers-0.6.7
  2378. 11.34 s [haskell-language-server] depends deepseq-1.4.8.1
  2379. 11.34 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2380. 11.34 s [haskell-language-server] depends ghc-9.6.7
  2381. 11.34 s [haskell-language-server] depends ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  2382. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2383. 11.34 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2384. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2385. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2386. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2387. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2388. 11.34 s [haskell-language-server] depends text-2.0.2
  2389. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2390. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  2391. 11.34 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2392. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2393. 11.34 s [haskell-language-server] depends containers-0.6.7
  2394. 11.34 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2395. 11.34 s [haskell-language-server] depends ghc-9.6.7
  2396. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2397. 11.34 s [haskell-language-server] depends hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
  2398. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2399. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2400. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2401. 11.34 s [haskell-language-server] depends sqlite-simple-0.4.19.0-2fdDxNmUdI02n2D93fGkOA
  2402. 11.34 s [haskell-language-server] depends text-2.0.2
  2403. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-JHhSHT2pml8BalYIyFTgc7-ghcide-test-preprocessor
  2404. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2405. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  2406. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2407. 11.34 s [haskell-language-server] depends containers-0.6.7
  2408. 11.34 s [haskell-language-server] depends deepseq-1.4.8.1
  2409. 11.34 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2410. 11.34 s [haskell-language-server] depends ghc-9.6.7
  2411. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2412. 11.34 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  2413. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2414. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2415. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2416. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2417. 11.34 s [haskell-language-server] depends semigroupoids-6.0.1-54VzK0HQ3Xs4SWz0qFeA7J
  2418. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2419. 11.34 s [haskell-language-server] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  2420. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  2421. 11.34 s [haskell-language-server] depends array-0.5.8.0
  2422. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2423. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2424. 11.34 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2425. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2426. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2427. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2428. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2429. 11.34 s [haskell-language-server] depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  2430. 11.34 s [haskell-language-server] depends text-2.0.2
  2431. 11.34 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  2432. 11.34 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  2433. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  2434. 11.34 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2435. 11.34 s [haskell-language-server] depends async-2.2.5-FhKLzi3ZfBSDzHnPPPs0JV
  2436. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2437. 11.34 s [haskell-language-server] depends binary-0.8.9.1
  2438. 11.34 s [haskell-language-server] depends bytestring-0.11.5.4
  2439. 11.34 s [haskell-language-server] depends deepseq-1.4.8.1
  2440. 11.34 s [haskell-language-server] depends directory-1.3.8.5
  2441. 11.34 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2442. 11.34 s [haskell-language-server] depends filepath-1.4.301.0
  2443. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2444. 11.34 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  2445. 11.34 s [haskell-language-server] depends hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
  2446. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2447. 11.34 s [haskell-language-server] depends lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
  2448. 11.34 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2449. 11.34 s [haskell-language-server] depends optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  2450. 11.34 s [haskell-language-server] depends parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  2451. 11.34 s [haskell-language-server] depends process-1.6.19.0
  2452. 11.34 s [haskell-language-server] depends row-types-1.0.1.2-GohFLjwnT9fE3Oyg9BLD2E
  2453. 11.34 s [haskell-language-server] depends safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  2454. 11.34 s [haskell-language-server] depends shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
  2455. 11.34 s [haskell-language-server] depends text-2.0.2
  2456. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  2457. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2458. 11.34 s [haskell-language-server] depends floskell-0.11.1-F2B6NOVmKxJBuRX1YeIXI3
  2459. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2460. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2461. 11.34 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2462. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2463. 11.34 s [haskell-language-server] depends text-2.0.2
  2464. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  2465. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2466. 11.34 s [haskell-language-server] depends directory-1.3.8.5
  2467. 11.34 s [haskell-language-server] depends filepath-1.4.301.0
  2468. 11.34 s [haskell-language-server] depends ghc-boot-th-9.6.7
  2469. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2470. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2471. 11.34 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2472. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2473. 11.34 s [haskell-language-server] depends stylish-haskell-0.14.6.0-LLvgSofQOCY3hHahYzFIC6
  2474. 11.34 s [haskell-language-server] depends text-2.0.2
  2475. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  2476. 11.34 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2477. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2478. 11.34 s [haskell-language-server] depends containers-0.6.7
  2479. 11.34 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2480. 11.34 s [haskell-language-server] depends fuzzy-0.1.1.0-LlERYC6Fg0O5zdG1C09qam
  2481. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2482. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2483. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2484. 11.34 s [haskell-language-server] depends lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6
  2485. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2486. 11.34 s [haskell-language-server] depends text-2.0.2
  2487. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2488. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  2489. 11.34 s [haskell-language-server] depends array-0.5.8.0
  2490. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2491. 11.34 s [haskell-language-server] depends bytestring-0.11.5.4
  2492. 11.34 s [haskell-language-server] depends containers-0.6.7
  2493. 11.34 s [haskell-language-server] depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  2494. 11.34 s [haskell-language-server] depends deepseq-1.4.8.1
  2495. 11.34 s [haskell-language-server] depends dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  2496. 11.34 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2497. 11.34 s [haskell-language-server] depends ghc-9.6.7
  2498. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2499. 11.34 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2500. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2501. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2502. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2503. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2504. 11.34 s [haskell-language-server] depends stm-2.5.1.0
  2505. 11.34 s [haskell-language-server] depends stm-containers-1.2.1.1-JDBpT36aDZ4CUdJ1Aus6oe
  2506. 11.34 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  2507. 11.34 s [haskell-language-server] depends template-haskell-2.20.0.0
  2508. 11.34 s [haskell-language-server] depends text-2.0.2
  2509. 11.34 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  2510. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2511. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  2512. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2513. 11.34 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2514. 11.34 s [haskell-language-server] depends filepath-1.4.301.0
  2515. 11.34 s [haskell-language-server] depends ghc-boot-th-9.6.7
  2516. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2517. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2518. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2519. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2520. 11.34 s [haskell-language-server] depends ormolu-0.7.4.0-LIXgtWG5aD28NbkYgiUJ8V
  2521. 11.34 s [haskell-language-server] depends process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  2522. 11.34 s [haskell-language-server] depends text-2.0.2
  2523. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2524. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  2525. 11.34 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2526. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2527. 11.34 s [haskell-language-server] depends containers-0.6.7
  2528. 11.34 s [haskell-language-server] depends ghc-9.6.7
  2529. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2530. 11.34 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2531. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2532. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2533. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2534. 11.34 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  2535. 11.34 s [haskell-language-server] depends text-2.0.2
  2536. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2537. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  2538. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2539. 11.34 s [haskell-language-server] depends directory-1.3.8.5
  2540. 11.34 s [haskell-language-server] depends filepath-1.4.301.0
  2541. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2542. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2543. 11.34 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2544. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2545. 11.34 s [haskell-language-server] depends process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  2546. 11.34 s [haskell-language-server] depends text-2.0.2
  2547. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  2548. 11.34 s [haskell-language-server] depends Cabal-3.10.3.0-97VZ3uVCyHhIgysI2tHjj1
  2549. 11.34 s [haskell-language-server] depends Cabal-syntax-3.10.3.0-IhRvyLmXl1UIaCkYCiWa3f
  2550. 11.34 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2551. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2552. 11.34 s [haskell-language-server] depends bytestring-0.11.5.4
  2553. 11.34 s [haskell-language-server] depends cabal-add-0.2-8fogMBtEehK7vh7o2bjwgw
  2554. 11.34 s [haskell-language-server] depends containers-0.6.7
  2555. 11.34 s [haskell-language-server] depends deepseq-1.4.8.1
  2556. 11.34 s [haskell-language-server] depends directory-1.3.8.5
  2557. 11.34 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2558. 11.34 s [haskell-language-server] depends filepath-1.4.301.0
  2559. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2560. 11.34 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  2561. 11.34 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2562. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2563. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2564. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2565. 11.34 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2566. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2567. 11.34 s [haskell-language-server] depends pretty-1.1.3.6
  2568. 11.34 s [haskell-language-server] depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  2569. 11.34 s [haskell-language-server] depends text-2.0.2
  2570. 11.34 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  2571. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2572. 11.34 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  2573. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  2574. 11.34 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2575. 11.34 s [haskell-language-server] depends apply-refact-0.15.0.0-4MjkBELToDe5NAkQSrxtCU
  2576. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2577. 11.34 s [haskell-language-server] depends bytestring-0.11.5.4
  2578. 11.34 s [haskell-language-server] depends containers-0.6.7
  2579. 11.34 s [haskell-language-server] depends deepseq-1.4.8.1
  2580. 11.34 s [haskell-language-server] depends filepath-1.4.301.0
  2581. 11.34 s [haskell-language-server] depends ghc-lib-parser-9.8.5.20250214-2sNjHbGivPe3WF6GmRwnfJ
  2582. 11.34 s [haskell-language-server] depends ghc-lib-parser-ex-9.8.0.2-6MMs82JSbM38IX9LmoVjK4
  2583. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2584. 11.34 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  2585. 11.34 s [haskell-language-server] depends hlint-3.8-41jUuJncsTy84zuKEBa9b
  2586. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2587. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2588. 11.34 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2589. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2590. 11.34 s [haskell-language-server] depends refact-0.3.0.2-8O04sJZgp6Q4KcGxjYVPmG
  2591. 11.34 s [haskell-language-server] depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  2592. 11.34 s [haskell-language-server] depends stm-2.5.1.0
  2593. 11.34 s [haskell-language-server] depends temporary-1.3-HdHuOgtZUl4D7UgDABDcym
  2594. 11.34 s [haskell-language-server] depends text-2.0.2
  2595. 11.34 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  2596. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2597. 11.34 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  2598. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  2599. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2600. 11.34 s [haskell-language-server] depends bytestring-0.11.5.4
  2601. 11.34 s [haskell-language-server] depends containers-0.6.7
  2602. 11.34 s [haskell-language-server] depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  2603. 11.34 s [haskell-language-server] depends deepseq-1.4.8.1
  2604. 11.34 s [haskell-language-server] depends dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  2605. 11.34 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2606. 11.34 s [haskell-language-server] depends ghc-9.6.7
  2607. 11.34 s [haskell-language-server] depends ghc-boot-9.6.7
  2608. 11.34 s [haskell-language-server] depends ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  2609. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2610. 11.34 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2611. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2612. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2613. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2614. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2615. 11.34 s [haskell-language-server] depends parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  2616. 11.34 s [haskell-language-server] depends regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM
  2617. 11.34 s [haskell-language-server] depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  2618. 11.34 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  2619. 11.34 s [haskell-language-server] depends text-2.0.2
  2620. 11.34 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  2621. 11.34 s [haskell-language-server] depends time-1.12.2
  2622. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2623. 11.34 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  2624. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  2625. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2626. 11.34 s [haskell-language-server] depends containers-0.6.7
  2627. 11.34 s [haskell-language-server] depends ghc-9.6.7
  2628. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2629. 11.34 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  2630. 11.34 s [haskell-language-server] depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  2631. 11.34 s [haskell-language-server] depends hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
  2632. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2633. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2634. 11.34 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2635. 11.34 s [haskell-language-server] depends mod-0.2.1.0-AEqKlJqNyYNGsAQxMMfOED
  2636. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2637. 11.34 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  2638. 11.34 s [haskell-language-server] depends text-2.0.2
  2639. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2640. 11.34 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  2641. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  2642. 11.34 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2643. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2644. 11.34 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2645. 11.34 s [haskell-language-server] depends foldl-1.4.18-Bjs3RPGa3QC5Zp1aPynHUe
  2646. 11.34 s [haskell-language-server] depends ghc-9.6.7
  2647. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2648. 11.34 s [haskell-language-server] depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  2649. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2650. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2651. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2652. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2653. 11.34 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  2654. 11.34 s [haskell-language-server] depends text-2.0.2
  2655. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2656. 11.34 s [haskell-language-server] depends unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
  2657. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  2658. 11.34 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2659. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2660. 11.34 s [haskell-language-server] depends bytestring-0.11.5.4
  2661. 11.34 s [haskell-language-server] depends containers-0.6.7
  2662. 11.34 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2663. 11.34 s [haskell-language-server] depends ghc-9.6.7
  2664. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2665. 11.34 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  2666. 11.34 s [haskell-language-server] depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  2667. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2668. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2669. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2670. 11.34 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2671. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2672. 11.34 s [haskell-language-server] depends retrie-1.2.3-4syE2wloz6UAMXGW9FTmsG
  2673. 11.34 s [haskell-language-server] depends safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  2674. 11.34 s [haskell-language-server] depends stm-2.5.1.0
  2675. 11.34 s [haskell-language-server] depends text-2.0.2
  2676. 11.34 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  2677. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2678. 11.34 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  2679. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  2680. 11.34 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2681. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2682. 11.34 s [haskell-language-server] depends containers-0.6.7
  2683. 11.34 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2684. 11.34 s [haskell-language-server] depends ghc-9.6.7
  2685. 11.34 s [haskell-language-server] depends ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  2686. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2687. 11.34 s [haskell-language-server] depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  2688. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2689. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2690. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2691. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2692. 11.34 s [haskell-language-server] depends text-2.0.2
  2693. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2694. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  2695. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2696. 11.34 s [haskell-language-server] depends containers-0.6.7
  2697. 11.34 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2698. 11.34 s [haskell-language-server] depends ghc-boot-th-9.6.7
  2699. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2700. 11.34 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2701. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2702. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2703. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2704. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2705. 11.34 s [haskell-language-server] depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  2706. 11.34 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  2707. 11.34 s [haskell-language-server] depends text-2.0.2
  2708. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  2709. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2710. 11.34 s [haskell-language-server] depends containers-0.6.7
  2711. 11.34 s [haskell-language-server] depends dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  2712. 11.34 s [haskell-language-server] depends ghc-9.6.7
  2713. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2714. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2715. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2716. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2717. 11.34 s [haskell-language-server] depends text-2.0.2
  2718. 11.34 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  2719. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2720. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  2721. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2722. 11.34 s [haskell-language-server] depends directory-1.3.8.5
  2723. 11.34 s [haskell-language-server] depends filepath-1.4.301.0
  2724. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2725. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2726. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2727. 11.34 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2728. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2729. 11.34 s [haskell-language-server] depends process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  2730. 11.34 s [haskell-language-server] depends text-2.0.2
  2731. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  2732. 11.34 s [haskell-language-server] depends Diff-1.0.2-dzGetap2ECL5JRsgOkhmm
  2733. 11.34 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2734. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2735. 11.34 s [haskell-language-server] depends bytestring-0.11.5.4
  2736. 11.34 s [haskell-language-server] depends containers-0.6.7
  2737. 11.34 s [haskell-language-server] depends deepseq-1.4.8.1
  2738. 11.34 s [haskell-language-server] depends dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  2739. 11.34 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2740. 11.34 s [haskell-language-server] depends filepath-1.4.301.0
  2741. 11.34 s [haskell-language-server] depends ghc-9.6.7
  2742. 11.34 s [haskell-language-server] depends ghc-boot-th-9.6.7
  2743. 11.34 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2744. 11.34 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2745. 11.34 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2746. 11.34 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2747. 11.34 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2748. 11.34 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2749. 11.34 s [haskell-language-server] depends megaparsec-9.7.0-9FWtFuoAKCoJPEfZ8OP0ob
  2750. 11.34 s [haskell-language-server] depends mtl-2.3.1
  2751. 11.34 s [haskell-language-server] depends parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  2752. 11.34 s [haskell-language-server] depends text-2.0.2
  2753. 11.34 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  2754. 11.34 s [haskell-language-server] depends transformers-0.6.1.0
  2755. 11.34 s [haskell-language-server] depends unliftio-0.2.25.1-5MZwHIZimta75d0AbqTI9h
  2756. 11.34 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  2757. 11.34 s [haskell-language-server] definite haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  2758. 11.34 s [haskell-language-server] depends base-4.18.3.0
  2759. 11.35 s [haskell-language-server] depends containers-0.6.7
  2760. 11.35 s [haskell-language-server] depends ghc-9.6.7
  2761. 11.35 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2762. 11.35 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2763. 11.35 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2764. 11.35 s [haskell-language-server] depends text-2.0.2
  2765. 11.35 s [haskell-language-server] depends transformers-0.6.1.0
  2766. 11.35 s [haskell-language-server] definite haskell-language-server-2.12.0.0-4pY5yY1pY4d8Hs1Q2a6ukB-plugin-tutorial
  2767. 11.35 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2768. 11.35 s [haskell-language-server] depends base-4.18.3.0
  2769. 11.35 s [haskell-language-server] depends containers-0.6.7
  2770. 11.35 s [haskell-language-server] depends ghc-9.6.7
  2771. 11.35 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2772. 11.35 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2773. 11.35 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2774. 11.35 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2775. 11.35 s [haskell-language-server] depends markdown-unlit-0.6.0-5809pVajWVb2gBk7RWYi4C
  2776. 11.35 s [haskell-language-server] depends text-2.0.2
  2777. 11.35 s [haskell-language-server] depends transformers-0.6.1.0
  2778. 11.35 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  2779. 11.35 s [haskell-language-server] definite haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  2780. 11.35 s [haskell-language-server] depends base-4.18.3.0
  2781. 11.35 s [haskell-language-server] depends deepseq-1.4.8.1
  2782. 11.35 s [haskell-language-server] depends directory-1.3.8.5
  2783. 11.35 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2784. 11.35 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  2785. 11.35 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2786. 11.35 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2787. 11.35 s [haskell-language-server] depends stan-0.2.1.0-B6pDZR8PjMBItDLFTHk8I9
  2788. 11.35 s [haskell-language-server] depends text-2.0.2
  2789. 11.35 s [haskell-language-server] depends trial-0.0.0.0-4bVaCFWxanU7Vl3nRX6Yi0
  2790. 11.35 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  2791. 11.35 s [haskell-language-server] definite haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  2792. 11.35 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2793. 11.35 s [haskell-language-server] depends base-4.18.3.0
  2794. 11.35 s [haskell-language-server] depends containers-0.6.7
  2795. 11.35 s [haskell-language-server] depends deepseq-1.4.8.1
  2796. 11.35 s [haskell-language-server] depends ghc-9.6.7
  2797. 11.35 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2798. 11.35 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2799. 11.35 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2800. 11.35 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2801. 11.35 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2802. 11.35 s [haskell-language-server] depends mtl-2.3.1
  2803. 11.35 s [haskell-language-server] depends text-2.0.2
  2804. 11.35 s [haskell-language-server] depends transformers-0.6.1.0
  2805. 11.35 s [haskell-language-server] definite haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  2806. 11.35 s [haskell-language-server] depends base-4.18.3.0
  2807. 11.35 s [haskell-language-server] depends filepath-1.4.301.0
  2808. 11.35 s [haskell-language-server] depends fourmolu-0.15.0.0-EEltZEsw4M5ydl0dR88pq
  2809. 11.35 s [haskell-language-server] depends ghc-boot-th-9.6.7
  2810. 11.35 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2811. 11.35 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2812. 11.35 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2813. 11.35 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2814. 11.35 s [haskell-language-server] depends mtl-2.3.1
  2815. 11.35 s [haskell-language-server] depends process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  2816. 11.35 s [haskell-language-server] depends text-2.0.2
  2817. 11.35 s [haskell-language-server] depends transformers-0.6.1.0
  2818. 11.35 s [haskell-language-server] depends yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy
  2819. 11.35 s [haskell-language-server] definite haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  2820. 11.35 s [haskell-language-server] depends base-4.18.3.0
  2821. 11.35 s [haskell-language-server] depends containers-0.6.7
  2822. 11.35 s [haskell-language-server] depends deepseq-1.4.8.1
  2823. 11.35 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2824. 11.35 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2825. 11.35 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  2826. 11.35 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2827. 11.35 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2828. 11.35 s [haskell-language-server] depends text-2.0.2
  2829. 11.35 s [haskell-language-server] definite haskell-language-server-2.12.0.0-1eqeWxapPHfKHhYNK0JT0S-ghcide-bench
  2830. 11.35 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2831. 11.35 s [haskell-language-server] depends base-4.18.3.0
  2832. 11.35 s [haskell-language-server] depends bytestring-0.11.5.4
  2833. 11.35 s [haskell-language-server] depends containers-0.6.7
  2834. 11.35 s [haskell-language-server] depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  2835. 11.35 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2836. 11.35 s [haskell-language-server] depends filepath-1.4.301.0
  2837. 11.35 s [haskell-language-server] depends haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  2838. 11.35 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  2839. 11.35 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2840. 11.35 s [haskell-language-server] depends hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
  2841. 11.35 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  2842. 11.35 s [haskell-language-server] depends lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
  2843. 11.35 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2844. 11.35 s [haskell-language-server] depends optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  2845. 11.35 s [haskell-language-server] depends process-1.6.19.0
  2846. 11.35 s [haskell-language-server] depends safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  2847. 11.35 s [haskell-language-server] depends shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
  2848. 11.35 s [haskell-language-server] depends tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  2849. 11.35 s [haskell-language-server] depends text-2.0.2
  2850. 11.35 s [haskell-language-server] definite haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  2851. 11.35 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  2852. 11.35 s [haskell-language-server] depends base-4.18.3.0
  2853. 11.35 s [haskell-language-server] depends containers-0.6.7
  2854. 11.35 s [haskell-language-server] depends filepath-1.4.301.0
  2855. 11.35 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2856. 11.35 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2857. 11.35 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2858. 11.35 s [haskell-language-server] depends text-2.0.2
  2859. 11.35 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  2860. 11.35 s [haskell-language-server] depends transformers-0.6.1.0
  2861. 11.35 s [haskell-language-server] definite haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  2862. 11.35 s [haskell-language-server] depends aeson-pretty-0.8.10-BgtEeo7358D7lyXwmTUOLk
  2863. 11.35 s [haskell-language-server] depends base-4.18.3.0
  2864. 11.35 s [haskell-language-server] depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  2865. 11.35 s [haskell-language-server] depends directory-1.3.8.5
  2866. 11.35 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2867. 11.35 s [haskell-language-server] depends filepath-1.4.301.0
  2868. 11.35 s [haskell-language-server] depends ghc-9.6.7
  2869. 11.35 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2870. 11.35 s [haskell-language-server] depends githash-0.1.7.0-5BWjRCNZB9NEtAb5878P8j
  2871. 11.35 s [haskell-language-server] depends haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  2872. 11.35 s [haskell-language-server] depends haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  2873. 11.35 s [haskell-language-server] depends haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  2874. 11.35 s [haskell-language-server] depends haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  2875. 11.35 s [haskell-language-server] depends haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  2876. 11.35 s [haskell-language-server] depends haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  2877. 11.35 s [haskell-language-server] depends haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  2878. 11.35 s [haskell-language-server] depends haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  2879. 11.35 s [haskell-language-server] depends haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  2880. 11.35 s [haskell-language-server] depends haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  2881. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  2882. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  2883. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  2884. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  2885. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  2886. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  2887. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  2888. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  2889. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  2890. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  2891. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  2892. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  2893. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  2894. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  2895. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  2896. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  2897. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  2898. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  2899. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  2900. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  2901. 11.37 s [haskell-language-server] depends hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
  2902. 11.37 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2903. 11.37 s [haskell-language-server] depends optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  2904. 11.37 s [haskell-language-server] depends optparse-simple-0.1.1.4-9HAULKOjTA6J0lHNdRD2x7
  2905. 11.37 s [haskell-language-server] depends prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
  2906. 11.37 s [haskell-language-server] depends process-1.6.19.0
  2907. 11.37 s [haskell-language-server] depends text-2.0.2
  2908. 11.37 s [haskell-language-server] definite haskell-language-server-2.12.0.0-6OQdnWIBVJU7LMih85tfjb-haskell-language-server-wrapper
  2909. 11.37 s [haskell-language-server] depends base-4.18.3.0
  2910. 11.37 s [haskell-language-server] depends containers-0.6.7
  2911. 11.37 s [haskell-language-server] depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  2912. 11.37 s [haskell-language-server] depends directory-1.3.8.5
  2913. 11.37 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  2914. 11.37 s [haskell-language-server] depends filepath-1.4.301.0
  2915. 11.37 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  2916. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  2917. 11.37 s [haskell-language-server] depends hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
  2918. 11.37 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2919. 11.37 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2920. 11.37 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  2921. 11.37 s [haskell-language-server] depends text-2.0.2
  2922. 11.37 s [haskell-language-server] depends transformers-0.6.1.0
  2923. 11.37 s [haskell-language-server] depends unix-2.8.6.0
  2924. 11.37 s [haskell-language-server] depends unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
  2925. 11.37 s [haskell-language-server] definite haskell-language-server-2.12.0.0-ITpYpQVRS0qLya2XUJnu55-haskell-language-server
  2926. 11.37 s [haskell-language-server] depends base-4.18.3.0
  2927. 11.37 s [haskell-language-server] depends haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  2928. 11.37 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  2929. 11.37 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  2930. 11.37 s [haskell-language-server] depends prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
  2931. 11.37 s [haskell-language-server] depends text-2.0.2
  2932. 11.37 s [haskell-language-server] Using Cabal-3.10.3.0 compiled by ghc-9.6
  2933. 11.37 s [haskell-language-server] Using compiler: ghc-9.6.7
  2934. 11.37 s [haskell-language-server] Using install prefix:
  2935. 11.37 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0
  2936. 11.37 s [haskell-language-server] Executables installed in:
  2937. 11.37 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  2938. 11.37 s [haskell-language-server] Libraries installed in:
  2939. 11.37 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  2940. 11.37 s [haskell-language-server] Dynamic Libraries installed in:
  2941. 11.37 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  2942. 11.37 s [haskell-language-server] Private executables installed in:
  2943. 11.37 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/libexec/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0
  2944. 11.37 s [haskell-language-server] Data files installed in:
  2945. 11.37 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/share/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0
  2946. 11.37 s [haskell-language-server] Documentation installed in:
  2947. 11.37 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/share/doc/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0
  2948. 11.37 s [haskell-language-server] Configuration files installed in:
  2949. 11.37 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/etc
  2950. 11.37 s [haskell-language-server] No alex found
  2951. 11.37 s [haskell-language-server] Using ar found on system at:
  2952. 11.37 s [haskell-language-server] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  2953. 11.37 s [haskell-language-server] No c2hs found
  2954. 11.37 s [haskell-language-server] Using cpphs version 1.20.9 found on system at:
  2955. 11.37 s [haskell-language-server] /nix/store/wh669ywmw50iwg9i0cvya2v29k7kdnbp-cpphs-1.20.10/bin/cpphs
  2956. 11.37 s [haskell-language-server] No doctest found
  2957. 11.37 s [haskell-language-server] Using gcc version 14.3.0 given by user at:
  2958. 11.37 s [haskell-language-server] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  2959. 11.37 s [haskell-language-server] Using ghc version 9.6.7 found on system at:
  2960. 11.37 s [haskell-language-server] /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/ghc
  2961. 11.37 s [haskell-language-server] Using ghc-pkg version 9.6.7 found on system at:
  2962. 11.37 s [haskell-language-server] /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/ghc-pkg-9.6.7
  2963. 11.37 s [haskell-language-server] No ghcjs found
  2964. 11.37 s [haskell-language-server] No ghcjs-pkg found
  2965. 11.37 s [haskell-language-server] No greencard found
  2966. 11.37 s [haskell-language-server] Using haddock version 2.29.2 found on system at:
  2967. 11.37 s [haskell-language-server] /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/haddock-ghc-9.6.7
  2968. 11.37 s [haskell-language-server] No happy found
  2969. 11.37 s [haskell-language-server] Using haskell-suite found on system at: haskell-suite-dummy-location
  2970. 11.37 s [haskell-language-server] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2971. 11.37 s [haskell-language-server] No hmake found
  2972. 11.37 s [haskell-language-server] Using hpc version 0.68 found on system at:
  2973. 11.37 s [haskell-language-server] /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/hpc-ghc-9.6.7
  2974. 11.37 s [haskell-language-server] Using hsc2hs version 0.68.9 found on system at:
  2975. 11.37 s [haskell-language-server] /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  2976. 11.37 s [haskell-language-server] Using hscolour version 1.25 found on system at:
  2977. 11.37 s [haskell-language-server] /nix/store/na3h6k2pdvfb6kjn5dhiqi3z5l8cfdqx-hscolour-1.25/bin/HsColour
  2978. 11.37 s [haskell-language-server] No jhc found
  2979. 11.37 s [haskell-language-server] Using ld found on system at:
  2980. 11.37 s [haskell-language-server] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  2981. 11.37 s [haskell-language-server] No pkg-config found
  2982. 11.37 s [haskell-language-server] Using runghc version 9.6.7 found on system at:
  2983. 11.37 s [haskell-language-server] /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/runghc-9.6.7
  2984. 11.37 s [haskell-language-server] Using strip version 2.44 found on system at:
  2985. 11.37 s [haskell-language-server] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  2986. 11.37 s [haskell-language-server] Using tar found on system at:
  2987. 11.37 s [haskell-language-server] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  2988. 11.37 s [haskell-language-server] No uhc found
  2989. 11.67 s [haskell-language-server] Phase: buildPhase
  2990. 11.81 s [haskell-language-server] Preprocessing library 'hls-overloaded-record-dot-plugin' for haskell-language-server-2.12.0.0..
  2991. 11.81 s [haskell-language-server] Building library 'hls-overloaded-record-dot-plugin' for haskell-language-server-2.12.0.0..
  2992. 11.93 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.OverloadedRecordDot ( plugins/hls-overloaded-record-dot-plugin/src/Ide/Plugin/OverloadedRecordDot.hs, dist/build/hls-overloaded-record-dot-plugin/Ide/Plugin/OverloadedRecordDot.o, dist/build/hls-overloaded-record-dot-plugin/Ide/Plugin/OverloadedRecordDot.dyn_o )
  2993. 11.95 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 )
  2994. 12.21 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 )
  2995. 12.64 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 )
  2996. 13.25 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 )
  2997. 13.25 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 )
  2998. 13.25 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 )
  2999. 13.25 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 )
  3000. 13.25 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 )
  3001. 13.25 s [algebraic-graphs]
  3002. 13.25 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3003. 13.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3004. 13.25 s [algebraic-graphs] will become an error in a future GHC release.
  3005. 13.25 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3006. 13.25 s [algebraic-graphs] |
  3007. 13.25 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  3008. 13.25 s [algebraic-graphs] | ^
  3009. 13.25 s [algebraic-graphs]
  3010. 13.25 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3011. 13.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3012. 13.25 s [algebraic-graphs] will become an error in a future GHC release.
  3013. 13.25 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3014. 13.25 s [algebraic-graphs] |
  3015. 13.25 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  3016. 13.25 s [algebraic-graphs] | ^
  3017. 13.25 s [algebraic-graphs]
  3018. 13.25 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3019. 13.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3020. 13.25 s [algebraic-graphs] will become an error in a future GHC release.
  3021. 13.25 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3022. 13.25 s [algebraic-graphs] |
  3023. 13.25 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  3024. 13.25 s [algebraic-graphs] | ^
  3025. 13.25 s [algebraic-graphs]
  3026. 13.25 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3027. 13.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3028. 13.25 s [algebraic-graphs] will become an error in a future GHC release.
  3029. 13.25 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3030. 13.25 s [algebraic-graphs] |
  3031. 13.25 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  3032. 13.25 s [algebraic-graphs] | ^
  3033. 13.25 s [algebraic-graphs]
  3034. 13.25 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3035. 13.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3036. 13.25 s [algebraic-graphs] will become an error in a future GHC release.
  3037. 13.25 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3038. 13.25 s [algebraic-graphs] |
  3039. 13.25 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  3040. 13.25 s [algebraic-graphs] | ^
  3041. 13.25 s [algebraic-graphs]
  3042. 13.25 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3043. 13.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3044. 13.25 s [algebraic-graphs] will become an error in a future GHC release.
  3045. 13.25 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3046. 13.25 s [algebraic-graphs] |
  3047. 13.25 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  3048. 13.25 s [algebraic-graphs] | ^
  3049. 13.25 s [algebraic-graphs]
  3050. 13.25 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3051. 13.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3052. 13.25 s [algebraic-graphs] will become an error in a future GHC release.
  3053. 13.25 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3054. 13.25 s [algebraic-graphs] |
  3055. 13.25 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  3056. 13.25 s [algebraic-graphs] | ^
  3057. 13.25 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 )
  3058. 13.39 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 )
  3059. 13.64 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 )
  3060. 13.64 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 )
  3061. 13.64 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 )
  3062. 14.09 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 )
  3063. 14.31 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 )
  3064. 14.42 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 )
  3065. 14.42 s [algebraic-graphs]
  3066. 14.42 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3067. 14.42 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3068. 14.42 s [algebraic-graphs] will become an error in a future GHC release.
  3069. 14.42 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3070. 14.42 s [algebraic-graphs] |
  3071. 14.42 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  3072. 14.42 s [algebraic-graphs] | ^
  3073. 14.42 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 )
  3074. 14.42 s [algebraic-graphs]
  3075. 14.42 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3076. 14.42 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3077. 14.42 s [algebraic-graphs] will become an error in a future GHC release.
  3078. 14.42 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3079. 14.42 s [algebraic-graphs] |
  3080. 14.42 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  3081. 14.42 s [algebraic-graphs] | ^
  3082. 14.42 s [algebraic-graphs]
  3083. 14.43 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3084. 14.43 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3085. 14.43 s [algebraic-graphs] will become an error in a future GHC release.
  3086. 14.43 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3087. 14.43 s [algebraic-graphs] |
  3088. 14.43 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  3089. 14.43 s [algebraic-graphs] | ^
  3090. 14.43 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 )
  3091. 14.43 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 )
  3092. 14.43 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 )
  3093. 14.63 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 )
  3094. 14.63 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 )
  3095. 14.64 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 )
  3096. 14.64 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 )
  3097. 14.67 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.OverloadedRecordDot ( plugins/hls-overloaded-record-dot-plugin/src/Ide/Plugin/OverloadedRecordDot.hs, dist/build/hls-overloaded-record-dot-plugin/Ide/Plugin/OverloadedRecordDot.p_o )
  3098. 14.90 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  3099. 15.68 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  3100. 16.34 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 )
  3101. 16.64 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  3102. 16.64 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  3103. 17.79 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 )
  3104. 18.23 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 )
  3105. 18.50 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 )
  3106. 19.07 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  3107. 19.07 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 )
  3108. 19.07 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 )
  3109. 19.07 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 )
  3110. 19.07 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  3111. 19.07 s [algebraic-graphs]
  3112. 19.07 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3113. 19.07 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3114. 19.07 s [algebraic-graphs] will become an error in a future GHC release.
  3115. 19.07 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3116. 19.07 s [algebraic-graphs] |
  3117. 19.07 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  3118. 19.07 s [algebraic-graphs] | ^
  3119. 19.07 s [algebraic-graphs]
  3120. 19.07 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3121. 19.07 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3122. 19.07 s [algebraic-graphs] will become an error in a future GHC release.
  3123. 19.07 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3124. 19.07 s [algebraic-graphs] |
  3125. 19.07 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  3126. 19.07 s [algebraic-graphs] | ^
  3127. 19.07 s [algebraic-graphs]
  3128. 19.07 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3129. 19.07 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3130. 19.07 s [algebraic-graphs] will become an error in a future GHC release.
  3131. 19.07 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3132. 19.07 s [algebraic-graphs] |
  3133. 19.07 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  3134. 19.07 s [algebraic-graphs] | ^
  3135. 19.07 s [algebraic-graphs]
  3136. 19.07 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3137. 19.08 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3138. 19.08 s [algebraic-graphs] will become an error in a future GHC release.
  3139. 19.08 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3140. 19.08 s [algebraic-graphs] |
  3141. 19.08 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  3142. 19.08 s [algebraic-graphs] | ^
  3143. 19.08 s [algebraic-graphs]
  3144. 19.08 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3145. 19.08 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3146. 19.08 s [algebraic-graphs] will become an error in a future GHC release.
  3147. 19.08 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3148. 19.08 s [algebraic-graphs] |
  3149. 19.08 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  3150. 19.08 s [algebraic-graphs] | ^
  3151. 19.08 s [algebraic-graphs]
  3152. 19.08 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3153. 19.08 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3154. 19.08 s [algebraic-graphs] will become an error in a future GHC release.
  3155. 19.08 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3156. 19.08 s [algebraic-graphs] |
  3157. 19.08 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  3158. 19.08 s [algebraic-graphs] | ^
  3159. 19.08 s [algebraic-graphs]
  3160. 19.08 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3161. 19.08 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3162. 19.08 s [algebraic-graphs] will become an error in a future GHC release.
  3163. 19.08 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3164. 19.08 s [algebraic-graphs] |
  3165. 19.08 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  3166. 19.08 s [algebraic-graphs] | ^
  3167. 19.08 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  3168. 19.25 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 )
  3169. 19.60 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  3170. 19.60 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 )
  3171. 19.60 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  3172. 20.22 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 )
  3173. 20.45 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 )
  3174. 20.59 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  3175. 20.59 s [algebraic-graphs]
  3176. 20.59 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3177. 20.59 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3178. 20.59 s [algebraic-graphs] will become an error in a future GHC release.
  3179. 20.59 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3180. 20.59 s [algebraic-graphs] |
  3181. 20.59 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  3182. 20.59 s [algebraic-graphs] | ^
  3183. 20.59 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 )
  3184. 20.59 s [algebraic-graphs]
  3185. 20.59 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3186. 20.59 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3187. 20.59 s [algebraic-graphs] will become an error in a future GHC release.
  3188. 20.59 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3189. 20.59 s [algebraic-graphs] |
  3190. 20.59 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  3191. 20.59 s [algebraic-graphs] | ^
  3192. 20.59 s [algebraic-graphs]
  3193. 20.59 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  3194. 20.59 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  3195. 20.59 s [algebraic-graphs] will become an error in a future GHC release.
  3196. 20.59 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  3197. 20.59 s [algebraic-graphs] |
  3198. 20.59 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  3199. 20.59 s [algebraic-graphs] | ^
  3200. 20.59 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  3201. 20.59 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  3202. 20.59 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 )
  3203. 20.63 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 )
  3204. 20.64 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 )
  3205. 20.65 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 )
  3206. 20.67 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  3207. 21.81 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  3208. 21.81 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7..
  3209. 21.94 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 )
  3210. 22.93 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 )
  3211. 23.25 s [haskell-language-server] Preprocessing library 'hls-change-type-signature-plugin' for haskell-language-server-2.12.0.0..
  3212. 23.25 s [haskell-language-server] Building library 'hls-change-type-signature-plugin' for haskell-language-server-2.12.0.0..
  3213. 23.42 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ChangeTypeSignature ( plugins/hls-change-type-signature-plugin/src/Ide/Plugin/ChangeTypeSignature.hs, dist/build/hls-change-type-signature-plugin/Ide/Plugin/ChangeTypeSignature.o, dist/build/hls-change-type-signature-plugin/Ide/Plugin/ChangeTypeSignature.dyn_o )
  3214. 25.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 )
  3215. 25.02 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 )
  3216. 25.02 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 )
  3217. 25.73 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ChangeTypeSignature ( plugins/hls-change-type-signature-plugin/src/Ide/Plugin/ChangeTypeSignature.hs, dist/build/hls-change-type-signature-plugin/Ide/Plugin/ChangeTypeSignature.p_o )
  3218. 26.79 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 )
  3219. 26.79 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 )
  3220. 26.79 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 )
  3221. 29.60 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 )
  3222. 29.72 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 )
  3223. 29.72 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 )
  3224. 30.32 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 )
  3225. 30.32 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 )
  3226. 30.32 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 )
  3227. 31.59 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 )
  3228. 31.59 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 )
  3229. 31.59 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 )
  3230. 31.59 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 )
  3231. 31.59 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 )
  3232. 31.59 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 )
  3233. 31.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  3234. 31.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  3235. 31.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  3236. 31.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  3237. 31.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  3238. 31.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  3239. 31.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  3240. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  3241. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  3242. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  3243. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  3244. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  3245. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  3246. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  3247. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  3248. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  3249. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  3250. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  3251. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  3252. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  3253. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  3254. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  3255. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  3256. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  3257. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  3258. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  3259. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  3260. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  3261. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  3262. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  3263. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  3264. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  3265. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  3266. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  3267. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  3268. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  3269. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  3270. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  3271. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  3272. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  3273. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  3274. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  3275. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  3276. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  3277. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  3278. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  3279. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  3280. 31.60 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  3281. 31.61 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  3282. 31.61 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  3283. 31.61 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  3284. 31.61 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  3285. 31.61 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  3286. 31.61 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  3287. 31.61 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  3288. 31.61 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  3289. 31.61 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  3290. 31.61 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  3291. 31.61 s [algebraic-graphs] inspection testing successful
  3292. 31.61 s [algebraic-graphs] expected successes: 58
  3293. 31.61 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 )
  3294. 31.61 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 )
  3295. 31.61 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 )
  3296. 32.27 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  3297. 33.04 s [algebraic-graphs] Phase: checkPhase
  3298. 33.08 s [algebraic-graphs] Running 1 test suites...
  3299. 33.08 s [algebraic-graphs] Test suite main: RUNNING...
  3300. 33.35 s [haskell-language-server] Preprocessing library 'hls-class-plugin' for haskell-language-server-2.12.0.0..
  3301. 33.35 s [haskell-language-server] Building library 'hls-class-plugin' for haskell-language-server-2.12.0.0..
  3302. 33.52 s [haskell-language-server] [1 of 6] Compiling Ide.Plugin.Class.Utils ( plugins/hls-class-plugin/src/Ide/Plugin/Class/Utils.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/Utils.o, dist/build/hls-class-plugin/Ide/Plugin/Class/Utils.dyn_o )
  3303. 34.48 s [haskell-language-server] [2 of 6] Compiling Ide.Plugin.Class.Types ( plugins/hls-class-plugin/src/Ide/Plugin/Class/Types.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/Types.o, dist/build/hls-class-plugin/Ide/Plugin/Class/Types.dyn_o )
  3304. 35.82 s [haskell-language-server] [3 of 6] Compiling Ide.Plugin.Class.ExactPrint ( plugins/hls-class-plugin/src/Ide/Plugin/Class/ExactPrint.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/ExactPrint.o, dist/build/hls-class-plugin/Ide/Plugin/Class/ExactPrint.dyn_o )
  3305. 36.29 s [haskell-language-server] [4 of 6] Compiling Ide.Plugin.Class.CodeLens ( plugins/hls-class-plugin/src/Ide/Plugin/Class/CodeLens.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/CodeLens.o, dist/build/hls-class-plugin/Ide/Plugin/Class/CodeLens.dyn_o )
  3306. 36.46 s [haskell-language-server] [5 of 6] Compiling Ide.Plugin.Class.CodeAction ( plugins/hls-class-plugin/src/Ide/Plugin/Class/CodeAction.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/CodeAction.o, dist/build/hls-class-plugin/Ide/Plugin/Class/CodeAction.dyn_o )
  3307. 36.74 s [haskell-language-server] [6 of 6] Compiling Ide.Plugin.Class ( plugins/hls-class-plugin/src/Ide/Plugin/Class.hs, dist/build/hls-class-plugin/Ide/Plugin/Class.o, dist/build/hls-class-plugin/Ide/Plugin/Class.dyn_o )
  3308. 37.14 s [haskell-language-server] [1 of 6] Compiling Ide.Plugin.Class.Utils ( plugins/hls-class-plugin/src/Ide/Plugin/Class/Utils.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/Utils.p_o )
  3309. 38.10 s [haskell-language-server] [2 of 6] Compiling Ide.Plugin.Class.Types ( plugins/hls-class-plugin/src/Ide/Plugin/Class/Types.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/Types.p_o )
  3310. 38.84 s [algebraic-graphs]
  3311. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  3312. 38.84 s [algebraic-graphs] OK: show empty == "empty"
  3313. 38.84 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  3314. 38.84 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  3315. 38.84 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  3316. 38.84 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  3317. 38.84 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  3318. 38.84 s [algebraic-graphs]
  3319. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  3320. 38.84 s [algebraic-graphs] OK: fromAcyclic empty == empty
  3321. 38.84 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  3322. 38.84 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  3323. 38.84 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  3324. 38.84 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  3325. 38.84 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  3326. 38.84 s [algebraic-graphs]
  3327. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  3328. 38.84 s [algebraic-graphs] OK: isEmpty empty == True
  3329. 38.84 s [algebraic-graphs] OK: hasVertex x empty == False
  3330. 38.84 s [algebraic-graphs] OK: vertexCount empty == 0
  3331. 38.84 s [algebraic-graphs] OK: edgeCount empty == 0
  3332. 38.84 s [algebraic-graphs]
  3333. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  3334. 38.84 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  3335. 38.84 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  3336. 38.84 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  3337. 38.84 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  3338. 38.84 s [algebraic-graphs]
  3339. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  3340. 38.84 s [algebraic-graphs] OK: vertices [] == empty
  3341. 38.84 s [algebraic-graphs] OK: vertices [x] == vertex x
  3342. 38.84 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  3343. 38.84 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  3344. 38.84 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  3345. 38.84 s [algebraic-graphs]
  3346. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  3347. 38.84 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  3348. 38.84 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  3349. 38.84 s [algebraic-graphs]
  3350. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  3351. 38.84 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  3352. 38.84 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  3353. 38.84 s [algebraic-graphs]
  3354. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  3355. 38.84 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  3356. 38.84 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  3357. 38.84 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  3358. 38.84 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  3359. 38.84 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  3360. 38.84 s [algebraic-graphs]
  3361. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  3362. 38.84 s [algebraic-graphs] OK: isEmpty empty == True
  3363. 38.84 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  3364. 38.84 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  3365. 38.84 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  3366. 38.84 s [algebraic-graphs]
  3367. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  3368. 38.84 s [algebraic-graphs] OK: hasVertex x empty == False
  3369. 38.84 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  3370. 38.84 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  3371. 38.84 s [algebraic-graphs]
  3372. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  3373. 38.84 s [algebraic-graphs] OK: hasEdge x y empty == False
  3374. 38.84 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  3375. 38.84 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  3376. 38.84 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  3377. 38.84 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  3378. 38.84 s [algebraic-graphs]
  3379. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  3380. 38.84 s [algebraic-graphs] OK: vertexCount empty == 0
  3381. 38.84 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  3382. 38.84 s [algebraic-graphs] OK: vertexCount == length . vertexList
  3383. 38.84 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  3384. 38.84 s [algebraic-graphs]
  3385. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  3386. 38.84 s [algebraic-graphs] OK: edgeCount empty == 0
  3387. 38.84 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  3388. 38.84 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  3389. 38.84 s [algebraic-graphs] OK: edgeCount == length . edgeList
  3390. 38.84 s [algebraic-graphs]
  3391. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  3392. 38.84 s [algebraic-graphs] OK: vertexList empty == []
  3393. 38.84 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  3394. 38.84 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  3395. 38.84 s [algebraic-graphs]
  3396. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  3397. 38.84 s [algebraic-graphs] OK: edgeList empty == []
  3398. 38.84 s [algebraic-graphs] OK: edgeList (vertex x) == []
  3399. 38.84 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  3400. 38.84 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  3401. 38.84 s [algebraic-graphs]
  3402. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  3403. 38.84 s [algebraic-graphs] OK: adjacencyList empty == []
  3404. 38.84 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  3405. 38.84 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  3406. 38.84 s [algebraic-graphs]
  3407. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  3408. 38.84 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  3409. 38.84 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  3410. 38.84 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  3411. 38.84 s [algebraic-graphs]
  3412. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  3413. 38.84 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  3414. 38.84 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  3415. 38.84 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  3416. 38.84 s [algebraic-graphs]
  3417. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  3418. 38.84 s [algebraic-graphs] OK: preSet x empty == Set.empty
  3419. 38.84 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  3420. 38.84 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  3421. 38.84 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  3422. 38.84 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  3423. 38.84 s [algebraic-graphs]
  3424. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  3425. 38.84 s [algebraic-graphs] OK: postSet x empty == Set.empty
  3426. 38.84 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  3427. 38.84 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  3428. 38.84 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  3429. 38.84 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  3430. 38.84 s [algebraic-graphs]
  3431. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  3432. 38.84 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  3433. 38.84 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  3434. 38.84 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  3435. 38.84 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  3436. 38.84 s [algebraic-graphs]
  3437. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  3438. 38.84 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  3439. 38.84 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  3440. 38.84 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  3441. 38.84 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  3442. 38.84 s [algebraic-graphs]
  3443. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  3444. 38.84 s [algebraic-graphs] OK: transpose empty == empty
  3445. 38.84 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  3446. 38.84 s [algebraic-graphs] OK: transpose . transpose == id
  3447. 38.84 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  3448. 38.84 s [algebraic-graphs]
  3449. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  3450. 38.84 s [algebraic-graphs] OK: induce (const True ) x == x
  3451. 38.84 s [algebraic-graphs] OK: induce (const False) x == empty
  3452. 38.84 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  3453. 38.84 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  3454. 38.84 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  3455. 38.84 s [algebraic-graphs]
  3456. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  3457. 38.84 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  3458. 38.84 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  3459. 38.84 s [algebraic-graphs]
  3460. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  3461. 38.84 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  3462. 38.84 s [algebraic-graphs]
  3463. 38.84 s [algebraic-graphs] OK: box x y ~~ box y x
  3464. 38.84 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  3465. 38.84 s [algebraic-graphs] OK: box x empty ~~ empty
  3466. 38.84 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  3467. 38.84 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  3468. 38.84 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  3469. 38.84 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  3470. 38.84 s [algebraic-graphs]
  3471. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  3472. 38.84 s [algebraic-graphs] OK: transitiveClosure empty == empty
  3473. 38.84 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  3474. 38.84 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  3475. 38.84 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  3476. 38.84 s [algebraic-graphs]
  3477. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  3478. 38.84 s [algebraic-graphs] OK: topSort empty == []
  3479. 38.84 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  3480. 38.84 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  3481. 38.84 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  3482. 38.84 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  3483. 38.84 s [algebraic-graphs]
  3484. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  3485. 38.84 s [algebraic-graphs] OK: scc empty == empty
  3486. 38.84 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  3487. 38.84 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  3488. 38.84 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  3489. 38.84 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  3490. 38.84 s [algebraic-graphs]
  3491. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  3492. 38.84 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  3493. 38.84 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  3494. 38.84 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  3495. 38.84 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  3496. 38.84 s [algebraic-graphs]
  3497. 38.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  3498. 38.84 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  3499. 38.84 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  3500. 38.84 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  3501. 38.84 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  3502. 38.84 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  3503. 38.84 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  3504. 40.73 s [haskell-language-server] [3 of 6] Compiling Ide.Plugin.Class.ExactPrint ( plugins/hls-class-plugin/src/Ide/Plugin/Class/ExactPrint.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/ExactPrint.p_o )
  3505. 41.01 s [haskell-language-server] [4 of 6] Compiling Ide.Plugin.Class.CodeLens ( plugins/hls-class-plugin/src/Ide/Plugin/Class/CodeLens.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/CodeLens.p_o )
  3506. 41.12 s [haskell-language-server] [5 of 6] Compiling Ide.Plugin.Class.CodeAction ( plugins/hls-class-plugin/src/Ide/Plugin/Class/CodeAction.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/CodeAction.p_o )
  3507. 41.49 s [haskell-language-server] [6 of 6] Compiling Ide.Plugin.Class ( plugins/hls-class-plugin/src/Ide/Plugin/Class.hs, dist/build/hls-class-plugin/Ide/Plugin/Class.p_o )
  3508. 41.68 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  3509. 41.68 s [algebraic-graphs]
  3510. 41.68 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  3511. 41.68 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  3512. 41.68 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  3513. 41.68 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  3514. 41.68 s [algebraic-graphs]
  3515. 41.68 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  3516. 41.68 s [algebraic-graphs] OK: Arbitrary
  3517. 41.68 s [algebraic-graphs] OK: empty
  3518. 41.68 s [algebraic-graphs] OK: vertex
  3519. 41.68 s [algebraic-graphs] OK: vertices
  3520. 41.68 s [algebraic-graphs] OK: union
  3521. 41.68 s [algebraic-graphs] OK: join
  3522. 41.68 s [algebraic-graphs] OK: transpose
  3523. 41.68 s [algebraic-graphs] OK: box
  3524. 41.68 s [algebraic-graphs] OK: transitiveClosure
  3525. 41.68 s [algebraic-graphs] OK: scc
  3526. 41.68 s [algebraic-graphs] OK: toAcyclic
  3527. 41.68 s [algebraic-graphs] OK: toAcyclicOrd
  3528. 41.68 s [algebraic-graphs]
  3529. 41.68 s [algebraic-graphs] ============ AdjacencyIntMap ============
  3530. 41.68 s [algebraic-graphs] OK: Axioms of graphs
  3531. 41.68 s [algebraic-graphs]
  3532. 41.68 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  3533. 41.68 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  3534. 41.68 s [algebraic-graphs]
  3535. 41.68 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  3536. 41.68 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  3537. 41.68 s [algebraic-graphs]
  3538. 41.68 s [algebraic-graphs] OK: consistent empty == True
  3539. 41.68 s [algebraic-graphs] OK: consistent (vertex x) == True
  3540. 41.68 s [algebraic-graphs] OK: consistent (overlay x y) == True
  3541. 41.68 s [algebraic-graphs] OK: consistent (connect x y) == True
  3542. 41.68 s [algebraic-graphs] OK: consistent (edge x y) == True
  3543. 41.68 s [algebraic-graphs] OK: consistent (edges xs) == True
  3544. 41.68 s [algebraic-graphs] OK: consistent (stars xs) == True
  3545. 41.68 s [algebraic-graphs]
  3546. 41.68 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  3547. 41.68 s [algebraic-graphs] OK: show (empty ) == "empty"
  3548. 41.68 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  3549. 41.68 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  3550. 41.68 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  3551. 41.68 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  3552. 41.68 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  3553. 41.68 s [algebraic-graphs]
  3554. 41.68 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  3555. 41.68 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  3556. 41.68 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  3557. 41.69 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  3558. 41.69 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  3559. 41.69 s [algebraic-graphs]
  3560. 41.69 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  3561. 41.69 s [algebraic-graphs] OK: vertex 1 < vertex 2
  3562. 41.69 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  3563. 41.69 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  3564. 41.69 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  3565. 41.69 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  3566. 41.69 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  3567. 41.69 s [algebraic-graphs] OK: x <= x + y
  3568. 41.69 s [algebraic-graphs] OK: x + y <= x * y
  3569. 41.69 s [algebraic-graphs]
  3570. 41.69 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  3571. 41.69 s [algebraic-graphs] OK: isEmpty empty == True
  3572. 41.69 s [algebraic-graphs] OK: hasVertex x empty == False
  3573. 41.69 s [algebraic-graphs] OK: vertexCount empty == 0
  3574. 41.69 s [algebraic-graphs] OK: edgeCount empty == 0
  3575. 41.69 s [algebraic-graphs]
  3576. 41.69 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  3577. 41.69 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  3578. 41.69 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  3579. 41.69 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  3580. 41.69 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  3581. 41.69 s [algebraic-graphs]
  3582. 41.69 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  3583. 41.69 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  3584. 41.69 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  3585. 41.69 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  3586. 41.69 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  3587. 41.69 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  3588. 41.69 s [algebraic-graphs]
  3589. 41.69 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  3590. 41.69 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  3591. 41.69 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  3592. 41.69 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  3593. 41.69 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  3594. 41.69 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  3595. 41.69 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  3596. 41.69 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  3597. 41.69 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  3598. 41.69 s [algebraic-graphs]
  3599. 41.69 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  3600. 41.69 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  3601. 41.69 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  3602. 41.69 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  3603. 41.69 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  3604. 41.69 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  3605. 41.69 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  3606. 41.69 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  3607. 41.69 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  3608. 41.69 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  3609. 41.69 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  3610. 41.69 s [algebraic-graphs]
  3611. 41.69 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  3612. 41.69 s [algebraic-graphs] OK: vertices [] == empty
  3613. 41.69 s [algebraic-graphs] OK: vertices [x] == vertex x
  3614. 41.69 s [algebraic-graphs] OK: vertices == overlays . map vertex
  3615. 41.69 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  3616. 41.69 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  3617. 41.69 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  3618. 41.69 s [algebraic-graphs]
  3619. 41.69 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  3620. 41.69 s [algebraic-graphs] OK: edges [] == empty
  3621. 41.69 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  3622. 41.69 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  3623. 41.69 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  3624. 41.69 s [algebraic-graphs]
  3625. 41.69 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  3626. 41.69 s [algebraic-graphs] OK: overlays [] == empty
  3627. 41.69 s [algebraic-graphs] OK: overlays [x] == x
  3628. 41.69 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  3629. 41.69 s [algebraic-graphs] OK: overlays == foldr overlay empty
  3630. 41.69 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  3631. 41.69 s [algebraic-graphs]
  3632. 41.69 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  3633. 41.69 s [algebraic-graphs] OK: connects [] == empty
  3634. 41.69 s [algebraic-graphs] OK: connects [x] == x
  3635. 41.69 s [algebraic-graphs] OK: connects [x,y] == connect x y
  3636. 41.69 s [algebraic-graphs] OK: connects == foldr connect empty
  3637. 41.69 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  3638. 41.69 s [algebraic-graphs]
  3639. 41.69 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  3640. 41.69 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  3641. 41.69 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  3642. 41.69 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  3643. 41.69 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  3644. 41.69 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  3645. 41.69 s [algebraic-graphs]
  3646. 41.69 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  3647. 41.69 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  3648. 41.69 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  3649. 41.69 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  3650. 41.69 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  3651. 41.69 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  3652. 41.69 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  3653. 41.69 s [algebraic-graphs]
  3654. 41.69 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  3655. 41.69 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  3656. 41.69 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  3657. 41.69 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  3658. 41.69 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  3659. 41.69 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  3660. 41.69 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  3661. 41.69 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  3662. 41.69 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  3663. 41.69 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  3664. 41.69 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  3665. 41.69 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  3666. 41.69 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  3667. 41.69 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  3668. 41.69 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  3669. 41.69 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  3670. 41.69 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  3671. 41.69 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  3672. 41.69 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  3673. 41.69 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  3674. 41.69 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  3675. 41.69 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  3676. 41.69 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  3677. 41.69 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  3678. 41.69 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  3679. 41.69 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  3680. 41.69 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  3681. 41.69 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  3682. 41.69 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  3683. 41.69 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  3684. 41.69 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  3685. 41.69 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  3686. 41.69 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  3687. 41.69 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  3688. 41.69 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  3689. 42.33 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  3690. 42.33 s [algebraic-graphs]
  3691. 42.33 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  3692. 42.33 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  3693. 42.33 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  3694. 42.33 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  3695. 42.33 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  3696. 42.33 s [algebraic-graphs]
  3697. 42.33 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  3698. 42.33 s [algebraic-graphs] OK: isEmpty empty == True
  3699. 42.33 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  3700. 42.33 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  3701. 42.33 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  3702. 42.33 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  3703. 42.33 s [algebraic-graphs]
  3704. 42.33 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  3705. 42.33 s [algebraic-graphs] OK: hasVertex x empty == False
  3706. 42.33 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  3707. 42.33 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  3708. 42.33 s [algebraic-graphs]
  3709. 42.33 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  3710. 42.33 s [algebraic-graphs] OK: hasEdge x y empty == False
  3711. 42.33 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  3712. 42.33 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  3713. 42.33 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  3714. 42.33 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  3715. 42.33 s [algebraic-graphs]
  3716. 42.33 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  3717. 42.33 s [algebraic-graphs] OK: vertexCount empty == 0
  3718. 42.33 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  3719. 42.33 s [algebraic-graphs] OK: vertexCount == length . vertexList
  3720. 42.33 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  3721. 42.33 s [algebraic-graphs]
  3722. 42.33 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  3723. 42.33 s [algebraic-graphs] OK: edgeCount empty == 0
  3724. 42.33 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  3725. 42.33 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  3726. 42.33 s [algebraic-graphs] OK: edgeCount == length . edgeList
  3727. 42.33 s [algebraic-graphs]
  3728. 42.33 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  3729. 42.33 s [algebraic-graphs] OK: vertexList empty == []
  3730. 42.33 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  3731. 42.33 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  3732. 42.33 s [algebraic-graphs]
  3733. 42.33 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  3734. 42.33 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  3735. 42.33 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  3736. 42.33 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  3737. 42.33 s [algebraic-graphs]
  3738. 42.33 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  3739. 42.33 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  3740. 42.33 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  3741. 42.33 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  3742. 42.33 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  3743. 42.33 s [algebraic-graphs]
  3744. 42.33 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  3745. 42.33 s [algebraic-graphs] OK: edgeList empty == []
  3746. 42.34 s [algebraic-graphs] OK: edgeList (vertex x) == []
  3747. 42.34 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  3748. 42.34 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  3749. 42.34 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  3750. 42.34 s [algebraic-graphs]
  3751. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  3752. 42.34 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  3753. 42.34 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  3754. 42.34 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  3755. 42.34 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  3756. 42.34 s [algebraic-graphs]
  3757. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  3758. 42.34 s [algebraic-graphs] OK: adjacencyList empty == []
  3759. 42.34 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  3760. 42.34 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  3761. 42.34 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  3762. 42.34 s [algebraic-graphs]
  3763. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  3764. 42.34 s [algebraic-graphs] OK: preSet x empty == Set.empty
  3765. 42.34 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  3766. 42.34 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  3767. 42.34 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  3768. 42.34 s [algebraic-graphs]
  3769. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  3770. 42.34 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  3771. 42.34 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  3772. 42.34 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  3773. 42.34 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  3774. 42.34 s [algebraic-graphs]
  3775. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  3776. 42.34 s [algebraic-graphs] OK: postSet x empty == Set.empty
  3777. 42.34 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  3778. 42.34 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  3779. 42.34 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  3780. 42.34 s [algebraic-graphs]
  3781. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  3782. 42.34 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  3783. 42.34 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  3784. 42.34 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  3785. 42.34 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  3786. 42.34 s [algebraic-graphs]
  3787. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  3788. 42.34 s [algebraic-graphs] OK: path [] == empty
  3789. 42.34 s [algebraic-graphs] OK: path [x] == vertex x
  3790. 42.34 s [algebraic-graphs] OK: path [x,y] == edge x y
  3791. 42.34 s [algebraic-graphs]
  3792. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  3793. 42.34 s [algebraic-graphs] OK: circuit [] == empty
  3794. 42.34 s [algebraic-graphs] OK: circuit [x] == edge x x
  3795. 42.34 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  3796. 42.34 s [algebraic-graphs]
  3797. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  3798. 42.34 s [algebraic-graphs] OK: clique [] == empty
  3799. 42.34 s [algebraic-graphs] OK: clique [x] == vertex x
  3800. 42.34 s [algebraic-graphs] OK: clique [x,y] == edge x y
  3801. 42.34 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  3802. 42.34 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  3803. 42.34 s [algebraic-graphs]
  3804. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  3805. 42.34 s [algebraic-graphs] OK: biclique [] [] == empty
  3806. 42.34 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  3807. 42.34 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  3808. 42.34 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  3809. 42.34 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  3810. 42.34 s [algebraic-graphs]
  3811. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  3812. 42.34 s [algebraic-graphs] OK: star x [] == vertex x
  3813. 42.34 s [algebraic-graphs] OK: star x [y] == edge x y
  3814. 42.34 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  3815. 42.34 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  3816. 42.34 s [algebraic-graphs]
  3817. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  3818. 42.34 s [algebraic-graphs] OK: stars [] == empty
  3819. 42.34 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  3820. 42.34 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  3821. 42.34 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  3822. 42.34 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  3823. 42.34 s [algebraic-graphs] OK: stars . adjacencyList == id
  3824. 42.34 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  3825. 42.34 s [algebraic-graphs]
  3826. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  3827. 42.34 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  3828. 42.34 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  3829. 42.34 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  3830. 42.34 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  3831. 42.34 s [algebraic-graphs]
  3832. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  3833. 42.34 s [algebraic-graphs] OK: forest [] == empty
  3834. 42.34 s [algebraic-graphs] OK: forest [x] == tree x
  3835. 42.34 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  3836. 42.34 s [algebraic-graphs] OK: forest == overlays . map tree
  3837. 42.34 s [algebraic-graphs]
  3838. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  3839. 42.34 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  3840. 42.34 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  3841. 42.34 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  3842. 42.34 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  3843. 42.34 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  3844. 42.34 s [algebraic-graphs]
  3845. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  3846. 42.34 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  3847. 42.34 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  3848. 42.34 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  3849. 42.34 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  3850. 42.34 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  3851. 42.34 s [algebraic-graphs]
  3852. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  3853. 42.34 s [algebraic-graphs] OK: replaceVertex x x == id
  3854. 42.34 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  3855. 42.34 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  3856. 42.34 s [algebraic-graphs]
  3857. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  3858. 42.34 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  3859. 42.34 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  3860. 42.34 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  3861. 42.34 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  3862. 42.34 s [algebraic-graphs]
  3863. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  3864. 42.34 s [algebraic-graphs] OK: transpose empty == empty
  3865. 42.34 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  3866. 42.34 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  3867. 42.34 s [algebraic-graphs] OK: transpose . transpose == id
  3868. 42.34 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  3869. 42.34 s [algebraic-graphs]
  3870. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  3871. 42.34 s [algebraic-graphs] OK: gmap f empty == empty
  3872. 42.34 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  3873. 42.34 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  3874. 42.34 s [algebraic-graphs] OK: gmap id == id
  3875. 42.34 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  3876. 42.34 s [algebraic-graphs]
  3877. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  3878. 42.34 s [algebraic-graphs] OK: induce (const True ) x == x
  3879. 42.34 s [algebraic-graphs] OK: induce (const False) x == empty
  3880. 42.34 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  3881. 42.34 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  3882. 42.34 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  3883. 42.34 s [algebraic-graphs]
  3884. 42.34 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  3885. 42.34 s [algebraic-graphs] OK: compose empty x == empty
  3886. 42.34 s [algebraic-graphs] OK: compose x empty == empty
  3887. 42.34 s [algebraic-graphs] OK: compose (vertex x) y == empty
  3888. 42.34 s [algebraic-graphs] OK: compose x (vertex y) == empty
  3889. 42.34 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  3890. 42.34 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  3891. 42.53 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  3892. 42.53 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  3893. 42.53 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  3894. 42.53 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  3895. 42.53 s [algebraic-graphs]
  3896. 42.53 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  3897. 42.53 s [algebraic-graphs] OK: closure empty == empty
  3898. 42.53 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  3899. 42.53 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  3900. 42.53 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  3901. 42.53 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  3902. 42.53 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  3903. 42.53 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  3904. 42.53 s [algebraic-graphs] OK: closure . closure == closure
  3905. 42.53 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  3906. 42.53 s [algebraic-graphs]
  3907. 42.53 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  3908. 42.53 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  3909. 42.53 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  3910. 42.53 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  3911. 42.53 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  3912. 42.53 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  3913. 42.53 s [algebraic-graphs]
  3914. 42.53 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  3915. 42.53 s [algebraic-graphs] OK: symmetricClosure empty == empty
  3916. 42.53 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  3917. 42.53 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  3918. 42.53 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  3919. 42.53 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  3920. 42.53 s [algebraic-graphs]
  3921. 42.53 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  3922. 42.53 s [algebraic-graphs] OK: transitiveClosure empty == empty
  3923. 42.53 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  3924. 42.53 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  3925. 42.53 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  3926. 42.53 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  3927. 42.53 s [algebraic-graphs]
  3928. 42.53 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  3929. 42.53 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  3930. 42.53 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  3931. 42.53 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  3932. 42.53 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  3933. 42.53 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  3934. 42.53 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  3935. 42.53 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  3936. 42.53 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  3937. 42.53 s [algebraic-graphs] OK: bfsForest x [] == []
  3938. 42.53 s [algebraic-graphs] OK: bfsForest empty vs == []
  3939. 42.53 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  3940. 42.53 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  3941. 42.53 s [algebraic-graphs]
  3942. 42.53 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  3943. 42.53 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  3944. 42.53 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  3945. 42.53 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  3946. 42.53 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  3947. 42.53 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  3948. 42.53 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  3949. 42.53 s [algebraic-graphs] OK: bfs empty vs == []
  3950. 42.53 s [algebraic-graphs] OK: bfs x [] == []
  3951. 42.53 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  3952. 42.53 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  3953. 42.53 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  3954. 42.53 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  3955. 42.53 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  3956. 42.53 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  3957. 42.53 s [algebraic-graphs]
  3958. 42.53 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  3959. 42.53 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  3960. 42.53 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  3961. 42.53 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  3962. 42.53 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  3963. 42.53 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  3964. 42.53 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  3965. 42.53 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  3966. 42.53 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  3967. 42.53 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  3968. 42.53 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  3969. 42.54 s [algebraic-graphs]
  3970. 42.54 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  3971. 42.54 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  3972. 42.54 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  3973. 42.54 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  3974. 42.54 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  3975. 42.54 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  3976. 42.54 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  3977. 42.54 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  3978. 42.54 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  3979. 42.54 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  3980. 42.54 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  3981. 42.54 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  3982. 42.54 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  3983. 42.54 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  3984. 42.54 s [algebraic-graphs]
  3985. 42.54 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  3986. 42.54 s [algebraic-graphs] OK: dfs empty vs == []
  3987. 42.54 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  3988. 42.54 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  3989. 42.54 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  3990. 42.54 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  3991. 42.54 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  3992. 42.54 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  3993. 42.54 s [algebraic-graphs] OK: dfs x [] == []
  3994. 42.54 s [algebraic-graphs]
  3995. 42.54 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  3996. 42.54 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  3997. 42.54 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  3998. 42.54 s [algebraic-graphs]
  3999. 42.54 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  4000. 42.54 s [algebraic-graphs] OK: reachable empty x == []
  4001. 42.54 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  4002. 42.54 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  4003. 42.54 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  4004. 42.54 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  4005. 42.54 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  4006. 42.54 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  4007. 42.54 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  4008. 42.54 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  4009. 42.54 s [algebraic-graphs]
  4010. 42.54 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  4011. 42.54 s [algebraic-graphs]
  4012. 42.54 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  4013. 42.54 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  4014. 42.54 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  4015. 42.54 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  4016. 42.54 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  4017. 42.54 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  4018. 42.54 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  4019. 42.54 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  4020. 42.54 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  4021. 42.54 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  4022. 42.54 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  4023. 42.54 s [algebraic-graphs]
  4024. 42.54 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  4025. 42.54 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  4026. 42.54 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  4027. 42.54 s [algebraic-graphs] OK: isAcyclic . circuit == null
  4028. 42.54 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  4029. 42.54 s [algebraic-graphs]
  4030. 42.54 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  4031. 42.54 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  4032. 42.54 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  4033. 42.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  4034. 42.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  4035. 42.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  4036. 42.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  4037. 42.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  4038. 42.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  4039. 42.54 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  4040. 42.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  4041. 42.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  4042. 42.54 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  4043. 42.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  4044. 46.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  4045. 46.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  4046. 46.60 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  4047. 46.60 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  4048. 46.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  4049. 46.60 s [algebraic-graphs]
  4050. 46.60 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  4051. 46.60 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  4052. 46.60 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  4053. 46.60 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  4054. 46.60 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  4055. 46.61 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  4056. 46.61 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  4057. 46.61 s [algebraic-graphs]
  4058. 46.61 s [algebraic-graphs] ============ AdjacencyMap ============
  4059. 46.61 s [algebraic-graphs] OK: Axioms of graphs
  4060. 46.61 s [algebraic-graphs]
  4061. 46.61 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  4062. 46.61 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  4063. 46.61 s [algebraic-graphs]
  4064. 46.61 s [algebraic-graphs] OK: consistent empty == True
  4065. 46.61 s [algebraic-graphs] OK: consistent (vertex x) == True
  4066. 46.61 s [algebraic-graphs] OK: consistent (overlay x y) == True
  4067. 46.61 s [algebraic-graphs] OK: consistent (connect x y) == True
  4068. 46.61 s [algebraic-graphs] OK: consistent (edge x y) == True
  4069. 46.61 s [algebraic-graphs] OK: consistent (edges xs) == True
  4070. 46.61 s [algebraic-graphs] OK: consistent (stars xs) == True
  4071. 46.61 s [algebraic-graphs]
  4072. 46.61 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  4073. 46.61 s [algebraic-graphs] OK: show (empty ) == "empty"
  4074. 46.61 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  4075. 46.61 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  4076. 46.61 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  4077. 46.61 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  4078. 46.61 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  4079. 46.61 s [algebraic-graphs]
  4080. 46.61 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  4081. 46.61 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  4082. 46.61 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  4083. 46.61 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  4084. 46.61 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  4085. 46.61 s [algebraic-graphs]
  4086. 46.61 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  4087. 46.61 s [algebraic-graphs] OK: vertex 1 < vertex 2
  4088. 46.61 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  4089. 46.61 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  4090. 46.61 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  4091. 46.61 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  4092. 46.61 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  4093. 46.61 s [algebraic-graphs] OK: x <= x + y
  4094. 46.61 s [algebraic-graphs] OK: x + y <= x * y
  4095. 46.61 s [algebraic-graphs]
  4096. 46.61 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  4097. 46.61 s [algebraic-graphs] OK: isEmpty empty == True
  4098. 46.61 s [algebraic-graphs] OK: hasVertex x empty == False
  4099. 46.61 s [algebraic-graphs] OK: vertexCount empty == 0
  4100. 46.61 s [algebraic-graphs] OK: edgeCount empty == 0
  4101. 46.61 s [algebraic-graphs]
  4102. 46.61 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  4103. 46.61 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  4104. 46.61 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  4105. 46.61 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  4106. 46.61 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  4107. 46.61 s [algebraic-graphs]
  4108. 46.61 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  4109. 46.61 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  4110. 46.61 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  4111. 46.61 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  4112. 46.61 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  4113. 46.61 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  4114. 46.61 s [algebraic-graphs]
  4115. 46.61 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  4116. 46.61 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  4117. 46.61 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  4118. 46.61 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  4119. 46.61 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  4120. 46.61 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  4121. 46.61 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  4122. 46.61 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  4123. 46.61 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  4124. 46.61 s [algebraic-graphs]
  4125. 46.61 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  4126. 46.61 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  4127. 46.61 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  4128. 46.61 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  4129. 46.61 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  4130. 46.61 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  4131. 46.61 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  4132. 46.61 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  4133. 46.61 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  4134. 46.61 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  4135. 46.61 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  4136. 46.61 s [algebraic-graphs]
  4137. 46.61 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  4138. 46.61 s [algebraic-graphs] OK: vertices [] == empty
  4139. 46.61 s [algebraic-graphs] OK: vertices [x] == vertex x
  4140. 46.61 s [algebraic-graphs] OK: vertices == overlays . map vertex
  4141. 46.61 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  4142. 46.61 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  4143. 46.61 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  4144. 46.61 s [algebraic-graphs]
  4145. 46.61 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  4146. 46.61 s [algebraic-graphs] OK: edges [] == empty
  4147. 46.61 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  4148. 46.61 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  4149. 46.61 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  4150. 46.61 s [algebraic-graphs]
  4151. 46.61 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  4152. 46.61 s [algebraic-graphs] OK: overlays [] == empty
  4153. 46.61 s [algebraic-graphs] OK: overlays [x] == x
  4154. 46.61 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  4155. 46.61 s [algebraic-graphs] OK: overlays == foldr overlay empty
  4156. 46.61 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  4157. 46.61 s [algebraic-graphs]
  4158. 46.61 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  4159. 46.61 s [algebraic-graphs] OK: connects [] == empty
  4160. 46.61 s [algebraic-graphs] OK: connects [x] == x
  4161. 46.61 s [algebraic-graphs] OK: connects [x,y] == connect x y
  4162. 46.61 s [algebraic-graphs] OK: connects == foldr connect empty
  4163. 46.61 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  4164. 46.61 s [algebraic-graphs]
  4165. 46.61 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  4166. 46.61 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  4167. 46.61 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  4168. 46.61 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  4169. 46.61 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  4170. 46.61 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  4171. 46.61 s [algebraic-graphs]
  4172. 46.61 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  4173. 46.61 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  4174. 46.61 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  4175. 46.61 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  4176. 46.61 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  4177. 46.61 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  4178. 46.61 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  4179. 46.61 s [algebraic-graphs]
  4180. 46.61 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  4181. 46.61 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  4182. 46.61 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  4183. 46.61 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  4184. 46.61 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  4185. 46.61 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  4186. 46.61 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  4187. 46.61 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  4188. 46.61 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  4189. 46.61 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  4190. 46.61 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  4191. 46.61 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  4192. 46.61 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  4193. 46.61 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  4194. 46.61 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  4195. 46.61 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  4196. 46.61 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  4197. 46.61 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  4198. 46.61 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  4199. 46.61 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  4200. 46.61 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  4201. 46.61 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  4202. 46.61 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  4203. 46.61 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  4204. 46.61 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  4205. 46.61 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  4206. 46.61 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  4207. 46.61 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  4208. 46.61 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  4209. 46.61 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  4210. 46.61 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  4211. 46.61 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  4212. 46.61 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  4213. 46.61 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  4214. 48.08 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  4215. 48.08 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  4216. 48.08 s [algebraic-graphs]
  4217. 48.08 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  4218. 48.08 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  4219. 48.08 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  4220. 48.08 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  4221. 48.08 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  4222. 48.08 s [algebraic-graphs]
  4223. 48.08 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  4224. 48.08 s [algebraic-graphs] OK: isEmpty empty == True
  4225. 48.08 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  4226. 48.08 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  4227. 48.08 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  4228. 48.08 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  4229. 48.08 s [algebraic-graphs]
  4230. 48.08 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  4231. 48.08 s [algebraic-graphs] OK: hasVertex x empty == False
  4232. 48.08 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  4233. 48.08 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  4234. 48.08 s [algebraic-graphs]
  4235. 48.08 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  4236. 48.08 s [algebraic-graphs] OK: hasEdge x y empty == False
  4237. 48.08 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  4238. 48.08 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  4239. 48.08 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  4240. 48.08 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  4241. 48.08 s [algebraic-graphs]
  4242. 48.08 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  4243. 48.08 s [algebraic-graphs] OK: vertexCount empty == 0
  4244. 48.08 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  4245. 48.08 s [algebraic-graphs] OK: vertexCount == length . vertexList
  4246. 48.08 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  4247. 48.08 s [algebraic-graphs]
  4248. 48.08 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  4249. 48.08 s [algebraic-graphs] OK: edgeCount empty == 0
  4250. 48.08 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  4251. 48.08 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  4252. 48.08 s [algebraic-graphs] OK: edgeCount == length . edgeList
  4253. 48.08 s [algebraic-graphs]
  4254. 48.08 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  4255. 48.08 s [algebraic-graphs] OK: vertexList empty == []
  4256. 48.08 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  4257. 48.08 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  4258. 48.08 s [algebraic-graphs]
  4259. 48.08 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  4260. 48.08 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  4261. 48.08 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  4262. 48.08 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  4263. 48.08 s [algebraic-graphs]
  4264. 48.08 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  4265. 48.08 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  4266. 48.08 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  4267. 48.08 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  4268. 48.08 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  4269. 48.08 s [algebraic-graphs]
  4270. 48.08 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  4271. 48.08 s [algebraic-graphs] OK: edgeList empty == []
  4272. 48.08 s [algebraic-graphs] OK: edgeList (vertex x) == []
  4273. 48.08 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  4274. 48.08 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  4275. 48.08 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  4276. 48.08 s [algebraic-graphs]
  4277. 48.08 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  4278. 48.08 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  4279. 48.08 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  4280. 48.08 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  4281. 48.08 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  4282. 48.08 s [algebraic-graphs]
  4283. 48.08 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  4284. 48.08 s [algebraic-graphs] OK: adjacencyList empty == []
  4285. 48.08 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  4286. 48.08 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  4287. 48.08 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  4288. 48.08 s [algebraic-graphs]
  4289. 48.08 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  4290. 48.08 s [algebraic-graphs] OK: preSet x empty == Set.empty
  4291. 48.08 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  4292. 48.08 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  4293. 48.08 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  4294. 48.08 s [algebraic-graphs]
  4295. 48.08 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  4296. 48.08 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  4297. 48.08 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  4298. 48.08 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  4299. 48.08 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  4300. 48.08 s [algebraic-graphs]
  4301. 48.08 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  4302. 48.08 s [algebraic-graphs] OK: postSet x empty == Set.empty
  4303. 48.08 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  4304. 48.08 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  4305. 48.08 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  4306. 48.08 s [algebraic-graphs]
  4307. 48.08 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  4308. 48.08 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  4309. 48.08 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  4310. 48.08 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  4311. 48.08 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  4312. 48.08 s [algebraic-graphs]
  4313. 48.08 s [algebraic-graphs] ============ AdjacencyMap.path ============
  4314. 48.08 s [algebraic-graphs] OK: path [] == empty
  4315. 48.08 s [algebraic-graphs] OK: path [x] == vertex x
  4316. 48.08 s [algebraic-graphs] OK: path [x,y] == edge x y
  4317. 48.08 s [algebraic-graphs]
  4318. 48.08 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  4319. 48.08 s [algebraic-graphs] OK: circuit [] == empty
  4320. 48.08 s [algebraic-graphs] OK: circuit [x] == edge x x
  4321. 48.08 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  4322. 48.08 s [algebraic-graphs]
  4323. 48.08 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  4324. 48.08 s [algebraic-graphs] OK: clique [] == empty
  4325. 48.08 s [algebraic-graphs] OK: clique [x] == vertex x
  4326. 48.08 s [algebraic-graphs] OK: clique [x,y] == edge x y
  4327. 48.08 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  4328. 48.08 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  4329. 48.09 s [algebraic-graphs]
  4330. 48.09 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  4331. 48.09 s [algebraic-graphs] OK: biclique [] [] == empty
  4332. 48.09 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  4333. 48.09 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  4334. 48.09 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  4335. 48.09 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  4336. 48.09 s [algebraic-graphs]
  4337. 48.09 s [algebraic-graphs] ============ AdjacencyMap.star ============
  4338. 48.09 s [algebraic-graphs] OK: star x [] == vertex x
  4339. 48.09 s [algebraic-graphs] OK: star x [y] == edge x y
  4340. 48.09 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  4341. 48.09 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  4342. 48.09 s [algebraic-graphs]
  4343. 48.09 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  4344. 48.09 s [algebraic-graphs] OK: stars [] == empty
  4345. 48.09 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  4346. 48.09 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  4347. 48.09 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  4348. 48.09 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  4349. 48.09 s [algebraic-graphs] OK: stars . adjacencyList == id
  4350. 48.09 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  4351. 48.09 s [algebraic-graphs]
  4352. 48.09 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  4353. 48.09 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  4354. 48.09 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  4355. 48.09 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  4356. 48.09 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  4357. 48.09 s [algebraic-graphs]
  4358. 48.09 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  4359. 48.09 s [algebraic-graphs] OK: forest [] == empty
  4360. 48.09 s [algebraic-graphs] OK: forest [x] == tree x
  4361. 48.09 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  4362. 48.09 s [algebraic-graphs] OK: forest == overlays . map tree
  4363. 48.09 s [algebraic-graphs]
  4364. 48.09 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  4365. 48.09 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  4366. 48.09 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  4367. 48.09 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  4368. 48.09 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  4369. 48.09 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  4370. 48.09 s [algebraic-graphs]
  4371. 48.09 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  4372. 48.09 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  4373. 48.09 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  4374. 48.09 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  4375. 48.09 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  4376. 48.09 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  4377. 48.09 s [algebraic-graphs]
  4378. 48.09 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  4379. 48.09 s [algebraic-graphs] OK: replaceVertex x x == id
  4380. 48.09 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  4381. 48.09 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  4382. 48.09 s [algebraic-graphs]
  4383. 48.09 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  4384. 48.09 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  4385. 48.09 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  4386. 48.09 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  4387. 48.09 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  4388. 48.09 s [algebraic-graphs]
  4389. 48.09 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  4390. 48.09 s [algebraic-graphs] OK: transpose empty == empty
  4391. 48.09 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  4392. 48.09 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  4393. 48.09 s [algebraic-graphs] OK: transpose . transpose == id
  4394. 48.09 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  4395. 48.09 s [algebraic-graphs]
  4396. 48.09 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  4397. 48.09 s [algebraic-graphs] OK: gmap f empty == empty
  4398. 48.09 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  4399. 48.09 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  4400. 48.09 s [algebraic-graphs] OK: gmap id == id
  4401. 48.09 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  4402. 48.09 s [algebraic-graphs]
  4403. 48.09 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  4404. 48.09 s [algebraic-graphs] OK: induce (const True ) x == x
  4405. 48.09 s [algebraic-graphs] OK: induce (const False) x == empty
  4406. 48.09 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  4407. 48.09 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  4408. 48.09 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  4409. 48.09 s [algebraic-graphs]
  4410. 48.09 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  4411. 48.09 s [algebraic-graphs] OK: compose empty x == empty
  4412. 48.09 s [algebraic-graphs] OK: compose x empty == empty
  4413. 48.09 s [algebraic-graphs] OK: compose (vertex x) y == empty
  4414. 48.09 s [algebraic-graphs] OK: compose x (vertex y) == empty
  4415. 48.09 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  4416. 48.09 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  4417. 48.40 s [haskell-language-server] Preprocessing library 'hls-call-hierarchy-plugin' for haskell-language-server-2.12.0.0..
  4418. 48.40 s [haskell-language-server] Building library 'hls-call-hierarchy-plugin' for haskell-language-server-2.12.0.0..
  4419. 48.52 s [haskell-language-server] [1 of 4] Compiling Ide.Plugin.CallHierarchy.Types ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy/Types.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Types.o, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Types.dyn_o )
  4420. 49.68 s [haskell-language-server] [2 of 4] Compiling Ide.Plugin.CallHierarchy.Query ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy/Query.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Query.o, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Query.dyn_o )
  4421. 49.95 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  4422. 49.95 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  4423. 49.95 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  4424. 49.95 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  4425. 49.95 s [algebraic-graphs]
  4426. 49.95 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  4427. 49.95 s [algebraic-graphs] OK: closure empty == empty
  4428. 49.95 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  4429. 49.95 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  4430. 49.95 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  4431. 49.95 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  4432. 49.95 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  4433. 49.95 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  4434. 49.95 s [algebraic-graphs] OK: closure . closure == closure
  4435. 49.95 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  4436. 49.95 s [algebraic-graphs]
  4437. 49.95 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  4438. 49.95 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  4439. 49.95 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  4440. 49.95 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  4441. 49.95 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  4442. 49.95 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  4443. 49.95 s [algebraic-graphs]
  4444. 49.95 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  4445. 49.95 s [algebraic-graphs] OK: symmetricClosure empty == empty
  4446. 49.95 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  4447. 49.95 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  4448. 49.95 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  4449. 49.95 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  4450. 49.95 s [algebraic-graphs]
  4451. 49.95 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  4452. 49.95 s [algebraic-graphs] OK: transitiveClosure empty == empty
  4453. 49.95 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  4454. 49.95 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  4455. 49.95 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  4456. 49.95 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  4457. 49.95 s [algebraic-graphs]
  4458. 49.95 s [algebraic-graphs] ============ AdjacencyMap.box ============
  4459. 49.95 s [algebraic-graphs] OK: box x y ~~ box y x
  4460. 49.95 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  4461. 49.95 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  4462. 49.95 s [algebraic-graphs] OK: box x empty ~~ empty
  4463. 49.95 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  4464. 49.95 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  4465. 49.95 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  4466. 49.95 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  4467. 49.95 s [algebraic-graphs]
  4468. 49.95 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  4469. 49.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  4470. 49.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  4471. 49.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  4472. 49.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  4473. 49.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  4474. 49.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  4475. 49.95 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  4476. 49.95 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  4477. 49.95 s [algebraic-graphs] OK: bfsForest x [] == []
  4478. 49.95 s [algebraic-graphs] OK: bfsForest empty vs == []
  4479. 49.95 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  4480. 49.95 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  4481. 49.95 s [algebraic-graphs]
  4482. 49.95 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  4483. 49.95 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  4484. 49.95 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  4485. 49.95 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  4486. 49.95 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  4487. 49.95 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  4488. 49.95 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  4489. 49.95 s [algebraic-graphs] OK: bfs empty vs == []
  4490. 49.95 s [algebraic-graphs] OK: bfs x [] == []
  4491. 49.95 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  4492. 49.95 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  4493. 49.95 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  4494. 49.95 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  4495. 49.95 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  4496. 49.95 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  4497. 49.95 s [algebraic-graphs]
  4498. 49.95 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  4499. 49.95 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  4500. 49.95 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  4501. 49.95 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  4502. 49.95 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  4503. 49.95 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  4504. 49.95 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  4505. 49.95 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  4506. 49.95 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  4507. 49.95 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  4508. 49.95 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  4509. 49.95 s [algebraic-graphs]
  4510. 49.95 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  4511. 49.95 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  4512. 49.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  4513. 49.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  4514. 49.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  4515. 49.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  4516. 49.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  4517. 49.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  4518. 49.95 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  4519. 49.95 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  4520. 49.95 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  4521. 49.95 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  4522. 49.95 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  4523. 49.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  4524. 49.95 s [algebraic-graphs]
  4525. 49.95 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  4526. 49.95 s [algebraic-graphs] OK: dfs empty vs == []
  4527. 49.95 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  4528. 49.95 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  4529. 49.95 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  4530. 49.95 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  4531. 49.95 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  4532. 49.95 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  4533. 49.95 s [algebraic-graphs] OK: dfs x [] == []
  4534. 49.95 s [algebraic-graphs]
  4535. 49.95 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  4536. 49.95 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  4537. 49.96 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  4538. 49.96 s [algebraic-graphs]
  4539. 49.96 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  4540. 49.96 s [algebraic-graphs] OK: reachable empty x == []
  4541. 49.96 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  4542. 49.96 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  4543. 49.96 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  4544. 49.96 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  4545. 49.96 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  4546. 49.96 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  4547. 49.96 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  4548. 49.96 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  4549. 49.96 s [algebraic-graphs]
  4550. 49.96 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  4551. 49.96 s [algebraic-graphs]
  4552. 49.96 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  4553. 49.96 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  4554. 49.96 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  4555. 49.96 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  4556. 49.96 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  4557. 49.96 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  4558. 49.96 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  4559. 49.96 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  4560. 49.96 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  4561. 49.96 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  4562. 49.96 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  4563. 49.96 s [algebraic-graphs]
  4564. 49.96 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  4565. 49.96 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  4566. 49.96 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  4567. 49.96 s [algebraic-graphs] OK: isAcyclic . circuit == null
  4568. 49.96 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  4569. 49.96 s [algebraic-graphs]
  4570. 49.96 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  4571. 49.96 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  4572. 49.96 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  4573. 49.96 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  4574. 49.96 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  4575. 49.96 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  4576. 49.96 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  4577. 49.96 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  4578. 49.98 s [haskell-language-server] [3 of 4] Compiling Ide.Plugin.CallHierarchy.Internal ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy/Internal.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Internal.o, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Internal.dyn_o )
  4579. 50.85 s [haskell-language-server] [4 of 4] Compiling Ide.Plugin.CallHierarchy ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy.o, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy.dyn_o )
  4580. 51.22 s [haskell-language-server] [1 of 4] Compiling Ide.Plugin.CallHierarchy.Types ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy/Types.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Types.p_o )
  4581. 54.71 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  4582. 54.71 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  4583. 54.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  4584. 54.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  4585. 54.83 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  4586. 54.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  4587. 54.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  4588. 54.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  4589. 54.83 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  4590. 54.83 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  4591. 54.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  4592. 54.83 s [algebraic-graphs]
  4593. 54.83 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  4594. 54.83 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  4595. 54.83 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  4596. 54.83 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  4597. 54.83 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  4598. 54.83 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  4599. 54.83 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  4600. 54.83 s [algebraic-graphs]
  4601. 54.83 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  4602. 54.83 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  4603. 54.83 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  4604. 54.83 s [algebraic-graphs] OK: induceJust . gmap Just == id
  4605. 54.83 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  4606. 54.83 s [algebraic-graphs]
  4607. 54.83 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  4608. 54.83 s [algebraic-graphs] OK: scc empty == empty
  4609. 54.83 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  4610. 54.83 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  4611. 54.83 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  4612. 54.83 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  4613. 54.83 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  4614. 54.83 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  4615. 54.83 s [algebraic-graphs] OK: isAcyclic . scc == const True
  4616. 54.83 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  4617. 54.83 s [algebraic-graphs] OK: scc g == KL.scc g
  4618. 54.83 s [algebraic-graphs]
  4619. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  4620. 54.83 s [algebraic-graphs] OK: 0 == rightVertex 0
  4621. 54.83 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  4622. 54.83 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  4623. 54.83 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  4624. 54.83 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  4625. 54.83 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  4626. 54.83 s [algebraic-graphs]
  4627. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  4628. 54.83 s [algebraic-graphs] OK: show empty == "empty"
  4629. 54.83 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  4630. 54.83 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  4631. 54.83 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  4632. 54.83 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  4633. 54.83 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  4634. 54.83 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  4635. 54.83 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  4636. 54.83 s [algebraic-graphs]
  4637. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  4638. 54.83 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  4639. 54.83 s [algebraic-graphs]
  4640. 54.83 s [algebraic-graphs] OK: x + y == y + x
  4641. 54.83 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  4642. 54.83 s [algebraic-graphs] OK: x * empty == x
  4643. 54.83 s [algebraic-graphs] OK: empty * x == x
  4644. 54.83 s [algebraic-graphs] OK: x * y == y * x
  4645. 54.83 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  4646. 54.83 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  4647. 54.83 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  4648. 54.83 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  4649. 54.83 s [algebraic-graphs] OK: x + empty == x
  4650. 54.83 s [algebraic-graphs] OK: empty + x == x
  4651. 54.83 s [algebraic-graphs] OK: x + x == x
  4652. 54.83 s [algebraic-graphs] OK: x * y + x + y == x * y
  4653. 54.83 s [algebraic-graphs] OK: x * x * x == x * x
  4654. 54.83 s [algebraic-graphs]
  4655. 54.83 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  4656. 54.83 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  4657. 54.83 s [algebraic-graphs]
  4658. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  4659. 54.83 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  4660. 54.83 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  4661. 54.83 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  4662. 54.83 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  4663. 54.83 s [algebraic-graphs]
  4664. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  4665. 54.83 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  4666. 54.83 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  4667. 54.83 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  4668. 54.83 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  4669. 54.83 s [algebraic-graphs]
  4670. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  4671. 54.83 s [algebraic-graphs] OK: isEmpty empty == True
  4672. 54.83 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  4673. 54.83 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  4674. 54.83 s [algebraic-graphs] OK: hasVertex x empty == False
  4675. 54.83 s [algebraic-graphs]
  4676. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  4677. 54.83 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  4678. 54.83 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  4679. 54.83 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  4680. 54.83 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  4681. 54.83 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  4682. 54.83 s [algebraic-graphs]
  4683. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  4684. 54.83 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  4685. 54.83 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  4686. 54.83 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  4687. 54.83 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  4688. 54.83 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  4689. 54.83 s [algebraic-graphs]
  4690. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  4691. 54.83 s [algebraic-graphs] OK: vertex . Left == leftVertex
  4692. 54.83 s [algebraic-graphs] OK: vertex . Right == rightVertex
  4693. 54.83 s [algebraic-graphs]
  4694. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  4695. 54.83 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  4696. 54.83 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  4697. 54.83 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  4698. 54.83 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  4699. 54.83 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  4700. 54.83 s [algebraic-graphs]
  4701. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  4702. 54.83 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  4703. 54.83 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  4704. 54.83 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  4705. 54.83 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  4706. 54.83 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  4707. 54.83 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  4708. 54.83 s [algebraic-graphs]
  4709. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  4710. 54.83 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  4711. 54.83 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  4712. 54.83 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  4713. 54.83 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  4714. 54.83 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  4715. 54.83 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  4716. 54.83 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  4717. 54.83 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  4718. 54.83 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  4719. 54.83 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  4720. 54.83 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  4721. 54.83 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  4722. 54.83 s [algebraic-graphs]
  4723. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  4724. 54.83 s [algebraic-graphs] OK: vertices [] [] == empty
  4725. 54.83 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  4726. 54.83 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  4727. 54.83 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  4728. 54.83 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  4729. 54.83 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  4730. 54.83 s [algebraic-graphs]
  4731. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  4732. 54.83 s [algebraic-graphs] OK: edges [] == empty
  4733. 54.83 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  4734. 54.83 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  4735. 54.83 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  4736. 54.83 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  4737. 54.83 s [algebraic-graphs]
  4738. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  4739. 54.83 s [algebraic-graphs] OK: overlays [] == empty
  4740. 54.83 s [algebraic-graphs] OK: overlays [x] == x
  4741. 54.83 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  4742. 54.83 s [algebraic-graphs] OK: overlays == foldr overlay empty
  4743. 54.83 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  4744. 54.83 s [algebraic-graphs]
  4745. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  4746. 54.83 s [algebraic-graphs] OK: connects [] == empty
  4747. 54.83 s [algebraic-graphs] OK: connects [x] == x
  4748. 54.83 s [algebraic-graphs] OK: connects [x,y] == connect x y
  4749. 54.83 s [algebraic-graphs] OK: connects == foldr connect empty
  4750. 54.83 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  4751. 54.83 s [algebraic-graphs]
  4752. 54.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  4753. 55.18 s [haskell-language-server] [2 of 4] Compiling Ide.Plugin.CallHierarchy.Query ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy/Query.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Query.p_o )
  4754. 55.48 s [haskell-language-server] [3 of 4] Compiling Ide.Plugin.CallHierarchy.Internal ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy/Internal.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Internal.p_o )
  4755. 55.79 s [algebraic-graphs] OK: swap empty == empty
  4756. 55.79 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  4757. 55.79 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  4758. 55.79 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  4759. 55.79 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  4760. 55.79 s [algebraic-graphs] OK: swap . swap == id
  4761. 55.79 s [algebraic-graphs]
  4762. 55.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  4763. 55.79 s [algebraic-graphs] OK: toBipartite empty == empty
  4764. 55.79 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  4765. 55.79 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  4766. 55.79 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  4767. 55.79 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  4768. 55.79 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  4769. 55.79 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  4770. 55.79 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  4771. 55.79 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  4772. 55.79 s [algebraic-graphs]
  4773. 55.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  4774. 55.79 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  4775. 55.79 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  4776. 55.79 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  4777. 55.79 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  4778. 55.79 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  4779. 55.79 s [algebraic-graphs]
  4780. 55.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  4781. 55.79 s [algebraic-graphs] OK: fromBipartite empty == empty
  4782. 55.79 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  4783. 55.79 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  4784. 55.79 s [algebraic-graphs]
  4785. 55.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  4786. 55.79 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  4787. 55.79 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  4788. 55.79 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  4789. 55.79 s [algebraic-graphs]
  4790. 55.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  4791. 55.79 s [algebraic-graphs] OK: isEmpty empty == True
  4792. 55.79 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  4793. 55.79 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  4794. 55.79 s [algebraic-graphs] OK: isEmpty == (==) empty
  4795. 55.79 s [algebraic-graphs]
  4796. 55.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  4797. 55.79 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  4798. 55.79 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  4799. 55.79 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  4800. 55.79 s [algebraic-graphs]
  4801. 55.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  4802. 55.79 s [algebraic-graphs] OK: hasRightVertex x empty == False
  4803. 55.79 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  4804. 55.79 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  4805. 55.79 s [algebraic-graphs]
  4806. 55.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  4807. 55.79 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  4808. 55.79 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  4809. 55.79 s [algebraic-graphs]
  4810. 55.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  4811. 55.79 s [algebraic-graphs] OK: hasEdge x y empty == False
  4812. 55.79 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  4813. 55.79 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  4814. 55.79 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  4815. 55.79 s [algebraic-graphs]
  4816. 55.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  4817. 55.79 s [algebraic-graphs] OK: leftVertexCount empty == 0
  4818. 55.79 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  4819. 55.79 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  4820. 55.79 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  4821. 55.79 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  4822. 55.79 s [algebraic-graphs]
  4823. 55.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  4824. 55.79 s [algebraic-graphs] OK: rightVertexCount empty == 0
  4825. 55.79 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  4826. 55.79 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  4827. 55.79 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  4828. 55.79 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  4829. 55.79 s [algebraic-graphs]
  4830. 55.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  4831. 55.80 s [algebraic-graphs] OK: vertexCount empty == 0
  4832. 55.80 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  4833. 55.80 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  4834. 55.80 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  4835. 55.80 s [algebraic-graphs]
  4836. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  4837. 55.80 s [algebraic-graphs] OK: edgeCount empty == 0
  4838. 55.80 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  4839. 55.80 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  4840. 55.80 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  4841. 55.80 s [algebraic-graphs]
  4842. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  4843. 55.80 s [algebraic-graphs] OK: leftVertexList empty == []
  4844. 55.80 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  4845. 55.80 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  4846. 55.80 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  4847. 55.80 s [algebraic-graphs]
  4848. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  4849. 55.80 s [algebraic-graphs] OK: rightVertexList empty == []
  4850. 55.80 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  4851. 55.80 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  4852. 55.80 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  4853. 55.80 s [algebraic-graphs]
  4854. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  4855. 55.80 s [algebraic-graphs] OK: vertexList empty == []
  4856. 55.80 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  4857. 55.80 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  4858. 55.80 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  4859. 55.80 s [algebraic-graphs]
  4860. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  4861. 55.80 s [algebraic-graphs] OK: edgeList empty == []
  4862. 55.80 s [algebraic-graphs] OK: edgeList (vertex x) == []
  4863. 55.80 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  4864. 55.80 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  4865. 55.80 s [algebraic-graphs]
  4866. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  4867. 55.80 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  4868. 55.80 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  4869. 55.80 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  4870. 55.80 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  4871. 55.80 s [algebraic-graphs]
  4872. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  4873. 55.80 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  4874. 55.80 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  4875. 55.80 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  4876. 55.80 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  4877. 55.80 s [algebraic-graphs]
  4878. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  4879. 55.80 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  4880. 55.80 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  4881. 55.80 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  4882. 55.80 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  4883. 55.80 s [algebraic-graphs]
  4884. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  4885. 55.80 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  4886. 55.80 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  4887. 55.80 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  4888. 55.80 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  4889. 55.80 s [algebraic-graphs]
  4890. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  4891. 55.80 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  4892. 55.80 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  4893. 55.80 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  4894. 55.80 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  4895. 55.80 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  4896. 55.80 s [algebraic-graphs]
  4897. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  4898. 55.80 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  4899. 55.80 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  4900. 55.80 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  4901. 55.80 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  4902. 55.80 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  4903. 55.80 s [algebraic-graphs]
  4904. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  4905. 55.80 s [algebraic-graphs] OK: evenList [] == Nil
  4906. 55.80 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  4907. 55.80 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  4908. 55.80 s [algebraic-graphs]
  4909. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  4910. 55.80 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  4911. 55.80 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  4912. 55.80 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  4913. 55.80 s [algebraic-graphs]
  4914. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  4915. 55.80 s [algebraic-graphs] OK: path Nil == empty
  4916. 55.80 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  4917. 55.80 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  4918. 55.80 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  4919. 55.80 s [algebraic-graphs]
  4920. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  4921. 55.80 s [algebraic-graphs] OK: circuit [] == empty
  4922. 55.80 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  4923. 55.80 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  4924. 55.80 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  4925. 55.80 s [algebraic-graphs]
  4926. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  4927. 55.80 s [algebraic-graphs] OK: biclique [] [] == empty
  4928. 55.80 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  4929. 55.80 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  4930. 55.80 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  4931. 55.80 s [algebraic-graphs]
  4932. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  4933. 55.80 s [algebraic-graphs] OK: star x [] == leftVertex x
  4934. 55.80 s [algebraic-graphs] OK: star x [y] == edge x y
  4935. 55.80 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  4936. 55.80 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  4937. 55.80 s [algebraic-graphs]
  4938. 55.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  4939. 55.80 s [algebraic-graphs] OK: stars [] == empty
  4940. 55.80 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  4941. 55.80 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  4942. 55.80 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  4943. 56.39 s [haskell-language-server] [4 of 4] Compiling Ide.Plugin.CallHierarchy ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy.p_o )
  4944. 62.47 s [haskell-language-server] Preprocessing executable 'ghcide-test-preprocessor' for haskell-language-server-2.12.0.0..
  4945. 62.47 s [haskell-language-server] Building executable 'ghcide-test-preprocessor' for haskell-language-server-2.12.0.0..
  4946. 62.60 s [haskell-language-server] [1 of 1] Compiling Main ( ghcide-test/preprocessor/Main.hs, dist/build/ghcide-test-preprocessor/ghcide-test-preprocessor-tmp/Main.dyn_o )
  4947. 62.82 s [haskell-language-server] [2 of 2] Linking dist/build/ghcide-test-preprocessor/ghcide-test-preprocessor
  4948. 63.23 s [haskell-language-server] Preprocessing library 'hls-code-range-plugin' for haskell-language-server-2.12.0.0..
  4949. 63.23 s [haskell-language-server] Building library 'hls-code-range-plugin' for haskell-language-server-2.12.0.0..
  4950. 63.32 s [haskell-language-server] [1 of 3] Compiling Ide.Plugin.CodeRange.ASTPreProcess ( plugins/hls-code-range-plugin/src/Ide/Plugin/CodeRange/ASTPreProcess.hs, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange/ASTPreProcess.o, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange/ASTPreProcess.dyn_o )
  4951. 64.29 s [haskell-language-server] [2 of 3] Compiling Ide.Plugin.CodeRange.Rules ( plugins/hls-code-range-plugin/src/Ide/Plugin/CodeRange/Rules.hs, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange/Rules.o, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange/Rules.dyn_o )
  4952. 65.64 s [haskell-language-server] [3 of 3] Compiling Ide.Plugin.CodeRange ( plugins/hls-code-range-plugin/src/Ide/Plugin/CodeRange.hs, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange.o, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange.dyn_o )
  4953. 65.87 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  4954. 65.87 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  4955. 65.87 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  4956. 65.87 s [algebraic-graphs]
  4957. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  4958. 65.87 s [algebraic-graphs] OK: mesh xs [] == empty
  4959. 65.87 s [algebraic-graphs] OK: mesh [] ys == empty
  4960. 65.87 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  4961. 65.87 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  4962. 65.87 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  4963. 65.87 s [algebraic-graphs]
  4964. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  4965. 65.87 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  4966. 65.87 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  4967. 65.87 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  4968. 65.87 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  4969. 65.87 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  4970. 65.87 s [algebraic-graphs]
  4971. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  4972. 65.87 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  4973. 65.87 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  4974. 65.87 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  4975. 65.87 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  4976. 65.87 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  4977. 65.87 s [algebraic-graphs]
  4978. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  4979. 65.87 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  4980. 65.87 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  4981. 65.87 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  4982. 65.87 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  4983. 65.87 s [algebraic-graphs]
  4984. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  4985. 65.87 s [algebraic-graphs] OK: bimap f g empty == empty
  4986. 65.87 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  4987. 65.87 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  4988. 65.87 s [algebraic-graphs] OK: bimap id id == id
  4989. 65.87 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  4990. 65.87 s [algebraic-graphs]
  4991. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  4992. 65.87 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  4993. 65.87 s [algebraic-graphs]
  4994. 65.87 s [algebraic-graphs] OK: box x y ~~ box y x
  4995. 65.87 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  4996. 65.87 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  4997. 65.87 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  4998. 65.87 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  4999. 65.87 s [algebraic-graphs] OK: box x empty ~~ empty
  5000. 65.87 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  5001. 65.87 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  5002. 65.87 s [algebraic-graphs]
  5003. 65.87 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  5004. 65.87 s [algebraic-graphs]
  5005. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  5006. 65.87 s [algebraic-graphs] OK: consistent empty == True
  5007. 65.87 s [algebraic-graphs] OK: consistent (vertex x) == True
  5008. 65.87 s [algebraic-graphs] OK: consistent (edge x y) == True
  5009. 65.87 s [algebraic-graphs] OK: consistent (edges x) == True
  5010. 65.87 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  5011. 65.87 s [algebraic-graphs] OK: consistent (swap x) == True
  5012. 65.87 s [algebraic-graphs] OK: consistent (circuit xs) == True
  5013. 65.87 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  5014. 65.87 s [algebraic-graphs]
  5015. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  5016. 65.87 s [algebraic-graphs] OK: detectParts empty == Right empty
  5017. 65.87 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  5018. 65.87 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  5019. 65.87 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  5020. 65.87 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  5021. 65.87 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  5022. 65.87 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  5023. 65.87 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  5024. 65.87 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  5025. 65.87 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  5026. 65.87 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  5027. 65.87 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  5028. 65.87 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  5029. 65.87 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  5030. 65.87 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  5031. 65.87 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  5032. 65.87 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  5033. 65.87 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  5034. 65.87 s [algebraic-graphs]
  5035. 65.87 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  5036. 65.87 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  5037. 65.87 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  5038. 65.87 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  5039. 65.87 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  5040. 65.87 s [algebraic-graphs]
  5041. 65.87 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  5042. 65.87 s [algebraic-graphs] OK: show (matching []) == "matching []"
  5043. 65.87 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  5044. 65.87 s [algebraic-graphs]
  5045. 65.87 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  5046. 65.87 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  5047. 65.87 s [algebraic-graphs]
  5048. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  5049. 65.87 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  5050. 65.87 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  5051. 65.87 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  5052. 65.87 s [algebraic-graphs]
  5053. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  5054. 65.87 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  5055. 65.87 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  5056. 65.87 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  5057. 65.87 s [algebraic-graphs]
  5058. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  5059. 65.87 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  5060. 65.87 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  5061. 65.87 s [algebraic-graphs]
  5062. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  5063. 65.87 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  5064. 65.87 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  5065. 65.87 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  5066. 65.87 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  5067. 65.87 s [algebraic-graphs]
  5068. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  5069. 65.87 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  5070. 65.87 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  5071. 65.87 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  5072. 65.87 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  5073. 65.87 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  5074. 65.87 s [algebraic-graphs]
  5075. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  5076. 65.87 s [algebraic-graphs] OK: maxMatching empty == matching []
  5077. 65.87 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  5078. 65.87 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  5079. 65.87 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  5080. 65.87 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  5081. 65.87 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  5082. 65.87 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  5083. 65.87 s [algebraic-graphs]
  5084. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  5085. 65.87 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  5086. 65.87 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  5087. 65.87 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  5088. 65.87 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  5089. 65.87 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  5090. 65.87 s [algebraic-graphs]
  5091. 65.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  5092. 65.87 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  5093. 66.14 s [haskell-language-server] [1 of 3] Compiling Ide.Plugin.CodeRange.ASTPreProcess ( plugins/hls-code-range-plugin/src/Ide/Plugin/CodeRange/ASTPreProcess.hs, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange/ASTPreProcess.p_o )
  5094. 67.21 s [haskell-language-server] [2 of 3] Compiling Ide.Plugin.CodeRange.Rules ( plugins/hls-code-range-plugin/src/Ide/Plugin/CodeRange/Rules.hs, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange/Rules.p_o )
  5095. 67.84 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  5096. 67.84 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  5097. 67.91 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  5098. 67.91 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  5099. 67.91 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  5100. 67.91 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  5101. 67.91 s [algebraic-graphs]
  5102. 67.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  5103. 67.91 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  5104. 67.91 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  5105. 67.91 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  5106. 67.91 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  5107. 67.91 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  5108. 67.91 s [algebraic-graphs]
  5109. 67.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  5110. 67.91 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  5111. 67.91 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  5112. 67.91 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  5113. 67.91 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  5114. 67.92 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  5115. 67.92 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  5116. 67.92 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  5117. 67.92 s [algebraic-graphs]
  5118. 67.92 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  5119. 67.92 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  5120. 67.92 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  5121. 67.92 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  5122. 67.92 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  5123. 67.92 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  5124. 67.92 s [algebraic-graphs]
  5125. 67.92 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  5126. 67.92 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  5127. 67.92 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  5128. 67.92 s [algebraic-graphs]
  5129. 67.92 s [algebraic-graphs] ============ Export.Eq ============
  5130. 67.92 s [algebraic-graphs] OK: mempty /= literal ""
  5131. 67.92 s [algebraic-graphs]
  5132. 67.92 s [algebraic-graphs] ============ Export.Ord ============
  5133. 67.92 s [algebraic-graphs] OK: mempty < literal ""
  5134. 67.92 s [algebraic-graphs]
  5135. 67.92 s [algebraic-graphs] ============ Export.isEmpty ============
  5136. 67.92 s [algebraic-graphs] OK: isEmpty mempty == True
  5137. 67.92 s [algebraic-graphs] OK: isEmpty (literal "") == False
  5138. 67.92 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  5139. 67.92 s [algebraic-graphs]
  5140. 67.92 s [algebraic-graphs] ============ Export.literal ============
  5141. 67.92 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  5142. 67.92 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  5143. 67.92 s [algebraic-graphs] OK: render . literal == id
  5144. 67.92 s [algebraic-graphs]
  5145. 67.92 s [algebraic-graphs] ============ Export.render ============
  5146. 67.92 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  5147. 67.92 s [algebraic-graphs] OK: render mempty == mempty
  5148. 67.92 s [algebraic-graphs]
  5149. 67.92 s [algebraic-graphs] ============ Export.<+> ============
  5150. 67.92 s [algebraic-graphs] OK: x <+> mempty == x
  5151. 67.92 s [algebraic-graphs] OK: mempty <+> x == x
  5152. 67.92 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  5153. 67.92 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  5154. 67.92 s [algebraic-graphs]
  5155. 67.92 s [algebraic-graphs] ============ Export.brackets ============
  5156. 67.92 s [algebraic-graphs] OK: brackets "i" == "[i]"
  5157. 67.92 s [algebraic-graphs] OK: brackets mempty == "[]"
  5158. 67.92 s [algebraic-graphs]
  5159. 67.92 s [algebraic-graphs] ============ Export.doubleQuotes ============
  5160. 67.92 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  5161. 67.92 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  5162. 67.92 s [algebraic-graphs]
  5163. 67.92 s [algebraic-graphs] ============ Export.indent ============
  5164. 67.92 s [algebraic-graphs] OK: indent 0 == id
  5165. 67.92 s [algebraic-graphs] OK: indent 1 mempty == " "
  5166. 67.92 s [algebraic-graphs]
  5167. 67.92 s [algebraic-graphs] ============ Export.unlines ============
  5168. 67.92 s [algebraic-graphs] OK: unlines [] == mempty
  5169. 67.92 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  5170. 67.92 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  5171. 67.92 s [algebraic-graphs]
  5172. 67.92 s [algebraic-graphs] ============ Export.export ============
  5173. 67.92 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  5174. 67.92 s [algebraic-graphs]
  5175. 67.92 s [algebraic-graphs] ============ Export.Dot.export ============
  5176. 67.92 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  5177. 67.92 s [algebraic-graphs]
  5178. 67.92 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  5179. 67.92 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  5180. 67.92 s [algebraic-graphs]
  5181. 67.92 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  5182. 67.92 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  5183. 67.92 s [algebraic-graphs]
  5184. 67.92 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  5185. 67.92 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  5186. 67.92 s [algebraic-graphs]
  5187. 67.92 s [algebraic-graphs] ============ Graph ============
  5188. 67.92 s [algebraic-graphs] OK: Axioms of graphs
  5189. 67.92 s [algebraic-graphs] OK: Theorems of graphs
  5190. 67.92 s [algebraic-graphs]
  5191. 67.92 s [algebraic-graphs] ============ Graph.Ord ============
  5192. 67.92 s [algebraic-graphs] OK: vertex 1 < vertex 2
  5193. 67.92 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  5194. 67.92 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  5195. 67.92 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  5196. 67.92 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  5197. 67.92 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  5198. 67.92 s [algebraic-graphs] OK: x <= x + y
  5199. 67.92 s [algebraic-graphs] OK: x + y <= x * y
  5200. 67.92 s [algebraic-graphs]
  5201. 67.92 s [algebraic-graphs] ============ Graph.empty ============
  5202. 67.92 s [algebraic-graphs] OK: isEmpty empty == True
  5203. 67.92 s [algebraic-graphs] OK: hasVertex x empty == False
  5204. 67.92 s [algebraic-graphs] OK: vertexCount empty == 0
  5205. 67.92 s [algebraic-graphs] OK: edgeCount empty == 0
  5206. 67.92 s [algebraic-graphs]
  5207. 67.92 s [algebraic-graphs] ============ Graph.vertex ============
  5208. 67.92 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  5209. 67.92 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  5210. 67.92 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  5211. 67.92 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  5212. 67.92 s [algebraic-graphs]
  5213. 67.92 s [algebraic-graphs] ============ Graph.edge ============
  5214. 67.92 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  5215. 67.92 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  5216. 67.92 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  5217. 67.92 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  5218. 67.92 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  5219. 67.92 s [algebraic-graphs]
  5220. 67.92 s [algebraic-graphs] ============ Graph.overlay ============
  5221. 67.92 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  5222. 67.92 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  5223. 67.92 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  5224. 67.92 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  5225. 67.92 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  5226. 67.92 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  5227. 67.92 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  5228. 67.92 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  5229. 67.92 s [algebraic-graphs]
  5230. 67.92 s [algebraic-graphs] ============ Graph.connect ============
  5231. 67.92 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  5232. 67.92 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  5233. 67.92 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  5234. 67.92 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  5235. 67.92 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  5236. 67.92 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  5237. 67.92 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  5238. 67.92 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  5239. 67.92 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  5240. 67.92 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  5241. 67.92 s [algebraic-graphs]
  5242. 67.92 s [algebraic-graphs] ============ Graph.vertices ============
  5243. 67.92 s [algebraic-graphs] OK: vertices [] == empty
  5244. 67.92 s [algebraic-graphs] OK: vertices [x] == vertex x
  5245. 67.92 s [algebraic-graphs] OK: vertices == overlays . map vertex
  5246. 67.92 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  5247. 67.92 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  5248. 67.92 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  5249. 67.92 s [algebraic-graphs]
  5250. 67.92 s [algebraic-graphs] ============ Graph.edges ============
  5251. 67.92 s [algebraic-graphs] OK: edges [] == empty
  5252. 67.92 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  5253. 67.92 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  5254. 67.92 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  5255. 67.92 s [algebraic-graphs]
  5256. 67.92 s [algebraic-graphs] ============ Graph.overlays ============
  5257. 67.92 s [algebraic-graphs] OK: overlays [] == empty
  5258. 67.92 s [algebraic-graphs] OK: overlays [x] == x
  5259. 67.92 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  5260. 67.92 s [algebraic-graphs] OK: overlays == foldr overlay empty
  5261. 67.92 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  5262. 67.92 s [algebraic-graphs]
  5263. 67.92 s [algebraic-graphs] ============ Graph.connects ============
  5264. 67.92 s [algebraic-graphs] OK: connects [] == empty
  5265. 67.92 s [algebraic-graphs] OK: connects [x] == x
  5266. 67.92 s [algebraic-graphs] OK: connects [x,y] == connect x y
  5267. 67.92 s [algebraic-graphs] OK: connects == foldr connect empty
  5268. 67.92 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  5269. 67.92 s [algebraic-graphs]
  5270. 67.92 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  5271. 67.92 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  5272. 67.92 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  5273. 67.92 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  5274. 67.92 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  5275. 67.92 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  5276. 67.92 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  5277. 67.92 s [algebraic-graphs]
  5278. 67.92 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  5279. 67.92 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  5280. 67.92 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  5281. 67.92 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  5282. 67.92 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  5283. 67.92 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  5284. 67.92 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  5285. 67.92 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  5286. 67.92 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  5287. 67.92 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  5288. 68.32 s [haskell-language-server] [3 of 3] Compiling Ide.Plugin.CodeRange ( plugins/hls-code-range-plugin/src/Ide/Plugin/CodeRange.hs, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange.p_o )
  5289. 68.45 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  5290. 68.45 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  5291. 68.45 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  5292. 68.45 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  5293. 68.45 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  5294. 68.45 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  5295. 68.45 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  5296. 68.45 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  5297. 68.45 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  5298. 68.45 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  5299. 68.45 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  5300. 68.45 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  5301. 68.45 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  5302. 68.45 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  5303. 68.45 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  5304. 68.45 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  5305. 68.45 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  5306. 68.45 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  5307. 68.45 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  5308. 68.45 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  5309. 68.45 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  5310. 68.45 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  5311. 68.45 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  5312. 68.45 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  5313. 68.45 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  5314. 68.45 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  5315. 68.45 s [algebraic-graphs]
  5316. 68.45 s [algebraic-graphs] ============ Graph.foldg ============
  5317. 68.45 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  5318. 68.45 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  5319. 68.45 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  5320. 68.45 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  5321. 68.45 s [algebraic-graphs]
  5322. 68.45 s [algebraic-graphs] ============ Graph.isEmpty ============
  5323. 68.46 s [algebraic-graphs] OK: isEmpty empty == True
  5324. 68.46 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  5325. 68.46 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  5326. 68.46 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  5327. 68.46 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  5328. 68.46 s [algebraic-graphs]
  5329. 68.46 s [algebraic-graphs] ============ Graph.hasVertex ============
  5330. 68.46 s [algebraic-graphs] OK: hasVertex x empty == False
  5331. 68.46 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  5332. 68.46 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  5333. 68.46 s [algebraic-graphs]
  5334. 68.46 s [algebraic-graphs] ============ Graph.hasEdge ============
  5335. 68.46 s [algebraic-graphs] OK: hasEdge x y empty == False
  5336. 68.46 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  5337. 68.46 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  5338. 68.46 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  5339. 68.46 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  5340. 68.46 s [algebraic-graphs]
  5341. 68.46 s [algebraic-graphs] ============ Graph.vertexCount ============
  5342. 68.46 s [algebraic-graphs] OK: vertexCount empty == 0
  5343. 68.46 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  5344. 68.46 s [algebraic-graphs] OK: vertexCount == length . vertexList
  5345. 68.46 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  5346. 68.46 s [algebraic-graphs]
  5347. 68.46 s [algebraic-graphs] ============ Graph.edgeCount ============
  5348. 68.46 s [algebraic-graphs] OK: edgeCount empty == 0
  5349. 68.46 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  5350. 68.46 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  5351. 68.46 s [algebraic-graphs] OK: edgeCount == length . edgeList
  5352. 68.46 s [algebraic-graphs]
  5353. 68.46 s [algebraic-graphs] ============ Graph.vertexList ============
  5354. 68.46 s [algebraic-graphs] OK: vertexList empty == []
  5355. 68.46 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  5356. 68.46 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  5357. 68.46 s [algebraic-graphs]
  5358. 68.46 s [algebraic-graphs] ============ Graph.vertexSet ============
  5359. 68.46 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  5360. 68.46 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  5361. 68.46 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  5362. 68.46 s [algebraic-graphs]
  5363. 68.46 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  5364. 68.46 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  5365. 68.46 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  5366. 68.46 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  5367. 68.46 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  5368. 68.46 s [algebraic-graphs]
  5369. 68.46 s [algebraic-graphs] ============ Graph.edgeList ============
  5370. 68.46 s [algebraic-graphs] OK: edgeList empty == []
  5371. 68.46 s [algebraic-graphs] OK: edgeList (vertex x) == []
  5372. 68.46 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  5373. 68.46 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  5374. 68.46 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  5375. 68.46 s [algebraic-graphs]
  5376. 68.46 s [algebraic-graphs] ============ Graph.edgeSet ============
  5377. 68.46 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  5378. 68.46 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  5379. 68.46 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  5380. 68.46 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  5381. 68.46 s [algebraic-graphs]
  5382. 68.46 s [algebraic-graphs] ============ Graph.adjacencyList ============
  5383. 68.46 s [algebraic-graphs] OK: adjacencyList empty == []
  5384. 68.46 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  5385. 68.46 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  5386. 68.46 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  5387. 68.46 s [algebraic-graphs]
  5388. 68.46 s [algebraic-graphs] ============ Graph.preSet ============
  5389. 68.46 s [algebraic-graphs] OK: preSet x empty == Set.empty
  5390. 68.46 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  5391. 68.46 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  5392. 68.46 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  5393. 68.46 s [algebraic-graphs]
  5394. 68.46 s [algebraic-graphs] ============ Graph.preIntSet ============
  5395. 68.46 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  5396. 68.46 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  5397. 68.46 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  5398. 68.46 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  5399. 68.46 s [algebraic-graphs]
  5400. 68.46 s [algebraic-graphs] ============ Graph.postSet ============
  5401. 68.46 s [algebraic-graphs] OK: postSet x empty == Set.empty
  5402. 68.46 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  5403. 68.46 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  5404. 68.46 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  5405. 68.46 s [algebraic-graphs]
  5406. 68.46 s [algebraic-graphs] ============ Graph.postIntSet ============
  5407. 68.46 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  5408. 68.46 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  5409. 68.46 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  5410. 68.46 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  5411. 68.46 s [algebraic-graphs]
  5412. 68.46 s [algebraic-graphs] ============ Graph.size ============
  5413. 68.46 s [algebraic-graphs] OK: size empty == 1
  5414. 68.46 s [algebraic-graphs] OK: size (vertex x) == 1
  5415. 68.46 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  5416. 68.46 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  5417. 68.46 s [algebraic-graphs] OK: size x >= 1
  5418. 68.46 s [algebraic-graphs] OK: size x >= vertexCount x
  5419. 68.46 s [algebraic-graphs]
  5420. 68.46 s [algebraic-graphs] ============ Graph.path ============
  5421. 68.46 s [algebraic-graphs] OK: path [] == empty
  5422. 68.46 s [algebraic-graphs] OK: path [x] == vertex x
  5423. 68.46 s [algebraic-graphs] OK: path [x,y] == edge x y
  5424. 68.46 s [algebraic-graphs]
  5425. 68.46 s [algebraic-graphs] ============ Graph.circuit ============
  5426. 68.46 s [algebraic-graphs] OK: circuit [] == empty
  5427. 68.46 s [algebraic-graphs] OK: circuit [x] == edge x x
  5428. 68.46 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  5429. 68.46 s [algebraic-graphs]
  5430. 68.46 s [algebraic-graphs] ============ Graph.clique ============
  5431. 68.46 s [algebraic-graphs] OK: clique [] == empty
  5432. 68.46 s [algebraic-graphs] OK: clique [x] == vertex x
  5433. 68.46 s [algebraic-graphs] OK: clique [x,y] == edge x y
  5434. 68.46 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  5435. 68.46 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  5436. 68.46 s [algebraic-graphs]
  5437. 68.46 s [algebraic-graphs] ============ Graph.biclique ============
  5438. 68.46 s [algebraic-graphs] OK: biclique [] [] == empty
  5439. 68.46 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  5440. 68.46 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  5441. 68.46 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  5442. 68.46 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  5443. 68.46 s [algebraic-graphs]
  5444. 68.46 s [algebraic-graphs] ============ Graph.star ============
  5445. 68.46 s [algebraic-graphs] OK: star x [] == vertex x
  5446. 68.46 s [algebraic-graphs] OK: star x [y] == edge x y
  5447. 68.46 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  5448. 68.46 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  5449. 68.46 s [algebraic-graphs]
  5450. 68.46 s [algebraic-graphs] ============ Graph.stars ============
  5451. 68.46 s [algebraic-graphs] OK: stars [] == empty
  5452. 68.46 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  5453. 68.46 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  5454. 68.46 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  5455. 68.46 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  5456. 68.46 s [algebraic-graphs] OK: stars . adjacencyList == id
  5457. 68.46 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  5458. 68.46 s [algebraic-graphs]
  5459. 68.46 s [algebraic-graphs] ============ Graph.tree ============
  5460. 68.46 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  5461. 68.46 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  5462. 68.46 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  5463. 68.46 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  5464. 68.46 s [algebraic-graphs]
  5465. 68.46 s [algebraic-graphs] ============ Graph.forest ============
  5466. 68.46 s [algebraic-graphs] OK: forest [] == empty
  5467. 68.46 s [algebraic-graphs] OK: forest [x] == tree x
  5468. 68.46 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  5469. 68.46 s [algebraic-graphs] OK: forest == overlays . map tree
  5470. 68.46 s [algebraic-graphs]
  5471. 68.46 s [algebraic-graphs] ============ Graph.removeVertex ============
  5472. 71.56 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  5473. 71.56 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  5474. 71.56 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  5475. 71.56 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  5476. 71.56 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  5477. 71.56 s [algebraic-graphs]
  5478. 71.56 s [algebraic-graphs] ============ Graph.removeEdge ============
  5479. 71.56 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  5480. 71.56 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  5481. 71.56 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  5482. 71.56 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  5483. 71.56 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  5484. 71.56 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  5485. 71.56 s [algebraic-graphs]
  5486. 71.56 s [algebraic-graphs] ============ Graph.replaceVertex ============
  5487. 71.56 s [algebraic-graphs] OK: replaceVertex x x == id
  5488. 71.56 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  5489. 71.56 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  5490. 71.56 s [algebraic-graphs]
  5491. 71.56 s [algebraic-graphs] ============ Graph.mergeVertices ============
  5492. 71.56 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  5493. 71.56 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  5494. 71.56 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  5495. 71.56 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  5496. 71.56 s [algebraic-graphs]
  5497. 71.56 s [algebraic-graphs] ============ Graph.transpose ============
  5498. 71.56 s [algebraic-graphs] OK: transpose empty == empty
  5499. 71.56 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  5500. 71.56 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  5501. 71.56 s [algebraic-graphs] OK: transpose . transpose == id
  5502. 71.56 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  5503. 71.56 s [algebraic-graphs]
  5504. 71.56 s [algebraic-graphs] ============ Graph.gmap ============
  5505. 71.56 s [algebraic-graphs] OK: gmap f empty == empty
  5506. 71.56 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  5507. 71.56 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  5508. 71.56 s [algebraic-graphs] OK: gmap id == id
  5509. 71.56 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  5510. 71.56 s [algebraic-graphs]
  5511. 71.56 s [algebraic-graphs] ============ Graph.induce ============
  5512. 71.56 s [algebraic-graphs] OK: induce (const True ) x == x
  5513. 71.56 s [algebraic-graphs] OK: induce (const False) x == empty
  5514. 71.56 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  5515. 71.56 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  5516. 71.56 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  5517. 71.56 s [algebraic-graphs]
  5518. 71.56 s [algebraic-graphs] ============ Graph.induceJust ============
  5519. 71.56 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  5520. 71.56 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  5521. 71.56 s [algebraic-graphs] OK: induceJust . gmap Just == id
  5522. 71.56 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  5523. 71.56 s [algebraic-graphs]
  5524. 71.56 s [algebraic-graphs] ============ Graph.compose ============
  5525. 71.56 s [algebraic-graphs] OK: compose empty x == empty
  5526. 71.56 s [algebraic-graphs] OK: compose x empty == empty
  5527. 71.56 s [algebraic-graphs] OK: compose (vertex x) y == empty
  5528. 71.56 s [algebraic-graphs] OK: compose x (vertex y) == empty
  5529. 71.56 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  5530. 71.56 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  5531. 71.56 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  5532. 71.56 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  5533. 71.56 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  5534. 71.56 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  5535. 71.56 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  5536. 71.56 s [algebraic-graphs]
  5537. 71.56 s [algebraic-graphs] ============ Graph.(===) ============
  5538. 71.56 s [algebraic-graphs] OK: x === x == True
  5539. 71.56 s [algebraic-graphs] OK: x === x + empty == False
  5540. 71.56 s [algebraic-graphs] OK: x + y === x + y == True
  5541. 71.56 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  5542. 71.56 s [algebraic-graphs] OK: x + y === x * y == False
  5543. 71.56 s [algebraic-graphs]
  5544. 71.56 s [algebraic-graphs] ============ Graph.mesh ============
  5545. 71.56 s [algebraic-graphs] OK: mesh xs [] == empty
  5546. 71.56 s [algebraic-graphs] OK: mesh [] ys == empty
  5547. 71.56 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  5548. 71.56 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  5549. 71.56 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  5550. 71.56 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  5551. 71.56 s [algebraic-graphs]
  5552. 71.56 s [algebraic-graphs] ============ Graph.torus ============
  5553. 71.56 s [algebraic-graphs] OK: torus xs [] == empty
  5554. 71.56 s [algebraic-graphs] OK: torus [] ys == empty
  5555. 71.56 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  5556. 71.56 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  5557. 71.56 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  5558. 71.56 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  5559. 71.56 s [algebraic-graphs]
  5560. 71.56 s [algebraic-graphs] ============ Graph.deBruijn ============
  5561. 71.56 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  5562. 71.56 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  5563. 71.56 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  5564. 71.56 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  5565. 71.56 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  5566. 71.56 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  5567. 71.56 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  5568. 71.56 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  5569. 71.56 s [algebraic-graphs]
  5570. 71.56 s [algebraic-graphs] ============ Graph.splitVertex ============
  5571. 71.56 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  5572. 71.56 s [algebraic-graphs] OK: splitVertex x [x] == id
  5573. 71.56 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  5574. 71.56 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  5575. 71.56 s [algebraic-graphs]
  5576. 71.56 s [algebraic-graphs] ============ Graph.bind ============
  5577. 71.56 s [algebraic-graphs] OK: bind empty f == empty
  5578. 71.56 s [algebraic-graphs] OK: bind (vertex x) f == f x
  5579. 71.56 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  5580. 71.56 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  5581. 71.56 s [algebraic-graphs] OK: bind x (const empty) == empty
  5582. 71.56 s [algebraic-graphs] OK: bind x vertex == x
  5583. 71.56 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  5584. 71.56 s [algebraic-graphs]
  5585. 71.56 s [algebraic-graphs] ============ Graph.simplify ============
  5586. 71.56 s [algebraic-graphs] OK: simplify == id
  5587. 71.56 s [algebraic-graphs] OK: size (simplify x) <= size x
  5588. 71.56 s [algebraic-graphs]
  5589. 71.56 s [algebraic-graphs] ============ Graph.box ============
  5590. 71.56 s [algebraic-graphs] OK: box x y ~~ box y x
  5591. 71.56 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  5592. 71.56 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  5593. 71.56 s [algebraic-graphs] OK: box x empty ~~ empty
  5594. 71.56 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  5595. 71.56 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  5596. 71.56 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  5597. 71.56 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  5598. 71.56 s [algebraic-graphs]
  5599. 71.56 s [algebraic-graphs] ============ Graph.sparsify ============
  5600. 71.56 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  5601. 71.56 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  5602. 71.56 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  5603. 71.56 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  5604. 71.56 s [algebraic-graphs]
  5605. 71.56 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  5606. 71.56 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  5607. 71.56 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  5608. 71.56 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  5609. 71.56 s [algebraic-graphs]
  5610. 71.56 s [algebraic-graphs] ============ Graph.context ============
  5611. 71.56 s [algebraic-graphs] OK: context (const False) x == Nothing
  5612. 71.56 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  5613. 71.57 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  5614. 71.57 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  5615. 71.57 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  5616. 71.57 s [algebraic-graphs]
  5617. 71.57 s [algebraic-graphs] ============ Graph.buildg ============
  5618. 71.57 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  5619. 71.57 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  5620. 71.57 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
  5621. 71.57 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
  5622. 71.57 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  5623. 71.57 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  5624. 71.57 s [algebraic-graphs]
  5625. 71.57 s [algebraic-graphs] ============ Internal.List ============
  5626. 71.57 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  5627. 71.57 s [algebraic-graphs]
  5628. 71.57 s [algebraic-graphs] ============ Graph.Label ============
  5629. 71.57 s [algebraic-graphs]
  5630. 71.57 s [algebraic-graphs] ============ Any: instances ============
  5631. 71.57 s [algebraic-graphs] OK: Semiring
  5632. 71.57 s [algebraic-graphs] OK: StarSemiring
  5633. 71.57 s [algebraic-graphs] OK: Dioid
  5634. 71.57 s [algebraic-graphs]
  5635. 71.57 s [algebraic-graphs] ============ Distance Int: instances ============
  5636. 71.57 s [algebraic-graphs] OK: Semiring
  5637. 71.57 s [algebraic-graphs] OK: StarSemiring
  5638. 71.57 s [algebraic-graphs] OK: Dioid
  5639. 71.57 s [algebraic-graphs]
  5640. 71.57 s [algebraic-graphs] ============ Capacity Int: instances ============
  5641. 71.57 s [algebraic-graphs] OK: Semiring
  5642. 71.57 s [algebraic-graphs] OK: StarSemiring
  5643. 71.57 s [algebraic-graphs] OK: Dioid
  5644. 71.57 s [algebraic-graphs]
  5645. 71.57 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  5646. 71.57 s [algebraic-graphs] OK: LeftNearRing
  5647. 71.57 s [algebraic-graphs]
  5648. 71.57 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  5649. 71.57 s [algebraic-graphs] OK: Semiring
  5650. 71.57 s [algebraic-graphs] OK: Dioid
  5651. 71.57 s [algebraic-graphs]
  5652. 71.57 s [algebraic-graphs] ============ Count Int: instances ============
  5653. 71.57 s [algebraic-graphs] OK: Semiring
  5654. 71.57 s [algebraic-graphs] OK: StarSemiring
  5655. 71.57 s [algebraic-graphs]
  5656. 71.57 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  5657. 71.57 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  5658. 71.57 s [algebraic-graphs] OK: empty
  5659. 71.57 s [algebraic-graphs] OK: vertex
  5660. 71.57 s [algebraic-graphs] OK: edge
  5661. 71.57 s [algebraic-graphs] OK: overlay
  5662. 71.57 s [algebraic-graphs] OK: connect
  5663. 71.57 s [algebraic-graphs] OK: vertices
  5664. 71.57 s [algebraic-graphs] OK: edges
  5665. 71.57 s [algebraic-graphs] OK: overlays
  5666. 71.57 s [algebraic-graphs] OK: fromAdjacencyMaps
  5667. 71.57 s [algebraic-graphs] OK: removeVertex
  5668. 71.57 s [algebraic-graphs] OK: removeEdge
  5669. 71.57 s [algebraic-graphs] OK: replaceVertex
  5670. 71.57 s [algebraic-graphs] OK: replaceEdge
  5671. 71.57 s [algebraic-graphs] OK: transpose
  5672. 71.57 s [algebraic-graphs] OK: gmap
  5673. 71.57 s [algebraic-graphs] OK: emap
  5674. 71.57 s [algebraic-graphs] OK: induce
  5675. 71.57 s [algebraic-graphs] OK: closure
  5676. 71.57 s [algebraic-graphs] OK: reflexiveClosure
  5677. 71.57 s [algebraic-graphs] OK: symmetricClosure
  5678. 71.57 s [algebraic-graphs] OK: transitiveClosure
  5679. 71.57 s [algebraic-graphs]
  5680. 71.57 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  5681. 71.57 s [algebraic-graphs] OK: isEmpty empty == True
  5682. 71.57 s [algebraic-graphs] OK: hasVertex x empty == False
  5683. 71.57 s [algebraic-graphs] OK: vertexCount empty == 0
  5684. 71.57 s [algebraic-graphs] OK: edgeCount empty == 0
  5685. 71.57 s [algebraic-graphs]
  5686. 71.57 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  5687. 71.57 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  5688. 71.57 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  5689. 71.57 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  5690. 71.57 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  5691. 71.57 s [algebraic-graphs]
  5692. 73.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  5693. 73.95 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  5694. 73.95 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  5695. 73.95 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  5696. 73.95 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  5697. 73.95 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  5698. 73.95 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  5699. 73.95 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  5700. 73.95 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  5701. 73.95 s [algebraic-graphs]
  5702. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  5703. 73.95 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  5704. 73.95 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  5705. 73.95 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  5706. 73.95 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  5707. 73.95 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  5708. 73.95 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  5709. 73.95 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  5710. 73.95 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  5711. 73.95 s [algebraic-graphs]
  5712. 73.95 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  5713. 73.95 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  5714. 73.95 s [algebraic-graphs]
  5715. 73.95 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  5716. 73.95 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  5717. 73.95 s [algebraic-graphs]
  5718. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  5719. 73.95 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  5720. 73.95 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  5721. 73.95 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  5722. 73.95 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  5723. 73.95 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  5724. 73.95 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  5725. 73.95 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  5726. 73.95 s [algebraic-graphs]
  5727. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  5728. 73.95 s [algebraic-graphs] OK: vertices [] == empty
  5729. 73.95 s [algebraic-graphs] OK: vertices [x] == vertex x
  5730. 73.95 s [algebraic-graphs] OK: vertices == overlays . map vertex
  5731. 73.95 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  5732. 73.95 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  5733. 73.95 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  5734. 73.95 s [algebraic-graphs]
  5735. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  5736. 73.95 s [algebraic-graphs] OK: edges [] == empty
  5737. 73.95 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  5738. 73.95 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  5739. 73.95 s [algebraic-graphs]
  5740. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  5741. 73.95 s [algebraic-graphs] OK: overlays [] == empty
  5742. 73.95 s [algebraic-graphs] OK: overlays [x] == x
  5743. 73.95 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  5744. 73.95 s [algebraic-graphs] OK: overlays == foldr overlay empty
  5745. 73.95 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  5746. 73.95 s [algebraic-graphs]
  5747. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  5748. 73.95 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  5749. 73.95 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  5750. 73.95 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  5751. 73.95 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  5752. 73.95 s [algebraic-graphs]
  5753. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  5754. 73.95 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  5755. 73.95 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  5756. 73.95 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  5757. 73.95 s [algebraic-graphs]
  5758. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  5759. 73.95 s [algebraic-graphs] OK: isEmpty empty == True
  5760. 73.95 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  5761. 73.95 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  5762. 73.95 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  5763. 73.95 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  5764. 73.95 s [algebraic-graphs]
  5765. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  5766. 73.95 s [algebraic-graphs] OK: hasVertex x empty == False
  5767. 73.95 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  5768. 73.95 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  5769. 73.95 s [algebraic-graphs]
  5770. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  5771. 73.95 s [algebraic-graphs] OK: hasEdge x y empty == False
  5772. 73.95 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  5773. 73.95 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  5774. 73.95 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  5775. 73.95 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  5776. 73.95 s [algebraic-graphs]
  5777. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  5778. 73.95 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  5779. 73.95 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  5780. 73.95 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  5781. 73.95 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  5782. 73.95 s [algebraic-graphs]
  5783. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  5784. 73.95 s [algebraic-graphs] OK: vertexCount empty == 0
  5785. 73.95 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  5786. 73.95 s [algebraic-graphs] OK: vertexCount == length . vertexList
  5787. 73.95 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  5788. 73.95 s [algebraic-graphs]
  5789. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  5790. 73.95 s [algebraic-graphs] OK: edgeCount empty == 0
  5791. 73.95 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  5792. 73.95 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  5793. 73.95 s [algebraic-graphs] OK: edgeCount == length . edgeList
  5794. 73.95 s [algebraic-graphs]
  5795. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  5796. 73.95 s [algebraic-graphs] OK: vertexList empty == []
  5797. 73.95 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  5798. 73.95 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  5799. 73.95 s [algebraic-graphs]
  5800. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  5801. 73.95 s [algebraic-graphs] OK: edgeList empty == []
  5802. 73.95 s [algebraic-graphs] OK: edgeList (vertex x) == []
  5803. 73.95 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  5804. 73.95 s [algebraic-graphs]
  5805. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  5806. 73.95 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  5807. 73.95 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  5808. 73.95 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  5809. 73.95 s [algebraic-graphs]
  5810. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  5811. 73.95 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  5812. 73.95 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  5813. 73.95 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  5814. 73.95 s [algebraic-graphs]
  5815. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  5816. 73.95 s [algebraic-graphs] OK: preSet x empty == Set.empty
  5817. 73.95 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  5818. 73.95 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  5819. 73.95 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  5820. 73.95 s [algebraic-graphs]
  5821. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  5822. 73.95 s [algebraic-graphs] OK: postSet x empty == Set.empty
  5823. 73.95 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  5824. 73.95 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  5825. 73.95 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  5826. 73.95 s [algebraic-graphs]
  5827. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  5828. 73.95 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  5829. 73.95 s [algebraic-graphs]
  5830. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  5831. 73.95 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  5832. 73.95 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  5833. 73.95 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  5834. 73.95 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  5835. 73.95 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  5836. 73.95 s [algebraic-graphs]
  5837. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  5838. 73.95 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  5839. 73.95 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  5840. 73.95 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  5841. 73.95 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  5842. 73.95 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  5843. 73.95 s [algebraic-graphs]
  5844. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  5845. 73.95 s [algebraic-graphs] OK: replaceVertex x x == id
  5846. 73.95 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  5847. 73.95 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  5848. 73.95 s [algebraic-graphs]
  5849. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  5850. 73.95 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  5851. 73.95 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  5852. 73.95 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  5853. 73.95 s [algebraic-graphs]
  5854. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  5855. 73.95 s [algebraic-graphs] OK: transpose empty == empty
  5856. 73.95 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  5857. 73.95 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  5858. 73.95 s [algebraic-graphs] OK: transpose . transpose == id
  5859. 73.95 s [algebraic-graphs]
  5860. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  5861. 73.95 s [algebraic-graphs] OK: gmap f empty == empty
  5862. 73.95 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  5863. 73.95 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  5864. 73.95 s [algebraic-graphs] OK: gmap id == id
  5865. 73.95 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  5866. 73.95 s [algebraic-graphs]
  5867. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  5868. 73.95 s [algebraic-graphs] OK: emap h empty == empty
  5869. 73.95 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  5870. 73.95 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  5871. 73.95 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  5872. 73.95 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  5873. 73.95 s [algebraic-graphs] OK: emap id == id
  5874. 73.95 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  5875. 73.95 s [algebraic-graphs]
  5876. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  5877. 73.95 s [algebraic-graphs] OK: induce (const True ) x == x
  5878. 73.95 s [algebraic-graphs] OK: induce (const False) x == empty
  5879. 73.95 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  5880. 73.95 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  5881. 73.95 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  5882. 73.95 s [algebraic-graphs]
  5883. 73.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  5884. 74.46 s [haskell-language-server] Preprocessing library 'hls-notes-plugin' for haskell-language-server-2.12.0.0..
  5885. 74.46 s [haskell-language-server] Building library 'hls-notes-plugin' for haskell-language-server-2.12.0.0..
  5886. 74.56 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Notes ( plugins/hls-notes-plugin/src/Ide/Plugin/Notes.hs, dist/build/hls-notes-plugin/Ide/Plugin/Notes.o, dist/build/hls-notes-plugin/Ide/Plugin/Notes.dyn_o )
  5887. 74.92 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  5888. 74.92 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  5889. 74.92 s [algebraic-graphs] OK: induceJust . gmap Just == id
  5890. 74.92 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  5891. 74.92 s [algebraic-graphs]
  5892. 74.92 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  5893. 74.92 s [algebraic-graphs] OK: closure empty == empty
  5894. 74.92 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  5895. 74.92 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  5896. 74.92 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  5897. 74.92 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  5898. 74.92 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  5899. 74.92 s [algebraic-graphs] OK: closure . closure == closure
  5900. 74.92 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  5901. 74.92 s [algebraic-graphs]
  5902. 74.92 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  5903. 74.92 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  5904. 74.92 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  5905. 74.92 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  5906. 74.92 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  5907. 74.92 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  5908. 74.92 s [algebraic-graphs]
  5909. 74.92 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  5910. 74.92 s [algebraic-graphs] OK: symmetricClosure empty == empty
  5911. 74.92 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  5912. 74.92 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  5913. 74.92 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  5914. 74.92 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  5915. 74.92 s [algebraic-graphs]
  5916. 74.92 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  5917. 74.92 s [algebraic-graphs] OK: transitiveClosure empty == empty
  5918. 74.92 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  5919. 74.92 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  5920. 74.92 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  5921. 74.92 s [algebraic-graphs]
  5922. 74.92 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  5923. 74.92 s [algebraic-graphs] OK: isEmpty empty == True
  5924. 74.92 s [algebraic-graphs] OK: hasVertex x empty == False
  5925. 74.92 s [algebraic-graphs] OK: vertexCount empty == 0
  5926. 74.92 s [algebraic-graphs] OK: edgeCount empty == 0
  5927. 74.92 s [algebraic-graphs]
  5928. 74.92 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  5929. 74.92 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  5930. 74.92 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  5931. 74.92 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  5932. 74.92 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  5933. 74.92 s [algebraic-graphs]
  5934. 74.92 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  5935. 74.92 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  5936. 74.92 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  5937. 74.92 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  5938. 74.92 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  5939. 74.92 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  5940. 74.92 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  5941. 74.92 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  5942. 74.92 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  5943. 74.92 s [algebraic-graphs]
  5944. 74.92 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  5945. 74.92 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  5946. 74.92 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  5947. 74.92 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  5948. 74.92 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  5949. 74.92 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  5950. 74.92 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  5951. 74.92 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  5952. 74.92 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  5953. 74.92 s [algebraic-graphs]
  5954. 74.92 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  5955. 74.92 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  5956. 74.92 s [algebraic-graphs]
  5957. 74.92 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  5958. 74.92 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  5959. 74.92 s [algebraic-graphs]
  5960. 74.92 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  5961. 74.92 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  5962. 74.92 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  5963. 74.92 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  5964. 74.92 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  5965. 74.92 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  5966. 74.92 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  5967. 74.92 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  5968. 74.92 s [algebraic-graphs]
  5969. 74.92 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  5970. 74.92 s [algebraic-graphs] OK: vertices [] == empty
  5971. 74.92 s [algebraic-graphs] OK: vertices [x] == vertex x
  5972. 74.92 s [algebraic-graphs] OK: vertices == overlays . map vertex
  5973. 74.92 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  5974. 74.92 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  5975. 74.92 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  5976. 74.92 s [algebraic-graphs]
  5977. 74.92 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  5978. 74.92 s [algebraic-graphs] OK: edges [] == empty
  5979. 74.92 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  5980. 74.92 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  5981. 74.92 s [algebraic-graphs]
  5982. 74.92 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  5983. 74.92 s [algebraic-graphs] OK: overlays [] == empty
  5984. 74.92 s [algebraic-graphs] OK: overlays [x] == x
  5985. 74.92 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  5986. 74.92 s [algebraic-graphs] OK: overlays == foldr overlay empty
  5987. 74.92 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  5988. 74.92 s [algebraic-graphs]
  5989. 74.92 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  5990. 74.92 s [algebraic-graphs] OK: foldg empty vertex connect == id
  5991. 74.92 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  5992. 74.92 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  5993. 74.92 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  5994. 74.92 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  5995. 74.92 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  5996. 74.92 s [algebraic-graphs]
  5997. 74.92 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  5998. 74.92 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  5999. 74.92 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  6000. 74.92 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  6001. 74.92 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  6002. 74.92 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  6003. 74.92 s [algebraic-graphs]
  6004. 74.92 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  6005. 74.92 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  6006. 74.92 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  6007. 74.92 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  6008. 74.93 s [algebraic-graphs]
  6009. 74.93 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  6010. 74.93 s [algebraic-graphs] OK: isEmpty empty == True
  6011. 74.93 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  6012. 74.93 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  6013. 74.93 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  6014. 74.93 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  6015. 74.93 s [algebraic-graphs]
  6016. 74.93 s [algebraic-graphs] ============ Labelled.Graph.size ============
  6017. 74.93 s [algebraic-graphs] OK: size empty == 1
  6018. 74.93 s [algebraic-graphs] OK: size (vertex x) == 1
  6019. 74.93 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  6020. 74.93 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  6021. 74.93 s [algebraic-graphs] OK: size x >= 1
  6022. 74.93 s [algebraic-graphs] OK: size x >= vertexCount x
  6023. 74.93 s [algebraic-graphs]
  6024. 74.93 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  6025. 74.93 s [algebraic-graphs] OK: hasVertex x empty == False
  6026. 74.93 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  6027. 74.93 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  6028. 74.93 s [algebraic-graphs]
  6029. 74.93 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  6030. 74.93 s [algebraic-graphs] OK: hasEdge x y empty == False
  6031. 74.93 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  6032. 74.93 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  6033. 74.93 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  6034. 74.93 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  6035. 74.93 s [algebraic-graphs]
  6036. 74.93 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  6037. 74.93 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  6038. 74.93 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  6039. 74.93 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  6040. 74.93 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  6041. 74.93 s [algebraic-graphs]
  6042. 74.93 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  6043. 74.93 s [algebraic-graphs] OK: vertexCount empty == 0
  6044. 74.93 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  6045. 74.93 s [algebraic-graphs] OK: vertexCount == length . vertexList
  6046. 74.93 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  6047. 74.93 s [algebraic-graphs]
  6048. 74.93 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  6049. 74.93 s [algebraic-graphs] OK: edgeCount empty == 0
  6050. 74.93 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  6051. 74.93 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  6052. 74.93 s [algebraic-graphs] OK: edgeCount == length . edgeList
  6053. 74.93 s [algebraic-graphs]
  6054. 74.93 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  6055. 74.93 s [algebraic-graphs] OK: vertexList empty == []
  6056. 74.93 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  6057. 74.93 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  6058. 74.93 s [algebraic-graphs]
  6059. 74.93 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  6060. 74.93 s [algebraic-graphs] OK: edgeList empty == []
  6061. 74.93 s [algebraic-graphs] OK: edgeList (vertex x) == []
  6062. 74.93 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  6063. 74.93 s [algebraic-graphs]
  6064. 74.93 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  6065. 74.93 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  6066. 74.93 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  6067. 74.93 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  6068. 74.93 s [algebraic-graphs]
  6069. 74.93 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  6070. 74.93 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  6071. 74.93 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  6072. 74.93 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  6073. 74.93 s [algebraic-graphs]
  6074. 74.93 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  6075. 74.93 s [algebraic-graphs] OK: preSet x empty == Set.empty
  6076. 74.93 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  6077. 77.10 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Notes ( plugins/hls-notes-plugin/src/Ide/Plugin/Notes.hs, dist/build/hls-notes-plugin/Ide/Plugin/Notes.p_o )
  6078. 77.45 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  6079. 77.45 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  6080. 77.45 s [algebraic-graphs]
  6081. 77.45 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  6082. 77.45 s [algebraic-graphs] OK: postSet x empty == Set.empty
  6083. 77.45 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  6084. 77.45 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  6085. 77.45 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  6086. 77.45 s [algebraic-graphs]
  6087. 77.45 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  6088. 77.45 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  6089. 77.45 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  6090. 77.45 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  6091. 77.45 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  6092. 77.45 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  6093. 77.45 s [algebraic-graphs]
  6094. 77.45 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  6095. 77.45 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  6096. 77.45 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  6097. 77.45 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  6098. 77.45 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  6099. 77.45 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  6100. 77.45 s [algebraic-graphs]
  6101. 77.45 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  6102. 77.45 s [algebraic-graphs] OK: replaceVertex x x == id
  6103. 77.45 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  6104. 77.45 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  6105. 77.45 s [algebraic-graphs]
  6106. 77.45 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  6107. 77.45 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  6108. 77.45 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  6109. 77.45 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  6110. 77.45 s [algebraic-graphs]
  6111. 77.45 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  6112. 77.45 s [algebraic-graphs] OK: transpose empty == empty
  6113. 77.45 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  6114. 77.45 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  6115. 77.45 s [algebraic-graphs] OK: transpose . transpose == id
  6116. 77.45 s [algebraic-graphs]
  6117. 77.45 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  6118. 77.45 s [algebraic-graphs] OK: fmap f empty == empty
  6119. 77.45 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  6120. 77.45 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  6121. 77.45 s [algebraic-graphs] OK: fmap id == id
  6122. 77.45 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  6123. 77.45 s [algebraic-graphs]
  6124. 77.45 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  6125. 77.45 s [algebraic-graphs] OK: emap h empty == empty
  6126. 77.45 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  6127. 77.45 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  6128. 77.45 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  6129. 77.45 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  6130. 77.45 s [algebraic-graphs] OK: emap id == id
  6131. 77.45 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  6132. 77.45 s [algebraic-graphs]
  6133. 77.45 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  6134. 77.45 s [algebraic-graphs] OK: induce (const True ) x == x
  6135. 77.45 s [algebraic-graphs] OK: induce (const False) x == empty
  6136. 77.45 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  6137. 77.45 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  6138. 77.45 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  6139. 77.45 s [algebraic-graphs]
  6140. 77.45 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  6141. 77.45 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  6142. 77.45 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  6143. 77.45 s [algebraic-graphs] OK: induceJust . gmap Just == id
  6144. 77.45 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  6145. 77.45 s [algebraic-graphs]
  6146. 77.45 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  6147. 77.45 s [algebraic-graphs] OK: closure empty == empty
  6148. 77.45 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  6149. 77.45 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  6150. 77.45 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  6151. 77.45 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  6152. 77.45 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  6153. 77.45 s [algebraic-graphs] OK: closure . closure == closure
  6154. 77.45 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  6155. 77.45 s [algebraic-graphs]
  6156. 77.45 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  6157. 77.45 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  6158. 77.45 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  6159. 77.45 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  6160. 77.45 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  6161. 77.45 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  6162. 77.45 s [algebraic-graphs]
  6163. 77.45 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  6164. 77.45 s [algebraic-graphs] OK: symmetricClosure empty == empty
  6165. 77.45 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  6166. 77.45 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  6167. 77.45 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  6168. 77.45 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  6169. 77.45 s [algebraic-graphs]
  6170. 77.45 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  6171. 77.45 s [algebraic-graphs] OK: transitiveClosure empty == empty
  6172. 77.45 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  6173. 77.45 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  6174. 77.45 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  6175. 77.45 s [algebraic-graphs]
  6176. 77.45 s [algebraic-graphs] ============ Labelled.Graph.context ============
  6177. 77.45 s [algebraic-graphs] OK: context (const False) x == Nothing
  6178. 77.45 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  6179. 77.45 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  6180. 77.45 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  6181. 77.45 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  6182. 77.45 s [algebraic-graphs]
  6183. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  6184. 77.45 s [algebraic-graphs] OK: Axioms of non-empty graphs
  6185. 77.45 s [algebraic-graphs] OK: Theorems of non-empty graphs
  6186. 77.45 s [algebraic-graphs]
  6187. 77.45 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  6188. 77.45 s [algebraic-graphs] OK: vertex 1 < vertex 2
  6189. 77.45 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  6190. 77.45 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  6191. 77.45 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  6192. 77.45 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  6193. 77.45 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  6194. 77.45 s [algebraic-graphs] OK: x <= x + y
  6195. 77.45 s [algebraic-graphs] OK: x + y <= x * y
  6196. 77.45 s [algebraic-graphs]
  6197. 77.45 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  6198. 77.45 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  6199. 77.45 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  6200. 77.45 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  6201. 77.45 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  6202. 77.45 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  6203. 77.45 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  6204. 77.45 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  6205. 77.45 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  6206. 77.45 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  6207. 77.45 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  6208. 77.45 s [algebraic-graphs]
  6209. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  6210. 77.45 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  6211. 77.45 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  6212. 77.45 s [algebraic-graphs]
  6213. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  6214. 77.45 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  6215. 77.45 s [algebraic-graphs]
  6216. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  6217. 77.45 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  6218. 77.45 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  6219. 77.45 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  6220. 77.45 s [algebraic-graphs]
  6221. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  6222. 77.45 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  6223. 77.45 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  6224. 77.45 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  6225. 77.45 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  6226. 77.45 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  6227. 77.45 s [algebraic-graphs]
  6228. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  6229. 77.45 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  6230. 77.45 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  6231. 77.45 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  6232. 77.45 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  6233. 77.45 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  6234. 77.45 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  6235. 77.45 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  6236. 77.45 s [algebraic-graphs]
  6237. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  6238. 77.45 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  6239. 77.45 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  6240. 77.45 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  6241. 77.45 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  6242. 77.45 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  6243. 77.45 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  6244. 77.45 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  6245. 77.45 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  6246. 77.45 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  6247. 77.45 s [algebraic-graphs]
  6248. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  6249. 77.45 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  6250. 77.45 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  6251. 77.45 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  6252. 77.45 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  6253. 77.45 s [algebraic-graphs]
  6254. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  6255. 77.45 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  6256. 77.45 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  6257. 77.45 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  6258. 77.45 s [algebraic-graphs]
  6259. 80.28 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  6260. 80.28 s [algebraic-graphs] OK: overlays1 [x] == x
  6261. 80.40 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  6262. 80.40 s [algebraic-graphs]
  6263. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  6264. 80.40 s [algebraic-graphs] OK: connects1 [x] == x
  6265. 80.40 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  6266. 80.40 s [algebraic-graphs]
  6267. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  6268. 80.40 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  6269. 80.40 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  6270. 80.40 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  6271. 80.40 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  6272. 80.40 s [algebraic-graphs]
  6273. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  6274. 80.40 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  6275. 80.40 s [algebraic-graphs]
  6276. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  6277. 80.40 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  6278. 80.40 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  6279. 80.40 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  6280. 80.40 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  6281. 80.40 s [algebraic-graphs]
  6282. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  6283. 80.40 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  6284. 80.40 s [algebraic-graphs] OK: vertexCount x >= 1
  6285. 80.40 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  6286. 80.40 s [algebraic-graphs]
  6287. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  6288. 80.40 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  6289. 80.40 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  6290. 80.40 s [algebraic-graphs] OK: edgeCount == length . edgeList
  6291. 80.40 s [algebraic-graphs]
  6292. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  6293. 80.40 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  6294. 80.40 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  6295. 80.40 s [algebraic-graphs]
  6296. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  6297. 80.40 s [algebraic-graphs] OK: edgeList (vertex x) == []
  6298. 80.40 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  6299. 80.40 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  6300. 80.40 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  6301. 80.40 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  6302. 80.40 s [algebraic-graphs]
  6303. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  6304. 80.40 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  6305. 80.40 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  6306. 80.40 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  6307. 80.40 s [algebraic-graphs]
  6308. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  6309. 80.40 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  6310. 80.40 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  6311. 80.40 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  6312. 80.40 s [algebraic-graphs]
  6313. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  6314. 80.40 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  6315. 80.40 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  6316. 80.40 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  6317. 80.40 s [algebraic-graphs]
  6318. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  6319. 80.40 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  6320. 80.40 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  6321. 80.40 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  6322. 80.40 s [algebraic-graphs]
  6323. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  6324. 80.40 s [algebraic-graphs] OK: path1 [x] == vertex x
  6325. 80.40 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  6326. 80.40 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  6327. 80.40 s [algebraic-graphs]
  6328. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  6329. 80.40 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  6330. 80.40 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  6331. 80.40 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  6332. 80.40 s [algebraic-graphs]
  6333. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  6334. 80.40 s [algebraic-graphs] OK: clique1 [x] == vertex x
  6335. 80.40 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  6336. 80.40 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  6337. 80.40 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  6338. 80.40 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  6339. 80.40 s [algebraic-graphs]
  6340. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  6341. 80.40 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  6342. 80.40 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  6343. 80.40 s [algebraic-graphs]
  6344. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  6345. 80.40 s [algebraic-graphs] OK: star x [] == vertex x
  6346. 80.40 s [algebraic-graphs] OK: star x [y] == edge x y
  6347. 80.40 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  6348. 80.40 s [algebraic-graphs]
  6349. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  6350. 80.40 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  6351. 80.40 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  6352. 80.40 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  6353. 80.40 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  6354. 80.40 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  6355. 80.40 s [algebraic-graphs]
  6356. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  6357. 80.40 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  6358. 80.40 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  6359. 80.40 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  6360. 80.40 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  6361. 80.40 s [algebraic-graphs]
  6362. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  6363. 80.40 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  6364. 80.40 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  6365. 80.40 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  6366. 80.40 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  6367. 80.40 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  6368. 80.40 s [algebraic-graphs]
  6369. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  6370. 80.40 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  6371. 80.40 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  6372. 80.40 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  6373. 80.40 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  6374. 80.40 s [algebraic-graphs]
  6375. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  6376. 80.40 s [algebraic-graphs] OK: replaceVertex x x == id
  6377. 80.40 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  6378. 80.40 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  6379. 80.40 s [algebraic-graphs]
  6380. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  6381. 80.40 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  6382. 80.40 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  6383. 80.40 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  6384. 80.40 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  6385. 80.40 s [algebraic-graphs]
  6386. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  6387. 80.40 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  6388. 80.40 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  6389. 80.40 s [algebraic-graphs] OK: transpose . transpose == id
  6390. 80.40 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  6391. 80.40 s [algebraic-graphs]
  6392. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  6393. 80.40 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  6394. 80.40 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  6395. 80.40 s [algebraic-graphs] OK: gmap id == id
  6396. 80.40 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  6397. 80.40 s [algebraic-graphs]
  6398. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  6399. 80.40 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  6400. 80.40 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  6401. 80.40 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  6402. 80.40 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  6403. 80.40 s [algebraic-graphs]
  6404. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  6405. 80.40 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  6406. 80.40 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  6407. 80.40 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  6408. 80.40 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  6409. 80.40 s [algebraic-graphs]
  6410. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  6411. 80.40 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  6412. 80.40 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  6413. 80.40 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  6414. 80.40 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  6415. 80.40 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  6416. 80.40 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  6417. 80.40 s [algebraic-graphs] OK: closure . closure == closure
  6418. 80.40 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  6419. 80.40 s [algebraic-graphs]
  6420. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  6421. 80.40 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  6422. 80.40 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  6423. 80.40 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  6424. 80.40 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  6425. 80.40 s [algebraic-graphs]
  6426. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  6427. 80.40 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  6428. 80.40 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  6429. 80.40 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  6430. 80.40 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  6431. 80.40 s [algebraic-graphs]
  6432. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  6433. 80.40 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  6434. 80.40 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  6435. 80.40 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  6436. 80.40 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  6437. 80.40 s [algebraic-graphs]
  6438. 80.40 s [algebraic-graphs] ============ NonEmpty.Graph.============
  6439. 80.40 s [algebraic-graphs] OK: Axioms of non-empty graphs
  6440. 80.40 s [algebraic-graphs] OK: Theorems of non-empty graphs
  6441. 80.40 s [algebraic-graphs]
  6442. 80.40 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  6443. 80.40 s [algebraic-graphs] OK: vertex 1 < vertex 2
  6444. 80.40 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  6445. 80.40 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  6446. 80.40 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  6447. 80.40 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  6448. 80.40 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  6449. 80.40 s [algebraic-graphs] OK: x <= x + y
  6450. 80.40 s [algebraic-graphs] OK: x + y <= x * y
  6451. 80.40 s [algebraic-graphs]
  6452. 80.40 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  6453. 80.40 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  6454. 80.40 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  6455. 80.40 s [algebraic-graphs] OK: fmap id == id
  6456. 80.40 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  6457. 80.40 s [algebraic-graphs]
  6458. 80.40 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  6459. 80.40 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  6460. 81.54 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  6461. 81.54 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  6462. 81.54 s [algebraic-graphs] OK: (x >>= vertex) == x
  6463. 81.54 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  6464. 81.54 s [algebraic-graphs]
  6465. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  6466. 81.54 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  6467. 81.54 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  6468. 81.54 s [algebraic-graphs]
  6469. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  6470. 81.54 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  6471. 81.54 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  6472. 81.54 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  6473. 81.54 s [algebraic-graphs] OK: size (vertex x) == 1
  6474. 81.54 s [algebraic-graphs]
  6475. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  6476. 81.54 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  6477. 81.54 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  6478. 81.54 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  6479. 81.54 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  6480. 81.54 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  6481. 81.54 s [algebraic-graphs]
  6482. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  6483. 81.54 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  6484. 81.54 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  6485. 81.54 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  6486. 81.54 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  6487. 81.54 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  6488. 81.54 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  6489. 81.54 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  6490. 81.54 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  6491. 81.54 s [algebraic-graphs]
  6492. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  6493. 81.54 s [algebraic-graphs] OK: overlay1 empty x == x
  6494. 81.54 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  6495. 81.54 s [algebraic-graphs]
  6496. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  6497. 81.54 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  6498. 81.54 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  6499. 81.54 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  6500. 81.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  6501. 81.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  6502. 81.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  6503. 81.54 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  6504. 81.54 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  6505. 81.54 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  6506. 81.54 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  6507. 81.54 s [algebraic-graphs]
  6508. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  6509. 81.54 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  6510. 81.54 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  6511. 81.54 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  6512. 81.54 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  6513. 81.54 s [algebraic-graphs]
  6514. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  6515. 81.54 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  6516. 81.54 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  6517. 81.54 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  6518. 81.54 s [algebraic-graphs]
  6519. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  6520. 81.54 s [algebraic-graphs] OK: overlays1 [x] == x
  6521. 81.54 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  6522. 81.54 s [algebraic-graphs]
  6523. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  6524. 81.54 s [algebraic-graphs] OK: connects1 [x] == x
  6525. 81.54 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  6526. 81.54 s [algebraic-graphs]
  6527. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  6528. 81.55 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  6529. 81.55 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  6530. 81.55 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  6531. 81.55 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  6532. 81.55 s [algebraic-graphs]
  6533. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  6534. 81.55 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  6535. 81.55 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  6536. 81.55 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  6537. 81.55 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  6538. 81.55 s [algebraic-graphs]
  6539. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  6540. 81.55 s [algebraic-graphs] OK: x === x == True
  6541. 81.55 s [algebraic-graphs] OK: x + y === x + y == True
  6542. 81.55 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  6543. 81.55 s [algebraic-graphs] OK: x + y === x * y == False
  6544. 81.55 s [algebraic-graphs]
  6545. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  6546. 81.55 s [algebraic-graphs] OK: size (vertex x) == 1
  6547. 81.55 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  6548. 81.55 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  6549. 81.55 s [algebraic-graphs] OK: size x >= 1
  6550. 81.55 s [algebraic-graphs] OK: size x >= vertexCount x
  6551. 81.55 s [algebraic-graphs]
  6552. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  6553. 81.55 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  6554. 81.55 s [algebraic-graphs]
  6555. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  6556. 81.55 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  6557. 81.55 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  6558. 81.55 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  6559. 81.55 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  6560. 81.55 s [algebraic-graphs]
  6561. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  6562. 81.55 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  6563. 81.55 s [algebraic-graphs] OK: vertexCount x >= 1
  6564. 81.55 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  6565. 81.55 s [algebraic-graphs]
  6566. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  6567. 81.55 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  6568. 81.55 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  6569. 81.55 s [algebraic-graphs] OK: edgeCount == length . edgeList
  6570. 81.55 s [algebraic-graphs]
  6571. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  6572. 81.55 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  6573. 81.55 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  6574. 81.55 s [algebraic-graphs]
  6575. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  6576. 81.55 s [algebraic-graphs] OK: edgeList (vertex x) == []
  6577. 81.55 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  6578. 81.55 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  6579. 81.55 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  6580. 81.55 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  6581. 81.55 s [algebraic-graphs]
  6582. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  6583. 81.55 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  6584. 81.55 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  6585. 81.55 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  6586. 81.55 s [algebraic-graphs]
  6587. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  6588. 81.55 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  6589. 81.55 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  6590. 81.55 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  6591. 81.55 s [algebraic-graphs]
  6592. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  6593. 81.55 s [algebraic-graphs] OK: path1 [x] == vertex x
  6594. 81.55 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  6595. 81.55 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  6596. 81.55 s [algebraic-graphs]
  6597. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  6598. 81.55 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  6599. 81.55 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  6600. 81.55 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  6601. 81.55 s [algebraic-graphs]
  6602. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  6603. 81.55 s [algebraic-graphs] OK: clique1 [x] == vertex x
  6604. 81.55 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  6605. 81.55 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  6606. 81.55 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  6607. 81.55 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  6608. 81.55 s [algebraic-graphs]
  6609. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  6610. 81.55 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  6611. 81.55 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  6612. 81.55 s [algebraic-graphs]
  6613. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  6614. 81.55 s [algebraic-graphs] OK: star x [] == vertex x
  6615. 81.55 s [algebraic-graphs] OK: star x [y] == edge x y
  6616. 81.55 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  6617. 81.55 s [algebraic-graphs]
  6618. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  6619. 81.55 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  6620. 81.55 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  6621. 81.55 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  6622. 81.55 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  6623. 81.55 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  6624. 81.55 s [algebraic-graphs]
  6625. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  6626. 81.55 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  6627. 81.55 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  6628. 81.55 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  6629. 81.55 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  6630. 81.55 s [algebraic-graphs]
  6631. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  6632. 81.55 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  6633. 81.55 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  6634. 81.55 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  6635. 81.55 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  6636. 81.55 s [algebraic-graphs]
  6637. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  6638. 81.55 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  6639. 81.55 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  6640. 81.55 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  6641. 81.55 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  6642. 81.55 s [algebraic-graphs]
  6643. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  6644. 81.55 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  6645. 81.55 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  6646. 81.55 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  6647. 81.55 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  6648. 81.55 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  6649. 81.55 s [algebraic-graphs]
  6650. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  6651. 81.55 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  6652. 81.55 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  6653. 81.55 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  6654. 81.55 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  6655. 81.55 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  6656. 81.55 s [algebraic-graphs]
  6657. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  6658. 81.55 s [algebraic-graphs] OK: replaceVertex x x == id
  6659. 81.55 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  6660. 81.55 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  6661. 81.55 s [algebraic-graphs]
  6662. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  6663. 81.55 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  6664. 84.71 s [haskell-language-server] Preprocessing library 'ghcide-bench-lib' for haskell-language-server-2.12.0.0..
  6665. 84.71 s [haskell-language-server] Building library 'ghcide-bench-lib' for haskell-language-server-2.12.0.0..
  6666. 84.81 s [haskell-language-server] [1 of 2] Compiling Experiments.Types ( ghcide-bench/src/Experiments/Types.hs, dist/build/ghcide-bench-lib/Experiments/Types.o, dist/build/ghcide-bench-lib/Experiments/Types.dyn_o )
  6667. 86.48 s [haskell-language-server] [2 of 2] Compiling Experiments ( ghcide-bench/src/Experiments.hs, dist/build/ghcide-bench-lib/Experiments.o, dist/build/ghcide-bench-lib/Experiments.dyn_o )
  6668. 86.73 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  6669. 86.73 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  6670. 86.73 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  6671. 86.73 s [algebraic-graphs]
  6672. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  6673. 86.73 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  6674. 86.73 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  6675. 86.73 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  6676. 86.73 s [algebraic-graphs]
  6677. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  6678. 86.73 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  6679. 86.73 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  6680. 86.73 s [algebraic-graphs] OK: transpose . transpose == id
  6681. 86.73 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  6682. 86.73 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  6683. 86.73 s [algebraic-graphs]
  6684. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  6685. 86.73 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  6686. 86.73 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  6687. 86.73 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  6688. 86.73 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  6689. 86.73 s [algebraic-graphs]
  6690. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  6691. 86.73 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  6692. 86.73 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  6693. 86.73 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  6694. 86.73 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  6695. 86.73 s [algebraic-graphs]
  6696. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  6697. 86.73 s [algebraic-graphs] OK: simplify == id
  6698. 86.73 s [algebraic-graphs] OK: size (simplify x) <= size x
  6699. 86.73 s [algebraic-graphs] OK: simplify 1 === 1
  6700. 86.73 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  6701. 86.73 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  6702. 86.73 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  6703. 86.73 s [algebraic-graphs]
  6704. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  6705. 86.73 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  6706. 86.73 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  6707. 86.73 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  6708. 86.73 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  6709. 86.73 s [algebraic-graphs]
  6710. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  6711. 86.73 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  6712. 86.73 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  6713. 86.73 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  6714. 86.73 s [algebraic-graphs]
  6715. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  6716. 86.73 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  6717. 86.73 s [algebraic-graphs] OK: box x y ~~ box y x
  6718. 86.73 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  6719. 86.73 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  6720. 86.73 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  6721. 86.73 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  6722. 86.73 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  6723. 86.73 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  6724. 86.73 s [algebraic-graphs]
  6725. 86.73 s [algebraic-graphs] ============ Relation ============
  6726. 86.73 s [algebraic-graphs] OK: Axioms of graphs
  6727. 86.73 s [algebraic-graphs]
  6728. 86.73 s [algebraic-graphs] ============ Relation.consistent ============
  6729. 86.73 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  6730. 86.73 s [algebraic-graphs]
  6731. 86.73 s [algebraic-graphs] OK: consistent empty == True
  6732. 86.73 s [algebraic-graphs] OK: consistent (vertex x) == True
  6733. 86.73 s [algebraic-graphs] OK: consistent (overlay x y) == True
  6734. 86.73 s [algebraic-graphs] OK: consistent (connect x y) == True
  6735. 86.73 s [algebraic-graphs] OK: consistent (edge x y) == True
  6736. 86.73 s [algebraic-graphs] OK: consistent (edges xs) == True
  6737. 86.73 s [algebraic-graphs] OK: consistent (stars xs) == True
  6738. 86.73 s [algebraic-graphs]
  6739. 86.73 s [algebraic-graphs] ============ Relation.Show ============
  6740. 86.73 s [algebraic-graphs] OK: show (empty ) == "empty"
  6741. 86.73 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  6742. 86.73 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  6743. 86.73 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  6744. 86.73 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  6745. 86.73 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  6746. 86.73 s [algebraic-graphs]
  6747. 86.73 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  6748. 86.73 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  6749. 86.73 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  6750. 86.73 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  6751. 86.73 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  6752. 86.73 s [algebraic-graphs]
  6753. 86.73 s [algebraic-graphs] ============ Relation.Ord ============
  6754. 86.73 s [algebraic-graphs] OK: vertex 1 < vertex 2
  6755. 86.73 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  6756. 86.73 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  6757. 86.73 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  6758. 86.73 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  6759. 86.73 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  6760. 86.73 s [algebraic-graphs] OK: x <= x + y
  6761. 86.73 s [algebraic-graphs] OK: x + y <= x * y
  6762. 86.73 s [algebraic-graphs]
  6763. 86.73 s [algebraic-graphs] ============ Relation.empty ============
  6764. 86.73 s [algebraic-graphs] OK: isEmpty empty == True
  6765. 86.73 s [algebraic-graphs] OK: hasVertex x empty == False
  6766. 86.73 s [algebraic-graphs] OK: vertexCount empty == 0
  6767. 86.73 s [algebraic-graphs] OK: edgeCount empty == 0
  6768. 86.73 s [algebraic-graphs]
  6769. 86.73 s [algebraic-graphs] ============ Relation.vertex ============
  6770. 86.73 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  6771. 86.73 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  6772. 86.73 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  6773. 86.73 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  6774. 86.73 s [algebraic-graphs]
  6775. 86.73 s [algebraic-graphs] ============ Relation.edge ============
  6776. 86.73 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  6777. 86.73 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  6778. 86.73 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  6779. 86.73 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  6780. 86.73 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  6781. 86.73 s [algebraic-graphs]
  6782. 86.73 s [algebraic-graphs] ============ Relation.overlay ============
  6783. 86.73 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  6784. 86.73 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  6785. 86.73 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  6786. 86.73 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  6787. 86.73 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  6788. 86.73 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  6789. 86.73 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  6790. 86.73 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  6791. 86.73 s [algebraic-graphs]
  6792. 86.73 s [algebraic-graphs] ============ Relation.connect ============
  6793. 86.73 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  6794. 86.73 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  6795. 86.74 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  6796. 86.74 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  6797. 86.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  6798. 86.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  6799. 86.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  6800. 86.74 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  6801. 86.74 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  6802. 86.74 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  6803. 86.74 s [algebraic-graphs]
  6804. 86.74 s [algebraic-graphs] ============ Relation.vertices ============
  6805. 86.74 s [algebraic-graphs] OK: vertices [] == empty
  6806. 86.74 s [algebraic-graphs] OK: vertices [x] == vertex x
  6807. 86.74 s [algebraic-graphs] OK: vertices == overlays . map vertex
  6808. 86.74 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  6809. 86.74 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  6810. 86.74 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  6811. 86.74 s [algebraic-graphs]
  6812. 86.74 s [algebraic-graphs] ============ Relation.edges ============
  6813. 86.74 s [algebraic-graphs] OK: edges [] == empty
  6814. 86.74 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  6815. 86.74 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  6816. 86.74 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  6817. 86.74 s [algebraic-graphs]
  6818. 86.74 s [algebraic-graphs] ============ Relation.overlays ============
  6819. 86.74 s [algebraic-graphs] OK: overlays [] == empty
  6820. 86.74 s [algebraic-graphs] OK: overlays [x] == x
  6821. 86.74 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  6822. 86.74 s [algebraic-graphs] OK: overlays == foldr overlay empty
  6823. 86.74 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  6824. 86.74 s [algebraic-graphs]
  6825. 86.74 s [algebraic-graphs] ============ Relation.connects ============
  6826. 86.74 s [algebraic-graphs] OK: connects [] == empty
  6827. 86.74 s [algebraic-graphs] OK: connects [x] == x
  6828. 86.74 s [algebraic-graphs] OK: connects [x,y] == connect x y
  6829. 86.74 s [algebraic-graphs] OK: connects == foldr connect empty
  6830. 86.74 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  6831. 86.74 s [algebraic-graphs]
  6832. 86.74 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  6833. 86.74 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  6834. 86.74 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  6835. 86.74 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  6836. 86.74 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  6837. 86.74 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  6838. 86.74 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  6839. 86.74 s [algebraic-graphs]
  6840. 86.74 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  6841. 86.74 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  6842. 86.74 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  6843. 86.74 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  6844. 86.74 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  6845. 86.74 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  6846. 86.74 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  6847. 86.74 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  6848. 86.74 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  6849. 86.74 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  6850. 86.74 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  6851. 86.74 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  6852. 86.74 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  6853. 86.74 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  6854. 86.74 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  6855. 86.74 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  6856. 86.74 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  6857. 86.74 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  6858. 87.23 s [haskell-language-server]
  6859. 87.23 s [haskell-language-server] ghcide-bench/src/Experiments.hs:345:1: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  6860. 87.23 s [haskell-language-server] Pattern match(es) are non-exhaustive
  6861. 87.23 s [haskell-language-server] In a pattern binding:
  6862. 87.23 s [haskell-language-server] Patterns of type ‘ParserResult Config’ not matched:
  6863. 87.23 s [haskell-language-server] Failure _
  6864. 87.23 s [haskell-language-server] CompletionInvoked _
  6865. 87.23 s [haskell-language-server] |
  6866. 87.23 s [haskell-language-server] 345 | Success defConfig = execParserPure defaultPrefs (info configP fullDesc) []
  6867. 87.23 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  6868. 87.23 s [haskell-language-server]
  6869. 87.23 s [haskell-language-server] ghcide-bench/src/Experiments.hs:453:42: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  6870. 87.23 s [haskell-language-server] Pattern match(es) are non-exhaustive
  6871. 87.23 s [haskell-language-server] In a lambda abstraction:
  6872. 87.23 s [haskell-language-server] Patterns of type ‘Maybe Handle’, ‘Maybe Handle’, ‘Maybe Handle’,
  6873. 87.23 s [haskell-language-server] ‘ProcessHandle’ not matched:
  6874. 87.23 s [haskell-language-server] Nothing _ _ _
  6875. 87.23 s [haskell-language-server] (Just _) Nothing _ _
  6876. 87.23 s [haskell-language-server] (Just _) (Just _) Nothing _
  6877. 87.23 s [haskell-language-server] |
  6878. 87.23 s [haskell-language-server] 453 | run sess = withCreateProcess p $ \(Just inH) (Just outH) (Just errH) pH -> do
  6879. 87.23 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  6880. 89.69 s [haskell-language-server] [1 of 2] Compiling Experiments.Types ( ghcide-bench/src/Experiments/Types.hs, dist/build/ghcide-bench-lib/Experiments/Types.p_o )
  6881. 89.72 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  6882. 89.72 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  6883. 89.72 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  6884. 89.72 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  6885. 89.72 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  6886. 89.72 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  6887. 89.72 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  6888. 89.72 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  6889. 89.72 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  6890. 89.72 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  6891. 89.72 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  6892. 89.72 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  6893. 89.72 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  6894. 89.72 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  6895. 89.72 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  6896. 89.72 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  6897. 89.72 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  6898. 89.72 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  6899. 89.72 s [algebraic-graphs]
  6900. 89.72 s [algebraic-graphs] ============ Relation.foldg ============
  6901. 89.72 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  6902. 89.72 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  6903. 89.72 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  6904. 89.72 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  6905. 89.72 s [algebraic-graphs]
  6906. 89.72 s [algebraic-graphs] ============ Relation.isEmpty ============
  6907. 89.72 s [algebraic-graphs] OK: isEmpty empty == True
  6908. 89.72 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  6909. 89.72 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  6910. 89.72 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  6911. 89.72 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  6912. 89.72 s [algebraic-graphs]
  6913. 89.72 s [algebraic-graphs] ============ Relation.hasVertex ============
  6914. 89.72 s [algebraic-graphs] OK: hasVertex x empty == False
  6915. 89.72 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  6916. 89.72 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  6917. 89.72 s [algebraic-graphs]
  6918. 89.72 s [algebraic-graphs] ============ Relation.hasEdge ============
  6919. 89.72 s [algebraic-graphs] OK: hasEdge x y empty == False
  6920. 89.72 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  6921. 89.72 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  6922. 89.72 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  6923. 89.72 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  6924. 89.72 s [algebraic-graphs]
  6925. 89.72 s [algebraic-graphs] ============ Relation.vertexCount ============
  6926. 89.72 s [algebraic-graphs] OK: vertexCount empty == 0
  6927. 89.72 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  6928. 89.72 s [algebraic-graphs] OK: vertexCount == length . vertexList
  6929. 89.72 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  6930. 89.72 s [algebraic-graphs]
  6931. 89.72 s [algebraic-graphs] ============ Relation.edgeCount ============
  6932. 89.72 s [algebraic-graphs] OK: edgeCount empty == 0
  6933. 89.72 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  6934. 89.72 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  6935. 89.72 s [algebraic-graphs] OK: edgeCount == length . edgeList
  6936. 89.72 s [algebraic-graphs]
  6937. 89.72 s [algebraic-graphs] ============ Relation.vertexList ============
  6938. 89.72 s [algebraic-graphs] OK: vertexList empty == []
  6939. 89.72 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  6940. 89.72 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  6941. 89.72 s [algebraic-graphs]
  6942. 89.72 s [algebraic-graphs] ============ Relation.vertexSet ============
  6943. 89.72 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  6944. 89.72 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  6945. 89.72 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  6946. 89.72 s [algebraic-graphs]
  6947. 89.72 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  6948. 89.72 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  6949. 89.72 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  6950. 89.72 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  6951. 89.72 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  6952. 89.72 s [algebraic-graphs]
  6953. 89.72 s [algebraic-graphs] ============ Relation.edgeList ============
  6954. 89.72 s [algebraic-graphs] OK: edgeList empty == []
  6955. 89.72 s [algebraic-graphs] OK: edgeList (vertex x) == []
  6956. 89.72 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  6957. 89.72 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  6958. 89.72 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  6959. 89.72 s [algebraic-graphs]
  6960. 89.72 s [algebraic-graphs] ============ Relation.edgeSet ============
  6961. 89.72 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  6962. 89.72 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  6963. 89.72 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  6964. 89.72 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  6965. 89.72 s [algebraic-graphs]
  6966. 89.72 s [algebraic-graphs] ============ Relation.adjacencyList ============
  6967. 89.72 s [algebraic-graphs] OK: adjacencyList empty == []
  6968. 89.72 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  6969. 89.72 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  6970. 89.72 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  6971. 89.72 s [algebraic-graphs]
  6972. 89.72 s [algebraic-graphs] ============ Relation.preSet ============
  6973. 89.72 s [algebraic-graphs] OK: preSet x empty == Set.empty
  6974. 89.72 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  6975. 89.72 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  6976. 89.72 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  6977. 89.72 s [algebraic-graphs]
  6978. 89.72 s [algebraic-graphs] ============ Relation.preIntSet ============
  6979. 89.72 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  6980. 89.72 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  6981. 89.72 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  6982. 89.72 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  6983. 89.72 s [algebraic-graphs]
  6984. 89.72 s [algebraic-graphs] ============ Relation.postSet ============
  6985. 89.72 s [algebraic-graphs] OK: postSet x empty == Set.empty
  6986. 89.72 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  6987. 89.72 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  6988. 89.72 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  6989. 89.72 s [algebraic-graphs]
  6990. 89.72 s [algebraic-graphs] ============ Relation.postIntSet ============
  6991. 89.72 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  6992. 89.72 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  6993. 89.72 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  6994. 89.72 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  6995. 89.72 s [algebraic-graphs]
  6996. 89.72 s [algebraic-graphs] ============ Relation.path ============
  6997. 89.72 s [algebraic-graphs] OK: path [] == empty
  6998. 89.72 s [algebraic-graphs] OK: path [x] == vertex x
  6999. 89.72 s [algebraic-graphs] OK: path [x,y] == edge x y
  7000. 89.72 s [algebraic-graphs]
  7001. 89.72 s [algebraic-graphs] ============ Relation.circuit ============
  7002. 89.72 s [algebraic-graphs] OK: circuit [] == empty
  7003. 89.72 s [algebraic-graphs] OK: circuit [x] == edge x x
  7004. 89.72 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  7005. 89.72 s [algebraic-graphs]
  7006. 89.72 s [algebraic-graphs] ============ Relation.clique ============
  7007. 89.72 s [algebraic-graphs] OK: clique [] == empty
  7008. 89.72 s [algebraic-graphs] OK: clique [x] == vertex x
  7009. 89.72 s [algebraic-graphs] OK: clique [x,y] == edge x y
  7010. 89.72 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  7011. 89.72 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  7012. 89.72 s [algebraic-graphs]
  7013. 89.72 s [algebraic-graphs] ============ Relation.biclique ============
  7014. 89.72 s [algebraic-graphs] OK: biclique [] [] == empty
  7015. 89.72 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  7016. 89.72 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  7017. 89.72 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  7018. 89.72 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  7019. 89.72 s [algebraic-graphs]
  7020. 89.72 s [algebraic-graphs] ============ Relation.star ============
  7021. 89.72 s [algebraic-graphs] OK: star x [] == vertex x
  7022. 89.72 s [algebraic-graphs] OK: star x [y] == edge x y
  7023. 89.72 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  7024. 89.72 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  7025. 89.72 s [algebraic-graphs]
  7026. 89.72 s [algebraic-graphs] ============ Relation.stars ============
  7027. 89.72 s [algebraic-graphs] OK: stars [] == empty
  7028. 89.72 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  7029. 89.72 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  7030. 89.72 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  7031. 89.72 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  7032. 89.72 s [algebraic-graphs] OK: stars . adjacencyList == id
  7033. 89.72 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  7034. 89.72 s [algebraic-graphs]
  7035. 89.72 s [algebraic-graphs] ============ Relation.tree ============
  7036. 89.72 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  7037. 89.72 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  7038. 89.72 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  7039. 89.72 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  7040. 89.72 s [algebraic-graphs]
  7041. 89.72 s [algebraic-graphs] ============ Relation.forest ============
  7042. 89.72 s [algebraic-graphs] OK: forest [] == empty
  7043. 89.72 s [algebraic-graphs] OK: forest [x] == tree x
  7044. 89.72 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  7045. 89.72 s [algebraic-graphs] OK: forest == overlays . map tree
  7046. 89.72 s [algebraic-graphs]
  7047. 89.72 s [algebraic-graphs] ============ Relation.removeVertex ============
  7048. 89.72 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  7049. 89.72 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  7050. 89.72 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  7051. 89.72 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  7052. 89.72 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  7053. 89.72 s [algebraic-graphs]
  7054. 89.72 s [algebraic-graphs] ============ Relation.removeEdge ============
  7055. 89.72 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  7056. 89.72 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  7057. 89.72 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  7058. 89.72 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  7059. 89.72 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  7060. 89.72 s [algebraic-graphs]
  7061. 89.72 s [algebraic-graphs] ============ Relation.replaceVertex ============
  7062. 89.72 s [algebraic-graphs] OK: replaceVertex x x == id
  7063. 89.72 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  7064. 89.72 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  7065. 89.72 s [algebraic-graphs]
  7066. 89.72 s [algebraic-graphs] ============ Relation.mergeVertices ============
  7067. 89.72 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  7068. 91.39 s [haskell-language-server] [2 of 2] Compiling Experiments ( ghcide-bench/src/Experiments.hs, dist/build/ghcide-bench-lib/Experiments.p_o )
  7069. 91.96 s [haskell-language-server]
  7070. 91.96 s [haskell-language-server] ghcide-bench/src/Experiments.hs:345:1: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  7071. 92.07 s [haskell-language-server] Pattern match(es) are non-exhaustive
  7072. 92.07 s [haskell-language-server] In a pattern binding:
  7073. 92.07 s [haskell-language-server] Patterns of type ‘ParserResult Config’ not matched:
  7074. 92.07 s [haskell-language-server] Failure _
  7075. 92.07 s [haskell-language-server] CompletionInvoked _
  7076. 92.07 s [haskell-language-server] |
  7077. 92.07 s [haskell-language-server] 345 | Success defConfig = execParserPure defaultPrefs (info configP fullDesc) []
  7078. 92.07 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  7079. 92.07 s [haskell-language-server]
  7080. 92.07 s [haskell-language-server] ghcide-bench/src/Experiments.hs:453:42: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  7081. 92.07 s [haskell-language-server] Pattern match(es) are non-exhaustive
  7082. 92.07 s [haskell-language-server] In a lambda abstraction:
  7083. 92.07 s [haskell-language-server] Patterns of type ‘Maybe Handle’, ‘Maybe Handle’, ‘Maybe Handle’,
  7084. 92.07 s [haskell-language-server] ‘ProcessHandle’ not matched:
  7085. 92.07 s [haskell-language-server] Nothing _ _ _
  7086. 92.07 s [haskell-language-server] (Just _) Nothing _ _
  7087. 92.07 s [haskell-language-server] (Just _) (Just _) Nothing _
  7088. 92.07 s [haskell-language-server] |
  7089. 92.07 s [haskell-language-server] 453 | run sess = withCreateProcess p $ \(Just inH) (Just outH) (Just errH) pH -> do
  7090. 92.07 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  7091. 100.76 s [haskell-language-server] Preprocessing library 'hls-floskell-plugin' for haskell-language-server-2.12.0.0..
  7092. 100.76 s [haskell-language-server] Building library 'hls-floskell-plugin' for haskell-language-server-2.12.0.0..
  7093. 100.86 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Floskell ( plugins/hls-floskell-plugin/src/Ide/Plugin/Floskell.hs, dist/build/hls-floskell-plugin/Ide/Plugin/Floskell.o, dist/build/hls-floskell-plugin/Ide/Plugin/Floskell.dyn_o )
  7094. 102.36 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Floskell ( plugins/hls-floskell-plugin/src/Ide/Plugin/Floskell.hs, dist/build/hls-floskell-plugin/Ide/Plugin/Floskell.p_o )
  7095. 108.20 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  7096. 108.20 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  7097. 108.23 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  7098. 108.23 s [algebraic-graphs]
  7099. 108.23 s [algebraic-graphs] ============ Relation.transpose ============
  7100. 108.23 s [algebraic-graphs] OK: transpose empty == empty
  7101. 108.23 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  7102. 108.23 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  7103. 108.23 s [algebraic-graphs] OK: transpose . transpose == id
  7104. 108.23 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  7105. 108.23 s [algebraic-graphs]
  7106. 108.23 s [algebraic-graphs] ============ Relation.gmap ============
  7107. 108.23 s [algebraic-graphs] OK: gmap f empty == empty
  7108. 108.23 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  7109. 108.23 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  7110. 108.23 s [algebraic-graphs] OK: gmap id == id
  7111. 108.23 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  7112. 108.23 s [algebraic-graphs]
  7113. 108.23 s [algebraic-graphs] ============ Relation.induce ============
  7114. 108.23 s [algebraic-graphs] OK: induce (const True ) x == x
  7115. 108.23 s [algebraic-graphs] OK: induce (const False) x == empty
  7116. 108.23 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  7117. 108.23 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  7118. 108.23 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  7119. 108.23 s [algebraic-graphs]
  7120. 108.23 s [algebraic-graphs] ============ Relation.compose ============
  7121. 108.23 s [algebraic-graphs] OK: compose empty x == empty
  7122. 108.23 s [algebraic-graphs] OK: compose x empty == empty
  7123. 108.23 s [algebraic-graphs] OK: compose (vertex x) y == empty
  7124. 108.23 s [algebraic-graphs] OK: compose x (vertex y) == empty
  7125. 108.24 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  7126. 108.24 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  7127. 108.24 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  7128. 108.24 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  7129. 108.24 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  7130. 108.24 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  7131. 108.24 s [algebraic-graphs]
  7132. 108.24 s [algebraic-graphs] ============ Relation.closure ============
  7133. 108.24 s [algebraic-graphs] OK: closure empty == empty
  7134. 108.24 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  7135. 108.24 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  7136. 108.24 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  7137. 108.24 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  7138. 108.24 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  7139. 108.24 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  7140. 108.24 s [algebraic-graphs] OK: closure . closure == closure
  7141. 108.24 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  7142. 108.24 s [algebraic-graphs]
  7143. 108.24 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  7144. 108.24 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  7145. 108.24 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  7146. 108.24 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  7147. 108.24 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  7148. 108.24 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  7149. 108.24 s [algebraic-graphs]
  7150. 108.24 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  7151. 108.24 s [algebraic-graphs] OK: symmetricClosure empty == empty
  7152. 108.24 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  7153. 108.24 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  7154. 108.24 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  7155. 108.24 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  7156. 108.24 s [algebraic-graphs]
  7157. 108.24 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  7158. 108.24 s [algebraic-graphs] OK: transitiveClosure empty == empty
  7159. 108.24 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  7160. 108.24 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  7161. 108.24 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  7162. 108.24 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  7163. 108.24 s [algebraic-graphs]
  7164. 108.24 s [algebraic-graphs] ============ Relation.induceJust ============
  7165. 108.24 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  7166. 108.24 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  7167. 108.24 s [algebraic-graphs] OK: induceJust . gmap Just == id
  7168. 108.24 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  7169. 108.24 s [algebraic-graphs]
  7170. 108.24 s [algebraic-graphs] ============ ReflexiveRelation ============
  7171. 108.24 s [algebraic-graphs] OK: Axioms of reflexive graphs
  7172. 108.24 s [algebraic-graphs]
  7173. 108.24 s [algebraic-graphs] ============ TransitiveRelation ============
  7174. 108.24 s [algebraic-graphs] OK: Axioms of transitive graphs
  7175. 108.24 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  7176. 108.24 s [algebraic-graphs]
  7177. 108.24 s [algebraic-graphs] ============ PreorderRelation ============
  7178. 108.24 s [algebraic-graphs] OK: Axioms of preorder graphs
  7179. 108.24 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  7180. 108.24 s [algebraic-graphs]
  7181. 108.24 s [algebraic-graphs] ============ Symmetric.Relation ============
  7182. 108.24 s [algebraic-graphs] OK: Axioms of undirected graphs
  7183. 108.24 s [algebraic-graphs]
  7184. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  7185. 108.24 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  7186. 108.24 s [algebraic-graphs]
  7187. 108.24 s [algebraic-graphs] OK: consistent empty == True
  7188. 108.24 s [algebraic-graphs] OK: consistent (vertex x) == True
  7189. 108.24 s [algebraic-graphs] OK: consistent (overlay x y) == True
  7190. 108.24 s [algebraic-graphs] OK: consistent (connect x y) == True
  7191. 108.24 s [algebraic-graphs] OK: consistent (edge x y) == True
  7192. 108.24 s [algebraic-graphs] OK: consistent (edges xs) == True
  7193. 108.24 s [algebraic-graphs] OK: consistent (stars xs) == True
  7194. 108.24 s [algebraic-graphs]
  7195. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  7196. 108.24 s [algebraic-graphs] OK: show (empty ) == "empty"
  7197. 108.24 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  7198. 108.24 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  7199. 108.24 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  7200. 108.24 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  7201. 108.24 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  7202. 108.24 s [algebraic-graphs]
  7203. 108.24 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  7204. 108.24 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  7205. 108.24 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  7206. 108.24 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  7207. 108.24 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  7208. 108.24 s [algebraic-graphs]
  7209. 108.24 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  7210. 108.24 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  7211. 108.24 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  7212. 108.24 s [algebraic-graphs]
  7213. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  7214. 108.24 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  7215. 108.24 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  7216. 108.24 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  7217. 108.24 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  7218. 108.24 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  7219. 108.24 s [algebraic-graphs]
  7220. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  7221. 108.24 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  7222. 108.24 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  7223. 108.24 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  7224. 108.24 s [algebraic-graphs]
  7225. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  7226. 108.24 s [algebraic-graphs] OK: vertex 1 < vertex 2
  7227. 108.24 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  7228. 108.24 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  7229. 108.24 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  7230. 108.24 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  7231. 108.24 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  7232. 108.24 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  7233. 108.24 s [algebraic-graphs] OK: x <= x + y
  7234. 108.24 s [algebraic-graphs] OK: x + y <= x * y
  7235. 108.24 s [algebraic-graphs]
  7236. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  7237. 108.24 s [algebraic-graphs] OK: isEmpty empty == True
  7238. 108.24 s [algebraic-graphs] OK: hasVertex x empty == False
  7239. 108.24 s [algebraic-graphs] OK: vertexCount empty == 0
  7240. 108.24 s [algebraic-graphs] OK: edgeCount empty == 0
  7241. 108.24 s [algebraic-graphs]
  7242. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  7243. 108.24 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  7244. 108.24 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  7245. 108.24 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  7246. 108.24 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  7247. 108.24 s [algebraic-graphs]
  7248. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  7249. 108.24 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  7250. 108.24 s [algebraic-graphs] OK: edge x y == edge y x
  7251. 108.24 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  7252. 108.24 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  7253. 108.24 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  7254. 108.24 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  7255. 108.24 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  7256. 108.24 s [algebraic-graphs]
  7257. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  7258. 108.24 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  7259. 108.24 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  7260. 108.24 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  7261. 108.24 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  7262. 108.24 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  7263. 108.24 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  7264. 108.24 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  7265. 108.24 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  7266. 108.24 s [algebraic-graphs]
  7267. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  7268. 108.24 s [algebraic-graphs] OK: connect x y == connect y x
  7269. 108.24 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  7270. 108.24 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  7271. 108.24 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  7272. 108.24 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  7273. 108.24 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  7274. 108.24 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  7275. 108.24 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  7276. 108.24 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  7277. 108.24 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  7278. 108.24 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  7279. 108.24 s [algebraic-graphs]
  7280. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  7281. 108.24 s [algebraic-graphs] OK: vertices [] == empty
  7282. 108.24 s [algebraic-graphs] OK: vertices [x] == vertex x
  7283. 108.24 s [algebraic-graphs] OK: vertices == overlays . map vertex
  7284. 108.24 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  7285. 108.24 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  7286. 108.24 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  7287. 108.24 s [algebraic-graphs]
  7288. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  7289. 108.24 s [algebraic-graphs] OK: edges [] == empty
  7290. 108.24 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  7291. 108.24 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  7292. 108.24 s [algebraic-graphs]
  7293. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  7294. 108.24 s [algebraic-graphs] OK: overlays [] == empty
  7295. 109.21 s [haskell-language-server] Preprocessing library 'hls-stylish-haskell-plugin' for haskell-language-server-2.12.0.0..
  7296. 109.21 s [haskell-language-server] Building library 'hls-stylish-haskell-plugin' for haskell-language-server-2.12.0.0..
  7297. 109.32 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.StylishHaskell ( plugins/hls-stylish-haskell-plugin/src/Ide/Plugin/StylishHaskell.hs, dist/build/hls-stylish-haskell-plugin/Ide/Plugin/StylishHaskell.o, dist/build/hls-stylish-haskell-plugin/Ide/Plugin/StylishHaskell.dyn_o )
  7298. 111.55 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.StylishHaskell ( plugins/hls-stylish-haskell-plugin/src/Ide/Plugin/StylishHaskell.hs, dist/build/hls-stylish-haskell-plugin/Ide/Plugin/StylishHaskell.p_o )
  7299. 118.11 s [algebraic-graphs] OK: overlays [x] == x
  7300. 118.11 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  7301. 118.11 s [algebraic-graphs] OK: overlays == foldr overlay empty
  7302. 118.15 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  7303. 118.15 s [algebraic-graphs]
  7304. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  7305. 118.15 s [algebraic-graphs] OK: connects [] == empty
  7306. 118.15 s [algebraic-graphs] OK: connects [x] == x
  7307. 118.15 s [algebraic-graphs] OK: connects [x,y] == connect x y
  7308. 118.15 s [algebraic-graphs] OK: connects == foldr connect empty
  7309. 118.15 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  7310. 118.15 s [algebraic-graphs] OK: connects == connects . reverse
  7311. 118.15 s [algebraic-graphs]
  7312. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  7313. 118.15 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  7314. 118.15 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  7315. 118.15 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  7316. 118.15 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  7317. 118.15 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  7318. 118.15 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  7319. 118.15 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  7320. 118.15 s [algebraic-graphs]
  7321. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  7322. 118.15 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  7323. 118.15 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  7324. 118.15 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  7325. 118.15 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  7326. 118.15 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  7327. 118.15 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  7328. 118.15 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  7329. 118.15 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  7330. 118.15 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  7331. 118.15 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  7332. 118.15 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  7333. 118.15 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  7334. 118.15 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  7335. 118.15 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  7336. 118.15 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  7337. 118.15 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  7338. 118.15 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  7339. 118.15 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  7340. 118.15 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  7341. 118.15 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  7342. 118.15 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  7343. 118.15 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  7344. 118.15 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  7345. 118.15 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  7346. 118.15 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  7347. 118.15 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  7348. 118.15 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  7349. 118.15 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  7350. 118.15 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  7351. 118.15 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  7352. 118.15 s [algebraic-graphs]
  7353. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  7354. 118.15 s [algebraic-graphs] OK: isEmpty empty == True
  7355. 118.15 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  7356. 118.15 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  7357. 118.15 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  7358. 118.15 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  7359. 118.15 s [algebraic-graphs]
  7360. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  7361. 118.15 s [algebraic-graphs] OK: hasVertex x empty == False
  7362. 118.15 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  7363. 118.15 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  7364. 118.15 s [algebraic-graphs]
  7365. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  7366. 118.15 s [algebraic-graphs] OK: hasEdge x y empty == False
  7367. 118.15 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  7368. 118.15 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  7369. 118.15 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  7370. 118.15 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  7371. 118.15 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  7372. 118.15 s [algebraic-graphs]
  7373. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  7374. 118.15 s [algebraic-graphs] OK: vertexCount empty == 0
  7375. 118.15 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  7376. 118.15 s [algebraic-graphs] OK: vertexCount == length . vertexList
  7377. 118.15 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  7378. 118.15 s [algebraic-graphs]
  7379. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  7380. 118.15 s [algebraic-graphs] OK: edgeCount empty == 0
  7381. 118.15 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  7382. 118.15 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  7383. 118.15 s [algebraic-graphs] OK: edgeCount == length . edgeList
  7384. 118.15 s [algebraic-graphs]
  7385. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  7386. 118.15 s [algebraic-graphs] OK: vertexList empty == []
  7387. 118.15 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  7388. 118.15 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  7389. 118.15 s [algebraic-graphs]
  7390. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  7391. 118.15 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  7392. 118.15 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  7393. 118.15 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  7394. 118.15 s [algebraic-graphs]
  7395. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  7396. 118.15 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  7397. 118.15 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  7398. 118.15 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  7399. 118.15 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  7400. 118.15 s [algebraic-graphs]
  7401. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  7402. 118.15 s [algebraic-graphs] OK: edgeList empty == []
  7403. 118.15 s [algebraic-graphs] OK: edgeList (vertex x) == []
  7404. 118.15 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  7405. 118.15 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  7406. 118.15 s [algebraic-graphs]
  7407. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  7408. 118.15 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  7409. 118.15 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  7410. 118.15 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  7411. 118.15 s [algebraic-graphs]
  7412. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  7413. 118.15 s [algebraic-graphs] OK: adjacencyList empty == []
  7414. 118.15 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  7415. 118.15 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  7416. 118.15 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  7417. 118.15 s [algebraic-graphs]
  7418. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  7419. 118.15 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  7420. 118.15 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  7421. 118.15 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  7422. 118.15 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  7423. 118.15 s [algebraic-graphs]
  7424. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  7425. 118.15 s [algebraic-graphs] OK: path [] == empty
  7426. 118.15 s [algebraic-graphs] OK: path [x] == vertex x
  7427. 118.15 s [algebraic-graphs] OK: path [x,y] == edge x y
  7428. 118.15 s [algebraic-graphs] OK: path == path . reverse
  7429. 118.15 s [algebraic-graphs]
  7430. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  7431. 118.15 s [algebraic-graphs] OK: circuit [] == empty
  7432. 118.15 s [algebraic-graphs] OK: circuit [x] == edge x x
  7433. 118.15 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  7434. 118.15 s [algebraic-graphs] OK: circuit == circuit . reverse
  7435. 118.15 s [algebraic-graphs]
  7436. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  7437. 118.15 s [algebraic-graphs] OK: clique [] == empty
  7438. 118.15 s [algebraic-graphs] OK: clique [x] == vertex x
  7439. 118.15 s [algebraic-graphs] OK: clique [x,y] == edge x y
  7440. 118.15 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  7441. 118.15 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  7442. 118.15 s [algebraic-graphs] OK: clique == clique . reverse
  7443. 118.15 s [algebraic-graphs]
  7444. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  7445. 118.15 s [algebraic-graphs] OK: biclique [] [] == empty
  7446. 118.15 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  7447. 118.15 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  7448. 118.15 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  7449. 118.15 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  7450. 118.15 s [algebraic-graphs]
  7451. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  7452. 118.15 s [algebraic-graphs] OK: star x [] == vertex x
  7453. 118.15 s [algebraic-graphs] OK: star x [y] == edge x y
  7454. 118.15 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  7455. 118.15 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  7456. 118.15 s [algebraic-graphs]
  7457. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  7458. 118.15 s [algebraic-graphs] OK: stars [] == empty
  7459. 118.15 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  7460. 118.15 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  7461. 118.15 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  7462. 118.15 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  7463. 118.15 s [algebraic-graphs] OK: stars . adjacencyList == id
  7464. 118.15 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  7465. 118.15 s [algebraic-graphs]
  7466. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  7467. 118.15 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  7468. 118.15 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  7469. 118.15 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  7470. 118.15 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  7471. 118.15 s [algebraic-graphs]
  7472. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  7473. 118.15 s [algebraic-graphs] OK: forest [] == empty
  7474. 121.19 s [haskell-language-server] Preprocessing library 'hls-pragmas-plugin' for haskell-language-server-2.12.0.0..
  7475. 121.19 s [haskell-language-server] Building library 'hls-pragmas-plugin' for haskell-language-server-2.12.0.0..
  7476. 121.29 s [haskell-language-server]
  7477. 121.29 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  7478. 121.29 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  7479. 121.29 s [haskell-language-server] but were not needed for compilation:
  7480. 121.29 s [haskell-language-server] - lens-aeson-1.2.3 (exposed by flag -package-id lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6)
  7481. 121.29 s [haskell-language-server] - transformers-0.6.1.0 (exposed by flag -package-id transformers-0.6.1.0)
  7482. 121.30 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Pragmas ( plugins/hls-pragmas-plugin/src/Ide/Plugin/Pragmas.hs, dist/build/hls-pragmas-plugin/Ide/Plugin/Pragmas.o, dist/build/hls-pragmas-plugin/Ide/Plugin/Pragmas.dyn_o )
  7483. 123.65 s [haskell-language-server]
  7484. 123.65 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  7485. 123.73 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  7486. 123.73 s [haskell-language-server] but were not needed for compilation:
  7487. 123.73 s [haskell-language-server] - lens-aeson-1.2.3 (exposed by flag -package-id lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6)
  7488. 123.73 s [haskell-language-server] - transformers-0.6.1.0 (exposed by flag -package-id transformers-0.6.1.0)
  7489. 123.73 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Pragmas ( plugins/hls-pragmas-plugin/src/Ide/Plugin/Pragmas.hs, dist/build/hls-pragmas-plugin/Ide/Plugin/Pragmas.p_o )
  7490. 124.32 s [algebraic-graphs] OK: forest [x] == tree x
  7491. 124.32 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  7492. 124.32 s [algebraic-graphs] OK: forest == overlays . map tree
  7493. 124.32 s [algebraic-graphs]
  7494. 124.32 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  7495. 124.32 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  7496. 124.32 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  7497. 124.32 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  7498. 124.32 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  7499. 124.32 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  7500. 124.32 s [algebraic-graphs]
  7501. 124.32 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  7502. 124.32 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  7503. 124.32 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  7504. 124.32 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  7505. 124.32 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  7506. 124.32 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  7507. 124.32 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  7508. 124.32 s [algebraic-graphs]
  7509. 124.32 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  7510. 124.32 s [algebraic-graphs] OK: replaceVertex x x == id
  7511. 124.32 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  7512. 124.32 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  7513. 124.32 s [algebraic-graphs]
  7514. 124.32 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  7515. 124.32 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  7516. 124.32 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  7517. 124.32 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  7518. 124.32 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  7519. 124.32 s [algebraic-graphs]
  7520. 124.32 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  7521. 124.32 s [algebraic-graphs] OK: gmap f empty == empty
  7522. 124.32 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  7523. 124.32 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  7524. 124.32 s [algebraic-graphs] OK: gmap id == id
  7525. 124.32 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  7526. 124.32 s [algebraic-graphs]
  7527. 124.32 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  7528. 124.32 s [algebraic-graphs] OK: induce (const True ) x == x
  7529. 124.32 s [algebraic-graphs] OK: induce (const False) x == empty
  7530. 124.32 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  7531. 124.32 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  7532. 124.32 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  7533. 124.32 s [algebraic-graphs]
  7534. 124.32 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  7535. 124.32 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  7536. 124.32 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  7537. 124.32 s [algebraic-graphs] OK: induceJust . gmap Just == id
  7538. 124.32 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  7539. 124.32 s [algebraic-graphs]
  7540. 124.32 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  7541. 124.32 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  7542. 124.32 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  7543. 124.32 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  7544. 124.32 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  7545. 124.32 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  7546. 124.32 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  7547. 124.32 s [algebraic-graphs]
  7548. 124.32 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  7549. 124.32 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  7550. 124.32 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  7551. 124.32 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  7552. 124.32 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  7553. 124.32 s [algebraic-graphs]
  7554. 124.32 s [algebraic-graphs] ============ Typed ============
  7555. 124.32 s [algebraic-graphs]
  7556. 124.32 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  7557. 124.32 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  7558. 124.32 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  7559. 124.32 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  7560. 124.32 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  7561. 124.32 s [algebraic-graphs]
  7562. 124.32 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  7563. 124.32 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  7564. 124.32 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  7565. 124.32 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  7566. 124.32 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  7567. 124.32 s [algebraic-graphs]
  7568. 124.32 s [algebraic-graphs] ============ Typed.dfsForest ============
  7569. 124.32 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  7570. 124.32 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  7571. 124.32 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  7572. 124.32 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  7573. 124.32 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  7574. 124.32 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  7575. 124.32 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  7576. 124.32 s [algebraic-graphs]
  7577. 124.32 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  7578. 124.32 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  7579. 124.32 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  7580. 124.32 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  7581. 124.32 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  7582. 124.32 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  7583. 124.32 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  7584. 124.32 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  7585. 124.32 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  7586. 124.32 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  7587. 124.32 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  7588. 124.32 s [algebraic-graphs]
  7589. 124.32 s [algebraic-graphs] ============ Typed.dfs ============
  7590. 124.32 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  7591. 124.32 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  7592. 124.32 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  7593. 124.32 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  7594. 124.32 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  7595. 124.32 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  7596. 124.32 s [algebraic-graphs] OK: dfs % x $ [] == []
  7597. 124.32 s [algebraic-graphs]
  7598. 124.32 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  7599. 124.32 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  7600. 124.32 s [algebraic-graphs]
  7601. 124.32 s [algebraic-graphs] ============ Typed.topSort ============
  7602. 124.32 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  7603. 124.32 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  7604. 124.32 s [algebraic-graphs]
  7605. 124.32 s [algebraic-graphs] ============ Graph.Undirected ============
  7606. 124.32 s [algebraic-graphs] OK: Axioms of undirected graphs
  7607. 124.32 s [algebraic-graphs]
  7608. 124.32 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  7609. 124.32 s [algebraic-graphs] OK: show (empty ) == "empty"
  7610. 124.32 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  7611. 124.32 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  7612. 124.32 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  7613. 124.32 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  7614. 124.32 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  7615. 124.32 s [algebraic-graphs]
  7616. 124.32 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  7617. 124.32 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  7618. 124.32 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  7619. 124.32 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  7620. 124.32 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  7621. 124.32 s [algebraic-graphs]
  7622. 124.32 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  7623. 124.32 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  7624. 124.32 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  7625. 124.32 s [algebraic-graphs]
  7626. 124.32 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  7627. 124.32 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  7628. 124.32 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  7629. 124.32 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  7630. 124.32 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  7631. 124.32 s [algebraic-graphs]
  7632. 124.32 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  7633. 124.32 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  7634. 124.32 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  7635. 124.32 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  7636. 124.32 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  7637. 124.32 s [algebraic-graphs]
  7638. 124.32 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  7639. 124.32 s [algebraic-graphs] OK: complement empty == empty
  7640. 124.32 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  7641. 124.32 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  7642. 124.32 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  7643. 124.32 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  7644. 124.32 s [algebraic-graphs] OK: complement . complement == id
  7645. 124.32 s [algebraic-graphs]
  7646. 124.32 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  7647. 124.32 s [algebraic-graphs] OK: vertex 1 < vertex 2
  7648. 124.32 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  7649. 124.32 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  7650. 124.32 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  7651. 124.32 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  7652. 124.32 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  7653. 124.32 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  7654. 124.32 s [algebraic-graphs] OK: x <= x + y
  7655. 124.32 s [algebraic-graphs] OK: x + y <= x * y
  7656. 124.32 s [algebraic-graphs]
  7657. 124.32 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  7658. 124.32 s [algebraic-graphs] OK: isEmpty empty == True
  7659. 124.32 s [algebraic-graphs] OK: hasVertex x empty == False
  7660. 124.32 s [algebraic-graphs] OK: vertexCount empty == 0
  7661. 124.32 s [algebraic-graphs] OK: edgeCount empty == 0
  7662. 124.32 s [algebraic-graphs]
  7663. 124.32 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  7664. 124.32 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  7665. 124.32 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  7666. 124.32 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  7667. 124.32 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  7668. 124.32 s [algebraic-graphs]
  7669. 124.32 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  7670. 124.32 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  7671. 124.32 s [algebraic-graphs] OK: edge x y == edge y x
  7672. 131.06 s [haskell-language-server] Preprocessing library 'hls-semantic-tokens-plugin' for haskell-language-server-2.12.0.0..
  7673. 131.07 s [haskell-language-server] Building library 'hls-semantic-tokens-plugin' for haskell-language-server-2.12.0.0..
  7674. 131.17 s [haskell-language-server]
  7675. 131.17 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  7676. 131.17 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  7677. 131.17 s [haskell-language-server] but were not needed for compilation:
  7678. 131.17 s [haskell-language-server] - syb-0.7.2.4 (exposed by flag -package-id syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy)
  7679. 131.18 s [haskell-language-server] [1 of 8] Compiling Ide.Plugin.SemanticTokens.Types ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Types.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Types.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Types.dyn_o )
  7680. 131.71 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  7681. 131.71 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  7682. 131.71 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  7683. 131.71 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  7684. 131.71 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  7685. 131.71 s [algebraic-graphs]
  7686. 131.71 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  7687. 131.71 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  7688. 131.71 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  7689. 131.71 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  7690. 131.71 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  7691. 131.71 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  7692. 131.71 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  7693. 131.71 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  7694. 131.71 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  7695. 131.71 s [algebraic-graphs]
  7696. 131.71 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  7697. 131.71 s [algebraic-graphs] OK: connect x y == connect y x
  7698. 131.71 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  7699. 131.71 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  7700. 131.71 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  7701. 131.71 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  7702. 131.71 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  7703. 131.71 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  7704. 131.71 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  7705. 131.71 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  7706. 131.71 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  7707. 131.71 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  7708. 131.71 s [algebraic-graphs]
  7709. 131.71 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  7710. 131.71 s [algebraic-graphs] OK: vertices [] == empty
  7711. 131.71 s [algebraic-graphs] OK: vertices [x] == vertex x
  7712. 131.71 s [algebraic-graphs] OK: vertices == overlays . map vertex
  7713. 131.71 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  7714. 131.71 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  7715. 131.71 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  7716. 131.71 s [algebraic-graphs]
  7717. 131.71 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  7718. 131.71 s [algebraic-graphs] OK: edges [] == empty
  7719. 131.71 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  7720. 131.71 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  7721. 131.71 s [algebraic-graphs]
  7722. 131.71 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  7723. 131.71 s [algebraic-graphs] OK: overlays [] == empty
  7724. 131.71 s [algebraic-graphs] OK: overlays [x] == x
  7725. 131.71 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  7726. 131.71 s [algebraic-graphs] OK: overlays == foldr overlay empty
  7727. 131.71 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  7728. 131.71 s [algebraic-graphs]
  7729. 131.71 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  7730. 131.71 s [algebraic-graphs] OK: connects [] == empty
  7731. 131.71 s [algebraic-graphs] OK: connects [x] == x
  7732. 131.71 s [algebraic-graphs] OK: connects [x,y] == connect x y
  7733. 131.71 s [algebraic-graphs] OK: connects == foldr connect empty
  7734. 131.71 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  7735. 131.71 s [algebraic-graphs] OK: connects == connects . reverse
  7736. 131.71 s [algebraic-graphs]
  7737. 131.71 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  7738. 131.71 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  7739. 131.71 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  7740. 131.71 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  7741. 131.71 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  7742. 131.71 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  7743. 131.71 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  7744. 131.71 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  7745. 131.71 s [algebraic-graphs]
  7746. 131.71 s [algebraic-graphs] ============ Graph.Undirected.path ============
  7747. 131.71 s [algebraic-graphs] OK: path [] == empty
  7748. 131.72 s [algebraic-graphs] OK: path [x] == vertex x
  7749. 131.72 s [algebraic-graphs] OK: path [x,y] == edge x y
  7750. 131.72 s [algebraic-graphs] OK: path == path . reverse
  7751. 131.72 s [algebraic-graphs]
  7752. 131.72 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  7753. 131.72 s [algebraic-graphs] OK: circuit [] == empty
  7754. 131.72 s [algebraic-graphs] OK: circuit [x] == edge x x
  7755. 131.72 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  7756. 131.72 s [algebraic-graphs] OK: circuit == circuit . reverse
  7757. 131.72 s [algebraic-graphs]
  7758. 131.72 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  7759. 131.72 s [algebraic-graphs] OK: clique [] == empty
  7760. 131.72 s [algebraic-graphs] OK: clique [x] == vertex x
  7761. 131.72 s [algebraic-graphs] OK: clique [x,y] == edge x y
  7762. 131.72 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  7763. 131.72 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  7764. 131.72 s [algebraic-graphs] OK: clique == clique . reverse
  7765. 131.72 s [algebraic-graphs]
  7766. 131.72 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  7767. 131.72 s [algebraic-graphs] OK: biclique [] [] == empty
  7768. 131.72 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  7769. 131.72 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  7770. 131.72 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  7771. 131.72 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  7772. 131.72 s [algebraic-graphs]
  7773. 131.72 s [algebraic-graphs] ============ Graph.Undirected.star ============
  7774. 131.72 s [algebraic-graphs] OK: star x [] == vertex x
  7775. 131.72 s [algebraic-graphs] OK: star x [y] == edge x y
  7776. 131.72 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  7777. 131.72 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  7778. 131.72 s [algebraic-graphs]
  7779. 131.72 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  7780. 131.72 s [algebraic-graphs] OK: stars [] == empty
  7781. 131.72 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  7782. 131.72 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  7783. 131.72 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  7784. 131.72 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  7785. 131.72 s [algebraic-graphs] OK: stars . adjacencyList == id
  7786. 131.72 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  7787. 131.72 s [algebraic-graphs]
  7788. 131.72 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  7789. 131.72 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  7790. 131.72 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  7791. 131.72 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  7792. 131.72 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  7793. 131.72 s [algebraic-graphs]
  7794. 131.72 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  7795. 131.72 s [algebraic-graphs] OK: forest [] == empty
  7796. 131.72 s [algebraic-graphs] OK: forest [x] == tree x
  7797. 131.72 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  7798. 131.72 s [algebraic-graphs] OK: forest == overlays . map tree
  7799. 131.72 s [algebraic-graphs]
  7800. 131.72 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  7801. 131.72 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  7802. 131.72 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  7803. 131.72 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  7804. 131.72 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  7805. 131.72 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  7806. 131.72 s [algebraic-graphs]
  7807. 131.72 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  7808. 131.72 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  7809. 131.72 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  7810. 131.72 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  7811. 131.72 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  7812. 131.72 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  7813. 131.72 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  7814. 131.72 s [algebraic-graphs]
  7815. 131.72 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  7816. 131.72 s [algebraic-graphs] OK: replaceVertex x x == id
  7817. 131.72 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  7818. 131.72 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  7819. 131.72 s [algebraic-graphs]
  7820. 131.72 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  7821. 131.72 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  7822. 131.72 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  7823. 131.72 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  7824. 131.72 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  7825. 131.72 s [algebraic-graphs]
  7826. 131.72 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  7827. 131.72 s [algebraic-graphs] OK: gmap f empty == empty
  7828. 131.72 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  7829. 131.72 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  7830. 131.72 s [algebraic-graphs] OK: gmap id == id
  7831. 131.72 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  7832. 131.72 s [algebraic-graphs]
  7833. 131.72 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  7834. 131.72 s [algebraic-graphs] OK: induce (const True ) x == x
  7835. 131.72 s [algebraic-graphs] OK: induce (const False) x == empty
  7836. 131.72 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  7837. 131.72 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  7838. 131.72 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  7839. 131.72 s [algebraic-graphs]
  7840. 131.72 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  7841. 131.72 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  7842. 131.72 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  7843. 131.72 s [algebraic-graphs] OK: induceJust . gmap Just == id
  7844. 131.72 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  7845. 131.73 s [algebraic-graphs] Test suite main: PASS
  7846. 131.73 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  7847. 131.73 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  7848. 131.74 s [algebraic-graphs] checkPhase completed in 1 minutes 39 seconds
  7849. 131.74 s [algebraic-graphs] Phase: haddockPhase
  7850. 131.87 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  7851. 131.88 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  7852. 131.92 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  7853. 132.17 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  7854. 132.31 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  7855. 132.36 s [algebraic-graphs] Warning: 'nub' is out of scope.
  7856. 132.36 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7857. 132.36 s [algebraic-graphs] Warning: 'sort' is out of scope.
  7858. 132.36 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7859. 132.37 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  7860. 132.37 s [algebraic-graphs] Missing documentation for:
  7861. 132.37 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  7862. 132.40 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  7863. 132.40 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7864. 132.40 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  7865. 132.56 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  7866. 132.64 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  7867. 132.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7868. 132.64 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  7869. 132.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7870. 132.64 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  7871. 132.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7872. 132.64 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  7873. 132.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7874. 132.65 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  7875. 132.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7876. 132.65 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  7877. 132.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7878. 132.65 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  7879. 132.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7880. 132.65 s [algebraic-graphs] Warning: 'box' is out of scope.
  7881. 132.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7882. 132.65 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  7883. 132.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7884. 132.65 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  7885. 132.71 s [algebraic-graphs] Warning: 'nub' is out of scope.
  7886. 132.71 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7887. 132.72 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  7888. 132.86 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  7889. 132.86 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7890. 132.87 s [haskell-language-server] [2 of 8] Compiling Ide.Plugin.SemanticTokens.Tokenize ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Tokenize.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Tokenize.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Tokenize.dyn_o )
  7891. 132.87 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  7892. 132.98 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  7893. 133.13 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  7894. 133.13 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7895. 133.14 s [algebraic-graphs] Warning: 'empty' is out of scope.
  7896. 133.14 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7897. 133.14 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  7898. 133.14 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7899. 133.14 s [algebraic-graphs] Warning: 'edges' is out of scope.
  7900. 133.14 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7901. 133.14 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  7902. 133.14 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7903. 133.15 s [algebraic-graphs] Warning: 'stars' is out of scope.
  7904. 133.15 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7905. 133.15 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  7906. 133.20 s [algebraic-graphs] Warning: 'nub' is out of scope.
  7907. 133.20 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7908. 133.20 s [algebraic-graphs] Warning: 'sort' is out of scope.
  7909. 133.20 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7910. 133.20 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  7911. 133.20 s [algebraic-graphs] Missing documentation for:
  7912. 133.20 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  7913. 133.26 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  7914. 133.31 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  7915. 133.33 s [haskell-language-server] [3 of 8] Compiling Ide.Plugin.SemanticTokens.SemanticConfig ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/SemanticConfig.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/SemanticConfig.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/SemanticConfig.dyn_o )
  7916. 133.33 s [haskell-language-server] [4 of 8] Compiling Ide.Plugin.SemanticTokens.Utils ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Utils.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Utils.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Utils.dyn_o )
  7917. 133.33 s [haskell-language-server] [5 of 8] Compiling Ide.Plugin.SemanticTokens.Mappings ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Mappings.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Mappings.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Mappings.dyn_o )
  7918. 133.33 s [haskell-language-server] [6 of 8] Compiling Ide.Plugin.SemanticTokens.Query ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Query.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Query.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Query.dyn_o )
  7919. 133.33 s [algebraic-graphs]
  7920. 133.34 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  7921. 133.34 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  7922. 133.34 s [algebraic-graphs] will become an error in a future GHC release.
  7923. 133.34 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  7924. 133.34 s [algebraic-graphs] |
  7925. 133.34 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  7926. 133.34 s [algebraic-graphs] | ^
  7927. 133.34 s [algebraic-graphs]
  7928. 133.34 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  7929. 133.34 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  7930. 133.34 s [algebraic-graphs] will become an error in a future GHC release.
  7931. 133.34 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  7932. 133.34 s [algebraic-graphs] |
  7933. 133.34 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  7934. 133.34 s [algebraic-graphs] | ^
  7935. 133.34 s [algebraic-graphs]
  7936. 133.34 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  7937. 133.34 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  7938. 133.34 s [algebraic-graphs] will become an error in a future GHC release.
  7939. 133.34 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  7940. 133.34 s [algebraic-graphs] |
  7941. 133.34 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  7942. 133.34 s [algebraic-graphs] | ^
  7943. 133.34 s [algebraic-graphs]
  7944. 133.34 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  7945. 133.34 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  7946. 133.34 s [algebraic-graphs] will become an error in a future GHC release.
  7947. 133.34 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  7948. 133.34 s [algebraic-graphs] |
  7949. 133.34 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  7950. 133.34 s [algebraic-graphs] | ^
  7951. 133.34 s [algebraic-graphs]
  7952. 133.34 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  7953. 133.34 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  7954. 133.34 s [algebraic-graphs] will become an error in a future GHC release.
  7955. 133.34 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  7956. 133.34 s [algebraic-graphs] |
  7957. 133.34 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  7958. 133.34 s [algebraic-graphs] | ^
  7959. 133.34 s [algebraic-graphs]
  7960. 133.34 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  7961. 133.34 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  7962. 133.34 s [algebraic-graphs] will become an error in a future GHC release.
  7963. 133.34 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  7964. 133.34 s [algebraic-graphs] |
  7965. 133.34 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  7966. 133.34 s [algebraic-graphs] | ^
  7967. 133.34 s [algebraic-graphs]
  7968. 133.35 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  7969. 133.35 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  7970. 133.35 s [algebraic-graphs] will become an error in a future GHC release.
  7971. 133.35 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  7972. 133.35 s [algebraic-graphs] |
  7973. 133.35 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  7974. 133.35 s [algebraic-graphs] | ^
  7975. 133.37 s [haskell-language-server] [7 of 8] Compiling Ide.Plugin.SemanticTokens.Internal ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Internal.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Internal.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Internal.dyn_o )
  7976. 133.43 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  7977. 133.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7978. 133.44 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  7979. 133.50 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  7980. 133.56 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  7981. 133.56 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7982. 133.57 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  7983. 133.66 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  7984. 133.81 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  7985. 133.85 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  7986. 133.86 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  7987. 133.87 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  7988. 133.88 s [algebraic-graphs]
  7989. 133.88 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  7990. 133.88 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  7991. 133.88 s [algebraic-graphs] will become an error in a future GHC release.
  7992. 133.88 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  7993. 133.88 s [algebraic-graphs] |
  7994. 133.88 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  7995. 133.88 s [algebraic-graphs] | ^
  7996. 133.89 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  7997. 133.89 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  7998. 133.89 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  7999. 133.90 s [algebraic-graphs]
  8000. 133.90 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  8001. 133.90 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  8002. 133.90 s [algebraic-graphs] will become an error in a future GHC release.
  8003. 133.90 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  8004. 133.90 s [algebraic-graphs] |
  8005. 133.90 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  8006. 133.90 s [algebraic-graphs] | ^
  8007. 133.90 s [algebraic-graphs]
  8008. 133.90 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  8009. 133.90 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  8010. 133.90 s [algebraic-graphs] will become an error in a future GHC release.
  8011. 133.90 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  8012. 133.90 s [algebraic-graphs] |
  8013. 133.90 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  8014. 133.90 s [algebraic-graphs] | ^
  8015. 133.94 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  8016. 133.98 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  8017. 134.07 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  8018. 134.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  8019. 134.07 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  8020. 134.08 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  8021. 134.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  8022. 134.08 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  8023. 134.09 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  8024. 134.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  8025. 134.09 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  8026. 134.10 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  8027. 134.10 s [algebraic-graphs] Missing documentation for:
  8028. 134.10 s [algebraic-graphs] Module header
  8029. 134.10 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  8030. 134.10 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:41)
  8031. 134.10 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:22)
  8032. 134.10 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:26)
  8033. 134.10 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:34)
  8034. 134.10 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:38)
  8035. 134.10 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:30)
  8036. 134.11 s [algebraic-graphs] Warning: 'array' is out of scope.
  8037. 134.11 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  8038. 134.12 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  8039. 134.12 s [algebraic-graphs] Missing documentation for:
  8040. 134.12 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:191)
  8041. 135.34 s [haskell-language-server] [8 of 8] Compiling Ide.Plugin.SemanticTokens ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens.dyn_o )
  8042. 135.70 s [haskell-language-server]
  8043. 135.70 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  8044. 135.70 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  8045. 135.70 s [haskell-language-server] but were not needed for compilation:
  8046. 135.70 s [haskell-language-server] - syb-0.7.2.4 (exposed by flag -package-id syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy)
  8047. 135.71 s [haskell-language-server] [1 of 8] Compiling Ide.Plugin.SemanticTokens.Types ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Types.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Types.p_o )
  8048. 137.19 s [haskell-language-server] [2 of 8] Compiling Ide.Plugin.SemanticTokens.Tokenize ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Tokenize.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Tokenize.p_o )
  8049. 137.30 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  8050. 137.30 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  8051. 137.31 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  8052. 137.33 s [algebraic-graphs] Phase: installPhase
  8053. 137.40 s [algebraic-graphs] Installing library in /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  8054. 137.65 s [haskell-language-server] [3 of 8] Compiling Ide.Plugin.SemanticTokens.SemanticConfig ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/SemanticConfig.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/SemanticConfig.p_o )
  8055. 137.65 s [haskell-language-server] [4 of 8] Compiling Ide.Plugin.SemanticTokens.Utils ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Utils.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Utils.p_o )
  8056. 137.65 s [haskell-language-server] [5 of 8] Compiling Ide.Plugin.SemanticTokens.Mappings ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Mappings.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Mappings.p_o )
  8057. 137.65 s [haskell-language-server] [6 of 8] Compiling Ide.Plugin.SemanticTokens.Query ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Query.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Query.p_o )
  8058. 137.77 s [haskell-language-server] [7 of 8] Compiling Ide.Plugin.SemanticTokens.Internal ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Internal.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Internal.p_o )
  8059. 138.05 s [algebraic-graphs] Phase: fixupPhase
  8060. 138.06 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7
  8061. 138.07 s [algebraic-graphs] shrinking /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSalgebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE-ghc9.6.7.so
  8062. 138.09 s [algebraic-graphs] checking for references to /build/ in /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7...
  8063. 138.13 s [algebraic-graphs] patching script interpreter paths in /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7
  8064. 138.13 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/lib
  8065. 138.39 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc
  8066. 138.41 s [algebraic-graphs] checking for references to /build/ in /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc...
  8067. 138.44 s [algebraic-graphs] patching script interpreter paths in /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc
  8068. 138.58 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7 /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc
  8069. 139.26 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  8070. 139.28 s [post-build-hook] Uploading to the NixCI cache: /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7 /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc
  8071. 139.32 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  8072. 139.33 s [post-build-hook] copying 2 paths...
  8073. 139.33 s [post-build-hook] copying path '/nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  8074. 140.58 s [post-build-hook] copying path '/nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  8075. 146.14 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  8076. 146.28 s [post-build-hook] copying 0 paths...
  8077. 146.31 s Progress: 1 of 6 built (1 building)
  8078. 146.35 s Building ghc-9.6.7-with-packages
  8079. 146.35 s [haskell-language-server] [8 of 8] Compiling Ide.Plugin.SemanticTokens ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens.p_o )
  8080. 146.35 s [haskell-language-server] Preprocessing library 'hls-ormolu-plugin' for haskell-language-server-2.12.0.0..
  8081. 146.35 s [haskell-language-server] Building library 'hls-ormolu-plugin' for haskell-language-server-2.12.0.0..
  8082. 146.35 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Ormolu ( plugins/hls-ormolu-plugin/src/Ide/Plugin/Ormolu.hs, dist/build/hls-ormolu-plugin/Ide/Plugin/Ormolu.o, dist/build/hls-ormolu-plugin/Ide/Plugin/Ormolu.dyn_o )
  8083. 146.40 s [ghc-9.6.7-with-packages] /nix/store/rq5v9857qqgdglsjivmrnh9crcrxfk3k-doctest-0.24.2/nix-support:
  8084. 146.40 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8085. 146.79 s [ghc-9.6.7-with-packages] /nix/store/94r03p5f8yhw9wad22fsxnb3k78wpil6-ghc-compat-plugin-0.1.0.1/nix-support:
  8086. 146.79 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8087. 146.79 s [ghc-9.6.7-with-packages] /nix/store/p4fzy2dqwsnanrj6wjhilpnl24rl7n3x-hedgehog-1.5/nix-support:
  8088. 146.79 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8089. 146.81 s [ghc-9.6.7-with-packages] /nix/store/k0kl195kyi4qabidpds09ypkx7b4sli3-Cabal-3.12.1.0/nix-support:
  8090. 146.81 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8091. 146.84 s [ghc-9.6.7-with-packages] /nix/store/yz10vaiq7lg7h8yghkjh59ic0k8blpk7-cabal-doctest-1.0.12/nix-support:
  8092. 146.84 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8093. 146.86 s [ghc-9.6.7-with-packages] /nix/store/0cdfzfn927mip0lidlngk0rav4nc5l5i-temporary-1.3/nix-support:
  8094. 146.86 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8095. 146.87 s [ghc-9.6.7-with-packages] /nix/store/0cdfzfn927mip0lidlngk0rav4nc5l5i-temporary-1.3/nix-support:
  8096. 146.87 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8097. 146.87 s [ghc-9.6.7-with-packages] /nix/store/r9jjs7aicy3fwm2lan1301p20dnfnng2-ansi-terminal-1.1.3/nix-support:
  8098. 146.87 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8099. 146.87 s [ghc-9.6.7-with-packages] /nix/store/r9jjs7aicy3fwm2lan1301p20dnfnng2-ansi-terminal-1.1.3/nix-support:
  8100. 146.87 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8101. 146.87 s [ghc-9.6.7-with-packages] /nix/store/fnl5hzk5p7w0njpjg5jsh9qvsy4abjza-async-2.2.5/nix-support:
  8102. 146.87 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8103. 146.87 s [ghc-9.6.7-with-packages] /nix/store/fnl5hzk5p7w0njpjg5jsh9qvsy4abjza-async-2.2.5/nix-support:
  8104. 146.87 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8105. 146.88 s [ghc-9.6.7-with-packages] /nix/store/1jvch0msag4xmavr2b7dxm5pcbwmsq8v-barbies-2.1.1.0/nix-support:
  8106. 146.88 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8107. 146.89 s [ghc-9.6.7-with-packages] /nix/store/1jvch0msag4xmavr2b7dxm5pcbwmsq8v-barbies-2.1.1.0/nix-support:
  8108. 146.89 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8109. 146.89 s [ghc-9.6.7-with-packages] /nix/store/xr6pilcra7kzxjhafkcycy9sw1brf3fs-concurrent-output-1.10.21/nix-support:
  8110. 146.89 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8111. 146.90 s [ghc-9.6.7-with-packages] /nix/store/xr6pilcra7kzxjhafkcycy9sw1brf3fs-concurrent-output-1.10.21/nix-support:
  8112. 146.90 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8113. 146.90 s [ghc-9.6.7-with-packages] /nix/store/57r38a5r1ip7ym37bddz5nqjpzi55r2f-lifted-async-0.10.2.7/nix-support:
  8114. 146.90 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8115. 146.90 s [ghc-9.6.7-with-packages] /nix/store/57r38a5r1ip7ym37bddz5nqjpzi55r2f-lifted-async-0.10.2.7/nix-support:
  8116. 146.90 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8117. 146.91 s [ghc-9.6.7-with-packages] /nix/store/rnhv6vydg7a2r29ljlcf5yr08h94bxjh-mmorph-1.2.1/nix-support:
  8118. 146.91 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8119. 146.91 s [ghc-9.6.7-with-packages] /nix/store/rnhv6vydg7a2r29ljlcf5yr08h94bxjh-mmorph-1.2.1/nix-support:
  8120. 146.91 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8121. 146.91 s [ghc-9.6.7-with-packages] /nix/store/42rmqy72nvn5343j0cpxlz4jzga9z20y-monad-control-1.0.3.1/nix-support:
  8122. 146.91 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8123. 146.91 s [ghc-9.6.7-with-packages] /nix/store/42rmqy72nvn5343j0cpxlz4jzga9z20y-monad-control-1.0.3.1/nix-support:
  8124. 146.91 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8125. 146.92 s [ghc-9.6.7-with-packages] /nix/store/b81azgly41n8vwx0zkjn593zvpwm5r39-pretty-show-1.10/nix-support:
  8126. 146.92 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8127. 146.92 s [ghc-9.6.7-with-packages] /nix/store/b81azgly41n8vwx0zkjn593zvpwm5r39-pretty-show-1.10/nix-support:
  8128. 146.92 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8129. 146.92 s [ghc-9.6.7-with-packages] /nix/store/pwphj8m3vcb5z4lj3zhmw9h94jm7rsm5-primitive-0.9.1.0/nix-support:
  8130. 146.92 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8131. 146.92 s [ghc-9.6.7-with-packages] /nix/store/pwphj8m3vcb5z4lj3zhmw9h94jm7rsm5-primitive-0.9.1.0/nix-support:
  8132. 146.92 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8133. 146.93 s [ghc-9.6.7-with-packages] /nix/store/x3rnwgjgpa75dcb56svvm147jyh0jzzc-random-1.2.1.3/nix-support:
  8134. 146.93 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8135. 146.93 s [ghc-9.6.7-with-packages] /nix/store/x3rnwgjgpa75dcb56svvm147jyh0jzzc-random-1.2.1.3/nix-support:
  8136. 146.93 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8137. 146.93 s [ghc-9.6.7-with-packages] /nix/store/1jclvcv9vkl9fns84dfq6yxv6xd2rdp2-resourcet-1.3.0/nix-support:
  8138. 146.93 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8139. 146.94 s [ghc-9.6.7-with-packages] /nix/store/1jclvcv9vkl9fns84dfq6yxv6xd2rdp2-resourcet-1.3.0/nix-support:
  8140. 146.94 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8141. 146.94 s [ghc-9.6.7-with-packages] /nix/store/ny88n7biaqxcb13xpakblhksw389m3nm-safe-exceptions-0.1.7.4/nix-support:
  8142. 146.94 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8143. 146.94 s [ghc-9.6.7-with-packages] /nix/store/ny88n7biaqxcb13xpakblhksw389m3nm-safe-exceptions-0.1.7.4/nix-support:
  8144. 146.94 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8145. 146.94 s [ghc-9.6.7-with-packages] /nix/store/8dpi11qa3dzn0igbvzmn88iifxn465pc-transformers-base-0.4.6/nix-support:
  8146. 146.94 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8147. 146.94 s [ghc-9.6.7-with-packages] /nix/store/8dpi11qa3dzn0igbvzmn88iifxn465pc-transformers-base-0.4.6/nix-support:
  8148. 146.94 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8149. 146.95 s [ghc-9.6.7-with-packages] /nix/store/33l47q2agmmjpjx7b2gj8md0x443i8mz-wl-pprint-annotated-0.1.0.1/nix-support:
  8150. 146.95 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8151. 146.95 s [ghc-9.6.7-with-packages] /nix/store/33l47q2agmmjpjx7b2gj8md0x443i8mz-wl-pprint-annotated-0.1.0.1/nix-support:
  8152. 146.95 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8153. 146.95 s [ghc-9.6.7-with-packages] /nix/store/lxg1kdksvxmaha7hymyf5gcy1hxl5pjg-Cabal-syntax-3.12.1.0/nix-support:
  8154. 146.95 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8155. 146.97 s [ghc-9.6.7-with-packages] /nix/store/lxg1kdksvxmaha7hymyf5gcy1hxl5pjg-Cabal-syntax-3.12.1.0/nix-support:
  8156. 146.97 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8157. 146.98 s [ghc-9.6.7-with-packages] /nix/store/456klncybx7saxjbm8n63x80h0bsal8q-ansi-terminal-types-1.1.3/nix-support:
  8158. 146.98 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8159. 146.98 s [ghc-9.6.7-with-packages] /nix/store/456klncybx7saxjbm8n63x80h0bsal8q-ansi-terminal-types-1.1.3/nix-support:
  8160. 146.98 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8161. 146.99 s [ghc-9.6.7-with-packages] /nix/store/76xp5b81536d5yjjjcydg5v677qz7pjz-hashable-1.5.0.0/nix-support:
  8162. 146.99 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8163. 146.99 s [ghc-9.6.7-with-packages] /nix/store/76xp5b81536d5yjjjcydg5v677qz7pjz-hashable-1.5.0.0/nix-support:
  8164. 146.99 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8165. 147.00 s [ghc-9.6.7-with-packages] /nix/store/qn49vwwahm0af9prf072nz4xg76ifm20-distributive-0.6.2.1/nix-support:
  8166. 147.00 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8167. 147.00 s [ghc-9.6.7-with-packages] /nix/store/qn49vwwahm0af9prf072nz4xg76ifm20-distributive-0.6.2.1/nix-support:
  8168. 147.00 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8169. 147.01 s [ghc-9.6.7-with-packages] /nix/store/6qqsyb5jvgnmlifjng0s3v0pgwwkryw2-constraints-0.14.2/nix-support:
  8170. 147.01 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8171. 147.01 s [ghc-9.6.7-with-packages] /nix/store/6qqsyb5jvgnmlifjng0s3v0pgwwkryw2-constraints-0.14.2/nix-support:
  8172. 147.01 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8173. 147.01 s [ghc-9.6.7-with-packages] /nix/store/zn99368wxxcfdnmn0pilyvn66zg0hldv-lifted-base-0.2.3.12/nix-support:
  8174. 147.01 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8175. 147.02 s [ghc-9.6.7-with-packages] /nix/store/zn99368wxxcfdnmn0pilyvn66zg0hldv-lifted-base-0.2.3.12/nix-support:
  8176. 147.02 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8177. 147.02 s [ghc-9.6.7-with-packages] /nix/store/5l1j8bggj9cshs6xqj0knhsn3iix247x-transformers-compat-0.7.2/nix-support:
  8178. 147.02 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8179. 147.02 s [ghc-9.6.7-with-packages] /nix/store/5l1j8bggj9cshs6xqj0knhsn3iix247x-transformers-compat-0.7.2/nix-support:
  8180. 147.02 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8181. 147.03 s [ghc-9.6.7-with-packages] /nix/store/8iy39dha01q6pwczlw1fbxzg2j8sjncl-splitmix-0.1.3.1/nix-support:
  8182. 147.03 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8183. 147.03 s [ghc-9.6.7-with-packages] /nix/store/8iy39dha01q6pwczlw1fbxzg2j8sjncl-splitmix-0.1.3.1/nix-support:
  8184. 147.03 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8185. 147.03 s [ghc-9.6.7-with-packages] /nix/store/n428byzgpjk6ysljizg36fn1hjh8wysn-unliftio-core-0.2.1.0/nix-support:
  8186. 147.03 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8187. 147.04 s [ghc-9.6.7-with-packages] /nix/store/n428byzgpjk6ysljizg36fn1hjh8wysn-unliftio-core-0.2.1.0/nix-support:
  8188. 147.04 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8189. 147.04 s [ghc-9.6.7-with-packages] /nix/store/cjkmvjiaw972xpzzcn6gpl4p9zqaz3j1-base-orphans-0.9.3/nix-support:
  8190. 147.04 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8191. 147.04 s [ghc-9.6.7-with-packages] /nix/store/cjkmvjiaw972xpzzcn6gpl4p9zqaz3j1-base-orphans-0.9.3/nix-support:
  8192. 147.04 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8193. 147.04 s [ghc-9.6.7-with-packages] /nix/store/br9kpx7bzfzvvg5l8q2zf228r3h0anr8-os-string-2.0.8/nix-support:
  8194. 147.04 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8195. 147.04 s [ghc-9.6.7-with-packages] /nix/store/br9kpx7bzfzvvg5l8q2zf228r3h0anr8-os-string-2.0.8/nix-support:
  8196. 147.04 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8197. 147.05 s [ghc-9.6.7-with-packages] /nix/store/hczmwq6716xprr0jzq4s2hl76wqgy7zb-tagged-0.8.9/nix-support:
  8198. 147.05 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8199. 147.05 s [ghc-9.6.7-with-packages] /nix/store/hczmwq6716xprr0jzq4s2hl76wqgy7zb-tagged-0.8.9/nix-support:
  8200. 147.05 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8201. 147.05 s [ghc-9.6.7-with-packages] /nix/store/j0c3yb21ggx6pbi6ak88cwsyd8z413bv-boring-0.2.2/nix-support:
  8202. 147.05 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8203. 147.05 s [ghc-9.6.7-with-packages] /nix/store/j0c3yb21ggx6pbi6ak88cwsyd8z413bv-boring-0.2.2/nix-support:
  8204. 147.05 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  8205. 147.74 s [ghc-9.6.7-with-packages] Warning: include-dirs: /nix/store/4lzn0wrbgk6s576hw73266g8pabw4f70-ghc-9.6.7-with-packages/lib/ghc-9.6.7/lib/../lib/x86_64-linux-ghc-9.6.7/directory-1.3.8.5/include doesn't exist or isn't a directory
  8206. 148.72 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/4lzn0wrbgk6s576hw73266g8pabw4f70-ghc-9.6.7-with-packages
  8207. 149.27 s [post-build-hook] Pushing 1 paths (154 are already present) using zstd to cache sellout ⏳
  8208. 149.27 s [post-build-hook]
  8209. 149.66 s [post-build-hook] Pushing /nix/store/4lzn0wrbgk6s576hw73266g8pabw4f70-ghc-9.6.7-with-packages (4.85 MiB)
  8210. 151.25 s [post-build-hook]
  8211. 151.25 s [post-build-hook] All done.
  8212. 151.27 s [post-build-hook] Uploading to the NixCI cache: /nix/store/4lzn0wrbgk6s576hw73266g8pabw4f70-ghc-9.6.7-with-packages
  8213. 151.34 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  8214. 151.55 s [post-build-hook] copying 1 paths...
  8215. 151.55 s [post-build-hook] copying path '/nix/store/4lzn0wrbgk6s576hw73266g8pabw4f70-ghc-9.6.7-with-packages' to 'https://cache.nix-ci.com'...
  8216. 152.62 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  8217. 152.88 s [post-build-hook] copying 1 paths...
  8218. 152.88 s [post-build-hook] copying path '/nix/store/pgrxblnyadlmrz0rymx7mc6w0bvwia3z-ghc-9.6.7-with-packages.drv' to 'https://cache.nix-ci.com'...
  8219. 153.10 s Progress: 2 of 5 built (1 building)
  8220. 153.10 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Ormolu ( plugins/hls-ormolu-plugin/src/Ide/Plugin/Ormolu.hs, dist/build/hls-ormolu-plugin/Ide/Plugin/Ormolu.p_o )
  8221. 157.63 s [haskell-language-server] Preprocessing library 'hls-explicit-record-fields-plugin' for haskell-language-server-2.12.0.0..
  8222. 157.63 s [haskell-language-server] Building library 'hls-explicit-record-fields-plugin' for haskell-language-server-2.12.0.0..
  8223. 157.75 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitFields ( plugins/hls-explicit-record-fields-plugin/src/Ide/Plugin/ExplicitFields.hs, dist/build/hls-explicit-record-fields-plugin/Ide/Plugin/ExplicitFields.o, dist/build/hls-explicit-record-fields-plugin/Ide/Plugin/ExplicitFields.dyn_o )
  8224. 160.49 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitFields ( plugins/hls-explicit-record-fields-plugin/src/Ide/Plugin/ExplicitFields.hs, dist/build/hls-explicit-record-fields-plugin/Ide/Plugin/ExplicitFields.p_o )
  8225. 168.19 s [haskell-language-server] Preprocessing library 'hls-cabal-gild-plugin' for haskell-language-server-2.12.0.0..
  8226. 168.19 s [haskell-language-server] Building library 'hls-cabal-gild-plugin' for haskell-language-server-2.12.0.0..
  8227. 168.28 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.CabalGild ( plugins/hls-cabal-gild-plugin/src/Ide/Plugin/CabalGild.hs, dist/build/hls-cabal-gild-plugin/Ide/Plugin/CabalGild.o, dist/build/hls-cabal-gild-plugin/Ide/Plugin/CabalGild.dyn_o )
  8228. 169.67 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.CabalGild ( plugins/hls-cabal-gild-plugin/src/Ide/Plugin/CabalGild.hs, dist/build/hls-cabal-gild-plugin/Ide/Plugin/CabalGild.p_o )
  8229. 176.44 s [haskell-language-server] Preprocessing library 'hls-cabal-plugin' for haskell-language-server-2.12.0.0..
  8230. 176.45 s [haskell-language-server] Building library 'hls-cabal-plugin' for haskell-language-server-2.12.0.0..
  8231. 176.61 s [haskell-language-server] [ 1 of 24] Compiling Ide.Plugin.Cabal.Completion.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Types.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Types.dyn_o )
  8232. 177.96 s [haskell-language-server] [ 2 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Types.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Types.dyn_o )
  8233. 178.02 s [haskell-language-server] [ 3 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Paths ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Paths.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Paths.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Paths.dyn_o )
  8234. 178.08 s [haskell-language-server] [ 4 of 24] Compiling Ide.Plugin.Cabal.Completion.CabalFields ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/CabalFields.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/CabalFields.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/CabalFields.dyn_o )
  8235. 178.15 s [haskell-language-server] [ 5 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Simple ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Simple.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Simple.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Simple.dyn_o )
  8236. 178.29 s [haskell-language-server] [ 6 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Snippet ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Snippet.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Snippet.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Snippet.dyn_o )
  8237. 178.47 s [haskell-language-server] [ 7 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.FilePath ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/FilePath.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/FilePath.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/FilePath.dyn_o )
  8238. 178.47 s [haskell-language-server] [ 8 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Module ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Module.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Module.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Module.dyn_o )
  8239. 178.57 s [haskell-language-server] [ 9 of 24] Compiling Ide.Plugin.Cabal.Diagnostics ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Diagnostics.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Diagnostics.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Diagnostics.dyn_o )
  8240. 178.57 s [haskell-language-server] [10 of 24] Compiling Ide.Plugin.Cabal.FieldSuggest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/FieldSuggest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/FieldSuggest.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/FieldSuggest.dyn_o )
  8241. 178.57 s [haskell-language-server] [11 of 24] Compiling Ide.Plugin.Cabal.LicenseSuggest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/LicenseSuggest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/LicenseSuggest.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/LicenseSuggest.dyn_o )
  8242. 178.57 s [haskell-language-server] [12 of 24] Compiling Ide.Plugin.Cabal.Completion.Data ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Data.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Data.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Data.dyn_o )
  8243. 179.04 s [haskell-language-server] [13 of 24] Compiling Ide.Plugin.Cabal.Completion.Completions ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completions.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completions.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completions.dyn_o )
  8244. 179.29 s [haskell-language-server] [14 of 24] Compiling Ide.Plugin.Cabal.Orphans ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Orphans.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Orphans.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Orphans.dyn_o )
  8245. 179.29 s [haskell-language-server] [15 of 24] Compiling Ide.Plugin.Cabal.OfInterest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/OfInterest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/OfInterest.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/OfInterest.dyn_o )
  8246. 179.29 s [haskell-language-server] [16 of 24] Compiling Ide.Plugin.Cabal.Files ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Files.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Files.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Files.dyn_o )
  8247. 179.29 s [haskell-language-server] [17 of 24] Compiling Ide.Plugin.Cabal.Definition ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Definition.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Definition.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Definition.dyn_o )
  8248. 179.29 s [haskell-language-server] [18 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Types.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Types.dyn_o )
  8249. 179.29 s [haskell-language-server] [19 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.Command ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/Command.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Command.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Command.dyn_o )
  8250. 179.29 s [haskell-language-server] [20 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.CodeAction ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/CodeAction.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/CodeAction.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/CodeAction.dyn_o )
  8251. 179.30 s [haskell-language-server] [21 of 24] Compiling Ide.Plugin.Cabal.Outline ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Outline.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Outline.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Outline.dyn_o )
  8252. 179.30 s [haskell-language-server] [22 of 24] Compiling Ide.Plugin.Cabal.Parse ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Parse.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Parse.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Parse.dyn_o )
  8253. 179.30 s [haskell-language-server] [23 of 24] Compiling Ide.Plugin.Cabal.Rules ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Rules.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Rules.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Rules.dyn_o )
  8254. 179.30 s [haskell-language-server] [24 of 24] Compiling Ide.Plugin.Cabal ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal.dyn_o )
  8255. 180.32 s [haskell-language-server] [ 1 of 24] Compiling Ide.Plugin.Cabal.Completion.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Types.p_o )
  8256. 181.84 s [haskell-language-server] [ 2 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Types.p_o )
  8257. 181.98 s [haskell-language-server] [ 3 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Paths ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Paths.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Paths.p_o )
  8258. 182.04 s [haskell-language-server] [ 4 of 24] Compiling Ide.Plugin.Cabal.Completion.CabalFields ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/CabalFields.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/CabalFields.p_o )
  8259. 182.09 s [haskell-language-server] [ 5 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Simple ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Simple.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Simple.p_o )
  8260. 182.31 s [haskell-language-server] [ 6 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Snippet ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Snippet.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Snippet.p_o )
  8261. 182.57 s [haskell-language-server] [ 7 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.FilePath ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/FilePath.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/FilePath.p_o )
  8262. 182.58 s [haskell-language-server] [ 8 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Module ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Module.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Module.p_o )
  8263. 182.78 s [haskell-language-server] [ 9 of 24] Compiling Ide.Plugin.Cabal.Diagnostics ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Diagnostics.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Diagnostics.p_o )
  8264. 182.78 s [haskell-language-server] [10 of 24] Compiling Ide.Plugin.Cabal.FieldSuggest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/FieldSuggest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/FieldSuggest.p_o )
  8265. 182.78 s [haskell-language-server] [11 of 24] Compiling Ide.Plugin.Cabal.LicenseSuggest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/LicenseSuggest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/LicenseSuggest.p_o )
  8266. 182.78 s [haskell-language-server] [12 of 24] Compiling Ide.Plugin.Cabal.Completion.Data ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Data.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Data.p_o )
  8267. 183.34 s [haskell-language-server] [13 of 24] Compiling Ide.Plugin.Cabal.Completion.Completions ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completions.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completions.p_o )
  8268. 183.64 s [haskell-language-server] [14 of 24] Compiling Ide.Plugin.Cabal.Orphans ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Orphans.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Orphans.p_o )
  8269. 183.64 s [haskell-language-server] [15 of 24] Compiling Ide.Plugin.Cabal.OfInterest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/OfInterest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/OfInterest.p_o )
  8270. 183.64 s [haskell-language-server] [16 of 24] Compiling Ide.Plugin.Cabal.Files ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Files.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Files.p_o )
  8271. 183.64 s [haskell-language-server] [17 of 24] Compiling Ide.Plugin.Cabal.Definition ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Definition.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Definition.p_o )
  8272. 183.64 s [haskell-language-server] [18 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Types.p_o )
  8273. 184.55 s [haskell-language-server] [19 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.Command ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/Command.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Command.p_o )
  8274. 184.94 s [haskell-language-server] [20 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.CodeAction ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/CodeAction.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/CodeAction.p_o )
  8275. 184.94 s [haskell-language-server] [21 of 24] Compiling Ide.Plugin.Cabal.Outline ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Outline.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Outline.p_o )
  8276. 184.94 s [haskell-language-server] [22 of 24] Compiling Ide.Plugin.Cabal.Parse ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Parse.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Parse.p_o )
  8277. 184.94 s [haskell-language-server] [23 of 24] Compiling Ide.Plugin.Cabal.Rules ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Rules.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Rules.p_o )
  8278. 184.94 s [haskell-language-server] [24 of 24] Compiling Ide.Plugin.Cabal ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal.p_o )
  8279. 193.39 s [haskell-language-server] Preprocessing library 'hls-hlint-plugin' for haskell-language-server-2.12.0.0..
  8280. 193.39 s [haskell-language-server] Building library 'hls-hlint-plugin' for haskell-language-server-2.12.0.0..
  8281. 193.53 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Hlint ( plugins/hls-hlint-plugin/src/Ide/Plugin/Hlint.hs, dist/build/hls-hlint-plugin/Ide/Plugin/Hlint.o, dist/build/hls-hlint-plugin/Ide/Plugin/Hlint.dyn_o )
  8282. 198.26 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Hlint ( plugins/hls-hlint-plugin/src/Ide/Plugin/Hlint.hs, dist/build/hls-hlint-plugin/Ide/Plugin/Hlint.p_o )
  8283. 210.44 s [haskell-language-server] Preprocessing library 'hls-refactor-plugin' for haskell-language-server-2.12.0.0..
  8284. 210.44 s [haskell-language-server] Building library 'hls-refactor-plugin' for haskell-language-server-2.12.0.0..
  8285. 210.88 s [haskell-language-server]
  8286. 210.88 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  8287. 210.88 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  8288. 210.88 s [haskell-language-server] but were not needed for compilation:
  8289. 210.88 s [haskell-language-server] - parser-combinators-1.3.0 (exposed by flag -package-id parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC)
  8290. 210.88 s [haskell-language-server] - regex-applicative-0.3.4 (exposed by flag -package-id regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM)
  8291. 210.90 s [haskell-language-server] [ 1 of 13] Compiling Development.IDE.GHC.Compat.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Compat/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Compat/ExactPrint.o, dist/build/hls-refactor-plugin/Development/IDE/GHC/Compat/ExactPrint.dyn_o )
  8292. 211.32 s [haskell-language-server] [ 2 of 13] Compiling Development.IDE.GHC.Dump ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Dump.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Dump.o, dist/build/hls-refactor-plugin/Development/IDE/GHC/Dump.dyn_o )
  8293. 222.28 s [haskell-language-server] [ 3 of 13] Compiling Development.IDE.GHC.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/ExactPrint.o, dist/build/hls-refactor-plugin/Development/IDE/GHC/ExactPrint.dyn_o )
  8294. 222.31 s [haskell-language-server] [ 4 of 13] Compiling Development.IDE.Plugin.CodeAction.PositionIndexed ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/PositionIndexed.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/PositionIndexed.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/PositionIndexed.dyn_o )
  8295. 222.32 s [haskell-language-server] [ 5 of 13] Compiling Development.IDE.Plugin.CodeAction.Util ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Util.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Util.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Util.dyn_o )
  8296. 222.36 s [haskell-language-server] [ 6 of 13] Compiling Development.IDE.Plugin.CodeAction.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/ExactPrint.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/ExactPrint.dyn_o )
  8297. 223.02 s [haskell-language-server] [ 7 of 13] Compiling Development.IDE.Plugin.CodeAction.Args ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Args.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Args.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Args.dyn_o )
  8298. 223.63 s [haskell-language-server] [ 8 of 13] Compiling Development.IDE.Plugin.Plugins.Diagnostic ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/Diagnostic.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/Diagnostic.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/Diagnostic.dyn_o )
  8299. 223.63 s [haskell-language-server] [ 9 of 13] Compiling Development.IDE.Plugin.Plugins.AddArgument ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/AddArgument.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/AddArgument.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/AddArgument.dyn_o )
  8300. 223.63 s [haskell-language-server] [10 of 13] Compiling Development.IDE.Plugin.Plugins.FillHole ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillHole.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillHole.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillHole.dyn_o )
  8301. 223.63 s [haskell-language-server] [11 of 13] Compiling Development.IDE.Plugin.Plugins.FillTypeWildcard ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillTypeWildcard.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillTypeWildcard.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillTypeWildcard.dyn_o )
  8302. 223.63 s [haskell-language-server] [12 of 13] Compiling Development.IDE.Plugin.Plugins.ImportUtils ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/ImportUtils.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/ImportUtils.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/ImportUtils.dyn_o )
  8303. 223.63 s [haskell-language-server] [13 of 13] Compiling Development.IDE.Plugin.CodeAction ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction.dyn_o )
  8304. 230.05 s [haskell-language-server]
  8305. 230.05 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  8306. 230.09 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  8307. 230.09 s [haskell-language-server] but were not needed for compilation:
  8308. 230.09 s [haskell-language-server] - parser-combinators-1.3.0 (exposed by flag -package-id parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC)
  8309. 230.09 s [haskell-language-server] - regex-applicative-0.3.4 (exposed by flag -package-id regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM)
  8310. 230.09 s [haskell-language-server] [ 1 of 13] Compiling Development.IDE.GHC.Compat.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Compat/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Compat/ExactPrint.p_o )
  8311. 230.33 s [haskell-language-server] [ 2 of 13] Compiling Development.IDE.GHC.Dump ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Dump.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Dump.p_o )
  8312. 241.63 s [haskell-language-server] [ 3 of 13] Compiling Development.IDE.GHC.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/ExactPrint.p_o )
  8313. 241.67 s [haskell-language-server] [ 4 of 13] Compiling Development.IDE.Plugin.CodeAction.PositionIndexed ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/PositionIndexed.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/PositionIndexed.p_o )
  8314. 241.67 s [haskell-language-server] [ 5 of 13] Compiling Development.IDE.Plugin.CodeAction.Util ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Util.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Util.p_o )
  8315. 241.83 s [haskell-language-server] [ 6 of 13] Compiling Development.IDE.Plugin.CodeAction.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/ExactPrint.p_o )
  8316. 242.54 s [haskell-language-server] [ 7 of 13] Compiling Development.IDE.Plugin.CodeAction.Args ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Args.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Args.p_o )
  8317. 243.18 s [haskell-language-server] [ 8 of 13] Compiling Development.IDE.Plugin.Plugins.Diagnostic ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/Diagnostic.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/Diagnostic.p_o )
  8318. 243.18 s [haskell-language-server] [ 9 of 13] Compiling Development.IDE.Plugin.Plugins.AddArgument ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/AddArgument.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/AddArgument.p_o )
  8319. 243.18 s [haskell-language-server] [10 of 13] Compiling Development.IDE.Plugin.Plugins.FillHole ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillHole.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillHole.p_o )
  8320. 243.18 s [haskell-language-server] [11 of 13] Compiling Development.IDE.Plugin.Plugins.FillTypeWildcard ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillTypeWildcard.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillTypeWildcard.p_o )
  8321. 243.18 s [haskell-language-server] [12 of 13] Compiling Development.IDE.Plugin.Plugins.ImportUtils ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/ImportUtils.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/ImportUtils.p_o )
  8322. 243.18 s [haskell-language-server] [13 of 13] Compiling Development.IDE.Plugin.CodeAction ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction.p_o )
  8323. 253.93 s [haskell-language-server] Preprocessing library 'hls-rename-plugin' for haskell-language-server-2.12.0.0..
  8324. 253.93 s [haskell-language-server] Building library 'hls-rename-plugin' for haskell-language-server-2.12.0.0..
  8325. 254.04 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Rename ( plugins/hls-rename-plugin/src/Ide/Plugin/Rename.hs, dist/build/hls-rename-plugin/Ide/Plugin/Rename.o, dist/build/hls-rename-plugin/Ide/Plugin/Rename.dyn_o )
  8326. 255.74 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Rename ( plugins/hls-rename-plugin/src/Ide/Plugin/Rename.hs, dist/build/hls-rename-plugin/Ide/Plugin/Rename.p_o )
  8327. 264.04 s [haskell-language-server] Preprocessing library 'hls-splice-plugin' for haskell-language-server-2.12.0.0..
  8328. 264.04 s [haskell-language-server] Building library 'hls-splice-plugin' for haskell-language-server-2.12.0.0..
  8329. 264.17 s [haskell-language-server] [1 of 2] Compiling Ide.Plugin.Splice.Types ( plugins/hls-splice-plugin/src/Ide/Plugin/Splice/Types.hs, dist/build/hls-splice-plugin/Ide/Plugin/Splice/Types.o, dist/build/hls-splice-plugin/Ide/Plugin/Splice/Types.dyn_o )
  8330. 265.83 s [haskell-language-server] [2 of 2] Compiling Ide.Plugin.Splice ( plugins/hls-splice-plugin/src/Ide/Plugin/Splice.hs, dist/build/hls-splice-plugin/Ide/Plugin/Splice.o, dist/build/hls-splice-plugin/Ide/Plugin/Splice.dyn_o )
  8331. 267.66 s [haskell-language-server] [1 of 2] Compiling Ide.Plugin.Splice.Types ( plugins/hls-splice-plugin/src/Ide/Plugin/Splice/Types.hs, dist/build/hls-splice-plugin/Ide/Plugin/Splice/Types.p_o )
  8332. 270.42 s [haskell-language-server] [2 of 2] Compiling Ide.Plugin.Splice ( plugins/hls-splice-plugin/src/Ide/Plugin/Splice.hs, dist/build/hls-splice-plugin/Ide/Plugin/Splice.p_o )
  8333. 277.94 s [haskell-language-server] Preprocessing library 'hls-retrie-plugin' for haskell-language-server-2.12.0.0..
  8334. 277.94 s [haskell-language-server] Building library 'hls-retrie-plugin' for haskell-language-server-2.12.0.0..
  8335. 278.08 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Retrie ( plugins/hls-retrie-plugin/src/Ide/Plugin/Retrie.hs, dist/build/hls-retrie-plugin/Ide/Plugin/Retrie.o, dist/build/hls-retrie-plugin/Ide/Plugin/Retrie.dyn_o )
  8336. 284.62 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Retrie ( plugins/hls-retrie-plugin/src/Ide/Plugin/Retrie.hs, dist/build/hls-retrie-plugin/Ide/Plugin/Retrie.p_o )
  8337. 300.45 s [haskell-language-server] Preprocessing library 'hls-gadt-plugin' for haskell-language-server-2.12.0.0..
  8338. 300.45 s [haskell-language-server] Building library 'hls-gadt-plugin' for haskell-language-server-2.12.0.0..
  8339. 300.57 s [haskell-language-server] [1 of 2] Compiling Ide.Plugin.GHC ( plugins/hls-gadt-plugin/src/Ide/Plugin/GHC.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GHC.o, dist/build/hls-gadt-plugin/Ide/Plugin/GHC.dyn_o )
  8340. 301.25 s [haskell-language-server] [2 of 2] Compiling Ide.Plugin.GADT ( plugins/hls-gadt-plugin/src/Ide/Plugin/GADT.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GADT.o, dist/build/hls-gadt-plugin/Ide/Plugin/GADT.dyn_o )
  8341. 302.88 s [haskell-language-server] [1 of 2] Compiling Ide.Plugin.GHC ( plugins/hls-gadt-plugin/src/Ide/Plugin/GHC.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GHC.p_o )
  8342. 303.60 s [haskell-language-server] [2 of 2] Compiling Ide.Plugin.GADT ( plugins/hls-gadt-plugin/src/Ide/Plugin/GADT.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GADT.p_o )
  8343. 311.74 s [haskell-language-server] Preprocessing library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0..
  8344. 311.74 s [haskell-language-server] Building library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0..
  8345. 311.90 s [haskell-language-server] [1 of 3] Compiling Ide.Plugin.Literals ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/Literals.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Literals.o, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Literals.dyn_o )
  8346. 312.89 s [haskell-language-server] [2 of 3] Compiling Ide.Plugin.Conversion ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/Conversion.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Conversion.o, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Conversion.dyn_o )
  8347. 313.41 s [haskell-language-server] [3 of 3] Compiling Ide.Plugin.AlternateNumberFormat ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/AlternateNumberFormat.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/AlternateNumberFormat.o, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/AlternateNumberFormat.dyn_o )
  8348. 314.53 s [haskell-language-server] [1 of 3] Compiling Ide.Plugin.Literals ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/Literals.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Literals.p_o )
  8349. 315.53 s [haskell-language-server] [2 of 3] Compiling Ide.Plugin.Conversion ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/Conversion.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Conversion.p_o )
  8350. 316.06 s [haskell-language-server] [3 of 3] Compiling Ide.Plugin.AlternateNumberFormat ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/AlternateNumberFormat.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/AlternateNumberFormat.p_o )
  8351. 323.20 s [haskell-language-server] Preprocessing library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0..
  8352. 323.20 s [haskell-language-server] Building library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0..
  8353. 323.33 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.QualifyImportedNames ( plugins/hls-qualify-imported-names-plugin/src/Ide/Plugin/QualifyImportedNames.hs, dist/build/hls-qualify-imported-names-plugin/Ide/Plugin/QualifyImportedNames.o, dist/build/hls-qualify-imported-names-plugin/Ide/Plugin/QualifyImportedNames.dyn_o )
  8354. 324.90 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.QualifyImportedNames ( plugins/hls-qualify-imported-names-plugin/src/Ide/Plugin/QualifyImportedNames.hs, dist/build/hls-qualify-imported-names-plugin/Ide/Plugin/QualifyImportedNames.p_o )
  8355. 332.28 s [haskell-language-server] Preprocessing library 'hls-cabal-fmt-plugin' for haskell-language-server-2.12.0.0..
  8356. 332.28 s [haskell-language-server] Building library 'hls-cabal-fmt-plugin' for haskell-language-server-2.12.0.0..
  8357. 332.37 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.CabalFmt ( plugins/hls-cabal-fmt-plugin/src/Ide/Plugin/CabalFmt.hs, dist/build/hls-cabal-fmt-plugin/Ide/Plugin/CabalFmt.o, dist/build/hls-cabal-fmt-plugin/Ide/Plugin/CabalFmt.dyn_o )
  8358. 333.68 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.CabalFmt ( plugins/hls-cabal-fmt-plugin/src/Ide/Plugin/CabalFmt.hs, dist/build/hls-cabal-fmt-plugin/Ide/Plugin/CabalFmt.p_o )
  8359. 342.22 s [haskell-language-server] Preprocessing library 'hls-eval-plugin' for haskell-language-server-2.12.0.0..
  8360. 342.22 s [haskell-language-server] Building library 'hls-eval-plugin' for haskell-language-server-2.12.0.0..
  8361. 342.49 s [haskell-language-server] [ 1 of 10] Compiling Ide.Plugin.Eval.Config ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Config.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Config.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Config.dyn_o )
  8362. 342.87 s [haskell-language-server] [ 2 of 10] Compiling Ide.Plugin.Eval.Parse.Option ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Parse/Option.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Option.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Option.dyn_o )
  8363. 342.94 s [haskell-language-server] [ 3 of 10] Compiling Ide.Plugin.Eval.Util ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Util.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Util.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Util.dyn_o )
  8364. 343.14 s [haskell-language-server] [ 4 of 10] Compiling Ide.Plugin.Eval.GHC ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/GHC.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/GHC.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/GHC.dyn_o )
  8365. 343.91 s [haskell-language-server] [ 5 of 10] Compiling Ide.Plugin.Eval.Types ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Types.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Types.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Types.dyn_o )
  8366. 348.44 s [haskell-language-server] [ 6 of 10] Compiling Ide.Plugin.Eval.Rules ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Rules.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Rules.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Rules.dyn_o )
  8367. 348.91 s [haskell-language-server] [ 7 of 10] Compiling Ide.Plugin.Eval.Parse.Comments ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Parse/Comments.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Comments.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Comments.dyn_o )
  8368. 351.14 s [haskell-language-server] [ 8 of 10] Compiling Ide.Plugin.Eval.Code ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Code.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Code.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Code.dyn_o )
  8369. 351.14 s [haskell-language-server] [ 9 of 10] Compiling Ide.Plugin.Eval.Handlers ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Handlers.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Handlers.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Handlers.dyn_o )
  8370. 352.70 s [haskell-language-server] [10 of 10] Compiling Ide.Plugin.Eval ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval.dyn_o )
  8371. 353.22 s [haskell-language-server] [ 1 of 10] Compiling Ide.Plugin.Eval.Config ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Config.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Config.p_o )
  8372. 353.69 s [haskell-language-server] [ 2 of 10] Compiling Ide.Plugin.Eval.Parse.Option ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Parse/Option.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Option.p_o )
  8373. 353.78 s [haskell-language-server] [ 3 of 10] Compiling Ide.Plugin.Eval.Util ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Util.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Util.p_o )
  8374. 353.84 s [haskell-language-server] [ 4 of 10] Compiling Ide.Plugin.Eval.GHC ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/GHC.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/GHC.p_o )
  8375. 354.50 s [haskell-language-server] [ 5 of 10] Compiling Ide.Plugin.Eval.Types ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Types.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Types.p_o )
  8376. 360.77 s [haskell-language-server] [ 6 of 10] Compiling Ide.Plugin.Eval.Rules ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Rules.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Rules.p_o )
  8377. 361.21 s [haskell-language-server] [ 7 of 10] Compiling Ide.Plugin.Eval.Parse.Comments ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Parse/Comments.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Comments.p_o )
  8378. 363.25 s [haskell-language-server] [ 8 of 10] Compiling Ide.Plugin.Eval.Code ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Code.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Code.p_o )
  8379. 363.25 s [haskell-language-server] [ 9 of 10] Compiling Ide.Plugin.Eval.Handlers ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Handlers.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Handlers.p_o )
  8380. 364.60 s [haskell-language-server] [10 of 10] Compiling Ide.Plugin.Eval ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval.p_o )
  8381. 372.06 s [haskell-language-server] Preprocessing library 'hls-signature-help-plugin' for haskell-language-server-2.12.0.0..
  8382. 372.06 s [haskell-language-server] Building library 'hls-signature-help-plugin' for haskell-language-server-2.12.0.0..
  8383. 372.15 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.SignatureHelp ( plugins/hls-signature-help-plugin/src/Ide/Plugin/SignatureHelp.hs, dist/build/hls-signature-help-plugin/Ide/Plugin/SignatureHelp.o, dist/build/hls-signature-help-plugin/Ide/Plugin/SignatureHelp.dyn_o )
  8384. 373.45 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.SignatureHelp ( plugins/hls-signature-help-plugin/src/Ide/Plugin/SignatureHelp.hs, dist/build/hls-signature-help-plugin/Ide/Plugin/SignatureHelp.p_o )
  8385. 381.37 s [haskell-language-server] Preprocessing executable 'plugin-tutorial' for haskell-language-server-2.12.0.0..
  8386. 381.37 s [haskell-language-server] Building executable 'plugin-tutorial' for haskell-language-server-2.12.0.0..
  8387. 381.54 s [haskell-language-server] [1 of 1] Compiling Main ( docs/contributing/plugin-tutorial.lhs, dist/build/plugin-tutorial/plugin-tutorial-tmp/Main.dyn_o )
  8388. 382.69 s [haskell-language-server] [2 of 2] Linking dist/build/plugin-tutorial/plugin-tutorial
  8389. 383.75 s [haskell-language-server] Preprocessing library 'hls-stan-plugin' for haskell-language-server-2.12.0.0..
  8390. 383.75 s [haskell-language-server] Building library 'hls-stan-plugin' for haskell-language-server-2.12.0.0..
  8391. 383.86 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Stan ( plugins/hls-stan-plugin/src/Ide/Plugin/Stan.hs, dist/build/hls-stan-plugin/Ide/Plugin/Stan.o, dist/build/hls-stan-plugin/Ide/Plugin/Stan.dyn_o )
  8392. 386.51 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Stan ( plugins/hls-stan-plugin/src/Ide/Plugin/Stan.hs, dist/build/hls-stan-plugin/Ide/Plugin/Stan.p_o )
  8393. 395.68 s [haskell-language-server] Preprocessing library 'hls-explicit-imports-plugin' for haskell-language-server-2.12.0.0..
  8394. 395.68 s [haskell-language-server] Building library 'hls-explicit-imports-plugin' for haskell-language-server-2.12.0.0..
  8395. 395.78 s [haskell-language-server]
  8396. 395.78 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  8397. 395.78 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  8398. 395.78 s [haskell-language-server] but were not needed for compilation:
  8399. 395.78 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  8400. 395.79 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitImports ( plugins/hls-explicit-imports-plugin/src/Ide/Plugin/ExplicitImports.hs, dist/build/hls-explicit-imports-plugin/Ide/Plugin/ExplicitImports.o, dist/build/hls-explicit-imports-plugin/Ide/Plugin/ExplicitImports.dyn_o )
  8401. 400.59 s [haskell-language-server]
  8402. 400.59 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  8403. 400.59 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  8404. 400.59 s [haskell-language-server] but were not needed for compilation:
  8405. 400.59 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  8406. 400.61 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitImports ( plugins/hls-explicit-imports-plugin/src/Ide/Plugin/ExplicitImports.hs, dist/build/hls-explicit-imports-plugin/Ide/Plugin/ExplicitImports.p_o )
  8407. 411.58 s [haskell-language-server] Preprocessing library 'hls-fourmolu-plugin' for haskell-language-server-2.12.0.0..
  8408. 411.58 s [haskell-language-server] Building library 'hls-fourmolu-plugin' for haskell-language-server-2.12.0.0..
  8409. 411.71 s [haskell-language-server]
  8410. 411.71 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  8411. 411.71 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  8412. 411.71 s [haskell-language-server] but were not needed for compilation:
  8413. 411.71 s [haskell-language-server] - yaml-0.11.11.2 (exposed by flag -package-id yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy)
  8414. 411.72 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Fourmolu ( plugins/hls-fourmolu-plugin/src/Ide/Plugin/Fourmolu.hs, dist/build/hls-fourmolu-plugin/Ide/Plugin/Fourmolu.o, dist/build/hls-fourmolu-plugin/Ide/Plugin/Fourmolu.dyn_o )
  8415. 414.23 s [haskell-language-server]
  8416. 414.23 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  8417. 414.23 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  8418. 414.23 s [haskell-language-server] but were not needed for compilation:
  8419. 414.23 s [haskell-language-server] - yaml-0.11.11.2 (exposed by flag -package-id yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy)
  8420. 414.25 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Fourmolu ( plugins/hls-fourmolu-plugin/src/Ide/Plugin/Fourmolu.hs, dist/build/hls-fourmolu-plugin/Ide/Plugin/Fourmolu.p_o )
  8421. 424.28 s [haskell-language-server] Preprocessing library 'hls-explicit-fixity-plugin' for haskell-language-server-2.12.0.0..
  8422. 424.28 s [haskell-language-server] Building library 'hls-explicit-fixity-plugin' for haskell-language-server-2.12.0.0..
  8423. 424.40 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitFixity ( plugins/hls-explicit-fixity-plugin/src/Ide/Plugin/ExplicitFixity.hs, dist/build/hls-explicit-fixity-plugin/Ide/Plugin/ExplicitFixity.o, dist/build/hls-explicit-fixity-plugin/Ide/Plugin/ExplicitFixity.dyn_o )
  8424. 426.14 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitFixity ( plugins/hls-explicit-fixity-plugin/src/Ide/Plugin/ExplicitFixity.hs, dist/build/hls-explicit-fixity-plugin/Ide/Plugin/ExplicitFixity.p_o )
  8425. 433.69 s [haskell-language-server] Preprocessing executable 'ghcide-bench' for haskell-language-server-2.12.0.0..
  8426. 433.69 s [haskell-language-server] Building executable 'ghcide-bench' for haskell-language-server-2.12.0.0..
  8427. 433.84 s [haskell-language-server] [1 of 1] Compiling Main ( ghcide-bench/exe/Main.hs, dist/build/ghcide-bench/ghcide-bench-tmp/Main.dyn_o )
  8428. 434.32 s [haskell-language-server] [2 of 2] Linking dist/build/ghcide-bench/ghcide-bench
  8429. 435.49 s [haskell-language-server] Preprocessing library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0..
  8430. 435.49 s [haskell-language-server] Building library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0..
  8431. 435.60 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ModuleName ( plugins/hls-module-name-plugin/src/Ide/Plugin/ModuleName.hs, dist/build/hls-module-name-plugin/Ide/Plugin/ModuleName.o, dist/build/hls-module-name-plugin/Ide/Plugin/ModuleName.dyn_o )
  8432. 437.04 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ModuleName ( plugins/hls-module-name-plugin/src/Ide/Plugin/ModuleName.hs, dist/build/hls-module-name-plugin/Ide/Plugin/ModuleName.p_o )
  8433. 444.84 s [haskell-language-server] Preprocessing library for haskell-language-server-2.12.0.0..
  8434. 444.84 s [haskell-language-server] Building library for haskell-language-server-2.12.0.0..
  8435. 445.08 s [haskell-language-server]
  8436. 445.08 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  8437. 445.08 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  8438. 445.08 s [haskell-language-server] but were not needed for compilation:
  8439. 445.08 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  8440. 445.09 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.o, dist/build/HlsPlugins.dyn_o )
  8441. 446.24 s [haskell-language-server] [2 of 5] Compiling Paths_haskell_language_server ( dist/build/autogen/Paths_haskell_language_server.hs, dist/build/Paths_haskell_language_server.o, dist/build/Paths_haskell_language_server.dyn_o )
  8442. 446.24 s [haskell-language-server] [3 of 5] Compiling Ide.Version ( src/Ide/Version.hs, dist/build/Ide/Version.o, dist/build/Ide/Version.dyn_o )
  8443. 447.34 s [haskell-language-server] [4 of 5] Compiling Ide.Arguments ( src/Ide/Arguments.hs, dist/build/Ide/Arguments.o, dist/build/Ide/Arguments.dyn_o )
  8444. 447.64 s [haskell-language-server] [5 of 5] Compiling Ide.Main ( src/Ide/Main.hs, dist/build/Ide/Main.o, dist/build/Ide/Main.dyn_o )
  8445. 448.60 s [haskell-language-server]
  8446. 448.60 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  8447. 448.60 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  8448. 448.60 s [haskell-language-server] but were not needed for compilation:
  8449. 448.60 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  8450. 448.62 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.p_o )
  8451. 449.72 s [haskell-language-server] [2 of 5] Compiling Paths_haskell_language_server ( dist/build/autogen/Paths_haskell_language_server.hs, dist/build/Paths_haskell_language_server.p_o )
  8452. 449.72 s [haskell-language-server] [3 of 5] Compiling Ide.Version ( src/Ide/Version.hs, dist/build/Ide/Version.p_o )
  8453. 450.96 s [haskell-language-server] [4 of 5] Compiling Ide.Arguments ( src/Ide/Arguments.hs, dist/build/Ide/Arguments.p_o )
  8454. 451.51 s [haskell-language-server] [5 of 5] Compiling Ide.Main ( src/Ide/Main.hs, dist/build/Ide/Main.p_o )
  8455. 462.63 s [haskell-language-server] Preprocessing executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0..
  8456. 462.67 s [haskell-language-server] Building executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0..
  8457. 462.86 s [haskell-language-server] [1 of 2] Compiling Main ( exe/Wrapper.hs, dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper-tmp/Main.dyn_o )
  8458. 463.82 s [haskell-language-server] [2 of 2] Compiling Paths_haskell_language_server ( dist/build/haskell-language-server-wrapper/autogen/Paths_haskell_language_server.hs, dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper-tmp/Paths_haskell_language_server.dyn_o )
  8459. 464.23 s [haskell-language-server] [3 of 3] Linking dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper
  8460. 465.79 s [haskell-language-server] Preprocessing executable 'haskell-language-server' for haskell-language-server-2.12.0.0..
  8461. 465.79 s [haskell-language-server] Building executable 'haskell-language-server' for haskell-language-server-2.12.0.0..
  8462. 465.95 s [haskell-language-server] [1 of 1] Compiling Main ( exe/Main.hs, dist/build/haskell-language-server/haskell-language-server-tmp/Main.dyn_o )
  8463. 467.08 s [haskell-language-server] [2 of 2] Linking dist/build/haskell-language-server/haskell-language-server
  8464. 468.71 s [haskell-language-server] buildPhase completed in 7 minutes 37 seconds
  8465. 468.75 s [haskell-language-server] Phase: haddockPhase
  8466. 468.75 s [haskell-language-server] Phase: installPhase
  8467. 468.90 s [haskell-language-server] Installing internal library hls-overloaded-record-dot-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  8468. 469.01 s [haskell-language-server] Installing internal library hls-change-type-signature-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  8469. 469.04 s [haskell-language-server] Installing internal library hls-class-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  8470. 469.14 s [haskell-language-server] Installing internal library hls-call-hierarchy-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  8471. 469.22 s [haskell-language-server] Installing executable ghcide-test-preprocessor in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  8472. 469.22 s [haskell-language-server] Warning: The directory
  8473. 469.22 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  8474. 469.22 s [haskell-language-server] is not in the system search path.
  8475. 469.22 s [haskell-language-server] Installing internal library hls-code-range-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  8476. 469.28 s [haskell-language-server] Installing internal library hls-notes-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  8477. 469.34 s [haskell-language-server] Installing internal library ghcide-bench-lib in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  8478. 469.47 s [haskell-language-server] Installing internal library hls-floskell-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  8479. 469.50 s [haskell-language-server] Installing internal library hls-stylish-haskell-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  8480. 469.52 s [haskell-language-server] Installing internal library hls-pragmas-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  8481. 469.58 s [haskell-language-server] Installing internal library hls-semantic-tokens-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  8482. 469.69 s [haskell-language-server] Installing internal library hls-ormolu-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  8483. 469.72 s [haskell-language-server] Installing internal library hls-explicit-record-fields-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  8484. 469.77 s [haskell-language-server] Installing internal library hls-cabal-gild-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  8485. 469.81 s [haskell-language-server] Installing internal library hls-cabal-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  8486. 470.05 s [haskell-language-server] Installing internal library hls-hlint-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  8487. 470.11 s [haskell-language-server] Installing internal library hls-refactor-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  8488. 470.50 s [haskell-language-server] Installing internal library hls-rename-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  8489. 470.55 s [haskell-language-server] Installing internal library hls-splice-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  8490. 470.63 s [haskell-language-server] Installing internal library hls-retrie-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  8491. 470.77 s [haskell-language-server] Installing internal library hls-gadt-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  8492. 470.82 s [haskell-language-server] Installing internal library hls-alternate-number-format-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  8493. 470.90 s [haskell-language-server] Installing internal library hls-qualify-imported-names-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  8494. 470.94 s [haskell-language-server] Installing internal library hls-cabal-fmt-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  8495. 470.98 s [haskell-language-server] Installing internal library hls-eval-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  8496. 471.19 s [haskell-language-server] Installing internal library hls-signature-help-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  8497. 471.21 s [haskell-language-server] Installing executable plugin-tutorial in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  8498. 471.21 s [haskell-language-server] Warning: The directory
  8499. 471.21 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  8500. 471.21 s [haskell-language-server] is not in the system search path.
  8501. 471.22 s [haskell-language-server] Installing internal library hls-stan-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  8502. 471.25 s [haskell-language-server] Installing internal library hls-explicit-imports-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  8503. 471.32 s [haskell-language-server] Installing internal library hls-fourmolu-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  8504. 471.37 s [haskell-language-server] Installing internal library hls-explicit-fixity-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  8505. 471.40 s [haskell-language-server] Installing executable ghcide-bench in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  8506. 471.40 s [haskell-language-server] Warning: The directory
  8507. 471.40 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  8508. 471.40 s [haskell-language-server] is not in the system search path.
  8509. 471.41 s [haskell-language-server] Installing internal library hls-module-name-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  8510. 471.45 s [haskell-language-server] Installing library in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  8511. 471.54 s [haskell-language-server] Installing executable haskell-language-server-wrapper in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  8512. 471.54 s [haskell-language-server] Warning: The directory
  8513. 471.54 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  8514. 471.54 s [haskell-language-server] is not in the system search path.
  8515. 471.55 s [haskell-language-server] Installing executable haskell-language-server in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  8516. 471.55 s [haskell-language-server] Warning: The directory
  8517. 471.55 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  8518. 471.55 s [haskell-language-server] is not in the system search path.
  8519. 474.94 s [haskell-language-server] Phase: fixupPhase
  8520. 474.96 s [haskell-language-server] shrinking RPATHs of ELF executables and libraries in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0
  8521. 475.02 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/ghcide-test-preprocessor
  8522. 475.02 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/plugin-tutorial
  8523. 475.23 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/haskell-language-server-wrapper
  8524. 475.41 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/.haskell-language-server-9.6.7-unwrapped
  8525. 475.57 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/ghcide-bench
  8526. 475.74 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin-ghc9.6.7.so
  8527. 475.88 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin-ghc9.6.7.so
  8528. 475.99 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin-ghc9.6.7.so
  8529. 476.11 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin-ghc9.6.7.so
  8530. 476.23 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin-ghc9.6.7.so
  8531. 476.34 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin-ghc9.6.7.so
  8532. 476.45 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin-ghc9.6.7.so
  8533. 476.57 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib-ghc9.6.7.so
  8534. 476.69 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin-ghc9.6.7.so
  8535. 476.80 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin-ghc9.6.7.so
  8536. 476.92 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin-ghc9.6.7.so
  8537. 477.03 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin-ghc9.6.7.so
  8538. 477.14 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin-ghc9.6.7.so
  8539. 477.25 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin-ghc9.6.7.so
  8540. 477.37 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin-ghc9.6.7.so
  8541. 477.48 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin-ghc9.6.7.so
  8542. 477.59 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF-ghc9.6.7.so
  8543. 477.73 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin-ghc9.6.7.so
  8544. 477.85 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin-ghc9.6.7.so
  8545. 477.97 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin-ghc9.6.7.so
  8546. 478.08 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin-ghc9.6.7.so
  8547. 478.20 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin-ghc9.6.7.so
  8548. 478.32 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin-ghc9.6.7.so
  8549. 478.42 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin-ghc9.6.7.so
  8550. 478.54 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin-ghc9.6.7.so
  8551. 478.65 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin-ghc9.6.7.so
  8552. 478.80 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin-ghc9.6.7.so
  8553. 478.94 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin-ghc9.6.7.so
  8554. 479.07 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin-ghc9.6.7.so
  8555. 479.18 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin-ghc9.6.7.so
  8556. 479.31 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin-ghc9.6.7.so
  8557. 479.43 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin-ghc9.6.7.so
  8558. 479.54 s [haskell-language-server] checking for references to /build/ in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0...
  8559. 479.68 s [haskell-language-server] patching script interpreter paths in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0
  8560. 479.69 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/haskell-language-server: interpreter directive changed from "#!/bin/sh" to "/nix/store/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
  8561. 479.72 s [haskell-language-server] stripping (with command strip and flags -S -p) in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  8562. 480.91 s [haskell-language-server] rewriting symlink /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/haskell-language-server-9.6.7 to be relative to /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0
  8563. 483.52 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0
  8564. 484.59 s [post-build-hook] Pushing 1 paths (660 are already present) using zstd to cache sellout ⏳
  8565. 484.59 s [post-build-hook]
  8566. 485.10 s [post-build-hook] Pushing /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0 (123.63 MiB)
  8567. 488.19 s [post-build-hook]
  8568. 488.19 s [post-build-hook] All done.
  8569. 488.22 s [post-build-hook] Uploading to the NixCI cache: /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0
  8570. 488.28 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  8571. 488.36 s [post-build-hook] copying 1 paths...
  8572. 488.36 s [post-build-hook] copying path '/nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0' to 'https://cache.nix-ci.com'...
  8573. 509.27 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  8574. 509.89 s [post-build-hook] copying 119 paths...
  8575. 509.93 s [post-build-hook] copying path '/nix/store/1anixijcmxsagfslr6s5g6kwc0y3kwiy-heaps-0.4.1.drv' to 'https://cache.nix-ci.com'...
  8576. 509.93 s [post-build-hook] copying path '/nix/store/6d3nbqdhyl620r5izmzybikv6kfvmc2q-relude-1.2.2.2.drv' to 'https://cache.nix-ci.com'...
  8577. 509.93 s [post-build-hook] copying path '/nix/store/55vishpdpnn2f6wv9nj821bkgfvljdl3-ghc-lib-parser-9.8.5.20250214.tar.gz.drv' to 'https://cache.nix-ci.com'...
  8578. 509.93 s [post-build-hook] copying path '/nix/store/46xajjrzid9563wg1kdxrhjnvpwn2xgf-hspec-hedgehog-0.3.0.0.drv' to 'https://cache.nix-ci.com'...
  8579. 509.93 s [post-build-hook] copying path '/nix/store/4fcdvf3dr03bsbjqj9806xpzgzlhfvn5-colourista-0.1.0.2.drv' to 'https://cache.nix-ci.com'...
  8580. 509.93 s [post-build-hook] copying path '/nix/store/5ik4g51xqspq8cfms6rm10wbrgmf7r16-monad-dijkstra-0.1.1.5.tar.gz.drv' to 'https://cache.nix-ci.com'...
  8581. 509.93 s [post-build-hook] copying path '/nix/store/94x0nhr8p9zaclv4a47r3dxa84ajzbiv-path-0.9.6.drv' to 'https://cache.nix-ci.com'...
  8582. 509.93 s [post-build-hook] copying path '/nix/store/1i8sbvbngykff57ybdzql39q01r8k1zs-refact-0.3.0.2.drv' to 'https://cache.nix-ci.com'...
  8583. 509.93 s [post-build-hook] copying path '/nix/store/2i3752ma5zg43pz2s0z4yqbghpsjk1yq-commutative-semigroups-0.2.0.2.drv' to 'https://cache.nix-ci.com'...
  8584. 509.93 s [post-build-hook] copying path '/nix/store/8pqg623kl9h4s2cy4bisv3qzr326jqiy-stylish-haskell-0.14.6.0.tar.gz.drv' to 'https://cache.nix-ci.com'...
  8585. 509.93 s [post-build-hook] copying path '/nix/store/93kpbwc8klkll2lm13mg7l2skv545j69-b0df07178133b5b049e3e7764acba0e5e3fa57af.patch.drv' to 'https://cache.nix-ci.com'...
  8586. 509.93 s [post-build-hook] copying path '/nix/store/5cmflmilwj5jw1yiny160nmba8pnfizy-hlint-3.8.tar.gz.drv' to 'https://cache.nix-ci.com'...
  8587. 509.93 s [post-build-hook] copying path '/nix/store/cv6jspkx432k5l175ky5vvphgxbdscjr-hspec-megaparsec-2.2.1.drv' to 'https://cache.nix-ci.com'...
  8588. 509.93 s [post-build-hook] copying path '/nix/store/can6rlqpdjy1839pqs52w6bxpylppvim-ormolu-0.7.4.0-r5.cabal.drv' to 'https://cache.nix-ci.com'...
  8589. 509.93 s [post-build-hook] copying path '/nix/store/1hfpkmcfif1yc2bik0s21d912z2m5scs-random-shuffle-0.0.4.tar.gz.drv' to 'https://cache.nix-ci.com'...
  8590. 509.93 s [post-build-hook] copying path '/nix/store/4k8mdpcc00rjplhzmfan1gqxd9f84l8p-githash-0.1.7.0.drv' to 'https://cache.nix-ci.com'...
  8591. 510.13 s [post-build-hook] copying path '/nix/store/cwsf2vgg5z6f7bz1c19wimsxnb2j5p9q-extensions-0.1.0.1-r1.cabal.drv' to 'https://cache.nix-ci.com'...
  8592. 510.18 s [post-build-hook] copying path '/nix/store/dmsznk7q7a3xr7ajhd3ak87zxy471i3x-fail-4.9.0.0.tar.gz.drv' to 'https://cache.nix-ci.com'...
  8593. 510.18 s [post-build-hook] copying path '/nix/store/fqnijdw5gjpz3wnqmrgx45ka6iyzwwdi-entropy-0.4.1.11.drv' to 'https://cache.nix-ci.com'...
  8594. 510.19 s [post-build-hook] copying path '/nix/store/g7d03d4vvm931cz3zr7ac323yrkfjfm9-dir-traverse-0.2.3.0.drv' to 'https://cache.nix-ci.com'...
  8595. 510.19 s [post-build-hook] copying path '/nix/store/hg25hnlwsjb5milwajslbf4nd1i1lyzp-vector-th-unbox-0.2.2.drv' to 'https://cache.nix-ci.com'...
  8596. 510.19 s [post-build-hook] copying path '/nix/store/hrwj4v86rqcqxmz89z9ss3vggcwdffzp-retrie-1.2.3.tar.gz.drv' to 'https://cache.nix-ci.com'...
  8597. 510.19 s [post-build-hook] copying path '/nix/store/hz1sbq0lypd4xklacffqjcsr2dv1ydmk-hscolour-1.25.drv' to 'https://cache.nix-ci.com'...
  8598. 510.24 s [post-build-hook] copying path '/nix/store/i3gnrvir3475hz696mls2sc70xifcq31-fourmolu-0.15.0.0-r1.cabal.drv' to 'https://cache.nix-ci.com'...
  8599. 510.24 s [post-build-hook] copying path '/nix/store/izy72imhaajqphchm9d1x6s56gn9x6r5-microaeson-0.1.0.3.drv' to 'https://cache.nix-ci.com'...
  8600. 510.24 s [post-build-hook] copying path '/nix/store/k888jdf8wrg4rj6sg4p6sg678gfin0nm-validation-selective-0.2.0.0.drv' to 'https://cache.nix-ci.com'...
  8601. 510.24 s [post-build-hook] copying path '/nix/store/l5g1qdympv53y5mj77gsvv3r7253wd2q-MonadRandom-0.6.2.tar.gz.drv' to 'https://cache.nix-ci.com'...
  8602. 510.24 s [post-build-hook] copying path '/nix/store/lmxi42ppyfh8zcks9f2dg91krjinjzw6-ormolu-0.7.4.0.tar.gz.drv' to 'https://cache.nix-ci.com'...
  8603. 510.24 s [post-build-hook] copying path '/nix/store/m6zrfz3fj89sslx2wyr1mjfbnx09bkjp-HsYAML-0.2.1.5.drv' to 'https://cache.nix-ci.com'...
  8604. 510.24 s [post-build-hook] copying path '/nix/store/n24bznzwbymvl5136wc3mpkda9x33cwi-filemanip-0.3.6.3.drv' to 'https://cache.nix-ci.com'...
  8605. 510.24 s [post-build-hook] copying path '/nix/store/n4ar2rmy5hi4lj9745mc2r9i2z0w65v9-ghc-paths-0.1.0.12.drv' to 'https://cache.nix-ci.com'...
  8606. 510.24 s [post-build-hook] copying path '/nix/store/pikdjcsgm97yill6547qkf4kh34d0mjl-primes-0.2.1.0.drv' to 'https://cache.nix-ci.com'...
  8607. 510.38 s [post-build-hook] copying path '/nix/store/pk9wmil5g1914vhd2474bfzahdh4pxx3-fourmolu-0.15.0.0.tar.gz.drv' to 'https://cache.nix-ci.com'...
  8608. 510.42 s [post-build-hook] copying path '/nix/store/pxx1fd3bhsngp1w90rcccbfpa38g39v9-filtrable-0.1.6.0.drv' to 'https://cache.nix-ci.com'...
  8609. 510.47 s [post-build-hook] copying path '/nix/store/r3svy7zfj80fp89nganb954dz7akbrpk-psqueues-0.2.8.2.drv' to 'https://cache.nix-ci.com'...
  8610. 510.47 s [post-build-hook] copying path '/nix/store/r3akfq0v5ah0ysk65997hbcbi9d70snp-ghc-lib-parser-9.8.5.20250214.drv' to 'https://cache.nix-ci.com'...
  8611. 510.47 s [post-build-hook] copying path '/nix/store/s3s5jz3wan33d1h4i32jcrqqhcvivbk0-ghc-exactprint-1.7.1.0.tar.gz.drv' to 'https://cache.nix-ci.com'...
  8612. 510.47 s [post-build-hook] copying path '/nix/store/s9m2vgwl8n16h30yxn8b1pkj2rsb887r-ghc-lib-parser-ex-9.8.0.2.tar.gz.drv' to 'https://cache.nix-ci.com'...
  8613. 510.47 s [post-build-hook] copying path '/nix/store/qrbi1lk6c8f48prsl6kbgr9r46c3pihv-markdown-unlit-0.6.0.drv' to 'https://cache.nix-ci.com'...
  8614. 510.52 s [post-build-hook] copying path '/nix/store/v0swygjq31vnyjkb456p66pqhgf9ng0z-uniplate-1.6.13.drv' to 'https://cache.nix-ci.com'...
  8615. 510.52 s [post-build-hook] copying path '/nix/store/vv4vxcpwslmw7f6h6zxhgwd6rminmlas-cabal-doctest-1.0.12.drv' to 'https://cache.nix-ci.com'...
  8616. 510.52 s [post-build-hook] copying path '/nix/store/swj2w4wkc17v4z7shmniq0x0fhma0qbb-extensions-0.1.0.1.tar.gz.drv' to 'https://cache.nix-ci.com'...
  8617. 510.57 s [post-build-hook] copying path '/nix/store/wkvspjnn0y41xmmb4jm8djdib8bpg6qj-optparse-simple-0.1.1.4.drv' to 'https://cache.nix-ci.com'...
  8618. 510.57 s [post-build-hook] copying path '/nix/store/wk4357c75h7rgrg12xlg9kwy1z1idsvz-floskell-0.11.1.tar.gz.drv' to 'https://cache.nix-ci.com'...
  8619. 510.57 s [post-build-hook] copying path '/nix/store/why0vvinxpzpdyj8aw5sgk0yb5b013fa-trial-0.0.0.0.drv' to 'https://cache.nix-ci.com'...
  8620. 510.57 s [post-build-hook] copying path '/nix/store/x937iqharrq6j7ijw30cf885fcvc0yrd-clay-0.16.1.drv' to 'https://cache.nix-ci.com'...
  8621. 510.57 s [post-build-hook] copying path '/nix/store/z27ism425zhz1vw1lf55chfbvsxrvbz0-newtype-generics-0.6.2.drv' to 'https://cache.nix-ci.com'...
  8622. 510.57 s [post-build-hook] copying path '/nix/store/yj9jjrnc4s74qy7apjjfz2xvbx7xf7zn-deriving-aeson-0.2.10.drv' to 'https://cache.nix-ci.com'...
  8623. 510.61 s [post-build-hook] copying path '/nix/store/z44ckjv45y80266773fi15pm2sag9z4d-pretty-simple-4.1.4.0.drv' to 'https://cache.nix-ci.com'...
  8624. 510.65 s [post-build-hook] copying path '/nix/store/zbm1gsdcq77xgwpm1na4rqff8ljh53lm-fmlist-0.9.4.drv' to 'https://cache.nix-ci.com'...
  8625. 510.70 s [post-build-hook] copying path '/nix/store/zcnhg61h9xi0z8shjqm5f1kpz9qhzmy2-path-io-1.8.2.drv' to 'https://cache.nix-ci.com'...
  8626. 510.70 s [post-build-hook] copying path '/nix/store/zwiz0flaib11rd20f8pwk2p9c0krfq5y-ordered-containers-0.2.4.drv' to 'https://cache.nix-ci.com'...
  8627. 510.70 s [post-build-hook] copying path '/nix/store/ay3k2i6zc7mr54r3zszjmkgc2splvrym-shake-0.19.8.drv' to 'https://cache.nix-ci.com'...
  8628. 510.70 s [post-build-hook] copying path '/nix/store/17kjpbh3f85hhlq9i2nxracdw0q494xd-slist-0.2.1.0.drv' to 'https://cache.nix-ci.com'...
  8629. 510.70 s [post-build-hook] copying path '/nix/store/ff8n0fqpl5srjkskqmaxvbmswm0ydchk-fail-4.9.0.0.drv' to 'https://cache.nix-ci.com'...
  8630. 510.75 s [post-build-hook] copying path '/nix/store/7zc8w2dk4hix7kggrcxrqbg295bp9sr1-math-functions-0.3.4.4.drv' to 'https://cache.nix-ci.com'...
  8631. 510.75 s [post-build-hook] copying path '/nix/store/8kvbkl3v5izwsi5g3kvarcsxnvklrrai-HsYAML-aeson-0.2.0.2.drv' to 'https://cache.nix-ci.com'...
  8632. 510.75 s [post-build-hook] copying path '/nix/store/cjs337qgzfraxmrxji9xq0249vlgfl0w-monoid-subclasses-1.2.6.drv' to 'https://cache.nix-ci.com'...
  8633. 510.80 s [post-build-hook] copying path '/nix/store/8z45n8r7a0vxs3np9kjn8gq7rzvlrwh8-tomland-1.3.3.3.drv' to 'https://cache.nix-ci.com'...
  8634. 510.81 s [post-build-hook] copying path '/nix/store/7i70d4ri1jj0310araa19qvh930rh1wr-MonadRandom-0.6.2.drv' to 'https://cache.nix-ci.com'...
  8635. 510.81 s [post-build-hook] copying path '/nix/store/0f5pbd61m9d4lq85gysr3bfv25vj6g2d-doctest-0.24.2.drv' to 'https://cache.nix-ci.com'...
  8636. 510.81 s [post-build-hook] copying path '/nix/store/kpicw7a0shnlrn7m5piva4h2amk1y91q-regex-applicative-0.3.4.drv' to 'https://cache.nix-ci.com'...
  8637. 510.86 s [post-build-hook] copying path '/nix/store/6f0nsddrsps5dbibmrlrv7vas48s1nac-th-env-0.1.1.drv' to 'https://cache.nix-ci.com'...
  8638. 510.86 s [post-build-hook] copying path '/nix/store/p40khg0m9as6kiflgb3n4bajbpn0rqb2-extensions-0.1.0.1.drv' to 'https://cache.nix-ci.com'...
  8639. 510.92 s [post-build-hook] copying path '/nix/store/29g826chkbdvbkz9dzghszapxsc6bpd9-pcg-random-0.1.4.0.drv' to 'https://cache.nix-ci.com'...
  8640. 510.97 s [post-build-hook] copying path '/nix/store/grw2kz9j0adc65xc09hfn0cvgsrj7wr7-ghc-lib-parser-ex-9.8.0.2.drv' to 'https://cache.nix-ci.com'...
  8641. 510.98 s [post-build-hook] copying path '/nix/store/d9hmx3pfhgijg8py3jzxs5qrnkyn31bq-MemoTrie-0.6.11.drv' to 'https://cache.nix-ci.com'...
  8642. 510.98 s [post-build-hook] copying path '/nix/store/jgadx2bn6gwx7licwf865klfrg7g1bg3-trial-optparse-applicative-0.0.0.0.drv' to 'https://cache.nix-ci.com'...
  8643. 510.98 s [post-build-hook] copying path '/nix/store/h0cg7hwbx96h8ww35hsdgl08d4scmrvd-ListLike-4.7.8.4.drv' to 'https://cache.nix-ci.com'...
  8644. 510.98 s [post-build-hook] copying path '/nix/store/5i644mwp722mjzd6si8pa7bvnb6hfp4h-ghc-exactprint-1.7.1.0.drv' to 'https://cache.nix-ci.com'...
  8645. 511.03 s [post-build-hook] copying path '/nix/store/xdmbhr4hhh0h5a7rxrv3md3nlcccx3c4-fuzzy-0.1.1.0.drv' to 'https://cache.nix-ci.com'...
  8646. 511.03 s [post-build-hook] copying path '/nix/store/24bs87lmf8m8v9m8ik082lrdl33z2aly-mwc-random-0.15.2.0.drv' to 'https://cache.nix-ci.com'...
  8647. 511.09 s [post-build-hook] copying path '/nix/store/ldaacqa0cdsrpjfiw1lszpxnd5g429m0-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  8648. 511.09 s [post-build-hook] copying path '/nix/store/n9jgkwj3n3039b2xmpxgzq01p5wp88jj-trial-tomland-0.0.0.0.drv' to 'https://cache.nix-ci.com'...
  8649. 511.09 s [post-build-hook] copying path '/nix/store/a5yvz42v5mh8lj7p9wwqbs68frr2khzl-random-shuffle-0.0.4.drv' to 'https://cache.nix-ci.com'...
  8650. 511.25 s [post-build-hook] copying path '/nix/store/bairzzr972yr04dw0w1s4qxf2g7n0j04-stylish-haskell-0.14.6.0.drv' to 'https://cache.nix-ci.com'...
  8651. 511.25 s [post-build-hook] copying path '/nix/store/kgvg0idnq5gy5d0fk3g5rvschv8mspds-process-extras-0.7.4.drv' to 'https://cache.nix-ci.com'...
  8652. 511.25 s [post-build-hook] copying path '/nix/store/ac3057ary3ggk60m7wympmq28qbrj3zz-ormolu-0.7.4.0.drv' to 'https://cache.nix-ci.com'...
  8653. 511.25 s [post-build-hook] copying path '/nix/store/qh28b0xln14zr3sdjhp3g76kbw72m7ij-hlint-3.8.drv' to 'https://cache.nix-ci.com'...
  8654. 511.25 s [post-build-hook] copying path '/nix/store/x6kml2fyfn4rkr2smk8fss3kxvwp4z1p-fourmolu-0.15.0.0.drv' to 'https://cache.nix-ci.com'...
  8655. 511.31 s [post-build-hook] copying path '/nix/store/cs16j13ag9cji0f1k8f73qlkl4la90z2-random-bytestring-0.1.4.drv' to 'https://cache.nix-ci.com'...
  8656. 511.36 s [post-build-hook] copying path '/nix/store/l71rvkbbfi5r2zzwh5b3ki4by53imyy0-attoparsec-0.14.4.drv' to 'https://cache.nix-ci.com'...
  8657. 511.36 s [post-build-hook] copying path '/nix/store/yirjq103f400mpcvly2v0b0is38szhyw-nothunks-0.3.1.drv' to 'https://cache.nix-ci.com'...
  8658. 511.54 s [post-build-hook] copying path '/nix/store/3qc8xw3phbgbg7nk1wnvi9qanv87hni8-base64-1.0.drv' to 'https://cache.nix-ci.com'...
  8659. 511.59 s [post-build-hook] copying path '/nix/store/k96qggy30gdcv32zv96j84m33w3gf6da-unordered-containers-0.2.20.1.drv' to 'https://cache.nix-ci.com'...
  8660. 511.76 s [post-build-hook] copying path '/nix/store/p1r9b27js269128b7xwka9dj4rrfaj0p-stan-0.2.1.0.drv' to 'https://cache.nix-ci.com'...
  8661. 511.85 s [post-build-hook] copying path '/nix/store/mljnvmyq3w3cqi2yrfhjhn77s9h1137l-uniplate-1.6.13.drv' to 'https://cache.nix-ci.com'...
  8662. 511.85 s [post-build-hook] copying path '/nix/store/l3qz8wb5m0i7s98r8j6cqp29f3bcm57r-quickcheck-instances-0.3.33.drv' to 'https://cache.nix-ci.com'...
  8663. 511.85 s [post-build-hook] copying path '/nix/store/wbs1bxqqbpwm3pyaq922vz23j7q05dcy-semigroupoids-6.0.1.drv' to 'https://cache.nix-ci.com'...
  8664. 511.85 s [post-build-hook] copying path '/nix/store/nfhdaidzrx4j6r2yb3zn1bpm8qml36jg-semirings-0.7.drv' to 'https://cache.nix-ci.com'...
  8665. 512.07 s [post-build-hook] copying path '/nix/store/8njcsyk8kvy80dc0xjm7kric6vabv05b-extra-1.8.1.drv' to 'https://cache.nix-ci.com'...
  8666. 512.07 s [post-build-hook] copying path '/nix/store/jfpdhd1q5kk5vi8q2a01db83ww2f54c0-text-iso8601-0.1.1.drv' to 'https://cache.nix-ci.com'...
  8667. 512.07 s [post-build-hook] copying path '/nix/store/rvga7kk839hyjv09gc73xzsbhmvml8r1-indexed-traversable-instances-0.1.2.drv' to 'https://cache.nix-ci.com'...
  8668. 512.07 s [post-build-hook] copying path '/nix/store/3fqvy35j2yw7q3srrfzgqcki5iyrhkx3-foldl-1.4.18.drv' to 'https://cache.nix-ci.com'...
  8669. 512.07 s [post-build-hook] copying path '/nix/store/k7z9k5y432sbbgkkp8yc9yrfpqxwqjlc-free-5.2.drv' to 'https://cache.nix-ci.com'...
  8670. 512.32 s [post-build-hook] copying path '/nix/store/d0sb8macak0a371f4w26fxy0ak5p5rih-ghc-lib-parser-ex-9.8.0.2.drv' to 'https://cache.nix-ci.com'...
  8671. 512.33 s [post-build-hook] copying path '/nix/store/ypvyrqh4xrdlhmj5wz9s0fbzs2lml5rc-filepattern-0.1.3.drv' to 'https://cache.nix-ci.com'...
  8672. 512.33 s [post-build-hook] copying path '/nix/store/jhs9jcf5d5j2g0izjzn2z2p5jpkcbzv9-witherable-0.5.drv' to 'https://cache.nix-ci.com'...
  8673. 512.33 s [post-build-hook] copying path '/nix/store/mc77pkq25gvz035qbydbqf5p5nxlr5k6-semialign-1.3.1.drv' to 'https://cache.nix-ci.com'...
  8674. 512.33 s [post-build-hook] copying path '/nix/store/4b5jahmj1zmi2q9krp17rsbwksdhw5vh-ghc-exactprint-1.7.1.0.drv' to 'https://cache.nix-ci.com'...
  8675. 512.54 s [post-build-hook] copying path '/nix/store/nywgzhwk47k7j0iqrp7zqcyl1r7b1m0c-aeson-2.2.3.0.drv' to 'https://cache.nix-ci.com'...
  8676. 512.59 s [post-build-hook] copying path '/nix/store/rnpcxsmmmlkkcs5m4x90j2d91drzc64z-apply-refact-0.15.0.0.drv' to 'https://cache.nix-ci.com'...
  8677. 512.84 s [post-build-hook] copying path '/nix/store/zl13dkzxchv1p3xa5605vfwjmpdqh27f-quickcheck-classes-0.6.5.0.drv' to 'https://cache.nix-ci.com'...
  8678. 512.84 s [post-build-hook] copying path '/nix/store/62jd1xf53aczb66d5v2d5qn7q9qw89gx-HTF-0.15.0.2.drv' to 'https://cache.nix-ci.com'...
  8679. 512.84 s [post-build-hook] copying path '/nix/store/aqq1hdzjp62p4pnj0390ggkrr9k5pr3a-deriving-aeson-0.2.10.drv' to 'https://cache.nix-ci.com'...
  8680. 512.84 s [post-build-hook] copying path '/nix/store/lc907lv31k9wz9bawbhg3vgglw1i80b5-attoparsec-aeson-2.2.2.0.drv' to 'https://cache.nix-ci.com'...
  8681. 513.09 s [post-build-hook] copying path '/nix/store/n7sgx3c4wl8b9nigx1ccakn3mlcy2fl5-aeson-pretty-0.8.10.drv' to 'https://cache.nix-ci.com'...
  8682. 513.09 s [post-build-hook] copying path '/nix/store/2djbbx1y4ca60vdqqk2lbarnqf1nxmhh-bitvec-1.1.5.0.drv' to 'https://cache.nix-ci.com'...
  8683. 513.09 s [post-build-hook] copying path '/nix/store/dy3g6pd1wws3kb535ijwm68mx85kjzfz-list-t-1.0.5.7.drv' to 'https://cache.nix-ci.com'...
  8684. 513.60 s [post-build-hook] copying path '/nix/store/jxnnp72s41q197j5khm1dbyppdk5psa5-vector-algorithms-0.9.1.0.drv' to 'https://cache.nix-ci.com'...
  8685. 513.64 s [post-build-hook] copying path '/nix/store/48z571r4gm1rbzwzh62j2vfy9kkazd60-retrie-1.2.3.drv' to 'https://cache.nix-ci.com'...
  8686. 513.81 s [post-build-hook] copying path '/nix/store/xzjkngagvrzvjplwy2sp4ymaxq8a9v40-mono-traversable-1.0.21.0.drv' to 'https://cache.nix-ci.com'...
  8687. 514.02 s [post-build-hook] copying path '/nix/store/7n9m5z3ajbjbn9fjr12j6c2iibpxpvx3-conduit-1.3.6.1.drv' to 'https://cache.nix-ci.com'...
  8688. 514.24 s [post-build-hook] copying path '/nix/store/h476q6y7hms8qz13q5wqhk6jss7bskjv-libyaml-0.1.4.drv' to 'https://cache.nix-ci.com'...
  8689. 514.45 s [post-build-hook] copying path '/nix/store/04k9jvxmvbxzi7aw4n65l3jwdz8zvfdq-yaml-0.11.11.2.drv' to 'https://cache.nix-ci.com'...
  8690. 514.69 s [post-build-hook] copying path '/nix/store/76lch09dxy32bqyrw36ygpc85rzs8ax5-hlint-3.8.drv' to 'https://cache.nix-ci.com'...
  8691. 514.94 s [post-build-hook] copying path '/nix/store/cnzin3r1q71fgprsam2qfa0lc7mkybcg-monad-dijkstra-0.1.1.5.drv' to 'https://cache.nix-ci.com'...
  8692. 515.16 s [post-build-hook] copying path '/nix/store/kch4w2pdl27b77a7acgfcsy4qppmm050-floskell-0.11.1.drv' to 'https://cache.nix-ci.com'...
  8693. 515.41 s [post-build-hook] copying path '/nix/store/xj1m88nvjddmccvigs4nbpjrpr8w2cy9-haskell-language-server-2.12.0.0.drv' to 'https://cache.nix-ci.com'...
  8694. 515.72 s Progress: 3 of 5 built
  8695. 515.86 s Building ghc-shell-for-packages
  8696. 516.84 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/bxg479kxnyfixrkkzix69c5j19i576iy-ghc-shell-for-packages-0
  8697. 517.55 s [post-build-hook] Pushing 2 paths (877 are already present) using zstd to cache sellout ⏳
  8698. 517.55 s [post-build-hook]
  8699. 517.93 s [post-build-hook] Pushing /nix/store/2nz6ghwj4lif5nxwzmzc80y6hpyn0x9y-util-linux-minimal-2.41.3-login (95.23 KiB)
  8700. 518.10 s [post-build-hook] Pushing /nix/store/bxg479kxnyfixrkkzix69c5j19i576iy-ghc-shell-for-packages-0 (336.00 B)
  8701. 519.16 s [post-build-hook]
  8702. 519.16 s [post-build-hook] All done.
  8703. 519.18 s [post-build-hook] Uploading to the NixCI cache: /nix/store/bxg479kxnyfixrkkzix69c5j19i576iy-ghc-shell-for-packages-0
  8704. 519.25 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  8705. 519.32 s [post-build-hook] copying 1 paths...
  8706. 519.33 s [post-build-hook] copying path '/nix/store/bxg479kxnyfixrkkzix69c5j19i576iy-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...
  8707. 519.65 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  8708. 520.04 s [post-build-hook] copying 1 paths...
  8709. 520.08 s [post-build-hook] copying path '/nix/store/g5dmpyig36i52nhvhjzsjkwjpyv3g3yc-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...
  8710. 520.28 s Progress: 4 of 5 built
Tail Raw Logs