$ /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[m
[33m[35;1mwarning:[0m ignoring untrusted flake configuration setting 'allow-import-from-derivation'.
Pass '--accept-flake-config' to trust it[m
[33m[35;1mwarning:[0m ignoring untrusted flake configuration setting 'extra-experimental-features'.
Pass '--accept-flake-config' to trust it[m
[33m[35;1mwarning:[0m ignoring untrusted flake configuration setting 'extra-substituters'.
Pass '--accept-flake-config' to trust it[m
[33m[35;1mwarning:[0m ignoring untrusted flake configuration setting 'extra-trusted-public-keys'.
Pass '--accept-flake-config' to trust it[m
[33m[35;1mwarning:[0m ignoring untrusted flake configuration setting 'sandbox'.
Pass '--accept-flake-config' to trust it[m
[33m[35;1mwarning:[0m ignoring untrusted flake configuration setting 'use-registries'.
Pass '--accept-flake-config' to trust it[m
[1;31m[31;1merror (ignored):[0m SQLite database '[35;1m/var/cache/private/nix-ci-worker/eval-cache-v6/19f80154faf27ddfad5dcb3251253294aea6c838e143ff7a5a949b25d9d532ff.sqlite[0m' is busy[m
[33m'system' has been renamed to/replaced by 'stdenv.hostPlatform.system'[m
[2m[m
[1;34mBuilding haskell-language-server[m
[1;34mBuilding algebraic-graphs[m
[2m[algebraic-graphs] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[algebraic-graphs] [mBuild with /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7.
[2m[algebraic-graphs] [m[1;36mPhase: unpackPhase[m
[2m[algebraic-graphs] [munpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
[2m[algebraic-graphs] [msource root is algebraic-graphs-0.7
[2m[algebraic-graphs] [msetting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
[2m[algebraic-graphs] [m[1;36mPhase: patchPhase[m
[2m[algebraic-graphs] [mReplace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
[2m[algebraic-graphs] [mapplying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
[2m[algebraic-graphs] [mpatching file algebraic-graphs.cabal
[2m[algebraic-graphs] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[algebraic-graphs] [msetupCompileFlags: -package-db=/build/tmp.8LLTLQvQ4z/setup-package.conf.d -threaded
[2m[algebraic-graphs] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.8LLTLQvQ4z/Main.o )
[2m[algebraic-graphs] [m[2 of 2] Linking Setup
[2m[haskell-language-server] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[haskell-language-server] [mBuild with /nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7.
[2m[algebraic-graphs] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[algebraic-graphs] [m[1;36mPhase: configurePhase[m
[2m[algebraic-graphs] [mconfigureFlags: --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
[2m[algebraic-graphs] [mUsing Parsec parser
[2m[algebraic-graphs] [mConfiguring algebraic-graphs-0.7...
[2m[algebraic-graphs] [mDependency array >=0.4 && <0.6: using array-0.5.8.0
[2m[algebraic-graphs] [mDependency base >=4.11 && <5: using base-4.18.3.0
[2m[algebraic-graphs] [mDependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
[2m[algebraic-graphs] [mDependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.1
[2m[algebraic-graphs] [mDependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
[2m[algebraic-graphs] [mDependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
[2m[algebraic-graphs] [mDependency algebraic-graphs: using algebraic-graphs-0.7
[2m[algebraic-graphs] [mDependency array >=0.4 && <0.6: using array-0.5.8.0
[2m[algebraic-graphs] [mDependency base >=4.11 && <5: using base-4.18.3.0
[2m[algebraic-graphs] [mDependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
[2m[algebraic-graphs] [mDependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.1
[2m[algebraic-graphs] [mDependency extra >=1.4 && <2: using extra-1.8.1
[2m[algebraic-graphs] [mDependency inspection-testing >=0.4.2.2 && <0.7: using
[2m[algebraic-graphs] [minspection-testing-0.6.2
[2m[algebraic-graphs] [mDependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
[2m[haskell-language-server] [m[1;36mPhase: unpackPhase[m
[2m[haskell-language-server] [munpacking source archive /nix/store/kqr4dg4wyp0h2dbm7y21zlbp3chihj6k-haskell-language-server-2.12.0.0.tar.gz
[2m[haskell-language-server] [msource root is haskell-language-server-2.12.0.0
[2m[haskell-language-server] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "haskell-language-server-2.12.0.0/test/wrapper/Main.hs"
[2m[haskell-language-server] [m[1;36mPhase: patchPhase[m
[2m[haskell-language-server] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[haskell-language-server] [msetupCompileFlags: -package-db=/build/tmp.ahi0eJk2Ab/setup-package.conf.d -threaded
[2m[haskell-language-server] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.ahi0eJk2Ab/Main.o )
[2m[haskell-language-server] [m[2 of 2] Linking Setup
[2m[algebraic-graphs] [mSource component graph:
[2m[algebraic-graphs] [m    component lib
[2m[algebraic-graphs] [m    component test:main dependency lib
[2m[algebraic-graphs] [mConfigured component graph:
[2m[algebraic-graphs] [m    component algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
[2m[algebraic-graphs] [m        include array-0.5.8.0
[2m[algebraic-graphs] [m        include base-4.18.3.0
[2m[algebraic-graphs] [m        include containers-0.6.7
[2m[algebraic-graphs] [m        include deepseq-1.4.8.1
[2m[algebraic-graphs] [m        include transformers-0.6.1.0
[2m[algebraic-graphs] [m    component algebraic-graphs-0.7-Hb7qr09bMx9JHq5kA09kif-main
[2m[algebraic-graphs] [m        include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
[2m[algebraic-graphs] [m        include algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
[2m[algebraic-graphs] [m        include array-0.5.8.0
[2m[algebraic-graphs] [m        include base-4.18.3.0
[2m[algebraic-graphs] [m        include containers-0.6.7
[2m[algebraic-graphs] [m        include deepseq-1.4.8.1
[2m[algebraic-graphs] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[algebraic-graphs] [m        include inspection-testing-0.6.2-3QX2depSWaUFw922pdySLQ
[2m[algebraic-graphs] [m        include transformers-0.6.1.0
[2m[algebraic-graphs] [mLinked component graph:
[2m[algebraic-graphs] [m    unit algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
[2m[algebraic-graphs] [m        include array-0.5.8.0
[2m[algebraic-graphs] [m        include base-4.18.3.0
[2m[algebraic-graphs] [m        include containers-0.6.7
[2m[algebraic-graphs] [m        include deepseq-1.4.8.1
[2m[algebraic-graphs] [m        include transformers-0.6.1.0
[2m[algebraic-graphs] [m        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
[2m[algebraic-graphs] [m    unit algebraic-graphs-0.7-Hb7qr09bMx9JHq5kA09kif-main
[2m[algebraic-graphs] [m        include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
[2m[algebraic-graphs] [m        include algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
[2m[algebraic-graphs] [m        include array-0.5.8.0
[2m[algebraic-graphs] [m        include base-4.18.3.0
[2m[algebraic-graphs] [m        include containers-0.6.7
[2m[algebraic-graphs] [m        include deepseq-1.4.8.1
[2m[algebraic-graphs] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[algebraic-graphs] [m        include inspection-testing-0.6.2-3QX2depSWaUFw922pdySLQ
[2m[algebraic-graphs] [m        include transformers-0.6.1.0
[2m[algebraic-graphs] [mReady component graph:
[2m[algebraic-graphs] [m    definite algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
[2m[algebraic-graphs] [m        depends array-0.5.8.0
[2m[algebraic-graphs] [m        depends base-4.18.3.0
[2m[algebraic-graphs] [m        depends containers-0.6.7
[2m[algebraic-graphs] [m        depends deepseq-1.4.8.1
[2m[algebraic-graphs] [m        depends transformers-0.6.1.0
[2m[algebraic-graphs] [m    definite algebraic-graphs-0.7-Hb7qr09bMx9JHq5kA09kif-main
[2m[algebraic-graphs] [m        depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
[2m[algebraic-graphs] [m        depends algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
[2m[algebraic-graphs] [m        depends array-0.5.8.0
[2m[algebraic-graphs] [m        depends base-4.18.3.0
[2m[algebraic-graphs] [m        depends containers-0.6.7
[2m[algebraic-graphs] [m        depends deepseq-1.4.8.1
[2m[algebraic-graphs] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[algebraic-graphs] [m        depends inspection-testing-0.6.2-3QX2depSWaUFw922pdySLQ
[2m[algebraic-graphs] [m        depends transformers-0.6.1.0
[2m[algebraic-graphs] [mUsing Cabal-3.10.3.0 compiled by ghc-9.6
[2m[algebraic-graphs] [mUsing compiler: ghc-9.6.7
[2m[algebraic-graphs] [mUsing install prefix:
[2m[algebraic-graphs] [m/nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7
[2m[algebraic-graphs] [mExecutables installed in:
[2m[algebraic-graphs] [m/nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/bin
[2m[algebraic-graphs] [mLibraries installed in:
[2m[algebraic-graphs] [m/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
[2m[algebraic-graphs] [mDynamic Libraries installed in:
[2m[algebraic-graphs] [m/nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
[2m[algebraic-graphs] [mPrivate executables installed in:
[2m[algebraic-graphs] [m/nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7
[2m[algebraic-graphs] [mData files installed in:
[2m[algebraic-graphs] [m/nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7
[2m[algebraic-graphs] [mDocumentation installed in:
[2m[algebraic-graphs] [m/nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
[2m[algebraic-graphs] [mConfiguration files installed in:
[2m[algebraic-graphs] [m/nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/etc
[2m[algebraic-graphs] [mNo alex found
[2m[algebraic-graphs] [mUsing ar found on system at:
[2m[algebraic-graphs] [m/nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
[2m[algebraic-graphs] [mNo c2hs found
[2m[algebraic-graphs] [mNo cpphs found
[2m[algebraic-graphs] [mNo doctest found
[2m[algebraic-graphs] [mUsing gcc version 14.3.0 given by user at:
[2m[algebraic-graphs] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[algebraic-graphs] [mUsing ghc version 9.6.7 found on system at:
[2m[algebraic-graphs] [m/nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/ghc
[2m[algebraic-graphs] [mUsing ghc-pkg version 9.6.7 found on system at:
[2m[algebraic-graphs] [m/nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/ghc-pkg-9.6.7
[2m[algebraic-graphs] [mNo ghcjs found
[2m[algebraic-graphs] [mNo ghcjs-pkg found
[2m[algebraic-graphs] [mNo greencard found
[2m[algebraic-graphs] [mUsing haddock version 2.29.2 found on system at:
[2m[algebraic-graphs] [m/nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/haddock-ghc-9.6.7
[2m[algebraic-graphs] [mNo happy found
[2m[algebraic-graphs] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[algebraic-graphs] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[algebraic-graphs] [mNo hmake found
[2m[algebraic-graphs] [mUsing hpc version 0.68 found on system at:
[2m[algebraic-graphs] [m/nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/hpc-ghc-9.6.7
[2m[algebraic-graphs] [mUsing hsc2hs version 0.68.9 found on system at:
[2m[algebraic-graphs] [m/nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
[2m[algebraic-graphs] [mUsing hscolour version 1.25 found on system at:
[2m[algebraic-graphs] [m/nix/store/na3h6k2pdvfb6kjn5dhiqi3z5l8cfdqx-hscolour-1.25/bin/HsColour
[2m[algebraic-graphs] [mNo jhc found
[2m[algebraic-graphs] [mUsing ld found on system at:
[2m[algebraic-graphs] [m/nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
[2m[algebraic-graphs] [mNo pkg-config found
[2m[algebraic-graphs] [mUsing runghc version 9.6.7 found on system at:
[2m[algebraic-graphs] [m/nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/runghc-9.6.7
[2m[algebraic-graphs] [mUsing strip version 2.44 found on system at:
[2m[algebraic-graphs] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[algebraic-graphs] [mUsing tar found on system at:
[2m[algebraic-graphs] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
[2m[algebraic-graphs] [mNo uhc found
[2m[algebraic-graphs] [m[1;36mPhase: buildPhase[m
[2m[algebraic-graphs] [mPreprocessing library for algebraic-graphs-0.7..
[2m[algebraic-graphs] [mBuilding library for algebraic-graphs-0.7..
[2m[algebraic-graphs] [m[ 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 )
[2m[haskell-language-server] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[haskell-language-server] [m[1;36mPhase: configurePhase[m
[2m[haskell-language-server] [mconfigureFlags: --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
[2m[algebraic-graphs] [m[ 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 )
[2m[haskell-language-server] [mUsing Parsec parser
[2m[haskell-language-server] [mConfiguring haskell-language-server-2.12.0.0...
[2m[algebraic-graphs] [m[ 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 )
[2m[haskell-language-server] [mFlags chosen: alternatenumberformat=True, cabal=True, cabalfmt=True,
[2m[haskell-language-server] [mcabalgild=True, callhierarchy=True, changetypesignature=True, class=True,
[2m[haskell-language-server] [mcoderange=True, dynamic=True, eval=True, explicitfields=True,
[2m[haskell-language-server] [mexplicitfixity=True, floskell=True, fourmolu=True, gadt=True, ghc-lib=True,
[2m[haskell-language-server] [mghcide-bench=True, hlint=True, ignore-plugins-ghc-bounds=False,
[2m[haskell-language-server] [mimportlens=True, isolatecabalfmttests=False, isolatecabalgildtests=False,
[2m[haskell-language-server] [mmodulename=True, notes=True, ormolu=True, overloadedrecorddot=True,
[2m[haskell-language-server] [mpedantic=False, pragmas=True, qualifyimportednames=True, refactor=True,
[2m[haskell-language-server] [mrename=True, retrie=True, semantictokens=True, signaturehelp=True,
[2m[haskell-language-server] [msplice=True, stan=True, stylishhaskell=True, test-exe=True
[2m[haskell-language-server] [mDependency aeson-pretty: using aeson-pretty-0.8.10
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency data-default: using data-default-0.8.0.1
[2m[haskell-language-server] [mDependency directory: using directory-1.3.8.5
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency filepath: using filepath-1.4.301.0
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency githash >=0.1.6.1: using githash-0.1.7.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:{hls-alternate-number-format-plugin,
[2m[haskell-language-server] [mhls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
[2m[haskell-language-server] [mhls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
[2m[haskell-language-server] [mhls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
[2m[haskell-language-server] [mhls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
[2m[haskell-language-server] [mhls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
[2m[haskell-language-server] [mhls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
[2m[haskell-language-server] [mhls-overloaded-record-dot-plugin, hls-pragmas-plugin,
[2m[haskell-language-server] [mhls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
[2m[haskell-language-server] [mhls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
[2m[haskell-language-server] [mhls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency hie-bios: using hie-bios-0.17.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency optparse-applicative: using optparse-applicative-0.18.1.0
[2m[haskell-language-server] [mDependency optparse-simple: using optparse-simple-0.1.1.4
[2m[haskell-language-server] [mDependency prettyprinter >=1.7: using prettyprinter-1.7.1
[2m[haskell-language-server] [mDependency process: using process-1.6.19.0
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency directory: using directory-1.3.8.5
[2m[haskell-language-server] [mDependency filepath: using filepath-1.4.301.0
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp-types: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency process-extras: using process-extras-0.7.4
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency directory: using directory-1.3.8.5
[2m[haskell-language-server] [mDependency filepath: using filepath-1.4.301.0
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lsp-types: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency process-extras: using process-extras-0.7.4
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency Cabal: using Cabal-3.10.3.0
[2m[haskell-language-server] [mDependency Cabal-syntax >=3.7: using Cabal-syntax-3.10.3.0
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency bytestring: using bytestring-0.11.5.4
[2m[haskell-language-server] [mDependency cabal-add >=0.2 && <0.3: using cabal-add-0.2
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency deepseq: using deepseq-1.4.8.1
[2m[haskell-language-server] [mDependency directory: using directory-1.3.8.5
[2m[haskell-language-server] [mDependency extra >=1.7.4: using extra-1.8.1
[2m[haskell-language-server] [mDependency filepath: using filepath-1.4.301.0
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hashable: using hashable-1.5.0.0
[2m[haskell-language-server] [mDependency hls-graph ==2.12.0.0: using hls-graph-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp >=2.7 && <2.8: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency lsp-types >=2.3 && <2.4: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency pretty: using pretty-1.1.3.6
[2m[haskell-language-server] [mDependency regex-tdfa >=1.3.1 && <1.4: using regex-tdfa-1.3.2.5
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency text-rope: using text-rope-0.3
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency unordered-containers >=0.2.10.0: using
[2m[haskell-language-server] [munordered-containers-0.2.20.1
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency deepseq: using deepseq-1.4.8.1
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghc-exactprint >=1.5 && <1.13.0.0: using ghc-exactprint-1.7.1.0
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-graph: using hls-graph-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hiedb >=0.7.0.0 && <0.8: using hiedb-0.7.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp >=2.7: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency sqlite-simple: using sqlite-simple-0.4.19.0
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency Diff >=0.5 && <0.6 || >=1.0.0 && <1.1: using Diff-1.0.2
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency bytestring: using bytestring-0.11.5.4
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency deepseq: using deepseq-1.4.8.1
[2m[haskell-language-server] [mDependency dlist: using dlist-1.0
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency filepath: using filepath-1.4.301.0
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghc-boot-th: using ghc-boot-th-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-graph: using hls-graph-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency lsp-types: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency megaparsec >=9.0: using megaparsec-9.7.0
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency parser-combinators >=1.2: using parser-combinators-1.3.0
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency text-rope: using text-rope-0.3
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency unliftio: using unliftio-0.2.25.1
[2m[haskell-language-server] [mDependency unordered-containers: using unordered-containers-0.2.20.1
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency deepseq: using deepseq-1.4.8.1
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-graph: using hls-graph-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hashable: using hashable-1.5.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:hls-refactor-plugin: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency hiedb >=0.7.0.0 && <0.8: using hiedb-0.7.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp-types: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency mod: using mod-0.2.1.0
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency syb: using syb-0.7.2.4
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency unordered-containers: using unordered-containers-0.2.20.1
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency bytestring: using bytestring-0.11.5.4
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hashable: using hashable-1.5.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:hls-refactor-plugin: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency lsp-types: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency retrie >=0.1.1.0: using retrie-1.2.3
[2m[haskell-language-server] [mDependency safe-exceptions: using safe-exceptions-0.1.7.4
[2m[haskell-language-server] [mDependency stm: using stm-2.5.1.0
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency text-rope: using text-rope-0.3
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency unordered-containers: using unordered-containers-0.2.20.1
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency apply-refact: using apply-refact-0.15.0.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency bytestring: using bytestring-0.11.5.4
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency deepseq: using deepseq-1.4.8.1
[2m[haskell-language-server] [mDependency filepath: using filepath-1.4.301.0
[2m[haskell-language-server] [mDependency ghc-lib-parser: using ghc-lib-parser-9.8.5.20250214
[2m[haskell-language-server] [mDependency ghc-lib-parser-ex: using ghc-lib-parser-ex-9.8.0.2
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hashable: using hashable-1.5.0.0
[2m[haskell-language-server] [mDependency hlint >=3.5 && <3.11: using hlint-3.8
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp-types: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency refact: using refact-0.3.0.2
[2m[haskell-language-server] [mDependency regex-tdfa: using regex-tdfa-1.3.2.5
[2m[haskell-language-server] [mDependency stm: using stm-2.5.1.0
[2m[haskell-language-server] [mDependency temporary: using temporary-1.3
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency text-rope: using text-rope-0.3
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency unordered-containers: using unordered-containers-0.2.20.1
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency deepseq: using deepseq-1.4.8.1
[2m[haskell-language-server] [mDependency directory: using directory-1.3.8.5
[2m[haskell-language-server] [mDependency ghcide: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hashable: using hashable-1.5.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lsp-types: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency stan >=0.2.1.0: using stan-0.2.1.0
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency trial: using trial-0.0.0.0
[2m[haskell-language-server] [mDependency unordered-containers: using unordered-containers-0.2.20.1
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lsp-types: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency filepath: using filepath-1.4.301.0
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency text-rope: using text-rope-0.3
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency fuzzy: using fuzzy-0.1.1.0
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lens-aeson: using lens-aeson-1.2.3
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency foldl: using foldl-1.4.18
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:hls-refactor-plugin: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency syb: using syb-0.7.2.4
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency unliftio-core: using unliftio-core-0.2.1.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency ghc-boot-th: using ghc-boot-th-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-graph: using hls-graph-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp >=2.7 && <2.8: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency regex-tdfa: using regex-tdfa-1.3.2.5
[2m[haskell-language-server] [mDependency syb: using syb-0.7.2.4
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency dlist: using dlist-1.0
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency text-rope: using text-rope-0.3
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency deepseq: using deepseq-1.4.8.1
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hashable: using hashable-1.5.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency semigroupoids: using semigroupoids-6.0.1
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency vector: using vector-0.13.2.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp-types: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency regex-tdfa: using regex-tdfa-1.3.2.5
[2m[haskell-language-server] [mDependency syb: using syb-0.7.2.4
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghc-exactprint: using ghc-exactprint-1.7.1.0
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server:hls-refactor-plugin: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp >=2.7: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency deepseq: using deepseq-1.4.8.1
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hashable: using hashable-1.5.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lsp >=2.7: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-graph: using hls-graph-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency syb: using syb-0.7.2.4
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency deepseq: using deepseq-1.4.8.1
[2m[haskell-language-server] [mDependency ghcide: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-graph: using hls-graph-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency syb: using syb-0.7.2.4
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency floskell >=0.11.0 && <0.12: using floskell-0.11.1
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lsp-types >=2.3 && <2.4: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency filepath: using filepath-1.4.301.0
[2m[haskell-language-server] [mDependency fourmolu >=0.14 && <0.20: using fourmolu-0.15.0.0
[2m[haskell-language-server] [mDependency ghc-boot-th: using ghc-boot-th-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency process-extras >=0.7.1: using process-extras-0.7.4
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency yaml: using yaml-0.11.11.2
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency filepath: using filepath-1.4.301.0
[2m[haskell-language-server] [mDependency ghc-boot-th: using ghc-boot-th-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency ormolu >=0.5.3 && <0.9: using ormolu-0.7.4.0
[2m[haskell-language-server] [mDependency process-extras >=0.7.1: using process-extras-0.7.4
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency directory: using directory-1.3.8.5
[2m[haskell-language-server] [mDependency filepath: using filepath-1.4.301.0
[2m[haskell-language-server] [mDependency ghc-boot-th: using ghc-boot-th-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lsp-types: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency stylish-haskell >=0.12 && <0.16: using stylish-haskell-0.14.6.0
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency bytestring: using bytestring-0.11.5.4
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency data-default: using data-default-0.8.0.1
[2m[haskell-language-server] [mDependency deepseq: using deepseq-1.4.8.1
[2m[haskell-language-server] [mDependency dlist: using dlist-1.0
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghc-boot: using ghc-boot-9.6.7
[2m[haskell-language-server] [mDependency ghc-exactprint <1 || >=1.4: using ghc-exactprint-1.7.1.0
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-graph: using hls-graph-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency mtl: using mtl-2.3.1
[2m[haskell-language-server] [mDependency parser-combinators: using parser-combinators-1.3.0
[2m[haskell-language-server] [mDependency regex-applicative: using regex-applicative-0.3.4
[2m[haskell-language-server] [mDependency regex-tdfa: using regex-tdfa-1.3.2.5
[2m[haskell-language-server] [mDependency syb: using syb-0.7.2.4
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency text-rope: using text-rope-0.3
[2m[haskell-language-server] [mDependency time: using time-1.12.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency unordered-containers: using unordered-containers-0.2.20.1
[2m[haskell-language-server] [mDependency array: using array-0.5.8.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency bytestring: using bytestring-0.11.5.4
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency data-default: using data-default-0.8.0.1
[2m[haskell-language-server] [mDependency deepseq: using deepseq-1.4.8.1
[2m[haskell-language-server] [mDependency dlist: using dlist-1.0
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-graph ==2.12.0.0: using hls-graph-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp >=2.6: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency mtl >=2.2: using mtl-2.3.1
[2m[haskell-language-server] [mDependency stm: using stm-2.5.1.0
[2m[haskell-language-server] [mDependency stm-containers: using stm-containers-1.2.1.1
[2m[haskell-language-server] [mDependency syb: using syb-0.7.2.4
[2m[haskell-language-server] [mDependency template-haskell: using template-haskell-2.20.0.0
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency text-rope: using text-rope-0.3
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency array: using array-0.5.8.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-graph ==2.12.0.0: using hls-graph-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp >=2.7: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency mtl >=2.2: using mtl-2.3.1
[2m[haskell-language-server] [mDependency regex-tdfa >=1.3.1: using regex-tdfa-1.3.2.5
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency text-rope: using text-rope-0.3
[2m[haskell-language-server] [mDependency unordered-containers: using unordered-containers-0.2.20.1
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency async: using async-2.2.5
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency binary: using binary-0.8.9.1
[2m[haskell-language-server] [mDependency bytestring: using bytestring-0.11.5.4
[2m[haskell-language-server] [mDependency deepseq: using deepseq-1.4.8.1
[2m[haskell-language-server] [mDependency directory: using directory-1.3.8.5
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency filepath: using filepath-1.4.301.0
[2m[haskell-language-server] [mDependency ghcide: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hashable: using hashable-1.5.0.0
[2m[haskell-language-server] [mDependency hls-test-utils: using hls-test-utils-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp-test: using lsp-test-0.17.1.1
[2m[haskell-language-server] [mDependency lsp-types: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency optparse-applicative: using optparse-applicative-0.18.1.0
[2m[haskell-language-server] [mDependency parser-combinators: using parser-combinators-1.3.0
[2m[haskell-language-server] [mDependency process: using process-1.6.19.0
[2m[haskell-language-server] [mDependency row-types: using row-types-1.0.1.2
[2m[haskell-language-server] [mDependency safe-exceptions: using safe-exceptions-0.1.7.4
[2m[haskell-language-server] [mDependency shake: using shake-0.19.8
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency haskell-language-server: using haskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency prettyprinter >=1.7: using prettyprinter-1.7.1
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency data-default: using data-default-0.8.0.1
[2m[haskell-language-server] [mDependency directory: using directory-1.3.8.5
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency filepath: using filepath-1.4.301.0
[2m[haskell-language-server] [mDependency ghcide: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency haskell-language-server: using haskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency hie-bios: using hie-bios-0.17.0
[2m[haskell-language-server] [mDependency hls-plugin-api: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency lsp-types: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency unix: using unix-2.8.6.0
[2m[haskell-language-server] [mDependency unliftio-core: using unliftio-core-0.2.1.0
[2m[haskell-language-server] [mDependency base >=4 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency bytestring: using bytestring-0.11.5.4
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency data-default: using data-default-0.8.0.1
[2m[haskell-language-server] [mDependency extra: using extra-1.8.1
[2m[haskell-language-server] [mDependency filepath: using filepath-1.4.301.0
[2m[haskell-language-server] [mDependency haskell-language-server:ghcide-bench-lib: using
[2m[haskell-language-server] [mhaskell-language-server-2.12.0.0
[2m[haskell-language-server] [mDependency hls-graph: using hls-graph-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency hls-test-utils: using hls-test-utils-2.12.0.0
[2m[haskell-language-server] [mDependency lens: using lens-5.3.5
[2m[haskell-language-server] [mDependency lsp-test: using lsp-test-0.17.1.1
[2m[haskell-language-server] [mDependency lsp-types: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency optparse-applicative: using optparse-applicative-0.18.1.0
[2m[haskell-language-server] [mDependency process: using process-1.6.19.0
[2m[haskell-language-server] [mDependency safe-exceptions: using safe-exceptions-0.1.7.4
[2m[haskell-language-server] [mDependency shake: using shake-0.19.8
[2m[haskell-language-server] [mDependency tasty-hunit >=0.10: using tasty-hunit-0.10.2
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency aeson: using aeson-2.2.3.0
[2m[haskell-language-server] [mDependency base >=4.12 && <5: using base-4.18.3.0
[2m[haskell-language-server] [mDependency containers: using containers-0.6.7
[2m[haskell-language-server] [mDependency ghc: using ghc-9.6.7
[2m[haskell-language-server] [mDependency ghcide: using ghcide-2.12.0.0
[2m[haskell-language-server] [mDependency hls-plugin-api: using hls-plugin-api-2.12.0.0
[2m[haskell-language-server] [mDependency lsp: using lsp-2.7.0.1
[2m[haskell-language-server] [mDependency lsp-types: using lsp-types-2.3.0.1
[2m[haskell-language-server] [mDependency markdown-unlit: using markdown-unlit-0.6.0
[2m[haskell-language-server] [mDependency text: using text-2.0.2
[2m[haskell-language-server] [mDependency transformers: using transformers-0.6.1.0
[2m[haskell-language-server] [mDependency unordered-containers: using unordered-containers-0.2.20.1
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 5 of 29] Compiling Algebra.Graph    ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
[2m[haskell-language-server] [mSource component graph:
[2m[haskell-language-server] [m    component exe:plugin-tutorial
[2m[haskell-language-server] [m    component exe:ghcide-test-preprocessor
[2m[haskell-language-server] [m    component lib:hls-stylish-haskell-plugin
[2m[haskell-language-server] [m    component lib:hls-stan-plugin
[2m[haskell-language-server] [m    component lib:hls-signature-help-plugin
[2m[haskell-language-server] [m    component lib:hls-semantic-tokens-plugin
[2m[haskell-language-server] [m    component lib:hls-refactor-plugin
[2m[haskell-language-server] [m    component lib:hls-rename-plugin dependency lib:hls-refactor-plugin
[2m[haskell-language-server] [m    component lib:hls-retrie-plugin dependency lib:hls-refactor-plugin
[2m[haskell-language-server] [m    component lib:hls-splice-plugin dependency lib:hls-refactor-plugin
[2m[haskell-language-server] [m    component lib:hls-qualify-imported-names-plugin
[2m[haskell-language-server] [m    component lib:hls-pragmas-plugin
[2m[haskell-language-server] [m    component lib:hls-overloaded-record-dot-plugin
[2m[haskell-language-server] [m    component lib:hls-ormolu-plugin
[2m[haskell-language-server] [m    component lib:hls-notes-plugin
[2m[haskell-language-server] [m    component lib:hls-module-name-plugin
[2m[haskell-language-server] [m    component lib:hls-hlint-plugin
[2m[haskell-language-server] [m    component lib:hls-gadt-plugin dependency lib:hls-refactor-plugin
[2m[haskell-language-server] [m    component lib:hls-fourmolu-plugin
[2m[haskell-language-server] [m    component lib:hls-floskell-plugin
[2m[haskell-language-server] [m    component lib:hls-explicit-record-fields-plugin
[2m[haskell-language-server] [m    component lib:hls-explicit-imports-plugin
[2m[haskell-language-server] [m    component lib:hls-explicit-fixity-plugin
[2m[haskell-language-server] [m    component lib:hls-eval-plugin
[2m[haskell-language-server] [m    component lib:hls-code-range-plugin
[2m[haskell-language-server] [m    component lib:hls-class-plugin
[2m[haskell-language-server] [m    component lib:hls-change-type-signature-plugin
[2m[haskell-language-server] [m    component lib:hls-call-hierarchy-plugin
[2m[haskell-language-server] [m    component lib:hls-cabal-plugin
[2m[haskell-language-server] [m    component lib:hls-cabal-gild-plugin
[2m[haskell-language-server] [m    component lib:hls-cabal-fmt-plugin
[2m[haskell-language-server] [m    component lib:hls-alternate-number-format-plugin
[2m[haskell-language-server] [m    component lib:ghcide-bench-lib
[2m[haskell-language-server] [m    component exe:ghcide-bench dependency lib:ghcide-bench-lib
[2m[haskell-language-server] [m    component lib
[2m[haskell-language-server] [m        dependency lib:hls-alternate-number-format-plugin
[2m[haskell-language-server] [m        dependency lib:hls-cabal-fmt-plugin
[2m[haskell-language-server] [m        dependency lib:hls-cabal-gild-plugin
[2m[haskell-language-server] [m        dependency lib:hls-cabal-plugin
[2m[haskell-language-server] [m        dependency lib:hls-call-hierarchy-plugin
[2m[haskell-language-server] [m        dependency lib:hls-change-type-signature-plugin
[2m[haskell-language-server] [m        dependency lib:hls-class-plugin
[2m[haskell-language-server] [m        dependency lib:hls-code-range-plugin
[2m[haskell-language-server] [m        dependency lib:hls-eval-plugin
[2m[haskell-language-server] [m        dependency lib:hls-explicit-fixity-plugin
[2m[haskell-language-server] [m        dependency lib:hls-explicit-imports-plugin
[2m[haskell-language-server] [m        dependency lib:hls-explicit-record-fields-plugin
[2m[haskell-language-server] [m        dependency lib:hls-floskell-plugin
[2m[haskell-language-server] [m        dependency lib:hls-fourmolu-plugin
[2m[haskell-language-server] [m        dependency lib:hls-gadt-plugin
[2m[haskell-language-server] [m        dependency lib:hls-hlint-plugin
[2m[haskell-language-server] [m        dependency lib:hls-module-name-plugin
[2m[haskell-language-server] [m        dependency lib:hls-notes-plugin
[2m[haskell-language-server] [m        dependency lib:hls-ormolu-plugin
[2m[haskell-language-server] [m        dependency lib:hls-overloaded-record-dot-plugin
[2m[haskell-language-server] [m        dependency lib:hls-pragmas-plugin
[2m[haskell-language-server] [m        dependency lib:hls-qualify-imported-names-plugin
[2m[haskell-language-server] [m        dependency lib:hls-refactor-plugin
[2m[haskell-language-server] [m        dependency lib:hls-rename-plugin
[2m[haskell-language-server] [m        dependency lib:hls-retrie-plugin
[2m[haskell-language-server] [m        dependency lib:hls-semantic-tokens-plugin
[2m[haskell-language-server] [m        dependency lib:hls-signature-help-plugin
[2m[haskell-language-server] [m        dependency lib:hls-splice-plugin
[2m[haskell-language-server] [m        dependency lib:hls-stan-plugin
[2m[haskell-language-server] [m        dependency lib:hls-stylish-haskell-plugin
[2m[haskell-language-server] [m    component exe:haskell-language-server dependency lib
[2m[haskell-language-server] [m    component exe:haskell-language-server-wrapper dependency lib
[2m[haskell-language-server] [mConfigured component graph:
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-4pY5yY1pY4d8Hs1Q2a6ukB-plugin-tutorial
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include markdown-unlit-0.6.0-5809pVajWVb2gBk7RWYi4C
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-JHhSHT2pml8BalYIyFTgc7-ghcide-test-preprocessor
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include stylish-haskell-0.14.6.0-LLvgSofQOCY3hHahYzFIC6
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include stan-0.2.1.0-B6pDZR8PjMBItDLFTHk8I9
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include trial-0.0.0.0-4bVaCFWxanU7Vl3nRX6Yi0
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
[2m[haskell-language-server] [m        include array-0.5.8.0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include stm-2.5.1.0
[2m[haskell-language-server] [m        include stm-containers-1.2.1.1-JDBpT36aDZ4CUdJ1Aus6oe
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include template-haskell-2.20.0.0
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghc-boot-9.6.7
[2m[haskell-language-server] [m        include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
[2m[haskell-language-server] [m        include regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM
[2m[haskell-language-server] [m        include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include time-1.12.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        include hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mod-0.2.1.0-AEqKlJqNyYNGsAQxMMfOED
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include retrie-1.2.3-4syE2wloz6UAMXGW9FTmsG
[2m[haskell-language-server] [m        include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
[2m[haskell-language-server] [m        include stm-2.5.1.0
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include foldl-1.4.18-Bjs3RPGa3QC5Zp1aPynHUe
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include fuzzy-0.1.1.0-LlERYC6Fg0O5zdG1C09qam
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include ormolu-0.7.4.0-LIXgtWG5aD28NbkYgiUJ8V
[2m[haskell-language-server] [m        include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
[2m[haskell-language-server] [m        include array-0.5.8.0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include apply-refact-0.15.0.0-4MjkBELToDe5NAkQSrxtCU
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghc-lib-parser-9.8.5.20250214-2sNjHbGivPe3WF6GmRwnfJ
[2m[haskell-language-server] [m        include ghc-lib-parser-ex-9.8.0.2-6MMs82JSbM38IX9LmoVjK4
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include hlint-3.8-41jUuJncsTy84zuKEBa9b
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include refact-0.3.0.2-8O04sJZgp6Q4KcGxjYVPmG
[2m[haskell-language-server] [m        include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        include stm-2.5.1.0
[2m[haskell-language-server] [m        include temporary-1.3-HdHuOgtZUl4D7UgDABDcym
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include fourmolu-0.15.0.0-EEltZEsw4M5ydl0dR88pq
[2m[haskell-language-server] [m        include ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include floskell-0.11.1-F2B6NOVmKxJBuRX1YeIXI3
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
[2m[haskell-language-server] [m        include Diff-1.0.2-dzGetap2ECL5JRsgOkhmm
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include megaparsec-9.7.0-9FWtFuoAKCoJPEfZ8OP0ob
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unliftio-0.2.25.1-5MZwHIZimta75d0AbqTI9h
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include semigroupoids-6.0.1-54VzK0HQ3Xs4SWz0qFeA7J
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include sqlite-simple-0.4.19.0-2fdDxNmUdI02n2D93fGkOA
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
[2m[haskell-language-server] [m        include Cabal-3.10.3.0-97VZ3uVCyHhIgysI2tHjj1
[2m[haskell-language-server] [m        include Cabal-syntax-3.10.3.0-IhRvyLmXl1UIaCkYCiWa3f
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include cabal-add-0.2-8fogMBtEehK7vh7o2bjwgw
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include pretty-1.1.3.6
[2m[haskell-language-server] [m        include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include async-2.2.5-FhKLzi3ZfBSDzHnPPPs0JV
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include binary-0.8.9.1
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
[2m[haskell-language-server] [m        include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
[2m[haskell-language-server] [m        include process-1.6.19.0
[2m[haskell-language-server] [m        include row-types-1.0.1.2-GohFLjwnT9fE3Oyg9BLD2E
[2m[haskell-language-server] [m        include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
[2m[haskell-language-server] [m        include shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-1eqeWxapPHfKHhYNK0JT0S-ghcide-bench
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
[2m[haskell-language-server] [m        include process-1.6.19.0
[2m[haskell-language-server] [m        include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
[2m[haskell-language-server] [m        include shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
[2m[haskell-language-server] [m        include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
[2m[haskell-language-server] [m        include aeson-pretty-0.8.10-BgtEeo7358D7lyXwmTUOLk
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include githash-0.1.7.0-5BWjRCNZB9NEtAb5878P8j
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
[2m[haskell-language-server] [m        include hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
[2m[haskell-language-server] [m        include optparse-simple-0.1.1.4-9HAULKOjTA6J0lHNdRD2x7
[2m[haskell-language-server] [m        include prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
[2m[haskell-language-server] [m        include process-1.6.19.0
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-ITpYpQVRS0qLya2XUJnu55-haskell-language-server
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m    component haskell-language-server-2.12.0.0-6OQdnWIBVJU7LMih85tfjb-haskell-language-server-wrapper
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
[2m[haskell-language-server] [m        include hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unix-2.8.6.0
[2m[haskell-language-server] [m        include unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
[2m[haskell-language-server] [mLinked component graph:
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-4pY5yY1pY4d8Hs1Q2a6ukB-plugin-tutorial
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include markdown-unlit-0.6.0-5809pVajWVb2gBk7RWYi4C
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-JHhSHT2pml8BalYIyFTgc7-ghcide-test-preprocessor
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include stylish-haskell-0.14.6.0-LLvgSofQOCY3hHahYzFIC6
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        Ide.Plugin.StylishHaskell=haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin:Ide.Plugin.StylishHaskell
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include stan-0.2.1.0-B6pDZR8PjMBItDLFTHk8I9
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include trial-0.0.0.0-4bVaCFWxanU7Vl3nRX6Yi0
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m        Ide.Plugin.Stan=haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin:Ide.Plugin.Stan
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        Ide.Plugin.SignatureHelp=haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin:Ide.Plugin.SignatureHelp
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
[2m[haskell-language-server] [m        include array-0.5.8.0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include stm-2.5.1.0
[2m[haskell-language-server] [m        include stm-containers-1.2.1.1-JDBpT36aDZ4CUdJ1Aus6oe
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include template-haskell-2.20.0.0
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        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
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghc-boot-9.6.7
[2m[haskell-language-server] [m        include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
[2m[haskell-language-server] [m        include regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM
[2m[haskell-language-server] [m        include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include time-1.12.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m        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
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        include hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mod-0.2.1.0-AEqKlJqNyYNGsAQxMMfOED
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m        Ide.Plugin.Rename=haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin:Ide.Plugin.Rename
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include retrie-1.2.3-4syE2wloz6UAMXGW9FTmsG
[2m[haskell-language-server] [m        include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
[2m[haskell-language-server] [m        include stm-2.5.1.0
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m        Ide.Plugin.Retrie=haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin:Ide.Plugin.Retrie
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include foldl-1.4.18-Bjs3RPGa3QC5Zp1aPynHUe
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
[2m[haskell-language-server] [m        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
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        Ide.Plugin.QualifyImportedNames=haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin:Ide.Plugin.QualifyImportedNames
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include fuzzy-0.1.1.0-LlERYC6Fg0O5zdG1C09qam
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        Ide.Plugin.Pragmas=haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin:Ide.Plugin.Pragmas
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        Ide.Plugin.OverloadedRecordDot=haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin:Ide.Plugin.OverloadedRecordDot
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include ormolu-0.7.4.0-LIXgtWG5aD28NbkYgiUJ8V
[2m[haskell-language-server] [m        include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        Ide.Plugin.Ormolu=haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin:Ide.Plugin.Ormolu
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
[2m[haskell-language-server] [m        include array-0.5.8.0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m        Ide.Plugin.Notes=haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin:Ide.Plugin.Notes
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        Ide.Plugin.ModuleName=haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin:Ide.Plugin.ModuleName
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include apply-refact-0.15.0.0-4MjkBELToDe5NAkQSrxtCU
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghc-lib-parser-9.8.5.20250214-2sNjHbGivPe3WF6GmRwnfJ
[2m[haskell-language-server] [m        include ghc-lib-parser-ex-9.8.0.2-6MMs82JSbM38IX9LmoVjK4
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include hlint-3.8-41jUuJncsTy84zuKEBa9b
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include refact-0.3.0.2-8O04sJZgp6Q4KcGxjYVPmG
[2m[haskell-language-server] [m        include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        include stm-2.5.1.0
[2m[haskell-language-server] [m        include temporary-1.3-HdHuOgtZUl4D7UgDABDcym
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m        Ide.Plugin.Hlint=haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin:Ide.Plugin.Hlint
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        Ide.Plugin.GADT=haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin:Ide.Plugin.GADT
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include fourmolu-0.15.0.0-EEltZEsw4M5ydl0dR88pq
[2m[haskell-language-server] [m        include ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy
[2m[haskell-language-server] [m        Ide.Plugin.Fourmolu=haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin:Ide.Plugin.Fourmolu
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include floskell-0.11.1-F2B6NOVmKxJBuRX1YeIXI3
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        Ide.Plugin.Floskell=haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin:Ide.Plugin.Floskell
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        Ide.Plugin.ExplicitFields=haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin:Ide.Plugin.ExplicitFields
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        Ide.Plugin.ExplicitImports=haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin:Ide.Plugin.ExplicitImports
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        Ide.Plugin.ExplicitFixity=haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin:Ide.Plugin.ExplicitFixity
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
[2m[haskell-language-server] [m        include Diff-1.0.2-dzGetap2ECL5JRsgOkhmm
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include megaparsec-9.7.0-9FWtFuoAKCoJPEfZ8OP0ob
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unliftio-0.2.25.1-5MZwHIZimta75d0AbqTI9h
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m        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
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include semigroupoids-6.0.1-54VzK0HQ3Xs4SWz0qFeA7J
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
[2m[haskell-language-server] [m        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
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        Ide.Plugin.Class=haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin:Ide.Plugin.Class
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        Ide.Plugin.ChangeTypeSignature=haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin:Ide.Plugin.ChangeTypeSignature
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include sqlite-simple-0.4.19.0-2fdDxNmUdI02n2D93fGkOA
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        Ide.Plugin.CallHierarchy=haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin:Ide.Plugin.CallHierarchy
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
[2m[haskell-language-server] [m        include Cabal-3.10.3.0-97VZ3uVCyHhIgysI2tHjj1
[2m[haskell-language-server] [m        include Cabal-syntax-3.10.3.0-IhRvyLmXl1UIaCkYCiWa3f
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include cabal-add-0.2-8fogMBtEehK7vh7o2bjwgw
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include pretty-1.1.3.6
[2m[haskell-language-server] [m        include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m        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
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        Ide.Plugin.CabalGild=haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin:Ide.Plugin.CabalGild
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        Ide.Plugin.CabalFmt=haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin:Ide.Plugin.CabalFmt
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include mtl-2.3.1
[2m[haskell-language-server] [m        include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        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
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include async-2.2.5-FhKLzi3ZfBSDzHnPPPs0JV
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include binary-0.8.9.1
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include deepseq-1.4.8.1
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        include hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
[2m[haskell-language-server] [m        include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
[2m[haskell-language-server] [m        include process-1.6.19.0
[2m[haskell-language-server] [m        include row-types-1.0.1.2-GohFLjwnT9fE3Oyg9BLD2E
[2m[haskell-language-server] [m        include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
[2m[haskell-language-server] [m        include shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        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
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-1eqeWxapPHfKHhYNK0JT0S-ghcide-bench
[2m[haskell-language-server] [m        include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include bytestring-0.11.5.4
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
[2m[haskell-language-server] [m        include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
[2m[haskell-language-server] [m        include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        include lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
[2m[haskell-language-server] [m        include process-1.6.19.0
[2m[haskell-language-server] [m        include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
[2m[haskell-language-server] [m        include shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
[2m[haskell-language-server] [m        include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
[2m[haskell-language-server] [m        include aeson-pretty-0.8.10-BgtEeo7358D7lyXwmTUOLk
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghc-9.6.7
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include githash-0.1.7.0-5BWjRCNZB9NEtAb5878P8j
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
[2m[haskell-language-server] [m        include hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
[2m[haskell-language-server] [m        include optparse-simple-0.1.1.4-9HAULKOjTA6J0lHNdRD2x7
[2m[haskell-language-server] [m        include prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
[2m[haskell-language-server] [m        include process-1.6.19.0
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        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
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-ITpYpQVRS0qLya2XUJnu55-haskell-language-server
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m    unit haskell-language-server-2.12.0.0-6OQdnWIBVJU7LMih85tfjb-haskell-language-server-wrapper
[2m[haskell-language-server] [m        include base-4.18.3.0
[2m[haskell-language-server] [m        include containers-0.6.7
[2m[haskell-language-server] [m        include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        include directory-1.3.8.5
[2m[haskell-language-server] [m        include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        include filepath-1.4.301.0
[2m[haskell-language-server] [m        include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        include haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
[2m[haskell-language-server] [m        include hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
[2m[haskell-language-server] [m        include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        include text-2.0.2
[2m[haskell-language-server] [m        include transformers-0.6.1.0
[2m[haskell-language-server] [m        include unix-2.8.6.0
[2m[haskell-language-server] [m        include unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
[2m[haskell-language-server] [mReady component graph:
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends deepseq-1.4.8.1
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends deepseq-1.4.8.1
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends sqlite-simple-0.4.19.0-2fdDxNmUdI02n2D93fGkOA
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-JHhSHT2pml8BalYIyFTgc7-ghcide-test-preprocessor
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends deepseq-1.4.8.1
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends semigroupoids-6.0.1-54VzK0HQ3Xs4SWz0qFeA7J
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m        depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
[2m[haskell-language-server] [m        depends array-0.5.8.0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends async-2.2.5-FhKLzi3ZfBSDzHnPPPs0JV
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends binary-0.8.9.1
[2m[haskell-language-server] [m        depends bytestring-0.11.5.4
[2m[haskell-language-server] [m        depends deepseq-1.4.8.1
[2m[haskell-language-server] [m        depends directory-1.3.8.5
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends filepath-1.4.301.0
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        depends hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
[2m[haskell-language-server] [m        depends parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
[2m[haskell-language-server] [m        depends process-1.6.19.0
[2m[haskell-language-server] [m        depends row-types-1.0.1.2-GohFLjwnT9fE3Oyg9BLD2E
[2m[haskell-language-server] [m        depends safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
[2m[haskell-language-server] [m        depends shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends floskell-0.11.1-F2B6NOVmKxJBuRX1YeIXI3
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends directory-1.3.8.5
[2m[haskell-language-server] [m        depends filepath-1.4.301.0
[2m[haskell-language-server] [m        depends ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends stylish-haskell-0.14.6.0-LLvgSofQOCY3hHahYzFIC6
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends fuzzy-0.1.1.0-LlERYC6Fg0O5zdG1C09qam
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
[2m[haskell-language-server] [m        depends array-0.5.8.0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends bytestring-0.11.5.4
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        depends deepseq-1.4.8.1
[2m[haskell-language-server] [m        depends dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends stm-2.5.1.0
[2m[haskell-language-server] [m        depends stm-containers-1.2.1.1-JDBpT36aDZ4CUdJ1Aus6oe
[2m[haskell-language-server] [m        depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        depends template-haskell-2.20.0.0
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends filepath-1.4.301.0
[2m[haskell-language-server] [m        depends ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends ormolu-0.7.4.0-LIXgtWG5aD28NbkYgiUJ8V
[2m[haskell-language-server] [m        depends process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends directory-1.3.8.5
[2m[haskell-language-server] [m        depends filepath-1.4.301.0
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
[2m[haskell-language-server] [m        depends Cabal-3.10.3.0-97VZ3uVCyHhIgysI2tHjj1
[2m[haskell-language-server] [m        depends Cabal-syntax-3.10.3.0-IhRvyLmXl1UIaCkYCiWa3f
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends bytestring-0.11.5.4
[2m[haskell-language-server] [m        depends cabal-add-0.2-8fogMBtEehK7vh7o2bjwgw
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends deepseq-1.4.8.1
[2m[haskell-language-server] [m        depends directory-1.3.8.5
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends filepath-1.4.301.0
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends pretty-1.1.3.6
[2m[haskell-language-server] [m        depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m        depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends apply-refact-0.15.0.0-4MjkBELToDe5NAkQSrxtCU
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends bytestring-0.11.5.4
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends deepseq-1.4.8.1
[2m[haskell-language-server] [m        depends filepath-1.4.301.0
[2m[haskell-language-server] [m        depends ghc-lib-parser-9.8.5.20250214-2sNjHbGivPe3WF6GmRwnfJ
[2m[haskell-language-server] [m        depends ghc-lib-parser-ex-9.8.0.2-6MMs82JSbM38IX9LmoVjK4
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        depends hlint-3.8-41jUuJncsTy84zuKEBa9b
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends refact-0.3.0.2-8O04sJZgp6Q4KcGxjYVPmG
[2m[haskell-language-server] [m        depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        depends stm-2.5.1.0
[2m[haskell-language-server] [m        depends temporary-1.3-HdHuOgtZUl4D7UgDABDcym
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m        depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends bytestring-0.11.5.4
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        depends deepseq-1.4.8.1
[2m[haskell-language-server] [m        depends dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghc-boot-9.6.7
[2m[haskell-language-server] [m        depends ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
[2m[haskell-language-server] [m        depends regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM
[2m[haskell-language-server] [m        depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        depends time-1.12.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m        depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        depends hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends mod-0.2.1.0-AEqKlJqNyYNGsAQxMMfOED
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m        depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends foldl-1.4.18-Bjs3RPGa3QC5Zp1aPynHUe
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m        depends unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends bytestring-0.11.5.4
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends retrie-1.2.3-4syE2wloz6UAMXGW9FTmsG
[2m[haskell-language-server] [m        depends safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
[2m[haskell-language-server] [m        depends stm-2.5.1.0
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m        depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
[2m[haskell-language-server] [m        depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends directory-1.3.8.5
[2m[haskell-language-server] [m        depends filepath-1.4.301.0
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
[2m[haskell-language-server] [m        depends Diff-1.0.2-dzGetap2ECL5JRsgOkhmm
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends bytestring-0.11.5.4
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends deepseq-1.4.8.1
[2m[haskell-language-server] [m        depends dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends filepath-1.4.301.0
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends megaparsec-9.7.0-9FWtFuoAKCoJPEfZ8OP0ob
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m        depends unliftio-0.2.25.1-5MZwHIZimta75d0AbqTI9h
[2m[haskell-language-server] [m        depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-4pY5yY1pY4d8Hs1Q2a6ukB-plugin-tutorial
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends markdown-unlit-0.6.0-5809pVajWVb2gBk7RWYi4C
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m        depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends deepseq-1.4.8.1
[2m[haskell-language-server] [m        depends directory-1.3.8.5
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends stan-0.2.1.0-B6pDZR8PjMBItDLFTHk8I9
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends trial-0.0.0.0-4bVaCFWxanU7Vl3nRX6Yi0
[2m[haskell-language-server] [m        depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends deepseq-1.4.8.1
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends filepath-1.4.301.0
[2m[haskell-language-server] [m        depends fourmolu-0.15.0.0-EEltZEsw4M5ydl0dR88pq
[2m[haskell-language-server] [m        depends ghc-boot-th-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends mtl-2.3.1
[2m[haskell-language-server] [m        depends process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m        depends yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends deepseq-1.4.8.1
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-1eqeWxapPHfKHhYNK0JT0S-ghcide-bench
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends bytestring-0.11.5.4
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends filepath-1.4.301.0
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
[2m[haskell-language-server] [m        depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
[2m[haskell-language-server] [m        depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
[2m[haskell-language-server] [m        depends lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
[2m[haskell-language-server] [m        depends process-1.6.19.0
[2m[haskell-language-server] [m        depends safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
[2m[haskell-language-server] [m        depends shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
[2m[haskell-language-server] [m        depends tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
[2m[haskell-language-server] [m        depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends filepath-1.4.301.0
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
[2m[haskell-language-server] [m        depends aeson-pretty-0.8.10-BgtEeo7358D7lyXwmTUOLk
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        depends directory-1.3.8.5
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends filepath-1.4.301.0
[2m[haskell-language-server] [m        depends ghc-9.6.7
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends githash-0.1.7.0-5BWjRCNZB9NEtAb5878P8j
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
[2m[haskell-language-server] [m        depends hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
[2m[haskell-language-server] [m        depends optparse-simple-0.1.1.4-9HAULKOjTA6J0lHNdRD2x7
[2m[haskell-language-server] [m        depends prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
[2m[haskell-language-server] [m        depends process-1.6.19.0
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-6OQdnWIBVJU7LMih85tfjb-haskell-language-server-wrapper
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends containers-0.6.7
[2m[haskell-language-server] [m        depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
[2m[haskell-language-server] [m        depends directory-1.3.8.5
[2m[haskell-language-server] [m        depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
[2m[haskell-language-server] [m        depends filepath-1.4.301.0
[2m[haskell-language-server] [m        depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
[2m[haskell-language-server] [m        depends hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [m        depends transformers-0.6.1.0
[2m[haskell-language-server] [m        depends unix-2.8.6.0
[2m[haskell-language-server] [m        depends unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
[2m[haskell-language-server] [m    definite haskell-language-server-2.12.0.0-ITpYpQVRS0qLya2XUJnu55-haskell-language-server
[2m[haskell-language-server] [m        depends base-4.18.3.0
[2m[haskell-language-server] [m        depends haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
[2m[haskell-language-server] [m        depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
[2m[haskell-language-server] [m        depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
[2m[haskell-language-server] [m        depends prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
[2m[haskell-language-server] [m        depends text-2.0.2
[2m[haskell-language-server] [mUsing Cabal-3.10.3.0 compiled by ghc-9.6
[2m[haskell-language-server] [mUsing compiler: ghc-9.6.7
[2m[haskell-language-server] [mUsing install prefix:
[2m[haskell-language-server] [m/nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0
[2m[haskell-language-server] [mExecutables installed in:
[2m[haskell-language-server] [m/nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
[2m[haskell-language-server] [mLibraries installed in:
[2m[haskell-language-server] [m/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
[2m[haskell-language-server] [mDynamic Libraries installed in:
[2m[haskell-language-server] [m/nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
[2m[haskell-language-server] [mPrivate executables installed in:
[2m[haskell-language-server] [m/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
[2m[haskell-language-server] [mData files installed in:
[2m[haskell-language-server] [m/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
[2m[haskell-language-server] [mDocumentation installed in:
[2m[haskell-language-server] [m/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
[2m[haskell-language-server] [mConfiguration files installed in:
[2m[haskell-language-server] [m/nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/etc
[2m[haskell-language-server] [mNo alex found
[2m[haskell-language-server] [mUsing ar found on system at:
[2m[haskell-language-server] [m/nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
[2m[haskell-language-server] [mNo c2hs found
[2m[haskell-language-server] [mUsing cpphs version 1.20.9 found on system at:
[2m[haskell-language-server] [m/nix/store/wh669ywmw50iwg9i0cvya2v29k7kdnbp-cpphs-1.20.10/bin/cpphs
[2m[haskell-language-server] [mNo doctest found
[2m[haskell-language-server] [mUsing gcc version 14.3.0 given by user at:
[2m[haskell-language-server] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[haskell-language-server] [mUsing ghc version 9.6.7 found on system at:
[2m[haskell-language-server] [m/nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/ghc
[2m[haskell-language-server] [mUsing ghc-pkg version 9.6.7 found on system at:
[2m[haskell-language-server] [m/nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/ghc-pkg-9.6.7
[2m[haskell-language-server] [mNo ghcjs found
[2m[haskell-language-server] [mNo ghcjs-pkg found
[2m[haskell-language-server] [mNo greencard found
[2m[haskell-language-server] [mUsing haddock version 2.29.2 found on system at:
[2m[haskell-language-server] [m/nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/haddock-ghc-9.6.7
[2m[haskell-language-server] [mNo happy found
[2m[haskell-language-server] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[haskell-language-server] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[haskell-language-server] [mNo hmake found
[2m[haskell-language-server] [mUsing hpc version 0.68 found on system at:
[2m[haskell-language-server] [m/nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/hpc-ghc-9.6.7
[2m[haskell-language-server] [mUsing hsc2hs version 0.68.9 found on system at:
[2m[haskell-language-server] [m/nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
[2m[haskell-language-server] [mUsing hscolour version 1.25 found on system at:
[2m[haskell-language-server] [m/nix/store/na3h6k2pdvfb6kjn5dhiqi3z5l8cfdqx-hscolour-1.25/bin/HsColour
[2m[haskell-language-server] [mNo jhc found
[2m[haskell-language-server] [mUsing ld found on system at:
[2m[haskell-language-server] [m/nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
[2m[haskell-language-server] [mNo pkg-config found
[2m[haskell-language-server] [mUsing runghc version 9.6.7 found on system at:
[2m[haskell-language-server] [m/nix/store/i84a5gvqc16hhlcx2wjzvvfdg2ylshpr-ghc-9.6.7/bin/runghc-9.6.7
[2m[haskell-language-server] [mUsing strip version 2.44 found on system at:
[2m[haskell-language-server] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[haskell-language-server] [mUsing tar found on system at:
[2m[haskell-language-server] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
[2m[haskell-language-server] [mNo uhc found
[2m[haskell-language-server] [m[1;36mPhase: buildPhase[m
[2m[haskell-language-server] [mPreprocessing library 'hls-overloaded-record-dot-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-overloaded-record-dot-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:171:32: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m171 |[0m[0m     vertexIntSet :: ToVertex t [;1m[35m~[0m[0m Int => t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:197:29: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m197 |[0m[0m     preIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                             ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:215:30: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m215 |[0m[0m     postIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                              ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:303:37: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m303 |[0m[0m     toAdjacencyIntMap :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                     ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:312:46: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m312 |[0m[0m     toAdjacencyIntMapTranspose :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                              ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:452:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m452 |[0m[0m adjacencyIntMap :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                           ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:471:52: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m471 |[0m[0m adjacencyIntMapTranspose :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                    ^[0m[0m
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export.hs:185:41: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m185 |[0m[0m export :: (Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                         ^[0m[0m
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:121:63: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m121 |[0m[0m export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => Style a s -> g -> s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                               ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:165:78: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m165 |[0m[0m exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g [;1m[35m~[0m[0m s) => g -> s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                                              ^[0m[0m
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [m[ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
[2m[algebraic-graphs] [m[ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.p_o )
[2m[algebraic-graphs] [m[ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
[2m[algebraic-graphs] [m[ 5 of 29] Compiling Algebra.Graph    ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
[2m[algebraic-graphs] [m[ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.p_o )
[2m[algebraic-graphs] [m[ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
[2m[algebraic-graphs] [m[10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.p_o )
[2m[algebraic-graphs] [m[12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:171:32: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m171 |[0m[0m     vertexIntSet :: ToVertex t [;1m[35m~[0m[0m Int => t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:197:29: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m197 |[0m[0m     preIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                             ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:215:30: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m215 |[0m[0m     postIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                              ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:303:37: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m303 |[0m[0m     toAdjacencyIntMap :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                     ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:312:46: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m312 |[0m[0m     toAdjacencyIntMapTranspose :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                              ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:452:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m452 |[0m[0m adjacencyIntMap :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                           ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:471:52: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m471 |[0m[0m adjacencyIntMapTranspose :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                    ^[0m[0m
[2m[algebraic-graphs] [m[14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
[2m[algebraic-graphs] [m[15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.p_o )
[2m[algebraic-graphs] [m[16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
[2m[algebraic-graphs] [m[17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export.hs:185:41: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m185 |[0m[0m export :: (Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                         ^[0m[0m
[2m[algebraic-graphs] [m[22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.p_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:121:63: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m121 |[0m[0m export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => Style a s -> g -> s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                               ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:165:78: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m165 |[0m[0m exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g [;1m[35m~[0m[0m s) => g -> s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                                              ^[0m[0m
[2m[algebraic-graphs] [m[23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
[2m[algebraic-graphs] [m[24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
[2m[algebraic-graphs] [m[25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.p_o )
[2m[algebraic-graphs] [m[26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.p_o )
[2m[algebraic-graphs] [m[27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.p_o )
[2m[algebraic-graphs] [m[28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.p_o )
[2m[algebraic-graphs] [m[29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
[2m[algebraic-graphs] [mPreprocessing test suite 'main' for algebraic-graphs-0.7..
[2m[algebraic-graphs] [mBuilding test suite 'main' for algebraic-graphs-0.7..
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-change-type-signature-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-change-type-signature-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [minspection testing successful
[2m[algebraic-graphs] [m      expected successes: 58
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[23 of 23] Compiling Main             ( test/Main.hs, dist/build/main/main-tmp/Main.o, dist/build/main/main-tmp/Main.dyn_o )
[2m[algebraic-graphs] [m[24 of 24] Linking dist/build/main/main
[2m[algebraic-graphs] [m[1;36mPhase: checkPhase[m
[2m[algebraic-graphs] [mRunning 1 test suites...
[2m[algebraic-graphs] [mTest suite main: RUNNING...
[2m[haskell-language-server] [mPreprocessing library 'hls-class-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-class-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.Show ============
[2m[algebraic-graphs] [mOK: show empty                == "empty"
[2m[algebraic-graphs] [mOK: show (shrink 1)           == "vertex 1"
[2m[algebraic-graphs] [mOK: show (shrink $ 1 + 2)     == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (shrink $ 1 * 2)     == "(fromJust . toAcyclic) (edge 1 2)"
[2m[algebraic-graphs] [mOK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
[2m[algebraic-graphs] [mOK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.fromAcyclic ============
[2m[algebraic-graphs] [mOK: fromAcyclic empty                == empty
[2m[algebraic-graphs] [mOK: fromAcyclic . vertex             == vertex
[2m[algebraic-graphs] [mOK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
[2m[algebraic-graphs] [mOK: vertexCount . fromAcyclic        == vertexCount
[2m[algebraic-graphs] [mOK: edgeCount   . fromAcyclic        == edgeCount
[2m[algebraic-graphs] [mOK: isAcyclic   . fromAcyclic        == const True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.union ============
[2m[algebraic-graphs] [mOK: vertexSet (union x y) == <correct result>
[2m[algebraic-graphs] [mOK: edgeSet   (union x y) == <correct result>
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.join ============
[2m[algebraic-graphs] [mOK: vertexSet (join x y) == <correct result>
[2m[algebraic-graphs] [mOK: edgeSet   (join x y) == <correct result>
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty        x          ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x)   empty      ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x          ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x (transitiveClosure x) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                     ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                             == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                        == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x)       == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge 1 2 (shrink $ 1 * 2) == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty            == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x)       == 0
[2m[algebraic-graphs] [mOK: edgeCount (shrink $ 1 * 2) == 1
[2m[algebraic-graphs] [mOK: edgeCount                  == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty            == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)       == []
[2m[algebraic-graphs] [mOK: edgeList (shrink $ 2 * 1) == [(2,1)]
[2m[algebraic-graphs] [mOK: edgeList . transpose      == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty            == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x)       == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty            == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x)       == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty            == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x)       == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (shrink $ 1 * 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
[2m[algebraic-graphs] [mOK: Set.member x . preSet x   == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty            == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x)       == Set.empty
[2m[algebraic-graphs] [mOK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
[2m[algebraic-graphs] [mOK: postSet 2 (shrink $ 1 * 2) == Set.empty
[2m[algebraic-graphs] [mOK: Set.member x . postSet x   == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (shrink $ 1 * 2)     == vertices [1,2]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y     == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x     == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty       == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x)  == vertex x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose  == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing) == empty
[2m[algebraic-graphs] [mOK: induceJust . vertex . Just  == vertex
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.box ============
[2m[algebraic-graphs] [mOK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: box x y               ~~ box y x
[2m[algebraic-graphs] [mOK: box x (vertex ())     ~~ x
[2m[algebraic-graphs] [mOK: box x empty           ~~ empty
[2m[algebraic-graphs] [mOK: box x (box y z)       ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: transpose   (box x y) == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: vertexCount (box x y) == vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty                    == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x)               == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure      == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.topSort ============
[2m[algebraic-graphs] [mOK: topSort empty                          == []
[2m[algebraic-graphs] [mOK: topSort (vertex x)                     == [x]
[2m[algebraic-graphs] [mOK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
[2m[algebraic-graphs] [mOK: topSort (join x y)                     == fmap Left (topSort x) ++ fmap Right (topSort y)
[2m[algebraic-graphs] [mOK: Right . topSort                        == AM.topSort . fromAcyclic
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.scc ============
[2m[algebraic-graphs] [mOK:            scc empty               == empty
[2m[algebraic-graphs] [mOK:            scc (vertex x)          == vertex (NonEmpty.vertex x)
[2m[algebraic-graphs] [mOK:            scc (edge 1 1)          == vertex (NonEmpty.edge 1 1)
[2m[algebraic-graphs] [mOK: edgeList $ scc (edge 1 2)          == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
[2m[algebraic-graphs] [mOK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.toAcyclic ============
[2m[algebraic-graphs] [mOK: toAcyclic (path    [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
[2m[algebraic-graphs] [mOK: toAcyclic (clique  [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
[2m[algebraic-graphs] [mOK: toAcyclic (circuit [1,2,3]) == Nothing
[2m[algebraic-graphs] [mOK: toAcyclic . fromAcyclic     == Just
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.toAcyclicOrd ============
[2m[algebraic-graphs] [mOK: toAcyclicOrd empty       == empty
[2m[algebraic-graphs] [mOK: toAcyclicOrd . vertex    == vertex
[2m[algebraic-graphs] [mOK: toAcyclicOrd (1 + 2)     == shrink (1 + 2)
[2m[algebraic-graphs] [mOK: toAcyclicOrd (1 * 2)     == shrink (1 * 2)
[2m[algebraic-graphs] [mOK: toAcyclicOrd (2 * 1)     == shrink (1 + 2)
[2m[algebraic-graphs] [mOK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mOK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.shrink ============
[2m[algebraic-graphs] [mOK: shrink . AM.vertex   == vertex
[2m[algebraic-graphs] [mOK: shrink . AM.vertices == vertices
[2m[algebraic-graphs] [mOK: shrink . fromAcyclic == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.consistent ============
[2m[algebraic-graphs] [mOK: Arbitrary
[2m[algebraic-graphs] [mOK: empty
[2m[algebraic-graphs] [mOK: vertex
[2m[algebraic-graphs] [mOK: vertices
[2m[algebraic-graphs] [mOK: union
[2m[algebraic-graphs] [mOK: join
[2m[algebraic-graphs] [mOK: transpose
[2m[algebraic-graphs] [mOK: box
[2m[algebraic-graphs] [mOK: transitiveClosure
[2m[algebraic-graphs] [mOK: scc
[2m[algebraic-graphs] [mOK: toAcyclic
[2m[algebraic-graphs] [mOK: toAcyclicOrd
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap ============
[2m[algebraic-graphs] [mOK: Axioms of graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.fromAdjacencyMap ============
[2m[algebraic-graphs] [mOK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.consistent ============
[2m[algebraic-graphs] [mOK: Consistency of the Arbitrary instance
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: consistent empty         == True
[2m[algebraic-graphs] [mOK: consistent (vertex x)    == True
[2m[algebraic-graphs] [mOK: consistent (overlay x y) == True
[2m[algebraic-graphs] [mOK: consistent (connect x y) == True
[2m[algebraic-graphs] [mOK: consistent (edge x y)    == True
[2m[algebraic-graphs] [mOK: consistent (edges xs)    == True
[2m[algebraic-graphs] [mOK: consistent (stars xs)    == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.Show ============
[2m[algebraic-graphs] [mOK: show (empty    ) == "empty"
[2m[algebraic-graphs] [mOK: show (1        ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2    ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2    ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1)                            ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 3
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.connect ============
[2m[algebraic-graphs] [mOK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edges ============
[2m[algebraic-graphs] [mOK: edges []          == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)]     == edge x y
[2m[algebraic-graphs] [mOK: edges             == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.connects ============
[2m[algebraic-graphs] [mOK: connects []        == empty
[2m[algebraic-graphs] [mOK: connects [x]       == x
[2m[algebraic-graphs] [mOK: connects [x,y]     == connect x y
[2m[algebraic-graphs] [mOK: connects           == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.fromAdjacencyIntSets ============
[2m[algebraic-graphs] [mOK: fromAdjacencyIntSets []                                     == empty
[2m[algebraic-graphs] [mOK: fromAdjacencyIntSets [(x, IntSet.empty)]                    == vertex x
[2m[algebraic-graphs] [mOK: fromAdjacencyIntSets [(x, IntSet.singleton y)]              == edge x y
[2m[algebraic-graphs] [mOK: fromAdjacencyIntSets . map (fmap IntSet.fromList)           == stars
[2m[algebraic-graphs] [mOK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty         x             ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x)    empty         ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs)     (circuit xs)  ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph                    == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg                      == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty                    == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size                       == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x                == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount                == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount                  == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList                 == Set.toAscList . vertexSet
[2m[algebraic-graphs] [mOK: edgeList                   == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap             == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap          == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay connect        == id
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1     (const 1)     (+)     (+)            == size
[2m[algebraic-graphs] [mOK: foldg True  (const False) (&&)    (&&)           == isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                       == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty)       == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                  == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty      == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount            == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex   == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique   == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty          == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)     == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y)     == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges        == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges    == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty          == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x)     == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.preIntSet ============
[2m[algebraic-graphs] [mOK: preIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet 1 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet y (edge x y) == IntSet.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.postIntSet ============
[2m[algebraic-graphs] [mOK: postIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet 2 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (edge x y) == IntSet.fromList [y]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.path ============
[2m[algebraic-graphs] [mOK: path []    == empty
[2m[algebraic-graphs] [mOK: path [x]   == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.circuit ============
[2m[algebraic-graphs] [mOK: circuit []    == empty
[2m[algebraic-graphs] [mOK: circuit [x]   == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.clique ============
[2m[algebraic-graphs] [mOK: clique []         == empty
[2m[algebraic-graphs] [mOK: clique [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.biclique ============
[2m[algebraic-graphs] [mOK: biclique []      []      == empty
[2m[algebraic-graphs] [mOK: biclique [x]     []      == vertex x
[2m[algebraic-graphs] [mOK: biclique []      [y]     == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs      ys      == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys    == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.stars ============
[2m[algebraic-graphs] [mOK: stars []                      == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])]               == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])]              == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)]               == star x ys
[2m[algebraic-graphs] [mOK: stars                         == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList         == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.forest ============
[2m[algebraic-graphs] [mOK: forest []                                                  == empty
[2m[algebraic-graphs] [mOK: forest [x]                                                 == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest                                                     == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty       == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x)  == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y)  == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose  == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty      == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id           == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g   == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.compose ============
[2m[algebraic-graphs] [mOK: compose empty            x                == empty
[2m[algebraic-graphs] [mOK: compose x                empty            == empty
[2m[algebraic-graphs] [mOK: compose (vertex x)       y                == empty
[2m[algebraic-graphs] [mOK: compose x                (vertex y)       == empty
[2m[algebraic-graphs] [mOK: compose x                (compose y z)    == compose (compose x y) z
[2m[algebraic-graphs] [mOK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
[2m[algebraic-graphs] [mOK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
[2m[algebraic-graphs] [mOK: compose (edge x y)       (edge y z)       == edge x z
[2m[algebraic-graphs] [mOK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
[2m[algebraic-graphs] [mOK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.closure ============
[2m[algebraic-graphs] [mOK: closure empty           == empty
[2m[algebraic-graphs] [mOK: closure (vertex x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x y)      == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
[2m[algebraic-graphs] [mOK: closure                 == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure                 == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure       == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y)   == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty              == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x y)         == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty              == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x)         == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge x y)         == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x                  == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty               == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x)          == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge x y)          == edge x y
[2m[algebraic-graphs] [mOK: transitiveClosure (path $ nub xs)     == clique (nub $ xs)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.bfsForest ============
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [0]        == empty
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [1]        == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [2]        == vertex 2
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [0,1,2]    == vertices [1,2]
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [2,1,0]    == vertices [1,2]
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 1) [1]        == vertex 1
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ bfsForest x vs) x == True
[2m[algebraic-graphs] [mOK: bfsForest x (vertexList x)               == map ( -> Node v []) (nub $ vertexList x)
[2m[algebraic-graphs] [mOK: bfsForest x []                           == []
[2m[algebraic-graphs] [mOK: bfsForest empty vs                       == []
[2m[algebraic-graphs] [mOK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4]  == <correct result>
[2m[algebraic-graphs] [mOK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.bfs ============
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [0]                                   == []
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [1]                                   == [[1], [2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [2]                                   == [[2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [1,2]                                 == [[1,2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [2,1]                                 == [[2,1]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 1) [1]                                   == [[1]]
[2m[algebraic-graphs] [mOK: bfs empty vs                                         == []
[2m[algebraic-graphs] [mOK: bfs x []                                             == []
[2m[algebraic-graphs] [mOK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2]                    == [[1,2]]
[2m[algebraic-graphs] [mOK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3]                    == [[1,3], [2,4]]
[2m[algebraic-graphs] [mOK: bfs (3 * (1 + 4) * (1 + 5)) [3]                      == [[3], [1,4,5]]
[2m[algebraic-graphs] [mOK: bfs (circuit [1..5] + circuit [5,4..1]) [2]          == [[2], [1,3], [5,4]]
[2m[algebraic-graphs] [mOK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
[2m[algebraic-graphs] [mOK: map concat . transpose . map levels . bfsForest x    == bfs x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.dfsForest ============
[2m[algebraic-graphs] [mOK: forest $ dfsForest empty              == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 1 1)         == vertex 1
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 1 2)         == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 2 1)         == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForest x) x == True
[2m[algebraic-graphs] [mOK: isDfsForestOf (dfsForest x) x         == True
[2m[algebraic-graphs] [mOK: dfsForest . forest . dfsForest        == dfsForest
[2m[algebraic-graphs] [mOK: dfsForest (vertices vs)               == map (\v -> Node v []) (nub $ sort vs)
[2m[algebraic-graphs] [mOK: dfsForest $ 3 * (1 + 4) * (1 + 5)     == <correct result>
[2m[algebraic-graphs] [mOK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.dfsForestFrom ============
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom empty      vs             == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 1) [1]            == vertex 1
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [0]            == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [1]            == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [2]            == vertex 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [1,2]          == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [2,1]          == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForestFrom x vs) x     == True
[2m[algebraic-graphs] [mOK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
[2m[algebraic-graphs] [mOK: dfsForestFrom x (vertexList x)                   == dfsForest x
[2m[algebraic-graphs] [mOK: dfsForestFrom x []                               == []
[2m[algebraic-graphs] [mOK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4]      == <correct result>
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.dfs ============
[2m[algebraic-graphs] [mOK: dfs empty      vs    == []
[2m[algebraic-graphs] [mOK: dfs (edge 1 1) [1]   == [1]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [0]   == []
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [1]   == [1,2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [2]   == [2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [1,2] == [1,2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [2,1] == [2,1]
[2m[algebraic-graphs] [mOK: dfs x          []    == []
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- dfs x vs ]       == True
[2m[algebraic-graphs] [mOK: dfs (3 * (1 + 4) * (1 + 5)) [1,4]           == [1,5,4]
[2m[algebraic-graphs] [mOK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.dfs ============
[2m[algebraic-graphs] [mOK: reachable empty              x == []
[2m[algebraic-graphs] [mOK: reachable (vertex 1)         1 == [1]
[2m[algebraic-graphs] [mOK: reachable (edge 1 1)         1 == [1]
[2m[algebraic-graphs] [mOK: reachable (edge 1 2)         0 == []
[2m[algebraic-graphs] [mOK: reachable (edge 1 2)         1 == [1,2]
[2m[algebraic-graphs] [mOK: reachable (edge 1 2)         2 == [2]
[2m[algebraic-graphs] [mOK: reachable (path    [1..8]  ) 4 == [4..8]
[2m[algebraic-graphs] [mOK: reachable (circuit [1..8]  ) 4 == [4..8] ++ [1..3]
[2m[algebraic-graphs] [mOK: reachable (clique  [8,7..1]) 8 == [8] ++ [1..7]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- reachable x y ] == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.topSort ============
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + 3 * 1)                    == Right [3,1,2]
[2m[algebraic-graphs] [mOK: topSort (path [1..5])                      == Right [1..5]
[2m[algebraic-graphs] [mOK: topSort (3 * (1 * 4 + 2 * 5))              == Right [3,1,2,4,5]
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + 2 * 1)                    == Left (2 :| [1])
[2m[algebraic-graphs] [mOK: topSort (path [5,4..1] + edge 2 4)         == Left (4 :| [3,2])
[2m[algebraic-graphs] [mOK: topSort (circuit [1..5])                   == Left (3 :| [1,2])
[2m[algebraic-graphs] [mOK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3)  == Left (1 :| [2])
[2m[algebraic-graphs] [mOK: fmap (flip isTopSortOf x) (topSort x) /= Right False
[2m[algebraic-graphs] [mOK: topSort . vertices     == Right . nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.testIsAcyclic ============
[2m[algebraic-graphs] [mOK: isAcyclic (1 * 2 + 3 * 1) == True
[2m[algebraic-graphs] [mOK: isAcyclic (1 * 2 + 2 * 1) == False
[2m[algebraic-graphs] [mOK: isAcyclic . circuit       == null
[2m[algebraic-graphs] [mOK: isAcyclic                 == isRight . topSort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.isDfsForestOf ============
[2m[algebraic-graphs] [mOK: isDfsForestOf []                              empty            == True
[2m[algebraic-graphs] [mOK: isDfsForestOf []                              (vertex 1)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (vertex 1)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (vertex 2)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 1 []]          (vertex 1)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (edge 1 1)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (edge 1 2)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 []]          (edge 1 2)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [], Node 1 []]          (edge 1 2)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 []]]            (edge 1 2)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 []]          (vertices [1,2]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [], Node 1 []]          (vertices [1,2]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 []]]            (vertices [1,2]) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]]   (path [1,2,3])   == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]]   (path [1,2,3])   == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3])   == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3])   == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3])   == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.isTopSortOf ============
[2m[algebraic-graphs] [mOK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
[2m[algebraic-graphs] [mOK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
[2m[algebraic-graphs] [mOK: isTopSortOf []      (1 * 2 + 3 * 1) == False
[2m[algebraic-graphs] [mOK: isTopSortOf []      empty           == True
[2m[algebraic-graphs] [mOK: isTopSortOf [x]     (vertex x)      == True
[2m[algebraic-graphs] [mOK: isTopSortOf [x]     (edge x x)      == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap ============
[2m[algebraic-graphs] [mOK: Axioms of graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.consistent ============
[2m[algebraic-graphs] [mOK: Consistency of the Arbitrary instance
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: consistent empty         == True
[2m[algebraic-graphs] [mOK: consistent (vertex x)    == True
[2m[algebraic-graphs] [mOK: consistent (overlay x y) == True
[2m[algebraic-graphs] [mOK: consistent (connect x y) == True
[2m[algebraic-graphs] [mOK: consistent (edge x y)    == True
[2m[algebraic-graphs] [mOK: consistent (edges xs)    == True
[2m[algebraic-graphs] [mOK: consistent (stars xs)    == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.Show ============
[2m[algebraic-graphs] [mOK: show (empty    ) == "empty"
[2m[algebraic-graphs] [mOK: show (1        ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2    ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2    ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1)                            ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 3
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.connect ============
[2m[algebraic-graphs] [mOK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edges ============
[2m[algebraic-graphs] [mOK: edges []          == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)]     == edge x y
[2m[algebraic-graphs] [mOK: edges             == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.connects ============
[2m[algebraic-graphs] [mOK: connects []        == empty
[2m[algebraic-graphs] [mOK: connects [x]       == x
[2m[algebraic-graphs] [mOK: connects [x,y]     == connect x y
[2m[algebraic-graphs] [mOK: connects           == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.fromAdjacencySets ============
[2m[algebraic-graphs] [mOK: fromAdjacencySets []                                  == empty
[2m[algebraic-graphs] [mOK: fromAdjacencySets [(x, Set.empty)]                    == vertex x
[2m[algebraic-graphs] [mOK: fromAdjacencySets [(x, Set.singleton y)]              == edge x y
[2m[algebraic-graphs] [mOK: fromAdjacencySets . map (fmap Set.fromList)           == stars
[2m[algebraic-graphs] [mOK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty         x             ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x)    empty         ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs)     (circuit xs)  ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph                    == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg                      == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty                    == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size                       == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x                == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount                == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount                  == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList                 == Set.toAscList . vertexSet
[2m[algebraic-graphs] [mOK: edgeList                   == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap             == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap          == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay connect        == id
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1     (const 1)     (+)     (+)            == size
[2m[algebraic-graphs] [mOK: foldg True  (const False) (&&)    (&&)           == isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                       == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty)       == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                  == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty      == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount            == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex   == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique   == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty          == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)     == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y)     == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges        == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges    == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty          == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x)     == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.preIntSet ============
[2m[algebraic-graphs] [mOK: preIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet 1 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet y (edge x y) == IntSet.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.postIntSet ============
[2m[algebraic-graphs] [mOK: postIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet 2 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (edge x y) == IntSet.fromList [y]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.path ============
[2m[algebraic-graphs] [mOK: path []    == empty
[2m[algebraic-graphs] [mOK: path [x]   == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.circuit ============
[2m[algebraic-graphs] [mOK: circuit []    == empty
[2m[algebraic-graphs] [mOK: circuit [x]   == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.clique ============
[2m[algebraic-graphs] [mOK: clique []         == empty
[2m[algebraic-graphs] [mOK: clique [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.biclique ============
[2m[algebraic-graphs] [mOK: biclique []      []      == empty
[2m[algebraic-graphs] [mOK: biclique [x]     []      == vertex x
[2m[algebraic-graphs] [mOK: biclique []      [y]     == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs      ys      == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys    == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.stars ============
[2m[algebraic-graphs] [mOK: stars []                      == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])]               == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])]              == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)]               == star x ys
[2m[algebraic-graphs] [mOK: stars                         == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList         == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.forest ============
[2m[algebraic-graphs] [mOK: forest []                                                  == empty
[2m[algebraic-graphs] [mOK: forest [x]                                                 == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest                                                     == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty       == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x)  == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y)  == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose  == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty      == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id           == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g   == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.compose ============
[2m[algebraic-graphs] [mOK: compose empty            x                == empty
[2m[algebraic-graphs] [mOK: compose x                empty            == empty
[2m[algebraic-graphs] [mOK: compose (vertex x)       y                == empty
[2m[algebraic-graphs] [mOK: compose x                (vertex y)       == empty
[2m[algebraic-graphs] [mOK: compose x                (compose y z)    == compose (compose x y) z
[2m[algebraic-graphs] [mOK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
[2m[haskell-language-server] [mPreprocessing library 'hls-call-hierarchy-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-call-hierarchy-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mOK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
[2m[algebraic-graphs] [mOK: compose (edge x y)       (edge y z)       == edge x z
[2m[algebraic-graphs] [mOK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
[2m[algebraic-graphs] [mOK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.closure ============
[2m[algebraic-graphs] [mOK: closure empty           == empty
[2m[algebraic-graphs] [mOK: closure (vertex x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x y)      == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
[2m[algebraic-graphs] [mOK: closure                 == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure                 == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure       == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y)   == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty              == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x y)         == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty              == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x)         == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge x y)         == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x                  == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty               == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x)          == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge x y)          == edge x y
[2m[algebraic-graphs] [mOK: transitiveClosure (path $ nub xs)     == clique (nub $ xs)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.box ============
[2m[algebraic-graphs] [mOK: box x y               ~~ box y x
[2m[algebraic-graphs] [mOK: box x (overlay y z)   == overlay (box x y) (box x z)
[2m[algebraic-graphs] [mOK: box x (vertex ())     ~~ x
[2m[algebraic-graphs] [mOK: box x empty           ~~ empty
[2m[algebraic-graphs] [mOK: box x (box y z)       ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: transpose   (box x y) == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: vertexCount (box x y) == vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.bfsForest ============
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [0]        == empty
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [1]        == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [2]        == vertex 2
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [0,1,2]    == vertices [1,2]
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [2,1,0]    == vertices [1,2]
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 1) [1]        == vertex 1
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ bfsForest x vs) x == True
[2m[algebraic-graphs] [mOK: bfsForest x (vertexList x)               == map ( -> Node v []) (nub $ vertexList x)
[2m[algebraic-graphs] [mOK: bfsForest x []                           == []
[2m[algebraic-graphs] [mOK: bfsForest empty vs                       == []
[2m[algebraic-graphs] [mOK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4]  == <correct result>
[2m[algebraic-graphs] [mOK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.bfs ============
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [0]                                   == []
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [1]                                   == [[1], [2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [2]                                   == [[2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [1,2]                                 == [[1,2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [2,1]                                 == [[2,1]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 1) [1]                                   == [[1]]
[2m[algebraic-graphs] [mOK: bfs empty vs                                         == []
[2m[algebraic-graphs] [mOK: bfs x []                                             == []
[2m[algebraic-graphs] [mOK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2]                    == [[1,2]]
[2m[algebraic-graphs] [mOK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3]                    == [[1,3], [2,4]]
[2m[algebraic-graphs] [mOK: bfs (3 * (1 + 4) * (1 + 5)) [3]                      == [[3], [1,4,5]]
[2m[algebraic-graphs] [mOK: bfs (circuit [1..5] + circuit [5,4..1]) [2]          == [[2], [1,3], [5,4]]
[2m[algebraic-graphs] [mOK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
[2m[algebraic-graphs] [mOK: map concat . transpose . map levels . bfsForest x    == bfs x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.dfsForest ============
[2m[algebraic-graphs] [mOK: forest $ dfsForest empty              == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 1 1)         == vertex 1
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 1 2)         == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 2 1)         == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForest x) x == True
[2m[algebraic-graphs] [mOK: isDfsForestOf (dfsForest x) x         == True
[2m[algebraic-graphs] [mOK: dfsForest . forest . dfsForest        == dfsForest
[2m[algebraic-graphs] [mOK: dfsForest (vertices vs)               == map (\v -> Node v []) (nub $ sort vs)
[2m[algebraic-graphs] [mOK: dfsForest $ 3 * (1 + 4) * (1 + 5)     == <correct result>
[2m[algebraic-graphs] [mOK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.dfsForestFrom ============
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom empty      vs             == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 1) [1]            == vertex 1
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [0]            == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [1]            == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [2]            == vertex 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [1,2]          == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [2,1]          == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForestFrom x vs) x     == True
[2m[algebraic-graphs] [mOK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
[2m[algebraic-graphs] [mOK: dfsForestFrom x (vertexList x)                   == dfsForest x
[2m[algebraic-graphs] [mOK: dfsForestFrom x []                               == []
[2m[algebraic-graphs] [mOK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4]      == <correct result>
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.dfs ============
[2m[algebraic-graphs] [mOK: dfs empty      vs    == []
[2m[algebraic-graphs] [mOK: dfs (edge 1 1) [1]   == [1]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [0]   == []
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [1]   == [1,2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [2]   == [2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [1,2] == [1,2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [2,1] == [2,1]
[2m[algebraic-graphs] [mOK: dfs x          []    == []
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- dfs x vs ]       == True
[2m[algebraic-graphs] [mOK: dfs (3 * (1 + 4) * (1 + 5)) [1,4]           == [1,5,4]
[2m[algebraic-graphs] [mOK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.dfs ============
[2m[algebraic-graphs] [mOK: reachable empty              x == []
[2m[algebraic-graphs] [mOK: reachable (vertex 1)         1 == [1]
[2m[algebraic-graphs] [mOK: reachable (edge 1 1)         1 == [1]
[2m[algebraic-graphs] [mOK: reachable (edge 1 2)         0 == []
[2m[algebraic-graphs] [mOK: reachable (edge 1 2)         1 == [1,2]
[2m[algebraic-graphs] [mOK: reachable (edge 1 2)         2 == [2]
[2m[algebraic-graphs] [mOK: reachable (path    [1..8]  ) 4 == [4..8]
[2m[algebraic-graphs] [mOK: reachable (circuit [1..8]  ) 4 == [4..8] ++ [1..3]
[2m[algebraic-graphs] [mOK: reachable (clique  [8,7..1]) 8 == [8] ++ [1..7]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- reachable x y ] == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.topSort ============
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + 3 * 1)                    == Right [3,1,2]
[2m[algebraic-graphs] [mOK: topSort (path [1..5])                      == Right [1..5]
[2m[algebraic-graphs] [mOK: topSort (3 * (1 * 4 + 2 * 5))              == Right [3,1,2,4,5]
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + 2 * 1)                    == Left (2 :| [1])
[2m[algebraic-graphs] [mOK: topSort (path [5,4..1] + edge 2 4)         == Left (4 :| [3,2])
[2m[algebraic-graphs] [mOK: topSort (circuit [1..5])                   == Left (3 :| [1,2])
[2m[algebraic-graphs] [mOK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3)  == Left (1 :| [2])
[2m[algebraic-graphs] [mOK: fmap (flip isTopSortOf x) (topSort x) /= Right False
[2m[algebraic-graphs] [mOK: topSort . vertices     == Right . nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.testIsAcyclic ============
[2m[algebraic-graphs] [mOK: isAcyclic (1 * 2 + 3 * 1) == True
[2m[algebraic-graphs] [mOK: isAcyclic (1 * 2 + 2 * 1) == False
[2m[algebraic-graphs] [mOK: isAcyclic . circuit       == null
[2m[algebraic-graphs] [mOK: isAcyclic                 == isRight . topSort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.isDfsForestOf ============
[2m[algebraic-graphs] [mOK: isDfsForestOf []                              empty            == True
[2m[algebraic-graphs] [mOK: isDfsForestOf []                              (vertex 1)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (vertex 1)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (vertex 2)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 1 []]          (vertex 1)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (edge 1 1)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (edge 1 2)       == False
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 []]          (edge 1 2)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [], Node 1 []]          (edge 1 2)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 []]]            (edge 1 2)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 []]          (vertices [1,2]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [], Node 1 []]          (vertices [1,2]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 []]]            (vertices [1,2]) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]]   (path [1,2,3])   == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]]   (path [1,2,3])   == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3])   == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3])   == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3])   == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.isTopSortOf ============
[2m[algebraic-graphs] [mOK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
[2m[algebraic-graphs] [mOK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
[2m[algebraic-graphs] [mOK: isTopSortOf []      (1 * 2 + 3 * 1) == False
[2m[algebraic-graphs] [mOK: isTopSortOf []      empty           == True
[2m[algebraic-graphs] [mOK: isTopSortOf [x]     (vertex x)      == True
[2m[algebraic-graphs] [mOK: isTopSortOf [x]     (edge x x)      == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing)                               == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing)                        == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just                                    == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.scc ============
[2m[algebraic-graphs] [mOK: scc empty               == empty
[2m[algebraic-graphs] [mOK: scc (vertex x)          == vertex (NonEmpty.vertex x)
[2m[algebraic-graphs] [mOK: scc (vertices xs)       == vertices (map NonEmpty.vertex xs)
[2m[algebraic-graphs] [mOK: scc (edge 1 1)          == vertex (NonEmpty.edge 1 1)
[2m[algebraic-graphs] [mOK: scc (edge 1 2)          == edge   (NonEmpty.vertex 1) (NonEmpty.vertex 2)
[2m[algebraic-graphs] [mOK: scc (circuit (1:xs))    == vertex (NonEmpty.circuit1 (1 :| xs))
[2m[algebraic-graphs] [mOK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
[2m[algebraic-graphs] [mOK: isAcyclic . scc == const True
[2m[algebraic-graphs] [mOK: isAcyclic x     == (scc x == gmap NonEmpty.vertex x)
[2m[algebraic-graphs] [mOK: scc g == KL.scc g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Num ============
[2m[algebraic-graphs] [mOK: 0                     == rightVertex 0
[2m[algebraic-graphs] [mOK: swap 1                == leftVertex 1
[2m[algebraic-graphs] [mOK: swap 1 + 2            == vertices [1] [2]
[2m[algebraic-graphs] [mOK: swap 1 * 2            == edge 1 2
[2m[algebraic-graphs] [mOK: swap 1 + 2 * swap 3   == overlay (leftVertex 1) (edge 3 2)
[2m[algebraic-graphs] [mOK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Show ============
[2m[algebraic-graphs] [mOK: show empty                 == "empty"
[2m[algebraic-graphs] [mOK: show 1                     == "rightVertex 1"
[2m[algebraic-graphs] [mOK: show (swap 2)              == "leftVertex 2"
[2m[algebraic-graphs] [mOK: show 1 + 2                 == "vertices [] [1,2]"
[2m[algebraic-graphs] [mOK: show (swap (1 + 2))        == "vertices [1,2] []"
[2m[algebraic-graphs] [mOK: show (swap 1 * 2)          == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
[2m[algebraic-graphs] [mOK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Eq ============
[2m[algebraic-graphs] [mOK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK:         x + y == y + x
[2m[algebraic-graphs] [mOK:   x + (y + z) == (x + y) + z
[2m[algebraic-graphs] [mOK:     x * empty == x
[2m[algebraic-graphs] [mOK:     empty * x == x
[2m[algebraic-graphs] [mOK:         x * y == y * x
[2m[algebraic-graphs] [mOK:   x * (y * z) == (x * y) * z
[2m[algebraic-graphs] [mOK:   x * (y + z) == x * y + x * z
[2m[algebraic-graphs] [mOK:   (x + y) * z == x * z + y * z
[2m[algebraic-graphs] [mOK:     x * y * z == x * y + x * z + y * z
[2m[algebraic-graphs] [mOK:     x + empty == x
[2m[algebraic-graphs] [mOK:     empty + x == x
[2m[algebraic-graphs] [mOK:         x + x == x
[2m[algebraic-graphs] [mOK: x * y + x + y == x * y
[2m[algebraic-graphs] [mOK:     x * x * x == x * x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK:  leftVertex x * leftVertex y  ==  leftVertex x + leftVertex y 
[2m[algebraic-graphs] [mOK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
[2m[algebraic-graphs] [mOK: leftAdjacencyMap empty           == Map.empty
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (leftVertex x)  == Map.singleton x Set.empty
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (rightVertex x) == Map.empty
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (edge x y)      == Map.singleton x (Set.singleton y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
[2m[algebraic-graphs] [mOK: rightAdjacencyMap empty           == Map.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (leftVertex x)  == Map.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (edge x y)      == Map.singleton y (Set.singleton x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty empty           == True
[2m[algebraic-graphs] [mOK: leftAdjacencyMap empty  == Map.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap empty == Map.empty
[2m[algebraic-graphs] [mOK: hasVertex x empty       == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftVertex ============
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (leftVertex x)  == Map.singleton x Set.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (leftVertex x) == Map.empty
[2m[algebraic-graphs] [mOK: hasLeftVertex x (leftVertex y)   == (x == y)
[2m[algebraic-graphs] [mOK: hasRightVertex x (leftVertex y)  == False
[2m[algebraic-graphs] [mOK: hasEdge x y (leftVertex z)       == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightVertex ============
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (rightVertex x)  == Map.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
[2m[algebraic-graphs] [mOK: hasLeftVertex x (rightVertex y)   == False
[2m[algebraic-graphs] [mOK: hasRightVertex x (rightVertex y)  == (x == y)
[2m[algebraic-graphs] [mOK: hasEdge x y (rightVertex z)       == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: vertex . Left  == leftVertex
[2m[algebraic-graphs] [mOK: vertex . Right == rightVertex
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edge ============
[2m[algebraic-graphs] [mOK: edge x y                     == connect (leftVertex x) (rightVertex y)
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (edge x y)  == Map.singleton x (Set.singleton y)
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge 1 2 (edge 2 1)       == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.connect ============
[2m[algebraic-graphs] [mOK: connect (leftVertex x)     (leftVertex y)     == vertices [x,y] []
[2m[algebraic-graphs] [mOK: connect (leftVertex x)     (rightVertex y)    == edge x y
[2m[algebraic-graphs] [mOK: connect (rightVertex x)    (leftVertex y)     == edge y x
[2m[algebraic-graphs] [mOK: connect (rightVertex x)    (rightVertex y)    == vertices [] [x,y]
[2m[algebraic-graphs] [mOK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
[2m[algebraic-graphs] [mOK: isEmpty     (connect x y)                     == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y)                     == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y)                     >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y)                     <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y)                     >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y)                     >= leftVertexCount x * rightVertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y)                     <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices [] []                    == empty
[2m[algebraic-graphs] [mOK: vertices [x] []                   == leftVertex x
[2m[algebraic-graphs] [mOK: vertices [] [x]                   == rightVertex x
[2m[algebraic-graphs] [mOK: vertices xs ys                    == overlays (map leftVertex xs ++ map rightVertex ys)
[2m[algebraic-graphs] [mOK: hasLeftVertex  x (vertices xs ys) == elem x xs
[2m[algebraic-graphs] [mOK: hasRightVertex y (vertices xs ys) == elem y ys
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edges ============
[2m[algebraic-graphs] [mOK: edges []            == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)]       == edge x y
[2m[algebraic-graphs] [mOK: edges               == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: hasEdge x y . edges == elem (x,y)
[2m[algebraic-graphs] [mOK: edgeCount   . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.connects ============
[2m[algebraic-graphs] [mOK: connects []        == empty
[2m[algebraic-graphs] [mOK: connects [x]       == x
[2m[algebraic-graphs] [mOK: connects [x,y]     == connect x y
[2m[algebraic-graphs] [mOK: connects           == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.swap ============
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mOK: swap empty            == empty
[2m[algebraic-graphs] [mOK: swap . leftVertex     == rightVertex
[2m[algebraic-graphs] [mOK: swap (vertices xs ys) == vertices ys xs
[2m[algebraic-graphs] [mOK: swap (edge x y)       == edge y x
[2m[algebraic-graphs] [mOK: swap . edges          == edges . map Data.Tuple.swap
[2m[algebraic-graphs] [mOK: swap . swap           == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.toBipartite ============
[2m[algebraic-graphs] [mOK: toBipartite empty                      == empty
[2m[algebraic-graphs] [mOK: toBipartite (vertex (Left x))          == leftVertex x
[2m[algebraic-graphs] [mOK: toBipartite (vertex (Right x))         == rightVertex x
[2m[algebraic-graphs] [mOK: toBipartite (edge (Left x) (Left y))   == vertices [x,y] []
[2m[algebraic-graphs] [mOK: toBipartite (edge (Left x) (Right y))  == edge x y
[2m[algebraic-graphs] [mOK: toBipartite (edge (Right x) (Left y))  == edge y x
[2m[algebraic-graphs] [mOK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
[2m[algebraic-graphs] [mOK: toBipartite . clique                   == uncurry biclique . partitionEithers
[2m[algebraic-graphs] [mOK: toBipartite . fromBipartite            == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.toBipartiteWith ============
[2m[algebraic-graphs] [mOK: toBipartiteWith f empty == empty
[2m[algebraic-graphs] [mOK: toBipartiteWith Left x  == vertices (vertexList x) []
[2m[algebraic-graphs] [mOK: toBipartiteWith Right x == vertices [] (vertexList x)
[2m[algebraic-graphs] [mOK: toBipartiteWith f       == toBipartite . gmap f
[2m[algebraic-graphs] [mOK: toBipartiteWith id      == toBipartite
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.fromBipartite ============
[2m[algebraic-graphs] [mOK: fromBipartite empty          == empty
[2m[algebraic-graphs] [mOK: fromBipartite (leftVertex x) == vertex (Left x)
[2m[algebraic-graphs] [mOK: fromBipartite (edge x y)     == edges [(Left x, Right y), (Right y, Left x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.fromBipartiteWith ============
[2m[algebraic-graphs] [mOK: fromBipartiteWith Left Right             == fromBipartite
[2m[algebraic-graphs] [mOK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
[2m[algebraic-graphs] [mOK: fromBipartiteWith id id . edges          == symmetricClosure . edges
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                 == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty) == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)            == False
[2m[algebraic-graphs] [mOK: isEmpty                       == (==) empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.hasLeftVertex ============
[2m[algebraic-graphs] [mOK: hasLeftVertex x empty           == False
[2m[algebraic-graphs] [mOK: hasLeftVertex x (leftVertex y)  == (x == y)
[2m[algebraic-graphs] [mOK: hasLeftVertex x (rightVertex y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.hasRightVertex ============
[2m[algebraic-graphs] [mOK: hasRightVertex x empty           == False
[2m[algebraic-graphs] [mOK: hasRightVertex x (leftVertex y)  == False
[2m[algebraic-graphs] [mOK: hasRightVertex x (rightVertex y) == (x == y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex . Left  == hasLeftVertex
[2m[algebraic-graphs] [mOK: hasVertex . Right == hasRightVertex
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty      == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z) == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: hasEdge x y            == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftVertexCount ============
[2m[algebraic-graphs] [mOK: leftVertexCount empty           == 0
[2m[algebraic-graphs] [mOK: leftVertexCount (leftVertex x)  == 1
[2m[algebraic-graphs] [mOK: leftVertexCount (rightVertex x) == 0
[2m[algebraic-graphs] [mOK: leftVertexCount (edge x y)      == 1
[2m[algebraic-graphs] [mOK: leftVertexCount . edges         == length . nub . map fst
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightVertexCount ============
[2m[algebraic-graphs] [mOK: rightVertexCount empty           == 0
[2m[algebraic-graphs] [mOK: rightVertexCount (leftVertex x)  == 0
[2m[algebraic-graphs] [mOK: rightVertexCount (rightVertex x) == 1
[2m[algebraic-graphs] [mOK: rightVertexCount (edge x y)      == 1
[2m[algebraic-graphs] [mOK: rightVertexCount . edges         == length . nub . map snd
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty      == 0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge x y) == 2
[2m[algebraic-graphs] [mOK: vertexCount x          == leftVertexCount x + rightVertexCount x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty      == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount . edges    == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftVertexList ============
[2m[algebraic-graphs] [mOK: leftVertexList empty              == []
[2m[algebraic-graphs] [mOK: leftVertexList (leftVertex x)     == [x]
[2m[algebraic-graphs] [mOK: leftVertexList (rightVertex x)    == []
[2m[algebraic-graphs] [mOK: leftVertexList . flip vertices [] == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightVertexList ============
[2m[algebraic-graphs] [mOK: rightVertexList empty           == []
[2m[algebraic-graphs] [mOK: rightVertexList (leftVertex x)  == []
[2m[algebraic-graphs] [mOK: rightVertexList (rightVertex x) == [x]
[2m[algebraic-graphs] [mOK: rightVertexList . vertices []   == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty                             == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x)                        == [x]
[2m[algebraic-graphs] [mOK: vertexList (edge x y)                        == [Left x, Right y]
[2m[algebraic-graphs] [mOK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty      == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x) == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y) == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList . edges    == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftVertexSet ============
[2m[algebraic-graphs] [mOK: leftVertexSet empty              == Set.empty
[2m[algebraic-graphs] [mOK: leftVertexSet . leftVertex       == Set.singleton
[2m[algebraic-graphs] [mOK: leftVertexSet . rightVertex      == const Set.empty
[2m[algebraic-graphs] [mOK: leftVertexSet . flip vertices [] == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightVertexSet ============
[2m[algebraic-graphs] [mOK: rightVertexSet empty         == Set.empty
[2m[algebraic-graphs] [mOK: rightVertexSet . leftVertex  == const Set.empty
[2m[algebraic-graphs] [mOK: rightVertexSet . rightVertex == Set.singleton
[2m[algebraic-graphs] [mOK: rightVertexSet . vertices [] == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty                             == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex                          == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet (edge x y)                        == Set.fromList [Left x, Right y]
[2m[algebraic-graphs] [mOK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges    == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftAdjacencyList ============
[2m[algebraic-graphs] [mOK: leftAdjacencyList empty            == []
[2m[algebraic-graphs] [mOK: leftAdjacencyList (vertices [] xs) == []
[2m[algebraic-graphs] [mOK: leftAdjacencyList (vertices xs []) == []
[2m[algebraic-graphs] [mOK: leftAdjacencyList (edge x y)       == [(x, [y])]
[2m[algebraic-graphs] [mOK: leftAdjacencyList (star x ys)      == [(x, nub (sort ys))]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightAdjacencyList ============
[2m[algebraic-graphs] [mOK: rightAdjacencyList empty            == []
[2m[algebraic-graphs] [mOK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
[2m[algebraic-graphs] [mOK: rightAdjacencyList (vertices xs []) == []
[2m[algebraic-graphs] [mOK: rightAdjacencyList (edge x y)       == [(y, [x])]
[2m[algebraic-graphs] [mOK: rightAdjacencyList (star x ys)      == [(y, [x])  | y <- nub (sort ys)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.evenList ============
[2m[algebraic-graphs] [mOK: evenList []                 == Nil
[2m[algebraic-graphs] [mOK: evenList [(1,2), (3,4)]     == [1, 2, 3, 4] :: List Int Int
[2m[algebraic-graphs] [mOK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.oddList ============
[2m[algebraic-graphs] [mOK: oddList 1 []                 == Cons 1 Nil
[2m[algebraic-graphs] [mOK: oddList 1 [(2,3), (4,5)]     == [1, 2, 3, 4, 5] :: List Int Int
[2m[algebraic-graphs] [mOK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.path ============
[2m[algebraic-graphs] [mOK: path Nil                   == empty
[2m[algebraic-graphs] [mOK: path (Cons x Nil)          == leftVertex x
[2m[algebraic-graphs] [mOK: path (Cons x (Cons y Nil)) == edge x y
[2m[algebraic-graphs] [mOK: path [1, 2, 3, 4, 5]       == edges [(1,2), (3,2), (3,4), (5,4)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.circuit ============
[2m[algebraic-graphs] [mOK: circuit []                    == empty
[2m[algebraic-graphs] [mOK: circuit [(x,y)]               == edge x y
[2m[algebraic-graphs] [mOK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
[2m[algebraic-graphs] [mOK: circuit . reverse             == swap . circuit . map Data.Tuple.swap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.biclique ============
[2m[algebraic-graphs] [mOK: biclique [] [] == empty
[2m[algebraic-graphs] [mOK: biclique xs [] == vertices xs []
[2m[algebraic-graphs] [mOK: biclique [] ys == vertices [] ys
[2m[algebraic-graphs] [mOK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.star ============
[2m[algebraic-graphs] [mOK: star x []    == leftVertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys    == connect (leftVertex x) (vertices [] ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.stars ============
[2m[algebraic-graphs] [mOK: stars []                      == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])]               == leftVertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])]              == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)]               == star x ys
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing executable 'ghcide-test-preprocessor' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding executable 'ghcide-test-preprocessor' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[1 of 1] Compiling Main             ( ghcide-test/preprocessor/Main.hs, dist/build/ghcide-test-preprocessor/ghcide-test-preprocessor-tmp/Main.dyn_o )
[2m[haskell-language-server] [m[2 of 2] Linking dist/build/ghcide-test-preprocessor/ghcide-test-preprocessor
[2m[haskell-language-server] [mPreprocessing library 'hls-code-range-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-code-range-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mOK: star x [y,z]                  == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: stars                         == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.mesh ============
[2m[algebraic-graphs] [mOK: mesh xs []           == empty
[2m[algebraic-graphs] [mOK: mesh [] ys           == empty
[2m[algebraic-graphs] [mOK: mesh [x] [y]         == leftVertex (x,y)
[2m[algebraic-graphs] [mOK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
[2m[algebraic-graphs] [mOK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.removeLeftVertex ============
[2m[algebraic-graphs] [mOK: removeLeftVertex x (leftVertex x)       == empty
[2m[algebraic-graphs] [mOK: removeLeftVertex 1 (leftVertex 2)       == leftVertex 2
[2m[algebraic-graphs] [mOK: removeLeftVertex x (rightVertex y)      == rightVertex y
[2m[algebraic-graphs] [mOK: removeLeftVertex x (edge x y)           == rightVertex y
[2m[algebraic-graphs] [mOK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.removeRightVertex ============
[2m[algebraic-graphs] [mOK: removeRightVertex x (rightVertex x)       == empty
[2m[algebraic-graphs] [mOK: removeRightVertex 1 (rightVertex 2)       == rightVertex 2
[2m[algebraic-graphs] [mOK: removeRightVertex x (leftVertex y)        == leftVertex y
[2m[algebraic-graphs] [mOK: removeRightVertex y (edge x y)            == leftVertex x
[2m[algebraic-graphs] [mOK: removeRightVertex x . removeRightVertex x == removeRightVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)            == vertices [x] [y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y      == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeLeftVertex x  == removeLeftVertex x
[2m[algebraic-graphs] [mOK: removeEdge x y . removeRightVertex y == removeRightVertex y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.bimap ============
[2m[algebraic-graphs] [mOK: bimap f g empty           == empty
[2m[algebraic-graphs] [mOK: bimap f g . vertex        == vertex . Data.Bifunctor.bimap f g
[2m[algebraic-graphs] [mOK: bimap f g (edge x y)      == edge (f x) (g y)
[2m[algebraic-graphs] [mOK: bimap id id               == id
[2m[algebraic-graphs] [mOK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.box ============
[2m[algebraic-graphs] [mOK: box (path [0,1]) (path ['a','b']) == <correct result>
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: box x y                ~~ box y x
[2m[algebraic-graphs] [mOK: box x (box y z)        ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: box x (box y z)        ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: box x (leftVertex ())  ~~ x
[2m[algebraic-graphs] [mOK: box x (rightVertex ()) ~~ swap x
[2m[algebraic-graphs] [mOK: box x empty            ~~ empty
[2m[algebraic-graphs] [mOK: vertexCount (box x y)  <= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (box x y)    <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: box == boxWith (,) (,) (,) (,)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.consistent ============
[2m[algebraic-graphs] [mOK: consistent empty            == True
[2m[algebraic-graphs] [mOK: consistent (vertex x)       == True
[2m[algebraic-graphs] [mOK: consistent (edge x y)       == True
[2m[algebraic-graphs] [mOK: consistent (edges x)        == True
[2m[algebraic-graphs] [mOK: consistent (toBipartite x)  == True
[2m[algebraic-graphs] [mOK: consistent (swap x)         == True
[2m[algebraic-graphs] [mOK: consistent (circuit xs)     == True
[2m[algebraic-graphs] [mOK: consistent (biclique xs ys) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
[2m[algebraic-graphs] [mOK: detectParts empty                                       == Right empty
[2m[algebraic-graphs] [mOK: detectParts (vertex 1)                                  == Right (leftVertex 1)
[2m[algebraic-graphs] [mOK: detectParts (edge 1 1)                                  == Left [1]
[2m[algebraic-graphs] [mOK: detectParts (edge 1 2)                                  == Right (edge 1 2)
[2m[algebraic-graphs] [mOK: detectParts (edge 0 (-1))                               == Right (edge (-1) 0)
[2m[algebraic-graphs] [mOK: detectParts (1 * (2 + 3))                               == Right (edges [(1, 2), (1, 3)])
[2m[algebraic-graphs] [mOK: detectParts ((1 + 3) * (2 + 4) + 6 * 5)                 == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
[2m[algebraic-graphs] [mOK: detectParts ((1 + 2) * (3 + 4) * (5 + 6))               == Left [1, 3, 2, 4, 5]
[2m[algebraic-graphs] [mOK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5)           == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
[2m[algebraic-graphs] [mOK: detectParts (1 * 2 * 3)                                 == Left [2, 3, 1]
[2m[algebraic-graphs] [mOK: detectParts ((1 * 3 * 4) + 2 * (1 + 2))                 == Left [2]
[2m[algebraic-graphs] [mOK: detectParts (clique [1..10])                            == Left [1, 2, 3]
[2m[algebraic-graphs] [mOK: detectParts (circuit [1..11])                           == Left [1..11]
[2m[algebraic-graphs] [mOK: detectParts (circuit [1..10])                           == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
[2m[algebraic-graphs] [mOK: detectParts (biclique [] xs)                            == Right (vertices xs [])
[2m[algebraic-graphs] [mOK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
[2m[algebraic-graphs] [mOK: isRight (detectParts (star x ys))                       == not (elem x ys)
[2m[algebraic-graphs] [mOK: isRight (detectParts (fromBipartite (toBipartite x)))   == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
[2m[algebraic-graphs] [mOK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
[2m[algebraic-graphs] [mOK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
[2m[algebraic-graphs] [mOK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
[2m[algebraic-graphs] [mOK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
[2m[algebraic-graphs] [mOK: show (matching [])                == "matching []"
[2m[algebraic-graphs] [mOK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
[2m[algebraic-graphs] [mOK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
[2m[algebraic-graphs] [mOK: pairOfLeft (matching [])                 == Map.empty
[2m[algebraic-graphs] [mOK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
[2m[algebraic-graphs] [mOK: Map.size . pairOfLeft                    == Map.size . pairOfRight
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
[2m[algebraic-graphs] [mOK: pairOfRight (matching [])                 == Map.empty
[2m[algebraic-graphs] [mOK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
[2m[algebraic-graphs] [mOK: Map.size . pairOfRight                    == Map.size . pairOfLeft
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.matching ============
[2m[algebraic-graphs] [mOK: matching [(1,'a'), (1,'b')]                   == matching [(1,'b')]
[2m[algebraic-graphs] [mOK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
[2m[algebraic-graphs] [mOK: isMatchingOf (matching []) x               == True
[2m[algebraic-graphs] [mOK: isMatchingOf (matching xs) empty           == null xs
[2m[algebraic-graphs] [mOK: isMatchingOf (matching [(x,y)]) (edge x y) == True
[2m[algebraic-graphs] [mOK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
[2m[algebraic-graphs] [mOK: matchingSize (matching [])                 == 0
[2m[algebraic-graphs] [mOK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
[2m[algebraic-graphs] [mOK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
[2m[algebraic-graphs] [mOK: matchingSize (matching xs)                 <= length xs
[2m[algebraic-graphs] [mOK: matchingSize x                             == Map.size . pairOfLeft
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
[2m[algebraic-graphs] [mOK: maxMatching empty                                          == matching []
[2m[algebraic-graphs] [mOK: maxMatching (vertices xs ys)                               == matching []
[2m[algebraic-graphs] [mOK: maxMatching (path [1,2,3,4])                               == matching [(1,2), (3,4)]
[2m[algebraic-graphs] [mOK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
[2m[algebraic-graphs] [mOK: matchingSize (maxMatching (star x (y:ys)))                 == 1
[2m[algebraic-graphs] [mOK: matchingSize (maxMatching (biclique xs ys))                == min (length (nub xs)) (length (nub ys))
[2m[algebraic-graphs] [mOK: isMatchingOf (maxMatching x) x                             == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
[2m[algebraic-graphs] [mOK: isVertexCoverOf (xs             , ys             ) empty          == Set.null xs && Set.null ys
[2m[algebraic-graphs] [mOK: isVertexCoverOf (xs             , ys             ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
[2m[algebraic-graphs] [mOK: isVertexCoverOf (Set.empty      , Set.empty      ) (edge x y)     == False
[2m[algebraic-graphs] [mOK: isVertexCoverOf (Set.singleton x, ys             ) (edge x y)     == Set.isSubsetOf ys (Set.singleton y)
[2m[algebraic-graphs] [mOK: isVertexCoverOf (xs             , Set.singleton y) (edge x y)     == Set.isSubsetOf xs (Set.singleton x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
[2m[algebraic-graphs] [mOK: minVertexCover empty                              == (Set.empty, Set.empty)
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mOK: minVertexCover (vertices xs ys)                   == (Set.empty, Set.empty)
[2m[algebraic-graphs] [mOK: minVertexCover (path [1,2,3])                     == (Set.empty, Set.singleton 2)
[2m[algebraic-graphs] [mOK: minVertexCover (star x (1:2:ys))                  == (Set.singleton x, Set.empty)
[2m[algebraic-graphs] [mOK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
[2m[algebraic-graphs] [mOK: vertexCoverSize . minVertexCover                  == matchingSize . maxMatching
[2m[algebraic-graphs] [mOK: isVertexCoverOf (minVertexCover x) x              == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
[2m[algebraic-graphs] [mOK: isIndependentSetOf (xs             , ys             ) empty          == Set.null xs && Set.null ys
[2m[algebraic-graphs] [mOK: isIndependentSetOf (xs             , ys             ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
[2m[algebraic-graphs] [mOK: isIndependentSetOf (Set.empty      , Set.empty      ) (edge x y)     == True
[2m[algebraic-graphs] [mOK: isIndependentSetOf (Set.singleton x, ys             ) (edge x y)     == Set.null ys
[2m[algebraic-graphs] [mOK: isIndependentSetOf (xs             , Set.singleton y) (edge x y)     == Set.null xs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
[2m[algebraic-graphs] [mOK: maxIndependentSet empty                                 == (Set.empty, Set.empty)
[2m[algebraic-graphs] [mOK: maxIndependentSet (vertices xs ys)                      == (Set.fromList xs, Set.fromList ys)
[2m[algebraic-graphs] [mOK: maxIndependentSet (path [1,2,3])                        == (Set.fromList [1,3], Set.empty)
[2m[algebraic-graphs] [mOK: maxIndependentSet (star x (1:2:ys))                     == (Set.empty, Set.fromList (1:2:ys))
[2m[algebraic-graphs] [mOK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
[2m[algebraic-graphs] [mOK: independentSetSize (maxIndependentSet x)                == vertexCount x - vertexCoverSize (minVertexCover x)
[2m[algebraic-graphs] [mOK: isIndependentSetOf (maxIndependentSet x) x              == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
[2m[algebraic-graphs] [mOK: augmentingPath (matching [])      empty            == Left (Set.empty, Set.empty)
[2m[algebraic-graphs] [mOK: augmentingPath (matching [])      (edge 1 2)       == Right [1,2]
[2m[algebraic-graphs] [mOK: augmentingPath (matching [(1,2)]) (path [1,2,3])   == Left (Set.empty, Set.singleton 2)
[2m[algebraic-graphs] [mOK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
[2m[algebraic-graphs] [mOK: isLeft (augmentingPath (maxMatching x) x)          == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
[2m[algebraic-graphs] [mOK: consistentMatching (matching xs)   == True
[2m[algebraic-graphs] [mOK: consistentMatching (maxMatching x) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Eq ============
[2m[algebraic-graphs] [mOK: mempty /= literal ""
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Ord ============
[2m[algebraic-graphs] [mOK: mempty <  literal ""
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty mempty       == True
[2m[algebraic-graphs] [mOK: isEmpty (literal "") == False
[2m[algebraic-graphs] [mOK: isEmpty x            == (x == mempty)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.literal ============
[2m[algebraic-graphs] [mOK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
[2m[algebraic-graphs] [mOK: literal "I am just a string literal"  == "I am just a string literal"
[2m[algebraic-graphs] [mOK: render . literal                      == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.render ============
[2m[algebraic-graphs] [mOK: render (literal "al" <> literal "ga") == "alga"
[2m[algebraic-graphs] [mOK: render mempty                         == mempty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.<+> ============
[2m[algebraic-graphs] [mOK: x <+> mempty         == x
[2m[algebraic-graphs] [mOK: mempty <+> x         == x
[2m[algebraic-graphs] [mOK: x <+> (y <+> z)      == (x <+> y) <+> z
[2m[algebraic-graphs] [mOK: "name" <+> "surname" == "name surname"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.brackets ============
[2m[algebraic-graphs] [mOK: brackets "i"    == "[i]"
[2m[algebraic-graphs] [mOK: brackets mempty == "[]"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.doubleQuotes ============
[2m[algebraic-graphs] [mOK: doubleQuotes "/path/with spaces"   == "\"/path/with spaces\""
[2m[algebraic-graphs] [mOK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.indent ============
[2m[algebraic-graphs] [mOK: indent 0        == id
[2m[algebraic-graphs] [mOK: indent 1 mempty == " "
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.unlines ============
[2m[algebraic-graphs] [mOK: unlines []                    == mempty
[2m[algebraic-graphs] [mOK: unlines [mempty]              == "\n"
[2m[algebraic-graphs] [mOK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.export ============
[2m[algebraic-graphs] [mOK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Dot.export ============
[2m[algebraic-graphs] [mOK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m=========== Export.Dot.attributeQuoting ============
[2m[algebraic-graphs] [mOK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Dot.exportAsIs ============
[2m[algebraic-graphs] [mOK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Dot.exportViaShow ============
[2m[algebraic-graphs] [mOK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph ============
[2m[algebraic-graphs] [mOK: Axioms of graphs
[2m[algebraic-graphs] [mOK: Theorems of graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 3
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.connect ============
[2m[algebraic-graphs] [mOK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edges ============
[2m[algebraic-graphs] [mOK: edges []          == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)]     == edge x y
[2m[algebraic-graphs] [mOK: edges             == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.connects ============
[2m[algebraic-graphs] [mOK: connects []        == empty
[2m[algebraic-graphs] [mOK: connects [x]       == x
[2m[algebraic-graphs] [mOK: connects [x,y]     == connect x y
[2m[algebraic-graphs] [mOK: connects           == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty         x             ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x)    empty         ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs)     (circuit xs)  ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph                    == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg                      == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty                    == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size                       == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x                == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount                == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount                  == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList                 == Set.toAscList . vertexSet
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mOK: edgeList                   == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap             == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap          == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay connect        == id
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1     (const 1)     (+)     (+)            == size
[2m[algebraic-graphs] [mOK: foldg True  (const False) (&&)    (&&)           == isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                       == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty)       == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                  == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty      == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount            == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex   == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique   == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty          == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)     == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y)     == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges        == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges    == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty          == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x)     == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.preIntSet ============
[2m[algebraic-graphs] [mOK: preIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet 1 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet y (edge x y) == IntSet.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.postIntSet ============
[2m[algebraic-graphs] [mOK: postIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet 2 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (edge x y) == IntSet.fromList [y]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.size ============
[2m[algebraic-graphs] [mOK: size empty         == 1
[2m[algebraic-graphs] [mOK: size (vertex x)    == 1
[2m[algebraic-graphs] [mOK: size (overlay x y) == size x + size y
[2m[algebraic-graphs] [mOK: size (connect x y) == size x + size y
[2m[algebraic-graphs] [mOK: size x             >= 1
[2m[algebraic-graphs] [mOK: size x             >= vertexCount x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.path ============
[2m[algebraic-graphs] [mOK: path []    == empty
[2m[algebraic-graphs] [mOK: path [x]   == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.circuit ============
[2m[algebraic-graphs] [mOK: circuit []    == empty
[2m[algebraic-graphs] [mOK: circuit [x]   == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.clique ============
[2m[algebraic-graphs] [mOK: clique []         == empty
[2m[algebraic-graphs] [mOK: clique [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.biclique ============
[2m[algebraic-graphs] [mOK: biclique []      []      == empty
[2m[algebraic-graphs] [mOK: biclique [x]     []      == vertex x
[2m[algebraic-graphs] [mOK: biclique []      [y]     == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs      ys      == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys    == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.stars ============
[2m[algebraic-graphs] [mOK: stars []                      == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])]               == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])]              == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)]               == star x ys
[2m[algebraic-graphs] [mOK: stars                         == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList         == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.forest ============
[2m[algebraic-graphs] [mOK: forest []                                                  == empty
[2m[algebraic-graphs] [mOK: forest [x]                                                 == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest                                                     == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [mOK: size (removeEdge x y z)         <= 3 * size z
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty       == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x)  == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y)  == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose  == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty      == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id           == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g   == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing)                               == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing)                        == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just                                    == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.compose ============
[2m[algebraic-graphs] [mOK: compose empty            x                == empty
[2m[algebraic-graphs] [mOK: compose x                empty            == empty
[2m[algebraic-graphs] [mOK: compose (vertex x)       y                == empty
[2m[algebraic-graphs] [mOK: compose x                (vertex y)       == empty
[2m[algebraic-graphs] [mOK: compose x                (compose y z)    == compose (compose x y) z
[2m[algebraic-graphs] [mOK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
[2m[algebraic-graphs] [mOK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
[2m[algebraic-graphs] [mOK: compose (edge x y)       (edge y z)       == edge x z
[2m[algebraic-graphs] [mOK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
[2m[algebraic-graphs] [mOK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
[2m[algebraic-graphs] [mOK: size (compose x y)                        <= edgeCount x + edgeCount y + 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.(===) ============
[2m[algebraic-graphs] [mOK:     x === x         == True
[2m[algebraic-graphs] [mOK:     x === x + empty == False
[2m[algebraic-graphs] [mOK: x + y === x + y     == True
[2m[algebraic-graphs] [mOK: 1 + 2 === 2 + 1     == False
[2m[algebraic-graphs] [mOK: x + y === x * y     == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.mesh ============
[2m[algebraic-graphs] [mOK: mesh xs     []    == empty
[2m[algebraic-graphs] [mOK: mesh []     ys    == empty
[2m[algebraic-graphs] [mOK: mesh [x]    [y]   == vertex (x, y)
[2m[algebraic-graphs] [mOK: mesh xs     ys    == box (path xs) (path ys)
[2m[algebraic-graphs] [mOK: mesh [1..3] "ab"  == <correct result>
[2m[algebraic-graphs] [mOK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.torus ============
[2m[algebraic-graphs] [mOK: torus xs     []    == empty
[2m[algebraic-graphs] [mOK: torus []     ys    == empty
[2m[algebraic-graphs] [mOK: torus [x]    [y]   == edge (x,y) (x,y)
[2m[algebraic-graphs] [mOK: torus xs     ys    == box (circuit xs) (circuit ys)
[2m[algebraic-graphs] [mOK: torus [1,2]  "ab"  == <correct result>
[2m[algebraic-graphs] [mOK: size (torus xs ys) == max 1 (3 * length xs * length ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.deBruijn ============
[2m[algebraic-graphs] [mOK:           deBruijn 0 xs               == edge [] []
[2m[algebraic-graphs] [mOK: n > 0 ==> deBruijn n []               == empty
[2m[algebraic-graphs] [mOK:           deBruijn 1 [0,1]            == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
[2m[algebraic-graphs] [mOK:           deBruijn 2 "0"              == edge "00" "00"
[2m[algebraic-graphs] [mOK:           deBruijn 2 "01"             == <correct result>
[2m[algebraic-graphs] [mOK:           transpose   (deBruijn n xs) == gmap reverse $ deBruijn n xs
[2m[algebraic-graphs] [mOK:           vertexCount (deBruijn n xs) == (length $ nub xs)^n
[2m[algebraic-graphs] [mOK: n > 0 ==> edgeCount   (deBruijn n xs) == (length $ nub xs)^(n + 1)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.splitVertex ============
[2m[algebraic-graphs] [mOK: splitVertex x []                   == removeVertex x
[2m[algebraic-graphs] [mOK: splitVertex x [x]                  == id
[2m[algebraic-graphs] [mOK: splitVertex x [y]                  == replaceVertex x y
[2m[algebraic-graphs] [mOK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.bind ============
[2m[algebraic-graphs] [mOK: bind empty f         == empty
[2m[algebraic-graphs] [mOK: bind (vertex x) f    == f x
[2m[algebraic-graphs] [mOK: bind (edge x y) f    == connect (f x) (f y)
[2m[algebraic-graphs] [mOK: bind (vertices xs) f == overlays (map f xs)
[2m[algebraic-graphs] [mOK: bind x (const empty) == empty
[2m[algebraic-graphs] [mOK: bind x vertex        == x
[2m[algebraic-graphs] [mOK: bind (bind x f) g    == bind x (\y -> bind (f y) g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.simplify ============
[2m[algebraic-graphs] [mOK: simplify              == id
[2m[algebraic-graphs] [mOK: size (simplify x)     <= size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.box ============
[2m[algebraic-graphs] [mOK: box x y               ~~ box y x
[2m[algebraic-graphs] [mOK: box x (overlay y z)   == overlay (box x y) (box x z)
[2m[algebraic-graphs] [mOK: box x (vertex ())     ~~ x
[2m[algebraic-graphs] [mOK: box x empty           ~~ empty
[2m[algebraic-graphs] [mOK: box x (box y z)       ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: transpose   (box x y) == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: vertexCount (box x y) == vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.sparsify ============
[2m[algebraic-graphs] [mOK: sort . reachable x       == sort . rights . reachable (sparsify x) . Right
[2m[algebraic-graphs] [mOK: vertexCount (sparsify x) <= vertexCount x + size x + 1
[2m[algebraic-graphs] [mOK: edgeCount   (sparsify x) <= 3 * size x
[2m[algebraic-graphs] [mOK: size        (sparsify x) <= 3 * size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.sparsifyKL ============
[2m[algebraic-graphs] [mOK: sort . reachable x                 == sort . filter (<= n) . reachable (sparsifyKL n x)
[2m[algebraic-graphs] [mOK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
[2m[algebraic-graphs] [mOK: length (edges    $ sparsifyKL n x) <= 3 * size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.context ============
[2m[algebraic-graphs] [mOK: context (const False) x                   == Nothing
[2m[algebraic-graphs] [mOK: context (== 1)        (edge 1 2)          == Just (Context [   ] [2  ])
[2m[algebraic-graphs] [mOK: context (== 2)        (edge 1 2)          == Just (Context [1  ] [   ])
[2m[algebraic-graphs] [mOK: context (const True ) (edge 1 2)          == Just (Context [1  ] [2  ])
[2m[algebraic-graphs] [mOK: context (== 4)        (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.buildg ============
[2m[algebraic-graphs] [mOK: buildg (\e _ _ _ -> e)                                     == empty
[2m[algebraic-graphs] [mOK: buildg (\_ v _ _ -> v x)                                   == vertex x
[2m[algebraic-graphs] [mOK: buildg (\e v o c -> o (foldg e v o c x) (foldg e v o c y)) == overlay x y
[2m[algebraic-graphs] [mOK: buildg (\e v o c -> c (foldg e v o c x) (foldg e v o c y)) == connect x y
[2m[algebraic-graphs] [mOK: buildg (\e v o _ -> foldr o e (map v xs))                  == vertices xs
[2m[algebraic-graphs] [mOK: buildg (\e v o c -> foldg e v o (flip c) g)                == transpose g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Internal.List ============
[2m[algebraic-graphs] [mOK: pure 1 <> pure 4 == [1, 4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Label ============
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Any: instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: StarSemiring
[2m[algebraic-graphs] [mOK: Dioid
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Distance Int: instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: StarSemiring
[2m[algebraic-graphs] [mOK: Dioid
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Capacity Int: instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: StarSemiring
[2m[algebraic-graphs] [mOK: Dioid
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Minimum (Path Int): instances ============
[2m[algebraic-graphs] [mOK: LeftNearRing
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ PowerSet (Path Int): instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: Dioid
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Count Int: instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: StarSemiring
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.consistent ============
[2m[algebraic-graphs] [mOK: arbitraryLabelledAdjacencyMap
[2m[algebraic-graphs] [mOK: empty
[2m[algebraic-graphs] [mOK: vertex
[2m[algebraic-graphs] [mOK: edge
[2m[algebraic-graphs] [mOK: overlay
[2m[algebraic-graphs] [mOK: connect
[2m[algebraic-graphs] [mOK: vertices
[2m[algebraic-graphs] [mOK: edges
[2m[algebraic-graphs] [mOK: overlays
[2m[algebraic-graphs] [mOK: fromAdjacencyMaps
[2m[algebraic-graphs] [mOK: removeVertex
[2m[algebraic-graphs] [mOK: removeEdge
[2m[algebraic-graphs] [mOK: replaceVertex
[2m[algebraic-graphs] [mOK: replaceEdge
[2m[algebraic-graphs] [mOK: transpose
[2m[algebraic-graphs] [mOK: gmap
[2m[algebraic-graphs] [mOK: emap
[2m[algebraic-graphs] [mOK: induce
[2m[algebraic-graphs] [mOK: closure
[2m[algebraic-graphs] [mOK: reflexiveClosure
[2m[algebraic-graphs] [mOK: symmetricClosure
[2m[algebraic-graphs] [mOK: transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edge ============
[2m[algebraic-graphs] [mOK: edge e    x y              == connect e (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: edge zero x y              == vertices [x,y]
[2m[algebraic-graphs] [mOK: hasEdge   x y (edge e x y) == (e /= mempty)
[2m[algebraic-graphs] [mOK: edgeLabel x y (edge e x y) == e
[2m[algebraic-graphs] [mOK: edgeCount     (edge e x y) == if e == mempty then 0 else 1
[2m[algebraic-graphs] [mOK: vertexCount   (edge e 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount   (edge e 1 2) == 2
[2m[algebraic-graphs] [mOK: x -<e>- y                  == edge e x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
[2m[algebraic-graphs] [mOK: edgeLabel x y $ overlay (edge e x y) (edge f    x y) == e <+> f
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
[2m[algebraic-graphs] [mOK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f   2 3)) == e <.> f
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.connect ============
[2m[algebraic-graphs] [mOK: isEmpty     (connect e x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect e x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect e 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect e 1 2) == if e == zero then 0 else 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edges ============
[2m[algebraic-graphs] [mOK: edges []        == empty
[2m[algebraic-graphs] [mOK: edges [(e,x,y)] == edge e x y
[2m[algebraic-graphs] [mOK: edges           == overlays . map (\(e, x, y) -> edge e x y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
[2m[algebraic-graphs] [mOK: fromAdjacencyMaps []                                  == empty
[2m[algebraic-graphs] [mOK: fromAdjacencyMaps [(x, Map.empty)]                    == vertex x
[2m[algebraic-graphs] [mOK: fromAdjacencyMaps [(x, Map.singleton y e)]            == if e == zero then vertices [x,y] else edge e x y
[2m[algebraic-graphs] [mOK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty      x     ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x) empty ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x y              ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                         == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty)         == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                    == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x)   == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge e x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge e x y)     == (e /= zero)
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edgeLabel ============
[2m[algebraic-graphs] [mOK: edgeLabel x y empty         == zero
[2m[algebraic-graphs] [mOK: edgeLabel x y (vertex z)    == zero
[2m[algebraic-graphs] [mOK: edgeLabel x y (edge e x y)  == e
[2m[algebraic-graphs] [mOK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty        == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x)   == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge e x y) == if e == zero then 0 else 1
[2m[algebraic-graphs] [mOK: edgeCount              == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty        == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)   == []
[2m[algebraic-graphs] [mOK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty        == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x)   == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty        == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x)   == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge e 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty        == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x)   == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge e 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.skeleton ============
[2m[algebraic-graphs] [mOK: hasEdge x y == hasEdge x y . skeleton
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge e x x)     == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge e 1 2)     == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge e x y)     == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == gmap (\v -> if v == x then y else v)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.replaceEdge ============
[2m[algebraic-graphs] [mOK: replaceEdge e x y z                 == overlay (removeEdge x y z) (edge e x y)
[2m[algebraic-graphs] [mOK: replaceEdge e x y (edge f x y)      == edge e x y
[2m[algebraic-graphs] [mOK: edgeLabel x y (replaceEdge e x y z) == e
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty        == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x)   == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge e x y) == edge e y x
[2m[algebraic-graphs] [mOK: transpose . transpose  == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty        == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x)   == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge e x y) == edge e (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id             == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g     == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.emap ============
[2m[algebraic-graphs] [mOK: emap h empty           == empty
[2m[algebraic-graphs] [mOK: emap h (vertex x)      == vertex x
[2m[algebraic-graphs] [mOK: emap h (edge e x y)    == edge (h e) x y
[2m[algebraic-graphs] [mOK: emap h (overlay x y)   == overlay (emap h x) (emap h y)
[2m[algebraic-graphs] [mOK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
[2m[algebraic-graphs] [mOK: emap id                == id
[2m[algebraic-graphs] [mOK: emap g . emap h        == emap (g . h)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.induceJust ============
[2m[haskell-language-server] [mPreprocessing library 'hls-notes-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-notes-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing)                               == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing)                        == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just                                    == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.closure ============
[2m[algebraic-graphs] [mOK: closure empty         == empty
[2m[algebraic-graphs] [mOK: closure (vertex x)    == edge one x x
[2m[algebraic-graphs] [mOK: closure (edge e x x)  == edge one x x
[2m[algebraic-graphs] [mOK: closure (edge e x y)  == edges [(one,x,x), (e,x,y), (one,y,y)]
[2m[algebraic-graphs] [mOK: closure               == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure               == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure     == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y) == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty              == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x)         == edge one x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge e x x)       == edge one x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge e x y)       == edges [(one,x,x), (e,x,y), (one,y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty              == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x)         == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge e x y)       == edges [(e,x,y), (e,y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x                  == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty               == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x)          == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge e x y)        == edge e x y
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edge ============
[2m[algebraic-graphs] [mOK: edge e    x y              == connect e (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: edge zero x y              == vertices [x,y]
[2m[algebraic-graphs] [mOK: hasEdge   x y (edge e x y) == (e /= mempty)
[2m[algebraic-graphs] [mOK: edgeLabel x y (edge e x y) == e
[2m[algebraic-graphs] [mOK: edgeCount     (edge e x y) == if e == mempty then 0 else 1
[2m[algebraic-graphs] [mOK: vertexCount   (edge e 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount   (edge e 1 2) == 2
[2m[algebraic-graphs] [mOK: x -<e>- y                  == edge e x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
[2m[algebraic-graphs] [mOK: edgeLabel x y $ overlay (edge e x y) (edge f    x y) == e <+> f
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
[2m[algebraic-graphs] [mOK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f   2 3)) == e <.> f
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.connect ============
[2m[algebraic-graphs] [mOK: isEmpty     (connect e x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect e x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect e 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect e 1 2) == if e == zero then 0 else 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edges ============
[2m[algebraic-graphs] [mOK: edges []        == empty
[2m[algebraic-graphs] [mOK: edges [(e,x,y)] == edge e x y
[2m[algebraic-graphs] [mOK: edges           == overlays . map (\(e, x, y) -> edge e x y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty     vertex        connect             == id
[2m[algebraic-graphs] [mOK: foldg empty     vertex        (fmap flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1         (const 1)     (const (+))         == size
[2m[algebraic-graphs] [mOK: foldg True      (const False) (const (&&))        == isEmpty
[2m[algebraic-graphs] [mOK: foldg False     (== x)        (const (||))        == hasVertex x
[2m[algebraic-graphs] [mOK: foldg Set.empty Set.singleton (const Set.union)   == vertexSet
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.buildg ============
[2m[algebraic-graphs] [mOK: buildg (\e _ _ -> e)                                   == empty
[2m[algebraic-graphs] [mOK: buildg (\_ v _ -> v x)                                 == vertex x
[2m[algebraic-graphs] [mOK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
[2m[algebraic-graphs] [mOK: buildg (\e v c -> foldr (c zero) e (map v xs))         == vertices xs
[2m[algebraic-graphs] [mOK: buildg (\e v c -> foldg e v (flip c) g)                == transpose g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty      x     ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x) empty ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x y              ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                         == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty)         == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                    == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x)   == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge e x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.size ============
[2m[algebraic-graphs] [mOK: size empty         == 1
[2m[algebraic-graphs] [mOK: size (vertex x)    == 1
[2m[algebraic-graphs] [mOK: size (overlay x y) == size x + size y
[2m[algebraic-graphs] [mOK: size (connect x y) == size x + size y
[2m[algebraic-graphs] [mOK: size x             >= 1
[2m[algebraic-graphs] [mOK: size x             >= vertexCount x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge e x y)     == (e /= zero)
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edgeLabel ============
[2m[algebraic-graphs] [mOK: edgeLabel x y empty         == zero
[2m[algebraic-graphs] [mOK: edgeLabel x y (vertex z)    == zero
[2m[algebraic-graphs] [mOK: edgeLabel x y (edge e x y)  == e
[2m[algebraic-graphs] [mOK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty        == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x)   == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge e x y) == if e == zero then 0 else 1
[2m[algebraic-graphs] [mOK: edgeCount              == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty        == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)   == []
[2m[algebraic-graphs] [mOK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty        == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x)   == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty        == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x)   == Set.empty
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mOK: preSet 1 (edge e 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty        == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x)   == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge e 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge e x x)     == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge e 1 2)     == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge e x y)     == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == fmap (\v -> if v == x then y else v)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.replaceEdge ============
[2m[algebraic-graphs] [mOK: replaceEdge e x y z                 == overlay (removeEdge x y z) (edge e x y)
[2m[algebraic-graphs] [mOK: replaceEdge e x y (edge f x y)      == edge e x y
[2m[algebraic-graphs] [mOK: edgeLabel x y (replaceEdge e x y z) == e
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty        == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x)   == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge e x y) == edge e y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.fmap ============
[2m[algebraic-graphs] [mOK: fmap f empty        == empty
[2m[algebraic-graphs] [mOK: fmap f (vertex x)   == vertex (f x)
[2m[algebraic-graphs] [mOK: fmap f (edge e x y) == edge e (f x) (f y)
[2m[algebraic-graphs] [mOK: fmap id             == id
[2m[algebraic-graphs] [mOK: fmap f . fmap g     == fmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.emap ============
[2m[algebraic-graphs] [mOK: emap h empty           == empty
[2m[algebraic-graphs] [mOK: emap h (vertex x)      == vertex x
[2m[algebraic-graphs] [mOK: emap h (edge e x y)    == edge (h e) x y
[2m[algebraic-graphs] [mOK: emap h (overlay x y)   == overlay (emap h x) (emap h y)
[2m[algebraic-graphs] [mOK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
[2m[algebraic-graphs] [mOK: emap id                == id
[2m[algebraic-graphs] [mOK: emap g . emap h        == emap (g . h)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing)                               == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing)                        == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just                                    == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.closure ============
[2m[algebraic-graphs] [mOK: closure empty         == empty
[2m[algebraic-graphs] [mOK: closure (vertex x)    == edge one x x
[2m[algebraic-graphs] [mOK: closure (edge e x x)  == edge one x x
[2m[algebraic-graphs] [mOK: closure (edge e x y)  == edges [(one,x,x), (e,x,y), (one,y,y)]
[2m[algebraic-graphs] [mOK: closure               == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure               == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure     == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y) == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty              == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x)         == edge one x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge e x x)       == edge one x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge e x y)       == edges [(one,x,x), (e,x,y), (one,y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty              == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x)         == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge e x y)       == edges [(e,x,y), (e,y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x                  == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty               == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x)          == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge e x y)        == edge e x y
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.context ============
[2m[algebraic-graphs] [mOK: context (const False) x                   == Nothing
[2m[algebraic-graphs] [mOK: context (== 1)        (edge e 1 2)        == if e == zero then Just (Context [] []) else Just (Context []      [(e,2)])
[2m[algebraic-graphs] [mOK: context (== 2)        (edge e 1 2)        == if e == zero then Just (Context [] []) else Just (Context [(e,1)] []     )
[2m[algebraic-graphs] [mOK: context (const True ) (edge e 1 2)        == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
[2m[algebraic-graphs] [mOK: context (== 4)        (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap ============
[2m[algebraic-graphs] [mOK: Axioms of non-empty graphs
[2m[algebraic-graphs] [mOK: Theorems of non-empty graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Ord (NonEmpty.AdjacencyMap a) ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 3
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Show (NonEmpty.AdjacencyMap a) ============
[2m[algebraic-graphs] [mOK: show (1         :: AdjacencyMap Int) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2     :: AdjacencyMap Int) == "vertices1 [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2     :: AdjacencyMap Int) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [mOK: show (vertex (-1)                             :: AdjacencyMap Int) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2)               :: AdjacencyMap Int) == "vertices1 [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-1) * vertex (-2)               :: AdjacencyMap Int) == "edge (-1) (-2)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
[2m[algebraic-graphs] [mOK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.toNonEmpty ============
[2m[algebraic-graphs] [mOK: toNonEmpty empty          == Nothing
[2m[algebraic-graphs] [mOK: toNonEmpty . fromNonEmpty == Just
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.fromNonEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty . fromNonEmpty    == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.overlay ============
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.connect ============
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertices1 ============
[2m[algebraic-graphs] [mOK: vertices1 [x]           == vertex x
[2m[algebraic-graphs] [mOK: hasVertex x . vertices1 == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices1 == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices1 == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edges1 ============
[2m[algebraic-graphs] [mOK: edges1 [(x,y)]     == edge x y
[2m[algebraic-graphs] [mOK: edges1             == overlays1 . fmap (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges1 == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.overlays1 ============
[2m[algebraic-graphs] [mOK: overlays1 [x]   == x
[2m[algebraic-graphs] [mOK: overlays1 [x,y] == overlay x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.connects1 ============
[2m[algebraic-graphs] [mOK: connects1 [x]   == x
[2m[algebraic-graphs] [mOK: connects1 [x,y] == connect x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path1 xs)    (circuit1 xs) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount x          >= 1
[2m[algebraic-graphs] [mOK: vertexCount            == length . vertexList1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount            == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertexList1 ============
[2m[algebraic-graphs] [mOK: vertexList1 (vertex x)  == [x]
[2m[algebraic-graphs] [mOK: vertexList1 . vertices1 == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList (vertex x)     == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y)     == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges1       == nub . sort . toList
[2m[algebraic-graphs] [mOK: edgeList . transpose    == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet . vertex    == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices1 == Set.fromList . toList
[2m[algebraic-graphs] [mOK: vertexSet . clique1   == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges1   == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.path1 ============
[2m[algebraic-graphs] [mOK: path1 [x]       == vertex x
[2m[algebraic-graphs] [mOK: path1 [x,y]     == edge x y
[2m[algebraic-graphs] [mOK: path1 . reverse == transpose . path1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.circuit1 ============
[2m[algebraic-graphs] [mOK: circuit1 [x]       == edge x x
[2m[algebraic-graphs] [mOK: circuit1 [x,y]     == edges1 [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: circuit1 . reverse == transpose . circuit1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.clique1 ============
[2m[algebraic-graphs] [mOK: clique1 [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique1 [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique1 [x,y,z]    == edges1 [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
[2m[algebraic-graphs] [mOK: clique1 . reverse  == transpose . clique1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.biclique1 ============
[2m[algebraic-graphs] [mOK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique1 xs      ys      == connect (vertices1 xs) (vertices1 ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges1 [(x,y), (x,z)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.stars1 ============
[2m[algebraic-graphs] [mOK: stars1 [(x, [] )]               == vertex x
[2m[algebraic-graphs] [mOK: stars1 [(x, [y])]               == edge x y
[2m[algebraic-graphs] [mOK: stars1 [(x, ys )]               == star x ys
[2m[algebraic-graphs] [mOK: stars1                          == overlays1 . fmap (uncurry star)
[2m[algebraic-graphs] [mOK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path1 [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.removeVertex1 ============
[2m[algebraic-graphs] [mOK: removeVertex1 x (vertex x)          == Nothing
[2m[algebraic-graphs] [mOK: removeVertex1 1 (vertex 2)          == Just (vertex 2)
[2m[algebraic-graphs] [mOK: removeVertex1 x (edge x x)          == Nothing
[2m[algebraic-graphs] [mOK: removeVertex1 1 (edge 1 2)          == Just (vertex 2)
[2m[algebraic-graphs] [mOK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices1 [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose (vertex x)  == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y)  == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose  == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.gmap ============
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id           == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g   == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.induce1 ============
[2m[algebraic-graphs] [mOK: induce1 (const True ) x == Just x
[2m[algebraic-graphs] [mOK: induce1 (const False) x == Nothing
[2m[algebraic-graphs] [mOK: induce1 (/= x)          == removeVertex1 x
[2m[algebraic-graphs] [mOK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.induceJust1 ============
[2m[algebraic-graphs] [mOK: induceJust1 (vertex Nothing)                               == Nothing
[2m[algebraic-graphs] [mOK: induceJust1 (edge (Just x) Nothing)                        == Just (vertex x)
[2m[algebraic-graphs] [mOK: induceJust1 . gmap Just                                    == Just
[2m[algebraic-graphs] [mOK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.closure ============
[2m[algebraic-graphs] [mOK: closure (vertex x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x y)      == edges1 [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
[2m[algebraic-graphs] [mOK: closure                 == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure                 == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure       == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y)   == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x y)         == edges1 [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x)         == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge x y)         == edges1 [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x                  == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x)          == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge x y)          == edge x y
[2m[algebraic-graphs] [mOK: transitiveClosure (path1 $ nub xs)    == clique1 (nub $ xs)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.============
[2m[algebraic-graphs] [mOK: Axioms of non-empty graphs
[2m[algebraic-graphs] [mOK: Theorems of non-empty graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Ord (NonEmpty.Graph a) ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 3
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Functor (NonEmpty.Graph a) ============
[2m[algebraic-graphs] [mOK: fmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: fmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: fmap id           == id
[2m[algebraic-graphs] [mOK: fmap f . fmap g   == fmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Monad (NonEmpty.Graph a) ============
[2m[algebraic-graphs] [mOK: (vertex x >>= f)     == f x
[2m[algebraic-graphs] [mOK: (edge x y >>= f)     == connect (f x) (f y)
[2m[algebraic-graphs] [mOK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
[2m[algebraic-graphs] [mOK: (x >>= vertex)       == x
[2m[algebraic-graphs] [mOK: ((x >>= f) >>= g)    == (x >>= (\y -> (f y) >>= g))
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.toNonEmpty ============
[2m[algebraic-graphs] [mOK: toNonEmpty empty       == Nothing
[2m[algebraic-graphs] [mOK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertex ============
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [mOK: size        (vertex x) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.overlay ============
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: size        (overlay x y) == size x        + size y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.overlay1 ============
[2m[algebraic-graphs] [mOK:                overlay1 empty x == x
[2m[algebraic-graphs] [mOK: x /= empty ==> overlay1 x     y == overlay (fromJust $ toNonEmpty x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.connect ============
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: size        (connect x y) == size x        + size y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertices1 ============
[2m[algebraic-graphs] [mOK: vertices1 [x]           == vertex x
[2m[algebraic-graphs] [mOK: hasVertex x . vertices1 == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices1 == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices1 == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edges1 ============
[2m[algebraic-graphs] [mOK: edges1 [(x,y)]     == edge x y
[2m[algebraic-graphs] [mOK: edges1             == overlays1 . fmap (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges1 == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.overlays1 ============
[2m[algebraic-graphs] [mOK: overlays1 [x]   == x
[2m[algebraic-graphs] [mOK: overlays1 [x,y] == overlay x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.connects1 ============
[2m[algebraic-graphs] [mOK: connects1 [x]   == x
[2m[algebraic-graphs] [mOK: connects1 [x,y] == connect x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.foldg1 ============
[2m[algebraic-graphs] [mOK: foldg1 vertex    overlay connect        == id
[2m[algebraic-graphs] [mOK: foldg1 vertex    overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg1 (const 1) (+)     (+)            == size
[2m[algebraic-graphs] [mOK: foldg1 (== x)    (||)    (||)           == hasVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path1 xs)    (circuit1 xs) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.(===) ============
[2m[algebraic-graphs] [mOK:     x === x     == True
[2m[algebraic-graphs] [mOK: x + y === x + y == True
[2m[algebraic-graphs] [mOK: 1 + 2 === 2 + 1 == False
[2m[algebraic-graphs] [mOK: x + y === x * y == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.size ============
[2m[algebraic-graphs] [mOK: size (vertex x)    == 1
[2m[algebraic-graphs] [mOK: size (overlay x y) == size x + size y
[2m[algebraic-graphs] [mOK: size (connect x y) == size x + size y
[2m[algebraic-graphs] [mOK: size x             >= 1
[2m[algebraic-graphs] [mOK: size x             >= vertexCount x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount x          >= 1
[2m[algebraic-graphs] [mOK: vertexCount            == length . vertexList1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount            == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertexList1 ============
[2m[algebraic-graphs] [mOK: vertexList1 (vertex x)  == [x]
[2m[algebraic-graphs] [mOK: vertexList1 . vertices1 == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList (vertex x)     == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y)     == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges1       == nub . sort . toList
[2m[algebraic-graphs] [mOK: edgeList . transpose    == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet . vertex    == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices1 == Set.fromList . toList
[2m[algebraic-graphs] [mOK: vertexSet . clique1   == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges1   == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.path1 ============
[2m[algebraic-graphs] [mOK: path1 [x]       == vertex x
[2m[algebraic-graphs] [mOK: path1 [x,y]     == edge x y
[2m[algebraic-graphs] [mOK: path1 . reverse == transpose . path1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.circuit1 ============
[2m[algebraic-graphs] [mOK: circuit1 [x]       == edge x x
[2m[algebraic-graphs] [mOK: circuit1 [x,y]     == edges1 [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: circuit1 . reverse == transpose . circuit1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.clique1 ============
[2m[algebraic-graphs] [mOK: clique1 [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique1 [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique1 [x,y,z]    == edges1 [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
[2m[algebraic-graphs] [mOK: clique1 . reverse  == transpose . clique1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.biclique1 ============
[2m[algebraic-graphs] [mOK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique1 xs      ys      == connect (vertices1 xs) (vertices1 ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges1 [(x,y), (x,z)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.stars1 ============
[2m[algebraic-graphs] [mOK: stars1 [(x, [] )]               == vertex x
[2m[algebraic-graphs] [mOK: stars1 [(x, [y])]               == edge x y
[2m[algebraic-graphs] [mOK: stars1 [(x, ys )]               == star x ys
[2m[algebraic-graphs] [mOK: stars1                          == overlays1 . fmap (uncurry star)
[2m[algebraic-graphs] [mOK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path1 [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.mesh1 ============
[2m[algebraic-graphs] [mOK: mesh1 [x]     [y]        == vertex (x, y)
[2m[algebraic-graphs] [mOK: mesh1 xs      ys         == box (path1 xs) (path1 ys)
[2m[algebraic-graphs] [mOK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
[2m[algebraic-graphs] [mOK: size (mesh xs ys)        == max 1 (3 * length xs * length ys - length xs - length ys -1)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.torus1 ============
[2m[algebraic-graphs] [mOK: torus1 [x]   [y]        == edge (x,y) (x,y)
[2m[algebraic-graphs] [mOK: torus1 xs    ys         == box (circuit1 xs) (circuit1 ys)
[2m[algebraic-graphs] [mOK: torus1 [1,2] ['a', 'b'] == <correct result>
[2m[algebraic-graphs] [mOK: size (torus1 xs ys)     == max 1 (3 * length xs * length ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.removeVertex1 ============
[2m[algebraic-graphs] [mOK: removeVertex1 x (vertex x)          == Nothing
[2m[algebraic-graphs] [mOK: removeVertex1 1 (vertex 2)          == Just (vertex 2)
[2m[algebraic-graphs] [mOK: removeVertex1 x (edge x x)          == Nothing
[2m[algebraic-graphs] [mOK: removeVertex1 1 (edge 1 2)          == Just (vertex 2)
[2m[algebraic-graphs] [mOK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices1 [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [mOK: size (removeEdge x y z)         <= 3 * size z
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[haskell-language-server] [mPreprocessing library 'ghcide-bench-lib' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'ghcide-bench-lib' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.splitVertex1 ============
[2m[algebraic-graphs] [mOK: splitVertex1 x [x]                 == id
[2m[algebraic-graphs] [mOK: splitVertex1 x [y]                 == replaceVertex x y
[2m[algebraic-graphs] [mOK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.transpose ============
[2m[algebraic-graphs] [mOK: transpose (vertex x)  == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y)  == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: transpose (box x y)   == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: edgeList . transpose  == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.induce1 ============
[2m[algebraic-graphs] [mOK: induce1 (const True ) x == Just x
[2m[algebraic-graphs] [mOK: induce1 (const False) x == Nothing
[2m[algebraic-graphs] [mOK: induce1 (/= x)          == removeVertex1 x
[2m[algebraic-graphs] [mOK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.induceJust1 ============
[2m[algebraic-graphs] [mOK: induceJust1 (vertex Nothing)                               == Nothing
[2m[algebraic-graphs] [mOK: induceJust1 (edge (Just x) Nothing)                        == Just (vertex x)
[2m[algebraic-graphs] [mOK: induceJust1 . fmap Just                                    == Just
[2m[algebraic-graphs] [mOK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.simplify ============
[2m[algebraic-graphs] [mOK: simplify             ==  id
[2m[algebraic-graphs] [mOK: size (simplify x)    <=  size x
[2m[algebraic-graphs] [mOK: simplify 1           === 1
[2m[algebraic-graphs] [mOK: simplify (1 + 1)     === 1
[2m[algebraic-graphs] [mOK: simplify (1 + 2 + 1) === 1 + 2
[2m[algebraic-graphs] [mOK: simplify (1 * 1 * 1) === 1 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.sparsify ============
[2m[algebraic-graphs] [mOK: sort . reachable x       == sort . rights . reachable (sparsify x) . Right
[2m[algebraic-graphs] [mOK: vertexCount (sparsify x) <= vertexCount x + size x + 1
[2m[algebraic-graphs] [mOK: edgeCount   (sparsify x) <= 3 * size x
[2m[algebraic-graphs] [mOK: size        (sparsify x) <= 3 * size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.sparsifyKL ============
[2m[algebraic-graphs] [mOK: sort . reachable x                 == sort . filter (<= n) . reachable (sparsifyKL n x)
[2m[algebraic-graphs] [mOK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
[2m[algebraic-graphs] [mOK: length (edges    $ sparsifyKL n x) <= 3 * size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.box ============
[2m[algebraic-graphs] [mOK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
[2m[algebraic-graphs] [mOK: box x y                             ~~ box y x
[2m[algebraic-graphs] [mOK: box x (overlay y z)                 == overlay (box x y) (box x z)
[2m[algebraic-graphs] [mOK: box x (vertex ())                   ~~ x
[2m[algebraic-graphs] [mOK: box x (box y z)                     ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: transpose   (box x y)               == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: vertexCount (box x y)               == vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (box x y)               <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation ============
[2m[algebraic-graphs] [mOK: Axioms of graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.consistent ============
[2m[algebraic-graphs] [mOK: Consistency of the Arbitrary instance
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: consistent empty         == True
[2m[algebraic-graphs] [mOK: consistent (vertex x)    == True
[2m[algebraic-graphs] [mOK: consistent (overlay x y) == True
[2m[algebraic-graphs] [mOK: consistent (connect x y) == True
[2m[algebraic-graphs] [mOK: consistent (edge x y)    == True
[2m[algebraic-graphs] [mOK: consistent (edges xs)    == True
[2m[algebraic-graphs] [mOK: consistent (stars xs)    == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.Show ============
[2m[algebraic-graphs] [mOK: show (empty    ) == "empty"
[2m[algebraic-graphs] [mOK: show (1        ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2    ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2    ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1)                            ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 3
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.connect ============
[2m[algebraic-graphs] [mOK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edges ============
[2m[algebraic-graphs] [mOK: edges []          == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)]     == edge x y
[2m[algebraic-graphs] [mOK: edges             == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.connects ============
[2m[algebraic-graphs] [mOK: connects []        == empty
[2m[algebraic-graphs] [mOK: connects [x]       == x
[2m[algebraic-graphs] [mOK: connects [x,y]     == connect x y
[2m[algebraic-graphs] [mOK: connects           == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty         x             ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x)    empty         ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs)     (circuit xs)  ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph                    == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg                      == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty                    == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size                       == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x                == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount                == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount                  == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList                 == Set.toAscList . vertexSet
[2m[algebraic-graphs] [mOK: edgeList                   == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1mghcide-bench/src/Experiments.hs:345:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    Pattern match(es) are non-exhaustive
[2m[haskell-language-server] [m    In a pattern binding:
[2m[haskell-language-server] [m        Patterns of type ‘ParserResult Config’ not matched:
[2m[haskell-language-server] [m            Failure _
[2m[haskell-language-server] [m            CompletionInvoked _[0m[0m
[2m[haskell-language-server] [m[;1m[34m    |[0m[0m
[2m[haskell-language-server] [m[;1m[34m345 |[0m[0m [;1m[35mSuccess defConfig = execParserPure defaultPrefs (info configP fullDesc) [][0m[0m
[2m[haskell-language-server] [m[;1m[34m    |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1mghcide-bench/src/Experiments.hs:453:42: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    Pattern match(es) are non-exhaustive
[2m[haskell-language-server] [m    In a lambda abstraction:
[2m[haskell-language-server] [m        Patterns of type ‘Maybe Handle’, ‘Maybe Handle’, ‘Maybe Handle’,
[2m[haskell-language-server] [m                         ‘ProcessHandle’ not matched:
[2m[haskell-language-server] [m            Nothing _ _ _
[2m[haskell-language-server] [m            (Just _) Nothing _ _
[2m[haskell-language-server] [m            (Just _) (Just _) Nothing _[0m[0m
[2m[haskell-language-server] [m[;1m[34m    |[0m[0m
[2m[haskell-language-server] [m[;1m[34m453 |[0m[0m         run sess = withCreateProcess p $ [;1m[35m\(Just inH) (Just outH) (Just errH) pH -> do[0m[0m
[2m[haskell-language-server] [m[;1m[34m    |[0m[0m[;1m[35m                                          ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...[0m[0m
[2m[haskell-language-server] [m[1 of 2] Compiling Experiments.Types ( ghcide-bench/src/Experiments/Types.hs, dist/build/ghcide-bench-lib/Experiments/Types.p_o )
[2m[algebraic-graphs] [mOK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap             == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap          == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay connect        == id
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1     (const 1)     (+)     (+)            == size
[2m[algebraic-graphs] [mOK: foldg True  (const False) (&&)    (&&)           == isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                       == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty)       == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                  == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty      == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount            == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex   == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique   == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty          == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)     == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y)     == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges        == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges    == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty          == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x)     == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.preIntSet ============
[2m[algebraic-graphs] [mOK: preIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet 1 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet y (edge x y) == IntSet.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.postIntSet ============
[2m[algebraic-graphs] [mOK: postIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet 2 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (edge x y) == IntSet.fromList [y]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.path ============
[2m[algebraic-graphs] [mOK: path []    == empty
[2m[algebraic-graphs] [mOK: path [x]   == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.circuit ============
[2m[algebraic-graphs] [mOK: circuit []    == empty
[2m[algebraic-graphs] [mOK: circuit [x]   == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.clique ============
[2m[algebraic-graphs] [mOK: clique []         == empty
[2m[algebraic-graphs] [mOK: clique [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.biclique ============
[2m[algebraic-graphs] [mOK: biclique []      []      == empty
[2m[algebraic-graphs] [mOK: biclique [x]     []      == vertex x
[2m[algebraic-graphs] [mOK: biclique []      [y]     == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs      ys      == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys    == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.stars ============
[2m[algebraic-graphs] [mOK: stars []                      == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])]               == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])]              == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)]               == star x ys
[2m[algebraic-graphs] [mOK: stars                         == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList         == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.forest ============
[2m[algebraic-graphs] [mOK: forest []                                                  == empty
[2m[algebraic-graphs] [mOK: forest [x]                                                 == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest                                                     == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[haskell-language-server] [m[2 of 2] Compiling Experiments      ( ghcide-bench/src/Experiments.hs, dist/build/ghcide-bench-lib/Experiments.p_o )
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1mghcide-bench/src/Experiments.hs:345:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    Pattern match(es) are non-exhaustive
[2m[haskell-language-server] [m    In a pattern binding:
[2m[haskell-language-server] [m        Patterns of type ‘ParserResult Config’ not matched:
[2m[haskell-language-server] [m            Failure _
[2m[haskell-language-server] [m            CompletionInvoked _[0m[0m
[2m[haskell-language-server] [m[;1m[34m    |[0m[0m
[2m[haskell-language-server] [m[;1m[34m345 |[0m[0m [;1m[35mSuccess defConfig = execParserPure defaultPrefs (info configP fullDesc) [][0m[0m
[2m[haskell-language-server] [m[;1m[34m    |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1mghcide-bench/src/Experiments.hs:453:42: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    Pattern match(es) are non-exhaustive
[2m[haskell-language-server] [m    In a lambda abstraction:
[2m[haskell-language-server] [m        Patterns of type ‘Maybe Handle’, ‘Maybe Handle’, ‘Maybe Handle’,
[2m[haskell-language-server] [m                         ‘ProcessHandle’ not matched:
[2m[haskell-language-server] [m            Nothing _ _ _
[2m[haskell-language-server] [m            (Just _) Nothing _ _
[2m[haskell-language-server] [m            (Just _) (Just _) Nothing _[0m[0m
[2m[haskell-language-server] [m[;1m[34m    |[0m[0m
[2m[haskell-language-server] [m[;1m[34m453 |[0m[0m         run sess = withCreateProcess p $ [;1m[35m\(Just inH) (Just outH) (Just errH) pH -> do[0m[0m
[2m[haskell-language-server] [m[;1m[34m    |[0m[0m[;1m[35m                                          ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...[0m[0m
[2m[haskell-language-server] [mPreprocessing library 'hls-floskell-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-floskell-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty       == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x)  == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y)  == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose  == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty      == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id           == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g   == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.compose ============
[2m[algebraic-graphs] [mOK: compose empty            x                == empty
[2m[algebraic-graphs] [mOK: compose x                empty            == empty
[2m[algebraic-graphs] [mOK: compose (vertex x)       y                == empty
[2m[algebraic-graphs] [mOK: compose x                (vertex y)       == empty
[2m[algebraic-graphs] [mOK: compose x                (compose y z)    == compose (compose x y) z
[2m[algebraic-graphs] [mOK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
[2m[algebraic-graphs] [mOK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
[2m[algebraic-graphs] [mOK: compose (edge x y)       (edge y z)       == edge x z
[2m[algebraic-graphs] [mOK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
[2m[algebraic-graphs] [mOK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.closure ============
[2m[algebraic-graphs] [mOK: closure empty           == empty
[2m[algebraic-graphs] [mOK: closure (vertex x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x y)      == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
[2m[algebraic-graphs] [mOK: closure                 == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure                 == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure       == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y)   == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty              == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x y)         == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty              == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x)         == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge x y)         == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x                  == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty               == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x)          == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge x y)          == edge x y
[2m[algebraic-graphs] [mOK: transitiveClosure (path $ nub xs)     == clique (nub $ xs)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing)                               == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing)                        == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just                                    == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ ReflexiveRelation ============
[2m[algebraic-graphs] [mOK: Axioms of reflexive graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ TransitiveRelation ============
[2m[algebraic-graphs] [mOK: Axioms of transitive graphs
[2m[algebraic-graphs] [mOK: path xs == (clique xs :: TransitiveRelation Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ PreorderRelation ============
[2m[algebraic-graphs] [mOK: Axioms of preorder graphs
[2m[algebraic-graphs] [mOK: path xs == (clique xs :: PreorderRelation Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation ============
[2m[algebraic-graphs] [mOK: Axioms of undirected graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.consistent ============
[2m[algebraic-graphs] [mOK: Consistency of the Arbitrary instance
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: consistent empty         == True
[2m[algebraic-graphs] [mOK: consistent (vertex x)    == True
[2m[algebraic-graphs] [mOK: consistent (overlay x y) == True
[2m[algebraic-graphs] [mOK: consistent (connect x y) == True
[2m[algebraic-graphs] [mOK: consistent (edge x y)    == True
[2m[algebraic-graphs] [mOK: consistent (edges xs)    == True
[2m[algebraic-graphs] [mOK: consistent (stars xs)    == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.Show ============
[2m[algebraic-graphs] [mOK: show (empty    ) == "empty"
[2m[algebraic-graphs] [mOK: show (1        ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2    ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2    ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1)                            ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (2 * 1    ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
[2m[algebraic-graphs] [mOK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.toSymmetric ============
[2m[algebraic-graphs] [mOK: toSymmetric (edge 1 2)         == edge 1 2
[2m[algebraic-graphs] [mOK: toSymmetric . fromSymmetric    == id
[2m[algebraic-graphs] [mOK: fromSymmetric    . toSymmetric == symmetricClosure
[2m[algebraic-graphs] [mOK: vertexCount      . toSymmetric == vertexCount
[2m[algebraic-graphs] [mOK: (*2) . edgeCount . toSymmetric >= edgeCount
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.fromSymmetric ============
[2m[algebraic-graphs] [mOK: fromSymmetric (edge 1 2)    == edges [(1,2), (2,1)]
[2m[algebraic-graphs] [mOK: vertexCount . fromSymmetric == vertexCount
[2m[algebraic-graphs] [mOK: edgeCount   . fromSymmetric <= (*2) . edgeCount
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 2 1 <  edge 1 3
[2m[algebraic-graphs] [mOK: edge 1 2 == edge 2 1
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: edge x y               == edge y x
[2m[algebraic-graphs] [mOK: edge x y               == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.connect ============
[2m[algebraic-graphs] [mOK: connect x y               == connect y x
[2m[algebraic-graphs] [mOK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y `div` 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edges ============
[2m[algebraic-graphs] [mOK: edges []             == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)]        == edge x y
[2m[algebraic-graphs] [mOK: edges [(x,y), (y,x)] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[haskell-language-server] [mPreprocessing library 'hls-stylish-haskell-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-stylish-haskell-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.connects ============
[2m[algebraic-graphs] [mOK: connects []        == empty
[2m[algebraic-graphs] [mOK: connects [x]       == x
[2m[algebraic-graphs] [mOK: connects [x,y]     == connect x y
[2m[algebraic-graphs] [mOK: connects           == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [mOK: connects           == connects . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty         x             ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x)    empty         ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs)     (circuit xs)  ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [mOK: isSubgraphOf (edge x y) (edge y x)       ==  True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph                    == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg                      == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty                    == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size                       == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x                == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount                == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount                  == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList                 == Set.toAscList . vertexSet
[2m[algebraic-graphs] [mOK: edgeList                   == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap             == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap          == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                       == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty)       == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                  == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y (edge y x)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (min x y, max x y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty      == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount            == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex   == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique   == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty          == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)     == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y)     == [(min x y, max y x)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty          == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x)     == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [1])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.neighbours ============
[2m[algebraic-graphs] [mOK: neighbours x empty      == Set.empty
[2m[algebraic-graphs] [mOK: neighbours x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: neighbours x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: neighbours y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.path ============
[2m[algebraic-graphs] [mOK: path []    == empty
[2m[algebraic-graphs] [mOK: path [x]   == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [mOK: path       == path . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.circuit ============
[2m[algebraic-graphs] [mOK: circuit []    == empty
[2m[algebraic-graphs] [mOK: circuit [x]   == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: circuit       == circuit . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.clique ============
[2m[algebraic-graphs] [mOK: clique []         == empty
[2m[algebraic-graphs] [mOK: clique [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [mOK: clique            == clique . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.biclique ============
[2m[algebraic-graphs] [mOK: biclique []      []      == empty
[2m[algebraic-graphs] [mOK: biclique [x]     []      == vertex x
[2m[algebraic-graphs] [mOK: biclique []      [y]     == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs      ys      == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys    == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.stars ============
[2m[algebraic-graphs] [mOK: stars []                      == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])]               == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])]              == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)]               == star x ys
[2m[algebraic-graphs] [mOK: stars                         == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList         == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.forest ============
[2m[algebraic-graphs] [mOK: forest []                                                  == empty
[2m[haskell-language-server] [mPreprocessing library 'hls-pragmas-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-pragmas-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1m<no location info>: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-42258[0m[0m[;1m] [[;1m[35m-Wunused-packages[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    The following packages were specified via -package or -package-id flags,
[2m[haskell-language-server] [m    but were not needed for compilation:
[2m[haskell-language-server] [m      - lens-aeson-1.2.3 (exposed by flag -package-id lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6)
[2m[haskell-language-server] [m      - transformers-0.6.1.0 (exposed by flag -package-id transformers-0.6.1.0)[0m[0m
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1m<no location info>: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-42258[0m[0m[;1m] [[;1m[35m-Wunused-packages[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    The following packages were specified via -package or -package-id flags,
[2m[haskell-language-server] [m    but were not needed for compilation:
[2m[haskell-language-server] [m      - lens-aeson-1.2.3 (exposed by flag -package-id lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6)
[2m[haskell-language-server] [m      - transformers-0.6.1.0 (exposed by flag -package-id transformers-0.6.1.0)[0m[0m
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mOK: forest [x]                                                 == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest                                                     == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge x y                  == removeEdge y x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty      == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id           == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g   == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing)                               == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing)                        == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just                                    == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Example.Todo (Holiday) ============
[2m[algebraic-graphs] [mOK: A todo list is semantically Maybe [a]
[2m[algebraic-graphs] [mOK: The overlay operator (+) adds non-dependent items to the todo list
[2m[algebraic-graphs] [mOK: The connect operator (*) adds dependency between items
[2m[algebraic-graphs] [mOK: Contradictory constraints make the todo list impossible to schedule
[2m[algebraic-graphs] [mOK: Introduce item priority to schedule the todo list
[2m[algebraic-graphs] [mOK: Custom connect operators pull/repel arguments during scheduling
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Example.Todo (Commandline) ============
[2m[algebraic-graphs] [mOK: The pull connect operator maintains command line semantics
[2m[algebraic-graphs] [mOK: Swapping flags are allowed by the commutative overlay opeartor
[2m[algebraic-graphs] [mOK: The usual connect operator breaks semantics
[2m[algebraic-graphs] [mOK: Transform command lines by adding optimisation flag
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed ============
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.fromAdjacencyMap ============
[2m[algebraic-graphs] [mOK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1))                                == array (0,2) [(0,[1]), (1,[]), (2,[0])]
[2m[algebraic-graphs] [mOK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1))                                == array (0,1) [(0,[1]), (1,[0])]
[2m[algebraic-graphs] [mOK: map (fromVertexKL h) (vertices $ toGraphKL h)                               == vertexList g
[2m[algebraic-graphs] [mOK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.fromAdjacencyIntMap ============
[2m[algebraic-graphs] [mOK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1))                             == array (0,2) [(0,[1]), (1,[]), (2,[0])]
[2m[algebraic-graphs] [mOK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1))                             == array (0,1) [(0,[1]), (1,[0])]
[2m[algebraic-graphs] [mOK: map (fromVertexKL h) (vertices $ toGraphKL h)                               == IntSet.toAscList (vertexIntSet g)
[2m[algebraic-graphs] [mOK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.dfsForest ============
[2m[algebraic-graphs] [mOK: forest (dfsForest % edge 1 1)           == vertex 1
[2m[algebraic-graphs] [mOK: forest (dfsForest % edge 1 2)           == edge 1 2
[2m[algebraic-graphs] [mOK: forest (dfsForest % edge 2 1)           == vertices [1, 2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForest % x) x == True
[2m[algebraic-graphs] [mOK: dfsForest % forest (dfsForest % x)      == dfsForest % x
[2m[algebraic-graphs] [mOK: dfsForest % vertices vs                 == map (\v -> Node v []) (nub $ sort vs)
[2m[algebraic-graphs] [mOK: dfsForest % (3 * (1 + 4) * (1 + 5))     == <correct result>
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.dfsForestFrom ============
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 1) [1]         == vertex 1
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 2) [0]         == empty
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 2) [1]         == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 2) [2]         == vertex 2
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 2) [2,1]       == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
[2m[algebraic-graphs] [mOK: dfsForestFrom % x $ vertexList x                == dfsForest % x
[2m[algebraic-graphs] [mOK: dfsForestFrom % vertices vs $ vs                == map (\v -> Node v []) (nub vs)
[2m[algebraic-graphs] [mOK: dfsForestFrom % x $ []                          == []
[2m[algebraic-graphs] [mOK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.dfs ============
[2m[algebraic-graphs] [mOK: dfs % edge 1 1 $ [1]   == [1]
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [0]   == []
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [1]   == [1,2]
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [2]   == [2]
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [1,2] == [1,2]
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [2,1] == [2,1]
[2m[algebraic-graphs] [mOK: dfs % x        $ []    == []
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4]     == [1,5,4]
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.topSort ============
[2m[algebraic-graphs] [mOK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
[2m[algebraic-graphs] [mOK: topSort % (1 * 2 + 2 * 1) == [1,2]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected ============
[2m[algebraic-graphs] [mOK: Axioms of undirected graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.Show ============
[2m[algebraic-graphs] [mOK: show (empty    ) == "empty"
[2m[algebraic-graphs] [mOK: show (1        ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2    ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2    ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1)                            ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (2 * 1    ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
[2m[algebraic-graphs] [mOK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.toUndirected ============
[2m[algebraic-graphs] [mOK: toUndirected (edge 1 2)         == edge 1 2
[2m[algebraic-graphs] [mOK: toUndirected . fromUndirected   == id
[2m[algebraic-graphs] [mOK: vertexCount      . toUndirected == vertexCount
[2m[algebraic-graphs] [mOK: (*2) . edgeCount . toUndirected >= edgeCount
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.fromUndirected ============
[2m[algebraic-graphs] [mOK: fromUndirected (edge 1 2)    == edges [(1,2),(2,1)]
[2m[algebraic-graphs] [mOK: toUndirected . fromUndirected == id
[2m[algebraic-graphs] [mOK: vertexCount . fromUndirected == vertexCount
[2m[algebraic-graphs] [mOK: edgeCount   . fromUndirected <= (*2) . edgeCount
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.complement ================
[2m[algebraic-graphs] [mOK: complement empty              == empty
[2m[algebraic-graphs] [mOK: complement (vertex x)         == vertex x
[2m[algebraic-graphs] [mOK: complement (edge 1 1)         == edge 1 1
[2m[algebraic-graphs] [mOK: complement (edge 1 2)         == vertices [1, 2]
[2m[algebraic-graphs] [mOK: complement (star 1 [2, 3])    == overlay (vertex 1) (edge 2 3)
[2m[algebraic-graphs] [mOK: complement . complement       == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 2 1 <  edge 1 3
[2m[algebraic-graphs] [mOK: edge 1 2 == edge 2 1
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: edge x y               == edge y x
[2m[haskell-language-server] [mPreprocessing library 'hls-semantic-tokens-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-semantic-tokens-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1m<no location info>: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-42258[0m[0m[;1m] [[;1m[35m-Wunused-packages[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    The following packages were specified via -package or -package-id flags,
[2m[haskell-language-server] [m    but were not needed for compilation:
[2m[haskell-language-server] [m      - syb-0.7.2.4 (exposed by flag -package-id syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy)[0m[0m
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mOK: edge x y               == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.connect ============
[2m[algebraic-graphs] [mOK: connect x y               == connect y x
[2m[algebraic-graphs] [mOK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y `div` 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.edges ============
[2m[algebraic-graphs] [mOK: edges []             == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)]        == edge x y
[2m[algebraic-graphs] [mOK: edges [(x,y), (y,x)] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.connects ============
[2m[algebraic-graphs] [mOK: connects []        == empty
[2m[algebraic-graphs] [mOK: connects [x]       == x
[2m[algebraic-graphs] [mOK: connects [x,y]     == connect x y
[2m[algebraic-graphs] [mOK: connects           == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [mOK: connects           == connects . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty         x             ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x)    empty         ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs)     (circuit xs)  ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [mOK: isSubgraphOf (edge x y) (edge y x)       ==  True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.path ============
[2m[algebraic-graphs] [mOK: path []    == empty
[2m[algebraic-graphs] [mOK: path [x]   == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [mOK: path       == path . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.circuit ============
[2m[algebraic-graphs] [mOK: circuit []    == empty
[2m[algebraic-graphs] [mOK: circuit [x]   == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: circuit       == circuit . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.clique ============
[2m[algebraic-graphs] [mOK: clique []         == empty
[2m[algebraic-graphs] [mOK: clique [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [mOK: clique            == clique . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.biclique ============
[2m[algebraic-graphs] [mOK: biclique []      []      == empty
[2m[algebraic-graphs] [mOK: biclique [x]     []      == vertex x
[2m[algebraic-graphs] [mOK: biclique []      [y]     == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs      ys      == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys    == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.stars ============
[2m[algebraic-graphs] [mOK: stars []                      == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])]               == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])]              == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)]               == star x ys
[2m[algebraic-graphs] [mOK: stars                         == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList         == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.forest ============
[2m[algebraic-graphs] [mOK: forest []                                                  == empty
[2m[algebraic-graphs] [mOK: forest [x]                                                 == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest                                                     == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge x y                  == removeEdge y x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty      == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id           == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g   == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing)                               == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing)                        == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just                                    == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [mTest suite main: PASS
[2m[algebraic-graphs] [mTest suite logged to: dist/test/algebraic-graphs-0.7-main.log
[2m[algebraic-graphs] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[algebraic-graphs] [mcheckPhase completed in 1 minutes 39 seconds
[2m[algebraic-graphs] [m[1;36mPhase: haddockPhase[m
[2m[algebraic-graphs] [mPreprocessing library for algebraic-graphs-0.7..
[2m[algebraic-graphs] [mRunning Haddock on library for algebraic-graphs-0.7..
[2m[algebraic-graphs] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[algebraic-graphs] [m 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
[2m[algebraic-graphs] [m 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
[2m[algebraic-graphs] [mWarning: 'nub' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'sort' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m  93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
[2m[algebraic-graphs] [m  Missing documentation for:
[2m[algebraic-graphs] [m    Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
[2m[algebraic-graphs] [mWarning: 'IsList' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 19 / 19) in 'Algebra.Graph.Internal'
[2m[algebraic-graphs] [m 100% ( 61 / 61) in 'Algebra.Graph'
[2m[algebraic-graphs] [mWarning: 'mplus' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'vertexCount' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'hasVertex' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'vertexSet' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'isEmpty' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'edgeList' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'adjacencyList' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'box' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'edgeCount' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
[2m[algebraic-graphs] [mWarning: 'nub' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
[2m[algebraic-graphs] [mWarning: 'isRight' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [m 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
[2m[algebraic-graphs] [m 100% ( 37 / 37) in 'Algebra.Graph.Label'
[2m[algebraic-graphs] [mWarning: 'isEmpty' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'empty' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'vertexList' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'edges' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'adjacencyList' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'stars' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
[2m[algebraic-graphs] [mWarning: 'nub' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'sort' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m  93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
[2m[algebraic-graphs] [m  Missing documentation for:
[2m[algebraic-graphs] [m    Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
[2m[algebraic-graphs] [m 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
[2m[algebraic-graphs] [m 100% (  8 /  8) in 'Algebra.Graph.ToGraph'
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:171:32: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m171 |[0m[0m     vertexIntSet :: ToVertex t [;1m[35m~[0m[0m Int => t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:197:29: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m197 |[0m[0m     preIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                             ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:215:30: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m215 |[0m[0m     postIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                              ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:303:37: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m303 |[0m[0m     toAdjacencyIntMap :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                     ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:312:46: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m312 |[0m[0m     toAdjacencyIntMapTranspose :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                              ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:452:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m452 |[0m[0m adjacencyIntMap :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                           ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:471:52: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m471 |[0m[0m adjacencyIntMapTranspose :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                    ^[0m[0m
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mWarning: 'AdjacencyMap' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 56 / 56) in 'Algebra.Graph.Relation'
[2m[algebraic-graphs] [m 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
[2m[algebraic-graphs] [mWarning: 'vertexList' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
[2m[algebraic-graphs] [m 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
[2m[algebraic-graphs] [m 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
[2m[algebraic-graphs] [m 100% (  6 /  6) in 'Algebra.Graph.Labelled.Example.Network'
[2m[algebraic-graphs] [m 100% (  5 /  5) in 'Algebra.Graph.Labelled.Example.Automaton'
[2m[algebraic-graphs] [m 100% ( 14 / 14) in 'Algebra.Graph.Export'
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export.hs:185:41: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m185 |[0m[0m export :: (Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                         ^[0m[0m
[2m[algebraic-graphs] [mWarning: 'Graph' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:121:63: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m121 |[0m[0m export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => Style a s -> g -> s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                               ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:165:78: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m165 |[0m[0m exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g [;1m[35m~[0m[0m s) => g -> s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                                              ^[0m[0m
[2m[algebraic-graphs] [m 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
[2m[algebraic-graphs] [m 100% ( 27 / 27) in 'Algebra.Graph.Class'
[2m[algebraic-graphs] [mWarning: 'Transitive' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% (  5 /  5) in 'Algebra.Graph.Relation.Transitive'
[2m[algebraic-graphs] [mWarning: 'Reflexive' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% (  5 /  5) in 'Algebra.Graph.Relation.Reflexive'
[2m[algebraic-graphs] [mWarning: 'Preorder' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% (  5 /  5) in 'Algebra.Graph.Relation.Preorder'
[2m[algebraic-graphs] [m   0% (  0 /  8) in 'Algebra.Graph.Example.Todo'
[2m[algebraic-graphs] [m  Missing documentation for:
[2m[algebraic-graphs] [m    Module header
[2m[algebraic-graphs] [m    Todo (src/Algebra/Graph/Example/Todo.hs:13)
[2m[algebraic-graphs] [m    todo (src/Algebra/Graph/Example/Todo.hs:41)
[2m[algebraic-graphs] [m    low (src/Algebra/Graph/Example/Todo.hs:22)
[2m[algebraic-graphs] [m    high (src/Algebra/Graph/Example/Todo.hs:26)
[2m[algebraic-graphs] [m    ~*~ (src/Algebra/Graph/Example/Todo.hs:34)
[2m[algebraic-graphs] [m    >*< (src/Algebra/Graph/Example/Todo.hs:38)
[2m[algebraic-graphs] [m    priority (src/Algebra/Graph/Example/Todo.hs:30)
[2m[algebraic-graphs] [mWarning: 'array' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m  90% ( 10 / 11) in 'Data.Graph.Typed'
[2m[algebraic-graphs] [m  Missing documentation for:
[2m[algebraic-graphs] [m    scc (src/Data/Graph/Typed.hs:191)
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1m<no location info>: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-42258[0m[0m[;1m] [[;1m[35m-Wunused-packages[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    The following packages were specified via -package or -package-id flags,
[2m[haskell-language-server] [m    but were not needed for compilation:
[2m[haskell-language-server] [m      - syb-0.7.2.4 (exposed by flag -package-id syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy)[0m[0m
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [mDocumentation created: dist/doc/html/algebraic-graphs/,
[2m[algebraic-graphs] [mdist/doc/html/algebraic-graphs/algebraic-graphs.txt
[2m[algebraic-graphs] [mPreprocessing test suite 'main' for algebraic-graphs-0.7..
[2m[algebraic-graphs] [m[1;36mPhase: installPhase[m
[2m[algebraic-graphs] [mInstalling 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
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[algebraic-graphs] [m[1;36mPhase: fixupPhase[m
[2m[algebraic-graphs] [mshrinking RPATHs of ELF executables and libraries in /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7
[2m[algebraic-graphs] [mshrinking /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
[2m[algebraic-graphs] [mchecking for references to /build/ in /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7...
[2m[algebraic-graphs] [mpatching script interpreter paths in /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7
[2m[algebraic-graphs] [mstripping (with command strip and flags -S -p) in  /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/lib
[2m[algebraic-graphs] [mshrinking RPATHs of ELF executables and libraries in /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc
[2m[algebraic-graphs] [mchecking for references to /build/ in /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc...
[2m[algebraic-graphs] [mpatching script interpreter paths in /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7 /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7 /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 2 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 1 of 6 built (1 building)[m
[1;34mBuilding ghc-9.6.7-with-packages[m
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-ormolu-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-ormolu-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[ghc-9.6.7-with-packages] [m/nix/store/rq5v9857qqgdglsjivmrnh9crcrxfk3k-doctest-0.24.2/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/94r03p5f8yhw9wad22fsxnb3k78wpil6-ghc-compat-plugin-0.1.0.1/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/p4fzy2dqwsnanrj6wjhilpnl24rl7n3x-hedgehog-1.5/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/k0kl195kyi4qabidpds09ypkx7b4sli3-Cabal-3.12.1.0/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/yz10vaiq7lg7h8yghkjh59ic0k8blpk7-cabal-doctest-1.0.12/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/0cdfzfn927mip0lidlngk0rav4nc5l5i-temporary-1.3/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/0cdfzfn927mip0lidlngk0rav4nc5l5i-temporary-1.3/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/r9jjs7aicy3fwm2lan1301p20dnfnng2-ansi-terminal-1.1.3/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/r9jjs7aicy3fwm2lan1301p20dnfnng2-ansi-terminal-1.1.3/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/fnl5hzk5p7w0njpjg5jsh9qvsy4abjza-async-2.2.5/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/fnl5hzk5p7w0njpjg5jsh9qvsy4abjza-async-2.2.5/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/1jvch0msag4xmavr2b7dxm5pcbwmsq8v-barbies-2.1.1.0/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/1jvch0msag4xmavr2b7dxm5pcbwmsq8v-barbies-2.1.1.0/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/xr6pilcra7kzxjhafkcycy9sw1brf3fs-concurrent-output-1.10.21/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/xr6pilcra7kzxjhafkcycy9sw1brf3fs-concurrent-output-1.10.21/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/57r38a5r1ip7ym37bddz5nqjpzi55r2f-lifted-async-0.10.2.7/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/57r38a5r1ip7ym37bddz5nqjpzi55r2f-lifted-async-0.10.2.7/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/rnhv6vydg7a2r29ljlcf5yr08h94bxjh-mmorph-1.2.1/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/rnhv6vydg7a2r29ljlcf5yr08h94bxjh-mmorph-1.2.1/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/42rmqy72nvn5343j0cpxlz4jzga9z20y-monad-control-1.0.3.1/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/42rmqy72nvn5343j0cpxlz4jzga9z20y-monad-control-1.0.3.1/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/b81azgly41n8vwx0zkjn593zvpwm5r39-pretty-show-1.10/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/b81azgly41n8vwx0zkjn593zvpwm5r39-pretty-show-1.10/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/pwphj8m3vcb5z4lj3zhmw9h94jm7rsm5-primitive-0.9.1.0/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/pwphj8m3vcb5z4lj3zhmw9h94jm7rsm5-primitive-0.9.1.0/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/x3rnwgjgpa75dcb56svvm147jyh0jzzc-random-1.2.1.3/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/x3rnwgjgpa75dcb56svvm147jyh0jzzc-random-1.2.1.3/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/1jclvcv9vkl9fns84dfq6yxv6xd2rdp2-resourcet-1.3.0/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/1jclvcv9vkl9fns84dfq6yxv6xd2rdp2-resourcet-1.3.0/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/ny88n7biaqxcb13xpakblhksw389m3nm-safe-exceptions-0.1.7.4/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/ny88n7biaqxcb13xpakblhksw389m3nm-safe-exceptions-0.1.7.4/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/8dpi11qa3dzn0igbvzmn88iifxn465pc-transformers-base-0.4.6/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/8dpi11qa3dzn0igbvzmn88iifxn465pc-transformers-base-0.4.6/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/33l47q2agmmjpjx7b2gj8md0x443i8mz-wl-pprint-annotated-0.1.0.1/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/33l47q2agmmjpjx7b2gj8md0x443i8mz-wl-pprint-annotated-0.1.0.1/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/lxg1kdksvxmaha7hymyf5gcy1hxl5pjg-Cabal-syntax-3.12.1.0/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/lxg1kdksvxmaha7hymyf5gcy1hxl5pjg-Cabal-syntax-3.12.1.0/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/456klncybx7saxjbm8n63x80h0bsal8q-ansi-terminal-types-1.1.3/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/456klncybx7saxjbm8n63x80h0bsal8q-ansi-terminal-types-1.1.3/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/76xp5b81536d5yjjjcydg5v677qz7pjz-hashable-1.5.0.0/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/76xp5b81536d5yjjjcydg5v677qz7pjz-hashable-1.5.0.0/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/qn49vwwahm0af9prf072nz4xg76ifm20-distributive-0.6.2.1/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/qn49vwwahm0af9prf072nz4xg76ifm20-distributive-0.6.2.1/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/6qqsyb5jvgnmlifjng0s3v0pgwwkryw2-constraints-0.14.2/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/6qqsyb5jvgnmlifjng0s3v0pgwwkryw2-constraints-0.14.2/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/zn99368wxxcfdnmn0pilyvn66zg0hldv-lifted-base-0.2.3.12/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/zn99368wxxcfdnmn0pilyvn66zg0hldv-lifted-base-0.2.3.12/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/5l1j8bggj9cshs6xqj0knhsn3iix247x-transformers-compat-0.7.2/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/5l1j8bggj9cshs6xqj0knhsn3iix247x-transformers-compat-0.7.2/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/8iy39dha01q6pwczlw1fbxzg2j8sjncl-splitmix-0.1.3.1/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/8iy39dha01q6pwczlw1fbxzg2j8sjncl-splitmix-0.1.3.1/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/n428byzgpjk6ysljizg36fn1hjh8wysn-unliftio-core-0.2.1.0/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/n428byzgpjk6ysljizg36fn1hjh8wysn-unliftio-core-0.2.1.0/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/cjkmvjiaw972xpzzcn6gpl4p9zqaz3j1-base-orphans-0.9.3/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/cjkmvjiaw972xpzzcn6gpl4p9zqaz3j1-base-orphans-0.9.3/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/br9kpx7bzfzvvg5l8q2zf228r3h0anr8-os-string-2.0.8/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/br9kpx7bzfzvvg5l8q2zf228r3h0anr8-os-string-2.0.8/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/hczmwq6716xprr0jzq4s2hl76wqgy7zb-tagged-0.8.9/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/hczmwq6716xprr0jzq4s2hl76wqgy7zb-tagged-0.8.9/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/j0c3yb21ggx6pbi6ak88cwsyd8z413bv-boring-0.2.2/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [m/nix/store/j0c3yb21ggx6pbi6ak88cwsyd8z413bv-boring-0.2.2/nix-support:
[2m[ghc-9.6.7-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.6.7-with-packages] [mWarning: 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
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/4lzn0wrbgk6s576hw73266g8pabw4f70-ghc-9.6.7-with-packages[m
[2m[post-build-hook] [m[2mPushing 1 paths (154 are already present) using zstd to cache sellout ⏳[m
[2m[post-build-hook] [m[2m[m
[2m[post-build-hook] [m[2mPushing /nix/store/4lzn0wrbgk6s576hw73266g8pabw4f70-ghc-9.6.7-with-packages (4.85 MiB)[m
[2m[post-build-hook] [m[2m[m
[2m[post-build-hook] [m[2mAll done.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/4lzn0wrbgk6s576hw73266g8pabw4f70-ghc-9.6.7-with-packages[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/4lzn0wrbgk6s576hw73266g8pabw4f70-ghc-9.6.7-with-packages' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/pgrxblnyadlmrz0rymx7mc6w0bvwia3z-ghc-9.6.7-with-packages.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 2 of 5 built (1 building)[m
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-explicit-record-fields-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-explicit-record-fields-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-cabal-gild-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-cabal-gild-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-cabal-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-cabal-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-hlint-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-hlint-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-refactor-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-refactor-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1m<no location info>: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-42258[0m[0m[;1m] [[;1m[35m-Wunused-packages[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    The following packages were specified via -package or -package-id flags,
[2m[haskell-language-server] [m    but were not needed for compilation:
[2m[haskell-language-server] [m      - parser-combinators-1.3.0 (exposed by flag -package-id parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC)
[2m[haskell-language-server] [m      - regex-applicative-0.3.4 (exposed by flag -package-id regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM)[0m[0m
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1m<no location info>: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-42258[0m[0m[;1m] [[;1m[35m-Wunused-packages[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    The following packages were specified via -package or -package-id flags,
[2m[haskell-language-server] [m    but were not needed for compilation:
[2m[haskell-language-server] [m      - parser-combinators-1.3.0 (exposed by flag -package-id parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC)
[2m[haskell-language-server] [m      - regex-applicative-0.3.4 (exposed by flag -package-id regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM)[0m[0m
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-rename-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-rename-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-splice-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-splice-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-retrie-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-retrie-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-gadt-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-gadt-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-cabal-fmt-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-cabal-fmt-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-eval-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-eval-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[ 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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-signature-help-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-signature-help-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing executable 'plugin-tutorial' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding executable 'plugin-tutorial' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[1 of 1] Compiling Main             ( docs/contributing/plugin-tutorial.lhs, dist/build/plugin-tutorial/plugin-tutorial-tmp/Main.dyn_o )
[2m[haskell-language-server] [m[2 of 2] Linking dist/build/plugin-tutorial/plugin-tutorial
[2m[haskell-language-server] [mPreprocessing library 'hls-stan-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-stan-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-explicit-imports-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-explicit-imports-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1m<no location info>: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-42258[0m[0m[;1m] [[;1m[35m-Wunused-packages[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    The following packages were specified via -package or -package-id flags,
[2m[haskell-language-server] [m    but were not needed for compilation:
[2m[haskell-language-server] [m      - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)[0m[0m
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1m<no location info>: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-42258[0m[0m[;1m] [[;1m[35m-Wunused-packages[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    The following packages were specified via -package or -package-id flags,
[2m[haskell-language-server] [m    but were not needed for compilation:
[2m[haskell-language-server] [m      - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)[0m[0m
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-fourmolu-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-fourmolu-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1m<no location info>: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-42258[0m[0m[;1m] [[;1m[35m-Wunused-packages[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    The following packages were specified via -package or -package-id flags,
[2m[haskell-language-server] [m    but were not needed for compilation:
[2m[haskell-language-server] [m      - yaml-0.11.11.2 (exposed by flag -package-id yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy)[0m[0m
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1m<no location info>: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-42258[0m[0m[;1m] [[;1m[35m-Wunused-packages[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    The following packages were specified via -package or -package-id flags,
[2m[haskell-language-server] [m    but were not needed for compilation:
[2m[haskell-language-server] [m      - yaml-0.11.11.2 (exposed by flag -package-id yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy)[0m[0m
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library 'hls-explicit-fixity-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-explicit-fixity-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing executable 'ghcide-bench' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding executable 'ghcide-bench' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[1 of 1] Compiling Main             ( ghcide-bench/exe/Main.hs, dist/build/ghcide-bench/ghcide-bench-tmp/Main.dyn_o )
[2m[haskell-language-server] [m[2 of 2] Linking dist/build/ghcide-bench/ghcide-bench
[2m[haskell-language-server] [mPreprocessing library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [mPreprocessing library for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding library for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1m<no location info>: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-42258[0m[0m[;1m] [[;1m[35m-Wunused-packages[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    The following packages were specified via -package or -package-id flags,
[2m[haskell-language-server] [m    but were not needed for compilation:
[2m[haskell-language-server] [m      - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)[0m[0m
[2m[haskell-language-server] [m[1 of 5] Compiling HlsPlugins       ( src/HlsPlugins.hs, dist/build/HlsPlugins.o, dist/build/HlsPlugins.dyn_o )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[3 of 5] Compiling Ide.Version      ( src/Ide/Version.hs, dist/build/Ide/Version.o, dist/build/Ide/Version.dyn_o )
[2m[haskell-language-server] [m[4 of 5] Compiling Ide.Arguments    ( src/Ide/Arguments.hs, dist/build/Ide/Arguments.o, dist/build/Ide/Arguments.dyn_o )
[2m[haskell-language-server] [m[5 of 5] Compiling Ide.Main         ( src/Ide/Main.hs, dist/build/Ide/Main.o, dist/build/Ide/Main.dyn_o )
[2m[haskell-language-server] [m
[2m[haskell-language-server] [m[;1m<no location info>: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-42258[0m[0m[;1m] [[;1m[35m-Wunused-packages[0m[0m[;1m][0m[0m[;1m
[2m[haskell-language-server] [m    The following packages were specified via -package or -package-id flags,
[2m[haskell-language-server] [m    but were not needed for compilation:
[2m[haskell-language-server] [m      - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)[0m[0m
[2m[haskell-language-server] [m[1 of 5] Compiling HlsPlugins       ( src/HlsPlugins.hs, dist/build/HlsPlugins.p_o )
[2m[haskell-language-server] [m[2 of 5] Compiling Paths_haskell_language_server ( dist/build/autogen/Paths_haskell_language_server.hs, dist/build/Paths_haskell_language_server.p_o )
[2m[haskell-language-server] [m[3 of 5] Compiling Ide.Version      ( src/Ide/Version.hs, dist/build/Ide/Version.p_o )
[2m[haskell-language-server] [m[4 of 5] Compiling Ide.Arguments    ( src/Ide/Arguments.hs, dist/build/Ide/Arguments.p_o )
[2m[haskell-language-server] [m[5 of 5] Compiling Ide.Main         ( src/Ide/Main.hs, dist/build/Ide/Main.p_o )
[2m[haskell-language-server] [mPreprocessing executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[1 of 2] Compiling Main             ( exe/Wrapper.hs, dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper-tmp/Main.dyn_o )
[2m[haskell-language-server] [m[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 )
[2m[haskell-language-server] [m[3 of 3] Linking dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper
[2m[haskell-language-server] [mPreprocessing executable 'haskell-language-server' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [mBuilding executable 'haskell-language-server' for haskell-language-server-2.12.0.0..
[2m[haskell-language-server] [m[1 of 1] Compiling Main             ( exe/Main.hs, dist/build/haskell-language-server/haskell-language-server-tmp/Main.dyn_o )
[2m[haskell-language-server] [m[2 of 2] Linking dist/build/haskell-language-server/haskell-language-server
[2m[haskell-language-server] [mbuildPhase completed in 7 minutes 37 seconds
[2m[haskell-language-server] [m[1;36mPhase: haddockPhase[m
[2m[haskell-language-server] [m[1;36mPhase: installPhase[m
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling executable ghcide-test-preprocessor in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
[2m[haskell-language-server] [mWarning: The directory
[2m[haskell-language-server] [m/nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
[2m[haskell-language-server] [mis not in the system search path.
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling executable plugin-tutorial in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
[2m[haskell-language-server] [mWarning: The directory
[2m[haskell-language-server] [m/nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
[2m[haskell-language-server] [mis not in the system search path.
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling executable ghcide-bench in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
[2m[haskell-language-server] [mWarning: The directory
[2m[haskell-language-server] [m/nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
[2m[haskell-language-server] [mis not in the system search path.
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling 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
[2m[haskell-language-server] [mInstalling executable haskell-language-server-wrapper in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
[2m[haskell-language-server] [mWarning: The directory
[2m[haskell-language-server] [m/nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
[2m[haskell-language-server] [mis not in the system search path.
[2m[haskell-language-server] [mInstalling executable haskell-language-server in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
[2m[haskell-language-server] [mWarning: The directory
[2m[haskell-language-server] [m/nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
[2m[haskell-language-server] [mis not in the system search path.
[2m[haskell-language-server] [m[1;36mPhase: fixupPhase[m
[2m[haskell-language-server] [mshrinking RPATHs of ELF executables and libraries in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0
[2m[haskell-language-server] [mshrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/ghcide-test-preprocessor
[2m[haskell-language-server] [mshrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/plugin-tutorial
[2m[haskell-language-server] [mshrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/haskell-language-server-wrapper
[2m[haskell-language-server] [mshrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/.haskell-language-server-9.6.7-unwrapped
[2m[haskell-language-server] [mshrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/ghcide-bench
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mshrinking /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
[2m[haskell-language-server] [mchecking for references to /build/ in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0...
[2m[haskell-language-server] [mpatching script interpreter paths in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0
[2m[haskell-language-server] [m/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"
[2m[haskell-language-server] [mstripping (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
[2m[haskell-language-server] [mrewriting 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
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0[m
[2m[post-build-hook] [m[2mPushing 1 paths (660 are already present) using zstd to cache sellout ⏳[m
[2m[post-build-hook] [m[2m[m
[2m[post-build-hook] [m[2mPushing /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0 (123.63 MiB)[m
[2m[post-build-hook] [m[2m[m
[2m[post-build-hook] [m[2mAll done.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 119 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/1anixijcmxsagfslr6s5g6kwc0y3kwiy-heaps-0.4.1.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/6d3nbqdhyl620r5izmzybikv6kfvmc2q-relude-1.2.2.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/55vishpdpnn2f6wv9nj821bkgfvljdl3-ghc-lib-parser-9.8.5.20250214.tar.gz.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/46xajjrzid9563wg1kdxrhjnvpwn2xgf-hspec-hedgehog-0.3.0.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/4fcdvf3dr03bsbjqj9806xpzgzlhfvn5-colourista-0.1.0.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/5ik4g51xqspq8cfms6rm10wbrgmf7r16-monad-dijkstra-0.1.1.5.tar.gz.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/94x0nhr8p9zaclv4a47r3dxa84ajzbiv-path-0.9.6.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/1i8sbvbngykff57ybdzql39q01r8k1zs-refact-0.3.0.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/2i3752ma5zg43pz2s0z4yqbghpsjk1yq-commutative-semigroups-0.2.0.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/8pqg623kl9h4s2cy4bisv3qzr326jqiy-stylish-haskell-0.14.6.0.tar.gz.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/93kpbwc8klkll2lm13mg7l2skv545j69-b0df07178133b5b049e3e7764acba0e5e3fa57af.patch.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/5cmflmilwj5jw1yiny160nmba8pnfizy-hlint-3.8.tar.gz.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/cv6jspkx432k5l175ky5vvphgxbdscjr-hspec-megaparsec-2.2.1.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/can6rlqpdjy1839pqs52w6bxpylppvim-ormolu-0.7.4.0-r5.cabal.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/1hfpkmcfif1yc2bik0s21d912z2m5scs-random-shuffle-0.0.4.tar.gz.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/4k8mdpcc00rjplhzmfan1gqxd9f84l8p-githash-0.1.7.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/cwsf2vgg5z6f7bz1c19wimsxnb2j5p9q-extensions-0.1.0.1-r1.cabal.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/dmsznk7q7a3xr7ajhd3ak87zxy471i3x-fail-4.9.0.0.tar.gz.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/fqnijdw5gjpz3wnqmrgx45ka6iyzwwdi-entropy-0.4.1.11.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/g7d03d4vvm931cz3zr7ac323yrkfjfm9-dir-traverse-0.2.3.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/hg25hnlwsjb5milwajslbf4nd1i1lyzp-vector-th-unbox-0.2.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/hrwj4v86rqcqxmz89z9ss3vggcwdffzp-retrie-1.2.3.tar.gz.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/hz1sbq0lypd4xklacffqjcsr2dv1ydmk-hscolour-1.25.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/i3gnrvir3475hz696mls2sc70xifcq31-fourmolu-0.15.0.0-r1.cabal.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/izy72imhaajqphchm9d1x6s56gn9x6r5-microaeson-0.1.0.3.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/k888jdf8wrg4rj6sg4p6sg678gfin0nm-validation-selective-0.2.0.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/l5g1qdympv53y5mj77gsvv3r7253wd2q-MonadRandom-0.6.2.tar.gz.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/lmxi42ppyfh8zcks9f2dg91krjinjzw6-ormolu-0.7.4.0.tar.gz.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/m6zrfz3fj89sslx2wyr1mjfbnx09bkjp-HsYAML-0.2.1.5.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/n24bznzwbymvl5136wc3mpkda9x33cwi-filemanip-0.3.6.3.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/n4ar2rmy5hi4lj9745mc2r9i2z0w65v9-ghc-paths-0.1.0.12.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/pikdjcsgm97yill6547qkf4kh34d0mjl-primes-0.2.1.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/pk9wmil5g1914vhd2474bfzahdh4pxx3-fourmolu-0.15.0.0.tar.gz.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/pxx1fd3bhsngp1w90rcccbfpa38g39v9-filtrable-0.1.6.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/r3svy7zfj80fp89nganb954dz7akbrpk-psqueues-0.2.8.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/r3akfq0v5ah0ysk65997hbcbi9d70snp-ghc-lib-parser-9.8.5.20250214.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/s3s5jz3wan33d1h4i32jcrqqhcvivbk0-ghc-exactprint-1.7.1.0.tar.gz.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/s9m2vgwl8n16h30yxn8b1pkj2rsb887r-ghc-lib-parser-ex-9.8.0.2.tar.gz.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/qrbi1lk6c8f48prsl6kbgr9r46c3pihv-markdown-unlit-0.6.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/v0swygjq31vnyjkb456p66pqhgf9ng0z-uniplate-1.6.13.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/vv4vxcpwslmw7f6h6zxhgwd6rminmlas-cabal-doctest-1.0.12.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/swj2w4wkc17v4z7shmniq0x0fhma0qbb-extensions-0.1.0.1.tar.gz.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/wkvspjnn0y41xmmb4jm8djdib8bpg6qj-optparse-simple-0.1.1.4.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/wk4357c75h7rgrg12xlg9kwy1z1idsvz-floskell-0.11.1.tar.gz.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/why0vvinxpzpdyj8aw5sgk0yb5b013fa-trial-0.0.0.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/x937iqharrq6j7ijw30cf885fcvc0yrd-clay-0.16.1.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/z27ism425zhz1vw1lf55chfbvsxrvbz0-newtype-generics-0.6.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/yj9jjrnc4s74qy7apjjfz2xvbx7xf7zn-deriving-aeson-0.2.10.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/z44ckjv45y80266773fi15pm2sag9z4d-pretty-simple-4.1.4.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/zbm1gsdcq77xgwpm1na4rqff8ljh53lm-fmlist-0.9.4.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/zcnhg61h9xi0z8shjqm5f1kpz9qhzmy2-path-io-1.8.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/zwiz0flaib11rd20f8pwk2p9c0krfq5y-ordered-containers-0.2.4.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/ay3k2i6zc7mr54r3zszjmkgc2splvrym-shake-0.19.8.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/17kjpbh3f85hhlq9i2nxracdw0q494xd-slist-0.2.1.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/ff8n0fqpl5srjkskqmaxvbmswm0ydchk-fail-4.9.0.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/7zc8w2dk4hix7kggrcxrqbg295bp9sr1-math-functions-0.3.4.4.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/8kvbkl3v5izwsi5g3kvarcsxnvklrrai-HsYAML-aeson-0.2.0.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/cjs337qgzfraxmrxji9xq0249vlgfl0w-monoid-subclasses-1.2.6.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/8z45n8r7a0vxs3np9kjn8gq7rzvlrwh8-tomland-1.3.3.3.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/7i70d4ri1jj0310araa19qvh930rh1wr-MonadRandom-0.6.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/0f5pbd61m9d4lq85gysr3bfv25vj6g2d-doctest-0.24.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/kpicw7a0shnlrn7m5piva4h2amk1y91q-regex-applicative-0.3.4.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/6f0nsddrsps5dbibmrlrv7vas48s1nac-th-env-0.1.1.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/p40khg0m9as6kiflgb3n4bajbpn0rqb2-extensions-0.1.0.1.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/29g826chkbdvbkz9dzghszapxsc6bpd9-pcg-random-0.1.4.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/grw2kz9j0adc65xc09hfn0cvgsrj7wr7-ghc-lib-parser-ex-9.8.0.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/d9hmx3pfhgijg8py3jzxs5qrnkyn31bq-MemoTrie-0.6.11.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/jgadx2bn6gwx7licwf865klfrg7g1bg3-trial-optparse-applicative-0.0.0.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/h0cg7hwbx96h8ww35hsdgl08d4scmrvd-ListLike-4.7.8.4.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/5i644mwp722mjzd6si8pa7bvnb6hfp4h-ghc-exactprint-1.7.1.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/xdmbhr4hhh0h5a7rxrv3md3nlcccx3c4-fuzzy-0.1.1.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/24bs87lmf8m8v9m8ik082lrdl33z2aly-mwc-random-0.15.2.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/ldaacqa0cdsrpjfiw1lszpxnd5g429m0-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/n9jgkwj3n3039b2xmpxgzq01p5wp88jj-trial-tomland-0.0.0.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/a5yvz42v5mh8lj7p9wwqbs68frr2khzl-random-shuffle-0.0.4.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/bairzzr972yr04dw0w1s4qxf2g7n0j04-stylish-haskell-0.14.6.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/kgvg0idnq5gy5d0fk3g5rvschv8mspds-process-extras-0.7.4.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/ac3057ary3ggk60m7wympmq28qbrj3zz-ormolu-0.7.4.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/qh28b0xln14zr3sdjhp3g76kbw72m7ij-hlint-3.8.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/x6kml2fyfn4rkr2smk8fss3kxvwp4z1p-fourmolu-0.15.0.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/cs16j13ag9cji0f1k8f73qlkl4la90z2-random-bytestring-0.1.4.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/l71rvkbbfi5r2zzwh5b3ki4by53imyy0-attoparsec-0.14.4.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/yirjq103f400mpcvly2v0b0is38szhyw-nothunks-0.3.1.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/3qc8xw3phbgbg7nk1wnvi9qanv87hni8-base64-1.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/k96qggy30gdcv32zv96j84m33w3gf6da-unordered-containers-0.2.20.1.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/p1r9b27js269128b7xwka9dj4rrfaj0p-stan-0.2.1.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/mljnvmyq3w3cqi2yrfhjhn77s9h1137l-uniplate-1.6.13.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/l3qz8wb5m0i7s98r8j6cqp29f3bcm57r-quickcheck-instances-0.3.33.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/wbs1bxqqbpwm3pyaq922vz23j7q05dcy-semigroupoids-6.0.1.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/nfhdaidzrx4j6r2yb3zn1bpm8qml36jg-semirings-0.7.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/8njcsyk8kvy80dc0xjm7kric6vabv05b-extra-1.8.1.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/jfpdhd1q5kk5vi8q2a01db83ww2f54c0-text-iso8601-0.1.1.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/rvga7kk839hyjv09gc73xzsbhmvml8r1-indexed-traversable-instances-0.1.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/3fqvy35j2yw7q3srrfzgqcki5iyrhkx3-foldl-1.4.18.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/k7z9k5y432sbbgkkp8yc9yrfpqxwqjlc-free-5.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/d0sb8macak0a371f4w26fxy0ak5p5rih-ghc-lib-parser-ex-9.8.0.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/ypvyrqh4xrdlhmj5wz9s0fbzs2lml5rc-filepattern-0.1.3.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/jhs9jcf5d5j2g0izjzn2z2p5jpkcbzv9-witherable-0.5.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/mc77pkq25gvz035qbydbqf5p5nxlr5k6-semialign-1.3.1.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/4b5jahmj1zmi2q9krp17rsbwksdhw5vh-ghc-exactprint-1.7.1.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/nywgzhwk47k7j0iqrp7zqcyl1r7b1m0c-aeson-2.2.3.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/rnpcxsmmmlkkcs5m4x90j2d91drzc64z-apply-refact-0.15.0.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/zl13dkzxchv1p3xa5605vfwjmpdqh27f-quickcheck-classes-0.6.5.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/62jd1xf53aczb66d5v2d5qn7q9qw89gx-HTF-0.15.0.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/aqq1hdzjp62p4pnj0390ggkrr9k5pr3a-deriving-aeson-0.2.10.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/lc907lv31k9wz9bawbhg3vgglw1i80b5-attoparsec-aeson-2.2.2.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/n7sgx3c4wl8b9nigx1ccakn3mlcy2fl5-aeson-pretty-0.8.10.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/2djbbx1y4ca60vdqqk2lbarnqf1nxmhh-bitvec-1.1.5.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/dy3g6pd1wws3kb535ijwm68mx85kjzfz-list-t-1.0.5.7.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/jxnnp72s41q197j5khm1dbyppdk5psa5-vector-algorithms-0.9.1.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/48z571r4gm1rbzwzh62j2vfy9kkazd60-retrie-1.2.3.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/xzjkngagvrzvjplwy2sp4ymaxq8a9v40-mono-traversable-1.0.21.0.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/7n9m5z3ajbjbn9fjr12j6c2iibpxpvx3-conduit-1.3.6.1.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/h476q6y7hms8qz13q5wqhk6jss7bskjv-libyaml-0.1.4.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/04k9jvxmvbxzi7aw4n65l3jwdz8zvfdq-yaml-0.11.11.2.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/76lch09dxy32bqyrw36ygpc85rzs8ax5-hlint-3.8.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/cnzin3r1q71fgprsam2qfa0lc7mkybcg-monad-dijkstra-0.1.1.5.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/kch4w2pdl27b77a7acgfcsy4qppmm050-floskell-0.11.1.drv' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/xj1m88nvjddmccvigs4nbpjrpr8w2cy9-haskell-language-server-2.12.0.0.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 3 of 5 built[m
[1;34mBuilding ghc-shell-for-packages[m
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/bxg479kxnyfixrkkzix69c5j19i576iy-ghc-shell-for-packages-0[m
[2m[post-build-hook] [m[2mPushing 2 paths (877 are already present) using zstd to cache sellout ⏳[m
[2m[post-build-hook] [m[2m[m
[2m[post-build-hook] [m[2mPushing /nix/store/2nz6ghwj4lif5nxwzmzc80y6hpyn0x9y-util-linux-minimal-2.41.3-login (95.23 KiB)[m
[2m[post-build-hook] [m[2mPushing /nix/store/bxg479kxnyfixrkkzix69c5j19i576iy-ghc-shell-for-packages-0 (336.00 B)[m
[2m[post-build-hook] [m[2m[m
[2m[post-build-hook] [m[2mAll done.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/bxg479kxnyfixrkkzix69c5j19i576iy-ghc-shell-for-packages-0[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/bxg479kxnyfixrkkzix69c5j19i576iy-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/g5dmpyig36i52nhvhjzsjkwjpyv3g3yc-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 4 of 5 built[m