1. 248.05 s [Cabal] Dependency parsec >=3.1.13.0 && <3.2: using parsec-3.1.16.1
  2. 248.05 s [Cabal] Dependency pretty >=1.1.1 && <1.2: using pretty-1.1.3.6
  3. 248.05 s [Cabal] Dependency process >=1.2.1.0 && <1.7: using process-1.6.18.0
  4. 248.05 s [Cabal] Dependency time >=1.4.0.1 && <1.15: using time-1.12.2
  5. 248.05 s [Cabal] Dependency transformers >=0.3 && <0.4 || >=0.4.1.0 && <0.7: using
  6. 248.05 s [Cabal] transformers-0.5.6.2
  7. 248.05 s [Cabal] Dependency unix >=2.6.0.0 && <2.9: using unix-2.7.3
  8. 248.22 s [Cabal] Source component graph: component lib
  9. 248.22 s [Cabal] Configured component graph:
  10. 248.22 s [Cabal] component Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  11. 248.22 s [Cabal] include Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP
  12. 248.22 s [Cabal] include array-0.5.4.0
  13. 248.22 s [Cabal] include base-4.17.2.1
  14. 248.22 s [Cabal] include bytestring-0.11.5.3
  15. 248.22 s [Cabal] include containers-0.6.7
  16. 248.22 s [Cabal] include deepseq-1.4.8.0
  17. 248.22 s [Cabal] include directory-1.3.7.1
  18. 248.22 s [Cabal] include filepath-1.4.2.2
  19. 248.22 s [Cabal] include mtl-2.2.2
  20. 248.22 s [Cabal] include parsec-3.1.16.1
  21. 248.22 s [Cabal] include pretty-1.1.3.6
  22. 248.22 s [Cabal] include process-1.6.18.0
  23. 248.22 s [Cabal] include time-1.12.2
  24. 248.22 s [Cabal] include transformers-0.5.6.2
  25. 248.22 s [Cabal] include unix-2.7.3
  26. 248.22 s [Cabal] Linked component graph:
  27. 248.22 s [Cabal] unit Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  28. 248.22 s [Cabal] include Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP
  29. 248.22 s [Cabal] include array-0.5.4.0
  30. 248.22 s [Cabal] include base-4.17.2.1
  31. 248.22 s [Cabal] include bytestring-0.11.5.3
  32. 248.22 s [Cabal] include containers-0.6.7
  33. 248.22 s [Cabal] include deepseq-1.4.8.0
  34. 248.23 s [Cabal] include directory-1.3.7.1
  35. 248.23 s [Cabal] include filepath-1.4.2.2
  36. 248.23 s [Cabal] include mtl-2.2.2
  37. 248.23 s [Cabal] include parsec-3.1.16.1
  38. 248.23 s [Cabal] include pretty-1.1.3.6
  39. 248.23 s [Cabal] include process-1.6.18.0
  40. 248.23 s [Cabal] include time-1.12.2
  41. 248.23 s [Cabal] include transformers-0.5.6.2
  42. 248.23 s [Cabal] include unix-2.7.3
  43. 248.42 s [Cabal] Distribution.Backpack=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Backpack,Distribution.Backpack.ComponentsGraph=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.ComponentsGraph,Distribution.Backpack.Configure=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.Configure,Distribution.Backpack.ConfiguredComponent=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.ConfiguredComponent,Distribution.Backpack.DescribeUnitId=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.DescribeUnitId,Distribution.Backpack.FullUnitId=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.FullUnitId,Distribution.Backpack.LinkedComponent=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.LinkedComponent,Distribution.Backpack.ModSubst=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.ModSubst,Distribution.Backpack.ModuleShape=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.ModuleShape,Distribution.Backpack.PreModuleShape=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.PreModuleShape,Distribution.CabalSpecVersion=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.CabalSpecVersion,Distribution.Compat.Binary=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Binary,Distribution.Compat.CharParsing=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.CharParsing,Distribution.Compat.CreatePipe=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.CreatePipe,Distribution.Compat.DList=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.DList,Distribution.Compat.Directory=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.Directory,Distribution.Compat.Environment=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.Environment,Distribution.Compat.Exception=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Exception,Distribution.Compat.FilePath=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.FilePath,Distribution.Compat.Graph=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Graph,Distribution.Compat.Internal.TempFile=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.Internal.TempFile,Distribution.Compat.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Lens,Distribution.Compat.MonadFail=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.MonadFail,Distribution.Compat.Newtype=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Newtype,Distribution.Compat.NonEmptySet=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.NonEmptySet,Distribution.Compat.Parsing=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Parsing,Distribution.Compat.Prelude=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Prelude,Distribution.Compat.Prelude.Internal=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.Prelude.Internal,Distribution.Compat.Process=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.Process,Distribution.Compat.ResponseFile=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.ResponseFile,Distribution.Compat.Semigroup=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Semigroup,Distribution.Compat.Stack=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.Stack,Distribution.Compat.Time=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.Time,Distribution.Compat.Typeable=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Typeable,Distribution.Compiler=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compiler,Distribution.FieldGrammar=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.FieldGrammar,Distribution.FieldGrammar.Class=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.FieldGrammar.Class,Distribution.FieldGrammar.FieldDescrs=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.FieldGrammar.FieldDescrs,Distribution.FieldGrammar.Newtypes=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.FieldGrammar.Newtypes,Distribution.FieldGrammar.Parsec=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.FieldGrammar.Parsec,Distribution.FieldGrammar.Pretty=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.FieldGrammar.Pretty,Distribution.Fields=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields,Distribution.Fields.ConfVar=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields.ConfVar,Distribution.Fields.Field=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields.Field,Distribution.Fields.Lexer=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields.Lexer,Distribution.Fields.LexerMonad=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields.LexerMonad,Distribution.Fields.ParseResult=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields.ParseResult,Distribution.Fields.Parser=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields.Parser,Distribution.Fields.Pretty=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields.Pretty,Distribution.InstalledPackageInfo=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.InstalledPackageInfo,Distribution.License=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.License,Distribution.Make=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Make,Distribution.ModuleName=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.ModuleName,Distribution.Package=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Package,Distribution.PackageDescription=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.PackageDescription,Distribution.PackageDescription.Check=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.PackageDescription.Check,Distribution.PackageDescription.Configuration=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.PackageDescription.Configuration,Distribution.PackageDescription.FieldGrammar=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.PackageDescription.FieldGrammar,Distribution.PackageDescription.Parsec=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.PackageDescription.Parsec,Distribution.PackageDescription.PrettyPrint=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.PackageDescription.PrettyPrint,Distribution.PackageDescription.Quirks=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.PackageDescription.Quirks,Distribution.PackageDescription.Utils=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.PackageDescription.Utils,Distribution.Parsec=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Parsec,Distribution.Parsec.Error=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Parsec.Error,Distribution.Parsec.FieldLineStream=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Parsec.FieldLineStream,Distribution.Parsec.Position=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Parsec.Position,Distribution.Parsec.Warning=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Parsec.Warning,Distribution.Pretty=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Pretty,Distribution.ReadE=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.ReadE,Distribution.SPDX=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.SPDX,Distribution.SPDX.License=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.SPDX.License,Distribution.SPDX.LicenseExceptionId=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.SPDX.LicenseExceptionId,Distribution.SPDX.LicenseExpression=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.SPDX.LicenseExpression,Distribution.SPDX.LicenseId=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.SPDX.LicenseId,Distribution.SPDX.LicenseListVersion=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.SPDX.LicenseListVersion,Distribution.SPDX.LicenseReference=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.SPDX.LicenseReference,Distribution.Simple=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple,Distribution.Simple.Bench=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Bench,Distribution.Simple.Build=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Build,Distribution.Simple.Build.Inputs=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Build.Inputs,Distribution.Simple.Build.Macros=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Build.Macros,Distribution.Simple.Build.PackageInfoModule=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Build.PackageInfoModule,Distribution.Simple.Build.PathsModule=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Build.PathsModule,Distribution.Simple.BuildPaths=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.BuildPaths,Distribution.Simple.BuildTarget=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.BuildTarget,Distribution.Simple.BuildToolDepends=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.BuildToolDepends,Distribution.Simple.CCompiler=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.CCompiler,Distribution.Simple.Command=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Command,Distribution.Simple.Compiler=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Compiler,Distribution.Simple.Configure=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Configure,Distribution.Simple.Errors=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Errors,Distribution.Simple.Flag=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Flag,Distribution.Simple.GHC=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.GHC,Distribution.Simple.GHCJS=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.GHCJS,Distribution.Simple.Glob=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Glob,Distribution.Simple.Glob.Internal=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Glob.Internal,Distribution.Simple.Haddock=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Haddock,Distribution.Simple.HaskellSuite=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.HaskellSuite,Distribution.Simple.Hpc=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Hpc,Distribution.Simple.Install=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Install,Distribution.Simple.InstallDirs=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.InstallDirs,Distribution.Simple.InstallDirs.Internal=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.InstallDirs.Internal,Distribution.Simple.LocalBuildInfo=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.LocalBuildInfo,Distribution.Simple.PackageDescription=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.PackageDescription,Distribution.Simple.PackageIndex=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.PackageIndex,Distribution.Simple.PreProcess=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.PreProcess,Distribution.Simple.PreProcess.Types=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.PreProcess.Types,Distribution.Simple.PreProcess.Unlit=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.PreProcess.Unlit,Distribution.Simple.Program=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program,Distribution.Simple.Program.Ar=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Ar,Distribution.Simple.Program.Builtin=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Builtin,Distribution.Simple.Program.Db=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Db,Distribution.Simple.Program.Find=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Find,Distribution.Simple.Program.GHC=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.GHC,Distribution.Simple.Program.HcPkg=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.HcPkg,Distribution.Simple.Program.Hpc=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Hpc,Distribution.Simple.Program.Internal=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Internal,Distribution.Simple.Program.Ld=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Ld,Distribution.Simple.Program.ResponseFile=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.ResponseFile,Distribution.Simple.Program.Run=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Run,Distribution.Simple.Program.Script=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Script,Distribution.Simple.Program.Strip=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Strip,Distribution.Simple.Program.Types=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Types,Distribution.Simple.Register=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Register,Distribution.Simple.Setup=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Setup,Distribution.Simple.ShowBuildInfo=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.ShowBuildInfo,Distribution.Simple.SrcDist=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.SrcDist,Distribution.Simple.Test=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Test,Distribution.Simple.Test.ExeV10=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Test.ExeV10,Distribution.Simple.Test.LibV09=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Test.LibV09,Distribution.Simple.Test.Log=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Test.Log,Distribution.Simple.UHC=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.UHC,Distribution.Simple.UserHooks=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.UserHooks,Distribution.Simple.Utils=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Utils,Distribution.System=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.System,Distribution.TestSuite=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.TestSuite,Distribution.Text=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Text,Distribution.Types.AbiDependency=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.AbiDependency,Distribution.Types.AbiHash=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.AbiHash,Distribution.Types.AnnotatedId=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.AnnotatedId,Distribution.Types.Benchmark=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Benchmark,Distribution.Types.Benchmark.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Benchmark.Lens,Distribution.Types.BenchmarkInterface=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.BenchmarkInterface,Distribution.Types.BenchmarkType=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.BenchmarkType,Distribution.Types.BuildInfo=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.BuildInfo,Distribution.Types.BuildInfo.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.BuildInfo.Lens,Distribution.Types.BuildType=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.BuildType,Distribution.Types.Component=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Component,Distribution.Types.ComponentId=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ComponentId,Distribution.Types.ComponentInclude=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.ComponentInclude,Distribution.Types.ComponentLocalBuildInfo=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.ComponentLocalBuildInfo,Distribution.Types.ComponentName=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ComponentName,Distribution.Types.ComponentRequestedSpec=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ComponentRequestedSpec,Distribution.Types.CondTree=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.CondTree,Distribution.Types.Condition=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Condition,Distribution.Types.ConfVar=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ConfVar,Distribution.Types.Dependency=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Dependency,Distribution.Types.DependencyMap=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.DependencyMap,Distribution.Types.DumpBuildInfo=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.DumpBuildInfo,Distribution.Types.ExeDependency=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ExeDependency,Distribution.Types.Executable=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Executable,Distribution.Types.Executable.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Executable.Lens,Distribution.Types.ExecutableScope=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ExecutableScope,Distribution.Types.ExposedModule=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ExposedModule,Distribution.Types.Flag=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Flag,Distribution.Types.ForeignLib=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ForeignLib,Distribution.Types.ForeignLib.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ForeignLib.Lens,Distribution.Types.ForeignLibOption=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ForeignLibOption,Distribution.Types.ForeignLibType=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ForeignLibType,Distribution.Types.GenericPackageDescription=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.GenericPackageDescription,Distribution.Types.GenericPackageDescription.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.GenericPackageDescription.Lens,Distribution.Types.GivenComponent=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.GivenComponent,Distribution.Types.HookedBuildInfo=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.HookedBuildInfo,Distribution.Types.IncludeRenaming=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.IncludeRenaming,Distribution.Types.InstalledPackageInfo=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.InstalledPackageInfo,Distribution.Types.InstalledPackageInfo.FieldGrammar=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.InstalledPackageInfo.FieldGrammar,Distribution.Types.InstalledPackageInfo.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.InstalledPackageInfo.Lens,Distribution.Types.LegacyExeDependency=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.LegacyExeDependency,Distribution.Types.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Lens,Distribution.Types.Library=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Library,Distribution.Types.Library.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Library.Lens,Distribution.Types.LibraryName=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.LibraryName,Distribution.Types.LibraryVisibility=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.LibraryVisibility,Distribution.Types.LocalBuildConfig=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.LocalBuildConfig,Distribution.Types.LocalBuildInfo=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.LocalBuildInfo,Distribution.Types.Mixin=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Mixin,Distribution.Types.Module=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Module,Distribution.Types.ModuleReexport=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ModuleReexport,Distribution.Types.ModuleRenaming=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ModuleRenaming,Distribution.Types.MungedPackageId=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.MungedPackageId,Distribution.Types.MungedPackageName=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.MungedPackageName,Distribution.Types.PackageDescription=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PackageDescription,Distribution.Types.PackageDescription.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PackageDescription.Lens,Distribution.Types.PackageId=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PackageId,Distribution.Types.PackageId.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PackageId.Lens,Distribution.Types.PackageName=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PackageName,Distribution.Types.PackageName.Magic=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.PackageName.Magic,Distribution.Types.PackageVersionConstraint=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PackageVersionConstraint,Distribution.Types.ParStrat=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.ParStrat,Distribution.Types.PkgconfigDependency=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PkgconfigDependency,Distribution.Types.PkgconfigName=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PkgconfigName,Distribution.Types.PkgconfigVersion=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PkgconfigVersion,Distribution.Types.PkgconfigVersionRange=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PkgconfigVersionRange,Distribution.Types.SetupBuildInfo=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.SetupBuildInfo,Distribution.Types.SetupBuildInfo.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.SetupBuildInfo.Lens,Distribution.Types.SourceRepo=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.SourceRepo,Distribution.Types.SourceRepo.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.SourceRepo.Lens,Distribution.Types.TargetInfo=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.TargetInfo,Distribution.Types.TestSuite=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.TestSuite,Distribution.Types.TestSuite.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.TestSuite.Lens,Distribution.Types.TestSuiteInterface=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.TestSuiteInterface,Distribution.Types.TestType=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.TestType,Distribution.Types.UnitId=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.UnitId,Distribution.Types.UnqualComponentName=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.UnqualComponentName,Distribution.Types.Version=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Version,Distribution.Types.VersionInterval=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.VersionInterval,Distribution.Types.VersionInterval.Legacy=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.VersionInterval.Legacy,Distribution.Types.VersionRange=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.VersionRange,Distribution.Types.VersionRange.Internal=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.VersionRange.Internal,Distribution.Utils.Base62=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Utils.Base62,Distribution.Utils.Generic=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Utils.Generic,Distribution.Utils.IOData=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Utils.IOData,Distribution.Utils.Json=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Utils.Json,Distribution.Utils.LogProgress=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Utils.LogProgress,Distribution.Utils.MD5=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Utils.MD5,Distribution.Utils.MapAccum=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Utils.MapAccum,Distribution.Utils.NubList=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Utils.NubList,Distribution.Utils.Path=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Utils.Path,Distribution.Utils.Progress=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Utils.Progress,Distribution.Utils.ShortText=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Utils.ShortText,Distribution.Utils.String=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Utils.String,Distribution.Utils.Structured=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Utils.Structured,Distribution.Verbosity=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Verbosity,Distribution.Verbosity.Internal=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Verbosity.Internal,Distribution.Version=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Version,Language.Haskell.Extension=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Language.Haskell.Extension
  44. 248.42 s [Cabal] Ready component graph:
  45. 248.42 s [Cabal] definite Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  46. 248.42 s [Cabal] depends Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP
  47. 248.42 s [Cabal] depends array-0.5.4.0
  48. 248.42 s [Cabal] depends base-4.17.2.1
  49. 248.42 s [Cabal] depends bytestring-0.11.5.3
  50. 248.42 s [Cabal] depends containers-0.6.7
  51. 248.42 s [Cabal] depends deepseq-1.4.8.0
  52. 248.42 s [Cabal] depends directory-1.3.7.1
  53. 248.42 s [Cabal] depends filepath-1.4.2.2
  54. 248.42 s [Cabal] depends mtl-2.2.2
  55. 248.42 s [Cabal] depends parsec-3.1.16.1
  56. 248.42 s [Cabal] depends pretty-1.1.3.6
  57. 248.42 s [Cabal] depends process-1.6.18.0
  58. 248.42 s [Cabal] depends time-1.12.2
  59. 248.42 s [Cabal] depends transformers-0.5.6.2
  60. 248.42 s [Cabal] depends unix-2.7.3
  61. 248.42 s [Cabal] Using Cabal-3.8.1.0 compiled by ghc-9.4
  62. 248.42 s [Cabal] Using compiler: ghc-9.4.8
  63. 248.42 s [Cabal] Using install prefix:
  64. 248.42 s [Cabal] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0
  65. 248.42 s [Cabal] Executables installed in:
  66. 248.42 s [Cabal] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/bin
  67. 248.42 s [Cabal] Libraries installed in:
  68. 248.42 s [Cabal] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  69. 248.42 s [Cabal] Dynamic Libraries installed in:
  70. 248.42 s [Cabal] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  71. 248.42 s [Cabal] Private executables installed in:
  72. 248.42 s [Cabal] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/libexec/x86_64-linux-ghc-9.4.8/Cabal-3.12.1.0
  73. 248.42 s [Cabal] Data files installed in:
  74. 248.42 s [Cabal] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/share/x86_64-linux-ghc-9.4.8/Cabal-3.12.1.0
  75. 248.42 s [Cabal] Documentation installed in:
  76. 248.42 s [Cabal] /nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc/share/doc/Cabal-3.12.1.0
  77. 248.42 s [Cabal] Configuration files installed in:
  78. 248.42 s [Cabal] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/etc
  79. 248.42 s [Cabal] No alex found
  80. 248.42 s [Cabal] Using ar found on system at:
  81. 248.42 s [Cabal] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  82. 248.42 s [Cabal] No c2hs found
  83. 248.42 s [Cabal] No cpphs found
  84. 248.42 s [Cabal] No doctest found
  85. 248.42 s [Cabal] Using gcc version 14.3.0 given by user at:
  86. 248.42 s [Cabal] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  87. 248.42 s [Cabal] Using ghc version 9.4.8 found on system at:
  88. 248.42 s [Cabal] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  89. 248.42 s [Cabal] Using ghc-pkg version 9.4.8 found on system at:
  90. 248.42 s [Cabal] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  91. 248.42 s [Cabal] No ghcjs found
  92. 248.42 s [Cabal] No ghcjs-pkg found
  93. 248.42 s [Cabal] No greencard found
  94. 248.42 s [Cabal] Using haddock version 2.27.0 found on system at:
  95. 248.42 s [Cabal] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  96. 248.42 s [Cabal] No happy found
  97. 248.42 s [Cabal] Using haskell-suite found on system at: haskell-suite-dummy-location
  98. 248.42 s [Cabal] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  99. 248.42 s [Cabal] No hmake found
  100. 248.42 s [Cabal] Using hpc version 0.68 found on system at:
  101. 248.42 s [Cabal] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  102. 248.42 s [Cabal] Using hsc2hs version 0.68.8 found on system at:
  103. 248.42 s [Cabal] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  104. 248.42 s [Cabal] Using hscolour version 1.25 found on system at:
  105. 248.42 s [Cabal] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  106. 248.42 s [Cabal] No jhc found
  107. 248.42 s [Cabal] Using ld found on system at:
  108. 248.42 s [Cabal] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  109. 248.42 s [Cabal] No pkg-config found
  110. 248.42 s [Cabal] Using runghc version 9.4.8 found on system at:
  111. 248.42 s [Cabal] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  112. 248.42 s [Cabal] Using strip version 2.44 found on system at:
  113. 248.42 s [Cabal] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  114. 248.42 s [Cabal] Using tar found on system at:
  115. 248.42 s [Cabal] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  116. 248.42 s [Cabal] No uhc found
  117. 248.43 s [Cabal] Phase: buildPhase
  118. 248.50 s [Cabal] Preprocessing library for Cabal-3.12.1.0..
  119. 248.52 s [Cabal] Building library for Cabal-3.12.1.0..
  120. 248.63 s [wai-extra] [26 of 40] Compiling Network.Wai.Request ( Network/Wai/Request.hs, dist/build/Network/Wai/Request.p_o )
  121. 248.63 s [wai-extra] [27 of 40] Compiling Network.Wai.Middleware.RequestSizeLimit ( Network/Wai/Middleware/RequestSizeLimit.hs, dist/build/Network/Wai/Middleware/RequestSizeLimit.p_o )
  122. 248.63 s [wai-extra] [28 of 40] Compiling Network.Wai.Middleware.ForceSSL ( Network/Wai/Middleware/ForceSSL.hs, dist/build/Network/Wai/Middleware/ForceSSL.p_o )
  123. 248.63 s [wai-extra] [29 of 40] Compiling Network.Wai.Middleware.ForceDomain ( Network/Wai/Middleware/ForceDomain.hs, dist/build/Network/Wai/Middleware/ForceDomain.p_o )
  124. 248.63 s [wai-extra] [30 of 40] Compiling Network.Wai.Middleware.Approot ( Network/Wai/Middleware/Approot.hs, dist/build/Network/Wai/Middleware/Approot.p_o )
  125. 248.63 s [wai-extra] [31 of 40] Compiling Network.Wai.Test.Internal ( Network/Wai/Test/Internal.hs, dist/build/Network/Wai/Test/Internal.p_o )
  126. 248.63 s [wai-extra] [32 of 40] Compiling Network.Wai.Test ( Network/Wai/Test.hs, dist/build/Network/Wai/Test.p_o )
  127. 248.63 s [wai-extra] [33 of 40] Compiling Network.Wai.UrlMap ( Network/Wai/UrlMap.hs, dist/build/Network/Wai/UrlMap.p_o )
  128. 248.63 s [wai-extra] [34 of 40] Compiling Network.Wai.Util ( Network/Wai/Util.hs, dist/build/Network/Wai/Util.p_o )
  129. 248.63 s [wai-extra] [35 of 40] Compiling Network.Wai.Middleware.CombineHeaders ( Network/Wai/Middleware/CombineHeaders.hs, dist/build/Network/Wai/Middleware/CombineHeaders.p_o )
  130. 248.63 s [wai-extra] [36 of 40] Compiling Network.Wai.Header ( Network/Wai/Header.hs, dist/build/Network/Wai/Header.p_o )
  131. 248.63 s [wai-extra] [37 of 40] Compiling Network.Wai.Middleware.RequestLogger ( Network/Wai/Middleware/RequestLogger.hs, dist/build/Network/Wai/Middleware/RequestLogger.p_o )
  132. 249.12 s [skylighting-core] [ 7 of 11] Compiling Skylighting.Styles
  133. 249.18 s [typst] [ 7 of 16] Compiling Typst.Show ( src/Typst/Show.hs, nothing )
  134. 249.24 s [typst] [ 8 of 16] Compiling Typst.Bind ( src/Typst/Bind.hs, nothing )
  135. 249.28 s [typst] [ 9 of 16] Compiling Typst.Util ( src/Typst/Util.hs, nothing )
  136. 249.39 s [typst] src/Typst/Util.hs:22:1: warning: [GHC-66111] [-Wunused-imports]
  137. 249.39 s [typst] The import of ‘Data.List’ is redundant
  138. 249.39 s [typst] except perhaps to import instances from ‘Data.List’
  139. 249.39 s [typst] To import instances alone, use: import Data.List()
  140. 249.39 s [typst] |
  141. 249.39 s [typst] 22 | import Data.List (foldl')
  142. 249.39 s [typst] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  143. 249.39 s [typst]
  144. 249.39 s [typst] [10 of 16] Compiling Typst.Module.Math ( src/Typst/Module/Math.hs, nothing )
  145. 249.41 s [skylighting-core] [ 8 of 11] Compiling Skylighting.Parser
  146. 249.50 s [typst] [11 of 16] Compiling Typst.Module.Calc ( src/Typst/Module/Calc.hs, nothing )
  147. 249.61 s [typst] [12 of 16] Compiling Typst.Module.Standard ( src/Typst/Module/Standard.hs, nothing )
  148. 249.67 s [wai-extra] [38 of 40] Compiling Network.Wai.Middleware.RequestLogger.JSON ( Network/Wai/Middleware/RequestLogger/JSON.hs, dist/build/Network/Wai/Middleware/RequestLogger/JSON.p_o )
  149. 249.73 s [skylighting-core] [ 9 of 11] Compiling Skylighting.Tokenizer
  150. 250.00 s [Cabal] [ 1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, dist/build/Distribution/Backpack/FullUnitId.o, dist/build/Distribution/Backpack/FullUnitId.dyn_o )
  151. 253.08 s [wai-extra] [39 of 40] Compiling Network.Wai.Middleware.Gzip ( Network/Wai/Middleware/Gzip.hs, dist/build/Network/Wai/Middleware/Gzip.p_o )
  152. 253.08 s [wai-extra] [40 of 40] Compiling Network.Wai.Middleware.AcceptOverride ( Network/Wai/Middleware/AcceptOverride.hs, dist/build/Network/Wai/Middleware/AcceptOverride.p_o )
  153. 253.08 s [skylighting-core] [10 of 11] Compiling Skylighting.Loader
  154. 253.08 s [skylighting-core] [11 of 11] Compiling Skylighting.Core
  155. 253.08 s [typst] [13 of 16] Compiling Typst.Methods ( src/Typst/Methods.hs, nothing )
  156. 253.08 s [skylighting-core] Haddock coverage:
  157. 253.08 s [skylighting-core] 27% ( 3 / 11) in 'Skylighting.Regex'
  158. 253.08 s [skylighting-core] Missing documentation for:
  159. 253.08 s [skylighting-core] Module header
  160. 253.08 s [skylighting-core] Regex (src/Regex/KDE/Regex.hs:17)
  161. 253.08 s [skylighting-core] RE (src/Skylighting/Regex.hs:45)
  162. 253.08 s [skylighting-core] reCaseSensitive (src/Skylighting/Regex.hs:45)
  163. 253.08 s [skylighting-core] reString (src/Skylighting/Regex.hs:45)
  164. 253.08 s [skylighting-core] compileRE (src/Skylighting/Regex.hs:113)
  165. 253.08 s [skylighting-core] testRegex (src/Regex/KDE.hs:15)
  166. 253.08 s [skylighting-core] isWordChar (src/Regex/KDE/Regex.hs:67)
  167. 253.08 s [skylighting-core] Warning: 'TokenStyle' is ambiguous. It is defined
  168. 253.08 s [skylighting-core] * at src/Skylighting/Types.hs:257:19
  169. 253.08 s [skylighting-core] * at src/Skylighting/Types.hs:257:1
  170. 253.08 s [skylighting-core] You may be able to disambiguate the identifier by qualifying it or
  171. 253.08 s [skylighting-core] by specifying the type/value namespace explicitly.
  172. 253.08 s [skylighting-core] Defaulting to the one defined at src/Skylighting/Types.hs:257:1
  173. 253.08 s [skylighting-core] Warning: 'Style' is ambiguous. It is defined
  174. 253.09 s [skylighting-core] * at src/Skylighting/Types.hs:368:14
  175. 253.09 s [skylighting-core] * at src/Skylighting/Types.hs:368:1
  176. 253.09 s [skylighting-core] You may be able to disambiguate the identifier by qualifying it or
  177. 253.09 s [skylighting-core] by specifying the type/value namespace explicitly.
  178. 253.09 s [skylighting-core] Defaulting to the one defined at src/Skylighting/Types.hs:368:1
  179. 253.09 s [skylighting-core] 100% ( 30 / 30) in 'Skylighting.Types'
  180. 253.09 s [skylighting-core] 90% ( 9 / 10) in 'Skylighting.Styles'
  181. 253.09 s [skylighting-core] Missing documentation for:
  182. 253.09 s [skylighting-core] Module header
  183. 253.09 s [skylighting-core] Warning: 'Syntax' is ambiguous. It is defined
  184. 253.09 s [skylighting-core] * at src/Skylighting/Types.hs:154:15
  185. 253.09 s [skylighting-core] * at src/Skylighting/Types.hs:154:1
  186. 253.09 s [skylighting-core] You may be able to disambiguate the identifier by qualifying it or
  187. 253.09 s [skylighting-core] by specifying the type/value namespace explicitly.
  188. 253.09 s [skylighting-core] Defaulting to the one defined at src/Skylighting/Types.hs:154:1
  189. 253.09 s [skylighting-core] Warning: 'Document' is ambiguous. It is defined
  190. 253.09 s [skylighting-core] * in ‘Text.XML’
  191. 253.09 s [skylighting-core] * in ‘Text.XML’
  192. 253.09 s [skylighting-core] You may be able to disambiguate the identifier by qualifying it or
  193. 253.09 s [skylighting-core] by specifying the type/value namespace explicitly.
  194. 253.09 s [skylighting-core] Defaulting to the one defined in ‘Text.XML’
  195. 253.09 s [skylighting-core] 66% ( 4 / 6) in 'Skylighting.Parser'
  196. 253.09 s [skylighting-core] Missing documentation for:
  197. 253.09 s [skylighting-core] Module header
  198. 253.09 s [skylighting-core] parseSyntaxDefinitionFromText (src/Skylighting/Parser.hs:100)
  199. 253.09 s [skylighting-core] Warning: 'Syntax' is ambiguous. It is defined
  200. 253.09 s [skylighting-core] * at src/Skylighting/Types.hs:154:15
  201. 253.09 s [skylighting-core] * at src/Skylighting/Types.hs:154:1
  202. 253.09 s [skylighting-core] You may be able to disambiguate the identifier by qualifying it or
  203. 253.09 s [skylighting-core] by specifying the type/value namespace explicitly.
  204. 253.09 s [skylighting-core] Defaulting to the one defined at src/Skylighting/Types.hs:154:1
  205. 253.09 s [skylighting-core] 66% ( 2 / 3) in 'Skylighting.Tokenizer'
  206. 253.09 s [skylighting-core] Missing documentation for:
  207. 253.09 s [skylighting-core] Module header
  208. 253.09 s [skylighting-core] 100% ( 4 / 4) in 'Skylighting.Loader'
  209. 253.09 s [skylighting-core] 91% ( 11 / 12) in 'Skylighting.Core'
  210. 253.09 s [skylighting-core] Missing documentation for:
  211. 253.09 s [skylighting-core] Module header
  212. 253.09 s [skylighting-core] Warning: Skylighting.Regex: could not find link destinations for:
  213. 253.09 s [skylighting-core] - Regex.KDE.Regex.Direction
  214. 253.09 s [typst] [14 of 16] Compiling Typst.Constructors ( src/Typst/Constructors.hs, nothing )
  215. 253.09 s [skylighting-core] Warning: Skylighting.Types: could not find link destinations for:
  216. 253.09 s [skylighting-core] - Skylighting.Types.Rep_FormatOptions
  217. 253.09 s [skylighting-core] - Skylighting.Types.Rep_ANSIColorLevel
  218. 253.09 s [skylighting-core] - Skylighting.Types.Rep_Style
  219. 253.09 s [skylighting-core] - Skylighting.Types.Rep_TokenStyle
  220. 253.09 s [skylighting-core] - Skylighting.Types.Rep_Color
  221. 253.09 s [skylighting-core] - Skylighting.Types.Rep_Syntax
  222. 253.09 s [skylighting-core] - Skylighting.Types.Rep_Context
  223. 253.09 s [skylighting-core] - Skylighting.Types.Rep_Rule
  224. 253.09 s [skylighting-core] - Skylighting.Types.Rep_TokenType
  225. 253.09 s [skylighting-core] - Skylighting.Types.Rep_ListItem
  226. 253.09 s [skylighting-core] - Skylighting.Types.Rep_ContextSwitch
  227. 253.09 s [skylighting-core] - Skylighting.Types.Rep_Matcher
  228. 253.09 s [skylighting-core] - Skylighting.Types.Rep_WordSet
  229. 253.09 s [skylighting-core] - Skylighting.Types.Rep_KeywordAttr
  230. 253.09 s [skylighting-core] Warning: Skylighting.Loader: could not find link destinations for:
  231. 253.09 s [skylighting-core] - Skylighting.Loader.LoadErrMap
  232. 253.09 s [typst] [15 of 16] Compiling Typst.Evaluate ( src/Typst/Evaluate.hs, nothing )
  233. 253.09 s [Cabal] [ 2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, dist/build/Distribution/Backpack/ModSubst.o, dist/build/Distribution/Backpack/ModSubst.dyn_o )
  234. 253.09 s [Cabal] [ 3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, dist/build/Distribution/Backpack/ModuleScope.o, dist/build/Distribution/Backpack/ModuleScope.dyn_o )
  235. 253.09 s [Cabal] [ 4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, dist/build/Distribution/Backpack/ModuleShape.o, dist/build/Distribution/Backpack/ModuleShape.dyn_o )
  236. 253.09 s [typst] [16 of 16] Compiling Typst ( src/Typst.hs, nothing )
  237. 253.09 s [typst] Haddock coverage:
  238. 253.09 s [typst] 0% ( 0 / 13) in 'Typst.Syntax'
  239. 253.09 s [typst] Missing documentation for:
  240. 253.09 s [typst] Module header
  241. 253.09 s [typst] Markup (src/Typst/Syntax.hs:26)
  242. 253.09 s [typst] Identifier (src/Typst/Syntax.hs:58)
  243. 253.09 s [typst] Imports (src/Typst/Syntax.hs:161)
  244. 253.09 s [typst] Arg (src/Typst/Syntax.hs:64)
  245. 253.09 s [typst] Param (src/Typst/Syntax.hs:72)
  246. 253.09 s [typst] Bind (src/Typst/Syntax.hs:80)
  247. 253.09 s [typst] BindPart (src/Typst/Syntax.hs:85)
  248. 253.09 s [typst] Literal (src/Typst/Syntax.hs:94)
  249. 253.09 s [typst] Block (src/Typst/Syntax.hs:104)
  250. 253.09 s [typst] Spreadable (src/Typst/Syntax.hs:109)
  251. 253.09 s [typst] Expr (src/Typst/Syntax.hs:118)
  252. 253.09 s [typst] Unit (src/Typst/Syntax.hs:91)
  253. 253.09 s [typst] 50% ( 1 / 2) in 'Typst.Parse'
  254. 253.09 s [typst] Missing documentation for:
  255. 253.09 s [typst] Module header
  256. 253.09 s [typst] 9% ( 4 / 42) in 'Typst.Types'
  257. 253.09 s [typst] Missing documentation for:
  258. 253.09 s [typst] Module header
  259. 253.09 s [typst] valType (src/Typst/Types.hs:216)
  260. 253.09 s [typst] hasType (src/Typst/Types.hs:250)
  261. 253.09 s [typst] FromVal (src/Typst/Types.hs:256)
  262. 253.09 s [typst] Negatable (src/Typst/Types.hs:428)
  263. 253.09 s [typst] Summable (src/Typst/Types.hs:440)
  264. 253.09 s [typst] Multipliable (src/Typst/Types.hs:476)
  265. 253.09 s [typst] Selector (src/Typst/Types.hs:353)
  266. 253.09 s [typst] Symbol (src/Typst/Types.hs:364)
  267. 253.09 s [typst] Content (src/Typst/Types.hs:551)
  268. 253.09 s [typst] Function (src/Typst/Types.hs:581)
  269. 253.09 s [typst] Arguments (src/Typst/Types.hs:681)
  270. 253.09 s [typst] getPositionalArg (src/Typst/Types.hs:710)
  271. 253.09 s [typst] getNamedArg (src/Typst/Types.hs:716)
  272. 253.09 s [typst] Compare (src/Typst/Types.hs:384)
  273. 253.09 s [typst] MP (src/Typst/Types.hs:679)
  274. 253.09 s [typst] Scope (src/Typst/Types.hs:590)
  275. 253.09 s [typst] FlowDirective (src/Typst/Types.hs:595)
  276. 253.09 s [typst] Operations (src/Typst/Types.hs:602)
  277. 253.09 s [typst] EvalState (src/Typst/Types.hs:610)
  278. 253.09 s [typst] emptyEvalState (src/Typst/Types.hs:631)
  279. 253.09 s [typst] ShowRule (src/Typst/Types.hs:669)
  280. 253.09 s [typst] Counter (src/Typst/Types.hs:721)
  281. 253.09 s [typst] LUnit (src/Typst/Types.hs:728)
  282. 253.09 s [typst] Length (src/Typst/Types.hs:731)
  283. 253.09 s [typst] renderLength (src/Typst/Types.hs:777)
  284. 253.09 s [typst] Horiz (src/Typst/Types.hs:811)
  285. 253.09 s [typst] Vert (src/Typst/Types.hs:814)
  286. 253.09 s [typst] Color (src/Typst/Types.hs:817)
  287. 253.09 s [typst] Direction (src/Typst/Types.hs:823)
  288. 253.09 s [typst] Identifier (src/Typst/Syntax.hs:58)
  289. 253.09 s [typst] lookupIdentifier (src/Typst/Types.hs:996)
  290. 253.09 s [typst] joinVals (src/Typst/Types.hs:372)
  291. 253.09 s [typst] prettyVal (src/Typst/Types.hs:831)
  292. 253.09 s [typst] valToContent (src/Typst/Types.hs:976)
  293. 253.09 s [typst] prettyType (src/Typst/Types.hs:933)
  294. 253.09 s [typst] repr (src/Typst/Types.hs:986)
  295. 253.09 s [typst] Attempt (src/Typst/Types.hs:646)
  296. 253.09 s [typst] 18% ( 2 / 11) in 'Typst.Util'
  297. 253.09 s [typst] Missing documentation for:
  298. 253.09 s [typst] Module header
  299. 253.09 s [typst] TypeSpec (src/Typst/Util.hs:33)
  300. 253.09 s [typst] makeFunction (src/Typst/Util.hs:111)
  301. 253.09 s [typst] makeFunctionWithScope (src/Typst/Util.hs:117)
  302. 253.09 s [typst] makeSymbolMap (src/Typst/Util.hs:152)
  303. 253.09 s [typst] argsToFields (src/Typst/Util.hs:71)
  304. 253.09 s [typst] nthArg (src/Typst/Util.hs:123)
  305. 253.09 s [typst] namedArg (src/Typst/Util.hs:142)
  306. 253.09 s [typst] allArgs (src/Typst/Util.hs:149)
  307. 253.09 s [typst] 0% ( 0 / 4) in 'Typst.Methods'
  308. 253.09 s [typst] Missing documentation for:
  309. 253.09 s [typst] Module header
  310. 253.09 s [typst] getMethod (src/Typst/Methods.hs:51)
  311. 253.09 s [typst] formatNumber (src/Typst/Methods.hs:722)
  312. 253.09 s [typst] applyPureFunction (src/Typst/Module/Standard.hs:605)
  313. 253.09 s [typst] 33% ( 1 / 3) in 'Typst.Evaluate'
  314. 253.09 s [typst] Missing documentation for:
  315. 253.09 s [typst] Module header
  316. 253.09 s [typst] valToContent (src/Typst/Types.hs:976)
  317. 253.09 s [typst] 80% ( 4 / 5) in 'Typst'
  318. 253.09 s [typst] Missing documentation for:
  319. 253.09 s [typst] Module header
  320. 253.09 s [Cabal] [ 5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, dist/build/Distribution/Backpack/PreModuleShape.o, dist/build/Distribution/Backpack/PreModuleShape.dyn_o )
  321. 253.09 s [Cabal] [ 6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, dist/build/Distribution/Compat/Async.o, dist/build/Distribution/Compat/Async.dyn_o )
  322. 253.09 s [Cabal] [ 7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, dist/build/Distribution/Compat/CreatePipe.o, dist/build/Distribution/Compat/CreatePipe.dyn_o )
  323. 253.09 s [Cabal] [ 8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, dist/build/Distribution/Compat/Directory.o, dist/build/Distribution/Compat/Directory.dyn_o )
  324. 253.09 s [Cabal] [ 9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, dist/build/Distribution/Compat/FilePath.o, dist/build/Distribution/Compat/FilePath.dyn_o )
  325. 253.10 s [Cabal] [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, dist/build/Distribution/Compat/GetShortPathName.o, dist/build/Distribution/Compat/GetShortPathName.dyn_o )
  326. 253.10 s [Cabal] [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, dist/build/Distribution/Compat/Internal/TempFile.o, dist/build/Distribution/Compat/Internal/TempFile.dyn_o )
  327. 253.10 s [Cabal] [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, dist/build/Distribution/Compat/CopyFile.o, dist/build/Distribution/Compat/CopyFile.dyn_o )
  328. 253.10 s [Cabal] [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, dist/build/Distribution/Compat/Prelude/Internal.o, dist/build/Distribution/Compat/Prelude/Internal.dyn_o )
  329. 253.10 s [Cabal] [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, dist/build/Distribution/Compat/Process.o, dist/build/Distribution/Compat/Process.dyn_o )
  330. 253.10 s [Cabal] [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, dist/build/Distribution/Compat/ResponseFile.o, dist/build/Distribution/Compat/ResponseFile.dyn_o )
  331. 253.10 s [Cabal] [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, dist/build/Distribution/Compat/SnocList.o, dist/build/Distribution/Compat/SnocList.dyn_o )
  332. 253.10 s [Cabal] [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, dist/build/Distribution/Compat/Stack.o, dist/build/Distribution/Compat/Stack.dyn_o )
  333. 253.10 s [Cabal] [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, dist/build/Distribution/Compat/Environment.o, dist/build/Distribution/Compat/Environment.dyn_o )
  334. 253.10 s [Cabal] [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.o, dist/build/Distribution/GetOpt.dyn_o )
  335. 253.10 s [Cabal] [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, dist/build/Distribution/Lex.o, dist/build/Distribution/Lex.dyn_o )
  336. 253.10 s [Cabal] [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, dist/build/Distribution/PackageDescription/Check/Warning.o, dist/build/Distribution/PackageDescription/Check/Warning.dyn_o )
  337. 253.10 s [typst] Warning: Typst.Types: could not find link destinations for:
  338. 253.10 s [typst] - Data.Vector.Vector
  339. 253.37 s [wai-extra] Preprocessing test suite 'spec' for wai-extra-3.1.18...
  340. 253.37 s [wai-extra] Building test suite 'spec' for wai-extra-3.1.18...
  341. 253.67 s [wai-extra] [ 1 of 15] Compiling Network.Wai.Middleware.ApprootSpec ( test/Network/Wai/Middleware/ApprootSpec.hs, dist/build/spec/spec-tmp/Network/Wai/Middleware/ApprootSpec.o )
  342. 254.83 s [wai-extra] [ 2 of 15] Compiling Network.Wai.Middleware.CombineHeadersSpec ( test/Network/Wai/Middleware/CombineHeadersSpec.hs, dist/build/spec/spec-tmp/Network/Wai/Middleware/CombineHeadersSpec.o )
  343. 255.22 s [wai-extra] [ 3 of 15] Compiling Network.Wai.Middleware.ForceSSLSpec ( test/Network/Wai/Middleware/ForceSSLSpec.hs, dist/build/spec/spec-tmp/Network/Wai/Middleware/ForceSSLSpec.o )
  344. 255.30 s [wai-extra] [ 4 of 15] Compiling Network.Wai.Middleware.RealIpSpec ( test/Network/Wai/Middleware/RealIpSpec.hs, dist/build/spec/spec-tmp/Network/Wai/Middleware/RealIpSpec.o )
  345. 255.50 s [wai-extra] [ 5 of 15] Compiling Network.Wai.Middleware.RequestSizeLimitSpec ( test/Network/Wai/Middleware/RequestSizeLimitSpec.hs, dist/build/spec/spec-tmp/Network/Wai/Middleware/RequestSizeLimitSpec.o )
  346. 255.50 s [wai-extra] [ 6 of 15] Compiling Network.Wai.Middleware.RoutedSpec ( test/Network/Wai/Middleware/RoutedSpec.hs, dist/build/spec/spec-tmp/Network/Wai/Middleware/RoutedSpec.o )
  347. 255.50 s [wai-extra] [ 7 of 15] Compiling Network.Wai.Middleware.SelectSpec ( test/Network/Wai/Middleware/SelectSpec.hs, dist/build/spec/spec-tmp/Network/Wai/Middleware/SelectSpec.o )
  348. 255.50 s [wai-extra] [ 8 of 15] Compiling Network.Wai.Middleware.StripHeadersSpec ( test/Network/Wai/Middleware/StripHeadersSpec.hs, dist/build/spec/spec-tmp/Network/Wai/Middleware/StripHeadersSpec.o )
  349. 255.50 s [wai-extra] [ 9 of 15] Compiling Network.Wai.Middleware.TimeoutSpec ( test/Network/Wai/Middleware/TimeoutSpec.hs, dist/build/spec/spec-tmp/Network/Wai/Middleware/TimeoutSpec.o )
  350. 255.50 s [wai-extra] [10 of 15] Compiling Network.Wai.Middleware.ValidateHeadersSpec ( test/Network/Wai/Middleware/ValidateHeadersSpec.hs, dist/build/spec/spec-tmp/Network/Wai/Middleware/ValidateHeadersSpec.o )
  351. 255.50 s [wai-extra] [11 of 15] Compiling Network.Wai.RequestSpec ( test/Network/Wai/RequestSpec.hs, dist/build/spec/spec-tmp/Network/Wai/RequestSpec.o )
  352. 255.50 s [wai-extra] [12 of 15] Compiling Network.Wai.TestSpec ( test/Network/Wai/TestSpec.hs, dist/build/spec/spec-tmp/Network/Wai/TestSpec.o )
  353. 255.51 s [wai-extra] [13 of 15] Compiling WaiExtraSpec ( test/WaiExtraSpec.hs, dist/build/spec/spec-tmp/WaiExtraSpec.o )
  354. 256.80 s [wai-extra] [14 of 15] Compiling Network.Wai.ParseSpec ( test/Network/Wai/ParseSpec.hs, dist/build/spec/spec-tmp/Network/Wai/ParseSpec.o )
  355. 257.04 s [Cabal] [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, dist/build/Distribution/ReadE.o, dist/build/Distribution/ReadE.dyn_o )
  356. 257.04 s [Cabal] [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, dist/build/Distribution/Simple/BuildToolDepends.o, dist/build/Distribution/Simple/BuildToolDepends.dyn_o )
  357. 257.04 s [Cabal] [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, dist/build/Distribution/Simple/CCompiler.o, dist/build/Distribution/Simple/CCompiler.dyn_o )
  358. 257.04 s [Cabal] [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, dist/build/Distribution/Simple/Flag.o, dist/build/Distribution/Simple/Flag.dyn_o )
  359. 257.04 s [Cabal] [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, dist/build/Distribution/Simple/InstallDirs/Internal.o, dist/build/Distribution/Simple/InstallDirs/Internal.dyn_o )
  360. 257.04 s [Cabal] [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, dist/build/Distribution/Simple/InstallDirs.o, dist/build/Distribution/Simple/InstallDirs.dyn_o )
  361. 257.04 s [Cabal] [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, dist/build/Distribution/Simple/Program/Internal.o, dist/build/Distribution/Simple/Program/Internal.dyn_o )
  362. 257.04 s [Cabal] [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.o, dist/build/Distribution/TestSuite.dyn_o )
  363. 257.04 s [Cabal] [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, dist/build/Distribution/Types/AnnotatedId.o, dist/build/Distribution/Types/AnnotatedId.dyn_o )
  364. 257.04 s [Cabal] [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, dist/build/Distribution/Backpack/PreExistingComponent.o, dist/build/Distribution/Backpack/PreExistingComponent.dyn_o )
  365. 257.04 s [Cabal] [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, dist/build/Distribution/Types/ComponentInclude.o, dist/build/Distribution/Types/ComponentInclude.dyn_o )
  366. 257.04 s [Cabal] [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, dist/build/Distribution/Types/ComponentLocalBuildInfo.o, dist/build/Distribution/Types/ComponentLocalBuildInfo.dyn_o )
  367. 257.04 s [Cabal] [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, dist/build/Distribution/Types/DumpBuildInfo.o, dist/build/Distribution/Types/DumpBuildInfo.dyn_o )
  368. 257.04 s [Cabal] [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, dist/build/Distribution/Types/GivenComponent.o, dist/build/Distribution/Types/GivenComponent.dyn_o )
  369. 257.04 s [Cabal] [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, dist/build/Distribution/Types/PackageName/Magic.o, dist/build/Distribution/Types/PackageName/Magic.dyn_o )
  370. 257.04 s [Cabal] [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, dist/build/Distribution/Types/ParStrat.o, dist/build/Distribution/Types/ParStrat.dyn_o )
  371. 257.04 s [Cabal] [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, dist/build/Distribution/Types/TargetInfo.o, dist/build/Distribution/Types/TargetInfo.dyn_o )
  372. 257.04 s [Cabal] [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, dist/build/Distribution/Utils/IOData.o, dist/build/Distribution/Utils/IOData.dyn_o )
  373. 257.04 s [Cabal] [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, dist/build/Distribution/Utils/Json.o, dist/build/Distribution/Utils/Json.dyn_o )
  374. 257.04 s [Cabal] [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, dist/build/Distribution/Utils/MapAccum.o, dist/build/Distribution/Utils/MapAccum.dyn_o )
  375. 257.04 s [Cabal] [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, dist/build/Distribution/Utils/Progress.o, dist/build/Distribution/Utils/Progress.dyn_o )
  376. 257.04 s [Cabal] [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, dist/build/Distribution/Utils/UnionFind.o, dist/build/Distribution/Utils/UnionFind.dyn_o )
  377. 257.04 s [Cabal] [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, dist/build/Distribution/Verbosity/Internal.o, dist/build/Distribution/Verbosity/Internal.dyn_o )
  378. 257.04 s [Cabal] [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.o, dist/build/Distribution/Verbosity.dyn_o )
  379. 257.04 s [Cabal] [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, dist/build/Distribution/Simple/Program/Types.o, dist/build/Distribution/Simple/Program/Types.dyn_o )
  380. 257.04 s [Cabal] [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, dist/build/Distribution/Simple/PreProcess/Types.o, dist/build/Distribution/Simple/PreProcess/Types.dyn_o )
  381. 257.04 s [Cabal] [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, dist/build/Distribution/Simple/Errors.o, dist/build/Distribution/Simple/Errors.dyn_o )
  382. 257.26 s [Cabal] [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, dist/build/Distribution/Simple/PreProcess/Unlit.o, dist/build/Distribution/Simple/PreProcess/Unlit.dyn_o )
  383. 257.46 s [Cabal] [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, dist/build/Distribution/Backpack/UnifyM.o, dist/build/Distribution/Backpack/UnifyM.dyn_o )
  384. 257.46 s [Cabal] [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, dist/build/Distribution/Backpack/MixLink.o, dist/build/Distribution/Backpack/MixLink.dyn_o )
  385. 257.46 s [Cabal] [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, dist/build/Distribution/ZinzaPrelude.o, dist/build/Distribution/ZinzaPrelude.dyn_o )
  386. 257.46 s [Cabal] [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, dist/build/Distribution/Simple/Build/PathsModule/Z.o, dist/build/Distribution/Simple/Build/PathsModule/Z.dyn_o )
  387. 257.46 s [Cabal] [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.o, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.dyn_o )
  388. 257.46 s [Cabal] [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, dist/build/Distribution/Simple/Build/Macros/Z.o, dist/build/Distribution/Simple/Build/Macros/Z.dyn_o )
  389. 257.46 s [Cabal] [ 56 of 146] Compiling Paths_Cabal ( dist/build/autogen/Paths_Cabal.hs, dist/build/Paths_Cabal.o, dist/build/Paths_Cabal.dyn_o )
  390. 257.46 s [Cabal] [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, dist/build/Distribution/Simple/Utils.o, dist/build/Distribution/Simple/Utils.dyn_o )
  391. 257.54 s [citeproc] Documentation created: dist/doc/html/citeproc/,
  392. 257.54 s [citeproc] dist/doc/html/citeproc/citeproc.txt
  393. 257.65 s [citeproc] Preprocessing executable 'citeproc' for citeproc-0.9.0.1...
  394. 257.65 s [citeproc] Preprocessing test suite 'spec' for citeproc-0.9.0.1...
  395. 257.66 s [citeproc] haddockPhase completed in 1 minutes 2 seconds
  396. 257.66 s [citeproc] Phase: installPhase
  397. 257.84 s [citeproc] Installing library in /nix/store/sj4zqjbyyv69hyx854qbwj0mkn9ygbck-citeproc-0.9.0.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/citeproc-0.9.0.1-8eZIkwGUgwZIclKUEeSqkh
  398. 258.20 s [wai-extra] [15 of 15] Compiling Main ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
  399. 258.54 s [citeproc] Installing executable citeproc in /nix/store/pwlq6hjnajfyvfr67vhmcdjm978iax8j-citeproc-0.9.0.1-bin/bin
  400. 258.54 s [citeproc] Warning: The directory
  401. 258.54 s [citeproc] /nix/store/pwlq6hjnajfyvfr67vhmcdjm978iax8j-citeproc-0.9.0.1-bin/bin is not in
  402. 258.54 s [citeproc] the system search path.
  403. 259.05 s [wai-extra] [16 of 16] Linking dist/build/spec/spec
  404. 259.05 s [citeproc] Phase: fixupPhase
  405. 259.08 s [citeproc] shrinking RPATHs of ELF executables and libraries in /nix/store/sj4zqjbyyv69hyx854qbwj0mkn9ygbck-citeproc-0.9.0.1
  406. 259.08 s [citeproc] shrinking /nix/store/sj4zqjbyyv69hyx854qbwj0mkn9ygbck-citeproc-0.9.0.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSciteproc-0.9.0.1-8eZIkwGUgwZIclKUEeSqkh-ghc9.10.3.so
  407. 259.14 s [citeproc] checking for references to /build/ in /nix/store/sj4zqjbyyv69hyx854qbwj0mkn9ygbck-citeproc-0.9.0.1...
  408. 259.17 s [citeproc] patching script interpreter paths in /nix/store/sj4zqjbyyv69hyx854qbwj0mkn9ygbck-citeproc-0.9.0.1
  409. 259.18 s [citeproc] stripping (with command strip and flags -S -p) in /nix/store/sj4zqjbyyv69hyx854qbwj0mkn9ygbck-citeproc-0.9.0.1/lib
  410. 259.39 s [Cabal] [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, dist/build/Distribution/Utils/NubList.o, dist/build/Distribution/Utils/NubList.dyn_o )
  411. 259.79 s [citeproc] shrinking RPATHs of ELF executables and libraries in /nix/store/lq3azpkjqp1bvjppniiaki01jgrycawi-citeproc-0.9.0.1-doc
  412. 259.81 s [citeproc] checking for references to /build/ in /nix/store/lq3azpkjqp1bvjppniiaki01jgrycawi-citeproc-0.9.0.1-doc...
  413. 259.84 s [citeproc] patching script interpreter paths in /nix/store/lq3azpkjqp1bvjppniiaki01jgrycawi-citeproc-0.9.0.1-doc
  414. 259.85 s [citeproc] shrinking RPATHs of ELF executables and libraries in /nix/store/pwlq6hjnajfyvfr67vhmcdjm978iax8j-citeproc-0.9.0.1-bin
  415. 259.85 s [citeproc] shrinking /nix/store/pwlq6hjnajfyvfr67vhmcdjm978iax8j-citeproc-0.9.0.1-bin/bin/citeproc
  416. 259.88 s [citeproc] checking for references to /build/ in /nix/store/pwlq6hjnajfyvfr67vhmcdjm978iax8j-citeproc-0.9.0.1-bin...
  417. 259.91 s [citeproc] patching script interpreter paths in /nix/store/pwlq6hjnajfyvfr67vhmcdjm978iax8j-citeproc-0.9.0.1-bin
  418. 259.92 s [citeproc] stripping (with command strip and flags -S -p) in /nix/store/pwlq6hjnajfyvfr67vhmcdjm978iax8j-citeproc-0.9.0.1-bin/bin
  419. 260.33 s [citeproc:post-build] Uploading to cachix cache "sellout": /nix/store/lq3azpkjqp1bvjppniiaki01jgrycawi-citeproc-0.9.0.1-doc /nix/store/pwlq6hjnajfyvfr67vhmcdjm978iax8j-citeproc-0.9.0.1-bin /nix/store/sj4zqjbyyv69hyx854qbwj0mkn9ygbck-citeproc-0.9.0.1
  420. 261.25 s [citeproc:post-build] Pushing 3 paths (230 are already present) using zstd to cache sellout ⏳
  421. 261.25 s [citeproc:post-build]
  422. 261.61 s [citeproc:post-build] Pushing /nix/store/pwlq6hjnajfyvfr67vhmcdjm978iax8j-citeproc-0.9.0.1-bin (10.44 MiB)
  423. 261.78 s [citeproc:post-build] Pushing /nix/store/lq3azpkjqp1bvjppniiaki01jgrycawi-citeproc-0.9.0.1-doc (6.02 MiB)
  424. 261.79 s [citeproc:post-build] Pushing /nix/store/sj4zqjbyyv69hyx854qbwj0mkn9ygbck-citeproc-0.9.0.1 (37.07 MiB)
  425. 263.78 s [citeproc:post-build]
  426. 263.78 s [citeproc:post-build] All done.
  427. 263.80 s [citeproc:post-build] Uploading to the NixCI cache: /nix/store/lq3azpkjqp1bvjppniiaki01jgrycawi-citeproc-0.9.0.1-doc /nix/store/pwlq6hjnajfyvfr67vhmcdjm978iax8j-citeproc-0.9.0.1-bin /nix/store/sj4zqjbyyv69hyx854qbwj0mkn9ygbck-citeproc-0.9.0.1
  428. 263.87 s [citeproc:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  429. 264.17 s [citeproc:post-build] copying 3 paths...
  430. 264.17 s [citeproc:post-build] copying path '/nix/store/lq3azpkjqp1bvjppniiaki01jgrycawi-citeproc-0.9.0.1-doc' to 'https://cache.nix-ci.com'...
  431. 264.17 s [citeproc:post-build] copying path '/nix/store/pwlq6hjnajfyvfr67vhmcdjm978iax8j-citeproc-0.9.0.1-bin' to 'https://cache.nix-ci.com'...
  432. 268.82 s [citeproc:post-build] copying path '/nix/store/sj4zqjbyyv69hyx854qbwj0mkn9ygbck-citeproc-0.9.0.1' to 'https://cache.nix-ci.com'...
  433. 279.58 s [citeproc:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  434. 279.85 s [citeproc:post-build] copying 1 paths...
  435. 279.85 s [citeproc:post-build] copying path '/nix/store/i43b7xzx659wiklv23a7245lrm8n35g0-citeproc-0.9.0.1.drv' to 'https://cache.nix-ci.com'...
  436. 280.13 s Progress: 16 of 52 built (4 building), 373 of 373 downloaded from cache
  437. 280.13 s [Cabal] [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, dist/build/Distribution/Utils/LogProgress.o, dist/build/Distribution/Utils/LogProgress.dyn_o )
  438. 280.13 s [Cabal] [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, dist/build/Distribution/Simple/Program/Run.o, dist/build/Distribution/Simple/Program/Run.dyn_o )
  439. 280.13 s [Cabal] [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, dist/build/Distribution/Simple/Program/Script.o, dist/build/Distribution/Simple/Program/Script.dyn_o )
  440. 280.13 s [Cabal] [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, dist/build/Distribution/Simple/Program/ResponseFile.o, dist/build/Distribution/Simple/Program/ResponseFile.dyn_o )
  441. 280.13 s [Cabal] [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, dist/build/Distribution/Simple/Program/Hpc.o, dist/build/Distribution/Simple/Program/Hpc.dyn_o )
  442. 280.13 s [Cabal] [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, dist/build/Distribution/Simple/Program/Find.o, dist/build/Distribution/Simple/Program/Find.dyn_o )
  443. 280.13 s [Cabal] [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, dist/build/Distribution/Simple/PackageIndex.o, dist/build/Distribution/Simple/PackageIndex.dyn_o )
  444. 280.13 s [Cabal] [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, dist/build/Distribution/Simple/PackageDescription.o, dist/build/Distribution/Simple/PackageDescription.dyn_o )
  445. 280.13 s [Cabal] [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, dist/build/Distribution/Simple/Glob/Internal.o, dist/build/Distribution/Simple/Glob/Internal.dyn_o )
  446. 280.13 s [Cabal] [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, dist/build/Distribution/Simple/Glob.o, dist/build/Distribution/Simple/Glob.dyn_o )
  447. 280.13 s [Cabal] [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, dist/build/Distribution/PackageDescription/Check/Monad.o, dist/build/Distribution/PackageDescription/Check/Monad.dyn_o )
  448. 280.13 s [Cabal] [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, dist/build/Distribution/PackageDescription/Check/Conditional.o, dist/build/Distribution/PackageDescription/Check/Conditional.dyn_o )
  449. 280.13 s [Cabal] [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, dist/build/Distribution/PackageDescription/Check/Common.o, dist/build/Distribution/PackageDescription/Check/Common.dyn_o )
  450. 280.13 s [Cabal] [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, dist/build/Distribution/Simple/Compiler.o, dist/build/Distribution/Simple/Compiler.dyn_o )
  451. 280.13 s [Cabal] [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, dist/build/Distribution/Simple/Program/HcPkg.o, dist/build/Distribution/Simple/Program/HcPkg.dyn_o )
  452. 280.13 s [Cabal] [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, dist/build/Distribution/Simple/GHC/ImplInfo.o, dist/build/Distribution/Simple/GHC/ImplInfo.dyn_o )
  453. 280.13 s [Cabal] [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, dist/build/Distribution/Simple/Program/GHC.o, dist/build/Distribution/Simple/Program/GHC.dyn_o )
  454. 280.14 s [Cabal] [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, dist/build/Distribution/Simple/Program/Builtin.o, dist/build/Distribution/Simple/Program/Builtin.dyn_o )
  455. 280.14 s [Cabal] [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, dist/build/Distribution/Simple/Program/Db.o, dist/build/Distribution/Simple/Program/Db.dyn_o )
  456. 280.14 s [skylighting-core] Documentation created: dist/doc/html/skylighting-core/,
  457. 280.14 s [skylighting-core] dist/doc/html/skylighting-core/skylighting-core.txt
  458. 280.14 s [skylighting-core] Preprocessing test suite 'test-skylighting' for skylighting-core-0.14.7...
  459. 280.14 s [skylighting-core] Phase: installPhase
  460. 280.14 s [skylighting-core] Installing library in /nix/store/2axbmxn0v15sj61fjpn0ikh6wpakaj1f-skylighting-core-0.14.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/skylighting-core-0.14.7-JAldI9DCe9w9P5SyroEqPQ
  461. 280.14 s [skylighting-core] Phase: fixupPhase
  462. 280.14 s [skylighting-core] shrinking RPATHs of ELF executables and libraries in /nix/store/2axbmxn0v15sj61fjpn0ikh6wpakaj1f-skylighting-core-0.14.7
  463. 280.14 s [skylighting-core] shrinking /nix/store/2axbmxn0v15sj61fjpn0ikh6wpakaj1f-skylighting-core-0.14.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSskylighting-core-0.14.7-JAldI9DCe9w9P5SyroEqPQ-ghc9.10.3.so
  464. 280.14 s [skylighting-core] checking for references to /build/ in /nix/store/2axbmxn0v15sj61fjpn0ikh6wpakaj1f-skylighting-core-0.14.7...
  465. 280.14 s [skylighting-core] patching script interpreter paths in /nix/store/2axbmxn0v15sj61fjpn0ikh6wpakaj1f-skylighting-core-0.14.7
  466. 280.14 s [skylighting-core] stripping (with command strip and flags -S -p) in /nix/store/2axbmxn0v15sj61fjpn0ikh6wpakaj1f-skylighting-core-0.14.7/lib
  467. 280.14 s [skylighting-core] shrinking RPATHs of ELF executables and libraries in /nix/store/k3bcv3wmf7af70pqkqf3yp6im1mq41xb-skylighting-core-0.14.7-doc
  468. 280.14 s [skylighting-core] checking for references to /build/ in /nix/store/k3bcv3wmf7af70pqkqf3yp6im1mq41xb-skylighting-core-0.14.7-doc...
  469. 280.14 s [skylighting-core] patching script interpreter paths in /nix/store/k3bcv3wmf7af70pqkqf3yp6im1mq41xb-skylighting-core-0.14.7-doc
  470. 280.14 s [typst] Documentation created: dist/doc/html/typst/, dist/doc/html/typst/typst.txt
  471. 280.14 s [typst] Preprocessing test suite 'typst-test' for typst-0.8.0.2...
  472. 280.14 s [typst] Phase: installPhase
  473. 280.14 s [typst] Installing library in /nix/store/vqck80fdw00g006l7n58j28qdnxw595g-typst-0.8.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/typst-0.8.0.2-EEUEU4SJlQfAZBQbpbwWwc
  474. 280.14 s [typst] Phase: fixupPhase
  475. 280.14 s [typst] shrinking RPATHs of ELF executables and libraries in /nix/store/vqck80fdw00g006l7n58j28qdnxw595g-typst-0.8.0.2
  476. 280.14 s [typst] shrinking /nix/store/vqck80fdw00g006l7n58j28qdnxw595g-typst-0.8.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHStypst-0.8.0.2-EEUEU4SJlQfAZBQbpbwWwc-ghc9.10.3.so
  477. 280.14 s [typst] checking for references to /build/ in /nix/store/vqck80fdw00g006l7n58j28qdnxw595g-typst-0.8.0.2...
  478. 280.14 s [typst] patching script interpreter paths in /nix/store/vqck80fdw00g006l7n58j28qdnxw595g-typst-0.8.0.2
  479. 280.14 s [typst] stripping (with command strip and flags -S -p) in /nix/store/vqck80fdw00g006l7n58j28qdnxw595g-typst-0.8.0.2/lib
  480. 280.14 s [typst] shrinking RPATHs of ELF executables and libraries in /nix/store/pj6hx9414yl95n43rd3zna35nzr73mxi-typst-0.8.0.2-doc
  481. 280.14 s [typst] checking for references to /build/ in /nix/store/pj6hx9414yl95n43rd3zna35nzr73mxi-typst-0.8.0.2-doc...
  482. 280.14 s [typst] patching script interpreter paths in /nix/store/pj6hx9414yl95n43rd3zna35nzr73mxi-typst-0.8.0.2-doc
  483. 280.14 s [wai-extra] buildPhase completed in 1 minutes 6 seconds
  484. 280.14 s [wai-extra] Phase: checkPhase
  485. 280.14 s [wai-extra] Running 1 test suites...
  486. 280.14 s [wai-extra] Test suite spec: RUNNING...
  487. 280.14 s [wai-extra]
  488. 280.14 s [wai-extra] Network.Wai.Middleware.Approot
  489. 280.14 s [wai-extra] respects host header [✔]
  490. 280.14 s [wai-extra] respects isSecure [✔]
  491. 280.14 s [wai-extra] respects SSL headers [✔]
  492. 280.14 s [wai-extra] Network.Wai.Middleware.CombineHeaders
  493. 280.14 s [wai-extra] should reorder alphabetically (request) [✔]
  494. 280.14 s [wai-extra] should reorder alphabetically (response) [✔]
  495. 280.14 s [wai-extra] combines Accept (in order) [✔]
  496. 280.14 s [wai-extra] combines Cache-Control (in order) and keeps Set-Cookie (in order) [✔]
  497. 280.14 s [wai-extra] KeepOnly works as expected (present | request) [✔]
  498. 280.14 s [wai-extra] KeepOnly works as expected ( absent | request) [✔]
  499. 280.14 s [wai-extra] KeepOnly works as expected (present | response) [✔]
  500. 280.14 s [wai-extra] KeepOnly works as expected ( absent | response) [✔]
  501. 280.14 s [wai-extra] Technically acceptable headers get combined correctly (request) [✔]
  502. 280.14 s [wai-extra] Technically acceptable headers get combined correctly (response) [✔]
  503. 280.14 s [wai-extra] Network.Wai.Middleware.ForceSSL
  504. 280.14 s [wai-extra] forceSSL
  505. 280.14 s [wai-extra] forceSSL on host "example.com"
  506. 280.14 s [wai-extra] redirects non-https requests to https [✔]
  507. 280.14 s [wai-extra] redirects with 307 in the case of a non-GET request [✔]
  508. 280.14 s [wai-extra] does not redirect already-secure requests [✔]
  509. 280.14 s [wai-extra] preserves the original host, path, and query string [✔]
  510. 280.14 s [wai-extra] forceSSL on host "example.com:80"
  511. 280.14 s [wai-extra] redirects non-https requests to https [✔]
  512. 280.14 s [wai-extra] redirects with 307 in the case of a non-GET request [✔]
  513. 280.14 s [wai-extra] does not redirect already-secure requests [✔]
  514. 280.14 s [wai-extra] preserves the original host, path, and query string [✔]
  515. 280.14 s [wai-extra] forceSSL on host "example.com:8080"
  516. 280.14 s [wai-extra] redirects non-https requests to https [✔]
  517. 280.14 s [wai-extra] redirects with 307 in the case of a non-GET request [✔]
  518. 280.14 s [wai-extra] does not redirect already-secure requests [✔]
  519. 280.14 s [wai-extra] preserves the original host, path, and query string [✔]
  520. 280.14 s [wai-extra] Network.Wai.Middleware.RealIp
  521. 280.14 s [wai-extra] realIp
  522. 280.14 s [wai-extra] does nothing when header is missing [✔]
  523. 280.14 s [wai-extra] uses X-Forwarded-For when present [✔]
  524. 280.14 s [wai-extra] ignores X-Forwarded-For from non-trusted ip [✔]
  525. 280.14 s [wai-extra] ignores trusted ip addresses in X-Forwarded-For [✔]
  526. 280.14 s [wai-extra] ignores invalid ip addresses [✔]
  527. 280.14 s [wai-extra] takes the last non-trusted address [✔]
  528. 280.14 s [wai-extra] takes the first address when all are trusted [✔]
  529. 280.14 s [wai-extra] handles repeated headers [✔]
  530. 280.14 s [wai-extra] handles ipv6 addresses [✔]
  531. 280.14 s [wai-extra] realIpHeader
  532. 280.14 s [wai-extra] uses specified header [✔]
  533. 280.14 s [wai-extra] realIpTrusted
  534. 280.14 s [wai-extra] uses provided trusted predicate [✔]
  535. 280.14 s [wai-extra] Network.Wai.Middleware.RequestSizeLimit
  536. 280.14 s [wai-extra] RequestSizeLimitMiddleware
  537. 280.14 s [wai-extra] Plain text response
  538. 280.14 s [wai-extra] returns 413 for request bodies > 10 bytes, when streaming the whole body
  539. 280.14 s [wai-extra] chunked [✔]
  540. 280.14 s [wai-extra] non-chunked [✔]
  541. 280.14 s [wai-extra] returns 200 for request bodies <= 10 bytes, when streaming the whole body
  542. 280.14 s [wai-extra] chunked [✔]
  543. 280.14 s [wai-extra] non-chunked [✔]
  544. 280.14 s [wai-extra] JSON response
  545. 280.14 s [wai-extra] returns 413 for request bodies > 10 bytes, when streaming the whole body
  546. 280.14 s [wai-extra] chunked [✔]
  547. 280.14 s [wai-extra] non-chunked [✔]
  548. 280.14 s [wai-extra] returns 200 for request bodies <= 10 bytes, when streaming the whole body
  549. 280.14 s [wai-extra] chunked [✔]
  550. 280.14 s [wai-extra] non-chunked [✔]
  551. 280.14 s [wai-extra] Per-request sizes
  552. 280.14 s [wai-extra] allows going over the limit, when the path has been whitelisted [✔]
  553. 280.14 s [wai-extra] streaming chunked bodies
  554. 280.14 s [wai-extra] 413s if the combined chunk size is > the size limit [✔]
  555. 280.14 s [wai-extra] 200s if the combined chunk size is <= the size limit [✔]
  556. 280.14 s [wai-extra] Network.Wai.Middleware.Routed
  557. 280.14 s [wai-extra] forceSSL
  558. 280.14 s [wai-extra] routed middleware [✔]
  559. 280.14 s [wai-extra] Network.Wai.Middleware.Select
  560. 280.14 s [wai-extra] Select
  561. 280.14 s [wai-extra] With empty select should passthrough [✔]
  562. 280.14 s [wai-extra] With other path select should passthrough [✔]
  563. 280.14 s [wai-extra] With path select should hit override [✔]
  564. 280.14 s [wai-extra] With twice path select should hit first override [✔]
  565. 280.14 s [wai-extra] With two paths select should hit first matching (first) [✔]
  566. 280.14 s [wai-extra] With two paths select should hit first matching (last) [✔]
  567. 280.14 s [wai-extra] With other two paths select should passthrough [✔]
  568. 280.14 s [wai-extra] With mempty then the path select should hit the pass [✔]
  569. 280.14 s [wai-extra] Network.Wai.Middleware.StripHeaders
  570. 280.14 s [wai-extra] stripHeader
  571. 280.14 s [wai-extra] strips a specific header [✔]
  572. 280.14 s [wai-extra] strips specific set of headers [✔]
  573. 280.14 s [wai-extra] Network.Wai.Middleware.Timeout
  574. 280.14 s [wai-extra] timeout
  575. 280.14 s [wai-extra] times out slow requests with 503 [✔]
  576. 280.14 s [wai-extra] does not time out fast requests [✔]
  577. 280.14 s [wai-extra] timeoutStatus
  578. 280.14 s [wai-extra] allows customizing the timeout response status [✔]
  579. 280.14 s [wai-extra] timeoutAs
  580. 280.14 s [Cabal] [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, dist/build/Distribution/Simple/Program.o, dist/build/Distribution/Simple/Program.dyn_o )
  581. 280.14 s [Cabal] [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, dist/build/Distribution/Simple/Program/Strip.o, dist/build/Distribution/Simple/Program/Strip.dyn_o )
  582. 280.14 s [Cabal] [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, dist/build/Distribution/Simple/Command.o, dist/build/Distribution/Simple/Command.dyn_o )
  583. 280.14 s [Cabal] [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, dist/build/Distribution/Simple/Setup/Common.o, dist/build/Distribution/Simple/Setup/Common.dyn_o )
  584. 280.14 s [Cabal] [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, dist/build/Distribution/Simple/Setup/Test.o, dist/build/Distribution/Simple/Setup/Test.dyn_o )
  585. 280.14 s [Cabal] [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, dist/build/Distribution/Simple/Setup/SDist.o, dist/build/Distribution/Simple/Setup/SDist.dyn_o )
  586. 280.14 s [Cabal] [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, dist/build/Distribution/Simple/Setup/Repl.o, dist/build/Distribution/Simple/Setup/Repl.dyn_o )
  587. 280.14 s [Cabal] [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, dist/build/Distribution/Simple/Setup/Register.o, dist/build/Distribution/Simple/Setup/Register.dyn_o )
  588. 280.14 s [Cabal] [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, dist/build/Distribution/Simple/Setup/Install.o, dist/build/Distribution/Simple/Setup/Install.dyn_o )
  589. 280.14 s [Cabal] [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, dist/build/Distribution/Simple/Setup/Hscolour.o, dist/build/Distribution/Simple/Setup/Hscolour.dyn_o )
  590. 280.14 s [Cabal] [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, dist/build/Distribution/Simple/Setup/Haddock.o, dist/build/Distribution/Simple/Setup/Haddock.dyn_o )
  591. 280.14 s [Cabal] [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, dist/build/Distribution/Simple/Setup/Global.o, dist/build/Distribution/Simple/Setup/Global.dyn_o )
  592. 280.14 s [Cabal] [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, dist/build/Distribution/Simple/Setup/Copy.o, dist/build/Distribution/Simple/Setup/Copy.dyn_o )
  593. 280.14 s [Cabal] [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, dist/build/Distribution/Simple/Setup/Config.o, dist/build/Distribution/Simple/Setup/Config.dyn_o )
  594. 280.14 s [Cabal] [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, dist/build/Distribution/Types/LocalBuildConfig.o, dist/build/Distribution/Types/LocalBuildConfig.dyn_o )
  595. 280.14 s [Cabal] [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, dist/build/Distribution/Types/LocalBuildInfo.o, dist/build/Distribution/Types/LocalBuildInfo.dyn_o )
  596. 280.14 s [Cabal] [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.o, dist/build/Distribution/Simple/LocalBuildInfo.dyn_o )
  597. 280.14 s [Cabal] [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, dist/build/Distribution/Simple/Test/Log.o, dist/build/Distribution/Simple/Test/Log.dyn_o )
  598. 280.14 s [Cabal] [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.o, dist/build/Distribution/Simple/Hpc.dyn_o )
  599. 280.14 s [Cabal] [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, dist/build/Distribution/Simple/Build/PackageInfoModule.o, dist/build/Distribution/Simple/Build/PackageInfoModule.dyn_o )
  600. 280.14 s [Cabal] [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.o, dist/build/Distribution/Simple/Build/Macros.dyn_o )
  601. 280.51 s [skylighting-core:post-build] Uploading to cachix cache "sellout": /nix/store/2axbmxn0v15sj61fjpn0ikh6wpakaj1f-skylighting-core-0.14.7 /nix/store/k3bcv3wmf7af70pqkqf3yp6im1mq41xb-skylighting-core-0.14.7-doc
  602. 281.33 s [skylighting-core:post-build] Pushing 2 paths (212 are already present) using zstd to cache sellout ⏳
  603. 281.33 s [skylighting-core:post-build]
  604. 281.70 s [skylighting-core:post-build] Pushing /nix/store/2axbmxn0v15sj61fjpn0ikh6wpakaj1f-skylighting-core-0.14.7 (26.65 MiB)
  605. 281.80 s [skylighting-core:post-build] Pushing /nix/store/k3bcv3wmf7af70pqkqf3yp6im1mq41xb-skylighting-core-0.14.7-doc (3.39 MiB)
  606. 283.01 s [skylighting-core:post-build]
  607. 283.01 s [skylighting-core:post-build] All done.
  608. 283.12 s [skylighting-core:post-build] Uploading to the NixCI cache: /nix/store/2axbmxn0v15sj61fjpn0ikh6wpakaj1f-skylighting-core-0.14.7 /nix/store/k3bcv3wmf7af70pqkqf3yp6im1mq41xb-skylighting-core-0.14.7-doc
  609. 283.38 s [skylighting-core:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  610. 283.63 s [skylighting-core:post-build] copying 2 paths...
  611. 283.63 s [skylighting-core:post-build] copying path '/nix/store/k3bcv3wmf7af70pqkqf3yp6im1mq41xb-skylighting-core-0.14.7-doc' to 'https://cache.nix-ci.com'...
  612. 284.47 s [skylighting-core:post-build] copying path '/nix/store/2axbmxn0v15sj61fjpn0ikh6wpakaj1f-skylighting-core-0.14.7' to 'https://cache.nix-ci.com'...
  613. 293.41 s [skylighting-core:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  614. 293.75 s [skylighting-core:post-build] copying 1 paths...
  615. 293.79 s [skylighting-core:post-build] copying path '/nix/store/qgw30mpavpr1i14180hjvjb7y50xadiy-skylighting-core-0.14.7.drv' to 'https://cache.nix-ci.com'...
  616. 294.05 s Progress: 17 of 52 built (3 building), 373 of 373 downloaded from cache
  617. 294.35 s [typst:post-build] Uploading to cachix cache "sellout": /nix/store/pj6hx9414yl95n43rd3zna35nzr73mxi-typst-0.8.0.2-doc /nix/store/vqck80fdw00g006l7n58j28qdnxw595g-typst-0.8.0.2
  618. 295.14 s [typst:post-build] Pushing 2 paths (224 are already present) using zstd to cache sellout ⏳
  619. 295.14 s [typst:post-build]
  620. 295.52 s [typst:post-build] Pushing /nix/store/vqck80fdw00g006l7n58j28qdnxw595g-typst-0.8.0.2 (71.57 MiB)
  621. 295.59 s [typst:post-build] Pushing /nix/store/pj6hx9414yl95n43rd3zna35nzr73mxi-typst-0.8.0.2-doc (6.75 MiB)
  622. 297.29 s [typst:post-build]
  623. 297.29 s [typst:post-build] All done.
  624. 297.32 s [typst:post-build] Uploading to the NixCI cache: /nix/store/pj6hx9414yl95n43rd3zna35nzr73mxi-typst-0.8.0.2-doc /nix/store/vqck80fdw00g006l7n58j28qdnxw595g-typst-0.8.0.2
  625. 297.44 s [typst:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  626. 297.68 s [typst:post-build] copying 2 paths...
  627. 297.68 s [typst:post-build] copying path '/nix/store/pj6hx9414yl95n43rd3zna35nzr73mxi-typst-0.8.0.2-doc' to 'https://cache.nix-ci.com'...
  628. 299.16 s [typst:post-build] copying path '/nix/store/vqck80fdw00g006l7n58j28qdnxw595g-typst-0.8.0.2' to 'https://cache.nix-ci.com'...
  629. 323.10 s [typst:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  630. 323.38 s [typst:post-build] copying 1 paths...
  631. 323.42 s [typst:post-build] copying path '/nix/store/6kq0l4jnzgy2kz8z6ckg15iiv0zc720n-typst-0.8.0.2.drv' to 'https://cache.nix-ci.com'...
  632. 324.61 s Progress: 18 of 53 built (2 building), 373 of 373 downloaded from cache
  633. 324.61 s [wai-extra] allows customizing the timeout response [✔]
  634. 324.61 s [wai-extra] Network.Wai.Middleware.ValidateHeaders
  635. 324.61 s [wai-extra] validateHeadersMiddleware
  636. 324.61 s [wai-extra] allows token characters in header names [✔]
  637. 324.61 s [wai-extra] does not allow colons in header names [✔]
  638. 324.61 s [wai-extra] does not allow whitespace in header names [✔]
  639. 324.61 s [wai-extra] allows visible ASCII, space and horizontal tab in header values [✔]
  640. 324.61 s [wai-extra] allows octets beyond 0x80 in headers values [✔]
  641. 324.61 s [wai-extra] does not allow other whitespace in header values [✔]
  642. 324.61 s [wai-extra] does not allow control characters in header values [✔]
  643. 324.61 s [wai-extra] does not allow trailing whitespace in header values [✔]
  644. 324.61 s [wai-extra] Network.Wai.Parse
  645. 324.61 s [wai-extra] parseContentType
  646. 324.61 s [wai-extra] text/plain [✔]
  647. 324.61 s [wai-extra] text/plain; charset=UTF-8 [✔]
  648. 324.61 s [wai-extra] text/plain; charset=UTF-8 ; boundary = foo [✔]
  649. 324.61 s [wai-extra] text/plain; charset=UTF-8 ; boundary = "quoted" [✔]
  650. 324.61 s [wai-extra] parseHttpAccept [✔]
  651. 324.61 s [wai-extra] parseRequestBody
  652. 324.61 s [wai-extra] parsing post x-www-form-urlencoded [✔]
  653. 324.61 s [wai-extra] parsing post multipart/form-data [✔]
  654. 324.61 s [wai-extra] parsing post multipart/form-data 2 [✔]
  655. 324.61 s [wai-extra] parsing actual post multipart/form-data [✔]
  656. 324.61 s [wai-extra] parsing actual post multipart/form-data 2 [✔]
  657. 324.61 s [wai-extra] parsing with memory limit [✔]
  658. 324.61 s [wai-extra] exceeding number of files [✔]
  659. 324.61 s [wai-extra] exceeding parameter length [✔]
  660. 324.61 s [wai-extra] exceeding file size [✔]
  661. 324.61 s [wai-extra] exceeding total file size [✔]
  662. 324.61 s [wai-extra] exceeding max parm value size [✔]
  663. 324.61 s [wai-extra] exceeding max header lines [✔]
  664. 324.61 s [wai-extra] exceeding header line size [✔]
  665. 324.61 s [wai-extra] Testing parseRequestBodyEx with application/x-www-form-urlencoded [✔]
  666. 324.61 s [wai-extra] exceeding max parm value size with x-www-form-urlencoded mimetype [✔]
  667. 324.61 s [wai-extra] parsing filename with semi-colon [✔]
  668. 324.61 s [wai-extra] parsing filename with semi-colon [✔]
  669. 324.61 s [wai-extra] multipart with plus [✔]
  670. 324.61 s [wai-extra] multipart with multiple attributes [✔]
  671. 324.61 s [wai-extra] urlencoded with plus [✔]
  672. 324.61 s [wai-extra] dalvik multipart
  673. 324.61 s [wai-extra] non-chunked [✔]
  674. 324.61 s [wai-extra] chunked [✔]
  675. 324.61 s [wai-extra] Network.Wai.Request
  676. 324.61 s [wai-extra] requestSizeCheck
  677. 324.61 s [wai-extra] too large content length should throw RequestSizeException [✔]
  678. 324.61 s [wai-extra] too many chunks should throw RequestSizeException [✔]
  679. 324.61 s [wai-extra] appearsSecure
  680. 324.61 s [wai-extra] returns False for an insecure request [✔]
  681. 324.61 s [wai-extra] checks if the Request is actually secure [✔]
  682. 324.61 s [wai-extra] checks for HTTP: on [✔]
  683. 324.61 s [wai-extra] checks for HTTP_X_FORWARDED_SSL: on [✔]
  684. 324.61 s [wai-extra] checks for HTTP_X_FORWARDED_SCHEME: https [✔]
  685. 324.61 s [wai-extra] checks for HTTP_X_FORWARDED_PROTO: https,... [✔]
  686. 324.61 s [wai-extra] Network.Wai.Test
  687. 324.61 s [wai-extra] setPath
  688. 324.61 s [wai-extra] sets pathInfo [✔]
  689. 324.61 s [wai-extra] utf8 path [✔]
  690. 324.61 s [wai-extra] sets rawPathInfo [✔]
  691. 324.61 s [wai-extra] sets queryString [✔]
  692. 324.61 s [wai-extra] sets rawQueryString [✔]
  693. 324.61 s [wai-extra] when path has no query string
  694. 324.61 s [wai-extra] sets rawQueryString to empty string [✔]
  695. 324.61 s [wai-extra] srequest
  696. 324.61 s [wai-extra] returns the response body of an echo app [✔]
  697. 324.61 s [wai-extra] request
  698. 324.61 s [wai-extra] returns the status code of an echo app on default request [✔]
  699. 324.61 s [wai-extra] returns the response body of an echo app [✔]
  700. 324.61 s [wai-extra] returns the response headers of an echo app [✔]
  701. 324.61 s [wai-extra] sends a Cookie header with correct value after receiving a Set-Cookie header [✔]
  702. 324.61 s [wai-extra] sends a Cookie header with updated value after receiving a Set-Cookie header update [✔]
  703. 324.61 s [wai-extra] handles multiple cookies [✔]
  704. 324.61 s [wai-extra] removes a deleted cookie [✔]
  705. 324.61 s [wai-extra] sends a cookie set with setClientCookie to server [✔]
  706. 324.61 s [wai-extra] sends a cookie updated with setClientCookie to server [✔]
  707. 324.61 s [wai-extra] does not send a cookie deleted with deleteClientCookie to server [✔]
  708. 324.61 s [wai-extra] WaiExtra
  709. 324.61 s [wai-extra] Network.Wai.UrlMap
  710. 324.61 s [wai-extra] should mount root [✔]
  711. 324.61 s [wai-extra] should mount apps [✔]
  712. 324.61 s [wai-extra] should preserve extra path info [✔]
  713. 324.61 s [wai-extra] should 404 if none match [✔]
  714. 324.61 s [wai-extra] Network.Wai
  715. 324.61 s [wai-extra] jsonp [✔]
  716. 324.61 s [wai-extra] gzip
  717. 324.61 s [wai-extra] gzip [✔]
  718. 324.61 s [wai-extra] more gzip [✔]
  719. 324.61 s [wai-extra] gzip not on partial content [✔]
  720. 324.61 s [wai-extra] gzip removes length header [✔]
  721. 324.61 s [wai-extra] gzip not for MSIE [✔]
  722. 324.61 s [wai-extra] gzip bypass when precompressed [✔]
  723. 324.61 s [wai-extra] defaultCheckMime [✔]
  724. 324.61 s [wai-extra] gzip checking of files [✔]
  725. 324.61 s [wai-extra] vhost [✔]
  726. 324.61 s [wai-extra] autohead [✔]
  727. 324.61 s [wai-extra] method override [✔]
  728. 324.61 s [wai-extra] method override post [✔]
  729. 324.61 s [wai-extra] accept override [✔]
  730. 324.61 s [wai-extra] debug request body [✔]
  731. 324.61 s [wai-extra] stream file [✔]
  732. 324.61 s [wai-extra] stream LBS [✔]
  733. 324.61 s [wai-extra] can modify POST params before logging [✔]
  734. 324.61 s [wai-extra] can filter requests in logs [✔]
  735. 324.61 s [wai-extra] can parse Q values [✔]
  736. 324.61 s [wai-extra]
  737. 324.61 s [wai-extra] Finished in 3.0174 seconds
  738. 324.61 s [wai-extra] 146 examples, 0 failures
  739. 324.61 s [wai-extra] Test suite spec: PASS
  740. 324.61 s [wai-extra] Test suite logged to: dist/test/wai-extra-3.1.18-spec.log
  741. 324.61 s [wai-extra] 1 of 1 test suites (1 of 1 test cases) passed.
  742. 324.63 s Waiting for lock on skylighting-format-ansi
  743. 324.63 s Waiting for lock on skylighting-format-blaze-html-0.1.1.3-doc
  744. 324.64 s Waiting for lock on skylighting-format-context-0.1.0.2-doc
  745. 324.64 s Waiting for lock on skylighting-format-typst
  746. 324.64 s [Cabal] [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, dist/build/Distribution/Backpack/Id.o, dist/build/Distribution/Backpack/Id.dyn_o )
  747. 324.64 s [Cabal] [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, dist/build/Distribution/Backpack/ConfiguredComponent.o, dist/build/Distribution/Backpack/ConfiguredComponent.dyn_o )
  748. 324.64 s [Cabal] [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, dist/build/Distribution/Backpack/LinkedComponent.o, dist/build/Distribution/Backpack/LinkedComponent.dyn_o )
  749. 324.64 s [Cabal] [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, dist/build/Distribution/Backpack/ComponentsGraph.o, dist/build/Distribution/Backpack/ComponentsGraph.dyn_o )
  750. 324.64 s [Cabal] [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.o, dist/build/Distribution/Simple/Program/Ld.dyn_o )
  751. 324.64 s [Cabal] [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.o, dist/build/Distribution/Simple/Program/Ar.dyn_o )
  752. 324.64 s [Cabal] [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, dist/build/Distribution/Simple/ConfigureScript.o, dist/build/Distribution/Simple/ConfigureScript.dyn_o )
  753. 324.64 s [Cabal] [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, dist/build/Distribution/Simple/Setup/Clean.o, dist/build/Distribution/Simple/Setup/Clean.dyn_o )
  754. 324.64 s [Cabal] [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, dist/build/Distribution/Simple/Setup/Build.o, dist/build/Distribution/Simple/Setup/Build.dyn_o )
  755. 324.64 s [Cabal] [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, dist/build/Distribution/Simple/Setup/Benchmark.o, dist/build/Distribution/Simple/Setup/Benchmark.dyn_o )
  756. 324.64 s [Cabal] [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.o, dist/build/Distribution/Simple/Setup.dyn_o )
  757. 324.64 s [Cabal] [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, dist/build/Distribution/Simple/Build/Inputs.o, dist/build/Distribution/Simple/Build/Inputs.dyn_o )
  758. 324.64 s [Cabal] [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, dist/build/Distribution/Simple/BuildTarget.o, dist/build/Distribution/Simple/BuildTarget.dyn_o )
  759. 324.64 s [Cabal] [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.o, dist/build/Distribution/Simple/BuildPaths.dyn_o )
  760. 324.64 s [Cabal] [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.o, dist/build/Distribution/Simple/UHC.dyn_o )
  761. 324.64 s [Cabal] [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, dist/build/Distribution/Simple/HaskellSuite.o, dist/build/Distribution/Simple/HaskellSuite.dyn_o )
  762. 324.64 s [Cabal] [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, dist/build/Distribution/Simple/GHC/Internal.o, dist/build/Distribution/Simple/GHC/Internal.dyn_o )
  763. 324.64 s [Cabal] [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, dist/build/Distribution/Simple/GHC/EnvironmentParser.o, dist/build/Distribution/Simple/GHC/EnvironmentParser.dyn_o )
  764. 324.64 s [Cabal] [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, dist/build/Distribution/Simple/GHCJS.o, dist/build/Distribution/Simple/GHCJS.dyn_o )
  765. 324.64 s [Cabal] [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, dist/build/Distribution/Simple/GHC/Build/Utils.o, dist/build/Distribution/Simple/GHC/Build/Utils.dyn_o )
  766. 324.64 s [Cabal] [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, dist/build/Distribution/Simple/GHC/Build/Modules.o, dist/build/Distribution/Simple/GHC/Build/Modules.dyn_o )
  767. 324.64 s [wai-extra] Phase: haddockPhase
  768. 324.64 s [wai-extra] Preprocessing library for wai-extra-3.1.18...
  769. 324.64 s [wai-extra] Running Haddock on library for wai-extra-3.1.18...
  770. 324.64 s [wai-extra] Warning: The documentation for the following packages are not installed. No
  771. 324.64 s [wai-extra] links will be generated to these packages: attoparsec-0.14.4,
  772. 324.64 s [wai-extra] attoparsec-0.14.4, vector-0.13.2.0
  773. 324.64 s [wai-extra] [ 1 of 40] Compiling Network.Wai.EventSource.EventStream ( Network/Wai/EventSource/EventStream.hs, nothing )
  774. 324.64 s [wai-extra] [ 2 of 40] Compiling Network.Wai.EventSource ( Network/Wai/EventSource.hs, nothing )
  775. 324.64 s [wai-extra] [ 3 of 40] Compiling Network.Wai.Handler.CGI ( Network/Wai/Handler/CGI.hs, nothing )
  776. 324.64 s [wai-extra] [ 4 of 40] Compiling Network.Wai.Handler.SCGI ( Network/Wai/Handler/SCGI.hs, nothing )
  777. 324.64 s [wai-extra] [ 5 of 40] Compiling Network.Wai.Middleware.AddHeaders ( Network/Wai/Middleware/AddHeaders.hs, nothing )
  778. 324.64 s [wai-extra] [ 6 of 40] Compiling Network.Wai.Middleware.Autohead ( Network/Wai/Middleware/Autohead.hs, nothing )
  779. 324.64 s [wai-extra] [ 7 of 40] Compiling Network.Wai.Middleware.CleanPath ( Network/Wai/Middleware/CleanPath.hs, nothing )
  780. 324.64 s [wai-extra] [ 8 of 40] Compiling Network.Wai.Middleware.HealthCheckEndpoint ( Network/Wai/Middleware/HealthCheckEndpoint.hs, nothing )
  781. 324.64 s [wai-extra] [ 9 of 40] Compiling Network.Wai.Middleware.HttpAuth ( Network/Wai/Middleware/HttpAuth.hs, nothing )
  782. 324.64 s [wai-extra] [10 of 40] Compiling Network.Wai.Middleware.Jsonp ( Network/Wai/Middleware/Jsonp.hs, nothing )
  783. 324.64 s [wai-extra] [11 of 40] Compiling Network.Wai.Middleware.Local ( Network/Wai/Middleware/Local.hs, nothing )
  784. 324.64 s [wai-extra] [12 of 40] Compiling Network.Wai.Middleware.MethodOverride ( Network/Wai/Middleware/MethodOverride.hs, nothing )
  785. 324.64 s [wai-extra] [13 of 40] Compiling Network.Wai.Middleware.MethodOverridePost ( Network/Wai/Middleware/MethodOverridePost.hs, nothing )
  786. 324.64 s [wai-extra] [14 of 40] Compiling Network.Wai.Middleware.RealIp ( Network/Wai/Middleware/RealIp.hs, nothing )
  787. 324.64 s [wai-extra] [15 of 40] Compiling Network.Wai.Middleware.RequestLogger.Internal ( Network/Wai/Middleware/RequestLogger/Internal.hs, nothing )
  788. 324.64 s [wai-extra] [16 of 40] Compiling Network.Wai.Middleware.RequestSizeLimit.Internal ( Network/Wai/Middleware/RequestSizeLimit/Internal.hs, nothing )
  789. 324.64 s [wai-extra] [17 of 40] Compiling Network.Wai.Middleware.Rewrite ( Network/Wai/Middleware/Rewrite.hs, nothing )
  790. 324.64 s [wai-extra] [18 of 40] Compiling Network.Wai.Middleware.Routed ( Network/Wai/Middleware/Routed.hs, nothing )
  791. 324.64 s [wai-extra] [19 of 40] Compiling Network.Wai.Middleware.Select ( Network/Wai/Middleware/Select.hs, nothing )
  792. 324.64 s [wai-extra] [20 of 40] Compiling Network.Wai.Middleware.StreamFile ( Network/Wai/Middleware/StreamFile.hs, nothing )
  793. 324.64 s [wai-extra] [21 of 40] Compiling Network.Wai.Middleware.StripHeaders ( Network/Wai/Middleware/StripHeaders.hs, nothing )
  794. 324.64 s [wai-extra] [22 of 40] Compiling Network.Wai.Middleware.Timeout ( Network/Wai/Middleware/Timeout.hs, nothing )
  795. 324.64 s [wai-extra] [23 of 40] Compiling Network.Wai.Middleware.ValidateHeaders ( Network/Wai/Middleware/ValidateHeaders.hs, nothing )
  796. 324.64 s [wai-extra] [24 of 40] Compiling Network.Wai.Middleware.Vhost ( Network/Wai/Middleware/Vhost.hs, nothing )
  797. 324.64 s [wai-extra] [25 of 40] Compiling Network.Wai.Parse ( Network/Wai/Parse.hs, nothing )
  798. 324.64 s [wai-extra] [26 of 40] Compiling Network.Wai.Request ( Network/Wai/Request.hs, nothing )
  799. 324.64 s [wai-extra] [27 of 40] Compiling Network.Wai.Middleware.RequestSizeLimit ( Network/Wai/Middleware/RequestSizeLimit.hs, nothing )
  800. 324.64 s [wai-extra] [28 of 40] Compiling Network.Wai.Middleware.ForceSSL ( Network/Wai/Middleware/ForceSSL.hs, nothing )
  801. 324.64 s [wai-extra] [29 of 40] Compiling Network.Wai.Middleware.ForceDomain ( Network/Wai/Middleware/ForceDomain.hs, nothing )
  802. 324.64 s [wai-extra] [30 of 40] Compiling Network.Wai.Middleware.Approot ( Network/Wai/Middleware/Approot.hs, nothing )
  803. 324.64 s [wai-extra] [31 of 40] Compiling Network.Wai.Test.Internal ( Network/Wai/Test/Internal.hs, nothing )
  804. 324.64 s [wai-extra] [32 of 40] Compiling Network.Wai.Test ( Network/Wai/Test.hs, nothing )
  805. 324.64 s [wai-extra] [33 of 40] Compiling Network.Wai.UrlMap ( Network/Wai/UrlMap.hs, nothing )
  806. 324.64 s [wai-extra] [34 of 40] Compiling Network.Wai.Util ( Network/Wai/Util.hs, nothing )
  807. 324.64 s [wai-extra] [35 of 40] Compiling Network.Wai.Middleware.CombineHeaders ( Network/Wai/Middleware/CombineHeaders.hs, nothing )
  808. 324.64 s [wai-extra] [36 of 40] Compiling Network.Wai.Header ( Network/Wai/Header.hs, nothing )
  809. 324.64 s [wai-extra] [37 of 40] Compiling Network.Wai.Middleware.RequestLogger ( Network/Wai/Middleware/RequestLogger.hs, nothing )
  810. 324.64 s [Cabal] [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, dist/build/Distribution/Simple/GHC/Build/ExtraSources.o, dist/build/Distribution/Simple/GHC/Build/ExtraSources.dyn_o )
  811. 324.64 s [Cabal] [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, dist/build/Distribution/Simple/GHC/Build/Link.o, dist/build/Distribution/Simple/GHC/Build/Link.dyn_o )
  812. 324.64 s [Cabal] [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, dist/build/Distribution/Simple/GHC/Build.o, dist/build/Distribution/Simple/GHC/Build.dyn_o )
  813. 324.64 s [Cabal] [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.o, dist/build/Distribution/Simple/GHC.dyn_o )
  814. 324.64 s [Cabal] [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, dist/build/Distribution/Simple/ShowBuildInfo.o, dist/build/Distribution/Simple/ShowBuildInfo.dyn_o )
  815. 324.64 s [Cabal] [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.o, dist/build/Distribution/Simple/Install.dyn_o )
  816. 324.64 s [Cabal] [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, dist/build/Distribution/Simple/Build/PathsModule.o, dist/build/Distribution/Simple/Build/PathsModule.dyn_o )
  817. 324.64 s [Cabal] [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, dist/build/Distribution/Simple/Test/LibV09.o, dist/build/Distribution/Simple/Test/LibV09.dyn_o )
  818. 324.64 s [Cabal] [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, dist/build/Distribution/Simple/Test/ExeV10.o, dist/build/Distribution/Simple/Test/ExeV10.dyn_o )
  819. 324.64 s [Cabal] [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, dist/build/Distribution/PackageDescription/Check/Paths.o, dist/build/Distribution/PackageDescription/Check/Paths.dyn_o )
  820. 324.64 s [Cabal] [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, dist/build/Distribution/PackageDescription/Check/Target.o, dist/build/Distribution/PackageDescription/Check/Target.dyn_o )
  821. 324.64 s [Cabal] [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.o, dist/build/Distribution/PackageDescription/Check.dyn_o )
  822. 324.64 s [Cabal] [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.o, dist/build/Distribution/Make.dyn_o )
  823. 324.64 s [Cabal] [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, dist/build/Distribution/Compat/Time.o, dist/build/Distribution/Compat/Time.dyn_o )
  824. 324.64 s [Cabal] [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, dist/build/Distribution/Backpack/ReadyComponent.o, dist/build/Distribution/Backpack/ReadyComponent.dyn_o )
  825. 324.64 s [Cabal] [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, dist/build/Distribution/Backpack/Configure.o, dist/build/Distribution/Backpack/Configure.dyn_o )
  826. 324.64 s [Cabal] [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, dist/build/Distribution/Backpack/DescribeUnitId.o, dist/build/Distribution/Backpack/DescribeUnitId.dyn_o )
  827. 324.64 s [Cabal] [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.o, dist/build/Distribution/Simple/Register.dyn_o )
  828. 324.64 s [Cabal] [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.o, dist/build/Distribution/Simple/PreProcess.dyn_o )
  829. 324.64 s [Cabal] [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.o, dist/build/Distribution/Simple/UserHooks.dyn_o )
  830. 324.64 s [Cabal] [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.o, dist/build/Distribution/Simple/Bench.dyn_o )
  831. 324.64 s [wai-extra] [38 of 40] Compiling Network.Wai.Middleware.RequestLogger.JSON ( Network/Wai/Middleware/RequestLogger/JSON.hs, nothing )
  832. 324.64 s [wai-extra] [39 of 40] Compiling Network.Wai.Middleware.Gzip ( Network/Wai/Middleware/Gzip.hs, nothing )
  833. 324.64 s [wai-extra] [40 of 40] Compiling Network.Wai.Middleware.AcceptOverride ( Network/Wai/Middleware/AcceptOverride.hs, nothing )
  834. 324.64 s [wai-extra] Haddock coverage:
  835. 324.64 s [wai-extra] Warning: 'ServerEvent' is ambiguous. It is defined
  836. 324.64 s [wai-extra] * at Network/Wai/EventSource/EventStream.hs:23:7
  837. 324.64 s [wai-extra] * at Network/Wai/EventSource/EventStream.hs:22:1
  838. 324.64 s [wai-extra] You may be able to disambiguate the identifier by qualifying it or
  839. 324.64 s [wai-extra] by specifying the type/value namespace explicitly.
  840. 324.64 s [wai-extra] Defaulting to the one defined at Network/Wai/EventSource/EventStream.hs:22:1
  841. 324.64 s [wai-extra] 100% ( 3 / 3) in 'Network.Wai.EventSource.EventStream'
  842. 324.64 s [wai-extra] 100% ( 5 / 5) in 'Network.Wai.EventSource'
  843. 324.64 s [wai-extra] 80% ( 4 / 5) in 'Network.Wai.Handler.CGI'
  844. 324.64 s [wai-extra] Missing documentation for:
  845. 324.64 s [wai-extra] requestBodyFunc (Network/Wai/Handler/CGI.hs:205)
  846. 324.64 s [wai-extra] 0% ( 0 / 3) in 'Network.Wai.Handler.SCGI'
  847. 324.64 s [wai-extra] Missing documentation for:
  848. 324.64 s [wai-extra] Module header
  849. 324.64 s [wai-extra] run (Network/Wai/Handler/SCGI.hs:23)
  850. 324.64 s [wai-extra] runSendfile (Network/Wai/Handler/SCGI.hs:26)
  851. 324.64 s [wai-extra] 100% ( 2 / 2) in 'Network.Wai.Middleware.AddHeaders'
  852. 324.64 s [wai-extra] 50% ( 1 / 2) in 'Network.Wai.Middleware.Autohead'
  853. 324.64 s [wai-extra] Missing documentation for:
  854. 324.64 s [wai-extra] autohead (Network/Wai/Middleware/Autohead.hs:18)
  855. 324.64 s [wai-extra] 0% ( 0 / 2) in 'Network.Wai.Middleware.CleanPath'
  856. 324.64 s [wai-extra] Missing documentation for:
  857. 324.64 s [wai-extra] Module header
  858. 324.64 s [wai-extra] cleanPath (Network/Wai/Middleware/CleanPath.hs:21)
  859. 324.64 s [wai-extra] 100% ( 3 / 3) in 'Network.Wai.Middleware.HealthCheckEndpoint'
  860. 324.64 s [wai-extra] 100% ( 12 / 12) in 'Network.Wai.Middleware.HttpAuth'
  861. 324.64 s [wai-extra] 100% ( 2 / 2) in 'Network.Wai.Middleware.Jsonp'
  862. 324.64 s [wai-extra] 100% ( 2 / 2) in 'Network.Wai.Middleware.Local'
  863. 324.64 s [wai-extra] Warning: '_method' is out of scope.
  864. 324.64 s [wai-extra] If you qualify the identifier, haddock can try to link it anyway.
  865. 324.64 s [wai-extra] 50% ( 1 / 2) in 'Network.Wai.Middleware.MethodOverride'
  866. 324.64 s [wai-extra] Missing documentation for:
  867. 324.64 s [wai-extra] Module header
  868. 324.64 s [wai-extra] 100% ( 2 / 2) in 'Network.Wai.Middleware.MethodOverridePost'
  869. 324.64 s [wai-extra] Warning: 'Request' is out of scope.
  870. 324.64 s [wai-extra] If you qualify the identifier, haddock can try to link it anyway.
  871. 324.64 s [wai-extra] 100% ( 6 / 6) in 'Network.Wai.Middleware.RealIp'
  872. 324.64 s [wai-extra] Warning: 'requestSizeLimitMiddleware' is out of scope.
  873. 324.64 s [wai-extra] If you qualify the identifier, haddock can try to link it anyway.
  874. 324.64 s [wai-extra] Warning: 'defaultRequestSizeLimitSettings' is out of scope.
  875. 324.64 s [wai-extra] If you qualify the identifier, haddock can try to link it anyway.
  876. 324.64 s [wai-extra] 100% ( 4 / 4) in 'Network.Wai.Middleware.RequestSizeLimit.Internal'
  877. 324.64 s [wai-extra] Warning: 'rawQueryInfo' is out of scope.
  878. 324.64 s [wai-extra] If you qualify the identifier, haddock can try to link it anyway.
  879. 324.64 s [wai-extra] 95% ( 22 / 23) in 'Network.Wai.Middleware.Rewrite'
  880. 324.64 s [wai-extra] Missing documentation for:
  881. 324.64 s [wai-extra] Module header
  882. 324.64 s [wai-extra] 100% ( 3 / 3) in 'Network.Wai.Middleware.Routed'
  883. 324.64 s [wai-extra] Warning: 'MiddlewareSelection' is ambiguous. It is defined
  884. 324.64 s [wai-extra] * at Network/Wai/Middleware/Select.hs:55:31
  885. 324.64 s [wai-extra] * at Network/Wai/Middleware/Select.hs:55:1
  886. 324.64 s [wai-extra] You may be able to disambiguate the identifier by qualifying it or
  887. 324.64 s [wai-extra] by specifying the type/value namespace explicitly.
  888. 324.64 s [wai-extra] Defaulting to the one defined at Network/Wai/Middleware/Select.hs:55:1
  889. 324.64 s [wai-extra] 88% ( 8 / 9) in 'Network.Wai.Middleware.Select'
  890. 324.64 s [wai-extra] Missing documentation for:
  891. 324.64 s [wai-extra] passthroughMiddleware (Network/Wai/Middleware/Select.hs:81)
  892. 324.64 s [wai-extra] 100% ( 2 / 2) in 'Network.Wai.Middleware.StreamFile'
  893. 324.64 s [wai-extra] 40% ( 2 / 5) in 'Network.Wai.Middleware.StripHeaders'
  894. 324.64 s [wai-extra] Missing documentation for:
  895. 324.64 s [wai-extra] Module header
  896. 324.64 s [wai-extra] stripHeader (Network/Wai/Middleware/StripHeaders.hs:29)
  897. 324.64 s [wai-extra] stripHeaders (Network/Wai/Middleware/StripHeaders.hs:32)
  898. 324.64 s [wai-extra] 100% ( 4 / 4) in 'Network.Wai.Middleware.Timeout'
  899. 324.64 s [wai-extra] 100% ( 9 / 9) in 'Network.Wai.Middleware.ValidateHeaders'
  900. 324.64 s [wai-extra] 0% ( 0 / 5) in 'Network.Wai.Middleware.Vhost'
  901. 324.64 s [wai-extra] Missing documentation for:
  902. 324.64 s [wai-extra] Module header
  903. 324.64 s [wai-extra] vhost (Network/Wai/Middleware/Vhost.hs:20)
  904. 324.64 s [wai-extra] redirectWWW (Network/Wai/Middleware/Vhost.hs:26)
  905. 324.64 s [wai-extra] redirectTo (Network/Wai/Middleware/Vhost.hs:38)
  906. 324.64 s [wai-extra] redirectToLogged (Network/Wai/Middleware/Vhost.hs:45)
  907. 324.64 s [wai-extra] 100% ( 34 / 34) in 'Network.Wai.Parse'
  908. 324.65 s [wai-extra] Warning: 'RequestSizeException' is ambiguous. It is defined
  909. 324.65 s [wai-extra] * at Network/Wai/Request.hs:65:7
  910. 324.65 s [wai-extra] * at Network/Wai/Request.hs:64:1
  911. 324.65 s [Cabal] [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.o, dist/build/Distribution/Simple/Configure.dyn_o )
  912. 324.65 s [Cabal] [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.o, dist/build/Distribution/Simple/Test.dyn_o )
  913. 324.65 s [Cabal] [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.o, dist/build/Distribution/Simple/SrcDist.dyn_o )
  914. 324.65 s [Cabal] [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.o, dist/build/Distribution/Simple/Build.dyn_o )
  915. 324.65 s [Cabal] [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.o, dist/build/Distribution/Simple/Haddock.dyn_o )
  916. 324.65 s [Cabal] [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.o, dist/build/Distribution/Simple.dyn_o )
  917. 324.65 s [Cabal] [ 1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, dist/build/Distribution/Backpack/FullUnitId.p_o )
  918. 324.65 s [Cabal] [ 2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, dist/build/Distribution/Backpack/ModSubst.p_o )
  919. 324.65 s [Cabal] [ 3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, dist/build/Distribution/Backpack/ModuleScope.p_o )
  920. 324.65 s [Cabal] [ 4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, dist/build/Distribution/Backpack/ModuleShape.p_o )
  921. 324.65 s [Cabal] [ 5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, dist/build/Distribution/Backpack/PreModuleShape.p_o )
  922. 324.65 s [Cabal] [ 6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, dist/build/Distribution/Compat/Async.p_o )
  923. 324.65 s [Cabal] [ 7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, dist/build/Distribution/Compat/CreatePipe.p_o )
  924. 324.65 s [Cabal] [ 8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, dist/build/Distribution/Compat/Directory.p_o )
  925. 324.65 s [Cabal] [ 9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, dist/build/Distribution/Compat/FilePath.p_o )
  926. 324.65 s [Cabal] [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, dist/build/Distribution/Compat/GetShortPathName.p_o )
  927. 324.65 s [Cabal] [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, dist/build/Distribution/Compat/Internal/TempFile.p_o )
  928. 324.65 s [Cabal] [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, dist/build/Distribution/Compat/CopyFile.p_o )
  929. 324.65 s [Cabal] [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, dist/build/Distribution/Compat/Prelude/Internal.p_o )
  930. 324.65 s [Cabal] [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, dist/build/Distribution/Compat/Process.p_o )
  931. 324.65 s [Cabal] [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, dist/build/Distribution/Compat/ResponseFile.p_o )
  932. 324.65 s [Cabal] [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, dist/build/Distribution/Compat/SnocList.p_o )
  933. 324.65 s [Cabal] [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, dist/build/Distribution/Compat/Stack.p_o )
  934. 324.65 s [Cabal] [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, dist/build/Distribution/Compat/Environment.p_o )
  935. 324.65 s [Cabal] [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.p_o )
  936. 324.65 s [Cabal] [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, dist/build/Distribution/Lex.p_o )
  937. 324.65 s [Cabal] [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, dist/build/Distribution/PackageDescription/Check/Warning.p_o )
  938. 324.65 s [wai-extra] You may be able to disambiguate the identifier by qualifying it or
  939. 324.65 s [wai-extra] by specifying the type/value namespace explicitly.
  940. 324.65 s [wai-extra] Defaulting to the one defined at Network/Wai/Request.hs:64:1
  941. 324.65 s [wai-extra] 100% ( 5 / 5) in 'Network.Wai.Request'
  942. 324.65 s [wai-extra] Warning: 'RequestSizeLimitSettings' is ambiguous. It is defined
  943. 324.65 s [wai-extra] * at Network/Wai/Middleware/RequestSizeLimit/Internal.hs:42:33
  944. 324.65 s [wai-extra] * at Network/Wai/Middleware/RequestSizeLimit/Internal.hs:42:1
  945. 324.65 s [wai-extra] You may be able to disambiguate the identifier by qualifying it or
  946. 324.65 s [wai-extra] by specifying the type/value namespace explicitly.
  947. 324.65 s [wai-extra] Defaulting to the one defined at Network/Wai/Middleware/RequestSizeLimit/Internal.hs:42:1
  948. 324.65 s [wai-extra] 100% ( 9 / 9) in 'Network.Wai.Middleware.RequestSizeLimit'
  949. 324.65 s [wai-extra] 100% ( 2 / 2) in 'Network.Wai.Middleware.ForceSSL'
  950. 324.65 s [wai-extra] Warning: 'checkDomain' is out of scope.
  951. 324.65 s [wai-extra] If you qualify the identifier, haddock can try to link it anyway.
  952. 324.65 s [wai-extra] 100% ( 2 / 2) in 'Network.Wai.Middleware.ForceDomain'
  953. 324.65 s [wai-extra] 100% ( 11 / 11) in 'Network.Wai.Middleware.Approot'
  954. 324.65 s [wai-extra] Warning: 'runSession' is out of scope.
  955. 324.65 s [wai-extra] If you qualify the identifier, haddock can try to link it anyway.
  956. 324.65 s [wai-extra] 50% ( 3 / 6) in 'Network.Wai.Test.Internal'
  957. 324.65 s [wai-extra] Missing documentation for:
  958. 324.65 s [wai-extra] Module header
  959. 324.65 s [wai-extra] Session (Network/Wai/Test/Internal.hs:11)
  960. 324.65 s [wai-extra] ClientState (Network/Wai/Test/Internal.hs:18)
  961. 324.65 s [wai-extra] 58% ( 17 / 29) in 'Network.Wai.Test'
  962. 324.65 s [wai-extra] Missing documentation for:
  963. 324.65 s [wai-extra] Module header
  964. 324.65 s [wai-extra] Session (Network/Wai/Test/Internal.hs:11)
  965. 324.65 s [wai-extra] request (Network/Wai/Test.hs:120)
  966. 324.65 s [wai-extra] SRequest (Network/Wai/Test.hs:104)
  967. 324.65 s [wai-extra] SResponse (Network/Wai/Test.hs:112)
  968. 324.65 s [wai-extra] setRawPathInfo (Network/Wai/Test.hs:142)
  969. 324.65 s [wai-extra] assertStatus (Network/Wai/Test.hs:253)
  970. 324.65 s [wai-extra] assertContentType (Network/Wai/Test.hs:230)
  971. 324.65 s [wai-extra] assertBody (Network/Wai/Test.hs:267)
  972. 324.65 s [wai-extra] assertBodyContains (Network/Wai/Test.hs:279)
  973. 324.65 s [wai-extra] assertHeader (Network/Wai/Test.hs:294)
  974. 324.65 s [wai-extra] assertNoHeader (Network/Wai/Test.hs:319)
  975. 324.65 s [wai-extra] 57% ( 4 / 7) in 'Network.Wai.UrlMap'
  976. 324.65 s [wai-extra] Missing documentation for:
  977. 324.65 s [wai-extra] UrlMap' (Network/Wai/UrlMap.hs:37)
  978. 324.65 s [wai-extra] UrlMap (Network/Wai/UrlMap.hs:63)
  979. 324.65 s [wai-extra] mapUrls (Network/Wai/UrlMap.hs:121)
  980. 324.65 s [wai-extra] Warning: 'CombineSettings' is ambiguous. It is defined
  981. 324.65 s [wai-extra] * at Network/Wai/Middleware/CombineHeaders.hs:60:24
  982. 324.65 s [wai-extra] * at Network/Wai/Middleware/CombineHeaders.hs:60:1
  983. 324.65 s [wai-extra] You may be able to disambiguate the identifier by qualifying it or
  984. 324.65 s [wai-extra] by specifying the type/value namespace explicitly.
  985. 324.65 s [wai-extra] Defaulting to the one defined at Network/Wai/Middleware/CombineHeaders.hs:60:1
  986. 324.65 s [wai-extra] Warning: 'ByteString' is out of scope.
  987. 324.65 s [wai-extra] If you qualify the identifier, haddock can try to link it anyway.
  988. 324.65 s [wai-extra] 100% ( 15 / 15) in 'Network.Wai.Middleware.CombineHeaders'
  989. 324.65 s [wai-extra] 75% ( 3 / 4) in 'Network.Wai.Header'
  990. 324.65 s [wai-extra] Missing documentation for:
  991. 324.65 s [wai-extra] replaceHeader (Network/Wai/Header.hs:30)
  992. 324.65 s [wai-extra] Warning: 'Handle' is ambiguous. It is defined
  993. 324.65 s [wai-extra] * in ‘GHC.Internal.IO.Handle.Types’
  994. 324.65 s [wai-extra] * at Network/Wai/Middleware/RequestLogger.hs:232:7
  995. 324.65 s [wai-extra] You may be able to disambiguate the identifier by qualifying it or
  996. 324.65 s [wai-extra] by specifying the type/value namespace explicitly.
  997. 324.65 s [wai-extra] Defaulting to the one defined at Network/Wai/Middleware/RequestLogger.hs:232:7
  998. 324.65 s [wai-extra] Warning: 'ApacheSettings' is ambiguous. It is defined
  999. 324.65 s [wai-extra] * at Network/Wai/Middleware/RequestLogger.hs:106:23
  1000. 324.65 s [wai-extra] * at Network/Wai/Middleware/RequestLogger.hs:106:1
  1001. 324.65 s [wai-extra] You may be able to disambiguate the identifier by qualifying it or
  1002. 324.65 s [wai-extra] by specifying the type/value namespace explicitly.
  1003. 324.65 s [wai-extra] Defaulting to the one defined at Network/Wai/Middleware/RequestLogger.hs:106:1
  1004. 324.65 s [wai-extra] Warning: 'DetailedSettings' is ambiguous. It is defined
  1005. 324.65 s [wai-extra] * at Network/Wai/Middleware/RequestLogger.hs:160:25
  1006. 324.65 s [wai-extra] * at Network/Wai/Middleware/RequestLogger.hs:160:1
  1007. 324.65 s [wai-extra] You may be able to disambiguate the identifier by qualifying it or
  1008. 324.65 s [wai-extra] by specifying the type/value namespace explicitly.
  1009. 324.65 s [wai-extra] Defaulting to the one defined at Network/Wai/Middleware/RequestLogger.hs:160:1
  1010. 324.65 s [wai-extra] Warning: 'RequestLoggerSettings' is ambiguous. It is defined
  1011. 324.65 s [wai-extra] * at Network/Wai/Middleware/RequestLogger.hs:251:30
  1012. 324.65 s [wai-extra] * at Network/Wai/Middleware/RequestLogger.hs:251:1
  1013. 324.65 s [wai-extra] You may be able to disambiguate the identifier by qualifying it or
  1014. 324.65 s [wai-extra] by specifying the type/value namespace explicitly.
  1015. 324.65 s [Cabal] [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, dist/build/Distribution/ReadE.p_o )
  1016. 324.65 s [Cabal] [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, dist/build/Distribution/Simple/BuildToolDepends.p_o )
  1017. 324.65 s [Cabal] [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, dist/build/Distribution/Simple/CCompiler.p_o )
  1018. 324.65 s [Cabal] [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, dist/build/Distribution/Simple/Flag.p_o )
  1019. 324.65 s [Cabal] [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, dist/build/Distribution/Simple/InstallDirs/Internal.p_o )
  1020. 324.65 s [Cabal] [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, dist/build/Distribution/Simple/InstallDirs.p_o )
  1021. 324.65 s [Cabal] [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, dist/build/Distribution/Simple/Program/Internal.p_o )
  1022. 324.65 s [Cabal] [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.p_o )
  1023. 324.65 s [Cabal] [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, dist/build/Distribution/Types/AnnotatedId.p_o )
  1024. 324.65 s [Cabal] [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, dist/build/Distribution/Backpack/PreExistingComponent.p_o )
  1025. 324.65 s [Cabal] [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, dist/build/Distribution/Types/ComponentInclude.p_o )
  1026. 324.65 s [Cabal] [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, dist/build/Distribution/Types/ComponentLocalBuildInfo.p_o )
  1027. 324.65 s [Cabal] [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, dist/build/Distribution/Types/DumpBuildInfo.p_o )
  1028. 324.65 s [Cabal] [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, dist/build/Distribution/Types/GivenComponent.p_o )
  1029. 324.65 s [Cabal] [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, dist/build/Distribution/Types/PackageName/Magic.p_o )
  1030. 324.65 s [Cabal] [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, dist/build/Distribution/Types/ParStrat.p_o )
  1031. 324.65 s [Cabal] [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, dist/build/Distribution/Types/TargetInfo.p_o )
  1032. 324.65 s [Cabal] [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, dist/build/Distribution/Utils/IOData.p_o )
  1033. 324.65 s [Cabal] [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, dist/build/Distribution/Utils/Json.p_o )
  1034. 324.65 s [Cabal] [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, dist/build/Distribution/Utils/MapAccum.p_o )
  1035. 324.65 s [Cabal] [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, dist/build/Distribution/Utils/Progress.p_o )
  1036. 324.65 s [Cabal] [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, dist/build/Distribution/Utils/UnionFind.p_o )
  1037. 324.65 s [Cabal] [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, dist/build/Distribution/Verbosity/Internal.p_o )
  1038. 324.65 s [Cabal] [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.p_o )
  1039. 324.65 s [Cabal] [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, dist/build/Distribution/Simple/Program/Types.p_o )
  1040. 324.65 s [Cabal] [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, dist/build/Distribution/Simple/PreProcess/Types.p_o )
  1041. 324.65 s [Cabal] [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, dist/build/Distribution/Simple/Errors.p_o )
  1042. 324.65 s [Cabal] [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, dist/build/Distribution/Simple/PreProcess/Unlit.p_o )
  1043. 324.65 s [wai-extra] Defaulting to the one defined at Network/Wai/Middleware/RequestLogger.hs:251:1
  1044. 324.65 s [wai-extra] 85% ( 24 / 28) in 'Network.Wai.Middleware.RequestLogger'
  1045. 324.65 s [wai-extra] Missing documentation for:
  1046. 324.65 s [wai-extra] Module header
  1047. 324.65 s [wai-extra] defaultApacheSettings (Network/Wai/Middleware/RequestLogger.hs:113)
  1048. 324.65 s [wai-extra] OutputFormatter (Network/Wai/Middleware/RequestLogger.hs:190)
  1049. 324.65 s [wai-extra] OutputFormatterWithDetails (Network/Wai/Middleware/RequestLogger.hs:192)
  1050. 324.65 s [wai-extra] 50% ( 2 / 4) in 'Network.Wai.Middleware.RequestLogger.JSON'
  1051. 324.65 s [wai-extra] Missing documentation for:
  1052. 324.65 s [wai-extra] Module header
  1053. 324.65 s [wai-extra] formatAsJSON (Network/Wai/Middleware/RequestLogger/JSON.hs:34)
  1054. 324.65 s [wai-extra] Warning: 'GzipSettings' is ambiguous. It is defined
  1055. 324.65 s [wai-extra] * at Network/Wai/Middleware/Gzip.hs:140:21
  1056. 324.65 s [wai-extra] * at Network/Wai/Middleware/Gzip.hs:140:1
  1057. 324.65 s [wai-extra] You may be able to disambiguate the identifier by qualifying it or
  1058. 324.65 s [wai-extra] by specifying the type/value namespace explicitly.
  1059. 324.65 s [wai-extra] Defaulting to the one defined at Network/Wai/Middleware/Gzip.hs:140:1
  1060. 324.65 s [wai-extra] 94% ( 18 / 19) in 'Network.Wai.Middleware.Gzip'
  1061. 324.65 s [wai-extra] Missing documentation for:
  1062. 324.65 s [wai-extra] GzipSettings (Network/Wai/Middleware/Gzip.hs:140)
  1063. 324.65 s [wai-extra] 33% ( 1 / 3) in 'Network.Wai.Middleware.AcceptOverride'
  1064. 324.65 s [wai-extra] Missing documentation for:
  1065. 324.65 s [wai-extra] Module header
  1066. 324.65 s [wai-extra] acceptOverride (Network/Wai/Middleware/AcceptOverride.hs:28)
  1067. 324.65 s [wai-extra] Warning: Network.Wai.UrlMap: could not find link destinations for:
  1068. 324.65 s [wai-extra] - Network.Wai.UrlMap.ToApplication
  1069. 324.65 s [wai-extra] - Network.Wai.UrlMap.Path
  1070. 324.65 s [wai-extra] Warning: Network.Wai.Middleware.CombineHeaders: could not find link destinations for:
  1071. 324.65 s [wai-extra] - Network.Wai.Middleware.CombineHeaders.KeepOnly
  1072. 324.65 s [wai-extra] Documentation created: dist/doc/html/wai-extra/,
  1073. 324.65 s [wai-extra] dist/doc/html/wai-extra/wai-extra.txt
  1074. 324.65 s [wai-extra] Preprocessing test suite 'spec' for wai-extra-3.1.18...
  1075. 324.65 s [wai-extra] Phase: installPhase
  1076. 324.65 s [wai-extra] Installing library in /nix/store/dcpjlrrq11car9f1a65nfkbccv04kpgm-wai-extra-3.1.18/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  1077. 324.65 s [wai-extra] Phase: fixupPhase
  1078. 324.65 s [wai-extra] shrinking RPATHs of ELF executables and libraries in /nix/store/dcpjlrrq11car9f1a65nfkbccv04kpgm-wai-extra-3.1.18
  1079. 324.65 s [wai-extra] shrinking /nix/store/dcpjlrrq11car9f1a65nfkbccv04kpgm-wai-extra-3.1.18/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSwai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX-ghc9.10.3.so
  1080. 324.65 s [wai-extra] checking for references to /build/ in /nix/store/dcpjlrrq11car9f1a65nfkbccv04kpgm-wai-extra-3.1.18...
  1081. 324.65 s [wai-extra] patching script interpreter paths in /nix/store/dcpjlrrq11car9f1a65nfkbccv04kpgm-wai-extra-3.1.18
  1082. 324.65 s [wai-extra] stripping (with command strip and flags -S -p) in /nix/store/dcpjlrrq11car9f1a65nfkbccv04kpgm-wai-extra-3.1.18/lib
  1083. 324.65 s [wai-extra] shrinking RPATHs of ELF executables and libraries in /nix/store/940w38jci0s2as21z785l8p9c03h447j-wai-extra-3.1.18-doc
  1084. 324.65 s [wai-extra] checking for references to /build/ in /nix/store/940w38jci0s2as21z785l8p9c03h447j-wai-extra-3.1.18-doc...
  1085. 324.65 s [wai-extra] patching script interpreter paths in /nix/store/940w38jci0s2as21z785l8p9c03h447j-wai-extra-3.1.18-doc
  1086. 324.65 s [Cabal] [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, dist/build/Distribution/Backpack/UnifyM.p_o )
  1087. 324.65 s [Cabal] [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, dist/build/Distribution/Backpack/MixLink.p_o )
  1088. 324.65 s [Cabal] [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, dist/build/Distribution/ZinzaPrelude.p_o )
  1089. 324.65 s [Cabal] [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, dist/build/Distribution/Simple/Build/PathsModule/Z.p_o )
  1090. 324.65 s [Cabal] [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.p_o )
  1091. 324.65 s [Cabal] [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, dist/build/Distribution/Simple/Build/Macros/Z.p_o )
  1092. 324.65 s [Cabal] [ 56 of 146] Compiling Paths_Cabal ( dist/build/autogen/Paths_Cabal.hs, dist/build/Paths_Cabal.p_o )
  1093. 324.65 s [Cabal] [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, dist/build/Distribution/Simple/Utils.p_o )
  1094. 324.65 s [Cabal] [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, dist/build/Distribution/Utils/NubList.p_o )
  1095. 324.65 s [Cabal] [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, dist/build/Distribution/Utils/LogProgress.p_o )
  1096. 324.65 s [Cabal] [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, dist/build/Distribution/Simple/Program/Run.p_o )
  1097. 324.65 s [Cabal] [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, dist/build/Distribution/Simple/Program/Script.p_o )
  1098. 324.65 s [Cabal] [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, dist/build/Distribution/Simple/Program/ResponseFile.p_o )
  1099. 324.65 s [Cabal] [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, dist/build/Distribution/Simple/Program/Hpc.p_o )
  1100. 324.65 s [Cabal] [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, dist/build/Distribution/Simple/Program/Find.p_o )
  1101. 324.65 s [Cabal] [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, dist/build/Distribution/Simple/PackageIndex.p_o )
  1102. 324.65 s [Cabal] [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, dist/build/Distribution/Simple/PackageDescription.p_o )
  1103. 324.65 s [Cabal] [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, dist/build/Distribution/Simple/Glob/Internal.p_o )
  1104. 324.65 s [Cabal] [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, dist/build/Distribution/Simple/Glob.p_o )
  1105. 324.65 s [Cabal] [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, dist/build/Distribution/PackageDescription/Check/Monad.p_o )
  1106. 324.65 s [Cabal] [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, dist/build/Distribution/PackageDescription/Check/Conditional.p_o )
  1107. 324.65 s [Cabal] [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, dist/build/Distribution/PackageDescription/Check/Common.p_o )
  1108. 324.65 s [Cabal] [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, dist/build/Distribution/Simple/Compiler.p_o )
  1109. 324.65 s [Cabal] [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, dist/build/Distribution/Simple/Program/HcPkg.p_o )
  1110. 324.79 s [wai-extra:post-build] Uploading to cachix cache "sellout": /nix/store/940w38jci0s2as21z785l8p9c03h447j-wai-extra-3.1.18-doc /nix/store/dcpjlrrq11car9f1a65nfkbccv04kpgm-wai-extra-3.1.18
  1111. 325.37 s [wai-extra:post-build] Pushing 2 paths (264 are already present) using zstd to cache sellout ⏳
  1112. 325.37 s [wai-extra:post-build]
  1113. 325.76 s [wai-extra:post-build] Pushing /nix/store/dcpjlrrq11car9f1a65nfkbccv04kpgm-wai-extra-3.1.18 (9.49 MiB)
  1114. 325.81 s [wai-extra:post-build] Pushing /nix/store/940w38jci0s2as21z785l8p9c03h447j-wai-extra-3.1.18-doc (3.33 MiB)
  1115. 326.94 s [wai-extra:post-build]
  1116. 326.94 s [wai-extra:post-build] All done.
  1117. 326.96 s [wai-extra:post-build] Uploading to the NixCI cache: /nix/store/940w38jci0s2as21z785l8p9c03h447j-wai-extra-3.1.18-doc /nix/store/dcpjlrrq11car9f1a65nfkbccv04kpgm-wai-extra-3.1.18
  1118. 327.01 s [wai-extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1119. 327.23 s [wai-extra:post-build] copying 2 paths...
  1120. 327.23 s [wai-extra:post-build] copying path '/nix/store/940w38jci0s2as21z785l8p9c03h447j-wai-extra-3.1.18-doc' to 'https://cache.nix-ci.com'...
  1121. 328.10 s [wai-extra:post-build] copying path '/nix/store/dcpjlrrq11car9f1a65nfkbccv04kpgm-wai-extra-3.1.18' to 'https://cache.nix-ci.com'...
  1122. 331.35 s [wai-extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1123. 331.61 s [wai-extra:post-build] copying 1 paths...
  1124. 331.61 s [wai-extra:post-build] copying path '/nix/store/7jd1nzdskby3nzaszwab5d6r2y4gwj62-wai-extra-3.1.18.drv' to 'https://cache.nix-ci.com'...
  1125. 331.88 s Progress: 19 of 51 built (1 building), 373 of 373 downloaded from cache
  1126. 331.98 s Building /nix/store/7013z4jjb1z86qfmn148zfjbrh8x4sg1-hspec-wai-0.11.1.drv
  1127. 332.06 s Building /nix/store/k785gm45279rgka4q29x47s6vr2y3khn-wai-app-static-3.1.9.drv
  1128. 332.06 s [Cabal] [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, dist/build/Distribution/Simple/GHC/ImplInfo.p_o )
  1129. 332.06 s [Cabal] [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, dist/build/Distribution/Simple/Program/GHC.p_o )
  1130. 332.06 s [Cabal] [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, dist/build/Distribution/Simple/Program/Builtin.p_o )
  1131. 332.06 s [Cabal] [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, dist/build/Distribution/Simple/Program/Db.p_o )
  1132. 332.06 s [Cabal] [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, dist/build/Distribution/Simple/Program.p_o )
  1133. 332.06 s [Cabal] [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, dist/build/Distribution/Simple/Program/Strip.p_o )
  1134. 332.06 s [Cabal] [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, dist/build/Distribution/Simple/Command.p_o )
  1135. 332.06 s [Cabal] [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, dist/build/Distribution/Simple/Setup/Common.p_o )
  1136. 332.06 s [Cabal] [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, dist/build/Distribution/Simple/Setup/Test.p_o )
  1137. 332.06 s [Cabal] [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, dist/build/Distribution/Simple/Setup/SDist.p_o )
  1138. 332.06 s [Cabal] [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, dist/build/Distribution/Simple/Setup/Repl.p_o )
  1139. 332.06 s [Cabal] [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, dist/build/Distribution/Simple/Setup/Register.p_o )
  1140. 332.06 s [Cabal] [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, dist/build/Distribution/Simple/Setup/Install.p_o )
  1141. 332.06 s [Cabal] [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, dist/build/Distribution/Simple/Setup/Hscolour.p_o )
  1142. 332.06 s [Cabal] [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, dist/build/Distribution/Simple/Setup/Haddock.p_o )
  1143. 332.06 s [Cabal] [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, dist/build/Distribution/Simple/Setup/Global.p_o )
  1144. 332.06 s [Cabal] [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, dist/build/Distribution/Simple/Setup/Copy.p_o )
  1145. 332.06 s [Cabal] [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, dist/build/Distribution/Simple/Setup/Config.p_o )
  1146. 332.06 s [Cabal] [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, dist/build/Distribution/Types/LocalBuildConfig.p_o )
  1147. 332.06 s [Cabal] [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, dist/build/Distribution/Types/LocalBuildInfo.p_o )
  1148. 332.06 s [Cabal] [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.p_o )
  1149. 332.06 s [Cabal] [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, dist/build/Distribution/Simple/Test/Log.p_o )
  1150. 332.06 s [Cabal] [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.p_o )
  1151. 332.06 s [Cabal] [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, dist/build/Distribution/Simple/Build/PackageInfoModule.p_o )
  1152. 332.06 s [Cabal] [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.p_o )
  1153. 332.06 s [Cabal] [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, dist/build/Distribution/Backpack/Id.p_o )
  1154. 332.06 s [Cabal] [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, dist/build/Distribution/Backpack/ConfiguredComponent.p_o )
  1155. 332.07 s [Cabal] [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, dist/build/Distribution/Backpack/LinkedComponent.p_o )
  1156. 332.34 s [hspec-wai] Phase: setupCompilerEnvironmentPhase
  1157. 332.34 s [hspec-wai] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  1158. 332.44 s [wai-app-static] Phase: setupCompilerEnvironmentPhase
  1159. 332.45 s [wai-app-static] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  1160. 332.73 s [Cabal] [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, dist/build/Distribution/Backpack/ComponentsGraph.p_o )
  1161. 332.73 s [Cabal] [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.p_o )
  1162. 332.73 s [Cabal] [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.p_o )
  1163. 332.73 s [Cabal] [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, dist/build/Distribution/Simple/ConfigureScript.p_o )
  1164. 332.73 s [Cabal] [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, dist/build/Distribution/Simple/Setup/Clean.p_o )
  1165. 332.73 s [Cabal] [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, dist/build/Distribution/Simple/Setup/Build.p_o )
  1166. 332.73 s [Cabal] [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, dist/build/Distribution/Simple/Setup/Benchmark.p_o )
  1167. 332.73 s [Cabal] [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.p_o )
  1168. 332.73 s [Cabal] [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, dist/build/Distribution/Simple/Build/Inputs.p_o )
  1169. 332.73 s [Cabal] [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, dist/build/Distribution/Simple/BuildTarget.p_o )
  1170. 332.86 s [hspec-wai] Phase: unpackPhase
  1171. 332.87 s [hspec-wai] unpacking source archive /nix/store/6ajvqqq0inlcmcxjwh25naip99n6fp3q-hspec-wai-0.11.1.tar.gz
  1172. 332.87 s [hspec-wai] source root is hspec-wai-0.11.1
  1173. 332.88 s [hspec-wai] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "hspec-wai-0.11.1/test/Test/Hspec/Wai/UtilSpec.hs"
  1174. 332.89 s [hspec-wai] Phase: patchPhase
  1175. 332.90 s [hspec-wai] Phase: compileBuildDriverPhase
  1176. 332.90 s [hspec-wai] setupCompileFlags: -package-db=/build/tmp.yqOjZI9ZGQ/setup-package.conf.d -threaded
  1177. 332.92 s [Cabal] [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.p_o )
  1178. 332.92 s [Cabal] [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.p_o )
  1179. 332.92 s [Cabal] [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, dist/build/Distribution/Simple/HaskellSuite.p_o )
  1180. 332.92 s [Cabal] [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, dist/build/Distribution/Simple/GHC/Internal.p_o )
  1181. 332.92 s [Cabal] [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, dist/build/Distribution/Simple/GHC/EnvironmentParser.p_o )
  1182. 332.92 s [Cabal] [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, dist/build/Distribution/Simple/GHCJS.p_o )
  1183. 332.98 s [hspec-wai] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.yqOjZI9ZGQ/Main.o )
  1184. 333.01 s [wai-app-static] Phase: unpackPhase
  1185. 333.01 s [wai-app-static] unpacking source archive /nix/store/q7vc6if5vxck3ig9f5kigjdlhghjjv9i-wai-app-static-3.1.9.tar.gz
  1186. 333.02 s [wai-app-static] source root is wai-app-static-3.1.9
  1187. 333.03 s [wai-app-static] setting SOURCE_DATE_EPOCH to timestamp 1709542195 of file "wai-app-static-3.1.9/WaiAppStatic/Types.hs"
  1188. 333.03 s [wai-app-static] Phase: patchPhase
  1189. 333.05 s [wai-app-static] Phase: compileBuildDriverPhase
  1190. 333.05 s [wai-app-static] setupCompileFlags: -package-db=/build/tmp.3pSNjsWJ8z/setup-package.conf.d -threaded
  1191. 333.06 s [hspec-wai] [2 of 2] Linking Setup
  1192. 333.11 s [wai-app-static] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.3pSNjsWJ8z/Main.o )
  1193. 333.17 s [wai-app-static] [2 of 2] Linking Setup
  1194. 334.69 s [hspec-wai] Phase: updateAutotoolsGnuConfigScriptsPhase
  1195. 334.70 s [hspec-wai] Phase: configurePhase
  1196. 334.70 s [hspec-wai] configureFlags: --verbose --prefix=/nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/js1xfmkhsryfzsavd6kl4k87jfds26bz-hspec-wai-0.11.1-doc/share/doc/hspec-wai-0.11.1 --with-gcc=gcc --package-db=/build/tmp.yqOjZI9ZGQ/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  1197. 334.71 s [hspec-wai] Using Parsec parser
  1198. 334.71 s [hspec-wai] Configuring hspec-wai-0.11.1...
  1199. 334.88 s [wai-app-static] Phase: updateAutotoolsGnuConfigScriptsPhase
  1200. 334.89 s [wai-app-static] Phase: configurePhase
  1201. 334.90 s [wai-app-static] configureFlags: --verbose --prefix=/nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/1m6zkqsrb6rgid3bmjxkw8ysbj7jarc3-wai-app-static-3.1.9-doc/share/doc/wai-app-static-3.1.9 --with-gcc=gcc --package-db=/build/tmp.3pSNjsWJ8z/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  1202. 334.91 s [wai-app-static] Using Parsec parser
  1203. 334.91 s [wai-app-static] Configuring wai-app-static-3.1.9...
  1204. 335.32 s [Cabal] [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, dist/build/Distribution/Simple/GHC/Build/Utils.p_o )
  1205. 335.32 s [Cabal] [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, dist/build/Distribution/Simple/GHC/Build/Modules.p_o )
  1206. 335.32 s [Cabal] [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, dist/build/Distribution/Simple/GHC/Build/ExtraSources.p_o )
  1207. 335.32 s [Cabal] [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, dist/build/Distribution/Simple/GHC/Build/Link.p_o )
  1208. 335.32 s [Cabal] [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, dist/build/Distribution/Simple/GHC/Build.p_o )
  1209. 335.32 s [Cabal] [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.p_o )
  1210. 335.41 s [wai-app-static] Flags chosen: crypton=True, print=False
  1211. 335.55 s [hspec-wai] Dependency QuickCheck: using QuickCheck-2.15.0.1
  1212. 335.55 s [hspec-wai] Dependency base >=4.9.1.0 && <5: using base-4.20.2.0
  1213. 335.55 s [hspec-wai] Dependency base-compat: using base-compat-0.14.1
  1214. 335.55 s [hspec-wai] Dependency bytestring >=0.10: using bytestring-0.12.2.0
  1215. 335.55 s [hspec-wai] Dependency case-insensitive: using case-insensitive-1.2.1.0
  1216. 335.55 s [hspec-wai] Dependency hspec-core >=2 && <3: using hspec-core-2.11.14
  1217. 335.55 s [hspec-wai] Dependency hspec-expectations >=0.8.0: using hspec-expectations-0.8.4
  1218. 335.55 s [hspec-wai] Dependency http-types: using http-types-0.12.4
  1219. 335.55 s [hspec-wai] Dependency text: using text-2.1.3
  1220. 335.55 s [hspec-wai] Dependency transformers: using transformers-0.6.1.1
  1221. 335.55 s [hspec-wai] Dependency wai >=3: using wai-3.2.4
  1222. 335.55 s [hspec-wai] Dependency wai-extra >=3: using wai-extra-3.1.18
  1223. 335.55 s [hspec-wai] Dependency QuickCheck: using QuickCheck-2.15.0.1
  1224. 335.55 s [hspec-wai] Dependency base >=4.9.1.0 && <5: using base-4.20.2.0
  1225. 335.55 s [hspec-wai] Dependency base-compat: using base-compat-0.14.1
  1226. 335.55 s [hspec-wai] Dependency bytestring >=0.10: using bytestring-0.12.2.0
  1227. 335.56 s [hspec-wai] Dependency case-insensitive: using case-insensitive-1.2.1.0
  1228. 335.56 s [hspec-wai] Dependency hspec: using hspec-2.11.14
  1229. 335.56 s [hspec-wai] Dependency hspec-core >=2 && <3: using hspec-core-2.11.14
  1230. 335.56 s [hspec-wai] Dependency hspec-expectations >=0.8.0: using hspec-expectations-0.8.4
  1231. 335.56 s [hspec-wai] Dependency http-types: using http-types-0.12.4
  1232. 335.56 s [hspec-wai] Dependency text: using text-2.1.3
  1233. 335.56 s [hspec-wai] Dependency transformers: using transformers-0.6.1.1
  1234. 335.56 s [hspec-wai] Dependency wai >=3.2.2: using wai-3.2.4
  1235. 335.56 s [hspec-wai] Dependency wai-extra >=3: using wai-extra-3.1.18
  1236. 335.56 s [hspec-wai] Source component graph:
  1237. 335.56 s [hspec-wai] component test:spec
  1238. 335.56 s [hspec-wai] component lib
  1239. 335.56 s [hspec-wai] Configured component graph:
  1240. 335.56 s [hspec-wai] component hspec-wai-0.11.1-KaMzf3nNCblJCd5NqMifq3-spec
  1241. 335.56 s [hspec-wai] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1242. 335.56 s [hspec-wai] include base-4.20.2.0-64da
  1243. 335.56 s [hspec-wai] include base-compat-0.14.1-99jmhitwe0HHIWItta3nRs
  1244. 335.56 s [hspec-wai] include bytestring-0.12.2.0-262e
  1245. 335.56 s [hspec-wai] include case-insensitive-1.2.1.0-C41e1ocD1IuGyG9IKrgA8Z
  1246. 335.56 s [hspec-wai] include hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  1247. 335.56 s [hspec-wai] include hspec-core-2.11.14-FxcNNMEYpft21horraLswU
  1248. 335.56 s [hspec-wai] include hspec-expectations-0.8.4-8aDtAD2DNhaHA51QBxqwjq
  1249. 335.56 s [hspec-wai] include http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  1250. 335.56 s [hspec-wai] include text-2.1.3-c691
  1251. 335.56 s [hspec-wai] include transformers-0.6.1.1-6a26
  1252. 335.56 s [hspec-wai] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  1253. 335.56 s [hspec-wai] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  1254. 335.56 s [hspec-wai] component hspec-wai-0.11.1-ACFczlBhalK665w7VrwZ0J
  1255. 335.56 s [hspec-wai] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1256. 335.56 s [hspec-wai] include base-4.20.2.0-64da
  1257. 335.56 s [hspec-wai] include base-compat-0.14.1-99jmhitwe0HHIWItta3nRs
  1258. 335.56 s [hspec-wai] include bytestring-0.12.2.0-262e
  1259. 335.56 s [hspec-wai] include case-insensitive-1.2.1.0-C41e1ocD1IuGyG9IKrgA8Z
  1260. 335.56 s [hspec-wai] include hspec-core-2.11.14-FxcNNMEYpft21horraLswU
  1261. 335.56 s [hspec-wai] include hspec-expectations-0.8.4-8aDtAD2DNhaHA51QBxqwjq
  1262. 335.56 s [hspec-wai] include http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  1263. 335.56 s [hspec-wai] include text-2.1.3-c691
  1264. 335.56 s [hspec-wai] include transformers-0.6.1.1-6a26
  1265. 335.56 s [hspec-wai] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  1266. 335.56 s [hspec-wai] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  1267. 335.56 s [hspec-wai] Linked component graph:
  1268. 335.56 s [hspec-wai] unit hspec-wai-0.11.1-KaMzf3nNCblJCd5NqMifq3-spec
  1269. 335.56 s [hspec-wai] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1270. 335.56 s [hspec-wai] include base-4.20.2.0-64da
  1271. 335.56 s [hspec-wai] include base-compat-0.14.1-99jmhitwe0HHIWItta3nRs
  1272. 335.56 s [hspec-wai] include bytestring-0.12.2.0-262e
  1273. 335.56 s [hspec-wai] include case-insensitive-1.2.1.0-C41e1ocD1IuGyG9IKrgA8Z
  1274. 335.56 s [hspec-wai] include hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  1275. 335.56 s [hspec-wai] include hspec-core-2.11.14-FxcNNMEYpft21horraLswU
  1276. 335.56 s [hspec-wai] include hspec-expectations-0.8.4-8aDtAD2DNhaHA51QBxqwjq
  1277. 335.56 s [hspec-wai] include http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  1278. 335.56 s [hspec-wai] include text-2.1.3-c691
  1279. 335.56 s [hspec-wai] include transformers-0.6.1.1-6a26
  1280. 335.56 s [hspec-wai] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  1281. 335.56 s [hspec-wai] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  1282. 335.56 s [hspec-wai] unit hspec-wai-0.11.1-ACFczlBhalK665w7VrwZ0J
  1283. 335.56 s [hspec-wai] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1284. 335.56 s [hspec-wai] include base-4.20.2.0-64da
  1285. 335.56 s [hspec-wai] include base-compat-0.14.1-99jmhitwe0HHIWItta3nRs
  1286. 335.56 s [hspec-wai] include bytestring-0.12.2.0-262e
  1287. 335.56 s [hspec-wai] include case-insensitive-1.2.1.0-C41e1ocD1IuGyG9IKrgA8Z
  1288. 335.56 s [hspec-wai] include hspec-core-2.11.14-FxcNNMEYpft21horraLswU
  1289. 335.56 s [hspec-wai] include hspec-expectations-0.8.4-8aDtAD2DNhaHA51QBxqwjq
  1290. 335.56 s [hspec-wai] include http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  1291. 335.56 s [hspec-wai] include text-2.1.3-c691
  1292. 335.56 s [hspec-wai] include transformers-0.6.1.1-6a26
  1293. 335.56 s [hspec-wai] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  1294. 335.56 s [hspec-wai] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  1295. 335.56 s [hspec-wai] Test.Hspec.Wai=hspec-wai-0.11.1-ACFczlBhalK665w7VrwZ0J:Test.Hspec.Wai,Test.Hspec.Wai.Internal=hspec-wai-0.11.1-ACFczlBhalK665w7VrwZ0J:Test.Hspec.Wai.Internal,Test.Hspec.Wai.Matcher=hspec-wai-0.11.1-ACFczlBhalK665w7VrwZ0J:Test.Hspec.Wai.Matcher,Test.Hspec.Wai.QuickCheck=hspec-wai-0.11.1-ACFczlBhalK665w7VrwZ0J:Test.Hspec.Wai.QuickCheck
  1296. 335.56 s [hspec-wai] Ready component graph:
  1297. 335.56 s [hspec-wai] definite hspec-wai-0.11.1-KaMzf3nNCblJCd5NqMifq3-spec
  1298. 335.56 s [hspec-wai] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1299. 335.56 s [hspec-wai] depends base-4.20.2.0-64da
  1300. 335.56 s [hspec-wai] depends base-compat-0.14.1-99jmhitwe0HHIWItta3nRs
  1301. 335.56 s [hspec-wai] depends bytestring-0.12.2.0-262e
  1302. 335.56 s [hspec-wai] depends case-insensitive-1.2.1.0-C41e1ocD1IuGyG9IKrgA8Z
  1303. 335.56 s [hspec-wai] depends hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  1304. 335.56 s [hspec-wai] depends hspec-core-2.11.14-FxcNNMEYpft21horraLswU
  1305. 335.56 s [hspec-wai] depends hspec-expectations-0.8.4-8aDtAD2DNhaHA51QBxqwjq
  1306. 335.56 s [hspec-wai] depends http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  1307. 335.56 s [hspec-wai] depends text-2.1.3-c691
  1308. 335.56 s [hspec-wai] depends transformers-0.6.1.1-6a26
  1309. 335.56 s [hspec-wai] depends wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  1310. 335.56 s [hspec-wai] depends wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  1311. 335.56 s [hspec-wai] definite hspec-wai-0.11.1-ACFczlBhalK665w7VrwZ0J
  1312. 335.56 s [hspec-wai] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1313. 335.56 s [hspec-wai] depends base-4.20.2.0-64da
  1314. 335.56 s [hspec-wai] depends base-compat-0.14.1-99jmhitwe0HHIWItta3nRs
  1315. 335.56 s [hspec-wai] depends bytestring-0.12.2.0-262e
  1316. 335.56 s [hspec-wai] depends case-insensitive-1.2.1.0-C41e1ocD1IuGyG9IKrgA8Z
  1317. 335.56 s [hspec-wai] depends hspec-core-2.11.14-FxcNNMEYpft21horraLswU
  1318. 335.56 s [hspec-wai] depends hspec-expectations-0.8.4-8aDtAD2DNhaHA51QBxqwjq
  1319. 335.56 s [hspec-wai] depends http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  1320. 335.56 s [hspec-wai] depends text-2.1.3-c691
  1321. 335.56 s [hspec-wai] depends transformers-0.6.1.1-6a26
  1322. 335.56 s [hspec-wai] depends wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  1323. 335.56 s [hspec-wai] depends wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  1324. 335.56 s [hspec-wai] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1325. 335.56 s [hspec-wai] Using compiler: ghc-9.10.3
  1326. 335.56 s [hspec-wai] Using install prefix:
  1327. 335.56 s [hspec-wai] /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1
  1328. 335.56 s [hspec-wai] Executables installed in:
  1329. 335.56 s [hspec-wai] /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1/bin
  1330. 335.56 s [hspec-wai] Libraries installed in:
  1331. 335.56 s [hspec-wai] /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/hspec-wai-0.11.1-ACFczlBhalK665w7VrwZ0J
  1332. 335.56 s [hspec-wai] Dynamic Libraries installed in:
  1333. 335.56 s [hspec-wai] /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  1334. 335.56 s [hspec-wai] Private executables installed in:
  1335. 335.56 s [hspec-wai] /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1/libexec/x86_64-linux-ghc-9.10.3-05f6/hspec-wai-0.11.1
  1336. 335.56 s [hspec-wai] Data files installed in:
  1337. 335.56 s [hspec-wai] /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1/share/x86_64-linux-ghc-9.10.3-05f6/hspec-wai-0.11.1
  1338. 335.56 s [hspec-wai] Documentation installed in:
  1339. 335.56 s [hspec-wai] /nix/store/js1xfmkhsryfzsavd6kl4k87jfds26bz-hspec-wai-0.11.1-doc/share/doc/hspec-wai-0.11.1
  1340. 335.56 s [hspec-wai] Configuration files installed in:
  1341. 335.56 s [hspec-wai] /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1/etc
  1342. 335.56 s [hspec-wai] No alex found
  1343. 335.56 s [hspec-wai] Using ar found on system at:
  1344. 335.56 s [hspec-wai] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  1345. 335.56 s [hspec-wai] No c2hs found
  1346. 335.56 s [hspec-wai] No cpphs found
  1347. 335.56 s [hspec-wai] No doctest found
  1348. 335.56 s [hspec-wai] Using gcc version 14.3.0 given by user at:
  1349. 335.56 s [hspec-wai] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  1350. 335.56 s [hspec-wai] Using ghc version 9.10.3 found on system at:
  1351. 335.56 s [hspec-wai] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  1352. 335.56 s [hspec-wai] Using ghc-pkg version 9.10.3 found on system at:
  1353. 335.56 s [hspec-wai] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  1354. 335.56 s [hspec-wai] No ghcjs found
  1355. 335.56 s [hspec-wai] No ghcjs-pkg found
  1356. 335.56 s [hspec-wai] No greencard found
  1357. 335.56 s [hspec-wai] Using haddock version 2.31.1 found on system at:
  1358. 335.56 s [hspec-wai] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  1359. 335.56 s [hspec-wai] No happy found
  1360. 335.56 s [hspec-wai] Using haskell-suite found on system at: haskell-suite-dummy-location
  1361. 335.56 s [hspec-wai] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1362. 335.56 s [hspec-wai] No hmake found
  1363. 335.56 s [hspec-wai] Using hpc version 0.69 found on system at:
  1364. 335.56 s [hspec-wai] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  1365. 335.56 s [hspec-wai] Using hsc2hs version 0.68.10 found on system at:
  1366. 335.56 s [hspec-wai] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  1367. 335.56 s [hspec-wai] Using hscolour version 1.25 found on system at:
  1368. 335.62 s [hspec-wai] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  1369. 335.62 s [hspec-wai] No jhc found
  1370. 335.62 s [hspec-wai] Using ld found on system at:
  1371. 335.62 s [hspec-wai] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  1372. 335.62 s [hspec-wai] No pkg-config found
  1373. 335.62 s [hspec-wai] Using runghc version 9.10.3 found on system at:
  1374. 335.62 s [hspec-wai] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  1375. 335.62 s [hspec-wai] Using strip version 2.44 found on system at:
  1376. 335.62 s [hspec-wai] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  1377. 335.62 s [hspec-wai] Using tar found on system at:
  1378. 335.62 s [hspec-wai] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  1379. 335.62 s [hspec-wai] No uhc found
  1380. 335.73 s [wai-app-static] Dependency base >=4.12 && <5: using base-4.20.2.0
  1381. 335.73 s [wai-app-static] Dependency blaze-html >=0.5: using blaze-html-0.9.2.0
  1382. 335.73 s [wai-app-static] Dependency blaze-markup >=0.5.1: using blaze-markup-0.8.3.0
  1383. 335.73 s [wai-app-static] Dependency bytestring >=0.10.4: using bytestring-0.12.2.0
  1384. 335.73 s [wai-app-static] Dependency containers >=0.2: using containers-0.7
  1385. 335.73 s [wai-app-static] Dependency crypton >=0.6: using crypton-1.0.4
  1386. 335.73 s [wai-app-static] Dependency directory >=1.0.1: using directory-1.3.8.5
  1387. 335.73 s [wai-app-static] Dependency file-embed >=0.0.3.1: using file-embed-0.0.16.0
  1388. 335.73 s [wai-app-static] Dependency filepath: using filepath-1.5.4.0
  1389. 335.73 s [wai-app-static] Dependency http-date: using http-date-0.0.11
  1390. 335.73 s [wai-app-static] Dependency http-types >=0.7: using http-types-0.12.4
  1391. 335.73 s [wai-app-static] Dependency memory >=0.7: using memory-0.18.0
  1392. 335.73 s [wai-app-static] Dependency mime-types >=0.1 && <0.2: using mime-types-0.1.2.0
  1393. 335.73 s [wai-app-static] Dependency old-locale >=1.0.0.2: using old-locale-1.0.0.7
  1394. 335.73 s [wai-app-static] Dependency optparse-applicative >=0.7: using optparse-applicative-0.18.1.0
  1395. 335.73 s [wai-app-static] Dependency template-haskell >=2.7: using template-haskell-2.22.0.0
  1396. 335.73 s [wai-app-static] Dependency text >=0.7: using text-2.1.3
  1397. 335.73 s [wai-app-static] Dependency time >=1.1.4: using time-1.12.2
  1398. 335.73 s [wai-app-static] Dependency transformers >=0.2.2: using transformers-0.6.1.1
  1399. 335.73 s [wai-app-static] Dependency unix-compat >=0.2: using unix-compat-0.7.4.1
  1400. 335.73 s [wai-app-static] Dependency unordered-containers >=0.2: using unordered-containers-0.2.20.1
  1401. 335.73 s [wai-app-static] Dependency wai >=3.0 && <3.3: using wai-3.2.4
  1402. 335.73 s [wai-app-static] Dependency wai-extra >=3.0 && <3.2: using wai-extra-3.1.18
  1403. 335.73 s [wai-app-static] Dependency warp >=3.0.11 && <3.5: using warp-3.4.9
  1404. 335.73 s [wai-app-static] Dependency zlib >=0.5: using zlib-0.7.1.1
  1405. 335.73 s [wai-app-static] Dependency base >=4 && <5: using base-4.20.2.0
  1406. 335.73 s [wai-app-static] Dependency wai-app-static: using wai-app-static-3.1.9
  1407. 335.73 s [wai-app-static] Dependency base >=4 && <5: using base-4.20.2.0
  1408. 335.73 s [wai-app-static] Dependency bytestring: using bytestring-0.12.2.0
  1409. 335.73 s [wai-app-static] Dependency filepath: using filepath-1.5.4.0
  1410. 335.73 s [wai-app-static] Dependency hspec >=1.3: using hspec-2.11.14
  1411. 335.73 s [wai-app-static] Dependency http-date: using http-date-0.0.11
  1412. 335.73 s [wai-app-static] Dependency http-types: using http-types-0.12.4
  1413. 335.73 s [wai-app-static] Dependency mime-types: using mime-types-0.1.2.0
  1414. 335.73 s [wai-app-static] Dependency mockery: using mockery-0.3.5
  1415. 335.73 s [wai-app-static] Dependency temporary: using temporary-1.3
  1416. 335.73 s [wai-app-static] Dependency text: using text-2.1.3
  1417. 335.73 s [wai-app-static] Dependency transformers: using transformers-0.6.1.1
  1418. 335.73 s [wai-app-static] Dependency unix-compat: using unix-compat-0.7.4.1
  1419. 335.73 s [wai-app-static] Dependency wai: using wai-3.2.4
  1420. 335.73 s [wai-app-static] Dependency wai-app-static: using wai-app-static-3.1.9
  1421. 335.73 s [wai-app-static] Dependency wai-extra: using wai-extra-3.1.18
  1422. 335.73 s [wai-app-static] Dependency zlib: using zlib-0.7.1.1
  1423. 335.73 s [wai-app-static] Source component graph:
  1424. 335.73 s [wai-app-static] component lib
  1425. 335.73 s [wai-app-static] component exe:warp dependency lib
  1426. 335.73 s [wai-app-static] component test:runtests dependency lib
  1427. 335.73 s [wai-app-static] Configured component graph:
  1428. 335.73 s [wai-app-static] component wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY
  1429. 335.73 s [wai-app-static] include base-4.20.2.0-64da
  1430. 335.73 s [wai-app-static] include blaze-html-0.9.2.0-1TnbZWFHy3R40B6OpF9DR4
  1431. 335.73 s [wai-app-static] include blaze-markup-0.8.3.0-LC2ElHhGxUxGGV5BUghwSf
  1432. 335.73 s [wai-app-static] include bytestring-0.12.2.0-262e
  1433. 335.73 s [wai-app-static] include containers-0.7-504a
  1434. 335.73 s [wai-app-static] include crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
  1435. 335.73 s [wai-app-static] include directory-1.3.8.5-c84a
  1436. 335.73 s [wai-app-static] include file-embed-0.0.16.0-LdzxZSpiar5K5xa2TpsqIW
  1437. 335.73 s [wai-app-static] include filepath-1.5.4.0-e600
  1438. 335.73 s [wai-app-static] include http-date-0.0.11-1DQoL21ycDU8UT1FI6JLIW
  1439. 335.73 s [wai-app-static] include http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  1440. 335.73 s [wai-app-static] include memory-0.18.0-1C7UGHHkqpD6hOmlwuB6kp
  1441. 335.73 s [wai-app-static] include mime-types-0.1.2.0-GG4RdWpI4UsLuabPBoGsio
  1442. 335.73 s [wai-app-static] include old-locale-1.0.0.7-DRLvSw2nlac8vyuqyJQCtf
  1443. 335.73 s [wai-app-static] include optparse-applicative-0.18.1.0-4lWQkOtzWhPJvRiiygtQv3
  1444. 335.73 s [wai-app-static] include template-haskell-2.22.0.0-09e7
  1445. 335.73 s [wai-app-static] include text-2.1.3-c691
  1446. 335.73 s [wai-app-static] include time-1.12.2-652a
  1447. 335.73 s [wai-app-static] include transformers-0.6.1.1-6a26
  1448. 335.73 s [wai-app-static] include unix-compat-0.7.4.1-LtRdS5YtFL7IwG9uP1DHOR
  1449. 335.73 s [wai-app-static] include unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  1450. 335.73 s [wai-app-static] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  1451. 335.73 s [wai-app-static] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  1452. 335.74 s [wai-app-static] include warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
  1453. 335.74 s [wai-app-static] include zlib-0.7.1.1-FmuBC2DbVMMDDhjiMmUza2
  1454. 335.74 s [wai-app-static] component wai-app-static-3.1.9-KbapgSQ5yMt8KB3na5yfc1-warp
  1455. 335.74 s [wai-app-static] include base-4.20.2.0-64da
  1456. 335.74 s [wai-app-static] include wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY
  1457. 335.74 s [wai-app-static] component wai-app-static-3.1.9-Isn8RoT8KDF60cYVhFPbDb-runtests
  1458. 335.74 s [wai-app-static] include base-4.20.2.0-64da
  1459. 335.74 s [wai-app-static] include bytestring-0.12.2.0-262e
  1460. 335.74 s [wai-app-static] include filepath-1.5.4.0-e600
  1461. 335.74 s [wai-app-static] include hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  1462. 335.74 s [wai-app-static] include http-date-0.0.11-1DQoL21ycDU8UT1FI6JLIW
  1463. 335.74 s [wai-app-static] include http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  1464. 335.74 s [wai-app-static] include mime-types-0.1.2.0-GG4RdWpI4UsLuabPBoGsio
  1465. 335.74 s [wai-app-static] include mockery-0.3.5-EoPvviUQGlu2sq9REsFLwG
  1466. 335.74 s [wai-app-static] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  1467. 335.74 s [wai-app-static] include text-2.1.3-c691
  1468. 335.74 s [wai-app-static] include transformers-0.6.1.1-6a26
  1469. 335.74 s [wai-app-static] include unix-compat-0.7.4.1-LtRdS5YtFL7IwG9uP1DHOR
  1470. 335.74 s [wai-app-static] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  1471. 335.74 s [wai-app-static] include wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY
  1472. 335.74 s [wai-app-static] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  1473. 335.74 s [wai-app-static] include zlib-0.7.1.1-FmuBC2DbVMMDDhjiMmUza2
  1474. 335.74 s [wai-app-static] Linked component graph:
  1475. 335.74 s [wai-app-static] unit wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY
  1476. 335.74 s [wai-app-static] include base-4.20.2.0-64da
  1477. 335.74 s [wai-app-static] include blaze-html-0.9.2.0-1TnbZWFHy3R40B6OpF9DR4
  1478. 335.74 s [wai-app-static] include blaze-markup-0.8.3.0-LC2ElHhGxUxGGV5BUghwSf
  1479. 335.74 s [wai-app-static] include bytestring-0.12.2.0-262e
  1480. 335.74 s [wai-app-static] include containers-0.7-504a
  1481. 335.74 s [wai-app-static] include crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
  1482. 335.74 s [wai-app-static] include directory-1.3.8.5-c84a
  1483. 335.74 s [wai-app-static] include file-embed-0.0.16.0-LdzxZSpiar5K5xa2TpsqIW
  1484. 335.74 s [wai-app-static] include filepath-1.5.4.0-e600
  1485. 335.74 s [wai-app-static] include http-date-0.0.11-1DQoL21ycDU8UT1FI6JLIW
  1486. 335.74 s [wai-app-static] include http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  1487. 335.74 s [wai-app-static] include memory-0.18.0-1C7UGHHkqpD6hOmlwuB6kp
  1488. 335.74 s [wai-app-static] include mime-types-0.1.2.0-GG4RdWpI4UsLuabPBoGsio
  1489. 335.74 s [wai-app-static] include old-locale-1.0.0.7-DRLvSw2nlac8vyuqyJQCtf
  1490. 335.74 s [wai-app-static] include optparse-applicative-0.18.1.0-4lWQkOtzWhPJvRiiygtQv3
  1491. 335.74 s [wai-app-static] include template-haskell-2.22.0.0-09e7
  1492. 335.74 s [wai-app-static] include text-2.1.3-c691
  1493. 335.74 s [wai-app-static] include time-1.12.2-652a
  1494. 335.74 s [wai-app-static] include transformers-0.6.1.1-6a26
  1495. 335.74 s [wai-app-static] include unix-compat-0.7.4.1-LtRdS5YtFL7IwG9uP1DHOR
  1496. 335.74 s [wai-app-static] include unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  1497. 335.74 s [wai-app-static] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  1498. 335.74 s [wai-app-static] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  1499. 335.74 s [wai-app-static] include warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
  1500. 335.74 s [wai-app-static] include zlib-0.7.1.1-FmuBC2DbVMMDDhjiMmUza2
  1501. 335.74 s [wai-app-static] Network.Wai.Application.Static=wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY:Network.Wai.Application.Static,WaiAppStatic.CmdLine=wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY:WaiAppStatic.CmdLine,WaiAppStatic.Listing=wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY:WaiAppStatic.Listing,WaiAppStatic.Storage.Embedded=wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY:WaiAppStatic.Storage.Embedded,WaiAppStatic.Storage.Filesystem=wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY:WaiAppStatic.Storage.Filesystem,WaiAppStatic.Types=wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY:WaiAppStatic.Types
  1502. 335.74 s [wai-app-static] unit wai-app-static-3.1.9-KbapgSQ5yMt8KB3na5yfc1-warp
  1503. 335.74 s [wai-app-static] include base-4.20.2.0-64da
  1504. 335.74 s [wai-app-static] include wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY
  1505. 335.74 s [wai-app-static] unit wai-app-static-3.1.9-Isn8RoT8KDF60cYVhFPbDb-runtests
  1506. 335.74 s [wai-app-static] include base-4.20.2.0-64da
  1507. 335.74 s [wai-app-static] include bytestring-0.12.2.0-262e
  1508. 335.74 s [wai-app-static] include filepath-1.5.4.0-e600
  1509. 335.74 s [wai-app-static] include hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  1510. 335.74 s [wai-app-static] include http-date-0.0.11-1DQoL21ycDU8UT1FI6JLIW
  1511. 335.74 s [wai-app-static] include http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  1512. 335.74 s [wai-app-static] include mime-types-0.1.2.0-GG4RdWpI4UsLuabPBoGsio
  1513. 335.74 s [wai-app-static] include mockery-0.3.5-EoPvviUQGlu2sq9REsFLwG
  1514. 335.74 s [wai-app-static] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  1515. 335.74 s [wai-app-static] include text-2.1.3-c691
  1516. 335.74 s [wai-app-static] include transformers-0.6.1.1-6a26
  1517. 335.74 s [wai-app-static] include unix-compat-0.7.4.1-LtRdS5YtFL7IwG9uP1DHOR
  1518. 335.74 s [wai-app-static] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  1519. 335.74 s [wai-app-static] include wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY
  1520. 335.74 s [wai-app-static] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  1521. 335.74 s [wai-app-static] include zlib-0.7.1.1-FmuBC2DbVMMDDhjiMmUza2
  1522. 335.74 s [wai-app-static] Ready component graph:
  1523. 335.74 s [wai-app-static] definite wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY
  1524. 335.74 s [wai-app-static] depends base-4.20.2.0-64da
  1525. 335.74 s [wai-app-static] depends blaze-html-0.9.2.0-1TnbZWFHy3R40B6OpF9DR4
  1526. 335.74 s [wai-app-static] depends blaze-markup-0.8.3.0-LC2ElHhGxUxGGV5BUghwSf
  1527. 335.74 s [wai-app-static] depends bytestring-0.12.2.0-262e
  1528. 335.74 s [wai-app-static] depends containers-0.7-504a
  1529. 335.74 s [wai-app-static] depends crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
  1530. 335.74 s [wai-app-static] depends directory-1.3.8.5-c84a
  1531. 335.74 s [wai-app-static] depends file-embed-0.0.16.0-LdzxZSpiar5K5xa2TpsqIW
  1532. 335.74 s [wai-app-static] depends filepath-1.5.4.0-e600
  1533. 335.74 s [wai-app-static] depends http-date-0.0.11-1DQoL21ycDU8UT1FI6JLIW
  1534. 335.74 s [wai-app-static] depends http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  1535. 335.77 s [wai-app-static] depends memory-0.18.0-1C7UGHHkqpD6hOmlwuB6kp
  1536. 335.77 s [wai-app-static] depends mime-types-0.1.2.0-GG4RdWpI4UsLuabPBoGsio
  1537. 335.77 s [wai-app-static] depends old-locale-1.0.0.7-DRLvSw2nlac8vyuqyJQCtf
  1538. 335.77 s [wai-app-static] depends optparse-applicative-0.18.1.0-4lWQkOtzWhPJvRiiygtQv3
  1539. 335.77 s [wai-app-static] depends template-haskell-2.22.0.0-09e7
  1540. 335.77 s [wai-app-static] depends text-2.1.3-c691
  1541. 335.77 s [wai-app-static] depends time-1.12.2-652a
  1542. 335.77 s [wai-app-static] depends transformers-0.6.1.1-6a26
  1543. 335.77 s [wai-app-static] depends unix-compat-0.7.4.1-LtRdS5YtFL7IwG9uP1DHOR
  1544. 335.77 s [wai-app-static] depends unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  1545. 335.77 s [wai-app-static] depends wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  1546. 335.77 s [wai-app-static] depends wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  1547. 335.77 s [wai-app-static] depends warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
  1548. 335.77 s [wai-app-static] depends zlib-0.7.1.1-FmuBC2DbVMMDDhjiMmUza2
  1549. 335.77 s [wai-app-static] definite wai-app-static-3.1.9-Isn8RoT8KDF60cYVhFPbDb-runtests
  1550. 335.77 s [wai-app-static] depends base-4.20.2.0-64da
  1551. 335.77 s [wai-app-static] depends bytestring-0.12.2.0-262e
  1552. 335.77 s [wai-app-static] depends filepath-1.5.4.0-e600
  1553. 335.77 s [wai-app-static] depends hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  1554. 335.77 s [wai-app-static] depends http-date-0.0.11-1DQoL21ycDU8UT1FI6JLIW
  1555. 335.77 s [wai-app-static] depends http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  1556. 335.77 s [wai-app-static] depends mime-types-0.1.2.0-GG4RdWpI4UsLuabPBoGsio
  1557. 335.77 s [wai-app-static] depends mockery-0.3.5-EoPvviUQGlu2sq9REsFLwG
  1558. 335.77 s [wai-app-static] depends temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  1559. 335.77 s [wai-app-static] depends text-2.1.3-c691
  1560. 335.77 s [wai-app-static] depends transformers-0.6.1.1-6a26
  1561. 335.77 s [wai-app-static] depends unix-compat-0.7.4.1-LtRdS5YtFL7IwG9uP1DHOR
  1562. 335.77 s [wai-app-static] depends wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  1563. 335.77 s [wai-app-static] depends wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY
  1564. 335.77 s [wai-app-static] depends wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  1565. 335.77 s [wai-app-static] depends zlib-0.7.1.1-FmuBC2DbVMMDDhjiMmUza2
  1566. 335.77 s [wai-app-static] definite wai-app-static-3.1.9-KbapgSQ5yMt8KB3na5yfc1-warp
  1567. 335.77 s [wai-app-static] depends base-4.20.2.0-64da
  1568. 335.77 s [wai-app-static] depends wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY
  1569. 335.77 s [wai-app-static] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1570. 335.77 s [wai-app-static] Using compiler: ghc-9.10.3
  1571. 335.77 s [wai-app-static] Using install prefix:
  1572. 335.77 s [wai-app-static] /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9
  1573. 335.77 s [wai-app-static] Executables installed in:
  1574. 335.77 s [wai-app-static] /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9/bin
  1575. 335.77 s [wai-app-static] Libraries installed in:
  1576. 335.77 s [wai-app-static] /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY
  1577. 335.77 s [wai-app-static] Dynamic Libraries installed in:
  1578. 335.77 s [wai-app-static] /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  1579. 335.77 s [wai-app-static] Private executables installed in:
  1580. 335.77 s [wai-app-static] /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9/libexec/x86_64-linux-ghc-9.10.3-05f6/wai-app-static-3.1.9
  1581. 335.77 s [wai-app-static] Data files installed in:
  1582. 335.77 s [wai-app-static] /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9/share/x86_64-linux-ghc-9.10.3-05f6/wai-app-static-3.1.9
  1583. 335.77 s [wai-app-static] Documentation installed in:
  1584. 335.77 s [wai-app-static] /nix/store/1m6zkqsrb6rgid3bmjxkw8ysbj7jarc3-wai-app-static-3.1.9-doc/share/doc/wai-app-static-3.1.9
  1585. 335.77 s [wai-app-static] Configuration files installed in:
  1586. 335.77 s [wai-app-static] /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9/etc
  1587. 335.77 s [wai-app-static] No alex found
  1588. 335.77 s [wai-app-static] Using ar found on system at:
  1589. 335.77 s [wai-app-static] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  1590. 335.77 s [wai-app-static] No c2hs found
  1591. 335.77 s [wai-app-static] No cpphs found
  1592. 335.77 s [wai-app-static] No doctest found
  1593. 335.77 s [wai-app-static] Using gcc version 14.3.0 given by user at:
  1594. 335.77 s [wai-app-static] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  1595. 335.77 s [wai-app-static] Using ghc version 9.10.3 found on system at:
  1596. 335.77 s [wai-app-static] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  1597. 335.77 s [wai-app-static] Using ghc-pkg version 9.10.3 found on system at:
  1598. 335.77 s [wai-app-static] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  1599. 335.77 s [wai-app-static] No ghcjs found
  1600. 335.77 s [wai-app-static] No ghcjs-pkg found
  1601. 335.77 s [wai-app-static] No greencard found
  1602. 335.77 s [wai-app-static] Using haddock version 2.31.1 found on system at:
  1603. 335.77 s [wai-app-static] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  1604. 335.77 s [wai-app-static] No happy found
  1605. 335.77 s [wai-app-static] Using haskell-suite found on system at: haskell-suite-dummy-location
  1606. 335.77 s [wai-app-static] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1607. 335.77 s [wai-app-static] No hmake found
  1608. 335.77 s [wai-app-static] Using hpc version 0.69 found on system at:
  1609. 335.77 s [wai-app-static] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  1610. 335.77 s [wai-app-static] Using hsc2hs version 0.68.10 found on system at:
  1611. 335.77 s [wai-app-static] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  1612. 335.77 s [wai-app-static] Using hscolour version 1.25 found on system at:
  1613. 335.77 s [wai-app-static] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  1614. 335.77 s [wai-app-static] No jhc found
  1615. 335.77 s [wai-app-static] Using ld found on system at:
  1616. 335.77 s [wai-app-static] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  1617. 335.77 s [wai-app-static] No pkg-config found
  1618. 335.77 s [wai-app-static] Using runghc version 9.10.3 found on system at:
  1619. 335.77 s [wai-app-static] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  1620. 335.77 s [wai-app-static] Using strip version 2.44 found on system at:
  1621. 335.77 s [wai-app-static] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  1622. 335.77 s [wai-app-static] Using tar found on system at:
  1623. 335.77 s [wai-app-static] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  1624. 335.77 s [wai-app-static] No uhc found
  1625. 335.78 s [Cabal] [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, dist/build/Distribution/Simple/ShowBuildInfo.p_o )
  1626. 336.09 s [hspec-wai] Phase: buildPhase
  1627. 336.09 s [Cabal] [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.p_o )
  1628. 336.20 s [hspec-wai] Preprocessing test suite 'spec' for hspec-wai-0.11.1...
  1629. 336.20 s [Cabal] [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, dist/build/Distribution/Simple/Build/PathsModule.p_o )
  1630. 336.20 s [Cabal] [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, dist/build/Distribution/Simple/Test/LibV09.p_o )
  1631. 336.20 s [Cabal] [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, dist/build/Distribution/Simple/Test/ExeV10.p_o )
  1632. 336.20 s [Cabal] [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, dist/build/Distribution/PackageDescription/Check/Paths.p_o )
  1633. 336.20 s [Cabal] [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, dist/build/Distribution/PackageDescription/Check/Target.p_o )
  1634. 336.20 s [Cabal] [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.p_o )
  1635. 336.20 s [hspec-wai] Building test suite 'spec' for hspec-wai-0.11.1...
  1636. 336.28 s [wai-app-static] Phase: buildPhase
  1637. 336.39 s [wai-app-static] Preprocessing library for wai-app-static-3.1.9...
  1638. 336.53 s [wai-app-static] Building library for wai-app-static-3.1.9...
  1639. 336.53 s [hspec-wai] [ 1 of 10] Compiling Paths_hspec_wai ( dist/build/spec/autogen/Paths_hspec_wai.hs, dist/build/spec/spec-tmp/Paths_hspec_wai.o )
  1640. 336.54 s [hspec-wai] [ 2 of 10] Compiling Test.Hspec.Wai.Util ( src/Test/Hspec/Wai/Util.hs, dist/build/spec/spec-tmp/Test/Hspec/Wai/Util.o )
  1641. 336.65 s [hspec-wai] [ 3 of 10] Compiling Test.Hspec.Wai.Matcher ( src/Test/Hspec/Wai/Matcher.hs, dist/build/spec/spec-tmp/Test/Hspec/Wai/Matcher.o )
  1642. 336.67 s [wai-app-static] [1 of 9] Compiling WaiAppStatic.Types ( WaiAppStatic/Types.hs, dist/build/WaiAppStatic/Types.o, dist/build/WaiAppStatic/Types.dyn_o )
  1643. 336.86 s [hspec-wai] [ 4 of 10] Compiling Test.Hspec.Wai.MatcherSpec ( test/Test/Hspec/Wai/MatcherSpec.hs, dist/build/spec/spec-tmp/Test/Hspec/Wai/MatcherSpec.o )
  1644. 337.00 s [wai-app-static] [2 of 9] Compiling Util ( Util.hs, dist/build/Util.o, dist/build/Util.dyn_o )
  1645. 337.10 s [hspec-wai] [ 5 of 10] Compiling Test.Hspec.Wai.Internal ( src/Test/Hspec/Wai/Internal.hs, dist/build/spec/spec-tmp/Test/Hspec/Wai/Internal.o )
  1646. 337.10 s [hspec-wai] src/Test/Hspec/Wai/Internal.hs:26:1: warning: [GHC-66111] [-Wunused-imports]
  1647. 337.10 s [hspec-wai] The import of ‘Control.Monad.Fail’ is redundant
  1648. 337.10 s [hspec-wai] except perhaps to import instances from ‘Control.Monad.Fail’
  1649. 337.10 s [hspec-wai] To import instances alone, use: import Control.Monad.Fail()
  1650. 337.10 s [hspec-wai] |
  1651. 337.10 s [hspec-wai] 26 | import Control.Monad.Fail
  1652. 337.10 s [hspec-wai] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  1653. 337.10 s [hspec-wai]
  1654. 337.10 s [hspec-wai] [ 6 of 10] Compiling Test.Hspec.Wai.QuickCheck ( src/Test/Hspec/Wai/QuickCheck.hs, dist/build/spec/spec-tmp/Test/Hspec/Wai/QuickCheck.o )
  1655. 337.10 s [hspec-wai] [ 7 of 10] Compiling Test.Hspec.Wai ( src/Test/Hspec/Wai.hs, dist/build/spec/spec-tmp/Test/Hspec/Wai.o )
  1656. 337.10 s [hspec-wai] [ 8 of 10] Compiling Test.Hspec.Wai.UtilSpec ( test/Test/Hspec/Wai/UtilSpec.hs, dist/build/spec/spec-tmp/Test/Hspec/Wai/UtilSpec.o )
  1657. 337.12 s [Cabal] [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.p_o )
  1658. 337.12 s [Cabal] [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, dist/build/Distribution/Compat/Time.p_o )
  1659. 337.12 s [Cabal] [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, dist/build/Distribution/Backpack/ReadyComponent.p_o )
  1660. 337.12 s [Cabal] [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, dist/build/Distribution/Backpack/Configure.p_o )
  1661. 337.12 s [Cabal] [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, dist/build/Distribution/Backpack/DescribeUnitId.p_o )
  1662. 337.12 s [Cabal] [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.p_o )
  1663. 337.12 s [Cabal] [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.p_o )
  1664. 337.12 s [Cabal] [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.p_o )
  1665. 337.12 s [Cabal] [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.p_o )
  1666. 337.12 s [Cabal] [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.p_o )
  1667. 337.12 s [wai-app-static] [3 of 9] Compiling WaiAppStatic.Listing ( WaiAppStatic/Listing.hs, dist/build/WaiAppStatic/Listing.o, dist/build/WaiAppStatic/Listing.dyn_o )
  1668. 337.14 s [hspec-wai] [ 9 of 10] Compiling Test.Hspec.WaiSpec ( test/Test/Hspec/WaiSpec.hs, dist/build/spec/spec-tmp/Test/Hspec/WaiSpec.o )
  1669. 337.22 s [hspec-wai] [10 of 10] Compiling Main ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
  1670. 337.66 s [hspec-wai] [11 of 11] Linking dist/build/spec/spec
  1671. 338.15 s [wai-app-static] [4 of 9] Compiling WaiAppStatic.Storage.Filesystem ( WaiAppStatic/Storage/Filesystem.hs, dist/build/WaiAppStatic/Storage/Filesystem.o, dist/build/WaiAppStatic/Storage/Filesystem.dyn_o )
  1672. 338.25 s [wai-app-static] WaiAppStatic/Storage/Filesystem.hs:20:1: warning: [GHC-66111] [-Wunused-imports]
  1673. 338.25 s [wai-app-static] The import of ‘Data.List’ is redundant
  1674. 338.25 s [wai-app-static] except perhaps to import instances from ‘Data.List’
  1675. 338.25 s [wai-app-static] To import instances alone, use: import Data.List()
  1676. 338.25 s [wai-app-static] |
  1677. 338.25 s [wai-app-static] 20 | import Data.List (foldl')
  1678. 338.25 s [wai-app-static] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  1679. 338.25 s [wai-app-static]
  1680. 338.39 s [wai-app-static] [5 of 9] Compiling WaiAppStatic.Storage.Embedded.TH ( WaiAppStatic/Storage/Embedded/TH.hs, dist/build/WaiAppStatic/Storage/Embedded/TH.o, dist/build/WaiAppStatic/Storage/Embedded/TH.dyn_o )
  1681. 338.91 s [wai-app-static] [6 of 9] Compiling WaiAppStatic.Storage.Embedded.Runtime ( WaiAppStatic/Storage/Embedded/Runtime.hs, dist/build/WaiAppStatic/Storage/Embedded/Runtime.o, dist/build/WaiAppStatic/Storage/Embedded/Runtime.dyn_o )
  1682. 338.91 s [wai-app-static] WaiAppStatic/Storage/Embedded/Runtime.hs:87:33: warning: [GHC-63394] [-Wx-partial]
  1683. 338.91 s [wai-app-static] In the use of ‘head’
  1684. 338.91 s [wai-app-static] (imported from Prelude, but defined in GHC.Internal.List):
  1685. 338.91 s [wai-app-static] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1686. 338.91 s [wai-app-static] |
  1687. 338.91 s [wai-app-static] 87 | next = map (\(x, y) -> (head x, (tail x, y))) orig
  1688. 338.91 s [wai-app-static] | ^^^^
  1689. 338.91 s [wai-app-static]
  1690. 338.91 s [wai-app-static] WaiAppStatic/Storage/Embedded/Runtime.hs:87:42: warning: [GHC-63394] [-Wx-partial]
  1691. 338.91 s [wai-app-static] In the use of ‘tail’
  1692. 338.91 s [wai-app-static] (imported from Prelude, but defined in GHC.Internal.List):
  1693. 338.91 s [wai-app-static] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1694. 338.91 s [wai-app-static] |
  1695. 338.91 s [wai-app-static] 87 | next = map (\(x, y) -> (head x, (tail x, y))) orig
  1696. 338.91 s [wai-app-static] | ^^^^
  1697. 338.91 s [wai-app-static]
  1698. 338.91 s [wai-app-static] WaiAppStatic/Storage/Embedded/Runtime.hs:91:30: warning: [GHC-63394] [-Wx-partial]
  1699. 338.91 s [wai-app-static] In the use of ‘head’
  1700. 338.91 s [wai-app-static] (imported from Prelude, but defined in GHC.Internal.List):
  1701. 338.91 s [wai-app-static] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1702. 338.91 s [wai-app-static] |
  1703. 338.91 s [wai-app-static] 91 | hoisted = map (fst . head &&& map snd) grouped
  1704. 338.91 s [wai-app-static] | ^^^^
  1705. 338.91 s [wai-app-static]
  1706. 338.91 s [wai-app-static] [7 of 9] Compiling WaiAppStatic.Storage.Embedded ( WaiAppStatic/Storage/Embedded.hs, dist/build/WaiAppStatic/Storage/Embedded.o, dist/build/WaiAppStatic/Storage/Embedded.dyn_o )
  1707. 338.94 s [wai-app-static] [8 of 9] Compiling Network.Wai.Application.Static ( Network/Wai/Application/Static.hs, dist/build/Network/Wai/Application/Static.o, dist/build/Network/Wai/Application/Static.dyn_o )
  1708. 339.08 s [hspec-wai] Preprocessing library for hspec-wai-0.11.1...
  1709. 339.08 s [hspec-wai] Building library for hspec-wai-0.11.1...
  1710. 339.28 s [hspec-wai] [1 of 6] Compiling Paths_hspec_wai ( dist/build/autogen/Paths_hspec_wai.hs, dist/build/Paths_hspec_wai.o, dist/build/Paths_hspec_wai.dyn_o )
  1711. 339.43 s [wai-app-static] [9 of 9] Compiling WaiAppStatic.CmdLine ( WaiAppStatic/CmdLine.hs, dist/build/WaiAppStatic/CmdLine.o, dist/build/WaiAppStatic/CmdLine.dyn_o )
  1712. 339.44 s [hspec-wai] [2 of 6] Compiling Test.Hspec.Wai.Util ( src/Test/Hspec/Wai/Util.hs, dist/build/Test/Hspec/Wai/Util.o, dist/build/Test/Hspec/Wai/Util.dyn_o )
  1713. 339.47 s [wai-app-static] WaiAppStatic/CmdLine.hs:135:18: warning: [GHC-68441] [-Wdeprecations]
  1714. 339.47 s [wai-app-static] In the use of ‘def’ (imported from Network.Wai.Middleware.Gzip):
  1715. 339.47 s [wai-app-static] Deprecated: "Please use 'defaultGzipSettings'. 'def' and the Default instance will be removed in a future major update."
  1716. 339.47 s [wai-app-static] |
  1717. 339.47 s [wai-app-static] 135 | gzip def{gzipFiles = GzipCompress}
  1718. 339.47 s [wai-app-static] | ^^^
  1719. 339.47 s [wai-app-static]
  1720. 339.59 s [hspec-wai] [3 of 6] Compiling Test.Hspec.Wai.Matcher ( src/Test/Hspec/Wai/Matcher.hs, dist/build/Test/Hspec/Wai/Matcher.o, dist/build/Test/Hspec/Wai/Matcher.dyn_o )
  1721. 339.88 s [hspec-wai] [4 of 6] Compiling Test.Hspec.Wai.Internal ( src/Test/Hspec/Wai/Internal.hs, dist/build/Test/Hspec/Wai/Internal.o, dist/build/Test/Hspec/Wai/Internal.dyn_o )
  1722. 339.88 s [hspec-wai] src/Test/Hspec/Wai/Internal.hs:26:1: warning: [GHC-66111] [-Wunused-imports]
  1723. 339.88 s [hspec-wai] The import of ‘Control.Monad.Fail’ is redundant
  1724. 339.88 s [hspec-wai] except perhaps to import instances from ‘Control.Monad.Fail’
  1725. 339.88 s [hspec-wai] To import instances alone, use: import Control.Monad.Fail()
  1726. 339.88 s [hspec-wai] |
  1727. 339.88 s [hspec-wai] 26 | import Control.Monad.Fail
  1728. 339.88 s [hspec-wai] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  1729. 339.88 s [hspec-wai]
  1730. 339.96 s [hspec-wai] [5 of 6] Compiling Test.Hspec.Wai.QuickCheck ( src/Test/Hspec/Wai/QuickCheck.hs, dist/build/Test/Hspec/Wai/QuickCheck.o, dist/build/Test/Hspec/Wai/QuickCheck.dyn_o )
  1731. 340.07 s [hspec-wai] [6 of 6] Compiling Test.Hspec.Wai ( src/Test/Hspec/Wai.hs, dist/build/Test/Hspec/Wai.o, dist/build/Test/Hspec/Wai.dyn_o )
  1732. 340.31 s [wai-app-static] [1 of 9] Compiling WaiAppStatic.Types ( WaiAppStatic/Types.hs, dist/build/WaiAppStatic/Types.p_o )
  1733. 340.46 s [hspec-wai] [1 of 6] Compiling Paths_hspec_wai ( dist/build/autogen/Paths_hspec_wai.hs, dist/build/Paths_hspec_wai.p_o )
  1734. 340.73 s [hspec-wai] [2 of 6] Compiling Test.Hspec.Wai.Util ( src/Test/Hspec/Wai/Util.hs, dist/build/Test/Hspec/Wai/Util.p_o )
  1735. 340.73 s [wai-app-static] [2 of 9] Compiling Util ( Util.hs, dist/build/Util.p_o )
  1736. 340.82 s [Cabal] [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.p_o )
  1737. 340.88 s [hspec-wai] [3 of 6] Compiling Test.Hspec.Wai.Matcher ( src/Test/Hspec/Wai/Matcher.hs, dist/build/Test/Hspec/Wai/Matcher.p_o )
  1738. 340.97 s [wai-app-static] [3 of 9] Compiling WaiAppStatic.Listing ( WaiAppStatic/Listing.hs, dist/build/WaiAppStatic/Listing.p_o )
  1739. 341.17 s [Cabal] [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.p_o )
  1740. 341.29 s [hspec-wai] [4 of 6] Compiling Test.Hspec.Wai.Internal ( src/Test/Hspec/Wai/Internal.hs, dist/build/Test/Hspec/Wai/Internal.p_o )
  1741. 341.29 s [hspec-wai] src/Test/Hspec/Wai/Internal.hs:26:1: warning: [GHC-66111] [-Wunused-imports]
  1742. 341.29 s [hspec-wai] The import of ‘Control.Monad.Fail’ is redundant
  1743. 341.29 s [hspec-wai] except perhaps to import instances from ‘Control.Monad.Fail’
  1744. 341.29 s [hspec-wai] To import instances alone, use: import Control.Monad.Fail()
  1745. 341.29 s [hspec-wai] |
  1746. 341.29 s [hspec-wai] 26 | import Control.Monad.Fail
  1747. 341.29 s [hspec-wai] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  1748. 341.29 s [hspec-wai]
  1749. 341.29 s [hspec-wai] [5 of 6] Compiling Test.Hspec.Wai.QuickCheck ( src/Test/Hspec/Wai/QuickCheck.hs, dist/build/Test/Hspec/Wai/QuickCheck.p_o )
  1750. 341.50 s [hspec-wai] [6 of 6] Compiling Test.Hspec.Wai ( src/Test/Hspec/Wai.hs, dist/build/Test/Hspec/Wai.p_o )
  1751. 341.53 s [Cabal] [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.p_o )
  1752. 341.94 s [wai-app-static] [4 of 9] Compiling WaiAppStatic.Storage.Filesystem ( WaiAppStatic/Storage/Filesystem.hs, dist/build/WaiAppStatic/Storage/Filesystem.p_o )
  1753. 341.99 s [Cabal] [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.p_o )
  1754. 342.05 s [wai-app-static] WaiAppStatic/Storage/Filesystem.hs:20:1: warning: [GHC-66111] [-Wunused-imports]
  1755. 342.05 s [wai-app-static] The import of ‘Data.List’ is redundant
  1756. 342.05 s [wai-app-static] except perhaps to import instances from ‘Data.List’
  1757. 342.05 s [wai-app-static] To import instances alone, use: import Data.List()
  1758. 342.05 s [wai-app-static] |
  1759. 342.05 s [wai-app-static] 20 | import Data.List (foldl')
  1760. 342.05 s [wai-app-static] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  1761. 342.05 s [wai-app-static]
  1762. 342.33 s [wai-app-static] [5 of 9] Compiling WaiAppStatic.Storage.Embedded.TH ( WaiAppStatic/Storage/Embedded/TH.hs, dist/build/WaiAppStatic/Storage/Embedded/TH.p_o )
  1763. 342.34 s Waiting for lock on skylighting-0.14.7-doc
  1764. 342.80 s [wai-app-static] [6 of 9] Compiling WaiAppStatic.Storage.Embedded.Runtime ( WaiAppStatic/Storage/Embedded/Runtime.hs, dist/build/WaiAppStatic/Storage/Embedded/Runtime.p_o )
  1765. 342.80 s [wai-app-static] WaiAppStatic/Storage/Embedded/Runtime.hs:87:33: warning: [GHC-63394] [-Wx-partial]
  1766. 342.80 s [wai-app-static] In the use of ‘head’
  1767. 342.80 s [wai-app-static] (imported from Prelude, but defined in GHC.Internal.List):
  1768. 342.80 s [wai-app-static] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1769. 342.80 s [wai-app-static] |
  1770. 342.80 s [wai-app-static] 87 | next = map (\(x, y) -> (head x, (tail x, y))) orig
  1771. 342.80 s [wai-app-static] | ^^^^
  1772. 342.80 s [wai-app-static]
  1773. 342.80 s [wai-app-static] WaiAppStatic/Storage/Embedded/Runtime.hs:87:42: warning: [GHC-63394] [-Wx-partial]
  1774. 342.80 s [wai-app-static] In the use of ‘tail’
  1775. 342.80 s [wai-app-static] (imported from Prelude, but defined in GHC.Internal.List):
  1776. 342.80 s [wai-app-static] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1777. 342.80 s [wai-app-static] |
  1778. 342.80 s [wai-app-static] 87 | next = map (\(x, y) -> (head x, (tail x, y))) orig
  1779. 342.80 s [wai-app-static] | ^^^^
  1780. 342.80 s [wai-app-static]
  1781. 342.80 s [wai-app-static] WaiAppStatic/Storage/Embedded/Runtime.hs:91:30: warning: [GHC-63394] [-Wx-partial]
  1782. 342.80 s [wai-app-static] In the use of ‘head’
  1783. 342.80 s [wai-app-static] (imported from Prelude, but defined in GHC.Internal.List):
  1784. 342.80 s [wai-app-static] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1785. 342.80 s [wai-app-static] |
  1786. 342.80 s [wai-app-static] 91 | hoisted = map (fst . head &&& map snd) grouped
  1787. 342.80 s [wai-app-static] | ^^^^
  1788. 342.80 s [wai-app-static]
  1789. 342.80 s [wai-app-static] [7 of 9] Compiling WaiAppStatic.Storage.Embedded ( WaiAppStatic/Storage/Embedded.hs, dist/build/WaiAppStatic/Storage/Embedded.p_o )
  1790. 342.93 s [wai-app-static] [8 of 9] Compiling Network.Wai.Application.Static ( Network/Wai/Application/Static.hs, dist/build/Network/Wai/Application/Static.p_o )
  1791. 343.69 s [wai-app-static] [9 of 9] Compiling WaiAppStatic.CmdLine ( WaiAppStatic/CmdLine.hs, dist/build/WaiAppStatic/CmdLine.p_o )
  1792. 343.74 s [wai-app-static] WaiAppStatic/CmdLine.hs:135:18: warning: [GHC-68441] [-Wdeprecations]
  1793. 343.74 s [wai-app-static] In the use of ‘def’ (imported from Network.Wai.Middleware.Gzip):
  1794. 343.74 s [wai-app-static] Deprecated: "Please use 'defaultGzipSettings'. 'def' and the Default instance will be removed in a future major update."
  1795. 343.74 s [wai-app-static] |
  1796. 343.74 s [wai-app-static] 135 | gzip def{gzipFiles = GzipCompress}
  1797. 343.74 s [wai-app-static] | ^^^
  1798. 343.74 s [wai-app-static]
  1799. 343.75 s [Cabal] [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.p_o )
  1800. 344.79 s [hspec-wai] Phase: checkPhase
  1801. 345.32 s [hspec-wai] Running 1 test suites...
  1802. 345.32 s [hspec-wai] Test suite spec: RUNNING...
  1803. 345.32 s [hspec-wai]
  1804. 345.32 s [hspec-wai] Test.Hspec.Wai
  1805. 345.32 s [hspec-wai] WaiSession
  1806. 345.32 s [hspec-wai] has a MonadFail instance [✔]
  1807. 345.32 s [hspec-wai] get
  1808. 345.32 s [hspec-wai] sends a get request [✔]
  1809. 345.32 s [hspec-wai] post
  1810. 345.32 s [hspec-wai] sends a post request [✔]
  1811. 345.32 s [hspec-wai] put
  1812. 345.33 s [hspec-wai] sends a put request [✔]
  1813. 345.33 s [hspec-wai] options
  1814. 345.33 s [hspec-wai] sends an options request [✔]
  1815. 345.33 s [hspec-wai] delete
  1816. 345.33 s [hspec-wai] sends a delete request [✔]
  1817. 345.33 s [hspec-wai] request
  1818. 345.33 s [hspec-wai] sends method, path, headers, and body [✔]
  1819. 345.33 s [hspec-wai] postHtmlForm
  1820. 345.33 s [hspec-wai] sends a post request with form-encoded params [✔]
  1821. 345.33 s [hspec-wai] Test.Hspec.Wai.Matcher
  1822. 345.33 s [hspec-wai] match
  1823. 345.33 s [hspec-wai] when both status and body do match
  1824. 345.33 s [hspec-wai] returns Nothing [✔]
  1825. 345.33 s [hspec-wai] when status does not match
  1826. 345.33 s [hspec-wai] returns an error message [✔]
  1827. 345.33 s [hspec-wai] when body does not match
  1828. 345.33 s [hspec-wai] returns an error message [✔]
  1829. 345.33 s [hspec-wai] when one body contains unsafe characters
  1830. 345.33 s [hspec-wai] uses show for both bodies in the error message [✔]
  1831. 345.33 s [hspec-wai] when both status and body do not match
  1832. 345.33 s [hspec-wai] combines error messages [✔]
  1833. 345.33 s [hspec-wai] when matching headers
  1834. 345.33 s [hspec-wai] when header is missing
  1835. 345.33 s [hspec-wai] returns an error message [✔]
  1836. 345.33 s [hspec-wai] when multiple headers are missing
  1837. 345.33 s [hspec-wai] combines error messages [✔]
  1838. 345.33 s [hspec-wai] Test.Hspec.Wai.Util
  1839. 345.33 s [hspec-wai] formUrlEncodeQuery
  1840. 345.33 s [hspec-wai] separates keys from values by = [✔]
  1841. 345.33 s [hspec-wai] separates pairs by & [✔]
  1842. 345.33 s [hspec-wai] applies newline normalization [✔]
  1843. 345.33 s [hspec-wai] handles Unicode characters [✔]
  1844. 345.33 s [hspec-wai] when encoding characters in the printable ASCII range
  1845. 345.33 s [hspec-wai] behaves like Firefox [✔]
  1846. 345.33 s [hspec-wai] can be reverted by Network.HTTP.Types.parseSimpleQuery [✔]
  1847. 345.33 s [hspec-wai] +++ OK, passed 100 tests.
  1848. 345.33 s [hspec-wai] safeToString
  1849. 345.33 s [hspec-wai] when used on an empty string
  1850. 345.33 s [hspec-wai] returns Nothing [✔]
  1851. 345.33 s [hspec-wai] formatHeader
  1852. 345.33 s [hspec-wai] formats header [✔]
  1853. 345.33 s [hspec-wai] when ends with whitespace
  1854. 345.33 s [hspec-wai] uses show [✔]
  1855. 345.33 s [hspec-wai] when contains non-print characters
  1856. 345.33 s [hspec-wai] uses show [✔]
  1857. 345.33 s [hspec-wai] when header is not decodable as UTF-8
  1858. 345.33 s [hspec-wai] uses show [✔]
  1859. 345.33 s [hspec-wai]
  1860. 345.33 s [hspec-wai] Finished in 0.0099 seconds
  1861. 345.33 s [hspec-wai] 26 examples, 0 failures
  1862. 345.34 s [hspec-wai] Test suite spec: PASS
  1863. 345.34 s [hspec-wai] Test suite logged to: dist/test/hspec-wai-0.11.1-spec.log
  1864. 345.34 s [hspec-wai] 1 of 1 test suites (1 of 1 test cases) passed.
  1865. 345.35 s [hspec-wai] Phase: haddockPhase
  1866. 345.52 s [hspec-wai] Preprocessing test suite 'spec' for hspec-wai-0.11.1...
  1867. 345.53 s [hspec-wai] Preprocessing library for hspec-wai-0.11.1...
  1868. 345.53 s [hspec-wai] Running Haddock on library for hspec-wai-0.11.1...
  1869. 345.53 s [hspec-wai] Warning: The documentation for the following packages are not installed. No
  1870. 345.53 s [hspec-wai] links will be generated to these packages: attoparsec-0.14.4,
  1871. 345.53 s [hspec-wai] attoparsec-0.14.4, vector-0.13.2.0
  1872. 345.89 s [hspec-wai] [1 of 6] Compiling Paths_hspec_wai ( dist/build/autogen/Paths_hspec_wai.hs, nothing )
  1873. 345.94 s [hspec-wai] [2 of 6] Compiling Test.Hspec.Wai.Util ( src/Test/Hspec/Wai/Util.hs, nothing )
  1874. 346.07 s [hspec-wai] [3 of 6] Compiling Test.Hspec.Wai.Matcher ( src/Test/Hspec/Wai/Matcher.hs, nothing )
  1875. 346.10 s [hspec-wai] [4 of 6] Compiling Test.Hspec.Wai.Internal ( src/Test/Hspec/Wai/Internal.hs, nothing )
  1876. 346.27 s [hspec-wai] src/Test/Hspec/Wai/Internal.hs:26:1: warning: [GHC-66111] [-Wunused-imports]
  1877. 346.27 s [hspec-wai] The import of ‘Control.Monad.Fail’ is redundant
  1878. 346.27 s [hspec-wai] except perhaps to import instances from ‘Control.Monad.Fail’
  1879. 346.27 s [hspec-wai] To import instances alone, use: import Control.Monad.Fail()
  1880. 346.27 s [hspec-wai] |
  1881. 346.27 s [hspec-wai] 26 | import Control.Monad.Fail
  1882. 346.27 s [hspec-wai] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  1883. 346.27 s [hspec-wai]
  1884. 346.27 s [hspec-wai] [5 of 6] Compiling Test.Hspec.Wai.QuickCheck ( src/Test/Hspec/Wai/QuickCheck.hs, nothing )
  1885. 346.46 s [hspec-wai] [6 of 6] Compiling Test.Hspec.Wai ( src/Test/Hspec/Wai.hs, nothing )
  1886. 346.48 s [hspec-wai] Haddock coverage:
  1887. 346.48 s [hspec-wai] 0% ( 0 / 9) in 'Test.Hspec.Wai.Matcher'
  1888. 346.48 s [hspec-wai] Missing documentation for:
  1889. 346.48 s [hspec-wai] Module header
  1890. 346.48 s [hspec-wai] ResponseMatcher (src/Test/Hspec/Wai/Matcher.hs:30)
  1891. 346.48 s [hspec-wai] MatchHeader (src/Test/Hspec/Wai/Matcher.hs:36)
  1892. 346.48 s [hspec-wai] MatchBody (src/Test/Hspec/Wai/Matcher.hs:38)
  1893. 346.48 s [hspec-wai] Body (src/Test/Hspec/Wai/Matcher.hs:28)
  1894. 346.48 s [hspec-wai] <:> (src/Test/Hspec/Wai/Matcher.hs:89)
  1895. 346.48 s [hspec-wai] bodyEquals (src/Test/Hspec/Wai/Matcher.hs:41)
  1896. 346.48 s [hspec-wai] match (src/Test/Hspec/Wai/Matcher.hs:68)
  1897. 346.48 s [hspec-wai] formatHeader (src/Test/Hspec/Wai/Util.hs:27)
  1898. 346.48 s [hspec-wai] Warning: 'WaiSession' is ambiguous. It is defined
  1899. 346.48 s [hspec-wai] * at src/Test/Hspec/Wai/Internal.hs:36:27
  1900. 346.48 s [hspec-wai] * at src/Test/Hspec/Wai/Internal.hs:36:1
  1901. 346.48 s [hspec-wai] You may be able to disambiguate the identifier by qualifying it or
  1902. 346.48 s [hspec-wai] by specifying the type/value namespace explicitly.
  1903. 346.48 s [hspec-wai] Defaulting to the one defined at src/Test/Hspec/Wai/Internal.hs:36:1
  1904. 346.48 s [hspec-wai] 22% ( 2 / 9) in 'Test.Hspec.Wai.Internal'
  1905. 346.48 s [hspec-wai] Missing documentation for:
  1906. 346.48 s [hspec-wai] Module header
  1907. 346.48 s [hspec-wai] runWaiSession (src/Test/Hspec/Wai/Internal.hs:44)
  1908. 346.48 s [hspec-wai] runWithState (src/Test/Hspec/Wai/Internal.hs:47)
  1909. 346.48 s [hspec-wai] withApplication (src/Test/Hspec/Wai/Internal.hs:50)
  1910. 346.48 s [hspec-wai] getApp (src/Test/Hspec/Wai/Internal.hs:57)
  1911. 346.48 s [hspec-wai] getState (src/Test/Hspec/Wai/Internal.hs:60)
  1912. 346.48 s [hspec-wai] formatHeader (src/Test/Hspec/Wai/Util.hs:27)
  1913. 346.49 s [hspec-wai] 44% ( 4 / 9) in 'Test.Hspec.Wai.QuickCheck'
  1914. 346.49 s [hspec-wai] Missing documentation for:
  1915. 346.49 s [hspec-wai] Module header
  1916. 346.49 s [hspec-wai] property (src/Test/Hspec/Wai/QuickCheck.hs:24)
  1917. 346.49 s [hspec-wai] ==> (src/Test/Hspec/Wai/QuickCheck.hs:46)
  1918. 346.49 s [hspec-wai] Testable (src/Test/Hspec/Wai/QuickCheck.hs:28)
  1919. 346.49 s [hspec-wai] WaiProperty (src/Test/Hspec/Wai/QuickCheck.hs:26)
  1920. 346.49 s [hspec-wai] Warning: 'ResponseMatcher' is ambiguous. It is defined
  1921. 346.49 s [hspec-wai] * at src/Test/Hspec/Wai/Matcher.hs:30:24
  1922. 346.49 s [hspec-wai] * at src/Test/Hspec/Wai/Matcher.hs:30:1
  1923. 346.49 s [hspec-wai] You may be able to disambiguate the identifier by qualifying it or
  1924. 346.49 s [hspec-wai] by specifying the type/value namespace explicitly.
  1925. 346.49 s [hspec-wai] Defaulting to the one defined at src/Test/Hspec/Wai/Matcher.hs:30:1
  1926. 346.49 s [hspec-wai] Warning: 'IsString' is out of scope.
  1927. 346.49 s [hspec-wai] If you qualify the identifier, haddock can try to link it anyway.
  1928. 346.49 s [hspec-wai] 71% ( 20 / 28) in 'Test.Hspec.Wai'
  1929. 346.49 s [hspec-wai] Missing documentation for:
  1930. 346.49 s [hspec-wai] ResponseMatcher (src/Test/Hspec/Wai/Matcher.hs:30)
  1931. 346.49 s [hspec-wai] MatchHeader (src/Test/Hspec/Wai/Matcher.hs:36)
  1932. 346.49 s [hspec-wai] MatchBody (src/Test/Hspec/Wai/Matcher.hs:38)
  1933. 346.49 s [hspec-wai] Body (src/Test/Hspec/Wai/Matcher.hs:28)
  1934. 346.49 s [hspec-wai] <:> (src/Test/Hspec/Wai/Matcher.hs:89)
  1935. 346.49 s [hspec-wai] with (src/Test/Hspec/Wai.hs:66)
  1936. 346.49 s [hspec-wai] withState (src/Test/Hspec/Wai.hs:69)
  1937. 346.49 s [hspec-wai] getState (src/Test/Hspec/Wai/Internal.hs:60)
  1938. 346.82 s [hspec-wai] Warning: Test.Hspec.Wai.QuickCheck: could not find link destinations for:
  1939. 346.83 s [hspec-wai] - Test.QuickCheck.Random.QCGen
  1940. 346.83 s [hspec-wai] - Test.QuickCheck.Modifiers.InfiniteListInternalData
  1941. 347.34 s [Cabal] buildPhase completed in 1 minutes 39 seconds
  1942. 347.34 s [Cabal] Phase: haddockPhase
  1943. 347.42 s [wai-app-static] Preprocessing test suite 'runtests' for wai-app-static-3.1.9...
  1944. 347.42 s [wai-app-static] Building test suite 'runtests' for wai-app-static-3.1.9...
  1945. 347.48 s [Cabal] Preprocessing library for Cabal-3.12.1.0..
  1946. 347.50 s [wai-app-static] [1 of 4] Compiling EmbeddedTestEntries ( test/EmbeddedTestEntries.hs, dist/build/runtests/runtests-tmp/EmbeddedTestEntries.o, dist/build/runtests/runtests-tmp/EmbeddedTestEntries.dyn_o )
  1947. 347.50 s [Cabal] Running Haddock on library for Cabal-3.12.1.0..
  1948. 347.56 s [Cabal] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  1949. 348.01 s [wai-app-static] [2 of 4] Compiling WaiAppEmbeddedTest ( test/WaiAppEmbeddedTest.hs, dist/build/runtests/runtests-tmp/WaiAppEmbeddedTest.o )
  1950. 348.80 s [Cabal] 0% ( 0 / 5) in 'Distribution.Backpack.FullUnitId'
  1951. 348.81 s [Cabal] Missing documentation for:
  1952. 348.81 s [Cabal] Module header
  1953. 348.81 s [Cabal] FullUnitId (src/Distribution/Backpack/FullUnitId.hs:15)
  1954. 348.81 s [Cabal] FullDb (src/Distribution/Backpack/FullUnitId.hs:18)
  1955. 348.81 s [Cabal] expandOpenUnitId (src/Distribution/Backpack/FullUnitId.hs:20)
  1956. 348.81 s [Cabal] expandUnitId (src/Distribution/Backpack/FullUnitId.hs:26)
  1957. 348.82 s [Cabal] Warning: 'ModuleSubst' is out of scope.
  1958. 348.82 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1959. 348.82 s [Cabal] 100% ( 2 / 2) in 'Distribution.Backpack.ModSubst'
  1960. 348.85 s [Cabal] Warning: 'ModuleShape' is out of scope.
  1961. 348.85 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1962. 348.85 s [Cabal] Warning: 'Module' is out of scope.
  1963. 348.85 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1964. 349.02 s [Cabal] 80% ( 4 / 5) in 'Distribution.Backpack.ModuleShape'
  1965. 349.02 s [Cabal] Missing documentation for:
  1966. 349.02 s [Cabal] shapeInstalledPackage (src/Distribution/Backpack/ModuleShape.hs:76)
  1967. 349.04 s [Cabal] 0% ( 0 / 5) in 'Distribution.Backpack.PreModuleShape'
  1968. 349.04 s [Cabal] Missing documentation for:
  1969. 349.04 s [Cabal] Module header
  1970. 349.04 s [Cabal] PreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:22)
  1971. 349.04 s [Cabal] toPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:28)
  1972. 349.04 s [Cabal] renamePreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:31)
  1973. 349.04 s [Cabal] mixLinkPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:40)
  1974. 349.06 s [Cabal] Warning: 'async' is out of scope.
  1975. 349.06 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1976. 349.07 s [Cabal] 50% ( 1 / 2) in 'Distribution.Compat.CreatePipe'
  1977. 349.07 s [Cabal] Missing documentation for:
  1978. 349.07 s [Cabal] Module header
  1979. 349.08 s [Cabal] 75% ( 3 / 4) in 'Distribution.Compat.Directory'
  1980. 349.08 s [Cabal] Missing documentation for:
  1981. 349.08 s [Cabal] Module header
  1982. 349.08 s [Cabal] 66% ( 2 / 3) in 'Distribution.Compat.FilePath'
  1983. 349.08 s [Cabal] Missing documentation for:
  1984. 349.08 s [Cabal] Module header
  1985. 349.08 s [Cabal] Warning: 'GetShortPathName' is out of scope.
  1986. 349.08 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1987. 349.17 s [Cabal] 100% ( 2 / 2) in 'Distribution.Compat.Prelude.Internal'
  1988. 349.18 s [Cabal] Warning: 'delegate_ctlc' is out of scope.
  1989. 349.18 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1990. 349.18 s [Cabal] 80% ( 4 / 5) in 'Distribution.Compat.Process'
  1991. 349.18 s [Cabal] Missing documentation for:
  1992. 349.18 s [Cabal] Module header
  1993. 349.19 s [Cabal] 66% ( 2 / 3) in 'Distribution.Compat.ResponseFile'
  1994. 349.19 s [Cabal] Missing documentation for:
  1995. 349.19 s [Cabal] Module header
  1996. 349.21 s [Cabal] Warning: 'Verbosity' is out of scope.
  1997. 349.21 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1998. 349.21 s [Cabal] 66% ( 6 / 9) in 'Distribution.Compat.Stack'
  1999. 349.21 s [Cabal] Missing documentation for:
  2000. 349.21 s [Cabal] Module header
  2001. 349.21 s [Cabal] WithCallStack (src/Distribution/Compat/Stack.hs:31)
  2002. 349.21 s [Cabal] withLexicalCallStack (src/Distribution/Compat/Stack.hs:73)
  2003. 349.25 s [Cabal] Warning: 'ReturnInOrder' is out of scope.
  2004. 349.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2005. 349.48 s [wai-app-static] [3 of 4] Compiling WaiAppStaticTest ( test/WaiAppStaticTest.hs, dist/build/runtests/runtests-tmp/WaiAppStaticTest.o )
  2006. 349.48 s [wai-app-static] [4 of 4] Compiling Main ( test/../tests.hs, dist/build/runtests/runtests-tmp/Main.o )
  2007. 349.75 s [Cabal] 50% ( 5 / 10) in 'Distribution.ReadE'
  2008. 349.75 s [Cabal] Missing documentation for:
  2009. 349.75 s [Cabal] succeedReadE (src/Distribution/ReadE.hs:46)
  2010. 349.75 s [Cabal] failReadE (src/Distribution/ReadE.hs:49)
  2011. 349.75 s [Cabal] parsecToReadE (src/Distribution/ReadE.hs:56)
  2012. 349.75 s [Cabal] parsecToReadEErr (src/Distribution/ReadE.hs:60)
  2013. 349.75 s [Cabal] unexpectMsgString (src/Distribution/ReadE.hs:66)
  2014. 349.78 s [Cabal] 100% ( 6 / 6) in 'Distribution.Simple.BuildToolDepends'
  2015. 349.79 s [Cabal] Warning: 'a' is out of scope.
  2016. 349.79 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2017. 349.79 s [Cabal] Warning: 'b' is out of scope.
  2018. 349.79 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2019. 349.79 s [Cabal] 100% ( 5 / 5) in 'Distribution.Simple.CCompiler'
  2020. 349.82 s [Cabal] 100% ( 12 / 12) in 'Distribution.Simple.Flag'
  2021. 349.86 s [Cabal] 0% ( 0 / 3) in 'Distribution.Simple.InstallDirs.Internal'
  2022. 349.86 s [Cabal] Missing documentation for:
  2023. 349.86 s [Cabal] Module header
  2024. 349.86 s [Cabal] PathComponent (src/Distribution/Simple/InstallDirs/Internal.hs:12)
  2025. 349.86 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  2026. 349.94 s [Cabal] 47% ( 11 / 23) in 'Distribution.Simple.InstallDirs'
  2027. 349.94 s [Cabal] Missing documentation for:
  2028. 349.94 s [Cabal] defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:178)
  2029. 349.94 s [Cabal] defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:181)
  2030. 349.94 s [Cabal] combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:116)
  2031. 349.94 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  2032. 349.94 s [Cabal] PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
  2033. 349.94 s [Cabal] combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:409)
  2034. 349.94 s [Cabal] substPathTemplate (src/Distribution/Simple/InstallDirs.hs:413)
  2035. 349.94 s [Cabal] platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:451)
  2036. 349.94 s [Cabal] compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:446)
  2037. 349.94 s [Cabal] packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:436)
  2038. 349.95 s [Cabal] abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:457)
  2039. 349.95 s [Cabal] installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:476)
  2040. 350.01 s [Cabal] Warning: 'strip' is out of scope.
  2041. 350.01 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2042. 350.01 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Program.Internal'
  2043. 350.03 s [Cabal] 22% ( 2 / 9) in 'Distribution.TestSuite'
  2044. 350.03 s [Cabal] Missing documentation for:
  2045. 350.03 s [Cabal] TestInstance (src/Distribution/TestSuite.hs:30)
  2046. 350.03 s [Cabal] OptionDescr (src/Distribution/TestSuite.hs:49)
  2047. 350.03 s [Cabal] OptionType (src/Distribution/TestSuite.hs:59)
  2048. 350.03 s [Cabal] Test (src/Distribution/TestSuite.hs:78)
  2049. 350.03 s [Cabal] Options (src/Distribution/TestSuite.hs:94)
  2050. 350.03 s [Cabal] Progress (src/Distribution/TestSuite.hs:96)
  2051. 350.03 s [Cabal] Result (src/Distribution/TestSuite.hs:100)
  2052. 350.04 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.AnnotatedId'
  2053. 350.04 s [Cabal] Missing documentation for:
  2054. 350.04 s [Cabal] Module header
  2055. 350.05 s [wai-app-static] [5 of 5] Linking dist/build/runtests/runtests
  2056. 350.06 s [Cabal] Warning: 'LinkedComponent' is out of scope.
  2057. 350.06 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2058. 350.06 s [Cabal] Warning: 'pc_pkgid' is out of scope.
  2059. 350.06 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2060. 350.06 s [Cabal] Warning: 'CSubLibName' is out of scope.
  2061. 350.06 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2062. 350.06 s [Cabal] 20% ( 1 / 5) in 'Distribution.Types.ComponentInclude'
  2063. 350.06 s [Cabal] Missing documentation for:
  2064. 350.06 s [Cabal] Module header
  2065. 350.06 s [Cabal] ComponentInclude (src/Distribution/Types/ComponentInclude.hs:16)
  2066. 350.06 s [Cabal] ci_id (src/Distribution/Types/ComponentInclude.hs:24)
  2067. 350.06 s [Cabal] ci_pkgid (src/Distribution/Types/ComponentInclude.hs:27)
  2068. 350.11 s [Cabal] Warning: 'BuildInfo' is out of scope.
  2069. 350.11 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2070. 350.11 s [Cabal] 25% ( 1 / 4) in 'Distribution.Types.ComponentLocalBuildInfo'
  2071. 350.11 s [Cabal] Missing documentation for:
  2072. 350.11 s [Cabal] Module header
  2073. 350.11 s [Cabal] componentIsIndefinite (src/Distribution/Types/ComponentLocalBuildInfo.hs:121)
  2074. 350.11 s [Cabal] maybeComponentInstantiatedWith (src/Distribution/Types/ComponentLocalBuildInfo.hs:125)
  2075. 350.13 s [Cabal] 0% ( 0 / 2) in 'Distribution.Types.DumpBuildInfo'
  2076. 350.13 s [Cabal] Missing documentation for:
  2077. 350.13 s [Cabal] Module header
  2078. 350.13 s [Cabal] DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
  2079. 350.14 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.GivenComponent'
  2080. 350.14 s [Cabal] Missing documentation for:
  2081. 350.14 s [Cabal] Module header
  2082. 350.15 s [Cabal] 100% ( 5 / 5) in 'Distribution.Types.PackageName.Magic'
  2083. 350.15 s [Cabal] 80% ( 4 / 5) in 'Distribution.Types.ParStrat'
  2084. 350.15 s [Cabal] Missing documentation for:
  2085. 350.15 s [Cabal] Module header
  2086. 350.18 s [Cabal] Warning: 'LocalBuildInfo' is out of scope.
  2087. 350.18 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2088. 350.18 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.TargetInfo'
  2089. 350.18 s [Cabal] Missing documentation for:
  2090. 350.18 s [Cabal] Module header
  2091. 350.20 s [Cabal] Warning: 'hClose' is out of scope.
  2092. 350.20 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2093. 350.20 s [Cabal] 100% ( 8 / 8) in 'Distribution.Utils.IOData'
  2094. 350.21 s [Cabal] Warning: 'ByteString' is out of scope.
  2095. 350.21 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2096. 350.21 s [Cabal] 75% ( 3 / 4) in 'Distribution.Utils.Json'
  2097. 350.21 s [Cabal] Missing documentation for:
  2098. 350.21 s [Cabal] Json (src/Distribution/Utils/Json.hs:20)
  2099. 350.22 s [Cabal] Warning: 'mapAccumL' is out of scope.
  2100. 350.22 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2101. 350.22 s [Cabal] 50% ( 1 / 2) in 'Distribution.Utils.MapAccum'
  2102. 350.22 s [Cabal] Missing documentation for:
  2103. 350.22 s [Cabal] Module header
  2104. 350.23 s [Cabal] 100% ( 5 / 5) in 'Distribution.Utils.Progress'
  2105. 350.28 s [Cabal] 0% ( 0 / 3) in 'Distribution.Verbosity.Internal'
  2106. 350.28 s [Cabal] Missing documentation for:
  2107. 350.28 s [Cabal] Module header
  2108. 350.28 s [Cabal] VerbosityLevel (src/Distribution/Verbosity/Internal.hs:12)
  2109. 350.28 s [Cabal] VerbosityFlag (src/Distribution/Verbosity/Internal.hs:18)
  2110. 350.33 s [Cabal] Warning: 'stderr' is out of scope.
  2111. 350.33 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2112. 350.33 s [Cabal] Warning: 'stdout' is out of scope.
  2113. 350.33 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2114. 350.33 s [Cabal] 87% ( 35 / 40) in 'Distribution.Verbosity'
  2115. 350.33 s [Cabal] Missing documentation for:
  2116. 350.33 s [Cabal] Verbosity (src/Distribution/Verbosity.hs:90)
  2117. 350.33 s [Cabal] flagToVerbosity (src/Distribution/Verbosity.hs:240)
  2118. 350.33 s [Cabal] showForCabal (src/Distribution/Verbosity.hs:243)
  2119. 350.33 s [Cabal] showForGHC (src/Distribution/Verbosity.hs:266)
  2120. 350.33 s [Cabal] verboseHasFlags (src/Distribution/Verbosity.hs:334)
  2121. 350.42 s [Cabal] Warning: 'simpleProgram' is out of scope.
  2122. 350.42 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2123. 350.42 s [Cabal] Warning: 'findProgramOnSearchPath' is out of scope.
  2124. 350.42 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2125. 350.42 s [Cabal] Warning: 'findExecutable' is out of scope.
  2126. 350.42 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2127. 350.42 s [Cabal] 83% ( 10 / 12) in 'Distribution.Simple.Program.Types'
  2128. 350.42 s [Cabal] Missing documentation for:
  2129. 350.42 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  2130. 350.42 s [Cabal] ProgArg (src/Distribution/Simple/Program/Types.hs:83)
  2131. 350.62 s [Cabal] 60% ( 3 / 5) in 'Distribution.Simple.PreProcess.Types'
  2132. 350.62 s [Cabal] Missing documentation for:
  2133. 350.62 s [Cabal] builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:110)
  2134. 350.62 s [Cabal] builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:113)
  2135. 350.66 s [Cabal] 0% ( 0 / 5) in 'Distribution.Simple.Errors'
  2136. 350.66 s [Cabal] Missing documentation for:
  2137. 350.66 s [Cabal] Module header
  2138. 350.66 s [Cabal] CabalException (src/Distribution/Simple/Errors.hs:46)
  2139. 350.66 s [Cabal] FailedDependency (src/Distribution/Simple/Errors.hs:39)
  2140. 350.66 s [Cabal] exceptionCode (src/Distribution/Simple/Errors.hs:178)
  2141. 350.66 s [Cabal] exceptionMessage (src/Distribution/Simple/Errors.hs:314)
  2142. 350.70 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.PreProcess.Unlit'
  2143. 350.74 s [Cabal] Warning: 'UnitIdU' is ambiguous. It is defined
  2144. 350.74 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:261:5
  2145. 350.74 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:268:1
  2146. 350.74 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2147. 350.74 s [Cabal] by specifying the type/value namespace explicitly.
  2148. 350.74 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:260:1
  2149. 350.74 s [Cabal] Warning: 'ModuleU' is ambiguous. It is defined
  2150. 350.74 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:256:5
  2151. 350.74 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:265:1
  2152. 350.74 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2153. 350.74 s [Cabal] by specifying the type/value namespace explicitly.
  2154. 350.74 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:255:1
  2155. 350.74 s [Cabal] Warning: 'ModuleSubst' is out of scope.
  2156. 350.74 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2157. 350.99 s [Cabal] Warning: 'die' is out of scope.
  2158. 350.99 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2159. 350.99 s [Cabal] Warning: 'rawSystem' is out of scope.
  2160. 350.99 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2161. 350.99 s [Cabal] Warning: 'action' is out of scope.
  2162. 350.99 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2163. 350.99 s [Cabal] Warning: 'CreatePipe' is out of scope.
  2164. 350.99 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2165. 350.99 s [Cabal] Warning: 'waitForProcess' is out of scope.
  2166. 350.99 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2167. 350.99 s [Cabal] Warning: 'findModuleFile' is out of scope.
  2168. 350.99 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2169. 350.99 s [Cabal] Warning: 'createDirectoryIfMissing' is out of scope.
  2170. 350.99 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2171. 350.99 s [Cabal] Warning: 'ByteString' is out of scope.
  2172. 350.99 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2173. 350.99 s [Cabal] 85% (122 /142) in 'Distribution.Simple.Utils'
  2174. 350.99 s [Cabal] Missing documentation for:
  2175. 350.99 s [Cabal] cabalVersion (src/Distribution/Simple/Utils.hs:283)
  2176. 350.99 s [Cabal] dieNoVerbosity (src/Distribution/Simple/Utils.hs:345)
  2177. 350.99 s [Cabal] die' (src/Distribution/Simple/Utils.hs:375)
  2178. 350.99 s [Cabal] dieWithException (src/Distribution/Simple/Utils.hs:388)
  2179. 350.99 s [Cabal] dieWithLocation' (src/Distribution/Simple/Utils.hs:364)
  2180. 350.99 s [Cabal] dieNoWrap (src/Distribution/Simple/Utils.hs:407)
  2181. 350.99 s [Cabal] topHandler (src/Distribution/Simple/Utils.hs:514)
  2182. 350.99 s [Cabal] topHandlerWith (src/Distribution/Simple/Utils.hs:463)
  2183. 350.99 s [Cabal] infoNoWrap (src/Distribution/Simple/Utils.hs:602)
  2184. 350.99 s [Cabal] VerboseException (src/Distribution/Simple/Utils.hs:384)
  2185. 350.99 s [Cabal] setFileOrdinary (src/Distribution/Compat/CopyFile.hs:73)
  2186. 350.99 s [Cabal] setFileExecutable (src/Distribution/Compat/CopyFile.hs:73)
  2187. 350.99 s [Cabal] shortRelativePath (src/Distribution/Simple/Utils.hs:1746)
  2188. 350.99 s [Cabal] findFirstFile (src/Distribution/Simple/Utils.hs:1300)
  2189. 350.99 s [Cabal] findAllFilesWithExtension (src/Distribution/Simple/Utils.hs:1272)
  2190. 350.99 s [Cabal] addLibraryPath (src/Distribution/Simple/Utils.hs:1392)
  2191. 350.99 s [Cabal] defaultTempFileOptions (src/Distribution/Simple/Utils.hs:1637)
  2192. 350.99 s [Cabal] createTempDirectory (src/Distribution/Compat/Internal/TempFile.hs:123)
  2193. 350.99 s [Cabal] equating
  2194. 350.99 s [Cabal] unintersperse
  2195. 351.16 s [Cabal] 66% ( 6 / 9) in 'Distribution.Utils.NubList'
  2196. 351.16 s [Cabal] Missing documentation for:
  2197. 351.16 s [Cabal] Module header
  2198. 351.16 s [Cabal] fromNubList (src/Distribution/Utils/NubList.hs:24)
  2199. 351.16 s [Cabal] fromNubListR (src/Distribution/Utils/NubList.hs:83)
  2200. 351.18 s [Cabal] Warning: 'die' is out of scope.
  2201. 351.18 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2202. 351.18 s [Cabal] 85% ( 6 / 7) in 'Distribution.Utils.LogProgress'
  2203. 351.18 s [Cabal] Missing documentation for:
  2204. 351.18 s [Cabal] Module header
  2205. 351.22 s [Cabal] 30% ( 4 / 13) in 'Distribution.Simple.Program.Run'
  2206. 351.22 s [Cabal] Missing documentation for:
  2207. 351.22 s [Cabal] IOEncoding (src/Distribution/Simple/Program/Run.hs:61)
  2208. 351.22 s [Cabal] emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:70)
  2209. 351.22 s [Cabal] simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:82)
  2210. 351.22 s [Cabal] programInvocation (src/Distribution/Simple/Program/Run.hs:89)
  2211. 351.22 s [Cabal] runProgramInvocation (src/Distribution/Simple/Program/Run.hs:100)
  2212. 351.22 s [Cabal] getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:157)
  2213. 351.22 s [Cabal] getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:165)
  2214. 351.22 s [Cabal] getProgramInvocationOutputAndErrors (src/Distribution/Simple/Program/Run.hs:173)
  2215. 351.22 s [Cabal] getProgramInvocationLBSAndErrors (src/Distribution/Simple/Program/Run.hs:185)
  2216. 351.40 s [wai-app-static] Preprocessing executable 'warp' for wai-app-static-3.1.9...
  2217. 351.40 s [wai-app-static] Building executable 'warp' for wai-app-static-3.1.9...
  2218. 351.42 s [Cabal] 100% ( 4 / 4) in 'Distribution.Simple.Program.Script'
  2219. 351.42 s [Cabal] 50% ( 1 / 2) in 'Distribution.Simple.Program.ResponseFile'
  2220. 351.42 s [Cabal] Missing documentation for:
  2221. 351.42 s [Cabal] withResponseFile (src/Distribution/Simple/Program/ResponseFile.hs:24)
  2222. 351.44 s [Cabal] 66% ( 2 / 3) in 'Distribution.Simple.Program.Hpc'
  2223. 351.44 s [Cabal] Missing documentation for:
  2224. 351.44 s [Cabal] union (src/Distribution/Simple/Program/Hpc.hs:105)
  2225. 351.45 s [Cabal] 63% ( 7 / 11) in 'Distribution.Simple.Program.Find'
  2226. 351.45 s [Cabal] Missing documentation for:
  2227. 351.45 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  2228. 351.45 s [Cabal] defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:65)
  2229. 351.45 s [Cabal] findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:77)
  2230. 351.45 s [Cabal] logExtraProgramSearchPath (src/Distribution/Simple/Program/Find.hs:68)
  2231. 351.47 s [wai-app-static] [1 of 1] Compiling Main ( app/warp-static.hs, dist/build/warp/warp-tmp/Main.o )
  2232. 351.52 s [Cabal] Warning: 'UnitIndex' is out of scope.
  2233. 351.52 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2234. 351.52 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  2235. 351.52 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2236. 351.52 s [Cabal] Warning: 'Cabal' is out of scope.
  2237. 351.52 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2238. 351.52 s [Cabal] Warning: 'PackageDB' is out of scope.
  2239. 351.52 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2240. 351.52 s [Cabal] 92% ( 38 / 41) in 'Distribution.Simple.PackageIndex'
  2241. 351.52 s [Cabal] Missing documentation for:
  2242. 351.52 s [Cabal] SearchResult (src/Distribution/Simple/PackageIndex.hs:559)
  2243. 351.52 s [Cabal] topologicalOrder (src/Distribution/Simple/PackageIndex.hs:666)
  2244. 351.52 s [Cabal] reverseTopologicalOrder (src/Distribution/Simple/PackageIndex.hs:674)
  2245. 351.63 s [Cabal] 50% ( 3 / 6) in 'Distribution.Simple.PackageDescription'
  2246. 351.63 s [Cabal] Missing documentation for:
  2247. 351.63 s [Cabal] readGenericPackageDescription (src/Distribution/Simple/PackageDescription.hs:44)
  2248. 351.63 s [Cabal] readHookedBuildInfo (src/Distribution/Simple/PackageDescription.hs:47)
  2249. 351.63 s [Cabal] parseString (src/Distribution/Simple/PackageDescription.hs:72)
  2250. 351.65 s [wai-app-static] [2 of 2] Linking dist/build/warp/warp
  2251. 351.67 s [Cabal] Warning: 'matchDirFileGlob' is out of scope.
  2252. 351.67 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2253. 351.67 s [Cabal] Warning: 'Version' is out of scope.
  2254. 351.67 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2255. 351.67 s [Cabal] 68% ( 15 / 22) in 'Distribution.Simple.Glob.Internal'
  2256. 351.67 s [Cabal] Missing documentation for:
  2257. 351.67 s [Cabal] parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:137)
  2258. 351.67 s [Cabal] enableMultidot (src/Distribution/Simple/Glob/Internal.hs:177)
  2259. 351.67 s [Cabal] dispGlobPieces (src/Distribution/Simple/Glob/Internal.hs:233)
  2260. 351.67 s [Cabal] isGlobEscapedChar (src/Distribution/Simple/Glob/Internal.hs:251)
  2261. 351.67 s [Cabal] GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
  2262. 351.67 s [Cabal] explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:271)
  2263. 351.67 s [Cabal] GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
  2264. 351.72 s [Cabal] Warning: 'die'' is out of scope.
  2265. 351.72 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2266. 351.72 s [Cabal] Warning: 'Version' is out of scope.
  2267. 351.72 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2268. 351.72 s [Cabal] Warning: 'die' is out of scope.
  2269. 351.72 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2270. 351.72 s [Cabal] 75% ( 12 / 16) in 'Distribution.Simple.Glob'
  2271. 351.72 s [Cabal] Missing documentation for:
  2272. 351.72 s [Cabal] GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
  2273. 351.72 s [Cabal] parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:137)
  2274. 351.72 s [Cabal] GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
  2275. 351.72 s [Cabal] explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:271)
  2276. 351.77 s [Cabal] Warning: 'm' is out of scope.
  2277. 351.77 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2278. 351.77 s [Cabal] Warning: 'local' is out of scope.
  2279. 351.77 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2280. 351.77 s [Cabal] Warning: 'ask' is out of scope.
  2281. 351.77 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2282. 351.83 s [Cabal] Warning: 'TaraAnn' is out of scope.
  2283. 351.83 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2284. 351.95 s [Cabal] Warning: 'LocalBuildInfo' is out of scope.
  2285. 351.95 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2286. 351.95 s [Cabal] 68% ( 33 / 48) in 'Distribution.Simple.Compiler'
  2287. 351.95 s [Cabal] Missing documentation for:
  2288. 351.95 s [Cabal] Compiler (src/Distribution/Simple/Compiler.hs:91)
  2289. 351.95 s [Cabal] showCompilerId (src/Distribution/Simple/Compiler.hs:112)
  2290. 351.95 s [Cabal] showCompilerIdWithAbi (src/Distribution/Simple/Compiler.hs:115)
  2291. 351.95 s [Cabal] compilerFlavor (src/Distribution/Simple/Compiler.hs:122)
  2292. 351.95 s [Cabal] compilerVersion (src/Distribution/Simple/Compiler.hs:125)
  2293. 351.95 s [Cabal] compilerInfo (src/Distribution/Simple/Compiler.hs:154)
  2294. 351.95 s [Cabal] absolutePackageDBPath (src/Distribution/Simple/Compiler.hs:212)
  2295. 351.95 s [Cabal] flagToOptimisationLevel (src/Distribution/Simple/Compiler.hs:236)
  2296. 351.95 s [Cabal] flagToDebugInfoLevel (src/Distribution/Simple/Compiler.hs:269)
  2297. 351.95 s [Cabal] CompilerFlag (src/Distribution/Simple/Compiler.hs:310)
  2298. 351.95 s [Cabal] languageToFlags (src/Distribution/Simple/Compiler.hs:294)
  2299. 351.95 s [Cabal] unsupportedLanguages (src/Distribution/Simple/Compiler.hs:289)
  2300. 351.95 s [Cabal] knownProfDetailLevels (src/Distribution/Simple/Compiler.hs:475)
  2301. 351.95 s [Cabal] flagToProfDetailLevel (src/Distribution/Simple/Compiler.hs:463)
  2302. 351.95 s [Cabal] showProfDetailLevel (src/Distribution/Simple/Compiler.hs:485)
  2303. 352.03 s [Cabal] 65% ( 17 / 26) in 'Distribution.Simple.Program.HcPkg'
  2304. 352.03 s [Cabal] Missing documentation for:
  2305. 352.03 s [Cabal] initInvocation (src/Distribution/Simple/Program/HcPkg.hs:386)
  2306. 352.03 s [Cabal] registerInvocation (src/Distribution/Simple/Program/HcPkg.hs:394)
  2307. 352.03 s [Cabal] unregisterInvocation (src/Distribution/Simple/Program/HcPkg.hs:423)
  2308. 352.03 s [Cabal] recacheInvocation (src/Distribution/Simple/Program/HcPkg.hs:434)
  2309. 352.03 s [Cabal] exposeInvocation (src/Distribution/Simple/Program/HcPkg.hs:444)
  2310. 352.03 s [Cabal] hideInvocation (src/Distribution/Simple/Program/HcPkg.hs:467)
  2311. 352.03 s [Cabal] dumpInvocation (src/Distribution/Simple/Program/HcPkg.hs:478)
  2312. 352.03 s [Cabal] describeInvocation (src/Distribution/Simple/Program/HcPkg.hs:455)
  2313. 352.03 s [Cabal] listInvocation (src/Distribution/Simple/Program/HcPkg.hs:491)
  2314. 352.17 s [Cabal] 18% ( 2 / 11) in 'Distribution.Simple.Program.GHC'
  2315. 352.17 s [Cabal] Missing documentation for:
  2316. 352.17 s [Cabal] Module header
  2317. 352.17 s [Cabal] GhcMode (src/Distribution/Simple/Program/GHC.hs:585)
  2318. 352.17 s [Cabal] GhcOptimisation (src/Distribution/Simple/Program/GHC.hs:600)
  2319. 352.17 s [Cabal] GhcDynLinkMode (src/Distribution/Simple/Program/GHC.hs:611)
  2320. 352.17 s [Cabal] GhcProfAuto (src/Distribution/Simple/Program/GHC.hs:620)
  2321. 352.17 s [Cabal] ghcInvocation (src/Distribution/Simple/Program/GHC.hs:641)
  2322. 352.17 s [Cabal] renderGhcOptions (src/Distribution/Simple/Program/GHC.hs:658)
  2323. 352.17 s [Cabal] runGHC (src/Distribution/Simple/Program/GHC.hs:631)
  2324. 352.17 s [Cabal] normaliseGhcArgs (src/Distribution/Simple/Program/GHC.hs:48)
  2325. 352.30 s [Cabal] 12% ( 4 / 31) in 'Distribution.Simple.Program.Builtin'
  2326. 352.30 s [Cabal] Missing documentation for:
  2327. 352.30 s [Cabal] ghcProgram (src/Distribution/Simple/Program/Builtin.hs:103)
  2328. 352.30 s [Cabal] ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:144)
  2329. 352.30 s [Cabal] runghcProgram (src/Distribution/Simple/Program/Builtin.hs:134)
  2330. 352.30 s [Cabal] ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:155)
  2331. 352.30 s [Cabal] ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:162)
  2332. 352.30 s [Cabal] hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:173)
  2333. 352.30 s [Cabal] jhcProgram (src/Distribution/Simple/Program/Builtin.hs:184)
  2334. 352.30 s [Cabal] haskellSuiteProgram (src/Distribution/Simple/Program/Builtin.hs:227)
  2335. 352.31 s [Cabal] haskellSuitePkgProgram (src/Distribution/Simple/Program/Builtin.hs:238)
  2336. 352.31 s [Cabal] uhcProgram (src/Distribution/Simple/Program/Builtin.hs:196)
  2337. 352.31 s [Cabal] gccProgram (src/Distribution/Simple/Program/Builtin.hs:267)
  2338. 352.31 s [Cabal] arProgram (src/Distribution/Simple/Program/Builtin.hs:273)
  2339. 352.31 s [Cabal] stripProgram (src/Distribution/Simple/Program/Builtin.hs:276)
  2340. 352.31 s [Cabal] happyProgram (src/Distribution/Simple/Program/Builtin.hs:245)
  2341. 352.31 s [Cabal] alexProgram (src/Distribution/Simple/Program/Builtin.hs:256)
  2342. 352.31 s [Cabal] hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:283)
  2343. 352.31 s [Cabal] c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:294)
  2344. 352.31 s [Cabal] cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:300)
  2345. 352.31 s [Cabal] hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:310)
  2346. 352.31 s [Cabal] doctestProgram (src/Distribution/Simple/Program/Builtin.hs:323)
  2347. 352.31 s [Cabal] haddockProgram (src/Distribution/Simple/Program/Builtin.hs:334)
  2348. 352.31 s [Cabal] greencardProgram (src/Distribution/Simple/Program/Builtin.hs:346)
  2349. 352.31 s [Cabal] ldProgram (src/Distribution/Simple/Program/Builtin.hs:349)
  2350. 352.31 s [Cabal] tarProgram (src/Distribution/Simple/Program/Builtin.hs:390)
  2351. 352.31 s [Cabal] cppProgram (src/Distribution/Simple/Program/Builtin.hs:408)
  2352. 352.31 s [Cabal] pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:411)
  2353. 352.31 s [Cabal] hpcProgram (src/Distribution/Simple/Program/Builtin.hs:202)
  2354. 352.54 s [Cabal] Warning: 'Programs' is out of scope.
  2355. 352.54 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2356. 352.54 s [Cabal] Warning: 'AnyVersion' is out of scope.
  2357. 352.54 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2358. 352.54 s [Cabal] 82% ( 28 / 34) in 'Distribution.Simple.Program.Db'
  2359. 352.54 s [Cabal] Missing documentation for:
  2360. 352.54 s [Cabal] emptyProgramDb (src/Distribution/Simple/Program/Db.hs:106)
  2361. 352.54 s [Cabal] defaultProgramDb (src/Distribution/Simple/Program/Db.hs:109)
  2362. 352.54 s [Cabal] addKnownPrograms (src/Distribution/Simple/Program/Db.hs:189)
  2363. 352.54 s [Cabal] lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:192)
  2364. 352.54 s [Cabal] knownPrograms (src/Distribution/Simple/Program/Db.hs:196)
  2365. 352.54 s [Cabal] userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:254)
  2366. 352.57 s [Cabal] 50% ( 40 / 80) in 'Distribution.Simple.Program'
  2367. 352.57 s [Cabal] Missing documentation for:
  2368. 352.57 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  2369. 352.57 s [Cabal] findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:77)
  2370. 352.57 s [Cabal] defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:65)
  2371. 352.57 s [Cabal] ProgArg (src/Distribution/Simple/Program/Types.hs:83)
  2372. 352.57 s [Cabal] emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:70)
  2373. 352.57 s [Cabal] simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:82)
  2374. 352.57 s [Cabal] programInvocation (src/Distribution/Simple/Program/Run.hs:89)
  2375. 352.58 s [Cabal] runProgramInvocation (src/Distribution/Simple/Program/Run.hs:100)
  2376. 352.58 s [Cabal] getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:157)
  2377. 352.58 s [Cabal] getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:165)
  2378. 352.58 s [Cabal] defaultProgramDb (src/Distribution/Simple/Program/Db.hs:109)
  2379. 352.58 s [Cabal] emptyProgramDb (src/Distribution/Simple/Program/Db.hs:106)
  2380. 352.58 s [Cabal] addKnownPrograms (src/Distribution/Simple/Program/Db.hs:189)
  2381. 352.58 s [Cabal] lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:192)
  2382. 352.58 s [Cabal] knownPrograms (src/Distribution/Simple/Program/Db.hs:196)
  2383. 352.58 s [Cabal] userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:254)
  2384. 352.58 s [Cabal] ghcProgram (src/Distribution/Simple/Program/Builtin.hs:103)
  2385. 352.58 s [Cabal] ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:144)
  2386. 352.58 s [Cabal] ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:155)
  2387. 352.58 s [Cabal] ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:162)
  2388. 352.58 s [Cabal] hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:173)
  2389. 352.58 s [Cabal] jhcProgram (src/Distribution/Simple/Program/Builtin.hs:184)
  2390. 352.58 s [Cabal] uhcProgram (src/Distribution/Simple/Program/Builtin.hs:196)
  2391. 352.58 s [Cabal] gccProgram (src/Distribution/Simple/Program/Builtin.hs:267)
  2392. 352.58 s [Cabal] arProgram (src/Distribution/Simple/Program/Builtin.hs:273)
  2393. 352.58 s [Cabal] stripProgram (src/Distribution/Simple/Program/Builtin.hs:276)
  2394. 352.58 s [Cabal] happyProgram (src/Distribution/Simple/Program/Builtin.hs:245)
  2395. 352.58 s [Cabal] alexProgram (src/Distribution/Simple/Program/Builtin.hs:256)
  2396. 352.58 s [Cabal] hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:283)
  2397. 352.58 s [Cabal] c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:294)
  2398. 352.58 s [Cabal] cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:300)
  2399. 352.58 s [Cabal] hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:310)
  2400. 352.58 s [Cabal] doctestProgram (src/Distribution/Simple/Program/Builtin.hs:323)
  2401. 352.58 s [Cabal] haddockProgram (src/Distribution/Simple/Program/Builtin.hs:334)
  2402. 352.58 s [Cabal] greencardProgram (src/Distribution/Simple/Program/Builtin.hs:346)
  2403. 352.58 s [Cabal] ldProgram (src/Distribution/Simple/Program/Builtin.hs:349)
  2404. 352.58 s [Cabal] tarProgram (src/Distribution/Simple/Program/Builtin.hs:390)
  2405. 352.58 s [Cabal] cppProgram (src/Distribution/Simple/Program/Builtin.hs:408)
  2406. 352.58 s [Cabal] pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:411)
  2407. 352.58 s [Cabal] hpcProgram (src/Distribution/Simple/Program/Builtin.hs:202)
  2408. 352.58 s [Cabal] 33% ( 1 / 3) in 'Distribution.Simple.Program.Strip'
  2409. 352.58 s [Cabal] Missing documentation for:
  2410. 352.58 s [Cabal] stripLib (src/Distribution/Simple/Program/Strip.hs:51)
  2411. 352.58 s [Cabal] stripExe (src/Distribution/Simple/Program/Strip.hs:40)
  2412. 352.62 s [Cabal] Warning: 'GetOpt' is out of scope.
  2413. 352.62 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2414. 352.62 s [Cabal] Warning: 'smart' is out of scope.
  2415. 352.62 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2416. 352.63 s [Cabal] 61% ( 33 / 54) in 'Distribution.Simple.Command'
  2417. 352.63 s [Cabal] Missing documentation for:
  2418. 352.63 s [Cabal] CommandUI (src/Distribution/Simple/Command.hs:97)
  2419. 352.63 s [Cabal] CommandParse (src/Distribution/Simple/Command.hs:596)
  2420. 352.63 s [Cabal] helpCommandUI (src/Distribution/Simple/Command.hs:763)
  2421. 352.63 s [Cabal] ShowOrParseArgs (src/Distribution/Simple/Command.hs:116)
  2422. 352.63 s [Cabal] Command (src/Distribution/Simple/Command.hs:608)
  2423. 352.63 s [Cabal] commandAddAction (src/Distribution/Simple/Command.hs:617)
  2424. 352.63 s [Cabal] CommandType (src/Distribution/Simple/Command.hs:607)
  2425. 352.63 s [Cabal] commandFromSpec (src/Distribution/Simple/Command.hs:787)
  2426. 352.63 s [Cabal] commandsRun (src/Distribution/Simple/Command.hs:654)
  2427. 352.63 s [Cabal] commandsRunWithFallback (src/Distribution/Simple/Command.hs:669)
  2428. 352.63 s [Cabal] defaultCommandFallback (src/Distribution/Simple/Command.hs:662)
  2429. 352.63 s [Cabal] Name (src/Distribution/Simple/Command.hs:117)
  2430. 352.63 s [Cabal] liftOption (src/Distribution/Simple/Command.hs:373)
  2431. 352.63 s [Cabal] Description (src/Distribution/Simple/Command.hs:118)
  2432. 352.63 s [Cabal] OptFlags (src/Distribution/Simple/Command.hs:160)
  2433. 352.63 s [Cabal] ArgPlaceHolder (src/Distribution/Simple/Command.hs:161)
  2434. 352.63 s [Cabal] MkOptDescr (src/Distribution/Simple/Command.hs:200)
  2435. 352.63 s [Cabal] optArgDef' (src/Distribution/Simple/Command.hs:269)
  2436. 352.63 s [Cabal] noArg (src/Distribution/Simple/Command.hs:278)
  2437. 352.63 s [Cabal] boolOpt (src/Distribution/Simple/Command.hs:281)
  2438. 352.63 s [Cabal] boolOpt' (src/Distribution/Simple/Command.hs:293)
  2439. 352.71 s [Cabal] Warning: 'progDb' is out of scope.
  2440. 352.71 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2441. 353.01 s [Cabal] Warning: 'haddocksInterfaces' is out of scope.
  2442. 353.01 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2443. 353.01 s [Cabal] Warning: 'haddocksAction' is out of scope.
  2444. 353.01 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2445. 353.05 s [wai-app-static] Phase: checkPhase
  2446. 353.41 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  2447. 353.41 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2448. 353.41 s [Cabal] 77% ( 7 / 9) in 'Distribution.Types.LocalBuildConfig'
  2449. 353.41 s [Cabal] Missing documentation for:
  2450. 353.41 s [Cabal] Module header
  2451. 353.41 s [Cabal] buildOptionsConfigFlags (src/Distribution/Types/LocalBuildConfig.hs:201)
  2452. 353.42 s [wai-app-static] Running 1 test suites...
  2453. 353.42 s [wai-app-static] Test suite runtests: RUNNING...
  2454. 353.42 s [wai-app-static]
  2455. 353.42 s [wai-app-static] mime types
  2456. 353.42 s [wai-app-static] fileNameExtensions [✔]
  2457. 353.42 s [wai-app-static] handles multi-extensions [✔]
  2458. 353.42 s [wai-app-static] defaults correctly [✔]
  2459. 353.42 s [wai-app-static] webApp
  2460. 353.42 s [wai-app-static] 403 for unsafe paths [✔]
  2461. 353.42 s [wai-app-static] 200 for hidden paths [✔]
  2462. 353.42 s [wai-app-static] 404 for non-existent files [✔]
  2463. 353.42 s [wai-app-static] 302 redirect when multiple slashes [✔]
  2464. 353.42 s [wai-app-static] 302 redirect when multiple slashes [✔]
  2465. 353.42 s [wai-app-static] webApp when requesting a static asset
  2466. 353.42 s [wai-app-static] 200 and etag when no etag query parameters [✔]
  2467. 353.42 s [wai-app-static] Cache-Control set when etag parameter is correct [✔]
  2468. 353.42 s [wai-app-static] 200 when invalid in-none-match sent [✔]
  2469. 353.42 s [wai-app-static] 304 when valid if-none-match sent [✔]
  2470. 353.42 s [wai-app-static] fileServerApp
  2471. 353.42 s [wai-app-static] directory listing for index [✔]
  2472. 353.42 s [wai-app-static] 200 when invalid if-modified-since header [✔]
  2473. 353.42 s [wai-app-static] 304 when if-modified-since matches [✔]
  2474. 353.42 s [wai-app-static] 302 redirect to add a trailing slash on directories if missing
  2475. 353.43 s [wai-app-static] works at the root [✔]
  2476. 353.43 s [wai-app-static] works when an index.html is delivered [✔]
  2477. 353.43 s [wai-app-static] works with subpath at the root of the file server [✔]
  2478. 353.43 s [wai-app-static] with defaultWebAppSettings
  2479. 353.43 s [wai-app-static] ssIndices works [✔]
  2480. 353.43 s [wai-app-static] with defaultFileServerSettings
  2481. 353.43 s [wai-app-static] prefers ssIndices over ssListing [✔]
  2482. 353.43 s [wai-app-static] embedded, compressed entry
  2483. 353.43 s [wai-app-static] served correctly [✔]
  2484. 353.43 s [wai-app-static] 304 when valid if-none-match sent [✔]
  2485. 353.43 s [wai-app-static] ssIndices works [✔]
  2486. 353.43 s [wai-app-static] ssIndices works with trailing slashes [✔]
  2487. 353.43 s [wai-app-static] embedded, uncompressed entry
  2488. 353.43 s [wai-app-static] too short [✔]
  2489. 353.43 s [wai-app-static] wrong mime [✔]
  2490. 353.43 s [wai-app-static] reloadable entry
  2491. 353.43 s [wai-app-static] served correctly [✔]
  2492. 353.43 s [wai-app-static] entries without etags
  2493. 353.43 s [wai-app-static] embedded entry [✔]
  2494. 353.43 s [wai-app-static] reload entry [✔]
  2495. 353.43 s [wai-app-static]
  2496. 353.43 s [wai-app-static] Finished in 0.0044 seconds
  2497. 353.43 s [wai-app-static] 29 examples, 0 failures
  2498. 353.43 s [wai-app-static] Test suite runtests: PASS
  2499. 353.43 s [wai-app-static] Test suite logged to: dist/test/wai-app-static-3.1.9-runtests.log
  2500. 353.43 s [wai-app-static] 1 of 1 test suites (1 of 1 test cases) passed.
  2501. 353.44 s [wai-app-static] Phase: haddockPhase
  2502. 353.58 s [wai-app-static] Preprocessing library for wai-app-static-3.1.9...
  2503. 353.58 s [wai-app-static] Running Haddock on library for wai-app-static-3.1.9...
  2504. 353.59 s [wai-app-static] Warning: The documentation for the following packages are not installed. No
  2505. 353.59 s [wai-app-static] links will be generated to these packages: attoparsec-0.14.4,
  2506. 353.59 s [wai-app-static] attoparsec-0.14.4, vector-0.13.2.0
  2507. 353.67 s [Cabal] Warning: 'Component' is out of scope.
  2508. 353.67 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2509. 353.67 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  2510. 353.67 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  2511. 353.67 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2512. 353.67 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2513. 353.67 s [Cabal] by specifying the type/value namespace explicitly.
  2514. 353.67 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2515. 353.67 s [Cabal] Warning: 'LocalBuildDescr' is out of scope.
  2516. 353.67 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2517. 353.67 s [Cabal] Warning: 'LocalBuildConfig' is out of scope.
  2518. 353.67 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2519. 353.67 s [Cabal] 53% ( 16 / 30) in 'Distribution.Types.LocalBuildInfo'
  2520. 353.67 s [Cabal] Missing documentation for:
  2521. 353.67 s [Cabal] Module header
  2522. 353.67 s [Cabal] buildDir (src/Distribution/Types/LocalBuildInfo.hs:276)
  2523. 353.67 s [Cabal] buildDirPBD (src/Distribution/Types/LocalBuildInfo.hs:280)
  2524. 353.67 s [Cabal] configFlagsBuildDir (src/Distribution/Types/LocalBuildInfo.hs:284)
  2525. 353.67 s [Cabal] cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:287)
  2526. 353.67 s [Cabal] progPrefix (src/Distribution/Types/LocalBuildInfo.hs:291)
  2527. 353.67 s [Cabal] progSuffix (src/Distribution/Types/LocalBuildInfo.hs:291)
  2528. 353.67 s [Cabal] unitIdTarget' (src/Distribution/Types/LocalBuildInfo.hs:359)
  2529. 353.67 s [Cabal] componentNameTargets (src/Distribution/Types/LocalBuildInfo.hs:419)
  2530. 353.67 s [Cabal] unitIdTarget (src/Distribution/Types/LocalBuildInfo.hs:422)
  2531. 353.67 s [Cabal] allTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:425)
  2532. 353.67 s [Cabal] withAllTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:428)
  2533. 353.67 s [Cabal] neededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:431)
  2534. 353.67 s [Cabal] withNeededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:434)
  2535. 353.70 s [Cabal] Warning: 'compBuildOrder' is out of scope.
  2536. 353.70 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2537. 353.70 s [Cabal] 49% ( 31 / 63) in 'Distribution.Simple.LocalBuildInfo'
  2538. 353.70 s [Cabal] Missing documentation for:
  2539. 353.70 s [Cabal] buildDir (src/Distribution/Types/LocalBuildInfo.hs:276)
  2540. 353.70 s [Cabal] cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:287)
  2541. 353.70 s [Cabal] progPrefix (src/Distribution/Types/LocalBuildInfo.hs:291)
  2542. 353.70 s [Cabal] progSuffix (src/Distribution/Types/LocalBuildInfo.hs:291)
  2543. 353.70 s [Cabal] Component
  2544. 353.70 s [Cabal] ComponentName
  2545. 353.70 s [Cabal] LibraryName
  2546. 353.70 s [Cabal] defaultLibName
  2547. 353.70 s [Cabal] showComponentName
  2548. 353.70 s [Cabal] componentBuildDir (src/Distribution/Simple/LocalBuildInfo.hs:111)
  2549. 353.70 s [Cabal] foldComponent
  2550. 353.70 s [Cabal] componentName
  2551. 353.70 s [Cabal] componentBuildInfo
  2552. 353.70 s [Cabal] lookupComponent
  2553. 353.70 s [Cabal] getComponent
  2554. 353.70 s [Cabal] allComponentsInBuildOrder (src/Distribution/Simple/LocalBuildInfo.hs:208)
  2555. 353.70 s [Cabal] withTestLBI (src/Distribution/Simple/LocalBuildInfo.hs:168)
  2556. 353.70 s [Cabal] enabledTestLBIs (src/Distribution/Simple/LocalBuildInfo.hs:176)
  2557. 353.70 s [Cabal] enabledBenchLBIs (src/Distribution/Simple/LocalBuildInfo.hs:186)
  2558. 353.70 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  2559. 353.70 s [Cabal] PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
  2560. 353.70 s [Cabal] defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:178)
  2561. 353.70 s [Cabal] defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:181)
  2562. 353.70 s [Cabal] combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:116)
  2563. 353.70 s [Cabal] combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:409)
  2564. 353.70 s [Cabal] platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:451)
  2565. 353.70 s [Cabal] compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:446)
  2566. 353.70 s [Cabal] packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:436)
  2567. 353.70 s [Cabal] abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:457)
  2568. 353.70 s [Cabal] installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:476)
  2569. 353.70 s [Cabal] absoluteInstallCommandDirs (src/Distribution/Simple/LocalBuildInfo.hs:372)
  2570. 353.70 s [Cabal] substPathTemplate (src/Distribution/Simple/LocalBuildInfo.hs:430)
  2571. 353.73 s [Cabal] 71% ( 10 / 14) in 'Distribution.Simple.Test.Log'
  2572. 353.73 s [Cabal] Missing documentation for:
  2573. 353.73 s [Cabal] Module header
  2574. 353.73 s [Cabal] TestLogs (src/Distribution/Simple/Test/Log.hs:66)
  2575. 353.73 s [Cabal] summarizeSuiteStart (src/Distribution/Simple/Test/Log.hs:192)
  2576. 353.73 s [Cabal] testSuiteLogPath (src/Distribution/Simple/Test/Log.hs:118)
  2577. 353.76 s [Cabal] 55% ( 5 / 9) in 'Distribution.Simple.Hpc'
  2578. 353.76 s [Cabal] Missing documentation for:
  2579. 353.76 s [Cabal] Way (src/Distribution/Simple/Hpc.hs:55)
  2580. 353.76 s [Cabal] htmlDir (src/Distribution/Simple/Hpc.hs:98)
  2581. 353.76 s [Cabal] mixDir (src/Distribution/Simple/Hpc.hs:71)
  2582. 353.76 s [Cabal] tixDir (src/Distribution/Simple/Hpc.hs:79)
  2583. 353.77 s [Cabal] 50% ( 1 / 2) in 'Distribution.Simple.Build.PackageInfoModule'
  2584. 353.77 s [Cabal] Missing documentation for:
  2585. 353.77 s [Cabal] generatePackageInfoModule (src/Distribution/Simple/Build/PackageInfoModule.hs:36)
  2586. 353.78 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.Build.Macros'
  2587. 353.79 s [Cabal] Warning: 'computeCompatPackageName' is out of scope.
  2588. 353.79 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2589. 353.80 s [Cabal] 54% ( 6 / 11) in 'Distribution.Backpack.ConfiguredComponent'
  2590. 353.80 s [Cabal] Missing documentation for:
  2591. 353.80 s [Cabal] toConfiguredComponent (src/Distribution/Backpack/ConfiguredComponent.hs:172)
  2592. 353.80 s [Cabal] toConfiguredComponents (src/Distribution/Backpack/ConfiguredComponent.hs:307)
  2593. 353.80 s [Cabal] ConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:169)
  2594. 353.80 s [Cabal] extendConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:288)
  2595. 353.80 s [Cabal] newPackageDepsBehaviour (src/Distribution/Backpack/ConfiguredComponent.hs:349)
  2596. 353.84 s [Cabal] Warning: 'ReadyComponent' is out of scope.
  2597. 353.84 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2598. 353.84 s [Cabal] Warning: 'ModSubst' is out of scope.
  2599. 353.84 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2600. 353.84 s [Cabal] 54% ( 6 / 11) in 'Distribution.Backpack.LinkedComponent'
  2601. 353.84 s [Cabal] Missing documentation for:
  2602. 353.84 s [Cabal] toLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:114)
  2603. 353.84 s [Cabal] toLinkedComponents (src/Distribution/Backpack/LinkedComponent.hs:407)
  2604. 353.84 s [Cabal] dispLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:98)
  2605. 353.84 s [Cabal] LinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:430)
  2606. 353.84 s [Cabal] extendLinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:432)
  2607. 353.84 s [hspec-wai] Documentation created: dist/doc/html/hspec-wai/,
  2608. 353.84 s [hspec-wai] dist/doc/html/hspec-wai/hspec-wai.txt
  2609. 353.88 s [Cabal] 100% ( 7 / 7) in 'Distribution.Backpack.ComponentsGraph'
  2610. 353.88 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Program.Ld'
  2611. 353.90 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.Program.Ar'
  2612. 353.91 s [hspec-wai] Phase: installPhase
  2613. 353.98 s [wai-app-static] [1 of 9] Compiling WaiAppStatic.Types ( WaiAppStatic/Types.hs, /build/ghc1801_0/ghc_26.o, /build/ghc1801_0/ghc_26.dyn_o )
  2614. 354.01 s [hspec-wai] Installing library in /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/hspec-wai-0.11.1-ACFczlBhalK665w7VrwZ0J
  2615. 354.01 s [Cabal] Warning: 'CommandUI' is out of scope.
  2616. 354.01 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2617. 354.01 s [Cabal] Warning: 'Monoid' is out of scope.
  2618. 354.01 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2619. 354.01 s [Cabal] 25% ( 26 /102) in 'Distribution.Simple.Setup'
  2620. 354.01 s [Cabal] Missing documentation for:
  2621. 354.01 s [Cabal] emptyGlobalFlags (src/Distribution/Simple/Setup/Global.hs:114)
  2622. 354.01 s [Cabal] defaultGlobalFlags (src/Distribution/Simple/Setup/Global.hs:53)
  2623. 354.01 s [Cabal] globalCommand (src/Distribution/Simple/Setup/Global.hs:60)
  2624. 354.01 s [Cabal] emptyConfigFlags (src/Distribution/Simple/Setup/Config.hs:1023)
  2625. 354.01 s [Cabal] defaultConfigFlags (src/Distribution/Simple/Setup/Config.hs:309)
  2626. 354.01 s [Cabal] configureCommand (src/Distribution/Simple/Setup/Config.hs:355)
  2627. 354.01 s [Cabal] configAbsolutePaths (src/Distribution/Simple/Setup/Config.hs:301)
  2628. 354.01 s [Cabal] readPackageDbList (src/Distribution/Simple/Setup/Config.hs:868)
  2629. 354.01 s [Cabal] showPackageDbList (src/Distribution/Simple/Setup/Config.hs:880)
  2630. 354.01 s [Cabal] emptyCopyFlags (src/Distribution/Simple/Setup/Copy.hs:145)
  2631. 354.01 s [Cabal] defaultCopyFlags (src/Distribution/Simple/Setup/Copy.hs:61)
  2632. 354.01 s [Cabal] copyCommand (src/Distribution/Simple/Setup/Copy.hs:71)
  2633. 354.01 s [Cabal] emptyInstallFlags (src/Distribution/Simple/Setup/Install.hs:150)
  2634. 354.01 s [Cabal] defaultInstallFlags (src/Distribution/Simple/Setup/Install.hs:60)
  2635. 354.01 s [Cabal] installCommand (src/Distribution/Simple/Setup/Install.hs:72)
  2636. 354.01 s [Cabal] HaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:83)
  2637. 354.01 s [Cabal] emptyHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:356)
  2638. 354.01 s [Cabal] defaultHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:115)
  2639. 354.01 s [Cabal] haddockCommand (src/Distribution/Simple/Setup/Haddock.hs:145)
  2640. 354.01 s [Cabal] HaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:379)
  2641. 354.01 s [Cabal] emptyHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:598)
  2642. 354.01 s [Cabal] defaultHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:421)
  2643. 354.01 s [Cabal] haddockProjectCommand (src/Distribution/Simple/Setup/Haddock.hs:445)
  2644. 354.01 s [Cabal] HscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:42)
  2645. 354.01 s [Cabal] emptyHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:57)
  2646. 354.01 s [Cabal] defaultHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:60)
  2647. 354.01 s [Cabal] hscolourCommand (src/Distribution/Simple/Setup/Hscolour.hs:80)
  2648. 354.01 s [Cabal] BuildFlags (src/Distribution/Simple/Setup/Build.hs:47)
  2649. 354.01 s [Cabal] emptyBuildFlags (src/Distribution/Simple/Setup/Build.hs:157)
  2650. 354.01 s [Cabal] defaultBuildFlags (src/Distribution/Simple/Setup/Build.hs:64)
  2651. 354.01 s [Cabal] buildCommand (src/Distribution/Simple/Setup/Build.hs:77)
  2652. 354.01 s [Cabal] DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
  2653. 354.01 s [Cabal] ReplFlags (src/Distribution/Simple/Setup/Repl.hs:63)
  2654. 354.01 s [Cabal] defaultReplFlags (src/Distribution/Simple/Setup/Repl.hs:76)
  2655. 354.01 s [Cabal] replCommand (src/Distribution/Simple/Setup/Repl.hs:94)
  2656. 354.01 s [Cabal] ReplOptions (src/Distribution/Simple/Setup/Repl.hs:46)
  2657. 354.01 s [Cabal] CleanFlags (src/Distribution/Simple/Setup/Clean.hs:42)
  2658. 354.01 s [Cabal] emptyCleanFlags (src/Distribution/Simple/Setup/Clean.hs:89)
  2659. 354.01 s [Cabal] defaultCleanFlags (src/Distribution/Simple/Setup/Clean.hs:53)
  2660. 354.01 s [Cabal] cleanCommand (src/Distribution/Simple/Setup/Clean.hs:62)
  2661. 354.01 s [Cabal] emptyRegisterFlags (src/Distribution/Simple/Setup/Register.hs:187)
  2662. 354.02 s [Cabal] defaultRegisterFlags (src/Distribution/Simple/Setup/Register.hs:60)
  2663. 354.02 s [Cabal] registerCommand (src/Distribution/Simple/Setup/Register.hs:74)
  2664. 354.02 s [Cabal] unregisterCommand (src/Distribution/Simple/Setup/Register.hs:141)
  2665. 354.02 s [Cabal] emptySDistFlags (src/Distribution/Simple/Setup/SDist.hs:105)
  2666. 354.02 s [Cabal] defaultSDistFlags (src/Distribution/Simple/Setup/SDist.hs:52)
  2667. 354.02 s [Cabal] sdistCommand (src/Distribution/Simple/Setup/SDist.hs:62)
  2668. 354.02 s [Cabal] TestFlags (src/Distribution/Simple/Setup/Test.hs:82)
  2669. 354.02 s [Cabal] emptyTestFlags (src/Distribution/Simple/Setup/Test.hs:246)
  2670. 354.02 s [Cabal] defaultTestFlags (src/Distribution/Simple/Setup/Test.hs:99)
  2671. 354.02 s [Cabal] testCommand (src/Distribution/Simple/Setup/Test.hs:113)
  2672. 354.02 s [Cabal] TestShowDetails (src/Distribution/Simple/Setup/Test.hs:51)
  2673. 354.02 s [Cabal] BenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:45)
  2674. 354.02 s [Cabal] emptyBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:123)
  2675. 354.02 s [Cabal] defaultBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:55)
  2676. 354.02 s [Cabal] benchmarkCommand (src/Distribution/Simple/Setup/Benchmark.hs:63)
  2677. 354.02 s [Cabal] configureOptions (src/Distribution/Simple/Setup/Config.hs:402)
  2678. 354.02 s [Cabal] configureCCompiler (src/Distribution/Simple/Setup/Common.hs:323)
  2679. 354.02 s [Cabal] configureLinker (src/Distribution/Simple/Setup/Common.hs:329)
  2680. 354.02 s [Cabal] buildOptions (src/Distribution/Simple/Setup/Build.hs:125)
  2681. 354.02 s [Cabal] haddockOptions (src/Distribution/Simple/Setup/Haddock.hs:183)
  2682. 354.02 s [Cabal] haddockProjectOptions (src/Distribution/Simple/Setup/Haddock.hs:483)
  2683. 354.02 s [Cabal] installDirsOptions (src/Distribution/Simple/Setup/Config.hs:919)
  2684. 354.02 s [Cabal] testOptions' (src/Distribution/Simple/Setup/Test.hs:133)
  2685. 354.02 s [Cabal] benchmarkOptions' (src/Distribution/Simple/Setup/Benchmark.hs:83)
  2686. 354.02 s [Cabal] programFlagsDescription (src/Distribution/Simple/Setup/Common.hs:104)
  2687. 354.02 s [Cabal] replOptions (src/Distribution/Simple/Setup/Repl.hs:182)
  2688. 354.02 s [Cabal] defaultDistPref (src/Distribution/Simple/Setup/Common.hs:64)
  2689. 354.02 s [Cabal] optionDistPref (src/Distribution/Simple/Setup/Common.hs:250)
  2690. 354.02 s [Cabal] boolOpt (src/Distribution/Simple/Setup/Common.hs:224)
  2691. 354.02 s [Cabal] boolOpt' (src/Distribution/Simple/Setup/Common.hs:230)
  2692. 354.02 s [Cabal] trueArg (src/Distribution/Simple/Setup/Common.hs:236)
  2693. 354.02 s [Cabal] falseArg (src/Distribution/Simple/Setup/Common.hs:236)
  2694. 354.02 s [Cabal] optionVerbosity (src/Distribution/Simple/Setup/Common.hs:271)
  2695. 354.02 s [Cabal] buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:179)
  2696. 354.02 s [Cabal] buildingWhatDistPref (src/Distribution/Simple/Setup.hs:186)
  2697. 354.02 s [Cabal] Warning: 'Library' is out of scope.
  2698. 354.02 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2699. 354.02 s [Cabal] 81% ( 13 / 16) in 'Distribution.Simple.Build.Inputs'
  2700. 354.02 s [Cabal] Missing documentation for:
  2701. 354.02 s [Cabal] Module header
  2702. 354.02 s [Cabal] buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:179)
  2703. 354.02 s [Cabal] buildingWhatDistPref (src/Distribution/Simple/Setup.hs:186)
  2704. 354.09 s [Cabal] Warning: 'matchExactly' is out of scope.
  2705. 354.09 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2706. 354.09 s [Cabal] Warning: 'ambiguousWith' is out of scope.
  2707. 354.09 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2708. 354.09 s [Cabal] Warning: 'shadows' is out of scope.
  2709. 354.09 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2710. 354.09 s [Cabal] 57% ( 11 / 19) in 'Distribution.Simple.BuildTarget'
  2711. 354.09 s [Cabal] Missing documentation for:
  2712. 354.09 s [Cabal] QualLevel (src/Distribution/Simple/BuildTarget.hs:371)
  2713. 354.09 s [Cabal] buildTargetComponentName (src/Distribution/Simple/BuildTarget.hs:135)
  2714. 354.09 s [Cabal] readUserBuildTargets (src/Distribution/Simple/BuildTarget.hs:178)
  2715. 354.09 s [Cabal] showUserBuildTarget (src/Distribution/Simple/BuildTarget.hs:254)
  2716. 354.09 s [Cabal] UserBuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:242)
  2717. 354.09 s [Cabal] reportUserBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:246)
  2718. 354.09 s [Cabal] BuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:334)
  2719. 354.09 s [Cabal] reportBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:396)
  2720. 354.20 s [wai-app-static] [2 of 9] Compiling Util ( Util.hs, /build/ghc1801_0/ghc_14.o, /build/ghc1801_0/ghc_14.dyn_o )
  2721. 354.20 s [Cabal] Warning: 'lib' is out of scope.
  2722. 354.20 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2723. 354.20 s [Cabal] Warning: 'C' is out of scope.
  2724. 354.20 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2725. 354.20 s [Cabal] 58% ( 18 / 31) in 'Distribution.Simple.BuildPaths'
  2726. 354.20 s [Cabal] Missing documentation for:
  2727. 354.20 s [Cabal] defaultDistPref (src/Distribution/Simple/Setup/Common.hs:64)
  2728. 354.20 s [Cabal] srcPref (src/Distribution/Simple/BuildPaths.hs:73)
  2729. 354.20 s [Cabal] hscolourPref (src/Distribution/Simple/BuildPaths.hs:76)
  2730. 354.20 s [Cabal] cppHeaderName (src/Distribution/Simple/BuildPaths.hs:107)
  2731. 354.20 s [Cabal] haddockName (src/Distribution/Simple/BuildPaths.hs:128)
  2732. 354.20 s [Cabal] mkLibName (src/Distribution/Simple/BuildPaths.hs:219)
  2733. 354.20 s [Cabal] mkProfLibName (src/Distribution/Simple/BuildPaths.hs:222)
  2734. 354.21 s [Cabal] mkSharedLibName (src/Distribution/Simple/BuildPaths.hs:237)
  2735. 354.21 s [Cabal] mkStaticLibName (src/Distribution/Simple/BuildPaths.hs:243)
  2736. 354.21 s [Cabal] getSourceFiles (src/Distribution/Simple/BuildPaths.hs:186)
  2737. 354.21 s [Cabal] getLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:134)
  2738. 354.21 s [Cabal] getExeSourceFiles (src/Distribution/Simple/BuildPaths.hs:151)
  2739. 354.21 s [Cabal] getFLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:170)
  2740. 354.23 s [Cabal] 12% ( 1 / 8) in 'Distribution.Simple.UHC'
  2741. 354.23 s [Cabal] Missing documentation for:
  2742. 354.23 s [Cabal] configure (src/Distribution/Simple/UHC.hs:58)
  2743. 354.23 s [Cabal] getInstalledPackages (src/Distribution/Simple/UHC.hs:112)
  2744. 354.23 s [Cabal] buildLib (src/Distribution/Simple/UHC.hs:201)
  2745. 354.23 s [Cabal] buildExe (src/Distribution/Simple/UHC.hs:235)
  2746. 354.23 s [Cabal] installLib (src/Distribution/Simple/UHC.hs:314)
  2747. 354.23 s [Cabal] registerPackage (src/Distribution/Simple/UHC.hs:343)
  2748. 354.23 s [Cabal] inplacePackageDbPath (src/Distribution/Simple/UHC.hs:364)
  2749. 354.25 s [wai-app-static] [3 of 9] Compiling WaiAppStatic.Listing ( WaiAppStatic/Listing.hs, /build/ghc1801_0/ghc_16.o, /build/ghc1801_0/ghc_16.dyn_o )
  2750. 354.26 s [Cabal] 0% ( 0 / 13) in 'Distribution.Simple.HaskellSuite'
  2751. 354.26 s [Cabal] Missing documentation for:
  2752. 354.26 s [Cabal] Module header
  2753. 354.26 s [Cabal] configure (src/Distribution/Simple/HaskellSuite.hs:30)
  2754. 354.26 s [Cabal] hstoolVersion (src/Distribution/Simple/HaskellSuite.hs:92)
  2755. 354.26 s [Cabal] numericVersion (src/Distribution/Simple/HaskellSuite.hs:95)
  2756. 354.26 s [Cabal] getCompilerVersion (src/Distribution/Simple/HaskellSuite.hs:98)
  2757. 354.26 s [Cabal] getExtensions (src/Distribution/Simple/HaskellSuite.hs:112)
  2758. 354.26 s [Cabal] getLanguages (src/Distribution/Simple/HaskellSuite.hs:120)
  2759. 354.26 s [Cabal] getInstalledPackages (src/Distribution/Simple/HaskellSuite.hs:130)
  2760. 354.26 s [Cabal] buildLib (src/Distribution/Simple/HaskellSuite.hs:166)
  2761. 354.26 s [Cabal] installLib (src/Distribution/Simple/HaskellSuite.hs:211)
  2762. 354.26 s [Cabal] registerPackage (src/Distribution/Simple/HaskellSuite.hs:239)
  2763. 354.26 s [Cabal] initPackageDB (src/Distribution/Simple/HaskellSuite.hs:256)
  2764. 354.26 s [Cabal] packageDbOpt (src/Distribution/Simple/HaskellSuite.hs:264)
  2765. 354.26 s [hspec-wai] Phase: fixupPhase
  2766. 354.28 s [hspec-wai] shrinking RPATHs of ELF executables and libraries in /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1
  2767. 354.29 s [hspec-wai] shrinking /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHShspec-wai-0.11.1-ACFczlBhalK665w7VrwZ0J-ghc9.10.3.so
  2768. 354.31 s [Cabal] Warning: 'Arch' is ambiguous. It is defined
  2769. 354.31 s [Cabal] * in ‘Distribution.Types.ConfVar’
  2770. 354.31 s [Cabal] * in ‘Distribution.System’
  2771. 354.31 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2772. 354.31 s [Cabal] by specifying the type/value namespace explicitly.
  2773. 354.31 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.ConfVar’
  2774. 354.31 s [Cabal] Warning: 'OS' is ambiguous. It is defined
  2775. 354.31 s [Cabal] * in ‘Distribution.Types.ConfVar’
  2776. 354.31 s [Cabal] * in ‘Distribution.System’
  2777. 354.31 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2778. 354.31 s [Cabal] by specifying the type/value namespace explicitly.
  2779. 354.31 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.ConfVar’
  2780. 354.32 s [hspec-wai] checking for references to /build/ in /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1...
  2781. 354.34 s [hspec-wai] patching script interpreter paths in /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1
  2782. 354.34 s [hspec-wai] stripping (with command strip and flags -S -p) in /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1/lib
  2783. 354.39 s [hspec-wai] shrinking RPATHs of ELF executables and libraries in /nix/store/js1xfmkhsryfzsavd6kl4k87jfds26bz-hspec-wai-0.11.1-doc
  2784. 354.40 s [hspec-wai] checking for references to /build/ in /nix/store/js1xfmkhsryfzsavd6kl4k87jfds26bz-hspec-wai-0.11.1-doc...
  2785. 354.41 s [hspec-wai] patching script interpreter paths in /nix/store/js1xfmkhsryfzsavd6kl4k87jfds26bz-hspec-wai-0.11.1-doc
  2786. 354.42 s [wai-app-static] [4 of 9] Compiling WaiAppStatic.Storage.Filesystem ( WaiAppStatic/Storage/Filesystem.hs, /build/ghc1801_0/ghc_24.o, /build/ghc1801_0/ghc_24.dyn_o )
  2787. 354.54 s [hspec-wai:post-build] Uploading to cachix cache "sellout": /nix/store/js1xfmkhsryfzsavd6kl4k87jfds26bz-hspec-wai-0.11.1-doc /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1
  2788. 355.05 s [hspec-wai:post-build] Pushing 2 paths (278 are already present) using zstd to cache sellout ⏳
  2789. 355.05 s [hspec-wai:post-build]
  2790. 355.40 s [hspec-wai:post-build] Pushing /nix/store/js1xfmkhsryfzsavd6kl4k87jfds26bz-hspec-wai-0.11.1-doc (829.89 KiB)
  2791. 355.56 s [hspec-wai:post-build] Pushing /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1 (1.59 MiB)
  2792. 356.65 s [hspec-wai:post-build]
  2793. 356.65 s [hspec-wai:post-build] All done.
  2794. 356.67 s [hspec-wai:post-build] Uploading to the NixCI cache: /nix/store/js1xfmkhsryfzsavd6kl4k87jfds26bz-hspec-wai-0.11.1-doc /nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1
  2795. 356.72 s [hspec-wai:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2796. 356.94 s [hspec-wai:post-build] copying 2 paths...
  2797. 357.07 s [hspec-wai:post-build] copying path '/nix/store/js1xfmkhsryfzsavd6kl4k87jfds26bz-hspec-wai-0.11.1-doc' to 'https://cache.nix-ci.com'...
  2798. 357.29 s [hspec-wai:post-build] copying path '/nix/store/x3mx3xdhiawiaxvbijg8v8p3ndkiwfsk-hspec-wai-0.11.1' to 'https://cache.nix-ci.com'...
  2799. 357.93 s [hspec-wai:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2800. 358.18 s [hspec-wai:post-build] copying 1 paths...
  2801. 358.18 s [hspec-wai:post-build] copying path '/nix/store/7013z4jjb1z86qfmn148zfjbrh8x4sg1-hspec-wai-0.11.1.drv' to 'https://cache.nix-ci.com'...
  2802. 359.03 s Progress: 20 of 47 built (2 building), 373 of 373 downloaded from cache
  2803. 359.04 s [Cabal] Warning: 'hsLibraries' is out of scope.
  2804. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2805. 359.04 s [Cabal] 52% ( 20 / 38) in 'Distribution.Simple.GHCJS'
  2806. 359.04 s [Cabal] Missing documentation for:
  2807. 359.04 s [Cabal] Module header
  2808. 359.04 s [Cabal] getGhcInfo (src/Distribution/Simple/GHCJS.hs:307)
  2809. 359.04 s [Cabal] configure (src/Distribution/Simple/GHCJS.hs:111)
  2810. 359.04 s [Cabal] buildLib (src/Distribution/Simple/GHCJS.hs:455)
  2811. 359.04 s [Cabal] replLib (src/Distribution/Simple/GHCJS.hs:465)
  2812. 359.04 s [Cabal] replFLib (src/Distribution/Simple/GHCJS.hs:882)
  2813. 359.04 s [Cabal] replExe (src/Distribution/Simple/GHCJS.hs:905)
  2814. 359.04 s [Cabal] hcPkgInfo (src/Distribution/Simple/GHCJS.hs:1967)
  2815. 359.04 s [Cabal] registerPackage (src/Distribution/Simple/GHCJS.hs:1985)
  2816. 359.04 s [Cabal] componentGhcOptions (src/Distribution/Simple/GHCJS.hs:1773)
  2817. 359.04 s [Cabal] componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:341)
  2818. 359.04 s [Cabal] getLibDir (src/Distribution/Simple/GHCJS.hs:354)
  2819. 359.04 s [Cabal] isDynamic (src/Distribution/Simple/GHCJS.hs:1947)
  2820. 359.04 s [Cabal] pkgRoot (src/Distribution/Simple/GHCJS.hs:2000)
  2821. 359.04 s [Cabal] readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:56)
  2822. 359.04 s [Cabal] parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:53)
  2823. 359.04 s [Cabal] ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
  2824. 359.04 s [Cabal] getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:69)
  2825. 359.04 s [Cabal] Warning: 'PreBuildComponentRules' is out of scope.
  2826. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2827. 359.04 s [Cabal] Warning: 'hsLibraries' is out of scope.
  2828. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2829. 359.04 s [Cabal] 55% ( 21 / 38) in 'Distribution.Simple.GHC'
  2830. 359.04 s [Cabal] Missing documentation for:
  2831. 359.04 s [Cabal] getGhcInfo (src/Distribution/Simple/GHC.hs:386)
  2832. 359.04 s [Cabal] configure (src/Distribution/Simple/GHC.hs:149)
  2833. 359.04 s [Cabal] getInstalledPackagesMonitorFiles (src/Distribution/Simple/GHC.hs:539)
  2834. 359.04 s [Cabal] buildLib (src/Distribution/Simple/GHC.hs:570)
  2835. 359.04 s [Cabal] replLib (src/Distribution/Simple/GHC.hs:582)
  2836. 359.04 s [Cabal] replFLib (src/Distribution/Simple/GHC.hs:628)
  2837. 359.04 s [Cabal] replExe (src/Distribution/Simple/GHC.hs:653)
  2838. 359.04 s [Cabal] hcPkgInfo (src/Distribution/Simple/GHC.hs:959)
  2839. 359.04 s [Cabal] registerPackage (src/Distribution/Simple/GHC.hs:977)
  2840. 359.04 s [Cabal] componentGhcOptions (src/Distribution/Simple/GHC/Internal.hs:515)
  2841. 359.04 s [Cabal] componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:341)
  2842. 359.04 s [Cabal] getLibDir (src/Distribution/Simple/GHC.hs:450)
  2843. 359.04 s [Cabal] pkgRoot (src/Distribution/Simple/GHC.hs:992)
  2844. 359.04 s [Cabal] readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:56)
  2845. 359.04 s [Cabal] parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:53)
  2846. 359.04 s [Cabal] ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
  2847. 359.04 s [Cabal] getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:69)
  2848. 359.04 s [Cabal] 60% ( 3 / 5) in 'Distribution.Simple.ShowBuildInfo'
  2849. 359.04 s [Cabal] Missing documentation for:
  2850. 359.04 s [Cabal] mkCompilerInfo (src/Distribution/Simple/ShowBuildInfo.hs:133)
  2851. 359.04 s [Cabal] mkComponentInfo (src/Distribution/Simple/ShowBuildInfo.hs:141)
  2852. 359.04 s [Cabal] Warning: 'register' is out of scope.
  2853. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2854. 359.04 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Install'
  2855. 359.04 s [Cabal] 66% ( 2 / 3) in 'Distribution.Simple.Build.PathsModule'
  2856. 359.04 s [Cabal] Missing documentation for:
  2857. 359.04 s [Cabal] generatePathsModule (src/Distribution/Simple/Build/PathsModule.hs:41)
  2858. 359.04 s [Cabal] Warning: 'TestSuite' is out of scope.
  2859. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2860. 359.04 s [Cabal] 75% ( 6 / 8) in 'Distribution.Simple.Test.LibV09'
  2861. 359.04 s [Cabal] Missing documentation for:
  2862. 359.04 s [Cabal] Module header
  2863. 359.04 s [Cabal] runTest (src/Distribution/Simple/Test/LibV09.hs:57)
  2864. 359.04 s [Cabal] 0% ( 0 / 2) in 'Distribution.Simple.Test.ExeV10'
  2865. 359.04 s [Cabal] Missing documentation for:
  2866. 359.04 s [Cabal] Module header
  2867. 359.04 s [Cabal] runTest (src/Distribution/Simple/Test/ExeV10.hs:51)
  2868. 359.04 s [Cabal] Warning: 'dist' is out of scope.
  2869. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2870. 359.04 s [Cabal] 89% ( 17 / 19) in 'Distribution.PackageDescription.Check'
  2871. 359.04 s [Cabal] Missing documentation for:
  2872. 359.04 s [Cabal] CheckExplanationIDString (src/Distribution/PackageDescription/Check/Warning.hs:590)
  2873. 359.04 s [Cabal] ppCheckExplanationId (src/Distribution/PackageDescription/Check/Warning.hs:596)
  2874. 359.04 s [Cabal] 66% ( 4 / 6) in 'Distribution.Make'
  2875. 359.04 s [Cabal] Missing documentation for:
  2876. 359.04 s [Cabal] defaultMain (src/Distribution/Make.hs:84)
  2877. 359.04 s [Cabal] defaultMainArgs (src/Distribution/Make.hs:87)
  2878. 359.04 s [Cabal] Warning: 'sleepFileTimeCalibrate' is out of scope.
  2879. 359.04 s [wai-app-static] WaiAppStatic/Storage/Filesystem.hs:20:1: warning: [GHC-66111] [-Wunused-imports]
  2880. 359.04 s [wai-app-static] The import of ‘Data.List’ is redundant
  2881. 359.04 s [wai-app-static] except perhaps to import instances from ‘Data.List’
  2882. 359.04 s [wai-app-static] To import instances alone, use: import Data.List()
  2883. 359.04 s [wai-app-static] |
  2884. 359.04 s [wai-app-static] 20 | import Data.List (foldl')
  2885. 359.04 s [wai-app-static] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  2886. 359.04 s [wai-app-static]
  2887. 359.04 s [wai-app-static] [5 of 9] Compiling WaiAppStatic.Storage.Embedded.TH ( WaiAppStatic/Storage/Embedded/TH.hs, /build/ghc1801_0/ghc_22.o, /build/ghc1801_0/ghc_22.dyn_o )
  2888. 359.04 s [wai-app-static] [6 of 9] Compiling WaiAppStatic.Storage.Embedded.Runtime ( WaiAppStatic/Storage/Embedded/Runtime.hs, /build/ghc1801_0/ghc_20.o, /build/ghc1801_0/ghc_20.dyn_o )
  2889. 359.04 s [wai-app-static] WaiAppStatic/Storage/Embedded/Runtime.hs:87:33: warning: [GHC-63394] [-Wx-partial]
  2890. 359.04 s [wai-app-static] In the use of ‘head’
  2891. 359.04 s [wai-app-static] (imported from Prelude, but defined in GHC.Internal.List):
  2892. 359.04 s [wai-app-static] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2893. 359.04 s [wai-app-static] |
  2894. 359.04 s [wai-app-static] 87 | next = map (\(x, y) -> (head x, (tail x, y))) orig
  2895. 359.04 s [wai-app-static] | ^^^^
  2896. 359.04 s [wai-app-static]
  2897. 359.04 s [wai-app-static] WaiAppStatic/Storage/Embedded/Runtime.hs:87:42: warning: [GHC-63394] [-Wx-partial]
  2898. 359.04 s [wai-app-static] In the use of ‘tail’
  2899. 359.04 s [wai-app-static] (imported from Prelude, but defined in GHC.Internal.List):
  2900. 359.04 s [wai-app-static] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2901. 359.04 s [wai-app-static] |
  2902. 359.04 s [wai-app-static] 87 | next = map (\(x, y) -> (head x, (tail x, y))) orig
  2903. 359.04 s [wai-app-static] | ^^^^
  2904. 359.04 s [wai-app-static]
  2905. 359.04 s [wai-app-static] WaiAppStatic/Storage/Embedded/Runtime.hs:91:30: warning: [GHC-63394] [-Wx-partial]
  2906. 359.04 s [wai-app-static] In the use of ‘head’
  2907. 359.04 s [wai-app-static] (imported from Prelude, but defined in GHC.Internal.List):
  2908. 359.04 s [wai-app-static] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2909. 359.04 s [wai-app-static] |
  2910. 359.04 s [wai-app-static] 91 | hoisted = map (fst . head &&& map snd) grouped
  2911. 359.04 s [wai-app-static] | ^^^^
  2912. 359.04 s [wai-app-static]
  2913. 359.04 s [wai-app-static] [7 of 9] Compiling WaiAppStatic.Storage.Embedded ( WaiAppStatic/Storage/Embedded.hs, /build/ghc1801_0/ghc_18.o, /build/ghc1801_0/ghc_18.dyn_o )
  2914. 359.04 s [wai-app-static] [8 of 9] Compiling Network.Wai.Application.Static ( Network/Wai/Application/Static.hs, nothing )
  2915. 359.04 s [wai-app-static] [9 of 9] Compiling WaiAppStatic.CmdLine ( WaiAppStatic/CmdLine.hs, nothing )
  2916. 359.04 s [wai-app-static] WaiAppStatic/CmdLine.hs:135:18: warning: [GHC-68441] [-Wdeprecations]
  2917. 359.04 s [wai-app-static] In the use of ‘def’ (imported from Network.Wai.Middleware.Gzip):
  2918. 359.04 s [wai-app-static] Deprecated: "Please use 'defaultGzipSettings'. 'def' and the Default instance will be removed in a future major update."
  2919. 359.04 s [wai-app-static] |
  2920. 359.04 s [wai-app-static] 135 | gzip def{gzipFiles = GzipCompress}
  2921. 359.04 s [wai-app-static] | ^^^
  2922. 359.04 s [wai-app-static]
  2923. 359.04 s [wai-app-static] Haddock coverage:
  2924. 359.04 s [wai-app-static] 88% ( 16 / 18) in 'WaiAppStatic.Types'
  2925. 359.04 s [wai-app-static] Missing documentation for:
  2926. 359.04 s [wai-app-static] Module header
  2927. 359.04 s [wai-app-static] fromPiece
  2928. 359.04 s [wai-app-static] Warning: 'renderDirectoryContents' is out of scope.
  2929. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2930. 359.04 s [Cabal] 85% ( 6 / 7) in 'Distribution.Compat.Time'
  2931. 359.04 s [Cabal] Missing documentation for:
  2932. 359.04 s [Cabal] Module header
  2933. 359.04 s [Cabal] Warning: 'componentPackageDeps' is out of scope.
  2934. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2935. 359.04 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  2936. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2937. 359.04 s [Cabal] Warning: 'improveUnitId' is out of scope.
  2938. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2939. 359.04 s [Cabal] Warning: 'HashedUnitId' is out of scope.
  2940. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2941. 359.04 s [Cabal] 50% ( 1 / 2) in 'Distribution.Backpack.Configure'
  2942. 359.04 s [Cabal] Missing documentation for:
  2943. 359.04 s [Cabal] configureComponentLocalBuildInfos (src/Distribution/Backpack/Configure.hs:65)
  2944. 359.04 s [Cabal] Warning: 'OpenModule' is out of scope.
  2945. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2946. 359.04 s [Cabal] Warning: 'Module' is out of scope.
  2947. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2948. 359.04 s [Cabal] 50% ( 1 / 2) in 'Distribution.Backpack.DescribeUnitId'
  2949. 359.04 s [Cabal] Missing documentation for:
  2950. 359.04 s [Cabal] Module header
  2951. 359.04 s [Cabal] 52% ( 9 / 17) in 'Distribution.Simple.Register'
  2952. 359.04 s [Cabal] Missing documentation for:
  2953. 359.04 s [Cabal] register (src/Distribution/Simple/Register.hs:93)
  2954. 359.04 s [Cabal] unregister (src/Distribution/Simple/Register.hs:702)
  2955. 359.04 s [Cabal] internalPackageDBPath (src/Distribution/Simple/Register.hs:737)
  2956. 359.04 s [Cabal] initPackageDB (src/Distribution/Simple/Register.hs:354)
  2957. 359.04 s [Cabal] doesPackageDBExist (src/Distribution/Simple/Register.hs:374)
  2958. 359.04 s [Cabal] deletePackageDB (src/Distribution/Simple/Register.hs:382)
  2959. 359.04 s [Cabal] registerPackage (src/Distribution/Simple/Register.hs:422)
  2960. 359.04 s [Cabal] generateRegistrationInfo (src/Distribution/Simple/Register.hs:250)
  2961. 359.04 s [Cabal] 40% ( 9 / 22) in 'Distribution.Simple.PreProcess'
  2962. 359.04 s [Cabal] Missing documentation for:
  2963. 359.04 s [Cabal] builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:110)
  2964. 359.04 s [Cabal] builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:113)
  2965. 359.04 s [Cabal] mkSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:103)
  2966. 359.04 s [Cabal] runSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:118)
  2967. 359.04 s [Cabal] ppCpp (src/Distribution/Simple/PreProcess.hs:406)
  2968. 359.04 s [Cabal] ppCpp' (src/Distribution/Simple/PreProcess.hs:409)
  2969. 359.04 s [Cabal] ppGreenCard (src/Distribution/Simple/PreProcess.hs:381)
  2970. 359.04 s [Cabal] ppC2hs (src/Distribution/Simple/PreProcess.hs:650)
  2971. 359.04 s [Cabal] ppHsc2hs (src/Distribution/Simple/PreProcess.hs:475)
  2972. 359.04 s [Cabal] ppHappy (src/Distribution/Simple/PreProcess.hs:812)
  2973. 359.04 s [Cabal] ppAlex (src/Distribution/Simple/PreProcess.hs:821)
  2974. 359.04 s [Cabal] ppUnlit (src/Distribution/Simple/PreProcess.hs:396)
  2975. 359.04 s [Cabal] platformDefines (src/Distribution/Simple/PreProcess.hs:719)
  2976. 359.04 s [Cabal] 75% ( 3 / 4) in 'Distribution.Simple.UserHooks'
  2977. 359.04 s [Cabal] Missing documentation for:
  2978. 359.04 s [Cabal] Args (src/Distribution/Simple/UserHooks.hs:45)
  2979. 359.04 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Bench'
  2980. 359.04 s [Cabal] Warning: 'UserHooks' is out of scope.
  2981. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2982. 359.04 s [Cabal] 85% ( 23 / 27) in 'Distribution.Simple.Configure'
  2983. 359.04 s [Cabal] Missing documentation for:
  2984. 359.04 s [Cabal] configCompilerEx (src/Distribution/Simple/Configure.hs:2267)
  2985. 359.04 s [Cabal] configCompilerAuxEx (src/Distribution/Simple/Configure.hs:2255)
  2986. 359.04 s [Cabal] checkForeignDeps (src/Distribution/Simple/Configure.hs:2292)
  2987. 359.04 s [Cabal] platformDefines (src/Distribution/Simple/PreProcess.hs:719)
  2988. 359.04 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Test'
  2989. 359.04 s [Cabal] Warning: 'die' is out of scope.
  2990. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2991. 359.04 s [Cabal] Warning: 'errorPrefix' is out of scope.
  2992. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2993. 359.04 s [Cabal] 100% ( 15 / 15) in 'Distribution.Simple.SrcDist'
  2994. 359.04 s [Cabal] Warning: 'autogenComponentsModuleDir' is out of scope.
  2995. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2996. 359.04 s [Cabal] 88% ( 15 / 17) in 'Distribution.Simple.Build'
  2997. 359.04 s [Cabal] Missing documentation for:
  2998. 359.04 s [Cabal] repl (src/Distribution/Simple/Build.hs:267)
  2999. 359.04 s [Cabal] AutogenFile (src/Distribution/Simple/Build.hs:1078)
  3000. 359.04 s [Cabal] Warning: 'haddocks' is out of scope.
  3001. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3002. 359.04 s [Cabal] Warning: 'Haddock' is out of scope.
  3003. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3004. 359.04 s [Cabal] Warning: 'HaddocksFlags' is out of scope.
  3005. 359.04 s [wai-app-static] If you qualify the identifier, haddock can try to link it anyway.
  3006. 359.04 s [wai-app-static] Warning: 'getMetaData' is out of scope.
  3007. 359.04 s [wai-app-static] If you qualify the identifier, haddock can try to link it anyway.
  3008. 359.04 s [wai-app-static] 50% ( 1 / 2) in 'WaiAppStatic.Listing'
  3009. 359.04 s [wai-app-static] Missing documentation for:
  3010. 359.04 s [wai-app-static] Module header
  3011. 359.04 s [wai-app-static] 100% ( 7 / 7) in 'WaiAppStatic.Storage.Filesystem'
  3012. 359.04 s [wai-app-static] Warning: 'StaticSettings' is ambiguous. It is defined
  3013. 359.04 s [wai-app-static] * at WaiAppStatic/Types.hs:123:23
  3014. 359.04 s [wai-app-static] * at WaiAppStatic/Types.hs:123:1
  3015. 359.04 s [wai-app-static] You may be able to disambiguate the identifier by qualifying it or
  3016. 359.04 s [wai-app-static] by specifying the type/value namespace explicitly.
  3017. 359.04 s [wai-app-static] Defaulting to the one defined at WaiAppStatic/Types.hs:123:1
  3018. 359.04 s [wai-app-static] Warning: 'embedApp' is out of scope.
  3019. 359.04 s [wai-app-static] If you qualify the identifier, haddock can try to link it anyway.
  3020. 359.04 s [wai-app-static] 85% ( 6 / 7) in 'WaiAppStatic.Storage.Embedded'
  3021. 359.04 s [wai-app-static] Missing documentation for:
  3022. 359.04 s [wai-app-static] Module header
  3023. 359.04 s [wai-app-static] 100% ( 19 / 19) in 'Network.Wai.Application.Static'
  3024. 359.04 s [wai-app-static] 66% ( 2 / 3) in 'WaiAppStatic.CmdLine'
  3025. 359.04 s [wai-app-static] Missing documentation for:
  3026. 359.04 s [wai-app-static] Args (WaiAppStatic/CmdLine.hs:42)
  3027. 359.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3028. 359.04 s [Cabal] 66% ( 4 / 6) in 'Distribution.Simple.Haddock'
  3029. 359.04 s [Cabal] Missing documentation for:
  3030. 359.04 s [Cabal] haddock (src/Distribution/Simple/Haddock.hs:207)
  3031. 359.04 s [Cabal] hscolour (src/Distribution/Simple/Haddock.hs:1119)
  3032. 359.04 s [Cabal] 95% ( 20 / 21) in 'Distribution.Simple'
  3033. 359.04 s [Cabal] Missing documentation for:
  3034. 359.04 s [Cabal] Args (src/Distribution/Simple/UserHooks.hs:45)
  3035. 359.04 s [Cabal] Warning: Distribution.Backpack.ModuleShape: could not find link destinations for:
  3036. 359.04 s [Cabal]
  3037. 359.04 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3038. 359.04 s [Cabal] - Distribution.Utils.Structured.Tagged
  3039. 359.04 s [Cabal] Warning: Distribution.ReadE: could not find link destinations for:
  3040. 359.04 s [Cabal]
  3041. 359.04 s [Cabal] - Distribution.ReadE.ErrorMsg
  3042. 359.04 s [Cabal] Warning: Distribution.Simple.Flag: could not find link destinations for:
  3043. 359.04 s [Cabal]
  3044. 359.04 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3045. 359.04 s [Cabal] - Distribution.Utils.Structured.Tagged
  3046. 359.04 s [Cabal] Warning: Distribution.Simple.InstallDirs.Internal: could not find link destinations for:
  3047. 359.04 s [Cabal]
  3048. 359.04 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3049. 359.04 s [Cabal] - Distribution.Utils.Structured.Tagged
  3050. 359.04 s [Cabal] Warning: Distribution.Simple.InstallDirs: could not find link destinations for:
  3051. 359.04 s [Cabal]
  3052. 359.04 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3053. 359.04 s [Cabal] - Distribution.Utils.Structured.Tagged
  3054. 359.04 s [Cabal] Warning: Distribution.Types.ComponentLocalBuildInfo: could not find link destinations for:
  3055. 359.04 s [Cabal]
  3056. 359.04 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3057. 359.04 s [Cabal] - Distribution.Utils.Structured.Tagged
  3058. 359.04 s [Cabal] Warning: Distribution.Types.DumpBuildInfo: could not find link destinations for:
  3059. 359.04 s [Cabal]
  3060. 359.04 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3061. 359.04 s [Cabal] - Distribution.Utils.Structured.Tagged
  3062. 359.04 s [Cabal] Warning: Distribution.Types.GivenComponent: could not find link destinations for:
  3063. 359.04 s [Cabal]
  3064. 359.04 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3065. 359.04 s [Cabal] - Distribution.Utils.Structured.Tagged
  3066. 359.04 s [Cabal] Warning: Distribution.Types.TargetInfo: could not find link destinations for:
  3067. 359.04 s [Cabal]
  3068. 359.04 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3069. 359.04 s [Cabal] - Distribution.Utils.Structured.Tagged
  3070. 359.04 s [Cabal] Warning: Distribution.Verbosity.Internal: could not find link destinations for:
  3071. 359.04 s [Cabal]
  3072. 359.04 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3073. 359.04 s [Cabal] - Distribution.Utils.Structured.Tagged
  3074. 359.04 s [Cabal] Warning: Distribution.Verbosity: could not find link destinations for:
  3075. 359.04 s [Cabal]
  3076. 359.04 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3077. 359.04 s [Cabal] - Distribution.Utils.Structured.Tagged
  3078. 359.04 s [Cabal] Warning: Distribution.Simple.Program.Types: could not find link destinations for:
  3079. 359.04 s [Cabal]
  3080. 359.04 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3081. 359.04 s [Cabal] - Distribution.Utils.Structured.Tagged
  3082. 359.04 s [Cabal] Warning: Distribution.Simple.PreProcess.Types: could not find link destinations for:
  3083. 359.04 s [Cabal]
  3084. 359.04 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3085. 359.04 s [Cabal] - Distribution.Utils.Structured.Tagged
  3086. 359.04 s [Cabal] Warning: Distribution.Simple.Utils: could not find link destinations for:
  3087. 359.04 s [Cabal]
  3088. 359.04 s [Cabal] - Distribution.Simple.Utils.withMetadata
  3089. 359.04 s [Cabal] - Distribution.Simple.Utils.NormalMark
  3090. 359.04 s [Cabal] - Distribution.Simple.Utils.AlwaysTrace
  3091. 359.05 s [Cabal] - Distribution.Simple.Utils.errorPrefix
  3092. 359.05 s [Cabal] Warning: Distribution.Utils.NubList: could not find link destinations for:
  3093. 359.05 s [Cabal]
  3094. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3095. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3096. 359.05 s [Cabal] Warning: Distribution.Utils.LogProgress: could not find link destinations for:
  3097. 359.05 s [Cabal]
  3098. 359.05 s [Cabal] - Distribution.Utils.LogProgress.CtxMsg
  3099. 359.05 s [Cabal] Warning: Distribution.Simple.Program.Find: could not find link destinations for:
  3100. 359.05 s [Cabal]
  3101. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3102. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3103. 359.05 s [Cabal] - Distribution.Simple.Program.Find.findExecutable
  3104. 359.05 s [Cabal] Warning: Distribution.Simple.PackageIndex: could not find link destinations for:
  3105. 359.05 s [Cabal]
  3106. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3107. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3108. 359.05 s [Cabal] - Distribution.Simple.PackageIndex.DepUniqueKey
  3109. 359.05 s [Cabal] Warning: Distribution.Simple.Glob.Internal: could not find link destinations for:
  3110. 359.05 s [Cabal]
  3111. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3112. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3113. 359.05 s [Cabal] Warning: Distribution.Simple.Glob: could not find link destinations for:
  3114. 359.05 s [Cabal]
  3115. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3116. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3117. 359.05 s [Cabal] Warning: Distribution.Simple.Compiler: could not find link destinations for:
  3118. 359.05 s [Cabal]
  3119. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3120. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3121. 359.05 s [Cabal] - Distribution.Simple.Compiler.extensionToFlag
  3122. 359.05 s [Cabal] Warning: Distribution.Simple.Program.Db: could not find link destinations for:
  3123. 359.05 s [Cabal]
  3124. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3125. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3126. 359.05 s [Cabal] Warning: Distribution.Simple.Program: could not find link destinations for:
  3127. 359.05 s [Cabal]
  3128. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3129. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3130. 359.05 s [Cabal] Warning: Distribution.Types.LocalBuildConfig: could not find link destinations for:
  3131. 359.05 s [Cabal]
  3132. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3133. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3134. 359.05 s [Cabal] Warning: Distribution.Types.LocalBuildInfo: could not find link destinations for:
  3135. 359.05 s [Cabal]
  3136. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3137. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3138. 359.05 s [Cabal] Warning: Distribution.Simple.LocalBuildInfo: could not find link destinations for:
  3139. 359.05 s [Cabal]
  3140. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3141. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3142. 359.05 s [Cabal] - Distribution.Types.ComponentName.NotLibComponentName
  3143. 359.05 s [Cabal] Warning: Distribution.Simple.Setup: could not find link destinations for:
  3144. 359.05 s [Cabal]
  3145. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3146. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3147. 359.05 s [Cabal] - Distribution.Simple.Setup.Common.programDbPaths
  3148. 359.05 s [Cabal] Warning: Distribution.Simple.Build.Inputs: could not find link destinations for:
  3149. 359.05 s [Cabal]
  3150. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3151. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3152. 359.05 s [Cabal] Warning: Distribution.Simple.BuildTarget: could not find link destinations for:
  3153. 359.05 s [Cabal]
  3154. 359.05 s [Cabal] - Distribution.Simple.BuildTarget.matchInexactly
  3155. 359.05 s [Cabal] - Distribution.Simple.BuildTarget.findMatch
  3156. 359.05 s [Cabal] - Distribution.Simple.BuildTarget.None
  3157. 359.05 s [Cabal] - Distribution.Simple.BuildTarget.Unambiguous
  3158. 359.05 s [Cabal] - Distribution.Simple.BuildTarget.Ambiguous
  3159. 359.05 s [Cabal] Warning: Distribution.Simple.GHCJS: could not find link destinations for:
  3160. 359.05 s [Cabal]
  3161. 359.05 s [Cabal] - Distribution.Simple.GHCJS.gbuild
  3162. 359.05 s [Cabal] - Distribution.Simple.GHCJS.GBuildMode
  3163. 359.05 s [Cabal] - Distribution.Simple.GHCJS.BuildSources
  3164. 359.05 s [Cabal] Warning: Distribution.PackageDescription.Check: could not find link destinations for:
  3165. 359.05 s [Cabal]
  3166. 359.05 s [Cabal] - Distribution.PackageDescription.Check.Warning.CEType
  3167. 359.05 s [Cabal] - Distribution.PackageDescription.Check.Warning.WarnLang
  3168. 359.05 s [Cabal] - Distribution.PackageDescription.Check.checkPackagePrim
  3169. 359.05 s [Cabal] - Distribution.PackageDescription.Check.pd2gpd
  3170. 359.05 s [Cabal] Warning: Distribution.Make: could not find link destinations for:
  3171. 359.05 s [Cabal]
  3172. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3173. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3174. 359.05 s [Cabal] Warning: Distribution.Compat.Time: could not find link destinations for:
  3175. 359.05 s [Cabal]
  3176. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3177. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3178. 359.05 s [Cabal] Warning: Distribution.Backpack.Configure: could not find link destinations for:
  3179. 359.05 s [Cabal]
  3180. 359.05 s [Cabal] - Distribution.Backpack.PreExistingComponent.PreExistingComponent
  3181. 359.05 s [Cabal] - Distribution.Backpack.PreExistingComponent.PromisedComponent
  3182. 359.05 s [Cabal] Warning: Distribution.Simple.PreProcess: could not find link destinations for:
  3183. 359.05 s [Cabal]
  3184. 359.05 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3185. 359.05 s [Cabal] - Distribution.Utils.Structured.Tagged
  3186. 359.05 s [Cabal] Warning: Distribution.Simple.Configure: could not find link destinations for:
  3187. 359.05 s [Cabal]
  3188. 359.05 s [Cabal] - Distribution.Simple.Configure.PromisedDependency
  3189. 362.36 s [wai-app-static] Documentation created: dist/doc/html/wai-app-static/,
  3190. 362.36 s [wai-app-static] dist/doc/html/wai-app-static/wai-app-static.txt
  3191. 362.45 s [wai-app-static] Preprocessing test suite 'runtests' for wai-app-static-3.1.9...
  3192. 362.45 s [wai-app-static] Preprocessing executable 'warp' for wai-app-static-3.1.9...
  3193. 362.45 s [wai-app-static] Phase: installPhase
  3194. 362.55 s [wai-app-static] Installing library in /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY
  3195. 362.61 s [wai-app-static] Installing executable warp in /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9/bin
  3196. 362.61 s [wai-app-static] Warning: The directory
  3197. 362.61 s [wai-app-static] /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9/bin is not in
  3198. 362.61 s [wai-app-static] the system search path.
  3199. 362.90 s [wai-app-static] Phase: fixupPhase
  3200. 362.91 s [wai-app-static] shrinking RPATHs of ELF executables and libraries in /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9
  3201. 362.92 s [wai-app-static] shrinking /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSwai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY-ghc9.10.3.so
  3202. 362.96 s [wai-app-static] shrinking /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9/bin/warp
  3203. 362.97 s [wai-app-static] checking for references to /build/ in /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9...
  3204. 363.00 s [wai-app-static] patching script interpreter paths in /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9
  3205. 363.00 s [wai-app-static] stripping (with command strip and flags -S -p) in /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9/lib /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9/bin
  3206. 363.06 s [wai-app-static] shrinking RPATHs of ELF executables and libraries in /nix/store/1m6zkqsrb6rgid3bmjxkw8ysbj7jarc3-wai-app-static-3.1.9-doc
  3207. 363.07 s [wai-app-static] checking for references to /build/ in /nix/store/1m6zkqsrb6rgid3bmjxkw8ysbj7jarc3-wai-app-static-3.1.9-doc...
  3208. 363.08 s [wai-app-static] patching script interpreter paths in /nix/store/1m6zkqsrb6rgid3bmjxkw8ysbj7jarc3-wai-app-static-3.1.9-doc
  3209. 363.22 s [wai-app-static:post-build] Uploading to cachix cache "sellout": /nix/store/1m6zkqsrb6rgid3bmjxkw8ysbj7jarc3-wai-app-static-3.1.9-doc /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9
  3210. 363.72 s [wai-app-static:post-build] Pushing 2 paths (276 are already present) using zstd to cache sellout ⏳
  3211. 363.72 s [wai-app-static:post-build]
  3212. 364.09 s [wai-app-static:post-build] Pushing /nix/store/1m6zkqsrb6rgid3bmjxkw8ysbj7jarc3-wai-app-static-3.1.9-doc (977.49 KiB)
  3213. 364.25 s [wai-app-static:post-build] Pushing /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9 (8.71 MiB)
  3214. 365.42 s [wai-app-static:post-build]
  3215. 365.42 s [wai-app-static:post-build] All done.
  3216. 365.44 s [wai-app-static:post-build] Uploading to the NixCI cache: /nix/store/1m6zkqsrb6rgid3bmjxkw8ysbj7jarc3-wai-app-static-3.1.9-doc /nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9
  3217. 365.48 s [wai-app-static:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3218. 365.71 s [wai-app-static:post-build] copying 2 paths...
  3219. 365.71 s [wai-app-static:post-build] copying path '/nix/store/1m6zkqsrb6rgid3bmjxkw8ysbj7jarc3-wai-app-static-3.1.9-doc' to 'https://cache.nix-ci.com'...
  3220. 366.11 s [wai-app-static:post-build] copying path '/nix/store/f8bbkfyq8ipz94m6z9dy1a8m3yrz0ji8-wai-app-static-3.1.9' to 'https://cache.nix-ci.com'...
  3221. 369.16 s [wai-app-static:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3222. 369.41 s [wai-app-static:post-build] copying 1 paths...
  3223. 369.46 s [wai-app-static:post-build] copying path '/nix/store/k785gm45279rgka4q29x47s6vr2y3khn-wai-app-static-3.1.9.drv' to 'https://cache.nix-ci.com'...
  3224. 369.65 s Progress: 21 of 47 built (1 building), 373 of 373 downloaded from cache
  3225. 369.72 s Building /nix/store/dn87vz32v9d2nw0n2ap0i97d4cn223d4-servant-server-0.20.3.0.drv
  3226. 369.72 s [Cabal] Documentation created: dist/doc/html/Cabal/index.html,
  3227. 369.72 s [Cabal] dist/doc/html/Cabal/Cabal.txt
  3228. 369.72 s [Cabal] Phase: installPhase
  3229. 369.72 s [Cabal] Installing library in /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  3230. 369.72 s [Cabal] Phase: fixupPhase
  3231. 369.72 s [Cabal] shrinking RPATHs of ELF executables and libraries in /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0
  3232. 369.72 s [Cabal] shrinking /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSCabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN-ghc9.4.8.so
  3233. 369.72 s [Cabal] checking for references to /build/ in /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0...
  3234. 369.72 s [Cabal] patching script interpreter paths in /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0
  3235. 369.72 s [Cabal] stripping (with command strip and flags -S -p) in /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/lib
  3236. 369.72 s [Cabal] shrinking RPATHs of ELF executables and libraries in /nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc
  3237. 369.72 s [Cabal] checking for references to /build/ in /nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc...
  3238. 369.72 s [Cabal] patching script interpreter paths in /nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc
  3239. 370.04 s [Cabal:post-build] Uploading to cachix cache "sellout": /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0 /nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc
  3240. 370.51 s [Cabal:post-build] Pushing 2 paths (39 are already present) using zstd to cache sellout ⏳
  3241. 370.51 s [Cabal:post-build]
  3242. 370.87 s [Cabal:post-build] Pushing /nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc (35.90 MiB)
  3243. 370.94 s [Cabal:post-build] Pushing /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0 (126.16 MiB)
  3244. 373.08 s [Cabal:post-build]
  3245. 373.08 s [Cabal:post-build] All done.
  3246. 373.11 s [Cabal:post-build] Uploading to the NixCI cache: /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0 /nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc
  3247. 373.16 s [Cabal:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3248. 373.17 s [Cabal:post-build] copying 2 paths...
  3249. 373.17 s [Cabal:post-build] copying path '/nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc' to 'https://cache.nix-ci.com'...
  3250. 378.95 s [Cabal:post-build] copying path '/nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0' to 'https://cache.nix-ci.com'...
  3251. 414.07 s [Cabal:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3252. 414.31 s [Cabal:post-build] copying 1 paths...
  3253. 414.35 s [Cabal:post-build] copying path '/nix/store/4pzd4vbqgm1g9m847p54xi2bxmajw4cr-Cabal-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
  3254. 414.55 s Progress: 22 of 47 built (1 building), 373 of 373 downloaded from cache
  3255. 414.60 s Building /nix/store/y3rib6pk5hkwq1qfwyrjdr0dk5mw6a73-cabal-doctest-1.0.12.drv
  3256. 414.64 s Building /nix/store/risqmps20ycp5nxc5s63nzh8bxjpa4k0-ghc-paths-0.1.0.12.drv
  3257. 414.64 s [servant-server] Phase: setupCompilerEnvironmentPhase
  3258. 414.64 s [servant-server] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  3259. 414.64 s [servant-server] Phase: unpackPhase
  3260. 414.64 s [servant-server] unpacking source archive /nix/store/h028lqqsdi1mp61402nxsngqd8w2gq9p-servant-server-0.20.3.0.tar.gz
  3261. 414.64 s [servant-server] source root is servant-server-0.20.3.0
  3262. 414.64 s [servant-server] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "servant-server-0.20.3.0/test/Spec.hs"
  3263. 414.64 s [servant-server] Phase: patchPhase
  3264. 414.64 s [servant-server] Replace Cabal file with edited version from mirror://hackage/servant-server-0.20.3.0/revision/1.cabal.
  3265. 414.64 s [servant-server] Phase: compileBuildDriverPhase
  3266. 414.64 s [servant-server] setupCompileFlags: -package-db=/build/tmp.nS7AKsKwy9/setup-package.conf.d -threaded
  3267. 414.64 s [servant-server] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.nS7AKsKwy9/Main.o )
  3268. 414.64 s [servant-server] [2 of 2] Linking Setup
  3269. 414.64 s [servant-server] Phase: updateAutotoolsGnuConfigScriptsPhase
  3270. 414.64 s [servant-server] Phase: configurePhase
  3271. 414.64 s [servant-server] configureFlags: --verbose --prefix=/nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/8w8nl3xavz0fsa015rnj7wv43q7m03wf-servant-server-0.20.3.0-doc/share/doc/servant-server-0.20.3.0 --with-gcc=gcc --package-db=/build/tmp.nS7AKsKwy9/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  3272. 414.64 s [servant-server] Using Parsec parser
  3273. 414.64 s [servant-server] Configuring servant-server-0.20.3.0...
  3274. 414.64 s [servant-server] Dependency base >=4.16.4.0 && <4.22: using base-4.20.2.0
  3275. 414.64 s [servant-server] Dependency base64-bytestring >=1.0.0.1 && <1.3: using
  3276. 414.64 s [servant-server] base64-bytestring-1.2.1.0
  3277. 414.64 s [servant-server] Dependency bytestring >=0.11 && <0.13: using bytestring-0.12.2.0
  3278. 414.64 s [servant-server] Dependency constraints >=0.2 && <0.15: using constraints-0.14.2
  3279. 414.64 s [servant-server] Dependency containers >=0.6.5.1 && <0.9: using containers-0.7
  3280. 414.64 s [servant-server] Dependency exceptions >=0.10.0 && <0.11: using exceptions-0.10.9
  3281. 414.64 s [servant-server] Dependency filepath >=1.4.1.1 && <1.6: using filepath-1.5.4.0
  3282. 414.64 s [servant-server] Dependency http-api-data >=0.4.1 && <0.7: using http-api-data-0.6.2
  3283. 414.64 s [servant-server] Dependency http-media >=0.7.1.3 && <0.9: using http-media-0.8.1.1
  3284. 414.64 s [servant-server] Dependency http-types >=0.12.2 && <0.13: using http-types-0.12.4
  3285. 414.64 s [servant-server] Dependency monad-control >=1.0.2.3 && <1.1: using monad-control-1.0.3.1
  3286. 414.64 s [servant-server] Dependency mtl >=2.2.2 && <2.3 || >=2.3.1 && <2.4: using mtl-2.3.1
  3287. 414.64 s [servant-server] Dependency network >=2.8 && <3.3: using network-3.2.8.0
  3288. 414.64 s [servant-server] Dependency resourcet >=1.2.2 && <1.4: using resourcet-1.3.0
  3289. 414.64 s [servant-server] Dependency servant >=0.20.3 && <0.21: using servant-0.20.3.0
  3290. 414.64 s [servant-server] Dependency sop-core >=0.4.0.0 && <0.6: using sop-core-0.5.0.2
  3291. 414.64 s [servant-server] Dependency tagged >=0.8.6 && <0.9: using tagged-0.8.9
  3292. 414.64 s [servant-server] Dependency text >=1.2.3.0 && <2.2: using text-2.1.3
  3293. 414.64 s [servant-server] Dependency transformers >=0.5.2.0 && <0.7: using transformers-0.6.1.1
  3294. 414.64 s [servant-server] Dependency transformers-base >=0.4.5.2 && <0.5: using transformers-base-0.4.6
  3295. 414.64 s [servant-server] Dependency wai >=3.2.2.1 && <3.3: using wai-3.2.4
  3296. 414.64 s [servant-server] Dependency wai-app-static >=3.1.6.2 && <3.2: using wai-app-static-3.1.9
  3297. 414.64 s [servant-server] Dependency word8 >=0.1.3 && <0.2: using word8-0.1.3
  3298. 414.64 s [servant-server] Dependency aeson >=1.4.1.0 && <3: using aeson-2.2.3.0
  3299. 414.64 s [servant-server] Dependency base: using base-4.20.2.0
  3300. 414.64 s [servant-server] Dependency base-compat: using base-compat-0.14.1
  3301. 414.64 s [servant-server] Dependency servant-server: using servant-server-0.20.3.0
  3302. 414.64 s [servant-server] Dependency text: using text-2.1.3
  3303. 414.64 s [servant-server] Dependency wai: using wai-3.2.4
  3304. 414.64 s [servant-server] Dependency warp >=3.2.25 && <3.5: using warp-3.4.9
  3305. 414.64 s [servant-server] Dependency aeson >=1.4.1.0 && <3: using aeson-2.2.3.0
  3306. 414.64 s [servant-server] Dependency base: using base-4.20.2.0
  3307. 414.64 s [servant-server] Dependency base-compat: using base-compat-0.14.1
  3308. 414.64 s [servant-server] Dependency base64-bytestring: using base64-bytestring-1.2.1.0
  3309. 414.64 s [servant-server] Dependency bytestring: using bytestring-0.12.2.0
  3310. 414.64 s [servant-server] Dependency directory >=1.3.0.0 && <1.4: using directory-1.3.8.5
  3311. 414.64 s [servant-server] Dependency hspec >=2.6.0 && <2.12: using hspec-2.11.14
  3312. 414.64 s [servant-server] Dependency hspec-wai >=0.10.1 && <0.12: using hspec-wai-0.11.1
  3313. 414.64 s [servant-server] Dependency http-types: using http-types-0.12.4
  3314. 414.64 s [servant-server] Dependency mtl: using mtl-2.3.1
  3315. 414.64 s [servant-server] Dependency resourcet: using resourcet-1.3.0
  3316. 414.64 s [servant-server] Dependency safe: using safe-0.3.21
  3317. 414.64 s [servant-server] Dependency servant: using servant-0.20.3.0
  3318. 414.64 s [servant-server] Dependency servant-server: using servant-server-0.20.3.0
  3319. 414.64 s [servant-server] Dependency should-not-typecheck >=2.1.0 && <2.2: using
  3320. 414.64 s [servant-server] should-not-typecheck-2.1.0
  3321. 414.64 s [servant-server] Dependency temporary >=1.3 && <1.4: using temporary-1.3
  3322. 414.64 s [servant-server] Dependency text: using text-2.1.3
  3323. 414.64 s [servant-server] Dependency wai: using wai-3.2.4
  3324. 414.64 s [servant-server] Dependency wai-extra >=3.0.24.3 && <3.2: using wai-extra-3.1.18
  3325. 414.64 s [servant-server] Source component graph:
  3326. 414.64 s [servant-server] component lib
  3327. 414.64 s [servant-server] component exe:greet dependency lib
  3328. 414.64 s [servant-server] component test:spec dependency lib
  3329. 414.65 s [servant-server] Configured component graph:
  3330. 414.65 s [servant-server] component servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  3331. 414.65 s [servant-server] include base-4.20.2.0-64da
  3332. 414.65 s [servant-server] include base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
  3333. 414.65 s [servant-server] include bytestring-0.12.2.0-262e
  3334. 414.65 s [servant-server] include constraints-0.14.2-JkmJIjcPj36DNfnRR377pA
  3335. 414.65 s [servant-server] include containers-0.7-504a
  3336. 414.65 s [servant-server] include exceptions-0.10.9-1a12
  3337. 414.65 s [servant-server] include filepath-1.5.4.0-e600
  3338. 414.65 s [servant-server] include http-api-data-0.6.2-6w03icudfaU1CjVjYCk1v
  3339. 414.65 s [servant-server] include http-media-0.8.1.1-E6R1cmrydqXEfMcNYxzz4Y
  3340. 414.65 s [servant-server] include http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  3341. 414.65 s [servant-server] include monad-control-1.0.3.1-FXukO04e9y96LY59MG4Ntm
  3342. 414.65 s [servant-server] include mtl-2.3.1-b4af
  3343. 414.65 s [servant-server] include network-3.2.8.0-2Lm1jHkEUAkHufcHQylEci
  3344. 414.65 s [servant-server] include resourcet-1.3.0-6KPQeHFhrpTKp3z6Q0bYS3
  3345. 414.65 s [servant-server] include servant-0.20.3.0-A9SuftSow6x7bNcZpNSR4H
  3346. 414.65 s [servant-server] include sop-core-0.5.0.2-7qJHAkjaw2M8ONPorDfkOX
  3347. 414.65 s [servant-server] include tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  3348. 414.65 s [servant-server] include text-2.1.3-c691
  3349. 414.65 s [servant-server] include transformers-0.6.1.1-6a26
  3350. 414.65 s [servant-server] include transformers-base-0.4.6-7mn3WmelD0GNA8PdME8kn
  3351. 414.65 s [servant-server] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  3352. 414.65 s [servant-server] include wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY
  3353. 414.65 s [servant-server] include word8-0.1.3-I1jE8ijxY2T4lvVpnJ0STN
  3354. 414.65 s [servant-server] component servant-server-0.20.3.0-4iz2z6TSBd09pXsLChjdhD-greet
  3355. 414.65 s [servant-server] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  3356. 414.65 s [servant-server] include base-4.20.2.0-64da
  3357. 414.65 s [servant-server] include base-compat-0.14.1-99jmhitwe0HHIWItta3nRs
  3358. 414.65 s [servant-server] include servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  3359. 414.65 s [servant-server] include text-2.1.3-c691
  3360. 414.65 s [servant-server] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  3361. 414.65 s [servant-server] include warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
  3362. 414.65 s [servant-server] component servant-server-0.20.3.0-6JY6VXD5VrZ5FMTkjkCAZu-spec
  3363. 414.65 s [servant-server] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  3364. 414.65 s [servant-server] include base-4.20.2.0-64da
  3365. 414.65 s [servant-server] include base-compat-0.14.1-99jmhitwe0HHIWItta3nRs
  3366. 414.65 s [servant-server] include base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
  3367. 414.65 s [servant-server] include bytestring-0.12.2.0-262e
  3368. 414.65 s [servant-server] include directory-1.3.8.5-c84a
  3369. 414.65 s [servant-server] include hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  3370. 414.65 s [servant-server] include hspec-wai-0.11.1-ACFczlBhalK665w7VrwZ0J
  3371. 414.65 s [servant-server] include http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  3372. 414.65 s [servant-server] include mtl-2.3.1-b4af
  3373. 414.65 s [servant-server] include resourcet-1.3.0-6KPQeHFhrpTKp3z6Q0bYS3
  3374. 414.65 s [servant-server] include safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
  3375. 414.65 s [servant-server] include servant-0.20.3.0-A9SuftSow6x7bNcZpNSR4H
  3376. 414.65 s [servant-server] include servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  3377. 414.65 s [servant-server] include should-not-typecheck-2.1.0-5mTCNXWqs1oHzZxwvE06UD
  3378. 414.65 s [servant-server] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  3379. 414.65 s [servant-server] include text-2.1.3-c691
  3380. 414.65 s [servant-server] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  3381. 414.65 s [servant-server] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  3382. 414.65 s [servant-server] Linked component graph:
  3383. 414.65 s [servant-server] unit servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  3384. 414.65 s [servant-server] include base-4.20.2.0-64da
  3385. 414.65 s [servant-server] include base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
  3386. 414.65 s [servant-server] include bytestring-0.12.2.0-262e
  3387. 414.65 s [servant-server] include constraints-0.14.2-JkmJIjcPj36DNfnRR377pA
  3388. 414.65 s [servant-server] include containers-0.7-504a
  3389. 414.65 s [servant-server] include exceptions-0.10.9-1a12
  3390. 414.65 s [servant-server] include filepath-1.5.4.0-e600
  3391. 414.65 s [servant-server] include http-api-data-0.6.2-6w03icudfaU1CjVjYCk1v
  3392. 414.65 s [servant-server] include http-media-0.8.1.1-E6R1cmrydqXEfMcNYxzz4Y
  3393. 414.65 s [servant-server] include http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  3394. 414.65 s [servant-server] include monad-control-1.0.3.1-FXukO04e9y96LY59MG4Ntm
  3395. 414.65 s [servant-server] include mtl-2.3.1-b4af
  3396. 414.65 s [servant-server] include network-3.2.8.0-2Lm1jHkEUAkHufcHQylEci
  3397. 414.65 s [servant-server] include resourcet-1.3.0-6KPQeHFhrpTKp3z6Q0bYS3
  3398. 414.65 s [servant-server] include servant-0.20.3.0-A9SuftSow6x7bNcZpNSR4H
  3399. 414.65 s [servant-server] include sop-core-0.5.0.2-7qJHAkjaw2M8ONPorDfkOX
  3400. 414.65 s [servant-server] include tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  3401. 414.65 s [servant-server] include text-2.1.3-c691
  3402. 414.65 s [servant-server] include transformers-0.6.1.1-6a26
  3403. 414.65 s [servant-server] include transformers-base-0.4.6-7mn3WmelD0GNA8PdME8kn
  3404. 414.65 s [servant-server] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  3405. 414.65 s [servant-server] include wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY
  3406. 414.65 s [servant-server] include word8-0.1.3-I1jE8ijxY2T4lvVpnJ0STN
  3407. 414.65 s [servant-server] Servant=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant,Servant.Server=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server,Servant.Server.Experimental.Auth=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.Experimental.Auth,Servant.Server.Generic=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.Generic,Servant.Server.Internal=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.Internal,Servant.Server.Internal.BasicAuth=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.Internal.BasicAuth,Servant.Server.Internal.Context=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.Internal.Context,Servant.Server.Internal.Delayed=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.Internal.Delayed,Servant.Server.Internal.DelayedIO=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.Internal.DelayedIO,Servant.Server.Internal.ErrorFormatter=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.Internal.ErrorFormatter,Servant.Server.Internal.Handler=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.Internal.Handler,Servant.Server.Internal.ResponseRender=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.Internal.ResponseRender,Servant.Server.Internal.RouteResult=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.Internal.RouteResult,Servant.Server.Internal.Router=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.Internal.Router,Servant.Server.Internal.RoutingApplication=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.Internal.RoutingApplication,Servant.Server.Internal.ServerError=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.Internal.ServerError,Servant.Server.StaticFiles=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.StaticFiles,Servant.Server.UVerb=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Server.UVerb,Servant.Utils.StaticFiles=servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns:Servant.Utils.StaticFiles
  3408. 414.65 s [servant-server] unit servant-server-0.20.3.0-4iz2z6TSBd09pXsLChjdhD-greet
  3409. 414.65 s [servant-server] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  3410. 414.65 s [servant-server] include base-4.20.2.0-64da
  3411. 414.65 s [servant-server] include base-compat-0.14.1-99jmhitwe0HHIWItta3nRs
  3412. 414.65 s [servant-server] include servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  3413. 414.65 s [servant-server] include text-2.1.3-c691
  3414. 414.65 s [servant-server] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  3415. 414.65 s [servant-server] include warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
  3416. 414.65 s [servant-server] unit servant-server-0.20.3.0-6JY6VXD5VrZ5FMTkjkCAZu-spec
  3417. 414.65 s [servant-server] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  3418. 414.65 s [servant-server] include base-4.20.2.0-64da
  3419. 414.65 s [servant-server] include base-compat-0.14.1-99jmhitwe0HHIWItta3nRs
  3420. 414.65 s [servant-server] include base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
  3421. 414.65 s [servant-server] include bytestring-0.12.2.0-262e
  3422. 414.65 s [servant-server] include directory-1.3.8.5-c84a
  3423. 414.65 s [servant-server] include hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  3424. 414.65 s [servant-server] include hspec-wai-0.11.1-ACFczlBhalK665w7VrwZ0J
  3425. 414.65 s [servant-server] include http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  3426. 414.65 s [servant-server] include mtl-2.3.1-b4af
  3427. 414.65 s [servant-server] include resourcet-1.3.0-6KPQeHFhrpTKp3z6Q0bYS3
  3428. 414.65 s [servant-server] include safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
  3429. 414.65 s [servant-server] include servant-0.20.3.0-A9SuftSow6x7bNcZpNSR4H
  3430. 414.65 s [servant-server] include servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  3431. 414.65 s [servant-server] include should-not-typecheck-2.1.0-5mTCNXWqs1oHzZxwvE06UD
  3432. 414.65 s [servant-server] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  3433. 414.65 s [servant-server] include text-2.1.3-c691
  3434. 414.65 s [servant-server] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  3435. 414.65 s [servant-server] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  3436. 414.65 s [servant-server] Ready component graph:
  3437. 414.65 s [servant-server] definite servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  3438. 414.65 s [servant-server] depends base-4.20.2.0-64da
  3439. 414.65 s [servant-server] depends base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
  3440. 414.65 s [servant-server] depends bytestring-0.12.2.0-262e
  3441. 414.65 s [servant-server] depends constraints-0.14.2-JkmJIjcPj36DNfnRR377pA
  3442. 414.65 s [servant-server] depends containers-0.7-504a
  3443. 414.65 s [servant-server] depends exceptions-0.10.9-1a12
  3444. 414.65 s [servant-server] depends filepath-1.5.4.0-e600
  3445. 414.65 s [servant-server] depends http-api-data-0.6.2-6w03icudfaU1CjVjYCk1v
  3446. 414.65 s [servant-server] depends http-media-0.8.1.1-E6R1cmrydqXEfMcNYxzz4Y
  3447. 414.65 s [servant-server] depends http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  3448. 414.65 s [servant-server] depends monad-control-1.0.3.1-FXukO04e9y96LY59MG4Ntm
  3449. 414.65 s [servant-server] depends mtl-2.3.1-b4af
  3450. 414.65 s [servant-server] depends network-3.2.8.0-2Lm1jHkEUAkHufcHQylEci
  3451. 414.65 s [servant-server] depends resourcet-1.3.0-6KPQeHFhrpTKp3z6Q0bYS3
  3452. 414.65 s [servant-server] depends servant-0.20.3.0-A9SuftSow6x7bNcZpNSR4H
  3453. 414.65 s [servant-server] depends sop-core-0.5.0.2-7qJHAkjaw2M8ONPorDfkOX
  3454. 414.65 s [servant-server] depends tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  3455. 414.65 s [servant-server] depends text-2.1.3-c691
  3456. 414.65 s [servant-server] depends transformers-0.6.1.1-6a26
  3457. 414.65 s [servant-server] depends transformers-base-0.4.6-7mn3WmelD0GNA8PdME8kn
  3458. 414.65 s [servant-server] depends wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  3459. 414.65 s [servant-server] depends wai-app-static-3.1.9-Huf9RgCgm5kJ2oiR0Vr7yY
  3460. 414.65 s [servant-server] depends word8-0.1.3-I1jE8ijxY2T4lvVpnJ0STN
  3461. 414.65 s [servant-server] definite servant-server-0.20.3.0-6JY6VXD5VrZ5FMTkjkCAZu-spec
  3462. 414.65 s [servant-server] depends aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  3463. 414.65 s [servant-server] depends base-4.20.2.0-64da
  3464. 414.65 s [servant-server] depends base-compat-0.14.1-99jmhitwe0HHIWItta3nRs
  3465. 414.65 s [servant-server] depends base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
  3466. 414.65 s [servant-server] depends bytestring-0.12.2.0-262e
  3467. 414.65 s [servant-server] depends directory-1.3.8.5-c84a
  3468. 414.65 s [servant-server] depends hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  3469. 414.65 s [servant-server] depends hspec-wai-0.11.1-ACFczlBhalK665w7VrwZ0J
  3470. 414.65 s [servant-server] depends http-types-0.12.4-Hzt6KH64YcYFyYN1S3LjD7
  3471. 414.65 s [servant-server] depends mtl-2.3.1-b4af
  3472. 414.65 s [servant-server] depends resourcet-1.3.0-6KPQeHFhrpTKp3z6Q0bYS3
  3473. 414.65 s [servant-server] depends safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
  3474. 414.65 s [servant-server] depends servant-0.20.3.0-A9SuftSow6x7bNcZpNSR4H
  3475. 414.65 s [servant-server] depends servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  3476. 414.65 s [servant-server] depends should-not-typecheck-2.1.0-5mTCNXWqs1oHzZxwvE06UD
  3477. 414.65 s [servant-server] depends temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  3478. 414.65 s [servant-server] depends text-2.1.3-c691
  3479. 414.65 s [servant-server] depends wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  3480. 414.65 s [servant-server] depends wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  3481. 414.65 s [servant-server] definite servant-server-0.20.3.0-4iz2z6TSBd09pXsLChjdhD-greet
  3482. 414.65 s [servant-server] depends aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  3483. 414.65 s [servant-server] depends base-4.20.2.0-64da
  3484. 414.65 s [servant-server] depends base-compat-0.14.1-99jmhitwe0HHIWItta3nRs
  3485. 414.65 s [servant-server] depends servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  3486. 414.65 s [servant-server] depends text-2.1.3-c691
  3487. 414.65 s [servant-server] depends wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  3488. 414.65 s [servant-server] depends warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
  3489. 414.65 s [servant-server] Using Cabal-3.12.1.0 compiled by ghc-9.10
  3490. 414.65 s [servant-server] Using compiler: ghc-9.10.3
  3491. 414.65 s [servant-server] Using install prefix:
  3492. 414.65 s [servant-server] /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0
  3493. 414.65 s [servant-server] Executables installed in:
  3494. 414.65 s [servant-server] /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0/bin
  3495. 414.65 s [servant-server] Libraries installed in:
  3496. 414.65 s [servant-server] /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  3497. 414.65 s [servant-server] Dynamic Libraries installed in:
  3498. 414.65 s [servant-server] /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  3499. 414.65 s [servant-server] Private executables installed in:
  3500. 414.65 s [servant-server] /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0/libexec/x86_64-linux-ghc-9.10.3-05f6/servant-server-0.20.3.0
  3501. 414.65 s [servant-server] Data files installed in:
  3502. 414.65 s [servant-server] /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0/share/x86_64-linux-ghc-9.10.3-05f6/servant-server-0.20.3.0
  3503. 414.65 s [servant-server] Documentation installed in:
  3504. 414.65 s [servant-server] /nix/store/8w8nl3xavz0fsa015rnj7wv43q7m03wf-servant-server-0.20.3.0-doc/share/doc/servant-server-0.20.3.0
  3505. 414.65 s [servant-server] Configuration files installed in:
  3506. 414.65 s [servant-server] /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0/etc
  3507. 414.65 s [servant-server] No alex found
  3508. 414.65 s [servant-server] Using ar found on system at:
  3509. 414.65 s [servant-server] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  3510. 414.65 s [servant-server] No c2hs found
  3511. 414.65 s [servant-server] No cpphs found
  3512. 414.65 s [servant-server] No doctest found
  3513. 414.65 s [servant-server] Using gcc version 14.3.0 given by user at:
  3514. 414.65 s [servant-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  3515. 414.65 s [servant-server] Using ghc version 9.10.3 found on system at:
  3516. 414.65 s [servant-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  3517. 414.65 s [servant-server] Using ghc-pkg version 9.10.3 found on system at:
  3518. 414.65 s [servant-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  3519. 414.65 s [servant-server] No ghcjs found
  3520. 414.65 s [servant-server] No ghcjs-pkg found
  3521. 414.65 s [servant-server] No greencard found
  3522. 414.65 s [servant-server] Using haddock version 2.31.1 found on system at:
  3523. 414.65 s [servant-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  3524. 414.65 s [servant-server] No happy found
  3525. 414.65 s [servant-server] Using haskell-suite found on system at: haskell-suite-dummy-location
  3526. 414.65 s [servant-server] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3527. 414.65 s [servant-server] No hmake found
  3528. 414.65 s [servant-server] Using hpc version 0.69 found on system at:
  3529. 414.65 s [servant-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  3530. 414.65 s [servant-server] Using hsc2hs version 0.68.10 found on system at:
  3531. 414.65 s [servant-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  3532. 414.65 s [servant-server] Using hscolour version 1.25 found on system at:
  3533. 414.65 s [servant-server] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  3534. 414.65 s [servant-server] No jhc found
  3535. 414.65 s [servant-server] Using ld found on system at:
  3536. 414.65 s [servant-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  3537. 414.65 s [servant-server] No pkg-config found
  3538. 414.65 s [servant-server] Using runghc version 9.10.3 found on system at:
  3539. 414.65 s [servant-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  3540. 414.65 s [servant-server] Using strip version 2.44 found on system at:
  3541. 414.65 s [servant-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  3542. 414.65 s [servant-server] Using tar found on system at:
  3543. 414.65 s [servant-server] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  3544. 414.65 s [servant-server] No uhc found
  3545. 414.65 s [servant-server] configurePhase completed in 43 seconds
  3546. 414.65 s [servant-server] Phase: buildPhase
  3547. 414.67 s [cabal-doctest] Phase: setupCompilerEnvironmentPhase
  3548. 414.68 s [cabal-doctest] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  3549. 414.71 s [ghc-paths] Phase: setupCompilerEnvironmentPhase
  3550. 414.71 s [ghc-paths] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  3551. 414.74 s [servant-server] Preprocessing library for servant-server-0.20.3.0...
  3552. 414.74 s [servant-server] Building library for servant-server-0.20.3.0...
  3553. 414.81 s [cabal-doctest] Phase: unpackPhase
  3554. 414.82 s [cabal-doctest] unpacking source archive /nix/store/ckph819l8a613hapx2pwbjv3yzi8gm3k-cabal-doctest-1.0.12.tar.gz
  3555. 414.82 s [cabal-doctest] source root is cabal-doctest-1.0.12
  3556. 414.83 s [cabal-doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "cabal-doctest-1.0.12/src/Distribution/Extra/Doctest.hs"
  3557. 414.83 s [cabal-doctest] Phase: patchPhase
  3558. 414.84 s [cabal-doctest] Phase: compileBuildDriverPhase
  3559. 414.85 s [cabal-doctest] setupCompileFlags: -package-db=/build/tmp.tSAJ7MRrLa/setup-package.conf.d -threaded
  3560. 414.85 s [ghc-paths] Phase: unpackPhase
  3561. 414.85 s [ghc-paths] unpacking source archive /nix/store/jbdk3r2ic959xyc0394gn6n61wgjf6n0-ghc-paths-0.1.0.12.tar.gz
  3562. 414.86 s [ghc-paths] source root is ghc-paths-0.1.0.12
  3563. 414.86 s [ghc-paths] setting SOURCE_DATE_EPOCH to timestamp 1566388706 of file "ghc-paths-0.1.0.12/Setup.hs"
  3564. 414.87 s [ghc-paths] Phase: patchPhase
  3565. 414.87 s [ghc-paths] Replace Cabal file with edited version from mirror://hackage/ghc-paths-0.1.0.12/revision/8.cabal.
  3566. 414.88 s [ghc-paths] applying patch /nix/store/57w4xa43g7ilkdjd7mplrn8l3pvmyklf-ghc-paths-nix.patch
  3567. 414.88 s [ghc-paths] patching file GHC/Paths.hs
  3568. 414.88 s [ghc-paths] Phase: compileBuildDriverPhase
  3569. 414.88 s [ghc-paths] setupCompileFlags: -package-db=/build/tmp.q6QZIbjdx8/setup-package.conf.d -threaded
  3570. 414.89 s [cabal-doctest] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.tSAJ7MRrLa/Main.o )
  3571. 414.94 s [cabal-doctest] [2 of 2] Linking Setup
  3572. 414.95 s [ghc-paths] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.q6QZIbjdx8/Main.o )
  3573. 414.97 s [servant-server] [ 1 of 19] Compiling Servant.Server.Internal.Context
  3574. 415.16 s [servant-server] [ 2 of 19] Compiling Servant.Server.Internal.ResponseRender
  3575. 415.22 s [ghc-paths] [2 of 2] Linking Setup
  3576. 415.53 s [servant-server] [ 3 of 19] Compiling Servant.Server.Internal.ServerError
  3577. 415.53 s [servant-server] [ 4 of 19] Compiling Servant.Server.Internal.RouteResult
  3578. 415.69 s [servant-server] [ 5 of 19] Compiling Servant.Server.Internal.RoutingApplication
  3579. 415.72 s [servant-server] [ 6 of 19] Compiling Servant.Server.Internal.Handler
  3580. 415.72 s [servant-server] [ 7 of 19] Compiling Servant.Server.Internal.ErrorFormatter
  3581. 415.72 s [servant-server] [ 8 of 19] Compiling Servant.Server.Internal.Router
  3582. 416.24 s [cabal-doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  3583. 416.24 s [servant-server] [ 9 of 19] Compiling Servant.Server.Internal.DelayedIO
  3584. 416.24 s [servant-server] [10 of 19] Compiling Servant.Server.Internal.Delayed
  3585. 416.24 s [servant-server] [11 of 19] Compiling Servant.Server.Internal.BasicAuth
  3586. 416.24 s [servant-server] [12 of 19] Compiling Servant.Server.Internal
  3587. 416.25 s [cabal-doctest] Phase: configurePhase
  3588. 416.25 s [cabal-doctest] configureFlags: --verbose --prefix=/nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12 --with-gcc=gcc --package-db=/build/tmp.tSAJ7MRrLa/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  3589. 416.34 s [servant-server] src/Servant/Server/Internal.hs:1051:1: warning: [GHC-08585] [-Wmissing-methods]
  3590. 416.34 s [servant-server] • No explicit associated type or default declaration for ‘ServerT’
  3591. 416.34 s [servant-server] • In the instance declaration for ‘HasServer (ty :> sub) context’
  3592. 416.34 s [servant-server] |
  3593. 416.34 s [servant-server] 1051 | instance {-# OVERLAPPABLE #-} TypeError (NoInstanceForSub
  3594. 416.34 s [servant-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  3595. 416.34 s [servant-server]
  3596. 416.34 s [servant-server] src/Servant/Server/Internal.hs:1051:31: warning: [GHC-06201] [-Wmissing-methods]
  3597. 416.34 s [servant-server] • No explicit implementation for
  3598. 416.34 s [servant-server] ‘route’ and ‘hoistServerWithContext’
  3599. 416.34 s [servant-server] • In the instance declaration for ‘HasServer (ty :> sub) context’
  3600. 416.34 s [servant-server] |
  3601. 416.34 s [servant-server] 1051 | instance {-# OVERLAPPABLE #-} TypeError (NoInstanceForSub
  3602. 416.34 s [servant-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  3603. 416.34 s [servant-server]
  3604. 416.34 s [servant-server] src/Servant/Server/Internal.hs:1057:1: warning: [GHC-08585] [-Wmissing-methods]
  3605. 416.34 s [servant-server] • No explicit associated type or default declaration for ‘ServerT’
  3606. 416.34 s [servant-server] • In the instance declaration for ‘HasServer api context’
  3607. 416.34 s [servant-server] |
  3608. 416.34 s [servant-server] 1057 | instance {-# OVERLAPPABLE #-} TypeError (NoInstanceFor (HasServer api context)) => HasServer api context
  3609. 416.34 s [servant-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  3610. 416.34 s [servant-server]
  3611. 416.34 s [servant-server] src/Servant/Server/Internal.hs:1057:31: warning: [GHC-06201] [-Wmissing-methods]
  3612. 416.34 s [servant-server] • No explicit implementation for
  3613. 416.34 s [servant-server] ‘route’ and ‘hoistServerWithContext’
  3614. 416.34 s [servant-server] • In the instance declaration for ‘HasServer api context’
  3615. 416.34 s [servant-server] |
  3616. 416.34 s [servant-server] 1057 | instance {-# OVERLAPPABLE #-} TypeError (NoInstanceFor (HasServer api context)) => HasServer api context
  3617. 416.34 s [servant-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  3618. 416.34 s [servant-server]
  3619. 416.56 s [ghc-paths] Phase: updateAutotoolsGnuConfigScriptsPhase
  3620. 416.57 s [ghc-paths] Phase: configurePhase
  3621. 416.57 s [ghc-paths] configureFlags: --verbose --prefix=/nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12 --with-gcc=gcc --package-db=/build/tmp.q6QZIbjdx8/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  3622. 416.58 s [ghc-paths] Using Parsec parser
  3623. 416.58 s [ghc-paths] Configuring ghc-paths-0.1.0.12...
  3624. 416.66 s [cabal-doctest] Using Parsec parser
  3625. 416.66 s [cabal-doctest] Configuring cabal-doctest-1.0.12...
  3626. 416.66 s [cabal-doctest] Dependency Cabal >=1.24 && <3.16: using Cabal-3.12.1.0
  3627. 416.66 s [cabal-doctest] Dependency base >=4.9 && <5: using base-4.17.2.1
  3628. 416.66 s [cabal-doctest] Dependency directory >=1.3 && <2: using directory-1.3.7.1
  3629. 416.66 s [cabal-doctest] Dependency filepath >=1.4 && <2: using filepath-1.4.2.2
  3630. 416.93 s [cabal-doctest] Source component graph: component lib
  3631. 416.93 s [cabal-doctest] Configured component graph:
  3632. 416.93 s [cabal-doctest] component cabal-doctest-1.0.12-7IOee4d8EeSYFTisSbXWK
  3633. 416.93 s [cabal-doctest] include Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  3634. 416.93 s [cabal-doctest] include base-4.17.2.1
  3635. 416.93 s [cabal-doctest] include directory-1.3.7.1
  3636. 416.93 s [cabal-doctest] include filepath-1.4.2.2
  3637. 416.93 s [cabal-doctest] Linked component graph:
  3638. 416.93 s [cabal-doctest] unit cabal-doctest-1.0.12-7IOee4d8EeSYFTisSbXWK
  3639. 416.93 s [cabal-doctest] include Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  3640. 416.93 s [cabal-doctest] include base-4.17.2.1
  3641. 416.93 s [cabal-doctest] include directory-1.3.7.1
  3642. 416.93 s [cabal-doctest] include filepath-1.4.2.2
  3643. 416.93 s [cabal-doctest] Distribution.Extra.Doctest=cabal-doctest-1.0.12-7IOee4d8EeSYFTisSbXWK:Distribution.Extra.Doctest
  3644. 416.93 s [cabal-doctest] Ready component graph:
  3645. 416.93 s [cabal-doctest] definite cabal-doctest-1.0.12-7IOee4d8EeSYFTisSbXWK
  3646. 416.93 s [cabal-doctest] depends Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  3647. 416.93 s [cabal-doctest] depends base-4.17.2.1
  3648. 416.93 s [cabal-doctest] depends directory-1.3.7.1
  3649. 416.93 s [cabal-doctest] depends filepath-1.4.2.2
  3650. 416.93 s [cabal-doctest] Using Cabal-3.8.1.0 compiled by ghc-9.4
  3651. 416.93 s [cabal-doctest] Using compiler: ghc-9.4.8
  3652. 416.93 s [cabal-doctest] Using install prefix:
  3653. 416.93 s [cabal-doctest] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12
  3654. 416.93 s [cabal-doctest] Executables installed in:
  3655. 416.93 s [cabal-doctest] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/bin
  3656. 416.93 s [cabal-doctest] Libraries installed in:
  3657. 416.93 s [cabal-doctest] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/cabal-doctest-1.0.12-7IOee4d8EeSYFTisSbXWK
  3658. 416.93 s [cabal-doctest] Dynamic Libraries installed in:
  3659. 416.93 s [cabal-doctest] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  3660. 416.93 s [cabal-doctest] Private executables installed in:
  3661. 416.93 s [cabal-doctest] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/libexec/x86_64-linux-ghc-9.4.8/cabal-doctest-1.0.12
  3662. 416.93 s [cabal-doctest] Data files installed in:
  3663. 416.93 s [cabal-doctest] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/share/x86_64-linux-ghc-9.4.8/cabal-doctest-1.0.12
  3664. 416.93 s [cabal-doctest] Documentation installed in:
  3665. 416.93 s [cabal-doctest] /nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12
  3666. 416.93 s [cabal-doctest] Configuration files installed in:
  3667. 416.93 s [cabal-doctest] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/etc
  3668. 416.93 s [cabal-doctest] No alex found
  3669. 416.93 s [cabal-doctest] Using ar found on system at:
  3670. 416.93 s [cabal-doctest] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  3671. 416.93 s [cabal-doctest] No c2hs found
  3672. 416.93 s [cabal-doctest] No cpphs found
  3673. 416.93 s [cabal-doctest] No doctest found
  3674. 416.93 s [cabal-doctest] Using gcc version 14.3.0 given by user at:
  3675. 416.93 s [cabal-doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  3676. 416.93 s [cabal-doctest] Using ghc version 9.4.8 found on system at:
  3677. 416.93 s [cabal-doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  3678. 416.93 s [cabal-doctest] Using ghc-pkg version 9.4.8 found on system at:
  3679. 416.93 s [cabal-doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  3680. 416.93 s [cabal-doctest] No ghcjs found
  3681. 416.93 s [cabal-doctest] No ghcjs-pkg found
  3682. 416.93 s [cabal-doctest] No greencard found
  3683. 416.93 s [cabal-doctest] Using haddock version 2.27.0 found on system at:
  3684. 416.93 s [cabal-doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  3685. 416.93 s [cabal-doctest] No happy found
  3686. 416.93 s [cabal-doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  3687. 416.93 s [cabal-doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3688. 416.93 s [cabal-doctest] No hmake found
  3689. 416.93 s [cabal-doctest] Using hpc version 0.68 found on system at:
  3690. 416.93 s [cabal-doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  3691. 416.93 s [cabal-doctest] Using hsc2hs version 0.68.8 found on system at:
  3692. 416.93 s [cabal-doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  3693. 416.93 s [cabal-doctest] Using hscolour version 1.25 found on system at:
  3694. 416.93 s [cabal-doctest] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  3695. 416.93 s [cabal-doctest] No jhc found
  3696. 416.93 s [cabal-doctest] Using ld found on system at:
  3697. 416.93 s [cabal-doctest] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  3698. 416.93 s [cabal-doctest] No pkg-config found
  3699. 416.93 s [cabal-doctest] Using runghc version 9.4.8 found on system at:
  3700. 416.93 s [cabal-doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  3701. 416.93 s [cabal-doctest] Using strip version 2.44 found on system at:
  3702. 416.93 s [cabal-doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  3703. 416.93 s [cabal-doctest] Using tar found on system at:
  3704. 416.93 s [cabal-doctest] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  3705. 416.93 s [cabal-doctest] No uhc found
  3706. 416.94 s [cabal-doctest] Phase: buildPhase
  3707. 417.00 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12..
  3708. 417.00 s [cabal-doctest] Building library for cabal-doctest-1.0.12..
  3709. 417.08 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.o, dist/build/Distribution/Extra/Doctest.dyn_o )
  3710. 417.13 s [ghc-paths] Dependency base >=3 && <5: using base-4.17.2.1
  3711. 417.13 s [ghc-paths] Source component graph: component lib
  3712. 417.13 s [ghc-paths] Configured component graph:
  3713. 417.13 s [ghc-paths] component ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3714. 417.13 s [ghc-paths] include base-4.17.2.1
  3715. 417.13 s [ghc-paths] Linked component graph:
  3716. 417.13 s [ghc-paths] unit ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3717. 417.13 s [ghc-paths] include base-4.17.2.1
  3718. 417.13 s [ghc-paths] GHC.Paths=ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj:GHC.Paths
  3719. 417.13 s [ghc-paths] Ready component graph:
  3720. 417.13 s [ghc-paths] definite ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3721. 417.13 s [ghc-paths] depends base-4.17.2.1
  3722. 417.13 s [ghc-paths] Using Cabal-3.12.1.0 compiled by ghc-9.4
  3723. 417.13 s [ghc-paths] Using compiler: ghc-9.4.8
  3724. 417.13 s [ghc-paths] Using install prefix:
  3725. 417.13 s [ghc-paths] /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12
  3726. 417.13 s [ghc-paths] Executables installed in:
  3727. 417.13 s [ghc-paths] /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/bin
  3728. 417.13 s [ghc-paths] Libraries installed in:
  3729. 417.13 s [ghc-paths] /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3730. 417.13 s [ghc-paths] Dynamic Libraries installed in:
  3731. 417.13 s [ghc-paths] /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  3732. 417.13 s [ghc-paths] Private executables installed in:
  3733. 417.13 s [ghc-paths] /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/libexec/x86_64-linux-ghc-9.4.8/ghc-paths-0.1.0.12
  3734. 417.13 s [ghc-paths] Data files installed in:
  3735. 417.14 s [ghc-paths] /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/share/x86_64-linux-ghc-9.4.8/ghc-paths-0.1.0.12
  3736. 417.14 s [ghc-paths] Documentation installed in:
  3737. 417.14 s [ghc-paths] /nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12
  3738. 417.14 s [ghc-paths] Configuration files installed in:
  3739. 417.14 s [ghc-paths] /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/etc
  3740. 417.14 s [ghc-paths] No alex found
  3741. 417.14 s [ghc-paths] Using ar found on system at:
  3742. 417.14 s [ghc-paths] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  3743. 417.14 s [ghc-paths] No c2hs found
  3744. 417.14 s [ghc-paths] No cpphs found
  3745. 417.14 s [ghc-paths] No doctest found
  3746. 417.14 s [ghc-paths] Using gcc version 14.3.0 given by user at:
  3747. 417.14 s [ghc-paths] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  3748. 417.14 s [ghc-paths] Using ghc version 9.4.8 found on system at:
  3749. 417.14 s [ghc-paths] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  3750. 417.14 s [ghc-paths] Using ghc-pkg version 9.4.8 found on system at:
  3751. 417.14 s [ghc-paths] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  3752. 417.14 s [ghc-paths] No ghcjs found
  3753. 417.14 s [ghc-paths] No ghcjs-pkg found
  3754. 417.14 s [ghc-paths] No greencard found
  3755. 417.14 s [ghc-paths] Using haddock version 2.27.0 found on system at:
  3756. 417.14 s [ghc-paths] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  3757. 417.14 s [ghc-paths] No happy found
  3758. 417.14 s [ghc-paths] Using haskell-suite found on system at: haskell-suite-dummy-location
  3759. 417.14 s [ghc-paths] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3760. 417.14 s [ghc-paths] No hmake found
  3761. 417.14 s [ghc-paths] Using hpc version 0.68 found on system at:
  3762. 417.14 s [ghc-paths] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  3763. 417.14 s [ghc-paths] Using hsc2hs version 0.68.8 found on system at:
  3764. 417.14 s [ghc-paths] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  3765. 417.14 s [ghc-paths] Using hscolour version 1.25 found on system at:
  3766. 417.14 s [ghc-paths] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  3767. 417.14 s [ghc-paths] No jhc found
  3768. 417.14 s [ghc-paths] Using ld found on system at:
  3769. 417.14 s [ghc-paths] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  3770. 417.14 s [ghc-paths] No pkg-config found
  3771. 417.14 s [ghc-paths] Using runghc version 9.4.8 found on system at:
  3772. 417.14 s [ghc-paths] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  3773. 417.14 s [ghc-paths] Using strip version 2.44 found on system at:
  3774. 417.14 s [ghc-paths] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  3775. 417.14 s [ghc-paths] Using tar found on system at:
  3776. 417.14 s [ghc-paths] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  3777. 417.14 s [ghc-paths] No uhc found
  3778. 417.14 s [ghc-paths] Running: /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc --print-libdir -j16 '+RTS' -A64M -RTS -haddock
  3779. 417.18 s [ghc-paths] Phase: buildPhase
  3780. 417.23 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  3781. 417.23 s [ghc-paths] Building library for ghc-paths-0.1.0.12...
  3782. 417.31 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.o, dist/build/GHC/Paths.dyn_o )
  3783. 417.55 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.p_o )
  3784. 417.55 s [servant-server] [13 of 19] Compiling Servant.Server.UVerb
  3785. 417.63 s [servant-server] [14 of 19] Compiling Servant.Server
  3786. 417.68 s [servant-server] [15 of 19] Compiling Servant.Server.StaticFiles
  3787. 417.77 s [servant-server] [16 of 19] Compiling Servant.Server.Generic
  3788. 417.77 s [servant-server] [17 of 19] Compiling Servant
  3789. 417.79 s [servant-server] [18 of 19] Compiling Servant.Server.Experimental.Auth
  3790. 417.84 s [servant-server] [19 of 19] Compiling Servant.Utils.StaticFiles
  3791. 418.25 s [servant-server] [ 1 of 19] Compiling Servant.Server.Internal.Context
  3792. 418.36 s [ghc-paths] Phase: checkPhase
  3793. 418.37 s [ghc-paths] Package has no test suites.
  3794. 418.39 s [ghc-paths] Phase: haddockPhase
  3795. 418.48 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.p_o )
  3796. 418.51 s [servant-server] [ 2 of 19] Compiling Servant.Server.Internal.ResponseRender
  3797. 418.52 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  3798. 418.52 s [ghc-paths] Running Haddock on library for ghc-paths-0.1.0.12...
  3799. 418.65 s [ghc-paths] 0% ( 0 / 5) in 'GHC.Paths'
  3800. 418.65 s [ghc-paths] Missing documentation for:
  3801. 418.65 s [ghc-paths] Module header
  3802. 418.65 s [ghc-paths] ghc (GHC/Paths.hs:29)
  3803. 418.65 s [ghc-paths] ghc_pkg (GHC/Paths.hs:29)
  3804. 418.66 s [ghc-paths] libdir (GHC/Paths.hs:29)
  3805. 418.66 s [ghc-paths] docdir (GHC/Paths.hs:29)
  3806. 418.81 s [servant-server] [ 3 of 19] Compiling Servant.Server.Internal.ServerError
  3807. 418.81 s [servant-server] [ 4 of 19] Compiling Servant.Server.Internal.RouteResult
  3808. 419.20 s [servant-server] [ 5 of 19] Compiling Servant.Server.Internal.RoutingApplication
  3809. 419.33 s [servant-server] [ 6 of 19] Compiling Servant.Server.Internal.Handler
  3810. 419.48 s [servant-server] [ 7 of 19] Compiling Servant.Server.Internal.ErrorFormatter
  3811. 419.48 s [servant-server] [ 8 of 19] Compiling Servant.Server.Internal.Router
  3812. 419.79 s [servant-server] [ 9 of 19] Compiling Servant.Server.Internal.DelayedIO
  3813. 419.79 s [servant-server] [10 of 19] Compiling Servant.Server.Internal.Delayed
  3814. 419.80 s [servant-server] [11 of 19] Compiling Servant.Server.Internal.BasicAuth
  3815. 419.80 s [servant-server] [12 of 19] Compiling Servant.Server.Internal
  3816. 419.91 s [servant-server] src/Servant/Server/Internal.hs:1051:1: warning: [GHC-08585] [-Wmissing-methods]
  3817. 419.91 s [servant-server] • No explicit associated type or default declaration for ‘ServerT’
  3818. 419.91 s [servant-server] • In the instance declaration for ‘HasServer (ty :> sub) context’
  3819. 419.91 s [servant-server] |
  3820. 419.91 s [servant-server] 1051 | instance {-# OVERLAPPABLE #-} TypeError (NoInstanceForSub
  3821. 419.91 s [servant-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  3822. 419.91 s [servant-server]
  3823. 419.91 s [servant-server] src/Servant/Server/Internal.hs:1051:31: warning: [GHC-06201] [-Wmissing-methods]
  3824. 419.91 s [servant-server] • No explicit implementation for
  3825. 419.91 s [servant-server] ‘route’ and ‘hoistServerWithContext’
  3826. 419.91 s [servant-server] • In the instance declaration for ‘HasServer (ty :> sub) context’
  3827. 419.91 s [servant-server] |
  3828. 419.91 s [servant-server] 1051 | instance {-# OVERLAPPABLE #-} TypeError (NoInstanceForSub
  3829. 419.91 s [servant-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  3830. 419.91 s [servant-server]
  3831. 419.91 s [servant-server] src/Servant/Server/Internal.hs:1057:1: warning: [GHC-08585] [-Wmissing-methods]
  3832. 419.91 s [servant-server] • No explicit associated type or default declaration for ‘ServerT’
  3833. 419.91 s [servant-server] • In the instance declaration for ‘HasServer api context’
  3834. 419.91 s [servant-server] |
  3835. 419.91 s [servant-server] 1057 | instance {-# OVERLAPPABLE #-} TypeError (NoInstanceFor (HasServer api context)) => HasServer api context
  3836. 419.91 s [servant-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  3837. 419.91 s [servant-server]
  3838. 419.92 s [servant-server] src/Servant/Server/Internal.hs:1057:31: warning: [GHC-06201] [-Wmissing-methods]
  3839. 419.92 s [servant-server] • No explicit implementation for
  3840. 419.92 s [servant-server] ‘route’ and ‘hoistServerWithContext’
  3841. 419.92 s [servant-server] • In the instance declaration for ‘HasServer api context’
  3842. 419.92 s [servant-server] |
  3843. 419.92 s [servant-server] 1057 | instance {-# OVERLAPPABLE #-} TypeError (NoInstanceFor (HasServer api context)) => HasServer api context
  3844. 419.92 s [servant-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  3845. 419.92 s [servant-server]
  3846. 420.00 s [ghc-paths] Documentation created: dist/doc/html/ghc-paths/,
  3847. 420.00 s [ghc-paths] dist/doc/html/ghc-paths/ghc-paths.txt
  3848. 420.07 s [ghc-paths] Phase: installPhase
  3849. 420.10 s [ghc-paths] Installing library in /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3850. 420.24 s [ghc-paths] Phase: fixupPhase
  3851. 420.26 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12
  3852. 420.26 s [ghc-paths] shrinking /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj-ghc9.4.8.so
  3853. 420.26 s [ghc-paths] checking for references to /build/ in /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12...
  3854. 420.28 s [ghc-paths] patching script interpreter paths in /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12
  3855. 420.29 s [ghc-paths] stripping (with command strip and flags -S -p) in /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/lib
  3856. 420.32 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc
  3857. 420.32 s [ghc-paths] checking for references to /build/ in /nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc...
  3858. 420.33 s [ghc-paths] patching script interpreter paths in /nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc
  3859. 420.41 s [ghc-paths:post-build] Uploading to cachix cache "sellout": /nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12
  3860. 421.01 s [ghc-paths:post-build] Pushing 2 paths (37 are already present) using zstd to cache sellout ⏳
  3861. 421.01 s [ghc-paths:post-build]
  3862. 421.39 s [ghc-paths:post-build] Pushing /nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc (124.86 KiB)
  3863. 421.45 s [ghc-paths:post-build] Pushing /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12 (105.52 KiB)
  3864. 422.41 s [ghc-paths:post-build]
  3865. 422.41 s [ghc-paths:post-build] All done.
  3866. 422.43 s [ghc-paths:post-build] Uploading to the NixCI cache: /nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12
  3867. 422.47 s [ghc-paths:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3868. 422.68 s [ghc-paths:post-build] copying 2 paths...
  3869. 422.68 s [ghc-paths:post-build] copying path '/nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc' to 'https://cache.nix-ci.com'...
  3870. 422.79 s [ghc-paths:post-build] copying path '/nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12' to 'https://cache.nix-ci.com'...
  3871. 423.10 s [ghc-paths:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3872. 423.35 s [ghc-paths:post-build] copying 1 paths...
  3873. 423.35 s [ghc-paths:post-build] copying path '/nix/store/risqmps20ycp5nxc5s63nzh8bxjpa4k0-ghc-paths-0.1.0.12.drv' to 'https://cache.nix-ci.com'...
  3874. 423.59 s Progress: 23 of 46 built (2 building), 373 of 373 downloaded from cache
  3875. 423.64 s Building /nix/store/k7k1z2d30zr0ird9kl6v9cjxds6vpaws-doctest-0.24.2.drv
  3876. 423.64 s [cabal-doctest] Phase: checkPhase
  3877. 423.64 s [cabal-doctest] Package has no test suites.
  3878. 423.64 s [cabal-doctest] Phase: haddockPhase
  3879. 423.64 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12..
  3880. 423.64 s [cabal-doctest] Running Haddock on library for cabal-doctest-1.0.12..
  3881. 423.64 s [cabal-doctest] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  3882. 423.64 s [cabal-doctest] 100% ( 7 / 7) in 'Distribution.Extra.Doctest'
  3883. 423.64 s [servant-server] [13 of 19] Compiling Servant.Server.UVerb
  3884. 423.64 s [servant-server] [14 of 19] Compiling Servant.Server
  3885. 423.64 s [servant-server] [15 of 19] Compiling Servant.Server.StaticFiles
  3886. 423.64 s [servant-server] [16 of 19] Compiling Servant.Server.Generic
  3887. 423.64 s [servant-server] [17 of 19] Compiling Servant
  3888. 423.64 s [servant-server] [18 of 19] Compiling Servant.Server.Experimental.Auth
  3889. 423.64 s [servant-server] [19 of 19] Compiling Servant.Utils.StaticFiles
  3890. 423.77 s [doctest] Phase: setupCompilerEnvironmentPhase
  3891. 423.81 s [doctest] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  3892. 424.09 s [doctest] Phase: unpackPhase
  3893. 424.10 s [doctest] unpacking source archive /nix/store/bhl15ifbap4vkm5qbpgwa3svq4yanr2l-doctest-0.24.2.tar.gz
  3894. 424.11 s [doctest] source root is doctest-0.24.2
  3895. 424.12 s [doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "doctest-0.24.2/test/UtilSpec.hs"
  3896. 424.12 s [doctest] Phase: patchPhase
  3897. 424.13 s [doctest] Phase: compileBuildDriverPhase
  3898. 424.13 s [doctest] setupCompileFlags: -package-db=/build/tmp.81Ul77UobL/setup-package.conf.d -threaded
  3899. 424.18 s [doctest] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.81Ul77UobL/Main.o )
  3900. 424.23 s [doctest] [2 of 2] Linking Setup
  3901. 424.82 s [servant-server] Preprocessing test suite 'spec' for servant-server-0.20.3.0...
  3902. 424.89 s [servant-server] Building test suite 'spec' for servant-server-0.20.3.0...
  3903. 424.95 s [servant-server] [ 1 of 12] Compiling Servant.ArbitraryMonadServerSpec
  3904. 425.57 s [servant-server] [ 2 of 12] Compiling Servant.HoistSpec
  3905. 425.57 s [servant-server] [ 3 of 12] Compiling Servant.Server.ErrorSpec
  3906. 425.60 s [doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  3907. 425.62 s [doctest] Phase: configurePhase
  3908. 425.62 s [doctest] configureFlags: --verbose --prefix=/nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc/share/doc/doctest-0.24.2 --with-gcc=gcc --package-db=/build/tmp.81Ul77UobL/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/lib
  3909. 425.66 s [cabal-doctest] Documentation created: dist/doc/html/cabal-doctest/index.html,
  3910. 425.66 s [cabal-doctest] dist/doc/html/cabal-doctest/cabal-doctest.txt
  3911. 425.74 s [cabal-doctest] Phase: installPhase
  3912. 425.77 s [cabal-doctest] Installing library in /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/cabal-doctest-1.0.12-7IOee4d8EeSYFTisSbXWK
  3913. 425.94 s [cabal-doctest] Phase: fixupPhase
  3914. 425.96 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12
  3915. 425.96 s [cabal-doctest] shrinking /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHScabal-doctest-1.0.12-7IOee4d8EeSYFTisSbXWK-ghc9.4.8.so
  3916. 425.97 s [cabal-doctest] checking for references to /build/ in /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12...
  3917. 425.98 s [cabal-doctest] patching script interpreter paths in /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12
  3918. 425.99 s [cabal-doctest] stripping (with command strip and flags -S -p) in /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/lib
  3919. 426.02 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc
  3920. 426.03 s [cabal-doctest] checking for references to /build/ in /nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc...
  3921. 426.04 s [cabal-doctest] patching script interpreter paths in /nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc
  3922. 426.14 s [cabal-doctest:post-build] Uploading to cachix cache "sellout": /nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12
  3923. 426.73 s [cabal-doctest:post-build] Pushing 2 paths (41 are already present) using zstd to cache sellout ⏳
  3924. 426.73 s [cabal-doctest:post-build]
  3925. 427.09 s [cabal-doctest:post-build] Pushing /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12 (806.55 KiB)
  3926. 427.27 s [cabal-doctest:post-build] Pushing /nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc (424.73 KiB)
  3927. 428.23 s [cabal-doctest:post-build]
  3928. 428.23 s [cabal-doctest:post-build] All done.
  3929. 428.25 s [cabal-doctest:post-build] Uploading to the NixCI cache: /nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12
  3930. 428.31 s [cabal-doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3931. 428.33 s [cabal-doctest:post-build] copying 2 paths...
  3932. 428.33 s [cabal-doctest:post-build] copying path '/nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc' to 'https://cache.nix-ci.com'...
  3933. 428.74 s [cabal-doctest:post-build] copying path '/nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12' to 'https://cache.nix-ci.com'...
  3934. 429.31 s [cabal-doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3935. 429.55 s [cabal-doctest:post-build] copying 1 paths...
  3936. 429.55 s [cabal-doctest:post-build] copying path '/nix/store/y3rib6pk5hkwq1qfwyrjdr0dk5mw6a73-cabal-doctest-1.0.12.drv' to 'https://cache.nix-ci.com'...
  3937. 429.82 s Progress: 24 of 46 built (2 building), 373 of 373 downloaded from cache
  3938. 429.82 s [doctest] Using Parsec parser
  3939. 429.82 s [doctest] Configuring doctest-0.24.2...
  3940. 429.87 s [doctest] Flags chosen: cabal-doctest=False
  3941. 429.87 s [doctest] Dependency base >=4.12 && <5: using base-4.17.2.1
  3942. 429.87 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  3943. 429.87 s [doctest] Dependency containers: using containers-0.6.7
  3944. 429.87 s [doctest] Dependency deepseq: using deepseq-1.4.8.0
  3945. 429.87 s [doctest] Dependency directory: using directory-1.3.7.1
  3946. 429.87 s [doctest] Dependency exceptions: using exceptions-0.10.5
  3947. 429.87 s [doctest] Dependency filepath: using filepath-1.4.2.2
  3948. 429.87 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.4.8
  3949. 429.87 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  3950. 429.87 s [doctest] Dependency process: using process-1.6.18.0
  3951. 429.87 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  3952. 429.87 s [doctest] Dependency temporary: using temporary-1.3
  3953. 429.87 s [doctest] Dependency transformers: using transformers-0.5.6.2
  3954. 429.87 s [doctest] Dependency base >=4.12 && <5: using base-4.17.2.1
  3955. 429.87 s [doctest] Dependency doctest: using doctest-0.24.2
  3956. 429.87 s [doctest] Dependency HUnit: using HUnit-1.6.2.0
  3957. 429.87 s [doctest] Dependency QuickCheck >=2.13.1: using QuickCheck-2.15.0.1
  3958. 429.87 s [doctest] Dependency base >=4.12 && <5: using base-4.17.2.1
  3959. 429.87 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  3960. 429.87 s [doctest] Dependency containers: using containers-0.6.7
  3961. 429.87 s [doctest] Dependency deepseq: using deepseq-1.4.8.0
  3962. 429.87 s [doctest] Dependency directory: using directory-1.3.7.1
  3963. 429.87 s [doctest] Dependency exceptions: using exceptions-0.10.5
  3964. 429.87 s [doctest] Dependency filepath: using filepath-1.4.2.2
  3965. 429.87 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.4.8
  3966. 429.87 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  3967. 429.87 s [doctest] Dependency hspec >=2.3.0: using hspec-2.11.14
  3968. 429.87 s [doctest] Dependency hspec-core >=2.3.0: using hspec-core-2.11.14
  3969. 429.87 s [doctest] Dependency mockery: using mockery-0.3.5
  3970. 429.87 s [doctest] Dependency process: using process-1.6.18.0
  3971. 429.87 s [doctest] Dependency silently >=1.2.4: using silently-1.2.5.4
  3972. 429.87 s [doctest] Dependency stringbuilder >=0.4: using stringbuilder-0.5.1
  3973. 429.87 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  3974. 429.87 s [doctest] Dependency temporary: using temporary-1.3
  3975. 429.87 s [doctest] Dependency transformers: using transformers-0.5.6.2
  3976. 429.87 s [doctest] Source component graph:
  3977. 429.87 s [doctest] component test:spec
  3978. 429.87 s [doctest] component lib
  3979. 429.87 s [doctest] component exe:doctest dependency lib
  3980. 429.87 s [doctest] Configured component graph:
  3981. 429.87 s [doctest] component doctest-0.24.2-8B2S5OYPA9mBub9KxF3tOS-spec
  3982. 429.87 s [doctest] include HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  3983. 429.87 s [doctest] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  3984. 429.87 s [doctest] include base-4.17.2.1
  3985. 429.87 s [doctest] include code-page-0.2.1-LeQPy5FeQvS92HSQRBnpzj
  3986. 429.87 s [doctest] include containers-0.6.7
  3987. 429.87 s [doctest] include deepseq-1.4.8.0
  3988. 429.87 s [doctest] include directory-1.3.7.1
  3989. 429.87 s [doctest] include exceptions-0.10.5
  3990. 429.87 s [doctest] include filepath-1.4.2.2
  3991. 429.87 s [doctest] include ghc-9.4.8
  3992. 429.87 s [doctest] include ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3993. 429.87 s [doctest] include hspec-2.11.14-8PnEgFFxGXWcarqEvNWao
  3994. 429.87 s [doctest] include hspec-core-2.11.14-44JEUBQaBV8AsFck3fmlPx
  3995. 429.87 s [doctest] include mockery-0.3.5-87RIIY0h7q6HGiqZ0yQPlW
  3996. 429.87 s [doctest] include process-1.6.18.0
  3997. 429.87 s [doctest] include silently-1.2.5.4-6fxu1qBymv4CrCGqkpMTl5
  3998. 429.87 s [doctest] include stringbuilder-0.5.1-AisLcFSgoYA5h5XBEGd9QP
  3999. 429.87 s [doctest] include syb-0.7.2.4-7xddrprlBP2BU3qzFjb3KS
  4000. 429.87 s [doctest] include temporary-1.3-GGW3bDEdunp7TUxZ1ZaiZc
  4001. 429.87 s [doctest] include transformers-0.5.6.2
  4002. 429.87 s [doctest] component doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4003. 429.87 s [doctest] include base-4.17.2.1
  4004. 429.87 s [doctest] include code-page-0.2.1-LeQPy5FeQvS92HSQRBnpzj
  4005. 429.87 s [doctest] include containers-0.6.7
  4006. 429.87 s [doctest] include deepseq-1.4.8.0
  4007. 429.87 s [doctest] include directory-1.3.7.1
  4008. 429.87 s [doctest] include exceptions-0.10.5
  4009. 429.87 s [doctest] include filepath-1.4.2.2
  4010. 429.87 s [doctest] include ghc-9.4.8
  4011. 429.87 s [doctest] include ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  4012. 429.87 s [doctest] include process-1.6.18.0
  4013. 429.87 s [doctest] include syb-0.7.2.4-7xddrprlBP2BU3qzFjb3KS
  4014. 429.87 s [doctest] include temporary-1.3-GGW3bDEdunp7TUxZ1ZaiZc
  4015. 429.87 s [doctest] include transformers-0.5.6.2
  4016. 429.87 s [doctest] component doctest-0.24.2-EWumxpWJwNOEH8LULfU4wU-doctest
  4017. 429.87 s [doctest] include base-4.17.2.1
  4018. 429.87 s [doctest] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4019. 429.87 s [doctest] Linked component graph:
  4020. 429.87 s [doctest] unit doctest-0.24.2-8B2S5OYPA9mBub9KxF3tOS-spec
  4021. 429.87 s [doctest] include HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  4022. 429.87 s [doctest] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  4023. 429.87 s [doctest] include base-4.17.2.1
  4024. 429.87 s [doctest] include code-page-0.2.1-LeQPy5FeQvS92HSQRBnpzj
  4025. 429.87 s [doctest] include containers-0.6.7
  4026. 429.87 s [doctest] include deepseq-1.4.8.0
  4027. 429.87 s [doctest] include directory-1.3.7.1
  4028. 429.87 s [doctest] include exceptions-0.10.5
  4029. 429.87 s [doctest] include filepath-1.4.2.2
  4030. 429.87 s [doctest] include ghc-9.4.8
  4031. 429.87 s [doctest] include ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  4032. 429.87 s [servant-server] [ 4 of 12] Compiling Servant.Server.Internal.ContextSpec
  4033. 429.87 s [servant-server] [ 5 of 12] Compiling Servant.Server.Internal.RoutingApplicationSpec
  4034. 429.87 s [servant-server] [ 6 of 12] Compiling Servant.Server.RouterSpec
  4035. 429.87 s [servant-server] [ 7 of 12] Compiling Servant.Server.StreamingSpec
  4036. 429.87 s [servant-server] test/Servant/Server/StreamingSpec.hs:62:11: warning: [GHC-68441] [-Wdeprecations]
  4037. 429.87 s [servant-server] In the use of record field of Request ‘requestBody’
  4038. 429.87 s [servant-server] (imported from Network.Wai.Internal):
  4039. 429.87 s [servant-server] Deprecated: "requestBody's name is misleading because it only gets a partial chunk of the body. Use getRequestBodyChunk instead when getting the field, and setRequestBodyChunks when setting the field."
  4040. 429.87 s [servant-server] |
  4041. 429.87 s [servant-server] 62 | requestBody = streamTestData,
  4042. 429.87 s [servant-server] | ^^^^^^^^^^^
  4043. 429.87 s [servant-server]
  4044. 429.87 s [servant-server] [ 8 of 12] Compiling Servant.Server.UsingContextSpec.TestCombinators
  4045. 429.87 s [servant-server] [ 9 of 12] Compiling Servant.Server.UsingContextSpec
  4046. 429.87 s [servant-server] [10 of 12] Compiling Servant.ServerSpec
  4047. 429.87 s [servant-server] test/Servant/ServerSpec.hs:277:8: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  4048. 429.87 s [servant-server] Pattern match(es) are non-exhaustive
  4049. 429.87 s [servant-server] In a lambda abstraction:
  4050. 429.87 s [servant-server] Patterns of type ‘[Char]’ not matched:
  4051. 429.87 s [servant-server] []
  4052. 429.87 s [servant-server] (p:_) where p is not one of {'c'}
  4053. 429.87 s [servant-server] ['c']
  4054. 429.87 s [servant-server] ('c':p:_) where p is not one of {'a'}
  4055. 429.87 s [servant-server] ...
  4056. 429.87 s [servant-server] |
  4057. 429.87 s [servant-server] 277 | (\ "captured" -> Tagged $ \request_ sendResponse ->
  4058. 429.87 s [servant-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  4059. 429.87 s [servant-server]
  4060. 429.87 s [servant-server] test/Servant/ServerSpec.hs:908:1: warning: [GHC-90177] [-Worphans]
  4061. 429.87 s [servant-server] Orphan family instance:
  4062. 429.87 s [servant-server] type instance AuthServerData (AuthProtect "auth") = ()
  4063. 429.87 s [servant-server] -- Defined at test/Servant/ServerSpec.hs:908:15
  4064. 429.87 s [servant-server] Suggested fix:
  4065. 429.87 s [servant-server] Move the instance declaration to the module of the type family or of the type, or
  4066. 429.87 s [servant-server] wrap the type with a newtype and declare the instance on the new type.
  4067. 429.87 s [servant-server] |
  4068. 429.87 s [servant-server] 908 | type instance AuthServerData (AuthProtect "auth") = ()
  4069. 429.87 s [servant-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4070. 429.87 s [servant-server]
  4071. 429.87 s [doctest] include hspec-2.11.14-8PnEgFFxGXWcarqEvNWao
  4072. 429.87 s [doctest] include hspec-core-2.11.14-44JEUBQaBV8AsFck3fmlPx
  4073. 429.87 s [doctest] include mockery-0.3.5-87RIIY0h7q6HGiqZ0yQPlW
  4074. 429.87 s [doctest] include process-1.6.18.0
  4075. 429.87 s [doctest] include silently-1.2.5.4-6fxu1qBymv4CrCGqkpMTl5
  4076. 429.87 s [doctest] include stringbuilder-0.5.1-AisLcFSgoYA5h5XBEGd9QP
  4077. 429.87 s [doctest] include syb-0.7.2.4-7xddrprlBP2BU3qzFjb3KS
  4078. 429.87 s [doctest] include temporary-1.3-GGW3bDEdunp7TUxZ1ZaiZc
  4079. 429.87 s [doctest] include transformers-0.5.6.2
  4080. 429.87 s [doctest] unit doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4081. 429.87 s [doctest] include base-4.17.2.1
  4082. 429.87 s [doctest] include code-page-0.2.1-LeQPy5FeQvS92HSQRBnpzj
  4083. 429.87 s [doctest] include containers-0.6.7
  4084. 429.87 s [doctest] include deepseq-1.4.8.0
  4085. 429.87 s [doctest] include directory-1.3.7.1
  4086. 429.87 s [doctest] include exceptions-0.10.5
  4087. 429.87 s [doctest] include filepath-1.4.2.2
  4088. 429.87 s [doctest] include ghc-9.4.8
  4089. 429.87 s [doctest] include ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  4090. 429.87 s [doctest] include process-1.6.18.0
  4091. 429.87 s [doctest] include syb-0.7.2.4-7xddrprlBP2BU3qzFjb3KS
  4092. 429.87 s [doctest] include temporary-1.3-GGW3bDEdunp7TUxZ1ZaiZc
  4093. 429.87 s [doctest] include transformers-0.5.6.2
  4094. 429.87 s [doctest] Test.DocTest=doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88:Test.DocTest,Test.DocTest.Internal.Cabal=doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88:Test.DocTest.Internal.Cabal,Test.DocTest.Internal.Extract=doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88:Test.DocTest.Internal.Extract,Test.DocTest.Internal.Location=doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88:Test.DocTest.Internal.Location,Test.DocTest.Internal.Parse=doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88:Test.DocTest.Internal.Parse,Test.DocTest.Internal.Run=doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88:Test.DocTest.Internal.Run
  4095. 429.87 s [doctest] unit doctest-0.24.2-EWumxpWJwNOEH8LULfU4wU-doctest
  4096. 429.87 s [doctest] include base-4.17.2.1
  4097. 429.87 s [doctest] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4098. 429.87 s [doctest] Ready component graph:
  4099. 429.87 s [doctest] definite doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4100. 429.87 s [doctest] depends base-4.17.2.1
  4101. 429.87 s [doctest] depends code-page-0.2.1-LeQPy5FeQvS92HSQRBnpzj
  4102. 429.87 s [doctest] depends containers-0.6.7
  4103. 429.87 s [doctest] depends deepseq-1.4.8.0
  4104. 429.87 s [doctest] depends directory-1.3.7.1
  4105. 429.87 s [doctest] depends exceptions-0.10.5
  4106. 429.87 s [doctest] depends filepath-1.4.2.2
  4107. 429.87 s [doctest] depends ghc-9.4.8
  4108. 429.87 s [doctest] depends ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  4109. 429.87 s [doctest] depends process-1.6.18.0
  4110. 429.87 s [doctest] depends syb-0.7.2.4-7xddrprlBP2BU3qzFjb3KS
  4111. 429.87 s [doctest] depends temporary-1.3-GGW3bDEdunp7TUxZ1ZaiZc
  4112. 429.87 s [doctest] depends transformers-0.5.6.2
  4113. 429.87 s [doctest] definite doctest-0.24.2-EWumxpWJwNOEH8LULfU4wU-doctest
  4114. 429.87 s [doctest] depends base-4.17.2.1
  4115. 429.87 s [doctest] depends doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4116. 429.87 s [doctest] definite doctest-0.24.2-8B2S5OYPA9mBub9KxF3tOS-spec
  4117. 429.87 s [doctest] depends HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  4118. 429.87 s [doctest] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  4119. 429.87 s [doctest] depends base-4.17.2.1
  4120. 429.87 s [doctest] depends code-page-0.2.1-LeQPy5FeQvS92HSQRBnpzj
  4121. 429.87 s [doctest] depends containers-0.6.7
  4122. 429.87 s [doctest] depends deepseq-1.4.8.0
  4123. 429.87 s [doctest] depends directory-1.3.7.1
  4124. 429.87 s [doctest] depends exceptions-0.10.5
  4125. 429.87 s [doctest] depends filepath-1.4.2.2
  4126. 429.87 s [doctest] depends ghc-9.4.8
  4127. 429.87 s [doctest] depends ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  4128. 429.87 s [doctest] depends hspec-2.11.14-8PnEgFFxGXWcarqEvNWao
  4129. 429.87 s [doctest] depends hspec-core-2.11.14-44JEUBQaBV8AsFck3fmlPx
  4130. 429.87 s [doctest] depends mockery-0.3.5-87RIIY0h7q6HGiqZ0yQPlW
  4131. 429.87 s [doctest] depends process-1.6.18.0
  4132. 429.87 s [doctest] depends silently-1.2.5.4-6fxu1qBymv4CrCGqkpMTl5
  4133. 429.87 s [doctest] depends stringbuilder-0.5.1-AisLcFSgoYA5h5XBEGd9QP
  4134. 429.87 s [doctest] depends syb-0.7.2.4-7xddrprlBP2BU3qzFjb3KS
  4135. 429.87 s [doctest] depends temporary-1.3-GGW3bDEdunp7TUxZ1ZaiZc
  4136. 429.88 s [doctest] depends transformers-0.5.6.2
  4137. 429.88 s [doctest] Using Cabal-3.8.1.0 compiled by ghc-9.4
  4138. 429.88 s [doctest] Using compiler: ghc-9.4.8
  4139. 429.88 s [doctest] Using install prefix:
  4140. 429.88 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2
  4141. 429.88 s [doctest] Executables installed in:
  4142. 429.88 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin
  4143. 429.88 s [doctest] Libraries installed in:
  4144. 429.88 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4145. 429.88 s [doctest] Dynamic Libraries installed in:
  4146. 429.88 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  4147. 429.88 s [doctest] Private executables installed in:
  4148. 429.88 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/libexec/x86_64-linux-ghc-9.4.8/doctest-0.24.2
  4149. 429.88 s [doctest] Data files installed in:
  4150. 429.88 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/share/x86_64-linux-ghc-9.4.8/doctest-0.24.2
  4151. 429.88 s [doctest] Documentation installed in:
  4152. 429.88 s [doctest] /nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc/share/doc/doctest-0.24.2
  4153. 429.88 s [doctest] Configuration files installed in:
  4154. 429.88 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/etc
  4155. 429.88 s [doctest] No alex found
  4156. 429.88 s [doctest] Using ar found on system at:
  4157. 429.88 s [doctest] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  4158. 429.88 s [doctest] No c2hs found
  4159. 429.88 s [doctest] No cpphs found
  4160. 429.88 s [doctest] No doctest found
  4161. 429.88 s [doctest] Using gcc version 14.3.0 given by user at:
  4162. 429.88 s [doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  4163. 429.88 s [doctest] Using ghc version 9.4.8 found on system at:
  4164. 429.88 s [doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  4165. 429.88 s [doctest] Using ghc-pkg version 9.4.8 found on system at:
  4166. 429.88 s [doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  4167. 429.88 s [doctest] No ghcjs found
  4168. 429.88 s [doctest] No ghcjs-pkg found
  4169. 429.88 s [doctest] No greencard found
  4170. 429.88 s [doctest] Using haddock version 2.27.0 found on system at:
  4171. 429.88 s [doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  4172. 429.88 s [doctest] No happy found
  4173. 429.88 s [doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  4174. 429.88 s [doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  4175. 429.88 s [doctest] No hmake found
  4176. 429.88 s [doctest] Using hpc version 0.68 found on system at:
  4177. 429.88 s [doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  4178. 429.88 s [doctest] Using hsc2hs version 0.68.8 found on system at:
  4179. 429.88 s [doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  4180. 429.88 s [doctest] Using hscolour version 1.25 found on system at:
  4181. 429.88 s [doctest] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  4182. 429.88 s [doctest] No jhc found
  4183. 429.88 s [doctest] Using ld found on system at:
  4184. 429.88 s [doctest] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  4185. 429.88 s [doctest] No pkg-config found
  4186. 429.88 s [doctest] Using runghc version 9.4.8 found on system at:
  4187. 429.88 s [doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  4188. 429.88 s [doctest] Using strip version 2.44 found on system at:
  4189. 429.88 s [doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  4190. 429.88 s [doctest] Using tar found on system at:
  4191. 429.88 s [doctest] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  4192. 429.88 s [doctest] No uhc found
  4193. 429.88 s [doctest] Phase: buildPhase
  4194. 429.88 s [doctest] Preprocessing library for doctest-0.24.2..
  4195. 429.88 s [doctest] Building library for doctest-0.24.2..
  4196. 429.88 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.o, dist/build/Imports.dyn_o )
  4197. 429.88 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.o, dist/build/GhcUtil.dyn_o )
  4198. 429.88 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.o, dist/build/Cabal/ReplOptions.dyn_o )
  4199. 429.88 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.o, dist/build/Cabal/Paths.dyn_o )
  4200. 429.88 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.o, dist/build/Cabal/Options.dyn_o )
  4201. 429.88 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.o, dist/build/Language/Haskell/GhciWrapper.dyn_o )
  4202. 429.88 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.o, dist/build/Interpreter.dyn_o )
  4203. 429.88 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.o, dist/build/Location.dyn_o )
  4204. 429.88 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.o, dist/build/PackageDBs.dyn_o )
  4205. 429.88 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.o, dist/build/Paths_doctest.dyn_o )
  4206. 429.88 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.o, dist/build/Info.dyn_o )
  4207. 429.88 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.o, dist/build/Options.dyn_o )
  4208. 429.88 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.o, dist/build/Cabal.dyn_o )
  4209. 429.88 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.o, dist/build/Test/DocTest/Internal/Cabal.dyn_o )
  4210. 429.88 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.o, dist/build/Test/DocTest/Internal/Location.dyn_o )
  4211. 429.88 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.o, dist/build/Util.dyn_o )
  4212. 429.88 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.o, dist/build/Extract.dyn_o )
  4213. 429.88 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.o, dist/build/Test/DocTest/Internal/Extract.dyn_o )
  4214. 429.88 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.o, dist/build/Parse.dyn_o )
  4215. 429.88 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.o, dist/build/Test/DocTest/Internal/Parse.dyn_o )
  4216. 429.88 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.o, dist/build/Runner/Example.dyn_o )
  4217. 429.88 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.o, dist/build/Property.dyn_o )
  4218. 429.88 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.o, dist/build/Runner.dyn_o )
  4219. 429.88 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.o, dist/build/Run.dyn_o )
  4220. 429.88 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.o, dist/build/Test/DocTest/Internal/Run.dyn_o )
  4221. 429.88 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.o, dist/build/Test/DocTest.dyn_o )
  4222. 430.18 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.p_o )
  4223. 430.35 s [servant-server] [11 of 12] Compiling Servant.Server.StaticFilesSpec
  4224. 430.35 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.p_o )
  4225. 430.49 s [servant-server] [12 of 12] Compiling Main
  4226. 431.06 s [servant-server] [13 of 13] Linking dist/build/spec/spec
  4227. 431.14 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.p_o )
  4228. 431.22 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.p_o )
  4229. 431.22 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.p_o )
  4230. 431.44 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.p_o )
  4231. 431.44 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.p_o )
  4232. 431.44 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.p_o )
  4233. 431.44 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.p_o )
  4234. 431.44 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.p_o )
  4235. 431.44 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.p_o )
  4236. 431.44 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.p_o )
  4237. 431.66 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.p_o )
  4238. 431.68 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.p_o )
  4239. 431.80 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.p_o )
  4240. 431.80 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.p_o )
  4241. 431.80 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.p_o )
  4242. 431.80 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.p_o )
  4243. 431.81 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.p_o )
  4244. 432.02 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.p_o )
  4245. 432.15 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.p_o )
  4246. 432.38 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.p_o )
  4247. 432.38 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.p_o )
  4248. 432.74 s [servant-server] Preprocessing executable 'greet' for servant-server-0.20.3.0...
  4249. 432.74 s [servant-server] Building executable 'greet' for servant-server-0.20.3.0...
  4250. 432.81 s [servant-server] [1 of 1] Compiling Main
  4251. 432.83 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.p_o )
  4252. 433.04 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.p_o )
  4253. 433.16 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.p_o )
  4254. 433.90 s [servant-server] [2 of 2] Linking dist/build/greet/greet
  4255. 435.29 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2..
  4256. 435.29 s [doctest] Building executable 'doctest' for doctest-0.24.2..
  4257. 435.39 s [servant-server] Phase: checkPhase
  4258. 435.39 s [doctest] [1 of 2] Compiling Main ( driver/doctest.hs, dist/build/doctest/doctest-tmp/Main.o )
  4259. 435.48 s [doctest] [2 of 2] Compiling Paths_doctest ( dist/build/doctest/autogen/Paths_doctest.hs, dist/build/doctest/doctest-tmp/Paths_doctest.o )
  4260. 435.63 s [doctest] [3 of 3] Linking dist/build/doctest/doctest
  4261. 435.70 s [servant-server] Running 1 test suites...
  4262. 435.70 s [servant-server] Test suite spec: RUNNING...
  4263. 435.71 s [servant-server]
  4264. 435.71 s [servant-server] Servant.ArbitraryMonadServer
  4265. 435.71 s [servant-server] Arbitrary monad server
  4266. 435.71 s [servant-server] Enter
  4267. 435.71 s [servant-server] allows running arbitrary monads [✔]
  4268. 435.71 s [servant-server] allows combnation of enters [✔]
  4269. 435.71 s [servant-server] Servant.Server
  4270. 435.71 s [servant-server] Servant.API.Verb
  4271. 435.71 s [servant-server] GET 200
  4272. 435.71 s [servant-server] returns the person [✔]
  4273. 435.71 s [servant-server] returns no content on NoContent [✔]
  4274. 435.71 s [servant-server] throws 405 on wrong method [✔]
  4275. 435.71 s [servant-server] returns headers [✔]
  4276. 435.71 s [servant-server] handles trailing '/' gracefully [✔]
  4277. 435.71 s [servant-server] returns 406 if the Accept header is not supported [✔]
  4278. 435.71 s [servant-server] responds if the Accept header is supported [✔]
  4279. 435.71 s [servant-server] allows modular specification of supported content types [✔]
  4280. 435.71 s [servant-server] sets the Content-Type header [✔]
  4281. 435.71 s [servant-server] works for Stream as for Result [✔]
  4282. 435.71 s [servant-server] POST 210
  4283. 435.71 s [servant-server] returns the person [✔]
  4284. 435.71 s [servant-server] returns no content on NoContent [✔]
  4285. 435.71 s [servant-server] throws 405 on wrong method [✔]
  4286. 435.71 s [servant-server] returns headers [✔]
  4287. 435.71 s [servant-server] handles trailing '/' gracefully [✔]
  4288. 435.71 s [servant-server] returns 406 if the Accept header is not supported [✔]
  4289. 435.71 s [servant-server] responds if the Accept header is supported [✔]
  4290. 435.71 s [servant-server] allows modular specification of supported content types [✔]
  4291. 435.71 s [servant-server] sets the Content-Type header [✔]
  4292. 435.71 s [servant-server] works for Stream as for Result [✔]
  4293. 435.71 s [servant-server] PUT 203
  4294. 435.71 s [servant-server] returns the person [✔]
  4295. 435.71 s [servant-server] returns no content on NoContent [✔]
  4296. 435.71 s [servant-server] throws 405 on wrong method [✔]
  4297. 435.71 s [servant-server] returns headers [✔]
  4298. 435.71 s [servant-server] handles trailing '/' gracefully [✔]
  4299. 435.71 s [servant-server] returns 406 if the Accept header is not supported [✔]
  4300. 435.71 s [servant-server] responds if the Accept header is supported [✔]
  4301. 435.71 s [servant-server] allows modular specification of supported content types [✔]
  4302. 435.71 s [servant-server] sets the Content-Type header [✔]
  4303. 435.71 s [servant-server] works for Stream as for Result [✔]
  4304. 435.71 s [servant-server] DELETE 280
  4305. 435.71 s [servant-server] returns the person [✔]
  4306. 435.71 s [servant-server] returns no content on NoContent [✔]
  4307. 435.71 s [servant-server] throws 405 on wrong method [✔]
  4308. 435.71 s [servant-server] returns headers [✔]
  4309. 435.71 s [servant-server] handles trailing '/' gracefully [✔]
  4310. 435.71 s [servant-server] returns 406 if the Accept header is not supported [✔]
  4311. 435.71 s [servant-server] responds if the Accept header is supported [✔]
  4312. 435.71 s [servant-server] allows modular specification of supported content types [✔]
  4313. 435.71 s [servant-server] sets the Content-Type header [✔]
  4314. 435.71 s [servant-server] works for Stream as for Result [✔]
  4315. 435.71 s [servant-server] PATCH 214
  4316. 435.71 s [servant-server] returns no content on NoContent [✔]
  4317. 435.71 s [servant-server] throws 405 on wrong method [✔]
  4318. 435.71 s [servant-server] returns headers [✔]
  4319. 435.71 s [servant-server] handles trailing '/' gracefully [✔]
  4320. 435.71 s [servant-server] returns 406 if the Accept header is not supported [✔]
  4321. 435.71 s [servant-server] responds if the Accept header is supported [✔]
  4322. 435.71 s [servant-server] sets the Content-Type header [✔]
  4323. 435.71 s [servant-server] works for Stream as for Result [✔]
  4324. 435.71 s [servant-server] GET 200 with HEAD
  4325. 435.71 s [servant-server] returns no content on NoContent [✔]
  4326. 435.71 s [servant-server] HEAD returns no content body [✔]
  4327. 435.71 s [servant-server] throws 405 on wrong method [✔]
  4328. 435.71 s [servant-server] returns headers [✔]
  4329. 435.71 s [servant-server] handles trailing '/' gracefully [✔]
  4330. 435.71 s [servant-server] returns 406 if the Accept header is not supported [✔]
  4331. 435.71 s [servant-server] responds if the Accept header is supported [✔]
  4332. 435.71 s [servant-server] sets the Content-Type header [✔]
  4333. 435.71 s [servant-server] works for Stream as for Result [✔]
  4334. 435.71 s [servant-server] Servant.API.UVerb
  4335. 435.71 s [servant-server] A route returning either 301/String or 200/Person
  4336. 435.71 s [servant-server] when requesting the person
  4337. 435.71 s [servant-server] returns status 200 [✔]
  4338. 435.71 s [servant-server] returns a person [✔]
  4339. 435.71 s [servant-server] requesting the redirect
  4340. 435.71 s [servant-server] returns a message and status 301 [✔]
  4341. 435.71 s [servant-server] a route with a single response type
  4342. 435.71 s [servant-server] should return the defined status code [✔]
  4343. 435.71 s [servant-server] should return the expected response [✔]
  4344. 435.71 s [servant-server] Servant.API.Capture
  4345. 435.71 s [servant-server] can capture parts of the 'pathInfo' [✔]
  4346. 435.71 s [servant-server] returns 400 if the decoding fails [✔]
  4347. 435.71 s [servant-server] returns an animal if eyes or ears are 2 [✔]
  4348. 435.71 s [servant-server] returns a weird animal on Lenient Capture [✔]
  4349. 435.71 s [servant-server] returns 400 if parsing integer fails on Strict Capture [✔]
  4350. 435.71 s [servant-server] strips the captured path snippet from pathInfo [✔]
  4351. 435.71 s [servant-server] Servant.API.CaptureAll
  4352. 435.71 s [servant-server] can capture a single element of the 'pathInfo' [✔]
  4353. 435.71 s [servant-server] can capture multiple elements of the 'pathInfo' [✔]
  4354. 435.71 s [servant-server] can capture arbitrarily many elements of the 'pathInfo' [✔]
  4355. 435.71 s [servant-server] can capture when there are no elements in 'pathInfo' [✔]
  4356. 435.71 s [servant-server] returns 400 if the decoding fails [✔]
  4357. 435.71 s [servant-server] returns 400 if the decoding fails, regardless of which element [✔]
  4358. 435.71 s [servant-server] returns 400 if the decoding fails, even when it's multiple elements [✔]
  4359. 435.71 s [servant-server] can capture single String [✔]
  4360. 435.71 s [servant-server] can capture when there are no elements in 'pathinfo' [✔]
  4361. 435.71 s [servant-server] can capture empty string from captureall [✔]
  4362. 435.71 s [servant-server] can capture empty rooted capture all [✔]
  4363. 435.71 s [servant-server] can capture empty string from rooted capture all [✔]
  4364. 435.72 s [servant-server] consumes everything from pathInfo [✔]
  4365. 435.72 s [servant-server] Servant.API.QueryParam
  4366. 435.72 s [servant-server] allows retrieving simple GET parameters [✔]
  4367. 435.72 s [servant-server] allows retrieving lists in GET parameters [✔]
  4368. 435.72 s [servant-server] parses a query parameter [✔]
  4369. 435.72 s [servant-server] generates an error on query parameter parse failure [✔]
  4370. 435.72 s [servant-server] parses multiple query parameters [✔]
  4371. 435.72 s [servant-server] generates an error on parse failures of multiple parameters [✔]
  4372. 435.72 s [servant-server] allows retrieving value-less GET parameters [✔]
  4373. 435.72 s [servant-server] allows retrieving a full query string [✔]
  4374. 435.72 s [servant-server] allows retrieving a query string deep object [✔]
  4375. 435.72 s [servant-server] Uses queryString instead of rawQueryString
  4376. 435.72 s [servant-server] allows rewriting for simple GET/query parameters [✔]
  4377. 435.72 s [servant-server] allows rewriting for lists in GET parameters [✔]
  4378. 435.72 s [servant-server] allows rewriting when parsing multiple query parameters [✔]
  4379. 435.72 s [servant-server] allows retrieving value-less GET parameters [✔]
  4380. 435.72 s [servant-server] Servant.API.Fragment
  4381. 435.72 s [servant-server] ignores fragment even if it is present in query [✔]
  4382. 435.72 s [servant-server] Servant.API.ReqBody
  4383. 435.72 s [servant-server] passes the argument to the handler [✔]
  4384. 435.72 s [servant-server] rejects invalid request bodies with status 400 [✔]
  4385. 435.72 s [servant-server] responds with 415 if the request body media type is unsupported [✔]
  4386. 435.72 s [servant-server] Servant.API.Header
  4387. 435.72 s [servant-server] passes the header to the handler (Int) [✔]
  4388. 435.72 s [servant-server] passes the header to the handler (String) [✔]
  4389. 435.72 s [servant-server] checks for parse errors [✔]
  4390. 435.72 s [servant-server] Servant.API.Raw
  4391. 435.72 s [servant-server] runs applications [✔]
  4392. 435.72 s [servant-server] gets the pathInfo modified [✔]
  4393. 435.72 s [servant-server] Servant.API.RawM
  4394. 435.72 s [servant-server] gives access to monadic context [✔]
  4395. 435.72 s [servant-server] lets users throw servant errors [✔]
  4396. 435.72 s [servant-server] gets the pathInfo modified [✔]
  4397. 435.72 s [servant-server] Servant.API.Alternative
  4398. 435.72 s [servant-server] unions endpoints [✔]
  4399. 435.72 s [servant-server] checks all endpoints before returning 415 [✔]
  4400. 435.72 s [servant-server] returns 404 if the path does not exist [✔]
  4401. 435.72 s [servant-server] ResponseHeaders
  4402. 435.72 s [servant-server] includes the headers in the response [✔]
  4403. 435.72 s [servant-server] responds with not found for non-existent endpoints [✔]
  4404. 435.72 s [servant-server] returns 406 if the Accept header is not supported [✔]
  4405. 435.72 s [servant-server] UVerbResponseHeaders
  4406. 435.72 s [servant-server] includes the headers in the response [✔]
  4407. 435.72 s [servant-server] Misc. combinators for request inspection
  4408. 435.72 s [servant-server] Successfully gets the HTTP version specified in the request [✔]
  4409. 435.72 s [servant-server] Checks that hspec-wai uses HTTP, not HTTPS [✔]
  4410. 435.72 s [servant-server] Checks that hspec-wai issues request from 0.0.0.0 [✔]
  4411. 435.72 s [servant-server] Doesn't serve anything from the empty API [✔]
  4412. 435.72 s [servant-server] Servant.API.BasicAuth
  4413. 435.72 s [servant-server] Basic Authentication
  4414. 435.72 s [servant-server] returns 401 when no credentials given [✔]
  4415. 435.72 s [servant-server] returns 403 when invalid credentials given [✔]
  4416. 435.72 s [servant-server] returns 200 with the right password [✔]
  4417. 435.72 s [servant-server] plays nice with subsequent Raw endpoints [✔]
  4418. 435.72 s [servant-server] Servant.API.Auth
  4419. 435.72 s [servant-server] Custom Auth Protection
  4420. 435.72 s [servant-server] returns 401 when missing headers [✔]
  4421. 435.72 s [servant-server] returns 403 on wrong passwords [✔]
  4422. 435.72 s [servant-server] returns 200 with the right header [✔]
  4423. 435.72 s [servant-server] plays nice with subsequent Raw endpoints [✔]
  4424. 435.72 s [servant-server] Servant.Server.Error
  4425. 435.72 s [servant-server] HTTP Errors
  4426. 435.72 s [servant-server] HTTP error order
  4427. 435.72 s [servant-server] has 404 as its highest priority error [✔]
  4428. 435.72 s [servant-server] has 405 as its second highest priority error [✔]
  4429. 435.72 s [servant-server] has 401 as its third highest priority error (auth) [✔]
  4430. 435.72 s [servant-server] has 406 as its fourth highest priority error [✔]
  4431. 435.72 s [servant-server] has 415 as its fifth highest priority error [✔]
  4432. 435.72 s [servant-server] has 400 as its sixth highest priority error [✔]
  4433. 435.72 s [servant-server] has handler-level errors as last priority [✔]
  4434. 435.72 s [servant-server] PrioErrors
  4435. 435.72 s [servant-server] returns 404 on GET / (text) [✔]
  4436. 435.72 s [servant-server] returns 404 on GET /bar (text) [✔]
  4437. 435.72 s [servant-server] returns 415 on GET /foo (text) [✔]
  4438. 435.72 s [servant-server] returns 404 on PUT / (text) [✔]
  4439. 435.72 s [servant-server] returns 404 on PUT /bar (text) [✔]
  4440. 435.72 s [servant-server] returns 405 on PUT /foo (text) [✔]
  4441. 435.72 s [servant-server] returns 404 on GET / (invalid json) [✔]
  4442. 435.72 s [servant-server] returns 404 on GET /bar (invalid json) [✔]
  4443. 435.72 s [servant-server] returns 400 on GET /foo (invalid json) [✔]
  4444. 435.72 s [servant-server] returns 404 on PUT / (invalid json) [✔]
  4445. 435.72 s [servant-server] returns 404 on PUT /bar (invalid json) [✔]
  4446. 435.72 s [servant-server] returns 405 on PUT /foo (invalid json) [✔]
  4447. 435.72 s [servant-server] returns 404 on GET / (valid json) [✔]
  4448. 435.72 s [servant-server] returns 404 on GET /bar (valid json) [✔]
  4449. 435.72 s [servant-server] returns 200 on GET /foo (valid json) [✔]
  4450. 435.72 s [servant-server] returns 404 on PUT / (valid json) [✔]
  4451. 435.72 s [servant-server] returns 404 on PUT /bar (valid json) [✔]
  4452. 435.72 s [servant-server] returns 405 on PUT /foo (valid json) [✔]
  4453. 435.72 s [servant-server] Handler search
  4454. 435.72 s [servant-server] should continue when URLs don't match [✔]
  4455. 435.72 s [servant-server] should continue when methods don't match [✔]
  4456. 435.72 s [servant-server] Multiple handlers return errors
  4457. 435.72 s [servant-server] should respond with 404 if no path matches [✔]
  4458. 435.72 s [servant-server] should respond with 405 if a path but not method matches [✔]
  4459. 435.72 s [servant-server] should respond with the corresponding error if path and method match [✔]
  4460. 435.72 s [servant-server] should respond with 415 only if none of the subservers supports the request's content type [✔]
  4461. 435.72 s [servant-server] Custom errors from combinators
  4462. 435.72 s [servant-server] formats query parse error [✔]
  4463. 435.72 s [servant-server] formats query parse error with missing param [✔]
  4464. 435.72 s [servant-server] formats capture parse error [✔]
  4465. 435.72 s [servant-server] formats body parse error [✔]
  4466. 435.72 s [servant-server] Servant.Server.Internal.Context
  4467. 435.72 s [servant-server] getContextEntry
  4468. 435.72 s [servant-server] gets the context if a matching one exists [✔]
  4469. 435.72 s [servant-server] gets the first matching context [✔]
  4470. 435.72 s [servant-server] does not typecheck if type does not exist [✔]
  4471. 435.72 s [servant-server] Show instance
  4472. 435.72 s [servant-server] has a Show instance [✔]
  4473. 435.72 s [servant-server] bracketing
  4474. 435.72 s [servant-server] works [✔]
  4475. 435.72 s [servant-server] works with operators [✔]
  4476. 435.72 s [servant-server] descendIntoNamedContext
  4477. 435.72 s [servant-server] allows extracting subcontexts [✔]
  4478. 435.72 s [servant-server] allows extracting entries from subcontexts [✔]
  4479. 435.72 s [servant-server] does not typecheck if subContext has the wrong type [✔]
  4480. 435.72 s [servant-server] does not typecheck if subContext with that name doesn't exist [✔]
  4481. 435.72 s [servant-server] Servant.Server.Internal.RoutingApplication
  4482. 435.72 s [servant-server] Delayed
  4483. 435.72 s [servant-server] garbage created
  4484. 435.72 s [servant-server] garbage collected
  4485. 435.72 s [servant-server] actually runs clean up actions [✔]
  4486. 435.72 s [servant-server] garbage created
  4487. 435.72 s [servant-server] garbage collected
  4488. 435.72 s [servant-server] even with exceptions in serverD [✔]
  4489. 435.72 s [servant-server] garbage created
  4490. 435.72 s [servant-server] garbage collected
  4491. 435.72 s [servant-server] even with routing failure in bodyD [✔]
  4492. 435.72 s [servant-server] garbage created
  4493. 435.72 s [servant-server] garbage collected
  4494. 435.72 s [servant-server] even with exceptions in bodyD [✔]
  4495. 435.72 s [servant-server] ResApi
  4496. 435.72 s [servant-server] writes and cleanups resources [✔]
  4497. 435.72 s [servant-server] Servant.Server.Router
  4498. 435.72 s [servant-server] Servant.Server.Internal.Router
  4499. 435.72 s [servant-server] tweakResponse
  4500. 435.72 s [servant-server] calls f on route result [✔]
  4501. 435.72 s [servant-server] runRouter
  4502. 435.72 s [servant-server] capture failure returns a 400 response [✔]
  4503. 435.72 s [servant-server] choice
  4504. 435.72 s [servant-server] distributes endpoints through static paths [✔]
  4505. 435.72 s [servant-server] distributes nested routes through static paths [✔]
  4506. 435.72 s [servant-server] distributes nested routes through dynamic paths [✔]
  4507. 435.72 s [servant-server] properly reorders permuted static paths [✔]
  4508. 435.72 s [servant-server] properly reorders permuted static paths in the presence of QueryParams [✔]
  4509. 435.72 s [servant-server] properly reorders permuted static paths in the presence of Raw in end [✔]
  4510. 435.72 s [servant-server] properly reorders permuted static paths in the presence of Raw in beginning [✔]
  4511. 435.72 s [servant-server] properly reorders permuted static paths in the presence of Raw in middle [✔]
  4512. 435.72 s [servant-server] properly reorders permuted static paths in the presence of a root endpoint in end [✔]
  4513. 435.72 s [servant-server] properly reorders permuted static paths in the presence of a root endpoint in beginning [✔]
  4514. 435.72 s [servant-server] properly reorders permuted static paths in the presence of a root endpoint in middle [✔]
  4515. 435.72 s [servant-server] properly handles mixing static paths at different levels [✔]
  4516. 435.72 s [servant-server] serverLayout
  4517. 435.72 s [servant-server] correctly represents the example API [✔]
  4518. 435.72 s [servant-server] aggregates capture hints when different [✔]
  4519. 435.72 s [servant-server] nubs capture hints when equal [✔]
  4520. 435.72 s [servant-server] properly displays CaptureAll hints [✔]
  4521. 435.72 s [servant-server] Servant.Server.StaticFiles
  4522. 435.72 s [servant-server] serveDirectory
  4523. 435.72 s [servant-server] successfully serves files [✔]
  4524. 435.72 s [servant-server] serves the contents of index.html when requesting the root of a directory [✔]
  4525. 435.72 s [servant-server] Servant.Server.Streaming
  4526. 435.72 s [servant-server] client to server can stream lazy ByteStrings [✔]
  4527. 435.72 s [servant-server] Servant.Server.UsingContext
  4528. 435.72 s [servant-server] accessing context entries from custom combinators
  4529. 435.72 s [servant-server] allows retrieving a ContextEntry [✔]
  4530. 435.72 s [servant-server] allows retrieving the same ContextEntry twice [✔]
  4531. 435.72 s [servant-server] inserting context entries with custom combinators
  4532. 435.72 s [servant-server] allows to inject context entries [✔]
  4533. 435.72 s [servant-server] allows to inject tagged context entries [✔]
  4534. 435.72 s [servant-server] allows retrieving different ContextEntries for the same combinator [✔]
  4535. 435.72 s [servant-server] WithNamedContext
  4536. 435.72 s [servant-server] allows descending into a subcontext for a given api [✔]
  4537. 435.72 s [servant-server]
  4538. 435.72 s [servant-server] Finished in 0.0131 seconds
  4539. 435.72 s [servant-server] 204 examples, 0 failures
  4540. 435.72 s [servant-server] Test suite spec: PASS
  4541. 435.72 s [servant-server] Test suite logged to: dist/test/servant-server-0.20.3.0-spec.log
  4542. 435.72 s [servant-server] 1 of 1 test suites (1 of 1 test cases) passed.
  4543. 435.73 s [servant-server] Phase: haddockPhase
  4544. 435.88 s [servant-server] Preprocessing library for servant-server-0.20.3.0...
  4545. 435.89 s [servant-server] Running Haddock on library for servant-server-0.20.3.0...
  4546. 435.89 s [servant-server] Warning: The documentation for the following packages are not installed. No
  4547. 435.89 s [servant-server] links will be generated to these packages: attoparsec-0.14.4,
  4548. 435.89 s [servant-server] attoparsec-0.14.4, vector-0.13.2.0
  4549. 436.34 s [servant-server] [ 1 of 19] Compiling Servant.Server.Internal.Context
  4550. 436.37 s [servant-server] [ 2 of 19] Compiling Servant.Server.Internal.ResponseRender
  4551. 436.67 s [servant-server] [ 3 of 19] Compiling Servant.Server.Internal.ServerError
  4552. 436.72 s [servant-server] [ 4 of 19] Compiling Servant.Server.Internal.RouteResult
  4553. 436.97 s [servant-server] [ 5 of 19] Compiling Servant.Server.Internal.RoutingApplication
  4554. 436.97 s [servant-server] [ 6 of 19] Compiling Servant.Server.Internal.Handler
  4555. 437.00 s [servant-server] [ 7 of 19] Compiling Servant.Server.Internal.ErrorFormatter
  4556. 437.01 s [servant-server] [ 8 of 19] Compiling Servant.Server.Internal.Router
  4557. 437.06 s [servant-server] [ 9 of 19] Compiling Servant.Server.Internal.DelayedIO
  4558. 437.09 s [servant-server] [10 of 19] Compiling Servant.Server.Internal.Delayed
  4559. 437.11 s [servant-server] [11 of 19] Compiling Servant.Server.Internal.BasicAuth
  4560. 437.13 s [servant-server] [12 of 19] Compiling Servant.Server.Internal
  4561. 437.37 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2..
  4562. 437.37 s [doctest] Building test suite 'spec' for doctest-0.24.2..
  4563. 437.53 s [servant-server] src/Servant/Server/Internal.hs:1051:1: warning: [GHC-08585] [-Wmissing-methods]
  4564. 437.53 s [servant-server] • No explicit associated type or default declaration for ‘ServerT’
  4565. 437.53 s [servant-server] • In the instance declaration for ‘HasServer (ty :> sub) context’
  4566. 437.53 s [servant-server] |
  4567. 437.54 s [servant-server] 1051 | instance {-# OVERLAPPABLE #-} TypeError (NoInstanceForSub
  4568. 437.54 s [servant-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  4569. 437.54 s [servant-server]
  4570. 437.54 s [servant-server] src/Servant/Server/Internal.hs:1051:31: warning: [GHC-06201] [-Wmissing-methods]
  4571. 437.54 s [servant-server] • No explicit implementation for
  4572. 437.54 s [servant-server] ‘route’ and ‘hoistServerWithContext’
  4573. 437.54 s [servant-server] • In the instance declaration for ‘HasServer (ty :> sub) context’
  4574. 437.54 s [servant-server] |
  4575. 437.54 s [servant-server] 1051 | instance {-# OVERLAPPABLE #-} TypeError (NoInstanceForSub
  4576. 437.54 s [servant-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  4577. 437.54 s [servant-server]
  4578. 437.54 s [servant-server] src/Servant/Server/Internal.hs:1057:1: warning: [GHC-08585] [-Wmissing-methods]
  4579. 437.54 s [servant-server] • No explicit associated type or default declaration for ‘ServerT’
  4580. 437.54 s [servant-server] • In the instance declaration for ‘HasServer api context’
  4581. 437.54 s [servant-server] |
  4582. 437.54 s [servant-server] 1057 | instance {-# OVERLAPPABLE #-} TypeError (NoInstanceFor (HasServer api context)) => HasServer api context
  4583. 437.54 s [servant-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4584. 437.54 s [servant-server]
  4585. 437.54 s [servant-server] src/Servant/Server/Internal.hs:1057:31: warning: [GHC-06201] [-Wmissing-methods]
  4586. 437.54 s [servant-server] • No explicit implementation for
  4587. 437.54 s [servant-server] ‘route’ and ‘hoistServerWithContext’
  4588. 437.54 s [servant-server] • In the instance declaration for ‘HasServer api context’
  4589. 437.54 s [servant-server] |
  4590. 437.54 s [servant-server] 1057 | instance {-# OVERLAPPABLE #-} TypeError (NoInstanceFor (HasServer api context)) => HasServer api context
  4591. 437.54 s [servant-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4592. 437.54 s [servant-server]
  4593. 437.55 s [servant-server] [13 of 19] Compiling Servant.Server.UVerb
  4594. 437.57 s [servant-server] [14 of 19] Compiling Servant.Server
  4595. 437.57 s [servant-server] [15 of 19] Compiling Servant.Server.StaticFiles
  4596. 437.62 s [servant-server] [16 of 19] Compiling Servant.Server.Generic
  4597. 437.63 s [servant-server] [17 of 19] Compiling Servant
  4598. 437.64 s [servant-server] [18 of 19] Compiling Servant.Server.Experimental.Auth
  4599. 437.65 s [servant-server] [19 of 19] Compiling Servant.Utils.StaticFiles
  4600. 437.65 s [servant-server] Haddock coverage:
  4601. 437.65 s [servant-server] Warning: 'NamedContext' is ambiguous. It is defined
  4602. 437.65 s [servant-server] * at src/Servant/Server/Internal/Context.hs:91:5
  4603. 437.65 s [servant-server] * at src/Servant/Server/Internal/Context.hs:90:1
  4604. 437.65 s [servant-server] You may be able to disambiguate the identifier by qualifying it or
  4605. 437.65 s [servant-server] by specifying the type/value namespace explicitly.
  4606. 437.65 s [servant-server] Defaulting to the one defined at src/Servant/Server/Internal/Context.hs:90:1
  4607. 437.65 s [servant-server] Warning: 'hoistServer' is out of scope.
  4608. 437.65 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4609. 437.65 s [servant-server] Warning: 'NamedContext' is out of scope.
  4610. 437.65 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4611. 437.65 s [servant-server] Warning: Servant.Server.Internal.Context: Could not find documentation for exported module: Servant.Server.Internal.Context
  4612. 437.65 s [servant-server] 85% ( 6 / 7) in 'Servant.Server.Internal.Context'
  4613. 437.65 s [servant-server] Missing documentation for:
  4614. 437.65 s [servant-server] Module header
  4615. 437.65 s [servant-server] 0% ( 0 / 9) in 'Servant.Server.Internal.ResponseRender'
  4616. 437.65 s [servant-server] Missing documentation for:
  4617. 437.65 s [servant-server] Module header
  4618. 437.65 s [servant-server] IsWaiBody (src/Servant/Server/Internal/ResponseRender.hs:27)
  4619. 437.65 s [servant-server] SomeResponse (src/Servant/Server/Internal/ResponseRender.hs:55)
  4620. 437.65 s [servant-server] ResponseListRender (src/Servant/Server/Internal/ResponseRender.hs:57)
  4621. 437.65 s [servant-server] ResponseRender (src/Servant/Server/Internal/ResponseRender.hs:68)
  4622. 437.65 s [servant-server] addContentType (src/Servant/Server/Internal/ResponseRender.hs:172)
  4623. 437.65 s [servant-server] addContentType' (src/Servant/Server/Internal/ResponseRender.hs:175)
  4624. 437.65 s [servant-server] setEmptyBody (src/Servant/Server/Internal/ResponseRender.hs:178)
  4625. 437.65 s [servant-server] someResponseToWai (src/Servant/Server/Internal/ResponseRender.hs:184)
  4626. 437.66 s [servant-server] 91% ( 33 / 36) in 'Servant.Server.Internal.ServerError'
  4627. 437.66 s [servant-server] Missing documentation for:
  4628. 437.66 s [servant-server] Module header
  4629. 437.66 s [servant-server] ServerError (src/Servant/Server/Internal/ServerError.hs:16)
  4630. 437.66 s [servant-server] responseServerError (src/Servant/Server/Internal/ServerError.hs:27)
  4631. 437.66 s [servant-server] Warning: 'ServantError' is out of scope.
  4632. 437.66 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4633. 437.66 s [servant-server] 33% ( 1 / 3) in 'Servant.Server.Internal.RouteResult'
  4634. 437.66 s [servant-server] Missing documentation for:
  4635. 437.66 s [servant-server] Module header
  4636. 437.66 s [servant-server] RouteResultT (src/Servant/Server/Internal/RouteResult.hs:40)
  4637. 437.66 s [servant-server] Warning: 'pathInfo' is out of scope.
  4638. 437.66 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4639. 437.66 s [servant-server] 0% ( 0 / 3) in 'Servant.Server.Internal.RoutingApplication'
  4640. 437.66 s [servant-server] Missing documentation for:
  4641. 437.66 s [servant-server] Module header
  4642. 437.66 s [servant-server] RoutingApplication (src/Servant/Server/Internal/RoutingApplication.hs:8)
  4643. 437.66 s [servant-server] toApplication (src/Servant/Server/Internal/RoutingApplication.hs:13)
  4644. 437.66 s [servant-server] 25% ( 1 / 4) in 'Servant.Server.Internal.Handler'
  4645. 437.66 s [servant-server] Missing documentation for:
  4646. 437.66 s [servant-server] Module header
  4647. 437.66 s [servant-server] Handler (src/Servant/Server/Internal/Handler.hs:27)
  4648. 437.66 s [servant-server] runHandler (src/Servant/Server/Internal/Handler.hs:51)
  4649. 437.66 s [servant-server] 62% ( 5 / 8) in 'Servant.Server.Internal.ErrorFormatter'
  4650. 437.66 s [servant-server] Missing documentation for:
  4651. 437.66 s [servant-server] Module header
  4652. 437.66 s [servant-server] MkContextWithErrorFormatter (src/Servant/Server/Internal/ErrorFormatter.hs:69)
  4653. 437.66 s [servant-server] mkContextWithErrorFormatter (src/Servant/Server/Internal/ErrorFormatter.hs:72)
  4654. 437.66 s [servant-server] Warning: 'Capture' is out of scope.
  4655. 437.66 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4656. 437.66 s [servant-server] Warning: 'a' is out of scope.
  4657. 437.66 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4658. 437.66 s [servant-server] Warning: 'WithRequest' is out of scope.
  4659. 437.66 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4660. 437.66 s [servant-server] 66% ( 12 / 18) in 'Servant.Server.Internal.Router'
  4661. 437.66 s [servant-server] Missing documentation for:
  4662. 437.66 s [servant-server] Module header
  4663. 437.66 s [servant-server] Router (src/Servant/Server/Internal/Router.hs:26)
  4664. 437.66 s [servant-server] toCaptureTag (src/Servant/Server/Internal/Router.hs:38)
  4665. 437.66 s [servant-server] toCaptureTags (src/Servant/Server/Internal/Router.hs:41)
  4666. 437.66 s [servant-server] runRouterEnv (src/Servant/Server/Internal/Router.hs:193)
  4667. 437.66 s [servant-server] worseHTTPCode (src/Servant/Server/Internal/Router.hs:251)
  4668. 437.66 s [servant-server] Warning: 'Delayed' is out of scope.
  4669. 437.66 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4670. 437.66 s [servant-server] 57% ( 4 / 7) in 'Servant.Server.Internal.DelayedIO'
  4671. 437.66 s [servant-server] Missing documentation for:
  4672. 437.66 s [servant-server] Module header
  4673. 437.66 s [servant-server] liftRouteResult (src/Servant/Server/Internal/DelayedIO.hs:42)
  4674. 437.66 s [servant-server] runDelayedIO (src/Servant/Server/Internal/DelayedIO.hs:57)
  4675. 437.66 s [servant-server] Warning: 'Delayed' is ambiguous. It is defined
  4676. 437.66 s [servant-server] * at src/Servant/Server/Internal/Delayed.hs:93:3
  4677. 437.66 s [servant-server] * at src/Servant/Server/Internal/Delayed.hs:92:1
  4678. 437.66 s [servant-server] You may be able to disambiguate the identifier by qualifying it or
  4679. 437.66 s [servant-server] by specifying the type/value namespace explicitly.
  4680. 437.66 s [servant-server] Defaulting to the one defined at src/Servant/Server/Internal/Delayed.hs:92:1
  4681. 437.66 s [servant-server] 92% ( 12 / 13) in 'Servant.Server.Internal.Delayed'
  4682. 437.66 s [servant-server] Missing documentation for:
  4683. 437.66 s [servant-server] Module header
  4684. 437.67 s [servant-server] Warning: 'Authorization' is out of scope.
  4685. 437.67 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4686. 437.67 s [servant-server] 85% ( 6 / 7) in 'Servant.Server.Internal.BasicAuth'
  4687. 437.67 s [servant-server] Missing documentation for:
  4688. 437.67 s [servant-server] Module header
  4689. 437.67 s [servant-server] Warning: 'ReqBody' is out of scope.
  4690. 437.67 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4691. 437.67 s [servant-server] Warning: 'FromJSON' is out of scope.
  4692. 437.67 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4693. 437.67 s [servant-server] Warning: 'QueryParam' is out of scope.
  4694. 437.67 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4695. 437.67 s [servant-server] Warning: 'ByteString' is out of scope.
  4696. 437.67 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4697. 437.67 s [servant-server] Warning: 'Header' is out of scope.
  4698. 437.67 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4699. 437.67 s [servant-server] Warning: 'Capture' is out of scope.
  4700. 437.67 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4701. 437.67 s [servant-server] Warning: ':<|>' is ambiguous. It is defined
  4702. 437.67 s [servant-server] * in ‘Servant.API.Alternative’
  4703. 437.67 s [servant-server] * in ‘Servant.API.Alternative’
  4704. 437.67 s [servant-server] You may be able to disambiguate the identifier by qualifying it or
  4705. 437.67 s [servant-server] by specifying the type/value namespace explicitly.
  4706. 437.67 s [servant-server] Defaulting to the one defined in ‘Servant.API.Alternative’
  4707. 437.67 s [servant-server] Warning: '->' is out of scope.
  4708. 437.67 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4709. 437.67 s [servant-server] Warning: Servant.Server.Internal: Could not find documentation for exported module: Servant.Server.Internal
  4710. 437.67 s [servant-server] 50% ( 16 / 32) in 'Servant.Server.Internal'
  4711. 437.67 s [servant-server] Missing documentation for:
  4712. 437.67 s [servant-server] Module header
  4713. 437.67 s [servant-server] Server (src/Servant/Server/Internal.hs:115)
  4714. 437.67 s [servant-server] HasServer (src/Servant/Server/Internal.hs:95)
  4715. 437.67 s [servant-server] getAcceptHeader (src/Servant/Server/Internal.hs:974)
  4716. 437.67 s [servant-server] AsServer (src/Servant/Server/Internal.hs:1086)
  4717. 437.67 s [servant-server] acceptCheck (src/Servant/Server/Internal.hs:284)
  4718. 437.67 s [servant-server] allowedMethodHead (src/Servant/Server/Internal.hs:266)
  4719. 437.67 s [servant-server] methodCheck (src/Servant/Server/Internal.hs:272)
  4720. 437.67 s [servant-server] allowedMethod (src/Servant/Server/Internal.hs:269)
  4721. 437.67 s [servant-server] methodRouter (src/Servant/Server/Internal.hs:293)
  4722. 437.67 s [servant-server] noContentRouter (src/Servant/Server/Internal.hs:311)
  4723. 437.67 s [servant-server] streamRouter (src/Servant/Server/Internal.hs:385)
  4724. 437.67 s [servant-server] parseDeepParam (src/Servant/Server/Internal.hs:716)
  4725. 437.67 s [servant-server] ct_wildcard (src/Servant/Server/Internal.hs:971)
  4726. 437.67 s [servant-server] HasServerArrowTypeError (src/Servant/Server/Internal.hs:1039)
  4727. 437.67 s [servant-server] HasAcceptCheck (src/Servant/Server/Internal.hs:1186)
  4728. 437.67 s [servant-server] 33% ( 1 / 3) in 'Servant.Server.UVerb'
  4729. 437.67 s [servant-server] Missing documentation for:
  4730. 437.67 s [servant-server] Module header
  4731. 437.67 s [servant-server] IsServerResource (src/Servant/Server/UVerb.hs:48)
  4732. 437.67 s [servant-server] Warning: 'Handler' is ambiguous. It is defined
  4733. 437.67 s [servant-server] * at src/Servant/Server/Internal/Handler.hs:27:21
  4734. 437.67 s [servant-server] * at src/Servant/Server/Internal/Handler.hs:27:1
  4735. 437.67 s [servant-server] You may be able to disambiguate the identifier by qualifying it or
  4736. 437.67 s [servant-server] by specifying the type/value namespace explicitly.
  4737. 437.67 s [servant-server] Defaulting to the one defined at src/Servant/Server/Internal/Handler.hs:27:1
  4738. 437.67 s [servant-server] Warning: 'Raw' is out of scope.
  4739. 437.67 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4740. 437.68 s [servant-server] 92% ( 82 / 89) in 'Servant.Server'
  4741. 437.68 s [servant-server] Missing documentation for:
  4742. 437.68 s [servant-server] toApplication (src/Servant/Server/Internal/RoutingApplication.hs:13)
  4743. 437.68 s [servant-server] HasServer (src/Servant/Server/Internal.hs:95)
  4744. 437.68 s [servant-server] Server (src/Servant/Server/Internal.hs:115)
  4745. 437.68 s [servant-server] Handler (src/Servant/Server/Internal/Handler.hs:27)
  4746. 437.68 s [servant-server] runHandler (src/Servant/Server/Internal/Handler.hs:51)
  4747. 437.68 s [servant-server] ServerError (src/Servant/Server/Internal/ServerError.hs:16)
  4748. 437.68 s [servant-server] getAcceptHeader (src/Servant/Server/Internal.hs:974)
  4749. 437.68 s [servant-server] Warning: 'serveDirectoryWebApp' is out of scope.
  4750. 437.68 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4751. 437.68 s [servant-server] 100% ( 8 / 8) in 'Servant.Server.StaticFiles'
  4752. 437.68 s [servant-server] Warning: 'Handler' is ambiguous. It is defined
  4753. 437.68 s [servant-server] * at src/Servant/Server/Internal/Handler.hs:27:21
  4754. 437.68 s [servant-server] * at src/Servant/Server/Internal/Handler.hs:27:1
  4755. 437.68 s [servant-server] You may be able to disambiguate the identifier by qualifying it or
  4756. 437.68 s [servant-server] by specifying the type/value namespace explicitly.
  4757. 437.68 s [servant-server] Defaulting to the one defined at src/Servant/Server/Internal/Handler.hs:27:1
  4758. 437.68 s [servant-server] 87% ( 7 / 8) in 'Servant.Server.Generic'
  4759. 437.68 s [servant-server] Missing documentation for:
  4760. 437.68 s [servant-server] AsServer (src/Servant/Server/Internal.hs:1086)
  4761. 437.68 s [servant-server] 90% ( 10 / 11) in 'Servant'
  4762. 437.68 s [servant-server] Missing documentation for:
  4763. 437.68 s [servant-server] Module header
  4764. 437.68 s [servant-server] Warning: 'User' is out of scope.
  4765. 437.68 s [servant-server] If you qualify the identifier, haddock can try to link it anyway.
  4766. 437.68 s [servant-server] 80% ( 4 / 5) in 'Servant.Server.Experimental.Auth'
  4767. 437.68 s [servant-server] Missing documentation for:
  4768. 437.68 s [servant-server] Module header
  4769. 437.68 s [servant-server] 50% ( 1 / 2) in 'Servant.Utils.StaticFiles'
  4770. 437.68 s [servant-server] Missing documentation for:
  4771. 437.68 s [servant-server] Module header
  4772. 437.85 s [doctest] [ 1 of 44] Compiling Imports ( src/Imports.hs, dist/build/spec/spec-tmp/Imports.o )
  4773. 437.93 s [doctest] [ 2 of 44] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/spec/spec-tmp/GhcUtil.o )
  4774. 438.10 s [servant-server] Warning: Servant.Server.Internal.Handler: could not find link destinations for:
  4775. 438.10 s [servant-server] - Servant.Server.Internal.Handler.Rep_Handler
  4776. 438.10 s [servant-server] Warning: Servant.Server.Internal.BasicAuth: could not find link destinations for:
  4777. 438.10 s [servant-server] - Servant.Server.Internal.BasicAuth.Rep_BasicAuthCheck
  4778. 438.10 s [servant-server] - Servant.Server.Internal.BasicAuth.Rep_BasicAuthResult
  4779. 438.11 s [servant-server] Warning: Servant.Server.Internal: could not find link destinations for:
  4780. 438.11 s [servant-server] - Servant.Server.UVerb.IsServerResourceWithStatus
  4781. 438.11 s [servant-server] Warning: Servant.Server.UVerb: could not find link destinations for:
  4782. 438.11 s [servant-server] - Servant.Server.UVerb.IsServerResourceWithStatus
  4783. 438.11 s [servant-server] - Servant.Server.UVerb.resourceResponse
  4784. 438.11 s [servant-server] - Servant.Server.UVerb.resourceHeaders
  4785. 438.13 s [servant-server] Warning: Servant.Server: could not find link destinations for:
  4786. 438.13 s [servant-server] - Data.Tagged.Rep1_Tagged
  4787. 438.13 s [servant-server] - Data.Tagged.Rep_Tagged
  4788. 438.13 s [servant-server] - Servant.Server.Internal.Handler.Rep_Handler
  4789. 438.13 s [servant-server] - Servant.Server.Internal.BasicAuth.Rep_BasicAuthCheck
  4790. 438.13 s [servant-server] - Servant.Server.Internal.BasicAuth.Rep_BasicAuthResult
  4791. 438.13 s [servant-server] - Servant.Server.UVerb.IsServerResourceWithStatus
  4792. 438.13 s [servant-server] Warning: Servant: could not find link destinations for:
  4793. 438.13 s [servant-server] - GHC.Internal.Generics.Rep1_Proxy
  4794. 438.13 s [servant-server] - GHC.Internal.Generics.Rep_Proxy
  4795. 438.13 s [servant-server] Warning: Servant.Server.Experimental.Auth: could not find link destinations for:
  4796. 438.13 s [servant-server] - Servant.Server.Experimental.Auth.Rep_AuthHandler
  4797. 438.49 s [doctest] [ 3 of 44] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/spec/spec-tmp/Cabal/ReplOptions.o )
  4798. 438.63 s [doctest] [ 4 of 44] Compiling Cabal.ReplOptionsSpec ( test/Cabal/ReplOptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/ReplOptionsSpec.o )
  4799. 438.87 s [doctest] [ 5 of 44] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/spec/spec-tmp/Cabal/Paths.o )
  4800. 438.87 s [doctest] [ 6 of 44] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/spec/spec-tmp/Cabal/Options.o )
  4801. 438.87 s [doctest] [ 7 of 44] Compiling Cabal.OptionsSpec ( test/Cabal/OptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/OptionsSpec.o )
  4802. 439.18 s [doctest] [ 8 of 44] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapper.o )
  4803. 439.18 s [doctest] [ 9 of 44] Compiling Interpreter ( src/Interpreter.hs, dist/build/spec/spec-tmp/Interpreter.o )
  4804. 439.18 s [doctest] [10 of 44] Compiling InterpreterSpec ( test/InterpreterSpec.hs, dist/build/spec/spec-tmp/InterpreterSpec.o )
  4805. 439.18 s [doctest] [11 of 44] Compiling Info ( src/Info.hs, dist/build/spec/spec-tmp/Info.o )
  4806. 439.18 s [doctest] [12 of 44] Compiling InfoSpec ( test/InfoSpec.hs, dist/build/spec/spec-tmp/InfoSpec.o )
  4807. 439.18 s [doctest] [13 of 44] Compiling Cabal ( src/Cabal.hs, dist/build/spec/spec-tmp/Cabal.o )
  4808. 439.18 s [doctest] [14 of 44] Compiling Cabal.PathsSpec ( test/Cabal/PathsSpec.hs, dist/build/spec/spec-tmp/Cabal/PathsSpec.o )
  4809. 439.18 s [doctest] [15 of 44] Compiling Language.Haskell.GhciWrapperSpec ( test/Language/Haskell/GhciWrapperSpec.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapperSpec.o )
  4810. 439.18 s [doctest] [16 of 44] Compiling Location ( src/Location.hs, dist/build/spec/spec-tmp/Location.o )
  4811. 439.18 s [doctest] [17 of 44] Compiling LocationSpec ( test/LocationSpec.hs, dist/build/spec/spec-tmp/LocationSpec.o )
  4812. 439.18 s [doctest] [18 of 44] Compiling Options ( src/Options.hs, dist/build/spec/spec-tmp/Options.o )
  4813. 439.18 s [doctest] [19 of 44] Compiling OptionsSpec ( test/OptionsSpec.hs, dist/build/spec/spec-tmp/OptionsSpec.o )
  4814. 439.42 s [doctest] [20 of 44] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/spec/spec-tmp/PackageDBs.o )
  4815. 439.42 s [doctest] [21 of 44] Compiling PackageDBsSpec ( test/PackageDBsSpec.hs, dist/build/spec/spec-tmp/PackageDBsSpec.o )
  4816. 439.42 s [doctest] [22 of 44] Compiling Paths_doctest ( dist/build/spec/autogen/Paths_doctest.hs, dist/build/spec/spec-tmp/Paths_doctest.o )
  4817. 439.42 s [doctest] [23 of 44] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Cabal.o )
  4818. 439.42 s [doctest] [24 of 44] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Location.o )
  4819. 439.42 s [doctest] [25 of 44] Compiling Util ( src/Util.hs, dist/build/spec/spec-tmp/Util.o )
  4820. 439.42 s [doctest] [26 of 44] Compiling Extract ( src/Extract.hs, dist/build/spec/spec-tmp/Extract.o )
  4821. 439.42 s [doctest] [27 of 44] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Extract.o )
  4822. 439.42 s [doctest] [28 of 44] Compiling Parse ( src/Parse.hs, dist/build/spec/spec-tmp/Parse.o )
  4823. 439.42 s [doctest] [29 of 44] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Parse.o )
  4824. 439.42 s [doctest] [30 of 44] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/spec/spec-tmp/Runner/Example.o )
  4825. 439.64 s [doctest] [31 of 44] Compiling Runner.ExampleSpec ( test/Runner/ExampleSpec.hs, dist/build/spec/spec-tmp/Runner/ExampleSpec.o )
  4826. 440.25 s [doctest] [32 of 44] Compiling Property ( src/Property.hs, dist/build/spec/spec-tmp/Property.o )
  4827. 440.25 s [doctest] [33 of 44] Compiling Runner ( src/Runner.hs, dist/build/spec/spec-tmp/Runner.o )
  4828. 440.25 s [doctest] [34 of 44] Compiling RunnerSpec ( test/RunnerSpec.hs, dist/build/spec/spec-tmp/RunnerSpec.o )
  4829. 440.25 s [doctest] [35 of 44] Compiling Run ( src/Run.hs, dist/build/spec/spec-tmp/Run.o )
  4830. 440.34 s [doctest] [36 of 44] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Run.o )
  4831. 440.49 s [doctest] [37 of 44] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/spec/spec-tmp/Test/DocTest.o )
  4832. 440.49 s [doctest] [38 of 44] Compiling RunSpec ( test/RunSpec.hs, dist/build/spec/spec-tmp/RunSpec.o )
  4833. 440.75 s [doctest] [39 of 44] Compiling MainSpec ( test/MainSpec.hs, dist/build/spec/spec-tmp/MainSpec.o )
  4834. 440.96 s [doctest] [40 of 44] Compiling PropertySpec ( test/PropertySpec.hs, dist/build/spec/spec-tmp/PropertySpec.o )
  4835. 440.96 s [doctest] [41 of 44] Compiling ParseSpec ( test/ParseSpec.hs, dist/build/spec/spec-tmp/ParseSpec.o )
  4836. 440.96 s [doctest] [42 of 44] Compiling ExtractSpec ( test/ExtractSpec.hs, dist/build/spec/spec-tmp/ExtractSpec.o )
  4837. 440.96 s [doctest] [43 of 44] Compiling UtilSpec ( test/UtilSpec.hs, dist/build/spec/spec-tmp/UtilSpec.o )
  4838. 440.96 s [doctest] [44 of 44] Compiling Main ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
  4839. 441.96 s [doctest] [45 of 45] Linking dist/build/spec/spec
  4840. 444.04 s [doctest] Phase: checkPhase
  4841. 444.07 s [doctest] Running 1 test suites...
  4842. 444.07 s [doctest] Test suite spec: RUNNING...
  4843. 444.08 s [doctest]
  4844. 444.08 s [doctest] Extract
  4845. 444.08 s [doctest] extract
  4846. 444.12 s [doctest] extracts documentation for a top-level declaration [✔]
  4847. 444.15 s [doctest] extracts documentation from argument list [✔]
  4848. 444.16 s [doctest] extracts documentation for a type class function [✔]
  4849. 444.18 s [doctest] extracts documentation from the argument list of a type class function [✔]
  4850. 444.21 s [doctest] extracts documentation from the module header [✔]
  4851. 444.23 s [doctest] extracts documentation from imported modules [✔]
  4852. 444.25 s [doctest] extracts documentation from export list [✔]
  4853. 444.27 s [doctest] extracts documentation from named chunks [✔]
  4854. 444.30 s [doctest] returns docstrings in the same order they appear in the source [✔]
  4855. 444.33 s [doctest] extracts $setup code [✔]
  4856. 444.34 s [doctest] fails on invalid flags [✔]
  4857. 444.34 s [doctest] extract (regression tests)
  4858. 444.37 s [doctest] works with infix operators [✔]
  4859. 444.38 s [doctest] works with parallel list comprehensions [✔]
  4860. 444.40 s [doctest] works with list comprehensions in instance definitions [✔]
  4861. 444.42 s [doctest] works with foreign imports [✔]
  4862. 444.45 s [doctest] works for rewrite rules [✔]
  4863. 444.47 s [doctest] works for rewrite rules with type signatures [✔]
  4864. 444.49 s [doctest] strips CR from dos line endings [✔]
  4865. 444.53 s [doctest] works with a module that splices in an expression from an other module [✔]
  4866. 444.54 s [doctest] works for type families and GHC 7.6.1 [✔]
  4867. 444.54 s [doctest] Info
  4868. 444.54 s [doctest] formatInfo
  4869. 444.58 s [doctest] formats --info output [✔]
  4870. 444.58 s [doctest] Interpreter
  4871. 444.58 s [doctest] interpreterSupported
  4872. 444.62 s [doctest] indicates whether GHCi is supported on current platform [✔]
  4873. 444.62 s [doctest] ghcInfo
  4874. 444.65 s [doctest] includes "Have interpreter" [✔]
  4875. 444.65 s [doctest] safeEval
  4876. 444.80 s [doctest] evaluates an expression [✔]
  4877. 444.94 s [doctest] returns Left on unterminated multiline command [✔]
  4878. 444.94 s [doctest] filterExpression
  4879. 444.94 s [doctest] removes :set -XTemplateHaskell [✔]
  4880. 444.94 s [doctest] filters -XTemplateHaskell [✔]
  4881. 444.94 s [doctest] leaves :set-statement that do not set -XTemplateHaskell alone [✔]
  4882. 444.94 s [doctest] Language.Haskell.GhciWrapper
  4883. 444.94 s [doctest] evalEcho
  4884. 445.09 s [doctest] prints result to stdout [✔]
  4885. 445.09 s [doctest] evalWith
  4886. 445.09 s [doctest] with PreserveIt
  4887. 445.29 s [doctest] preserves it [✔]
  4888. 445.29 s [doctest] eval
  4889. 445.45 s [doctest] shows literals [✔]
  4890. 445.58 s [doctest] shows string literals containing Unicode [✔]
  4891. 445.72 s [doctest] evaluates simple expressions [✔]
  4892. 445.80 s [servant-server] Documentation created: dist/doc/html/servant-server/,
  4893. 445.80 s [servant-server] dist/doc/html/servant-server/servant-server.txt
  4894. 445.86 s [servant-server] Preprocessing test suite 'spec' for servant-server-0.20.3.0...
  4895. 445.86 s [servant-server] Preprocessing executable 'greet' for servant-server-0.20.3.0...
  4896. 445.86 s [doctest] supports let bindings [✔]
  4897. 445.87 s [servant-server] Phase: installPhase
  4898. 446.00 s [servant-server] Installing library in /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  4899. 446.01 s [doctest] allows import statements [✔]
  4900. 446.12 s [servant-server] Installing executable greet in /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0/bin
  4901. 446.12 s [servant-server] Warning: The directory
  4902. 446.12 s [servant-server] /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0/bin is not
  4903. 446.12 s [servant-server] in the system search path.
  4904. 446.15 s [doctest] captures stdout [✔]
  4905. 446.29 s [doctest] captures stdout (Unicode) [✔]
  4906. 446.43 s [doctest] captures stdout (empty line) [✔]
  4907. 446.50 s [servant-server] Phase: fixupPhase
  4908. 446.52 s [servant-server] shrinking RPATHs of ELF executables and libraries in /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0
  4909. 446.53 s [servant-server] shrinking /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSservant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns-ghc9.10.3.so
  4910. 446.57 s [doctest] captures stdout (multiple lines) [✔]
  4911. 446.58 s [servant-server] shrinking /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0/bin/greet
  4912. 446.60 s [servant-server] checking for references to /build/ in /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0...
  4913. 446.63 s [servant-server] patching script interpreter paths in /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0
  4914. 446.64 s [servant-server] stripping (with command strip and flags -S -p) in /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0/lib /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0/bin
  4915. 446.73 s [doctest] captures stderr [✔]
  4916. 446.75 s [servant-server] shrinking RPATHs of ELF executables and libraries in /nix/store/8w8nl3xavz0fsa015rnj7wv43q7m03wf-servant-server-0.20.3.0-doc
  4917. 446.77 s [servant-server] checking for references to /build/ in /nix/store/8w8nl3xavz0fsa015rnj7wv43q7m03wf-servant-server-0.20.3.0-doc...
  4918. 446.79 s [servant-server] patching script interpreter paths in /nix/store/8w8nl3xavz0fsa015rnj7wv43q7m03wf-servant-server-0.20.3.0-doc
  4919. 446.95 s [servant-server:post-build] Uploading to cachix cache "sellout": /nix/store/8w8nl3xavz0fsa015rnj7wv43q7m03wf-servant-server-0.20.3.0-doc /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0
  4920. 447.54 s [servant-server:post-build] Pushing 2 paths (306 are already present) using zstd to cache sellout ⏳
  4921. 447.54 s [servant-server:post-build]
  4922. 447.90 s [servant-server:post-build] Pushing /nix/store/8w8nl3xavz0fsa015rnj7wv43q7m03wf-servant-server-0.20.3.0-doc (3.94 MiB)
  4923. 447.97 s [servant-server:post-build] Pushing /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0 (12.27 MiB)
  4924. 449.90 s [servant-server:post-build]
  4925. 449.90 s [servant-server:post-build] All done.
  4926. 449.92 s [servant-server:post-build] Uploading to the NixCI cache: /nix/store/8w8nl3xavz0fsa015rnj7wv43q7m03wf-servant-server-0.20.3.0-doc /nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0
  4927. 449.96 s [servant-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4928. 450.18 s [servant-server:post-build] copying 2 paths...
  4929. 450.19 s [servant-server:post-build] copying path '/nix/store/8w8nl3xavz0fsa015rnj7wv43q7m03wf-servant-server-0.20.3.0-doc' to 'https://cache.nix-ci.com'...
  4930. 450.93 s [servant-server:post-build] copying path '/nix/store/ybhcris8mr27f6r7vjxih6x0hr1fmxq0-servant-server-0.20.3.0' to 'https://cache.nix-ci.com'...
  4931. 453.95 s [servant-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4932. 454.21 s [servant-server:post-build] copying 1 paths...
  4933. 454.21 s [servant-server:post-build] copying path '/nix/store/dn87vz32v9d2nw0n2ap0i97d4cn223d4-servant-server-0.20.3.0.drv' to 'https://cache.nix-ci.com'...
  4934. 454.46 s Progress: 25 of 45 built (1 building), 373 of 373 downloaded from cache
  4935. 454.46 s [doctest] captures stderr (Unicode) [✔]
  4936. 454.46 s [doctest] shows exceptions [✔]
  4937. 454.46 s [doctest] shows exceptions (ExitCode) [✔]
  4938. 454.46 s [doctest] gives an error message for identifiers that are not in scope [✔]
  4939. 454.46 s [doctest] when configVerbose is True
  4940. 454.46 s [doctest] prints prompt [✔]
  4941. 454.46 s [doctest] with -XOverloadedStrings, -Wall and -Werror
  4942. 454.46 s [doctest] does not fail on marker expression (bug fix) [✔]
  4943. 454.46 s [doctest] with NoImplicitPrelude
  4944. 454.46 s [doctest] works [✔]
  4945. 454.46 s [doctest] with a strange String type
  4946. 454.46 s [doctest] works [✔]
  4947. 454.46 s [doctest] Location
  4948. 454.46 s [doctest] toLocation
  4949. 454.46 s [doctest] works for a regular SrcSpan [✔]
  4950. 454.46 s [doctest] works for a single-line SrcSpan [✔]
  4951. 454.46 s [doctest] works for a SrcSpan that corresponds to single point [✔]
  4952. 454.46 s [doctest] works for a bad SrcSpan [✔]
  4953. 454.46 s [doctest] works for a SrcLoc with bad locations [✔]
  4954. 454.46 s [doctest] enumerate
  4955. 454.46 s [doctest] replicates UnhelpfulLocation [✔]
  4956. 454.46 s [doctest] enumerates Location [✔]
  4957. 454.46 s [doctest] Main
  4958. 454.46 s [doctest] doctest
  4959. 454.46 s [doctest] testSimple [✔]
  4960. 454.46 s [doctest] it-variable [✔]
  4961. 454.46 s [doctest] it-variable in $setup [✔]
  4962. 454.46 s [doctest] failing [✔]
  4963. 454.46 s [doctest] skips subsequent examples from the same group if an example fails [✔]
  4964. 454.46 s [doctest] without --fail-fast
  4965. 454.46 s [doctest] continuous even if some tests fail [✔]
  4966. 454.46 s [doctest] with --fail-fast
  4967. 454.46 s [doctest] stops after the first failure [✔]
  4968. 454.46 s [doctest] stops after failures in $setup [✔]
  4969. 454.46 s [doctest] testImport [✔]
  4970. 454.46 s [doctest] testCommentLocation [✔]
  4971. 454.46 s [doctest] testPutStr [✔]
  4972. 454.46 s [doctest] fails on multi-line expressions, introduced with :{ [✔]
  4973. 454.46 s [doctest] testBlankline [✔]
  4974. 454.46 s [doctest] examples from the same Haddock comment share the same scope [✔]
  4975. 454.46 s [doctest] testDocumentationForArguments [✔]
  4976. 454.46 s [doctest] template-haskell [✔]
  4977. 454.46 s [doctest] handles source files with CRLF line endings [✔]
  4978. 454.46 s [doctest] runs $setup before each test group [✔]
  4979. 454.46 s [doctest] skips subsequent tests from a module, if $setup fails [✔]
  4980. 454.46 s [doctest] ignores trailing whitespace when matching test output [✔]
  4981. 454.46 s [doctest] doctest as a runner for QuickCheck properties
  4982. 454.46 s [doctest] runs a boolean property [✔]
  4983. 454.46 s [doctest] runs an explicitly quantified property [✔]
  4984. 454.46 s [doctest] runs an implicitly quantified property [✔]
  4985. 454.46 s [doctest] reports a failing property [✔]
  4986. 454.46 s [doctest] runs a boolean property with an explicit type signature [✔]
  4987. 454.46 s [doctest] runs $setup before each property [✔]
  4988. 454.46 s [doctest] doctest (regression tests)
  4989. 454.46 s [doctest] bugfixWorkingDirectory [✔]
  4990. 454.46 s [doctest] bugfixOutputToStdErr [✔]
  4991. 454.46 s [doctest] bugfixImportHierarchical [✔]
  4992. 454.46 s [doctest] bugfixMultipleModules [✔]
  4993. 454.46 s [doctest] testCPP [✔]
  4994. 454.46 s [doctest] template-haskell-bugfix [✔]
  4995. 454.46 s [doctest] doesn't clash with user bindings of stdout/stderr [✔]
  4996. 454.57 s [doctest] doesn't get confused by doctests using System.IO imports [✔]
  4997. 454.57 s [doctest] Options
  4998. 454.57 s [doctest] parseOptions
  4999. 454.57 s [doctest] strips --optghc [✔]
  5000. 454.57 s [doctest] strips --optghc= [✔]
  5001. 454.57 s [doctest] with ghc options that are not valid with --interactive
  5002. 454.59 s [doctest] returns ProxyToGhc [✔]
  5003. 454.59 s [doctest] +++ OK, passed 100 tests.
  5004. 454.59 s [doctest] with --interactive
  5005. 454.59 s [doctest] disables magic mode [✔]
  5006. 454.59 s [doctest] filters out --interactive [✔]
  5007. 454.59 s [doctest] accepts --fast [✔]
  5008. 454.59 s [doctest] --no-magic
  5009. 454.59 s [doctest] without --no-magic
  5010. 454.59 s [doctest] enables magic mode [✔]
  5011. 454.59 s [doctest] with --no-magic
  5012. 454.59 s [doctest] disables magic mode [✔]
  5013. 454.59 s [doctest] --fast
  5014. 454.59 s [doctest] without --fast
  5015. 454.59 s [doctest] disables fast mode [✔]
  5016. 454.59 s [doctest] with --fast
  5017. 454.59 s [doctest] enables fast mode [✔]
  5018. 454.59 s [doctest] --preserve-it
  5019. 454.59 s [doctest] without --preserve-it
  5020. 454.59 s [doctest] does not preserve the `it` variable [✔]
  5021. 454.59 s [doctest] with --preserve-it
  5022. 454.59 s [doctest] preserves the `it` variable [✔]
  5023. 454.59 s [doctest] --fail-fast
  5024. 454.59 s [doctest] without --fail-fast
  5025. 454.59 s [doctest] disables fail-fast mode [✔]
  5026. 454.59 s [doctest] with --fail-fast
  5027. 454.59 s [doctest] enables fail-fast mode [✔]
  5028. 454.59 s [doctest] with --help
  5029. 454.59 s [doctest] outputs usage information [✔]
  5030. 454.59 s [doctest] with --version
  5031. 454.59 s [doctest] outputs version information [✔]
  5032. 454.59 s [doctest] with --info
  5033. 454.62 s [doctest] outputs machine readable version information [✔]
  5034. 454.62 s [doctest] --verbose
  5035. 454.62 s [doctest] without --verbose
  5036. 454.62 s [doctest] is not verbose by default [✔]
  5037. 454.62 s [doctest] with --verbose
  5038. 454.62 s [doctest] parses verbose option [✔]
  5039. 454.62 s [doctest] PackageDBs
  5040. 454.62 s [doctest] getPackageDBsFromEnv
  5041. 454.62 s [doctest] uses global and user when no env used [✔]
  5042. 454.62 s [doctest] respects GHC_PACKAGE_PATH [✔]
  5043. 454.62 s [doctest] Parse
  5044. 454.62 s [doctest] extractDocTests
  5045. 454.63 s [doctest] extracts properties from a module [✔]
  5046. 454.65 s [doctest] extracts examples from a module [✔]
  5047. 454.67 s [doctest] extracts examples from documentation for non-exported names [✔]
  5048. 454.68 s [doctest] extracts multiple examples from a module [✔]
  5049. 454.70 s [doctest] returns an empty list, if documentation contains no examples [✔]
  5050. 454.72 s [doctest] sets setup code to Nothing, if it does not contain any tests [✔]
  5051. 454.74 s [doctest] keeps modules that only contain setup code [✔]
  5052. 454.74 s [doctest] parseInteractions (an internal function)
  5053. 454.74 s [doctest] parses an interaction [✔]
  5054. 454.74 s [doctest] drops whitespace as appropriate [✔]
  5055. 454.74 s [doctest] parses an interaction without a result [✔]
  5056. 454.74 s [doctest] works with a complex example [✔]
  5057. 454.74 s [doctest] attaches location information to parsed interactions [✔]
  5058. 454.74 s [doctest] basic multiline [✔]
  5059. 454.74 s [doctest] multiline align output [✔]
  5060. 454.74 s [doctest] multiline align output with >>> [✔]
  5061. 454.74 s [doctest] parses wild cards lines [✔]
  5062. 454.74 s [doctest] parses wild card chunks [✔]
  5063. 454.74 s [doctest] parseProperties (an internal function)
  5064. 454.74 s [doctest] parses a property [✔]
  5065. 454.74 s [doctest] mkLineChunks (an internal function)
  5066. 454.74 s [doctest] replaces ellipsis with WildCardChunks [✔]
  5067. 454.74 s [doctest] doesn't replace fewer than 3 consecutive dots [✔]
  5068. 454.74 s [doctest] handles leading and trailing dots [✔]
  5069. 454.74 s [doctest] handles leading and trailing ellipsis [✔]
  5070. 454.74 s [doctest] Property
  5071. 454.74 s [doctest] runProperty
  5072. 454.91 s [doctest] reports a failing property [✔]
  5073. 455.08 s [doctest] runs a Bool property [✔]
  5074. 455.24 s [doctest] runs a Bool property with an explicit type signature [✔]
  5075. 455.42 s [doctest] runs an implicitly quantified property [✔]
  5076. 455.61 s [doctest] runs an implicitly quantified property even with GHC 7.4 [✔]
  5077. 455.79 s [doctest] runs an explicitly quantified property [✔]
  5078. 455.96 s [doctest] allows to mix implicit and explicit quantification [✔]
  5079. 456.15 s [doctest] reports the value for which a property fails [✔]
  5080. 456.32 s [doctest] reports the values for which a property that takes multiple arguments fails [✔]
  5081. 456.50 s [doctest] defaults ambiguous type variables to Integer [✔]
  5082. 456.50 s [doctest] freeVariables
  5083. 456.62 s [doctest] finds a free variables in a term [✔]
  5084. 456.75 s [doctest] ignores duplicates [✔]
  5085. 456.87 s [doctest] works for terms with multiple names [✔]
  5086. 457.00 s [doctest] works for names that contain a prime [✔]
  5087. 457.12 s [doctest] works for names that are similar to other names that are in scope [✔]
  5088. 457.12 s [doctest] parseNotInScope
  5089. 457.12 s [doctest] when error message was produced by GHC 7.4.1
  5090. 457.12 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  5091. 457.12 s [doctest] ignores duplicates [✔]
  5092. 457.12 s [doctest] works for variable names that contain a prime [✔]
  5093. 457.12 s [doctest] works for error messages with suggestions [✔]
  5094. 457.12 s [doctest] when error message was produced by GHC 8.0.1
  5095. 457.12 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  5096. 457.12 s [doctest] ignores duplicates [✔]
  5097. 457.12 s [doctest] works for variable names that contain a prime [✔]
  5098. 457.12 s [doctest] works for error messages with suggestions [✔]
  5099. 457.12 s [doctest] Run
  5100. 457.12 s [doctest] doctest
  5101. 457.30 s [doctest] exits with ExitFailure if at least one test case fails [✔]
  5102. 457.30 s [doctest] prints help on --help [✔]
  5103. 457.30 s [doctest] prints version on --version [✔]
  5104. 457.52 s [doctest] accepts arbitrary GHC options [✔]
  5105. 457.73 s [doctest] accepts GHC options with --optghc [✔]
  5106. 457.94 s [doctest] prints a deprecation message for --optghc [✔]
  5107. 457.99 s [doctest] prints error message on invalid option [✔]
  5108. 458.19 s [doctest] interprets GHC response files [✔]
  5109. 458.37 s [doctest] prints verbose description of a specification [✔]
  5110. 458.61 s [doctest] prints verbose description of a property [✔]
  5111. 458.81 s [doctest] prints verbose error [✔]
  5112. 459.06 s [doctest] can deal with potentially problematic GHC options [✔]
  5113. 459.06 s [doctest] doctestWithResult
  5114. 459.06 s [doctest] on parse error
  5115. 459.08 s [doctest] aborts with (ExitFailure 1) [✔]
  5116. 459.10 s [doctest] prints a useful error message [✔]
  5117. 459.10 s [doctest] expandDirs
  5118. 459.10 s [doctest] expands a directory [✔]
  5119. 459.10 s [doctest] ignores files [✔]
  5120. 459.10 s [doctest] ignores random things [✔]
  5121. 459.10 s [doctest] Runner
  5122. 459.10 s [doctest] report
  5123. 459.10 s [doctest] when mode is interactive
  5124. 459.10 s [doctest] writes to stderr [✔]
  5125. 459.10 s [doctest] when mode is non-interactive
  5126. 459.10 s [doctest] writes to stderr [✔]
  5127. 459.10 s [doctest] report_
  5128. 459.10 s [doctest] when mode is interactive
  5129. 459.10 s [doctest] writes transient output to stderr [✔]
  5130. 459.10 s [doctest] when mode is non-interactive
  5131. 459.10 s [doctest] is ignored [✔]
  5132. 459.10 s [doctest] Runner.Example
  5133. 459.10 s [doctest] mkResult
  5134. 459.12 s [doctest] returns Equal when output matches [✔]
  5135. 459.12 s [doctest] +++ OK, passed 100 tests.
  5136. 459.12 s [doctest] ignores trailing whitespace [✔]
  5137. 459.12 s [doctest] with WildCardLine
  5138. 459.12 s [doctest] matches zero lines [✔]
  5139. 459.12 s [doctest] matches first zero line [✔]
  5140. 459.12 s [doctest] matches final zero line [✔]
  5141. 459.12 s [doctest] matches an arbitrary number of lines [✔]
  5142. 459.12 s [doctest] matches an arbitrary number of lines (quickcheck) [✔]
  5143. 459.12 s [doctest] +++ OK, passed 100 tests.
  5144. 459.12 s [doctest] with WildCardChunk
  5145. 459.12 s [doctest] matches an arbitrary line chunk [✔]
  5146. 459.12 s [doctest] matches an arbitrary line chunk at end [✔]
  5147. 459.12 s [doctest] does not match at end [✔]
  5148. 459.12 s [doctest] does not match at start [✔]
  5149. 459.12 s [doctest] when output does not match
  5150. 459.12 s [doctest] constructs failure message [✔]
  5151. 459.12 s [doctest] constructs failure message for multi-line output [✔]
  5152. 459.12 s [doctest] when any output line contains "unsafe" characters
  5153. 459.12 s [doctest] uses show to format output lines [✔]
  5154. 459.12 s [doctest] insert caret after last matching character on different lengths [✔]
  5155. 459.12 s [doctest] insert caret after mismatching line for multi-line output [✔]
  5156. 459.12 s [doctest] insert caret after mismatching line with the longest match for multi-line wildcard pattern [✔]
  5157. 459.12 s [doctest] insert caret after longest match for wildcard [✔]
  5158. 459.12 s [doctest] show expanded pattern for long matches [✔]
  5159. 459.12 s [doctest] Util
  5160. 459.12 s [doctest] convertDosLineEndings
  5161. 459.12 s [doctest] converts CRLF to LF [✔]
  5162. 459.12 s [doctest] strips a trailing CR [✔]
  5163. 459.12 s [doctest] takeWhileEnd
  5164. 459.12 s [doctest] returns the longest suffix of elements that satisfy a given predicate [✔]
  5165. 459.12 s [doctest]
  5166. 459.12 s [doctest] Finished in 15.0446 seconds
  5167. 459.12 s [doctest] 198 examples, 0 failures
  5168. 459.15 s [doctest] Test suite spec: PASS
  5169. 459.15 s [doctest] Test suite logged to: dist/test/doctest-0.24.2-spec.log
  5170. 459.15 s [doctest] 1 of 1 test suites (1 of 1 test cases) passed.
  5171. 459.16 s [doctest] Phase: haddockPhase
  5172. 459.28 s [doctest] Preprocessing library for doctest-0.24.2..
  5173. 459.29 s [doctest] Running Haddock on library for doctest-0.24.2..
  5174. 459.33 s [doctest] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  5175. 460.29 s [doctest] 0% ( 0 / 2) in 'Test.DocTest.Internal.Cabal'
  5176. 460.29 s [doctest] Missing documentation for:
  5177. 460.29 s [doctest] Module header
  5178. 460.31 s Waiting for lock on pandoc
  5179. 460.31 s [doctest] doctest (src/Test/DocTest/Internal/Cabal.hs:9)
  5180. 460.31 s [doctest] 88% ( 8 / 9) in 'Test.DocTest.Internal.Location'
  5181. 460.31 s [doctest] Missing documentation for:
  5182. 460.31 s [doctest] Module header
  5183. 460.38 s [doctest] 66% ( 2 / 3) in 'Test.DocTest.Internal.Extract'
  5184. 460.38 s [doctest] Missing documentation for:
  5185. 460.38 s [doctest] Module header
  5186. 460.41 s [doctest] 22% ( 2 / 9) in 'Test.DocTest.Internal.Parse'
  5187. 460.41 s [doctest] Missing documentation for:
  5188. 460.41 s [doctest] Module header
  5189. 460.41 s [doctest] DocTest (src/Parse.hs:29)
  5190. 460.41 s [doctest] Expression (src/Parse.hs:44)
  5191. 460.41 s [doctest] ExpectedResult (src/Parse.hs:45)
  5192. 460.41 s [doctest] ExpectedLine (src/Parse.hs:38)
  5193. 460.41 s [doctest] LineChunk (src/Parse.hs:32)
  5194. 460.41 s [doctest] parseModules (src/Parse.hs:59)
  5195. 460.46 s [doctest] Warning: 'report_' is out of scope.
  5196. 460.46 s [doctest] If you qualify the identifier, haddock can try to link it anyway.
  5197. 460.49 s [doctest] 15% ( 2 / 13) in 'Test.DocTest.Internal.Run'
  5198. 460.49 s [doctest] Missing documentation for:
  5199. 460.49 s [doctest] Module header
  5200. 460.49 s [doctest] doctestWithRepl (src/Run.hs:66)
  5201. 460.49 s [doctest] Config (src/Options.hs:58)
  5202. 460.49 s [doctest] defaultConfig (src/Options.hs:67)
  5203. 460.49 s [doctest] doctestWith (src/Run.hs:136)
  5204. 460.49 s [doctest] Result (src/Run.hs:139)
  5205. 460.49 s [doctest] formatSummary (src/Runner.hs:57)
  5206. 460.49 s [doctest] isSuccess (src/Runner.hs:54)
  5207. 460.49 s [doctest] evaluateResult (src/Run.hs:141)
  5208. 460.49 s [doctest] doctestWithResult (src/Run.hs:144)
  5209. 460.49 s [doctest] runDocTests (src/Run.hs:154)
  5210. 460.49 s [doctest] 50% ( 1 / 2) in 'Test.DocTest'
  5211. 460.49 s [doctest] Missing documentation for:
  5212. 460.49 s [doctest] Module header
  5213. 466.11 s [doctest] Documentation created: dist/doc/html/doctest/index.html,
  5214. 466.15 s [doctest] dist/doc/html/doctest/doctest.txt
  5215. 466.18 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2..
  5216. 466.18 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2..
  5217. 466.20 s [doctest] Phase: installPhase
  5218. 466.26 s [doctest] Installing library in /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  5219. 466.40 s [doctest] Installing executable doctest in /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin
  5220. 466.40 s [doctest] Warning: The directory
  5221. 466.40 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin is not in the
  5222. 466.40 s [doctest] system search path.
  5223. 467.25 s [doctest] Phase: fixupPhase
  5224. 467.27 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2
  5225. 467.27 s [doctest] shrinking /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSdoctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88-ghc9.4.8.so
  5226. 467.30 s [doctest] shrinking /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin/doctest
  5227. 467.40 s [doctest] checking for references to /build/ in /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2...
  5228. 467.50 s [doctest] patching script interpreter paths in /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2
  5229. 467.50 s [doctest] stripping (with command strip and flags -S -p) in /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/lib /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin
  5230. 467.76 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc
  5231. 467.77 s [doctest] checking for references to /build/ in /nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc...
  5232. 467.79 s [doctest] patching script interpreter paths in /nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc
  5233. 468.01 s [doctest:post-build] Uploading to cachix cache "sellout": /nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2
  5234. 468.47 s [doctest:post-build] Pushing 2 paths (49 are already present) using zstd to cache sellout ⏳
  5235. 468.47 s [doctest:post-build]
  5236. 468.82 s [doctest:post-build] Pushing /nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc (1.83 MiB)
  5237. 468.89 s [doctest:post-build] Pushing /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2 (73.63 MiB)
  5238. 471.24 s [doctest:post-build]
  5239. 471.29 s [doctest:post-build] All done.
  5240. 471.29 s [doctest:post-build] Uploading to the NixCI cache: /nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2
  5241. 471.32 s [doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5242. 471.33 s [doctest:post-build] copying 2 paths...
  5243. 471.33 s [doctest:post-build] copying path '/nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc' to 'https://cache.nix-ci.com'...
  5244. 471.90 s [doctest:post-build] copying path '/nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2' to 'https://cache.nix-ci.com'...
  5245. 509.89 s [doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5246. 510.21 s [doctest:post-build] copying 1 paths...
  5247. 510.25 s [doctest:post-build] copying path '/nix/store/k7k1z2d30zr0ird9kl6v9cjxds6vpaws-doctest-0.24.2.drv' to 'https://cache.nix-ci.com'...
  5248. 510.46 s Progress: 26 of 44 built, 373 of 373 downloaded from cache
  5249. 510.58 s Building /nix/store/vk0hh2yldk3zdscmvxi5ni5fz9wvb06q-vector-0.13.2.0.drv
  5250. 510.77 s [vector] Phase: setupCompilerEnvironmentPhase
  5251. 510.78 s [vector] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  5252. 511.08 s [vector] Phase: unpackPhase
  5253. 511.09 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  5254. 511.11 s [vector] source root is vector-0.13.2.0
  5255. 511.13 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  5256. 511.15 s [vector] Phase: patchPhase
  5257. 511.15 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/2.cabal.
  5258. 511.17 s [vector] Run jailbreak-cabal to lift version restrictions on build inputs.
  5259. 511.23 s [vector] Phase: compileBuildDriverPhase
  5260. 511.23 s [vector] setupCompileFlags: -package-db=/build/tmp.bF21TrzHiC/setup-package.conf.d -threaded
  5261. 511.35 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.bF21TrzHiC/Main.o )
  5262. 511.45 s [vector] [2 of 2] Linking Setup
  5263. 513.31 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  5264. 513.33 s [vector] Phase: configurePhase
  5265. 513.34 s [vector] configureFlags: --verbose --prefix=/nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.bF21TrzHiC/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 --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/lib
  5266. 514.05 s [vector] Using Parsec parser
  5267. 514.05 s [vector] Configuring vector-0.13.2.0...
  5268. 514.05 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  5269. 514.05 s [vector] wall=False
  5270. 514.05 s [vector] Dependency base: using base-4.17.2.1
  5271. 514.05 s [vector] Dependency deepseq: using deepseq-1.4.8.0
  5272. 514.05 s [vector] Dependency primitive: using primitive-0.9.1.0
  5273. 514.05 s [vector] Dependency vector-stream: using vector-stream-0.1.0.1
  5274. 514.05 s [vector] Dependency base: using base-4.17.2.1
  5275. 514.05 s [vector] Dependency random: using random-1.2.1.3
  5276. 514.05 s [vector] Dependency tasty: using tasty-1.5.3
  5277. 514.05 s [vector] Dependency vector: using vector-0.13.2.0
  5278. 514.05 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  5279. 514.05 s [vector] Dependency base: using base-4.17.2.1
  5280. 514.05 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  5281. 514.05 s [vector] Dependency primitive: using primitive-0.9.1.0
  5282. 514.05 s [vector] Dependency random: using random-1.2.1.3
  5283. 514.05 s [vector] Dependency tasty: using tasty-1.5.3
  5284. 514.05 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  5285. 514.05 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  5286. 514.05 s [vector] Dependency template-haskell: using template-haskell-2.19.0.0
  5287. 514.05 s [vector] Dependency transformers: using transformers-0.5.6.2
  5288. 514.05 s [vector] Dependency vector: using vector-0.13.2.0
  5289. 514.05 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  5290. 514.05 s [vector] Dependency base: using base-4.17.2.1
  5291. 514.05 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  5292. 514.05 s [vector] Dependency primitive: using primitive-0.9.1.0
  5293. 514.05 s [vector] Dependency random: using random-1.2.1.3
  5294. 514.05 s [vector] Dependency tasty: using tasty-1.5.3
  5295. 514.05 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  5296. 514.05 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  5297. 514.05 s [vector] Dependency template-haskell: using template-haskell-2.19.0.0
  5298. 514.05 s [vector] Dependency transformers: using transformers-0.5.6.2
  5299. 514.05 s [vector] Dependency vector: using vector-0.13.2.0
  5300. 514.05 s [vector] Dependency base: using base-4.17.2.1
  5301. 514.05 s [vector] Dependency doctest: using doctest-0.24.2
  5302. 514.05 s [vector] Dependency primitive: using primitive-0.9.1.0
  5303. 514.05 s [vector] Dependency vector: using vector-0.13.2.0
  5304. 514.05 s [vector] Dependency base: using base-4.17.2.1
  5305. 514.05 s [vector] Dependency primitive: using primitive-0.9.1.0
  5306. 514.05 s [vector] Dependency tasty: using tasty-1.5.3
  5307. 514.05 s [vector] Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
  5308. 514.05 s [vector] Dependency vector: using vector-0.13.2.0
  5309. 514.37 s [vector] Source component graph:
  5310. 514.37 s [vector] component lib
  5311. 514.37 s [vector] component lib:benchmarks-O2 dependency lib
  5312. 514.37 s [vector] component test:vector-doctest dependency lib
  5313. 514.37 s [vector] component test:vector-inspection dependency lib
  5314. 514.37 s [vector] component test:vector-tests-O0 dependency lib
  5315. 514.37 s [vector] component test:vector-tests-O2 dependency lib
  5316. 514.37 s [vector] Configured component graph:
  5317. 514.37 s [vector] component vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5318. 514.37 s [vector] include base-4.17.2.1
  5319. 514.37 s [vector] include deepseq-1.4.8.0
  5320. 514.37 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5321. 514.37 s [vector] include vector-stream-0.1.0.1-F03bfhC0HhqL26lQDSs4vb
  5322. 514.37 s [vector] component vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2
  5323. 514.37 s [vector] include base-4.17.2.1
  5324. 514.37 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  5325. 514.37 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  5326. 514.37 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5327. 514.37 s [vector] component vector-0.13.2.0-BrHxLv2KUPv5Fn8v7eQoOx-vector-doctest
  5328. 514.37 s [vector] include base-4.17.2.1
  5329. 514.37 s [vector] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  5330. 514.37 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5331. 514.37 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5332. 514.37 s [vector] component vector-0.13.2.0-5Q4kMcUxhdwEKrCweElQP4-vector-inspection
  5333. 514.37 s [vector] include base-4.17.2.1
  5334. 514.37 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5335. 514.37 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  5336. 514.37 s [vector] include tasty-inspection-testing-0.2.1-48CUMaIHGWv8RqzO1O1dns
  5337. 514.37 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5338. 514.37 s [vector] component vector-0.13.2.0-HRM4UhWJxA9CssEeWd3cIj-vector-tests-O0
  5339. 514.37 s [vector] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  5340. 514.37 s [vector] include base-4.17.2.1
  5341. 514.37 s [vector] include base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  5342. 514.37 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5343. 514.37 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  5344. 514.37 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  5345. 514.37 s [vector] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  5346. 514.37 s [vector] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  5347. 514.37 s [vector] include template-haskell-2.19.0.0
  5348. 514.37 s [vector] include transformers-0.5.6.2
  5349. 514.37 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5350. 514.37 s [vector] component vector-0.13.2.0-HvmzB5mUEm43fHZBv42gz1-vector-tests-O2
  5351. 514.37 s [vector] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  5352. 514.37 s [vector] include base-4.17.2.1
  5353. 514.37 s [vector] include base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  5354. 514.37 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5355. 514.37 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  5356. 514.37 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  5357. 514.37 s [vector] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  5358. 514.37 s [vector] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  5359. 514.37 s [vector] include template-haskell-2.19.0.0
  5360. 514.37 s [vector] include transformers-0.5.6.2
  5361. 514.37 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5362. 514.37 s [vector] Linked component graph:
  5363. 514.37 s [vector] unit vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5364. 514.37 s [vector] include base-4.17.2.1
  5365. 514.37 s [vector] include deepseq-1.4.8.0
  5366. 514.37 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5367. 514.37 s [vector] include vector-stream-0.1.0.1-F03bfhC0HhqL26lQDSs4vb
  5368. 514.37 s [vector] Data.Vector=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Unboxed.Mutable
  5369. 514.37 s [vector] unit vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2
  5370. 514.37 s [vector] include base-4.17.2.1
  5371. 514.37 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  5372. 514.37 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  5373. 514.37 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5374. 514.37 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.TestData.ParenTree
  5375. 514.37 s [vector] unit vector-0.13.2.0-BrHxLv2KUPv5Fn8v7eQoOx-vector-doctest
  5376. 514.37 s [vector] include base-4.17.2.1
  5377. 514.37 s [vector] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  5378. 514.37 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5379. 514.37 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5380. 514.37 s [vector] unit vector-0.13.2.0-5Q4kMcUxhdwEKrCweElQP4-vector-inspection
  5381. 514.37 s [vector] include base-4.17.2.1
  5382. 514.37 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5383. 514.37 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  5384. 514.37 s [vector] include tasty-inspection-testing-0.2.1-48CUMaIHGWv8RqzO1O1dns
  5385. 514.37 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5386. 514.37 s [vector] unit vector-0.13.2.0-HRM4UhWJxA9CssEeWd3cIj-vector-tests-O0
  5387. 514.37 s [vector] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  5388. 514.37 s [vector] include base-4.17.2.1
  5389. 514.37 s [vector] include base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  5390. 514.37 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5391. 514.37 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  5392. 514.37 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  5393. 514.37 s [vector] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  5394. 514.37 s [vector] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  5395. 514.37 s [vector] include template-haskell-2.19.0.0
  5396. 514.37 s [vector] include transformers-0.5.6.2
  5397. 514.37 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5398. 514.37 s [vector] unit vector-0.13.2.0-HvmzB5mUEm43fHZBv42gz1-vector-tests-O2
  5399. 514.37 s [vector] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  5400. 514.37 s [vector] include base-4.17.2.1
  5401. 514.37 s [vector] include base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  5402. 514.65 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5403. 514.65 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  5404. 514.65 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  5405. 514.65 s [vector] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  5406. 514.65 s [vector] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  5407. 514.65 s [vector] include template-haskell-2.19.0.0
  5408. 514.65 s [vector] include transformers-0.5.6.2
  5409. 514.65 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5410. 514.65 s [vector] Ready component graph:
  5411. 514.65 s [vector] definite vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5412. 514.65 s [vector] depends base-4.17.2.1
  5413. 514.65 s [vector] depends deepseq-1.4.8.0
  5414. 514.65 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5415. 514.65 s [vector] depends vector-stream-0.1.0.1-F03bfhC0HhqL26lQDSs4vb
  5416. 514.65 s [vector] definite vector-0.13.2.0-BrHxLv2KUPv5Fn8v7eQoOx-vector-doctest
  5417. 514.65 s [vector] depends base-4.17.2.1
  5418. 514.65 s [vector] depends doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  5419. 514.65 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5420. 514.65 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5421. 514.65 s [vector] definite vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2
  5422. 514.65 s [vector] depends base-4.17.2.1
  5423. 514.65 s [vector] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  5424. 514.65 s [vector] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  5425. 514.65 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5426. 514.65 s [vector] definite vector-0.13.2.0-HRM4UhWJxA9CssEeWd3cIj-vector-tests-O0
  5427. 514.65 s [vector] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  5428. 514.65 s [vector] depends base-4.17.2.1
  5429. 514.65 s [vector] depends base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  5430. 514.65 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5431. 514.65 s [vector] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  5432. 514.65 s [vector] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  5433. 514.65 s [vector] depends tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  5434. 514.65 s [vector] depends tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  5435. 514.65 s [vector] depends template-haskell-2.19.0.0
  5436. 514.65 s [vector] depends transformers-0.5.6.2
  5437. 514.65 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5438. 514.65 s [vector] definite vector-0.13.2.0-HvmzB5mUEm43fHZBv42gz1-vector-tests-O2
  5439. 514.65 s [vector] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  5440. 514.65 s [vector] depends base-4.17.2.1
  5441. 514.65 s [vector] depends base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  5442. 514.65 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5443. 514.65 s [vector] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  5444. 514.65 s [vector] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  5445. 514.65 s [vector] depends tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  5446. 514.65 s [vector] depends tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  5447. 514.65 s [vector] depends template-haskell-2.19.0.0
  5448. 514.65 s [vector] depends transformers-0.5.6.2
  5449. 514.65 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5450. 514.65 s [vector] definite vector-0.13.2.0-5Q4kMcUxhdwEKrCweElQP4-vector-inspection
  5451. 514.65 s [vector] depends base-4.17.2.1
  5452. 514.65 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  5453. 514.66 s [vector] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  5454. 514.66 s [vector] depends tasty-inspection-testing-0.2.1-48CUMaIHGWv8RqzO1O1dns
  5455. 514.66 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5456. 514.66 s [vector] Using Cabal-3.8.1.0 compiled by ghc-9.4
  5457. 514.66 s [vector] Using compiler: ghc-9.4.8
  5458. 514.66 s [vector] Using install prefix:
  5459. 514.66 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0
  5460. 514.66 s [vector] Executables installed in:
  5461. 514.66 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/bin
  5462. 514.66 s [vector] Libraries installed in:
  5463. 514.66 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  5464. 514.66 s [vector] Dynamic Libraries installed in:
  5465. 514.66 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  5466. 514.66 s [vector] Private executables installed in:
  5467. 514.66 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.4.8/vector-0.13.2.0
  5468. 514.66 s [vector] Data files installed in:
  5469. 514.66 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/share/x86_64-linux-ghc-9.4.8/vector-0.13.2.0
  5470. 514.66 s [vector] Documentation installed in:
  5471. 514.66 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.4.8/vector-0.13.2.0
  5472. 514.66 s [vector] Configuration files installed in:
  5473. 514.66 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/etc
  5474. 514.66 s [vector] No alex found
  5475. 514.66 s [vector] Using ar found on system at:
  5476. 514.66 s [vector] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  5477. 514.66 s [vector] No c2hs found
  5478. 514.66 s [vector] No cpphs found
  5479. 514.66 s [vector] Using doctest version 0.24.2 found on system at:
  5480. 514.66 s [vector] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin/doctest
  5481. 514.66 s [vector] Using gcc version 14.3.0 given by user at:
  5482. 514.66 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  5483. 514.66 s [vector] Using ghc version 9.4.8 found on system at:
  5484. 514.66 s [vector] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  5485. 514.66 s [vector] Using ghc-pkg version 9.4.8 found on system at:
  5486. 514.66 s [vector] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  5487. 514.66 s [vector] No ghcjs found
  5488. 514.66 s [vector] No ghcjs-pkg found
  5489. 514.66 s [vector] No greencard found
  5490. 514.66 s [vector] Using haddock version 2.27.0 found on system at:
  5491. 514.66 s [vector] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  5492. 514.66 s [vector] No happy found
  5493. 514.66 s [vector] Using haskell-suite found on system at: haskell-suite-dummy-location
  5494. 514.66 s [vector] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  5495. 514.66 s [vector] No hmake found
  5496. 514.66 s [vector] Using hpc version 0.68 found on system at:
  5497. 514.66 s [vector] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  5498. 514.66 s [vector] Using hsc2hs version 0.68.8 found on system at:
  5499. 514.66 s [vector] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  5500. 514.66 s [vector] Using hscolour version 1.25 found on system at:
  5501. 514.66 s [vector] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  5502. 514.66 s [vector] No jhc found
  5503. 514.66 s [vector] Using ld found on system at:
  5504. 514.66 s [vector] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  5505. 514.66 s [vector] No pkg-config found
  5506. 514.66 s [vector] Using runghc version 9.4.8 found on system at:
  5507. 514.66 s [vector] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  5508. 514.66 s [vector] Using strip version 2.44 found on system at:
  5509. 514.66 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  5510. 514.66 s [vector] Using tar found on system at:
  5511. 514.66 s [vector] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  5512. 514.66 s [vector] No uhc found
  5513. 514.67 s [vector] Phase: buildPhase
  5514. 514.79 s [vector] Preprocessing library for vector-0.13.2.0..
  5515. 514.80 s [vector] Building library for vector-0.13.2.0..
  5516. 515.66 s [vector] [ 1 of 23] Compiling Data.Vector.Fusion.Stream.Monadic ( src/Data/Vector/Fusion/Stream/Monadic.hs, dist/build/Data/Vector/Fusion/Stream/Monadic.o, dist/build/Data/Vector/Fusion/Stream/Monadic.dyn_o )
  5517. 515.87 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.o, dist/build/Data/Vector/Fusion/Util.dyn_o )
  5518. 515.90 s [vector] [ 3 of 23] Compiling Data.Vector.Fusion.Bundle.Size ( src/Data/Vector/Fusion/Bundle/Size.hs, dist/build/Data/Vector/Fusion/Bundle/Size.o, dist/build/Data/Vector/Fusion/Bundle/Size.dyn_o )
  5519. 516.23 s [vector] [ 4 of 23] Compiling Data.Vector.Generic.Mutable.Base ( src/Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.o, dist/build/Data/Vector/Generic/Mutable/Base.dyn_o )
  5520. 516.23 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.o, dist/build/Data/Vector/Generic/Base.dyn_o )
  5521. 516.23 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.o, dist/build/Data/Vector/Internal/Check.dyn_o )
  5522. 516.23 s [vector] [ 7 of 23] Compiling Data.Vector.Fusion.Bundle.Monadic ( src/Data/Vector/Fusion/Bundle/Monadic.hs, dist/build/Data/Vector/Fusion/Bundle/Monadic.o, dist/build/Data/Vector/Fusion/Bundle/Monadic.dyn_o )
  5523. 525.82 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.o, dist/build/Data/Vector/Fusion/Bundle.dyn_o )
  5524. 531.45 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.o, dist/build/Data/Vector/Generic/Mutable.dyn_o )
  5525. 536.23 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.o, dist/build/Data/Vector/Generic/New.dyn_o )
  5526. 537.19 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.o, dist/build/Data/Vector/Generic.dyn_o )
  5527. 551.09 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.o, dist/build/Data/Vector/Mutable.dyn_o )
  5528. 551.13 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  5529. 561.93 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.o, dist/build/Data/Vector/Primitive/Mutable.dyn_o )
  5530. 561.97 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.o, dist/build/Data/Vector/Primitive.dyn_o )
  5531. 561.97 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.o, dist/build/Data/Vector/Storable/Internal.dyn_o )
  5532. 561.97 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.o, dist/build/Data/Vector/Storable/Mutable.dyn_o )
  5533. 561.97 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.o, dist/build/Data/Vector/Storable.dyn_o )
  5534. 561.97 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.o, dist/build/Data/Vector/Strict/Mutable.dyn_o )
  5535. 561.97 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.o, dist/build/Data/Vector/Strict.dyn_o )
  5536. 569.31 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.o, dist/build/Data/Vector/Unboxed/Base.dyn_o )
  5537. 575.81 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.o, dist/build/Data/Vector/Unboxed.dyn_o )
  5538. 582.82 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.o, dist/build/Data/Vector/Unboxed/Mutable.dyn_o )
  5539. 583.52 s [vector] [ 1 of 23] Compiling Data.Vector.Fusion.Stream.Monadic ( src/Data/Vector/Fusion/Stream/Monadic.hs, dist/build/Data/Vector/Fusion/Stream/Monadic.p_o )
  5540. 583.68 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  5541. 583.68 s [vector] [ 3 of 23] Compiling Data.Vector.Fusion.Bundle.Size ( src/Data/Vector/Fusion/Bundle/Size.hs, dist/build/Data/Vector/Fusion/Bundle/Size.p_o )
  5542. 583.97 s [vector] [ 4 of 23] Compiling Data.Vector.Generic.Mutable.Base ( src/Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.p_o )
  5543. 583.97 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  5544. 583.97 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  5545. 583.97 s [vector] [ 7 of 23] Compiling Data.Vector.Fusion.Bundle.Monadic ( src/Data/Vector/Fusion/Bundle/Monadic.hs, dist/build/Data/Vector/Fusion/Bundle/Monadic.p_o )
  5546. 590.23 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  5547. 593.70 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  5548. 596.90 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  5549. 597.75 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  5550. 606.39 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  5551. 606.39 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  5552. 613.79 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  5553. 613.83 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  5554. 613.83 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  5555. 613.83 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  5556. 613.83 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  5557. 614.14 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  5558. 614.14 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  5559. 621.39 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  5560. 628.92 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  5561. 636.60 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  5562. 637.96 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0..
  5563. 637.96 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0..
  5564. 638.02 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  5565. 638.33 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  5566. 640.04 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0..
  5567. 640.04 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0..
  5568. 640.11 s [vector] [ 1 of 14] Compiling Bench.Vector.Algo.AwShCC ( benchlib/Bench/Vector/Algo/AwShCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.o, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.dyn_o )
  5569. 641.59 s [vector] [ 2 of 14] Compiling Bench.Vector.Algo.FindIndexR ( benchlib/Bench/Vector/Algo/FindIndexR.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.o, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.dyn_o )
  5570. 641.59 s [vector] [ 3 of 14] Compiling Bench.Vector.Algo.HybCC ( benchlib/Bench/Vector/Algo/HybCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.o, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.dyn_o )
  5571. 641.65 s [vector] [ 4 of 14] Compiling Bench.Vector.Algo.Leaffix ( benchlib/Bench/Vector/Algo/Leaffix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.dyn_o )
  5572. 641.69 s [vector] [ 5 of 14] Compiling Bench.Vector.Algo.ListRank ( benchlib/Bench/Vector/Algo/ListRank.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.o, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.dyn_o )
  5573. 641.69 s [vector] [ 6 of 14] Compiling Bench.Vector.Algo.MutableSet ( benchlib/Bench/Vector/Algo/MutableSet.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.o, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.dyn_o )
  5574. 641.69 s [vector] [ 7 of 14] Compiling Bench.Vector.Algo.NextPermutation ( benchlib/Bench/Vector/Algo/NextPermutation.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.o, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.dyn_o )
  5575. 641.69 s [vector] [ 8 of 14] Compiling Bench.Vector.Algo.Quickhull ( benchlib/Bench/Vector/Algo/Quickhull.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.dyn_o )
  5576. 641.69 s [vector] [ 9 of 14] Compiling Bench.Vector.Algo.Rootfix ( benchlib/Bench/Vector/Algo/Rootfix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.dyn_o )
  5577. 641.69 s [vector] [10 of 14] Compiling Bench.Vector.Algo.Spectral ( benchlib/Bench/Vector/Algo/Spectral.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.dyn_o )
  5578. 641.69 s [vector] [11 of 14] Compiling Bench.Vector.Algo.Tridiag ( benchlib/Bench/Vector/Algo/Tridiag.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.dyn_o )
  5579. 641.69 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.o, dist/build/benchmarks-O2/Bench/Vector/Tasty.dyn_o )
  5580. 641.69 s [vector] [13 of 14] Compiling Bench.Vector.TestData.Graph ( benchlib/Bench/Vector/TestData/Graph.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.o, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.dyn_o )
  5581. 641.69 s [vector] [14 of 14] Compiling Bench.Vector.TestData.ParenTree ( benchlib/Bench/Vector/TestData/ParenTree.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.o, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.dyn_o )
  5582. 641.94 s [vector] [ 1 of 14] Compiling Bench.Vector.Algo.AwShCC ( benchlib/Bench/Vector/Algo/AwShCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.p_o )
  5583. 645.55 s [vector] [ 2 of 14] Compiling Bench.Vector.Algo.FindIndexR ( benchlib/Bench/Vector/Algo/FindIndexR.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.p_o )
  5584. 645.55 s [vector] [ 3 of 14] Compiling Bench.Vector.Algo.HybCC ( benchlib/Bench/Vector/Algo/HybCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.p_o )
  5585. 645.58 s [vector] [ 4 of 14] Compiling Bench.Vector.Algo.Leaffix ( benchlib/Bench/Vector/Algo/Leaffix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.p_o )
  5586. 645.58 s [vector] [ 5 of 14] Compiling Bench.Vector.Algo.ListRank ( benchlib/Bench/Vector/Algo/ListRank.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.p_o )
  5587. 645.58 s [vector] [ 6 of 14] Compiling Bench.Vector.Algo.MutableSet ( benchlib/Bench/Vector/Algo/MutableSet.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.p_o )
  5588. 645.58 s [vector] [ 7 of 14] Compiling Bench.Vector.Algo.NextPermutation ( benchlib/Bench/Vector/Algo/NextPermutation.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.p_o )
  5589. 645.58 s [vector] [ 8 of 14] Compiling Bench.Vector.Algo.Quickhull ( benchlib/Bench/Vector/Algo/Quickhull.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.p_o )
  5590. 645.58 s [vector] [ 9 of 14] Compiling Bench.Vector.Algo.Rootfix ( benchlib/Bench/Vector/Algo/Rootfix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.p_o )
  5591. 645.58 s [vector] [10 of 14] Compiling Bench.Vector.Algo.Spectral ( benchlib/Bench/Vector/Algo/Spectral.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.p_o )
  5592. 645.58 s [vector] [11 of 14] Compiling Bench.Vector.Algo.Tridiag ( benchlib/Bench/Vector/Algo/Tridiag.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.p_o )
  5593. 645.58 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  5594. 645.58 s [vector] [13 of 14] Compiling Bench.Vector.TestData.Graph ( benchlib/Bench/Vector/TestData/Graph.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.p_o )
  5595. 645.58 s [vector] [14 of 14] Compiling Bench.Vector.TestData.ParenTree ( benchlib/Bench/Vector/TestData/ParenTree.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.p_o )
  5596. 647.02 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0..
  5597. 647.02 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0..
  5598. 647.11 s [vector] [ 1 of 12] Compiling Boilerplater ( tests/Boilerplater.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Boilerplater.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Boilerplater.dyn_o )
  5599. 647.24 s [vector] [ 2 of 12] Compiling Tests.Vector.UnitTests ( tests/Tests/Vector/UnitTests.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/UnitTests.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/UnitTests.dyn_o )
  5600. 648.79 s [vector] [ 3 of 12] Compiling Utilities ( tests/Utilities.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Utilities.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Utilities.dyn_o )
  5601. 648.79 s [vector] [ 4 of 12] Compiling Tests.Vector.Property ( tests/Tests/Vector/Property.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Property.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Property.dyn_o )
  5602. 650.33 s [vector] [ 5 of 12] Compiling Tests.Vector.Unboxed ( tests/Tests/Vector/Unboxed.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Unboxed.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Unboxed.dyn_o )
  5603. 650.52 s [vector] [ 6 of 12] Compiling Tests.Vector.Strict ( tests/Tests/Vector/Strict.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Strict.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Strict.dyn_o )
  5604. 650.52 s [vector] [ 7 of 12] Compiling Tests.Vector.Storable ( tests/Tests/Vector/Storable.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Storable.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Storable.dyn_o )
  5605. 650.52 s [vector] [ 8 of 12] Compiling Tests.Vector.Primitive ( tests/Tests/Vector/Primitive.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Primitive.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Primitive.dyn_o )
  5606. 650.52 s [vector] [ 9 of 12] Compiling Tests.Vector.Boxed ( tests/Tests/Vector/Boxed.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Boxed.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Boxed.dyn_o )
  5607. 650.52 s [vector] [10 of 12] Compiling Tests.Move ( tests/Tests/Move.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Move.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Move.dyn_o )
  5608. 650.52 s [vector] [11 of 12] Compiling Tests.Bundle ( tests/Tests/Bundle.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Bundle.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Bundle.dyn_o )
  5609. 650.52 s [vector] [12 of 12] Compiling Main ( tests/Main.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Main.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Main.dyn_o )
  5610. 651.34 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  5611. 652.89 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0..
  5612. 652.93 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0..
  5613. 653.06 s [vector] [ 1 of 12] Compiling Boilerplater ( tests/Boilerplater.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Boilerplater.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Boilerplater.dyn_o )
  5614. 653.61 s [vector] [ 2 of 12] Compiling Tests.Vector.UnitTests ( tests/Tests/Vector/UnitTests.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/UnitTests.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/UnitTests.dyn_o )
  5615. 665.29 s [vector] [ 3 of 12] Compiling Utilities ( tests/Utilities.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.dyn_o )
  5616. 665.33 s [vector] [ 4 of 12] Compiling Tests.Vector.Property ( tests/Tests/Vector/Property.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Property.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Property.dyn_o )
  5617. 675.96 s [vector] [ 5 of 12] Compiling Tests.Vector.Unboxed ( tests/Tests/Vector/Unboxed.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Unboxed.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Unboxed.dyn_o )
  5618. 727.56 s [vector] [ 6 of 12] Compiling Tests.Vector.Strict ( tests/Tests/Vector/Strict.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Strict.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Strict.dyn_o )
  5619. 727.60 s [vector] [ 7 of 12] Compiling Tests.Vector.Storable ( tests/Tests/Vector/Storable.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Storable.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Storable.dyn_o )
  5620. 727.60 s [vector] [ 8 of 12] Compiling Tests.Vector.Primitive ( tests/Tests/Vector/Primitive.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Primitive.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Primitive.dyn_o )
  5621. 727.60 s [vector] [ 9 of 12] Compiling Tests.Vector.Boxed ( tests/Tests/Vector/Boxed.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Boxed.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Boxed.dyn_o )
  5622. 727.60 s [vector] [10 of 12] Compiling Tests.Move ( tests/Tests/Move.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Move.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Move.dyn_o )
  5623. 727.60 s [vector] [11 of 12] Compiling Tests.Bundle ( tests/Tests/Bundle.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Bundle.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Bundle.dyn_o )
  5624. 727.60 s [vector] [12 of 12] Compiling Main ( tests/Main.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Main.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Main.dyn_o )
  5625. 728.18 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  5626. 729.25 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0..
  5627. 729.25 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0..
  5628. 729.41 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o, dist/build/vector-inspection/vector-inspection-tmp/Inspect.dyn_o )
  5629. 730.11 s [vector] [2 of 4] Compiling Inspect.DerivingVia.OtherFoo ( tests-inspect/Inspect/DerivingVia/OtherFoo.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia/OtherFoo.o, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia/OtherFoo.dyn_o )
  5630. 730.11 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.dyn_o )
  5631. 731.29 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  5632. 732.03 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  5633. 733.05 s [vector] buildPhase completed in 3 minutes 38 seconds
  5634. 733.05 s [vector] Phase: checkPhase
  5635. 733.08 s [vector] Running 2 test suites...
  5636. 733.08 s [vector] Test suite vector-tests-O0: RUNNING...
  5637. 733.38 s [vector] toplevel
  5638. 733.38 s [vector] Data.Vector.Fusion.Bundle
  5639. 733.38 s [vector] fromList.toList == id: OK
  5640. 733.38 s [vector] +++ OK, passed 100 tests.
  5641. 733.38 s [vector] toList.fromList == id: OK
  5642. 733.38 s [vector] +++ OK, passed 100 tests.
  5643. 733.41 s [vector] eq: OK
  5644. 733.41 s [vector] +++ OK, passed 100 tests.
  5645. 733.41 s [vector] length: OK
  5646. 733.41 s [vector] +++ OK, passed 100 tests.
  5647. 733.41 s [vector] null: OK
  5648. 733.41 s [vector] +++ OK, passed 100 tests.
  5649. 733.41 s [vector] empty: OK
  5650. 733.41 s [vector] +++ OK, passed 100 tests.
  5651. 733.41 s [vector] singleton: OK
  5652. 733.41 s [vector] +++ OK, passed 100 tests.
  5653. 733.41 s [vector] replicate: OK
  5654. 733.41 s [vector] +++ OK, passed 100 tests.
  5655. 733.41 s [vector] cons: OK
  5656. 733.41 s [vector] +++ OK, passed 100 tests.
  5657. 733.41 s [vector] snoc: OK
  5658. 733.41 s [vector] +++ OK, passed 100 tests.
  5659. 733.41 s [vector] append: OK
  5660. 733.41 s [vector] +++ OK, passed 100 tests.
  5661. 733.41 s [vector] head: OK
  5662. 733.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5663. 733.41 s [vector] last: OK
  5664. 733.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5665. 733.41 s [vector] index: OK
  5666. 733.41 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5667. 733.41 s [vector] extract: OK
  5668. 733.41 s [vector] +++ OK, passed 100 tests.
  5669. 733.41 s [vector] init: OK
  5670. 733.41 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5671. 733.41 s [vector] tail: OK
  5672. 733.41 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5673. 733.41 s [vector] take: OK
  5674. 733.41 s [vector] +++ OK, passed 100 tests.
  5675. 733.41 s [vector] drop: OK
  5676. 733.41 s [vector] +++ OK, passed 100 tests.
  5677. 733.41 s [vector] map: OK
  5678. 733.41 s [vector] +++ OK, passed 100 tests.
  5679. 733.41 s [vector] zipWith: OK
  5680. 733.41 s [vector] +++ OK, passed 100 tests.
  5681. 733.41 s [vector] zipWith3: OK
  5682. 733.41 s [vector] +++ OK, passed 100 tests.
  5683. 733.41 s [vector] filter: OK
  5684. 733.41 s [vector] +++ OK, passed 100 tests.
  5685. 733.41 s [vector] takeWhile: OK
  5686. 733.41 s [vector] +++ OK, passed 100 tests.
  5687. 733.41 s [vector] dropWhile: OK
  5688. 733.41 s [vector] +++ OK, passed 100 tests.
  5689. 733.41 s [vector] elem: OK
  5690. 733.41 s [vector] +++ OK, passed 100 tests.
  5691. 733.41 s [vector] notElem: OK
  5692. 733.41 s [vector] +++ OK, passed 100 tests.
  5693. 733.41 s [vector] find: OK
  5694. 733.41 s [vector] +++ OK, passed 100 tests.
  5695. 733.41 s [vector] findIndex: OK
  5696. 733.41 s [vector] +++ OK, passed 100 tests.
  5697. 733.41 s [vector] foldl: OK
  5698. 733.42 s [vector] +++ OK, passed 100 tests.
  5699. 733.42 s [vector] foldl1: OK
  5700. 733.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5701. 733.42 s [vector] foldl': OK
  5702. 733.42 s [vector] +++ OK, passed 100 tests.
  5703. 733.42 s [vector] foldl1': OK
  5704. 733.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5705. 733.42 s [vector] foldr: OK
  5706. 733.42 s [vector] +++ OK, passed 100 tests.
  5707. 733.42 s [vector] foldr1: OK
  5708. 733.42 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5709. 733.42 s [vector] prescanl: OK
  5710. 733.42 s [vector] +++ OK, passed 100 tests.
  5711. 733.42 s [vector] prescanl': OK
  5712. 733.42 s [vector] +++ OK, passed 100 tests.
  5713. 733.42 s [vector] postscanl: OK
  5714. 733.42 s [vector] +++ OK, passed 100 tests.
  5715. 733.42 s [vector] postscanl': OK
  5716. 733.42 s [vector] +++ OK, passed 100 tests.
  5717. 733.42 s [vector] scanl: OK
  5718. 733.42 s [vector] +++ OK, passed 100 tests.
  5719. 733.42 s [vector] scanl': OK
  5720. 733.42 s [vector] +++ OK, passed 100 tests.
  5721. 733.42 s [vector] scanl1: OK
  5722. 733.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5723. 733.42 s [vector] scanl1': OK
  5724. 733.42 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5725. 733.42 s [vector] concatMap: OK
  5726. 733.42 s [vector] +++ OK, passed 100 tests.
  5727. 733.42 s [vector] unfoldr: OK
  5728. 733.42 s [vector] +++ OK, passed 100 tests.
  5729. 733.42 s [vector] and: OK
  5730. 733.42 s [vector] +++ OK, passed 100 tests.
  5731. 733.42 s [vector] or: OK
  5732. 733.42 s [vector] +++ OK, passed 100 tests.
  5733. 733.42 s [vector] Tests.Vector.Boxed
  5734. 733.42 s [vector] Bool
  5735. 733.42 s [vector] fromList.toList == id: OK
  5736. 733.42 s [vector] +++ OK, passed 100 tests.
  5737. 733.42 s [vector] toList.fromList == id: OK
  5738. 733.42 s [vector] +++ OK, passed 100 tests.
  5739. 733.42 s [vector] unstream.stream == id: OK
  5740. 733.42 s [vector] +++ OK, passed 100 tests.
  5741. 733.42 s [vector] stream.unstream == id: OK
  5742. 733.42 s [vector] +++ OK, passed 100 tests.
  5743. 733.42 s [vector] eq: OK
  5744. 733.42 s [vector] +++ OK, passed 100 tests.
  5745. 733.42 s [vector] length: OK
  5746. 733.42 s [vector] +++ OK, passed 100 tests.
  5747. 733.42 s [vector] null: OK
  5748. 733.42 s [vector] +++ OK, passed 100 tests.
  5749. 733.42 s [vector] index: OK
  5750. 733.42 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5751. 733.42 s [vector] safeIndex: OK
  5752. 733.42 s [vector] +++ OK, passed 100 tests.
  5753. 733.42 s [vector] head: OK
  5754. 733.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5755. 733.42 s [vector] last: OK
  5756. 733.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5757. 733.42 s [vector] unsafeIndex: OK
  5758. 733.42 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5759. 733.42 s [vector] unsafeHead: OK
  5760. 733.42 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5761. 733.42 s [vector] unsafeLast: OK
  5762. 733.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5763. 733.42 s [vector] slice: OK
  5764. 733.42 s [vector] +++ OK, passed 100 tests.
  5765. 733.42 s [vector] init: OK
  5766. 733.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5767. 733.42 s [vector] tail: OK
  5768. 733.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5769. 733.42 s [vector] take: OK
  5770. 733.42 s [vector] +++ OK, passed 100 tests.
  5771. 733.42 s [vector] drop: OK
  5772. 733.42 s [vector] +++ OK, passed 100 tests.
  5773. 733.42 s [vector] splitAt: OK
  5774. 733.42 s [vector] +++ OK, passed 100 tests.
  5775. 733.42 s [vector] empty: OK
  5776. 733.42 s [vector] +++ OK, passed 100 tests.
  5777. 733.42 s [vector] singleton: OK
  5778. 733.42 s [vector] +++ OK, passed 100 tests.
  5779. 733.42 s [vector] replicate: OK
  5780. 733.42 s [vector] +++ OK, passed 100 tests.
  5781. 733.42 s [vector] generate: OK
  5782. 733.42 s [vector] +++ OK, passed 100 tests.
  5783. 733.42 s [vector] iterateN: OK
  5784. 733.42 s [vector] +++ OK, passed 100 tests.
  5785. 733.42 s [vector] iterateNM: OK (0.03s)
  5786. 733.42 s [vector] +++ OK, passed 100 tests.
  5787. 733.42 s [vector] generateM: OK
  5788. 733.42 s [vector] +++ OK, passed 100 tests.
  5789. 733.42 s [vector] replicateM: OK (0.02s)
  5790. 733.42 s [vector] +++ OK, passed 100 tests.
  5791. 733.42 s [vector] create: OK
  5792. 733.42 s [vector] +++ OK, passed 100 tests.
  5793. 733.42 s [vector] createT: OK
  5794. 733.42 s [vector] +++ OK, passed 100 tests.
  5795. 733.42 s [vector] unfoldr: OK
  5796. 733.42 s [vector] +++ OK, passed 100 tests.
  5797. 733.43 s [vector] unfoldrN: OK
  5798. 733.43 s [vector] +++ OK, passed 100 tests.
  5799. 733.43 s [vector] unfoldrExactN: OK
  5800. 733.43 s [vector] +++ OK, passed 100 tests.
  5801. 733.43 s [vector] unfoldrM: OK
  5802. 733.43 s [vector] +++ OK, passed 100 tests.
  5803. 733.43 s [vector] unfoldrNM: OK
  5804. 733.43 s [vector] +++ OK, passed 100 tests.
  5805. 733.43 s [vector] unfoldrExactNM: OK (0.03s)
  5806. 733.43 s [vector] +++ OK, passed 100 tests.
  5807. 733.43 s [vector] constructN: OK
  5808. 733.43 s [vector] +++ OK, passed 100 tests.
  5809. 733.43 s [vector] constructrN: OK
  5810. 733.43 s [vector] +++ OK, passed 100 tests.
  5811. 733.43 s [vector] cons: OK
  5812. 733.43 s [vector] +++ OK, passed 100 tests.
  5813. 733.43 s [vector] snoc: OK
  5814. 733.43 s [vector] +++ OK, passed 100 tests.
  5815. 733.43 s [vector] append: OK
  5816. 733.43 s [vector] +++ OK, passed 100 tests.
  5817. 733.43 s [vector] concat: OK
  5818. 733.43 s [vector] +++ OK, passed 100 tests.
  5819. 733.43 s [vector] force: OK
  5820. 733.43 s [vector] +++ OK, passed 100 tests.
  5821. 733.43 s [vector] upd: OK
  5822. 733.43 s [vector] +++ OK, passed 100 tests.
  5823. 733.43 s [vector] accum: OK
  5824. 733.43 s [vector] +++ OK, passed 100 tests.
  5825. 733.43 s [vector] reverse: OK
  5826. 733.43 s [vector] +++ OK, passed 100 tests.
  5827. 733.43 s [vector] backpermute: OK
  5828. 733.43 s [vector] +++ OK, passed 100 tests.
  5829. 733.43 s [vector] map: OK
  5830. 733.43 s [vector] +++ OK, passed 100 tests.
  5831. 733.43 s [vector] imap: OK
  5832. 733.43 s [vector] +++ OK, passed 100 tests.
  5833. 733.43 s [vector] concatMap: OK
  5834. 733.43 s [vector] +++ OK, passed 100 tests.
  5835. 733.43 s [vector] mapM: OK
  5836. 733.43 s [vector] +++ OK, passed 100 tests.
  5837. 733.43 s [vector] mapM_: OK (0.01s)
  5838. 733.43 s [vector] +++ OK, passed 100 tests.
  5839. 733.43 s [vector] forM: OK
  5840. 733.43 s [vector] +++ OK, passed 100 tests.
  5841. 733.43 s [vector] forM_: OK (0.01s)
  5842. 733.43 s [vector] +++ OK, passed 100 tests.
  5843. 733.43 s [vector] imapM: OK
  5844. 733.43 s [vector] +++ OK, passed 100 tests.
  5845. 733.43 s [vector] imapM_: OK (0.01s)
  5846. 733.43 s [vector] +++ OK, passed 100 tests.
  5847. 733.43 s [vector] zipWith: OK
  5848. 733.43 s [vector] +++ OK, passed 100 tests.
  5849. 733.43 s [vector] zipWith3: OK
  5850. 733.43 s [vector] +++ OK, passed 100 tests.
  5851. 733.43 s [vector] izipWith: OK
  5852. 733.43 s [vector] +++ OK, passed 100 tests.
  5853. 733.43 s [vector] izipWith3: OK
  5854. 733.43 s [vector] +++ OK, passed 100 tests.
  5855. 733.43 s [vector] izipWithM: OK
  5856. 733.43 s [vector] +++ OK, passed 100 tests.
  5857. 733.43 s [vector] izipWithM_: OK (0.01s)
  5858. 733.43 s [vector] +++ OK, passed 100 tests.
  5859. 733.43 s [vector] zipWithM: OK
  5860. 733.43 s [vector] +++ OK, passed 100 tests.
  5861. 733.43 s [vector] zipWithM_: OK
  5862. 733.43 s [vector] +++ OK, passed 100 tests.
  5863. 733.43 s [vector] filter: OK
  5864. 733.43 s [vector] +++ OK, passed 100 tests.
  5865. 733.43 s [vector] ifilter: OK
  5866. 733.43 s [vector] +++ OK, passed 100 tests.
  5867. 733.43 s [vector] filterM: OK
  5868. 733.43 s [vector] +++ OK, passed 100 tests.
  5869. 733.43 s [vector] uniq: OK
  5870. 733.43 s [vector] +++ OK, passed 100 tests.
  5871. 733.43 s [vector] mapMaybe: OK
  5872. 733.43 s [vector] +++ OK, passed 100 tests.
  5873. 733.43 s [vector] imapMaybe: OK
  5874. 733.43 s [vector] +++ OK, passed 100 tests.
  5875. 733.43 s [vector] takeWhile: OK
  5876. 733.43 s [vector] +++ OK, passed 100 tests.
  5877. 733.43 s [vector] dropWhile: OK
  5878. 733.43 s [vector] +++ OK, passed 100 tests.
  5879. 733.43 s [vector] partition: OK
  5880. 733.43 s [vector] +++ OK, passed 100 tests.
  5881. 733.43 s [vector] partitionWith: OK
  5882. 733.43 s [vector] +++ OK, passed 100 tests.
  5883. 733.43 s [vector] span: OK
  5884. 733.43 s [vector] +++ OK, passed 100 tests.
  5885. 733.43 s [vector] break: OK
  5886. 733.43 s [vector] +++ OK, passed 100 tests.
  5887. 733.43 s [vector] spanR: OK
  5888. 733.43 s [vector] +++ OK, passed 100 tests.
  5889. 733.43 s [vector] breakR: OK
  5890. 733.43 s [vector] +++ OK, passed 100 tests.
  5891. 733.43 s [vector] groupBy: OK
  5892. 733.43 s [vector] +++ OK, passed 100 tests.
  5893. 733.43 s [vector] elem: OK
  5894. 733.43 s [vector] +++ OK, passed 100 tests.
  5895. 733.43 s [vector] notElem: OK
  5896. 733.43 s [vector] +++ OK, passed 100 tests.
  5897. 733.43 s [vector] find: OK
  5898. 733.43 s [vector] +++ OK, passed 100 tests.
  5899. 733.43 s [vector] findIndex: OK
  5900. 733.43 s [vector] +++ OK, passed 100 tests.
  5901. 733.43 s [vector] findIndexR: OK
  5902. 733.43 s [vector] +++ OK, passed 100 tests.
  5903. 733.43 s [vector] findIndices: OK
  5904. 733.43 s [vector] +++ OK, passed 100 tests.
  5905. 733.43 s [vector] elemIndex: OK
  5906. 733.43 s [vector] +++ OK, passed 100 tests.
  5907. 733.43 s [vector] elemIndices: OK
  5908. 733.43 s [vector] +++ OK, passed 100 tests.
  5909. 733.43 s [vector] foldl: OK
  5910. 733.43 s [vector] +++ OK, passed 100 tests.
  5911. 733.43 s [vector] foldl1: OK
  5912. 733.43 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5913. 733.44 s [vector] foldl': OK
  5914. 733.44 s [vector] +++ OK, passed 100 tests.
  5915. 733.44 s [vector] foldl1': OK
  5916. 733.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5917. 733.44 s [vector] foldr: OK
  5918. 733.44 s [vector] +++ OK, passed 100 tests.
  5919. 733.44 s [vector] foldr1: OK
  5920. 733.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5921. 733.44 s [vector] foldr': OK
  5922. 733.45 s [vector] +++ OK, passed 100 tests.
  5923. 733.45 s [vector] foldr1': OK
  5924. 733.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5925. 733.45 s [vector] ifoldl: OK
  5926. 733.45 s [vector] +++ OK, passed 100 tests.
  5927. 733.45 s [vector] ifoldl': OK
  5928. 733.45 s [vector] +++ OK, passed 100 tests.
  5929. 733.46 s [vector] ifoldr: OK
  5930. 733.46 s [vector] +++ OK, passed 100 tests.
  5931. 733.46 s [vector] ifoldr': OK
  5932. 733.47 s [vector] +++ OK, passed 100 tests.
  5933. 733.47 s [vector] ifoldM: OK
  5934. 733.47 s [vector] +++ OK, passed 100 tests.
  5935. 733.47 s [vector] ifoldM': OK
  5936. 733.49 s [vector] +++ OK, passed 100 tests.
  5937. 733.49 s [vector] ifoldM_: OK (0.01s)
  5938. 733.49 s [vector] +++ OK, passed 100 tests.
  5939. 733.49 s [vector] ifoldM'_: OK (0.01s)
  5940. 733.49 s [vector] +++ OK, passed 100 tests.
  5941. 733.49 s [vector] all: OK
  5942. 733.49 s [vector] +++ OK, passed 100 tests.
  5943. 733.49 s [vector] any: OK
  5944. 733.49 s [vector] +++ OK, passed 100 tests.
  5945. 733.49 s [vector] prescanl: OK
  5946. 733.49 s [vector] +++ OK, passed 100 tests.
  5947. 733.49 s [vector] prescanl': OK
  5948. 733.49 s [vector] +++ OK, passed 100 tests.
  5949. 733.50 s [vector] postscanl: OK
  5950. 733.50 s [vector] +++ OK, passed 100 tests.
  5951. 733.50 s [vector] postscanl': OK
  5952. 733.50 s [vector] +++ OK, passed 100 tests.
  5953. 733.51 s [vector] scanl: OK
  5954. 733.51 s [vector] +++ OK, passed 100 tests.
  5955. 733.51 s [vector] scanl': OK
  5956. 733.51 s [vector] +++ OK, passed 100 tests.
  5957. 733.51 s [vector] scanl1: OK
  5958. 733.51 s [vector] +++ OK, passed 100 tests.
  5959. 733.51 s [vector] scanl1': OK
  5960. 733.51 s [vector] +++ OK, passed 100 tests.
  5961. 733.51 s [vector] iscanl: OK
  5962. 733.51 s [vector] +++ OK, passed 100 tests.
  5963. 733.51 s [vector] iscanl': OK
  5964. 733.51 s [vector] +++ OK, passed 100 tests.
  5965. 733.51 s [vector] prescanr: OK
  5966. 733.51 s [vector] +++ OK, passed 100 tests.
  5967. 733.51 s [vector] prescanr': OK
  5968. 733.51 s [vector] +++ OK, passed 100 tests.
  5969. 733.51 s [vector] postscanr: OK
  5970. 733.51 s [vector] +++ OK, passed 100 tests.
  5971. 733.51 s [vector] postscanr': OK
  5972. 733.51 s [vector] +++ OK, passed 100 tests.
  5973. 733.51 s [vector] scanr: OK
  5974. 733.51 s [vector] +++ OK, passed 100 tests.
  5975. 733.51 s [vector] scanr': OK
  5976. 733.51 s [vector] +++ OK, passed 100 tests.
  5977. 733.52 s [vector] scanr1: OK
  5978. 733.52 s [vector] +++ OK, passed 100 tests.
  5979. 733.52 s [vector] scanr1': OK
  5980. 733.52 s [vector] +++ OK, passed 100 tests.
  5981. 733.52 s [vector] iscanr: OK
  5982. 733.52 s [vector] +++ OK, passed 100 tests.
  5983. 733.52 s [vector] iscanr': OK
  5984. 733.52 s [vector] +++ OK, passed 100 tests.
  5985. 733.52 s [vector] mut_read: OK
  5986. 733.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5987. 733.53 s [vector] mut_write: OK
  5988. 733.53 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5989. 733.53 s [vector] mut_modify: OK
  5990. 733.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5991. 733.53 s [vector] mut_generate: OK
  5992. 733.53 s [vector] +++ OK, passed 100 tests.
  5993. 733.53 s [vector] mut_generateM: OK
  5994. 733.53 s [vector] +++ OK, passed 100 tests.
  5995. 733.55 s [vector] mut_mapM_: OK (0.01s)
  5996. 733.55 s [vector] +++ OK, passed 100 tests.
  5997. 733.56 s [vector] mut_imapM_: OK (0.01s)
  5998. 733.57 s [vector] +++ OK, passed 100 tests.
  5999. 733.57 s [vector] mut_forM_: OK (0.01s)
  6000. 733.57 s [vector] +++ OK, passed 100 tests.
  6001. 733.57 s [vector] mut_iforM_: OK (0.01s)
  6002. 733.57 s [vector] +++ OK, passed 100 tests.
  6003. 733.58 s [vector] mut_foldr: OK
  6004. 733.58 s [vector] +++ OK, passed 100 tests.
  6005. 733.58 s [vector] mut_foldr': OK
  6006. 733.58 s [vector] +++ OK, passed 100 tests.
  6007. 733.58 s [vector] mut_foldl: OK
  6008. 733.58 s [vector] +++ OK, passed 100 tests.
  6009. 733.59 s [vector] mut_foldl': OK
  6010. 733.59 s [vector] +++ OK, passed 100 tests.
  6011. 733.59 s [vector] mut_ifoldr: OK
  6012. 733.59 s [vector] +++ OK, passed 100 tests.
  6013. 733.59 s [vector] mut_ifoldr': OK
  6014. 733.59 s [vector] +++ OK, passed 100 tests.
  6015. 733.59 s [vector] mut_ifoldl: OK
  6016. 733.59 s [vector] +++ OK, passed 100 tests.
  6017. 733.59 s [vector] mut_ifoldl': OK
  6018. 733.59 s [vector] +++ OK, passed 100 tests.
  6019. 733.59 s [vector] mut_foldM: OK
  6020. 733.59 s [vector] +++ OK, passed 100 tests.
  6021. 733.59 s [vector] mut_foldM': OK
  6022. 733.59 s [vector] +++ OK, passed 100 tests.
  6023. 733.59 s [vector] mut_foldrM: OK
  6024. 733.60 s [vector] +++ OK, passed 100 tests.
  6025. 733.60 s [vector] mut_foldrM': OK
  6026. 733.60 s [vector] +++ OK, passed 100 tests.
  6027. 733.60 s [vector] mut_ifoldM: OK
  6028. 733.60 s [vector] +++ OK, passed 100 tests.
  6029. 733.60 s [vector] mut_ifoldM': OK
  6030. 733.60 s [vector] +++ OK, passed 100 tests.
  6031. 733.60 s [vector] mut_ifoldrM: OK
  6032. 733.60 s [vector] +++ OK, passed 100 tests.
  6033. 733.61 s [vector] mut_ifoldrM': OK
  6034. 733.61 s [vector] +++ OK, passed 100 tests.
  6035. 733.61 s [vector] compare: OK
  6036. 733.61 s [vector] +++ OK, passed 100 tests.
  6037. 733.61 s [vector] maximum: OK
  6038. 733.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6039. 733.61 s [vector] minimum: OK
  6040. 733.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6041. 733.61 s [vector] minIndex: OK
  6042. 733.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6043. 733.61 s [vector] maxIndex: OK
  6044. 733.61 s [vector] +++ OK, passed 100 tests; 10 discarded.
  6045. 733.61 s [vector] maximumBy: OK
  6046. 733.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6047. 733.61 s [vector] minimumBy: OK
  6048. 733.61 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6049. 733.61 s [vector] maximumOn: OK
  6050. 733.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6051. 733.61 s [vector] minimumOn: OK
  6052. 733.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6053. 733.61 s [vector] maxIndexBy: OK
  6054. 733.61 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6055. 733.61 s [vector] minIndexBy: OK
  6056. 733.61 s [vector] +++ OK, passed 100 tests; 10 discarded.
  6057. 733.61 s [vector] ListFirstMaxIndexWins: OK
  6058. 733.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6059. 733.61 s [vector] FalseListFirstMaxIndexWins: OK
  6060. 733.61 s [vector] +++ OK, failed as expected. (after 1 test):
  6061. 733.61 s [vector] Exception:
  6062. 733.62 s [vector] Prelude.foldr1: empty list
  6063. 733.62 s [vector] CallStack (from HasCallStack):
  6064. 733.62 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  6065. 733.62 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  6066. 733.62 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6067. 733.62 s [vector] []
  6068. 733.62 s [vector] zip: OK
  6069. 733.62 s [vector] +++ OK, passed 100 tests.
  6070. 733.62 s [vector] zip3: OK
  6071. 733.62 s [vector] +++ OK, passed 100 tests.
  6072. 733.62 s [vector] unzip: OK
  6073. 733.62 s [vector] +++ OK, passed 100 tests.
  6074. 733.62 s [vector] unzip3: OK
  6075. 733.62 s [vector] +++ OK, passed 100 tests.
  6076. 733.62 s [vector] indexed: OK
  6077. 733.63 s [vector] +++ OK, passed 100 tests.
  6078. 733.63 s [vector] update: OK
  6079. 733.63 s [vector] +++ OK, passed 100 tests.
  6080. 733.63 s [vector] concat: OK
  6081. 733.63 s [vector] +++ OK, passed 100 tests.
  6082. 733.63 s [vector] mempty: OK
  6083. 733.63 s [vector] +++ OK, passed 100 tests.
  6084. 733.63 s [vector] mappend: OK
  6085. 733.63 s [vector] +++ OK, passed 100 tests.
  6086. 733.64 s [vector] mconcat: OK
  6087. 733.64 s [vector] +++ OK, passed 100 tests.
  6088. 733.65 s [vector] fmap: OK
  6089. 733.65 s [vector] +++ OK, passed 100 tests.
  6090. 733.65 s [vector] return: OK
  6091. 733.65 s [vector] +++ OK, passed 100 tests.
  6092. 733.66 s [vector] bind: OK (0.02s)
  6093. 733.66 s [vector] +++ OK, passed 100 tests.
  6094. 733.66 s [vector] mzip: OK
  6095. 733.66 s [vector] +++ OK, passed 100 tests.
  6096. 733.66 s [vector] munzip: OK
  6097. 733.66 s [vector] +++ OK, passed 100 tests.
  6098. 733.66 s [vector] applicative_pure: OK
  6099. 733.66 s [vector] +++ OK, passed 100 tests.
  6100. 733.68 s [vector] applicative_appl: OK (0.02s)
  6101. 733.68 s [vector] +++ OK, passed 100 tests.
  6102. 733.68 s [vector] alternative_empty: OK
  6103. 733.68 s [vector] +++ OK, passed 100 tests.
  6104. 733.68 s [vector] alternative_or: OK
  6105. 733.68 s [vector] +++ OK, passed 100 tests.
  6106. 733.71 s [vector] sequence: OK (0.02s)
  6107. 733.71 s [vector] +++ OK, passed 100 tests.
  6108. 733.71 s [vector] sequence_: OK
  6109. 733.71 s [vector] +++ OK, passed 100 tests.
  6110. 733.71 s [vector] glength: OK
  6111. 733.71 s [vector] +++ OK, passed 100 tests.
  6112. 733.71 s [vector] and: OK
  6113. 733.71 s [vector] +++ OK, passed 100 tests.
  6114. 733.71 s [vector] or: OK
  6115. 733.71 s [vector] +++ OK, passed 100 tests.
  6116. 733.71 s [vector] Int
  6117. 733.71 s [vector] fromList.toList == id: OK
  6118. 733.71 s [vector] +++ OK, passed 100 tests.
  6119. 733.71 s [vector] toList.fromList == id: OK
  6120. 733.71 s [vector] +++ OK, passed 100 tests.
  6121. 733.71 s [vector] unstream.stream == id: OK
  6122. 733.72 s [vector] +++ OK, passed 100 tests.
  6123. 733.72 s [vector] stream.unstream == id: OK
  6124. 733.72 s [vector] +++ OK, passed 100 tests.
  6125. 733.72 s [vector] eq: OK
  6126. 733.72 s [vector] +++ OK, passed 100 tests.
  6127. 733.72 s [vector] length: OK
  6128. 733.72 s [vector] +++ OK, passed 100 tests.
  6129. 733.72 s [vector] null: OK
  6130. 733.72 s [vector] +++ OK, passed 100 tests.
  6131. 733.72 s [vector] index: OK
  6132. 733.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6133. 733.72 s [vector] safeIndex: OK
  6134. 733.72 s [vector] +++ OK, passed 100 tests.
  6135. 733.72 s [vector] head: OK
  6136. 733.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6137. 733.72 s [vector] last: OK
  6138. 733.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6139. 733.72 s [vector] unsafeIndex: OK
  6140. 733.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6141. 733.72 s [vector] unsafeHead: OK
  6142. 733.72 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6143. 733.72 s [vector] unsafeLast: OK
  6144. 733.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6145. 733.72 s [vector] slice: OK
  6146. 733.72 s [vector] +++ OK, passed 100 tests.
  6147. 733.72 s [vector] init: OK
  6148. 733.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6149. 733.72 s [vector] tail: OK
  6150. 733.72 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6151. 733.72 s [vector] take: OK
  6152. 733.72 s [vector] +++ OK, passed 100 tests.
  6153. 733.72 s [vector] drop: OK
  6154. 733.72 s [vector] +++ OK, passed 100 tests.
  6155. 733.72 s [vector] splitAt: OK
  6156. 733.72 s [vector] +++ OK, passed 100 tests.
  6157. 733.72 s [vector] empty: OK
  6158. 733.72 s [vector] +++ OK, passed 100 tests.
  6159. 733.72 s [vector] singleton: OK
  6160. 733.72 s [vector] +++ OK, passed 100 tests.
  6161. 733.72 s [vector] replicate: OK
  6162. 733.72 s [vector] +++ OK, passed 100 tests.
  6163. 733.72 s [vector] generate: OK
  6164. 733.72 s [vector] +++ OK, passed 100 tests.
  6165. 733.73 s [vector] iterateN: OK
  6166. 733.73 s [vector] +++ OK, passed 100 tests.
  6167. 733.76 s [vector] iterateNM: OK (0.03s)
  6168. 733.76 s [vector] +++ OK, passed 100 tests.
  6169. 733.78 s [vector] generateM: OK (0.01s)
  6170. 733.78 s [vector] +++ OK, passed 100 tests.
  6171. 733.80 s [vector] replicateM: OK
  6172. 733.80 s [vector] +++ OK, passed 100 tests.
  6173. 733.80 s [vector] create: OK
  6174. 733.80 s [vector] +++ OK, passed 100 tests.
  6175. 733.80 s [vector] createT: OK
  6176. 733.80 s [vector] +++ OK, passed 100 tests.
  6177. 733.80 s [vector] unfoldr: OK
  6178. 733.80 s [vector] +++ OK, passed 100 tests.
  6179. 733.80 s [vector] unfoldrN: OK
  6180. 733.80 s [vector] +++ OK, passed 100 tests.
  6181. 733.81 s [vector] unfoldrExactN: OK
  6182. 733.81 s [vector] +++ OK, passed 100 tests.
  6183. 733.81 s [vector] unfoldrM: OK
  6184. 733.81 s [vector] +++ OK, passed 100 tests.
  6185. 733.81 s [vector] unfoldrNM: OK
  6186. 733.81 s [vector] +++ OK, passed 100 tests.
  6187. 733.86 s [vector] unfoldrExactNM: OK (0.02s)
  6188. 733.86 s [vector] +++ OK, passed 100 tests.
  6189. 733.86 s [vector] constructN: OK
  6190. 733.86 s [vector] +++ OK, passed 100 tests.
  6191. 733.86 s [vector] constructrN: OK
  6192. 733.86 s [vector] +++ OK, passed 100 tests.
  6193. 733.86 s [vector] cons: OK
  6194. 733.86 s [vector] +++ OK, passed 100 tests.
  6195. 733.87 s [vector] snoc: OK
  6196. 733.87 s [vector] +++ OK, passed 100 tests.
  6197. 733.87 s [vector] append: OK
  6198. 733.87 s [vector] +++ OK, passed 100 tests.
  6199. 733.88 s [vector] concat: OK
  6200. 733.88 s [vector] +++ OK, passed 100 tests.
  6201. 733.89 s [vector] force: OK
  6202. 733.89 s [vector] +++ OK, passed 100 tests.
  6203. 733.89 s [vector] upd: OK
  6204. 733.89 s [vector] +++ OK, passed 100 tests.
  6205. 733.89 s [vector] accum: OK
  6206. 733.89 s [vector] +++ OK, passed 100 tests.
  6207. 733.89 s [vector] reverse: OK
  6208. 733.89 s [vector] +++ OK, passed 100 tests.
  6209. 733.89 s [vector] backpermute: OK
  6210. 733.89 s [vector] +++ OK, passed 100 tests.
  6211. 733.90 s [vector] map: OK
  6212. 733.90 s [vector] +++ OK, passed 100 tests.
  6213. 733.90 s [vector] imap: OK
  6214. 733.90 s [vector] +++ OK, passed 100 tests.
  6215. 733.91 s [vector] concatMap: OK
  6216. 733.91 s [vector] +++ OK, passed 100 tests.
  6217. 733.91 s [vector] mapM: OK
  6218. 733.91 s [vector] +++ OK, passed 100 tests.
  6219. 733.92 s [vector] mapM_: OK (0.02s)
  6220. 733.93 s [vector] +++ OK, passed 100 tests.
  6221. 733.93 s [vector] forM: OK
  6222. 733.93 s [vector] +++ OK, passed 100 tests.
  6223. 733.94 s [vector] forM_: OK (0.02s)
  6224. 733.95 s [vector] +++ OK, passed 100 tests.
  6225. 733.95 s [vector] imapM: OK
  6226. 733.95 s [vector] +++ OK, passed 100 tests.
  6227. 733.96 s [vector] imapM_: OK (0.02s)
  6228. 733.96 s [vector] +++ OK, passed 100 tests.
  6229. 733.96 s [vector] zipWith: OK
  6230. 733.97 s [vector] +++ OK, passed 100 tests.
  6231. 733.97 s [vector] zipWith3: OK
  6232. 733.97 s [vector] +++ OK, passed 100 tests.
  6233. 733.97 s [vector] izipWith: OK
  6234. 733.97 s [vector] +++ OK, passed 100 tests.
  6235. 733.97 s [vector] izipWith3: OK
  6236. 733.97 s [vector] +++ OK, passed 100 tests.
  6237. 733.97 s [vector] izipWithM: OK
  6238. 733.97 s [vector] +++ OK, passed 100 tests.
  6239. 733.98 s [vector] izipWithM_: OK (0.01s)
  6240. 733.98 s [vector] +++ OK, passed 100 tests.
  6241. 733.98 s [vector] zipWithM: OK
  6242. 733.98 s [vector] +++ OK, passed 100 tests.
  6243. 734.00 s [vector] zipWithM_: OK
  6244. 734.00 s [vector] +++ OK, passed 100 tests.
  6245. 734.00 s [vector] filter: OK
  6246. 734.00 s [vector] +++ OK, passed 100 tests.
  6247. 734.00 s [vector] ifilter: OK
  6248. 734.00 s [vector] +++ OK, passed 100 tests.
  6249. 734.03 s [vector] filterM: OK (0.02s)
  6250. 734.03 s [vector] +++ OK, passed 100 tests.
  6251. 734.03 s [vector] uniq: OK
  6252. 734.03 s [vector] +++ OK, passed 100 tests.
  6253. 734.03 s [vector] mapMaybe: OK
  6254. 734.03 s [vector] +++ OK, passed 100 tests.
  6255. 734.03 s [vector] imapMaybe: OK
  6256. 734.03 s [vector] +++ OK, passed 100 tests.
  6257. 734.03 s [vector] takeWhile: OK
  6258. 734.03 s [vector] +++ OK, passed 100 tests.
  6259. 734.03 s [vector] dropWhile: OK
  6260. 734.03 s [vector] +++ OK, passed 100 tests.
  6261. 734.04 s [vector] partition: OK
  6262. 734.04 s [vector] +++ OK, passed 100 tests.
  6263. 734.04 s [vector] partitionWith: OK
  6264. 734.04 s [vector] +++ OK, passed 100 tests.
  6265. 734.04 s [vector] span: OK
  6266. 734.04 s [vector] +++ OK, passed 100 tests.
  6267. 734.04 s [vector] break: OK
  6268. 734.04 s [vector] +++ OK, passed 100 tests.
  6269. 734.04 s [vector] spanR: OK
  6270. 734.04 s [vector] +++ OK, passed 100 tests.
  6271. 734.04 s [vector] breakR: OK
  6272. 734.04 s [vector] +++ OK, passed 100 tests.
  6273. 734.04 s [vector] groupBy: OK
  6274. 734.04 s [vector] +++ OK, passed 100 tests.
  6275. 734.04 s [vector] elem: OK
  6276. 734.04 s [vector] +++ OK, passed 100 tests.
  6277. 734.04 s [vector] notElem: OK
  6278. 734.04 s [vector] +++ OK, passed 100 tests.
  6279. 734.04 s [vector] find: OK
  6280. 734.04 s [vector] +++ OK, passed 100 tests.
  6281. 734.05 s [vector] findIndex: OK
  6282. 734.05 s [vector] +++ OK, passed 100 tests.
  6283. 734.05 s [vector] findIndexR: OK
  6284. 734.05 s [vector] +++ OK, passed 100 tests.
  6285. 734.05 s [vector] findIndices: OK
  6286. 734.05 s [vector] +++ OK, passed 100 tests.
  6287. 734.05 s [vector] elemIndex: OK
  6288. 734.05 s [vector] +++ OK, passed 100 tests.
  6289. 734.05 s [vector] elemIndices: OK
  6290. 734.05 s [vector] +++ OK, passed 100 tests.
  6291. 734.05 s [vector] foldl: OK
  6292. 734.05 s [vector] +++ OK, passed 100 tests.
  6293. 734.06 s [vector] foldl1: OK
  6294. 734.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6295. 734.06 s [vector] foldl': OK
  6296. 734.06 s [vector] +++ OK, passed 100 tests.
  6297. 734.06 s [vector] foldl1': OK
  6298. 734.06 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6299. 734.06 s [vector] foldr: OK
  6300. 734.06 s [vector] +++ OK, passed 100 tests.
  6301. 734.06 s [vector] foldr1: OK
  6302. 734.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6303. 734.07 s [vector] foldr': OK
  6304. 734.07 s [vector] +++ OK, passed 100 tests.
  6305. 734.07 s [vector] foldr1': OK
  6306. 734.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6307. 734.07 s [vector] ifoldl: OK
  6308. 734.07 s [vector] +++ OK, passed 100 tests.
  6309. 734.08 s [vector] ifoldl': OK
  6310. 734.08 s [vector] +++ OK, passed 100 tests.
  6311. 734.09 s [vector] ifoldr: OK
  6312. 734.09 s [vector] +++ OK, passed 100 tests.
  6313. 734.09 s [vector] ifoldr': OK
  6314. 734.09 s [vector] +++ OK, passed 100 tests.
  6315. 734.09 s [vector] ifoldM: OK
  6316. 734.09 s [vector] +++ OK, passed 100 tests.
  6317. 734.09 s [vector] ifoldM': OK
  6318. 734.09 s [vector] +++ OK, passed 100 tests.
  6319. 734.11 s [vector] ifoldM_: OK (0.02s)
  6320. 734.11 s [vector] +++ OK, passed 100 tests.
  6321. 734.12 s [vector] ifoldM'_: OK (0.02s)
  6322. 734.12 s [vector] +++ OK, passed 100 tests.
  6323. 734.12 s [vector] all: OK
  6324. 734.12 s [vector] +++ OK, passed 100 tests.
  6325. 734.12 s [vector] any: OK
  6326. 734.12 s [vector] +++ OK, passed 100 tests.
  6327. 734.12 s [vector] prescanl: OK
  6328. 734.12 s [vector] +++ OK, passed 100 tests.
  6329. 734.13 s [vector] prescanl': OK
  6330. 734.13 s [vector] +++ OK, passed 100 tests.
  6331. 734.13 s [vector] postscanl: OK
  6332. 734.13 s [vector] +++ OK, passed 100 tests.
  6333. 734.14 s [vector] postscanl': OK
  6334. 734.14 s [vector] +++ OK, passed 100 tests.
  6335. 734.14 s [vector] scanl: OK
  6336. 734.15 s [vector] +++ OK, passed 100 tests.
  6337. 734.15 s [vector] scanl': OK
  6338. 734.15 s [vector] +++ OK, passed 100 tests.
  6339. 734.16 s [vector] scanl1: OK
  6340. 734.16 s [vector] +++ OK, passed 100 tests.
  6341. 734.16 s [vector] scanl1': OK
  6342. 734.16 s [vector] +++ OK, passed 100 tests.
  6343. 734.16 s [vector] iscanl: OK
  6344. 734.16 s [vector] +++ OK, passed 100 tests.
  6345. 734.16 s [vector] iscanl': OK
  6346. 734.16 s [vector] +++ OK, passed 100 tests.
  6347. 734.16 s [vector] prescanr: OK
  6348. 734.16 s [vector] +++ OK, passed 100 tests.
  6349. 734.17 s [vector] prescanr': OK
  6350. 734.17 s [vector] +++ OK, passed 100 tests.
  6351. 734.17 s [vector] postscanr: OK
  6352. 734.17 s [vector] +++ OK, passed 100 tests.
  6353. 734.17 s [vector] postscanr': OK
  6354. 734.17 s [vector] +++ OK, passed 100 tests.
  6355. 734.17 s [vector] scanr: OK
  6356. 734.17 s [vector] +++ OK, passed 100 tests.
  6357. 734.17 s [vector] scanr': OK
  6358. 734.17 s [vector] +++ OK, passed 100 tests.
  6359. 734.17 s [vector] scanr1: OK
  6360. 734.18 s [vector] +++ OK, passed 100 tests.
  6361. 734.18 s [vector] scanr1': OK
  6362. 734.18 s [vector] +++ OK, passed 100 tests.
  6363. 734.18 s [vector] iscanr: OK
  6364. 734.18 s [vector] +++ OK, passed 100 tests.
  6365. 734.18 s [vector] iscanr': OK
  6366. 734.18 s [vector] +++ OK, passed 100 tests.
  6367. 734.18 s [vector] mut_read: OK
  6368. 734.18 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6369. 734.18 s [vector] mut_write: OK
  6370. 734.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6371. 734.18 s [vector] mut_modify: OK
  6372. 734.18 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6373. 734.19 s [vector] mut_generate: OK
  6374. 734.19 s [vector] +++ OK, passed 100 tests.
  6375. 734.19 s [vector] mut_generateM: OK
  6376. 734.19 s [vector] +++ OK, passed 100 tests.
  6377. 734.21 s [vector] mut_mapM_: OK
  6378. 734.21 s [vector] +++ OK, passed 100 tests.
  6379. 734.23 s [vector] mut_imapM_: OK (0.02s)
  6380. 734.23 s [vector] +++ OK, passed 100 tests.
  6381. 734.24 s [vector] mut_forM_: OK (0.02s)
  6382. 734.24 s [vector] +++ OK, passed 100 tests.
  6383. 734.26 s [vector] mut_iforM_: OK
  6384. 734.26 s [vector] +++ OK, passed 100 tests.
  6385. 734.26 s [vector] mut_foldr: OK
  6386. 734.26 s [vector] +++ OK, passed 100 tests.
  6387. 734.26 s [vector] mut_foldr': OK
  6388. 734.26 s [vector] +++ OK, passed 100 tests.
  6389. 734.27 s [vector] mut_foldl: OK
  6390. 734.27 s [vector] +++ OK, passed 100 tests.
  6391. 734.27 s [vector] mut_foldl': OK
  6392. 734.27 s [vector] +++ OK, passed 100 tests.
  6393. 734.28 s [vector] mut_ifoldr: OK
  6394. 734.28 s [vector] +++ OK, passed 100 tests.
  6395. 734.28 s [vector] mut_ifoldr': OK
  6396. 734.28 s [vector] +++ OK, passed 100 tests.
  6397. 734.28 s [vector] mut_ifoldl: OK
  6398. 734.28 s [vector] +++ OK, passed 100 tests.
  6399. 734.29 s [vector] mut_ifoldl': OK
  6400. 734.29 s [vector] +++ OK, passed 100 tests.
  6401. 734.29 s [vector] mut_foldM: OK
  6402. 734.29 s [vector] +++ OK, passed 100 tests.
  6403. 734.29 s [vector] mut_foldM': OK
  6404. 734.29 s [vector] +++ OK, passed 100 tests.
  6405. 734.29 s [vector] mut_foldrM: OK
  6406. 734.29 s [vector] +++ OK, passed 100 tests.
  6407. 734.30 s [vector] mut_foldrM': OK
  6408. 734.30 s [vector] +++ OK, passed 100 tests.
  6409. 734.30 s [vector] mut_ifoldM: OK
  6410. 734.30 s [vector] +++ OK, passed 100 tests.
  6411. 734.30 s [vector] mut_ifoldM': OK
  6412. 734.30 s [vector] +++ OK, passed 100 tests.
  6413. 734.31 s [vector] mut_ifoldrM: OK
  6414. 734.31 s [vector] +++ OK, passed 100 tests.
  6415. 734.31 s [vector] mut_ifoldrM': OK
  6416. 734.31 s [vector] +++ OK, passed 100 tests.
  6417. 734.31 s [vector] compare: OK
  6418. 734.31 s [vector] +++ OK, passed 100 tests.
  6419. 734.31 s [vector] maximum: OK
  6420. 734.31 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6421. 734.31 s [vector] minimum: OK
  6422. 734.31 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6423. 734.31 s [vector] minIndex: OK
  6424. 734.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6425. 734.32 s [vector] maxIndex: OK
  6426. 734.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6427. 734.32 s [vector] maximumBy: OK
  6428. 734.32 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6429. 734.32 s [vector] minimumBy: OK
  6430. 734.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6431. 734.32 s [vector] maximumOn: OK
  6432. 734.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6433. 734.32 s [vector] minimumOn: OK
  6434. 734.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6435. 734.32 s [vector] maxIndexBy: OK
  6436. 734.32 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6437. 734.32 s [vector] minIndexBy: OK
  6438. 734.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6439. 734.32 s [vector] ListFirstMaxIndexWins: OK
  6440. 734.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6441. 734.32 s [vector] FalseListFirstMaxIndexWins: OK
  6442. 734.32 s [vector] +++ OK, failed as expected. (after 1 test):
  6443. 734.32 s [vector] Exception:
  6444. 734.32 s [vector] Prelude.foldr1: empty list
  6445. 734.32 s [vector] CallStack (from HasCallStack):
  6446. 734.32 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  6447. 734.32 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  6448. 734.32 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6449. 734.32 s [vector] []
  6450. 734.32 s [vector] zip: OK
  6451. 734.32 s [vector] +++ OK, passed 100 tests.
  6452. 734.32 s [vector] zip3: OK
  6453. 734.32 s [vector] +++ OK, passed 100 tests.
  6454. 734.32 s [vector] unzip: OK
  6455. 734.32 s [vector] +++ OK, passed 100 tests.
  6456. 734.32 s [vector] unzip3: OK
  6457. 734.32 s [vector] +++ OK, passed 100 tests.
  6458. 734.33 s [vector] indexed: OK
  6459. 734.33 s [vector] +++ OK, passed 100 tests.
  6460. 734.33 s [vector] update: OK
  6461. 734.33 s [vector] +++ OK, passed 100 tests.
  6462. 734.34 s [vector] concat: OK (0.01s)
  6463. 734.34 s [vector] +++ OK, passed 100 tests.
  6464. 734.34 s [vector] mempty: OK
  6465. 734.34 s [vector] +++ OK, passed 100 tests.
  6466. 734.35 s [vector] mappend: OK
  6467. 734.35 s [vector] +++ OK, passed 100 tests.
  6468. 734.36 s [vector] mconcat: OK (0.02s)
  6469. 734.36 s [vector] +++ OK, passed 100 tests.
  6470. 734.36 s [vector] fmap: OK
  6471. 734.36 s [vector] +++ OK, passed 100 tests.
  6472. 734.36 s [vector] return: OK
  6473. 734.36 s [vector] +++ OK, passed 100 tests.
  6474. 734.38 s [vector] bind: OK
  6475. 734.38 s [vector] +++ OK, passed 100 tests.
  6476. 734.38 s [vector] mzip: OK
  6477. 734.38 s [vector] +++ OK, passed 100 tests.
  6478. 734.39 s [vector] munzip: OK
  6479. 734.39 s [vector] +++ OK, passed 100 tests.
  6480. 734.39 s [vector] applicative_pure: OK
  6481. 734.39 s [vector] +++ OK, passed 100 tests.
  6482. 734.42 s [vector] applicative_appl: OK (0.04s)
  6483. 734.42 s [vector] +++ OK, passed 100 tests.
  6484. 734.42 s [vector] alternative_empty: OK
  6485. 734.42 s [vector] +++ OK, passed 100 tests.
  6486. 734.44 s [vector] alternative_or: OK
  6487. 734.44 s [vector] +++ OK, passed 100 tests.
  6488. 734.46 s [vector] sequence: OK (0.03s)
  6489. 734.46 s [vector] +++ OK, passed 100 tests.
  6490. 734.46 s [vector] sequence_: OK (0.01s)
  6491. 734.46 s [vector] +++ OK, passed 100 tests.
  6492. 734.47 s [vector] glength: OK
  6493. 734.47 s [vector] +++ OK, passed 100 tests.
  6494. 734.47 s [vector] sum: OK
  6495. 734.47 s [vector] +++ OK, passed 100 tests.
  6496. 734.47 s [vector] product: OK
  6497. 734.47 s [vector] +++ OK, passed 100 tests.
  6498. 734.47 s [vector] enumFromN: OK
  6499. 734.47 s [vector] +++ OK, passed 100 tests.
  6500. 734.47 s [vector] enumFromThenN: OK
  6501. 734.47 s [vector] +++ OK, passed 100 tests.
  6502. 734.47 s [vector] enumFromTo: OK
  6503. 734.47 s [vector] +++ OK, passed 100 tests.
  6504. 734.47 s [vector] enumFromThenTo: OK
  6505. 734.47 s [vector] +++ OK, passed 100 tests; 10 discarded.
  6506. 734.47 s [vector] unstream
  6507. 734.47 s [vector] unstream == vunstream (exact): OK
  6508. 734.47 s [vector] +++ OK, passed 100 tests.
  6509. 734.47 s [vector] unstream == vunstream (unknown): OK
  6510. 734.47 s [vector] +++ OK, passed 100 tests.
  6511. 734.48 s [vector] unstreamR ~= vunstream (exact): OK
  6512. 734.48 s [vector] +++ OK, passed 100 tests.
  6513. 734.48 s [vector] unstreamR ~= vunstream (unknown): OK
  6514. 734.48 s [vector] +++ OK, passed 100 tests.
  6515. 734.48 s [vector] Tests.Vector.Primitive
  6516. 734.48 s [vector] Int
  6517. 734.48 s [vector] fromList.toList == id: OK
  6518. 734.48 s [vector] +++ OK, passed 100 tests.
  6519. 734.48 s [vector] toList.fromList == id: OK
  6520. 734.48 s [vector] +++ OK, passed 100 tests.
  6521. 734.48 s [vector] unstream.stream == id: OK
  6522. 734.48 s [vector] +++ OK, passed 100 tests.
  6523. 734.48 s [vector] stream.unstream == id: OK
  6524. 734.48 s [vector] +++ OK, passed 100 tests.
  6525. 734.48 s [vector] eq: OK
  6526. 734.48 s [vector] +++ OK, passed 100 tests.
  6527. 734.48 s [vector] length: OK
  6528. 734.48 s [vector] +++ OK, passed 100 tests.
  6529. 734.48 s [vector] null: OK
  6530. 734.49 s [vector] +++ OK, passed 100 tests.
  6531. 734.49 s [vector] index: OK
  6532. 734.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6533. 734.49 s [vector] safeIndex: OK
  6534. 734.49 s [vector] +++ OK, passed 100 tests.
  6535. 734.49 s [vector] head: OK
  6536. 734.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6537. 734.49 s [vector] last: OK
  6538. 734.49 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6539. 734.49 s [vector] unsafeIndex: OK
  6540. 734.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6541. 734.50 s [vector] unsafeHead: OK
  6542. 734.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6543. 734.50 s [vector] unsafeLast: OK
  6544. 734.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6545. 734.50 s [vector] slice: OK
  6546. 734.50 s [vector] +++ OK, passed 100 tests.
  6547. 734.50 s [vector] init: OK
  6548. 734.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6549. 734.50 s [vector] tail: OK
  6550. 734.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6551. 734.50 s [vector] take: OK
  6552. 734.50 s [vector] +++ OK, passed 100 tests.
  6553. 734.50 s [vector] drop: OK
  6554. 734.50 s [vector] +++ OK, passed 100 tests.
  6555. 734.51 s [vector] splitAt: OK
  6556. 734.51 s [vector] +++ OK, passed 100 tests.
  6557. 734.51 s [vector] empty: OK
  6558. 734.51 s [vector] +++ OK, passed 100 tests.
  6559. 734.51 s [vector] singleton: OK
  6560. 734.51 s [vector] +++ OK, passed 100 tests.
  6561. 734.51 s [vector] replicate: OK
  6562. 734.51 s [vector] +++ OK, passed 100 tests.
  6563. 734.51 s [vector] generate: OK
  6564. 734.51 s [vector] +++ OK, passed 100 tests.
  6565. 734.51 s [vector] iterateN: OK
  6566. 734.51 s [vector] +++ OK, passed 100 tests.
  6567. 734.54 s [vector] iterateNM: OK (0.03s)
  6568. 734.54 s [vector] +++ OK, passed 100 tests.
  6569. 734.57 s [vector] generateM: OK
  6570. 734.57 s [vector] +++ OK, passed 100 tests.
  6571. 734.58 s [vector] replicateM: OK (0.02s)
  6572. 734.58 s [vector] +++ OK, passed 100 tests.
  6573. 734.58 s [vector] create: OK
  6574. 734.58 s [vector] +++ OK, passed 100 tests.
  6575. 734.58 s [vector] createT: OK
  6576. 734.58 s [vector] +++ OK, passed 100 tests.
  6577. 734.58 s [vector] unfoldr: OK
  6578. 734.58 s [vector] +++ OK, passed 100 tests.
  6579. 734.58 s [vector] unfoldrN: OK
  6580. 734.58 s [vector] +++ OK, passed 100 tests.
  6581. 734.59 s [vector] unfoldrExactN: OK
  6582. 734.59 s [vector] +++ OK, passed 100 tests.
  6583. 734.59 s [vector] unfoldrM: OK
  6584. 734.59 s [vector] +++ OK, passed 100 tests.
  6585. 734.59 s [vector] unfoldrNM: OK
  6586. 734.62 s [vector] +++ OK, passed 100 tests.
  6587. 734.65 s [vector] unfoldrExactNM: OK (0.06s)
  6588. 734.65 s [vector] +++ OK, passed 100 tests.
  6589. 734.66 s [vector] constructN: OK
  6590. 734.66 s [vector] +++ OK, passed 100 tests.
  6591. 734.66 s [vector] constructrN: OK
  6592. 734.66 s [vector] +++ OK, passed 100 tests.
  6593. 734.66 s [vector] cons: OK
  6594. 734.66 s [vector] +++ OK, passed 100 tests.
  6595. 734.66 s [vector] snoc: OK
  6596. 734.66 s [vector] +++ OK, passed 100 tests.
  6597. 734.67 s [vector] append: OK
  6598. 734.67 s [vector] +++ OK, passed 100 tests.
  6599. 734.68 s [vector] concat: OK (0.02s)
  6600. 734.68 s [vector] +++ OK, passed 100 tests.
  6601. 734.68 s [vector] force: OK
  6602. 734.68 s [vector] +++ OK, passed 100 tests.
  6603. 734.69 s [vector] upd: OK
  6604. 734.69 s [vector] +++ OK, passed 100 tests.
  6605. 734.69 s [vector] accum: OK
  6606. 734.69 s [vector] +++ OK, passed 100 tests.
  6607. 734.69 s [vector] reverse: OK
  6608. 734.69 s [vector] +++ OK, passed 100 tests.
  6609. 734.69 s [vector] backpermute: OK
  6610. 734.69 s [vector] +++ OK, passed 100 tests.
  6611. 734.70 s [vector] map: OK
  6612. 734.70 s [vector] +++ OK, passed 100 tests.
  6613. 734.70 s [vector] imap: OK
  6614. 734.70 s [vector] +++ OK, passed 100 tests.
  6615. 734.70 s [vector] concatMap: OK
  6616. 734.70 s [vector] +++ OK, passed 100 tests.
  6617. 734.70 s [vector] mapM: OK
  6618. 734.70 s [vector] +++ OK, passed 100 tests.
  6619. 734.72 s [vector] mapM_: OK
  6620. 734.73 s [vector] +++ OK, passed 100 tests.
  6621. 734.73 s [vector] forM: OK
  6622. 734.73 s [vector] +++ OK, passed 100 tests.
  6623. 734.74 s [vector] forM_: OK (0.02s)
  6624. 734.75 s [vector] +++ OK, passed 100 tests.
  6625. 734.75 s [vector] imapM: OK
  6626. 734.75 s [vector] +++ OK, passed 100 tests.
  6627. 734.76 s [vector] imapM_: OK (0.02s)
  6628. 734.77 s [vector] +++ OK, passed 100 tests.
  6629. 734.77 s [vector] zipWith: OK
  6630. 734.77 s [vector] +++ OK, passed 100 tests.
  6631. 734.77 s [vector] zipWith3: OK
  6632. 734.77 s [vector] +++ OK, passed 100 tests.
  6633. 734.77 s [vector] izipWith: OK
  6634. 734.77 s [vector] +++ OK, passed 100 tests.
  6635. 734.77 s [vector] izipWith3: OK
  6636. 734.77 s [vector] +++ OK, passed 100 tests.
  6637. 734.79 s [vector] izipWithM: OK
  6638. 734.79 s [vector] +++ OK, passed 100 tests.
  6639. 734.80 s [vector] izipWithM_: OK (0.02s)
  6640. 734.81 s [vector] +++ OK, passed 100 tests.
  6641. 734.81 s [vector] zipWithM: OK
  6642. 734.81 s [vector] +++ OK, passed 100 tests.
  6643. 734.82 s [vector] zipWithM_: OK (0.01s)
  6644. 734.82 s [vector] +++ OK, passed 100 tests.
  6645. 734.82 s [vector] filter: OK
  6646. 734.82 s [vector] +++ OK, passed 100 tests.
  6647. 734.82 s [vector] ifilter: OK
  6648. 734.82 s [vector] +++ OK, passed 100 tests.
  6649. 734.85 s [vector] filterM: OK (0.01s)
  6650. 734.85 s [vector] +++ OK, passed 100 tests.
  6651. 734.85 s [vector] uniq: OK
  6652. 734.85 s [vector] +++ OK, passed 100 tests.
  6653. 734.85 s [vector] mapMaybe: OK
  6654. 734.85 s [vector] +++ OK, passed 100 tests.
  6655. 734.85 s [vector] imapMaybe: OK
  6656. 734.85 s [vector] +++ OK, passed 100 tests.
  6657. 734.85 s [vector] takeWhile: OK
  6658. 734.85 s [vector] +++ OK, passed 100 tests.
  6659. 734.85 s [vector] dropWhile: OK
  6660. 734.85 s [vector] +++ OK, passed 100 tests.
  6661. 734.86 s [vector] partition: OK
  6662. 734.86 s [vector] +++ OK, passed 100 tests.
  6663. 734.86 s [vector] partitionWith: OK
  6664. 734.86 s [vector] +++ OK, passed 100 tests.
  6665. 734.86 s [vector] span: OK
  6666. 734.86 s [vector] +++ OK, passed 100 tests.
  6667. 734.86 s [vector] break: OK
  6668. 734.86 s [vector] +++ OK, passed 100 tests.
  6669. 734.86 s [vector] spanR: OK
  6670. 734.86 s [vector] +++ OK, passed 100 tests.
  6671. 734.86 s [vector] breakR: OK
  6672. 734.86 s [vector] +++ OK, passed 100 tests.
  6673. 734.87 s [vector] groupBy: OK
  6674. 734.87 s [vector] +++ OK, passed 100 tests.
  6675. 734.87 s [vector] elem: OK
  6676. 734.87 s [vector] +++ OK, passed 100 tests.
  6677. 734.87 s [vector] notElem: OK
  6678. 734.87 s [vector] +++ OK, passed 100 tests.
  6679. 734.87 s [vector] find: OK
  6680. 734.87 s [vector] +++ OK, passed 100 tests.
  6681. 734.87 s [vector] findIndex: OK
  6682. 734.87 s [vector] +++ OK, passed 100 tests.
  6683. 734.87 s [vector] findIndexR: OK
  6684. 734.87 s [vector] +++ OK, passed 100 tests.
  6685. 734.87 s [vector] findIndices: OK
  6686. 734.87 s [vector] +++ OK, passed 100 tests.
  6687. 734.87 s [vector] elemIndex: OK
  6688. 734.87 s [vector] +++ OK, passed 100 tests.
  6689. 734.88 s [vector] elemIndices: OK
  6690. 734.88 s [vector] +++ OK, passed 100 tests.
  6691. 734.88 s [vector] foldl: OK
  6692. 734.88 s [vector] +++ OK, passed 100 tests.
  6693. 734.88 s [vector] foldl1: OK
  6694. 734.88 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6695. 734.88 s [vector] foldl': OK
  6696. 734.88 s [vector] +++ OK, passed 100 tests.
  6697. 734.89 s [vector] foldl1': OK
  6698. 734.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6699. 734.89 s [vector] foldr: OK
  6700. 734.89 s [vector] +++ OK, passed 100 tests.
  6701. 734.90 s [vector] foldr1: OK
  6702. 734.90 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6703. 734.90 s [vector] foldr': OK
  6704. 734.91 s [vector] +++ OK, passed 100 tests.
  6705. 734.91 s [vector] foldr1': OK
  6706. 734.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6707. 734.91 s [vector] ifoldl: OK
  6708. 734.91 s [vector] +++ OK, passed 100 tests.
  6709. 734.91 s [vector] ifoldl': OK
  6710. 734.91 s [vector] +++ OK, passed 100 tests.
  6711. 734.92 s [vector] ifoldr: OK
  6712. 734.92 s [vector] +++ OK, passed 100 tests.
  6713. 734.93 s [vector] ifoldr': OK
  6714. 734.93 s [vector] +++ OK, passed 100 tests.
  6715. 734.93 s [vector] ifoldM: OK
  6716. 734.93 s [vector] +++ OK, passed 100 tests.
  6717. 734.94 s [vector] ifoldM': OK
  6718. 734.94 s [vector] +++ OK, passed 100 tests.
  6719. 734.95 s [vector] ifoldM_: OK (0.02s)
  6720. 734.95 s [vector] +++ OK, passed 100 tests.
  6721. 734.96 s [vector] ifoldM'_: OK (0.02s)
  6722. 734.96 s [vector] +++ OK, passed 100 tests.
  6723. 734.96 s [vector] all: OK
  6724. 734.96 s [vector] +++ OK, passed 100 tests.
  6725. 734.96 s [vector] any: OK
  6726. 734.96 s [vector] +++ OK, passed 100 tests.
  6727. 734.97 s [vector] prescanl: OK
  6728. 734.97 s [vector] +++ OK, passed 100 tests.
  6729. 734.97 s [vector] prescanl': OK
  6730. 734.97 s [vector] +++ OK, passed 100 tests.
  6731. 734.97 s [vector] postscanl: OK
  6732. 734.97 s [vector] +++ OK, passed 100 tests.
  6733. 734.97 s [vector] postscanl': OK
  6734. 734.97 s [vector] +++ OK, passed 100 tests.
  6735. 734.98 s [vector] scanl: OK
  6736. 734.98 s [vector] +++ OK, passed 100 tests.
  6737. 734.98 s [vector] scanl': OK
  6738. 734.98 s [vector] +++ OK, passed 100 tests.
  6739. 734.98 s [vector] scanl1: OK
  6740. 734.98 s [vector] +++ OK, passed 100 tests.
  6741. 734.99 s [vector] scanl1': OK
  6742. 734.99 s [vector] +++ OK, passed 100 tests.
  6743. 734.99 s [vector] iscanl: OK
  6744. 734.99 s [vector] +++ OK, passed 100 tests.
  6745. 735.00 s [vector] iscanl': OK
  6746. 735.00 s [vector] +++ OK, passed 100 tests.
  6747. 735.00 s [vector] prescanr: OK
  6748. 735.00 s [vector] +++ OK, passed 100 tests.
  6749. 735.00 s [vector] prescanr': OK
  6750. 735.00 s [vector] +++ OK, passed 100 tests.
  6751. 735.00 s [vector] postscanr: OK
  6752. 735.00 s [vector] +++ OK, passed 100 tests.
  6753. 735.01 s [vector] postscanr': OK
  6754. 735.01 s [vector] +++ OK, passed 100 tests.
  6755. 735.01 s [vector] scanr: OK
  6756. 735.01 s [vector] +++ OK, passed 100 tests.
  6757. 735.01 s [vector] scanr': OK
  6758. 735.01 s [vector] +++ OK, passed 100 tests.
  6759. 735.02 s [vector] scanr1: OK
  6760. 735.02 s [vector] +++ OK, passed 100 tests.
  6761. 735.03 s [vector] scanr1': OK
  6762. 735.03 s [vector] +++ OK, passed 100 tests.
  6763. 735.03 s [vector] iscanr: OK
  6764. 735.03 s [vector] +++ OK, passed 100 tests.
  6765. 735.03 s [vector] iscanr': OK
  6766. 735.03 s [vector] +++ OK, passed 100 tests.
  6767. 735.03 s [vector] mut_read: OK
  6768. 735.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6769. 735.03 s [vector] mut_write: OK
  6770. 735.03 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6771. 735.04 s [vector] mut_modify: OK
  6772. 735.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6773. 735.05 s [vector] mut_generate: OK
  6774. 735.05 s [vector] +++ OK, passed 100 tests.
  6775. 735.07 s [vector] mut_generateM: OK (0.02s)
  6776. 735.07 s [vector] +++ OK, passed 100 tests.
  6777. 735.07 s [vector] mut_mapM_: OK (0.02s)
  6778. 735.07 s [vector] +++ OK, passed 100 tests.
  6779. 735.10 s [vector] mut_imapM_: OK
  6780. 735.10 s [vector] +++ OK, passed 100 tests.
  6781. 735.11 s [vector] mut_forM_: OK (0.02s)
  6782. 735.11 s [vector] +++ OK, passed 100 tests.
  6783. 735.13 s [vector] mut_iforM_: OK
  6784. 735.14 s [vector] +++ OK, passed 100 tests.
  6785. 735.14 s [vector] mut_foldr: OK
  6786. 735.14 s [vector] +++ OK, passed 100 tests.
  6787. 735.14 s [vector] mut_foldr': OK
  6788. 735.14 s [vector] +++ OK, passed 100 tests.
  6789. 735.14 s [vector] mut_foldl: OK
  6790. 735.14 s [vector] +++ OK, passed 100 tests.
  6791. 735.14 s [vector] mut_foldl': OK
  6792. 735.14 s [vector] +++ OK, passed 100 tests.
  6793. 735.15 s [vector] mut_ifoldr: OK
  6794. 735.15 s [vector] +++ OK, passed 100 tests.
  6795. 735.15 s [vector] mut_ifoldr': OK
  6796. 735.15 s [vector] +++ OK, passed 100 tests.
  6797. 735.16 s [vector] mut_ifoldl: OK
  6798. 735.16 s [vector] +++ OK, passed 100 tests.
  6799. 735.16 s [vector] mut_ifoldl': OK
  6800. 735.17 s [vector] +++ OK, passed 100 tests.
  6801. 735.17 s [vector] mut_foldM: OK
  6802. 735.17 s [vector] +++ OK, passed 100 tests.
  6803. 735.17 s [vector] mut_foldM': OK
  6804. 735.17 s [vector] +++ OK, passed 100 tests.
  6805. 735.17 s [vector] mut_foldrM: OK
  6806. 735.17 s [vector] +++ OK, passed 100 tests.
  6807. 735.17 s [vector] mut_foldrM': OK
  6808. 735.17 s [vector] +++ OK, passed 100 tests.
  6809. 735.18 s [vector] mut_ifoldM: OK
  6810. 735.18 s [vector] +++ OK, passed 100 tests.
  6811. 735.18 s [vector] mut_ifoldM': OK
  6812. 735.18 s [vector] +++ OK, passed 100 tests.
  6813. 735.18 s [vector] mut_ifoldrM: OK
  6814. 735.19 s [vector] +++ OK, passed 100 tests.
  6815. 735.19 s [vector] mut_ifoldrM': OK
  6816. 735.19 s [vector] +++ OK, passed 100 tests.
  6817. 735.19 s [vector] compare: OK
  6818. 735.19 s [vector] +++ OK, passed 100 tests.
  6819. 735.19 s [vector] maximum: OK
  6820. 735.19 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6821. 735.19 s [vector] minimum: OK
  6822. 735.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6823. 735.19 s [vector] minIndex: OK
  6824. 735.19 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6825. 735.19 s [vector] maxIndex: OK
  6826. 735.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6827. 735.19 s [vector] maximumBy: OK
  6828. 735.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6829. 735.20 s [vector] minimumBy: OK
  6830. 735.20 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6831. 735.20 s [vector] maximumOn: OK
  6832. 735.20 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6833. 735.20 s [vector] minimumOn: OK
  6834. 735.20 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6835. 735.20 s [vector] maxIndexBy: OK
  6836. 735.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6837. 735.20 s [vector] minIndexBy: OK
  6838. 735.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6839. 735.20 s [vector] ListFirstMaxIndexWins: OK
  6840. 735.20 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6841. 735.20 s [vector] FalseListFirstMaxIndexWins: OK
  6842. 735.20 s [vector] +++ OK, failed as expected. (after 1 test):
  6843. 735.21 s [vector] Exception:
  6844. 735.21 s [vector] Prelude.foldr1: empty list
  6845. 735.21 s [vector] CallStack (from HasCallStack):
  6846. 735.21 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  6847. 735.21 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  6848. 735.21 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6849. 735.21 s [vector] []
  6850. 735.21 s [vector] mempty: OK
  6851. 735.21 s [vector] +++ OK, passed 100 tests.
  6852. 735.21 s [vector] mappend: OK
  6853. 735.21 s [vector] +++ OK, passed 100 tests.
  6854. 735.23 s [vector] mconcat: OK (0.02s)
  6855. 735.23 s [vector] +++ OK, passed 100 tests.
  6856. 735.23 s [vector] glength: OK
  6857. 735.23 s [vector] +++ OK, passed 100 tests.
  6858. 735.23 s [vector] sum: OK
  6859. 735.23 s [vector] +++ OK, passed 100 tests.
  6860. 735.23 s [vector] product: OK
  6861. 735.23 s [vector] +++ OK, passed 100 tests.
  6862. 735.23 s [vector] enumFromN: OK
  6863. 735.23 s [vector] +++ OK, passed 100 tests.
  6864. 735.23 s [vector] enumFromThenN: OK
  6865. 735.23 s [vector] +++ OK, passed 100 tests.
  6866. 735.23 s [vector] enumFromTo: OK
  6867. 735.23 s [vector] +++ OK, passed 100 tests.
  6868. 735.23 s [vector] enumFromThenTo: OK
  6869. 735.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6870. 735.23 s [vector] Double
  6871. 735.23 s [vector] fromList.toList == id: OK
  6872. 735.23 s [vector] +++ OK, passed 100 tests.
  6873. 735.23 s [vector] toList.fromList == id: OK
  6874. 735.23 s [vector] +++ OK, passed 100 tests.
  6875. 735.23 s [vector] unstream.stream == id: OK
  6876. 735.23 s [vector] +++ OK, passed 100 tests.
  6877. 735.23 s [vector] stream.unstream == id: OK
  6878. 735.23 s [vector] +++ OK, passed 100 tests.
  6879. 735.24 s [vector] eq: OK
  6880. 735.24 s [vector] +++ OK, passed 100 tests.
  6881. 735.24 s [vector] length: OK
  6882. 735.24 s [vector] +++ OK, passed 100 tests.
  6883. 735.24 s [vector] null: OK
  6884. 735.24 s [vector] +++ OK, passed 100 tests.
  6885. 735.24 s [vector] index: OK
  6886. 735.24 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6887. 735.24 s [vector] safeIndex: OK
  6888. 735.24 s [vector] +++ OK, passed 100 tests.
  6889. 735.24 s [vector] head: OK
  6890. 735.24 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6891. 735.24 s [vector] last: OK
  6892. 735.24 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6893. 735.24 s [vector] unsafeIndex: OK
  6894. 735.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6895. 735.24 s [vector] unsafeHead: OK
  6896. 735.24 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6897. 735.24 s [vector] unsafeLast: OK
  6898. 735.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6899. 735.24 s [vector] slice: OK
  6900. 735.24 s [vector] +++ OK, passed 100 tests.
  6901. 735.25 s [vector] init: OK
  6902. 735.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6903. 735.25 s [vector] tail: OK
  6904. 735.25 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6905. 735.25 s [vector] take: OK
  6906. 735.25 s [vector] +++ OK, passed 100 tests.
  6907. 735.25 s [vector] drop: OK
  6908. 735.25 s [vector] +++ OK, passed 100 tests.
  6909. 735.25 s [vector] splitAt: OK
  6910. 735.25 s [vector] +++ OK, passed 100 tests.
  6911. 735.25 s [vector] empty: OK
  6912. 735.25 s [vector] +++ OK, passed 100 tests.
  6913. 735.25 s [vector] singleton: OK
  6914. 735.25 s [vector] +++ OK, passed 100 tests.
  6915. 735.25 s [vector] replicate: OK
  6916. 735.25 s [vector] +++ OK, passed 100 tests.
  6917. 735.25 s [vector] generate: OK
  6918. 735.25 s [vector] +++ OK, passed 100 tests.
  6919. 735.28 s [vector] iterateN: OK
  6920. 735.28 s [vector] +++ OK, passed 100 tests.
  6921. 735.31 s [vector] iterateNM: OK (0.04s)
  6922. 735.31 s [vector] +++ OK, passed 100 tests.
  6923. 735.33 s [vector] generateM: OK (0.03s)
  6924. 735.33 s [vector] +++ OK, passed 100 tests.
  6925. 735.33 s [vector] replicateM: OK
  6926. 735.33 s [vector] +++ OK, passed 100 tests.
  6927. 735.33 s [vector] create: OK
  6928. 735.33 s [vector] +++ OK, passed 100 tests.
  6929. 735.33 s [vector] createT: OK
  6930. 735.33 s [vector] +++ OK, passed 100 tests.
  6931. 735.33 s [vector] unfoldr: OK
  6932. 735.33 s [vector] +++ OK, passed 100 tests.
  6933. 735.33 s [vector] unfoldrN: OK
  6934. 735.33 s [vector] +++ OK, passed 100 tests.
  6935. 735.33 s [vector] unfoldrExactN: OK
  6936. 735.33 s [vector] +++ OK, passed 100 tests.
  6937. 735.34 s [vector] unfoldrM: OK
  6938. 735.34 s [vector] +++ OK, passed 100 tests.
  6939. 735.34 s [vector] unfoldrNM: OK
  6940. 735.34 s [vector] +++ OK, passed 100 tests.
  6941. 735.38 s [vector] unfoldrExactNM: OK (0.03s)
  6942. 735.38 s [vector] +++ OK, passed 100 tests.
  6943. 735.41 s [vector] constructN: OK
  6944. 735.41 s [vector] +++ OK, passed 100 tests.
  6945. 735.41 s [vector] constructrN: OK (0.01s)
  6946. 735.41 s [vector] +++ OK, passed 100 tests.
  6947. 735.41 s [vector] cons: OK
  6948. 735.41 s [vector] +++ OK, passed 100 tests.
  6949. 735.41 s [vector] snoc: OK
  6950. 735.41 s [vector] +++ OK, passed 100 tests.
  6951. 735.41 s [vector] append: OK
  6952. 735.41 s [vector] +++ OK, passed 100 tests.
  6953. 735.43 s [vector] concat: OK (0.02s)
  6954. 735.43 s [vector] +++ OK, passed 100 tests.
  6955. 735.43 s [vector] force: OK
  6956. 735.43 s [vector] +++ OK, passed 100 tests.
  6957. 735.43 s [vector] upd: OK
  6958. 735.44 s [vector] +++ OK, passed 100 tests.
  6959. 735.45 s [vector] accum: OK
  6960. 735.45 s [vector] +++ OK, passed 100 tests.
  6961. 735.45 s [vector] reverse: OK
  6962. 735.45 s [vector] +++ OK, passed 100 tests.
  6963. 735.45 s [vector] backpermute: OK
  6964. 735.45 s [vector] +++ OK, passed 100 tests.
  6965. 735.46 s [vector] map: OK
  6966. 735.46 s [vector] +++ OK, passed 100 tests.
  6967. 735.47 s [vector] imap: OK
  6968. 735.47 s [vector] +++ OK, passed 100 tests.
  6969. 735.48 s [vector] concatMap: OK
  6970. 735.48 s [vector] +++ OK, passed 100 tests.
  6971. 735.48 s [vector] mapM: OK
  6972. 735.48 s [vector] +++ OK, passed 100 tests.
  6973. 735.53 s [vector] mapM_: OK (0.03s)
  6974. 735.53 s [vector] +++ OK, passed 100 tests.
  6975. 735.53 s [vector] forM: OK
  6976. 735.53 s [vector] +++ OK, passed 100 tests.
  6977. 735.57 s [vector] forM_: OK (0.04s)
  6978. 735.57 s [vector] +++ OK, passed 100 tests.
  6979. 735.59 s [vector] imapM: OK
  6980. 735.59 s [vector] +++ OK, passed 100 tests.
  6981. 735.61 s [vector] imapM_: OK (0.04s)
  6982. 735.61 s [vector] +++ OK, passed 100 tests.
  6983. 735.62 s [vector] zipWith: OK
  6984. 735.62 s [vector] +++ OK, passed 100 tests.
  6985. 735.64 s [vector] zipWith3: OK
  6986. 735.64 s [vector] +++ OK, passed 100 tests.
  6987. 735.65 s [vector] izipWith: OK
  6988. 735.65 s [vector] +++ OK, passed 100 tests.
  6989. 735.67 s [vector] izipWith3: OK (0.01s)
  6990. 735.67 s [vector] +++ OK, passed 100 tests.
  6991. 735.69 s [vector] izipWithM: OK (0.01s)
  6992. 735.69 s [vector] +++ OK, passed 100 tests.
  6993. 735.71 s [vector] izipWithM_: OK (0.02s)
  6994. 735.71 s [vector] +++ OK, passed 100 tests.
  6995. 735.71 s [vector] zipWithM: OK
  6996. 735.71 s [vector] +++ OK, passed 100 tests.
  6997. 735.73 s [vector] zipWithM_: OK (0.03s)
  6998. 735.73 s [vector] +++ OK, passed 100 tests.
  6999. 735.74 s [vector] filter: OK
  7000. 735.75 s [vector] +++ OK, passed 100 tests.
  7001. 735.75 s [vector] ifilter: OK
  7002. 735.75 s [vector] +++ OK, passed 100 tests.
  7003. 735.79 s [vector] filterM: OK (0.04s)
  7004. 735.79 s [vector] +++ OK, passed 100 tests.
  7005. 735.79 s [vector] uniq: OK
  7006. 735.79 s [vector] +++ OK, passed 100 tests.
  7007. 735.80 s [vector] mapMaybe: OK
  7008. 735.80 s [vector] +++ OK, passed 100 tests.
  7009. 735.81 s [vector] imapMaybe: OK
  7010. 735.81 s [vector] +++ OK, passed 100 tests.
  7011. 735.81 s [vector] takeWhile: OK
  7012. 735.81 s [vector] +++ OK, passed 100 tests.
  7013. 735.82 s [vector] dropWhile: OK
  7014. 735.82 s [vector] +++ OK, passed 100 tests.
  7015. 735.82 s [vector] partition: OK
  7016. 735.82 s [vector] +++ OK, passed 100 tests.
  7017. 735.83 s [vector] partitionWith: OK
  7018. 735.84 s [vector] +++ OK, passed 100 tests.
  7019. 735.84 s [vector] span: OK
  7020. 735.84 s [vector] +++ OK, passed 100 tests.
  7021. 735.84 s [vector] break: OK
  7022. 735.84 s [vector] +++ OK, passed 100 tests.
  7023. 735.84 s [vector] spanR: OK
  7024. 735.84 s [vector] +++ OK, passed 100 tests.
  7025. 735.85 s [vector] breakR: OK
  7026. 735.85 s [vector] +++ OK, passed 100 tests.
  7027. 735.85 s [vector] groupBy: OK
  7028. 735.85 s [vector] +++ OK, passed 100 tests.
  7029. 735.85 s [vector] elem: OK
  7030. 735.85 s [vector] +++ OK, passed 100 tests.
  7031. 735.85 s [vector] notElem: OK
  7032. 735.85 s [vector] +++ OK, passed 100 tests.
  7033. 735.86 s [vector] find: OK
  7034. 735.86 s [vector] +++ OK, passed 100 tests.
  7035. 735.86 s [vector] findIndex: OK
  7036. 735.86 s [vector] +++ OK, passed 100 tests.
  7037. 735.87 s [vector] findIndexR: OK
  7038. 735.87 s [vector] +++ OK, passed 100 tests.
  7039. 735.87 s [vector] findIndices: OK (0.01s)
  7040. 735.87 s [vector] +++ OK, passed 100 tests.
  7041. 735.87 s [vector] elemIndex: OK
  7042. 735.87 s [vector] +++ OK, passed 100 tests.
  7043. 735.88 s [vector] elemIndices: OK
  7044. 735.89 s [vector] +++ OK, passed 100 tests.
  7045. 735.90 s [vector] foldl: OK (0.02s)
  7046. 735.90 s [vector] +++ OK, passed 100 tests.
  7047. 735.91 s [vector] foldl1: OK
  7048. 735.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7049. 735.93 s [vector] foldl': OK (0.01s)
  7050. 735.93 s [vector] +++ OK, passed 100 tests.
  7051. 735.95 s [vector] foldl1': OK (0.01s)
  7052. 735.95 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7053. 735.97 s [vector] foldr: OK (0.01s)
  7054. 735.97 s [vector] +++ OK, passed 100 tests.
  7055. 735.97 s [vector] foldr1: OK (0.02s)
  7056. 735.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7057. 736.01 s [vector] foldr': OK (0.03s)
  7058. 736.01 s [vector] +++ OK, passed 100 tests.
  7059. 736.03 s [vector] foldr1': OK (0.03s)
  7060. 736.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7061. 736.05 s [vector] ifoldl: OK (0.02s)
  7062. 736.05 s [vector] +++ OK, passed 100 tests.
  7063. 736.07 s [vector] ifoldl': OK (0.02s)
  7064. 736.07 s [vector] +++ OK, passed 100 tests.
  7065. 736.08 s [vector] ifoldr: OK (0.02s)
  7066. 736.08 s [vector] +++ OK, passed 100 tests.
  7067. 736.11 s [vector] ifoldr': OK
  7068. 736.11 s [vector] +++ OK, passed 100 tests.
  7069. 736.11 s [vector] ifoldM: OK (0.01s)
  7070. 736.11 s [vector] +++ OK, passed 100 tests.
  7071. 736.12 s [vector] ifoldM': OK
  7072. 736.12 s [vector] +++ OK, passed 100 tests.
  7073. 736.17 s [vector] ifoldM_: OK (0.03s)
  7074. 736.17 s [vector] +++ OK, passed 100 tests.
  7075. 736.20 s [vector] ifoldM'_: OK (0.04s)
  7076. 736.20 s [vector] +++ OK, passed 100 tests.
  7077. 736.20 s [vector] all: OK
  7078. 736.20 s [vector] +++ OK, passed 100 tests.
  7079. 736.20 s [vector] any: OK
  7080. 736.20 s [vector] +++ OK, passed 100 tests.
  7081. 736.23 s [vector] prescanl: OK
  7082. 736.23 s [vector] +++ OK, passed 100 tests.
  7083. 736.23 s [vector] prescanl': OK (0.01s)
  7084. 736.23 s [vector] +++ OK, passed 100 tests.
  7085. 736.25 s [vector] postscanl: OK
  7086. 736.25 s [vector] +++ OK, passed 100 tests.
  7087. 736.27 s [vector] postscanl': OK (0.02s)
  7088. 736.27 s [vector] +++ OK, passed 100 tests.
  7089. 736.29 s [vector] scanl: OK (0.01s)
  7090. 736.29 s [vector] +++ OK, passed 100 tests.
  7091. 736.29 s [vector] scanl': OK (0.01s)
  7092. 736.29 s [vector] +++ OK, passed 100 tests.
  7093. 736.31 s [vector] scanl1: OK
  7094. 736.31 s [vector] +++ OK, passed 100 tests.
  7095. 736.32 s [vector] scanl1': OK (0.01s)
  7096. 736.32 s [vector] +++ OK, passed 100 tests.
  7097. 736.33 s [vector] iscanl: OK
  7098. 736.33 s [vector] +++ OK, passed 100 tests.
  7099. 736.35 s [vector] iscanl': OK (0.01s)
  7100. 736.35 s [vector] +++ OK, passed 100 tests.
  7101. 736.37 s [vector] prescanr: OK (0.01s)
  7102. 736.37 s [vector] +++ OK, passed 100 tests.
  7103. 736.39 s [vector] prescanr': OK (0.02s)
  7104. 736.40 s [vector] +++ OK, passed 100 tests.
  7105. 736.41 s [vector] postscanr: OK (0.01s)
  7106. 736.41 s [vector] +++ OK, passed 100 tests.
  7107. 736.42 s [vector] postscanr': OK (0.01s)
  7108. 736.42 s [vector] +++ OK, passed 100 tests.
  7109. 736.42 s [vector] scanr: OK (0.01s)
  7110. 736.42 s [vector] +++ OK, passed 100 tests.
  7111. 736.43 s [vector] scanr': OK
  7112. 736.43 s [vector] +++ OK, passed 100 tests.
  7113. 736.45 s [vector] scanr1: OK (0.01s)
  7114. 736.45 s [vector] +++ OK, passed 100 tests.
  7115. 736.47 s [vector] scanr1': OK (0.01s)
  7116. 736.47 s [vector] +++ OK, passed 100 tests.
  7117. 736.47 s [vector] iscanr: OK (0.01s)
  7118. 736.47 s [vector] +++ OK, passed 100 tests.
  7119. 736.48 s [vector] iscanr': OK (0.01s)
  7120. 736.48 s [vector] +++ OK, passed 100 tests.
  7121. 736.48 s [vector] mut_read: OK
  7122. 736.48 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7123. 736.48 s [vector] mut_write: OK
  7124. 736.49 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7125. 736.49 s [vector] mut_modify: OK
  7126. 736.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7127. 736.49 s [vector] mut_generate: OK
  7128. 736.49 s [vector] +++ OK, passed 100 tests.
  7129. 736.51 s [vector] mut_generateM: OK (0.02s)
  7130. 736.51 s [vector] +++ OK, passed 100 tests.
  7131. 736.55 s [vector] mut_mapM_: OK (0.04s)
  7132. 736.55 s [vector] +++ OK, passed 100 tests.
  7133. 736.59 s [vector] mut_imapM_: OK (0.04s)
  7134. 736.59 s [vector] +++ OK, passed 100 tests.
  7135. 736.63 s [vector] mut_forM_: OK (0.03s)
  7136. 736.63 s [vector] +++ OK, passed 100 tests.
  7137. 736.67 s [vector] mut_iforM_: OK (0.04s)
  7138. 736.67 s [vector] +++ OK, passed 100 tests.
  7139. 736.67 s [vector] mut_foldr: OK (0.01s)
  7140. 736.67 s [vector] +++ OK, passed 100 tests.
  7141. 736.69 s [vector] mut_foldr': OK (0.01s)
  7142. 736.69 s [vector] +++ OK, passed 100 tests.
  7143. 736.69 s [vector] mut_foldl: OK (0.01s)
  7144. 736.69 s [vector] +++ OK, passed 100 tests.
  7145. 736.70 s [vector] mut_foldl': OK
  7146. 736.70 s [vector] +++ OK, passed 100 tests.
  7147. 736.72 s [vector] mut_ifoldr: OK
  7148. 736.72 s [vector] +++ OK, passed 100 tests.
  7149. 736.73 s [vector] mut_ifoldr': OK
  7150. 736.73 s [vector] +++ OK, passed 100 tests.
  7151. 736.75 s [vector] mut_ifoldl: OK (0.01s)
  7152. 736.75 s [vector] +++ OK, passed 100 tests.
  7153. 736.75 s [vector] mut_ifoldl': OK (0.01s)
  7154. 736.75 s [vector] +++ OK, passed 100 tests.
  7155. 736.76 s [vector] mut_foldM: OK
  7156. 736.76 s [vector] +++ OK, passed 100 tests.
  7157. 736.79 s [vector] mut_foldM': OK (0.01s)
  7158. 736.79 s [vector] +++ OK, passed 100 tests.
  7159. 736.79 s [vector] mut_foldrM: OK (0.01s)
  7160. 736.80 s [vector] +++ OK, passed 100 tests.
  7161. 736.81 s [vector] mut_foldrM': OK (0.01s)
  7162. 736.81 s [vector] +++ OK, passed 100 tests.
  7163. 736.83 s [vector] mut_ifoldM: OK (0.01s)
  7164. 736.83 s [vector] +++ OK, passed 100 tests.
  7165. 736.83 s [vector] mut_ifoldM': OK (0.01s)
  7166. 736.84 s [vector] +++ OK, passed 100 tests.
  7167. 736.85 s [vector] mut_ifoldrM: OK (0.01s)
  7168. 736.85 s [vector] +++ OK, passed 100 tests.
  7169. 736.85 s [vector] mut_ifoldrM': OK (0.01s)
  7170. 736.85 s [vector] +++ OK, passed 100 tests.
  7171. 736.86 s [vector] compare: OK
  7172. 736.86 s [vector] +++ OK, passed 100 tests.
  7173. 736.86 s [vector] maximum: OK
  7174. 736.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7175. 736.86 s [vector] minimum: OK
  7176. 736.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7177. 736.86 s [vector] minIndex: OK
  7178. 736.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7179. 736.86 s [vector] maxIndex: OK
  7180. 736.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7181. 736.86 s [vector] maximumBy: OK
  7182. 736.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7183. 736.86 s [vector] minimumBy: OK
  7184. 736.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7185. 736.86 s [vector] maximumOn: OK
  7186. 736.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7187. 736.86 s [vector] minimumOn: OK
  7188. 736.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7189. 736.86 s [vector] maxIndexBy: OK
  7190. 736.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7191. 736.86 s [vector] minIndexBy: OK
  7192. 736.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7193. 736.86 s [vector] ListFirstMaxIndexWins: OK
  7194. 736.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7195. 736.86 s [vector] FalseListFirstMaxIndexWins: OK
  7196. 736.86 s [vector] +++ OK, failed as expected. (after 1 test):
  7197. 736.86 s [vector] Exception:
  7198. 736.86 s [vector] Prelude.foldr1: empty list
  7199. 736.86 s [vector] CallStack (from HasCallStack):
  7200. 736.86 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  7201. 736.86 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  7202. 736.86 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7203. 736.86 s [vector] []
  7204. 736.86 s [vector] mempty: OK
  7205. 736.87 s [vector] +++ OK, passed 100 tests.
  7206. 736.87 s [vector] mappend: OK
  7207. 736.87 s [vector] +++ OK, passed 100 tests.
  7208. 736.89 s [vector] mconcat: OK (0.02s)
  7209. 736.89 s [vector] +++ OK, passed 100 tests.
  7210. 736.89 s [vector] glength: OK
  7211. 736.89 s [vector] +++ OK, passed 100 tests.
  7212. 736.89 s [vector] sum: OK
  7213. 736.89 s [vector] +++ OK, passed 100 tests.
  7214. 736.89 s [vector] product: OK
  7215. 736.89 s [vector] +++ OK, passed 100 tests.
  7216. 736.89 s [vector] enumFromN: OK
  7217. 736.89 s [vector] +++ OK, passed 100 tests.
  7218. 736.89 s [vector] enumFromThenN: OK
  7219. 736.89 s [vector] +++ OK, passed 100 tests.
  7220. 736.90 s [vector] enumFromTo: OK
  7221. 736.90 s [vector] +++ OK, passed 100 tests.
  7222. 736.90 s [vector] enumFromThenTo: OK
  7223. 736.90 s [vector] +++ OK, passed 100 tests; 2 discarded.
  7224. 736.90 s [vector] unstream
  7225. 736.90 s [vector] unstream == vunstream (exact): OK
  7226. 736.90 s [vector] +++ OK, passed 100 tests.
  7227. 736.90 s [vector] unstream == vunstream (unknown): OK
  7228. 736.90 s [vector] +++ OK, passed 100 tests.
  7229. 736.90 s [vector] unstreamR ~= vunstream (exact): OK
  7230. 736.90 s [vector] +++ OK, passed 100 tests.
  7231. 736.90 s [vector] unstreamR ~= vunstream (unknown): OK
  7232. 736.90 s [vector] +++ OK, passed 100 tests.
  7233. 736.90 s [vector] Tests.Vector.Storable
  7234. 736.90 s [vector] Data.Vector.Storable.Vector (Int)
  7235. 736.90 s [vector] fromList.toList == id: OK
  7236. 736.91 s [vector] +++ OK, passed 100 tests.
  7237. 736.91 s [vector] toList.fromList == id: OK
  7238. 736.91 s [vector] +++ OK, passed 100 tests.
  7239. 736.91 s [vector] unstream.stream == id: OK
  7240. 736.91 s [vector] +++ OK, passed 100 tests.
  7241. 736.91 s [vector] stream.unstream == id: OK
  7242. 736.91 s [vector] +++ OK, passed 100 tests.
  7243. 736.91 s [vector] eq: OK
  7244. 736.91 s [vector] +++ OK, passed 100 tests.
  7245. 736.91 s [vector] length: OK
  7246. 736.91 s [vector] +++ OK, passed 100 tests.
  7247. 736.91 s [vector] null: OK
  7248. 736.91 s [vector] +++ OK, passed 100 tests.
  7249. 736.91 s [vector] index: OK
  7250. 736.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7251. 736.91 s [vector] safeIndex: OK
  7252. 736.91 s [vector] +++ OK, passed 100 tests.
  7253. 736.91 s [vector] head: OK
  7254. 736.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7255. 736.91 s [vector] last: OK
  7256. 736.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7257. 736.91 s [vector] unsafeIndex: OK
  7258. 736.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7259. 736.91 s [vector] unsafeHead: OK
  7260. 736.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7261. 736.91 s [vector] unsafeLast: OK
  7262. 736.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7263. 736.91 s [vector] slice: OK
  7264. 736.91 s [vector] +++ OK, passed 100 tests.
  7265. 736.91 s [vector] init: OK
  7266. 736.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7267. 736.91 s [vector] tail: OK
  7268. 736.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7269. 736.91 s [vector] take: OK
  7270. 736.91 s [vector] +++ OK, passed 100 tests.
  7271. 736.91 s [vector] drop: OK
  7272. 736.91 s [vector] +++ OK, passed 100 tests.
  7273. 736.92 s [vector] splitAt: OK
  7274. 736.92 s [vector] +++ OK, passed 100 tests.
  7275. 736.92 s [vector] empty: OK
  7276. 736.92 s [vector] +++ OK, passed 100 tests.
  7277. 736.92 s [vector] singleton: OK
  7278. 736.92 s [vector] +++ OK, passed 100 tests.
  7279. 736.92 s [vector] replicate: OK
  7280. 736.92 s [vector] +++ OK, passed 100 tests.
  7281. 736.93 s [vector] generate: OK
  7282. 736.93 s [vector] +++ OK, passed 100 tests.
  7283. 736.93 s [vector] iterateN: OK
  7284. 736.93 s [vector] +++ OK, passed 100 tests.
  7285. 736.97 s [vector] iterateNM: OK (0.04s)
  7286. 736.97 s [vector] +++ OK, passed 100 tests.
  7287. 736.98 s [vector] generateM: OK (0.02s)
  7288. 736.98 s [vector] +++ OK, passed 100 tests.
  7289. 736.98 s [vector] replicateM: OK
  7290. 736.98 s [vector] +++ OK, passed 100 tests.
  7291. 736.98 s [vector] create: OK
  7292. 736.98 s [vector] +++ OK, passed 100 tests.
  7293. 736.98 s [vector] createT: OK
  7294. 736.98 s [vector] +++ OK, passed 100 tests.
  7295. 736.98 s [vector] unfoldr: OK
  7296. 736.98 s [vector] +++ OK, passed 100 tests.
  7297. 736.98 s [vector] unfoldrN: OK
  7298. 736.98 s [vector] +++ OK, passed 100 tests.
  7299. 736.98 s [vector] unfoldrExactN: OK
  7300. 736.98 s [vector] +++ OK, passed 100 tests.
  7301. 737.00 s [vector] unfoldrM: OK
  7302. 737.01 s [vector] +++ OK, passed 100 tests.
  7303. 737.01 s [vector] unfoldrNM: OK
  7304. 737.01 s [vector] +++ OK, passed 100 tests.
  7305. 737.03 s [vector] unfoldrExactNM: OK (0.03s)
  7306. 737.03 s [vector] +++ OK, passed 100 tests.
  7307. 737.03 s [vector] constructN: OK
  7308. 737.03 s [vector] +++ OK, passed 100 tests.
  7309. 737.04 s [vector] constructrN: OK
  7310. 737.04 s [vector] +++ OK, passed 100 tests.
  7311. 737.05 s [vector] cons: OK
  7312. 737.05 s [vector] +++ OK, passed 100 tests.
  7313. 737.06 s [vector] snoc: OK
  7314. 737.06 s [vector] +++ OK, passed 100 tests.
  7315. 737.06 s [vector] append: OK
  7316. 737.06 s [vector] +++ OK, passed 100 tests.
  7317. 737.06 s [vector] concat: OK (0.02s)
  7318. 737.07 s [vector] +++ OK, passed 100 tests.
  7319. 737.07 s [vector] force: OK
  7320. 737.07 s [vector] +++ OK, passed 100 tests.
  7321. 737.07 s [vector] upd: OK
  7322. 737.08 s [vector] +++ OK, passed 100 tests.
  7323. 737.08 s [vector] accum: OK
  7324. 737.08 s [vector] +++ OK, passed 100 tests.
  7325. 737.09 s [vector] reverse: OK
  7326. 737.09 s [vector] +++ OK, passed 100 tests.
  7327. 737.09 s [vector] backpermute: OK
  7328. 737.09 s [vector] +++ OK, passed 100 tests.
  7329. 737.09 s [vector] map: OK
  7330. 737.09 s [vector] +++ OK, passed 100 tests.
  7331. 737.09 s [vector] imap: OK
  7332. 737.09 s [vector] +++ OK, passed 100 tests.
  7333. 737.09 s [vector] concatMap: OK
  7334. 737.09 s [vector] +++ OK, passed 100 tests.
  7335. 737.09 s [vector] mapM: OK
  7336. 737.10 s [vector] +++ OK, passed 100 tests.
  7337. 737.11 s [vector] mapM_: OK (0.02s)
  7338. 737.11 s [vector] +++ OK, passed 100 tests.
  7339. 737.11 s [vector] forM: OK
  7340. 737.11 s [vector] +++ OK, passed 100 tests.
  7341. 737.13 s [vector] forM_: OK (0.02s)
  7342. 737.13 s [vector] +++ OK, passed 100 tests.
  7343. 737.13 s [vector] imapM: OK
  7344. 737.13 s [vector] +++ OK, passed 100 tests.
  7345. 737.14 s [vector] imapM_: OK (0.01s)
  7346. 737.14 s [vector] +++ OK, passed 100 tests.
  7347. 737.14 s [vector] zipWith: OK
  7348. 737.14 s [vector] +++ OK, passed 100 tests.
  7349. 737.15 s [vector] zipWith3: OK
  7350. 737.15 s [vector] +++ OK, passed 100 tests.
  7351. 737.15 s [vector] izipWith: OK
  7352. 737.15 s [vector] +++ OK, passed 100 tests.
  7353. 737.15 s [vector] izipWith3: OK
  7354. 737.15 s [vector] +++ OK, passed 100 tests.
  7355. 737.15 s [vector] izipWithM: OK
  7356. 737.17 s [vector] +++ OK, passed 100 tests.
  7357. 737.17 s [vector] izipWithM_: OK (0.01s)
  7358. 737.17 s [vector] +++ OK, passed 100 tests.
  7359. 737.17 s [vector] zipWithM: OK
  7360. 737.17 s [vector] +++ OK, passed 100 tests.
  7361. 737.18 s [vector] zipWithM_: OK
  7362. 737.19 s [vector] +++ OK, passed 100 tests.
  7363. 737.19 s [vector] filter: OK
  7364. 737.19 s [vector] +++ OK, passed 100 tests.
  7365. 737.19 s [vector] ifilter: OK
  7366. 737.19 s [vector] +++ OK, passed 100 tests.
  7367. 737.23 s [vector] filterM: OK (0.04s)
  7368. 737.23 s [vector] +++ OK, passed 100 tests.
  7369. 737.23 s [vector] uniq: OK
  7370. 737.23 s [vector] +++ OK, passed 100 tests.
  7371. 737.23 s [vector] mapMaybe: OK
  7372. 737.23 s [vector] +++ OK, passed 100 tests.
  7373. 737.23 s [vector] imapMaybe: OK
  7374. 737.23 s [vector] +++ OK, passed 100 tests.
  7375. 737.23 s [vector] takeWhile: OK
  7376. 737.23 s [vector] +++ OK, passed 100 tests.
  7377. 737.23 s [vector] dropWhile: OK
  7378. 737.23 s [vector] +++ OK, passed 100 tests.
  7379. 737.24 s [vector] partition: OK
  7380. 737.24 s [vector] +++ OK, passed 100 tests.
  7381. 737.24 s [vector] partitionWith: OK
  7382. 737.24 s [vector] +++ OK, passed 100 tests.
  7383. 737.24 s [vector] span: OK
  7384. 737.24 s [vector] +++ OK, passed 100 tests.
  7385. 737.24 s [vector] break: OK
  7386. 737.24 s [vector] +++ OK, passed 100 tests.
  7387. 737.24 s [vector] spanR: OK
  7388. 737.24 s [vector] +++ OK, passed 100 tests.
  7389. 737.24 s [vector] breakR: OK
  7390. 737.24 s [vector] +++ OK, passed 100 tests.
  7391. 737.24 s [vector] groupBy: OK
  7392. 737.24 s [vector] +++ OK, passed 100 tests.
  7393. 737.24 s [vector] elem: OK
  7394. 737.24 s [vector] +++ OK, passed 100 tests.
  7395. 737.24 s [vector] notElem: OK
  7396. 737.24 s [vector] +++ OK, passed 100 tests.
  7397. 737.24 s [vector] find: OK
  7398. 737.24 s [vector] +++ OK, passed 100 tests.
  7399. 737.24 s [vector] findIndex: OK
  7400. 737.24 s [vector] +++ OK, passed 100 tests.
  7401. 737.24 s [vector] findIndexR: OK
  7402. 737.25 s [vector] +++ OK, passed 100 tests.
  7403. 737.25 s [vector] findIndices: OK
  7404. 737.25 s [vector] +++ OK, passed 100 tests.
  7405. 737.25 s [vector] elemIndex: OK
  7406. 737.25 s [vector] +++ OK, passed 100 tests.
  7407. 737.25 s [vector] elemIndices: OK
  7408. 737.25 s [vector] +++ OK, passed 100 tests.
  7409. 737.25 s [vector] foldl: OK
  7410. 737.25 s [vector] +++ OK, passed 100 tests.
  7411. 737.25 s [vector] foldl1: OK
  7412. 737.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7413. 737.26 s [vector] foldl': OK
  7414. 737.26 s [vector] +++ OK, passed 100 tests.
  7415. 737.26 s [vector] foldl1': OK
  7416. 737.26 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7417. 737.26 s [vector] foldr: OK
  7418. 737.26 s [vector] +++ OK, passed 100 tests.
  7419. 737.26 s [vector] foldr1: OK
  7420. 737.26 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7421. 737.26 s [vector] foldr': OK
  7422. 737.27 s [vector] +++ OK, passed 100 tests.
  7423. 737.27 s [vector] foldr1': OK
  7424. 737.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7425. 737.27 s [vector] ifoldl: OK
  7426. 737.27 s [vector] +++ OK, passed 100 tests.
  7427. 737.27 s [vector] ifoldl': OK
  7428. 737.27 s [vector] +++ OK, passed 100 tests.
  7429. 737.28 s [vector] ifoldr: OK
  7430. 737.28 s [vector] +++ OK, passed 100 tests.
  7431. 737.28 s [vector] ifoldr': OK
  7432. 737.28 s [vector] +++ OK, passed 100 tests.
  7433. 737.29 s [vector] ifoldM: OK
  7434. 737.29 s [vector] +++ OK, passed 100 tests.
  7435. 737.29 s [vector] ifoldM': OK
  7436. 737.29 s [vector] +++ OK, passed 100 tests.
  7437. 737.31 s [vector] ifoldM_: OK (0.02s)
  7438. 737.31 s [vector] +++ OK, passed 100 tests.
  7439. 737.32 s [vector] ifoldM'_: OK (0.01s)
  7440. 737.32 s [vector] +++ OK, passed 100 tests.
  7441. 737.32 s [vector] all: OK
  7442. 737.32 s [vector] +++ OK, passed 100 tests.
  7443. 737.32 s [vector] any: OK
  7444. 737.32 s [vector] +++ OK, passed 100 tests.
  7445. 737.33 s [vector] prescanl: OK
  7446. 737.33 s [vector] +++ OK, passed 100 tests.
  7447. 737.33 s [vector] prescanl': OK
  7448. 737.33 s [vector] +++ OK, passed 100 tests.
  7449. 737.33 s [vector] postscanl: OK
  7450. 737.33 s [vector] +++ OK, passed 100 tests.
  7451. 737.34 s [vector] postscanl': OK
  7452. 737.34 s [vector] +++ OK, passed 100 tests.
  7453. 737.34 s [vector] scanl: OK
  7454. 737.34 s [vector] +++ OK, passed 100 tests.
  7455. 737.34 s [vector] scanl': OK
  7456. 737.34 s [vector] +++ OK, passed 100 tests.
  7457. 737.34 s [vector] scanl1: OK
  7458. 737.34 s [vector] +++ OK, passed 100 tests.
  7459. 737.35 s [vector] scanl1': OK
  7460. 737.35 s [vector] +++ OK, passed 100 tests.
  7461. 737.35 s [vector] iscanl: OK
  7462. 737.35 s [vector] +++ OK, passed 100 tests.
  7463. 737.35 s [vector] iscanl': OK
  7464. 737.35 s [vector] +++ OK, passed 100 tests.
  7465. 737.36 s [vector] prescanr: OK
  7466. 737.36 s [vector] +++ OK, passed 100 tests.
  7467. 737.37 s [vector] prescanr': OK
  7468. 737.37 s [vector] +++ OK, passed 100 tests.
  7469. 737.37 s [vector] postscanr: OK
  7470. 737.37 s [vector] +++ OK, passed 100 tests.
  7471. 737.37 s [vector] postscanr': OK
  7472. 737.37 s [vector] +++ OK, passed 100 tests.
  7473. 737.37 s [vector] scanr: OK
  7474. 737.37 s [vector] +++ OK, passed 100 tests.
  7475. 737.37 s [vector] scanr': OK
  7476. 737.38 s [vector] +++ OK, passed 100 tests.
  7477. 737.38 s [vector] scanr1: OK
  7478. 737.38 s [vector] +++ OK, passed 100 tests.
  7479. 737.38 s [vector] scanr1': OK
  7480. 737.38 s [vector] +++ OK, passed 100 tests.
  7481. 737.38 s [vector] iscanr: OK
  7482. 737.38 s [vector] +++ OK, passed 100 tests.
  7483. 737.38 s [vector] iscanr': OK
  7484. 737.38 s [vector] +++ OK, passed 100 tests.
  7485. 737.38 s [vector] mut_read: OK
  7486. 737.38 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7487. 737.38 s [vector] mut_write: OK
  7488. 737.38 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7489. 737.39 s [vector] mut_modify: OK
  7490. 737.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7491. 737.39 s [vector] mut_generate: OK
  7492. 737.39 s [vector] +++ OK, passed 100 tests.
  7493. 737.41 s [vector] mut_generateM: OK (0.01s)
  7494. 737.41 s [vector] +++ OK, passed 100 tests.
  7495. 737.42 s [vector] mut_mapM_: OK (0.02s)
  7496. 737.42 s [vector] +++ OK, passed 100 tests.
  7497. 737.45 s [vector] mut_imapM_: OK
  7498. 737.45 s [vector] +++ OK, passed 100 tests.
  7499. 737.47 s [vector] mut_forM_: OK (0.02s)
  7500. 737.47 s [vector] +++ OK, passed 100 tests.
  7501. 737.48 s [vector] mut_iforM_: OK (0.02s)
  7502. 737.48 s [vector] +++ OK, passed 100 tests.
  7503. 737.48 s [vector] mut_foldr: OK
  7504. 737.48 s [vector] +++ OK, passed 100 tests.
  7505. 737.48 s [vector] mut_foldr': OK
  7506. 737.48 s [vector] +++ OK, passed 100 tests.
  7507. 737.48 s [vector] mut_foldl: OK
  7508. 737.48 s [vector] +++ OK, passed 100 tests.
  7509. 737.49 s [vector] mut_foldl': OK
  7510. 737.49 s [vector] +++ OK, passed 100 tests.
  7511. 737.49 s [vector] mut_ifoldr: OK
  7512. 737.49 s [vector] +++ OK, passed 100 tests.
  7513. 737.49 s [vector] mut_ifoldr': OK
  7514. 737.49 s [vector] +++ OK, passed 100 tests.
  7515. 737.50 s [vector] mut_ifoldl: OK
  7516. 737.50 s [vector] +++ OK, passed 100 tests.
  7517. 737.51 s [vector] mut_ifoldl': OK
  7518. 737.51 s [vector] +++ OK, passed 100 tests.
  7519. 737.51 s [vector] mut_foldM: OK
  7520. 737.52 s [vector] +++ OK, passed 100 tests.
  7521. 737.52 s [vector] mut_foldM': OK
  7522. 737.52 s [vector] +++ OK, passed 100 tests.
  7523. 737.52 s [vector] mut_foldrM: OK
  7524. 737.52 s [vector] +++ OK, passed 100 tests.
  7525. 737.52 s [vector] mut_foldrM': OK
  7526. 737.52 s [vector] +++ OK, passed 100 tests.
  7527. 737.52 s [vector] mut_ifoldM: OK
  7528. 737.52 s [vector] +++ OK, passed 100 tests.
  7529. 737.53 s [vector] mut_ifoldM': OK
  7530. 737.53 s [vector] +++ OK, passed 100 tests.
  7531. 737.53 s [vector] mut_ifoldrM: OK
  7532. 737.53 s [vector] +++ OK, passed 100 tests.
  7533. 737.54 s [vector] mut_ifoldrM': OK
  7534. 737.54 s [vector] +++ OK, passed 100 tests.
  7535. 737.54 s [vector] compare: OK
  7536. 737.54 s [vector] +++ OK, passed 100 tests.
  7537. 737.54 s [vector] maximum: OK
  7538. 737.54 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7539. 737.54 s [vector] minimum: OK
  7540. 737.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7541. 737.54 s [vector] minIndex: OK
  7542. 737.54 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7543. 737.54 s [vector] maxIndex: OK
  7544. 737.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7545. 737.54 s [vector] maximumBy: OK
  7546. 737.54 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7547. 737.54 s [vector] minimumBy: OK
  7548. 737.54 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7549. 737.54 s [vector] maximumOn: OK
  7550. 737.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7551. 737.54 s [vector] minimumOn: OK
  7552. 737.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7553. 737.55 s [vector] maxIndexBy: OK
  7554. 737.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7555. 737.55 s [vector] minIndexBy: OK
  7556. 737.55 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7557. 737.55 s [vector] ListFirstMaxIndexWins: OK
  7558. 737.55 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7559. 737.55 s [vector] FalseListFirstMaxIndexWins: OK
  7560. 737.55 s [vector] +++ OK, failed as expected. (after 1 test):
  7561. 737.55 s [vector] Exception:
  7562. 737.55 s [vector] Prelude.foldr1: empty list
  7563. 737.55 s [vector] CallStack (from HasCallStack):
  7564. 737.55 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  7565. 737.55 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  7566. 737.55 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7567. 737.55 s [vector] []
  7568. 737.55 s [vector] mempty: OK
  7569. 737.55 s [vector] +++ OK, passed 100 tests.
  7570. 737.55 s [vector] mappend: OK
  7571. 737.55 s [vector] +++ OK, passed 100 tests.
  7572. 737.57 s [vector] mconcat: OK (0.02s)
  7573. 737.57 s [vector] +++ OK, passed 100 tests.
  7574. 737.57 s [vector] glength: OK
  7575. 737.57 s [vector] +++ OK, passed 100 tests.
  7576. 737.57 s [vector] sum: OK
  7577. 737.57 s [vector] +++ OK, passed 100 tests.
  7578. 737.58 s [vector] product: OK
  7579. 737.58 s [vector] +++ OK, passed 100 tests.
  7580. 737.58 s [vector] enumFromN: OK
  7581. 737.58 s [vector] +++ OK, passed 100 tests.
  7582. 737.58 s [vector] enumFromThenN: OK
  7583. 737.58 s [vector] +++ OK, passed 100 tests.
  7584. 737.58 s [vector] enumFromTo: OK
  7585. 737.58 s [vector] +++ OK, passed 100 tests.
  7586. 737.58 s [vector] enumFromThenTo: OK
  7587. 737.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7588. 737.58 s [vector] Data.Vector.Storable.Vector (Double)
  7589. 737.58 s [vector] fromList.toList == id: OK
  7590. 737.58 s [vector] +++ OK, passed 100 tests.
  7591. 737.58 s [vector] toList.fromList == id: OK
  7592. 737.58 s [vector] +++ OK, passed 100 tests.
  7593. 737.58 s [vector] unstream.stream == id: OK
  7594. 737.58 s [vector] +++ OK, passed 100 tests.
  7595. 737.58 s [vector] stream.unstream == id: OK
  7596. 737.58 s [vector] +++ OK, passed 100 tests.
  7597. 737.59 s [vector] eq: OK
  7598. 737.59 s [vector] +++ OK, passed 100 tests.
  7599. 737.59 s [vector] length: OK
  7600. 737.59 s [vector] +++ OK, passed 100 tests.
  7601. 737.59 s [vector] null: OK
  7602. 737.59 s [vector] +++ OK, passed 100 tests.
  7603. 737.59 s [vector] index: OK
  7604. 737.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7605. 737.59 s [vector] safeIndex: OK
  7606. 737.59 s [vector] +++ OK, passed 100 tests.
  7607. 737.59 s [vector] head: OK
  7608. 737.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7609. 737.59 s [vector] last: OK
  7610. 737.59 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7611. 737.59 s [vector] unsafeIndex: OK
  7612. 737.59 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7613. 737.59 s [vector] unsafeHead: OK
  7614. 737.59 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7615. 737.59 s [vector] unsafeLast: OK
  7616. 737.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7617. 737.59 s [vector] slice: OK
  7618. 737.59 s [vector] +++ OK, passed 100 tests.
  7619. 737.59 s [vector] init: OK
  7620. 737.59 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7621. 737.60 s [vector] tail: OK
  7622. 737.60 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7623. 737.60 s [vector] take: OK
  7624. 737.60 s [vector] +++ OK, passed 100 tests.
  7625. 737.60 s [vector] drop: OK
  7626. 737.60 s [vector] +++ OK, passed 100 tests.
  7627. 737.60 s [vector] splitAt: OK
  7628. 737.60 s [vector] +++ OK, passed 100 tests.
  7629. 737.60 s [vector] empty: OK
  7630. 737.60 s [vector] +++ OK, passed 100 tests.
  7631. 737.60 s [vector] singleton: OK
  7632. 737.60 s [vector] +++ OK, passed 100 tests.
  7633. 737.60 s [vector] replicate: OK
  7634. 737.60 s [vector] +++ OK, passed 100 tests.
  7635. 737.60 s [vector] generate: OK
  7636. 737.60 s [vector] +++ OK, passed 100 tests.
  7637. 737.60 s [vector] iterateN: OK
  7638. 737.61 s [vector] +++ OK, passed 100 tests.
  7639. 737.67 s [vector] iterateNM: OK (0.06s)
  7640. 737.67 s [vector] +++ OK, passed 100 tests.
  7641. 737.69 s [vector] generateM: OK (0.02s)
  7642. 737.69 s [vector] +++ OK, passed 100 tests.
  7643. 737.69 s [vector] replicateM: OK
  7644. 737.69 s [vector] +++ OK, passed 100 tests.
  7645. 737.69 s [vector] create: OK
  7646. 737.69 s [vector] +++ OK, passed 100 tests.
  7647. 737.69 s [vector] createT: OK
  7648. 737.69 s [vector] +++ OK, passed 100 tests.
  7649. 737.70 s [vector] unfoldr: OK
  7650. 737.70 s [vector] +++ OK, passed 100 tests.
  7651. 737.71 s [vector] unfoldrN: OK
  7652. 737.71 s [vector] +++ OK, passed 100 tests.
  7653. 737.71 s [vector] unfoldrExactN: OK
  7654. 737.71 s [vector] +++ OK, passed 100 tests.
  7655. 737.71 s [vector] unfoldrM: OK
  7656. 737.71 s [vector] +++ OK, passed 100 tests.
  7657. 737.71 s [vector] unfoldrNM: OK
  7658. 737.71 s [vector] +++ OK, passed 100 tests.
  7659. 737.75 s [vector] unfoldrExactNM: OK (0.03s)
  7660. 737.75 s [vector] +++ OK, passed 100 tests.
  7661. 737.75 s [vector] constructN: OK (0.01s)
  7662. 737.75 s [vector] +++ OK, passed 100 tests.
  7663. 737.77 s [vector] constructrN: OK
  7664. 737.77 s [vector] +++ OK, passed 100 tests.
  7665. 737.77 s [vector] cons: OK
  7666. 737.77 s [vector] +++ OK, passed 100 tests.
  7667. 737.77 s [vector] snoc: OK
  7668. 737.77 s [vector] +++ OK, passed 100 tests.
  7669. 737.77 s [vector] append: OK
  7670. 737.77 s [vector] +++ OK, passed 100 tests.
  7671. 737.79 s [vector] concat: OK (0.02s)
  7672. 737.79 s [vector] +++ OK, passed 100 tests.
  7673. 737.79 s [vector] force: OK
  7674. 737.79 s [vector] +++ OK, passed 100 tests.
  7675. 737.80 s [vector] upd: OK
  7676. 737.80 s [vector] +++ OK, passed 100 tests.
  7677. 737.81 s [vector] accum: OK
  7678. 737.82 s [vector] +++ OK, passed 100 tests.
  7679. 737.82 s [vector] reverse: OK
  7680. 737.82 s [vector] +++ OK, passed 100 tests.
  7681. 737.82 s [vector] backpermute: OK
  7682. 737.83 s [vector] +++ OK, passed 100 tests.
  7683. 737.85 s [vector] map: OK (0.01s)
  7684. 737.85 s [vector] +++ OK, passed 100 tests.
  7685. 737.85 s [vector] imap: OK
  7686. 737.85 s [vector] +++ OK, passed 100 tests.
  7687. 737.85 s [vector] concatMap: OK
  7688. 737.85 s [vector] +++ OK, passed 100 tests.
  7689. 737.87 s [vector] mapM: OK
  7690. 737.87 s [vector] +++ OK, passed 100 tests.
  7691. 737.91 s [vector] mapM_: OK (0.04s)
  7692. 737.91 s [vector] +++ OK, passed 100 tests.
  7693. 737.91 s [vector] forM: OK (0.01s)
  7694. 737.91 s [vector] +++ OK, passed 100 tests.
  7695. 737.95 s [vector] forM_: OK (0.04s)
  7696. 737.95 s [vector] +++ OK, passed 100 tests.
  7697. 737.96 s [vector] imapM: OK (0.01s)
  7698. 737.96 s [vector] +++ OK, passed 100 tests.
  7699. 738.00 s [vector] imapM_: OK (0.03s)
  7700. 738.00 s [vector] +++ OK, passed 100 tests.
  7701. 738.03 s [vector] zipWith: OK
  7702. 738.03 s [vector] +++ OK, passed 100 tests.
  7703. 738.05 s [vector] zipWith3: OK (0.02s)
  7704. 738.05 s [vector] +++ OK, passed 100 tests.
  7705. 738.05 s [vector] izipWith: OK (0.01s)
  7706. 738.05 s [vector] +++ OK, passed 100 tests.
  7707. 738.07 s [vector] izipWith3: OK (0.02s)
  7708. 738.07 s [vector] +++ OK, passed 100 tests.
  7709. 738.09 s [vector] izipWithM: OK (0.01s)
  7710. 738.09 s [vector] +++ OK, passed 100 tests.
  7711. 738.44 s [vector] izipWithM_: OK (0.04s)
  7712. 738.44 s [vector] +++ OK, passed 100 tests.
  7713. 738.44 s [vector] zipWithM: OK (0.01s)
  7714. 738.44 s [vector] +++ OK, passed 100 tests.
  7715. 738.44 s [vector] zipWithM_: OK (0.03s)
  7716. 738.44 s [vector] +++ OK, passed 100 tests.
  7717. 738.44 s [vector] filter: OK
  7718. 738.44 s [vector] +++ OK, passed 100 tests.
  7719. 738.44 s [vector] ifilter: OK (0.01s)
  7720. 738.44 s [vector] +++ OK, passed 100 tests.
  7721. 738.44 s [vector] filterM: OK (0.04s)
  7722. 738.44 s [vector] +++ OK, passed 100 tests.
  7723. 738.44 s [vector] uniq: OK
  7724. 738.44 s [vector] +++ OK, passed 100 tests.
  7725. 738.44 s [vector] mapMaybe: OK
  7726. 738.44 s [vector] +++ OK, passed 100 tests.
  7727. 738.44 s [vector] imapMaybe: OK
  7728. 738.44 s [vector] +++ OK, passed 100 tests.
  7729. 738.44 s [vector] takeWhile: OK
  7730. 738.44 s [vector] +++ OK, passed 100 tests.
  7731. 738.44 s [vector] dropWhile: OK
  7732. 738.44 s [vector] +++ OK, passed 100 tests.
  7733. 738.44 s [vector] partition: OK
  7734. 738.44 s [vector] +++ OK, passed 100 tests.
  7735. 738.44 s [vector] partitionWith: OK
  7736. 738.44 s [vector] +++ OK, passed 100 tests.
  7737. 738.44 s [vector] span: OK
  7738. 738.44 s [vector] +++ OK, passed 100 tests.
  7739. 738.44 s [vector] break: OK
  7740. 738.44 s [vector] +++ OK, passed 100 tests.
  7741. 738.44 s [vector] spanR: OK
  7742. 738.44 s [vector] +++ OK, passed 100 tests.
  7743. 738.44 s [vector] breakR: OK
  7744. 738.44 s [vector] +++ OK, passed 100 tests.
  7745. 738.44 s [vector] groupBy: OK
  7746. 738.44 s [vector] +++ OK, passed 100 tests.
  7747. 738.44 s [vector] elem: OK
  7748. 738.44 s [vector] +++ OK, passed 100 tests.
  7749. 738.44 s [vector] notElem: OK
  7750. 738.44 s [vector] +++ OK, passed 100 tests.
  7751. 738.44 s [vector] find: OK
  7752. 738.44 s [vector] +++ OK, passed 100 tests.
  7753. 738.44 s [vector] findIndex: OK
  7754. 738.44 s [vector] +++ OK, passed 100 tests.
  7755. 738.44 s [vector] findIndexR: OK
  7756. 738.44 s [vector] +++ OK, passed 100 tests.
  7757. 738.44 s [vector] findIndices: OK
  7758. 738.44 s [vector] +++ OK, passed 100 tests.
  7759. 738.44 s [vector] elemIndex: OK
  7760. 738.44 s [vector] +++ OK, passed 100 tests.
  7761. 738.44 s [vector] elemIndices: OK
  7762. 738.44 s [vector] +++ OK, passed 100 tests.
  7763. 738.44 s [vector] foldl: OK (0.01s)
  7764. 738.44 s [vector] +++ OK, passed 100 tests.
  7765. 738.44 s [vector] foldl1: OK (0.01s)
  7766. 738.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7767. 738.44 s [vector] foldl': OK (0.02s)
  7768. 738.44 s [vector] +++ OK, passed 100 tests.
  7769. 738.44 s [vector] foldl1': OK (0.01s)
  7770. 738.44 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7771. 738.44 s [vector] foldr: OK (0.02s)
  7772. 738.44 s [vector] +++ OK, passed 100 tests.
  7773. 738.44 s [vector] foldr1: OK (0.02s)
  7774. 738.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7775. 738.44 s [vector] foldr': OK (0.02s)
  7776. 738.44 s [vector] +++ OK, passed 100 tests.
  7777. 738.44 s [vector] foldr1': OK (0.01s)
  7778. 738.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7779. 738.44 s [vector] ifoldl: OK (0.01s)
  7780. 738.44 s [vector] +++ OK, passed 100 tests.
  7781. 738.45 s [vector] ifoldl': OK
  7782. 738.45 s [vector] +++ OK, passed 100 tests.
  7783. 738.47 s [vector] ifoldr: OK (0.01s)
  7784. 738.47 s [vector] +++ OK, passed 100 tests.
  7785. 738.48 s [vector] ifoldr': OK
  7786. 738.48 s [vector] +++ OK, passed 100 tests.
  7787. 738.51 s [vector] ifoldM: OK
  7788. 738.51 s [vector] +++ OK, passed 100 tests.
  7789. 738.51 s [vector] ifoldM': OK (0.02s)
  7790. 738.51 s [vector] +++ OK, passed 100 tests.
  7791. 738.57 s [vector] ifoldM_: OK (0.02s)
  7792. 738.57 s [vector] +++ OK, passed 100 tests.
  7793. 738.60 s [vector] ifoldM'_: OK (0.04s)
  7794. 738.60 s [vector] +++ OK, passed 100 tests.
  7795. 738.60 s [vector] all: OK
  7796. 738.60 s [vector] +++ OK, passed 100 tests.
  7797. 738.60 s [vector] any: OK
  7798. 738.60 s [vector] +++ OK, passed 100 tests.
  7799. 738.63 s [vector] prescanl: OK
  7800. 738.64 s [vector] +++ OK, passed 100 tests.
  7801. 738.64 s [vector] prescanl': OK (0.01s)
  7802. 738.64 s [vector] +++ OK, passed 100 tests.
  7803. 738.65 s [vector] postscanl: OK (0.02s)
  7804. 738.65 s [vector] +++ OK, passed 100 tests.
  7805. 738.68 s [vector] postscanl': OK (0.01s)
  7806. 738.68 s [vector] +++ OK, passed 100 tests.
  7807. 738.69 s [vector] scanl: OK (0.02s)
  7808. 738.69 s [vector] +++ OK, passed 100 tests.
  7809. 738.71 s [vector] scanl': OK (0.03s)
  7810. 738.71 s [vector] +++ OK, passed 100 tests.
  7811. 738.72 s [vector] scanl1: OK (0.02s)
  7812. 738.72 s [vector] +++ OK, passed 100 tests.
  7813. 738.74 s [vector] scanl1': OK
  7814. 738.74 s [vector] +++ OK, passed 100 tests.
  7815. 738.75 s [vector] iscanl: OK
  7816. 738.75 s [vector] +++ OK, passed 100 tests.
  7817. 738.77 s [vector] iscanl': OK (0.01s)
  7818. 738.77 s [vector] +++ OK, passed 100 tests.
  7819. 738.78 s [vector] prescanr: OK (0.01s)
  7820. 738.78 s [vector] +++ OK, passed 100 tests.
  7821. 738.79 s [vector] prescanr': OK
  7822. 738.79 s [vector] +++ OK, passed 100 tests.
  7823. 738.81 s [vector] postscanr: OK (0.01s)
  7824. 738.81 s [vector] +++ OK, passed 100 tests.
  7825. 738.83 s [vector] postscanr': OK (0.01s)
  7826. 738.83 s [vector] +++ OK, passed 100 tests.
  7827. 738.83 s [vector] scanr: OK (0.01s)
  7828. 738.83 s [vector] +++ OK, passed 100 tests.
  7829. 738.85 s [vector] scanr': OK (0.01s)
  7830. 738.85 s [vector] +++ OK, passed 100 tests.
  7831. 738.87 s [vector] scanr1: OK (0.01s)
  7832. 738.87 s [vector] +++ OK, passed 100 tests.
  7833. 738.87 s [vector] scanr1': OK (0.01s)
  7834. 738.87 s [vector] +++ OK, passed 100 tests.
  7835. 738.89 s [vector] iscanr: OK (0.01s)
  7836. 738.89 s [vector] +++ OK, passed 100 tests.
  7837. 738.90 s [vector] iscanr': OK (0.01s)
  7838. 738.90 s [vector] +++ OK, passed 100 tests.
  7839. 738.90 s [vector] mut_read: OK
  7840. 738.90 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7841. 738.90 s [vector] mut_write: OK
  7842. 738.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7843. 738.90 s [vector] mut_modify: OK
  7844. 738.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7845. 738.90 s [vector] mut_generate: OK
  7846. 738.90 s [vector] +++ OK, passed 100 tests.
  7847. 738.92 s [vector] mut_generateM: OK (0.01s)
  7848. 738.92 s [vector] +++ OK, passed 100 tests.
  7849. 738.96 s [vector] mut_mapM_: OK (0.03s)
  7850. 738.96 s [vector] +++ OK, passed 100 tests.
  7851. 739.03 s [vector] mut_imapM_: OK (0.05s)
  7852. 739.03 s [vector] +++ OK, passed 100 tests.
  7853. 739.07 s [vector] mut_forM_: OK (0.05s)
  7854. 739.07 s [vector] +++ OK, passed 100 tests.
  7855. 739.11 s [vector] mut_iforM_: OK (0.04s)
  7856. 739.11 s [vector] +++ OK, passed 100 tests.
  7857. 739.13 s [vector] mut_foldr: OK (0.01s)
  7858. 739.13 s [vector] +++ OK, passed 100 tests.
  7859. 739.15 s [vector] mut_foldr': OK (0.02s)
  7860. 739.15 s [vector] +++ OK, passed 100 tests.
  7861. 739.15 s [vector] mut_foldl: OK (0.02s)
  7862. 739.15 s [vector] +++ OK, passed 100 tests.
  7863. 739.17 s [vector] mut_foldl': OK (0.02s)
  7864. 739.17 s [vector] +++ OK, passed 100 tests.
  7865. 739.19 s [vector] mut_ifoldr: OK (0.01s)
  7866. 739.19 s [vector] +++ OK, passed 100 tests.
  7867. 739.21 s [vector] mut_ifoldr': OK (0.01s)
  7868. 739.21 s [vector] +++ OK, passed 100 tests.
  7869. 739.22 s [vector] mut_ifoldl: OK (0.02s)
  7870. 739.22 s [vector] +++ OK, passed 100 tests.
  7871. 739.23 s [vector] mut_ifoldl': OK (0.02s)
  7872. 739.23 s [vector] +++ OK, passed 100 tests.
  7873. 739.25 s [vector] mut_foldM: OK (0.02s)
  7874. 739.25 s [vector] +++ OK, passed 100 tests.
  7875. 739.28 s [vector] mut_foldM': OK (0.02s)
  7876. 739.28 s [vector] +++ OK, passed 100 tests.
  7877. 739.29 s [vector] mut_foldrM: OK (0.02s)
  7878. 739.29 s [vector] +++ OK, passed 100 tests.
  7879. 739.31 s [vector] mut_foldrM': OK (0.02s)
  7880. 739.31 s [vector] +++ OK, passed 100 tests.
  7881. 739.35 s [vector] mut_ifoldM: OK (0.02s)
  7882. 739.35 s [vector] +++ OK, passed 100 tests.
  7883. 739.35 s [vector] mut_ifoldM': OK (0.02s)
  7884. 739.35 s [vector] +++ OK, passed 100 tests.
  7885. 739.37 s [vector] mut_ifoldrM: OK
  7886. 739.37 s [vector] +++ OK, passed 100 tests.
  7887. 739.38 s [vector] mut_ifoldrM': OK (0.02s)
  7888. 739.38 s [vector] +++ OK, passed 100 tests.
  7889. 739.39 s [vector] compare: OK
  7890. 739.39 s [vector] +++ OK, passed 100 tests.
  7891. 739.39 s [vector] maximum: OK
  7892. 739.39 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7893. 739.39 s [vector] minimum: OK
  7894. 739.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7895. 739.39 s [vector] minIndex: OK
  7896. 739.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7897. 739.39 s [vector] maxIndex: OK
  7898. 739.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7899. 739.39 s [vector] maximumBy: OK
  7900. 739.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7901. 739.39 s [vector] minimumBy: OK
  7902. 739.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7903. 739.39 s [vector] maximumOn: OK
  7904. 739.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7905. 739.40 s [vector] minimumOn: OK
  7906. 739.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7907. 739.40 s [vector] maxIndexBy: OK
  7908. 739.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7909. 739.40 s [vector] minIndexBy: OK
  7910. 739.40 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7911. 739.40 s [vector] ListFirstMaxIndexWins: OK
  7912. 739.40 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7913. 739.40 s [vector] FalseListFirstMaxIndexWins: OK
  7914. 739.40 s [vector] +++ OK, failed as expected. (after 1 test):
  7915. 739.40 s [vector] Exception:
  7916. 739.40 s [vector] Prelude.foldr1: empty list
  7917. 739.40 s [vector] CallStack (from HasCallStack):
  7918. 739.40 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  7919. 739.40 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  7920. 739.40 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7921. 739.40 s [vector] []
  7922. 739.40 s [vector] mempty: OK
  7923. 739.40 s [vector] +++ OK, passed 100 tests.
  7924. 739.40 s [vector] mappend: OK
  7925. 739.40 s [vector] +++ OK, passed 100 tests.
  7926. 739.43 s [vector] mconcat: OK (0.01s)
  7927. 739.43 s [vector] +++ OK, passed 100 tests.
  7928. 739.43 s [vector] glength: OK
  7929. 739.43 s [vector] +++ OK, passed 100 tests.
  7930. 739.43 s [vector] sum: OK
  7931. 739.43 s [vector] +++ OK, passed 100 tests.
  7932. 739.43 s [vector] product: OK
  7933. 739.43 s [vector] +++ OK, passed 100 tests.
  7934. 739.43 s [vector] enumFromN: OK
  7935. 739.43 s [vector] +++ OK, passed 100 tests.
  7936. 739.43 s [vector] enumFromThenN: OK
  7937. 739.43 s [vector] +++ OK, passed 100 tests.
  7938. 739.43 s [vector] enumFromTo: OK
  7939. 739.43 s [vector] +++ OK, passed 100 tests.
  7940. 739.43 s [vector] enumFromThenTo: OK
  7941. 739.43 s [vector] +++ OK, passed 100 tests; 3 discarded.
  7942. 739.43 s [vector] unstream
  7943. 739.43 s [vector] unstream == vunstream (exact): OK
  7944. 739.43 s [vector] +++ OK, passed 100 tests.
  7945. 739.44 s [vector] unstream == vunstream (unknown): OK
  7946. 739.44 s [vector] +++ OK, passed 100 tests.
  7947. 739.44 s [vector] unstreamR ~= vunstream (exact): OK
  7948. 739.44 s [vector] +++ OK, passed 100 tests.
  7949. 739.44 s [vector] unstreamR ~= vunstream (unknown): OK
  7950. 739.44 s [vector] +++ OK, passed 100 tests.
  7951. 739.44 s [vector] Tests.Vector.Strict
  7952. 739.44 s [vector] Bool
  7953. 739.44 s [vector] fromList.toList == id: OK
  7954. 739.44 s [vector] +++ OK, passed 100 tests.
  7955. 739.44 s [vector] toList.fromList == id: OK
  7956. 739.44 s [vector] +++ OK, passed 100 tests.
  7957. 739.44 s [vector] unstream.stream == id: OK
  7958. 739.44 s [vector] +++ OK, passed 100 tests.
  7959. 739.44 s [vector] stream.unstream == id: OK
  7960. 739.44 s [vector] +++ OK, passed 100 tests.
  7961. 739.44 s [vector] eq: OK
  7962. 739.44 s [vector] +++ OK, passed 100 tests.
  7963. 739.44 s [vector] length: OK
  7964. 739.44 s [vector] +++ OK, passed 100 tests.
  7965. 739.44 s [vector] null: OK
  7966. 739.44 s [vector] +++ OK, passed 100 tests.
  7967. 739.44 s [vector] index: OK
  7968. 739.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7969. 739.44 s [vector] safeIndex: OK
  7970. 739.44 s [vector] +++ OK, passed 100 tests.
  7971. 739.45 s [vector] head: OK
  7972. 739.45 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7973. 739.45 s [vector] last: OK
  7974. 739.45 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7975. 739.45 s [vector] unsafeIndex: OK
  7976. 739.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7977. 739.45 s [vector] unsafeHead: OK
  7978. 739.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7979. 739.45 s [vector] unsafeLast: OK
  7980. 739.45 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7981. 739.45 s [vector] slice: OK
  7982. 739.45 s [vector] +++ OK, passed 100 tests.
  7983. 739.45 s [vector] init: OK
  7984. 739.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7985. 739.45 s [vector] tail: OK
  7986. 739.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7987. 739.45 s [vector] take: OK
  7988. 739.45 s [vector] +++ OK, passed 100 tests.
  7989. 739.45 s [vector] drop: OK
  7990. 739.45 s [vector] +++ OK, passed 100 tests.
  7991. 739.45 s [vector] splitAt: OK
  7992. 739.45 s [vector] +++ OK, passed 100 tests.
  7993. 739.45 s [vector] empty: OK
  7994. 739.45 s [vector] +++ OK, passed 100 tests.
  7995. 739.45 s [vector] singleton: OK
  7996. 739.45 s [vector] +++ OK, passed 100 tests.
  7997. 739.45 s [vector] replicate: OK
  7998. 739.45 s [vector] +++ OK, passed 100 tests.
  7999. 739.45 s [vector] generate: OK
  8000. 739.45 s [vector] +++ OK, passed 100 tests.
  8001. 739.48 s [vector] iterateN: OK
  8002. 739.48 s [vector] +++ OK, passed 100 tests.
  8003. 739.49 s [vector] iterateNM: OK (0.03s)
  8004. 739.49 s [vector] +++ OK, passed 100 tests.
  8005. 739.51 s [vector] generateM: OK (0.01s)
  8006. 739.51 s [vector] +++ OK, passed 100 tests.
  8007. 739.51 s [vector] replicateM: OK (0.01s)
  8008. 739.51 s [vector] +++ OK, passed 100 tests.
  8009. 739.52 s [vector] create: OK
  8010. 739.52 s [vector] +++ OK, passed 100 tests.
  8011. 739.53 s [vector] createT: OK
  8012. 739.53 s [vector] +++ OK, passed 100 tests.
  8013. 739.53 s [vector] unfoldr: OK
  8014. 739.53 s [vector] +++ OK, passed 100 tests.
  8015. 739.53 s [vector] unfoldrN: OK
  8016. 739.53 s [vector] +++ OK, passed 100 tests.
  8017. 739.53 s [vector] unfoldrExactN: OK
  8018. 739.53 s [vector] +++ OK, passed 100 tests.
  8019. 739.53 s [vector] unfoldrM: OK
  8020. 739.53 s [vector] +++ OK, passed 100 tests.
  8021. 739.55 s [vector] unfoldrNM: OK
  8022. 739.55 s [vector] +++ OK, passed 100 tests.
  8023. 739.60 s [vector] unfoldrExactNM: OK (0.06s)
  8024. 739.60 s [vector] +++ OK, passed 100 tests.
  8025. 739.60 s [vector] constructN: OK
  8026. 739.60 s [vector] +++ OK, passed 100 tests.
  8027. 739.60 s [vector] constructrN: OK
  8028. 739.60 s [vector] +++ OK, passed 100 tests.
  8029. 739.60 s [vector] cons: OK
  8030. 739.60 s [vector] +++ OK, passed 100 tests.
  8031. 739.60 s [vector] snoc: OK
  8032. 739.60 s [vector] +++ OK, passed 100 tests.
  8033. 739.61 s [vector] append: OK
  8034. 739.61 s [vector] +++ OK, passed 100 tests.
  8035. 739.61 s [vector] concat: OK
  8036. 739.61 s [vector] +++ OK, passed 100 tests.
  8037. 739.61 s [vector] force: OK
  8038. 739.61 s [vector] +++ OK, passed 100 tests.
  8039. 739.62 s [vector] upd: OK
  8040. 739.62 s [vector] +++ OK, passed 100 tests.
  8041. 739.63 s [vector] accum: OK
  8042. 739.63 s [vector] +++ OK, passed 100 tests.
  8043. 739.63 s [vector] reverse: OK
  8044. 739.63 s [vector] +++ OK, passed 100 tests.
  8045. 739.64 s [vector] backpermute: OK
  8046. 739.64 s [vector] +++ OK, passed 100 tests.
  8047. 739.64 s [vector] map: OK
  8048. 739.64 s [vector] +++ OK, passed 100 tests.
  8049. 739.64 s [vector] imap: OK
  8050. 739.64 s [vector] +++ OK, passed 100 tests.
  8051. 739.65 s [vector] concatMap: OK
  8052. 739.65 s [vector] +++ OK, passed 100 tests.
  8053. 739.65 s [vector] mapM: OK
  8054. 739.65 s [vector] +++ OK, passed 100 tests.
  8055. 739.66 s [vector] mapM_: OK (0.01s)
  8056. 739.66 s [vector] +++ OK, passed 100 tests.
  8057. 739.67 s [vector] forM: OK
  8058. 739.67 s [vector] +++ OK, passed 100 tests.
  8059. 739.68 s [vector] forM_: OK (0.01s)
  8060. 739.68 s [vector] +++ OK, passed 100 tests.
  8061. 739.69 s [vector] imapM: OK
  8062. 739.69 s [vector] +++ OK, passed 100 tests.
  8063. 739.70 s [vector] imapM_: OK (0.02s)
  8064. 739.70 s [vector] +++ OK, passed 100 tests.
  8065. 739.70 s [vector] zipWith: OK
  8066. 739.70 s [vector] +++ OK, passed 100 tests.
  8067. 739.70 s [vector] zipWith3: OK
  8068. 739.70 s [vector] +++ OK, passed 100 tests.
  8069. 739.71 s [vector] izipWith: OK
  8070. 739.71 s [vector] +++ OK, passed 100 tests.
  8071. 739.71 s [vector] izipWith3: OK
  8072. 739.71 s [vector] +++ OK, passed 100 tests.
  8073. 739.71 s [vector] izipWithM: OK
  8074. 739.71 s [vector] +++ OK, passed 100 tests.
  8075. 739.72 s [vector] izipWithM_: OK (0.01s)
  8076. 739.72 s [vector] +++ OK, passed 100 tests.
  8077. 739.73 s [vector] zipWithM: OK
  8078. 739.73 s [vector] +++ OK, passed 100 tests.
  8079. 739.73 s [vector] zipWithM_: OK
  8080. 739.73 s [vector] +++ OK, passed 100 tests.
  8081. 739.75 s [vector] filter: OK
  8082. 739.76 s [vector] +++ OK, passed 100 tests.
  8083. 739.76 s [vector] ifilter: OK
  8084. 739.76 s [vector] +++ OK, passed 100 tests.
  8085. 739.77 s [vector] filterM: OK (0.03s)
  8086. 739.77 s [vector] +++ OK, passed 100 tests.
  8087. 739.77 s [vector] uniq: OK
  8088. 739.77 s [vector] +++ OK, passed 100 tests.
  8089. 739.77 s [vector] mapMaybe: OK
  8090. 739.77 s [vector] +++ OK, passed 100 tests.
  8091. 739.77 s [vector] imapMaybe: OK
  8092. 739.77 s [vector] +++ OK, passed 100 tests.
  8093. 739.77 s [vector] takeWhile: OK
  8094. 739.77 s [vector] +++ OK, passed 100 tests.
  8095. 739.77 s [vector] dropWhile: OK
  8096. 739.78 s [vector] +++ OK, passed 100 tests.
  8097. 739.78 s [vector] partition: OK
  8098. 739.78 s [vector] +++ OK, passed 100 tests.
  8099. 739.78 s [vector] partitionWith: OK
  8100. 739.78 s [vector] +++ OK, passed 100 tests.
  8101. 739.78 s [vector] span: OK
  8102. 739.78 s [vector] +++ OK, passed 100 tests.
  8103. 739.78 s [vector] break: OK
  8104. 739.78 s [vector] +++ OK, passed 100 tests.
  8105. 739.78 s [vector] spanR: OK
  8106. 739.78 s [vector] +++ OK, passed 100 tests.
  8107. 739.78 s [vector] breakR: OK
  8108. 739.78 s [vector] +++ OK, passed 100 tests.
  8109. 739.78 s [vector] groupBy: OK
  8110. 739.78 s [vector] +++ OK, passed 100 tests.
  8111. 739.79 s [vector] elem: OK
  8112. 739.79 s [vector] +++ OK, passed 100 tests.
  8113. 739.79 s [vector] notElem: OK
  8114. 739.79 s [vector] +++ OK, passed 100 tests.
  8115. 739.79 s [vector] find: OK
  8116. 739.79 s [vector] +++ OK, passed 100 tests.
  8117. 739.79 s [vector] findIndex: OK
  8118. 739.79 s [vector] +++ OK, passed 100 tests.
  8119. 739.79 s [vector] findIndexR: OK
  8120. 739.79 s [vector] +++ OK, passed 100 tests.
  8121. 739.79 s [vector] findIndices: OK
  8122. 739.79 s [vector] +++ OK, passed 100 tests.
  8123. 739.79 s [vector] elemIndex: OK
  8124. 739.79 s [vector] +++ OK, passed 100 tests.
  8125. 739.80 s [vector] elemIndices: OK
  8126. 739.80 s [vector] +++ OK, passed 100 tests.
  8127. 739.80 s [vector] foldl: OK
  8128. 739.80 s [vector] +++ OK, passed 100 tests.
  8129. 739.80 s [vector] foldl1: OK
  8130. 739.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8131. 739.80 s [vector] foldl': OK
  8132. 739.80 s [vector] +++ OK, passed 100 tests.
  8133. 739.80 s [vector] foldl1': OK
  8134. 739.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8135. 739.80 s [vector] foldr: OK
  8136. 739.81 s [vector] +++ OK, passed 100 tests.
  8137. 739.81 s [vector] foldr1: OK
  8138. 739.81 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8139. 739.81 s [vector] foldr': OK
  8140. 739.81 s [vector] +++ OK, passed 100 tests.
  8141. 739.81 s [vector] foldr1': OK
  8142. 739.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8143. 739.81 s [vector] ifoldl: OK
  8144. 739.81 s [vector] +++ OK, passed 100 tests.
  8145. 739.81 s [vector] ifoldl': OK
  8146. 739.81 s [vector] +++ OK, passed 100 tests.
  8147. 739.82 s [vector] ifoldr: OK
  8148. 739.82 s [vector] +++ OK, passed 100 tests.
  8149. 739.82 s [vector] ifoldr': OK
  8150. 739.82 s [vector] +++ OK, passed 100 tests.
  8151. 739.83 s [vector] ifoldM: OK
  8152. 739.83 s [vector] +++ OK, passed 100 tests.
  8153. 739.83 s [vector] ifoldM': OK
  8154. 739.83 s [vector] +++ OK, passed 100 tests.
  8155. 739.84 s [vector] ifoldM_: OK
  8156. 739.84 s [vector] +++ OK, passed 100 tests.
  8157. 739.85 s [vector] ifoldM'_: OK (0.01s)
  8158. 739.85 s [vector] +++ OK, passed 100 tests.
  8159. 739.85 s [vector] all: OK
  8160. 739.85 s [vector] +++ OK, passed 100 tests.
  8161. 739.86 s [vector] any: OK
  8162. 739.86 s [vector] +++ OK, passed 100 tests.
  8163. 739.86 s [vector] prescanl: OK
  8164. 739.86 s [vector] +++ OK, passed 100 tests.
  8165. 739.86 s [vector] prescanl': OK
  8166. 739.86 s [vector] +++ OK, passed 100 tests.
  8167. 739.86 s [vector] postscanl: OK
  8168. 739.86 s [vector] +++ OK, passed 100 tests.
  8169. 739.86 s [vector] postscanl': OK
  8170. 739.86 s [vector] +++ OK, passed 100 tests.
  8171. 739.87 s [vector] scanl: OK
  8172. 739.87 s [vector] +++ OK, passed 100 tests.
  8173. 739.87 s [vector] scanl': OK
  8174. 739.87 s [vector] +++ OK, passed 100 tests.
  8175. 739.87 s [vector] scanl1: OK
  8176. 739.87 s [vector] +++ OK, passed 100 tests.
  8177. 739.87 s [vector] scanl1': OK
  8178. 739.87 s [vector] +++ OK, passed 100 tests.
  8179. 739.87 s [vector] iscanl: OK
  8180. 739.87 s [vector] +++ OK, passed 100 tests.
  8181. 739.88 s [vector] iscanl': OK
  8182. 739.88 s [vector] +++ OK, passed 100 tests.
  8183. 739.88 s [vector] prescanr: OK
  8184. 739.88 s [vector] +++ OK, passed 100 tests.
  8185. 739.88 s [vector] prescanr': OK
  8186. 739.88 s [vector] +++ OK, passed 100 tests.
  8187. 739.88 s [vector] postscanr: OK
  8188. 739.88 s [vector] +++ OK, passed 100 tests.
  8189. 739.88 s [vector] postscanr': OK
  8190. 739.88 s [vector] +++ OK, passed 100 tests.
  8191. 739.89 s [vector] scanr: OK
  8192. 739.89 s [vector] +++ OK, passed 100 tests.
  8193. 739.89 s [vector] scanr': OK
  8194. 739.89 s [vector] +++ OK, passed 100 tests.
  8195. 739.89 s [vector] scanr1: OK
  8196. 739.89 s [vector] +++ OK, passed 100 tests.
  8197. 739.89 s [vector] scanr1': OK
  8198. 739.89 s [vector] +++ OK, passed 100 tests.
  8199. 739.89 s [vector] iscanr: OK
  8200. 739.89 s [vector] +++ OK, passed 100 tests.
  8201. 739.90 s [vector] iscanr': OK
  8202. 739.90 s [vector] +++ OK, passed 100 tests.
  8203. 739.90 s [vector] mut_read: OK
  8204. 739.90 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8205. 739.90 s [vector] mut_write: OK
  8206. 739.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8207. 739.90 s [vector] mut_modify: OK
  8208. 739.90 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8209. 739.91 s [vector] mut_generate: OK
  8210. 739.91 s [vector] +++ OK, passed 100 tests.
  8211. 739.91 s [vector] mut_generateM: OK
  8212. 739.91 s [vector] +++ OK, passed 100 tests.
  8213. 739.94 s [vector] mut_mapM_: OK (0.01s)
  8214. 739.94 s [vector] +++ OK, passed 100 tests.
  8215. 739.95 s [vector] mut_imapM_: OK (0.02s)
  8216. 739.95 s [vector] +++ OK, passed 100 tests.
  8217. 739.97 s [vector] mut_forM_: OK (0.02s)
  8218. 739.97 s [vector] +++ OK, passed 100 tests.
  8219. 739.97 s [vector] mut_iforM_: OK (0.01s)
  8220. 739.97 s [vector] +++ OK, passed 100 tests.
  8221. 739.97 s [vector] mut_foldr: OK
  8222. 739.97 s [vector] +++ OK, passed 100 tests.
  8223. 739.98 s [vector] mut_foldr': OK
  8224. 739.98 s [vector] +++ OK, passed 100 tests.
  8225. 739.98 s [vector] mut_foldl: OK
  8226. 739.98 s [vector] +++ OK, passed 100 tests.
  8227. 739.98 s [vector] mut_foldl': OK
  8228. 739.98 s [vector] +++ OK, passed 100 tests.
  8229. 739.98 s [vector] mut_ifoldr: OK
  8230. 739.99 s [vector] +++ OK, passed 100 tests.
  8231. 739.99 s [vector] mut_ifoldr': OK
  8232. 739.99 s [vector] +++ OK, passed 100 tests.
  8233. 739.99 s [vector] mut_ifoldl: OK
  8234. 739.99 s [vector] +++ OK, passed 100 tests.
  8235. 739.99 s [vector] mut_ifoldl': OK
  8236. 739.99 s [vector] +++ OK, passed 100 tests.
  8237. 739.99 s [vector] mut_foldM: OK
  8238. 739.99 s [vector] +++ OK, passed 100 tests.
  8239. 739.99 s [vector] mut_foldM': OK
  8240. 739.99 s [vector] +++ OK, passed 100 tests.
  8241. 739.99 s [vector] mut_foldrM: OK
  8242. 739.99 s [vector] +++ OK, passed 100 tests.
  8243. 740.00 s [vector] mut_foldrM': OK
  8244. 740.00 s [vector] +++ OK, passed 100 tests.
  8245. 740.01 s [vector] mut_ifoldM: OK
  8246. 740.01 s [vector] +++ OK, passed 100 tests.
  8247. 740.01 s [vector] mut_ifoldM': OK
  8248. 740.01 s [vector] +++ OK, passed 100 tests.
  8249. 740.01 s [vector] mut_ifoldrM: OK
  8250. 740.01 s [vector] +++ OK, passed 100 tests.
  8251. 740.01 s [vector] mut_ifoldrM': OK
  8252. 740.01 s [vector] +++ OK, passed 100 tests.
  8253. 740.01 s [vector] compare: OK
  8254. 740.01 s [vector] +++ OK, passed 100 tests.
  8255. 740.01 s [vector] maximum: OK
  8256. 740.01 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8257. 740.01 s [vector] minimum: OK
  8258. 740.01 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8259. 740.01 s [vector] minIndex: OK
  8260. 740.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8261. 740.01 s [vector] maxIndex: OK
  8262. 740.01 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8263. 740.01 s [vector] maximumBy: OK
  8264. 740.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8265. 740.01 s [vector] minimumBy: OK
  8266. 740.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8267. 740.01 s [vector] maximumOn: OK
  8268. 740.01 s [vector] +++ OK, passed 100 tests; 10 discarded.
  8269. 740.01 s [vector] minimumOn: OK
  8270. 740.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8271. 740.01 s [vector] maxIndexBy: OK
  8272. 740.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8273. 740.01 s [vector] minIndexBy: OK
  8274. 740.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8275. 740.01 s [vector] ListFirstMaxIndexWins: OK
  8276. 740.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8277. 740.01 s [vector] FalseListFirstMaxIndexWins: OK
  8278. 740.01 s [vector] +++ OK, failed as expected. (after 1 test):
  8279. 740.02 s [vector] Exception:
  8280. 740.02 s [vector] Prelude.foldr1: empty list
  8281. 740.02 s [vector] CallStack (from HasCallStack):
  8282. 740.02 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  8283. 740.02 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  8284. 740.02 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8285. 740.02 s [vector] []
  8286. 740.02 s [vector] zip: OK
  8287. 740.02 s [vector] +++ OK, passed 100 tests.
  8288. 740.02 s [vector] zip3: OK
  8289. 740.02 s [vector] +++ OK, passed 100 tests.
  8290. 740.02 s [vector] unzip: OK
  8291. 740.02 s [vector] +++ OK, passed 100 tests.
  8292. 740.02 s [vector] unzip3: OK
  8293. 740.02 s [vector] +++ OK, passed 100 tests.
  8294. 740.02 s [vector] indexed: OK
  8295. 740.03 s [vector] +++ OK, passed 100 tests.
  8296. 740.03 s [vector] update: OK
  8297. 740.03 s [vector] +++ OK, passed 100 tests.
  8298. 740.03 s [vector] concat: OK
  8299. 740.03 s [vector] +++ OK, passed 100 tests.
  8300. 740.03 s [vector] mempty: OK
  8301. 740.03 s [vector] +++ OK, passed 100 tests.
  8302. 740.03 s [vector] mappend: OK
  8303. 740.03 s [vector] +++ OK, passed 100 tests.
  8304. 740.04 s [vector] mconcat: OK
  8305. 740.04 s [vector] +++ OK, passed 100 tests.
  8306. 740.04 s [vector] fmap: OK
  8307. 740.04 s [vector] +++ OK, passed 100 tests.
  8308. 740.04 s [vector] return: OK
  8309. 740.05 s [vector] +++ OK, passed 100 tests.
  8310. 740.05 s [vector] bind: OK (0.01s)
  8311. 740.05 s [vector] +++ OK, passed 100 tests.
  8312. 740.05 s [vector] mzip: OK
  8313. 740.05 s [vector] +++ OK, passed 100 tests.
  8314. 740.06 s [vector] munzip: OK
  8315. 740.06 s [vector] +++ OK, passed 100 tests.
  8316. 740.06 s [vector] applicative_pure: OK
  8317. 740.06 s [vector] +++ OK, passed 100 tests.
  8318. 740.07 s [vector] applicative_appl: OK
  8319. 740.07 s [vector] +++ OK, passed 100 tests.
  8320. 740.07 s [vector] alternative_empty: OK
  8321. 740.07 s [vector] +++ OK, passed 100 tests.
  8322. 740.07 s [vector] alternative_or: OK
  8323. 740.07 s [vector] +++ OK, passed 100 tests.
  8324. 740.10 s [vector] sequence: OK (0.03s)
  8325. 740.10 s [vector] +++ OK, passed 100 tests.
  8326. 740.12 s [vector] sequence_: OK
  8327. 740.12 s [vector] +++ OK, passed 100 tests.
  8328. 740.12 s [vector] glength: OK
  8329. 740.12 s [vector] +++ OK, passed 100 tests.
  8330. 740.12 s [vector] and: OK
  8331. 740.12 s [vector] +++ OK, passed 100 tests.
  8332. 740.12 s [vector] or: OK
  8333. 740.12 s [vector] +++ OK, passed 100 tests.
  8334. 740.12 s [vector] Int
  8335. 740.12 s [vector] fromList.toList == id: OK
  8336. 740.12 s [vector] +++ OK, passed 100 tests.
  8337. 740.12 s [vector] toList.fromList == id: OK
  8338. 740.12 s [vector] +++ OK, passed 100 tests.
  8339. 740.12 s [vector] unstream.stream == id: OK
  8340. 740.12 s [vector] +++ OK, passed 100 tests.
  8341. 740.12 s [vector] stream.unstream == id: OK
  8342. 740.12 s [vector] +++ OK, passed 100 tests.
  8343. 740.12 s [vector] eq: OK
  8344. 740.12 s [vector] +++ OK, passed 100 tests.
  8345. 740.12 s [vector] length: OK
  8346. 740.12 s [vector] +++ OK, passed 100 tests.
  8347. 740.12 s [vector] null: OK
  8348. 740.12 s [vector] +++ OK, passed 100 tests.
  8349. 740.13 s [vector] index: OK
  8350. 740.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8351. 740.13 s [vector] safeIndex: OK
  8352. 740.13 s [vector] +++ OK, passed 100 tests.
  8353. 740.13 s [vector] head: OK
  8354. 740.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8355. 740.13 s [vector] last: OK
  8356. 740.13 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8357. 740.13 s [vector] unsafeIndex: OK
  8358. 740.13 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8359. 740.13 s [vector] unsafeHead: OK
  8360. 740.13 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8361. 740.13 s [vector] unsafeLast: OK
  8362. 740.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8363. 740.13 s [vector] slice: OK
  8364. 740.13 s [vector] +++ OK, passed 100 tests.
  8365. 740.13 s [vector] init: OK
  8366. 740.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8367. 740.13 s [vector] tail: OK
  8368. 740.13 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8369. 740.13 s [vector] take: OK
  8370. 740.13 s [vector] +++ OK, passed 100 tests.
  8371. 740.13 s [vector] drop: OK
  8372. 740.13 s [vector] +++ OK, passed 100 tests.
  8373. 740.13 s [vector] splitAt: OK
  8374. 740.13 s [vector] +++ OK, passed 100 tests.
  8375. 740.13 s [vector] empty: OK
  8376. 740.13 s [vector] +++ OK, passed 100 tests.
  8377. 740.13 s [vector] singleton: OK
  8378. 740.13 s [vector] +++ OK, passed 100 tests.
  8379. 740.13 s [vector] replicate: OK
  8380. 740.13 s [vector] +++ OK, passed 100 tests.
  8381. 740.13 s [vector] generate: OK
  8382. 740.13 s [vector] +++ OK, passed 100 tests.
  8383. 740.15 s [vector] iterateN: OK
  8384. 740.15 s [vector] +++ OK, passed 100 tests.
  8385. 740.17 s [vector] iterateNM: OK (0.02s)
  8386. 740.17 s [vector] +++ OK, passed 100 tests.
  8387. 740.19 s [vector] generateM: OK (0.03s)
  8388. 740.19 s [vector] +++ OK, passed 100 tests.
  8389. 740.20 s [vector] replicateM: OK
  8390. 740.20 s [vector] +++ OK, passed 100 tests.
  8391. 740.20 s [vector] create: OK
  8392. 740.20 s [vector] +++ OK, passed 100 tests.
  8393. 740.20 s [vector] createT: OK
  8394. 740.20 s [vector] +++ OK, passed 100 tests.
  8395. 740.20 s [vector] unfoldr: OK
  8396. 740.20 s [vector] +++ OK, passed 100 tests.
  8397. 740.20 s [vector] unfoldrN: OK
  8398. 740.20 s [vector] +++ OK, passed 100 tests.
  8399. 740.20 s [vector] unfoldrExactN: OK
  8400. 740.20 s [vector] +++ OK, passed 100 tests.
  8401. 740.21 s [vector] unfoldrM: OK
  8402. 740.21 s [vector] +++ OK, passed 100 tests.
  8403. 740.21 s [vector] unfoldrNM: OK
  8404. 740.21 s [vector] +++ OK, passed 100 tests.
  8405. 740.28 s [vector] unfoldrExactNM: OK (0.07s)
  8406. 740.28 s [vector] +++ OK, passed 100 tests.
  8407. 740.29 s [vector] constructN: OK
  8408. 740.29 s [vector] +++ OK, passed 100 tests.
  8409. 740.29 s [vector] constructrN: OK
  8410. 740.29 s [vector] +++ OK, passed 100 tests.
  8411. 740.29 s [vector] cons: OK
  8412. 740.29 s [vector] +++ OK, passed 100 tests.
  8413. 740.29 s [vector] snoc: OK
  8414. 740.29 s [vector] +++ OK, passed 100 tests.
  8415. 740.29 s [vector] append: OK
  8416. 740.29 s [vector] +++ OK, passed 100 tests.
  8417. 740.30 s [vector] concat: OK (0.01s)
  8418. 740.30 s [vector] +++ OK, passed 100 tests.
  8419. 740.30 s [vector] force: OK
  8420. 740.30 s [vector] +++ OK, passed 100 tests.
  8421. 740.31 s [vector] upd: OK
  8422. 740.31 s [vector] +++ OK, passed 100 tests.
  8423. 740.31 s [vector] accum: OK
  8424. 740.31 s [vector] +++ OK, passed 100 tests.
  8425. 740.31 s [vector] reverse: OK
  8426. 740.31 s [vector] +++ OK, passed 100 tests.
  8427. 740.31 s [vector] backpermute: OK
  8428. 740.31 s [vector] +++ OK, passed 100 tests.
  8429. 740.32 s [vector] map: OK
  8430. 740.32 s [vector] +++ OK, passed 100 tests.
  8431. 740.33 s [vector] imap: OK
  8432. 740.33 s [vector] +++ OK, passed 100 tests.
  8433. 740.33 s [vector] concatMap: OK
  8434. 740.33 s [vector] +++ OK, passed 100 tests.
  8435. 740.33 s [vector] mapM: OK
  8436. 740.33 s [vector] +++ OK, passed 100 tests.
  8437. 740.35 s [vector] mapM_: OK (0.02s)
  8438. 740.35 s [vector] +++ OK, passed 100 tests.
  8439. 740.35 s [vector] forM: OK
  8440. 740.35 s [vector] +++ OK, passed 100 tests.
  8441. 740.37 s [vector] forM_: OK (0.02s)
  8442. 740.37 s [vector] +++ OK, passed 100 tests.
  8443. 740.37 s [vector] imapM: OK
  8444. 740.37 s [vector] +++ OK, passed 100 tests.
  8445. 740.39 s [vector] imapM_: OK (0.02s)
  8446. 740.39 s [vector] +++ OK, passed 100 tests.
  8447. 740.39 s [vector] zipWith: OK
  8448. 740.39 s [vector] +++ OK, passed 100 tests.
  8449. 740.40 s [vector] zipWith3: OK
  8450. 740.40 s [vector] +++ OK, passed 100 tests.
  8451. 740.40 s [vector] izipWith: OK
  8452. 740.40 s [vector] +++ OK, passed 100 tests.
  8453. 740.40 s [vector] izipWith3: OK
  8454. 740.40 s [vector] +++ OK, passed 100 tests.
  8455. 740.40 s [vector] izipWithM: OK
  8456. 740.40 s [vector] +++ OK, passed 100 tests.
  8457. 740.42 s [vector] izipWithM_: OK
  8458. 740.42 s [vector] +++ OK, passed 100 tests.
  8459. 740.43 s [vector] zipWithM: OK
  8460. 740.44 s [vector] +++ OK, passed 100 tests.
  8461. 740.44 s [vector] zipWithM_: OK (0.02s)
  8462. 740.44 s [vector] +++ OK, passed 100 tests.
  8463. 740.44 s [vector] filter: OK
  8464. 740.44 s [vector] +++ OK, passed 100 tests.
  8465. 740.45 s [vector] ifilter: OK
  8466. 740.45 s [vector] +++ OK, passed 100 tests.
  8467. 740.48 s [vector] filterM: OK (0.03s)
  8468. 740.48 s [vector] +++ OK, passed 100 tests.
  8469. 740.48 s [vector] uniq: OK
  8470. 740.48 s [vector] +++ OK, passed 100 tests.
  8471. 740.48 s [vector] mapMaybe: OK
  8472. 740.48 s [vector] +++ OK, passed 100 tests.
  8473. 740.48 s [vector] imapMaybe: OK
  8474. 740.48 s [vector] +++ OK, passed 100 tests.
  8475. 740.48 s [vector] takeWhile: OK
  8476. 740.48 s [vector] +++ OK, passed 100 tests.
  8477. 740.49 s [vector] dropWhile: OK
  8478. 740.49 s [vector] +++ OK, passed 100 tests.
  8479. 740.49 s [vector] partition: OK
  8480. 740.49 s [vector] +++ OK, passed 100 tests.
  8481. 740.49 s [vector] partitionWith: OK
  8482. 740.49 s [vector] +++ OK, passed 100 tests.
  8483. 740.49 s [vector] span: OK
  8484. 740.49 s [vector] +++ OK, passed 100 tests.
  8485. 740.49 s [vector] break: OK
  8486. 740.49 s [vector] +++ OK, passed 100 tests.
  8487. 740.49 s [vector] spanR: OK
  8488. 740.49 s [vector] +++ OK, passed 100 tests.
  8489. 740.49 s [vector] breakR: OK
  8490. 740.49 s [vector] +++ OK, passed 100 tests.
  8491. 740.49 s [vector] groupBy: OK
  8492. 740.49 s [vector] +++ OK, passed 100 tests.
  8493. 740.49 s [vector] elem: OK
  8494. 740.49 s [vector] +++ OK, passed 100 tests.
  8495. 740.49 s [vector] notElem: OK
  8496. 740.49 s [vector] +++ OK, passed 100 tests.
  8497. 740.49 s [vector] find: OK
  8498. 740.49 s [vector] +++ OK, passed 100 tests.
  8499. 740.49 s [vector] findIndex: OK
  8500. 740.49 s [vector] +++ OK, passed 100 tests.
  8501. 740.50 s [vector] findIndexR: OK
  8502. 740.50 s [vector] +++ OK, passed 100 tests.
  8503. 740.50 s [vector] findIndices: OK
  8504. 740.50 s [vector] +++ OK, passed 100 tests.
  8505. 740.50 s [vector] elemIndex: OK
  8506. 740.50 s [vector] +++ OK, passed 100 tests.
  8507. 740.50 s [vector] elemIndices: OK
  8508. 740.50 s [vector] +++ OK, passed 100 tests.
  8509. 740.50 s [vector] foldl: OK
  8510. 740.50 s [vector] +++ OK, passed 100 tests.
  8511. 740.51 s [vector] foldl1: OK
  8512. 740.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8513. 740.51 s [vector] foldl': OK
  8514. 740.51 s [vector] +++ OK, passed 100 tests.
  8515. 740.51 s [vector] foldl1': OK
  8516. 740.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8517. 740.51 s [vector] foldr: OK
  8518. 740.51 s [vector] +++ OK, passed 100 tests.
  8519. 740.51 s [vector] foldr1: OK
  8520. 740.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8521. 740.52 s [vector] foldr': OK
  8522. 740.52 s [vector] +++ OK, passed 100 tests.
  8523. 740.52 s [vector] foldr1': OK
  8524. 740.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8525. 740.53 s [vector] ifoldl: OK
  8526. 740.53 s [vector] +++ OK, passed 100 tests.
  8527. 740.53 s [vector] ifoldl': OK
  8528. 740.53 s [vector] +++ OK, passed 100 tests.
  8529. 740.53 s [vector] ifoldr: OK
  8530. 740.53 s [vector] +++ OK, passed 100 tests.
  8531. 740.53 s [vector] ifoldr': OK
  8532. 740.53 s [vector] +++ OK, passed 100 tests.
  8533. 740.54 s [vector] ifoldM: OK
  8534. 740.56 s [vector] +++ OK, passed 100 tests.
  8535. 740.56 s [vector] ifoldM': OK
  8536. 740.56 s [vector] +++ OK, passed 100 tests.
  8537. 740.57 s [vector] ifoldM_: OK (0.03s)
  8538. 740.57 s [vector] +++ OK, passed 100 tests.
  8539. 740.59 s [vector] ifoldM'_: OK (0.02s)
  8540. 740.59 s [vector] +++ OK, passed 100 tests.
  8541. 740.59 s [vector] all: OK
  8542. 740.59 s [vector] +++ OK, passed 100 tests.
  8543. 740.59 s [vector] any: OK
  8544. 740.59 s [vector] +++ OK, passed 100 tests.
  8545. 740.59 s [vector] prescanl: OK
  8546. 740.59 s [vector] +++ OK, passed 100 tests.
  8547. 740.60 s [vector] prescanl': OK
  8548. 740.60 s [vector] +++ OK, passed 100 tests.
  8549. 740.60 s [vector] postscanl: OK
  8550. 740.60 s [vector] +++ OK, passed 100 tests.
  8551. 740.60 s [vector] postscanl': OK
  8552. 740.61 s [vector] +++ OK, passed 100 tests.
  8553. 740.61 s [vector] scanl: OK
  8554. 740.61 s [vector] +++ OK, passed 100 tests.
  8555. 740.61 s [vector] scanl': OK
  8556. 740.61 s [vector] +++ OK, passed 100 tests.
  8557. 740.62 s [vector] scanl1: OK
  8558. 740.62 s [vector] +++ OK, passed 100 tests.
  8559. 740.63 s [vector] scanl1': OK
  8560. 740.63 s [vector] +++ OK, passed 100 tests.
  8561. 740.63 s [vector] iscanl: OK
  8562. 740.63 s [vector] +++ OK, passed 100 tests.
  8563. 740.63 s [vector] iscanl': OK
  8564. 740.63 s [vector] +++ OK, passed 100 tests.
  8565. 740.64 s [vector] prescanr: OK
  8566. 740.64 s [vector] +++ OK, passed 100 tests.
  8567. 740.64 s [vector] prescanr': OK
  8568. 740.64 s [vector] +++ OK, passed 100 tests.
  8569. 740.64 s [vector] postscanr: OK
  8570. 740.64 s [vector] +++ OK, passed 100 tests.
  8571. 740.65 s [vector] postscanr': OK
  8572. 740.65 s [vector] +++ OK, passed 100 tests.
  8573. 740.65 s [vector] scanr: OK
  8574. 740.65 s [vector] +++ OK, passed 100 tests.
  8575. 740.65 s [vector] scanr': OK
  8576. 740.65 s [vector] +++ OK, passed 100 tests.
  8577. 740.65 s [vector] scanr1: OK
  8578. 740.65 s [vector] +++ OK, passed 100 tests.
  8579. 740.66 s [vector] scanr1': OK
  8580. 740.66 s [vector] +++ OK, passed 100 tests.
  8581. 740.66 s [vector] iscanr: OK
  8582. 740.66 s [vector] +++ OK, passed 100 tests.
  8583. 740.66 s [vector] iscanr': OK
  8584. 740.66 s [vector] +++ OK, passed 100 tests.
  8585. 740.66 s [vector] mut_read: OK
  8586. 740.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8587. 740.67 s [vector] mut_write: OK
  8588. 740.67 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8589. 740.67 s [vector] mut_modify: OK
  8590. 740.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8591. 740.67 s [vector] mut_generate: OK
  8592. 740.67 s [vector] +++ OK, passed 100 tests.
  8593. 740.68 s [vector] mut_generateM: OK (0.01s)
  8594. 740.68 s [vector] +++ OK, passed 100 tests.
  8595. 740.69 s [vector] mut_mapM_: OK
  8596. 740.69 s [vector] +++ OK, passed 100 tests.
  8597. 740.73 s [vector] mut_imapM_: OK (0.02s)
  8598. 740.73 s [vector] +++ OK, passed 100 tests.
  8599. 740.75 s [vector] mut_forM_: OK (0.02s)
  8600. 740.75 s [vector] +++ OK, passed 100 tests.
  8601. 740.77 s [vector] mut_iforM_: OK (0.02s)
  8602. 740.77 s [vector] +++ OK, passed 100 tests.
  8603. 740.78 s [vector] mut_foldr: OK
  8604. 740.78 s [vector] +++ OK, passed 100 tests.
  8605. 740.78 s [vector] mut_foldr': OK
  8606. 740.78 s [vector] +++ OK, passed 100 tests.
  8607. 740.78 s [vector] mut_foldl: OK
  8608. 740.78 s [vector] +++ OK, passed 100 tests.
  8609. 740.78 s [vector] mut_foldl': OK
  8610. 740.79 s [vector] +++ OK, passed 100 tests.
  8611. 740.79 s [vector] mut_ifoldr: OK
  8612. 740.79 s [vector] +++ OK, passed 100 tests.
  8613. 740.79 s [vector] mut_ifoldr': OK
  8614. 740.79 s [vector] +++ OK, passed 100 tests.
  8615. 740.80 s [vector] mut_ifoldl: OK
  8616. 740.80 s [vector] +++ OK, passed 100 tests.
  8617. 740.81 s [vector] mut_ifoldl': OK
  8618. 740.81 s [vector] +++ OK, passed 100 tests.
  8619. 740.81 s [vector] mut_foldM: OK
  8620. 740.81 s [vector] +++ OK, passed 100 tests.
  8621. 740.82 s [vector] mut_foldM': OK
  8622. 740.82 s [vector] +++ OK, passed 100 tests.
  8623. 740.83 s [vector] mut_foldrM: OK
  8624. 740.83 s [vector] +++ OK, passed 100 tests.
  8625. 740.83 s [vector] mut_foldrM': OK
  8626. 740.83 s [vector] +++ OK, passed 100 tests.
  8627. 740.83 s [vector] mut_ifoldM: OK
  8628. 740.83 s [vector] +++ OK, passed 100 tests.
  8629. 740.83 s [vector] mut_ifoldM': OK
  8630. 740.83 s [vector] +++ OK, passed 100 tests.
  8631. 740.84 s [vector] mut_ifoldrM: OK
  8632. 740.84 s [vector] +++ OK, passed 100 tests.
  8633. 740.84 s [vector] mut_ifoldrM': OK
  8634. 740.84 s [vector] +++ OK, passed 100 tests.
  8635. 740.84 s [vector] compare: OK
  8636. 740.84 s [vector] +++ OK, passed 100 tests.
  8637. 740.84 s [vector] maximum: OK
  8638. 740.84 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8639. 740.84 s [vector] minimum: OK
  8640. 740.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8641. 740.84 s [vector] minIndex: OK
  8642. 740.84 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8643. 740.84 s [vector] maxIndex: OK
  8644. 740.84 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8645. 740.84 s [vector] maximumBy: OK
  8646. 740.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8647. 740.84 s [vector] minimumBy: OK
  8648. 740.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8649. 740.84 s [vector] maximumOn: OK
  8650. 740.85 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8651. 740.85 s [vector] minimumOn: OK
  8652. 740.85 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8653. 740.85 s [vector] maxIndexBy: OK
  8654. 740.85 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8655. 740.85 s [vector] minIndexBy: OK
  8656. 740.85 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8657. 740.86 s [vector] ListFirstMaxIndexWins: OK
  8658. 740.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8659. 740.86 s [vector] FalseListFirstMaxIndexWins: OK
  8660. 740.86 s [vector] +++ OK, failed as expected. (after 1 test):
  8661. 740.86 s [vector] Exception:
  8662. 740.86 s [vector] Prelude.foldr1: empty list
  8663. 740.86 s [vector] CallStack (from HasCallStack):
  8664. 740.86 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  8665. 740.86 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  8666. 740.86 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8667. 740.86 s [vector] []
  8668. 740.86 s [vector] zip: OK
  8669. 740.86 s [vector] +++ OK, passed 100 tests.
  8670. 740.86 s [vector] zip3: OK
  8671. 740.86 s [vector] +++ OK, passed 100 tests.
  8672. 740.86 s [vector] unzip: OK
  8673. 740.86 s [vector] +++ OK, passed 100 tests.
  8674. 740.87 s [vector] unzip3: OK
  8675. 740.87 s [vector] +++ OK, passed 100 tests.
  8676. 740.87 s [vector] indexed: OK
  8677. 740.87 s [vector] +++ OK, passed 100 tests.
  8678. 740.87 s [vector] update: OK
  8679. 740.87 s [vector] +++ OK, passed 100 tests.
  8680. 740.88 s [vector] concat: OK (0.01s)
  8681. 740.88 s [vector] +++ OK, passed 100 tests.
  8682. 740.89 s [vector] mempty: OK
  8683. 740.89 s [vector] +++ OK, passed 100 tests.
  8684. 740.89 s [vector] mappend: OK
  8685. 740.89 s [vector] +++ OK, passed 100 tests.
  8686. 740.89 s [vector] mconcat: OK (0.01s)
  8687. 740.89 s [vector] +++ OK, passed 100 tests.
  8688. 740.89 s [vector] fmap: OK
  8689. 740.89 s [vector] +++ OK, passed 100 tests.
  8690. 740.91 s [vector] return: OK
  8691. 740.91 s [vector] +++ OK, passed 100 tests.
  8692. 740.92 s [vector] bind: OK (0.02s)
  8693. 740.92 s [vector] +++ OK, passed 100 tests.
  8694. 740.92 s [vector] mzip: OK
  8695. 740.92 s [vector] +++ OK, passed 100 tests.
  8696. 740.92 s [vector] munzip: OK
  8697. 740.92 s [vector] +++ OK, passed 100 tests.
  8698. 740.92 s [vector] applicative_pure: OK
  8699. 740.93 s [vector] +++ OK, passed 100 tests.
  8700. 740.97 s [vector] applicative_appl: OK (0.05s)
  8701. 740.97 s [vector] +++ OK, passed 100 tests.
  8702. 740.97 s [vector] alternative_empty: OK
  8703. 740.97 s [vector] +++ OK, passed 100 tests.
  8704. 740.97 s [vector] alternative_or: OK
  8705. 740.97 s [vector] +++ OK, passed 100 tests.
  8706. 741.01 s [vector] sequence: OK (0.04s)
  8707. 741.01 s [vector] +++ OK, passed 100 tests.
  8708. 741.02 s [vector] sequence_: OK (0.01s)
  8709. 741.02 s [vector] +++ OK, passed 100 tests.
  8710. 741.02 s [vector] glength: OK
  8711. 741.03 s [vector] +++ OK, passed 100 tests.
  8712. 741.03 s [vector] sum: OK
  8713. 741.03 s [vector] +++ OK, passed 100 tests.
  8714. 741.03 s [vector] product: OK
  8715. 741.03 s [vector] +++ OK, passed 100 tests.
  8716. 741.03 s [vector] enumFromN: OK
  8717. 741.03 s [vector] +++ OK, passed 100 tests.
  8718. 741.03 s [vector] enumFromThenN: OK
  8719. 741.03 s [vector] +++ OK, passed 100 tests.
  8720. 741.03 s [vector] enumFromTo: OK
  8721. 741.03 s [vector] +++ OK, passed 100 tests.
  8722. 741.03 s [vector] enumFromThenTo: OK
  8723. 741.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8724. 741.03 s [vector] unstream
  8725. 741.03 s [vector] unstream == vunstream (exact): OK
  8726. 741.03 s [vector] +++ OK, passed 100 tests.
  8727. 741.03 s [vector] unstream == vunstream (unknown): OK
  8728. 741.03 s [vector] +++ OK, passed 100 tests.
  8729. 741.03 s [vector] unstreamR ~= vunstream (exact): OK
  8730. 741.03 s [vector] +++ OK, passed 100 tests.
  8731. 741.03 s [vector] unstreamR ~= vunstream (unknown): OK
  8732. 741.03 s [vector] +++ OK, passed 100 tests.
  8733. 741.03 s [vector] Tests.Vector.Unboxed
  8734. 741.03 s [vector] ()
  8735. 741.03 s [vector] fromList.toList == id: OK
  8736. 741.03 s [vector] +++ OK, passed 100 tests.
  8737. 741.03 s [vector] toList.fromList == id: OK
  8738. 741.03 s [vector] +++ OK, passed 100 tests.
  8739. 741.03 s [vector] unstream.stream == id: OK
  8740. 741.03 s [vector] +++ OK, passed 100 tests.
  8741. 741.04 s [vector] stream.unstream == id: OK
  8742. 741.04 s [vector] +++ OK, passed 100 tests.
  8743. 741.04 s [vector] eq: OK
  8744. 741.04 s [vector] +++ OK, passed 100 tests.
  8745. 741.04 s [vector] length: OK
  8746. 741.04 s [vector] +++ OK, passed 100 tests.
  8747. 741.04 s [vector] null: OK
  8748. 741.04 s [vector] +++ OK, passed 100 tests.
  8749. 741.04 s [vector] index: OK
  8750. 741.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8751. 741.04 s [vector] safeIndex: OK
  8752. 741.04 s [vector] +++ OK, passed 100 tests.
  8753. 741.04 s [vector] head: OK
  8754. 741.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8755. 741.04 s [vector] last: OK
  8756. 741.04 s [vector] +++ OK, passed 100 tests; 24 discarded.
  8757. 741.04 s [vector] unsafeIndex: OK
  8758. 741.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8759. 741.04 s [vector] unsafeHead: OK
  8760. 741.04 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8761. 741.04 s [vector] unsafeLast: OK
  8762. 741.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8763. 741.04 s [vector] slice: OK
  8764. 741.04 s [vector] +++ OK, passed 100 tests.
  8765. 741.04 s [vector] init: OK
  8766. 741.04 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8767. 741.04 s [vector] tail: OK
  8768. 741.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8769. 741.04 s [vector] take: OK
  8770. 741.04 s [vector] +++ OK, passed 100 tests.
  8771. 741.04 s [vector] drop: OK
  8772. 741.04 s [vector] +++ OK, passed 100 tests.
  8773. 741.04 s [vector] splitAt: OK
  8774. 741.04 s [vector] +++ OK, passed 100 tests.
  8775. 741.04 s [vector] empty: OK
  8776. 741.04 s [vector] +++ OK, passed 100 tests.
  8777. 741.04 s [vector] singleton: OK
  8778. 741.04 s [vector] +++ OK, passed 100 tests.
  8779. 741.04 s [vector] replicate: OK
  8780. 741.04 s [vector] +++ OK, passed 100 tests.
  8781. 741.04 s [vector] generate: OK
  8782. 741.04 s [vector] +++ OK, passed 100 tests.
  8783. 741.04 s [vector] iterateN: OK
  8784. 741.05 s [vector] +++ OK, passed 100 tests.
  8785. 741.10 s [vector] iterateNM: OK (0.05s)
  8786. 741.10 s [vector] +++ OK, passed 100 tests.
  8787. 741.12 s [vector] generateM: OK (0.02s)
  8788. 741.12 s [vector] +++ OK, passed 100 tests.
  8789. 741.12 s [vector] replicateM: OK
  8790. 741.12 s [vector] +++ OK, passed 100 tests.
  8791. 741.12 s [vector] create: OK
  8792. 741.12 s [vector] +++ OK, passed 100 tests.
  8793. 741.13 s [vector] createT: OK
  8794. 741.13 s [vector] +++ OK, passed 100 tests.
  8795. 741.13 s [vector] unfoldr: OK
  8796. 741.13 s [vector] +++ OK, passed 100 tests.
  8797. 741.15 s [vector] unfoldrN: OK
  8798. 741.15 s [vector] +++ OK, passed 100 tests.
  8799. 741.15 s [vector] unfoldrExactN: OK
  8800. 741.15 s [vector] +++ OK, passed 100 tests.
  8801. 741.16 s [vector] unfoldrM: OK
  8802. 741.17 s [vector] +++ OK, passed 100 tests.
  8803. 741.17 s [vector] unfoldrNM: OK
  8804. 741.17 s [vector] +++ OK, passed 100 tests.
  8805. 741.18 s [vector] unfoldrExactNM: OK (0.04s)
  8806. 741.18 s [vector] +++ OK, passed 100 tests.
  8807. 741.18 s [vector] constructN: OK
  8808. 741.18 s [vector] +++ OK, passed 100 tests.
  8809. 741.18 s [vector] constructrN: OK
  8810. 741.18 s [vector] +++ OK, passed 100 tests.
  8811. 741.18 s [vector] cons: OK
  8812. 741.18 s [vector] +++ OK, passed 100 tests.
  8813. 741.18 s [vector] snoc: OK
  8814. 741.18 s [vector] +++ OK, passed 100 tests.
  8815. 741.19 s [vector] append: OK
  8816. 741.19 s [vector] +++ OK, passed 100 tests.
  8817. 741.20 s [vector] concat: OK (0.01s)
  8818. 741.20 s [vector] +++ OK, passed 100 tests.
  8819. 741.20 s [vector] force: OK
  8820. 741.20 s [vector] +++ OK, passed 100 tests.
  8821. 741.20 s [vector] upd: OK
  8822. 741.20 s [vector] +++ OK, passed 100 tests.
  8823. 741.20 s [vector] accum: OK
  8824. 741.20 s [vector] +++ OK, passed 100 tests.
  8825. 741.20 s [vector] reverse: OK
  8826. 741.20 s [vector] +++ OK, passed 100 tests.
  8827. 741.21 s [vector] backpermute: OK
  8828. 741.21 s [vector] +++ OK, passed 100 tests.
  8829. 741.21 s [vector] map: OK
  8830. 741.21 s [vector] +++ OK, passed 100 tests.
  8831. 741.21 s [vector] imap: OK
  8832. 741.21 s [vector] +++ OK, passed 100 tests.
  8833. 741.21 s [vector] concatMap: OK
  8834. 741.21 s [vector] +++ OK, passed 100 tests.
  8835. 741.23 s [vector] mapM: OK
  8836. 741.23 s [vector] +++ OK, passed 100 tests.
  8837. 741.23 s [vector] mapM_: OK (0.01s)
  8838. 741.23 s [vector] +++ OK, passed 100 tests.
  8839. 741.23 s [vector] forM: OK
  8840. 741.23 s [vector] +++ OK, passed 100 tests.
  8841. 741.24 s [vector] forM_: OK
  8842. 741.25 s [vector] +++ OK, passed 100 tests.
  8843. 741.25 s [vector] imapM: OK
  8844. 741.25 s [vector] +++ OK, passed 100 tests.
  8845. 741.25 s [vector] imapM_: OK (0.01s)
  8846. 741.25 s [vector] +++ OK, passed 100 tests.
  8847. 741.25 s [vector] zipWith: OK
  8848. 741.25 s [vector] +++ OK, passed 100 tests.
  8849. 741.25 s [vector] zipWith3: OK
  8850. 741.25 s [vector] +++ OK, passed 100 tests.
  8851. 741.26 s [vector] izipWith: OK
  8852. 741.26 s [vector] +++ OK, passed 100 tests.
  8853. 741.26 s [vector] izipWith3: OK
  8854. 741.26 s [vector] +++ OK, passed 100 tests.
  8855. 741.27 s [vector] izipWithM: OK
  8856. 741.27 s [vector] +++ OK, passed 100 tests.
  8857. 741.27 s [vector] izipWithM_: OK
  8858. 741.27 s [vector] +++ OK, passed 100 tests.
  8859. 741.27 s [vector] zipWithM: OK
  8860. 741.27 s [vector] +++ OK, passed 100 tests.
  8861. 741.27 s [vector] zipWithM_: OK
  8862. 741.27 s [vector] +++ OK, passed 100 tests.
  8863. 741.27 s [vector] filter: OK
  8864. 741.27 s [vector] +++ OK, passed 100 tests.
  8865. 741.27 s [vector] ifilter: OK
  8866. 741.27 s [vector] +++ OK, passed 100 tests.
  8867. 741.29 s [vector] filterM: OK
  8868. 741.29 s [vector] +++ OK, passed 100 tests.
  8869. 741.29 s [vector] uniq: OK
  8870. 741.29 s [vector] +++ OK, passed 100 tests.
  8871. 741.29 s [vector] mapMaybe: OK
  8872. 741.29 s [vector] +++ OK, passed 100 tests.
  8873. 741.29 s [vector] imapMaybe: OK
  8874. 741.29 s [vector] +++ OK, passed 100 tests.
  8875. 741.29 s [vector] takeWhile: OK
  8876. 741.29 s [vector] +++ OK, passed 100 tests.
  8877. 741.30 s [vector] dropWhile: OK
  8878. 741.30 s [vector] +++ OK, passed 100 tests.
  8879. 741.30 s [vector] partition: OK
  8880. 741.30 s [vector] +++ OK, passed 100 tests.
  8881. 741.30 s [vector] partitionWith: OK
  8882. 741.30 s [vector] +++ OK, passed 100 tests.
  8883. 741.30 s [vector] span: OK
  8884. 741.30 s [vector] +++ OK, passed 100 tests.
  8885. 741.30 s [vector] break: OK
  8886. 741.30 s [vector] +++ OK, passed 100 tests.
  8887. 741.30 s [vector] spanR: OK
  8888. 741.30 s [vector] +++ OK, passed 100 tests.
  8889. 741.30 s [vector] breakR: OK
  8890. 741.30 s [vector] +++ OK, passed 100 tests.
  8891. 741.30 s [vector] groupBy: OK
  8892. 741.30 s [vector] +++ OK, passed 100 tests.
  8893. 741.30 s [vector] elem: OK
  8894. 741.30 s [vector] +++ OK, passed 100 tests.
  8895. 741.30 s [vector] notElem: OK
  8896. 741.30 s [vector] +++ OK, passed 100 tests.
  8897. 741.30 s [vector] find: OK
  8898. 741.30 s [vector] +++ OK, passed 100 tests.
  8899. 741.30 s [vector] findIndex: OK
  8900. 741.30 s [vector] +++ OK, passed 100 tests.
  8901. 741.31 s [vector] findIndexR: OK
  8902. 741.31 s [vector] +++ OK, passed 100 tests.
  8903. 741.31 s [vector] findIndices: OK
  8904. 741.31 s [vector] +++ OK, passed 100 tests.
  8905. 741.31 s [vector] elemIndex: OK
  8906. 741.31 s [vector] +++ OK, passed 100 tests.
  8907. 741.31 s [vector] elemIndices: OK
  8908. 741.31 s [vector] +++ OK, passed 100 tests.
  8909. 741.31 s [vector] foldl: OK
  8910. 741.31 s [vector] +++ OK, passed 100 tests.
  8911. 741.31 s [vector] foldl1: OK
  8912. 741.31 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8913. 741.31 s [vector] foldl': OK
  8914. 741.31 s [vector] +++ OK, passed 100 tests.
  8915. 741.31 s [vector] foldl1': OK
  8916. 741.31 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8917. 741.31 s [vector] foldr: OK
  8918. 741.31 s [vector] +++ OK, passed 100 tests.
  8919. 741.31 s [vector] foldr1: OK
  8920. 741.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8921. 741.31 s [vector] foldr': OK
  8922. 741.31 s [vector] +++ OK, passed 100 tests.
  8923. 741.31 s [vector] foldr1': OK
  8924. 741.31 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8925. 741.31 s [vector] ifoldl: OK
  8926. 741.31 s [vector] +++ OK, passed 100 tests.
  8927. 741.31 s [vector] ifoldl': OK
  8928. 741.31 s [vector] +++ OK, passed 100 tests.
  8929. 741.31 s [vector] ifoldr: OK
  8930. 741.31 s [vector] +++ OK, passed 100 tests.
  8931. 741.31 s [vector] ifoldr': OK
  8932. 741.31 s [vector] +++ OK, passed 100 tests.
  8933. 741.32 s [vector] ifoldM: OK
  8934. 741.32 s [vector] +++ OK, passed 100 tests.
  8935. 741.32 s [vector] ifoldM': OK
  8936. 741.32 s [vector] +++ OK, passed 100 tests.
  8937. 741.33 s [vector] ifoldM_: OK
  8938. 741.33 s [vector] +++ OK, passed 100 tests.
  8939. 741.34 s [vector] ifoldM'_: OK (0.01s)
  8940. 741.34 s [vector] +++ OK, passed 100 tests.
  8941. 741.34 s [vector] all: OK
  8942. 741.34 s [vector] +++ OK, passed 100 tests.
  8943. 741.34 s [vector] any: OK
  8944. 741.34 s [vector] +++ OK, passed 100 tests.
  8945. 741.34 s [vector] prescanl: OK
  8946. 741.34 s [vector] +++ OK, passed 100 tests.
  8947. 741.34 s [vector] prescanl': OK
  8948. 741.34 s [vector] +++ OK, passed 100 tests.
  8949. 741.34 s [vector] postscanl: OK
  8950. 741.34 s [vector] +++ OK, passed 100 tests.
  8951. 741.34 s [vector] postscanl': OK
  8952. 741.34 s [vector] +++ OK, passed 100 tests.
  8953. 741.35 s [vector] scanl: OK
  8954. 741.35 s [vector] +++ OK, passed 100 tests.
  8955. 741.35 s [vector] scanl': OK
  8956. 741.35 s [vector] +++ OK, passed 100 tests.
  8957. 741.35 s [vector] scanl1: OK
  8958. 741.35 s [vector] +++ OK, passed 100 tests.
  8959. 741.35 s [vector] scanl1': OK
  8960. 741.35 s [vector] +++ OK, passed 100 tests.
  8961. 741.35 s [vector] iscanl: OK
  8962. 741.35 s [vector] +++ OK, passed 100 tests.
  8963. 741.35 s [vector] iscanl': OK
  8964. 741.35 s [vector] +++ OK, passed 100 tests.
  8965. 741.35 s [vector] prescanr: OK
  8966. 741.35 s [vector] +++ OK, passed 100 tests.
  8967. 741.35 s [vector] prescanr': OK
  8968. 741.36 s [vector] +++ OK, passed 100 tests.
  8969. 741.36 s [vector] postscanr: OK
  8970. 741.36 s [vector] +++ OK, passed 100 tests.
  8971. 741.36 s [vector] postscanr': OK
  8972. 741.36 s [vector] +++ OK, passed 100 tests.
  8973. 741.36 s [vector] scanr: OK
  8974. 741.36 s [vector] +++ OK, passed 100 tests.
  8975. 741.36 s [vector] scanr': OK
  8976. 741.36 s [vector] +++ OK, passed 100 tests.
  8977. 741.36 s [vector] scanr1: OK
  8978. 741.36 s [vector] +++ OK, passed 100 tests.
  8979. 741.36 s [vector] scanr1': OK
  8980. 741.36 s [vector] +++ OK, passed 100 tests.
  8981. 741.36 s [vector] iscanr: OK
  8982. 741.36 s [vector] +++ OK, passed 100 tests.
  8983. 741.36 s [vector] iscanr': OK
  8984. 741.36 s [vector] +++ OK, passed 100 tests.
  8985. 741.36 s [vector] mut_read: OK
  8986. 741.36 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8987. 741.36 s [vector] mut_write: OK
  8988. 741.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8989. 741.36 s [vector] mut_modify: OK
  8990. 741.36 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8991. 741.36 s [vector] mut_generate: OK
  8992. 741.36 s [vector] +++ OK, passed 100 tests.
  8993. 741.37 s [vector] mut_generateM: OK
  8994. 741.37 s [vector] +++ OK, passed 100 tests.
  8995. 741.39 s [vector] mut_mapM_: OK
  8996. 741.39 s [vector] +++ OK, passed 100 tests.
  8997. 741.40 s [vector] mut_imapM_: OK (0.01s)
  8998. 741.40 s [vector] +++ OK, passed 100 tests.
  8999. 741.40 s [vector] mut_forM_: OK (0.01s)
  9000. 741.40 s [vector] +++ OK, passed 100 tests.
  9001. 741.41 s [vector] mut_iforM_: OK
  9002. 741.41 s [vector] +++ OK, passed 100 tests.
  9003. 741.41 s [vector] mut_foldr: OK
  9004. 741.41 s [vector] +++ OK, passed 100 tests.
  9005. 741.41 s [vector] mut_foldr': OK
  9006. 741.41 s [vector] +++ OK, passed 100 tests.
  9007. 741.41 s [vector] mut_foldl: OK
  9008. 741.41 s [vector] +++ OK, passed 100 tests.
  9009. 741.42 s [vector] mut_foldl': OK
  9010. 741.42 s [vector] +++ OK, passed 100 tests.
  9011. 741.42 s [vector] mut_ifoldr: OK
  9012. 741.42 s [vector] +++ OK, passed 100 tests.
  9013. 741.42 s [vector] mut_ifoldr': OK
  9014. 741.42 s [vector] +++ OK, passed 100 tests.
  9015. 741.42 s [vector] mut_ifoldl: OK
  9016. 741.42 s [vector] +++ OK, passed 100 tests.
  9017. 741.42 s [vector] mut_ifoldl': OK
  9018. 741.42 s [vector] +++ OK, passed 100 tests.
  9019. 741.42 s [vector] mut_foldM: OK
  9020. 741.42 s [vector] +++ OK, passed 100 tests.
  9021. 741.42 s [vector] mut_foldM': OK
  9022. 741.42 s [vector] +++ OK, passed 100 tests.
  9023. 741.42 s [vector] mut_foldrM: OK
  9024. 741.42 s [vector] +++ OK, passed 100 tests.
  9025. 741.42 s [vector] mut_foldrM': OK
  9026. 741.42 s [vector] +++ OK, passed 100 tests.
  9027. 741.42 s [vector] mut_ifoldM: OK
  9028. 741.42 s [vector] +++ OK, passed 100 tests.
  9029. 741.42 s [vector] mut_ifoldM': OK
  9030. 741.42 s [vector] +++ OK, passed 100 tests.
  9031. 741.43 s [vector] mut_ifoldrM: OK
  9032. 741.43 s [vector] +++ OK, passed 100 tests.
  9033. 741.43 s [vector] mut_ifoldrM': OK
  9034. 741.43 s [vector] +++ OK, passed 100 tests.
  9035. 741.43 s [vector] compare: OK
  9036. 741.43 s [vector] +++ OK, passed 100 tests.
  9037. 741.43 s [vector] maximum: OK
  9038. 741.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9039. 741.43 s [vector] minimum: OK
  9040. 741.43 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9041. 741.43 s [vector] minIndex: OK
  9042. 741.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9043. 741.43 s [vector] maxIndex: OK
  9044. 741.43 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9045. 741.43 s [vector] maximumBy: OK
  9046. 741.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9047. 741.43 s [vector] minimumBy: OK
  9048. 741.43 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9049. 741.43 s [vector] maximumOn: OK
  9050. 741.43 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9051. 741.43 s [vector] minimumOn: OK
  9052. 741.43 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9053. 741.43 s [vector] maxIndexBy: OK
  9054. 741.43 s [vector] +++ OK, passed 100 tests; 10 discarded.
  9055. 741.43 s [vector] minIndexBy: OK
  9056. 741.43 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9057. 741.43 s [vector] ListFirstMaxIndexWins: OK
  9058. 741.43 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9059. 741.43 s [vector] FalseListFirstMaxIndexWins: OK
  9060. 741.43 s [vector] +++ OK, failed as expected. (after 1 test):
  9061. 741.43 s [vector] Exception:
  9062. 741.43 s [vector] Prelude.foldr1: empty list
  9063. 741.43 s [vector] CallStack (from HasCallStack):
  9064. 741.43 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  9065. 741.43 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  9066. 741.43 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9067. 741.43 s [vector] []
  9068. 741.43 s [vector] zip: OK
  9069. 741.43 s [vector] +++ OK, passed 100 tests.
  9070. 741.43 s [vector] zip3: OK
  9071. 741.43 s [vector] +++ OK, passed 100 tests.
  9072. 741.44 s [vector] unzip: OK
  9073. 741.44 s [vector] +++ OK, passed 100 tests.
  9074. 741.44 s [vector] unzip3: OK
  9075. 741.44 s [vector] +++ OK, passed 100 tests.
  9076. 741.44 s [vector] indexed: OK
  9077. 741.44 s [vector] +++ OK, passed 100 tests.
  9078. 741.44 s [vector] update: OK
  9079. 741.44 s [vector] +++ OK, passed 100 tests.
  9080. 741.44 s [vector] mempty: OK
  9081. 741.44 s [vector] +++ OK, passed 100 tests.
  9082. 741.45 s [vector] mappend: OK
  9083. 741.45 s [vector] +++ OK, passed 100 tests.
  9084. 741.45 s [vector] mconcat: OK
  9085. 741.45 s [vector] +++ OK, passed 100 tests.
  9086. 741.46 s [vector] glength: OK
  9087. 741.46 s [vector] +++ OK, passed 100 tests.
  9088. 741.46 s [vector] (Bool)
  9089. 741.46 s [vector] fromList.toList == id: OK
  9090. 741.46 s [vector] +++ OK, passed 100 tests.
  9091. 741.46 s [vector] toList.fromList == id: OK
  9092. 741.46 s [vector] +++ OK, passed 100 tests.
  9093. 741.46 s [vector] unstream.stream == id: OK
  9094. 741.46 s [vector] +++ OK, passed 100 tests.
  9095. 741.46 s [vector] stream.unstream == id: OK
  9096. 741.46 s [vector] +++ OK, passed 100 tests.
  9097. 741.47 s [vector] eq: OK
  9098. 741.47 s [vector] +++ OK, passed 100 tests.
  9099. 741.47 s [vector] length: OK
  9100. 741.47 s [vector] +++ OK, passed 100 tests.
  9101. 741.47 s [vector] null: OK
  9102. 741.47 s [vector] +++ OK, passed 100 tests.
  9103. 741.47 s [vector] index: OK
  9104. 741.47 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9105. 741.47 s [vector] safeIndex: OK
  9106. 741.47 s [vector] +++ OK, passed 100 tests.
  9107. 741.47 s [vector] head: OK
  9108. 741.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9109. 741.47 s [vector] last: OK
  9110. 741.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9111. 741.47 s [vector] unsafeIndex: OK
  9112. 741.47 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9113. 741.48 s [vector] unsafeHead: OK
  9114. 741.48 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9115. 741.48 s [vector] unsafeLast: OK
  9116. 741.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9117. 741.48 s [vector] slice: OK
  9118. 741.48 s [vector] +++ OK, passed 100 tests.
  9119. 741.48 s [vector] init: OK
  9120. 741.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9121. 741.48 s [vector] tail: OK
  9122. 741.48 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9123. 741.48 s [vector] take: OK
  9124. 741.48 s [vector] +++ OK, passed 100 tests.
  9125. 741.48 s [vector] drop: OK
  9126. 741.48 s [vector] +++ OK, passed 100 tests.
  9127. 741.48 s [vector] splitAt: OK
  9128. 741.48 s [vector] +++ OK, passed 100 tests.
  9129. 741.48 s [vector] empty: OK
  9130. 741.48 s [vector] +++ OK, passed 100 tests.
  9131. 741.48 s [vector] singleton: OK
  9132. 741.48 s [vector] +++ OK, passed 100 tests.
  9133. 741.48 s [vector] replicate: OK
  9134. 741.48 s [vector] +++ OK, passed 100 tests.
  9135. 741.48 s [vector] generate: OK
  9136. 741.48 s [vector] +++ OK, passed 100 tests.
  9137. 741.48 s [vector] iterateN: OK
  9138. 741.48 s [vector] +++ OK, passed 100 tests.
  9139. 741.53 s [vector] iterateNM: OK (0.03s)
  9140. 741.53 s [vector] +++ OK, passed 100 tests.
  9141. 741.54 s [vector] generateM: OK (0.02s)
  9142. 741.54 s [vector] +++ OK, passed 100 tests.
  9143. 741.54 s [vector] replicateM: OK
  9144. 741.54 s [vector] +++ OK, passed 100 tests.
  9145. 741.54 s [vector] create: OK
  9146. 741.54 s [vector] +++ OK, passed 100 tests.
  9147. 741.54 s [vector] createT: OK
  9148. 741.54 s [vector] +++ OK, passed 100 tests.
  9149. 741.54 s [vector] unfoldr: OK
  9150. 741.54 s [vector] +++ OK, passed 100 tests.
  9151. 741.55 s [vector] unfoldrN: OK
  9152. 741.55 s [vector] +++ OK, passed 100 tests.
  9153. 741.55 s [vector] unfoldrExactN: OK
  9154. 741.55 s [vector] +++ OK, passed 100 tests.
  9155. 741.55 s [vector] unfoldrM: OK
  9156. 741.55 s [vector] +++ OK, passed 100 tests.
  9157. 741.55 s [vector] unfoldrNM: OK
  9158. 741.55 s [vector] +++ OK, passed 100 tests.
  9159. 741.58 s [vector] unfoldrExactNM: OK (0.03s)
  9160. 741.58 s [vector] +++ OK, passed 100 tests.
  9161. 741.59 s [vector] constructN: OK
  9162. 741.59 s [vector] +++ OK, passed 100 tests.
  9163. 741.59 s [vector] constructrN: OK
  9164. 741.59 s [vector] +++ OK, passed 100 tests.
  9165. 741.59 s [vector] cons: OK
  9166. 741.59 s [vector] +++ OK, passed 100 tests.
  9167. 741.59 s [vector] snoc: OK
  9168. 741.59 s [vector] +++ OK, passed 100 tests.
  9169. 741.59 s [vector] append: OK
  9170. 741.59 s [vector] +++ OK, passed 100 tests.
  9171. 741.61 s [vector] concat: OK
  9172. 741.61 s [vector] +++ OK, passed 100 tests.
  9173. 741.61 s [vector] force: OK
  9174. 741.61 s [vector] +++ OK, passed 100 tests.
  9175. 741.62 s [vector] upd: OK
  9176. 741.62 s [vector] +++ OK, passed 100 tests.
  9177. 741.62 s [vector] accum: OK
  9178. 741.62 s [vector] +++ OK, passed 100 tests.
  9179. 741.62 s [vector] reverse: OK
  9180. 741.62 s [vector] +++ OK, passed 100 tests.
  9181. 741.62 s [vector] backpermute: OK
  9182. 741.62 s [vector] +++ OK, passed 100 tests.
  9183. 741.62 s [vector] map: OK
  9184. 741.62 s [vector] +++ OK, passed 100 tests.
  9185. 741.62 s [vector] imap: OK
  9186. 741.62 s [vector] +++ OK, passed 100 tests.
  9187. 741.62 s [vector] concatMap: OK
  9188. 741.62 s [vector] +++ OK, passed 100 tests.
  9189. 741.63 s [vector] mapM: OK
  9190. 741.63 s [vector] +++ OK, passed 100 tests.
  9191. 741.64 s [vector] mapM_: OK (0.02s)
  9192. 741.64 s [vector] +++ OK, passed 100 tests.
  9193. 741.64 s [vector] forM: OK
  9194. 741.64 s [vector] +++ OK, passed 100 tests.
  9195. 741.65 s [vector] forM_: OK
  9196. 741.66 s [vector] +++ OK, passed 100 tests.
  9197. 741.66 s [vector] imapM: OK
  9198. 741.66 s [vector] +++ OK, passed 100 tests.
  9199. 741.67 s [vector] imapM_: OK
  9200. 741.67 s [vector] +++ OK, passed 100 tests.
  9201. 741.67 s [vector] zipWith: OK
  9202. 741.67 s [vector] +++ OK, passed 100 tests.
  9203. 741.67 s [vector] zipWith3: OK
  9204. 741.68 s [vector] +++ OK, passed 100 tests.
  9205. 741.68 s [vector] izipWith: OK
  9206. 741.68 s [vector] +++ OK, passed 100 tests.
  9207. 741.68 s [vector] izipWith3: OK
  9208. 741.68 s [vector] +++ OK, passed 100 tests.
  9209. 741.68 s [vector] izipWithM: OK
  9210. 741.68 s [vector] +++ OK, passed 100 tests.
  9211. 741.69 s [vector] izipWithM_: OK
  9212. 741.69 s [vector] +++ OK, passed 100 tests.
  9213. 741.70 s [vector] zipWithM: OK
  9214. 741.70 s [vector] +++ OK, passed 100 tests.
  9215. 741.70 s [vector] zipWithM_: OK (0.01s)
  9216. 741.70 s [vector] +++ OK, passed 100 tests.
  9217. 741.70 s [vector] filter: OK
  9218. 741.70 s [vector] +++ OK, passed 100 tests.
  9219. 741.71 s [vector] ifilter: OK
  9220. 741.71 s [vector] +++ OK, passed 100 tests.
  9221. 741.74 s [vector] filterM: OK (0.03s)
  9222. 741.74 s [vector] +++ OK, passed 100 tests.
  9223. 741.75 s [vector] uniq: OK
  9224. 741.76 s [vector] +++ OK, passed 100 tests.
  9225. 741.76 s [vector] mapMaybe: OK
  9226. 741.76 s [vector] +++ OK, passed 100 tests.
  9227. 741.76 s [vector] imapMaybe: OK
  9228. 741.76 s [vector] +++ OK, passed 100 tests.
  9229. 741.76 s [vector] takeWhile: OK
  9230. 741.76 s [vector] +++ OK, passed 100 tests.
  9231. 741.76 s [vector] dropWhile: OK
  9232. 741.76 s [vector] +++ OK, passed 100 tests.
  9233. 741.76 s [vector] partition: OK
  9234. 741.76 s [vector] +++ OK, passed 100 tests.
  9235. 741.76 s [vector] partitionWith: OK
  9236. 741.76 s [vector] +++ OK, passed 100 tests.
  9237. 741.76 s [vector] span: OK
  9238. 741.76 s [vector] +++ OK, passed 100 tests.
  9239. 741.76 s [vector] break: OK
  9240. 741.76 s [vector] +++ OK, passed 100 tests.
  9241. 741.77 s [vector] spanR: OK
  9242. 741.77 s [vector] +++ OK, passed 100 tests.
  9243. 741.77 s [vector] breakR: OK
  9244. 741.77 s [vector] +++ OK, passed 100 tests.
  9245. 741.77 s [vector] groupBy: OK
  9246. 741.77 s [vector] +++ OK, passed 100 tests.
  9247. 741.77 s [vector] elem: OK
  9248. 741.77 s [vector] +++ OK, passed 100 tests.
  9249. 741.77 s [vector] notElem: OK
  9250. 741.77 s [vector] +++ OK, passed 100 tests.
  9251. 741.77 s [vector] find: OK
  9252. 741.77 s [vector] +++ OK, passed 100 tests.
  9253. 741.77 s [vector] findIndex: OK
  9254. 741.77 s [vector] +++ OK, passed 100 tests.
  9255. 741.77 s [vector] findIndexR: OK
  9256. 741.77 s [vector] +++ OK, passed 100 tests.
  9257. 741.77 s [vector] findIndices: OK
  9258. 741.77 s [vector] +++ OK, passed 100 tests.
  9259. 741.78 s [vector] elemIndex: OK
  9260. 741.78 s [vector] +++ OK, passed 100 tests.
  9261. 741.78 s [vector] elemIndices: OK
  9262. 741.78 s [vector] +++ OK, passed 100 tests.
  9263. 741.78 s [vector] foldl: OK
  9264. 741.78 s [vector] +++ OK, passed 100 tests.
  9265. 741.79 s [vector] foldl1: OK
  9266. 741.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9267. 741.79 s [vector] foldl': OK
  9268. 741.79 s [vector] +++ OK, passed 100 tests.
  9269. 741.79 s [vector] foldl1': OK
  9270. 741.79 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9271. 741.79 s [vector] foldr: OK
  9272. 741.79 s [vector] +++ OK, passed 100 tests.
  9273. 741.79 s [vector] foldr1: OK
  9274. 741.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9275. 741.79 s [vector] foldr': OK
  9276. 741.79 s [vector] +++ OK, passed 100 tests.
  9277. 741.79 s [vector] foldr1': OK
  9278. 741.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9279. 741.79 s [vector] ifoldl: OK
  9280. 741.79 s [vector] +++ OK, passed 100 tests.
  9281. 741.79 s [vector] ifoldl': OK
  9282. 741.79 s [vector] +++ OK, passed 100 tests.
  9283. 741.79 s [vector] ifoldr: OK
  9284. 741.79 s [vector] +++ OK, passed 100 tests.
  9285. 741.80 s [vector] ifoldr': OK
  9286. 741.80 s [vector] +++ OK, passed 100 tests.
  9287. 741.80 s [vector] ifoldM: OK
  9288. 741.80 s [vector] +++ OK, passed 100 tests.
  9289. 741.80 s [vector] ifoldM': OK
  9290. 741.80 s [vector] +++ OK, passed 100 tests.
  9291. 741.82 s [vector] ifoldM_: OK
  9292. 741.82 s [vector] +++ OK, passed 100 tests.
  9293. 741.83 s [vector] ifoldM'_: OK (0.01s)
  9294. 741.83 s [vector] +++ OK, passed 100 tests.
  9295. 741.83 s [vector] all: OK
  9296. 741.83 s [vector] +++ OK, passed 100 tests.
  9297. 741.83 s [vector] any: OK
  9298. 741.83 s [vector] +++ OK, passed 100 tests.
  9299. 741.84 s [vector] prescanl: OK
  9300. 741.84 s [vector] +++ OK, passed 100 tests.
  9301. 741.84 s [vector] prescanl': OK
  9302. 741.84 s [vector] +++ OK, passed 100 tests.
  9303. 741.84 s [vector] postscanl: OK
  9304. 741.84 s [vector] +++ OK, passed 100 tests.
  9305. 741.84 s [vector] postscanl': OK
  9306. 741.84 s [vector] +++ OK, passed 100 tests.
  9307. 741.85 s [vector] scanl: OK
  9308. 741.85 s [vector] +++ OK, passed 100 tests.
  9309. 741.85 s [vector] scanl': OK
  9310. 741.85 s [vector] +++ OK, passed 100 tests.
  9311. 741.85 s [vector] scanl1: OK
  9312. 741.85 s [vector] +++ OK, passed 100 tests.
  9313. 741.86 s [vector] scanl1': OK
  9314. 741.86 s [vector] +++ OK, passed 100 tests.
  9315. 741.86 s [vector] iscanl: OK
  9316. 741.86 s [vector] +++ OK, passed 100 tests.
  9317. 741.86 s [vector] iscanl': OK
  9318. 741.86 s [vector] +++ OK, passed 100 tests.
  9319. 741.86 s [vector] prescanr: OK
  9320. 741.86 s [vector] +++ OK, passed 100 tests.
  9321. 741.87 s [vector] prescanr': OK
  9322. 741.87 s [vector] +++ OK, passed 100 tests.
  9323. 741.87 s [vector] postscanr: OK
  9324. 741.87 s [vector] +++ OK, passed 100 tests.
  9325. 741.87 s [vector] postscanr': OK
  9326. 741.87 s [vector] +++ OK, passed 100 tests.
  9327. 741.88 s [vector] scanr: OK
  9328. 741.88 s [vector] +++ OK, passed 100 tests.
  9329. 741.89 s [vector] scanr': OK
  9330. 741.89 s [vector] +++ OK, passed 100 tests.
  9331. 741.89 s [vector] scanr1: OK
  9332. 741.89 s [vector] +++ OK, passed 100 tests.
  9333. 741.89 s [vector] scanr1': OK
  9334. 741.89 s [vector] +++ OK, passed 100 tests.
  9335. 741.90 s [vector] iscanr: OK
  9336. 741.90 s [vector] +++ OK, passed 100 tests.
  9337. 741.90 s [vector] iscanr': OK
  9338. 741.90 s [vector] +++ OK, passed 100 tests.
  9339. 741.90 s [vector] mut_read: OK
  9340. 741.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9341. 741.90 s [vector] mut_write: OK
  9342. 741.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9343. 741.90 s [vector] mut_modify: OK
  9344. 741.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9345. 741.90 s [vector] mut_generate: OK
  9346. 741.91 s [vector] +++ OK, passed 100 tests.
  9347. 741.91 s [vector] mut_generateM: OK
  9348. 741.91 s [vector] +++ OK, passed 100 tests.
  9349. 741.92 s [vector] mut_mapM_: OK (0.01s)
  9350. 741.92 s [vector] +++ OK, passed 100 tests.
  9351. 741.95 s [vector] mut_imapM_: OK
  9352. 741.95 s [vector] +++ OK, passed 100 tests.
  9353. 741.95 s [vector] mut_forM_: OK (0.01s)
  9354. 741.95 s [vector] +++ OK, passed 100 tests.
  9355. 741.96 s [vector] mut_iforM_: OK (0.01s)
  9356. 741.96 s [vector] +++ OK, passed 100 tests.
  9357. 741.96 s [vector] mut_foldr: OK
  9358. 741.96 s [vector] +++ OK, passed 100 tests.
  9359. 741.97 s [vector] mut_foldr': OK
  9360. 741.97 s [vector] +++ OK, passed 100 tests.
  9361. 741.97 s [vector] mut_foldl: OK
  9362. 741.97 s [vector] +++ OK, passed 100 tests.
  9363. 741.97 s [vector] mut_foldl': OK
  9364. 741.97 s [vector] +++ OK, passed 100 tests.
  9365. 741.97 s [vector] mut_ifoldr: OK
  9366. 741.97 s [vector] +++ OK, passed 100 tests.
  9367. 741.98 s [vector] mut_ifoldr': OK
  9368. 741.98 s [vector] +++ OK, passed 100 tests.
  9369. 741.98 s [vector] mut_ifoldl: OK
  9370. 741.98 s [vector] +++ OK, passed 100 tests.
  9371. 741.98 s [vector] mut_ifoldl': OK
  9372. 741.98 s [vector] +++ OK, passed 100 tests.
  9373. 741.98 s [vector] mut_foldM: OK
  9374. 741.98 s [vector] +++ OK, passed 100 tests.
  9375. 741.98 s [vector] mut_foldM': OK
  9376. 741.98 s [vector] +++ OK, passed 100 tests.
  9377. 741.99 s [vector] mut_foldrM: OK
  9378. 741.99 s [vector] +++ OK, passed 100 tests.
  9379. 741.99 s [vector] mut_foldrM': OK
  9380. 741.99 s [vector] +++ OK, passed 100 tests.
  9381. 741.99 s [vector] mut_ifoldM: OK
  9382. 741.99 s [vector] +++ OK, passed 100 tests.
  9383. 741.99 s [vector] mut_ifoldM': OK
  9384. 741.99 s [vector] +++ OK, passed 100 tests.
  9385. 741.99 s [vector] mut_ifoldrM: OK
  9386. 741.99 s [vector] +++ OK, passed 100 tests.
  9387. 742.00 s [vector] mut_ifoldrM': OK
  9388. 742.00 s [vector] +++ OK, passed 100 tests.
  9389. 742.00 s [vector] compare: OK
  9390. 742.00 s [vector] +++ OK, passed 100 tests.
  9391. 742.00 s [vector] maximum: OK
  9392. 742.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9393. 742.00 s [vector] minimum: OK
  9394. 742.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9395. 742.00 s [vector] minIndex: OK
  9396. 742.00 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9397. 742.00 s [vector] maxIndex: OK
  9398. 742.00 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9399. 742.00 s [vector] maximumBy: OK
  9400. 742.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9401. 742.00 s [vector] minimumBy: OK
  9402. 742.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9403. 742.00 s [vector] maximumOn: OK
  9404. 742.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9405. 742.00 s [vector] minimumOn: OK
  9406. 742.00 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9407. 742.00 s [vector] maxIndexBy: OK
  9408. 742.00 s [vector] +++ OK, passed 100 tests; 25 discarded.
  9409. 742.00 s [vector] minIndexBy: OK
  9410. 742.00 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9411. 742.00 s [vector] ListFirstMaxIndexWins: OK
  9412. 742.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9413. 742.00 s [vector] FalseListFirstMaxIndexWins: OK
  9414. 742.01 s [vector] +++ OK, failed as expected. (after 1 test):
  9415. 742.01 s [vector] Exception:
  9416. 742.01 s [vector] Prelude.foldr1: empty list
  9417. 742.01 s [vector] CallStack (from HasCallStack):
  9418. 742.01 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  9419. 742.01 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  9420. 742.01 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9421. 742.01 s [vector] []
  9422. 742.01 s [vector] zip: OK
  9423. 742.01 s [vector] +++ OK, passed 100 tests.
  9424. 742.01 s [vector] zip3: OK
  9425. 742.01 s [vector] +++ OK, passed 100 tests.
  9426. 742.01 s [vector] unzip: OK
  9427. 742.01 s [vector] +++ OK, passed 100 tests.
  9428. 742.01 s [vector] unzip3: OK
  9429. 742.01 s [vector] +++ OK, passed 100 tests.
  9430. 742.02 s [vector] indexed: OK
  9431. 742.02 s [vector] +++ OK, passed 100 tests.
  9432. 742.02 s [vector] update: OK
  9433. 742.02 s [vector] +++ OK, passed 100 tests.
  9434. 742.02 s [vector] mempty: OK
  9435. 742.02 s [vector] +++ OK, passed 100 tests.
  9436. 742.04 s [vector] mappend: OK
  9437. 742.04 s [vector] +++ OK, passed 100 tests.
  9438. 742.05 s [vector] mconcat: OK (0.02s)
  9439. 742.05 s [vector] +++ OK, passed 100 tests.
  9440. 742.05 s [vector] glength: OK (0.01s)
  9441. 742.05 s [vector] +++ OK, passed 100 tests.
  9442. 742.05 s [vector] and: OK
  9443. 742.05 s [vector] +++ OK, passed 100 tests.
  9444. 742.05 s [vector] or: OK
  9445. 742.05 s [vector] +++ OK, passed 100 tests.
  9446. 742.05 s [vector] (Int)
  9447. 742.05 s [vector] fromList.toList == id: OK
  9448. 742.05 s [vector] +++ OK, passed 100 tests.
  9449. 742.05 s [vector] toList.fromList == id: OK
  9450. 742.05 s [vector] +++ OK, passed 100 tests.
  9451. 742.05 s [vector] unstream.stream == id: OK
  9452. 742.05 s [vector] +++ OK, passed 100 tests.
  9453. 742.05 s [vector] stream.unstream == id: OK
  9454. 742.06 s [vector] +++ OK, passed 100 tests.
  9455. 742.06 s [vector] eq: OK
  9456. 742.06 s [vector] +++ OK, passed 100 tests.
  9457. 742.06 s [vector] length: OK
  9458. 742.06 s [vector] +++ OK, passed 100 tests.
  9459. 742.06 s [vector] null: OK
  9460. 742.06 s [vector] +++ OK, passed 100 tests.
  9461. 742.06 s [vector] index: OK
  9462. 742.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9463. 742.06 s [vector] safeIndex: OK
  9464. 742.06 s [vector] +++ OK, passed 100 tests.
  9465. 742.06 s [vector] head: OK
  9466. 742.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9467. 742.06 s [vector] last: OK
  9468. 742.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9469. 742.06 s [vector] unsafeIndex: OK
  9470. 742.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9471. 742.06 s [vector] unsafeHead: OK
  9472. 742.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9473. 742.06 s [vector] unsafeLast: OK
  9474. 742.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9475. 742.06 s [vector] slice: OK
  9476. 742.06 s [vector] +++ OK, passed 100 tests.
  9477. 742.06 s [vector] init: OK
  9478. 742.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9479. 742.06 s [vector] tail: OK
  9480. 742.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9481. 742.06 s [vector] take: OK
  9482. 742.06 s [vector] +++ OK, passed 100 tests.
  9483. 742.06 s [vector] drop: OK
  9484. 742.06 s [vector] +++ OK, passed 100 tests.
  9485. 742.06 s [vector] splitAt: OK
  9486. 742.06 s [vector] +++ OK, passed 100 tests.
  9487. 742.06 s [vector] empty: OK
  9488. 742.06 s [vector] +++ OK, passed 100 tests.
  9489. 742.06 s [vector] singleton: OK
  9490. 742.06 s [vector] +++ OK, passed 100 tests.
  9491. 742.07 s [vector] replicate: OK
  9492. 742.07 s [vector] +++ OK, passed 100 tests.
  9493. 742.07 s [vector] generate: OK
  9494. 742.07 s [vector] +++ OK, passed 100 tests.
  9495. 742.07 s [vector] iterateN: OK
  9496. 742.07 s [vector] +++ OK, passed 100 tests.
  9497. 742.11 s [vector] iterateNM: OK (0.03s)
  9498. 742.11 s [vector] +++ OK, passed 100 tests.
  9499. 742.12 s [vector] generateM: OK (0.02s)
  9500. 742.12 s [vector] +++ OK, passed 100 tests.
  9501. 742.13 s [vector] replicateM: OK
  9502. 742.13 s [vector] +++ OK, passed 100 tests.
  9503. 742.13 s [vector] create: OK
  9504. 742.13 s [vector] +++ OK, passed 100 tests.
  9505. 742.13 s [vector] createT: OK
  9506. 742.13 s [vector] +++ OK, passed 100 tests.
  9507. 742.13 s [vector] unfoldr: OK
  9508. 742.13 s [vector] +++ OK, passed 100 tests.
  9509. 742.13 s [vector] unfoldrN: OK
  9510. 742.13 s [vector] +++ OK, passed 100 tests.
  9511. 742.13 s [vector] unfoldrExactN: OK
  9512. 742.13 s [vector] +++ OK, passed 100 tests.
  9513. 742.13 s [vector] unfoldrM: OK
  9514. 742.13 s [vector] +++ OK, passed 100 tests.
  9515. 742.13 s [vector] unfoldrNM: OK
  9516. 742.13 s [vector] +++ OK, passed 100 tests.
  9517. 742.17 s [vector] unfoldrExactNM: OK (0.02s)
  9518. 742.17 s [vector] +++ OK, passed 100 tests.
  9519. 742.18 s [vector] constructN: OK
  9520. 742.18 s [vector] +++ OK, passed 100 tests.
  9521. 742.18 s [vector] constructrN: OK
  9522. 742.18 s [vector] +++ OK, passed 100 tests.
  9523. 742.18 s [vector] cons: OK
  9524. 742.18 s [vector] +++ OK, passed 100 tests.
  9525. 742.18 s [vector] snoc: OK
  9526. 742.18 s [vector] +++ OK, passed 100 tests.
  9527. 742.19 s [vector] append: OK
  9528. 742.19 s [vector] +++ OK, passed 100 tests.
  9529. 742.20 s [vector] concat: OK (0.01s)
  9530. 742.20 s [vector] +++ OK, passed 100 tests.
  9531. 742.20 s [vector] force: OK
  9532. 742.20 s [vector] +++ OK, passed 100 tests.
  9533. 742.21 s [vector] upd: OK
  9534. 742.21 s [vector] +++ OK, passed 100 tests.
  9535. 742.21 s [vector] accum: OK
  9536. 742.21 s [vector] +++ OK, passed 100 tests.
  9537. 742.21 s [vector] reverse: OK
  9538. 742.21 s [vector] +++ OK, passed 100 tests.
  9539. 742.21 s [vector] backpermute: OK
  9540. 742.21 s [vector] +++ OK, passed 100 tests.
  9541. 742.21 s [vector] map: OK
  9542. 742.21 s [vector] +++ OK, passed 100 tests.
  9543. 742.22 s [vector] imap: OK
  9544. 742.22 s [vector] +++ OK, passed 100 tests.
  9545. 742.22 s [vector] concatMap: OK
  9546. 742.22 s [vector] +++ OK, passed 100 tests.
  9547. 742.22 s [vector] mapM: OK
  9548. 742.22 s [vector] +++ OK, passed 100 tests.
  9549. 742.24 s [vector] mapM_: OK
  9550. 742.24 s [vector] +++ OK, passed 100 tests.
  9551. 742.24 s [vector] forM: OK
  9552. 742.24 s [vector] +++ OK, passed 100 tests.
  9553. 742.26 s [vector] forM_: OK (0.02s)
  9554. 742.27 s [vector] +++ OK, passed 100 tests.
  9555. 742.27 s [vector] imapM: OK
  9556. 742.27 s [vector] +++ OK, passed 100 tests.
  9557. 742.28 s [vector] imapM_: OK (0.02s)
  9558. 742.28 s [vector] +++ OK, passed 100 tests.
  9559. 742.28 s [vector] zipWith: OK
  9560. 742.29 s [vector] +++ OK, passed 100 tests.
  9561. 742.29 s [vector] zipWith3: OK
  9562. 742.29 s [vector] +++ OK, passed 100 tests.
  9563. 742.29 s [vector] izipWith: OK
  9564. 742.29 s [vector] +++ OK, passed 100 tests.
  9565. 742.29 s [vector] izipWith3: OK
  9566. 742.29 s [vector] +++ OK, passed 100 tests.
  9567. 742.29 s [vector] izipWithM: OK
  9568. 742.29 s [vector] +++ OK, passed 100 tests.
  9569. 742.32 s [vector] izipWithM_: OK
  9570. 742.32 s [vector] +++ OK, passed 100 tests.
  9571. 742.33 s [vector] zipWithM: OK (0.01s)
  9572. 742.33 s [vector] +++ OK, passed 100 tests.
  9573. 742.34 s [vector] zipWithM_: OK (0.02s)
  9574. 742.34 s [vector] +++ OK, passed 100 tests.
  9575. 742.34 s [vector] filter: OK
  9576. 742.34 s [vector] +++ OK, passed 100 tests.
  9577. 742.35 s [vector] ifilter: OK
  9578. 742.35 s [vector] +++ OK, passed 100 tests.
  9579. 742.37 s [vector] filterM: OK (0.03s)
  9580. 742.37 s [vector] +++ OK, passed 100 tests.
  9581. 742.37 s [vector] uniq: OK
  9582. 742.37 s [vector] +++ OK, passed 100 tests.
  9583. 742.37 s [vector] mapMaybe: OK
  9584. 742.37 s [vector] +++ OK, passed 100 tests.
  9585. 742.38 s [vector] imapMaybe: OK
  9586. 742.38 s [vector] +++ OK, passed 100 tests.
  9587. 742.38 s [vector] takeWhile: OK
  9588. 742.38 s [vector] +++ OK, passed 100 tests.
  9589. 742.38 s [vector] dropWhile: OK
  9590. 742.38 s [vector] +++ OK, passed 100 tests.
  9591. 742.39 s [vector] partition: OK
  9592. 742.39 s [vector] +++ OK, passed 100 tests.
  9593. 742.39 s [vector] partitionWith: OK
  9594. 742.39 s [vector] +++ OK, passed 100 tests.
  9595. 742.39 s [vector] span: OK
  9596. 742.39 s [vector] +++ OK, passed 100 tests.
  9597. 742.39 s [vector] break: OK
  9598. 742.39 s [vector] +++ OK, passed 100 tests.
  9599. 742.39 s [vector] spanR: OK
  9600. 742.39 s [vector] +++ OK, passed 100 tests.
  9601. 742.39 s [vector] breakR: OK
  9602. 742.39 s [vector] +++ OK, passed 100 tests.
  9603. 742.39 s [vector] groupBy: OK
  9604. 742.39 s [vector] +++ OK, passed 100 tests.
  9605. 742.39 s [vector] elem: OK
  9606. 742.39 s [vector] +++ OK, passed 100 tests.
  9607. 742.39 s [vector] notElem: OK
  9608. 742.39 s [vector] +++ OK, passed 100 tests.
  9609. 742.39 s [vector] find: OK
  9610. 742.39 s [vector] +++ OK, passed 100 tests.
  9611. 742.39 s [vector] findIndex: OK
  9612. 742.40 s [vector] +++ OK, passed 100 tests.
  9613. 742.40 s [vector] findIndexR: OK
  9614. 742.40 s [vector] +++ OK, passed 100 tests.
  9615. 742.40 s [vector] findIndices: OK
  9616. 742.40 s [vector] +++ OK, passed 100 tests.
  9617. 742.40 s [vector] elemIndex: OK
  9618. 742.40 s [vector] +++ OK, passed 100 tests.
  9619. 742.40 s [vector] elemIndices: OK
  9620. 742.40 s [vector] +++ OK, passed 100 tests.
  9621. 742.41 s [vector] foldl: OK
  9622. 742.41 s [vector] +++ OK, passed 100 tests.
  9623. 742.41 s [vector] foldl1: OK
  9624. 742.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9625. 742.41 s [vector] foldl': OK
  9626. 742.41 s [vector] +++ OK, passed 100 tests.
  9627. 742.42 s [vector] foldl1': OK
  9628. 742.42 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9629. 742.42 s [vector] foldr: OK
  9630. 742.42 s [vector] +++ OK, passed 100 tests.
  9631. 742.42 s [vector] foldr1: OK
  9632. 742.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9633. 742.42 s [vector] foldr': OK
  9634. 742.42 s [vector] +++ OK, passed 100 tests.
  9635. 742.43 s [vector] foldr1': OK
  9636. 742.43 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9637. 742.43 s [vector] ifoldl: OK
  9638. 742.43 s [vector] +++ OK, passed 100 tests.
  9639. 742.44 s [vector] ifoldl': OK
  9640. 742.44 s [vector] +++ OK, passed 100 tests.
  9641. 742.44 s [vector] ifoldr: OK
  9642. 742.44 s [vector] +++ OK, passed 100 tests.
  9643. 742.45 s [vector] ifoldr': OK
  9644. 742.45 s [vector] +++ OK, passed 100 tests.
  9645. 742.45 s [vector] ifoldM: OK
  9646. 742.45 s [vector] +++ OK, passed 100 tests.
  9647. 742.47 s [vector] ifoldM': OK
  9648. 742.47 s [vector] +++ OK, passed 100 tests.
  9649. 742.49 s [vector] ifoldM_: OK (0.02s)
  9650. 742.49 s [vector] +++ OK, passed 100 tests.
  9651. 742.49 s [vector] ifoldM'_: OK (0.02s)
  9652. 742.49 s [vector] +++ OK, passed 100 tests.
  9653. 742.49 s [vector] all: OK
  9654. 742.49 s [vector] +++ OK, passed 100 tests.
  9655. 742.50 s [vector] any: OK
  9656. 742.50 s [vector] +++ OK, passed 100 tests.
  9657. 742.50 s [vector] prescanl: OK
  9658. 742.50 s [vector] +++ OK, passed 100 tests.
  9659. 742.50 s [vector] prescanl': OK
  9660. 742.50 s [vector] +++ OK, passed 100 tests.
  9661. 742.50 s [vector] postscanl: OK
  9662. 742.50 s [vector] +++ OK, passed 100 tests.
  9663. 742.51 s [vector] postscanl': OK
  9664. 742.51 s [vector] +++ OK, passed 100 tests.
  9665. 742.51 s [vector] scanl: OK
  9666. 742.51 s [vector] +++ OK, passed 100 tests.
  9667. 742.51 s [vector] scanl': OK
  9668. 742.51 s [vector] +++ OK, passed 100 tests.
  9669. 742.51 s [vector] scanl1: OK
  9670. 742.51 s [vector] +++ OK, passed 100 tests.
  9671. 742.51 s [vector] scanl1': OK
  9672. 742.51 s [vector] +++ OK, passed 100 tests.
  9673. 742.52 s [vector] iscanl: OK
  9674. 742.52 s [vector] +++ OK, passed 100 tests.
  9675. 742.52 s [vector] iscanl': OK
  9676. 742.52 s [vector] +++ OK, passed 100 tests.
  9677. 742.53 s [vector] prescanr: OK
  9678. 742.53 s [vector] +++ OK, passed 100 tests.
  9679. 742.53 s [vector] prescanr': OK
  9680. 742.53 s [vector] +++ OK, passed 100 tests.
  9681. 742.53 s [vector] postscanr: OK
  9682. 742.53 s [vector] +++ OK, passed 100 tests.
  9683. 742.53 s [vector] postscanr': OK
  9684. 742.53 s [vector] +++ OK, passed 100 tests.
  9685. 742.54 s [vector] scanr: OK
  9686. 742.54 s [vector] +++ OK, passed 100 tests.
  9687. 742.54 s [vector] scanr': OK
  9688. 742.54 s [vector] +++ OK, passed 100 tests.
  9689. 742.54 s [vector] scanr1: OK
  9690. 742.54 s [vector] +++ OK, passed 100 tests.
  9691. 742.54 s [vector] scanr1': OK
  9692. 742.55 s [vector] +++ OK, passed 100 tests.
  9693. 742.55 s [vector] iscanr: OK
  9694. 742.55 s [vector] +++ OK, passed 100 tests.
  9695. 742.55 s [vector] iscanr': OK
  9696. 742.55 s [vector] +++ OK, passed 100 tests.
  9697. 742.55 s [vector] mut_read: OK
  9698. 742.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9699. 742.55 s [vector] mut_write: OK
  9700. 742.55 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9701. 742.55 s [vector] mut_modify: OK
  9702. 742.55 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9703. 742.56 s [vector] mut_generate: OK
  9704. 742.56 s [vector] +++ OK, passed 100 tests.
  9705. 742.56 s [vector] mut_generateM: OK
  9706. 742.56 s [vector] +++ OK, passed 100 tests.
  9707. 742.59 s [vector] mut_mapM_: OK (0.01s)
  9708. 742.59 s [vector] +++ OK, passed 100 tests.
  9709. 742.61 s [vector] mut_imapM_: OK (0.02s)
  9710. 742.61 s [vector] +++ OK, passed 100 tests.
  9711. 742.61 s [vector] mut_forM_: OK (0.01s)
  9712. 742.61 s [vector] +++ OK, passed 100 tests.
  9713. 742.63 s [vector] mut_iforM_: OK (0.02s)
  9714. 742.63 s [vector] +++ OK, passed 100 tests.
  9715. 742.63 s [vector] mut_foldr: OK
  9716. 742.63 s [vector] +++ OK, passed 100 tests.
  9717. 742.63 s [vector] mut_foldr': OK
  9718. 742.63 s [vector] +++ OK, passed 100 tests.
  9719. 742.65 s [vector] mut_foldl: OK
  9720. 742.65 s [vector] +++ OK, passed 100 tests.
  9721. 742.65 s [vector] mut_foldl': OK
  9722. 742.65 s [vector] +++ OK, passed 100 tests.
  9723. 742.65 s [vector] mut_ifoldr: OK
  9724. 742.66 s [vector] +++ OK, passed 100 tests.
  9725. 742.66 s [vector] mut_ifoldr': OK
  9726. 742.66 s [vector] +++ OK, passed 100 tests.
  9727. 742.66 s [vector] mut_ifoldl: OK
  9728. 742.66 s [vector] +++ OK, passed 100 tests.
  9729. 742.66 s [vector] mut_ifoldl': OK
  9730. 742.66 s [vector] +++ OK, passed 100 tests.
  9731. 742.67 s [vector] mut_foldM: OK
  9732. 742.67 s [vector] +++ OK, passed 100 tests.
  9733. 742.67 s [vector] mut_foldM': OK
  9734. 742.68 s [vector] +++ OK, passed 100 tests.
  9735. 742.68 s [vector] mut_foldrM: OK
  9736. 742.69 s [vector] +++ OK, passed 100 tests.
  9737. 742.69 s [vector] mut_foldrM': OK
  9738. 742.69 s [vector] +++ OK, passed 100 tests.
  9739. 742.69 s [vector] mut_ifoldM: OK
  9740. 742.70 s [vector] +++ OK, passed 100 tests.
  9741. 742.70 s [vector] mut_ifoldM': OK
  9742. 742.70 s [vector] +++ OK, passed 100 tests.
  9743. 742.70 s [vector] mut_ifoldrM: OK
  9744. 742.70 s [vector] +++ OK, passed 100 tests.
  9745. 742.70 s [vector] mut_ifoldrM': OK
  9746. 742.70 s [vector] +++ OK, passed 100 tests.
  9747. 742.70 s [vector] compare: OK
  9748. 742.70 s [vector] +++ OK, passed 100 tests.
  9749. 742.70 s [vector] maximum: OK
  9750. 742.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9751. 742.70 s [vector] minimum: OK
  9752. 742.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9753. 742.70 s [vector] minIndex: OK
  9754. 742.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9755. 742.70 s [vector] maxIndex: OK
  9756. 742.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9757. 742.70 s [vector] maximumBy: OK
  9758. 742.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9759. 742.70 s [vector] minimumBy: OK
  9760. 742.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9761. 742.70 s [vector] maximumOn: OK
  9762. 742.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9763. 742.71 s [vector] minimumOn: OK
  9764. 742.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9765. 742.71 s [vector] maxIndexBy: OK
  9766. 742.71 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9767. 742.71 s [vector] minIndexBy: OK
  9768. 742.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9769. 742.71 s [vector] ListFirstMaxIndexWins: OK
  9770. 742.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9771. 742.71 s [vector] FalseListFirstMaxIndexWins: OK
  9772. 742.71 s [vector] +++ OK, failed as expected. (after 1 test):
  9773. 742.71 s [vector] Exception:
  9774. 742.71 s [vector] Prelude.foldr1: empty list
  9775. 742.71 s [vector] CallStack (from HasCallStack):
  9776. 742.71 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  9777. 742.71 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  9778. 742.71 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9779. 742.71 s [vector] []
  9780. 742.71 s [vector] zip: OK
  9781. 742.71 s [vector] +++ OK, passed 100 tests.
  9782. 742.71 s [vector] zip3: OK
  9783. 742.71 s [vector] +++ OK, passed 100 tests.
  9784. 742.71 s [vector] unzip: OK
  9785. 742.71 s [vector] +++ OK, passed 100 tests.
  9786. 742.72 s [vector] unzip3: OK
  9787. 742.72 s [vector] +++ OK, passed 100 tests.
  9788. 742.72 s [vector] indexed: OK
  9789. 742.72 s [vector] +++ OK, passed 100 tests.
  9790. 742.72 s [vector] update: OK
  9791. 742.72 s [vector] +++ OK, passed 100 tests.
  9792. 742.72 s [vector] mempty: OK
  9793. 742.72 s [vector] +++ OK, passed 100 tests.
  9794. 742.72 s [vector] mappend: OK
  9795. 742.73 s [vector] +++ OK, passed 100 tests.
  9796. 742.73 s [vector] mconcat: OK (0.01s)
  9797. 742.73 s [vector] +++ OK, passed 100 tests.
  9798. 742.73 s [vector] glength: OK
  9799. 742.73 s [vector] +++ OK, passed 100 tests.
  9800. 742.74 s [vector] sum: OK
  9801. 742.74 s [vector] +++ OK, passed 100 tests.
  9802. 742.74 s [vector] product: OK
  9803. 742.74 s [vector] +++ OK, passed 100 tests.
  9804. 742.74 s [vector] enumFromN: OK
  9805. 742.74 s [vector] +++ OK, passed 100 tests.
  9806. 742.74 s [vector] enumFromThenN: OK
  9807. 742.74 s [vector] +++ OK, passed 100 tests.
  9808. 742.74 s [vector] enumFromTo: OK
  9809. 742.74 s [vector] +++ OK, passed 100 tests.
  9810. 742.74 s [vector] enumFromThenTo: OK
  9811. 742.74 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9812. 742.74 s [vector] (Float)
  9813. 742.74 s [vector] fromList.toList == id: OK
  9814. 742.74 s [vector] +++ OK, passed 100 tests.
  9815. 742.74 s [vector] toList.fromList == id: OK
  9816. 742.74 s [vector] +++ OK, passed 100 tests.
  9817. 742.74 s [vector] unstream.stream == id: OK
  9818. 742.74 s [vector] +++ OK, passed 100 tests.
  9819. 742.74 s [vector] stream.unstream == id: OK
  9820. 742.74 s [vector] +++ OK, passed 100 tests.
  9821. 742.74 s [vector] eq: OK
  9822. 742.74 s [vector] +++ OK, passed 100 tests.
  9823. 742.74 s [vector] length: OK
  9824. 742.74 s [vector] +++ OK, passed 100 tests.
  9825. 742.74 s [vector] null: OK
  9826. 742.74 s [vector] +++ OK, passed 100 tests.
  9827. 742.75 s [vector] index: OK
  9828. 742.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9829. 742.75 s [vector] safeIndex: OK
  9830. 742.75 s [vector] +++ OK, passed 100 tests.
  9831. 742.75 s [vector] head: OK
  9832. 742.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9833. 742.75 s [vector] last: OK
  9834. 742.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9835. 742.75 s [vector] unsafeIndex: OK
  9836. 742.75 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9837. 742.75 s [vector] unsafeHead: OK
  9838. 742.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9839. 742.75 s [vector] unsafeLast: OK
  9840. 742.75 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9841. 742.75 s [vector] slice: OK
  9842. 742.75 s [vector] +++ OK, passed 100 tests.
  9843. 742.75 s [vector] init: OK
  9844. 742.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9845. 742.75 s [vector] tail: OK
  9846. 742.75 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9847. 742.75 s [vector] take: OK
  9848. 742.75 s [vector] +++ OK, passed 100 tests.
  9849. 742.76 s [vector] drop: OK
  9850. 742.76 s [vector] +++ OK, passed 100 tests.
  9851. 742.76 s [vector] splitAt: OK
  9852. 742.76 s [vector] +++ OK, passed 100 tests.
  9853. 742.76 s [vector] empty: OK
  9854. 742.76 s [vector] +++ OK, passed 100 tests.
  9855. 742.76 s [vector] singleton: OK
  9856. 742.76 s [vector] +++ OK, passed 100 tests.
  9857. 742.76 s [vector] replicate: OK
  9858. 742.76 s [vector] +++ OK, passed 100 tests.
  9859. 742.76 s [vector] generate: OK
  9860. 742.76 s [vector] +++ OK, passed 100 tests.
  9861. 742.76 s [vector] iterateN: OK
  9862. 742.77 s [vector] +++ OK, passed 100 tests.
  9863. 742.81 s [vector] iterateNM: OK (0.05s)
  9864. 742.81 s [vector] +++ OK, passed 100 tests.
  9865. 742.83 s [vector] generateM: OK (0.02s)
  9866. 742.83 s [vector] +++ OK, passed 100 tests.
  9867. 742.84 s [vector] replicateM: OK
  9868. 742.84 s [vector] +++ OK, passed 100 tests.
  9869. 742.84 s [vector] create: OK
  9870. 742.84 s [vector] +++ OK, passed 100 tests.
  9871. 742.84 s [vector] createT: OK
  9872. 742.84 s [vector] +++ OK, passed 100 tests.
  9873. 742.84 s [vector] unfoldr: OK
  9874. 742.84 s [vector] +++ OK, passed 100 tests.
  9875. 742.84 s [vector] unfoldrN: OK
  9876. 742.84 s [vector] +++ OK, passed 100 tests.
  9877. 742.84 s [vector] unfoldrExactN: OK
  9878. 742.84 s [vector] +++ OK, passed 100 tests.
  9879. 742.84 s [vector] unfoldrM: OK
  9880. 742.84 s [vector] +++ OK, passed 100 tests.
  9881. 742.85 s [vector] unfoldrNM: OK
  9882. 742.85 s [vector] +++ OK, passed 100 tests.
  9883. 742.93 s [vector] unfoldrExactNM: OK (0.07s)
  9884. 742.93 s [vector] +++ OK, passed 100 tests.
  9885. 742.93 s [vector] constructN: OK (0.01s)
  9886. 742.93 s [vector] +++ OK, passed 100 tests.
  9887. 742.94 s [vector] constructrN: OK
  9888. 742.94 s [vector] +++ OK, passed 100 tests.
  9889. 742.94 s [vector] cons: OK
  9890. 742.94 s [vector] +++ OK, passed 100 tests.
  9891. 742.94 s [vector] snoc: OK
  9892. 742.94 s [vector] +++ OK, passed 100 tests.
  9893. 742.95 s [vector] append: OK
  9894. 742.95 s [vector] +++ OK, passed 100 tests.
  9895. 742.97 s [vector] concat: OK (0.02s)
  9896. 742.97 s [vector] +++ OK, passed 100 tests.
  9897. 742.97 s [vector] force: OK
  9898. 742.99 s [vector] +++ OK, passed 100 tests.
  9899. 742.99 s [vector] upd: OK
  9900. 742.99 s [vector] +++ OK, passed 100 tests.
  9901. 742.99 s [vector] accum: OK (0.02s)
  9902. 742.99 s [vector] +++ OK, passed 100 tests.
  9903. 742.99 s [vector] reverse: OK
  9904. 742.99 s [vector] +++ OK, passed 100 tests.
  9905. 743.00 s [vector] backpermute: OK
  9906. 743.00 s [vector] +++ OK, passed 100 tests.
  9907. 743.01 s [vector] map: OK
  9908. 743.01 s [vector] +++ OK, passed 100 tests.
  9909. 743.01 s [vector] imap: OK (0.01s)
  9910. 743.01 s [vector] +++ OK, passed 100 tests.
  9911. 743.02 s [vector] concatMap: OK
  9912. 743.02 s [vector] +++ OK, passed 100 tests.
  9913. 743.03 s [vector] mapM: OK
  9914. 743.03 s [vector] +++ OK, passed 100 tests.
  9915. 743.07 s [vector] mapM_: OK (0.04s)
  9916. 743.07 s [vector] +++ OK, passed 100 tests.
  9917. 743.09 s [vector] forM: OK
  9918. 743.09 s [vector] +++ OK, passed 100 tests.
  9919. 743.11 s [vector] forM_: OK (0.03s)
  9920. 743.11 s [vector] +++ OK, passed 100 tests.
  9921. 743.52 s [vector] imapM: OK
  9922. 743.52 s [vector] +++ OK, passed 100 tests.
  9923. 743.52 s [vector] imapM_: OK (0.04s)
  9924. 743.52 s [vector] +++ OK, passed 100 tests.
  9925. 743.52 s [vector] zipWith: OK
  9926. 743.52 s [vector] +++ OK, passed 100 tests.
  9927. 743.52 s [vector] zipWith3: OK
  9928. 743.52 s [vector] +++ OK, passed 100 tests.
  9929. 743.52 s [vector] izipWith: OK
  9930. 743.52 s [vector] +++ OK, passed 100 tests.
  9931. 743.53 s [vector] izipWith3: OK (0.01s)
  9932. 743.53 s [vector] +++ OK, passed 100 tests.
  9933. 743.53 s [vector] izipWithM: OK
  9934. 743.53 s [vector] +++ OK, passed 100 tests.
  9935. 743.53 s [vector] izipWithM_: OK (0.01s)
  9936. 743.53 s [vector] +++ OK, passed 100 tests.
  9937. 743.53 s [vector] zipWithM: OK
  9938. 743.53 s [vector] +++ OK, passed 100 tests.
  9939. 743.53 s [vector] zipWithM_: OK (0.03s)
  9940. 743.53 s [vector] +++ OK, passed 100 tests.
  9941. 743.53 s [vector] filter: OK
  9942. 743.53 s [vector] +++ OK, passed 100 tests.
  9943. 743.53 s [vector] ifilter: OK
  9944. 743.53 s [vector] +++ OK, passed 100 tests.
  9945. 743.53 s [vector] filterM: OK (0.05s)
  9946. 743.53 s [vector] +++ OK, passed 100 tests.
  9947. 743.53 s [vector] uniq: OK
  9948. 743.53 s [vector] +++ OK, passed 100 tests.
  9949. 743.53 s [vector] mapMaybe: OK
  9950. 743.53 s [vector] +++ OK, passed 100 tests.
  9951. 743.53 s [vector] imapMaybe: OK
  9952. 743.53 s [vector] +++ OK, passed 100 tests.
  9953. 743.53 s [vector] takeWhile: OK
  9954. 743.53 s [vector] +++ OK, passed 100 tests.
  9955. 743.53 s [vector] dropWhile: OK
  9956. 743.53 s [vector] +++ OK, passed 100 tests.
  9957. 743.53 s [vector] partition: OK
  9958. 743.53 s [vector] +++ OK, passed 100 tests.
  9959. 743.53 s [vector] partitionWith: OK
  9960. 743.53 s [vector] +++ OK, passed 100 tests.
  9961. 743.53 s [vector] span: OK
  9962. 743.53 s [vector] +++ OK, passed 100 tests.
  9963. 743.53 s [vector] break: OK
  9964. 743.53 s [vector] +++ OK, passed 100 tests.
  9965. 743.53 s [vector] spanR: OK
  9966. 743.53 s [vector] +++ OK, passed 100 tests.
  9967. 743.53 s [vector] breakR: OK
  9968. 743.53 s [vector] +++ OK, passed 100 tests.
  9969. 743.53 s [vector] groupBy: OK
  9970. 743.53 s [vector] +++ OK, passed 100 tests.
  9971. 743.53 s [vector] elem: OK
  9972. 743.53 s [vector] +++ OK, passed 100 tests.
  9973. 743.53 s [vector] notElem: OK
  9974. 743.53 s [vector] +++ OK, passed 100 tests.
  9975. 743.53 s [vector] find: OK
  9976. 743.53 s [vector] +++ OK, passed 100 tests.
  9977. 743.53 s [vector] findIndex: OK
  9978. 743.53 s [vector] +++ OK, passed 100 tests.
  9979. 743.53 s [vector] findIndexR: OK
  9980. 743.53 s [vector] +++ OK, passed 100 tests.
  9981. 743.53 s [vector] findIndices: OK
  9982. 743.53 s [vector] +++ OK, passed 100 tests.
  9983. 743.53 s [vector] elemIndex: OK
  9984. 743.53 s [vector] +++ OK, passed 100 tests.
  9985. 743.53 s [vector] elemIndices: OK
  9986. 743.53 s [vector] +++ OK, passed 100 tests.
  9987. 743.53 s [vector] foldl: OK
  9988. 743.53 s [vector] +++ OK, passed 100 tests.
  9989. 743.53 s [vector] foldl1: OK
  9990. 743.53 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9991. 743.53 s [vector] foldl': OK
  9992. 743.53 s [vector] +++ OK, passed 100 tests.
  9993. 743.53 s [vector] foldl1': OK (0.01s)
  9994. 743.53 s [vector] +++ OK, passed 100 tests; 25 discarded.
  9995. 743.53 s [vector] foldr: OK
  9996. 743.53 s [vector] +++ OK, passed 100 tests.
  9997. 743.53 s [vector] foldr1: OK
  9998. 743.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9999. 743.53 s [vector] foldr': OK
  10000. 743.53 s [vector] +++ OK, passed 100 tests.
  10001. 743.53 s [vector] foldr1': OK
  10002. 743.53 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10003. 743.53 s [vector] ifoldl: OK (0.01s)
  10004. 743.53 s [vector] +++ OK, passed 100 tests.
  10005. 743.53 s [vector] ifoldl': OK (0.02s)
  10006. 743.53 s [vector] +++ OK, passed 100 tests.
  10007. 743.53 s [vector] ifoldr: OK (0.01s)
  10008. 743.53 s [vector] +++ OK, passed 100 tests.
  10009. 743.53 s [vector] ifoldr': OK
  10010. 743.53 s [vector] +++ OK, passed 100 tests.
  10011. 743.53 s [vector] ifoldM: OK
  10012. 743.53 s [vector] +++ OK, passed 100 tests.
  10013. 743.53 s [vector] ifoldM': OK (0.01s)
  10014. 743.53 s [vector] +++ OK, passed 100 tests.
  10015. 743.57 s [vector] ifoldM_: OK (0.03s)
  10016. 743.57 s [vector] +++ OK, passed 100 tests.
  10017. 743.59 s [vector] ifoldM'_: OK (0.03s)
  10018. 743.59 s [vector] +++ OK, passed 100 tests.
  10019. 743.59 s [vector] all: OK
  10020. 743.59 s [vector] +++ OK, passed 100 tests.
  10021. 743.59 s [vector] any: OK
  10022. 743.59 s [vector] +++ OK, passed 100 tests.
  10023. 743.61 s [vector] prescanl: OK
  10024. 743.61 s [vector] +++ OK, passed 100 tests.
  10025. 743.63 s [vector] prescanl': OK
  10026. 743.63 s [vector] +++ OK, passed 100 tests.
  10027. 743.63 s [vector] postscanl: OK (0.01s)
  10028. 743.63 s [vector] +++ OK, passed 100 tests.
  10029. 743.64 s [vector] postscanl': OK
  10030. 743.64 s [vector] +++ OK, passed 100 tests.
  10031. 743.64 s [vector] scanl: OK
  10032. 743.64 s [vector] +++ OK, passed 100 tests.
  10033. 743.65 s [vector] scanl': OK
  10034. 743.65 s [vector] +++ OK, passed 100 tests.
  10035. 743.66 s [vector] scanl1: OK (0.01s)
  10036. 743.66 s [vector] +++ OK, passed 100 tests.
  10037. 743.67 s [vector] scanl1': OK
  10038. 743.67 s [vector] +++ OK, passed 100 tests.
  10039. 743.69 s [vector] iscanl: OK (0.01s)
  10040. 743.69 s [vector] +++ OK, passed 100 tests.
  10041. 743.70 s [vector] iscanl': OK (0.01s)
  10042. 743.71 s [vector] +++ OK, passed 100 tests.
  10043. 743.71 s [vector] prescanr: OK
  10044. 743.71 s [vector] +++ OK, passed 100 tests.
  10045. 743.71 s [vector] prescanr': OK (0.01s)
  10046. 743.72 s [vector] +++ OK, passed 100 tests.
  10047. 743.73 s [vector] postscanr: OK
  10048. 743.73 s [vector] +++ OK, passed 100 tests.
  10049. 743.75 s [vector] postscanr': OK (0.01s)
  10050. 743.75 s [vector] +++ OK, passed 100 tests.
  10051. 743.75 s [vector] scanr: OK
  10052. 743.75 s [vector] +++ OK, passed 100 tests.
  10053. 743.77 s [vector] scanr': OK
  10054. 743.77 s [vector] +++ OK, passed 100 tests.
  10055. 743.77 s [vector] scanr1: OK
  10056. 743.77 s [vector] +++ OK, passed 100 tests.
  10057. 743.78 s [vector] scanr1': OK
  10058. 743.78 s [vector] +++ OK, passed 100 tests.
  10059. 743.79 s [vector] iscanr: OK
  10060. 743.79 s [vector] +++ OK, passed 100 tests.
  10061. 743.80 s [vector] iscanr': OK
  10062. 743.80 s [vector] +++ OK, passed 100 tests.
  10063. 743.80 s [vector] mut_read: OK
  10064. 743.80 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10065. 743.80 s [vector] mut_write: OK
  10066. 743.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10067. 743.80 s [vector] mut_modify: OK
  10068. 743.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10069. 743.81 s [vector] mut_generate: OK
  10070. 743.81 s [vector] +++ OK, passed 100 tests.
  10071. 743.83 s [vector] mut_generateM: OK (0.01s)
  10072. 743.83 s [vector] +++ OK, passed 100 tests.
  10073. 743.87 s [vector] mut_mapM_: OK (0.03s)
  10074. 743.87 s [vector] +++ OK, passed 100 tests.
  10075. 743.89 s [vector] mut_imapM_: OK (0.03s)
  10076. 743.89 s [vector] +++ OK, passed 100 tests.
  10077. 743.93 s [vector] mut_forM_: OK (0.04s)
  10078. 743.93 s [vector] +++ OK, passed 100 tests.
  10079. 743.97 s [vector] mut_iforM_: OK (0.04s)
  10080. 743.97 s [vector] +++ OK, passed 100 tests.
  10081. 743.97 s [vector] mut_foldr: OK
  10082. 743.97 s [vector] +++ OK, passed 100 tests.
  10083. 743.99 s [vector] mut_foldr': OK
  10084. 743.99 s [vector] +++ OK, passed 100 tests.
  10085. 744.00 s [vector] mut_foldl: OK
  10086. 744.00 s [vector] +++ OK, passed 100 tests.
  10087. 744.01 s [vector] mut_foldl': OK
  10088. 744.01 s [vector] +++ OK, passed 100 tests.
  10089. 744.01 s [vector] mut_ifoldr: OK
  10090. 744.01 s [vector] +++ OK, passed 100 tests.
  10091. 744.03 s [vector] mut_ifoldr': OK (0.01s)
  10092. 744.03 s [vector] +++ OK, passed 100 tests.
  10093. 744.03 s [vector] mut_ifoldl: OK
  10094. 744.03 s [vector] +++ OK, passed 100 tests.
  10095. 744.04 s [vector] mut_ifoldl': OK
  10096. 744.04 s [vector] +++ OK, passed 100 tests.
  10097. 744.04 s [vector] mut_foldM: OK
  10098. 744.04 s [vector] +++ OK, passed 100 tests.
  10099. 744.05 s [vector] mut_foldM': OK
  10100. 744.05 s [vector] +++ OK, passed 100 tests.
  10101. 744.07 s [vector] mut_foldrM: OK
  10102. 744.07 s [vector] +++ OK, passed 100 tests.
  10103. 744.07 s [vector] mut_foldrM': OK
  10104. 744.07 s [vector] +++ OK, passed 100 tests.
  10105. 744.09 s [vector] mut_ifoldM: OK
  10106. 744.09 s [vector] +++ OK, passed 100 tests.
  10107. 744.10 s [vector] mut_ifoldM': OK
  10108. 744.11 s [vector] +++ OK, passed 100 tests.
  10109. 744.11 s [vector] mut_ifoldrM: OK
  10110. 744.11 s [vector] +++ OK, passed 100 tests.
  10111. 744.11 s [vector] mut_ifoldrM': OK (0.01s)
  10112. 744.11 s [vector] +++ OK, passed 100 tests.
  10113. 744.11 s [vector] compare: OK
  10114. 744.11 s [vector] +++ OK, passed 100 tests.
  10115. 744.11 s [vector] maximum: OK
  10116. 744.11 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10117. 744.11 s [vector] minimum: OK
  10118. 744.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10119. 744.11 s [vector] minIndex: OK
  10120. 744.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10121. 744.11 s [vector] maxIndex: OK
  10122. 744.11 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10123. 744.11 s [vector] maximumBy: OK
  10124. 744.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10125. 744.11 s [vector] minimumBy: OK
  10126. 744.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10127. 744.11 s [vector] maximumOn: OK
  10128. 744.11 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10129. 744.11 s [vector] minimumOn: OK
  10130. 744.11 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10131. 744.11 s [vector] maxIndexBy: OK
  10132. 744.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10133. 744.12 s [vector] minIndexBy: OK
  10134. 744.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10135. 744.12 s [vector] ListFirstMaxIndexWins: OK
  10136. 744.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10137. 744.12 s [vector] FalseListFirstMaxIndexWins: OK
  10138. 744.12 s [vector] +++ OK, failed as expected. (after 1 test):
  10139. 744.12 s [vector] Exception:
  10140. 744.12 s [vector] Prelude.foldr1: empty list
  10141. 744.12 s [vector] CallStack (from HasCallStack):
  10142. 744.12 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  10143. 744.12 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  10144. 744.12 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10145. 744.12 s [vector] []
  10146. 744.12 s [vector] zip: OK
  10147. 744.12 s [vector] +++ OK, passed 100 tests.
  10148. 744.12 s [vector] zip3: OK
  10149. 744.12 s [vector] +++ OK, passed 100 tests.
  10150. 744.13 s [vector] unzip: OK
  10151. 744.13 s [vector] +++ OK, passed 100 tests.
  10152. 744.13 s [vector] unzip3: OK
  10153. 744.13 s [vector] +++ OK, passed 100 tests.
  10154. 744.13 s [vector] indexed: OK
  10155. 744.13 s [vector] +++ OK, passed 100 tests.
  10156. 744.13 s [vector] update: OK
  10157. 744.13 s [vector] +++ OK, passed 100 tests.
  10158. 744.13 s [vector] mempty: OK
  10159. 744.13 s [vector] +++ OK, passed 100 tests.
  10160. 744.15 s [vector] mappend: OK
  10161. 744.15 s [vector] +++ OK, passed 100 tests.
  10162. 744.16 s [vector] mconcat: OK (0.02s)
  10163. 744.16 s [vector] +++ OK, passed 100 tests.
  10164. 744.17 s [vector] glength: OK
  10165. 744.17 s [vector] +++ OK, passed 100 tests.
  10166. 744.17 s [vector] sum: OK
  10167. 744.17 s [vector] +++ OK, passed 100 tests.
  10168. 744.17 s [vector] product: OK
  10169. 744.17 s [vector] +++ OK, passed 100 tests.
  10170. 744.17 s [vector] enumFromN: OK
  10171. 744.17 s [vector] +++ OK, passed 100 tests.
  10172. 744.17 s [vector] enumFromThenN: OK
  10173. 744.17 s [vector] +++ OK, passed 100 tests.
  10174. 744.17 s [vector] enumFromTo: OK
  10175. 744.17 s [vector] +++ OK, passed 100 tests.
  10176. 744.17 s [vector] enumFromThenTo: OK
  10177. 744.17 s [vector] +++ OK, passed 100 tests; 2 discarded.
  10178. 744.17 s [vector] (Double)
  10179. 744.17 s [vector] fromList.toList == id: OK
  10180. 744.17 s [vector] +++ OK, passed 100 tests.
  10181. 744.17 s [vector] toList.fromList == id: OK
  10182. 744.17 s [vector] +++ OK, passed 100 tests.
  10183. 744.18 s [vector] unstream.stream == id: OK
  10184. 744.18 s [vector] +++ OK, passed 100 tests.
  10185. 744.18 s [vector] stream.unstream == id: OK
  10186. 744.18 s [vector] +++ OK, passed 100 tests.
  10187. 744.18 s [vector] eq: OK
  10188. 744.18 s [vector] +++ OK, passed 100 tests.
  10189. 744.18 s [vector] length: OK
  10190. 744.18 s [vector] +++ OK, passed 100 tests.
  10191. 744.18 s [vector] null: OK
  10192. 744.18 s [vector] +++ OK, passed 100 tests.
  10193. 744.18 s [vector] index: OK
  10194. 744.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10195. 744.18 s [vector] safeIndex: OK
  10196. 744.18 s [vector] +++ OK, passed 100 tests.
  10197. 744.18 s [vector] head: OK
  10198. 744.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10199. 744.18 s [vector] last: OK
  10200. 744.19 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10201. 744.19 s [vector] unsafeIndex: OK
  10202. 744.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10203. 744.19 s [vector] unsafeHead: OK
  10204. 744.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10205. 744.19 s [vector] unsafeLast: OK
  10206. 744.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10207. 744.19 s [vector] slice: OK
  10208. 744.19 s [vector] +++ OK, passed 100 tests.
  10209. 744.19 s [vector] init: OK
  10210. 744.19 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10211. 744.19 s [vector] tail: OK
  10212. 744.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10213. 744.19 s [vector] take: OK
  10214. 744.19 s [vector] +++ OK, passed 100 tests.
  10215. 744.19 s [vector] drop: OK
  10216. 744.19 s [vector] +++ OK, passed 100 tests.
  10217. 744.19 s [vector] splitAt: OK
  10218. 744.19 s [vector] +++ OK, passed 100 tests.
  10219. 744.19 s [vector] empty: OK
  10220. 744.19 s [vector] +++ OK, passed 100 tests.
  10221. 744.19 s [vector] singleton: OK
  10222. 744.19 s [vector] +++ OK, passed 100 tests.
  10223. 744.20 s [vector] replicate: OK
  10224. 744.20 s [vector] +++ OK, passed 100 tests.
  10225. 744.20 s [vector] generate: OK
  10226. 744.20 s [vector] +++ OK, passed 100 tests.
  10227. 744.20 s [vector] iterateN: OK
  10228. 744.20 s [vector] +++ OK, passed 100 tests.
  10229. 744.27 s [vector] iterateNM: OK (0.05s)
  10230. 744.27 s [vector] +++ OK, passed 100 tests.
  10231. 744.31 s [vector] generateM: OK (0.02s)
  10232. 744.31 s [vector] +++ OK, passed 100 tests.
  10233. 744.31 s [vector] replicateM: OK (0.02s)
  10234. 744.31 s [vector] +++ OK, passed 100 tests.
  10235. 744.31 s [vector] create: OK
  10236. 744.31 s [vector] +++ OK, passed 100 tests.
  10237. 744.31 s [vector] createT: OK
  10238. 744.31 s [vector] +++ OK, passed 100 tests.
  10239. 744.31 s [vector] unfoldr: OK
  10240. 744.31 s [vector] +++ OK, passed 100 tests.
  10241. 744.32 s [vector] unfoldrN: OK
  10242. 744.32 s [vector] +++ OK, passed 100 tests.
  10243. 744.32 s [vector] unfoldrExactN: OK
  10244. 744.32 s [vector] +++ OK, passed 100 tests.
  10245. 744.32 s [vector] unfoldrM: OK
  10246. 744.32 s [vector] +++ OK, passed 100 tests.
  10247. 744.33 s [vector] unfoldrNM: OK
  10248. 744.33 s [vector] +++ OK, passed 100 tests.
  10249. 744.37 s [vector] unfoldrExactNM: OK (0.04s)
  10250. 744.37 s [vector] +++ OK, passed 100 tests.
  10251. 744.39 s [vector] constructN: OK (0.02s)
  10252. 744.39 s [vector] +++ OK, passed 100 tests.
  10253. 744.41 s [vector] constructrN: OK (0.02s)
  10254. 744.41 s [vector] +++ OK, passed 100 tests.
  10255. 744.41 s [vector] cons: OK
  10256. 744.41 s [vector] +++ OK, passed 100 tests.
  10257. 744.41 s [vector] snoc: OK
  10258. 744.41 s [vector] +++ OK, passed 100 tests.
  10259. 744.43 s [vector] append: OK
  10260. 744.43 s [vector] +++ OK, passed 100 tests.
  10261. 744.44 s [vector] concat: OK (0.03s)
  10262. 744.44 s [vector] +++ OK, passed 100 tests.
  10263. 744.44 s [vector] force: OK
  10264. 744.44 s [vector] +++ OK, passed 100 tests.
  10265. 744.44 s [vector] upd: OK
  10266. 744.44 s [vector] +++ OK, passed 100 tests.
  10267. 744.46 s [vector] accum: OK (0.01s)
  10268. 744.46 s [vector] +++ OK, passed 100 tests.
  10269. 744.46 s [vector] reverse: OK
  10270. 744.46 s [vector] +++ OK, passed 100 tests.
  10271. 744.47 s [vector] backpermute: OK
  10272. 744.47 s [vector] +++ OK, passed 100 tests.
  10273. 744.48 s [vector] map: OK
  10274. 744.48 s [vector] +++ OK, passed 100 tests.
  10275. 744.49 s [vector] imap: OK
  10276. 744.49 s [vector] +++ OK, passed 100 tests.
  10277. 744.49 s [vector] concatMap: OK
  10278. 744.49 s [vector] +++ OK, passed 100 tests.
  10279. 744.51 s [vector] mapM: OK
  10280. 744.51 s [vector] +++ OK, passed 100 tests.
  10281. 744.53 s [vector] mapM_: OK (0.03s)
  10282. 744.53 s [vector] +++ OK, passed 100 tests.
  10283. 744.54 s [vector] forM: OK
  10284. 744.54 s [vector] +++ OK, passed 100 tests.
  10285. 744.59 s [vector] forM_: OK (0.05s)
  10286. 744.59 s [vector] +++ OK, passed 100 tests.
  10287. 744.63 s [vector] imapM: OK (0.03s)
  10288. 744.63 s [vector] +++ OK, passed 100 tests.
  10289. 744.67 s [vector] imapM_: OK (0.05s)
  10290. 744.67 s [vector] +++ OK, passed 100 tests.
  10291. 744.71 s [vector] zipWith: OK (0.01s)
  10292. 744.71 s [vector] +++ OK, passed 100 tests.
  10293. 744.71 s [vector] zipWith3: OK (0.01s)
  10294. 744.71 s [vector] +++ OK, passed 100 tests.
  10295. 744.71 s [vector] izipWith: OK (0.02s)
  10296. 744.71 s [vector] +++ OK, passed 100 tests.
  10297. 744.73 s [vector] izipWith3: OK (0.02s)
  10298. 744.73 s [vector] +++ OK, passed 100 tests.
  10299. 744.75 s [vector] izipWithM: OK (0.01s)
  10300. 744.75 s [vector] +++ OK, passed 100 tests.
  10301. 744.77 s [vector] izipWithM_: OK (0.03s)
  10302. 744.77 s [vector] +++ OK, passed 100 tests.
  10303. 744.79 s [vector] zipWithM: OK (0.01s)
  10304. 744.79 s [vector] +++ OK, passed 100 tests.
  10305. 744.82 s [vector] zipWithM_: OK (0.03s)
  10306. 744.82 s [vector] +++ OK, passed 100 tests.
  10307. 744.82 s [vector] filter: OK
  10308. 744.82 s [vector] +++ OK, passed 100 tests.
  10309. 744.83 s [vector] ifilter: OK
  10310. 744.83 s [vector] +++ OK, passed 100 tests.
  10311. 744.88 s [vector] filterM: OK (0.05s)
  10312. 744.88 s [vector] +++ OK, passed 100 tests.
  10313. 744.89 s [vector] uniq: OK
  10314. 744.89 s [vector] +++ OK, passed 100 tests.
  10315. 744.89 s [vector] mapMaybe: OK
  10316. 744.89 s [vector] +++ OK, passed 100 tests.
  10317. 744.89 s [vector] imapMaybe: OK
  10318. 744.90 s [vector] +++ OK, passed 100 tests.
  10319. 744.91 s [vector] takeWhile: OK
  10320. 744.91 s [vector] +++ OK, passed 100 tests.
  10321. 744.91 s [vector] dropWhile: OK
  10322. 744.91 s [vector] +++ OK, passed 100 tests.
  10323. 744.92 s [vector] partition: OK
  10324. 744.92 s [vector] +++ OK, passed 100 tests.
  10325. 744.92 s [vector] partitionWith: OK
  10326. 744.92 s [vector] +++ OK, passed 100 tests.
  10327. 744.92 s [vector] span: OK
  10328. 744.92 s [vector] +++ OK, passed 100 tests.
  10329. 744.92 s [vector] break: OK
  10330. 744.92 s [vector] +++ OK, passed 100 tests.
  10331. 744.92 s [vector] spanR: OK
  10332. 744.93 s [vector] +++ OK, passed 100 tests.
  10333. 744.93 s [vector] breakR: OK
  10334. 744.94 s [vector] +++ OK, passed 100 tests.
  10335. 744.94 s [vector] groupBy: OK (0.01s)
  10336. 744.94 s [vector] +++ OK, passed 100 tests.
  10337. 744.94 s [vector] elem: OK
  10338. 744.94 s [vector] +++ OK, passed 100 tests.
  10339. 744.94 s [vector] notElem: OK
  10340. 744.94 s [vector] +++ OK, passed 100 tests.
  10341. 744.95 s [vector] find: OK
  10342. 744.96 s [vector] +++ OK, passed 100 tests.
  10343. 744.96 s [vector] findIndex: OK
  10344. 744.96 s [vector] +++ OK, passed 100 tests.
  10345. 744.96 s [vector] findIndexR: OK
  10346. 744.96 s [vector] +++ OK, passed 100 tests.
  10347. 744.96 s [vector] findIndices: OK
  10348. 744.96 s [vector] +++ OK, passed 100 tests.
  10349. 744.96 s [vector] elemIndex: OK
  10350. 744.96 s [vector] +++ OK, passed 100 tests.
  10351. 744.96 s [vector] elemIndices: OK
  10352. 744.96 s [vector] +++ OK, passed 100 tests.
  10353. 744.99 s [vector] foldl: OK
  10354. 744.99 s [vector] +++ OK, passed 100 tests.
  10355. 744.99 s [vector] foldl1: OK (0.01s)
  10356. 744.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10357. 745.00 s [vector] foldl': OK (0.01s)
  10358. 745.00 s [vector] +++ OK, passed 100 tests.
  10359. 745.03 s [vector] foldl1': OK
  10360. 745.03 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10361. 745.04 s [vector] foldr: OK (0.01s)
  10362. 745.04 s [vector] +++ OK, passed 100 tests.
  10363. 745.05 s [vector] foldr1: OK (0.01s)
  10364. 745.05 s [vector] +++ OK, passed 100 tests; 26 discarded.
  10365. 745.05 s [vector] foldr': OK (0.01s)
  10366. 745.05 s [vector] +++ OK, passed 100 tests.
  10367. 745.06 s [vector] foldr1': OK
  10368. 745.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10369. 745.08 s [vector] ifoldl: OK
  10370. 745.08 s [vector] +++ OK, passed 100 tests.
  10371. 745.09 s [vector] ifoldl': OK
  10372. 745.09 s [vector] +++ OK, passed 100 tests.
  10373. 745.11 s [vector] ifoldr: OK (0.01s)
  10374. 745.11 s [vector] +++ OK, passed 100 tests.
  10375. 745.13 s [vector] ifoldr': OK (0.01s)
  10376. 745.13 s [vector] +++ OK, passed 100 tests.
  10377. 745.14 s [vector] ifoldM: OK (0.01s)
  10378. 745.14 s [vector] +++ OK, passed 100 tests.
  10379. 745.15 s [vector] ifoldM': OK (0.02s)
  10380. 745.15 s [vector] +++ OK, passed 100 tests.
  10381. 745.19 s [vector] ifoldM_: OK (0.04s)
  10382. 745.19 s [vector] +++ OK, passed 100 tests.
  10383. 745.22 s [vector] ifoldM'_: OK (0.04s)
  10384. 745.22 s [vector] +++ OK, passed 100 tests.
  10385. 745.22 s [vector] all: OK
  10386. 745.22 s [vector] +++ OK, passed 100 tests.
  10387. 745.22 s [vector] any: OK
  10388. 745.22 s [vector] +++ OK, passed 100 tests.
  10389. 745.25 s [vector] prescanl: OK (0.02s)
  10390. 745.25 s [vector] +++ OK, passed 100 tests.
  10391. 745.27 s [vector] prescanl': OK (0.01s)
  10392. 745.27 s [vector] +++ OK, passed 100 tests.
  10393. 745.29 s [vector] postscanl: OK (0.02s)
  10394. 745.29 s [vector] +++ OK, passed 100 tests.
  10395. 745.31 s [vector] postscanl': OK (0.02s)
  10396. 745.31 s [vector] +++ OK, passed 100 tests.
  10397. 745.31 s [vector] scanl: OK (0.02s)
  10398. 745.31 s [vector] +++ OK, passed 100 tests.
  10399. 745.33 s [vector] scanl': OK (0.02s)
  10400. 745.33 s [vector] +++ OK, passed 100 tests.
  10401. 745.35 s [vector] scanl1: OK (0.02s)
  10402. 745.35 s [vector] +++ OK, passed 100 tests.
  10403. 745.37 s [vector] scanl1': OK (0.02s)
  10404. 745.37 s [vector] +++ OK, passed 100 tests.
  10405. 745.39 s [vector] iscanl: OK (0.02s)
  10406. 745.39 s [vector] +++ OK, passed 100 tests.
  10407. 745.41 s [vector] iscanl': OK (0.02s)
  10408. 745.41 s [vector] +++ OK, passed 100 tests.
  10409. 745.43 s [vector] prescanr: OK (0.02s)
  10410. 745.43 s [vector] +++ OK, passed 100 tests.
  10411. 745.45 s [vector] prescanr': OK (0.02s)
  10412. 745.45 s [vector] +++ OK, passed 100 tests.
  10413. 745.46 s [vector] postscanr: OK (0.01s)
  10414. 745.46 s [vector] +++ OK, passed 100 tests.
  10415. 745.49 s [vector] postscanr': OK
  10416. 745.49 s [vector] +++ OK, passed 100 tests.
  10417. 745.50 s [vector] scanr: OK (0.02s)
  10418. 745.50 s [vector] +++ OK, passed 100 tests.
  10419. 745.53 s [vector] scanr': OK
  10420. 745.53 s [vector] +++ OK, passed 100 tests.
  10421. 745.53 s [vector] scanr1: OK (0.02s)
  10422. 745.53 s [vector] +++ OK, passed 100 tests.
  10423. 745.55 s [vector] scanr1': OK (0.02s)
  10424. 745.55 s [vector] +++ OK, passed 100 tests.
  10425. 745.56 s [vector] iscanr: OK (0.01s)
  10426. 745.56 s [vector] +++ OK, passed 100 tests.
  10427. 745.58 s [vector] iscanr': OK
  10428. 745.58 s [vector] +++ OK, passed 100 tests.
  10429. 745.58 s [vector] mut_read: OK
  10430. 745.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10431. 745.58 s [vector] mut_write: OK
  10432. 745.58 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10433. 745.58 s [vector] mut_modify: OK
  10434. 745.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10435. 745.58 s [vector] mut_generate: OK
  10436. 745.58 s [vector] +++ OK, passed 100 tests.
  10437. 745.61 s [vector] mut_generateM: OK (0.01s)
  10438. 745.61 s [vector] +++ OK, passed 100 tests.
  10439. 745.65 s [vector] mut_mapM_: OK (0.03s)
  10440. 745.65 s [vector] +++ OK, passed 100 tests.
  10441. 745.69 s [vector] mut_imapM_: OK (0.04s)
  10442. 745.69 s [vector] +++ OK, passed 100 tests.
  10443. 745.71 s [vector] mut_forM_: OK (0.03s)
  10444. 745.71 s [vector] +++ OK, passed 100 tests.
  10445. 745.75 s [vector] mut_iforM_: OK (0.04s)
  10446. 745.75 s [vector] +++ OK, passed 100 tests.
  10447. 745.77 s [vector] mut_foldr: OK (0.01s)
  10448. 745.77 s [vector] +++ OK, passed 100 tests.
  10449. 745.77 s [vector] mut_foldr': OK (0.01s)
  10450. 745.77 s [vector] +++ OK, passed 100 tests.
  10451. 745.79 s [vector] mut_foldl: OK (0.01s)
  10452. 745.79 s [vector] +++ OK, passed 100 tests.
  10453. 745.79 s [vector] mut_foldl': OK (0.01s)
  10454. 745.79 s [vector] +++ OK, passed 100 tests.
  10455. 745.81 s [vector] mut_ifoldr: OK
  10456. 745.81 s [vector] +++ OK, passed 100 tests.
  10457. 745.82 s [vector] mut_ifoldr': OK (0.02s)
  10458. 745.82 s [vector] +++ OK, passed 100 tests.
  10459. 745.85 s [vector] mut_ifoldl: OK
  10460. 745.85 s [vector] +++ OK, passed 100 tests.
  10461. 745.85 s [vector] mut_ifoldl': OK (0.01s)
  10462. 745.85 s [vector] +++ OK, passed 100 tests.
  10463. 745.87 s [vector] mut_foldM: OK
  10464. 745.87 s [vector] +++ OK, passed 100 tests.
  10465. 745.89 s [vector] mut_foldM': OK (0.01s)
  10466. 745.89 s [vector] +++ OK, passed 100 tests.
  10467. 745.89 s [vector] mut_foldrM: OK (0.01s)
  10468. 745.89 s [vector] +++ OK, passed 100 tests.
  10469. 745.91 s [vector] mut_foldrM': OK (0.01s)
  10470. 745.91 s [vector] +++ OK, passed 100 tests.
  10471. 745.93 s [vector] mut_ifoldM: OK (0.01s)
  10472. 745.93 s [vector] +++ OK, passed 100 tests.
  10473. 745.93 s [vector] mut_ifoldM': OK (0.01s)
  10474. 745.93 s [vector] +++ OK, passed 100 tests.
  10475. 745.94 s [vector] mut_ifoldrM: OK (0.01s)
  10476. 745.94 s [vector] +++ OK, passed 100 tests.
  10477. 745.95 s [vector] mut_ifoldrM': OK
  10478. 745.95 s [vector] +++ OK, passed 100 tests.
  10479. 745.95 s [vector] compare: OK
  10480. 745.95 s [vector] +++ OK, passed 100 tests.
  10481. 745.96 s [vector] maximum: OK
  10482. 745.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10483. 745.96 s [vector] minimum: OK
  10484. 745.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10485. 745.96 s [vector] minIndex: OK
  10486. 745.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10487. 745.96 s [vector] maxIndex: OK
  10488. 745.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10489. 745.96 s [vector] maximumBy: OK
  10490. 745.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10491. 745.96 s [vector] minimumBy: OK
  10492. 745.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10493. 745.96 s [vector] maximumOn: OK
  10494. 745.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10495. 745.96 s [vector] minimumOn: OK
  10496. 745.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10497. 745.96 s [vector] maxIndexBy: OK
  10498. 745.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10499. 745.96 s [vector] minIndexBy: OK
  10500. 745.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10501. 745.96 s [vector] ListFirstMaxIndexWins: OK
  10502. 745.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10503. 745.96 s [vector] FalseListFirstMaxIndexWins: OK
  10504. 745.96 s [vector] +++ OK, failed as expected. (after 1 test):
  10505. 745.96 s [vector] Exception:
  10506. 745.96 s [vector] Prelude.foldr1: empty list
  10507. 745.96 s [vector] CallStack (from HasCallStack):
  10508. 745.96 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  10509. 745.96 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  10510. 745.96 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10511. 745.96 s [vector] []
  10512. 745.97 s [vector] zip: OK
  10513. 745.97 s [vector] +++ OK, passed 100 tests.
  10514. 745.97 s [vector] zip3: OK
  10515. 745.97 s [vector] +++ OK, passed 100 tests.
  10516. 745.97 s [vector] unzip: OK
  10517. 745.97 s [vector] +++ OK, passed 100 tests.
  10518. 745.98 s [vector] unzip3: OK
  10519. 745.98 s [vector] +++ OK, passed 100 tests.
  10520. 745.98 s [vector] indexed: OK
  10521. 745.98 s [vector] +++ OK, passed 100 tests.
  10522. 745.98 s [vector] update: OK
  10523. 745.98 s [vector] +++ OK, passed 100 tests.
  10524. 745.99 s [vector] mempty: OK
  10525. 745.99 s [vector] +++ OK, passed 100 tests.
  10526. 745.99 s [vector] mappend: OK
  10527. 745.99 s [vector] +++ OK, passed 100 tests.
  10528. 746.01 s [vector] mconcat: OK (0.02s)
  10529. 746.01 s [vector] +++ OK, passed 100 tests.
  10530. 746.01 s [vector] glength: OK
  10531. 746.01 s [vector] +++ OK, passed 100 tests.
  10532. 746.01 s [vector] sum: OK
  10533. 746.01 s [vector] +++ OK, passed 100 tests.
  10534. 746.01 s [vector] product: OK
  10535. 746.01 s [vector] +++ OK, passed 100 tests.
  10536. 746.01 s [vector] enumFromN: OK
  10537. 746.01 s [vector] +++ OK, passed 100 tests.
  10538. 746.01 s [vector] enumFromThenN: OK
  10539. 746.01 s [vector] +++ OK, passed 100 tests.
  10540. 746.01 s [vector] enumFromTo: OK
  10541. 746.01 s [vector] +++ OK, passed 100 tests.
  10542. 746.01 s [vector] enumFromThenTo: OK
  10543. 746.01 s [vector] +++ OK, passed 100 tests; 2 discarded.
  10544. 746.01 s [vector] (Int,Bool)
  10545. 746.01 s [vector] fromList.toList == id: OK
  10546. 746.01 s [vector] +++ OK, passed 100 tests.
  10547. 746.02 s [vector] toList.fromList == id: OK
  10548. 746.02 s [vector] +++ OK, passed 100 tests.
  10549. 746.02 s [vector] unstream.stream == id: OK
  10550. 746.02 s [vector] +++ OK, passed 100 tests.
  10551. 746.02 s [vector] stream.unstream == id: OK
  10552. 746.02 s [vector] +++ OK, passed 100 tests.
  10553. 746.02 s [vector] eq: OK
  10554. 746.02 s [vector] +++ OK, passed 100 tests.
  10555. 746.02 s [vector] length: OK
  10556. 746.02 s [vector] +++ OK, passed 100 tests.
  10557. 746.02 s [vector] null: OK
  10558. 746.02 s [vector] +++ OK, passed 100 tests.
  10559. 746.02 s [vector] index: OK
  10560. 746.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10561. 746.02 s [vector] safeIndex: OK
  10562. 746.02 s [vector] +++ OK, passed 100 tests.
  10563. 746.02 s [vector] head: OK
  10564. 746.02 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10565. 746.02 s [vector] last: OK
  10566. 746.02 s [vector] +++ OK, passed 100 tests; 23 discarded.
  10567. 746.02 s [vector] unsafeIndex: OK
  10568. 746.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10569. 746.02 s [vector] unsafeHead: OK
  10570. 746.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10571. 746.03 s [vector] unsafeLast: OK
  10572. 746.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10573. 746.03 s [vector] slice: OK
  10574. 746.03 s [vector] +++ OK, passed 100 tests.
  10575. 746.03 s [vector] init: OK
  10576. 746.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10577. 746.03 s [vector] tail: OK
  10578. 746.03 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10579. 746.03 s [vector] take: OK
  10580. 746.03 s [vector] +++ OK, passed 100 tests.
  10581. 746.03 s [vector] drop: OK
  10582. 746.04 s [vector] +++ OK, passed 100 tests.
  10583. 746.04 s [vector] splitAt: OK
  10584. 746.04 s [vector] +++ OK, passed 100 tests.
  10585. 746.04 s [vector] empty: OK
  10586. 746.04 s [vector] +++ OK, passed 100 tests.
  10587. 746.04 s [vector] singleton: OK
  10588. 746.04 s [vector] +++ OK, passed 100 tests.
  10589. 746.04 s [vector] replicate: OK
  10590. 746.04 s [vector] +++ OK, passed 100 tests.
  10591. 746.04 s [vector] generate: OK
  10592. 746.05 s [vector] +++ OK, passed 100 tests.
  10593. 746.05 s [vector] iterateN: OK
  10594. 746.05 s [vector] +++ OK, passed 100 tests.
  10595. 746.08 s [vector] iterateNM: OK (0.04s)
  10596. 746.08 s [vector] +++ OK, passed 100 tests.
  10597. 746.15 s [vector] generateM: OK (0.05s)
  10598. 746.15 s [vector] +++ OK, passed 100 tests.
  10599. 746.16 s [vector] replicateM: OK (0.02s)
  10600. 746.16 s [vector] +++ OK, passed 100 tests.
  10601. 746.16 s [vector] create: OK
  10602. 746.16 s [vector] +++ OK, passed 100 tests.
  10603. 746.16 s [vector] createT: OK
  10604. 746.16 s [vector] +++ OK, passed 100 tests.
  10605. 746.16 s [vector] unfoldr: OK
  10606. 746.16 s [vector] +++ OK, passed 100 tests.
  10607. 746.17 s [vector] unfoldrN: OK
  10608. 746.17 s [vector] +++ OK, passed 100 tests.
  10609. 746.17 s [vector] unfoldrExactN: OK
  10610. 746.17 s [vector] +++ OK, passed 100 tests.
  10611. 746.17 s [vector] unfoldrM: OK
  10612. 746.17 s [vector] +++ OK, passed 100 tests.
  10613. 746.20 s [vector] unfoldrNM: OK
  10614. 746.20 s [vector] +++ OK, passed 100 tests.
  10615. 746.22 s [vector] unfoldrExactNM: OK (0.05s)
  10616. 746.22 s [vector] +++ OK, passed 100 tests.
  10617. 746.23 s [vector] constructN: OK
  10618. 746.23 s [vector] +++ OK, passed 100 tests.
  10619. 746.24 s [vector] constructrN: OK
  10620. 746.24 s [vector] +++ OK, passed 100 tests.
  10621. 746.24 s [vector] cons: OK
  10622. 746.24 s [vector] +++ OK, passed 100 tests.
  10623. 746.24 s [vector] snoc: OK
  10624. 746.24 s [vector] +++ OK, passed 100 tests.
  10625. 746.25 s [vector] append: OK
  10626. 746.25 s [vector] +++ OK, passed 100 tests.
  10627. 746.28 s [vector] concat: OK (0.03s)
  10628. 746.28 s [vector] +++ OK, passed 100 tests.
  10629. 746.28 s [vector] force: OK
  10630. 746.28 s [vector] +++ OK, passed 100 tests.
  10631. 746.29 s [vector] upd: OK
  10632. 746.29 s [vector] +++ OK, passed 100 tests.
  10633. 746.29 s [vector] accum: OK
  10634. 746.29 s [vector] +++ OK, passed 100 tests.
  10635. 746.29 s [vector] reverse: OK
  10636. 746.29 s [vector] +++ OK, passed 100 tests.
  10637. 746.29 s [vector] backpermute: OK
  10638. 746.30 s [vector] +++ OK, passed 100 tests.
  10639. 746.30 s [vector] map: OK
  10640. 746.30 s [vector] +++ OK, passed 100 tests.
  10641. 746.30 s [vector] imap: OK
  10642. 746.30 s [vector] +++ OK, passed 100 tests.
  10643. 746.31 s [vector] concatMap: OK
  10644. 746.31 s [vector] +++ OK, passed 100 tests.
  10645. 746.31 s [vector] mapM: OK
  10646. 746.32 s [vector] +++ OK, passed 100 tests.
  10647. 746.34 s [vector] mapM_: OK (0.01s)
  10648. 746.34 s [vector] +++ OK, passed 100 tests.
  10649. 746.35 s [vector] forM: OK
  10650. 746.35 s [vector] +++ OK, passed 100 tests.
  10651. 746.38 s [vector] forM_: OK (0.03s)
  10652. 746.38 s [vector] +++ OK, passed 100 tests.
  10653. 746.38 s [vector] imapM: OK
  10654. 746.39 s [vector] +++ OK, passed 100 tests.
  10655. 746.43 s [vector] imapM_: OK (0.04s)
  10656. 746.43 s [vector] +++ OK, passed 100 tests.
  10657. 746.43 s [vector] zipWith: OK
  10658. 746.43 s [vector] +++ OK, passed 100 tests.
  10659. 746.44 s [vector] zipWith3: OK
  10660. 746.44 s [vector] +++ OK, passed 100 tests.
  10661. 746.45 s [vector] izipWith: OK
  10662. 746.45 s [vector] +++ OK, passed 100 tests.
  10663. 746.45 s [vector] izipWith3: OK
  10664. 746.45 s [vector] +++ OK, passed 100 tests.
  10665. 746.47 s [vector] izipWithM: OK
  10666. 746.47 s [vector] +++ OK, passed 100 tests.
  10667. 746.48 s [vector] izipWithM_: OK (0.02s)
  10668. 746.48 s [vector] +++ OK, passed 100 tests.
  10669. 746.48 s [vector] zipWithM: OK
  10670. 746.48 s [vector] +++ OK, passed 100 tests.
  10671. 746.51 s [vector] zipWithM_: OK (0.02s)
  10672. 746.51 s [vector] +++ OK, passed 100 tests.
  10673. 746.51 s [vector] filter: OK
  10674. 746.51 s [vector] +++ OK, passed 100 tests.
  10675. 746.53 s [vector] ifilter: OK
  10676. 746.53 s [vector] +++ OK, passed 100 tests.
  10677. 746.56 s [vector] filterM: OK (0.05s)
  10678. 746.56 s [vector] +++ OK, passed 100 tests.
  10679. 746.56 s [vector] uniq: OK
  10680. 746.57 s [vector] +++ OK, passed 100 tests.
  10681. 746.57 s [vector] mapMaybe: OK
  10682. 746.57 s [vector] +++ OK, passed 100 tests.
  10683. 746.57 s [vector] imapMaybe: OK
  10684. 746.57 s [vector] +++ OK, passed 100 tests.
  10685. 746.57 s [vector] takeWhile: OK
  10686. 746.57 s [vector] +++ OK, passed 100 tests.
  10687. 746.58 s [vector] dropWhile: OK
  10688. 746.58 s [vector] +++ OK, passed 100 tests.
  10689. 746.58 s [vector] partition: OK
  10690. 746.58 s [vector] +++ OK, passed 100 tests.
  10691. 746.58 s [vector] partitionWith: OK
  10692. 746.58 s [vector] +++ OK, passed 100 tests.
  10693. 746.59 s [vector] span: OK
  10694. 746.59 s [vector] +++ OK, passed 100 tests.
  10695. 746.59 s [vector] break: OK
  10696. 746.59 s [vector] +++ OK, passed 100 tests.
  10697. 746.59 s [vector] spanR: OK
  10698. 746.59 s [vector] +++ OK, passed 100 tests.
  10699. 746.60 s [vector] breakR: OK
  10700. 746.60 s [vector] +++ OK, passed 100 tests.
  10701. 746.60 s [vector] groupBy: OK
  10702. 746.60 s [vector] +++ OK, passed 100 tests.
  10703. 746.60 s [vector] elem: OK
  10704. 746.60 s [vector] +++ OK, passed 100 tests.
  10705. 746.60 s [vector] notElem: OK
  10706. 746.60 s [vector] +++ OK, passed 100 tests.
  10707. 746.60 s [vector] find: OK
  10708. 746.60 s [vector] +++ OK, passed 100 tests.
  10709. 746.60 s [vector] findIndex: OK
  10710. 746.60 s [vector] +++ OK, passed 100 tests.
  10711. 746.60 s [vector] findIndexR: OK
  10712. 746.61 s [vector] +++ OK, passed 100 tests.
  10713. 746.61 s [vector] findIndices: OK
  10714. 746.61 s [vector] +++ OK, passed 100 tests.
  10715. 746.61 s [vector] elemIndex: OK
  10716. 746.61 s [vector] +++ OK, passed 100 tests.
  10717. 746.61 s [vector] elemIndices: OK
  10718. 746.61 s [vector] +++ OK, passed 100 tests.
  10719. 746.62 s [vector] foldl: OK
  10720. 746.62 s [vector] +++ OK, passed 100 tests.
  10721. 746.62 s [vector] foldl1: OK
  10722. 746.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10723. 746.63 s [vector] foldl': OK
  10724. 746.63 s [vector] +++ OK, passed 100 tests.
  10725. 746.63 s [vector] foldl1': OK
  10726. 746.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10727. 746.64 s [vector] foldr: OK
  10728. 746.64 s [vector] +++ OK, passed 100 tests.
  10729. 746.64 s [vector] foldr1: OK
  10730. 746.64 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10731. 746.64 s [vector] foldr': OK
  10732. 746.65 s [vector] +++ OK, passed 100 tests.
  10733. 746.65 s [vector] foldr1': OK
  10734. 746.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10735. 746.65 s [vector] ifoldl: OK
  10736. 746.65 s [vector] +++ OK, passed 100 tests.
  10737. 746.66 s [vector] ifoldl': OK
  10738. 746.66 s [vector] +++ OK, passed 100 tests.
  10739. 746.67 s [vector] ifoldr: OK
  10740. 746.67 s [vector] +++ OK, passed 100 tests.
  10741. 746.67 s [vector] ifoldr': OK
  10742. 746.67 s [vector] +++ OK, passed 100 tests.
  10743. 746.68 s [vector] ifoldM: OK
  10744. 746.68 s [vector] +++ OK, passed 100 tests.
  10745. 746.69 s [vector] ifoldM': OK
  10746. 746.69 s [vector] +++ OK, passed 100 tests.
  10747. 746.71 s [vector] ifoldM_: OK (0.03s)
  10748. 746.71 s [vector] +++ OK, passed 100 tests.
  10749. 746.74 s [vector] ifoldM'_: OK (0.03s)
  10750. 746.74 s [vector] +++ OK, passed 100 tests.
  10751. 746.74 s [vector] all: OK
  10752. 746.74 s [vector] +++ OK, passed 100 tests.
  10753. 746.75 s [vector] any: OK
  10754. 746.75 s [vector] +++ OK, passed 100 tests.
  10755. 746.75 s [vector] prescanl: OK
  10756. 746.75 s [vector] +++ OK, passed 100 tests.
  10757. 746.76 s [vector] prescanl': OK
  10758. 746.76 s [vector] +++ OK, passed 100 tests.
  10759. 746.76 s [vector] postscanl: OK
  10760. 746.76 s [vector] +++ OK, passed 100 tests.
  10761. 746.77 s [vector] postscanl': OK
  10762. 746.77 s [vector] +++ OK, passed 100 tests.
  10763. 746.77 s [vector] scanl: OK
  10764. 746.77 s [vector] +++ OK, passed 100 tests.
  10765. 746.78 s [vector] scanl': OK
  10766. 746.79 s [vector] +++ OK, passed 100 tests.
  10767. 746.79 s [vector] scanl1: OK
  10768. 746.79 s [vector] +++ OK, passed 100 tests.
  10769. 746.79 s [vector] scanl1': OK
  10770. 746.79 s [vector] +++ OK, passed 100 tests.
  10771. 746.80 s [vector] iscanl: OK
  10772. 746.80 s [vector] +++ OK, passed 100 tests.
  10773. 746.80 s [vector] iscanl': OK
  10774. 746.80 s [vector] +++ OK, passed 100 tests.
  10775. 746.80 s [vector] prescanr: OK
  10776. 746.80 s [vector] +++ OK, passed 100 tests.
  10777. 746.81 s [vector] prescanr': OK
  10778. 746.81 s [vector] +++ OK, passed 100 tests.
  10779. 746.81 s [vector] postscanr: OK
  10780. 746.82 s [vector] +++ OK, passed 100 tests.
  10781. 746.82 s [vector] postscanr': OK
  10782. 746.82 s [vector] +++ OK, passed 100 tests.
  10783. 746.83 s [vector] scanr: OK
  10784. 746.83 s [vector] +++ OK, passed 100 tests.
  10785. 746.83 s [vector] scanr': OK
  10786. 746.83 s [vector] +++ OK, passed 100 tests.
  10787. 746.84 s [vector] scanr1: OK
  10788. 746.84 s [vector] +++ OK, passed 100 tests.
  10789. 746.84 s [vector] scanr1': OK
  10790. 746.85 s [vector] +++ OK, passed 100 tests.
  10791. 746.85 s [vector] iscanr: OK
  10792. 746.85 s [vector] +++ OK, passed 100 tests.
  10793. 746.86 s [vector] iscanr': OK
  10794. 746.86 s [vector] +++ OK, passed 100 tests.
  10795. 746.86 s [vector] mut_read: OK
  10796. 746.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10797. 746.86 s [vector] mut_write: OK
  10798. 746.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10799. 746.86 s [vector] mut_modify: OK
  10800. 746.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10801. 746.87 s [vector] mut_generate: OK
  10802. 746.87 s [vector] +++ OK, passed 100 tests.
  10803. 746.89 s [vector] mut_generateM: OK (0.03s)
  10804. 746.89 s [vector] +++ OK, passed 100 tests.
  10805. 746.93 s [vector] mut_mapM_: OK (0.03s)
  10806. 746.93 s [vector] +++ OK, passed 100 tests.
  10807. 746.95 s [vector] mut_imapM_: OK (0.03s)
  10808. 746.95 s [vector] +++ OK, passed 100 tests.
  10809. 746.99 s [vector] mut_forM_: OK (0.03s)
  10810. 746.99 s [vector] +++ OK, passed 100 tests.
  10811. 747.01 s [vector] mut_iforM_: OK (0.03s)
  10812. 747.01 s [vector] +++ OK, passed 100 tests.
  10813. 747.02 s [vector] mut_foldr: OK
  10814. 747.02 s [vector] +++ OK, passed 100 tests.
  10815. 747.03 s [vector] mut_foldr': OK
  10816. 747.03 s [vector] +++ OK, passed 100 tests.
  10817. 747.03 s [vector] mut_foldl: OK
  10818. 747.03 s [vector] +++ OK, passed 100 tests.
  10819. 747.04 s [vector] mut_foldl': OK
  10820. 747.04 s [vector] +++ OK, passed 100 tests.
  10821. 747.04 s [vector] mut_ifoldr: OK
  10822. 747.04 s [vector] +++ OK, passed 100 tests.
  10823. 747.04 s [vector] mut_ifoldr': OK
  10824. 747.04 s [vector] +++ OK, passed 100 tests.
  10825. 747.05 s [vector] mut_ifoldl: OK
  10826. 747.05 s [vector] +++ OK, passed 100 tests.
  10827. 747.07 s [vector] mut_ifoldl': OK
  10828. 747.07 s [vector] +++ OK, passed 100 tests.
  10829. 747.07 s [vector] mut_foldM: OK
  10830. 747.07 s [vector] +++ OK, passed 100 tests.
  10831. 747.07 s [vector] mut_foldM': OK
  10832. 747.07 s [vector] +++ OK, passed 100 tests.
  10833. 747.08 s [vector] mut_foldrM: OK
  10834. 747.09 s [vector] +++ OK, passed 100 tests.
  10835. 747.09 s [vector] mut_foldrM': OK
  10836. 747.09 s [vector] +++ OK, passed 100 tests.
  10837. 747.09 s [vector] mut_ifoldM: OK
  10838. 747.09 s [vector] +++ OK, passed 100 tests.
  10839. 747.10 s [vector] mut_ifoldM': OK
  10840. 747.10 s [vector] +++ OK, passed 100 tests.
  10841. 747.10 s [vector] mut_ifoldrM: OK
  10842. 747.10 s [vector] +++ OK, passed 100 tests.
  10843. 747.10 s [vector] mut_ifoldrM': OK
  10844. 747.10 s [vector] +++ OK, passed 100 tests.
  10845. 747.10 s [vector] compare: OK
  10846. 747.10 s [vector] +++ OK, passed 100 tests.
  10847. 747.11 s [vector] maximum: OK
  10848. 747.11 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10849. 747.11 s [vector] minimum: OK
  10850. 747.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10851. 747.11 s [vector] minIndex: OK
  10852. 747.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10853. 747.11 s [vector] maxIndex: OK
  10854. 747.11 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10855. 747.11 s [vector] maximumBy: OK
  10856. 747.11 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10857. 747.11 s [vector] minimumBy: OK
  10858. 747.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10859. 747.11 s [vector] maximumOn: OK
  10860. 747.11 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10861. 747.11 s [vector] minimumOn: OK
  10862. 747.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10863. 747.12 s [vector] maxIndexBy: OK
  10864. 747.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10865. 747.12 s [vector] minIndexBy: OK
  10866. 747.12 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10867. 747.12 s [vector] ListFirstMaxIndexWins: OK
  10868. 747.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10869. 747.12 s [vector] FalseListFirstMaxIndexWins: OK
  10870. 747.12 s [vector] +++ OK, failed as expected. (after 1 test):
  10871. 747.12 s [vector] Exception:
  10872. 747.12 s [vector] Prelude.foldr1: empty list
  10873. 747.13 s [vector] CallStack (from HasCallStack):
  10874. 747.13 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  10875. 747.13 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  10876. 747.13 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10877. 747.13 s [vector] []
  10878. 747.13 s [vector] zip: OK
  10879. 747.13 s [vector] +++ OK, passed 100 tests.
  10880. 747.13 s [vector] zip3: OK
  10881. 747.13 s [vector] +++ OK, passed 100 tests.
  10882. 747.13 s [vector] unzip: OK
  10883. 747.13 s [vector] +++ OK, passed 100 tests.
  10884. 747.14 s [vector] unzip3: OK
  10885. 747.14 s [vector] +++ OK, passed 100 tests.
  10886. 747.14 s [vector] indexed: OK
  10887. 747.14 s [vector] +++ OK, passed 100 tests.
  10888. 747.14 s [vector] update: OK
  10889. 747.14 s [vector] +++ OK, passed 100 tests.
  10890. 747.14 s [vector] mempty: OK
  10891. 747.14 s [vector] +++ OK, passed 100 tests.
  10892. 747.15 s [vector] mappend: OK
  10893. 747.15 s [vector] +++ OK, passed 100 tests.
  10894. 747.18 s [vector] mconcat: OK (0.03s)
  10895. 747.18 s [vector] +++ OK, passed 100 tests.
  10896. 747.18 s [vector] glength: OK
  10897. 747.18 s [vector] +++ OK, passed 100 tests.
  10898. 747.18 s [vector] (Int,Bool,Int)
  10899. 747.18 s [vector] fromList.toList == id: OK
  10900. 747.19 s [vector] +++ OK, passed 100 tests.
  10901. 747.19 s [vector] toList.fromList == id: OK
  10902. 747.19 s [vector] +++ OK, passed 100 tests.
  10903. 747.19 s [vector] unstream.stream == id: OK
  10904. 747.19 s [vector] +++ OK, passed 100 tests.
  10905. 747.19 s [vector] stream.unstream == id: OK
  10906. 747.19 s [vector] +++ OK, passed 100 tests.
  10907. 747.19 s [vector] eq: OK
  10908. 747.19 s [vector] +++ OK, passed 100 tests.
  10909. 747.19 s [vector] length: OK
  10910. 747.19 s [vector] +++ OK, passed 100 tests.
  10911. 747.19 s [vector] null: OK
  10912. 747.19 s [vector] +++ OK, passed 100 tests.
  10913. 747.19 s [vector] index: OK
  10914. 747.19 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10915. 747.19 s [vector] safeIndex: OK
  10916. 747.19 s [vector] +++ OK, passed 100 tests.
  10917. 747.19 s [vector] head: OK
  10918. 747.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10919. 747.19 s [vector] last: OK
  10920. 747.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10921. 747.20 s [vector] unsafeIndex: OK
  10922. 747.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10923. 747.20 s [vector] unsafeHead: OK
  10924. 747.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10925. 747.20 s [vector] unsafeLast: OK
  10926. 747.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10927. 747.20 s [vector] slice: OK
  10928. 747.20 s [vector] +++ OK, passed 100 tests.
  10929. 747.20 s [vector] init: OK
  10930. 747.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10931. 747.21 s [vector] tail: OK
  10932. 747.21 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10933. 747.21 s [vector] take: OK
  10934. 747.21 s [vector] +++ OK, passed 100 tests.
  10935. 747.21 s [vector] drop: OK
  10936. 747.21 s [vector] +++ OK, passed 100 tests.
  10937. 747.21 s [vector] splitAt: OK
  10938. 747.21 s [vector] +++ OK, passed 100 tests.
  10939. 747.21 s [vector] empty: OK
  10940. 747.21 s [vector] +++ OK, passed 100 tests.
  10941. 747.21 s [vector] singleton: OK
  10942. 747.21 s [vector] +++ OK, passed 100 tests.
  10943. 747.21 s [vector] replicate: OK
  10944. 747.21 s [vector] +++ OK, passed 100 tests.
  10945. 747.21 s [vector] generate: OK
  10946. 747.21 s [vector] +++ OK, passed 100 tests.
  10947. 747.24 s [vector] iterateN: OK
  10948. 747.24 s [vector] +++ OK, passed 100 tests.
  10949. 747.27 s [vector] iterateNM: OK (0.05s)
  10950. 747.27 s [vector] +++ OK, passed 100 tests.
  10951. 747.29 s [vector] generateM: OK (0.03s)
  10952. 747.29 s [vector] +++ OK, passed 100 tests.
  10953. 747.30 s [vector] replicateM: OK
  10954. 747.30 s [vector] +++ OK, passed 100 tests.
  10955. 747.31 s [vector] create: OK
  10956. 747.31 s [vector] +++ OK, passed 100 tests.
  10957. 747.31 s [vector] createT: OK
  10958. 747.31 s [vector] +++ OK, passed 100 tests.
  10959. 747.31 s [vector] unfoldr: OK
  10960. 747.31 s [vector] +++ OK, passed 100 tests.
  10961. 747.31 s [vector] unfoldrN: OK
  10962. 747.31 s [vector] +++ OK, passed 100 tests.
  10963. 747.31 s [vector] unfoldrExactN: OK
  10964. 747.33 s [vector] +++ OK, passed 100 tests.
  10965. 747.34 s [vector] unfoldrM: OK
  10966. 747.34 s [vector] +++ OK, passed 100 tests.
  10967. 747.34 s [vector] unfoldrNM: OK (0.01s)
  10968. 747.34 s [vector] +++ OK, passed 100 tests.
  10969. 747.35 s [vector] unfoldrExactNM: OK (0.02s)
  10970. 747.35 s [vector] +++ OK, passed 100 tests.
  10971. 747.36 s [vector] constructN: OK
  10972. 747.36 s [vector] +++ OK, passed 100 tests.
  10973. 747.37 s [vector] constructrN: OK
  10974. 747.37 s [vector] +++ OK, passed 100 tests.
  10975. 747.37 s [vector] cons: OK
  10976. 747.37 s [vector] +++ OK, passed 100 tests.
  10977. 747.38 s [vector] snoc: OK
  10978. 747.39 s [vector] +++ OK, passed 100 tests.
  10979. 747.39 s [vector] append: OK
  10980. 747.39 s [vector] +++ OK, passed 100 tests.
  10981. 747.43 s [vector] concat: OK (0.05s)
  10982. 747.43 s [vector] +++ OK, passed 100 tests.
  10983. 747.43 s [vector] force: OK
  10984. 747.43 s [vector] +++ OK, passed 100 tests.
  10985. 747.45 s [vector] upd: OK
  10986. 747.45 s [vector] +++ OK, passed 100 tests.
  10987. 747.45 s [vector] accum: OK (0.01s)
  10988. 747.45 s [vector] +++ OK, passed 100 tests.
  10989. 747.46 s [vector] reverse: OK
  10990. 747.46 s [vector] +++ OK, passed 100 tests.
  10991. 747.49 s [vector] backpermute: OK
  10992. 747.49 s [vector] +++ OK, passed 100 tests.
  10993. 747.49 s [vector] map: OK
  10994. 747.49 s [vector] +++ OK, passed 100 tests.
  10995. 747.49 s [vector] imap: OK
  10996. 747.49 s [vector] +++ OK, passed 100 tests.
  10997. 747.49 s [vector] concatMap: OK
  10998. 747.49 s [vector] +++ OK, passed 100 tests.
  10999. 747.49 s [vector] mapM: OK
  11000. 747.49 s [vector] +++ OK, passed 100 tests.
  11001. 747.53 s [vector] mapM_: OK (0.04s)
  11002. 747.53 s [vector] +++ OK, passed 100 tests.
  11003. 747.53 s [vector] forM: OK
  11004. 747.53 s [vector] +++ OK, passed 100 tests.
  11005. 747.59 s [vector] forM_: OK (0.04s)
  11006. 747.59 s [vector] +++ OK, passed 100 tests.
  11007. 747.61 s [vector] imapM: OK
  11008. 747.61 s [vector] +++ OK, passed 100 tests.
  11009. 747.65 s [vector] imapM_: OK (0.05s)
  11010. 747.65 s [vector] +++ OK, passed 100 tests.
  11011. 747.66 s [vector] zipWith: OK
  11012. 747.66 s [vector] +++ OK, passed 100 tests.
  11013. 747.67 s [vector] zipWith3: OK
  11014. 747.67 s [vector] +++ OK, passed 100 tests.
  11015. 747.68 s [vector] izipWith: OK
  11016. 747.68 s [vector] +++ OK, passed 100 tests.
  11017. 747.68 s [vector] izipWith3: OK
  11018. 747.68 s [vector] +++ OK, passed 100 tests.
  11019. 747.69 s [vector] izipWithM: OK
  11020. 747.69 s [vector] +++ OK, passed 100 tests.
  11021. 747.72 s [vector] izipWithM_: OK (0.03s)
  11022. 747.72 s [vector] +++ OK, passed 100 tests.
  11023. 747.73 s [vector] zipWithM: OK
  11024. 747.73 s [vector] +++ OK, passed 100 tests.
  11025. 747.76 s [vector] zipWithM_: OK (0.03s)
  11026. 747.77 s [vector] +++ OK, passed 100 tests.
  11027. 747.77 s [vector] filter: OK
  11028. 747.77 s [vector] +++ OK, passed 100 tests.
  11029. 747.77 s [vector] ifilter: OK
  11030. 747.77 s [vector] +++ OK, passed 100 tests.
  11031. 747.85 s [vector] filterM: OK (0.07s)
  11032. 747.85 s [vector] +++ OK, passed 100 tests.
  11033. 747.85 s [vector] uniq: OK
  11034. 747.85 s [vector] +++ OK, passed 100 tests.
  11035. 747.85 s [vector] mapMaybe: OK
  11036. 747.85 s [vector] +++ OK, passed 100 tests.
  11037. 747.86 s [vector] imapMaybe: OK
  11038. 747.86 s [vector] +++ OK, passed 100 tests.
  11039. 747.86 s [vector] takeWhile: OK
  11040. 747.87 s [vector] +++ OK, passed 100 tests.
  11041. 747.87 s [vector] dropWhile: OK
  11042. 747.87 s [vector] +++ OK, passed 100 tests.
  11043. 747.88 s [vector] partition: OK
  11044. 747.88 s [vector] +++ OK, passed 100 tests.
  11045. 747.88 s [vector] partitionWith: OK
  11046. 747.88 s [vector] +++ OK, passed 100 tests.
  11047. 747.88 s [vector] span: OK
  11048. 747.88 s [vector] +++ OK, passed 100 tests.
  11049. 747.88 s [vector] break: OK
  11050. 747.88 s [vector] +++ OK, passed 100 tests.
  11051. 747.88 s [vector] spanR: OK
  11052. 747.89 s [vector] +++ OK, passed 100 tests.
  11053. 747.89 s [vector] breakR: OK
  11054. 747.89 s [vector] +++ OK, passed 100 tests.
  11055. 747.89 s [vector] groupBy: OK
  11056. 747.89 s [vector] +++ OK, passed 100 tests.
  11057. 747.89 s [vector] elem: OK
  11058. 747.89 s [vector] +++ OK, passed 100 tests.
  11059. 747.89 s [vector] notElem: OK
  11060. 747.89 s [vector] +++ OK, passed 100 tests.
  11061. 747.89 s [vector] find: OK
  11062. 747.90 s [vector] +++ OK, passed 100 tests.
  11063. 747.90 s [vector] findIndex: OK
  11064. 747.90 s [vector] +++ OK, passed 100 tests.
  11065. 747.90 s [vector] findIndexR: OK
  11066. 747.90 s [vector] +++ OK, passed 100 tests.
  11067. 747.90 s [vector] findIndices: OK
  11068. 747.90 s [vector] +++ OK, passed 100 tests.
  11069. 747.90 s [vector] elemIndex: OK
  11070. 747.91 s [vector] +++ OK, passed 100 tests.
  11071. 747.91 s [vector] elemIndices: OK
  11072. 747.91 s [vector] +++ OK, passed 100 tests.
  11073. 747.92 s [vector] foldl: OK
  11074. 747.92 s [vector] +++ OK, passed 100 tests.
  11075. 747.92 s [vector] foldl1: OK
  11076. 747.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11077. 747.93 s [vector] foldl': OK
  11078. 747.93 s [vector] +++ OK, passed 100 tests.
  11079. 747.93 s [vector] foldl1': OK
  11080. 747.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11081. 747.94 s [vector] foldr: OK
  11082. 747.94 s [vector] +++ OK, passed 100 tests.
  11083. 747.94 s [vector] foldr1: OK
  11084. 747.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11085. 747.96 s [vector] foldr': OK
  11086. 747.96 s [vector] +++ OK, passed 100 tests.
  11087. 747.97 s [vector] foldr1': OK
  11088. 747.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11089. 747.99 s [vector] ifoldl: OK (0.01s)
  11090. 747.99 s [vector] +++ OK, passed 100 tests.
  11091. 748.01 s [vector] ifoldl': OK (0.01s)
  11092. 748.01 s [vector] +++ OK, passed 100 tests.
  11093. 748.01 s [vector] ifoldr: OK (0.01s)
  11094. 748.01 s [vector] +++ OK, passed 100 tests.
  11095. 748.02 s [vector] ifoldr': OK
  11096. 748.02 s [vector] +++ OK, passed 100 tests.
  11097. 748.03 s [vector] ifoldM: OK
  11098. 748.03 s [vector] +++ OK, passed 100 tests.
  11099. 748.05 s [vector] ifoldM': OK
  11100. 748.05 s [vector] +++ OK, passed 100 tests.
  11101. 748.09 s [vector] ifoldM_: OK (0.04s)
  11102. 748.09 s [vector] +++ OK, passed 100 tests.
  11103. 748.12 s [vector] ifoldM'_: OK (0.04s)
  11104. 748.43 s [vector] +++ OK, passed 100 tests.
  11105. 748.44 s [vector] all: OK
  11106. 748.44 s [vector] +++ OK, passed 100 tests.
  11107. 748.44 s [vector] any: OK
  11108. 748.44 s [vector] +++ OK, passed 100 tests.
  11109. 748.44 s [vector] prescanl: OK
  11110. 748.44 s [vector] +++ OK, passed 100 tests.
  11111. 748.44 s [vector] prescanl': OK
  11112. 748.44 s [vector] +++ OK, passed 100 tests.
  11113. 748.44 s [vector] postscanl: OK
  11114. 748.44 s [vector] +++ OK, passed 100 tests.
  11115. 748.44 s [vector] postscanl': OK (0.01s)
  11116. 748.44 s [vector] +++ OK, passed 100 tests.
  11117. 748.44 s [vector] scanl: OK
  11118. 748.44 s [vector] +++ OK, passed 100 tests.
  11119. 748.44 s [vector] scanl': OK
  11120. 748.44 s [vector] +++ OK, passed 100 tests.
  11121. 748.44 s [vector] scanl1: OK
  11122. 748.44 s [vector] +++ OK, passed 100 tests.
  11123. 748.44 s [vector] scanl1': OK
  11124. 748.44 s [vector] +++ OK, passed 100 tests.
  11125. 748.44 s [vector] iscanl: OK
  11126. 748.44 s [vector] +++ OK, passed 100 tests.
  11127. 748.44 s [vector] iscanl': OK
  11128. 748.44 s [vector] +++ OK, passed 100 tests.
  11129. 748.44 s [vector] prescanr: OK
  11130. 748.44 s [vector] +++ OK, passed 100 tests.
  11131. 748.44 s [vector] prescanr': OK
  11132. 748.44 s [vector] +++ OK, passed 100 tests.
  11133. 748.44 s [vector] postscanr: OK
  11134. 748.44 s [vector] +++ OK, passed 100 tests.
  11135. 748.44 s [vector] postscanr': OK
  11136. 748.44 s [vector] +++ OK, passed 100 tests.
  11137. 748.44 s [vector] scanr: OK (0.01s)
  11138. 748.44 s [vector] +++ OK, passed 100 tests.
  11139. 748.44 s [vector] scanr': OK
  11140. 748.44 s [vector] +++ OK, passed 100 tests.
  11141. 748.44 s [vector] scanr1: OK
  11142. 748.44 s [vector] +++ OK, passed 100 tests.
  11143. 748.44 s [vector] scanr1': OK
  11144. 748.44 s [vector] +++ OK, passed 100 tests.
  11145. 748.44 s [vector] iscanr: OK
  11146. 748.44 s [vector] +++ OK, passed 100 tests.
  11147. 748.44 s [vector] iscanr': OK
  11148. 748.44 s [vector] +++ OK, passed 100 tests.
  11149. 748.44 s [vector] mut_read: OK
  11150. 748.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11151. 748.44 s [vector] mut_write: OK
  11152. 748.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11153. 748.44 s [vector] mut_modify: OK
  11154. 748.44 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11155. 748.44 s [vector] mut_generate: OK
  11156. 748.44 s [vector] +++ OK, passed 100 tests.
  11157. 748.44 s [vector] mut_generateM: OK (0.03s)
  11158. 748.44 s [vector] +++ OK, passed 100 tests.
  11159. 748.44 s [vector] mut_mapM_: OK (0.04s)
  11160. 748.44 s [vector] +++ OK, passed 100 tests.
  11161. 748.44 s [vector] mut_imapM_: OK (0.03s)
  11162. 748.44 s [vector] +++ OK, passed 100 tests.
  11163. 748.49 s [vector] mut_forM_: OK (0.05s)
  11164. 748.49 s [vector] +++ OK, passed 100 tests.
  11165. 748.53 s [vector] mut_iforM_: OK (0.05s)
  11166. 748.53 s [vector] +++ OK, passed 100 tests.
  11167. 748.53 s [vector] mut_foldr: OK
  11168. 748.53 s [vector] +++ OK, passed 100 tests.
  11169. 748.55 s [vector] mut_foldr': OK
  11170. 748.55 s [vector] +++ OK, passed 100 tests.
  11171. 748.55 s [vector] mut_foldl: OK (0.01s)
  11172. 748.55 s [vector] +++ OK, passed 100 tests.
  11173. 748.55 s [vector] mut_foldl': OK
  11174. 748.55 s [vector] +++ OK, passed 100 tests.
  11175. 748.56 s [vector] mut_ifoldr: OK
  11176. 748.56 s [vector] +++ OK, passed 100 tests.
  11177. 748.57 s [vector] mut_ifoldr': OK
  11178. 748.57 s [vector] +++ OK, passed 100 tests.
  11179. 748.58 s [vector] mut_ifoldl: OK
  11180. 748.59 s [vector] +++ OK, passed 100 tests.
  11181. 748.59 s [vector] mut_ifoldl': OK
  11182. 748.59 s [vector] +++ OK, passed 100 tests.
  11183. 748.60 s [vector] mut_foldM: OK
  11184. 748.60 s [vector] +++ OK, passed 100 tests.
  11185. 748.61 s [vector] mut_foldM': OK
  11186. 748.61 s [vector] +++ OK, passed 100 tests.
  11187. 748.61 s [vector] mut_foldrM: OK
  11188. 748.61 s [vector] +++ OK, passed 100 tests.
  11189. 748.62 s [vector] mut_foldrM': OK
  11190. 748.62 s [vector] +++ OK, passed 100 tests.
  11191. 748.63 s [vector] mut_ifoldM: OK
  11192. 748.63 s [vector] +++ OK, passed 100 tests.
  11193. 748.64 s [vector] mut_ifoldM': OK
  11194. 748.64 s [vector] +++ OK, passed 100 tests.
  11195. 748.64 s [vector] mut_ifoldrM: OK
  11196. 748.65 s [vector] +++ OK, passed 100 tests.
  11197. 748.65 s [vector] mut_ifoldrM': OK
  11198. 748.65 s [vector] +++ OK, passed 100 tests.
  11199. 748.65 s [vector] compare: OK
  11200. 748.65 s [vector] +++ OK, passed 100 tests.
  11201. 748.65 s [vector] maximum: OK
  11202. 748.65 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11203. 748.65 s [vector] minimum: OK
  11204. 748.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11205. 748.66 s [vector] minIndex: OK
  11206. 748.66 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11207. 748.66 s [vector] maxIndex: OK
  11208. 748.66 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11209. 748.66 s [vector] maximumBy: OK
  11210. 748.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11211. 748.66 s [vector] minimumBy: OK
  11212. 748.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11213. 748.66 s [vector] maximumOn: OK
  11214. 748.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11215. 748.66 s [vector] minimumOn: OK
  11216. 748.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11217. 748.66 s [vector] maxIndexBy: OK
  11218. 748.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11219. 748.67 s [vector] minIndexBy: OK
  11220. 748.67 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11221. 748.67 s [vector] ListFirstMaxIndexWins: OK
  11222. 748.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11223. 748.67 s [vector] FalseListFirstMaxIndexWins: OK
  11224. 748.67 s [vector] +++ OK, failed as expected. (after 1 test):
  11225. 748.67 s [vector] Exception:
  11226. 748.67 s [vector] Prelude.foldr1: empty list
  11227. 748.67 s [vector] CallStack (from HasCallStack):
  11228. 748.67 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  11229. 748.67 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  11230. 748.67 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11231. 748.67 s [vector] []
  11232. 748.67 s [vector] zip: OK
  11233. 748.67 s [vector] +++ OK, passed 100 tests.
  11234. 748.68 s [vector] zip3: OK
  11235. 748.68 s [vector] +++ OK, passed 100 tests.
  11236. 748.69 s [vector] unzip: OK
  11237. 748.69 s [vector] +++ OK, passed 100 tests.
  11238. 748.69 s [vector] unzip3: OK
  11239. 748.69 s [vector] +++ OK, passed 100 tests.
  11240. 748.69 s [vector] indexed: OK
  11241. 748.69 s [vector] +++ OK, passed 100 tests.
  11242. 748.70 s [vector] update: OK
  11243. 748.70 s [vector] +++ OK, passed 100 tests.
  11244. 748.70 s [vector] mempty: OK
  11245. 748.70 s [vector] +++ OK, passed 100 tests.
  11246. 748.70 s [vector] mappend: OK
  11247. 748.71 s [vector] +++ OK, passed 100 tests.
  11248. 748.75 s [vector] mconcat: OK (0.05s)
  11249. 748.75 s [vector] +++ OK, passed 100 tests.
  11250. 748.75 s [vector] glength: OK
  11251. 748.75 s [vector] +++ OK, passed 100 tests.
  11252. 748.75 s [vector] unstream
  11253. 748.75 s [vector] unstream == vunstream (exact): OK
  11254. 748.76 s [vector] +++ OK, passed 100 tests.
  11255. 748.76 s [vector] unstream == vunstream (unknown): OK
  11256. 748.76 s [vector] +++ OK, passed 100 tests.
  11257. 748.76 s [vector] unstreamR ~= vunstream (exact): OK
  11258. 748.76 s [vector] +++ OK, passed 100 tests.
  11259. 748.76 s [vector] unstreamR ~= vunstream (unknown): OK
  11260. 748.76 s [vector] +++ OK, passed 100 tests.
  11261. 748.76 s [vector] Data.Vector.Storable.Vector Alignment
  11262. 748.76 s [vector] Aligned Double: OK
  11263. 748.76 s [vector] Aligned Int: OK
  11264. 748.76 s [vector] Regression tests
  11265. 748.76 s [vector] enumFromTo crash #188
  11266. 748.76 s [vector] Word8: OK
  11267. 748.76 s [vector] Word16: OK
  11268. 748.76 s [vector] Word32: OK
  11269. 748.76 s [vector] Word64: OK
  11270. 748.76 s [vector] Word: OK
  11271. 748.76 s [vector] Int8: OK
  11272. 748.76 s [vector] Int16: OK
  11273. 748.76 s [vector] Int32: OK
  11274. 748.76 s [vector] Int64: OK
  11275. 748.76 s [vector] Int: OK
  11276. 748.76 s [vector] Char: OK
  11277. 748.76 s [vector] Negative tests
  11278. 748.76 s [vector] slice out of bounds #257
  11279. 748.76 s [vector] Boxed
  11280. 748.76 s [vector] Negative ix: OK
  11281. 748.76 s [vector] Negative size: OK
  11282. 748.76 s [vector] Negative ix and size: OK
  11283. 748.76 s [vector] Too large ix: OK
  11284. 748.76 s [vector] Too large size: OK
  11285. 748.76 s [vector] Too large ix and size: OK
  11286. 748.76 s [vector] Overflow: OK
  11287. 748.76 s [vector] OutOfMemory: OK
  11288. 748.76 s [vector] Primitive
  11289. 748.76 s [vector] Negative ix: OK
  11290. 748.76 s [vector] Negative size: OK
  11291. 748.76 s [vector] Negative ix and size: OK
  11292. 748.76 s [vector] Too large ix: OK
  11293. 748.76 s [vector] Too large size: OK
  11294. 748.76 s [vector] Too large ix and size: OK
  11295. 748.76 s [vector] Overflow: OK
  11296. 748.76 s [vector] OutOfMemory: OK
  11297. 748.76 s [vector] Storable
  11298. 748.76 s [vector] Negative ix: OK
  11299. 748.76 s [vector] Negative size: OK
  11300. 748.76 s [vector] Negative ix and size: OK
  11301. 748.76 s [vector] Too large ix: OK
  11302. 748.76 s [vector] Too large size: OK
  11303. 748.76 s [vector] Too large ix and size: OK
  11304. 748.76 s [vector] Overflow: OK
  11305. 748.76 s [vector] OutOfMemory: OK
  11306. 748.76 s [vector] Unboxed
  11307. 748.76 s [vector] Negative ix: OK
  11308. 748.76 s [vector] Negative size: OK
  11309. 748.76 s [vector] Negative ix and size: OK
  11310. 748.76 s [vector] Too large ix: OK
  11311. 748.76 s [vector] Too large size: OK
  11312. 748.76 s [vector] Too large ix and size: OK
  11313. 748.76 s [vector] Overflow: OK
  11314. 748.76 s [vector] OutOfMemory: OK
  11315. 748.76 s [vector] take #282
  11316. 748.76 s [vector] Boxed: OK
  11317. 748.76 s [vector] Primitive: OK
  11318. 748.76 s [vector] Storable: OK
  11319. 748.76 s [vector] Unboxed: OK
  11320. 748.76 s [vector] Data.Vector
  11321. 748.76 s [vector] MonadFix: OK
  11322. 748.76 s [vector] toFromArray: OK
  11323. 748.76 s [vector] toFromArraySlice: OK
  11324. 748.76 s [vector] toFromArraySliceUnsafe: OK
  11325. 748.76 s [vector] toFromMutableArray: OK
  11326. 748.76 s [vector] Data.Vector.Mutable (Move): OK
  11327. 748.76 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11328. 748.76 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  11329. 748.76 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11330. 748.77 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  11331. 748.77 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11332. 748.77 s [vector] Data.Vector.Storable.Mutable (Move): OK
  11333. 748.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11334. 748.79 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.01s)
  11335. 748.79 s [vector] +++ OK, passed 100 tests.
  11336. 748.80 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.02s)
  11337. 748.80 s [vector] +++ OK, passed 100 tests.
  11338. 748.80 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  11339. 748.80 s [vector] +++ OK, passed 100 tests.
  11340. 748.80 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  11341. 748.80 s [vector] +++ OK, passed 100 tests.
  11342. 748.80 s [vector]
  11343. 748.80 s [vector] All 2808 tests passed (15.71s)
  11344. 748.81 s [vector] Test suite vector-tests-O0: PASS
  11345. 748.81 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  11346. 748.81 s [vector] Test suite vector-tests-O2: RUNNING...
  11347. 748.95 s [vector] toplevel
  11348. 748.95 s [vector] Data.Vector.Fusion.Bundle
  11349. 748.96 s [vector] fromList.toList == id: OK
  11350. 748.96 s [vector] +++ OK, passed 100 tests.
  11351. 748.97 s [vector] toList.fromList == id: OK
  11352. 748.97 s [vector] +++ OK, passed 100 tests.
  11353. 748.97 s [vector] eq: OK
  11354. 748.97 s [vector] +++ OK, passed 100 tests.
  11355. 748.97 s [vector] length: OK
  11356. 748.97 s [vector] +++ OK, passed 100 tests.
  11357. 748.97 s [vector] null: OK
  11358. 748.97 s [vector] +++ OK, passed 100 tests.
  11359. 748.97 s [vector] empty: OK
  11360. 748.97 s [vector] +++ OK, passed 100 tests.
  11361. 748.97 s [vector] singleton: OK
  11362. 748.97 s [vector] +++ OK, passed 100 tests.
  11363. 748.97 s [vector] replicate: OK
  11364. 748.97 s [vector] +++ OK, passed 100 tests.
  11365. 748.97 s [vector] cons: OK
  11366. 748.98 s [vector] +++ OK, passed 100 tests.
  11367. 748.98 s [vector] snoc: OK
  11368. 748.98 s [vector] +++ OK, passed 100 tests.
  11369. 748.98 s [vector] append: OK
  11370. 748.98 s [vector] +++ OK, passed 100 tests.
  11371. 748.98 s [vector] head: OK
  11372. 748.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11373. 748.98 s [vector] last: OK
  11374. 748.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11375. 748.98 s [vector] index: OK
  11376. 748.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11377. 748.98 s [vector] extract: OK
  11378. 748.98 s [vector] +++ OK, passed 100 tests.
  11379. 748.98 s [vector] init: OK
  11380. 748.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11381. 748.98 s [vector] tail: OK
  11382. 748.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11383. 748.98 s [vector] take: OK
  11384. 749.00 s [vector] +++ OK, passed 100 tests.
  11385. 749.00 s [vector] drop: OK
  11386. 749.00 s [vector] +++ OK, passed 100 tests.
  11387. 749.00 s [vector] map: OK
  11388. 749.00 s [vector] +++ OK, passed 100 tests.
  11389. 749.00 s [vector] zipWith: OK
  11390. 749.00 s [vector] +++ OK, passed 100 tests.
  11391. 749.00 s [vector] zipWith3: OK
  11392. 749.00 s [vector] +++ OK, passed 100 tests.
  11393. 749.00 s [vector] filter: OK
  11394. 749.00 s [vector] +++ OK, passed 100 tests.
  11395. 749.00 s [vector] takeWhile: OK
  11396. 749.00 s [vector] +++ OK, passed 100 tests.
  11397. 749.00 s [vector] dropWhile: OK
  11398. 749.01 s [vector] +++ OK, passed 100 tests.
  11399. 749.01 s [vector] elem: OK
  11400. 749.01 s [vector] +++ OK, passed 100 tests.
  11401. 749.01 s [vector] notElem: OK
  11402. 749.01 s [vector] +++ OK, passed 100 tests.
  11403. 749.01 s [vector] find: OK
  11404. 749.01 s [vector] +++ OK, passed 100 tests.
  11405. 749.01 s [vector] findIndex: OK
  11406. 749.01 s [vector] +++ OK, passed 100 tests.
  11407. 749.01 s [vector] foldl: OK
  11408. 749.01 s [vector] +++ OK, passed 100 tests.
  11409. 749.01 s [vector] foldl1: OK
  11410. 749.01 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11411. 749.01 s [vector] foldl': OK
  11412. 749.01 s [vector] +++ OK, passed 100 tests.
  11413. 749.01 s [vector] foldl1': OK
  11414. 749.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11415. 749.01 s [vector] foldr: OK
  11416. 749.01 s [vector] +++ OK, passed 100 tests.
  11417. 749.01 s [vector] foldr1: OK
  11418. 749.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11419. 749.01 s [vector] prescanl: OK
  11420. 749.01 s [vector] +++ OK, passed 100 tests.
  11421. 749.01 s [vector] prescanl': OK
  11422. 749.01 s [vector] +++ OK, passed 100 tests.
  11423. 749.01 s [vector] postscanl: OK
  11424. 749.01 s [vector] +++ OK, passed 100 tests.
  11425. 749.01 s [vector] postscanl': OK
  11426. 749.01 s [vector] +++ OK, passed 100 tests.
  11427. 749.01 s [vector] scanl: OK
  11428. 749.01 s [vector] +++ OK, passed 100 tests.
  11429. 749.02 s [vector] scanl': OK
  11430. 749.02 s [vector] +++ OK, passed 100 tests.
  11431. 749.02 s [vector] scanl1: OK
  11432. 749.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11433. 749.02 s [vector] scanl1': OK
  11434. 749.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11435. 749.02 s [vector] concatMap: OK
  11436. 749.02 s [vector] +++ OK, passed 100 tests.
  11437. 749.02 s [vector] unfoldr: OK
  11438. 749.02 s [vector] +++ OK, passed 100 tests.
  11439. 749.02 s [vector] and: OK
  11440. 749.02 s [vector] +++ OK, passed 100 tests.
  11441. 749.02 s [vector] or: OK
  11442. 749.02 s [vector] +++ OK, passed 100 tests.
  11443. 749.02 s [vector] Tests.Vector.Boxed
  11444. 749.02 s [vector] Bool
  11445. 749.02 s [vector] fromList.toList == id: OK
  11446. 749.02 s [vector] +++ OK, passed 100 tests.
  11447. 749.02 s [vector] toList.fromList == id: OK
  11448. 749.02 s [vector] +++ OK, passed 100 tests.
  11449. 749.02 s [vector] unstream.stream == id: OK
  11450. 749.02 s [vector] +++ OK, passed 100 tests.
  11451. 749.02 s [vector] stream.unstream == id: OK
  11452. 749.02 s [vector] +++ OK, passed 100 tests.
  11453. 749.02 s [vector] eq: OK
  11454. 749.02 s [vector] +++ OK, passed 100 tests.
  11455. 749.02 s [vector] length: OK
  11456. 749.02 s [vector] +++ OK, passed 100 tests.
  11457. 749.02 s [vector] null: OK
  11458. 749.02 s [vector] +++ OK, passed 100 tests.
  11459. 749.02 s [vector] index: OK
  11460. 749.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11461. 749.02 s [vector] safeIndex: OK
  11462. 749.02 s [vector] +++ OK, passed 100 tests.
  11463. 749.02 s [vector] head: OK
  11464. 749.02 s [vector] +++ OK, passed 100 tests; 24 discarded.
  11465. 749.02 s [vector] last: OK
  11466. 749.02 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11467. 749.02 s [vector] unsafeIndex: OK
  11468. 749.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11469. 749.03 s [vector] unsafeHead: OK
  11470. 749.03 s [vector] +++ OK, passed 100 tests; 25 discarded.
  11471. 749.03 s [vector] unsafeLast: OK
  11472. 749.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11473. 749.03 s [vector] slice: OK
  11474. 749.03 s [vector] +++ OK, passed 100 tests.
  11475. 749.03 s [vector] init: OK
  11476. 749.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11477. 749.03 s [vector] tail: OK
  11478. 749.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11479. 749.03 s [vector] take: OK
  11480. 749.03 s [vector] +++ OK, passed 100 tests.
  11481. 749.03 s [vector] drop: OK
  11482. 749.03 s [vector] +++ OK, passed 100 tests.
  11483. 749.03 s [vector] splitAt: OK
  11484. 749.03 s [vector] +++ OK, passed 100 tests.
  11485. 749.03 s [vector] empty: OK
  11486. 749.03 s [vector] +++ OK, passed 100 tests.
  11487. 749.03 s [vector] singleton: OK
  11488. 749.03 s [vector] +++ OK, passed 100 tests.
  11489. 749.03 s [vector] replicate: OK
  11490. 749.04 s [vector] +++ OK, passed 100 tests.
  11491. 749.04 s [vector] generate: OK
  11492. 749.04 s [vector] +++ OK, passed 100 tests.
  11493. 749.04 s [vector] iterateN: OK
  11494. 749.04 s [vector] +++ OK, passed 100 tests.
  11495. 749.04 s [vector] iterateNM: OK (0.03s)
  11496. 749.04 s [vector] +++ OK, passed 100 tests.
  11497. 749.04 s [vector] generateM: OK (0.01s)
  11498. 749.04 s [vector] +++ OK, passed 100 tests.
  11499. 749.04 s [vector] replicateM: OK
  11500. 749.04 s [vector] +++ OK, passed 100 tests.
  11501. 749.04 s [vector] create: OK
  11502. 749.04 s [vector] +++ OK, passed 100 tests.
  11503. 749.04 s [vector] createT: OK
  11504. 749.04 s [vector] +++ OK, passed 100 tests.
  11505. 749.04 s [vector] unfoldr: OK
  11506. 749.04 s [vector] +++ OK, passed 100 tests.
  11507. 749.04 s [vector] unfoldrN: OK
  11508. 749.04 s [vector] +++ OK, passed 100 tests.
  11509. 749.04 s [vector] unfoldrExactN: OK
  11510. 749.04 s [vector] +++ OK, passed 100 tests.
  11511. 749.04 s [vector] unfoldrM: OK
  11512. 749.04 s [vector] +++ OK, passed 100 tests.
  11513. 749.04 s [vector] unfoldrNM: OK
  11514. 749.04 s [vector] +++ OK, passed 100 tests.
  11515. 749.04 s [vector] unfoldrExactNM: OK
  11516. 749.04 s [vector] +++ OK, passed 100 tests.
  11517. 749.04 s [vector] constructN: OK
  11518. 749.04 s [vector] +++ OK, passed 100 tests.
  11519. 749.04 s [vector] constructrN: OK
  11520. 749.04 s [vector] +++ OK, passed 100 tests.
  11521. 749.04 s [vector] cons: OK
  11522. 749.04 s [vector] +++ OK, passed 100 tests.
  11523. 749.04 s [vector] snoc: OK
  11524. 749.04 s [vector] +++ OK, passed 100 tests.
  11525. 749.04 s [vector] append: OK
  11526. 749.04 s [vector] +++ OK, passed 100 tests.
  11527. 749.04 s [vector] concat: OK (0.01s)
  11528. 749.04 s [vector] +++ OK, passed 100 tests.
  11529. 749.04 s [vector] force: OK
  11530. 749.04 s [vector] +++ OK, passed 100 tests.
  11531. 749.04 s [vector] upd: OK
  11532. 749.04 s [vector] +++ OK, passed 100 tests.
  11533. 749.04 s [vector] accum: OK
  11534. 749.04 s [vector] +++ OK, passed 100 tests.
  11535. 749.04 s [vector] reverse: OK
  11536. 749.04 s [vector] +++ OK, passed 100 tests.
  11537. 749.04 s [vector] backpermute: OK
  11538. 749.04 s [vector] +++ OK, passed 100 tests.
  11539. 749.04 s [vector] map: OK
  11540. 749.04 s [vector] +++ OK, passed 100 tests.
  11541. 749.04 s [vector] imap: OK
  11542. 749.04 s [vector] +++ OK, passed 100 tests.
  11543. 749.04 s [vector] concatMap: OK
  11544. 749.04 s [vector] +++ OK, passed 100 tests.
  11545. 749.04 s [vector] mapM: OK
  11546. 749.04 s [vector] +++ OK, passed 100 tests.
  11547. 749.04 s [vector] mapM_: OK (0.01s)
  11548. 749.04 s [vector] +++ OK, passed 100 tests.
  11549. 749.04 s [vector] forM: OK
  11550. 749.04 s [vector] +++ OK, passed 100 tests.
  11551. 749.05 s [vector] forM_: OK
  11552. 749.05 s [vector] +++ OK, passed 100 tests.
  11553. 749.06 s [vector] imapM: OK
  11554. 749.06 s [vector] +++ OK, passed 100 tests.
  11555. 749.06 s [vector] imapM_: OK (0.01s)
  11556. 749.06 s [vector] +++ OK, passed 100 tests.
  11557. 749.06 s [vector] zipWith: OK
  11558. 749.06 s [vector] +++ OK, passed 100 tests.
  11559. 749.07 s [vector] zipWith3: OK
  11560. 749.07 s [vector] +++ OK, passed 100 tests.
  11561. 749.07 s [vector] izipWith: OK
  11562. 749.07 s [vector] +++ OK, passed 100 tests.
  11563. 749.08 s [vector] izipWith3: OK
  11564. 749.08 s [vector] +++ OK, passed 100 tests.
  11565. 749.08 s [vector] izipWithM: OK
  11566. 749.08 s [vector] +++ OK, passed 100 tests.
  11567. 749.08 s [vector] izipWithM_: OK
  11568. 749.08 s [vector] +++ OK, passed 100 tests.
  11569. 749.08 s [vector] zipWithM: OK
  11570. 749.08 s [vector] +++ OK, passed 100 tests.
  11571. 749.09 s [vector] zipWithM_: OK
  11572. 749.09 s [vector] +++ OK, passed 100 tests.
  11573. 749.09 s [vector] filter: OK
  11574. 749.09 s [vector] +++ OK, passed 100 tests.
  11575. 749.10 s [vector] ifilter: OK
  11576. 749.10 s [vector] +++ OK, passed 100 tests.
  11577. 749.10 s [vector] filterM: OK (0.02s)
  11578. 749.10 s [vector] +++ OK, passed 100 tests.
  11579. 749.10 s [vector] uniq: OK
  11580. 749.10 s [vector] +++ OK, passed 100 tests.
  11581. 749.10 s [vector] mapMaybe: OK
  11582. 749.10 s [vector] +++ OK, passed 100 tests.
  11583. 749.10 s [vector] imapMaybe: OK
  11584. 749.10 s [vector] +++ OK, passed 100 tests.
  11585. 749.11 s [vector] takeWhile: OK
  11586. 749.11 s [vector] +++ OK, passed 100 tests.
  11587. 749.11 s [vector] dropWhile: OK
  11588. 749.11 s [vector] +++ OK, passed 100 tests.
  11589. 749.11 s [vector] partition: OK
  11590. 749.11 s [vector] +++ OK, passed 100 tests.
  11591. 749.11 s [vector] partitionWith: OK
  11592. 749.11 s [vector] +++ OK, passed 100 tests.
  11593. 749.11 s [vector] span: OK
  11594. 749.11 s [vector] +++ OK, passed 100 tests.
  11595. 749.11 s [vector] break: OK
  11596. 749.11 s [vector] +++ OK, passed 100 tests.
  11597. 749.11 s [vector] spanR: OK
  11598. 749.11 s [vector] +++ OK, passed 100 tests.
  11599. 749.11 s [vector] breakR: OK
  11600. 749.11 s [vector] +++ OK, passed 100 tests.
  11601. 749.11 s [vector] groupBy: OK
  11602. 749.11 s [vector] +++ OK, passed 100 tests.
  11603. 749.11 s [vector] elem: OK
  11604. 749.11 s [vector] +++ OK, passed 100 tests.
  11605. 749.11 s [vector] notElem: OK
  11606. 749.11 s [vector] +++ OK, passed 100 tests.
  11607. 749.11 s [vector] find: OK
  11608. 749.11 s [vector] +++ OK, passed 100 tests.
  11609. 749.11 s [vector] findIndex: OK
  11610. 749.11 s [vector] +++ OK, passed 100 tests.
  11611. 749.11 s [vector] findIndexR: OK
  11612. 749.11 s [vector] +++ OK, passed 100 tests.
  11613. 749.11 s [vector] findIndices: OK
  11614. 749.11 s [vector] +++ OK, passed 100 tests.
  11615. 749.11 s [vector] elemIndex: OK
  11616. 749.11 s [vector] +++ OK, passed 100 tests.
  11617. 749.12 s [vector] elemIndices: OK
  11618. 749.12 s [vector] +++ OK, passed 100 tests.
  11619. 749.12 s [vector] foldl: OK
  11620. 749.12 s [vector] +++ OK, passed 100 tests.
  11621. 749.12 s [vector] foldl1: OK
  11622. 749.12 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11623. 749.12 s [vector] foldl': OK
  11624. 749.12 s [vector] +++ OK, passed 100 tests.
  11625. 749.12 s [vector] foldl1': OK
  11626. 749.12 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11627. 749.12 s [vector] foldr: OK
  11628. 749.12 s [vector] +++ OK, passed 100 tests.
  11629. 749.12 s [vector] foldr1: OK
  11630. 749.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11631. 749.12 s [vector] foldr': OK
  11632. 749.12 s [vector] +++ OK, passed 100 tests.
  11633. 749.12 s [vector] foldr1': OK
  11634. 749.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11635. 749.13 s [vector] ifoldl: OK
  11636. 749.13 s [vector] +++ OK, passed 100 tests.
  11637. 749.13 s [vector] ifoldl': OK
  11638. 749.13 s [vector] +++ OK, passed 100 tests.
  11639. 749.13 s [vector] ifoldr: OK
  11640. 749.13 s [vector] +++ OK, passed 100 tests.
  11641. 749.13 s [vector] ifoldr': OK
  11642. 749.13 s [vector] +++ OK, passed 100 tests.
  11643. 749.13 s [vector] ifoldM: OK
  11644. 749.13 s [vector] +++ OK, passed 100 tests.
  11645. 749.14 s [vector] ifoldM': OK
  11646. 749.14 s [vector] +++ OK, passed 100 tests.
  11647. 749.14 s [vector] ifoldM_: OK (0.01s)
  11648. 749.14 s [vector] +++ OK, passed 100 tests.
  11649. 749.15 s [vector] ifoldM'_: OK
  11650. 749.15 s [vector] +++ OK, passed 100 tests.
  11651. 749.16 s [vector] all: OK
  11652. 749.16 s [vector] +++ OK, passed 100 tests.
  11653. 749.16 s [vector] any: OK
  11654. 749.16 s [vector] +++ OK, passed 100 tests.
  11655. 749.16 s [vector] prescanl: OK
  11656. 749.16 s [vector] +++ OK, passed 100 tests.
  11657. 749.16 s [vector] prescanl': OK
  11658. 749.16 s [vector] +++ OK, passed 100 tests.
  11659. 749.16 s [vector] postscanl: OK
  11660. 749.16 s [vector] +++ OK, passed 100 tests.
  11661. 749.16 s [vector] postscanl': OK
  11662. 749.16 s [vector] +++ OK, passed 100 tests.
  11663. 749.16 s [vector] scanl: OK
  11664. 749.16 s [vector] +++ OK, passed 100 tests.
  11665. 749.16 s [vector] scanl': OK
  11666. 749.16 s [vector] +++ OK, passed 100 tests.
  11667. 749.16 s [vector] scanl1: OK
  11668. 749.16 s [vector] +++ OK, passed 100 tests.
  11669. 749.17 s [vector] scanl1': OK
  11670. 749.17 s [vector] +++ OK, passed 100 tests.
  11671. 749.17 s [vector] iscanl: OK
  11672. 749.17 s [vector] +++ OK, passed 100 tests.
  11673. 749.17 s [vector] iscanl': OK
  11674. 749.17 s [vector] +++ OK, passed 100 tests.
  11675. 749.17 s [vector] prescanr: OK
  11676. 749.17 s [vector] +++ OK, passed 100 tests.
  11677. 749.17 s [vector] prescanr': OK
  11678. 749.17 s [vector] +++ OK, passed 100 tests.
  11679. 749.17 s [vector] postscanr: OK
  11680. 749.17 s [vector] +++ OK, passed 100 tests.
  11681. 749.18 s [vector] postscanr': OK
  11682. 749.18 s [vector] +++ OK, passed 100 tests.
  11683. 749.18 s [vector] scanr: OK
  11684. 749.18 s [vector] +++ OK, passed 100 tests.
  11685. 749.18 s [vector] scanr': OK
  11686. 749.18 s [vector] +++ OK, passed 100 tests.
  11687. 749.18 s [vector] scanr1: OK
  11688. 749.18 s [vector] +++ OK, passed 100 tests.
  11689. 749.18 s [vector] scanr1': OK
  11690. 749.18 s [vector] +++ OK, passed 100 tests.
  11691. 749.18 s [vector] iscanr: OK
  11692. 749.18 s [vector] +++ OK, passed 100 tests.
  11693. 749.18 s [vector] iscanr': OK
  11694. 749.18 s [vector] +++ OK, passed 100 tests.
  11695. 749.18 s [vector] mut_read: OK
  11696. 749.18 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11697. 749.18 s [vector] mut_write: OK
  11698. 749.18 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11699. 749.18 s [vector] mut_modify: OK
  11700. 749.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11701. 749.19 s [vector] mut_generate: OK
  11702. 749.19 s [vector] +++ OK, passed 100 tests.
  11703. 749.19 s [vector] mut_generateM: OK
  11704. 749.19 s [vector] +++ OK, passed 100 tests.
  11705. 749.21 s [vector] mut_mapM_: OK
  11706. 749.21 s [vector] +++ OK, passed 100 tests.
  11707. 749.21 s [vector] mut_imapM_: OK (0.01s)
  11708. 749.21 s [vector] +++ OK, passed 100 tests.
  11709. 749.24 s [vector] mut_forM_: OK
  11710. 749.24 s [vector] +++ OK, passed 100 tests.
  11711. 749.25 s [vector] mut_iforM_: OK (0.02s)
  11712. 749.25 s [vector] +++ OK, passed 100 tests.
  11713. 749.25 s [vector] mut_foldr: OK
  11714. 749.25 s [vector] +++ OK, passed 100 tests.
  11715. 749.25 s [vector] mut_foldr': OK
  11716. 749.25 s [vector] +++ OK, passed 100 tests.
  11717. 749.25 s [vector] mut_foldl: OK
  11718. 749.25 s [vector] +++ OK, passed 100 tests.
  11719. 749.25 s [vector] mut_foldl': OK
  11720. 749.25 s [vector] +++ OK, passed 100 tests.
  11721. 749.26 s [vector] mut_ifoldr: OK
  11722. 749.26 s [vector] +++ OK, passed 100 tests.
  11723. 749.26 s [vector] mut_ifoldr': OK
  11724. 749.26 s [vector] +++ OK, passed 100 tests.
  11725. 749.26 s [vector] mut_ifoldl: OK
  11726. 749.26 s [vector] +++ OK, passed 100 tests.
  11727. 749.27 s [vector] mut_ifoldl': OK
  11728. 749.27 s [vector] +++ OK, passed 100 tests.
  11729. 749.27 s [vector] mut_foldM: OK
  11730. 749.27 s [vector] +++ OK, passed 100 tests.
  11731. 749.27 s [vector] mut_foldM': OK
  11732. 749.27 s [vector] +++ OK, passed 100 tests.
  11733. 749.28 s [vector] mut_foldrM: OK
  11734. 749.28 s [vector] +++ OK, passed 100 tests.
  11735. 749.28 s [vector] mut_foldrM': OK
  11736. 749.28 s [vector] +++ OK, passed 100 tests.
  11737. 749.28 s [vector] mut_ifoldM: OK
  11738. 749.28 s [vector] +++ OK, passed 100 tests.
  11739. 749.28 s [vector] mut_ifoldM': OK
  11740. 749.28 s [vector] +++ OK, passed 100 tests.
  11741. 749.29 s [vector] mut_ifoldrM: OK
  11742. 749.29 s [vector] +++ OK, passed 100 tests.
  11743. 749.29 s [vector] mut_ifoldrM': OK
  11744. 749.29 s [vector] +++ OK, passed 100 tests.
  11745. 749.29 s [vector] compare: OK
  11746. 749.29 s [vector] +++ OK, passed 100 tests.
  11747. 749.29 s [vector] maximum: OK
  11748. 749.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11749. 749.29 s [vector] minimum: OK
  11750. 749.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11751. 749.29 s [vector] minIndex: OK
  11752. 749.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11753. 749.29 s [vector] maxIndex: OK
  11754. 749.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11755. 749.29 s [vector] maximumBy: OK
  11756. 749.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11757. 749.29 s [vector] minimumBy: OK
  11758. 749.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11759. 749.29 s [vector] maximumOn: OK
  11760. 749.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11761. 749.29 s [vector] minimumOn: OK
  11762. 749.29 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11763. 749.29 s [vector] maxIndexBy: OK
  11764. 749.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11765. 749.29 s [vector] minIndexBy: OK
  11766. 749.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11767. 749.29 s [vector] ListFirstMaxIndexWins: OK
  11768. 749.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11769. 749.29 s [vector] FalseListFirstMaxIndexWins: OK
  11770. 749.29 s [vector] +++ OK, failed as expected. (after 1 test):
  11771. 749.29 s [vector] Exception:
  11772. 749.29 s [vector] Prelude.foldr1: empty list
  11773. 749.29 s [vector] CallStack (from HasCallStack):
  11774. 749.29 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  11775. 749.29 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  11776. 749.29 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11777. 749.30 s [vector] []
  11778. 749.30 s [vector] zip: OK
  11779. 749.30 s [vector] +++ OK, passed 100 tests.
  11780. 749.30 s [vector] zip3: OK
  11781. 749.30 s [vector] +++ OK, passed 100 tests.
  11782. 749.30 s [vector] unzip: OK
  11783. 749.30 s [vector] +++ OK, passed 100 tests.
  11784. 749.30 s [vector] unzip3: OK
  11785. 749.30 s [vector] +++ OK, passed 100 tests.
  11786. 749.30 s [vector] indexed: OK
  11787. 749.30 s [vector] +++ OK, passed 100 tests.
  11788. 749.30 s [vector] update: OK
  11789. 749.30 s [vector] +++ OK, passed 100 tests.
  11790. 749.31 s [vector] concat: OK
  11791. 749.31 s [vector] +++ OK, passed 100 tests.
  11792. 749.31 s [vector] mempty: OK
  11793. 749.31 s [vector] +++ OK, passed 100 tests.
  11794. 749.31 s [vector] mappend: OK
  11795. 749.31 s [vector] +++ OK, passed 100 tests.
  11796. 749.32 s [vector] mconcat: OK
  11797. 749.32 s [vector] +++ OK, passed 100 tests.
  11798. 749.32 s [vector] fmap: OK
  11799. 749.32 s [vector] +++ OK, passed 100 tests.
  11800. 749.32 s [vector] return: OK
  11801. 749.32 s [vector] +++ OK, passed 100 tests.
  11802. 749.33 s [vector] bind: OK
  11803. 749.33 s [vector] +++ OK, passed 100 tests.
  11804. 749.33 s [vector] mzip: OK
  11805. 749.33 s [vector] +++ OK, passed 100 tests.
  11806. 749.33 s [vector] munzip: OK
  11807. 749.34 s [vector] +++ OK, passed 100 tests.
  11808. 749.34 s [vector] applicative_pure: OK
  11809. 749.34 s [vector] +++ OK, passed 100 tests.
  11810. 749.34 s [vector] applicative_appl: OK (0.02s)
  11811. 749.34 s [vector] +++ OK, passed 100 tests.
  11812. 749.34 s [vector] alternative_empty: OK
  11813. 749.34 s [vector] +++ OK, passed 100 tests.
  11814. 749.36 s [vector] alternative_or: OK
  11815. 749.36 s [vector] +++ OK, passed 100 tests.
  11816. 749.38 s [vector] sequence: OK (0.02s)
  11817. 749.38 s [vector] +++ OK, passed 100 tests.
  11818. 749.38 s [vector] sequence_: OK (0.01s)
  11819. 749.38 s [vector] +++ OK, passed 100 tests.
  11820. 749.38 s [vector] glength: OK
  11821. 749.38 s [vector] +++ OK, passed 100 tests.
  11822. 749.38 s [vector] and: OK
  11823. 749.38 s [vector] +++ OK, passed 100 tests.
  11824. 749.38 s [vector] or: OK
  11825. 749.38 s [vector] +++ OK, passed 100 tests.
  11826. 749.38 s [vector] Int
  11827. 749.38 s [vector] fromList.toList == id: OK
  11828. 749.38 s [vector] +++ OK, passed 100 tests.
  11829. 749.38 s [vector] toList.fromList == id: OK
  11830. 749.38 s [vector] +++ OK, passed 100 tests.
  11831. 749.39 s [vector] unstream.stream == id: OK
  11832. 749.39 s [vector] +++ OK, passed 100 tests.
  11833. 749.39 s [vector] stream.unstream == id: OK
  11834. 749.39 s [vector] +++ OK, passed 100 tests.
  11835. 749.39 s [vector] eq: OK
  11836. 749.39 s [vector] +++ OK, passed 100 tests.
  11837. 749.39 s [vector] length: OK
  11838. 749.39 s [vector] +++ OK, passed 100 tests.
  11839. 749.39 s [vector] null: OK
  11840. 749.39 s [vector] +++ OK, passed 100 tests.
  11841. 749.39 s [vector] index: OK
  11842. 749.39 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11843. 749.39 s [vector] safeIndex: OK
  11844. 749.39 s [vector] +++ OK, passed 100 tests.
  11845. 749.39 s [vector] head: OK
  11846. 749.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11847. 749.39 s [vector] last: OK
  11848. 749.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11849. 749.39 s [vector] unsafeIndex: OK
  11850. 749.39 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11851. 749.39 s [vector] unsafeHead: OK
  11852. 749.39 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11853. 749.39 s [vector] unsafeLast: OK
  11854. 749.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11855. 749.39 s [vector] slice: OK
  11856. 749.39 s [vector] +++ OK, passed 100 tests.
  11857. 749.39 s [vector] init: OK
  11858. 749.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11859. 749.39 s [vector] tail: OK
  11860. 749.39 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11861. 749.39 s [vector] take: OK
  11862. 749.39 s [vector] +++ OK, passed 100 tests.
  11863. 749.39 s [vector] drop: OK
  11864. 749.39 s [vector] +++ OK, passed 100 tests.
  11865. 749.39 s [vector] splitAt: OK
  11866. 749.39 s [vector] +++ OK, passed 100 tests.
  11867. 749.39 s [vector] empty: OK
  11868. 749.39 s [vector] +++ OK, passed 100 tests.
  11869. 749.39 s [vector] singleton: OK
  11870. 749.39 s [vector] +++ OK, passed 100 tests.
  11871. 749.39 s [vector] replicate: OK
  11872. 749.39 s [vector] +++ OK, passed 100 tests.
  11873. 749.39 s [vector] generate: OK
  11874. 749.40 s [vector] +++ OK, passed 100 tests.
  11875. 749.40 s [vector] iterateN: OK
  11876. 749.40 s [vector] +++ OK, passed 100 tests.
  11877. 749.42 s [vector] iterateNM: OK (0.02s)
  11878. 749.42 s [vector] +++ OK, passed 100 tests.
  11879. 749.43 s [vector] generateM: OK (0.02s)
  11880. 749.43 s [vector] +++ OK, passed 100 tests.
  11881. 749.45 s [vector] replicateM: OK
  11882. 749.45 s [vector] +++ OK, passed 100 tests.
  11883. 749.45 s [vector] create: OK
  11884. 749.45 s [vector] +++ OK, passed 100 tests.
  11885. 749.45 s [vector] createT: OK
  11886. 749.45 s [vector] +++ OK, passed 100 tests.
  11887. 749.45 s [vector] unfoldr: OK
  11888. 749.45 s [vector] +++ OK, passed 100 tests.
  11889. 749.45 s [vector] unfoldrN: OK
  11890. 749.45 s [vector] +++ OK, passed 100 tests.
  11891. 749.45 s [vector] unfoldrExactN: OK
  11892. 749.45 s [vector] +++ OK, passed 100 tests.
  11893. 749.45 s [vector] unfoldrM: OK
  11894. 749.45 s [vector] +++ OK, passed 100 tests.
  11895. 749.45 s [vector] unfoldrNM: OK
  11896. 749.46 s [vector] +++ OK, passed 100 tests.
  11897. 749.47 s [vector] unfoldrExactNM: OK (0.02s)
  11898. 749.47 s [vector] +++ OK, passed 100 tests.
  11899. 749.47 s [vector] constructN: OK
  11900. 749.47 s [vector] +++ OK, passed 100 tests.
  11901. 749.47 s [vector] constructrN: OK
  11902. 749.47 s [vector] +++ OK, passed 100 tests.
  11903. 749.47 s [vector] cons: OK
  11904. 749.48 s [vector] +++ OK, passed 100 tests.
  11905. 749.48 s [vector] snoc: OK
  11906. 749.48 s [vector] +++ OK, passed 100 tests.
  11907. 749.48 s [vector] append: OK
  11908. 749.48 s [vector] +++ OK, passed 100 tests.
  11909. 749.49 s [vector] concat: OK
  11910. 749.49 s [vector] +++ OK, passed 100 tests.
  11911. 749.49 s [vector] force: OK
  11912. 749.49 s [vector] +++ OK, passed 100 tests.
  11913. 749.49 s [vector] upd: OK
  11914. 749.49 s [vector] +++ OK, passed 100 tests.
  11915. 749.49 s [vector] accum: OK
  11916. 749.49 s [vector] +++ OK, passed 100 tests.
  11917. 749.49 s [vector] reverse: OK
  11918. 749.49 s [vector] +++ OK, passed 100 tests.
  11919. 749.50 s [vector] backpermute: OK
  11920. 749.50 s [vector] +++ OK, passed 100 tests.
  11921. 749.50 s [vector] map: OK
  11922. 749.50 s [vector] +++ OK, passed 100 tests.
  11923. 749.50 s [vector] imap: OK
  11924. 749.51 s [vector] +++ OK, passed 100 tests.
  11925. 749.52 s [vector] concatMap: OK
  11926. 749.52 s [vector] +++ OK, passed 100 tests.
  11927. 749.52 s [vector] mapM: OK
  11928. 749.52 s [vector] +++ OK, passed 100 tests.
  11929. 749.53 s [vector] mapM_: OK (0.02s)
  11930. 749.53 s [vector] +++ OK, passed 100 tests.
  11931. 749.54 s [vector] forM: OK
  11932. 749.55 s [vector] +++ OK, passed 100 tests.
  11933. 749.55 s [vector] forM_: OK (0.02s)
  11934. 749.55 s [vector] +++ OK, passed 100 tests.
  11935. 749.56 s [vector] imapM: OK
  11936. 749.56 s [vector] +++ OK, passed 100 tests.
  11937. 749.58 s [vector] imapM_: OK (0.02s)
  11938. 749.58 s [vector] +++ OK, passed 100 tests.
  11939. 749.58 s [vector] zipWith: OK
  11940. 749.58 s [vector] +++ OK, passed 100 tests.
  11941. 749.58 s [vector] zipWith3: OK
  11942. 749.58 s [vector] +++ OK, passed 100 tests.
  11943. 749.59 s [vector] izipWith: OK
  11944. 749.59 s [vector] +++ OK, passed 100 tests.
  11945. 749.59 s [vector] izipWith3: OK
  11946. 749.59 s [vector] +++ OK, passed 100 tests.
  11947. 749.60 s [vector] izipWithM: OK
  11948. 749.60 s [vector] +++ OK, passed 100 tests.
  11949. 749.60 s [vector] izipWithM_: OK (0.01s)
  11950. 749.60 s [vector] +++ OK, passed 100 tests.
  11951. 749.62 s [vector] zipWithM: OK
  11952. 749.62 s [vector] +++ OK, passed 100 tests.
  11953. 749.62 s [vector] zipWithM_: OK (0.01s)
  11954. 749.62 s [vector] +++ OK, passed 100 tests.
  11955. 749.62 s [vector] filter: OK
  11956. 749.62 s [vector] +++ OK, passed 100 tests.
  11957. 749.62 s [vector] ifilter: OK
  11958. 749.62 s [vector] +++ OK, passed 100 tests.
  11959. 749.64 s [vector] filterM: OK (0.02s)
  11960. 749.64 s [vector] +++ OK, passed 100 tests.
  11961. 749.65 s [vector] uniq: OK
  11962. 749.65 s [vector] +++ OK, passed 100 tests.
  11963. 749.65 s [vector] mapMaybe: OK
  11964. 749.65 s [vector] +++ OK, passed 100 tests.
  11965. 749.65 s [vector] imapMaybe: OK
  11966. 749.65 s [vector] +++ OK, passed 100 tests.
  11967. 749.65 s [vector] takeWhile: OK
  11968. 749.65 s [vector] +++ OK, passed 100 tests.
  11969. 749.65 s [vector] dropWhile: OK
  11970. 749.65 s [vector] +++ OK, passed 100 tests.
  11971. 749.65 s [vector] partition: OK
  11972. 749.65 s [vector] +++ OK, passed 100 tests.
  11973. 749.65 s [vector] partitionWith: OK
  11974. 749.65 s [vector] +++ OK, passed 100 tests.
  11975. 749.65 s [vector] span: OK
  11976. 749.65 s [vector] +++ OK, passed 100 tests.
  11977. 749.65 s [vector] break: OK
  11978. 749.65 s [vector] +++ OK, passed 100 tests.
  11979. 749.65 s [vector] spanR: OK
  11980. 749.65 s [vector] +++ OK, passed 100 tests.
  11981. 749.65 s [vector] breakR: OK
  11982. 749.65 s [vector] +++ OK, passed 100 tests.
  11983. 749.65 s [vector] groupBy: OK
  11984. 749.65 s [vector] +++ OK, passed 100 tests.
  11985. 749.65 s [vector] elem: OK
  11986. 749.65 s [vector] +++ OK, passed 100 tests.
  11987. 749.65 s [vector] notElem: OK
  11988. 749.65 s [vector] +++ OK, passed 100 tests.
  11989. 749.65 s [vector] find: OK
  11990. 749.65 s [vector] +++ OK, passed 100 tests.
  11991. 749.65 s [vector] findIndex: OK
  11992. 749.65 s [vector] +++ OK, passed 100 tests.
  11993. 749.66 s [vector] findIndexR: OK
  11994. 749.66 s [vector] +++ OK, passed 100 tests.
  11995. 749.66 s [vector] findIndices: OK
  11996. 749.66 s [vector] +++ OK, passed 100 tests.
  11997. 749.66 s [vector] elemIndex: OK
  11998. 749.66 s [vector] +++ OK, passed 100 tests.
  11999. 749.66 s [vector] elemIndices: OK
  12000. 749.66 s [vector] +++ OK, passed 100 tests.
  12001. 749.66 s [vector] foldl: OK
  12002. 749.66 s [vector] +++ OK, passed 100 tests.
  12003. 749.66 s [vector] foldl1: OK
  12004. 749.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12005. 749.67 s [vector] foldl': OK
  12006. 749.67 s [vector] +++ OK, passed 100 tests.
  12007. 749.67 s [vector] foldl1': OK
  12008. 749.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12009. 749.67 s [vector] foldr: OK
  12010. 749.67 s [vector] +++ OK, passed 100 tests.
  12011. 749.67 s [vector] foldr1: OK
  12012. 749.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12013. 749.67 s [vector] foldr': OK
  12014. 749.67 s [vector] +++ OK, passed 100 tests.
  12015. 749.67 s [vector] foldr1': OK
  12016. 749.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12017. 749.68 s [vector] ifoldl: OK
  12018. 749.68 s [vector] +++ OK, passed 100 tests.
  12019. 749.68 s [vector] ifoldl': OK
  12020. 749.68 s [vector] +++ OK, passed 100 tests.
  12021. 749.68 s [vector] ifoldr: OK
  12022. 749.68 s [vector] +++ OK, passed 100 tests.
  12023. 749.69 s [vector] ifoldr': OK
  12024. 749.69 s [vector] +++ OK, passed 100 tests.
  12025. 749.70 s [vector] ifoldM: OK
  12026. 749.70 s [vector] +++ OK, passed 100 tests.
  12027. 749.70 s [vector] ifoldM': OK
  12028. 749.70 s [vector] +++ OK, passed 100 tests.
  12029. 749.72 s [vector] ifoldM_: OK (0.02s)
  12030. 749.72 s [vector] +++ OK, passed 100 tests.
  12031. 749.72 s [vector] ifoldM'_: OK (0.02s)
  12032. 749.72 s [vector] +++ OK, passed 100 tests.
  12033. 749.73 s [vector] all: OK
  12034. 749.73 s [vector] +++ OK, passed 100 tests.
  12035. 749.73 s [vector] any: OK
  12036. 749.73 s [vector] +++ OK, passed 100 tests.
  12037. 749.73 s [vector] prescanl: OK
  12038. 749.73 s [vector] +++ OK, passed 100 tests.
  12039. 749.73 s [vector] prescanl': OK
  12040. 749.73 s [vector] +++ OK, passed 100 tests.
  12041. 749.74 s [vector] postscanl: OK
  12042. 749.74 s [vector] +++ OK, passed 100 tests.
  12043. 749.74 s [vector] postscanl': OK
  12044. 749.74 s [vector] +++ OK, passed 100 tests.
  12045. 749.74 s [vector] scanl: OK
  12046. 749.74 s [vector] +++ OK, passed 100 tests.
  12047. 749.74 s [vector] scanl': OK
  12048. 749.74 s [vector] +++ OK, passed 100 tests.
  12049. 749.75 s [vector] scanl1: OK
  12050. 749.75 s [vector] +++ OK, passed 100 tests.
  12051. 749.75 s [vector] scanl1': OK
  12052. 749.75 s [vector] +++ OK, passed 100 tests.
  12053. 749.75 s [vector] iscanl: OK
  12054. 749.75 s [vector] +++ OK, passed 100 tests.
  12055. 749.76 s [vector] iscanl': OK
  12056. 749.76 s [vector] +++ OK, passed 100 tests.
  12057. 749.76 s [vector] prescanr: OK
  12058. 749.77 s [vector] +++ OK, passed 100 tests.
  12059. 749.77 s [vector] prescanr': OK
  12060. 749.77 s [vector] +++ OK, passed 100 tests.
  12061. 749.77 s [vector] postscanr: OK
  12062. 749.77 s [vector] +++ OK, passed 100 tests.
  12063. 749.78 s [vector] postscanr': OK
  12064. 749.78 s [vector] +++ OK, passed 100 tests.
  12065. 749.78 s [vector] scanr: OK
  12066. 749.78 s [vector] +++ OK, passed 100 tests.
  12067. 749.79 s [vector] scanr': OK
  12068. 749.79 s [vector] +++ OK, passed 100 tests.
  12069. 749.79 s [vector] scanr1: OK
  12070. 749.79 s [vector] +++ OK, passed 100 tests.
  12071. 749.79 s [vector] scanr1': OK
  12072. 749.79 s [vector] +++ OK, passed 100 tests.
  12073. 749.79 s [vector] iscanr: OK
  12074. 749.79 s [vector] +++ OK, passed 100 tests.
  12075. 749.79 s [vector] iscanr': OK
  12076. 749.79 s [vector] +++ OK, passed 100 tests.
  12077. 749.79 s [vector] mut_read: OK
  12078. 749.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12079. 749.79 s [vector] mut_write: OK
  12080. 749.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12081. 749.79 s [vector] mut_modify: OK
  12082. 749.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12083. 749.80 s [vector] mut_generate: OK
  12084. 749.80 s [vector] +++ OK, passed 100 tests.
  12085. 749.80 s [vector] mut_generateM: OK
  12086. 749.80 s [vector] +++ OK, passed 100 tests.
  12087. 749.82 s [vector] mut_mapM_: OK (0.01s)
  12088. 749.82 s [vector] +++ OK, passed 100 tests.
  12089. 749.84 s [vector] mut_imapM_: OK (0.01s)
  12090. 749.84 s [vector] +++ OK, passed 100 tests.
  12091. 749.84 s [vector] mut_forM_: OK (0.01s)
  12092. 749.84 s [vector] +++ OK, passed 100 tests.
  12093. 749.85 s [vector] mut_iforM_: OK (0.01s)
  12094. 749.86 s [vector] +++ OK, passed 100 tests.
  12095. 749.86 s [vector] mut_foldr: OK
  12096. 749.86 s [vector] +++ OK, passed 100 tests.
  12097. 749.87 s [vector] mut_foldr': OK
  12098. 749.87 s [vector] +++ OK, passed 100 tests.
  12099. 749.87 s [vector] mut_foldl: OK
  12100. 749.87 s [vector] +++ OK, passed 100 tests.
  12101. 749.87 s [vector] mut_foldl': OK
  12102. 749.87 s [vector] +++ OK, passed 100 tests.
  12103. 749.87 s [vector] mut_ifoldr: OK
  12104. 749.87 s [vector] +++ OK, passed 100 tests.
  12105. 749.87 s [vector] mut_ifoldr': OK
  12106. 749.87 s [vector] +++ OK, passed 100 tests.
  12107. 749.87 s [vector] mut_ifoldl: OK
  12108. 749.87 s [vector] +++ OK, passed 100 tests.
  12109. 749.87 s [vector] mut_ifoldl': OK
  12110. 749.87 s [vector] +++ OK, passed 100 tests.
  12111. 749.88 s [vector] mut_foldM: OK
  12112. 749.88 s [vector] +++ OK, passed 100 tests.
  12113. 749.88 s [vector] mut_foldM': OK
  12114. 749.88 s [vector] +++ OK, passed 100 tests.
  12115. 749.88 s [vector] mut_foldrM: OK
  12116. 749.88 s [vector] +++ OK, passed 100 tests.
  12117. 749.88 s [vector] mut_foldrM': OK
  12118. 749.88 s [vector] +++ OK, passed 100 tests.
  12119. 749.88 s [vector] mut_ifoldM: OK
  12120. 749.88 s [vector] +++ OK, passed 100 tests.
  12121. 749.89 s [vector] mut_ifoldM': OK
  12122. 749.89 s [vector] +++ OK, passed 100 tests.
  12123. 749.89 s [vector] mut_ifoldrM: OK
  12124. 749.89 s [vector] +++ OK, passed 100 tests.
  12125. 749.89 s [vector] mut_ifoldrM': OK
  12126. 749.89 s [vector] +++ OK, passed 100 tests.
  12127. 749.89 s [vector] compare: OK
  12128. 749.89 s [vector] +++ OK, passed 100 tests.
  12129. 749.89 s [vector] maximum: OK
  12130. 749.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12131. 749.89 s [vector] minimum: OK
  12132. 749.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12133. 749.89 s [vector] minIndex: OK
  12134. 749.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12135. 749.89 s [vector] maxIndex: OK
  12136. 749.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12137. 749.89 s [vector] maximumBy: OK
  12138. 749.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12139. 749.89 s [vector] minimumBy: OK
  12140. 749.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12141. 749.89 s [vector] maximumOn: OK
  12142. 749.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12143. 749.90 s [vector] minimumOn: OK
  12144. 749.90 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12145. 749.90 s [vector] maxIndexBy: OK
  12146. 749.90 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12147. 749.90 s [vector] minIndexBy: OK
  12148. 749.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12149. 749.90 s [vector] ListFirstMaxIndexWins: OK
  12150. 749.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12151. 749.90 s [vector] FalseListFirstMaxIndexWins: OK
  12152. 749.90 s [vector] +++ OK, failed as expected. (after 1 test):
  12153. 749.90 s [vector] Exception:
  12154. 749.90 s [vector] Prelude.foldr1: empty list
  12155. 749.90 s [vector] CallStack (from HasCallStack):
  12156. 749.90 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  12157. 749.90 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  12158. 749.90 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12159. 749.90 s [vector] []
  12160. 749.90 s [vector] zip: OK
  12161. 749.90 s [vector] +++ OK, passed 100 tests.
  12162. 749.90 s [vector] zip3: OK
  12163. 749.90 s [vector] +++ OK, passed 100 tests.
  12164. 749.90 s [vector] unzip: OK
  12165. 749.90 s [vector] +++ OK, passed 100 tests.
  12166. 749.90 s [vector] unzip3: OK
  12167. 749.90 s [vector] +++ OK, passed 100 tests.
  12168. 749.90 s [vector] indexed: OK
  12169. 749.90 s [vector] +++ OK, passed 100 tests.
  12170. 749.90 s [vector] update: OK
  12171. 749.90 s [vector] +++ OK, passed 100 tests.
  12172. 749.91 s [vector] concat: OK
  12173. 749.91 s [vector] +++ OK, passed 100 tests.
  12174. 749.91 s [vector] mempty: OK
  12175. 749.91 s [vector] +++ OK, passed 100 tests.
  12176. 749.91 s [vector] mappend: OK
  12177. 749.91 s [vector] +++ OK, passed 100 tests.
  12178. 749.92 s [vector] mconcat: OK
  12179. 749.92 s [vector] +++ OK, passed 100 tests.
  12180. 749.92 s [vector] fmap: OK
  12181. 749.92 s [vector] +++ OK, passed 100 tests.
  12182. 749.93 s [vector] return: OK
  12183. 749.93 s [vector] +++ OK, passed 100 tests.
  12184. 749.93 s [vector] bind: OK (0.01s)
  12185. 749.93 s [vector] +++ OK, passed 100 tests.
  12186. 749.94 s [vector] mzip: OK
  12187. 749.94 s [vector] +++ OK, passed 100 tests.
  12188. 749.94 s [vector] munzip: OK
  12189. 749.94 s [vector] +++ OK, passed 100 tests.
  12190. 749.95 s [vector] applicative_pure: OK
  12191. 749.95 s [vector] +++ OK, passed 100 tests.
  12192. 749.96 s [vector] applicative_appl: OK (0.03s)
  12193. 749.96 s [vector] +++ OK, passed 100 tests.
  12194. 749.96 s [vector] alternative_empty: OK
  12195. 749.96 s [vector] +++ OK, passed 100 tests.
  12196. 749.96 s [vector] alternative_or: OK
  12197. 749.96 s [vector] +++ OK, passed 100 tests.
  12198. 750.00 s [vector] sequence: OK (0.02s)
  12199. 750.00 s [vector] +++ OK, passed 100 tests.
  12200. 750.01 s [vector] sequence_: OK
  12201. 750.01 s [vector] +++ OK, passed 100 tests.
  12202. 750.01 s [vector] glength: OK
  12203. 750.01 s [vector] +++ OK, passed 100 tests.
  12204. 750.01 s [vector] sum: OK
  12205. 750.01 s [vector] +++ OK, passed 100 tests.
  12206. 750.01 s [vector] product: OK
  12207. 750.01 s [vector] +++ OK, passed 100 tests.
  12208. 750.01 s [vector] enumFromN: OK
  12209. 750.01 s [vector] +++ OK, passed 100 tests.
  12210. 750.01 s [vector] enumFromThenN: OK
  12211. 750.01 s [vector] +++ OK, passed 100 tests.
  12212. 750.01 s [vector] enumFromTo: OK
  12213. 750.01 s [vector] +++ OK, passed 100 tests.
  12214. 750.01 s [vector] enumFromThenTo: OK
  12215. 750.01 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12216. 750.01 s [vector] unstream
  12217. 750.01 s [vector] unstream == vunstream (exact): OK
  12218. 750.01 s [vector] +++ OK, passed 100 tests.
  12219. 750.01 s [vector] unstream == vunstream (unknown): OK
  12220. 750.01 s [vector] +++ OK, passed 100 tests.
  12221. 750.01 s [vector] unstreamR ~= vunstream (exact): OK
  12222. 750.01 s [vector] +++ OK, passed 100 tests.
  12223. 750.01 s [vector] unstreamR ~= vunstream (unknown): OK
  12224. 750.01 s [vector] +++ OK, passed 100 tests.
  12225. 750.01 s [vector] Tests.Vector.Primitive
  12226. 750.01 s [vector] Int
  12227. 750.01 s [vector] fromList.toList == id: OK
  12228. 750.01 s [vector] +++ OK, passed 100 tests.
  12229. 750.01 s [vector] toList.fromList == id: OK
  12230. 750.01 s [vector] +++ OK, passed 100 tests.
  12231. 750.01 s [vector] unstream.stream == id: OK
  12232. 750.01 s [vector] +++ OK, passed 100 tests.
  12233. 750.01 s [vector] stream.unstream == id: OK
  12234. 750.01 s [vector] +++ OK, passed 100 tests.
  12235. 750.01 s [vector] eq: OK
  12236. 750.01 s [vector] +++ OK, passed 100 tests.
  12237. 750.01 s [vector] length: OK
  12238. 750.01 s [vector] +++ OK, passed 100 tests.
  12239. 750.01 s [vector] null: OK
  12240. 750.01 s [vector] +++ OK, passed 100 tests.
  12241. 750.01 s [vector] index: OK
  12242. 750.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12243. 750.01 s [vector] safeIndex: OK
  12244. 750.01 s [vector] +++ OK, passed 100 tests.
  12245. 750.01 s [vector] head: OK
  12246. 750.01 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12247. 750.01 s [vector] last: OK
  12248. 750.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12249. 750.01 s [vector] unsafeIndex: OK
  12250. 750.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12251. 750.01 s [vector] unsafeHead: OK
  12252. 750.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12253. 750.02 s [vector] unsafeLast: OK
  12254. 750.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12255. 750.02 s [vector] slice: OK
  12256. 750.02 s [vector] +++ OK, passed 100 tests.
  12257. 750.02 s [vector] init: OK
  12258. 750.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12259. 750.02 s [vector] tail: OK
  12260. 750.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12261. 750.02 s [vector] take: OK
  12262. 750.02 s [vector] +++ OK, passed 100 tests.
  12263. 750.02 s [vector] drop: OK
  12264. 750.02 s [vector] +++ OK, passed 100 tests.
  12265. 750.02 s [vector] splitAt: OK
  12266. 750.02 s [vector] +++ OK, passed 100 tests.
  12267. 750.04 s [vector] empty: OK
  12268. 750.04 s [vector] +++ OK, passed 100 tests.
  12269. 750.04 s [vector] singleton: OK
  12270. 750.04 s [vector] +++ OK, passed 100 tests.
  12271. 750.04 s [vector] replicate: OK
  12272. 750.04 s [vector] +++ OK, passed 100 tests.
  12273. 750.05 s [vector] generate: OK
  12274. 750.05 s [vector] +++ OK, passed 100 tests.
  12275. 750.05 s [vector] iterateN: OK
  12276. 750.05 s [vector] +++ OK, passed 100 tests.
  12277. 750.06 s [vector] iterateNM: OK (0.03s)
  12278. 750.06 s [vector] +++ OK, passed 100 tests.
  12279. 750.08 s [vector] generateM: OK (0.02s)
  12280. 750.08 s [vector] +++ OK, passed 100 tests.
  12281. 750.08 s [vector] replicateM: OK
  12282. 750.08 s [vector] +++ OK, passed 100 tests.
  12283. 750.08 s [vector] create: OK
  12284. 750.08 s [vector] +++ OK, passed 100 tests.
  12285. 750.08 s [vector] createT: OK
  12286. 750.08 s [vector] +++ OK, passed 100 tests.
  12287. 750.08 s [vector] unfoldr: OK
  12288. 750.08 s [vector] +++ OK, passed 100 tests.
  12289. 750.09 s [vector] unfoldrN: OK
  12290. 750.10 s [vector] +++ OK, passed 100 tests.
  12291. 750.10 s [vector] unfoldrExactN: OK
  12292. 750.10 s [vector] +++ OK, passed 100 tests.
  12293. 750.11 s [vector] unfoldrM: OK
  12294. 750.11 s [vector] +++ OK, passed 100 tests.
  12295. 750.11 s [vector] unfoldrNM: OK
  12296. 750.11 s [vector] +++ OK, passed 100 tests.
  12297. 750.12 s [vector] unfoldrExactNM: OK (0.03s)
  12298. 750.12 s [vector] +++ OK, passed 100 tests.
  12299. 750.12 s [vector] constructN: OK
  12300. 750.12 s [vector] +++ OK, passed 100 tests.
  12301. 750.12 s [vector] constructrN: OK
  12302. 750.12 s [vector] +++ OK, passed 100 tests.
  12303. 750.12 s [vector] cons: OK
  12304. 750.12 s [vector] +++ OK, passed 100 tests.
  12305. 750.12 s [vector] snoc: OK
  12306. 750.14 s [vector] +++ OK, passed 100 tests.
  12307. 750.14 s [vector] append: OK
  12308. 750.14 s [vector] +++ OK, passed 100 tests.
  12309. 750.14 s [vector] concat: OK (0.01s)
  12310. 750.14 s [vector] +++ OK, passed 100 tests.
  12311. 750.14 s [vector] force: OK
  12312. 750.14 s [vector] +++ OK, passed 100 tests.
  12313. 750.14 s [vector] upd: OK
  12314. 750.14 s [vector] +++ OK, passed 100 tests.
  12315. 750.14 s [vector] accum: OK
  12316. 750.14 s [vector] +++ OK, passed 100 tests.
  12317. 750.14 s [vector] reverse: OK
  12318. 750.14 s [vector] +++ OK, passed 100 tests.
  12319. 750.14 s [vector] backpermute: OK
  12320. 750.15 s [vector] +++ OK, passed 100 tests.
  12321. 750.15 s [vector] map: OK
  12322. 750.15 s [vector] +++ OK, passed 100 tests.
  12323. 750.15 s [vector] imap: OK
  12324. 750.15 s [vector] +++ OK, passed 100 tests.
  12325. 750.15 s [vector] concatMap: OK
  12326. 750.15 s [vector] +++ OK, passed 100 tests.
  12327. 750.15 s [vector] mapM: OK
  12328. 750.15 s [vector] +++ OK, passed 100 tests.
  12329. 750.17 s [vector] mapM_: OK (0.02s)
  12330. 750.17 s [vector] +++ OK, passed 100 tests.
  12331. 750.18 s [vector] forM: OK
  12332. 750.18 s [vector] +++ OK, passed 100 tests.
  12333. 750.18 s [vector] forM_: OK (0.01s)
  12334. 750.18 s [vector] +++ OK, passed 100 tests.
  12335. 750.18 s [vector] imapM: OK
  12336. 750.18 s [vector] +++ OK, passed 100 tests.
  12337. 750.20 s [vector] imapM_: OK
  12338. 750.20 s [vector] +++ OK, passed 100 tests.
  12339. 750.20 s [vector] zipWith: OK
  12340. 750.21 s [vector] +++ OK, passed 100 tests.
  12341. 750.21 s [vector] zipWith3: OK
  12342. 750.21 s [vector] +++ OK, passed 100 tests.
  12343. 750.21 s [vector] izipWith: OK
  12344. 750.21 s [vector] +++ OK, passed 100 tests.
  12345. 750.21 s [vector] izipWith3: OK
  12346. 750.21 s [vector] +++ OK, passed 100 tests.
  12347. 750.22 s [vector] izipWithM: OK
  12348. 750.22 s [vector] +++ OK, passed 100 tests.
  12349. 750.22 s [vector] izipWithM_: OK (0.01s)
  12350. 750.22 s [vector] +++ OK, passed 100 tests.
  12351. 750.22 s [vector] zipWithM: OK
  12352. 750.22 s [vector] +++ OK, passed 100 tests.
  12353. 750.24 s [vector] zipWithM_: OK
  12354. 750.24 s [vector] +++ OK, passed 100 tests.
  12355. 750.24 s [vector] filter: OK
  12356. 750.24 s [vector] +++ OK, passed 100 tests.
  12357. 750.24 s [vector] ifilter: OK
  12358. 750.24 s [vector] +++ OK, passed 100 tests.
  12359. 750.27 s [vector] filterM: OK (0.02s)
  12360. 750.27 s [vector] +++ OK, passed 100 tests.
  12361. 750.27 s [vector] uniq: OK
  12362. 750.27 s [vector] +++ OK, passed 100 tests.
  12363. 750.27 s [vector] mapMaybe: OK
  12364. 750.27 s [vector] +++ OK, passed 100 tests.
  12365. 750.27 s [vector] imapMaybe: OK
  12366. 750.27 s [vector] +++ OK, passed 100 tests.
  12367. 750.28 s [vector] takeWhile: OK
  12368. 750.28 s [vector] +++ OK, passed 100 tests.
  12369. 750.28 s [vector] dropWhile: OK
  12370. 750.28 s [vector] +++ OK, passed 100 tests.
  12371. 750.28 s [vector] partition: OK
  12372. 750.28 s [vector] +++ OK, passed 100 tests.
  12373. 750.29 s [vector] partitionWith: OK
  12374. 750.29 s [vector] +++ OK, passed 100 tests.
  12375. 750.29 s [vector] span: OK
  12376. 750.29 s [vector] +++ OK, passed 100 tests.
  12377. 750.29 s [vector] break: OK
  12378. 750.29 s [vector] +++ OK, passed 100 tests.
  12379. 750.29 s [vector] spanR: OK
  12380. 750.29 s [vector] +++ OK, passed 100 tests.
  12381. 750.29 s [vector] breakR: OK
  12382. 750.29 s [vector] +++ OK, passed 100 tests.
  12383. 750.29 s [vector] groupBy: OK
  12384. 750.29 s [vector] +++ OK, passed 100 tests.
  12385. 750.29 s [vector] elem: OK
  12386. 750.29 s [vector] +++ OK, passed 100 tests.
  12387. 750.29 s [vector] notElem: OK
  12388. 750.29 s [vector] +++ OK, passed 100 tests.
  12389. 750.29 s [vector] find: OK
  12390. 750.29 s [vector] +++ OK, passed 100 tests.
  12391. 750.29 s [vector] findIndex: OK
  12392. 750.29 s [vector] +++ OK, passed 100 tests.
  12393. 750.29 s [vector] findIndexR: OK
  12394. 750.29 s [vector] +++ OK, passed 100 tests.
  12395. 750.29 s [vector] findIndices: OK
  12396. 750.29 s [vector] +++ OK, passed 100 tests.
  12397. 750.30 s [vector] elemIndex: OK
  12398. 750.30 s [vector] +++ OK, passed 100 tests.
  12399. 750.30 s [vector] elemIndices: OK
  12400. 750.30 s [vector] +++ OK, passed 100 tests.
  12401. 750.30 s [vector] foldl: OK
  12402. 750.30 s [vector] +++ OK, passed 100 tests.
  12403. 750.30 s [vector] foldl1: OK
  12404. 750.30 s [vector] +++ OK, passed 100 tests; 25 discarded.
  12405. 750.30 s [vector] foldl': OK
  12406. 750.30 s [vector] +++ OK, passed 100 tests.
  12407. 750.31 s [vector] foldl1': OK
  12408. 750.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12409. 750.31 s [vector] foldr: OK
  12410. 750.31 s [vector] +++ OK, passed 100 tests.
  12411. 750.31 s [vector] foldr1: OK
  12412. 750.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12413. 750.31 s [vector] foldr': OK
  12414. 750.31 s [vector] +++ OK, passed 100 tests.
  12415. 750.31 s [vector] foldr1': OK
  12416. 750.31 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12417. 750.31 s [vector] ifoldl: OK
  12418. 750.31 s [vector] +++ OK, passed 100 tests.
  12419. 750.32 s [vector] ifoldl': OK
  12420. 750.32 s [vector] +++ OK, passed 100 tests.
  12421. 750.32 s [vector] ifoldr: OK
  12422. 750.32 s [vector] +++ OK, passed 100 tests.
  12423. 750.32 s [vector] ifoldr': OK
  12424. 750.33 s [vector] +++ OK, passed 100 tests.
  12425. 750.33 s [vector] ifoldM: OK
  12426. 750.33 s [vector] +++ OK, passed 100 tests.
  12427. 750.33 s [vector] ifoldM': OK
  12428. 750.33 s [vector] +++ OK, passed 100 tests.
  12429. 750.36 s [vector] ifoldM_: OK
  12430. 750.36 s [vector] +++ OK, passed 100 tests.
  12431. 750.36 s [vector] ifoldM'_: OK (0.01s)
  12432. 750.36 s [vector] +++ OK, passed 100 tests.
  12433. 750.36 s [vector] all: OK
  12434. 750.36 s [vector] +++ OK, passed 100 tests.
  12435. 750.36 s [vector] any: OK
  12436. 750.36 s [vector] +++ OK, passed 100 tests.
  12437. 750.36 s [vector] prescanl: OK
  12438. 750.36 s [vector] +++ OK, passed 100 tests.
  12439. 750.36 s [vector] prescanl': OK
  12440. 750.37 s [vector] +++ OK, passed 100 tests.
  12441. 750.37 s [vector] postscanl: OK
  12442. 750.37 s [vector] +++ OK, passed 100 tests.
  12443. 750.37 s [vector] postscanl': OK
  12444. 750.37 s [vector] +++ OK, passed 100 tests.
  12445. 750.37 s [vector] scanl: OK
  12446. 750.37 s [vector] +++ OK, passed 100 tests.
  12447. 750.37 s [vector] scanl': OK
  12448. 750.38 s [vector] +++ OK, passed 100 tests.
  12449. 750.38 s [vector] scanl1: OK
  12450. 750.38 s [vector] +++ OK, passed 100 tests.
  12451. 750.38 s [vector] scanl1': OK
  12452. 750.38 s [vector] +++ OK, passed 100 tests.
  12453. 750.38 s [vector] iscanl: OK
  12454. 750.38 s [vector] +++ OK, passed 100 tests.
  12455. 750.38 s [vector] iscanl': OK
  12456. 750.38 s [vector] +++ OK, passed 100 tests.
  12457. 750.39 s [vector] prescanr: OK
  12458. 750.39 s [vector] +++ OK, passed 100 tests.
  12459. 750.39 s [vector] prescanr': OK
  12460. 750.39 s [vector] +++ OK, passed 100 tests.
  12461. 750.39 s [vector] postscanr: OK
  12462. 750.39 s [vector] +++ OK, passed 100 tests.
  12463. 750.39 s [vector] postscanr': OK
  12464. 750.39 s [vector] +++ OK, passed 100 tests.
  12465. 750.40 s [vector] scanr: OK
  12466. 750.40 s [vector] +++ OK, passed 100 tests.
  12467. 750.40 s [vector] scanr': OK
  12468. 750.40 s [vector] +++ OK, passed 100 tests.
  12469. 750.40 s [vector] scanr1: OK
  12470. 750.40 s [vector] +++ OK, passed 100 tests.
  12471. 750.41 s [vector] scanr1': OK
  12472. 750.41 s [vector] +++ OK, passed 100 tests.
  12473. 750.41 s [vector] iscanr: OK
  12474. 750.41 s [vector] +++ OK, passed 100 tests.
  12475. 750.41 s [vector] iscanr': OK
  12476. 750.41 s [vector] +++ OK, passed 100 tests.
  12477. 750.41 s [vector] mut_read: OK
  12478. 750.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12479. 750.42 s [vector] mut_write: OK
  12480. 750.42 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12481. 750.43 s [vector] mut_modify: OK
  12482. 750.44 s [vector] +++ OK, passed 100 tests; 25 discarded.
  12483. 750.44 s [vector] mut_generate: OK
  12484. 750.44 s [vector] +++ OK, passed 100 tests.
  12485. 750.44 s [vector] mut_generateM: OK
  12486. 750.44 s [vector] +++ OK, passed 100 tests.
  12487. 750.44 s [vector] mut_mapM_: OK (0.01s)
  12488. 750.44 s [vector] +++ OK, passed 100 tests.
  12489. 750.46 s [vector] mut_imapM_: OK (0.02s)
  12490. 750.46 s [vector] +++ OK, passed 100 tests.
  12491. 750.48 s [vector] mut_forM_: OK (0.02s)
  12492. 750.48 s [vector] +++ OK, passed 100 tests.
  12493. 750.48 s [vector] mut_iforM_: OK (0.02s)
  12494. 750.49 s [vector] +++ OK, passed 100 tests.
  12495. 750.49 s [vector] mut_foldr: OK
  12496. 750.49 s [vector] +++ OK, passed 100 tests.
  12497. 750.49 s [vector] mut_foldr': OK
  12498. 750.49 s [vector] +++ OK, passed 100 tests.
  12499. 750.49 s [vector] mut_foldl: OK
  12500. 750.49 s [vector] +++ OK, passed 100 tests.
  12501. 750.50 s [vector] mut_foldl': OK
  12502. 750.50 s [vector] +++ OK, passed 100 tests.
  12503. 750.50 s [vector] mut_ifoldr: OK
  12504. 750.50 s [vector] +++ OK, passed 100 tests.
  12505. 750.50 s [vector] mut_ifoldr': OK
  12506. 750.50 s [vector] +++ OK, passed 100 tests.
  12507. 750.50 s [vector] mut_ifoldl: OK
  12508. 750.50 s [vector] +++ OK, passed 100 tests.
  12509. 750.51 s [vector] mut_ifoldl': OK
  12510. 750.51 s [vector] +++ OK, passed 100 tests.
  12511. 750.51 s [vector] mut_foldM: OK
  12512. 750.51 s [vector] +++ OK, passed 100 tests.
  12513. 750.51 s [vector] mut_foldM': OK
  12514. 750.51 s [vector] +++ OK, passed 100 tests.
  12515. 750.51 s [vector] mut_foldrM: OK
  12516. 750.51 s [vector] +++ OK, passed 100 tests.
  12517. 750.51 s [vector] mut_foldrM': OK
  12518. 750.51 s [vector] +++ OK, passed 100 tests.
  12519. 750.52 s [vector] mut_ifoldM: OK
  12520. 750.52 s [vector] +++ OK, passed 100 tests.
  12521. 750.52 s [vector] mut_ifoldM': OK
  12522. 750.52 s [vector] +++ OK, passed 100 tests.
  12523. 750.52 s [vector] mut_ifoldrM: OK
  12524. 750.52 s [vector] +++ OK, passed 100 tests.
  12525. 750.53 s [vector] mut_ifoldrM': OK
  12526. 750.53 s [vector] +++ OK, passed 100 tests.
  12527. 750.53 s [vector] compare: OK
  12528. 750.53 s [vector] +++ OK, passed 100 tests.
  12529. 750.53 s [vector] maximum: OK
  12530. 750.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12531. 750.53 s [vector] minimum: OK
  12532. 750.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12533. 750.53 s [vector] minIndex: OK
  12534. 750.53 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12535. 750.53 s [vector] maxIndex: OK
  12536. 750.53 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12537. 750.53 s [vector] maximumBy: OK
  12538. 750.53 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12539. 750.53 s [vector] minimumBy: OK
  12540. 750.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12541. 750.53 s [vector] maximumOn: OK
  12542. 750.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12543. 750.53 s [vector] minimumOn: OK
  12544. 750.53 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12545. 750.53 s [vector] maxIndexBy: OK
  12546. 750.53 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12547. 750.53 s [vector] minIndexBy: OK
  12548. 750.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12549. 750.53 s [vector] ListFirstMaxIndexWins: OK
  12550. 750.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12551. 750.53 s [vector] FalseListFirstMaxIndexWins: OK
  12552. 750.53 s [vector] +++ OK, failed as expected. (after 1 test):
  12553. 750.53 s [vector] Exception:
  12554. 750.53 s [vector] Prelude.foldr1: empty list
  12555. 750.53 s [vector] CallStack (from HasCallStack):
  12556. 750.53 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  12557. 750.53 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  12558. 750.53 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12559. 750.53 s [vector] []
  12560. 750.53 s [vector] mempty: OK
  12561. 750.53 s [vector] +++ OK, passed 100 tests.
  12562. 750.53 s [vector] mappend: OK
  12563. 750.53 s [vector] +++ OK, passed 100 tests.
  12564. 750.55 s [vector] mconcat: OK (0.01s)
  12565. 750.55 s [vector] +++ OK, passed 100 tests.
  12566. 750.55 s [vector] glength: OK
  12567. 750.55 s [vector] +++ OK, passed 100 tests.
  12568. 750.55 s [vector] sum: OK
  12569. 750.55 s [vector] +++ OK, passed 100 tests.
  12570. 750.55 s [vector] product: OK
  12571. 750.55 s [vector] +++ OK, passed 100 tests.
  12572. 750.55 s [vector] enumFromN: OK
  12573. 750.55 s [vector] +++ OK, passed 100 tests.
  12574. 750.55 s [vector] enumFromThenN: OK
  12575. 750.55 s [vector] +++ OK, passed 100 tests.
  12576. 750.55 s [vector] enumFromTo: OK
  12577. 750.55 s [vector] +++ OK, passed 100 tests.
  12578. 750.55 s [vector] enumFromThenTo: OK
  12579. 750.55 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12580. 750.55 s [vector] Double
  12581. 750.56 s [vector] fromList.toList == id: OK
  12582. 750.56 s [vector] +++ OK, passed 100 tests.
  12583. 750.56 s [vector] toList.fromList == id: OK
  12584. 750.56 s [vector] +++ OK, passed 100 tests.
  12585. 750.56 s [vector] unstream.stream == id: OK
  12586. 750.56 s [vector] +++ OK, passed 100 tests.
  12587. 750.56 s [vector] stream.unstream == id: OK
  12588. 750.56 s [vector] +++ OK, passed 100 tests.
  12589. 750.56 s [vector] eq: OK
  12590. 750.56 s [vector] +++ OK, passed 100 tests.
  12591. 750.56 s [vector] length: OK
  12592. 750.56 s [vector] +++ OK, passed 100 tests.
  12593. 750.56 s [vector] null: OK
  12594. 750.56 s [vector] +++ OK, passed 100 tests.
  12595. 750.56 s [vector] index: OK
  12596. 750.56 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12597. 750.56 s [vector] safeIndex: OK
  12598. 750.56 s [vector] +++ OK, passed 100 tests.
  12599. 750.56 s [vector] head: OK
  12600. 750.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12601. 750.56 s [vector] last: OK
  12602. 750.56 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12603. 750.56 s [vector] unsafeIndex: OK
  12604. 750.56 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12605. 750.56 s [vector] unsafeHead: OK
  12606. 750.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12607. 750.56 s [vector] unsafeLast: OK
  12608. 750.56 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12609. 750.56 s [vector] slice: OK
  12610. 750.56 s [vector] +++ OK, passed 100 tests.
  12611. 750.57 s [vector] init: OK
  12612. 750.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12613. 750.57 s [vector] tail: OK
  12614. 750.57 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12615. 750.57 s [vector] take: OK
  12616. 750.57 s [vector] +++ OK, passed 100 tests.
  12617. 750.57 s [vector] drop: OK
  12618. 750.57 s [vector] +++ OK, passed 100 tests.
  12619. 750.57 s [vector] splitAt: OK
  12620. 750.57 s [vector] +++ OK, passed 100 tests.
  12621. 750.57 s [vector] empty: OK
  12622. 750.57 s [vector] +++ OK, passed 100 tests.
  12623. 750.57 s [vector] singleton: OK
  12624. 750.57 s [vector] +++ OK, passed 100 tests.
  12625. 750.57 s [vector] replicate: OK
  12626. 750.57 s [vector] +++ OK, passed 100 tests.
  12627. 750.58 s [vector] generate: OK
  12628. 750.58 s [vector] +++ OK, passed 100 tests.
  12629. 750.58 s [vector] iterateN: OK
  12630. 750.58 s [vector] +++ OK, passed 100 tests.
  12631. 750.61 s [vector] iterateNM: OK (0.04s)
  12632. 750.61 s [vector] +++ OK, passed 100 tests.
  12633. 750.64 s [vector] generateM: OK (0.02s)
  12634. 750.64 s [vector] +++ OK, passed 100 tests.
  12635. 750.64 s [vector] replicateM: OK
  12636. 750.64 s [vector] +++ OK, passed 100 tests.
  12637. 750.64 s [vector] create: OK
  12638. 750.64 s [vector] +++ OK, passed 100 tests.
  12639. 750.65 s [vector] createT: OK
  12640. 750.65 s [vector] +++ OK, passed 100 tests.
  12641. 750.65 s [vector] unfoldr: OK
  12642. 750.65 s [vector] +++ OK, passed 100 tests.
  12643. 750.65 s [vector] unfoldrN: OK
  12644. 750.65 s [vector] +++ OK, passed 100 tests.
  12645. 750.65 s [vector] unfoldrExactN: OK
  12646. 750.65 s [vector] +++ OK, passed 100 tests.
  12647. 750.65 s [vector] unfoldrM: OK
  12648. 750.65 s [vector] +++ OK, passed 100 tests.
  12649. 750.65 s [vector] unfoldrNM: OK
  12650. 750.65 s [vector] +++ OK, passed 100 tests.
  12651. 750.72 s [vector] unfoldrExactNM: OK (0.04s)
  12652. 750.72 s [vector] +++ OK, passed 100 tests.
  12653. 750.72 s [vector] constructN: OK (0.01s)
  12654. 750.72 s [vector] +++ OK, passed 100 tests.
  12655. 750.73 s [vector] constructrN: OK
  12656. 750.73 s [vector] +++ OK, passed 100 tests.
  12657. 750.74 s [vector] cons: OK
  12658. 750.74 s [vector] +++ OK, passed 100 tests.
  12659. 750.74 s [vector] snoc: OK
  12660. 750.74 s [vector] +++ OK, passed 100 tests.
  12661. 750.75 s [vector] append: OK
  12662. 750.75 s [vector] +++ OK, passed 100 tests.
  12663. 750.76 s [vector] concat: OK (0.03s)
  12664. 750.76 s [vector] +++ OK, passed 100 tests.
  12665. 750.76 s [vector] force: OK
  12666. 750.78 s [vector] +++ OK, passed 100 tests.
  12667. 750.78 s [vector] upd: OK
  12668. 750.78 s [vector] +++ OK, passed 100 tests.
  12669. 750.78 s [vector] accum: OK (0.02s)
  12670. 750.78 s [vector] +++ OK, passed 100 tests.
  12671. 750.78 s [vector] reverse: OK
  12672. 750.78 s [vector] +++ OK, passed 100 tests.
  12673. 750.78 s [vector] backpermute: OK
  12674. 750.78 s [vector] +++ OK, passed 100 tests.
  12675. 750.79 s [vector] map: OK
  12676. 750.80 s [vector] +++ OK, passed 100 tests.
  12677. 750.80 s [vector] imap: OK
  12678. 750.80 s [vector] +++ OK, passed 100 tests.
  12679. 750.81 s [vector] concatMap: OK
  12680. 750.81 s [vector] +++ OK, passed 100 tests.
  12681. 750.81 s [vector] mapM: OK
  12682. 750.81 s [vector] +++ OK, passed 100 tests.
  12683. 750.85 s [vector] mapM_: OK (0.03s)
  12684. 750.85 s [vector] +++ OK, passed 100 tests.
  12685. 750.86 s [vector] forM: OK
  12686. 750.86 s [vector] +++ OK, passed 100 tests.
  12687. 750.90 s [vector] forM_: OK (0.04s)
  12688. 750.90 s [vector] +++ OK, passed 100 tests.
  12689. 750.92 s [vector] imapM: OK (0.02s)
  12690. 750.92 s [vector] +++ OK, passed 100 tests.
  12691. 750.96 s [vector] imapM_: OK (0.03s)
  12692. 750.96 s [vector] +++ OK, passed 100 tests.
  12693. 750.96 s [vector] zipWith: OK
  12694. 750.96 s [vector] +++ OK, passed 100 tests.
  12695. 750.98 s [vector] zipWith3: OK
  12696. 750.98 s [vector] +++ OK, passed 100 tests.
  12697. 750.98 s [vector] izipWith: OK
  12698. 750.98 s [vector] +++ OK, passed 100 tests.
  12699. 751.00 s [vector] izipWith3: OK (0.01s)
  12700. 751.00 s [vector] +++ OK, passed 100 tests.
  12701. 751.00 s [vector] izipWithM: OK
  12702. 751.00 s [vector] +++ OK, passed 100 tests.
  12703. 751.02 s [vector] izipWithM_: OK (0.02s)
  12704. 751.02 s [vector] +++ OK, passed 100 tests.
  12705. 751.04 s [vector] zipWithM: OK (0.01s)
  12706. 751.04 s [vector] +++ OK, passed 100 tests.
  12707. 751.06 s [vector] zipWithM_: OK (0.02s)
  12708. 751.06 s [vector] +++ OK, passed 100 tests.
  12709. 751.06 s [vector] filter: OK
  12710. 751.06 s [vector] +++ OK, passed 100 tests.
  12711. 751.08 s [vector] ifilter: OK
  12712. 751.08 s [vector] +++ OK, passed 100 tests.
  12713. 751.11 s [vector] filterM: OK (0.04s)
  12714. 751.12 s [vector] +++ OK, passed 100 tests.
  12715. 751.12 s [vector] uniq: OK
  12716. 751.12 s [vector] +++ OK, passed 100 tests.
  12717. 751.12 s [vector] mapMaybe: OK (0.01s)
  12718. 751.12 s [vector] +++ OK, passed 100 tests.
  12719. 751.12 s [vector] imapMaybe: OK
  12720. 751.12 s [vector] +++ OK, passed 100 tests.
  12721. 751.12 s [vector] takeWhile: OK
  12722. 751.13 s [vector] +++ OK, passed 100 tests.
  12723. 751.13 s [vector] dropWhile: OK
  12724. 751.13 s [vector] +++ OK, passed 100 tests.
  12725. 751.13 s [vector] partition: OK
  12726. 751.13 s [vector] +++ OK, passed 100 tests.
  12727. 751.14 s [vector] partitionWith: OK
  12728. 751.14 s [vector] +++ OK, passed 100 tests.
  12729. 751.14 s [vector] span: OK
  12730. 751.14 s [vector] +++ OK, passed 100 tests.
  12731. 751.14 s [vector] break: OK
  12732. 751.14 s [vector] +++ OK, passed 100 tests.
  12733. 751.14 s [vector] spanR: OK
  12734. 751.14 s [vector] +++ OK, passed 100 tests.
  12735. 751.15 s [vector] breakR: OK
  12736. 751.15 s [vector] +++ OK, passed 100 tests.
  12737. 751.15 s [vector] groupBy: OK
  12738. 751.15 s [vector] +++ OK, passed 100 tests.
  12739. 751.16 s [vector] elem: OK
  12740. 751.16 s [vector] +++ OK, passed 100 tests.
  12741. 751.16 s [vector] notElem: OK
  12742. 751.16 s [vector] +++ OK, passed 100 tests.
  12743. 751.16 s [vector] find: OK
  12744. 751.16 s [vector] +++ OK, passed 100 tests.
  12745. 751.16 s [vector] findIndex: OK
  12746. 751.16 s [vector] +++ OK, passed 100 tests.
  12747. 751.16 s [vector] findIndexR: OK
  12748. 751.16 s [vector] +++ OK, passed 100 tests.
  12749. 751.17 s [vector] findIndices: OK
  12750. 751.17 s [vector] +++ OK, passed 100 tests.
  12751. 751.17 s [vector] elemIndex: OK
  12752. 751.17 s [vector] +++ OK, passed 100 tests.
  12753. 751.18 s [vector] elemIndices: OK
  12754. 751.18 s [vector] +++ OK, passed 100 tests.
  12755. 751.19 s [vector] foldl: OK (0.02s)
  12756. 751.20 s [vector] +++ OK, passed 100 tests.
  12757. 751.20 s [vector] foldl1: OK (0.01s)
  12758. 751.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12759. 751.22 s [vector] foldl': OK (0.01s)
  12760. 751.22 s [vector] +++ OK, passed 100 tests.
  12761. 751.22 s [vector] foldl1': OK (0.01s)
  12762. 751.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12763. 751.24 s [vector] foldr: OK (0.01s)
  12764. 751.24 s [vector] +++ OK, passed 100 tests.
  12765. 751.24 s [vector] foldr1: OK (0.01s)
  12766. 751.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12767. 751.26 s [vector] foldr': OK
  12768. 751.26 s [vector] +++ OK, passed 100 tests.
  12769. 751.28 s [vector] foldr1': OK (0.01s)
  12770. 751.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12771. 751.29 s [vector] ifoldl: OK (0.02s)
  12772. 751.29 s [vector] +++ OK, passed 100 tests.
  12773. 751.32 s [vector] ifoldl': OK
  12774. 751.32 s [vector] +++ OK, passed 100 tests.
  12775. 751.33 s [vector] ifoldr: OK (0.01s)
  12776. 751.33 s [vector] +++ OK, passed 100 tests.
  12777. 751.34 s [vector] ifoldr': OK (0.01s)
  12778. 751.34 s [vector] +++ OK, passed 100 tests.
  12779. 751.34 s [vector] ifoldM: OK (0.01s)
  12780. 751.34 s [vector] +++ OK, passed 100 tests.
  12781. 751.36 s [vector] ifoldM': OK
  12782. 751.36 s [vector] +++ OK, passed 100 tests.
  12783. 751.40 s [vector] ifoldM_: OK (0.03s)
  12784. 751.40 s [vector] +++ OK, passed 100 tests.
  12785. 751.42 s [vector] ifoldM'_: OK (0.03s)
  12786. 751.43 s [vector] +++ OK, passed 100 tests.
  12787. 751.43 s [vector] all: OK
  12788. 751.43 s [vector] +++ OK, passed 100 tests.
  12789. 751.43 s [vector] any: OK
  12790. 751.43 s [vector] +++ OK, passed 100 tests.
  12791. 751.44 s [vector] prescanl: OK
  12792. 751.44 s [vector] +++ OK, passed 100 tests.
  12793. 751.46 s [vector] prescanl': OK (0.02s)
  12794. 751.46 s [vector] +++ OK, passed 100 tests.
  12795. 751.47 s [vector] postscanl: OK
  12796. 751.47 s [vector] +++ OK, passed 100 tests.
  12797. 751.48 s [vector] postscanl': OK
  12798. 751.48 s [vector] +++ OK, passed 100 tests.
  12799. 751.50 s [vector] scanl: OK
  12800. 751.50 s [vector] +++ OK, passed 100 tests.
  12801. 751.52 s [vector] scanl': OK (0.01s)
  12802. 751.52 s [vector] +++ OK, passed 100 tests.
  12803. 751.53 s [vector] scanl1: OK (0.01s)
  12804. 751.54 s [vector] +++ OK, passed 100 tests.
  12805. 751.55 s [vector] scanl1': OK (0.01s)
  12806. 751.55 s [vector] +++ OK, passed 100 tests.
  12807. 751.56 s [vector] iscanl: OK (0.02s)
  12808. 751.56 s [vector] +++ OK, passed 100 tests.
  12809. 751.58 s [vector] iscanl': OK (0.02s)
  12810. 751.58 s [vector] +++ OK, passed 100 tests.
  12811. 751.59 s [vector] prescanr: OK (0.02s)
  12812. 751.59 s [vector] +++ OK, passed 100 tests.
  12813. 751.60 s [vector] prescanr': OK
  12814. 751.60 s [vector] +++ OK, passed 100 tests.
  12815. 751.62 s [vector] postscanr: OK (0.01s)
  12816. 751.62 s [vector] +++ OK, passed 100 tests.
  12817. 751.63 s [vector] postscanr': OK (0.01s)
  12818. 751.63 s [vector] +++ OK, passed 100 tests.
  12819. 751.64 s [vector] scanr: OK
  12820. 751.64 s [vector] +++ OK, passed 100 tests.
  12821. 751.66 s [vector] scanr': OK
  12822. 751.66 s [vector] +++ OK, passed 100 tests.
  12823. 751.68 s [vector] scanr1: OK
  12824. 751.68 s [vector] +++ OK, passed 100 tests.
  12825. 751.68 s [vector] scanr1': OK (0.01s)
  12826. 751.68 s [vector] +++ OK, passed 100 tests.
  12827. 751.70 s [vector] iscanr: OK (0.01s)
  12828. 751.70 s [vector] +++ OK, passed 100 tests.
  12829. 751.70 s [vector] iscanr': OK (0.01s)
  12830. 751.70 s [vector] +++ OK, passed 100 tests.
  12831. 751.70 s [vector] mut_read: OK
  12832. 751.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12833. 751.70 s [vector] mut_write: OK
  12834. 751.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12835. 751.70 s [vector] mut_modify: OK
  12836. 751.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12837. 751.70 s [vector] mut_generate: OK
  12838. 751.70 s [vector] +++ OK, passed 100 tests.
  12839. 751.72 s [vector] mut_generateM: OK
  12840. 751.72 s [vector] +++ OK, passed 100 tests.
  12841. 751.76 s [vector] mut_mapM_: OK (0.03s)
  12842. 751.76 s [vector] +++ OK, passed 100 tests.
  12843. 751.80 s [vector] mut_imapM_: OK (0.04s)
  12844. 751.80 s [vector] +++ OK, passed 100 tests.
  12845. 751.82 s [vector] mut_forM_: OK (0.03s)
  12846. 751.82 s [vector] +++ OK, passed 100 tests.
  12847. 751.86 s [vector] mut_iforM_: OK (0.04s)
  12848. 751.86 s [vector] +++ OK, passed 100 tests.
  12849. 751.88 s [vector] mut_foldr: OK
  12850. 751.88 s [vector] +++ OK, passed 100 tests.
  12851. 751.90 s [vector] mut_foldr': OK (0.01s)
  12852. 751.90 s [vector] +++ OK, passed 100 tests.
  12853. 751.91 s [vector] mut_foldl: OK (0.02s)
  12854. 751.91 s [vector] +++ OK, passed 100 tests.
  12855. 751.92 s [vector] mut_foldl': OK (0.01s)
  12856. 751.92 s [vector] +++ OK, passed 100 tests.
  12857. 751.94 s [vector] mut_ifoldr: OK
  12858. 751.94 s [vector] +++ OK, passed 100 tests.
  12859. 751.95 s [vector] mut_ifoldr': OK (0.01s)
  12860. 751.95 s [vector] +++ OK, passed 100 tests.
  12861. 751.95 s [vector] mut_ifoldl: OK (0.01s)
  12862. 751.95 s [vector] +++ OK, passed 100 tests.
  12863. 751.98 s [vector] mut_ifoldl': OK
  12864. 751.98 s [vector] +++ OK, passed 100 tests.
  12865. 751.98 s [vector] mut_foldM: OK (0.01s)
  12866. 751.98 s [vector] +++ OK, passed 100 tests.
  12867. 751.99 s [vector] mut_foldM': OK
  12868. 751.99 s [vector] +++ OK, passed 100 tests.
  12869. 752.00 s [vector] mut_foldrM: OK (0.01s)
  12870. 752.00 s [vector] +++ OK, passed 100 tests.
  12871. 752.02 s [vector] mut_foldrM': OK (0.01s)
  12872. 752.02 s [vector] +++ OK, passed 100 tests.
  12873. 752.04 s [vector] mut_ifoldM: OK (0.02s)
  12874. 752.04 s [vector] +++ OK, passed 100 tests.
  12875. 752.04 s [vector] mut_ifoldM': OK (0.01s)
  12876. 752.04 s [vector] +++ OK, passed 100 tests.
  12877. 752.05 s [vector] mut_ifoldrM: OK
  12878. 752.05 s [vector] +++ OK, passed 100 tests.
  12879. 752.07 s [vector] mut_ifoldrM': OK (0.01s)
  12880. 752.07 s [vector] +++ OK, passed 100 tests.
  12881. 752.07 s [vector] compare: OK
  12882. 752.07 s [vector] +++ OK, passed 100 tests.
  12883. 752.07 s [vector] maximum: OK
  12884. 752.07 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12885. 752.07 s [vector] minimum: OK
  12886. 752.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12887. 752.07 s [vector] minIndex: OK
  12888. 752.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12889. 752.07 s [vector] maxIndex: OK
  12890. 752.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12891. 752.07 s [vector] maximumBy: OK
  12892. 752.07 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12893. 752.07 s [vector] minimumBy: OK
  12894. 752.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12895. 752.07 s [vector] maximumOn: OK
  12896. 752.07 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12897. 752.07 s [vector] minimumOn: OK
  12898. 752.07 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12899. 752.07 s [vector] maxIndexBy: OK
  12900. 752.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12901. 752.07 s [vector] minIndexBy: OK
  12902. 752.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12903. 752.08 s [vector] ListFirstMaxIndexWins: OK
  12904. 752.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12905. 752.08 s [vector] FalseListFirstMaxIndexWins: OK
  12906. 752.08 s [vector] +++ OK, failed as expected. (after 1 test):
  12907. 752.08 s [vector] Exception:
  12908. 752.08 s [vector] Prelude.foldr1: empty list
  12909. 752.08 s [vector] CallStack (from HasCallStack):
  12910. 752.08 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  12911. 752.08 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  12912. 752.08 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12913. 752.08 s [vector] []
  12914. 752.08 s [vector] mempty: OK
  12915. 752.08 s [vector] +++ OK, passed 100 tests.
  12916. 752.08 s [vector] mappend: OK
  12917. 752.08 s [vector] +++ OK, passed 100 tests.
  12918. 752.10 s [vector] mconcat: OK (0.02s)
  12919. 752.10 s [vector] +++ OK, passed 100 tests.
  12920. 752.10 s [vector] glength: OK
  12921. 752.10 s [vector] +++ OK, passed 100 tests.
  12922. 752.10 s [vector] sum: OK
  12923. 752.10 s [vector] +++ OK, passed 100 tests.
  12924. 752.10 s [vector] product: OK
  12925. 752.10 s [vector] +++ OK, passed 100 tests.
  12926. 752.10 s [vector] enumFromN: OK
  12927. 752.10 s [vector] +++ OK, passed 100 tests.
  12928. 752.10 s [vector] enumFromThenN: OK
  12929. 752.10 s [vector] +++ OK, passed 100 tests.
  12930. 752.10 s [vector] enumFromTo: OK
  12931. 752.10 s [vector] +++ OK, passed 100 tests.
  12932. 752.10 s [vector] enumFromThenTo: OK
  12933. 752.10 s [vector] +++ OK, passed 100 tests; 1 discarded.
  12934. 752.10 s [vector] unstream
  12935. 752.10 s [vector] unstream == vunstream (exact): OK
  12936. 752.10 s [vector] +++ OK, passed 100 tests.
  12937. 752.10 s [vector] unstream == vunstream (unknown): OK
  12938. 752.10 s [vector] +++ OK, passed 100 tests.
  12939. 752.10 s [vector] unstreamR ~= vunstream (exact): OK
  12940. 752.10 s [vector] +++ OK, passed 100 tests.
  12941. 752.10 s [vector] unstreamR ~= vunstream (unknown): OK
  12942. 752.10 s [vector] +++ OK, passed 100 tests.
  12943. 752.10 s [vector] Tests.Vector.Storable
  12944. 752.10 s [vector] Data.Vector.Storable.Vector (Int)
  12945. 752.10 s [vector] fromList.toList == id: OK
  12946. 752.10 s [vector] +++ OK, passed 100 tests.
  12947. 752.10 s [vector] toList.fromList == id: OK
  12948. 752.10 s [vector] +++ OK, passed 100 tests.
  12949. 752.10 s [vector] unstream.stream == id: OK
  12950. 752.10 s [vector] +++ OK, passed 100 tests.
  12951. 752.10 s [vector] stream.unstream == id: OK
  12952. 752.10 s [vector] +++ OK, passed 100 tests.
  12953. 752.10 s [vector] eq: OK
  12954. 752.10 s [vector] +++ OK, passed 100 tests.
  12955. 752.11 s [vector] length: OK
  12956. 752.11 s [vector] +++ OK, passed 100 tests.
  12957. 752.11 s [vector] null: OK
  12958. 752.11 s [vector] +++ OK, passed 100 tests.
  12959. 752.11 s [vector] index: OK
  12960. 752.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12961. 752.11 s [vector] safeIndex: OK
  12962. 752.11 s [vector] +++ OK, passed 100 tests.
  12963. 752.11 s [vector] head: OK
  12964. 752.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12965. 752.11 s [vector] last: OK
  12966. 752.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12967. 752.11 s [vector] unsafeIndex: OK
  12968. 752.11 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12969. 752.11 s [vector] unsafeHead: OK
  12970. 752.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12971. 752.11 s [vector] unsafeLast: OK
  12972. 752.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12973. 752.11 s [vector] slice: OK
  12974. 752.11 s [vector] +++ OK, passed 100 tests.
  12975. 752.11 s [vector] init: OK
  12976. 752.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12977. 752.11 s [vector] tail: OK
  12978. 752.11 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12979. 752.11 s [vector] take: OK
  12980. 752.11 s [vector] +++ OK, passed 100 tests.
  12981. 752.11 s [vector] drop: OK
  12982. 752.11 s [vector] +++ OK, passed 100 tests.
  12983. 752.11 s [vector] splitAt: OK
  12984. 752.11 s [vector] +++ OK, passed 100 tests.
  12985. 752.11 s [vector] empty: OK
  12986. 752.11 s [vector] +++ OK, passed 100 tests.
  12987. 752.11 s [vector] singleton: OK
  12988. 752.11 s [vector] +++ OK, passed 100 tests.
  12989. 752.11 s [vector] replicate: OK
  12990. 752.11 s [vector] +++ OK, passed 100 tests.
  12991. 752.11 s [vector] generate: OK
  12992. 752.11 s [vector] +++ OK, passed 100 tests.
  12993. 752.11 s [vector] iterateN: OK
  12994. 752.11 s [vector] +++ OK, passed 100 tests.
  12995. 752.16 s [vector] iterateNM: OK (0.03s)
  12996. 752.16 s [vector] +++ OK, passed 100 tests.
  12997. 752.17 s [vector] generateM: OK (0.01s)
  12998. 752.17 s [vector] +++ OK, passed 100 tests.
  12999. 752.18 s [vector] replicateM: OK
  13000. 752.18 s [vector] +++ OK, passed 100 tests.
  13001. 752.18 s [vector] create: OK
  13002. 752.18 s [vector] +++ OK, passed 100 tests.
  13003. 752.18 s [vector] createT: OK
  13004. 752.18 s [vector] +++ OK, passed 100 tests.
  13005. 752.18 s [vector] unfoldr: OK
  13006. 752.18 s [vector] +++ OK, passed 100 tests.
  13007. 752.18 s [vector] unfoldrN: OK
  13008. 752.18 s [vector] +++ OK, passed 100 tests.
  13009. 752.19 s [vector] unfoldrExactN: OK
  13010. 752.19 s [vector] +++ OK, passed 100 tests.
  13011. 752.19 s [vector] unfoldrM: OK
  13012. 752.19 s [vector] +++ OK, passed 100 tests.
  13013. 752.20 s [vector] unfoldrNM: OK
  13014. 752.20 s [vector] +++ OK, passed 100 tests.
  13015. 752.22 s [vector] unfoldrExactNM: OK (0.03s)
  13016. 752.22 s [vector] +++ OK, passed 100 tests.
  13017. 752.23 s [vector] constructN: OK
  13018. 752.23 s [vector] +++ OK, passed 100 tests.
  13019. 752.23 s [vector] constructrN: OK
  13020. 752.23 s [vector] +++ OK, passed 100 tests.
  13021. 752.23 s [vector] cons: OK
  13022. 752.23 s [vector] +++ OK, passed 100 tests.
  13023. 752.23 s [vector] snoc: OK
  13024. 752.23 s [vector] +++ OK, passed 100 tests.
  13025. 752.24 s [vector] append: OK
  13026. 752.24 s [vector] +++ OK, passed 100 tests.
  13027. 752.25 s [vector] concat: OK (0.01s)
  13028. 752.25 s [vector] +++ OK, passed 100 tests.
  13029. 752.25 s [vector] force: OK
  13030. 752.25 s [vector] +++ OK, passed 100 tests.
  13031. 752.25 s [vector] upd: OK
  13032. 752.25 s [vector] +++ OK, passed 100 tests.
  13033. 752.25 s [vector] accum: OK
  13034. 752.25 s [vector] +++ OK, passed 100 tests.
  13035. 752.25 s [vector] reverse: OK
  13036. 752.25 s [vector] +++ OK, passed 100 tests.
  13037. 752.25 s [vector] backpermute: OK
  13038. 752.25 s [vector] +++ OK, passed 100 tests.
  13039. 752.26 s [vector] map: OK
  13040. 752.26 s [vector] +++ OK, passed 100 tests.
  13041. 752.26 s [vector] imap: OK
  13042. 752.26 s [vector] +++ OK, passed 100 tests.
  13043. 752.26 s [vector] concatMap: OK
  13044. 752.26 s [vector] +++ OK, passed 100 tests.
  13045. 752.27 s [vector] mapM: OK
  13046. 752.27 s [vector] +++ OK, passed 100 tests.
  13047. 752.28 s [vector] mapM_: OK (0.01s)
  13048. 752.28 s [vector] +++ OK, passed 100 tests.
  13049. 752.28 s [vector] forM: OK
  13050. 752.28 s [vector] +++ OK, passed 100 tests.
  13051. 752.29 s [vector] forM_: OK (0.01s)
  13052. 752.29 s [vector] +++ OK, passed 100 tests.
  13053. 752.29 s [vector] imapM: OK
  13054. 752.29 s [vector] +++ OK, passed 100 tests.
  13055. 752.31 s [vector] imapM_: OK (0.01s)
  13056. 752.31 s [vector] +++ OK, passed 100 tests.
  13057. 752.31 s [vector] zipWith: OK
  13058. 752.31 s [vector] +++ OK, passed 100 tests.
  13059. 752.32 s [vector] zipWith3: OK
  13060. 752.32 s [vector] +++ OK, passed 100 tests.
  13061. 752.32 s [vector] izipWith: OK
  13062. 752.32 s [vector] +++ OK, passed 100 tests.
  13063. 752.32 s [vector] izipWith3: OK
  13064. 752.32 s [vector] +++ OK, passed 100 tests.
  13065. 752.34 s [vector] izipWithM: OK
  13066. 752.34 s [vector] +++ OK, passed 100 tests.
  13067. 752.34 s [vector] izipWithM_: OK (0.01s)
  13068. 752.34 s [vector] +++ OK, passed 100 tests.
  13069. 752.34 s [vector] zipWithM: OK
  13070. 752.34 s [vector] +++ OK, passed 100 tests.
  13071. 752.35 s [vector] zipWithM_: OK
  13072. 752.35 s [vector] +++ OK, passed 100 tests.
  13073. 752.35 s [vector] filter: OK
  13074. 752.35 s [vector] +++ OK, passed 100 tests.
  13075. 752.36 s [vector] ifilter: OK
  13076. 752.36 s [vector] +++ OK, passed 100 tests.
  13077. 752.38 s [vector] filterM: OK (0.03s)
  13078. 752.38 s [vector] +++ OK, passed 100 tests.
  13079. 752.38 s [vector] uniq: OK
  13080. 752.38 s [vector] +++ OK, passed 100 tests.
  13081. 752.38 s [vector] mapMaybe: OK
  13082. 752.38 s [vector] +++ OK, passed 100 tests.
  13083. 752.38 s [vector] imapMaybe: OK
  13084. 752.38 s [vector] +++ OK, passed 100 tests.
  13085. 752.38 s [vector] takeWhile: OK
  13086. 752.38 s [vector] +++ OK, passed 100 tests.
  13087. 752.38 s [vector] dropWhile: OK
  13088. 752.38 s [vector] +++ OK, passed 100 tests.
  13089. 752.39 s [vector] partition: OK
  13090. 752.39 s [vector] +++ OK, passed 100 tests.
  13091. 752.39 s [vector] partitionWith: OK
  13092. 752.39 s [vector] +++ OK, passed 100 tests.
  13093. 752.39 s [vector] span: OK
  13094. 752.39 s [vector] +++ OK, passed 100 tests.
  13095. 752.39 s [vector] break: OK
  13096. 752.39 s [vector] +++ OK, passed 100 tests.
  13097. 752.39 s [vector] spanR: OK
  13098. 752.39 s [vector] +++ OK, passed 100 tests.
  13099. 752.39 s [vector] breakR: OK
  13100. 752.39 s [vector] +++ OK, passed 100 tests.
  13101. 752.39 s [vector] groupBy: OK
  13102. 752.39 s [vector] +++ OK, passed 100 tests.
  13103. 752.39 s [vector] elem: OK
  13104. 752.39 s [vector] +++ OK, passed 100 tests.
  13105. 752.39 s [vector] notElem: OK
  13106. 752.39 s [vector] +++ OK, passed 100 tests.
  13107. 752.39 s [vector] find: OK
  13108. 752.39 s [vector] +++ OK, passed 100 tests.
  13109. 752.39 s [vector] findIndex: OK
  13110. 752.39 s [vector] +++ OK, passed 100 tests.
  13111. 752.40 s [vector] findIndexR: OK
  13112. 752.40 s [vector] +++ OK, passed 100 tests.
  13113. 752.40 s [vector] findIndices: OK
  13114. 752.40 s [vector] +++ OK, passed 100 tests.
  13115. 752.40 s [vector] elemIndex: OK
  13116. 752.40 s [vector] +++ OK, passed 100 tests.
  13117. 752.40 s [vector] elemIndices: OK
  13118. 752.40 s [vector] +++ OK, passed 100 tests.
  13119. 752.40 s [vector] foldl: OK
  13120. 752.40 s [vector] +++ OK, passed 100 tests.
  13121. 752.40 s [vector] foldl1: OK
  13122. 752.40 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13123. 752.41 s [vector] foldl': OK
  13124. 752.41 s [vector] +++ OK, passed 100 tests.
  13125. 752.41 s [vector] foldl1': OK
  13126. 752.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13127. 752.41 s [vector] foldr: OK
  13128. 752.41 s [vector] +++ OK, passed 100 tests.
  13129. 752.42 s [vector] foldr1: OK
  13130. 752.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13131. 752.42 s [vector] foldr': OK
  13132. 752.42 s [vector] +++ OK, passed 100 tests.
  13133. 752.42 s [vector] foldr1': OK
  13134. 752.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13135. 752.42 s [vector] ifoldl: OK
  13136. 752.42 s [vector] +++ OK, passed 100 tests.
  13137. 752.43 s [vector] ifoldl': OK
  13138. 752.43 s [vector] +++ OK, passed 100 tests.
  13139. 752.43 s [vector] ifoldr: OK
  13140. 752.43 s [vector] +++ OK, passed 100 tests.
  13141. 752.43 s [vector] ifoldr': OK
  13142. 752.43 s [vector] +++ OK, passed 100 tests.
  13143. 752.44 s [vector] ifoldM: OK
  13144. 752.44 s [vector] +++ OK, passed 100 tests.
  13145. 752.44 s [vector] ifoldM': OK
  13146. 752.44 s [vector] +++ OK, passed 100 tests.
  13147. 752.46 s [vector] ifoldM_: OK (0.02s)
  13148. 752.46 s [vector] +++ OK, passed 100 tests.
  13149. 752.47 s [vector] ifoldM'_: OK (0.02s)
  13150. 752.47 s [vector] +++ OK, passed 100 tests.
  13151. 752.47 s [vector] all: OK
  13152. 752.47 s [vector] +++ OK, passed 100 tests.
  13153. 752.47 s [vector] any: OK
  13154. 752.48 s [vector] +++ OK, passed 100 tests.
  13155. 752.48 s [vector] prescanl: OK
  13156. 752.48 s [vector] +++ OK, passed 100 tests.
  13157. 752.48 s [vector] prescanl': OK
  13158. 752.48 s [vector] +++ OK, passed 100 tests.
  13159. 752.49 s [vector] postscanl: OK
  13160. 752.49 s [vector] +++ OK, passed 100 tests.
  13161. 752.49 s [vector] postscanl': OK
  13162. 752.49 s [vector] +++ OK, passed 100 tests.
  13163. 752.49 s [vector] scanl: OK
  13164. 752.49 s [vector] +++ OK, passed 100 tests.
  13165. 752.49 s [vector] scanl': OK
  13166. 752.49 s [vector] +++ OK, passed 100 tests.
  13167. 752.49 s [vector] scanl1: OK
  13168. 752.50 s [vector] +++ OK, passed 100 tests.
  13169. 752.50 s [vector] scanl1': OK
  13170. 752.50 s [vector] +++ OK, passed 100 tests.
  13171. 752.51 s [vector] iscanl: OK
  13172. 752.51 s [vector] +++ OK, passed 100 tests.
  13173. 752.52 s [vector] iscanl': OK
  13174. 752.52 s [vector] +++ OK, passed 100 tests.
  13175. 752.52 s [vector] prescanr: OK
  13176. 752.52 s [vector] +++ OK, passed 100 tests.
  13177. 752.52 s [vector] prescanr': OK
  13178. 752.52 s [vector] +++ OK, passed 100 tests.
  13179. 752.52 s [vector] postscanr: OK
  13180. 752.52 s [vector] +++ OK, passed 100 tests.
  13181. 752.52 s [vector] postscanr': OK
  13182. 752.52 s [vector] +++ OK, passed 100 tests.
  13183. 752.53 s [vector] scanr: OK
  13184. 752.53 s [vector] +++ OK, passed 100 tests.
  13185. 752.53 s [vector] scanr': OK
  13186. 752.53 s [vector] +++ OK, passed 100 tests.
  13187. 752.53 s [vector] scanr1: OK
  13188. 752.53 s [vector] +++ OK, passed 100 tests.
  13189. 752.54 s [vector] scanr1': OK
  13190. 752.54 s [vector] +++ OK, passed 100 tests.
  13191. 752.55 s [vector] iscanr: OK
  13192. 752.55 s [vector] +++ OK, passed 100 tests.
  13193. 752.55 s [vector] iscanr': OK (0.01s)
  13194. 752.55 s [vector] +++ OK, passed 100 tests.
  13195. 752.55 s [vector] mut_read: OK
  13196. 752.55 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13197. 752.55 s [vector] mut_write: OK
  13198. 752.55 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13199. 752.55 s [vector] mut_modify: OK
  13200. 752.55 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13201. 752.56 s [vector] mut_generate: OK
  13202. 752.56 s [vector] +++ OK, passed 100 tests.
  13203. 752.56 s [vector] mut_generateM: OK
  13204. 752.56 s [vector] +++ OK, passed 100 tests.
  13205. 752.58 s [vector] mut_mapM_: OK
  13206. 752.58 s [vector] +++ OK, passed 100 tests.
  13207. 752.59 s [vector] mut_imapM_: OK (0.02s)
  13208. 752.59 s [vector] +++ OK, passed 100 tests.
  13209. 752.62 s [vector] mut_forM_: OK
  13210. 752.62 s [vector] +++ OK, passed 100 tests.
  13211. 752.62 s [vector] mut_iforM_: OK (0.02s)
  13212. 752.62 s [vector] +++ OK, passed 100 tests.
  13213. 752.63 s [vector] mut_foldr: OK
  13214. 752.63 s [vector] +++ OK, passed 100 tests.
  13215. 752.63 s [vector] mut_foldr': OK
  13216. 752.63 s [vector] +++ OK, passed 100 tests.
  13217. 752.63 s [vector] mut_foldl: OK
  13218. 752.63 s [vector] +++ OK, passed 100 tests.
  13219. 752.63 s [vector] mut_foldl': OK
  13220. 752.63 s [vector] +++ OK, passed 100 tests.
  13221. 752.63 s [vector] mut_ifoldr: OK
  13222. 752.63 s [vector] +++ OK, passed 100 tests.
  13223. 752.64 s [vector] mut_ifoldr': OK
  13224. 752.64 s [vector] +++ OK, passed 100 tests.
  13225. 752.64 s [vector] mut_ifoldl: OK
  13226. 752.64 s [vector] +++ OK, passed 100 tests.
  13227. 752.64 s [vector] mut_ifoldl': OK
  13228. 752.65 s [vector] +++ OK, passed 100 tests.
  13229. 752.65 s [vector] mut_foldM: OK
  13230. 752.65 s [vector] +++ OK, passed 100 tests.
  13231. 752.65 s [vector] mut_foldM': OK
  13232. 752.65 s [vector] +++ OK, passed 100 tests.
  13233. 752.65 s [vector] mut_foldrM: OK
  13234. 752.66 s [vector] +++ OK, passed 100 tests.
  13235. 752.66 s [vector] mut_foldrM': OK
  13236. 752.66 s [vector] +++ OK, passed 100 tests.
  13237. 752.66 s [vector] mut_ifoldM: OK
  13238. 752.66 s [vector] +++ OK, passed 100 tests.
  13239. 752.67 s [vector] mut_ifoldM': OK
  13240. 752.67 s [vector] +++ OK, passed 100 tests.
  13241. 752.67 s [vector] mut_ifoldrM: OK
  13242. 752.67 s [vector] +++ OK, passed 100 tests.
  13243. 752.67 s [vector] mut_ifoldrM': OK
  13244. 752.67 s [vector] +++ OK, passed 100 tests.
  13245. 752.67 s [vector] compare: OK
  13246. 752.67 s [vector] +++ OK, passed 100 tests.
  13247. 752.67 s [vector] maximum: OK
  13248. 752.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13249. 752.67 s [vector] minimum: OK
  13250. 752.68 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13251. 752.68 s [vector] minIndex: OK
  13252. 752.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13253. 752.68 s [vector] maxIndex: OK
  13254. 752.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13255. 752.68 s [vector] maximumBy: OK
  13256. 752.68 s [vector] +++ OK, passed 100 tests; 24 discarded.
  13257. 752.68 s [vector] minimumBy: OK
  13258. 752.68 s [vector] +++ OK, passed 100 tests; 10 discarded.
  13259. 752.68 s [vector] maximumOn: OK
  13260. 752.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13261. 752.68 s [vector] minimumOn: OK
  13262. 752.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13263. 752.68 s [vector] maxIndexBy: OK
  13264. 752.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13265. 752.68 s [vector] minIndexBy: OK
  13266. 752.68 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13267. 752.68 s [vector] ListFirstMaxIndexWins: OK
  13268. 752.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13269. 752.68 s [vector] FalseListFirstMaxIndexWins: OK
  13270. 752.68 s [vector] +++ OK, failed as expected. (after 1 test):
  13271. 752.68 s [vector] Exception:
  13272. 752.68 s [vector] Prelude.foldr1: empty list
  13273. 752.68 s [vector] CallStack (from HasCallStack):
  13274. 752.68 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  13275. 752.68 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  13276. 752.68 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13277. 752.68 s [vector] []
  13278. 752.68 s [vector] mempty: OK
  13279. 752.68 s [vector] +++ OK, passed 100 tests.
  13280. 752.70 s [vector] mappend: OK
  13281. 752.70 s [vector] +++ OK, passed 100 tests.
  13282. 752.70 s [vector] mconcat: OK (0.02s)
  13283. 752.70 s [vector] +++ OK, passed 100 tests.
  13284. 752.70 s [vector] glength: OK
  13285. 752.70 s [vector] +++ OK, passed 100 tests.
  13286. 752.70 s [vector] sum: OK
  13287. 752.70 s [vector] +++ OK, passed 100 tests.
  13288. 752.70 s [vector] product: OK
  13289. 752.70 s [vector] +++ OK, passed 100 tests.
  13290. 752.70 s [vector] enumFromN: OK
  13291. 752.70 s [vector] +++ OK, passed 100 tests.
  13292. 752.70 s [vector] enumFromThenN: OK
  13293. 752.70 s [vector] +++ OK, passed 100 tests.
  13294. 752.70 s [vector] enumFromTo: OK
  13295. 752.70 s [vector] +++ OK, passed 100 tests.
  13296. 752.70 s [vector] enumFromThenTo: OK
  13297. 752.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13298. 752.71 s [vector] Data.Vector.Storable.Vector (Double)
  13299. 752.71 s [vector] fromList.toList == id: OK
  13300. 752.71 s [vector] +++ OK, passed 100 tests.
  13301. 752.71 s [vector] toList.fromList == id: OK
  13302. 752.71 s [vector] +++ OK, passed 100 tests.
  13303. 752.71 s [vector] unstream.stream == id: OK
  13304. 752.71 s [vector] +++ OK, passed 100 tests.
  13305. 752.71 s [vector] stream.unstream == id: OK
  13306. 752.71 s [vector] +++ OK, passed 100 tests.
  13307. 752.71 s [vector] eq: OK
  13308. 752.71 s [vector] +++ OK, passed 100 tests.
  13309. 752.71 s [vector] length: OK
  13310. 752.71 s [vector] +++ OK, passed 100 tests.
  13311. 752.71 s [vector] null: OK
  13312. 752.71 s [vector] +++ OK, passed 100 tests.
  13313. 752.71 s [vector] index: OK
  13314. 752.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13315. 752.71 s [vector] safeIndex: OK
  13316. 752.71 s [vector] +++ OK, passed 100 tests.
  13317. 752.71 s [vector] head: OK
  13318. 752.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13319. 752.71 s [vector] last: OK
  13320. 752.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13321. 752.71 s [vector] unsafeIndex: OK
  13322. 752.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13323. 752.72 s [vector] unsafeHead: OK
  13324. 752.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13325. 752.72 s [vector] unsafeLast: OK
  13326. 752.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13327. 752.72 s [vector] slice: OK
  13328. 752.72 s [vector] +++ OK, passed 100 tests.
  13329. 752.72 s [vector] init: OK
  13330. 752.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13331. 752.72 s [vector] tail: OK
  13332. 752.72 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13333. 752.72 s [vector] take: OK
  13334. 752.72 s [vector] +++ OK, passed 100 tests.
  13335. 752.72 s [vector] drop: OK
  13336. 752.72 s [vector] +++ OK, passed 100 tests.
  13337. 752.72 s [vector] splitAt: OK
  13338. 752.72 s [vector] +++ OK, passed 100 tests.
  13339. 752.72 s [vector] empty: OK
  13340. 752.72 s [vector] +++ OK, passed 100 tests.
  13341. 752.72 s [vector] singleton: OK
  13342. 752.72 s [vector] +++ OK, passed 100 tests.
  13343. 752.72 s [vector] replicate: OK
  13344. 752.72 s [vector] +++ OK, passed 100 tests.
  13345. 752.73 s [vector] generate: OK
  13346. 752.73 s [vector] +++ OK, passed 100 tests.
  13347. 752.73 s [vector] iterateN: OK
  13348. 752.73 s [vector] +++ OK, passed 100 tests.
  13349. 752.78 s [vector] iterateNM: OK (0.04s)
  13350. 752.78 s [vector] +++ OK, passed 100 tests.
  13351. 752.82 s [vector] generateM: OK (0.04s)
  13352. 752.82 s [vector] +++ OK, passed 100 tests.
  13353. 752.82 s [vector] replicateM: OK
  13354. 752.82 s [vector] +++ OK, passed 100 tests.
  13355. 752.82 s [vector] create: OK
  13356. 752.82 s [vector] +++ OK, passed 100 tests.
  13357. 752.83 s [vector] createT: OK
  13358. 752.83 s [vector] +++ OK, passed 100 tests.
  13359. 752.83 s [vector] unfoldr: OK
  13360. 752.83 s [vector] +++ OK, passed 100 tests.
  13361. 752.83 s [vector] unfoldrN: OK
  13362. 752.83 s [vector] +++ OK, passed 100 tests.
  13363. 752.83 s [vector] unfoldrExactN: OK
  13364. 752.83 s [vector] +++ OK, passed 100 tests.
  13365. 752.83 s [vector] unfoldrM: OK
  13366. 752.83 s [vector] +++ OK, passed 100 tests.
  13367. 752.84 s [vector] unfoldrNM: OK
  13368. 752.84 s [vector] +++ OK, passed 100 tests.
  13369. 752.88 s [vector] unfoldrExactNM: OK (0.04s)
  13370. 752.88 s [vector] +++ OK, passed 100 tests.
  13371. 752.90 s [vector] constructN: OK (0.01s)
  13372. 752.90 s [vector] +++ OK, passed 100 tests.
  13373. 752.91 s [vector] constructrN: OK (0.01s)
  13374. 752.91 s [vector] +++ OK, passed 100 tests.
  13375. 752.92 s [vector] cons: OK
  13376. 752.92 s [vector] +++ OK, passed 100 tests.
  13377. 752.92 s [vector] snoc: OK
  13378. 752.92 s [vector] +++ OK, passed 100 tests.
  13379. 752.93 s [vector] append: OK
  13380. 752.93 s [vector] +++ OK, passed 100 tests.
  13381. 752.93 s [vector] concat: OK (0.02s)
  13382. 752.93 s [vector] +++ OK, passed 100 tests.
  13383. 752.93 s [vector] force: OK
  13384. 752.93 s [vector] +++ OK, passed 100 tests.
  13385. 752.94 s [vector] upd: OK
  13386. 752.94 s [vector] +++ OK, passed 100 tests.
  13387. 752.96 s [vector] accum: OK (0.01s)
  13388. 752.96 s [vector] +++ OK, passed 100 tests.
  13389. 752.96 s [vector] reverse: OK
  13390. 752.97 s [vector] +++ OK, passed 100 tests.
  13391. 752.98 s [vector] backpermute: OK
  13392. 752.98 s [vector] +++ OK, passed 100 tests.
  13393. 752.99 s [vector] map: OK
  13394. 752.99 s [vector] +++ OK, passed 100 tests.
  13395. 753.00 s [vector] imap: OK
  13396. 753.00 s [vector] +++ OK, passed 100 tests.
  13397. 753.00 s [vector] concatMap: OK
  13398. 753.00 s [vector] +++ OK, passed 100 tests.
  13399. 753.00 s [vector] mapM: OK
  13400. 753.00 s [vector] +++ OK, passed 100 tests.
  13401. 753.03 s [vector] mapM_: OK (0.03s)
  13402. 753.03 s [vector] +++ OK, passed 100 tests.
  13403. 753.04 s [vector] forM: OK
  13404. 753.04 s [vector] +++ OK, passed 100 tests.
  13405. 753.08 s [vector] forM_: OK (0.04s)
  13406. 753.08 s [vector] +++ OK, passed 100 tests.
  13407. 753.08 s [vector] imapM: OK
  13408. 753.09 s [vector] +++ OK, passed 100 tests.
  13409. 753.14 s [vector] imapM_: OK (0.03s)
  13410. 753.52 s [vector] +++ OK, passed 100 tests.
  13411. 753.52 s [vector] zipWith: OK
  13412. 753.52 s [vector] +++ OK, passed 100 tests.
  13413. 753.52 s [vector] zipWith3: OK
  13414. 753.52 s [vector] +++ OK, passed 100 tests.
  13415. 753.52 s [vector] izipWith: OK
  13416. 753.52 s [vector] +++ OK, passed 100 tests.
  13417. 753.52 s [vector] izipWith3: OK (0.01s)
  13418. 753.52 s [vector] +++ OK, passed 100 tests.
  13419. 753.52 s [vector] izipWithM: OK (0.01s)
  13420. 753.52 s [vector] +++ OK, passed 100 tests.
  13421. 753.52 s [vector] izipWithM_: OK (0.03s)
  13422. 753.52 s [vector] +++ OK, passed 100 tests.
  13423. 753.52 s [vector] zipWithM: OK
  13424. 753.52 s [vector] +++ OK, passed 100 tests.
  13425. 753.52 s [vector] zipWithM_: OK (0.02s)
  13426. 753.52 s [vector] +++ OK, passed 100 tests.
  13427. 753.52 s [vector] filter: OK
  13428. 753.52 s [vector] +++ OK, passed 100 tests.
  13429. 753.52 s [vector] ifilter: OK
  13430. 753.52 s [vector] +++ OK, passed 100 tests.
  13431. 753.52 s [vector] filterM: OK (0.04s)
  13432. 753.52 s [vector] +++ OK, passed 100 tests.
  13433. 753.52 s [vector] uniq: OK
  13434. 753.52 s [vector] +++ OK, passed 100 tests.
  13435. 753.52 s [vector] mapMaybe: OK
  13436. 753.52 s [vector] +++ OK, passed 100 tests.
  13437. 753.52 s [vector] imapMaybe: OK
  13438. 753.52 s [vector] +++ OK, passed 100 tests.
  13439. 753.52 s [vector] takeWhile: OK
  13440. 753.52 s [vector] +++ OK, passed 100 tests.
  13441. 753.52 s [vector] dropWhile: OK
  13442. 753.52 s [vector] +++ OK, passed 100 tests.
  13443. 753.52 s [vector] partition: OK
  13444. 753.52 s [vector] +++ OK, passed 100 tests.
  13445. 753.52 s [vector] partitionWith: OK (0.01s)
  13446. 753.52 s [vector] +++ OK, passed 100 tests.
  13447. 753.52 s [vector] span: OK
  13448. 753.52 s [vector] +++ OK, passed 100 tests.
  13449. 753.52 s [vector] break: OK
  13450. 753.52 s [vector] +++ OK, passed 100 tests.
  13451. 753.52 s [vector] spanR: OK
  13452. 753.52 s [vector] +++ OK, passed 100 tests.
  13453. 753.52 s [vector] breakR: OK
  13454. 753.52 s [vector] +++ OK, passed 100 tests.
  13455. 753.52 s [vector] groupBy: OK
  13456. 753.52 s [vector] +++ OK, passed 100 tests.
  13457. 753.52 s [vector] elem: OK
  13458. 753.52 s [vector] +++ OK, passed 100 tests.
  13459. 753.52 s [vector] notElem: OK
  13460. 753.52 s [vector] +++ OK, passed 100 tests.
  13461. 753.52 s [vector] find: OK
  13462. 753.52 s [vector] +++ OK, passed 100 tests.
  13463. 753.52 s [vector] findIndex: OK
  13464. 753.52 s [vector] +++ OK, passed 100 tests.
  13465. 753.52 s [vector] findIndexR: OK
  13466. 753.52 s [vector] +++ OK, passed 100 tests.
  13467. 753.52 s [vector] findIndices: OK
  13468. 753.52 s [vector] +++ OK, passed 100 tests.
  13469. 753.52 s [vector] elemIndex: OK
  13470. 753.52 s [vector] +++ OK, passed 100 tests.
  13471. 753.52 s [vector] elemIndices: OK
  13472. 753.52 s [vector] +++ OK, passed 100 tests.
  13473. 753.52 s [vector] foldl: OK (0.02s)
  13474. 753.52 s [vector] +++ OK, passed 100 tests.
  13475. 753.52 s [vector] foldl1: OK
  13476. 753.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13477. 753.52 s [vector] foldl': OK (0.02s)
  13478. 753.52 s [vector] +++ OK, passed 100 tests.
  13479. 753.52 s [vector] foldl1': OK (0.01s)
  13480. 753.52 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13481. 753.52 s [vector] foldr: OK
  13482. 753.52 s [vector] +++ OK, passed 100 tests.
  13483. 753.52 s [vector] foldr1: OK
  13484. 753.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13485. 753.52 s [vector] foldr': OK
  13486. 753.52 s [vector] +++ OK, passed 100 tests.
  13487. 753.52 s [vector] foldr1': OK
  13488. 753.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13489. 753.52 s [vector] ifoldl: OK (0.01s)
  13490. 753.52 s [vector] +++ OK, passed 100 tests.
  13491. 753.52 s [vector] ifoldl': OK
  13492. 753.52 s [vector] +++ OK, passed 100 tests.
  13493. 753.52 s [vector] ifoldr: OK (0.02s)
  13494. 753.52 s [vector] +++ OK, passed 100 tests.
  13495. 753.52 s [vector] ifoldr': OK (0.01s)
  13496. 753.52 s [vector] +++ OK, passed 100 tests.
  13497. 753.54 s [vector] ifoldM: OK (0.02s)
  13498. 753.54 s [vector] +++ OK, passed 100 tests.
  13499. 753.56 s [vector] ifoldM': OK (0.02s)
  13500. 753.56 s [vector] +++ OK, passed 100 tests.
  13501. 753.58 s [vector] ifoldM_: OK (0.03s)
  13502. 753.58 s [vector] +++ OK, passed 100 tests.
  13503. 753.61 s [vector] ifoldM'_: OK (0.03s)
  13504. 753.61 s [vector] +++ OK, passed 100 tests.
  13505. 753.62 s [vector] all: OK
  13506. 753.62 s [vector] +++ OK, passed 100 tests.
  13507. 753.62 s [vector] any: OK
  13508. 753.62 s [vector] +++ OK, passed 100 tests.
  13509. 753.64 s [vector] prescanl: OK (0.01s)
  13510. 753.64 s [vector] +++ OK, passed 100 tests.
  13511. 753.64 s [vector] prescanl': OK (0.01s)
  13512. 753.64 s [vector] +++ OK, passed 100 tests.
  13513. 753.66 s [vector] postscanl: OK (0.02s)
  13514. 753.67 s [vector] +++ OK, passed 100 tests.
  13515. 753.68 s [vector] postscanl': OK (0.02s)
  13516. 753.68 s [vector] +++ OK, passed 100 tests.
  13517. 753.70 s [vector] scanl: OK (0.01s)
  13518. 753.70 s [vector] +++ OK, passed 100 tests.
  13519. 753.71 s [vector] scanl': OK (0.01s)
  13520. 753.71 s [vector] +++ OK, passed 100 tests.
  13521. 753.74 s [vector] scanl1: OK
  13522. 753.74 s [vector] +++ OK, passed 100 tests.
  13523. 753.76 s [vector] scanl1': OK (0.02s)
  13524. 753.76 s [vector] +++ OK, passed 100 tests.
  13525. 753.78 s [vector] iscanl: OK (0.02s)
  13526. 753.78 s [vector] +++ OK, passed 100 tests.
  13527. 753.78 s [vector] iscanl': OK (0.02s)
  13528. 753.78 s [vector] +++ OK, passed 100 tests.
  13529. 753.80 s [vector] prescanr: OK (0.01s)
  13530. 753.80 s [vector] +++ OK, passed 100 tests.
  13531. 753.82 s [vector] prescanr': OK (0.02s)
  13532. 753.82 s [vector] +++ OK, passed 100 tests.
  13533. 753.82 s [vector] postscanr: OK (0.01s)
  13534. 753.82 s [vector] +++ OK, passed 100 tests.
  13535. 753.84 s [vector] postscanr': OK
  13536. 753.84 s [vector] +++ OK, passed 100 tests.
  13537. 753.85 s [vector] scanr: OK
  13538. 753.85 s [vector] +++ OK, passed 100 tests.
  13539. 753.88 s [vector] scanr': OK (0.01s)
  13540. 753.88 s [vector] +++ OK, passed 100 tests.
  13541. 753.90 s [vector] scanr1: OK (0.02s)
  13542. 753.90 s [vector] +++ OK, passed 100 tests.
  13543. 753.91 s [vector] scanr1': OK (0.01s)
  13544. 753.91 s [vector] +++ OK, passed 100 tests.
  13545. 753.92 s [vector] iscanr: OK (0.01s)
  13546. 753.92 s [vector] +++ OK, passed 100 tests.
  13547. 753.93 s [vector] iscanr': OK (0.02s)
  13548. 753.93 s [vector] +++ OK, passed 100 tests.
  13549. 753.93 s [vector] mut_read: OK
  13550. 753.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13551. 753.93 s [vector] mut_write: OK
  13552. 753.93 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13553. 753.93 s [vector] mut_modify: OK
  13554. 753.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13555. 753.94 s [vector] mut_generate: OK
  13556. 753.94 s [vector] +++ OK, passed 100 tests.
  13557. 753.96 s [vector] mut_generateM: OK (0.02s)
  13558. 753.96 s [vector] +++ OK, passed 100 tests.
  13559. 754.00 s [vector] mut_mapM_: OK (0.03s)
  13560. 754.00 s [vector] +++ OK, passed 100 tests.
  13561. 754.02 s [vector] mut_imapM_: OK (0.03s)
  13562. 754.02 s [vector] +++ OK, passed 100 tests.
  13563. 754.06 s [vector] mut_forM_: OK (0.03s)
  13564. 754.06 s [vector] +++ OK, passed 100 tests.
  13565. 754.08 s [vector] mut_iforM_: OK (0.04s)
  13566. 754.08 s [vector] +++ OK, passed 100 tests.
  13567. 754.10 s [vector] mut_foldr: OK
  13568. 754.10 s [vector] +++ OK, passed 100 tests.
  13569. 754.13 s [vector] mut_foldr': OK (0.01s)
  13570. 754.13 s [vector] +++ OK, passed 100 tests.
  13571. 754.13 s [vector] mut_foldl: OK (0.01s)
  13572. 754.13 s [vector] +++ OK, passed 100 tests.
  13573. 754.14 s [vector] mut_foldl': OK (0.01s)
  13574. 754.14 s [vector] +++ OK, passed 100 tests.
  13575. 754.16 s [vector] mut_ifoldr: OK (0.01s)
  13576. 754.16 s [vector] +++ OK, passed 100 tests.
  13577. 754.16 s [vector] mut_ifoldr': OK (0.02s)
  13578. 754.16 s [vector] +++ OK, passed 100 tests.
  13579. 754.18 s [vector] mut_ifoldl: OK (0.02s)
  13580. 754.18 s [vector] +++ OK, passed 100 tests.
  13581. 754.20 s [vector] mut_ifoldl': OK (0.01s)
  13582. 754.20 s [vector] +++ OK, passed 100 tests.
  13583. 754.21 s [vector] mut_foldM: OK (0.01s)
  13584. 754.21 s [vector] +++ OK, passed 100 tests.
  13585. 754.22 s [vector] mut_foldM': OK (0.01s)
  13586. 754.22 s [vector] +++ OK, passed 100 tests.
  13587. 754.24 s [vector] mut_foldrM: OK
  13588. 754.24 s [vector] +++ OK, passed 100 tests.
  13589. 754.24 s [vector] mut_foldrM': OK (0.01s)
  13590. 754.25 s [vector] +++ OK, passed 100 tests.
  13591. 754.26 s [vector] mut_ifoldM: OK (0.01s)
  13592. 754.26 s [vector] +++ OK, passed 100 tests.
  13593. 754.28 s [vector] mut_ifoldM': OK (0.02s)
  13594. 754.28 s [vector] +++ OK, passed 100 tests.
  13595. 754.30 s [vector] mut_ifoldrM: OK (0.02s)
  13596. 754.30 s [vector] +++ OK, passed 100 tests.
  13597. 754.31 s [vector] mut_ifoldrM': OK (0.02s)
  13598. 754.31 s [vector] +++ OK, passed 100 tests.
  13599. 754.31 s [vector] compare: OK
  13600. 754.31 s [vector] +++ OK, passed 100 tests.
  13601. 754.31 s [vector] maximum: OK
  13602. 754.31 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13603. 754.31 s [vector] minimum: OK
  13604. 754.31 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13605. 754.31 s [vector] minIndex: OK
  13606. 754.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13607. 754.31 s [vector] maxIndex: OK
  13608. 754.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13609. 754.31 s [vector] maximumBy: OK
  13610. 754.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13611. 754.31 s [vector] minimumBy: OK
  13612. 754.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13613. 754.31 s [vector] maximumOn: OK
  13614. 754.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13615. 754.31 s [vector] minimumOn: OK
  13616. 754.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13617. 754.31 s [vector] maxIndexBy: OK
  13618. 754.31 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13619. 754.31 s [vector] minIndexBy: OK
  13620. 754.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13621. 754.31 s [vector] ListFirstMaxIndexWins: OK
  13622. 754.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13623. 754.31 s [vector] FalseListFirstMaxIndexWins: OK
  13624. 754.31 s [vector] +++ OK, failed as expected. (after 1 test):
  13625. 754.31 s [vector] Exception:
  13626. 754.32 s [vector] Prelude.foldr1: empty list
  13627. 754.32 s [vector] CallStack (from HasCallStack):
  13628. 754.32 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  13629. 754.32 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  13630. 754.32 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13631. 754.32 s [vector] []
  13632. 754.32 s [vector] mempty: OK
  13633. 754.32 s [vector] +++ OK, passed 100 tests.
  13634. 754.32 s [vector] mappend: OK
  13635. 754.32 s [vector] +++ OK, passed 100 tests.
  13636. 754.35 s [vector] mconcat: OK (0.02s)
  13637. 754.35 s [vector] +++ OK, passed 100 tests.
  13638. 754.35 s [vector] glength: OK
  13639. 754.35 s [vector] +++ OK, passed 100 tests.
  13640. 754.35 s [vector] sum: OK
  13641. 754.35 s [vector] +++ OK, passed 100 tests.
  13642. 754.35 s [vector] product: OK
  13643. 754.35 s [vector] +++ OK, passed 100 tests.
  13644. 754.35 s [vector] enumFromN: OK
  13645. 754.35 s [vector] +++ OK, passed 100 tests.
  13646. 754.35 s [vector] enumFromThenN: OK
  13647. 754.35 s [vector] +++ OK, passed 100 tests.
  13648. 754.35 s [vector] enumFromTo: OK
  13649. 754.35 s [vector] +++ OK, passed 100 tests.
  13650. 754.35 s [vector] enumFromThenTo: OK
  13651. 754.35 s [vector] +++ OK, passed 100 tests; 1 discarded.
  13652. 754.35 s [vector] unstream
  13653. 754.35 s [vector] unstream == vunstream (exact): OK
  13654. 754.35 s [vector] +++ OK, passed 100 tests.
  13655. 754.35 s [vector] unstream == vunstream (unknown): OK
  13656. 754.35 s [vector] +++ OK, passed 100 tests.
  13657. 754.35 s [vector] unstreamR ~= vunstream (exact): OK
  13658. 754.35 s [vector] +++ OK, passed 100 tests.
  13659. 754.35 s [vector] unstreamR ~= vunstream (unknown): OK
  13660. 754.35 s [vector] +++ OK, passed 100 tests.
  13661. 754.35 s [vector] Tests.Vector.Strict
  13662. 754.35 s [vector] Bool
  13663. 754.35 s [vector] fromList.toList == id: OK
  13664. 754.35 s [vector] +++ OK, passed 100 tests.
  13665. 754.35 s [vector] toList.fromList == id: OK
  13666. 754.35 s [vector] +++ OK, passed 100 tests.
  13667. 754.35 s [vector] unstream.stream == id: OK
  13668. 754.35 s [vector] +++ OK, passed 100 tests.
  13669. 754.35 s [vector] stream.unstream == id: OK
  13670. 754.35 s [vector] +++ OK, passed 100 tests.
  13671. 754.35 s [vector] eq: OK
  13672. 754.35 s [vector] +++ OK, passed 100 tests.
  13673. 754.35 s [vector] length: OK
  13674. 754.35 s [vector] +++ OK, passed 100 tests.
  13675. 754.35 s [vector] null: OK
  13676. 754.36 s [vector] +++ OK, passed 100 tests.
  13677. 754.36 s [vector] index: OK
  13678. 754.36 s [vector] +++ OK, passed 100 tests; 23 discarded.
  13679. 754.36 s [vector] safeIndex: OK
  13680. 754.36 s [vector] +++ OK, passed 100 tests.
  13681. 754.36 s [vector] head: OK
  13682. 754.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13683. 754.36 s [vector] last: OK
  13684. 754.36 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13685. 754.36 s [vector] unsafeIndex: OK
  13686. 754.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13687. 754.36 s [vector] unsafeHead: OK
  13688. 754.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13689. 754.36 s [vector] unsafeLast: OK
  13690. 754.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13691. 754.36 s [vector] slice: OK
  13692. 754.36 s [vector] +++ OK, passed 100 tests.
  13693. 754.36 s [vector] init: OK
  13694. 754.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13695. 754.36 s [vector] tail: OK
  13696. 754.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13697. 754.36 s [vector] take: OK
  13698. 754.36 s [vector] +++ OK, passed 100 tests.
  13699. 754.36 s [vector] drop: OK
  13700. 754.36 s [vector] +++ OK, passed 100 tests.
  13701. 754.36 s [vector] splitAt: OK
  13702. 754.36 s [vector] +++ OK, passed 100 tests.
  13703. 754.36 s [vector] empty: OK
  13704. 754.36 s [vector] +++ OK, passed 100 tests.
  13705. 754.36 s [vector] singleton: OK
  13706. 754.36 s [vector] +++ OK, passed 100 tests.
  13707. 754.36 s [vector] replicate: OK
  13708. 754.36 s [vector] +++ OK, passed 100 tests.
  13709. 754.36 s [vector] generate: OK
  13710. 754.36 s [vector] +++ OK, passed 100 tests.
  13711. 754.37 s [vector] iterateN: OK
  13712. 754.38 s [vector] +++ OK, passed 100 tests.
  13713. 754.38 s [vector] iterateNM: OK (0.01s)
  13714. 754.38 s [vector] +++ OK, passed 100 tests.
  13715. 754.38 s [vector] generateM: OK (0.01s)
  13716. 754.38 s [vector] +++ OK, passed 100 tests.
  13717. 754.40 s [vector] replicateM: OK
  13718. 754.40 s [vector] +++ OK, passed 100 tests.
  13719. 754.40 s [vector] create: OK
  13720. 754.40 s [vector] +++ OK, passed 100 tests.
  13721. 754.40 s [vector] createT: OK
  13722. 754.40 s [vector] +++ OK, passed 100 tests.
  13723. 754.40 s [vector] unfoldr: OK
  13724. 754.40 s [vector] +++ OK, passed 100 tests.
  13725. 754.40 s [vector] unfoldrN: OK
  13726. 754.40 s [vector] +++ OK, passed 100 tests.
  13727. 754.40 s [vector] unfoldrExactN: OK
  13728. 754.40 s [vector] +++ OK, passed 100 tests.
  13729. 754.40 s [vector] unfoldrM: OK
  13730. 754.40 s [vector] +++ OK, passed 100 tests.
  13731. 754.42 s [vector] unfoldrNM: OK (0.01s)
  13732. 754.42 s [vector] +++ OK, passed 100 tests.
  13733. 754.45 s [vector] unfoldrExactNM: OK (0.04s)
  13734. 754.45 s [vector] +++ OK, passed 100 tests.
  13735. 754.45 s [vector] constructN: OK
  13736. 754.45 s [vector] +++ OK, passed 100 tests.
  13737. 754.45 s [vector] constructrN: OK
  13738. 754.45 s [vector] +++ OK, passed 100 tests.
  13739. 754.45 s [vector] cons: OK
  13740. 754.45 s [vector] +++ OK, passed 100 tests.
  13741. 754.45 s [vector] snoc: OK
  13742. 754.45 s [vector] +++ OK, passed 100 tests.
  13743. 754.46 s [vector] append: OK
  13744. 754.46 s [vector] +++ OK, passed 100 tests.
  13745. 754.47 s [vector] concat: OK (0.01s)
  13746. 754.47 s [vector] +++ OK, passed 100 tests.
  13747. 754.47 s [vector] force: OK
  13748. 754.47 s [vector] +++ OK, passed 100 tests.
  13749. 754.47 s [vector] upd: OK
  13750. 754.47 s [vector] +++ OK, passed 100 tests.
  13751. 754.47 s [vector] accum: OK
  13752. 754.47 s [vector] +++ OK, passed 100 tests.
  13753. 754.47 s [vector] reverse: OK
  13754. 754.47 s [vector] +++ OK, passed 100 tests.
  13755. 754.48 s [vector] backpermute: OK
  13756. 754.48 s [vector] +++ OK, passed 100 tests.
  13757. 754.48 s [vector] map: OK
  13758. 754.48 s [vector] +++ OK, passed 100 tests.
  13759. 754.48 s [vector] imap: OK
  13760. 754.48 s [vector] +++ OK, passed 100 tests.
  13761. 754.48 s [vector] concatMap: OK
  13762. 754.50 s [vector] +++ OK, passed 100 tests.
  13763. 754.50 s [vector] mapM: OK
  13764. 754.50 s [vector] +++ OK, passed 100 tests.
  13765. 754.50 s [vector] mapM_: OK (0.02s)
  13766. 754.50 s [vector] +++ OK, passed 100 tests.
  13767. 754.50 s [vector] forM: OK
  13768. 754.50 s [vector] +++ OK, passed 100 tests.
  13769. 754.51 s [vector] forM_: OK
  13770. 754.51 s [vector] +++ OK, passed 100 tests.
  13771. 754.51 s [vector] imapM: OK
  13772. 754.51 s [vector] +++ OK, passed 100 tests.
  13773. 754.53 s [vector] imapM_: OK
  13774. 754.53 s [vector] +++ OK, passed 100 tests.
  13775. 754.53 s [vector] zipWith: OK
  13776. 754.53 s [vector] +++ OK, passed 100 tests.
  13777. 754.53 s [vector] zipWith3: OK
  13778. 754.53 s [vector] +++ OK, passed 100 tests.
  13779. 754.53 s [vector] izipWith: OK
  13780. 754.53 s [vector] +++ OK, passed 100 tests.
  13781. 754.53 s [vector] izipWith3: OK
  13782. 754.53 s [vector] +++ OK, passed 100 tests.
  13783. 754.53 s [vector] izipWithM: OK
  13784. 754.54 s [vector] +++ OK, passed 100 tests.
  13785. 754.54 s [vector] izipWithM_: OK
  13786. 754.54 s [vector] +++ OK, passed 100 tests.
  13787. 754.55 s [vector] zipWithM: OK
  13788. 754.55 s [vector] +++ OK, passed 100 tests.
  13789. 754.55 s [vector] zipWithM_: OK
  13790. 754.55 s [vector] +++ OK, passed 100 tests.
  13791. 754.55 s [vector] filter: OK
  13792. 754.55 s [vector] +++ OK, passed 100 tests.
  13793. 754.55 s [vector] ifilter: OK
  13794. 754.55 s [vector] +++ OK, passed 100 tests.
  13795. 754.57 s [vector] filterM: OK
  13796. 754.57 s [vector] +++ OK, passed 100 tests.
  13797. 754.57 s [vector] uniq: OK
  13798. 754.57 s [vector] +++ OK, passed 100 tests.
  13799. 754.57 s [vector] mapMaybe: OK
  13800. 754.57 s [vector] +++ OK, passed 100 tests.
  13801. 754.57 s [vector] imapMaybe: OK
  13802. 754.57 s [vector] +++ OK, passed 100 tests.
  13803. 754.58 s [vector] takeWhile: OK
  13804. 754.58 s [vector] +++ OK, passed 100 tests.
  13805. 754.58 s [vector] dropWhile: OK
  13806. 754.58 s [vector] +++ OK, passed 100 tests.
  13807. 754.58 s [vector] partition: OK
  13808. 754.58 s [vector] +++ OK, passed 100 tests.
  13809. 754.58 s [vector] partitionWith: OK
  13810. 754.58 s [vector] +++ OK, passed 100 tests.
  13811. 754.58 s [vector] span: OK
  13812. 754.58 s [vector] +++ OK, passed 100 tests.
  13813. 754.58 s [vector] break: OK
  13814. 754.58 s [vector] +++ OK, passed 100 tests.
  13815. 754.58 s [vector] spanR: OK
  13816. 754.58 s [vector] +++ OK, passed 100 tests.
  13817. 754.58 s [vector] breakR: OK
  13818. 754.58 s [vector] +++ OK, passed 100 tests.
  13819. 754.58 s [vector] groupBy: OK
  13820. 754.58 s [vector] +++ OK, passed 100 tests.
  13821. 754.58 s [vector] elem: OK
  13822. 754.58 s [vector] +++ OK, passed 100 tests.
  13823. 754.59 s [vector] notElem: OK
  13824. 754.59 s [vector] +++ OK, passed 100 tests.
  13825. 754.59 s [vector] find: OK
  13826. 754.59 s [vector] +++ OK, passed 100 tests.
  13827. 754.59 s [vector] findIndex: OK
  13828. 754.59 s [vector] +++ OK, passed 100 tests.
  13829. 754.59 s [vector] findIndexR: OK
  13830. 754.59 s [vector] +++ OK, passed 100 tests.
  13831. 754.59 s [vector] findIndices: OK
  13832. 754.59 s [vector] +++ OK, passed 100 tests.
  13833. 754.59 s [vector] elemIndex: OK
  13834. 754.59 s [vector] +++ OK, passed 100 tests.
  13835. 754.59 s [vector] elemIndices: OK
  13836. 754.59 s [vector] +++ OK, passed 100 tests.
  13837. 754.59 s [vector] foldl: OK
  13838. 754.59 s [vector] +++ OK, passed 100 tests.
  13839. 754.59 s [vector] foldl1: OK
  13840. 754.59 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13841. 754.59 s [vector] foldl': OK
  13842. 754.59 s [vector] +++ OK, passed 100 tests.
  13843. 754.59 s [vector] foldl1': OK
  13844. 754.59 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13845. 754.59 s [vector] foldr: OK
  13846. 754.59 s [vector] +++ OK, passed 100 tests.
  13847. 754.60 s [vector] foldr1: OK
  13848. 754.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13849. 754.60 s [vector] foldr': OK
  13850. 754.60 s [vector] +++ OK, passed 100 tests.
  13851. 754.60 s [vector] foldr1': OK
  13852. 754.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13853. 754.60 s [vector] ifoldl: OK
  13854. 754.60 s [vector] +++ OK, passed 100 tests.
  13855. 754.60 s [vector] ifoldl': OK
  13856. 754.60 s [vector] +++ OK, passed 100 tests.
  13857. 754.60 s [vector] ifoldr: OK
  13858. 754.60 s [vector] +++ OK, passed 100 tests.
  13859. 754.60 s [vector] ifoldr': OK
  13860. 754.60 s [vector] +++ OK, passed 100 tests.
  13861. 754.61 s [vector] ifoldM: OK
  13862. 754.61 s [vector] +++ OK, passed 100 tests.
  13863. 754.62 s [vector] ifoldM': OK
  13864. 754.62 s [vector] +++ OK, passed 100 tests.
  13865. 754.62 s [vector] ifoldM_: OK (0.01s)
  13866. 754.62 s [vector] +++ OK, passed 100 tests.
  13867. 754.63 s [vector] ifoldM'_: OK
  13868. 754.63 s [vector] +++ OK, passed 100 tests.
  13869. 754.63 s [vector] all: OK
  13870. 754.63 s [vector] +++ OK, passed 100 tests.
  13871. 754.63 s [vector] any: OK
  13872. 754.63 s [vector] +++ OK, passed 100 tests.
  13873. 754.63 s [vector] prescanl: OK
  13874. 754.63 s [vector] +++ OK, passed 100 tests.
  13875. 754.63 s [vector] prescanl': OK
  13876. 754.63 s [vector] +++ OK, passed 100 tests.
  13877. 754.63 s [vector] postscanl: OK
  13878. 754.63 s [vector] +++ OK, passed 100 tests.
  13879. 754.64 s [vector] postscanl': OK
  13880. 754.64 s [vector] +++ OK, passed 100 tests.
  13881. 754.64 s [vector] scanl: OK
  13882. 754.64 s [vector] +++ OK, passed 100 tests.
  13883. 754.64 s [vector] scanl': OK
  13884. 754.64 s [vector] +++ OK, passed 100 tests.
  13885. 754.64 s [vector] scanl1: OK
  13886. 754.64 s [vector] +++ OK, passed 100 tests.
  13887. 754.64 s [vector] scanl1': OK
  13888. 754.64 s [vector] +++ OK, passed 100 tests.
  13889. 754.64 s [vector] iscanl: OK
  13890. 754.64 s [vector] +++ OK, passed 100 tests.
  13891. 754.64 s [vector] iscanl': OK
  13892. 754.64 s [vector] +++ OK, passed 100 tests.
  13893. 754.64 s [vector] prescanr: OK
  13894. 754.64 s [vector] +++ OK, passed 100 tests.
  13895. 754.65 s [vector] prescanr': OK
  13896. 754.65 s [vector] +++ OK, passed 100 tests.
  13897. 754.65 s [vector] postscanr: OK
  13898. 754.65 s [vector] +++ OK, passed 100 tests.
  13899. 754.65 s [vector] postscanr': OK
  13900. 754.65 s [vector] +++ OK, passed 100 tests.
  13901. 754.65 s [vector] scanr: OK
  13902. 754.65 s [vector] +++ OK, passed 100 tests.
  13903. 754.66 s [vector] scanr': OK
  13904. 754.66 s [vector] +++ OK, passed 100 tests.
  13905. 754.66 s [vector] scanr1: OK
  13906. 754.66 s [vector] +++ OK, passed 100 tests.
  13907. 754.66 s [vector] scanr1': OK
  13908. 754.66 s [vector] +++ OK, passed 100 tests.
  13909. 754.66 s [vector] iscanr: OK
  13910. 754.66 s [vector] +++ OK, passed 100 tests.
  13911. 754.66 s [vector] iscanr': OK
  13912. 754.66 s [vector] +++ OK, passed 100 tests.
  13913. 754.66 s [vector] mut_read: OK
  13914. 754.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13915. 754.66 s [vector] mut_write: OK
  13916. 754.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13917. 754.67 s [vector] mut_modify: OK
  13918. 754.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13919. 754.67 s [vector] mut_generate: OK
  13920. 754.67 s [vector] +++ OK, passed 100 tests.
  13921. 754.67 s [vector] mut_generateM: OK
  13922. 754.67 s [vector] +++ OK, passed 100 tests.
  13923. 754.69 s [vector] mut_mapM_: OK
  13924. 754.70 s [vector] +++ OK, passed 100 tests.
  13925. 754.70 s [vector] mut_imapM_: OK
  13926. 754.70 s [vector] +++ OK, passed 100 tests.
  13927. 754.70 s [vector] mut_forM_: OK
  13928. 754.70 s [vector] +++ OK, passed 100 tests.
  13929. 754.71 s [vector] mut_iforM_: OK (0.01s)
  13930. 754.71 s [vector] +++ OK, passed 100 tests.
  13931. 754.72 s [vector] mut_foldr: OK
  13932. 754.72 s [vector] +++ OK, passed 100 tests.
  13933. 754.72 s [vector] mut_foldr': OK
  13934. 754.72 s [vector] +++ OK, passed 100 tests.
  13935. 754.72 s [vector] mut_foldl: OK
  13936. 754.72 s [vector] +++ OK, passed 100 tests.
  13937. 754.72 s [vector] mut_foldl': OK
  13938. 754.72 s [vector] +++ OK, passed 100 tests.
  13939. 754.72 s [vector] mut_ifoldr: OK
  13940. 754.72 s [vector] +++ OK, passed 100 tests.
  13941. 754.72 s [vector] mut_ifoldr': OK
  13942. 754.72 s [vector] +++ OK, passed 100 tests.
  13943. 754.72 s [vector] mut_ifoldl: OK
  13944. 754.72 s [vector] +++ OK, passed 100 tests.
  13945. 754.73 s [vector] mut_ifoldl': OK
  13946. 754.73 s [vector] +++ OK, passed 100 tests.
  13947. 754.73 s [vector] mut_foldM: OK
  13948. 754.73 s [vector] +++ OK, passed 100 tests.
  13949. 754.73 s [vector] mut_foldM': OK
  13950. 754.73 s [vector] +++ OK, passed 100 tests.
  13951. 754.73 s [vector] mut_foldrM: OK
  13952. 754.73 s [vector] +++ OK, passed 100 tests.
  13953. 754.73 s [vector] mut_foldrM': OK
  13954. 754.73 s [vector] +++ OK, passed 100 tests.
  13955. 754.73 s [vector] mut_ifoldM: OK
  13956. 754.73 s [vector] +++ OK, passed 100 tests.
  13957. 754.73 s [vector] mut_ifoldM': OK
  13958. 754.73 s [vector] +++ OK, passed 100 tests.
  13959. 754.73 s [vector] mut_ifoldrM: OK
  13960. 754.74 s [vector] +++ OK, passed 100 tests.
  13961. 754.74 s [vector] mut_ifoldrM': OK
  13962. 754.74 s [vector] +++ OK, passed 100 tests.
  13963. 754.74 s [vector] compare: OK
  13964. 754.74 s [vector] +++ OK, passed 100 tests.
  13965. 754.74 s [vector] maximum: OK
  13966. 754.74 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13967. 754.74 s [vector] minimum: OK
  13968. 754.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13969. 754.74 s [vector] minIndex: OK
  13970. 754.74 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13971. 754.74 s [vector] maxIndex: OK
  13972. 754.74 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13973. 754.74 s [vector] maximumBy: OK
  13974. 754.74 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13975. 754.74 s [vector] minimumBy: OK
  13976. 754.74 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13977. 754.74 s [vector] maximumOn: OK
  13978. 754.74 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13979. 754.74 s [vector] minimumOn: OK
  13980. 754.74 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13981. 754.74 s [vector] maxIndexBy: OK
  13982. 754.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13983. 754.74 s [vector] minIndexBy: OK
  13984. 754.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13985. 754.74 s [vector] ListFirstMaxIndexWins: OK
  13986. 754.74 s [vector] +++ OK, passed 100 tests; 27 discarded.
  13987. 754.74 s [vector] FalseListFirstMaxIndexWins: OK
  13988. 754.74 s [vector] +++ OK, failed as expected. (after 1 test):
  13989. 754.74 s [vector] Exception:
  13990. 754.74 s [vector] Prelude.foldr1: empty list
  13991. 754.74 s [vector] CallStack (from HasCallStack):
  13992. 754.74 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  13993. 754.74 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  13994. 754.74 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13995. 754.74 s [vector] []
  13996. 754.74 s [vector] zip: OK
  13997. 754.74 s [vector] +++ OK, passed 100 tests.
  13998. 754.74 s [vector] zip3: OK
  13999. 754.74 s [vector] +++ OK, passed 100 tests.
  14000. 754.74 s [vector] unzip: OK
  14001. 754.74 s [vector] +++ OK, passed 100 tests.
  14002. 754.74 s [vector] unzip3: OK
  14003. 754.74 s [vector] +++ OK, passed 100 tests.
  14004. 754.74 s [vector] indexed: OK
  14005. 754.74 s [vector] +++ OK, passed 100 tests.
  14006. 754.74 s [vector] update: OK
  14007. 754.75 s [vector] +++ OK, passed 100 tests.
  14008. 754.75 s [vector] concat: OK
  14009. 754.75 s [vector] +++ OK, passed 100 tests.
  14010. 754.75 s [vector] mempty: OK
  14011. 754.75 s [vector] +++ OK, passed 100 tests.
  14012. 754.75 s [vector] mappend: OK
  14013. 754.75 s [vector] +++ OK, passed 100 tests.
  14014. 754.76 s [vector] mconcat: OK
  14015. 754.76 s [vector] +++ OK, passed 100 tests.
  14016. 754.76 s [vector] fmap: OK
  14017. 754.76 s [vector] +++ OK, passed 100 tests.
  14018. 754.76 s [vector] return: OK
  14019. 754.76 s [vector] +++ OK, passed 100 tests.
  14020. 754.77 s [vector] bind: OK
  14021. 754.77 s [vector] +++ OK, passed 100 tests.
  14022. 754.77 s [vector] mzip: OK
  14023. 754.77 s [vector] +++ OK, passed 100 tests.
  14024. 754.77 s [vector] munzip: OK
  14025. 754.77 s [vector] +++ OK, passed 100 tests.
  14026. 754.77 s [vector] applicative_pure: OK
  14027. 754.77 s [vector] +++ OK, passed 100 tests.
  14028. 754.78 s [vector] applicative_appl: OK (0.01s)
  14029. 754.78 s [vector] +++ OK, passed 100 tests.
  14030. 754.78 s [vector] alternative_empty: OK
  14031. 754.78 s [vector] +++ OK, passed 100 tests.
  14032. 754.78 s [vector] alternative_or: OK
  14033. 754.78 s [vector] +++ OK, passed 100 tests.
  14034. 754.80 s [vector] sequence: OK (0.02s)
  14035. 754.80 s [vector] +++ OK, passed 100 tests.
  14036. 754.81 s [vector] sequence_: OK
  14037. 754.81 s [vector] +++ OK, passed 100 tests.
  14038. 754.81 s [vector] glength: OK
  14039. 754.81 s [vector] +++ OK, passed 100 tests.
  14040. 754.81 s [vector] and: OK
  14041. 754.81 s [vector] +++ OK, passed 100 tests.
  14042. 754.81 s [vector] or: OK
  14043. 754.81 s [vector] +++ OK, passed 100 tests.
  14044. 754.81 s [vector] Int
  14045. 754.81 s [vector] fromList.toList == id: OK
  14046. 754.81 s [vector] +++ OK, passed 100 tests.
  14047. 754.81 s [vector] toList.fromList == id: OK
  14048. 754.81 s [vector] +++ OK, passed 100 tests.
  14049. 754.81 s [vector] unstream.stream == id: OK
  14050. 754.81 s [vector] +++ OK, passed 100 tests.
  14051. 754.81 s [vector] stream.unstream == id: OK
  14052. 754.81 s [vector] +++ OK, passed 100 tests.
  14053. 754.81 s [vector] eq: OK
  14054. 754.81 s [vector] +++ OK, passed 100 tests.
  14055. 754.81 s [vector] length: OK
  14056. 754.81 s [vector] +++ OK, passed 100 tests.
  14057. 754.81 s [vector] null: OK
  14058. 754.81 s [vector] +++ OK, passed 100 tests.
  14059. 754.81 s [vector] index: OK
  14060. 754.81 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14061. 754.81 s [vector] safeIndex: OK
  14062. 754.81 s [vector] +++ OK, passed 100 tests.
  14063. 754.81 s [vector] head: OK
  14064. 754.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14065. 754.81 s [vector] last: OK
  14066. 754.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14067. 754.81 s [vector] unsafeIndex: OK
  14068. 754.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14069. 754.81 s [vector] unsafeHead: OK
  14070. 754.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14071. 754.82 s [vector] unsafeLast: OK
  14072. 754.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14073. 754.82 s [vector] slice: OK
  14074. 754.82 s [vector] +++ OK, passed 100 tests.
  14075. 754.82 s [vector] init: OK
  14076. 754.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14077. 754.82 s [vector] tail: OK
  14078. 754.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14079. 754.82 s [vector] take: OK
  14080. 754.82 s [vector] +++ OK, passed 100 tests.
  14081. 754.82 s [vector] drop: OK
  14082. 754.82 s [vector] +++ OK, passed 100 tests.
  14083. 754.82 s [vector] splitAt: OK
  14084. 754.82 s [vector] +++ OK, passed 100 tests.
  14085. 754.82 s [vector] empty: OK
  14086. 754.82 s [vector] +++ OK, passed 100 tests.
  14087. 754.82 s [vector] singleton: OK
  14088. 754.82 s [vector] +++ OK, passed 100 tests.
  14089. 754.82 s [vector] replicate: OK
  14090. 754.82 s [vector] +++ OK, passed 100 tests.
  14091. 754.82 s [vector] generate: OK
  14092. 754.82 s [vector] +++ OK, passed 100 tests.
  14093. 754.82 s [vector] iterateN: OK
  14094. 754.82 s [vector] +++ OK, passed 100 tests.
  14095. 754.86 s [vector] iterateNM: OK (0.04s)
  14096. 754.86 s [vector] +++ OK, passed 100 tests.
  14097. 754.88 s [vector] generateM: OK (0.02s)
  14098. 754.88 s [vector] +++ OK, passed 100 tests.
  14099. 754.89 s [vector] replicateM: OK (0.01s)
  14100. 754.89 s [vector] +++ OK, passed 100 tests.
  14101. 754.89 s [vector] create: OK
  14102. 754.89 s [vector] +++ OK, passed 100 tests.
  14103. 754.89 s [vector] createT: OK
  14104. 754.89 s [vector] +++ OK, passed 100 tests.
  14105. 754.89 s [vector] unfoldr: OK
  14106. 754.89 s [vector] +++ OK, passed 100 tests.
  14107. 754.89 s [vector] unfoldrN: OK
  14108. 754.89 s [vector] +++ OK, passed 100 tests.
  14109. 754.89 s [vector] unfoldrExactN: OK
  14110. 754.89 s [vector] +++ OK, passed 100 tests.
  14111. 754.90 s [vector] unfoldrM: OK
  14112. 754.90 s [vector] +++ OK, passed 100 tests.
  14113. 754.90 s [vector] unfoldrNM: OK
  14114. 754.90 s [vector] +++ OK, passed 100 tests.
  14115. 754.93 s [vector] unfoldrExactNM: OK (0.03s)
  14116. 754.93 s [vector] +++ OK, passed 100 tests.
  14117. 754.93 s [vector] constructN: OK
  14118. 754.93 s [vector] +++ OK, passed 100 tests.
  14119. 754.94 s [vector] constructrN: OK
  14120. 754.94 s [vector] +++ OK, passed 100 tests.
  14121. 754.94 s [vector] cons: OK
  14122. 754.94 s [vector] +++ OK, passed 100 tests.
  14123. 754.94 s [vector] snoc: OK
  14124. 754.94 s [vector] +++ OK, passed 100 tests.
  14125. 754.94 s [vector] append: OK
  14126. 754.94 s [vector] +++ OK, passed 100 tests.
  14127. 754.95 s [vector] concat: OK
  14128. 754.95 s [vector] +++ OK, passed 100 tests.
  14129. 754.95 s [vector] force: OK
  14130. 754.95 s [vector] +++ OK, passed 100 tests.
  14131. 754.95 s [vector] upd: OK
  14132. 754.95 s [vector] +++ OK, passed 100 tests.
  14133. 754.95 s [vector] accum: OK
  14134. 754.95 s [vector] +++ OK, passed 100 tests.
  14135. 754.95 s [vector] reverse: OK
  14136. 754.95 s [vector] +++ OK, passed 100 tests.
  14137. 754.96 s [vector] backpermute: OK
  14138. 754.96 s [vector] +++ OK, passed 100 tests.
  14139. 754.96 s [vector] map: OK
  14140. 754.96 s [vector] +++ OK, passed 100 tests.
  14141. 754.96 s [vector] imap: OK
  14142. 754.96 s [vector] +++ OK, passed 100 tests.
  14143. 754.96 s [vector] concatMap: OK
  14144. 754.96 s [vector] +++ OK, passed 100 tests.
  14145. 754.97 s [vector] mapM: OK
  14146. 754.97 s [vector] +++ OK, passed 100 tests.
  14147. 754.98 s [vector] mapM_: OK (0.01s)
  14148. 754.98 s [vector] +++ OK, passed 100 tests.
  14149. 754.98 s [vector] forM: OK
  14150. 754.98 s [vector] +++ OK, passed 100 tests.
  14151. 754.99 s [vector] forM_: OK (0.01s)
  14152. 754.99 s [vector] +++ OK, passed 100 tests.
  14153. 754.99 s [vector] imapM: OK
  14154. 754.99 s [vector] +++ OK, passed 100 tests.
  14155. 755.01 s [vector] imapM_: OK
  14156. 755.01 s [vector] +++ OK, passed 100 tests.
  14157. 755.01 s [vector] zipWith: OK
  14158. 755.02 s [vector] +++ OK, passed 100 tests.
  14159. 755.02 s [vector] zipWith3: OK
  14160. 755.02 s [vector] +++ OK, passed 100 tests.
  14161. 755.02 s [vector] izipWith: OK
  14162. 755.02 s [vector] +++ OK, passed 100 tests.
  14163. 755.03 s [vector] izipWith3: OK
  14164. 755.04 s [vector] +++ OK, passed 100 tests.
  14165. 755.04 s [vector] izipWithM: OK
  14166. 755.04 s [vector] +++ OK, passed 100 tests.
  14167. 755.05 s [vector] izipWithM_: OK (0.02s)
  14168. 755.06 s [vector] +++ OK, passed 100 tests.
  14169. 755.06 s [vector] zipWithM: OK
  14170. 755.06 s [vector] +++ OK, passed 100 tests.
  14171. 755.07 s [vector] zipWithM_: OK (0.01s)
  14172. 755.07 s [vector] +++ OK, passed 100 tests.
  14173. 755.08 s [vector] filter: OK
  14174. 755.08 s [vector] +++ OK, passed 100 tests.
  14175. 755.08 s [vector] ifilter: OK
  14176. 755.08 s [vector] +++ OK, passed 100 tests.
  14177. 755.10 s [vector] filterM: OK (0.03s)
  14178. 755.10 s [vector] +++ OK, passed 100 tests.
  14179. 755.10 s [vector] uniq: OK
  14180. 755.10 s [vector] +++ OK, passed 100 tests.
  14181. 755.10 s [vector] mapMaybe: OK
  14182. 755.10 s [vector] +++ OK, passed 100 tests.
  14183. 755.10 s [vector] imapMaybe: OK
  14184. 755.10 s [vector] +++ OK, passed 100 tests.
  14185. 755.10 s [vector] takeWhile: OK
  14186. 755.10 s [vector] +++ OK, passed 100 tests.
  14187. 755.10 s [vector] dropWhile: OK
  14188. 755.10 s [vector] +++ OK, passed 100 tests.
  14189. 755.11 s [vector] partition: OK
  14190. 755.11 s [vector] +++ OK, passed 100 tests.
  14191. 755.11 s [vector] partitionWith: OK
  14192. 755.11 s [vector] +++ OK, passed 100 tests.
  14193. 755.11 s [vector] span: OK
  14194. 755.11 s [vector] +++ OK, passed 100 tests.
  14195. 755.11 s [vector] break: OK
  14196. 755.11 s [vector] +++ OK, passed 100 tests.
  14197. 755.11 s [vector] spanR: OK
  14198. 755.11 s [vector] +++ OK, passed 100 tests.
  14199. 755.11 s [vector] breakR: OK
  14200. 755.11 s [vector] +++ OK, passed 100 tests.
  14201. 755.11 s [vector] groupBy: OK
  14202. 755.11 s [vector] +++ OK, passed 100 tests.
  14203. 755.11 s [vector] elem: OK
  14204. 755.11 s [vector] +++ OK, passed 100 tests.
  14205. 755.11 s [vector] notElem: OK
  14206. 755.12 s [vector] +++ OK, passed 100 tests.
  14207. 755.12 s [vector] find: OK
  14208. 755.12 s [vector] +++ OK, passed 100 tests.
  14209. 755.12 s [vector] findIndex: OK
  14210. 755.12 s [vector] +++ OK, passed 100 tests.
  14211. 755.12 s [vector] findIndexR: OK
  14212. 755.12 s [vector] +++ OK, passed 100 tests.
  14213. 755.12 s [vector] findIndices: OK
  14214. 755.12 s [vector] +++ OK, passed 100 tests.
  14215. 755.12 s [vector] elemIndex: OK
  14216. 755.12 s [vector] +++ OK, passed 100 tests.
  14217. 755.12 s [vector] elemIndices: OK
  14218. 755.12 s [vector] +++ OK, passed 100 tests.
  14219. 755.12 s [vector] foldl: OK
  14220. 755.13 s [vector] +++ OK, passed 100 tests.
  14221. 755.13 s [vector] foldl1: OK
  14222. 755.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14223. 755.13 s [vector] foldl': OK
  14224. 755.13 s [vector] +++ OK, passed 100 tests.
  14225. 755.14 s [vector] foldl1': OK
  14226. 755.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14227. 755.14 s [vector] foldr: OK
  14228. 755.14 s [vector] +++ OK, passed 100 tests.
  14229. 755.14 s [vector] foldr1: OK
  14230. 755.14 s [vector] +++ OK, passed 100 tests; 23 discarded.
  14231. 755.14 s [vector] foldr': OK
  14232. 755.14 s [vector] +++ OK, passed 100 tests.
  14233. 755.15 s [vector] foldr1': OK
  14234. 755.15 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14235. 755.15 s [vector] ifoldl: OK
  14236. 755.15 s [vector] +++ OK, passed 100 tests.
  14237. 755.16 s [vector] ifoldl': OK
  14238. 755.16 s [vector] +++ OK, passed 100 tests.
  14239. 755.16 s [vector] ifoldr: OK
  14240. 755.16 s [vector] +++ OK, passed 100 tests.
  14241. 755.16 s [vector] ifoldr': OK
  14242. 755.16 s [vector] +++ OK, passed 100 tests.
  14243. 755.17 s [vector] ifoldM: OK
  14244. 755.17 s [vector] +++ OK, passed 100 tests.
  14245. 755.17 s [vector] ifoldM': OK
  14246. 755.17 s [vector] +++ OK, passed 100 tests.
  14247. 755.19 s [vector] ifoldM_: OK (0.01s)
  14248. 755.19 s [vector] +++ OK, passed 100 tests.
  14249. 755.22 s [vector] ifoldM'_: OK (0.02s)
  14250. 755.22 s [vector] +++ OK, passed 100 tests.
  14251. 755.22 s [vector] all: OK
  14252. 755.22 s [vector] +++ OK, passed 100 tests.
  14253. 755.22 s [vector] any: OK
  14254. 755.22 s [vector] +++ OK, passed 100 tests.
  14255. 755.22 s [vector] prescanl: OK
  14256. 755.22 s [vector] +++ OK, passed 100 tests.
  14257. 755.23 s [vector] prescanl': OK
  14258. 755.23 s [vector] +++ OK, passed 100 tests.
  14259. 755.23 s [vector] postscanl: OK
  14260. 755.24 s [vector] +++ OK, passed 100 tests.
  14261. 755.24 s [vector] postscanl': OK
  14262. 755.24 s [vector] +++ OK, passed 100 tests.
  14263. 755.24 s [vector] scanl: OK
  14264. 755.24 s [vector] +++ OK, passed 100 tests.
  14265. 755.24 s [vector] scanl': OK
  14266. 755.24 s [vector] +++ OK, passed 100 tests.
  14267. 755.25 s [vector] scanl1: OK
  14268. 755.25 s [vector] +++ OK, passed 100 tests.
  14269. 755.26 s [vector] scanl1': OK
  14270. 755.26 s [vector] +++ OK, passed 100 tests.
  14271. 755.26 s [vector] iscanl: OK
  14272. 755.26 s [vector] +++ OK, passed 100 tests.
  14273. 755.26 s [vector] iscanl': OK
  14274. 755.26 s [vector] +++ OK, passed 100 tests.
  14275. 755.27 s [vector] prescanr: OK
  14276. 755.27 s [vector] +++ OK, passed 100 tests.
  14277. 755.28 s [vector] prescanr': OK
  14278. 755.28 s [vector] +++ OK, passed 100 tests.
  14279. 755.28 s [vector] postscanr: OK
  14280. 755.28 s [vector] +++ OK, passed 100 tests.
  14281. 755.28 s [vector] postscanr': OK
  14282. 755.28 s [vector] +++ OK, passed 100 tests.
  14283. 755.28 s [vector] scanr: OK
  14284. 755.28 s [vector] +++ OK, passed 100 tests.
  14285. 755.29 s [vector] scanr': OK
  14286. 755.29 s [vector] +++ OK, passed 100 tests.
  14287. 755.29 s [vector] scanr1: OK
  14288. 755.29 s [vector] +++ OK, passed 100 tests.
  14289. 755.30 s [vector] scanr1': OK
  14290. 755.30 s [vector] +++ OK, passed 100 tests.
  14291. 755.30 s [vector] iscanr: OK
  14292. 755.30 s [vector] +++ OK, passed 100 tests.
  14293. 755.30 s [vector] iscanr': OK
  14294. 755.30 s [vector] +++ OK, passed 100 tests.
  14295. 755.30 s [vector] mut_read: OK
  14296. 755.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14297. 755.31 s [vector] mut_write: OK
  14298. 755.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14299. 755.31 s [vector] mut_modify: OK
  14300. 755.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14301. 755.32 s [vector] mut_generate: OK
  14302. 755.32 s [vector] +++ OK, passed 100 tests.
  14303. 755.32 s [vector] mut_generateM: OK (0.01s)
  14304. 755.32 s [vector] +++ OK, passed 100 tests.
  14305. 755.36 s [vector] mut_mapM_: OK
  14306. 755.36 s [vector] +++ OK, passed 100 tests.
  14307. 755.37 s [vector] mut_imapM_: OK (0.03s)
  14308. 755.37 s [vector] +++ OK, passed 100 tests.
  14309. 755.40 s [vector] mut_forM_: OK (0.01s)
  14310. 755.40 s [vector] +++ OK, passed 100 tests.
  14311. 755.42 s [vector] mut_iforM_: OK (0.02s)
  14312. 755.42 s [vector] +++ OK, passed 100 tests.
  14313. 755.42 s [vector] mut_foldr: OK
  14314. 755.42 s [vector] +++ OK, passed 100 tests.
  14315. 755.42 s [vector] mut_foldr': OK
  14316. 755.42 s [vector] +++ OK, passed 100 tests.
  14317. 755.42 s [vector] mut_foldl: OK
  14318. 755.42 s [vector] +++ OK, passed 100 tests.
  14319. 755.42 s [vector] mut_foldl': OK
  14320. 755.42 s [vector] +++ OK, passed 100 tests.
  14321. 755.43 s [vector] mut_ifoldr: OK
  14322. 755.43 s [vector] +++ OK, passed 100 tests.
  14323. 755.43 s [vector] mut_ifoldr': OK
  14324. 755.43 s [vector] +++ OK, passed 100 tests.
  14325. 755.44 s [vector] mut_ifoldl: OK
  14326. 755.44 s [vector] +++ OK, passed 100 tests.
  14327. 755.44 s [vector] mut_ifoldl': OK
  14328. 755.44 s [vector] +++ OK, passed 100 tests.
  14329. 755.44 s [vector] mut_foldM: OK
  14330. 755.44 s [vector] +++ OK, passed 100 tests.
  14331. 755.45 s [vector] mut_foldM': OK
  14332. 755.45 s [vector] +++ OK, passed 100 tests.
  14333. 755.45 s [vector] mut_foldrM: OK
  14334. 755.45 s [vector] +++ OK, passed 100 tests.
  14335. 755.46 s [vector] mut_foldrM': OK
  14336. 755.46 s [vector] +++ OK, passed 100 tests.
  14337. 755.46 s [vector] mut_ifoldM: OK
  14338. 755.46 s [vector] +++ OK, passed 100 tests.
  14339. 755.47 s [vector] mut_ifoldM': OK
  14340. 755.47 s [vector] +++ OK, passed 100 tests.
  14341. 755.47 s [vector] mut_ifoldrM: OK
  14342. 755.47 s [vector] +++ OK, passed 100 tests.
  14343. 755.47 s [vector] mut_ifoldrM': OK
  14344. 755.47 s [vector] +++ OK, passed 100 tests.
  14345. 755.47 s [vector] compare: OK
  14346. 755.47 s [vector] +++ OK, passed 100 tests.
  14347. 755.47 s [vector] maximum: OK
  14348. 755.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14349. 755.48 s [vector] minimum: OK
  14350. 755.48 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14351. 755.48 s [vector] minIndex: OK
  14352. 755.48 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14353. 755.48 s [vector] maxIndex: OK
  14354. 755.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14355. 755.48 s [vector] maximumBy: OK
  14356. 755.48 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14357. 755.48 s [vector] minimumBy: OK
  14358. 755.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14359. 755.48 s [vector] maximumOn: OK
  14360. 755.48 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14361. 755.48 s [vector] minimumOn: OK
  14362. 755.48 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14363. 755.48 s [vector] maxIndexBy: OK
  14364. 755.48 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14365. 755.48 s [vector] minIndexBy: OK
  14366. 755.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14367. 755.48 s [vector] ListFirstMaxIndexWins: OK
  14368. 755.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14369. 755.48 s [vector] FalseListFirstMaxIndexWins: OK
  14370. 755.48 s [vector] +++ OK, failed as expected. (after 1 test):
  14371. 755.48 s [vector] Exception:
  14372. 755.48 s [vector] Prelude.foldr1: empty list
  14373. 755.48 s [vector] CallStack (from HasCallStack):
  14374. 755.48 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  14375. 755.48 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  14376. 755.48 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14377. 755.48 s [vector] []
  14378. 755.48 s [vector] zip: OK
  14379. 755.48 s [vector] +++ OK, passed 100 tests.
  14380. 755.48 s [vector] zip3: OK
  14381. 755.49 s [vector] +++ OK, passed 100 tests.
  14382. 755.49 s [vector] unzip: OK
  14383. 755.49 s [vector] +++ OK, passed 100 tests.
  14384. 755.49 s [vector] unzip3: OK
  14385. 755.49 s [vector] +++ OK, passed 100 tests.
  14386. 755.49 s [vector] indexed: OK
  14387. 755.50 s [vector] +++ OK, passed 100 tests.
  14388. 755.50 s [vector] update: OK
  14389. 755.50 s [vector] +++ OK, passed 100 tests.
  14390. 755.50 s [vector] concat: OK (0.01s)
  14391. 755.50 s [vector] +++ OK, passed 100 tests.
  14392. 755.50 s [vector] mempty: OK
  14393. 755.50 s [vector] +++ OK, passed 100 tests.
  14394. 755.51 s [vector] mappend: OK
  14395. 755.51 s [vector] +++ OK, passed 100 tests.
  14396. 755.52 s [vector] mconcat: OK (0.02s)
  14397. 755.52 s [vector] +++ OK, passed 100 tests.
  14398. 755.52 s [vector] fmap: OK
  14399. 755.52 s [vector] +++ OK, passed 100 tests.
  14400. 755.54 s [vector] return: OK
  14401. 755.54 s [vector] +++ OK, passed 100 tests.
  14402. 755.56 s [vector] bind: OK (0.04s)
  14403. 755.56 s [vector] +++ OK, passed 100 tests.
  14404. 755.56 s [vector] mzip: OK
  14405. 755.56 s [vector] +++ OK, passed 100 tests.
  14406. 755.56 s [vector] munzip: OK
  14407. 755.56 s [vector] +++ OK, passed 100 tests.
  14408. 755.58 s [vector] applicative_pure: OK
  14409. 755.58 s [vector] +++ OK, passed 100 tests.
  14410. 755.61 s [vector] applicative_appl: OK (0.05s)
  14411. 755.61 s [vector] +++ OK, passed 100 tests.
  14412. 755.61 s [vector] alternative_empty: OK
  14413. 755.61 s [vector] +++ OK, passed 100 tests.
  14414. 755.61 s [vector] alternative_or: OK
  14415. 755.61 s [vector] +++ OK, passed 100 tests.
  14416. 755.66 s [vector] sequence: OK (0.04s)
  14417. 755.66 s [vector] +++ OK, passed 100 tests.
  14418. 755.68 s [vector] sequence_: OK
  14419. 755.68 s [vector] +++ OK, passed 100 tests.
  14420. 755.68 s [vector] glength: OK
  14421. 755.68 s [vector] +++ OK, passed 100 tests.
  14422. 755.68 s [vector] sum: OK
  14423. 755.68 s [vector] +++ OK, passed 100 tests.
  14424. 755.68 s [vector] product: OK
  14425. 755.68 s [vector] +++ OK, passed 100 tests.
  14426. 755.68 s [vector] enumFromN: OK
  14427. 755.68 s [vector] +++ OK, passed 100 tests.
  14428. 755.69 s [vector] enumFromThenN: OK
  14429. 755.69 s [vector] +++ OK, passed 100 tests.
  14430. 755.69 s [vector] enumFromTo: OK
  14431. 755.69 s [vector] +++ OK, passed 100 tests.
  14432. 755.69 s [vector] enumFromThenTo: OK
  14433. 755.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14434. 755.69 s [vector] unstream
  14435. 755.69 s [vector] unstream == vunstream (exact): OK
  14436. 755.69 s [vector] +++ OK, passed 100 tests.
  14437. 755.69 s [vector] unstream == vunstream (unknown): OK
  14438. 755.69 s [vector] +++ OK, passed 100 tests.
  14439. 755.69 s [vector] unstreamR ~= vunstream (exact): OK
  14440. 755.69 s [vector] +++ OK, passed 100 tests.
  14441. 755.69 s [vector] unstreamR ~= vunstream (unknown): OK
  14442. 755.69 s [vector] +++ OK, passed 100 tests.
  14443. 755.69 s [vector] Tests.Vector.Unboxed
  14444. 755.70 s [vector] ()
  14445. 755.70 s [vector] fromList.toList == id: OK
  14446. 755.70 s [vector] +++ OK, passed 100 tests.
  14447. 755.70 s [vector] toList.fromList == id: OK
  14448. 755.70 s [vector] +++ OK, passed 100 tests.
  14449. 755.70 s [vector] unstream.stream == id: OK
  14450. 755.70 s [vector] +++ OK, passed 100 tests.
  14451. 755.70 s [vector] stream.unstream == id: OK
  14452. 755.70 s [vector] +++ OK, passed 100 tests.
  14453. 755.70 s [vector] eq: OK
  14454. 755.70 s [vector] +++ OK, passed 100 tests.
  14455. 755.70 s [vector] length: OK
  14456. 755.70 s [vector] +++ OK, passed 100 tests.
  14457. 755.70 s [vector] null: OK
  14458. 755.70 s [vector] +++ OK, passed 100 tests.
  14459. 755.70 s [vector] index: OK
  14460. 755.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14461. 755.70 s [vector] safeIndex: OK
  14462. 755.70 s [vector] +++ OK, passed 100 tests.
  14463. 755.70 s [vector] head: OK
  14464. 755.70 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14465. 755.70 s [vector] last: OK
  14466. 755.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14467. 755.70 s [vector] unsafeIndex: OK
  14468. 755.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14469. 755.70 s [vector] unsafeHead: OK
  14470. 755.70 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14471. 755.70 s [vector] unsafeLast: OK
  14472. 755.70 s [vector] +++ OK, passed 100 tests; 10 discarded.
  14473. 755.70 s [vector] slice: OK
  14474. 755.71 s [vector] +++ OK, passed 100 tests.
  14475. 755.71 s [vector] init: OK
  14476. 755.71 s [vector] +++ OK, passed 100 tests; 23 discarded.
  14477. 755.71 s [vector] tail: OK
  14478. 755.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14479. 755.71 s [vector] take: OK
  14480. 755.71 s [vector] +++ OK, passed 100 tests.
  14481. 755.71 s [vector] drop: OK
  14482. 755.71 s [vector] +++ OK, passed 100 tests.
  14483. 755.71 s [vector] splitAt: OK
  14484. 755.71 s [vector] +++ OK, passed 100 tests.
  14485. 755.71 s [vector] empty: OK
  14486. 755.71 s [vector] +++ OK, passed 100 tests.
  14487. 755.71 s [vector] singleton: OK
  14488. 755.71 s [vector] +++ OK, passed 100 tests.
  14489. 755.71 s [vector] replicate: OK
  14490. 755.71 s [vector] +++ OK, passed 100 tests.
  14491. 755.71 s [vector] generate: OK
  14492. 755.71 s [vector] +++ OK, passed 100 tests.
  14493. 755.71 s [vector] iterateN: OK
  14494. 755.71 s [vector] +++ OK, passed 100 tests.
  14495. 755.76 s [vector] iterateNM: OK (0.04s)
  14496. 755.76 s [vector] +++ OK, passed 100 tests.
  14497. 755.78 s [vector] generateM: OK (0.02s)
  14498. 755.78 s [vector] +++ OK, passed 100 tests.
  14499. 755.79 s [vector] replicateM: OK (0.02s)
  14500. 755.79 s [vector] +++ OK, passed 100 tests.
  14501. 755.79 s [vector] create: OK
  14502. 755.79 s [vector] +++ OK, passed 100 tests.
  14503. 755.79 s [vector] createT: OK
  14504. 755.79 s [vector] +++ OK, passed 100 tests.
  14505. 755.79 s [vector] unfoldr: OK
  14506. 755.79 s [vector] +++ OK, passed 100 tests.
  14507. 755.79 s [vector] unfoldrN: OK
  14508. 755.79 s [vector] +++ OK, passed 100 tests.
  14509. 755.79 s [vector] unfoldrExactN: OK
  14510. 755.79 s [vector] +++ OK, passed 100 tests.
  14511. 755.81 s [vector] unfoldrM: OK
  14512. 755.82 s [vector] +++ OK, passed 100 tests.
  14513. 755.82 s [vector] unfoldrNM: OK
  14514. 755.82 s [vector] +++ OK, passed 100 tests.
  14515. 755.85 s [vector] unfoldrExactNM: OK (0.04s)
  14516. 755.85 s [vector] +++ OK, passed 100 tests.
  14517. 755.85 s [vector] constructN: OK
  14518. 755.85 s [vector] +++ OK, passed 100 tests.
  14519. 755.86 s [vector] constructrN: OK
  14520. 755.86 s [vector] +++ OK, passed 100 tests.
  14521. 755.86 s [vector] cons: OK
  14522. 755.86 s [vector] +++ OK, passed 100 tests.
  14523. 755.86 s [vector] snoc: OK
  14524. 755.86 s [vector] +++ OK, passed 100 tests.
  14525. 755.86 s [vector] append: OK
  14526. 755.86 s [vector] +++ OK, passed 100 tests.
  14527. 755.87 s [vector] concat: OK (0.01s)
  14528. 755.87 s [vector] +++ OK, passed 100 tests.
  14529. 755.87 s [vector] force: OK
  14530. 755.87 s [vector] +++ OK, passed 100 tests.
  14531. 755.87 s [vector] upd: OK
  14532. 755.87 s [vector] +++ OK, passed 100 tests.
  14533. 755.87 s [vector] accum: OK
  14534. 755.87 s [vector] +++ OK, passed 100 tests.
  14535. 755.87 s [vector] reverse: OK
  14536. 755.87 s [vector] +++ OK, passed 100 tests.
  14537. 755.88 s [vector] backpermute: OK
  14538. 755.88 s [vector] +++ OK, passed 100 tests.
  14539. 755.88 s [vector] map: OK
  14540. 755.88 s [vector] +++ OK, passed 100 tests.
  14541. 755.88 s [vector] imap: OK
  14542. 755.88 s [vector] +++ OK, passed 100 tests.
  14543. 755.88 s [vector] concatMap: OK
  14544. 755.88 s [vector] +++ OK, passed 100 tests.
  14545. 755.88 s [vector] mapM: OK
  14546. 755.88 s [vector] +++ OK, passed 100 tests.
  14547. 755.89 s [vector] mapM_: OK (0.01s)
  14548. 755.90 s [vector] +++ OK, passed 100 tests.
  14549. 755.90 s [vector] forM: OK
  14550. 755.90 s [vector] +++ OK, passed 100 tests.
  14551. 755.90 s [vector] forM_: OK (0.01s)
  14552. 755.90 s [vector] +++ OK, passed 100 tests.
  14553. 755.91 s [vector] imapM: OK
  14554. 755.91 s [vector] +++ OK, passed 100 tests.
  14555. 755.92 s [vector] imapM_: OK (0.01s)
  14556. 755.92 s [vector] +++ OK, passed 100 tests.
  14557. 755.92 s [vector] zipWith: OK
  14558. 755.92 s [vector] +++ OK, passed 100 tests.
  14559. 755.92 s [vector] zipWith3: OK
  14560. 755.92 s [vector] +++ OK, passed 100 tests.
  14561. 755.92 s [vector] izipWith: OK
  14562. 755.92 s [vector] +++ OK, passed 100 tests.
  14563. 755.92 s [vector] izipWith3: OK
  14564. 755.92 s [vector] +++ OK, passed 100 tests.
  14565. 755.92 s [vector] izipWithM: OK
  14566. 755.92 s [vector] +++ OK, passed 100 tests.
  14567. 755.93 s [vector] izipWithM_: OK
  14568. 755.93 s [vector] +++ OK, passed 100 tests.
  14569. 755.93 s [vector] zipWithM: OK
  14570. 755.93 s [vector] +++ OK, passed 100 tests.
  14571. 755.93 s [vector] zipWithM_: OK
  14572. 755.93 s [vector] +++ OK, passed 100 tests.
  14573. 755.93 s [vector] filter: OK
  14574. 755.93 s [vector] +++ OK, passed 100 tests.
  14575. 755.93 s [vector] ifilter: OK
  14576. 755.93 s [vector] +++ OK, passed 100 tests.
  14577. 755.95 s [vector] filterM: OK (0.01s)
  14578. 755.95 s [vector] +++ OK, passed 100 tests.
  14579. 755.96 s [vector] uniq: OK
  14580. 755.96 s [vector] +++ OK, passed 100 tests.
  14581. 755.96 s [vector] mapMaybe: OK
  14582. 755.96 s [vector] +++ OK, passed 100 tests.
  14583. 755.96 s [vector] imapMaybe: OK
  14584. 755.96 s [vector] +++ OK, passed 100 tests.
  14585. 755.96 s [vector] takeWhile: OK
  14586. 755.96 s [vector] +++ OK, passed 100 tests.
  14587. 755.96 s [vector] dropWhile: OK
  14588. 755.96 s [vector] +++ OK, passed 100 tests.
  14589. 755.96 s [vector] partition: OK
  14590. 755.96 s [vector] +++ OK, passed 100 tests.
  14591. 755.96 s [vector] partitionWith: OK
  14592. 755.96 s [vector] +++ OK, passed 100 tests.
  14593. 755.96 s [vector] span: OK
  14594. 755.96 s [vector] +++ OK, passed 100 tests.
  14595. 755.96 s [vector] break: OK
  14596. 755.96 s [vector] +++ OK, passed 100 tests.
  14597. 755.96 s [vector] spanR: OK
  14598. 755.96 s [vector] +++ OK, passed 100 tests.
  14599. 755.96 s [vector] breakR: OK
  14600. 755.96 s [vector] +++ OK, passed 100 tests.
  14601. 755.96 s [vector] groupBy: OK
  14602. 755.96 s [vector] +++ OK, passed 100 tests.
  14603. 755.97 s [vector] elem: OK
  14604. 755.97 s [vector] +++ OK, passed 100 tests.
  14605. 755.97 s [vector] notElem: OK
  14606. 755.97 s [vector] +++ OK, passed 100 tests.
  14607. 755.97 s [vector] find: OK
  14608. 755.97 s [vector] +++ OK, passed 100 tests.
  14609. 755.97 s [vector] findIndex: OK
  14610. 755.97 s [vector] +++ OK, passed 100 tests.
  14611. 755.97 s [vector] findIndexR: OK
  14612. 755.97 s [vector] +++ OK, passed 100 tests.
  14613. 755.97 s [vector] findIndices: OK
  14614. 755.97 s [vector] +++ OK, passed 100 tests.
  14615. 755.97 s [vector] elemIndex: OK
  14616. 755.97 s [vector] +++ OK, passed 100 tests.
  14617. 755.97 s [vector] elemIndices: OK
  14618. 755.97 s [vector] +++ OK, passed 100 tests.
  14619. 755.97 s [vector] foldl: OK
  14620. 755.97 s [vector] +++ OK, passed 100 tests.
  14621. 755.97 s [vector] foldl1: OK
  14622. 755.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14623. 755.97 s [vector] foldl': OK
  14624. 755.97 s [vector] +++ OK, passed 100 tests.
  14625. 755.97 s [vector] foldl1': OK
  14626. 755.97 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14627. 755.97 s [vector] foldr: OK
  14628. 755.97 s [vector] +++ OK, passed 100 tests.
  14629. 755.97 s [vector] foldr1: OK
  14630. 755.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14631. 755.97 s [vector] foldr': OK
  14632. 755.97 s [vector] +++ OK, passed 100 tests.
  14633. 755.97 s [vector] foldr1': OK
  14634. 755.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14635. 755.97 s [vector] ifoldl: OK
  14636. 755.97 s [vector] +++ OK, passed 100 tests.
  14637. 755.97 s [vector] ifoldl': OK
  14638. 755.97 s [vector] +++ OK, passed 100 tests.
  14639. 755.98 s [vector] ifoldr: OK
  14640. 755.98 s [vector] +++ OK, passed 100 tests.
  14641. 755.98 s [vector] ifoldr': OK
  14642. 755.98 s [vector] +++ OK, passed 100 tests.
  14643. 755.98 s [vector] ifoldM: OK
  14644. 755.98 s [vector] +++ OK, passed 100 tests.
  14645. 755.98 s [vector] ifoldM': OK
  14646. 755.98 s [vector] +++ OK, passed 100 tests.
  14647. 755.99 s [vector] ifoldM_: OK (0.01s)
  14648. 755.99 s [vector] +++ OK, passed 100 tests.
  14649. 756.00 s [vector] ifoldM'_: OK
  14650. 756.00 s [vector] +++ OK, passed 100 tests.
  14651. 756.00 s [vector] all: OK
  14652. 756.00 s [vector] +++ OK, passed 100 tests.
  14653. 756.00 s [vector] any: OK
  14654. 756.00 s [vector] +++ OK, passed 100 tests.
  14655. 756.00 s [vector] prescanl: OK
  14656. 756.00 s [vector] +++ OK, passed 100 tests.
  14657. 756.00 s [vector] prescanl': OK
  14658. 756.00 s [vector] +++ OK, passed 100 tests.
  14659. 756.00 s [vector] postscanl: OK
  14660. 756.00 s [vector] +++ OK, passed 100 tests.
  14661. 756.00 s [vector] postscanl': OK
  14662. 756.00 s [vector] +++ OK, passed 100 tests.
  14663. 756.00 s [vector] scanl: OK
  14664. 756.00 s [vector] +++ OK, passed 100 tests.
  14665. 756.00 s [vector] scanl': OK
  14666. 756.00 s [vector] +++ OK, passed 100 tests.
  14667. 756.00 s [vector] scanl1: OK
  14668. 756.00 s [vector] +++ OK, passed 100 tests.
  14669. 756.00 s [vector] scanl1': OK
  14670. 756.00 s [vector] +++ OK, passed 100 tests.
  14671. 756.00 s [vector] iscanl: OK
  14672. 756.00 s [vector] +++ OK, passed 100 tests.
  14673. 756.00 s [vector] iscanl': OK
  14674. 756.00 s [vector] +++ OK, passed 100 tests.
  14675. 756.00 s [vector] prescanr: OK
  14676. 756.00 s [vector] +++ OK, passed 100 tests.
  14677. 756.01 s [vector] prescanr': OK
  14678. 756.01 s [vector] +++ OK, passed 100 tests.
  14679. 756.01 s [vector] postscanr: OK
  14680. 756.01 s [vector] +++ OK, passed 100 tests.
  14681. 756.01 s [vector] postscanr': OK
  14682. 756.01 s [vector] +++ OK, passed 100 tests.
  14683. 756.01 s [vector] scanr: OK
  14684. 756.01 s [vector] +++ OK, passed 100 tests.
  14685. 756.01 s [vector] scanr': OK
  14686. 756.01 s [vector] +++ OK, passed 100 tests.
  14687. 756.01 s [vector] scanr1: OK
  14688. 756.01 s [vector] +++ OK, passed 100 tests.
  14689. 756.01 s [vector] scanr1': OK
  14690. 756.01 s [vector] +++ OK, passed 100 tests.
  14691. 756.01 s [vector] iscanr: OK
  14692. 756.01 s [vector] +++ OK, passed 100 tests.
  14693. 756.02 s [vector] iscanr': OK
  14694. 756.02 s [vector] +++ OK, passed 100 tests.
  14695. 756.02 s [vector] mut_read: OK
  14696. 756.02 s [vector] +++ OK, passed 100 tests; 10 discarded.
  14697. 756.02 s [vector] mut_write: OK
  14698. 756.02 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14699. 756.02 s [vector] mut_modify: OK
  14700. 756.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14701. 756.03 s [vector] mut_generate: OK
  14702. 756.03 s [vector] +++ OK, passed 100 tests.
  14703. 756.03 s [vector] mut_generateM: OK
  14704. 756.03 s [vector] +++ OK, passed 100 tests.
  14705. 756.03 s [vector] mut_mapM_: OK
  14706. 756.04 s [vector] +++ OK, passed 100 tests.
  14707. 756.04 s [vector] mut_imapM_: OK
  14708. 756.04 s [vector] +++ OK, passed 100 tests.
  14709. 756.05 s [vector] mut_forM_: OK
  14710. 756.05 s [vector] +++ OK, passed 100 tests.
  14711. 756.05 s [vector] mut_iforM_: OK
  14712. 756.05 s [vector] +++ OK, passed 100 tests.
  14713. 756.05 s [vector] mut_foldr: OK
  14714. 756.05 s [vector] +++ OK, passed 100 tests.
  14715. 756.05 s [vector] mut_foldr': OK
  14716. 756.05 s [vector] +++ OK, passed 100 tests.
  14717. 756.05 s [vector] mut_foldl: OK
  14718. 756.05 s [vector] +++ OK, passed 100 tests.
  14719. 756.05 s [vector] mut_foldl': OK
  14720. 756.05 s [vector] +++ OK, passed 100 tests.
  14721. 756.05 s [vector] mut_ifoldr: OK
  14722. 756.06 s [vector] +++ OK, passed 100 tests.
  14723. 756.06 s [vector] mut_ifoldr': OK
  14724. 756.06 s [vector] +++ OK, passed 100 tests.
  14725. 756.06 s [vector] mut_ifoldl: OK
  14726. 756.06 s [vector] +++ OK, passed 100 tests.
  14727. 756.06 s [vector] mut_ifoldl': OK
  14728. 756.06 s [vector] +++ OK, passed 100 tests.
  14729. 756.06 s [vector] mut_foldM: OK
  14730. 756.06 s [vector] +++ OK, passed 100 tests.
  14731. 756.06 s [vector] mut_foldM': OK
  14732. 756.06 s [vector] +++ OK, passed 100 tests.
  14733. 756.06 s [vector] mut_foldrM: OK
  14734. 756.06 s [vector] +++ OK, passed 100 tests.
  14735. 756.06 s [vector] mut_foldrM': OK
  14736. 756.06 s [vector] +++ OK, passed 100 tests.
  14737. 756.06 s [vector] mut_ifoldM: OK
  14738. 756.06 s [vector] +++ OK, passed 100 tests.
  14739. 756.06 s [vector] mut_ifoldM': OK
  14740. 756.06 s [vector] +++ OK, passed 100 tests.
  14741. 756.06 s [vector] mut_ifoldrM: OK
  14742. 756.06 s [vector] +++ OK, passed 100 tests.
  14743. 756.06 s [vector] mut_ifoldrM': OK
  14744. 756.06 s [vector] +++ OK, passed 100 tests.
  14745. 756.06 s [vector] compare: OK
  14746. 756.06 s [vector] +++ OK, passed 100 tests.
  14747. 756.06 s [vector] maximum: OK
  14748. 756.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14749. 756.06 s [vector] minimum: OK
  14750. 756.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14751. 756.06 s [vector] minIndex: OK
  14752. 756.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14753. 756.06 s [vector] maxIndex: OK
  14754. 756.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14755. 756.06 s [vector] maximumBy: OK
  14756. 756.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14757. 756.07 s [vector] minimumBy: OK
  14758. 756.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14759. 756.07 s [vector] maximumOn: OK
  14760. 756.07 s [vector] +++ OK, passed 100 tests; 25 discarded.
  14761. 756.07 s [vector] minimumOn: OK
  14762. 756.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14763. 756.07 s [vector] maxIndexBy: OK
  14764. 756.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14765. 756.07 s [vector] minIndexBy: OK
  14766. 756.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14767. 756.07 s [vector] ListFirstMaxIndexWins: OK
  14768. 756.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14769. 756.07 s [vector] FalseListFirstMaxIndexWins: OK
  14770. 756.07 s [vector] +++ OK, failed as expected. (after 1 test):
  14771. 756.07 s [vector] Exception:
  14772. 756.07 s [vector] Prelude.foldr1: empty list
  14773. 756.07 s [vector] CallStack (from HasCallStack):
  14774. 756.07 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  14775. 756.07 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  14776. 756.07 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14777. 756.07 s [vector] []
  14778. 756.07 s [vector] zip: OK
  14779. 756.07 s [vector] +++ OK, passed 100 tests.
  14780. 756.07 s [vector] zip3: OK
  14781. 756.07 s [vector] +++ OK, passed 100 tests.
  14782. 756.07 s [vector] unzip: OK
  14783. 756.07 s [vector] +++ OK, passed 100 tests.
  14784. 756.07 s [vector] unzip3: OK
  14785. 756.07 s [vector] +++ OK, passed 100 tests.
  14786. 756.07 s [vector] indexed: OK
  14787. 756.07 s [vector] +++ OK, passed 100 tests.
  14788. 756.07 s [vector] update: OK
  14789. 756.07 s [vector] +++ OK, passed 100 tests.
  14790. 756.08 s [vector] mempty: OK
  14791. 756.08 s [vector] +++ OK, passed 100 tests.
  14792. 756.08 s [vector] mappend: OK
  14793. 756.08 s [vector] +++ OK, passed 100 tests.
  14794. 756.09 s [vector] mconcat: OK
  14795. 756.09 s [vector] +++ OK, passed 100 tests.
  14796. 756.09 s [vector] glength: OK
  14797. 756.09 s [vector] +++ OK, passed 100 tests.
  14798. 756.09 s [vector] (Bool)
  14799. 756.09 s [vector] fromList.toList == id: OK
  14800. 756.09 s [vector] +++ OK, passed 100 tests.
  14801. 756.09 s [vector] toList.fromList == id: OK
  14802. 756.09 s [vector] +++ OK, passed 100 tests.
  14803. 756.09 s [vector] unstream.stream == id: OK
  14804. 756.09 s [vector] +++ OK, passed 100 tests.
  14805. 756.09 s [vector] stream.unstream == id: OK
  14806. 756.09 s [vector] +++ OK, passed 100 tests.
  14807. 756.09 s [vector] eq: OK
  14808. 756.09 s [vector] +++ OK, passed 100 tests.
  14809. 756.09 s [vector] length: OK
  14810. 756.09 s [vector] +++ OK, passed 100 tests.
  14811. 756.09 s [vector] null: OK
  14812. 756.09 s [vector] +++ OK, passed 100 tests.
  14813. 756.09 s [vector] index: OK
  14814. 756.09 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14815. 756.09 s [vector] safeIndex: OK
  14816. 756.09 s [vector] +++ OK, passed 100 tests.
  14817. 756.09 s [vector] head: OK
  14818. 756.09 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14819. 756.09 s [vector] last: OK
  14820. 756.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14821. 756.09 s [vector] unsafeIndex: OK
  14822. 756.09 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14823. 756.09 s [vector] unsafeHead: OK
  14824. 756.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14825. 756.09 s [vector] unsafeLast: OK
  14826. 756.09 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14827. 756.10 s [vector] slice: OK
  14828. 756.10 s [vector] +++ OK, passed 100 tests.
  14829. 756.10 s [vector] init: OK
  14830. 756.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14831. 756.10 s [vector] tail: OK
  14832. 756.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14833. 756.10 s [vector] take: OK
  14834. 756.10 s [vector] +++ OK, passed 100 tests.
  14835. 756.10 s [vector] drop: OK
  14836. 756.10 s [vector] +++ OK, passed 100 tests.
  14837. 756.10 s [vector] splitAt: OK
  14838. 756.10 s [vector] +++ OK, passed 100 tests.
  14839. 756.10 s [vector] empty: OK
  14840. 756.10 s [vector] +++ OK, passed 100 tests.
  14841. 756.10 s [vector] singleton: OK
  14842. 756.10 s [vector] +++ OK, passed 100 tests.
  14843. 756.10 s [vector] replicate: OK
  14844. 756.10 s [vector] +++ OK, passed 100 tests.
  14845. 756.10 s [vector] generate: OK
  14846. 756.10 s [vector] +++ OK, passed 100 tests.
  14847. 756.12 s [vector] iterateN: OK
  14848. 756.13 s [vector] +++ OK, passed 100 tests.
  14849. 756.16 s [vector] iterateNM: OK (0.04s)
  14850. 756.16 s [vector] +++ OK, passed 100 tests.
  14851. 756.18 s [vector] generateM: OK (0.04s)
  14852. 756.18 s [vector] +++ OK, passed 100 tests.
  14853. 756.20 s [vector] replicateM: OK
  14854. 756.20 s [vector] +++ OK, passed 100 tests.
  14855. 756.20 s [vector] create: OK
  14856. 756.20 s [vector] +++ OK, passed 100 tests.
  14857. 756.21 s [vector] createT: OK
  14858. 756.21 s [vector] +++ OK, passed 100 tests.
  14859. 756.21 s [vector] unfoldr: OK
  14860. 756.21 s [vector] +++ OK, passed 100 tests.
  14861. 756.21 s [vector] unfoldrN: OK
  14862. 756.21 s [vector] +++ OK, passed 100 tests.
  14863. 756.22 s [vector] unfoldrExactN: OK
  14864. 756.22 s [vector] +++ OK, passed 100 tests.
  14865. 756.23 s [vector] unfoldrM: OK (0.01s)
  14866. 756.23 s [vector] +++ OK, passed 100 tests.
  14867. 756.23 s [vector] unfoldrNM: OK
  14868. 756.23 s [vector] +++ OK, passed 100 tests.
  14869. 756.27 s [vector] unfoldrExactNM: OK (0.03s)
  14870. 756.27 s [vector] +++ OK, passed 100 tests.
  14871. 756.28 s [vector] constructN: OK
  14872. 756.28 s [vector] +++ OK, passed 100 tests.
  14873. 756.28 s [vector] constructrN: OK
  14874. 756.28 s [vector] +++ OK, passed 100 tests.
  14875. 756.28 s [vector] cons: OK
  14876. 756.28 s [vector] +++ OK, passed 100 tests.
  14877. 756.28 s [vector] snoc: OK
  14878. 756.30 s [vector] +++ OK, passed 100 tests.
  14879. 756.30 s [vector] append: OK
  14880. 756.30 s [vector] +++ OK, passed 100 tests.
  14881. 756.30 s [vector] concat: OK (0.02s)
  14882. 756.30 s [vector] +++ OK, passed 100 tests.
  14883. 756.30 s [vector] force: OK
  14884. 756.30 s [vector] +++ OK, passed 100 tests.
  14885. 756.31 s [vector] upd: OK
  14886. 756.31 s [vector] +++ OK, passed 100 tests.
  14887. 756.31 s [vector] accum: OK
  14888. 756.31 s [vector] +++ OK, passed 100 tests.
  14889. 756.31 s [vector] reverse: OK
  14890. 756.31 s [vector] +++ OK, passed 100 tests.
  14891. 756.31 s [vector] backpermute: OK
  14892. 756.31 s [vector] +++ OK, passed 100 tests.
  14893. 756.31 s [vector] map: OK
  14894. 756.31 s [vector] +++ OK, passed 100 tests.
  14895. 756.32 s [vector] imap: OK
  14896. 756.32 s [vector] +++ OK, passed 100 tests.
  14897. 756.32 s [vector] concatMap: OK
  14898. 756.32 s [vector] +++ OK, passed 100 tests.
  14899. 756.32 s [vector] mapM: OK
  14900. 756.32 s [vector] +++ OK, passed 100 tests.
  14901. 756.34 s [vector] mapM_: OK (0.02s)
  14902. 756.34 s [vector] +++ OK, passed 100 tests.
  14903. 756.34 s [vector] forM: OK
  14904. 756.34 s [vector] +++ OK, passed 100 tests.
  14905. 756.35 s [vector] forM_: OK (0.01s)
  14906. 756.35 s [vector] +++ OK, passed 100 tests.
  14907. 756.36 s [vector] imapM: OK
  14908. 756.36 s [vector] +++ OK, passed 100 tests.
  14909. 756.37 s [vector] imapM_: OK (0.01s)
  14910. 756.37 s [vector] +++ OK, passed 100 tests.
  14911. 756.37 s [vector] zipWith: OK
  14912. 756.37 s [vector] +++ OK, passed 100 tests.
  14913. 756.38 s [vector] zipWith3: OK
  14914. 756.38 s [vector] +++ OK, passed 100 tests.
  14915. 756.38 s [vector] izipWith: OK
  14916. 756.38 s [vector] +++ OK, passed 100 tests.
  14917. 756.38 s [vector] izipWith3: OK
  14918. 756.38 s [vector] +++ OK, passed 100 tests.
  14919. 756.39 s [vector] izipWithM: OK
  14920. 756.40 s [vector] +++ OK, passed 100 tests.
  14921. 756.40 s [vector] izipWithM_: OK (0.01s)
  14922. 756.40 s [vector] +++ OK, passed 100 tests.
  14923. 756.40 s [vector] zipWithM: OK
  14924. 756.40 s [vector] +++ OK, passed 100 tests.
  14925. 756.41 s [vector] zipWithM_: OK
  14926. 756.41 s [vector] +++ OK, passed 100 tests.
  14927. 756.41 s [vector] filter: OK
  14928. 756.41 s [vector] +++ OK, passed 100 tests.
  14929. 756.42 s [vector] ifilter: OK
  14930. 756.42 s [vector] +++ OK, passed 100 tests.
  14931. 756.46 s [vector] filterM: OK (0.03s)
  14932. 756.46 s [vector] +++ OK, passed 100 tests.
  14933. 756.46 s [vector] uniq: OK (0.02s)
  14934. 756.46 s [vector] +++ OK, passed 100 tests.
  14935. 756.46 s [vector] mapMaybe: OK
  14936. 756.46 s [vector] +++ OK, passed 100 tests.
  14937. 756.46 s [vector] imapMaybe: OK
  14938. 756.47 s [vector] +++ OK, passed 100 tests.
  14939. 756.47 s [vector] takeWhile: OK
  14940. 756.47 s [vector] +++ OK, passed 100 tests.
  14941. 756.47 s [vector] dropWhile: OK
  14942. 756.47 s [vector] +++ OK, passed 100 tests.
  14943. 756.47 s [vector] partition: OK
  14944. 756.47 s [vector] +++ OK, passed 100 tests.
  14945. 756.48 s [vector] partitionWith: OK
  14946. 756.48 s [vector] +++ OK, passed 100 tests.
  14947. 756.48 s [vector] span: OK
  14948. 756.48 s [vector] +++ OK, passed 100 tests.
  14949. 756.48 s [vector] break: OK
  14950. 756.48 s [vector] +++ OK, passed 100 tests.
  14951. 756.49 s [vector] spanR: OK
  14952. 756.49 s [vector] +++ OK, passed 100 tests.
  14953. 756.49 s [vector] breakR: OK
  14954. 756.49 s [vector] +++ OK, passed 100 tests.
  14955. 756.49 s [vector] groupBy: OK
  14956. 756.49 s [vector] +++ OK, passed 100 tests.
  14957. 756.49 s [vector] elem: OK
  14958. 756.49 s [vector] +++ OK, passed 100 tests.
  14959. 756.49 s [vector] notElem: OK
  14960. 756.49 s [vector] +++ OK, passed 100 tests.
  14961. 756.49 s [vector] find: OK
  14962. 756.49 s [vector] +++ OK, passed 100 tests.
  14963. 756.49 s [vector] findIndex: OK
  14964. 756.49 s [vector] +++ OK, passed 100 tests.
  14965. 756.49 s [vector] findIndexR: OK
  14966. 756.50 s [vector] +++ OK, passed 100 tests.
  14967. 756.50 s [vector] findIndices: OK
  14968. 756.50 s [vector] +++ OK, passed 100 tests.
  14969. 756.50 s [vector] elemIndex: OK
  14970. 756.50 s [vector] +++ OK, passed 100 tests.
  14971. 756.50 s [vector] elemIndices: OK
  14972. 756.50 s [vector] +++ OK, passed 100 tests.
  14973. 756.51 s [vector] foldl: OK
  14974. 756.51 s [vector] +++ OK, passed 100 tests.
  14975. 756.51 s [vector] foldl1: OK
  14976. 756.51 s [vector] +++ OK, passed 100 tests; 23 discarded.
  14977. 756.51 s [vector] foldl': OK
  14978. 756.51 s [vector] +++ OK, passed 100 tests.
  14979. 756.51 s [vector] foldl1': OK
  14980. 756.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14981. 756.52 s [vector] foldr: OK
  14982. 756.52 s [vector] +++ OK, passed 100 tests.
  14983. 756.52 s [vector] foldr1: OK
  14984. 756.52 s [vector] +++ OK, passed 100 tests; 10 discarded.
  14985. 756.52 s [vector] foldr': OK
  14986. 756.52 s [vector] +++ OK, passed 100 tests.
  14987. 756.53 s [vector] foldr1': OK
  14988. 756.53 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14989. 756.53 s [vector] ifoldl: OK
  14990. 756.53 s [vector] +++ OK, passed 100 tests.
  14991. 756.53 s [vector] ifoldl': OK
  14992. 756.53 s [vector] +++ OK, passed 100 tests.
  14993. 756.53 s [vector] ifoldr: OK
  14994. 756.54 s [vector] +++ OK, passed 100 tests.
  14995. 756.54 s [vector] ifoldr': OK
  14996. 756.54 s [vector] +++ OK, passed 100 tests.
  14997. 756.54 s [vector] ifoldM: OK
  14998. 756.54 s [vector] +++ OK, passed 100 tests.
  14999. 756.54 s [vector] ifoldM': OK
  15000. 756.54 s [vector] +++ OK, passed 100 tests.
  15001. 756.56 s [vector] ifoldM_: OK (0.02s)
  15002. 756.56 s [vector] +++ OK, passed 100 tests.
  15003. 756.57 s [vector] ifoldM'_: OK (0.02s)
  15004. 756.57 s [vector] +++ OK, passed 100 tests.
  15005. 756.57 s [vector] all: OK
  15006. 756.57 s [vector] +++ OK, passed 100 tests.
  15007. 756.58 s [vector] any: OK
  15008. 756.58 s [vector] +++ OK, passed 100 tests.
  15009. 756.58 s [vector] prescanl: OK
  15010. 756.58 s [vector] +++ OK, passed 100 tests.
  15011. 756.58 s [vector] prescanl': OK
  15012. 756.58 s [vector] +++ OK, passed 100 tests.
  15013. 756.58 s [vector] postscanl: OK
  15014. 756.58 s [vector] +++ OK, passed 100 tests.
  15015. 756.58 s [vector] postscanl': OK
  15016. 756.58 s [vector] +++ OK, passed 100 tests.
  15017. 756.58 s [vector] scanl: OK
  15018. 756.59 s [vector] +++ OK, passed 100 tests.
  15019. 756.59 s [vector] scanl': OK
  15020. 756.59 s [vector] +++ OK, passed 100 tests.
  15021. 756.59 s [vector] scanl1: OK
  15022. 756.59 s [vector] +++ OK, passed 100 tests.
  15023. 756.59 s [vector] scanl1': OK
  15024. 756.59 s [vector] +++ OK, passed 100 tests.
  15025. 756.60 s [vector] iscanl: OK
  15026. 756.60 s [vector] +++ OK, passed 100 tests.
  15027. 756.60 s [vector] iscanl': OK
  15028. 756.60 s [vector] +++ OK, passed 100 tests.
  15029. 756.60 s [vector] prescanr: OK
  15030. 756.60 s [vector] +++ OK, passed 100 tests.
  15031. 756.60 s [vector] prescanr': OK
  15032. 756.60 s [vector] +++ OK, passed 100 tests.
  15033. 756.60 s [vector] postscanr: OK
  15034. 756.60 s [vector] +++ OK, passed 100 tests.
  15035. 756.61 s [vector] postscanr': OK
  15036. 756.61 s [vector] +++ OK, passed 100 tests.
  15037. 756.61 s [vector] scanr: OK
  15038. 756.61 s [vector] +++ OK, passed 100 tests.
  15039. 756.61 s [vector] scanr': OK
  15040. 756.61 s [vector] +++ OK, passed 100 tests.
  15041. 756.61 s [vector] scanr1: OK
  15042. 756.61 s [vector] +++ OK, passed 100 tests.
  15043. 756.61 s [vector] scanr1': OK
  15044. 756.61 s [vector] +++ OK, passed 100 tests.
  15045. 756.62 s [vector] iscanr: OK
  15046. 756.62 s [vector] +++ OK, passed 100 tests.
  15047. 756.62 s [vector] iscanr': OK
  15048. 756.62 s [vector] +++ OK, passed 100 tests.
  15049. 756.62 s [vector] mut_read: OK
  15050. 756.62 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15051. 756.62 s [vector] mut_write: OK
  15052. 756.62 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15053. 756.62 s [vector] mut_modify: OK
  15054. 756.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15055. 756.62 s [vector] mut_generate: OK
  15056. 756.62 s [vector] +++ OK, passed 100 tests.
  15057. 756.64 s [vector] mut_generateM: OK
  15058. 756.64 s [vector] +++ OK, passed 100 tests.
  15059. 756.65 s [vector] mut_mapM_: OK (0.01s)
  15060. 756.65 s [vector] +++ OK, passed 100 tests.
  15061. 756.65 s [vector] mut_imapM_: OK (0.01s)
  15062. 756.65 s [vector] +++ OK, passed 100 tests.
  15063. 756.68 s [vector] mut_forM_: OK (0.01s)
  15064. 756.68 s [vector] +++ OK, passed 100 tests.
  15065. 756.69 s [vector] mut_iforM_: OK (0.02s)
  15066. 756.69 s [vector] +++ OK, passed 100 tests.
  15067. 756.69 s [vector] mut_foldr: OK
  15068. 756.69 s [vector] +++ OK, passed 100 tests.
  15069. 756.69 s [vector] mut_foldr': OK
  15070. 756.69 s [vector] +++ OK, passed 100 tests.
  15071. 756.70 s [vector] mut_foldl: OK
  15072. 756.70 s [vector] +++ OK, passed 100 tests.
  15073. 756.70 s [vector] mut_foldl': OK
  15074. 756.70 s [vector] +++ OK, passed 100 tests.
  15075. 756.70 s [vector] mut_ifoldr: OK
  15076. 756.70 s [vector] +++ OK, passed 100 tests.
  15077. 756.71 s [vector] mut_ifoldr': OK
  15078. 756.71 s [vector] +++ OK, passed 100 tests.
  15079. 756.71 s [vector] mut_ifoldl: OK
  15080. 756.71 s [vector] +++ OK, passed 100 tests.
  15081. 756.71 s [vector] mut_ifoldl': OK
  15082. 756.71 s [vector] +++ OK, passed 100 tests.
  15083. 756.71 s [vector] mut_foldM: OK
  15084. 756.71 s [vector] +++ OK, passed 100 tests.
  15085. 756.71 s [vector] mut_foldM': OK
  15086. 756.71 s [vector] +++ OK, passed 100 tests.
  15087. 756.71 s [vector] mut_foldrM: OK
  15088. 756.71 s [vector] +++ OK, passed 100 tests.
  15089. 756.71 s [vector] mut_foldrM': OK
  15090. 756.71 s [vector] +++ OK, passed 100 tests.
  15091. 756.72 s [vector] mut_ifoldM: OK
  15092. 756.72 s [vector] +++ OK, passed 100 tests.
  15093. 756.72 s [vector] mut_ifoldM': OK
  15094. 756.72 s [vector] +++ OK, passed 100 tests.
  15095. 756.73 s [vector] mut_ifoldrM: OK
  15096. 756.73 s [vector] +++ OK, passed 100 tests.
  15097. 756.73 s [vector] mut_ifoldrM': OK
  15098. 756.73 s [vector] +++ OK, passed 100 tests.
  15099. 756.73 s [vector] compare: OK
  15100. 756.73 s [vector] +++ OK, passed 100 tests.
  15101. 756.73 s [vector] maximum: OK
  15102. 756.73 s [vector] +++ OK, passed 100 tests; 11 discarded.
  15103. 756.73 s [vector] minimum: OK
  15104. 756.73 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15105. 756.73 s [vector] minIndex: OK
  15106. 756.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15107. 756.73 s [vector] maxIndex: OK
  15108. 756.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15109. 756.73 s [vector] maximumBy: OK
  15110. 756.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15111. 756.73 s [vector] minimumBy: OK
  15112. 756.73 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15113. 756.73 s [vector] maximumOn: OK
  15114. 756.73 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15115. 756.73 s [vector] minimumOn: OK
  15116. 756.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15117. 756.73 s [vector] maxIndexBy: OK
  15118. 756.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15119. 756.73 s [vector] minIndexBy: OK
  15120. 756.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15121. 756.74 s [vector] ListFirstMaxIndexWins: OK
  15122. 756.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15123. 756.74 s [vector] FalseListFirstMaxIndexWins: OK
  15124. 756.74 s [vector] +++ OK, failed as expected. (after 1 test):
  15125. 756.74 s [vector] Exception:
  15126. 756.74 s [vector] Prelude.foldr1: empty list
  15127. 756.74 s [vector] CallStack (from HasCallStack):
  15128. 756.74 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  15129. 756.74 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  15130. 756.74 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15131. 756.74 s [vector] []
  15132. 756.74 s [vector] zip: OK
  15133. 756.74 s [vector] +++ OK, passed 100 tests.
  15134. 756.74 s [vector] zip3: OK
  15135. 756.74 s [vector] +++ OK, passed 100 tests.
  15136. 756.74 s [vector] unzip: OK
  15137. 756.74 s [vector] +++ OK, passed 100 tests.
  15138. 756.74 s [vector] unzip3: OK
  15139. 756.74 s [vector] +++ OK, passed 100 tests.
  15140. 756.74 s [vector] indexed: OK
  15141. 756.74 s [vector] +++ OK, passed 100 tests.
  15142. 756.74 s [vector] update: OK
  15143. 756.74 s [vector] +++ OK, passed 100 tests.
  15144. 756.74 s [vector] mempty: OK
  15145. 756.74 s [vector] +++ OK, passed 100 tests.
  15146. 756.75 s [vector] mappend: OK
  15147. 756.75 s [vector] +++ OK, passed 100 tests.
  15148. 756.75 s [vector] mconcat: OK
  15149. 756.75 s [vector] +++ OK, passed 100 tests.
  15150. 756.75 s [vector] glength: OK
  15151. 756.75 s [vector] +++ OK, passed 100 tests.
  15152. 756.75 s [vector] and: OK
  15153. 756.75 s [vector] +++ OK, passed 100 tests.
  15154. 756.75 s [vector] or: OK
  15155. 756.75 s [vector] +++ OK, passed 100 tests.
  15156. 756.75 s [vector] (Int)
  15157. 756.75 s [vector] fromList.toList == id: OK
  15158. 756.75 s [vector] +++ OK, passed 100 tests.
  15159. 756.75 s [vector] toList.fromList == id: OK
  15160. 756.75 s [vector] +++ OK, passed 100 tests.
  15161. 756.75 s [vector] unstream.stream == id: OK
  15162. 756.75 s [vector] +++ OK, passed 100 tests.
  15163. 756.75 s [vector] stream.unstream == id: OK
  15164. 756.75 s [vector] +++ OK, passed 100 tests.
  15165. 756.75 s [vector] eq: OK
  15166. 756.75 s [vector] +++ OK, passed 100 tests.
  15167. 756.76 s [vector] length: OK
  15168. 756.76 s [vector] +++ OK, passed 100 tests.
  15169. 756.76 s [vector] null: OK
  15170. 756.76 s [vector] +++ OK, passed 100 tests.
  15171. 756.76 s [vector] index: OK
  15172. 756.76 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15173. 756.76 s [vector] safeIndex: OK
  15174. 756.76 s [vector] +++ OK, passed 100 tests.
  15175. 756.76 s [vector] head: OK
  15176. 756.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15177. 756.76 s [vector] last: OK
  15178. 756.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15179. 756.76 s [vector] unsafeIndex: OK
  15180. 756.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15181. 756.76 s [vector] unsafeHead: OK
  15182. 756.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15183. 756.76 s [vector] unsafeLast: OK
  15184. 756.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15185. 756.76 s [vector] slice: OK
  15186. 756.76 s [vector] +++ OK, passed 100 tests.
  15187. 756.76 s [vector] init: OK
  15188. 756.76 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15189. 756.76 s [vector] tail: OK
  15190. 756.76 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15191. 756.76 s [vector] take: OK
  15192. 756.76 s [vector] +++ OK, passed 100 tests.
  15193. 756.76 s [vector] drop: OK
  15194. 756.76 s [vector] +++ OK, passed 100 tests.
  15195. 756.76 s [vector] splitAt: OK
  15196. 756.76 s [vector] +++ OK, passed 100 tests.
  15197. 756.77 s [vector] empty: OK
  15198. 756.77 s [vector] +++ OK, passed 100 tests.
  15199. 756.77 s [vector] singleton: OK
  15200. 756.77 s [vector] +++ OK, passed 100 tests.
  15201. 756.77 s [vector] replicate: OK
  15202. 756.77 s [vector] +++ OK, passed 100 tests.
  15203. 756.77 s [vector] generate: OK
  15204. 756.77 s [vector] +++ OK, passed 100 tests.
  15205. 756.77 s [vector] iterateN: OK
  15206. 756.77 s [vector] +++ OK, passed 100 tests.
  15207. 756.81 s [vector] iterateNM: OK (0.04s)
  15208. 756.81 s [vector] +++ OK, passed 100 tests.
  15209. 756.86 s [vector] generateM: OK (0.03s)
  15210. 756.86 s [vector] +++ OK, passed 100 tests.
  15211. 756.87 s [vector] replicateM: OK (0.01s)
  15212. 756.87 s [vector] +++ OK, passed 100 tests.
  15213. 756.87 s [vector] create: OK
  15214. 756.87 s [vector] +++ OK, passed 100 tests.
  15215. 756.87 s [vector] createT: OK
  15216. 756.87 s [vector] +++ OK, passed 100 tests.
  15217. 756.87 s [vector] unfoldr: OK
  15218. 756.87 s [vector] +++ OK, passed 100 tests.
  15219. 756.87 s [vector] unfoldrN: OK
  15220. 756.87 s [vector] +++ OK, passed 100 tests.
  15221. 756.87 s [vector] unfoldrExactN: OK
  15222. 756.87 s [vector] +++ OK, passed 100 tests.
  15223. 756.87 s [vector] unfoldrM: OK
  15224. 756.87 s [vector] +++ OK, passed 100 tests.
  15225. 756.88 s [vector] unfoldrNM: OK
  15226. 756.88 s [vector] +++ OK, passed 100 tests.
  15227. 756.92 s [vector] unfoldrExactNM: OK (0.04s)
  15228. 756.92 s [vector] +++ OK, passed 100 tests.
  15229. 756.92 s [vector] constructN: OK
  15230. 756.92 s [vector] +++ OK, passed 100 tests.
  15231. 756.93 s [vector] constructrN: OK
  15232. 756.93 s [vector] +++ OK, passed 100 tests.
  15233. 756.93 s [vector] cons: OK
  15234. 756.93 s [vector] +++ OK, passed 100 tests.
  15235. 756.93 s [vector] snoc: OK
  15236. 756.93 s [vector] +++ OK, passed 100 tests.
  15237. 756.94 s [vector] append: OK
  15238. 756.94 s [vector] +++ OK, passed 100 tests.
  15239. 756.95 s [vector] concat: OK (0.02s)
  15240. 756.96 s [vector] +++ OK, passed 100 tests.
  15241. 756.97 s [vector] force: OK
  15242. 756.97 s [vector] +++ OK, passed 100 tests.
  15243. 756.97 s [vector] upd: OK
  15244. 756.97 s [vector] +++ OK, passed 100 tests.
  15245. 756.97 s [vector] accum: OK
  15246. 756.97 s [vector] +++ OK, passed 100 tests.
  15247. 756.97 s [vector] reverse: OK
  15248. 756.97 s [vector] +++ OK, passed 100 tests.
  15249. 756.97 s [vector] backpermute: OK
  15250. 756.97 s [vector] +++ OK, passed 100 tests.
  15251. 756.98 s [vector] map: OK
  15252. 756.98 s [vector] +++ OK, passed 100 tests.
  15253. 756.99 s [vector] imap: OK (0.02s)
  15254. 756.99 s [vector] +++ OK, passed 100 tests.
  15255. 756.99 s [vector] concatMap: OK
  15256. 756.99 s [vector] +++ OK, passed 100 tests.
  15257. 756.99 s [vector] mapM: OK
  15258. 756.99 s [vector] +++ OK, passed 100 tests.
  15259. 757.02 s [vector] mapM_: OK (0.02s)
  15260. 757.02 s [vector] +++ OK, passed 100 tests.
  15261. 757.02 s [vector] forM: OK
  15262. 757.02 s [vector] +++ OK, passed 100 tests.
  15263. 757.05 s [vector] forM_: OK (0.02s)
  15264. 757.05 s [vector] +++ OK, passed 100 tests.
  15265. 757.05 s [vector] imapM: OK
  15266. 757.05 s [vector] +++ OK, passed 100 tests.
  15267. 757.07 s [vector] imapM_: OK
  15268. 757.08 s [vector] +++ OK, passed 100 tests.
  15269. 757.08 s [vector] zipWith: OK
  15270. 757.08 s [vector] +++ OK, passed 100 tests.
  15271. 757.08 s [vector] zipWith3: OK
  15272. 757.08 s [vector] +++ OK, passed 100 tests.
  15273. 757.09 s [vector] izipWith: OK
  15274. 757.09 s [vector] +++ OK, passed 100 tests.
  15275. 757.10 s [vector] izipWith3: OK
  15276. 757.10 s [vector] +++ OK, passed 100 tests.
  15277. 757.10 s [vector] izipWithM: OK
  15278. 757.10 s [vector] +++ OK, passed 100 tests.
  15279. 757.12 s [vector] izipWithM_: OK (0.02s)
  15280. 757.12 s [vector] +++ OK, passed 100 tests.
  15281. 757.14 s [vector] zipWithM: OK
  15282. 757.14 s [vector] +++ OK, passed 100 tests.
  15283. 757.14 s [vector] zipWithM_: OK (0.02s)
  15284. 757.14 s [vector] +++ OK, passed 100 tests.
  15285. 757.14 s [vector] filter: OK
  15286. 757.14 s [vector] +++ OK, passed 100 tests.
  15287. 757.16 s [vector] ifilter: OK
  15288. 757.16 s [vector] +++ OK, passed 100 tests.
  15289. 757.19 s [vector] filterM: OK (0.04s)
  15290. 757.19 s [vector] +++ OK, passed 100 tests.
  15291. 757.19 s [vector] uniq: OK
  15292. 757.19 s [vector] +++ OK, passed 100 tests.
  15293. 757.19 s [vector] mapMaybe: OK
  15294. 757.19 s [vector] +++ OK, passed 100 tests.
  15295. 757.19 s [vector] imapMaybe: OK
  15296. 757.19 s [vector] +++ OK, passed 100 tests.
  15297. 757.19 s [vector] takeWhile: OK
  15298. 757.19 s [vector] +++ OK, passed 100 tests.
  15299. 757.20 s [vector] dropWhile: OK
  15300. 757.20 s [vector] +++ OK, passed 100 tests.
  15301. 757.20 s [vector] partition: OK
  15302. 757.20 s [vector] +++ OK, passed 100 tests.
  15303. 757.21 s [vector] partitionWith: OK
  15304. 757.21 s [vector] +++ OK, passed 100 tests.
  15305. 757.21 s [vector] span: OK
  15306. 757.21 s [vector] +++ OK, passed 100 tests.
  15307. 757.21 s [vector] break: OK
  15308. 757.21 s [vector] +++ OK, passed 100 tests.
  15309. 757.21 s [vector] spanR: OK
  15310. 757.21 s [vector] +++ OK, passed 100 tests.
  15311. 757.21 s [vector] breakR: OK
  15312. 757.21 s [vector] +++ OK, passed 100 tests.
  15313. 757.22 s [vector] groupBy: OK
  15314. 757.22 s [vector] +++ OK, passed 100 tests.
  15315. 757.22 s [vector] elem: OK
  15316. 757.22 s [vector] +++ OK, passed 100 tests.
  15317. 757.22 s [vector] notElem: OK
  15318. 757.22 s [vector] +++ OK, passed 100 tests.
  15319. 757.22 s [vector] find: OK
  15320. 757.22 s [vector] +++ OK, passed 100 tests.
  15321. 757.22 s [vector] findIndex: OK
  15322. 757.22 s [vector] +++ OK, passed 100 tests.
  15323. 757.22 s [vector] findIndexR: OK
  15324. 757.22 s [vector] +++ OK, passed 100 tests.
  15325. 757.22 s [vector] findIndices: OK
  15326. 757.23 s [vector] +++ OK, passed 100 tests.
  15327. 757.23 s [vector] elemIndex: OK
  15328. 757.23 s [vector] +++ OK, passed 100 tests.
  15329. 757.23 s [vector] elemIndices: OK
  15330. 757.23 s [vector] +++ OK, passed 100 tests.
  15331. 757.23 s [vector] foldl: OK
  15332. 757.23 s [vector] +++ OK, passed 100 tests.
  15333. 757.24 s [vector] foldl1: OK
  15334. 757.24 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15335. 757.24 s [vector] foldl': OK
  15336. 757.24 s [vector] +++ OK, passed 100 tests.
  15337. 757.25 s [vector] foldl1': OK
  15338. 757.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15339. 757.25 s [vector] foldr: OK
  15340. 757.25 s [vector] +++ OK, passed 100 tests.
  15341. 757.25 s [vector] foldr1: OK
  15342. 757.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15343. 757.26 s [vector] foldr': OK
  15344. 757.26 s [vector] +++ OK, passed 100 tests.
  15345. 757.27 s [vector] foldr1': OK
  15346. 757.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15347. 757.28 s [vector] ifoldl: OK
  15348. 757.28 s [vector] +++ OK, passed 100 tests.
  15349. 757.28 s [vector] ifoldl': OK
  15350. 757.28 s [vector] +++ OK, passed 100 tests.
  15351. 757.28 s [vector] ifoldr: OK
  15352. 757.28 s [vector] +++ OK, passed 100 tests.
  15353. 757.28 s [vector] ifoldr': OK
  15354. 757.28 s [vector] +++ OK, passed 100 tests.
  15355. 757.29 s [vector] ifoldM: OK
  15356. 757.29 s [vector] +++ OK, passed 100 tests.
  15357. 757.30 s [vector] ifoldM': OK
  15358. 757.30 s [vector] +++ OK, passed 100 tests.
  15359. 757.34 s [vector] ifoldM_: OK (0.03s)
  15360. 757.34 s [vector] +++ OK, passed 100 tests.
  15361. 757.35 s [vector] ifoldM'_: OK (0.03s)
  15362. 757.35 s [vector] +++ OK, passed 100 tests.
  15363. 757.35 s [vector] all: OK
  15364. 757.36 s [vector] +++ OK, passed 100 tests.
  15365. 757.36 s [vector] any: OK
  15366. 757.36 s [vector] +++ OK, passed 100 tests.
  15367. 757.36 s [vector] prescanl: OK
  15368. 757.36 s [vector] +++ OK, passed 100 tests.
  15369. 757.38 s [vector] prescanl': OK
  15370. 757.38 s [vector] +++ OK, passed 100 tests.
  15371. 757.38 s [vector] postscanl: OK
  15372. 757.38 s [vector] +++ OK, passed 100 tests.
  15373. 757.39 s [vector] postscanl': OK
  15374. 757.39 s [vector] +++ OK, passed 100 tests.
  15375. 757.39 s [vector] scanl: OK
  15376. 757.39 s [vector] +++ OK, passed 100 tests.
  15377. 757.40 s [vector] scanl': OK
  15378. 757.40 s [vector] +++ OK, passed 100 tests.
  15379. 757.40 s [vector] scanl1: OK
  15380. 757.40 s [vector] +++ OK, passed 100 tests.
  15381. 757.41 s [vector] scanl1': OK
  15382. 757.41 s [vector] +++ OK, passed 100 tests.
  15383. 757.41 s [vector] iscanl: OK
  15384. 757.41 s [vector] +++ OK, passed 100 tests.
  15385. 757.41 s [vector] iscanl': OK
  15386. 757.42 s [vector] +++ OK, passed 100 tests.
  15387. 757.42 s [vector] prescanr: OK
  15388. 757.42 s [vector] +++ OK, passed 100 tests.
  15389. 757.42 s [vector] prescanr': OK
  15390. 757.42 s [vector] +++ OK, passed 100 tests.
  15391. 757.43 s [vector] postscanr: OK
  15392. 757.43 s [vector] +++ OK, passed 100 tests.
  15393. 757.44 s [vector] postscanr': OK
  15394. 757.44 s [vector] +++ OK, passed 100 tests.
  15395. 757.44 s [vector] scanr: OK
  15396. 757.44 s [vector] +++ OK, passed 100 tests.
  15397. 757.45 s [vector] scanr': OK
  15398. 757.45 s [vector] +++ OK, passed 100 tests.
  15399. 757.45 s [vector] scanr1: OK
  15400. 757.46 s [vector] +++ OK, passed 100 tests.
  15401. 757.46 s [vector] scanr1': OK
  15402. 757.46 s [vector] +++ OK, passed 100 tests.
  15403. 757.46 s [vector] iscanr: OK
  15404. 757.46 s [vector] +++ OK, passed 100 tests.
  15405. 757.46 s [vector] iscanr': OK
  15406. 757.46 s [vector] +++ OK, passed 100 tests.
  15407. 757.46 s [vector] mut_read: OK
  15408. 757.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15409. 757.46 s [vector] mut_write: OK
  15410. 757.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15411. 757.47 s [vector] mut_modify: OK
  15412. 757.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15413. 757.47 s [vector] mut_generate: OK
  15414. 757.47 s [vector] +++ OK, passed 100 tests.
  15415. 757.47 s [vector] mut_generateM: OK
  15416. 757.47 s [vector] +++ OK, passed 100 tests.
  15417. 757.49 s [vector] mut_mapM_: OK (0.01s)
  15418. 757.49 s [vector] +++ OK, passed 100 tests.
  15419. 757.52 s [vector] mut_imapM_: OK
  15420. 757.53 s [vector] +++ OK, passed 100 tests.
  15421. 757.53 s [vector] mut_forM_: OK (0.01s)
  15422. 757.53 s [vector] +++ OK, passed 100 tests.
  15423. 757.54 s [vector] mut_iforM_: OK (0.02s)
  15424. 757.54 s [vector] +++ OK, passed 100 tests.
  15425. 757.54 s [vector] mut_foldr: OK
  15426. 757.54 s [vector] +++ OK, passed 100 tests.
  15427. 757.54 s [vector] mut_foldr': OK
  15428. 757.54 s [vector] +++ OK, passed 100 tests.
  15429. 757.55 s [vector] mut_foldl: OK
  15430. 757.55 s [vector] +++ OK, passed 100 tests.
  15431. 757.55 s [vector] mut_foldl': OK
  15432. 757.55 s [vector] +++ OK, passed 100 tests.
  15433. 757.55 s [vector] mut_ifoldr: OK
  15434. 757.56 s [vector] +++ OK, passed 100 tests.
  15435. 757.56 s [vector] mut_ifoldr': OK
  15436. 757.56 s [vector] +++ OK, passed 100 tests.
  15437. 757.56 s [vector] mut_ifoldl: OK
  15438. 757.56 s [vector] +++ OK, passed 100 tests.
  15439. 757.56 s [vector] mut_ifoldl': OK
  15440. 757.56 s [vector] +++ OK, passed 100 tests.
  15441. 757.57 s [vector] mut_foldM: OK
  15442. 757.57 s [vector] +++ OK, passed 100 tests.
  15443. 757.57 s [vector] mut_foldM': OK
  15444. 757.57 s [vector] +++ OK, passed 100 tests.
  15445. 757.57 s [vector] mut_foldrM: OK
  15446. 757.57 s [vector] +++ OK, passed 100 tests.
  15447. 757.58 s [vector] mut_foldrM': OK
  15448. 757.58 s [vector] +++ OK, passed 100 tests.
  15449. 757.59 s [vector] mut_ifoldM: OK (0.01s)
  15450. 757.60 s [vector] +++ OK, passed 100 tests.
  15451. 757.60 s [vector] mut_ifoldM': OK
  15452. 757.60 s [vector] +++ OK, passed 100 tests.
  15453. 757.60 s [vector] mut_ifoldrM: OK
  15454. 757.60 s [vector] +++ OK, passed 100 tests.
  15455. 757.60 s [vector] mut_ifoldrM': OK
  15456. 757.60 s [vector] +++ OK, passed 100 tests.
  15457. 757.60 s [vector] compare: OK
  15458. 757.60 s [vector] +++ OK, passed 100 tests.
  15459. 757.60 s [vector] maximum: OK
  15460. 757.61 s [vector] +++ OK, passed 100 tests; 28 discarded.
  15461. 757.61 s [vector] minimum: OK
  15462. 757.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15463. 757.61 s [vector] minIndex: OK
  15464. 757.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15465. 757.61 s [vector] maxIndex: OK
  15466. 757.61 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15467. 757.61 s [vector] maximumBy: OK
  15468. 757.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15469. 757.61 s [vector] minimumBy: OK
  15470. 757.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15471. 757.61 s [vector] maximumOn: OK
  15472. 757.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15473. 757.61 s [vector] minimumOn: OK
  15474. 757.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15475. 757.61 s [vector] maxIndexBy: OK
  15476. 757.61 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15477. 757.61 s [vector] minIndexBy: OK
  15478. 757.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15479. 757.61 s [vector] ListFirstMaxIndexWins: OK
  15480. 757.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15481. 757.61 s [vector] FalseListFirstMaxIndexWins: OK
  15482. 757.61 s [vector] +++ OK, failed as expected. (after 1 test):
  15483. 757.61 s [vector] Exception:
  15484. 757.61 s [vector] Prelude.foldr1: empty list
  15485. 757.61 s [vector] CallStack (from HasCallStack):
  15486. 757.61 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  15487. 757.61 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  15488. 757.61 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15489. 757.61 s [vector] []
  15490. 757.62 s [vector] zip: OK
  15491. 757.62 s [vector] +++ OK, passed 100 tests.
  15492. 757.62 s [vector] zip3: OK
  15493. 757.62 s [vector] +++ OK, passed 100 tests.
  15494. 757.62 s [vector] unzip: OK
  15495. 757.62 s [vector] +++ OK, passed 100 tests.
  15496. 757.62 s [vector] unzip3: OK
  15497. 757.62 s [vector] +++ OK, passed 100 tests.
  15498. 757.62 s [vector] indexed: OK
  15499. 757.62 s [vector] +++ OK, passed 100 tests.
  15500. 757.63 s [vector] update: OK
  15501. 757.63 s [vector] +++ OK, passed 100 tests.
  15502. 757.63 s [vector] mempty: OK
  15503. 757.63 s [vector] +++ OK, passed 100 tests.
  15504. 757.63 s [vector] mappend: OK
  15505. 757.63 s [vector] +++ OK, passed 100 tests.
  15506. 757.64 s [vector] mconcat: OK
  15507. 757.64 s [vector] +++ OK, passed 100 tests.
  15508. 757.64 s [vector] glength: OK
  15509. 757.64 s [vector] +++ OK, passed 100 tests.
  15510. 757.65 s [vector] sum: OK
  15511. 757.65 s [vector] +++ OK, passed 100 tests.
  15512. 757.65 s [vector] product: OK
  15513. 757.65 s [vector] +++ OK, passed 100 tests.
  15514. 757.65 s [vector] enumFromN: OK
  15515. 757.65 s [vector] +++ OK, passed 100 tests.
  15516. 757.65 s [vector] enumFromThenN: OK
  15517. 757.65 s [vector] +++ OK, passed 100 tests.
  15518. 757.65 s [vector] enumFromTo: OK
  15519. 757.65 s [vector] +++ OK, passed 100 tests.
  15520. 757.65 s [vector] enumFromThenTo: OK
  15521. 757.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15522. 757.65 s [vector] (Float)
  15523. 757.65 s [vector] fromList.toList == id: OK
  15524. 757.65 s [vector] +++ OK, passed 100 tests.
  15525. 757.65 s [vector] toList.fromList == id: OK
  15526. 757.66 s [vector] +++ OK, passed 100 tests.
  15527. 757.66 s [vector] unstream.stream == id: OK
  15528. 757.66 s [vector] +++ OK, passed 100 tests.
  15529. 757.66 s [vector] stream.unstream == id: OK
  15530. 757.66 s [vector] +++ OK, passed 100 tests.
  15531. 757.66 s [vector] eq: OK
  15532. 757.66 s [vector] +++ OK, passed 100 tests.
  15533. 757.66 s [vector] length: OK
  15534. 757.66 s [vector] +++ OK, passed 100 tests.
  15535. 757.67 s [vector] null: OK
  15536. 757.67 s [vector] +++ OK, passed 100 tests.
  15537. 757.67 s [vector] index: OK
  15538. 757.67 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15539. 757.67 s [vector] safeIndex: OK
  15540. 757.67 s [vector] +++ OK, passed 100 tests.
  15541. 757.67 s [vector] head: OK
  15542. 757.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15543. 757.67 s [vector] last: OK
  15544. 757.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15545. 757.67 s [vector] unsafeIndex: OK
  15546. 757.67 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15547. 757.68 s [vector] unsafeHead: OK
  15548. 757.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15549. 757.68 s [vector] unsafeLast: OK
  15550. 757.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15551. 757.68 s [vector] slice: OK
  15552. 757.68 s [vector] +++ OK, passed 100 tests.
  15553. 757.68 s [vector] init: OK
  15554. 757.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15555. 757.68 s [vector] tail: OK
  15556. 757.68 s [vector] +++ OK, passed 100 tests; 24 discarded.
  15557. 757.68 s [vector] take: OK
  15558. 757.68 s [vector] +++ OK, passed 100 tests.
  15559. 757.69 s [vector] drop: OK
  15560. 757.69 s [vector] +++ OK, passed 100 tests.
  15561. 757.69 s [vector] splitAt: OK
  15562. 757.69 s [vector] +++ OK, passed 100 tests.
  15563. 757.69 s [vector] empty: OK
  15564. 757.69 s [vector] +++ OK, passed 100 tests.
  15565. 757.69 s [vector] singleton: OK
  15566. 757.69 s [vector] +++ OK, passed 100 tests.
  15567. 757.69 s [vector] replicate: OK
  15568. 757.69 s [vector] +++ OK, passed 100 tests.
  15569. 757.70 s [vector] generate: OK
  15570. 757.70 s [vector] +++ OK, passed 100 tests.
  15571. 757.70 s [vector] iterateN: OK
  15572. 757.70 s [vector] +++ OK, passed 100 tests.
  15573. 757.79 s [vector] iterateNM: OK (0.08s)
  15574. 757.79 s [vector] +++ OK, passed 100 tests.
  15575. 757.81 s [vector] generateM: OK (0.03s)
  15576. 757.81 s [vector] +++ OK, passed 100 tests.
  15577. 757.82 s [vector] replicateM: OK
  15578. 757.82 s [vector] +++ OK, passed 100 tests.
  15579. 757.82 s [vector] create: OK
  15580. 757.82 s [vector] +++ OK, passed 100 tests.
  15581. 757.82 s [vector] createT: OK
  15582. 757.82 s [vector] +++ OK, passed 100 tests.
  15583. 757.82 s [vector] unfoldr: OK
  15584. 757.82 s [vector] +++ OK, passed 100 tests.
  15585. 757.82 s [vector] unfoldrN: OK
  15586. 757.82 s [vector] +++ OK, passed 100 tests.
  15587. 757.82 s [vector] unfoldrExactN: OK
  15588. 757.82 s [vector] +++ OK, passed 100 tests.
  15589. 757.82 s [vector] unfoldrM: OK
  15590. 757.82 s [vector] +++ OK, passed 100 tests.
  15591. 757.84 s [vector] unfoldrNM: OK
  15592. 757.84 s [vector] +++ OK, passed 100 tests.
  15593. 757.86 s [vector] unfoldrExactNM: OK (0.03s)
  15594. 757.87 s [vector] +++ OK, passed 100 tests.
  15595. 757.88 s [vector] constructN: OK (0.01s)
  15596. 757.88 s [vector] +++ OK, passed 100 tests.
  15597. 757.88 s [vector] constructrN: OK
  15598. 757.88 s [vector] +++ OK, passed 100 tests.
  15599. 757.89 s [vector] cons: OK
  15600. 757.89 s [vector] +++ OK, passed 100 tests.
  15601. 757.89 s [vector] snoc: OK
  15602. 757.89 s [vector] +++ OK, passed 100 tests.
  15603. 757.89 s [vector] append: OK
  15604. 757.90 s [vector] +++ OK, passed 100 tests.
  15605. 757.92 s [vector] concat: OK (0.03s)
  15606. 757.93 s [vector] +++ OK, passed 100 tests.
  15607. 757.93 s [vector] force: OK
  15608. 757.93 s [vector] +++ OK, passed 100 tests.
  15609. 757.94 s [vector] upd: OK
  15610. 757.94 s [vector] +++ OK, passed 100 tests.
  15611. 757.94 s [vector] accum: OK (0.02s)
  15612. 757.95 s [vector] +++ OK, passed 100 tests.
  15613. 757.95 s [vector] reverse: OK
  15614. 757.95 s [vector] +++ OK, passed 100 tests.
  15615. 757.96 s [vector] backpermute: OK
  15616. 757.96 s [vector] +++ OK, passed 100 tests.
  15617. 757.96 s [vector] map: OK
  15618. 757.96 s [vector] +++ OK, passed 100 tests.
  15619. 757.98 s [vector] imap: OK (0.01s)
  15620. 757.98 s [vector] +++ OK, passed 100 tests.
  15621. 758.00 s [vector] concatMap: OK (0.02s)
  15622. 758.00 s [vector] +++ OK, passed 100 tests.
  15623. 758.00 s [vector] mapM: OK (0.01s)
  15624. 758.00 s [vector] +++ OK, passed 100 tests.
  15625. 758.06 s [vector] mapM_: OK (0.05s)
  15626. 758.06 s [vector] +++ OK, passed 100 tests.
  15627. 758.06 s [vector] forM: OK (0.01s)
  15628. 758.06 s [vector] +++ OK, passed 100 tests.
  15629. 758.14 s [vector] forM_: OK (0.06s)
  15630. 758.53 s [vector] +++ OK, passed 100 tests.
  15631. 758.53 s [vector] imapM: OK (0.01s)
  15632. 758.53 s [vector] +++ OK, passed 100 tests.
  15633. 758.53 s [vector] imapM_: OK (0.06s)
  15634. 758.53 s [vector] +++ OK, passed 100 tests.
  15635. 758.53 s [vector] zipWith: OK
  15636. 758.53 s [vector] +++ OK, passed 100 tests.
  15637. 758.53 s [vector] zipWith3: OK (0.01s)
  15638. 758.53 s [vector] +++ OK, passed 100 tests.
  15639. 758.53 s [vector] izipWith: OK (0.01s)
  15640. 758.53 s [vector] +++ OK, passed 100 tests.
  15641. 758.53 s [vector] izipWith3: OK (0.01s)
  15642. 758.53 s [vector] +++ OK, passed 100 tests.
  15643. 758.53 s [vector] izipWithM: OK (0.01s)
  15644. 758.53 s [vector] +++ OK, passed 100 tests.
  15645. 758.53 s [vector] izipWithM_: OK (0.04s)
  15646. 758.55 s [vector] +++ OK, passed 100 tests.
  15647. 758.55 s [vector] zipWithM: OK (0.01s)
  15648. 758.55 s [vector] +++ OK, passed 100 tests.
  15649. 758.55 s [vector] zipWithM_: OK (0.03s)
  15650. 758.55 s [vector] +++ OK, passed 100 tests.
  15651. 758.55 s [vector] filter: OK
  15652. 758.55 s [vector] +++ OK, passed 100 tests.
  15653. 758.55 s [vector] ifilter: OK
  15654. 758.55 s [vector] +++ OK, passed 100 tests.
  15655. 758.55 s [vector] filterM: OK (0.05s)
  15656. 758.55 s [vector] +++ OK, passed 100 tests.
  15657. 758.55 s [vector] uniq: OK
  15658. 758.55 s [vector] +++ OK, passed 100 tests.
  15659. 758.55 s [vector] mapMaybe: OK
  15660. 758.55 s [vector] +++ OK, passed 100 tests.
  15661. 758.55 s [vector] imapMaybe: OK
  15662. 758.55 s [vector] +++ OK, passed 100 tests.
  15663. 758.55 s [vector] takeWhile: OK
  15664. 758.55 s [vector] +++ OK, passed 100 tests.
  15665. 758.55 s [vector] dropWhile: OK
  15666. 758.55 s [vector] +++ OK, passed 100 tests.
  15667. 758.55 s [vector] partition: OK
  15668. 758.55 s [vector] +++ OK, passed 100 tests.
  15669. 758.55 s [vector] partitionWith: OK
  15670. 758.55 s [vector] +++ OK, passed 100 tests.
  15671. 758.55 s [vector] span: OK
  15672. 758.55 s [vector] +++ OK, passed 100 tests.
  15673. 758.55 s [vector] break: OK
  15674. 758.55 s [vector] +++ OK, passed 100 tests.
  15675. 758.55 s [vector] spanR: OK
  15676. 758.55 s [vector] +++ OK, passed 100 tests.
  15677. 758.55 s [vector] breakR: OK
  15678. 758.55 s [vector] +++ OK, passed 100 tests.
  15679. 758.55 s [vector] groupBy: OK
  15680. 758.55 s [vector] +++ OK, passed 100 tests.
  15681. 758.55 s [vector] elem: OK
  15682. 758.55 s [vector] +++ OK, passed 100 tests.
  15683. 758.55 s [vector] notElem: OK
  15684. 758.55 s [vector] +++ OK, passed 100 tests.
  15685. 758.55 s [vector] find: OK
  15686. 758.55 s [vector] +++ OK, passed 100 tests.
  15687. 758.55 s [vector] findIndex: OK
  15688. 758.55 s [vector] +++ OK, passed 100 tests.
  15689. 758.55 s [vector] findIndexR: OK
  15690. 758.55 s [vector] +++ OK, passed 100 tests.
  15691. 758.55 s [vector] findIndices: OK
  15692. 758.55 s [vector] +++ OK, passed 100 tests.
  15693. 758.55 s [vector] elemIndex: OK
  15694. 758.55 s [vector] +++ OK, passed 100 tests.
  15695. 758.55 s [vector] elemIndices: OK
  15696. 758.55 s [vector] +++ OK, passed 100 tests.
  15697. 758.55 s [vector] foldl: OK
  15698. 758.55 s [vector] +++ OK, passed 100 tests.
  15699. 758.55 s [vector] foldl1: OK
  15700. 758.55 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15701. 758.55 s [vector] foldl': OK
  15702. 758.55 s [vector] +++ OK, passed 100 tests.
  15703. 758.55 s [vector] foldl1': OK
  15704. 758.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15705. 758.55 s [vector] foldr: OK
  15706. 758.55 s [vector] +++ OK, passed 100 tests.
  15707. 758.55 s [vector] foldr1: OK (0.02s)
  15708. 758.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15709. 758.58 s [vector] foldr': OK (0.02s)
  15710. 758.58 s [vector] +++ OK, passed 100 tests.
  15711. 758.58 s [vector] foldr1': OK (0.01s)
  15712. 758.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15713. 758.59 s [vector] ifoldl: OK (0.01s)
  15714. 758.59 s [vector] +++ OK, passed 100 tests.
  15715. 758.61 s [vector] ifoldl': OK
  15716. 758.61 s [vector] +++ OK, passed 100 tests.
  15717. 758.63 s [vector] ifoldr: OK (0.02s)
  15718. 758.63 s [vector] +++ OK, passed 100 tests.
  15719. 758.64 s [vector] ifoldr': OK
  15720. 758.64 s [vector] +++ OK, passed 100 tests.
  15721. 758.66 s [vector] ifoldM: OK (0.01s)
  15722. 758.66 s [vector] +++ OK, passed 100 tests.
  15723. 758.68 s [vector] ifoldM': OK (0.01s)
  15724. 758.68 s [vector] +++ OK, passed 100 tests.
  15725. 758.72 s [vector] ifoldM_: OK (0.04s)
  15726. 758.72 s [vector] +++ OK, passed 100 tests.
  15727. 758.75 s [vector] ifoldM'_: OK (0.03s)
  15728. 758.75 s [vector] +++ OK, passed 100 tests.
  15729. 758.75 s [vector] all: OK
  15730. 758.75 s [vector] +++ OK, passed 100 tests.
  15731. 758.75 s [vector] any: OK
  15732. 758.75 s [vector] +++ OK, passed 100 tests.
  15733. 758.76 s [vector] prescanl: OK
  15734. 758.76 s [vector] +++ OK, passed 100 tests.
  15735. 758.78 s [vector] prescanl': OK (0.01s)
  15736. 758.78 s [vector] +++ OK, passed 100 tests.
  15737. 758.78 s [vector] postscanl: OK (0.01s)
  15738. 758.79 s [vector] +++ OK, passed 100 tests.
  15739. 758.79 s [vector] postscanl': OK
  15740. 758.79 s [vector] +++ OK, passed 100 tests.
  15741. 758.80 s [vector] scanl: OK
  15742. 758.80 s [vector] +++ OK, passed 100 tests.
  15743. 758.82 s [vector] scanl': OK (0.01s)
  15744. 758.82 s [vector] +++ OK, passed 100 tests.
  15745. 758.84 s [vector] scanl1: OK (0.02s)
  15746. 758.85 s [vector] +++ OK, passed 100 tests.
  15747. 758.86 s [vector] scanl1': OK (0.02s)
  15748. 758.86 s [vector] +++ OK, passed 100 tests.
  15749. 758.87 s [vector] iscanl: OK (0.02s)
  15750. 758.87 s [vector] +++ OK, passed 100 tests.
  15751. 758.90 s [vector] iscanl': OK
  15752. 758.90 s [vector] +++ OK, passed 100 tests.
  15753. 758.90 s [vector] prescanr: OK (0.01s)
  15754. 758.90 s [vector] +++ OK, passed 100 tests.
  15755. 758.92 s [vector] prescanr': OK (0.02s)
  15756. 758.92 s [vector] +++ OK, passed 100 tests.
  15757. 758.94 s [vector] postscanr: OK (0.01s)
  15758. 758.94 s [vector] +++ OK, passed 100 tests.
  15759. 758.96 s [vector] postscanr': OK (0.02s)
  15760. 758.96 s [vector] +++ OK, passed 100 tests.
  15761. 758.98 s [vector] scanr: OK (0.02s)
  15762. 758.98 s [vector] +++ OK, passed 100 tests.
  15763. 759.00 s [vector] scanr': OK (0.02s)
  15764. 759.00 s [vector] +++ OK, passed 100 tests.
  15765. 759.01 s [vector] scanr1: OK (0.02s)
  15766. 759.01 s [vector] +++ OK, passed 100 tests.
  15767. 759.01 s [vector] scanr1': OK (0.01s)
  15768. 759.01 s [vector] +++ OK, passed 100 tests.
  15769. 759.04 s [vector] iscanr: OK (0.01s)
  15770. 759.04 s [vector] +++ OK, passed 100 tests.
  15771. 759.05 s [vector] iscanr': OK (0.01s)
  15772. 759.05 s [vector] +++ OK, passed 100 tests.
  15773. 759.05 s [vector] mut_read: OK
  15774. 759.05 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15775. 759.05 s [vector] mut_write: OK
  15776. 759.05 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15777. 759.05 s [vector] mut_modify: OK
  15778. 759.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15779. 759.06 s [vector] mut_generate: OK
  15780. 759.06 s [vector] +++ OK, passed 100 tests.
  15781. 759.08 s [vector] mut_generateM: OK (0.01s)
  15782. 759.08 s [vector] +++ OK, passed 100 tests.
  15783. 759.13 s [vector] mut_mapM_: OK (0.07s)
  15784. 759.13 s [vector] +++ OK, passed 100 tests.
  15785. 759.20 s [vector] mut_imapM_: OK (0.04s)
  15786. 759.20 s [vector] +++ OK, passed 100 tests.
  15787. 759.28 s [vector] mut_forM_: OK (0.09s)
  15788. 759.28 s [vector] +++ OK, passed 100 tests.
  15789. 759.35 s [vector] mut_iforM_: OK (0.07s)
  15790. 759.35 s [vector] +++ OK, passed 100 tests.
  15791. 759.35 s [vector] mut_foldr: OK (0.01s)
  15792. 759.35 s [vector] +++ OK, passed 100 tests.
  15793. 759.37 s [vector] mut_foldr': OK
  15794. 759.37 s [vector] +++ OK, passed 100 tests.
  15795. 759.38 s [vector] mut_foldl: OK
  15796. 759.38 s [vector] +++ OK, passed 100 tests.
  15797. 759.40 s [vector] mut_foldl': OK (0.01s)
  15798. 759.40 s [vector] +++ OK, passed 100 tests.
  15799. 759.42 s [vector] mut_ifoldr: OK (0.01s)
  15800. 759.42 s [vector] +++ OK, passed 100 tests.
  15801. 759.43 s [vector] mut_ifoldr': OK (0.01s)
  15802. 759.43 s [vector] +++ OK, passed 100 tests.
  15803. 759.43 s [vector] mut_ifoldl: OK
  15804. 759.44 s [vector] +++ OK, passed 100 tests.
  15805. 759.45 s [vector] mut_ifoldl': OK (0.01s)
  15806. 759.46 s [vector] +++ OK, passed 100 tests.
  15807. 759.46 s [vector] mut_foldM: OK (0.01s)
  15808. 759.46 s [vector] +++ OK, passed 100 tests.
  15809. 759.47 s [vector] mut_foldM': OK
  15810. 759.47 s [vector] +++ OK, passed 100 tests.
  15811. 759.48 s [vector] mut_foldrM: OK
  15812. 759.48 s [vector] +++ OK, passed 100 tests.
  15813. 759.50 s [vector] mut_foldrM': OK (0.02s)
  15814. 759.50 s [vector] +++ OK, passed 100 tests.
  15815. 759.52 s [vector] mut_ifoldM: OK (0.02s)
  15816. 759.52 s [vector] +++ OK, passed 100 tests.
  15817. 759.54 s [vector] mut_ifoldM': OK (0.02s)
  15818. 759.54 s [vector] +++ OK, passed 100 tests.
  15819. 759.56 s [vector] mut_ifoldrM: OK
  15820. 759.56 s [vector] +++ OK, passed 100 tests.
  15821. 759.59 s [vector] mut_ifoldrM': OK
  15822. 759.59 s [vector] +++ OK, passed 100 tests.
  15823. 759.60 s [vector] compare: OK
  15824. 759.60 s [vector] +++ OK, passed 100 tests.
  15825. 759.60 s [vector] maximum: OK
  15826. 759.60 s [vector] +++ OK, passed 100 tests; 23 discarded.
  15827. 759.60 s [vector] minimum: OK
  15828. 759.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15829. 759.60 s [vector] minIndex: OK
  15830. 759.60 s [vector] +++ OK, passed 100 tests; 23 discarded.
  15831. 759.60 s [vector] maxIndex: OK
  15832. 759.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15833. 759.61 s [vector] maximumBy: OK
  15834. 759.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15835. 759.61 s [vector] minimumBy: OK
  15836. 759.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15837. 759.61 s [vector] maximumOn: OK
  15838. 759.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15839. 759.61 s [vector] minimumOn: OK
  15840. 759.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15841. 759.61 s [vector] maxIndexBy: OK
  15842. 759.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15843. 759.61 s [vector] minIndexBy: OK
  15844. 759.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15845. 759.62 s [vector] ListFirstMaxIndexWins: OK
  15846. 759.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15847. 759.62 s [vector] FalseListFirstMaxIndexWins: OK
  15848. 759.62 s [vector] +++ OK, failed as expected. (after 1 test):
  15849. 759.62 s [vector] Exception:
  15850. 759.62 s [vector] Prelude.foldr1: empty list
  15851. 759.62 s [vector] CallStack (from HasCallStack):
  15852. 759.62 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  15853. 759.62 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  15854. 759.62 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15855. 759.62 s [vector] []
  15856. 759.62 s [vector] zip: OK
  15857. 759.62 s [vector] +++ OK, passed 100 tests.
  15858. 759.62 s [vector] zip3: OK
  15859. 759.63 s [vector] +++ OK, passed 100 tests.
  15860. 759.63 s [vector] unzip: OK
  15861. 759.63 s [vector] +++ OK, passed 100 tests.
  15862. 759.63 s [vector] unzip3: OK
  15863. 759.63 s [vector] +++ OK, passed 100 tests.
  15864. 759.64 s [vector] indexed: OK
  15865. 759.64 s [vector] +++ OK, passed 100 tests.
  15866. 759.64 s [vector] update: OK
  15867. 759.64 s [vector] +++ OK, passed 100 tests.
  15868. 759.64 s [vector] mempty: OK
  15869. 759.64 s [vector] +++ OK, passed 100 tests.
  15870. 759.64 s [vector] mappend: OK
  15871. 759.64 s [vector] +++ OK, passed 100 tests.
  15872. 759.67 s [vector] mconcat: OK (0.03s)
  15873. 759.68 s [vector] +++ OK, passed 100 tests.
  15874. 759.68 s [vector] glength: OK
  15875. 759.68 s [vector] +++ OK, passed 100 tests.
  15876. 759.68 s [vector] sum: OK
  15877. 759.68 s [vector] +++ OK, passed 100 tests.
  15878. 759.68 s [vector] product: OK
  15879. 759.68 s [vector] +++ OK, passed 100 tests.
  15880. 759.68 s [vector] enumFromN: OK
  15881. 759.68 s [vector] +++ OK, passed 100 tests.
  15882. 759.68 s [vector] enumFromThenN: OK
  15883. 759.68 s [vector] +++ OK, passed 100 tests.
  15884. 759.68 s [vector] enumFromTo: OK
  15885. 759.68 s [vector] +++ OK, passed 100 tests.
  15886. 759.68 s [vector] enumFromThenTo: OK
  15887. 759.68 s [vector] +++ OK, passed 100 tests; 3 discarded.
  15888. 759.68 s [vector] (Double)
  15889. 759.68 s [vector] fromList.toList == id: OK
  15890. 759.68 s [vector] +++ OK, passed 100 tests.
  15891. 759.68 s [vector] toList.fromList == id: OK
  15892. 759.68 s [vector] +++ OK, passed 100 tests.
  15893. 759.68 s [vector] unstream.stream == id: OK
  15894. 759.68 s [vector] +++ OK, passed 100 tests.
  15895. 759.69 s [vector] stream.unstream == id: OK
  15896. 759.69 s [vector] +++ OK, passed 100 tests.
  15897. 759.69 s [vector] eq: OK
  15898. 759.69 s [vector] +++ OK, passed 100 tests.
  15899. 759.69 s [vector] length: OK
  15900. 759.69 s [vector] +++ OK, passed 100 tests.
  15901. 759.69 s [vector] null: OK
  15902. 759.69 s [vector] +++ OK, passed 100 tests.
  15903. 759.69 s [vector] index: OK
  15904. 759.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15905. 759.69 s [vector] safeIndex: OK
  15906. 759.69 s [vector] +++ OK, passed 100 tests.
  15907. 759.69 s [vector] head: OK
  15908. 759.69 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15909. 759.69 s [vector] last: OK
  15910. 759.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15911. 759.70 s [vector] unsafeIndex: OK
  15912. 759.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15913. 759.70 s [vector] unsafeHead: OK
  15914. 759.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15915. 759.70 s [vector] unsafeLast: OK
  15916. 759.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15917. 759.70 s [vector] slice: OK
  15918. 759.70 s [vector] +++ OK, passed 100 tests.
  15919. 759.71 s [vector] init: OK
  15920. 759.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15921. 759.71 s [vector] tail: OK
  15922. 759.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15923. 759.71 s [vector] take: OK
  15924. 759.71 s [vector] +++ OK, passed 100 tests.
  15925. 759.71 s [vector] drop: OK
  15926. 759.71 s [vector] +++ OK, passed 100 tests.
  15927. 759.71 s [vector] splitAt: OK
  15928. 759.71 s [vector] +++ OK, passed 100 tests.
  15929. 759.71 s [vector] empty: OK
  15930. 759.71 s [vector] +++ OK, passed 100 tests.
  15931. 759.72 s [vector] singleton: OK
  15932. 759.72 s [vector] +++ OK, passed 100 tests.
  15933. 759.72 s [vector] replicate: OK
  15934. 759.72 s [vector] +++ OK, passed 100 tests.
  15935. 759.72 s [vector] generate: OK
  15936. 759.72 s [vector] +++ OK, passed 100 tests.
  15937. 759.75 s [vector] iterateN: OK
  15938. 759.76 s [vector] +++ OK, passed 100 tests.
  15939. 759.82 s [vector] iterateNM: OK (0.08s)
  15940. 759.82 s [vector] +++ OK, passed 100 tests.
  15941. 759.86 s [vector] generateM: OK (0.05s)
  15942. 759.86 s [vector] +++ OK, passed 100 tests.
  15943. 759.88 s [vector] replicateM: OK (0.03s)
  15944. 759.88 s [vector] +++ OK, passed 100 tests.
  15945. 759.89 s [vector] create: OK
  15946. 759.89 s [vector] +++ OK, passed 100 tests.
  15947. 759.89 s [vector] createT: OK
  15948. 759.89 s [vector] +++ OK, passed 100 tests.
  15949. 759.89 s [vector] unfoldr: OK
  15950. 759.89 s [vector] +++ OK, passed 100 tests.
  15951. 759.89 s [vector] unfoldrN: OK
  15952. 759.90 s [vector] +++ OK, passed 100 tests.
  15953. 759.90 s [vector] unfoldrExactN: OK
  15954. 759.90 s [vector] +++ OK, passed 100 tests.
  15955. 759.91 s [vector] unfoldrM: OK (0.01s)
  15956. 759.91 s [vector] +++ OK, passed 100 tests.
  15957. 759.94 s [vector] unfoldrNM: OK
  15958. 759.94 s [vector] +++ OK, passed 100 tests.
  15959. 760.00 s [vector] unfoldrExactNM: OK (0.08s)
  15960. 760.00 s [vector] +++ OK, passed 100 tests.
  15961. 760.04 s [vector] constructN: OK (0.04s)
  15962. 760.04 s [vector] +++ OK, passed 100 tests.
  15963. 760.07 s [vector] constructrN: OK (0.03s)
  15964. 760.07 s [vector] +++ OK, passed 100 tests.
  15965. 760.07 s [vector] cons: OK
  15966. 760.07 s [vector] +++ OK, passed 100 tests.
  15967. 760.08 s [vector] snoc: OK
  15968. 760.08 s [vector] +++ OK, passed 100 tests.
  15969. 760.08 s [vector] append: OK
  15970. 760.08 s [vector] +++ OK, passed 100 tests.
  15971. 760.14 s [vector] concat: OK (0.05s)
  15972. 760.14 s [vector] +++ OK, passed 100 tests.
  15973. 760.14 s [vector] force: OK
  15974. 760.14 s [vector] +++ OK, passed 100 tests.
  15975. 760.15 s [vector] upd: OK
  15976. 760.15 s [vector] +++ OK, passed 100 tests.
  15977. 760.18 s [vector] accum: OK (0.02s)
  15978. 760.18 s [vector] +++ OK, passed 100 tests.
  15979. 760.19 s [vector] reverse: OK
  15980. 760.19 s [vector] +++ OK, passed 100 tests.
  15981. 760.19 s [vector] backpermute: OK
  15982. 760.19 s [vector] +++ OK, passed 100 tests.
  15983. 760.21 s [vector] map: OK
  15984. 760.21 s [vector] +++ OK, passed 100 tests.
  15985. 760.24 s [vector] imap: OK
  15986. 760.24 s [vector] +++ OK, passed 100 tests.
  15987. 760.26 s [vector] concatMap: OK (0.02s)
  15988. 760.26 s [vector] +++ OK, passed 100 tests.
  15989. 760.28 s [vector] mapM: OK (0.02s)
  15990. 760.28 s [vector] +++ OK, passed 100 tests.
  15991. 760.32 s [vector] mapM_: OK (0.05s)
  15992. 760.32 s [vector] +++ OK, passed 100 tests.
  15993. 760.33 s [vector] forM: OK (0.01s)
  15994. 760.33 s [vector] +++ OK, passed 100 tests.
  15995. 760.38 s [vector] forM_: OK (0.03s)
  15996. 760.38 s [vector] +++ OK, passed 100 tests.
  15997. 760.40 s [vector] imapM: OK (0.02s)
  15998. 760.40 s [vector] +++ OK, passed 100 tests.
  15999. 760.46 s [vector] imapM_: OK (0.06s)
  16000. 760.46 s [vector] +++ OK, passed 100 tests.
  16001. 760.48 s [vector] zipWith: OK (0.02s)
  16002. 760.48 s [vector] +++ OK, passed 100 tests.
  16003. 760.52 s [vector] zipWith3: OK (0.02s)
  16004. 760.52 s [vector] +++ OK, passed 100 tests.
  16005. 760.52 s [vector] izipWith: OK (0.02s)
  16006. 760.52 s [vector] +++ OK, passed 100 tests.
  16007. 760.56 s [vector] izipWith3: OK
  16008. 760.56 s [vector] +++ OK, passed 100 tests.
  16009. 760.56 s [vector] izipWithM: OK (0.02s)
  16010. 760.56 s [vector] +++ OK, passed 100 tests.
  16011. 760.60 s [vector] izipWithM_: OK (0.04s)
  16012. 760.60 s [vector] +++ OK, passed 100 tests.
  16013. 760.61 s [vector] zipWithM: OK (0.01s)
  16014. 760.61 s [vector] +++ OK, passed 100 tests.
  16015. 760.65 s [vector] zipWithM_: OK (0.03s)
  16016. 760.65 s [vector] +++ OK, passed 100 tests.
  16017. 760.68 s [vector] filter: OK
  16018. 760.68 s [vector] +++ OK, passed 100 tests.
  16019. 760.68 s [vector] ifilter: OK (0.01s)
  16020. 760.68 s [vector] +++ OK, passed 100 tests.
  16021. 760.74 s [vector] filterM: OK (0.06s)
  16022. 760.74 s [vector] +++ OK, passed 100 tests.
  16023. 760.75 s [vector] uniq: OK
  16024. 760.76 s [vector] +++ OK, passed 100 tests.
  16025. 760.76 s [vector] mapMaybe: OK
  16026. 760.76 s [vector] +++ OK, passed 100 tests.
  16027. 760.76 s [vector] imapMaybe: OK (0.01s)
  16028. 760.76 s [vector] +++ OK, passed 100 tests.
  16029. 760.76 s [vector] takeWhile: OK
  16030. 760.76 s [vector] +++ OK, passed 100 tests.
  16031. 760.77 s [vector] dropWhile: OK
  16032. 760.78 s [vector] +++ OK, passed 100 tests.
  16033. 760.78 s [vector] partition: OK
  16034. 760.79 s [vector] +++ OK, passed 100 tests.
  16035. 760.79 s [vector] partitionWith: OK (0.01s)
  16036. 760.79 s [vector] +++ OK, passed 100 tests.
  16037. 760.79 s [vector] span: OK
  16038. 760.79 s [vector] +++ OK, passed 100 tests.
  16039. 760.79 s [vector] break: OK
  16040. 760.79 s [vector] +++ OK, passed 100 tests.
  16041. 760.79 s [vector] spanR: OK
  16042. 760.79 s [vector] +++ OK, passed 100 tests.
  16043. 760.79 s [vector] breakR: OK
  16044. 760.79 s [vector] +++ OK, passed 100 tests.
  16045. 760.81 s [vector] groupBy: OK
  16046. 760.81 s [vector] +++ OK, passed 100 tests.
  16047. 760.81 s [vector] elem: OK
  16048. 760.81 s [vector] +++ OK, passed 100 tests.
  16049. 760.81 s [vector] notElem: OK
  16050. 760.81 s [vector] +++ OK, passed 100 tests.
  16051. 760.81 s [vector] find: OK
  16052. 760.81 s [vector] +++ OK, passed 100 tests.
  16053. 760.82 s [vector] findIndex: OK
  16054. 760.82 s [vector] +++ OK, passed 100 tests.
  16055. 760.82 s [vector] findIndexR: OK
  16056. 760.82 s [vector] +++ OK, passed 100 tests.
  16057. 760.84 s [vector] findIndices: OK (0.02s)
  16058. 760.84 s [vector] +++ OK, passed 100 tests.
  16059. 760.84 s [vector] elemIndex: OK
  16060. 760.84 s [vector] +++ OK, passed 100 tests.
  16061. 760.84 s [vector] elemIndices: OK
  16062. 760.84 s [vector] +++ OK, passed 100 tests.
  16063. 760.88 s [vector] foldl: OK (0.02s)
  16064. 760.88 s [vector] +++ OK, passed 100 tests.
  16065. 760.88 s [vector] foldl1: OK (0.02s)
  16066. 760.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16067. 760.92 s [vector] foldl': OK
  16068. 760.92 s [vector] +++ OK, passed 100 tests.
  16069. 760.94 s [vector] foldl1': OK (0.02s)
  16070. 760.94 s [vector] +++ OK, passed 100 tests; 11 discarded.
  16071. 760.94 s [vector] foldr: OK (0.02s)
  16072. 760.94 s [vector] +++ OK, passed 100 tests.
  16073. 760.96 s [vector] foldr1: OK (0.01s)
  16074. 760.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16075. 760.97 s [vector] foldr': OK (0.02s)
  16076. 760.97 s [vector] +++ OK, passed 100 tests.
  16077. 760.99 s [vector] foldr1': OK
  16078. 760.99 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16079. 761.03 s [vector] ifoldl: OK (0.02s)
  16080. 761.03 s [vector] +++ OK, passed 100 tests.
  16081. 761.03 s [vector] ifoldl': OK (0.02s)
  16082. 761.03 s [vector] +++ OK, passed 100 tests.
  16083. 761.06 s [vector] ifoldr: OK (0.02s)
  16084. 761.06 s [vector] +++ OK, passed 100 tests.
  16085. 761.10 s [vector] ifoldr': OK (0.03s)
  16086. 761.10 s [vector] +++ OK, passed 100 tests.
  16087. 761.12 s [vector] ifoldM: OK (0.02s)
  16088. 761.12 s [vector] +++ OK, passed 100 tests.
  16089. 761.15 s [vector] ifoldM': OK (0.02s)
  16090. 761.15 s [vector] +++ OK, passed 100 tests.
  16091. 761.19 s [vector] ifoldM_: OK (0.06s)
  16092. 761.19 s [vector] +++ OK, passed 100 tests.
  16093. 761.23 s [vector] ifoldM'_: OK (0.03s)
  16094. 761.23 s [vector] +++ OK, passed 100 tests.
  16095. 761.23 s [vector] all: OK
  16096. 761.23 s [vector] +++ OK, passed 100 tests.
  16097. 761.24 s [vector] any: OK
  16098. 761.24 s [vector] +++ OK, passed 100 tests.
  16099. 761.26 s [vector] prescanl: OK (0.01s)
  16100. 761.26 s [vector] +++ OK, passed 100 tests.
  16101. 761.27 s [vector] prescanl': OK (0.02s)
  16102. 761.27 s [vector] +++ OK, passed 100 tests.
  16103. 761.30 s [vector] postscanl: OK (0.02s)
  16104. 761.30 s [vector] +++ OK, passed 100 tests.
  16105. 761.34 s [vector] postscanl': OK (0.03s)
  16106. 761.34 s [vector] +++ OK, passed 100 tests.
  16107. 761.36 s [vector] scanl: OK (0.02s)
  16108. 761.36 s [vector] +++ OK, passed 100 tests.
  16109. 761.40 s [vector] scanl': OK (0.04s)
  16110. 761.40 s [vector] +++ OK, passed 100 tests.
  16111. 761.42 s [vector] scanl1: OK (0.02s)
  16112. 761.42 s [vector] +++ OK, passed 100 tests.
  16113. 761.44 s [vector] scanl1': OK (0.02s)
  16114. 761.44 s [vector] +++ OK, passed 100 tests.
  16115. 761.45 s [vector] iscanl: OK (0.02s)
  16116. 761.45 s [vector] +++ OK, passed 100 tests.
  16117. 761.48 s [vector] iscanl': OK (0.01s)
  16118. 761.48 s [vector] +++ OK, passed 100 tests.
  16119. 761.49 s [vector] prescanr: OK (0.02s)
  16120. 761.49 s [vector] +++ OK, passed 100 tests.
  16121. 761.51 s [vector] prescanr': OK (0.01s)
  16122. 761.51 s [vector] +++ OK, passed 100 tests.
  16123. 761.54 s [vector] postscanr: OK
  16124. 761.55 s [vector] +++ OK, passed 100 tests.
  16125. 761.56 s [vector] postscanr': OK (0.02s)
  16126. 761.56 s [vector] +++ OK, passed 100 tests.
  16127. 761.60 s [vector] scanr: OK (0.03s)
  16128. 761.60 s [vector] +++ OK, passed 100 tests.
  16129. 761.63 s [vector] scanr': OK (0.02s)
  16130. 761.63 s [vector] +++ OK, passed 100 tests.
  16131. 761.64 s [vector] scanr1: OK (0.02s)
  16132. 761.64 s [vector] +++ OK, passed 100 tests.
  16133. 761.66 s [vector] scanr1': OK (0.02s)
  16134. 761.66 s [vector] +++ OK, passed 100 tests.
  16135. 761.68 s [vector] iscanr: OK (0.02s)
  16136. 761.68 s [vector] +++ OK, passed 100 tests.
  16137. 761.69 s [vector] iscanr': OK (0.02s)
  16138. 761.70 s [vector] +++ OK, passed 100 tests.
  16139. 761.70 s [vector] mut_read: OK
  16140. 761.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16141. 761.70 s [vector] mut_write: OK
  16142. 761.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16143. 761.70 s [vector] mut_modify: OK
  16144. 761.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16145. 761.72 s [vector] mut_generate: OK
  16146. 761.72 s [vector] +++ OK, passed 100 tests.
  16147. 761.72 s [vector] mut_generateM: OK (0.02s)
  16148. 761.72 s [vector] +++ OK, passed 100 tests.
  16149. 761.76 s [vector] mut_mapM_: OK (0.02s)
  16150. 761.76 s [vector] +++ OK, passed 100 tests.
  16151. 761.82 s [vector] mut_imapM_: OK (0.03s)
  16152. 761.82 s [vector] +++ OK, passed 100 tests.
  16153. 761.86 s [vector] mut_forM_: OK (0.04s)
  16154. 761.86 s [vector] +++ OK, passed 100 tests.
  16155. 761.89 s [vector] mut_iforM_: OK (0.04s)
  16156. 761.89 s [vector] +++ OK, passed 100 tests.
  16157. 761.92 s [vector] mut_foldr: OK
  16158. 761.92 s [vector] +++ OK, passed 100 tests.
  16159. 761.93 s [vector] mut_foldr': OK (0.03s)
  16160. 761.93 s [vector] +++ OK, passed 100 tests.
  16161. 761.96 s [vector] mut_foldl: OK
  16162. 761.96 s [vector] +++ OK, passed 100 tests.
  16163. 761.97 s [vector] mut_foldl': OK (0.02s)
  16164. 761.97 s [vector] +++ OK, passed 100 tests.
  16165. 761.99 s [vector] mut_ifoldr: OK
  16166. 761.99 s [vector] +++ OK, passed 100 tests.
  16167. 762.02 s [vector] mut_ifoldr': OK (0.01s)
  16168. 762.02 s [vector] +++ OK, passed 100 tests.
  16169. 762.04 s [vector] mut_ifoldl: OK (0.03s)
  16170. 762.04 s [vector] +++ OK, passed 100 tests.
  16171. 762.08 s [vector] mut_ifoldl': OK (0.03s)
  16172. 762.08 s [vector] +++ OK, passed 100 tests.
  16173. 762.10 s [vector] mut_foldM: OK (0.03s)
  16174. 762.10 s [vector] +++ OK, passed 100 tests.
  16175. 762.14 s [vector] mut_foldM': OK (0.03s)
  16176. 762.14 s [vector] +++ OK, passed 100 tests.
  16177. 762.16 s [vector] mut_foldrM: OK (0.02s)
  16178. 762.16 s [vector] +++ OK, passed 100 tests.
  16179. 762.18 s [vector] mut_foldrM': OK (0.02s)
  16180. 762.18 s [vector] +++ OK, passed 100 tests.
  16181. 762.20 s [vector] mut_ifoldM: OK (0.02s)
  16182. 762.20 s [vector] +++ OK, passed 100 tests.
  16183. 762.22 s [vector] mut_ifoldM': OK (0.02s)
  16184. 762.22 s [vector] +++ OK, passed 100 tests.
  16185. 762.24 s [vector] mut_ifoldrM: OK (0.02s)
  16186. 762.24 s [vector] +++ OK, passed 100 tests.
  16187. 762.24 s [vector] mut_ifoldrM': OK (0.02s)
  16188. 762.24 s [vector] +++ OK, passed 100 tests.
  16189. 762.24 s [vector] compare: OK
  16190. 762.24 s [vector] +++ OK, passed 100 tests.
  16191. 762.24 s [vector] maximum: OK
  16192. 762.24 s [vector] +++ OK, passed 100 tests; 22 discarded.
  16193. 762.25 s [vector] minimum: OK
  16194. 762.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16195. 762.25 s [vector] minIndex: OK
  16196. 762.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16197. 762.25 s [vector] maxIndex: OK
  16198. 762.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16199. 762.25 s [vector] maximumBy: OK
  16200. 762.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16201. 762.25 s [vector] minimumBy: OK
  16202. 762.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16203. 762.25 s [vector] maximumOn: OK
  16204. 762.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16205. 762.25 s [vector] minimumOn: OK
  16206. 762.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16207. 762.25 s [vector] maxIndexBy: OK
  16208. 762.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16209. 762.25 s [vector] minIndexBy: OK
  16210. 762.25 s [vector] +++ OK, passed 100 tests; 11 discarded.
  16211. 762.25 s [vector] ListFirstMaxIndexWins: OK
  16212. 762.25 s [vector] +++ OK, passed 100 tests; 20 discarded.
  16213. 762.25 s [vector] FalseListFirstMaxIndexWins: OK
  16214. 762.25 s [vector] +++ OK, failed as expected. (after 1 test):
  16215. 762.25 s [vector] Exception:
  16216. 762.25 s [vector] Prelude.foldr1: empty list
  16217. 762.25 s [vector] CallStack (from HasCallStack):
  16218. 762.26 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  16219. 762.26 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  16220. 762.26 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  16221. 762.26 s [vector] []
  16222. 762.26 s [vector] zip: OK
  16223. 762.26 s [vector] +++ OK, passed 100 tests.
  16224. 762.26 s [vector] zip3: OK
  16225. 762.26 s [vector] +++ OK, passed 100 tests.
  16226. 762.26 s [vector] unzip: OK
  16227. 762.26 s [vector] +++ OK, passed 100 tests.
  16228. 762.26 s [vector] unzip3: OK
  16229. 762.26 s [vector] +++ OK, passed 100 tests.
  16230. 762.26 s [vector] indexed: OK
  16231. 762.26 s [vector] +++ OK, passed 100 tests.
  16232. 762.27 s [vector] update: OK
  16233. 762.28 s [vector] +++ OK, passed 100 tests.
  16234. 762.28 s [vector] mempty: OK
  16235. 762.28 s [vector] +++ OK, passed 100 tests.
  16236. 762.28 s [vector] mappend: OK
  16237. 762.28 s [vector] +++ OK, passed 100 tests.
  16238. 762.29 s [vector] mconcat: OK (0.02s)
  16239. 762.29 s [vector] +++ OK, passed 100 tests.
  16240. 762.29 s [vector] glength: OK
  16241. 762.29 s [vector] +++ OK, passed 100 tests.
  16242. 762.29 s [vector] sum: OK
  16243. 762.29 s [vector] +++ OK, passed 100 tests.
  16244. 762.29 s [vector] product: OK
  16245. 762.29 s [vector] +++ OK, passed 100 tests.
  16246. 762.29 s [vector] enumFromN: OK
  16247. 762.29 s [vector] +++ OK, passed 100 tests.
  16248. 762.29 s [vector] enumFromThenN: OK
  16249. 762.29 s [vector] +++ OK, passed 100 tests.
  16250. 762.29 s [vector] enumFromTo: OK
  16251. 762.29 s [vector] +++ OK, passed 100 tests.
  16252. 762.29 s [vector] enumFromThenTo: OK
  16253. 762.29 s [vector] +++ OK, passed 100 tests; 7 discarded.
  16254. 762.29 s [vector] (Int,Bool)
  16255. 762.30 s [vector] fromList.toList == id: OK
  16256. 762.30 s [vector] +++ OK, passed 100 tests.
  16257. 762.30 s [vector] toList.fromList == id: OK
  16258. 762.30 s [vector] +++ OK, passed 100 tests.
  16259. 762.30 s [vector] unstream.stream == id: OK
  16260. 762.30 s [vector] +++ OK, passed 100 tests.
  16261. 762.30 s [vector] stream.unstream == id: OK
  16262. 762.30 s [vector] +++ OK, passed 100 tests.
  16263. 762.30 s [vector] eq: OK
  16264. 762.30 s [vector] +++ OK, passed 100 tests.
  16265. 762.30 s [vector] length: OK
  16266. 762.30 s [vector] +++ OK, passed 100 tests.
  16267. 762.30 s [vector] null: OK
  16268. 762.30 s [vector] +++ OK, passed 100 tests.
  16269. 762.30 s [vector] index: OK
  16270. 762.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16271. 762.30 s [vector] safeIndex: OK
  16272. 762.30 s [vector] +++ OK, passed 100 tests.
  16273. 762.30 s [vector] head: OK
  16274. 762.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16275. 762.30 s [vector] last: OK
  16276. 762.30 s [vector] +++ OK, passed 100 tests; 11 discarded.
  16277. 762.30 s [vector] unsafeIndex: OK
  16278. 762.30 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16279. 762.30 s [vector] unsafeHead: OK
  16280. 762.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16281. 762.31 s [vector] unsafeLast: OK
  16282. 762.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16283. 762.31 s [vector] slice: OK
  16284. 762.31 s [vector] +++ OK, passed 100 tests.
  16285. 762.32 s [vector] init: OK
  16286. 762.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16287. 762.32 s [vector] tail: OK
  16288. 762.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16289. 762.32 s [vector] take: OK
  16290. 762.32 s [vector] +++ OK, passed 100 tests.
  16291. 762.32 s [vector] drop: OK
  16292. 762.32 s [vector] +++ OK, passed 100 tests.
  16293. 762.32 s [vector] splitAt: OK
  16294. 762.32 s [vector] +++ OK, passed 100 tests.
  16295. 762.32 s [vector] empty: OK
  16296. 762.32 s [vector] +++ OK, passed 100 tests.
  16297. 762.32 s [vector] singleton: OK
  16298. 762.32 s [vector] +++ OK, passed 100 tests.
  16299. 762.33 s [vector] replicate: OK
  16300. 762.33 s [vector] +++ OK, passed 100 tests.
  16301. 762.33 s [vector] generate: OK
  16302. 762.33 s [vector] +++ OK, passed 100 tests.
  16303. 762.34 s [vector] iterateN: OK
  16304. 762.34 s [vector] +++ OK, passed 100 tests.
  16305. 762.36 s [vector] iterateNM: OK (0.02s)
  16306. 762.36 s [vector] +++ OK, passed 100 tests.
  16307. 762.40 s [vector] generateM: OK (0.04s)
  16308. 762.40 s [vector] +++ OK, passed 100 tests.
  16309. 762.41 s [vector] replicateM: OK (0.02s)
  16310. 762.41 s [vector] +++ OK, passed 100 tests.
  16311. 762.41 s [vector] create: OK
  16312. 762.41 s [vector] +++ OK, passed 100 tests.
  16313. 762.41 s [vector] createT: OK
  16314. 762.41 s [vector] +++ OK, passed 100 tests.
  16315. 762.41 s [vector] unfoldr: OK
  16316. 762.41 s [vector] +++ OK, passed 100 tests.
  16317. 762.41 s [vector] unfoldrN: OK
  16318. 762.42 s [vector] +++ OK, passed 100 tests.
  16319. 762.42 s [vector] unfoldrExactN: OK
  16320. 762.42 s [vector] +++ OK, passed 100 tests.
  16321. 762.42 s [vector] unfoldrM: OK
  16322. 762.42 s [vector] +++ OK, passed 100 tests.
  16323. 762.42 s [vector] unfoldrNM: OK
  16324. 762.42 s [vector] +++ OK, passed 100 tests.
  16325. 762.50 s [vector] unfoldrExactNM: OK (0.08s)
  16326. 762.50 s [vector] +++ OK, passed 100 tests.
  16327. 762.50 s [vector] constructN: OK
  16328. 762.50 s [vector] +++ OK, passed 100 tests.
  16329. 762.51 s [vector] constructrN: OK
  16330. 762.51 s [vector] +++ OK, passed 100 tests.
  16331. 762.51 s [vector] cons: OK
  16332. 762.51 s [vector] +++ OK, passed 100 tests.
  16333. 762.51 s [vector] snoc: OK
  16334. 762.51 s [vector] +++ OK, passed 100 tests.
  16335. 762.52 s [vector] append: OK
  16336. 762.52 s [vector] +++ OK, passed 100 tests.
  16337. 762.55 s [vector] concat: OK (0.03s)
  16338. 762.55 s [vector] +++ OK, passed 100 tests.
  16339. 762.55 s [vector] force: OK
  16340. 762.55 s [vector] +++ OK, passed 100 tests.
  16341. 762.55 s [vector] upd: OK
  16342. 762.55 s [vector] +++ OK, passed 100 tests.
  16343. 762.56 s [vector] accum: OK
  16344. 762.56 s [vector] +++ OK, passed 100 tests.
  16345. 762.56 s [vector] reverse: OK
  16346. 762.57 s [vector] +++ OK, passed 100 tests.
  16347. 762.57 s [vector] backpermute: OK
  16348. 762.57 s [vector] +++ OK, passed 100 tests.
  16349. 762.57 s [vector] map: OK
  16350. 762.57 s [vector] +++ OK, passed 100 tests.
  16351. 762.57 s [vector] imap: OK
  16352. 762.57 s [vector] +++ OK, passed 100 tests.
  16353. 762.58 s [vector] concatMap: OK
  16354. 762.58 s [vector] +++ OK, passed 100 tests.
  16355. 762.60 s [vector] mapM: OK
  16356. 762.60 s [vector] +++ OK, passed 100 tests.
  16357. 762.62 s [vector] mapM_: OK (0.04s)
  16358. 762.62 s [vector] +++ OK, passed 100 tests.
  16359. 762.62 s [vector] forM: OK
  16360. 762.62 s [vector] +++ OK, passed 100 tests.
  16361. 762.66 s [vector] forM_: OK (0.03s)
  16362. 762.66 s [vector] +++ OK, passed 100 tests.
  16363. 762.66 s [vector] imapM: OK
  16364. 762.66 s [vector] +++ OK, passed 100 tests.
  16365. 762.71 s [vector] imapM_: OK (0.05s)
  16366. 762.71 s [vector] +++ OK, passed 100 tests.
  16367. 762.72 s [vector] zipWith: OK
  16368. 762.72 s [vector] +++ OK, passed 100 tests.
  16369. 762.73 s [vector] zipWith3: OK
  16370. 762.73 s [vector] +++ OK, passed 100 tests.
  16371. 762.74 s [vector] izipWith: OK
  16372. 762.74 s [vector] +++ OK, passed 100 tests.
  16373. 762.75 s [vector] izipWith3: OK (0.01s)
  16374. 762.75 s [vector] +++ OK, passed 100 tests.
  16375. 762.76 s [vector] izipWithM: OK
  16376. 762.76 s [vector] +++ OK, passed 100 tests.
  16377. 762.78 s [vector] izipWithM_: OK (0.02s)
  16378. 762.78 s [vector] +++ OK, passed 100 tests.
  16379. 762.78 s [vector] zipWithM: OK
  16380. 762.78 s [vector] +++ OK, passed 100 tests.
  16381. 762.81 s [vector] zipWithM_: OK (0.03s)
  16382. 762.81 s [vector] +++ OK, passed 100 tests.
  16383. 762.81 s [vector] filter: OK
  16384. 762.81 s [vector] +++ OK, passed 100 tests.
  16385. 762.82 s [vector] ifilter: OK
  16386. 762.82 s [vector] +++ OK, passed 100 tests.
  16387. 762.88 s [vector] filterM: OK (0.06s)
  16388. 762.88 s [vector] +++ OK, passed 100 tests.
  16389. 762.89 s [vector] uniq: OK (0.01s)
  16390. 762.89 s [vector] +++ OK, passed 100 tests.
  16391. 762.90 s [vector] mapMaybe: OK
  16392. 762.90 s [vector] +++ OK, passed 100 tests.
  16393. 762.90 s [vector] imapMaybe: OK
  16394. 762.90 s [vector] +++ OK, passed 100 tests.
  16395. 762.91 s [vector] takeWhile: OK
  16396. 762.91 s [vector] +++ OK, passed 100 tests.
  16397. 762.91 s [vector] dropWhile: OK
  16398. 762.91 s [vector] +++ OK, passed 100 tests.
  16399. 762.91 s [vector] partition: OK
  16400. 762.91 s [vector] +++ OK, passed 100 tests.
  16401. 762.92 s [vector] partitionWith: OK
  16402. 762.92 s [vector] +++ OK, passed 100 tests.
  16403. 762.92 s [vector] span: OK
  16404. 762.92 s [vector] +++ OK, passed 100 tests.
  16405. 762.93 s [vector] break: OK
  16406. 762.93 s [vector] +++ OK, passed 100 tests.
  16407. 762.93 s [vector] spanR: OK
  16408. 762.93 s [vector] +++ OK, passed 100 tests.
  16409. 762.94 s [vector] breakR: OK
  16410. 762.94 s [vector] +++ OK, passed 100 tests.
  16411. 762.94 s [vector] groupBy: OK
  16412. 762.94 s [vector] +++ OK, passed 100 tests.
  16413. 762.94 s [vector] elem: OK
  16414. 762.94 s [vector] +++ OK, passed 100 tests.
  16415. 762.94 s [vector] notElem: OK
  16416. 762.94 s [vector] +++ OK, passed 100 tests.
  16417. 762.94 s [vector] find: OK
  16418. 762.94 s [vector] +++ OK, passed 100 tests.
  16419. 762.94 s [vector] findIndex: OK
  16420. 762.94 s [vector] +++ OK, passed 100 tests.
  16421. 762.94 s [vector] findIndexR: OK
  16422. 762.94 s [vector] +++ OK, passed 100 tests.
  16423. 762.95 s [vector] findIndices: OK
  16424. 762.95 s [vector] +++ OK, passed 100 tests.
  16425. 762.95 s [vector] elemIndex: OK
  16426. 762.95 s [vector] +++ OK, passed 100 tests.
  16427. 762.95 s [vector] elemIndices: OK
  16428. 762.95 s [vector] +++ OK, passed 100 tests.
  16429. 762.96 s [vector] foldl: OK
  16430. 762.96 s [vector] +++ OK, passed 100 tests.
  16431. 762.97 s [vector] foldl1: OK
  16432. 762.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16433. 762.98 s [vector] foldl': OK
  16434. 762.98 s [vector] +++ OK, passed 100 tests.
  16435. 762.98 s [vector] foldl1': OK
  16436. 762.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16437. 762.98 s [vector] foldr: OK
  16438. 762.98 s [vector] +++ OK, passed 100 tests.
  16439. 762.98 s [vector] foldr1: OK
  16440. 762.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16441. 762.99 s [vector] foldr': OK
  16442. 762.99 s [vector] +++ OK, passed 100 tests.
  16443. 762.99 s [vector] foldr1': OK
  16444. 762.99 s [vector] +++ OK, passed 100 tests; 20 discarded.
  16445. 762.99 s [vector] ifoldl: OK
  16446. 762.99 s [vector] +++ OK, passed 100 tests.
  16447. 763.00 s [vector] ifoldl': OK
  16448. 763.00 s [vector] +++ OK, passed 100 tests.
  16449. 763.00 s [vector] ifoldr: OK
  16450. 763.00 s [vector] +++ OK, passed 100 tests.
  16451. 763.01 s [vector] ifoldr': OK
  16452. 763.01 s [vector] +++ OK, passed 100 tests.
  16453. 763.01 s [vector] ifoldM: OK
  16454. 763.01 s [vector] +++ OK, passed 100 tests.
  16455. 763.02 s [vector] ifoldM': OK
  16456. 763.02 s [vector] +++ OK, passed 100 tests.
  16457. 763.06 s [vector] ifoldM_: OK (0.03s)
  16458. 763.06 s [vector] +++ OK, passed 100 tests.
  16459. 763.08 s [vector] ifoldM'_: OK (0.03s)
  16460. 763.08 s [vector] +++ OK, passed 100 tests.
  16461. 763.08 s [vector] all: OK
  16462. 763.08 s [vector] +++ OK, passed 100 tests.
  16463. 763.08 s [vector] any: OK
  16464. 763.08 s [vector] +++ OK, passed 100 tests.
  16465. 763.08 s [vector] prescanl: OK
  16466. 763.09 s [vector] +++ OK, passed 100 tests.
  16467. 763.09 s [vector] prescanl': OK
  16468. 763.09 s [vector] +++ OK, passed 100 tests.
  16469. 763.09 s [vector] postscanl: OK
  16470. 763.09 s [vector] +++ OK, passed 100 tests.
  16471. 763.09 s [vector] postscanl': OK
  16472. 763.09 s [vector] +++ OK, passed 100 tests.
  16473. 763.10 s [vector] scanl: OK
  16474. 763.10 s [vector] +++ OK, passed 100 tests.
  16475. 763.10 s [vector] scanl': OK
  16476. 763.10 s [vector] +++ OK, passed 100 tests.
  16477. 763.11 s [vector] scanl1: OK
  16478. 763.11 s [vector] +++ OK, passed 100 tests.
  16479. 763.12 s [vector] scanl1': OK
  16480. 763.12 s [vector] +++ OK, passed 100 tests.
  16481. 763.13 s [vector] iscanl: OK
  16482. 763.13 s [vector] +++ OK, passed 100 tests.
  16483. 763.13 s [vector] iscanl': OK
  16484. 763.13 s [vector] +++ OK, passed 100 tests.
  16485. 763.13 s [vector] prescanr: OK
  16486. 763.13 s [vector] +++ OK, passed 100 tests.
  16487. 763.14 s [vector] prescanr': OK
  16488. 763.43 s [vector] +++ OK, passed 100 tests.
  16489. 763.43 s [vector] postscanr: OK
  16490. 763.43 s [vector] +++ OK, passed 100 tests.
  16491. 763.43 s [vector] postscanr': OK
  16492. 763.43 s [vector] +++ OK, passed 100 tests.
  16493. 763.43 s [vector] scanr: OK
  16494. 763.43 s [vector] +++ OK, passed 100 tests.
  16495. 763.43 s [vector] scanr': OK
  16496. 763.43 s [vector] +++ OK, passed 100 tests.
  16497. 763.43 s [vector] scanr1: OK
  16498. 763.43 s [vector] +++ OK, passed 100 tests.
  16499. 763.43 s [vector] scanr1': OK
  16500. 763.43 s [vector] +++ OK, passed 100 tests.
  16501. 763.43 s [vector] iscanr: OK
  16502. 763.43 s [vector] +++ OK, passed 100 tests.
  16503. 763.43 s [vector] iscanr': OK
  16504. 763.43 s [vector] +++ OK, passed 100 tests.
  16505. 763.43 s [vector] mut_read: OK
  16506. 763.43 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16507. 763.43 s [vector] mut_write: OK
  16508. 763.43 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16509. 763.43 s [vector] mut_modify: OK
  16510. 763.43 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16511. 763.43 s [vector] mut_generate: OK
  16512. 763.43 s [vector] +++ OK, passed 100 tests.
  16513. 763.43 s [vector] mut_generateM: OK (0.01s)
  16514. 763.43 s [vector] +++ OK, passed 100 tests.
  16515. 763.43 s [vector] mut_mapM_: OK (0.03s)
  16516. 763.43 s [vector] +++ OK, passed 100 tests.
  16517. 763.43 s [vector] mut_imapM_: OK (0.02s)
  16518. 763.44 s [vector] +++ OK, passed 100 tests.
  16519. 763.44 s [vector] mut_forM_: OK
  16520. 763.44 s [vector] +++ OK, passed 100 tests.
  16521. 763.44 s [vector] mut_iforM_: OK (0.03s)
  16522. 763.44 s [vector] +++ OK, passed 100 tests.
  16523. 763.44 s [vector] mut_foldr: OK
  16524. 763.44 s [vector] +++ OK, passed 100 tests.
  16525. 763.44 s [vector] mut_foldr': OK
  16526. 763.44 s [vector] +++ OK, passed 100 tests.
  16527. 763.44 s [vector] mut_foldl: OK
  16528. 763.44 s [vector] +++ OK, passed 100 tests.
  16529. 763.44 s [vector] mut_foldl': OK
  16530. 763.44 s [vector] +++ OK, passed 100 tests.
  16531. 763.44 s [vector] mut_ifoldr: OK
  16532. 763.44 s [vector] +++ OK, passed 100 tests.
  16533. 763.44 s [vector] mut_ifoldr': OK
  16534. 763.44 s [vector] +++ OK, passed 100 tests.
  16535. 763.44 s [vector] mut_ifoldl: OK
  16536. 763.44 s [vector] +++ OK, passed 100 tests.
  16537. 763.44 s [vector] mut_ifoldl': OK
  16538. 763.44 s [vector] +++ OK, passed 100 tests.
  16539. 763.44 s [vector] mut_foldM: OK
  16540. 763.44 s [vector] +++ OK, passed 100 tests.
  16541. 763.44 s [vector] mut_foldM': OK
  16542. 763.44 s [vector] +++ OK, passed 100 tests.
  16543. 763.44 s [vector] mut_foldrM: OK
  16544. 763.44 s [vector] +++ OK, passed 100 tests.
  16545. 763.44 s [vector] mut_foldrM': OK
  16546. 763.44 s [vector] +++ OK, passed 100 tests.
  16547. 763.44 s [vector] mut_ifoldM: OK
  16548. 763.44 s [vector] +++ OK, passed 100 tests.
  16549. 763.44 s [vector] mut_ifoldM': OK
  16550. 763.44 s [vector] +++ OK, passed 100 tests.
  16551. 763.44 s [vector] mut_ifoldrM: OK
  16552. 763.44 s [vector] +++ OK, passed 100 tests.
  16553. 763.44 s [vector] mut_ifoldrM': OK
  16554. 763.44 s [vector] +++ OK, passed 100 tests.
  16555. 763.44 s [vector] compare: OK
  16556. 763.44 s [vector] +++ OK, passed 100 tests.
  16557. 763.44 s [vector] maximum: OK
  16558. 763.44 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16559. 763.44 s [vector] minimum: OK
  16560. 763.44 s [vector] +++ OK, passed 100 tests; 22 discarded.
  16561. 763.44 s [vector] minIndex: OK
  16562. 763.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16563. 763.44 s [vector] maxIndex: OK
  16564. 763.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16565. 763.44 s [vector] maximumBy: OK
  16566. 763.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16567. 763.44 s [vector] minimumBy: OK
  16568. 763.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16569. 763.44 s [vector] maximumOn: OK
  16570. 763.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16571. 763.44 s [vector] minimumOn: OK
  16572. 763.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16573. 763.44 s [vector] maxIndexBy: OK
  16574. 763.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16575. 763.44 s [vector] minIndexBy: OK
  16576. 763.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16577. 763.44 s [vector] ListFirstMaxIndexWins: OK
  16578. 763.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16579. 763.44 s [vector] FalseListFirstMaxIndexWins: OK
  16580. 763.44 s [vector] +++ OK, failed as expected. (after 1 test):
  16581. 763.44 s [vector] Exception:
  16582. 763.44 s [vector] Prelude.foldr1: empty list
  16583. 763.44 s [vector] CallStack (from HasCallStack):
  16584. 763.44 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  16585. 763.44 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  16586. 763.44 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  16587. 763.44 s [vector] []
  16588. 763.44 s [vector] zip: OK
  16589. 763.44 s [vector] +++ OK, passed 100 tests.
  16590. 763.44 s [vector] zip3: OK
  16591. 763.44 s [vector] +++ OK, passed 100 tests.
  16592. 763.44 s [vector] unzip: OK
  16593. 763.44 s [vector] +++ OK, passed 100 tests.
  16594. 763.44 s [vector] unzip3: OK
  16595. 763.44 s [vector] +++ OK, passed 100 tests.
  16596. 763.44 s [vector] indexed: OK
  16597. 763.44 s [vector] +++ OK, passed 100 tests.
  16598. 763.44 s [vector] update: OK
  16599. 763.44 s [vector] +++ OK, passed 100 tests.
  16600. 763.44 s [vector] mempty: OK
  16601. 763.44 s [vector] +++ OK, passed 100 tests.
  16602. 763.44 s [vector] mappend: OK
  16603. 763.44 s [vector] +++ OK, passed 100 tests.
  16604. 763.44 s [vector] mconcat: OK (0.02s)
  16605. 763.44 s [vector] +++ OK, passed 100 tests.
  16606. 763.44 s [vector] glength: OK
  16607. 763.44 s [vector] +++ OK, passed 100 tests.
  16608. 763.44 s [vector] (Int,Bool,Int)
  16609. 763.44 s [vector] fromList.toList == id: OK
  16610. 763.44 s [vector] +++ OK, passed 100 tests.
  16611. 763.44 s [vector] toList.fromList == id: OK
  16612. 763.44 s [vector] +++ OK, passed 100 tests.
  16613. 763.44 s [vector] unstream.stream == id: OK
  16614. 763.44 s [vector] +++ OK, passed 100 tests.
  16615. 763.44 s [vector] stream.unstream == id: OK
  16616. 763.44 s [vector] +++ OK, passed 100 tests.
  16617. 763.44 s [vector] eq: OK
  16618. 763.44 s [vector] +++ OK, passed 100 tests.
  16619. 763.44 s [vector] length: OK
  16620. 763.44 s [vector] +++ OK, passed 100 tests.
  16621. 763.44 s [vector] null: OK
  16622. 763.44 s [vector] +++ OK, passed 100 tests.
  16623. 763.44 s [vector] index: OK
  16624. 763.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16625. 763.44 s [vector] safeIndex: OK
  16626. 763.44 s [vector] +++ OK, passed 100 tests.
  16627. 763.44 s [vector] head: OK
  16628. 763.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16629. 763.44 s [vector] last: OK
  16630. 763.44 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16631. 763.44 s [vector] unsafeIndex: OK
  16632. 763.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16633. 763.44 s [vector] unsafeHead: OK
  16634. 763.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16635. 763.44 s [vector] unsafeLast: OK
  16636. 763.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16637. 763.44 s [vector] slice: OK
  16638. 763.44 s [vector] +++ OK, passed 100 tests.
  16639. 763.44 s [vector] init: OK
  16640. 763.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16641. 763.44 s [vector] tail: OK
  16642. 763.44 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16643. 763.44 s [vector] take: OK
  16644. 763.44 s [vector] +++ OK, passed 100 tests.
  16645. 763.44 s [vector] drop: OK
  16646. 763.44 s [vector] +++ OK, passed 100 tests.
  16647. 763.44 s [vector] splitAt: OK
  16648. 763.44 s [vector] +++ OK, passed 100 tests.
  16649. 763.44 s [vector] empty: OK
  16650. 763.44 s [vector] +++ OK, passed 100 tests.
  16651. 763.44 s [vector] singleton: OK
  16652. 763.44 s [vector] +++ OK, passed 100 tests.
  16653. 763.44 s [vector] replicate: OK
  16654. 763.44 s [vector] +++ OK, passed 100 tests.
  16655. 763.45 s [vector] generate: OK
  16656. 763.45 s [vector] +++ OK, passed 100 tests.
  16657. 763.46 s [vector] iterateN: OK
  16658. 763.46 s [vector] +++ OK, passed 100 tests.
  16659. 763.48 s [vector] iterateNM: OK (0.03s)
  16660. 763.48 s [vector] +++ OK, passed 100 tests.
  16661. 763.51 s [vector] generateM: OK (0.02s)
  16662. 763.51 s [vector] +++ OK, passed 100 tests.
  16663. 763.51 s [vector] replicateM: OK
  16664. 763.51 s [vector] +++ OK, passed 100 tests.
  16665. 763.52 s [vector] create: OK
  16666. 763.52 s [vector] +++ OK, passed 100 tests.
  16667. 763.52 s [vector] createT: OK
  16668. 763.52 s [vector] +++ OK, passed 100 tests.
  16669. 763.52 s [vector] unfoldr: OK
  16670. 763.52 s [vector] +++ OK, passed 100 tests.
  16671. 763.52 s [vector] unfoldrN: OK
  16672. 763.52 s [vector] +++ OK, passed 100 tests.
  16673. 763.53 s [vector] unfoldrExactN: OK
  16674. 763.53 s [vector] +++ OK, passed 100 tests.
  16675. 763.54 s [vector] unfoldrM: OK
  16676. 763.54 s [vector] +++ OK, passed 100 tests.
  16677. 763.54 s [vector] unfoldrNM: OK
  16678. 763.54 s [vector] +++ OK, passed 100 tests.
  16679. 763.60 s [vector] unfoldrExactNM: OK (0.06s)
  16680. 763.60 s [vector] +++ OK, passed 100 tests.
  16681. 763.62 s [vector] constructN: OK (0.01s)
  16682. 763.62 s [vector] +++ OK, passed 100 tests.
  16683. 763.62 s [vector] constructrN: OK (0.01s)
  16684. 763.62 s [vector] +++ OK, passed 100 tests.
  16685. 763.63 s [vector] cons: OK
  16686. 763.63 s [vector] +++ OK, passed 100 tests.
  16687. 763.64 s [vector] snoc: OK
  16688. 763.64 s [vector] +++ OK, passed 100 tests.
  16689. 763.64 s [vector] append: OK
  16690. 763.65 s [vector] +++ OK, passed 100 tests.
  16691. 763.69 s [vector] concat: OK (0.06s)
  16692. 763.69 s [vector] +++ OK, passed 100 tests.
  16693. 763.69 s [vector] force: OK
  16694. 763.69 s [vector] +++ OK, passed 100 tests.
  16695. 763.69 s [vector] upd: OK
  16696. 763.69 s [vector] +++ OK, passed 100 tests.
  16697. 763.70 s [vector] accum: OK
  16698. 763.71 s [vector] +++ OK, passed 100 tests.
  16699. 763.73 s [vector] reverse: OK
  16700. 763.74 s [vector] +++ OK, passed 100 tests.
  16701. 763.74 s [vector] backpermute: OK
  16702. 763.74 s [vector] +++ OK, passed 100 tests.
  16703. 763.74 s [vector] map: OK
  16704. 763.74 s [vector] +++ OK, passed 100 tests.
  16705. 763.74 s [vector] imap: OK (0.01s)
  16706. 763.74 s [vector] +++ OK, passed 100 tests.
  16707. 763.74 s [vector] concatMap: OK (0.02s)
  16708. 763.75 s [vector] +++ OK, passed 100 tests.
  16709. 763.75 s [vector] mapM: OK (0.01s)
  16710. 763.75 s [vector] +++ OK, passed 100 tests.
  16711. 763.82 s [vector] mapM_: OK (0.06s)
  16712. 763.82 s [vector] +++ OK, passed 100 tests.
  16713. 763.84 s [vector] forM: OK
  16714. 763.84 s [vector] +++ OK, passed 100 tests.
  16715. 763.88 s [vector] forM_: OK (0.05s)
  16716. 763.88 s [vector] +++ OK, passed 100 tests.
  16717. 763.90 s [vector] imapM: OK
  16718. 763.90 s [vector] +++ OK, passed 100 tests.
  16719. 763.96 s [vector] imapM_: OK (0.06s)
  16720. 763.96 s [vector] +++ OK, passed 100 tests.
  16721. 763.96 s [vector] zipWith: OK
  16722. 763.96 s [vector] +++ OK, passed 100 tests.
  16723. 763.98 s [vector] zipWith3: OK (0.01s)
  16724. 763.98 s [vector] +++ OK, passed 100 tests.
  16725. 763.98 s [vector] izipWith: OK (0.01s)
  16726. 763.98 s [vector] +++ OK, passed 100 tests.
  16727. 764.00 s [vector] izipWith3: OK (0.01s)
  16728. 764.00 s [vector] +++ OK, passed 100 tests.
  16729. 764.00 s [vector] izipWithM: OK
  16730. 764.00 s [vector] +++ OK, passed 100 tests.
  16731. 764.05 s [vector] izipWithM_: OK (0.05s)
  16732. 764.05 s [vector] +++ OK, passed 100 tests.
  16733. 764.05 s [vector] zipWithM: OK
  16734. 764.05 s [vector] +++ OK, passed 100 tests.
  16735. 764.09 s [vector] zipWithM_: OK (0.03s)
  16736. 764.09 s [vector] +++ OK, passed 100 tests.
  16737. 764.09 s [vector] filter: OK
  16738. 764.09 s [vector] +++ OK, passed 100 tests.
  16739. 764.10 s [vector] ifilter: OK
  16740. 764.10 s [vector] +++ OK, passed 100 tests.
  16741. 764.18 s [vector] filterM: OK (0.07s)
  16742. 764.18 s [vector] +++ OK, passed 100 tests.
  16743. 764.18 s [vector] uniq: OK
  16744. 764.18 s [vector] +++ OK, passed 100 tests.
  16745. 764.18 s [vector] mapMaybe: OK
  16746. 764.18 s [vector] +++ OK, passed 100 tests.
  16747. 764.19 s [vector] imapMaybe: OK
  16748. 764.19 s [vector] +++ OK, passed 100 tests.
  16749. 764.19 s [vector] takeWhile: OK
  16750. 764.19 s [vector] +++ OK, passed 100 tests.
  16751. 764.20 s [vector] dropWhile: OK
  16752. 764.20 s [vector] +++ OK, passed 100 tests.
  16753. 764.20 s [vector] partition: OK
  16754. 764.20 s [vector] +++ OK, passed 100 tests.
  16755. 764.21 s [vector] partitionWith: OK
  16756. 764.21 s [vector] +++ OK, passed 100 tests.
  16757. 764.22 s [vector] span: OK
  16758. 764.22 s [vector] +++ OK, passed 100 tests.
  16759. 764.22 s [vector] break: OK
  16760. 764.22 s [vector] +++ OK, passed 100 tests.
  16761. 764.22 s [vector] spanR: OK
  16762. 764.22 s [vector] +++ OK, passed 100 tests.
  16763. 764.22 s [vector] breakR: OK
  16764. 764.22 s [vector] +++ OK, passed 100 tests.
  16765. 764.23 s [vector] groupBy: OK (0.01s)
  16766. 764.23 s [vector] +++ OK, passed 100 tests.
  16767. 764.24 s [vector] elem: OK
  16768. 764.24 s [vector] +++ OK, passed 100 tests.
  16769. 764.24 s [vector] notElem: OK
  16770. 764.24 s [vector] +++ OK, passed 100 tests.
  16771. 764.24 s [vector] find: OK
  16772. 764.24 s [vector] +++ OK, passed 100 tests.
  16773. 764.24 s [vector] findIndex: OK
  16774. 764.24 s [vector] +++ OK, passed 100 tests.
  16775. 764.24 s [vector] findIndexR: OK
  16776. 764.24 s [vector] +++ OK, passed 100 tests.
  16777. 764.25 s [vector] findIndices: OK
  16778. 764.25 s [vector] +++ OK, passed 100 tests.
  16779. 764.25 s [vector] elemIndex: OK
  16780. 764.25 s [vector] +++ OK, passed 100 tests.
  16781. 764.26 s [vector] elemIndices: OK
  16782. 764.26 s [vector] +++ OK, passed 100 tests.
  16783. 764.26 s [vector] foldl: OK
  16784. 764.26 s [vector] +++ OK, passed 100 tests.
  16785. 764.27 s [vector] foldl1: OK
  16786. 764.27 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16787. 764.27 s [vector] foldl': OK
  16788. 764.27 s [vector] +++ OK, passed 100 tests.
  16789. 764.28 s [vector] foldl1': OK
  16790. 764.28 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16791. 764.28 s [vector] foldr: OK
  16792. 764.29 s [vector] +++ OK, passed 100 tests.
  16793. 764.29 s [vector] foldr1: OK
  16794. 764.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16795. 764.31 s [vector] foldr': OK
  16796. 764.31 s [vector] +++ OK, passed 100 tests.
  16797. 764.32 s [vector] foldr1': OK
  16798. 764.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16799. 764.32 s [vector] ifoldl: OK
  16800. 764.32 s [vector] +++ OK, passed 100 tests.
  16801. 764.33 s [vector] ifoldl': OK (0.01s)
  16802. 764.33 s [vector] +++ OK, passed 100 tests.
  16803. 764.34 s [vector] ifoldr: OK
  16804. 764.34 s [vector] +++ OK, passed 100 tests.
  16805. 764.36 s [vector] ifoldr': OK (0.01s)
  16806. 764.36 s [vector] +++ OK, passed 100 tests.
  16807. 764.36 s [vector] ifoldM: OK
  16808. 764.36 s [vector] +++ OK, passed 100 tests.
  16809. 764.37 s [vector] ifoldM': OK
  16810. 764.38 s [vector] +++ OK, passed 100 tests.
  16811. 764.42 s [vector] ifoldM_: OK (0.05s)
  16812. 764.42 s [vector] +++ OK, passed 100 tests.
  16813. 764.46 s [vector] ifoldM'_: OK (0.02s)
  16814. 764.47 s [vector] +++ OK, passed 100 tests.
  16815. 764.47 s [vector] all: OK
  16816. 764.47 s [vector] +++ OK, passed 100 tests.
  16817. 764.47 s [vector] any: OK
  16818. 764.48 s [vector] +++ OK, passed 100 tests.
  16819. 764.48 s [vector] prescanl: OK
  16820. 764.48 s [vector] +++ OK, passed 100 tests.
  16821. 764.48 s [vector] prescanl': OK
  16822. 764.48 s [vector] +++ OK, passed 100 tests.
  16823. 764.49 s [vector] postscanl: OK
  16824. 764.51 s [vector] +++ OK, passed 100 tests.
  16825. 764.51 s [vector] postscanl': OK
  16826. 764.51 s [vector] +++ OK, passed 100 tests.
  16827. 764.51 s [vector] scanl: OK
  16828. 764.51 s [vector] +++ OK, passed 100 tests.
  16829. 764.51 s [vector] scanl': OK
  16830. 764.51 s [vector] +++ OK, passed 100 tests.
  16831. 764.51 s [vector] scanl1: OK
  16832. 764.51 s [vector] +++ OK, passed 100 tests.
  16833. 764.53 s [vector] scanl1': OK
  16834. 764.53 s [vector] +++ OK, passed 100 tests.
  16835. 764.54 s [vector] iscanl: OK
  16836. 764.54 s [vector] +++ OK, passed 100 tests.
  16837. 764.54 s [vector] iscanl': OK
  16838. 764.55 s [vector] +++ OK, passed 100 tests.
  16839. 764.55 s [vector] prescanr: OK
  16840. 764.55 s [vector] +++ OK, passed 100 tests.
  16841. 764.56 s [vector] prescanr': OK
  16842. 764.56 s [vector] +++ OK, passed 100 tests.
  16843. 764.57 s [vector] postscanr: OK
  16844. 764.57 s [vector] +++ OK, passed 100 tests.
  16845. 764.58 s [vector] postscanr': OK
  16846. 764.58 s [vector] +++ OK, passed 100 tests.
  16847. 764.58 s [vector] scanr: OK
  16848. 764.58 s [vector] +++ OK, passed 100 tests.
  16849. 764.60 s [vector] scanr': OK
  16850. 764.60 s [vector] +++ OK, passed 100 tests.
  16851. 764.60 s [vector] scanr1: OK
  16852. 764.60 s [vector] +++ OK, passed 100 tests.
  16853. 764.61 s [vector] scanr1': OK
  16854. 764.61 s [vector] +++ OK, passed 100 tests.
  16855. 764.61 s [vector] iscanr: OK
  16856. 764.61 s [vector] +++ OK, passed 100 tests.
  16857. 764.62 s [vector] iscanr': OK
  16858. 764.62 s [vector] +++ OK, passed 100 tests.
  16859. 764.62 s [vector] mut_read: OK
  16860. 764.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16861. 764.62 s [vector] mut_write: OK
  16862. 764.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16863. 764.63 s [vector] mut_modify: OK
  16864. 764.63 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16865. 764.64 s [vector] mut_generate: OK
  16866. 764.64 s [vector] +++ OK, passed 100 tests.
  16867. 764.65 s [vector] mut_generateM: OK (0.02s)
  16868. 764.65 s [vector] +++ OK, passed 100 tests.
  16869. 764.70 s [vector] mut_mapM_: OK (0.03s)
  16870. 764.70 s [vector] +++ OK, passed 100 tests.
  16871. 764.79 s [vector] mut_imapM_: OK (0.10s)
  16872. 764.79 s [vector] +++ OK, passed 100 tests.
  16873. 764.84 s [vector] mut_forM_: OK (0.03s)
  16874. 764.84 s [vector] +++ OK, passed 100 tests.
  16875. 764.88 s [vector] mut_iforM_: OK (0.04s)
  16876. 764.88 s [vector] +++ OK, passed 100 tests.
  16877. 764.88 s [vector] mut_foldr: OK
  16878. 764.88 s [vector] +++ OK, passed 100 tests.
  16879. 764.88 s [vector] mut_foldr': OK
  16880. 764.88 s [vector] +++ OK, passed 100 tests.
  16881. 764.90 s [vector] mut_foldl: OK
  16882. 764.90 s [vector] +++ OK, passed 100 tests.
  16883. 764.91 s [vector] mut_foldl': OK (0.01s)
  16884. 764.91 s [vector] +++ OK, passed 100 tests.
  16885. 764.92 s [vector] mut_ifoldr: OK
  16886. 764.92 s [vector] +++ OK, passed 100 tests.
  16887. 764.92 s [vector] mut_ifoldr': OK
  16888. 764.92 s [vector] +++ OK, passed 100 tests.
  16889. 764.93 s [vector] mut_ifoldl: OK
  16890. 764.93 s [vector] +++ OK, passed 100 tests.
  16891. 764.96 s [vector] mut_ifoldl': OK (0.02s)
  16892. 764.96 s [vector] +++ OK, passed 100 tests.
  16893. 764.96 s [vector] mut_foldM: OK (0.01s)
  16894. 764.96 s [vector] +++ OK, passed 100 tests.
  16895. 764.97 s [vector] mut_foldM': OK
  16896. 764.98 s [vector] +++ OK, passed 100 tests.
  16897. 764.98 s [vector] mut_foldrM: OK (0.01s)
  16898. 764.98 s [vector] +++ OK, passed 100 tests.
  16899. 765.00 s [vector] mut_foldrM': OK
  16900. 765.00 s [vector] +++ OK, passed 100 tests.
  16901. 765.00 s [vector] mut_ifoldM: OK (0.01s)
  16902. 765.00 s [vector] +++ OK, passed 100 tests.
  16903. 765.01 s [vector] mut_ifoldM': OK (0.01s)
  16904. 765.01 s [vector] +++ OK, passed 100 tests.
  16905. 765.02 s [vector] mut_ifoldrM: OK
  16906. 765.02 s [vector] +++ OK, passed 100 tests.
  16907. 765.03 s [vector] mut_ifoldrM': OK
  16908. 765.03 s [vector] +++ OK, passed 100 tests.
  16909. 765.03 s [vector] compare: OK
  16910. 765.03 s [vector] +++ OK, passed 100 tests.
  16911. 765.03 s [vector] maximum: OK
  16912. 765.03 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16913. 765.04 s [vector] minimum: OK
  16914. 765.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16915. 765.04 s [vector] minIndex: OK
  16916. 765.04 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16917. 765.04 s [vector] maxIndex: OK
  16918. 765.04 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16919. 765.04 s [vector] maximumBy: OK
  16920. 765.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16921. 765.05 s [vector] minimumBy: OK
  16922. 765.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16923. 765.05 s [vector] maximumOn: OK
  16924. 765.05 s [vector] +++ OK, passed 100 tests; 22 discarded.
  16925. 765.05 s [vector] minimumOn: OK
  16926. 765.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16927. 765.05 s [vector] maxIndexBy: OK
  16928. 765.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16929. 765.05 s [vector] minIndexBy: OK
  16930. 765.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16931. 765.06 s [vector] ListFirstMaxIndexWins: OK
  16932. 765.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16933. 765.06 s [vector] FalseListFirstMaxIndexWins: OK
  16934. 765.06 s [vector] +++ OK, failed as expected. (after 1 test):
  16935. 765.06 s [vector] Exception:
  16936. 765.06 s [vector] Prelude.foldr1: empty list
  16937. 765.06 s [vector] CallStack (from HasCallStack):
  16938. 765.06 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  16939. 765.06 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  16940. 765.06 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  16941. 765.06 s [vector] []
  16942. 765.06 s [vector] zip: OK
  16943. 765.06 s [vector] +++ OK, passed 100 tests.
  16944. 765.06 s [vector] zip3: OK
  16945. 765.07 s [vector] +++ OK, passed 100 tests.
  16946. 765.07 s [vector] unzip: OK
  16947. 765.07 s [vector] +++ OK, passed 100 tests.
  16948. 765.07 s [vector] unzip3: OK
  16949. 765.07 s [vector] +++ OK, passed 100 tests.
  16950. 765.07 s [vector] indexed: OK
  16951. 765.07 s [vector] +++ OK, passed 100 tests.
  16952. 765.07 s [vector] update: OK
  16953. 765.07 s [vector] +++ OK, passed 100 tests.
  16954. 765.07 s [vector] mempty: OK
  16955. 765.07 s [vector] +++ OK, passed 100 tests.
  16956. 765.08 s [vector] mappend: OK
  16957. 765.08 s [vector] +++ OK, passed 100 tests.
  16958. 765.10 s [vector] mconcat: OK (0.02s)
  16959. 765.10 s [vector] +++ OK, passed 100 tests.
  16960. 765.10 s [vector] glength: OK
  16961. 765.10 s [vector] +++ OK, passed 100 tests.
  16962. 765.10 s [vector] unstream
  16963. 765.10 s [vector] unstream == vunstream (exact): OK
  16964. 765.10 s [vector] +++ OK, passed 100 tests.
  16965. 765.10 s [vector] unstream == vunstream (unknown): OK
  16966. 765.10 s [vector] +++ OK, passed 100 tests.
  16967. 765.10 s [vector] unstreamR ~= vunstream (exact): OK
  16968. 765.10 s [vector] +++ OK, passed 100 tests.
  16969. 765.10 s [vector] unstreamR ~= vunstream (unknown): OK
  16970. 765.10 s [vector] +++ OK, passed 100 tests.
  16971. 765.10 s [vector] Data.Vector.Storable.Vector Alignment
  16972. 765.10 s [vector] Aligned Double: OK
  16973. 765.10 s [vector] Aligned Int: OK
  16974. 765.10 s [vector] Regression tests
  16975. 765.10 s [vector] enumFromTo crash #188
  16976. 765.10 s [vector] Word8: OK
  16977. 765.10 s [vector] Word16: OK
  16978. 765.10 s [vector] Word32: OK
  16979. 765.10 s [vector] Word64: OK
  16980. 765.10 s [vector] Word: OK
  16981. 765.10 s [vector] Int8: OK
  16982. 765.10 s [vector] Int16: OK
  16983. 765.10 s [vector] Int32: OK
  16984. 765.10 s [vector] Int64: OK
  16985. 765.11 s [vector] Int: OK
  16986. 765.11 s [vector] Char: OK
  16987. 765.11 s [vector] Negative tests
  16988. 765.11 s [vector] slice out of bounds #257
  16989. 765.11 s [vector] Boxed
  16990. 765.11 s [vector] Negative ix: OK
  16991. 765.11 s [vector] Negative size: OK
  16992. 765.11 s [vector] Negative ix and size: OK
  16993. 765.11 s [vector] Too large ix: OK
  16994. 765.11 s [vector] Too large size: OK
  16995. 765.11 s [vector] Too large ix and size: OK
  16996. 765.11 s [vector] Overflow: OK
  16997. 765.11 s [vector] OutOfMemory: OK
  16998. 765.11 s [vector] Primitive
  16999. 765.11 s [vector] Negative ix: OK
  17000. 765.11 s [vector] Negative size: OK
  17001. 765.11 s [vector] Negative ix and size: OK
  17002. 765.11 s [vector] Too large ix: OK
  17003. 765.11 s [vector] Too large size: OK
  17004. 765.11 s [vector] Too large ix and size: OK
  17005. 765.11 s [vector] Overflow: OK
  17006. 765.11 s [vector] OutOfMemory: OK
  17007. 765.11 s [vector] Storable
  17008. 765.11 s [vector] Negative ix: OK
  17009. 765.11 s [vector] Negative size: OK
  17010. 765.11 s [vector] Negative ix and size: OK
  17011. 765.11 s [vector] Too large ix: OK
  17012. 765.11 s [vector] Too large size: OK
  17013. 765.11 s [vector] Too large ix and size: OK
  17014. 765.11 s [vector] Overflow: OK
  17015. 765.11 s [vector] OutOfMemory: OK
  17016. 765.11 s [vector] Unboxed
  17017. 765.11 s [vector] Negative ix: OK
  17018. 765.11 s [vector] Negative size: OK
  17019. 765.11 s [vector] Negative ix and size: OK
  17020. 765.11 s [vector] Too large ix: OK
  17021. 765.11 s [vector] Too large size: OK
  17022. 765.11 s [vector] Too large ix and size: OK
  17023. 765.11 s [vector] Overflow: OK
  17024. 765.11 s [vector] OutOfMemory: OK
  17025. 765.11 s [vector] take #282
  17026. 765.11 s [vector] Boxed: OK
  17027. 765.11 s [vector] Primitive: OK
  17028. 765.11 s [vector] Storable: OK
  17029. 765.11 s [vector] Unboxed: OK
  17030. 765.11 s [vector] Data.Vector
  17031. 765.11 s [vector] MonadFix: OK
  17032. 765.11 s [vector] toFromArray: OK
  17033. 765.11 s [vector] toFromArraySlice: OK
  17034. 765.11 s [vector] toFromArraySliceUnsafe: OK
  17035. 765.11 s [vector] toFromMutableArray: OK
  17036. 765.11 s [vector] Data.Vector.Mutable (Move): OK
  17037. 765.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  17038. 765.11 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  17039. 765.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  17040. 765.11 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  17041. 765.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  17042. 765.11 s [vector] Data.Vector.Storable.Mutable (Move): OK
  17043. 765.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  17044. 765.12 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  17045. 765.12 s [vector] +++ OK, passed 100 tests.
  17046. 765.13 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  17047. 765.13 s [vector] +++ OK, passed 100 tests.
  17048. 765.13 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  17049. 765.13 s [vector] +++ OK, passed 100 tests.
  17050. 765.13 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  17051. 765.13 s [vector] +++ OK, passed 100 tests.
  17052. 765.13 s [vector]
  17053. 765.13 s [vector] All 2808 tests passed (16.31s)
  17054. 765.15 s [vector] Test suite vector-tests-O2: PASS
  17055. 765.15 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  17056. 765.15 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  17057. 765.16 s [vector] checkPhase completed in 33 seconds
  17058. 765.16 s [vector] Phase: haddockPhase
  17059. 765.17 s [vector] Phase: installPhase
  17060. 765.30 s [vector] Installing library in /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  17061. 766.40 s [vector] Installing internal library benchmarks-O2 in /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2
  17062. 766.89 s [vector] Phase: fixupPhase
  17063. 766.91 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0
  17064. 766.93 s [vector] shrinking /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSvector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf-ghc9.4.8.so
  17065. 766.97 s [vector] shrinking /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSvector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2-ghc9.4.8.so
  17066. 766.98 s [vector] checking for references to /build/ in /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0...
  17067. 767.03 s [vector] patching script interpreter paths in /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0
  17068. 767.04 s [vector] stripping (with command strip and flags -S -p) in /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/lib
  17069. 768.43 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0
  17070. 769.20 s [vector:post-build] Pushing 1 paths (64 are already present) using zstd to cache sellout ⏳
  17071. 769.20 s [vector:post-build]
  17072. 769.56 s [vector:post-build] Pushing /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0 (59.30 MiB)
  17073. 771.48 s [vector:post-build]
  17074. 771.48 s [vector:post-build] All done.
  17075. 771.51 s [vector:post-build] Uploading to the NixCI cache: /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0
  17076. 771.58 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17077. 771.60 s [vector:post-build] copying 1 paths...
  17078. 771.60 s [vector:post-build] copying path '/nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  17079. 788.35 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17080. 788.61 s [vector:post-build] copying 1 paths...
  17081. 788.61 s [vector:post-build] copying path '/nix/store/vk0hh2yldk3zdscmvxi5ni5fz9wvb06q-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  17082. 788.84 s Progress: 27 of 43 built, 373 of 373 downloaded from cache
  17083. 788.90 s Building /nix/store/swjk3fv73r6jsz1dhp76g6r15z9862dv-nothunks-0.3.1.drv
  17084. 789.19 s [nothunks] Phase: setupCompilerEnvironmentPhase
  17085. 789.20 s [nothunks] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  17086. 789.50 s [nothunks] Phase: unpackPhase
  17087. 789.50 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  17088. 789.51 s [nothunks] source root is nothunks-0.3.1
  17089. 789.52 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  17090. 789.53 s [nothunks] Phase: patchPhase
  17091. 789.53 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  17092. 789.54 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  17093. 789.56 s [nothunks] Phase: compileBuildDriverPhase
  17094. 789.56 s [nothunks] setupCompileFlags: -package-db=/build/tmp.V9VC11IjMK/setup-package.conf.d -threaded
  17095. 789.62 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.V9VC11IjMK/Main.o )
  17096. 789.68 s [nothunks] [2 of 2] Linking Setup
  17097. 791.20 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  17098. 791.21 s [nothunks] Phase: configurePhase
  17099. 791.22 s [nothunks] configureFlags: --verbose --prefix=/nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.V9VC11IjMK/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  17100. 791.68 s [nothunks] Using Parsec parser
  17101. 791.68 s [nothunks] Configuring nothunks-0.3.1...
  17102. 791.68 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  17103. 791.68 s [nothunks] Dependency base: using base-4.17.2.1
  17104. 791.68 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.11.5.3
  17105. 791.68 s [nothunks] Dependency containers: using containers-0.6.7
  17106. 791.68 s [nothunks] Dependency ghc-heap: using ghc-heap-9.4.8
  17107. 791.68 s [nothunks] Dependency stm: using stm-2.5.1.0
  17108. 791.68 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.0.2
  17109. 791.68 s [nothunks] Dependency time: using time-1.12.2
  17110. 791.68 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  17111. 791.68 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  17112. 791.68 s [nothunks] Dependency base: using base-4.17.2.1
  17113. 791.68 s [nothunks] Dependency containers: using containers-0.6.7
  17114. 791.68 s [nothunks] Dependency ghc-prim: using ghc-prim-0.9.1
  17115. 791.68 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  17116. 791.68 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  17117. 791.68 s [nothunks] Dependency random: using random-1.2.1.3
  17118. 791.68 s [nothunks] Dependency stm: using stm-2.5.1.0
  17119. 791.68 s [nothunks] Dependency tasty: using tasty-1.5.3
  17120. 791.68 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  17121. 792.48 s [nothunks] Source component graph:
  17122. 792.48 s [nothunks] component lib
  17123. 792.48 s [nothunks] component test:nothunks-test dependency lib
  17124. 792.48 s [nothunks] Configured component graph:
  17125. 792.48 s [nothunks] component nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17126. 792.48 s [nothunks] include base-4.17.2.1
  17127. 792.48 s [nothunks] include bytestring-0.11.5.3
  17128. 792.48 s [nothunks] include containers-0.6.7
  17129. 792.48 s [nothunks] include ghc-heap-9.4.8
  17130. 792.48 s [nothunks] include stm-2.5.1.0
  17131. 792.48 s [nothunks] include text-2.0.2
  17132. 792.48 s [nothunks] include time-1.12.2
  17133. 792.48 s [nothunks] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  17134. 792.48 s [nothunks] include wherefrom-compat-0.1.1.1-Fap3ZmGHzdB3Wg273lxrCv
  17135. 792.48 s [nothunks] component nothunks-0.3.1-K9S0WIJxvqMEavxCiCjJ4h-nothunks-test
  17136. 792.48 s [nothunks] include base-4.17.2.1
  17137. 792.48 s [nothunks] include containers-0.6.7
  17138. 792.48 s [nothunks] include ghc-prim-0.9.1
  17139. 792.48 s [nothunks] include hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  17140. 792.48 s [nothunks] include nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17141. 792.48 s [nothunks] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  17142. 792.48 s [nothunks] include stm-2.5.1.0
  17143. 792.48 s [nothunks] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  17144. 792.48 s [nothunks] include tasty-hedgehog-1.4.0.2-BgX8W8M8oIwAdbpIwgsjQ3
  17145. 792.48 s [nothunks] Linked component graph:
  17146. 792.48 s [nothunks] unit nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17147. 792.48 s [nothunks] include base-4.17.2.1
  17148. 792.48 s [nothunks] include bytestring-0.11.5.3
  17149. 792.48 s [nothunks] include containers-0.6.7
  17150. 792.48 s [nothunks] include ghc-heap-9.4.8
  17151. 792.48 s [nothunks] include stm-2.5.1.0
  17152. 792.48 s [nothunks] include text-2.0.2
  17153. 792.48 s [nothunks] include time-1.12.2
  17154. 792.48 s [nothunks] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  17155. 792.48 s [nothunks] include wherefrom-compat-0.1.1.1-Fap3ZmGHzdB3Wg273lxrCv
  17156. 792.48 s [nothunks] NoThunks.Class=nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb:NoThunks.Class
  17157. 792.48 s [nothunks] unit nothunks-0.3.1-K9S0WIJxvqMEavxCiCjJ4h-nothunks-test
  17158. 792.48 s [nothunks] include base-4.17.2.1
  17159. 792.48 s [nothunks] include containers-0.6.7
  17160. 792.48 s [nothunks] include ghc-prim-0.9.1
  17161. 792.48 s [nothunks] include hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  17162. 792.48 s [nothunks] include nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17163. 792.48 s [nothunks] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  17164. 792.48 s [nothunks] include stm-2.5.1.0
  17165. 792.48 s [nothunks] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  17166. 792.48 s [nothunks] include tasty-hedgehog-1.4.0.2-BgX8W8M8oIwAdbpIwgsjQ3
  17167. 792.48 s [nothunks] Ready component graph:
  17168. 792.48 s [nothunks] definite nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17169. 792.48 s [nothunks] depends base-4.17.2.1
  17170. 792.48 s [nothunks] depends bytestring-0.11.5.3
  17171. 792.48 s [nothunks] depends containers-0.6.7
  17172. 792.48 s [nothunks] depends ghc-heap-9.4.8
  17173. 792.48 s [nothunks] depends stm-2.5.1.0
  17174. 792.48 s [nothunks] depends text-2.0.2
  17175. 792.48 s [nothunks] depends time-1.12.2
  17176. 792.48 s [nothunks] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  17177. 792.48 s [nothunks] depends wherefrom-compat-0.1.1.1-Fap3ZmGHzdB3Wg273lxrCv
  17178. 792.48 s [nothunks] definite nothunks-0.3.1-K9S0WIJxvqMEavxCiCjJ4h-nothunks-test
  17179. 792.48 s [nothunks] depends base-4.17.2.1
  17180. 792.48 s [nothunks] depends containers-0.6.7
  17181. 792.48 s [nothunks] depends ghc-prim-0.9.1
  17182. 792.48 s [nothunks] depends hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  17183. 792.48 s [nothunks] depends nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17184. 792.48 s [nothunks] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  17185. 792.48 s [nothunks] depends stm-2.5.1.0
  17186. 792.48 s [nothunks] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  17187. 792.48 s [nothunks] depends tasty-hedgehog-1.4.0.2-BgX8W8M8oIwAdbpIwgsjQ3
  17188. 792.48 s [nothunks] Using Cabal-3.8.1.0 compiled by ghc-9.4
  17189. 792.48 s [nothunks] Using compiler: ghc-9.4.8
  17190. 792.48 s [nothunks] Using install prefix:
  17191. 792.48 s [nothunks] /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1
  17192. 792.48 s [nothunks] Executables installed in:
  17193. 792.48 s [nothunks] /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/bin
  17194. 792.48 s [nothunks] Libraries installed in:
  17195. 792.48 s [nothunks] /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17196. 792.48 s [nothunks] Dynamic Libraries installed in:
  17197. 792.48 s [nothunks] /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  17198. 792.48 s [nothunks] Private executables installed in:
  17199. 792.48 s [nothunks] /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.4.8/nothunks-0.3.1
  17200. 792.48 s [nothunks] Data files installed in:
  17201. 792.48 s [nothunks] /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/share/x86_64-linux-ghc-9.4.8/nothunks-0.3.1
  17202. 792.48 s [nothunks] Documentation installed in:
  17203. 792.48 s [nothunks] /nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  17204. 792.48 s [nothunks] Configuration files installed in:
  17205. 792.48 s [nothunks] /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/etc
  17206. 792.48 s [nothunks] No alex found
  17207. 792.48 s [nothunks] Using ar found on system at:
  17208. 792.48 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  17209. 792.48 s [nothunks] No c2hs found
  17210. 792.48 s [nothunks] No cpphs found
  17211. 792.48 s [nothunks] No doctest found
  17212. 792.48 s [nothunks] Using gcc version 14.3.0 given by user at:
  17213. 792.48 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  17214. 792.48 s [nothunks] Using ghc version 9.4.8 found on system at:
  17215. 792.48 s [nothunks] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  17216. 792.48 s [nothunks] Using ghc-pkg version 9.4.8 found on system at:
  17217. 792.48 s [nothunks] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  17218. 792.48 s [nothunks] No ghcjs found
  17219. 792.48 s [nothunks] No ghcjs-pkg found
  17220. 792.48 s [nothunks] No greencard found
  17221. 792.48 s [nothunks] Using haddock version 2.27.0 found on system at:
  17222. 792.48 s [nothunks] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  17223. 792.48 s [nothunks] No happy found
  17224. 792.48 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  17225. 792.48 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  17226. 792.48 s [nothunks] No hmake found
  17227. 792.48 s [nothunks] Using hpc version 0.68 found on system at:
  17228. 792.48 s [nothunks] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  17229. 792.48 s [nothunks] Using hsc2hs version 0.68.8 found on system at:
  17230. 792.48 s [nothunks] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  17231. 792.48 s [nothunks] Using hscolour version 1.25 found on system at:
  17232. 792.48 s [nothunks] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  17233. 792.48 s [nothunks] No jhc found
  17234. 792.48 s [nothunks] Using ld found on system at:
  17235. 792.48 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  17236. 792.48 s [nothunks] No pkg-config found
  17237. 792.48 s [nothunks] Using runghc version 9.4.8 found on system at:
  17238. 792.48 s [nothunks] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  17239. 792.48 s [nothunks] Using strip version 2.44 found on system at:
  17240. 792.48 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  17241. 792.48 s [nothunks] Using tar found on system at:
  17242. 792.48 s [nothunks] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  17243. 792.48 s [nothunks] No uhc found
  17244. 792.49 s [nothunks] Phase: buildPhase
  17245. 792.55 s [nothunks] Preprocessing library for nothunks-0.3.1..
  17246. 792.55 s [nothunks] Building library for nothunks-0.3.1..
  17247. 792.65 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  17248. 795.52 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  17249. 799.67 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
  17250. 799.67 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1..
  17251. 799.77 s [nothunks] [1 of 2] Compiling Test.NoThunks.Class ( test/Test/NoThunks/Class.hs, dist/build/nothunks-test/nothunks-test-tmp/Test/NoThunks/Class.o )
  17252. 802.71 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  17253. 803.03 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  17254. 804.19 s [nothunks] Phase: checkPhase
  17255. 804.22 s [nothunks] Running 1 test suites...
  17256. 804.22 s [nothunks] Test suite nothunks-test: RUNNING...
  17257. 804.22 s [nothunks] Tests
  17258. 804.23 s [nothunks] NoThunks.Class
  17259. 804.23 s [nothunks] Sanity
  17260. 804.23 s [nothunks] IntNotNF: OK
  17261. 804.23 s [nothunks] ✓ <interactive> passed 1 test.
  17262. 804.23 s [nothunks] IntIsNF: OK
  17263. 804.23 s [nothunks] ✓ <interactive> passed 1 test.
  17264. 804.23 s [nothunks] Pair: OK
  17265. 804.23 s [nothunks] ✓ <interactive> passed 1 test.
  17266. 804.23 s [nothunks] Sum: OK
  17267. 804.23 s [nothunks] ✓ <interactive> passed 1 test.
  17268. 804.23 s [nothunks] Fn: OK
  17269. 804.23 s [nothunks] ✓ <interactive> passed 1 test.
  17270. 804.23 s [nothunks] IO: OK
  17271. 804.23 s [nothunks] ✓ <interactive> passed 1 test.
  17272. 804.23 s [nothunks] InspectHeap
  17273. 804.24 s [nothunks] Int: OK
  17274. 804.24 s [nothunks] ✓ <interactive> passed 1000 tests.
  17275. 804.24 s [nothunks] Just ["Int"] 49% █████████▋··········
  17276. 804.24 s [nothunks] Nothing 51% ██████████▎·········
  17277. 804.27 s [nothunks] IntInt: OK
  17278. 804.27 s [nothunks] ✓ <interactive> passed 1000 tests.
  17279. 804.27 s [nothunks] Just ["(,)"] 49% █████████▊··········
  17280. 804.27 s [nothunks] Just ["Int","(,)"] 39% ███████▊············
  17281. 804.27 s [nothunks] Nothing 12% ██▍·················
  17282. 804.28 s [nothunks] SumInt: OK (0.02s)
  17283. 804.28 s [nothunks] ✓ <interactive> passed 1000 tests.
  17284. 804.28 s [nothunks] Just ["Either"] 33% ██████▋·············
  17285. 804.28 s [nothunks] Just ["Int","Either"] 32% ██████▍·············
  17286. 804.28 s [nothunks] Nothing 34% ██████▉·············
  17287. 804.31 s [nothunks] ListInt: OK
  17288. 804.31 s [nothunks] ✓ <interactive> passed 1000 tests.
  17289. 804.31 s [nothunks] Just ["Int","[]"] 21% ████▏···············
  17290. 804.31 s [nothunks] Just ["[]"] 44% ████████▋···········
  17291. 804.31 s [nothunks] Nothing 35% ███████·············
  17292. 804.32 s [nothunks] IntListInt: OK (0.03s)
  17293. 804.32 s [nothunks] ✓ <interactive> passed 1000 tests.
  17294. 804.32 s [nothunks] Just ["(,)"] 52% ██████████▎·········
  17295. 804.32 s [nothunks] Just ["Int","(,)"] 22% ████▍···············
  17296. 804.32 s [nothunks] Just ["Int","[]","(,)"] 6% █▏··················
  17297. 804.32 s [nothunks] Just ["[]","(,)"] 12% ██▍·················
  17298. 804.32 s [nothunks] Nothing 8% █▌··················
  17299. 804.34 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  17300. 804.34 s [nothunks] after 19 tests and 1 shrink.
  17301. 804.34 s [nothunks] shrink path: 19:b
  17302. 804.34 s [nothunks] Just ["Int","Seq"] 47% █████████▍··········
  17303. 804.34 s [nothunks] Nothing 47% █████████▍··········
  17304. 804.34 s [nothunks]
  17305. 804.34 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  17306. 804.34 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  17307. 804.34 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  17308. 804.34 s [nothunks] 168 ┃ -> Proxy a
  17309. 804.34 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  17310. 804.34 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  17311. 804.34 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  17312. 804.34 s [nothunks] 172 ┃ -> Property
  17313. 804.34 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  17314. 804.34 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  17315. 804.34 s [nothunks] ┃ │ Wrap
  17316. 804.34 s [nothunks] ┃ │ { unwrap =
  17317. 804.34 s [nothunks] ┃ │ SeqEnqueue
  17318. 804.34 s [nothunks] ┃ │ (IntValue 0)
  17319. 804.34 s [nothunks] ┃ │ (SeqEnqueue
  17320. 804.34 s [nothunks] ┃ │ (IntValue 0)
  17321. 804.34 s [nothunks] ┃ │ (SeqEnqueue
  17322. 804.34 s [nothunks] ┃ │ (IntValue 0)
  17323. 804.34 s [nothunks] ┃ │ (SeqEnqueue
  17324. 804.34 s [nothunks] ┃ │ (IntValue 0)
  17325. 804.34 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  17326. 804.34 s [nothunks] ┃ │ }
  17327. 804.34 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  17328. 804.34 s [nothunks] 176 ┃ fromModel m $ \a -> do
  17329. 804.34 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  17330. 804.34 s [nothunks] ┃ │ IsNF
  17331. 804.34 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  17332. 804.34 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  17333. 804.34 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17334. 804.34 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  17335. 804.34 s [nothunks] ┃ │ - Just
  17336. 804.34 s [nothunks] ┃ │ - ThunkInfo
  17337. 804.34 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  17338. 804.34 s [nothunks] ┃ │ + Nothing
  17339. 804.34 s [nothunks]
  17340. 804.34 s [nothunks] This failure can be reproduced by running:
  17341. 804.34 s [nothunks] > recheckAt (Seed 7334935949347079267 13618250889999592489) "19:b" EXPECTED FAILURE
  17342. 804.34 s [nothunks]
  17343. 804.35 s [nothunks] OK (0.02s)
  17344. 804.35 s [nothunks] ✓ <interactive> passed 1 test.
  17345. 804.35 s [nothunks] Model
  17346. 804.35 s [nothunks] Int: OK (0.01s)
  17347. 804.35 s [nothunks] ✓ <interactive> passed 1000 tests.
  17348. 804.35 s [nothunks] Just ["Int"] 49% █████████▋··········
  17349. 804.35 s [nothunks] Nothing 51% ██████████▎·········
  17350. 804.37 s [nothunks] IntInt: OK (0.01s)
  17351. 804.37 s [nothunks] ✓ <interactive> passed 1000 tests.
  17352. 804.37 s [nothunks] Just ["(,)"] 48% █████████▋··········
  17353. 804.37 s [nothunks] Just ["Int","(,)"] 39% ███████▊············
  17354. 804.37 s [nothunks] Nothing 12% ██▍·················
  17355. 804.39 s [nothunks] SumInt: OK (0.01s)
  17356. 804.39 s [nothunks] ✓ <interactive> passed 1000 tests.
  17357. 804.39 s [nothunks] Just ["Either"] 35% ██████▉·············
  17358. 804.39 s [nothunks] Just ["Int","Either"] 34% ██████▋·············
  17359. 804.39 s [nothunks] Nothing 32% ██████▎·············
  17360. 804.42 s [nothunks] ListInt: OK (0.02s)
  17361. 804.42 s [nothunks] ✓ <interactive> passed 1000 tests.
  17362. 804.42 s [nothunks] Just ["Int","[]"] 22% ████▌···············
  17363. 804.42 s [nothunks] Just ["[]"] 43% ████████▌···········
  17364. 804.42 s [nothunks] Nothing 35% ██████▉·············
  17365. 804.42 s [nothunks] IntListInt: OK (0.02s)
  17366. 804.42 s [nothunks] ✓ <interactive> passed 1000 tests.
  17367. 804.42 s [nothunks] Just ["(,)"] 51% ██████████··········
  17368. 804.42 s [nothunks] Just ["Int","(,)"] 26% █████···············
  17369. 804.42 s [nothunks] Just ["Int","[]","(,)"] 6% █···················
  17370. 804.42 s [nothunks] Just ["[]","(,)"] 11% ██▏·················
  17371. 804.42 s [nothunks] Nothing 7% █▍··················
  17372. 804.50 s [nothunks] SeqInt: OK (0.06s)
  17373. 804.50 s [nothunks] ✓ <interactive> passed 1000 tests.
  17374. 804.50 s [nothunks] Just ["Int","Seq"] 49% █████████▋··········
  17375. 804.50 s [nothunks] Nothing 51% ██████████▎·········
  17376. 804.52 s [nothunks] AllowThunksIn: OK
  17377. 804.52 s [nothunks] ✓ <interactive> passed 1000 tests.
  17378. 804.52 s [nothunks] Just ["Int","field2","Record"] 25% ████▉···············
  17379. 804.52 s [nothunks] Just ["Record"] 51% ██████████▎·········
  17380. 804.52 s [nothunks] Nothing 24% ████▊···············
  17381. 804.53 s [nothunks] Fn: OK
  17382. 804.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17383. 804.53 s [nothunks] Just ["->"] 23% ████▋···············
  17384. 804.53 s [nothunks] Nothing 77% ███████████████▎····
  17385. 804.55 s [nothunks] IO: OK (0.01s)
  17386. 804.55 s [nothunks] ✓ <interactive> passed 1000 tests.
  17387. 804.55 s [nothunks] Just ["IO"] 24% ████▉···············
  17388. 804.55 s [nothunks] Nothing 76% ███████████████·····
  17389. 804.55 s [nothunks] ThunkFreeFn: OK (0.01s)
  17390. 804.55 s [nothunks] ✓ <interactive> passed 1000 tests.
  17391. 804.55 s [nothunks] Just ["->"] 25% █████···············
  17392. 804.55 s [nothunks] Just ["...","->"] 36% ███████▏············
  17393. 804.55 s [nothunks] Nothing 38% ███████▋············
  17394. 804.56 s [nothunks] ThunkFreeIO: OK (0.01s)
  17395. 804.56 s [nothunks] ✓ <interactive> passed 1000 tests.
  17396. 804.56 s [nothunks] Just ["...","IO"] 34% ██████▊·············
  17397. 804.56 s [nothunks] Just ["IO"] 27% █████▍··············
  17398. 804.56 s [nothunks] Nothing 39% ███████▋············
  17399. 804.56 s [nothunks] MutableVars
  17400. 804.56 s [nothunks] IORef
  17401. 804.56 s [nothunks] NotNF: OK
  17402. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17403. 804.56 s [nothunks] NF: OK
  17404. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17405. 804.56 s [nothunks] NotNFPure: OK
  17406. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17407. 804.56 s [nothunks] NFPure: OK
  17408. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17409. 804.56 s [nothunks] NotNFAtomically: OK
  17410. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17411. 804.56 s [nothunks] NFAtomically: OK
  17412. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17413. 804.56 s [nothunks] MVar
  17414. 804.56 s [nothunks] NotNF: OK
  17415. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17416. 804.56 s [nothunks] NF: OK
  17417. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17418. 804.56 s [nothunks] NotNFPure: OK
  17419. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17420. 804.56 s [nothunks] NFPure: OK
  17421. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17422. 804.56 s [nothunks] NotNFAtomically: OK
  17423. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17424. 804.56 s [nothunks] NFAtomically: OK
  17425. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17426. 804.56 s [nothunks] TVar
  17427. 804.56 s [nothunks] NotNF: OK
  17428. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17429. 804.56 s [nothunks] NF: OK
  17430. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17431. 804.56 s [nothunks] NotNFPure: OK
  17432. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17433. 804.56 s [nothunks] NFPure: OK
  17434. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17435. 804.56 s [nothunks] NotNFAtomically: OK
  17436. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17437. 804.56 s [nothunks] NFAtomically: OK
  17438. 804.56 s [nothunks] ✓ <interactive> passed 1 test.
  17439. 804.56 s [nothunks]
  17440. 804.56 s [nothunks] All 41 tests passed (0.34s)
  17441. 804.57 s [nothunks] Test suite nothunks-test: PASS
  17442. 804.57 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  17443. 804.57 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  17444. 804.58 s [nothunks] Phase: haddockPhase
  17445. 804.71 s [nothunks] Preprocessing library for nothunks-0.3.1..
  17446. 804.71 s [nothunks] Running Haddock on library for nothunks-0.3.1..
  17447. 804.72 s [nothunks] Warning: The documentation for the following packages are not installed. No
  17448. 804.72 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  17449. 804.76 s [nothunks] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  17450. 805.26 s [nothunks] Warning: 'GHC' is out of scope.
  17451. 805.26 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  17452. 805.26 s [nothunks] Warning: 'a' is out of scope.
  17453. 805.26 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  17454. 805.26 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  17455. 805.26 s [nothunks] Missing documentation for:
  17456. 805.26 s [nothunks] Module header
  17457. 805.63 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  17458. 805.63 s [nothunks]
  17459. 805.63 s [nothunks] - NoThunks.Class.GShowTypeOf
  17460. 805.64 s [nothunks] - NoThunks.Class.checkContainsThunks
  17461. 805.64 s [nothunks] - Data.Vector.Vector
  17462. 805.64 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  17463. 805.64 s [nothunks] - NoThunks.Class.HasFields
  17464. 805.64 s [nothunks] - NoThunks.Class.GWRecordField
  17465. 805.64 s [nothunks] - NoThunks.Class.Elem
  17466. 807.98 s [nothunks] Documentation created: dist/doc/html/nothunks/index.html,
  17467. 807.98 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  17468. 808.03 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
  17469. 808.04 s [nothunks] Phase: installPhase
  17470. 808.09 s [nothunks] Installing library in /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17471. 808.30 s [nothunks] Phase: fixupPhase
  17472. 808.31 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1
  17473. 808.31 s [nothunks] shrinking /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSnothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb-ghc9.4.8.so
  17474. 808.32 s [nothunks] checking for references to /build/ in /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1...
  17475. 808.34 s [nothunks] patching script interpreter paths in /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1
  17476. 808.35 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/lib
  17477. 808.41 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc
  17478. 808.41 s [nothunks] checking for references to /build/ in /nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc...
  17479. 808.43 s [nothunks] patching script interpreter paths in /nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc
  17480. 808.52 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1
  17481. 809.01 s [nothunks:post-build] Pushing 2 paths (67 are already present) using zstd to cache sellout ⏳
  17482. 809.01 s [nothunks:post-build]
  17483. 809.39 s [nothunks:post-build] Pushing /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1 (2.96 MiB)
  17484. 809.52 s [nothunks:post-build] Pushing /nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc (889.48 KiB)
  17485. 811.16 s [nothunks:post-build]
  17486. 811.16 s [nothunks:post-build] All done.
  17487. 811.18 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1
  17488. 811.23 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17489. 811.44 s [nothunks:post-build] copying 2 paths...
  17490. 811.44 s [nothunks:post-build] copying path '/nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc' to 'https://cache.nix-ci.com'...
  17491. 811.86 s [nothunks:post-build] copying path '/nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  17492. 812.79 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17493. 813.05 s [nothunks:post-build] copying 1 paths...
  17494. 813.05 s [nothunks:post-build] copying path '/nix/store/swjk3fv73r6jsz1dhp76g6r15z9862dv-nothunks-0.3.1.drv' to 'https://cache.nix-ci.com'...
  17495. 813.29 s Progress: 28 of 43 built, 373 of 373 downloaded from cache
  17496. 813.34 s Building /nix/store/mmzj631fgjvc2yysr8cz9r3dgsgnn5hy-unordered-containers-0.2.20.1.drv
  17497. 813.48 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  17498. 813.50 s [unordered-containers] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  17499. 813.68 s [unordered-containers] Phase: unpackPhase
  17500. 813.68 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  17501. 813.69 s [unordered-containers] source root is unordered-containers-0.2.20.1
  17502. 813.69 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  17503. 813.70 s [unordered-containers] Phase: patchPhase
  17504. 813.71 s [unordered-containers] Phase: compileBuildDriverPhase
  17505. 813.71 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.ZE40aNqCfO/setup-package.conf.d -threaded
  17506. 813.75 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.ZE40aNqCfO/Main.o )
  17507. 813.80 s [unordered-containers] [2 of 2] Linking Setup
  17508. 815.07 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  17509. 815.08 s [unordered-containers] Phase: configurePhase
  17510. 815.08 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.ZE40aNqCfO/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  17511. 815.57 s [unordered-containers] Using Parsec parser
  17512. 815.57 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  17513. 815.57 s [unordered-containers] Flags chosen: debug=False
  17514. 815.57 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.17.2.1
  17515. 815.57 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.4.8.0
  17516. 815.57 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.4.7.0
  17517. 815.57 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.19.0.0
  17518. 815.57 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  17519. 815.57 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  17520. 815.57 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  17521. 815.57 s [unordered-containers] Dependency base: using base-4.17.2.1
  17522. 815.57 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.6.7
  17523. 815.57 s [unordered-containers] Dependency hashable: using hashable-1.4.7.0
  17524. 815.57 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  17525. 815.57 s [unordered-containers] Dependency random: using random-1.2.1.3
  17526. 815.57 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  17527. 815.57 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  17528. 815.57 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  17529. 815.57 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  17530. 815.91 s [unordered-containers] Source component graph:
  17531. 815.91 s [unordered-containers] component lib
  17532. 815.91 s [unordered-containers] component test:unordered-containers-tests dependency lib
  17533. 815.91 s [unordered-containers] Configured component graph:
  17534. 815.91 s [unordered-containers] component unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  17535. 815.91 s [unordered-containers] include base-4.17.2.1
  17536. 815.91 s [unordered-containers] include deepseq-1.4.8.0
  17537. 815.91 s [unordered-containers] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  17538. 815.91 s [unordered-containers] include template-haskell-2.19.0.0
  17539. 815.91 s [unordered-containers] component unordered-containers-0.2.20.1-67yuju4pA8f8jDWOVFHmAh-unordered-containers-tests
  17540. 815.91 s [unordered-containers] include ChasingBottoms-1.3.1.17-EahLsxrTNYO3WMAx9yFZkq
  17541. 815.91 s [unordered-containers] include HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  17542. 815.91 s [unordered-containers] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  17543. 815.91 s [unordered-containers] include base-4.17.2.1
  17544. 815.91 s [unordered-containers] include containers-0.6.7
  17545. 815.91 s [unordered-containers] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  17546. 815.91 s [unordered-containers] include nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17547. 815.91 s [unordered-containers] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  17548. 815.91 s [unordered-containers] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  17549. 815.91 s [unordered-containers] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  17550. 815.91 s [unordered-containers] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  17551. 815.91 s [unordered-containers] include unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  17552. 815.91 s [unordered-containers] Linked component graph:
  17553. 815.91 s [unordered-containers] unit unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  17554. 815.91 s [unordered-containers] include base-4.17.2.1
  17555. 815.91 s [unordered-containers] include deepseq-1.4.8.0
  17556. 815.91 s [unordered-containers] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  17557. 815.91 s [unordered-containers] include template-haskell-2.19.0.0
  17558. 815.91 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashSet.Internal
  17559. 815.91 s [unordered-containers] unit unordered-containers-0.2.20.1-67yuju4pA8f8jDWOVFHmAh-unordered-containers-tests
  17560. 815.91 s [unordered-containers] include ChasingBottoms-1.3.1.17-EahLsxrTNYO3WMAx9yFZkq
  17561. 815.91 s [unordered-containers] include HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  17562. 815.91 s [unordered-containers] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  17563. 815.91 s [unordered-containers] include base-4.17.2.1
  17564. 815.91 s [unordered-containers] include containers-0.6.7
  17565. 815.91 s [unordered-containers] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  17566. 815.91 s [unordered-containers] include nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17567. 815.91 s [unordered-containers] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  17568. 815.91 s [unordered-containers] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  17569. 815.91 s [unordered-containers] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  17570. 815.91 s [unordered-containers] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  17571. 815.91 s [unordered-containers] include unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  17572. 815.91 s [unordered-containers] Ready component graph:
  17573. 815.91 s [unordered-containers] definite unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  17574. 815.91 s [unordered-containers] depends base-4.17.2.1
  17575. 815.91 s [unordered-containers] depends deepseq-1.4.8.0
  17576. 815.91 s [unordered-containers] depends hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  17577. 815.91 s [unordered-containers] depends template-haskell-2.19.0.0
  17578. 815.91 s [unordered-containers] definite unordered-containers-0.2.20.1-67yuju4pA8f8jDWOVFHmAh-unordered-containers-tests
  17579. 815.91 s [unordered-containers] depends ChasingBottoms-1.3.1.17-EahLsxrTNYO3WMAx9yFZkq
  17580. 815.91 s [unordered-containers] depends HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  17581. 815.91 s [unordered-containers] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  17582. 815.91 s [unordered-containers] depends base-4.17.2.1
  17583. 815.91 s [unordered-containers] depends containers-0.6.7
  17584. 815.91 s [unordered-containers] depends hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  17585. 815.91 s [unordered-containers] depends nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17586. 815.91 s [unordered-containers] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  17587. 815.91 s [unordered-containers] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  17588. 815.91 s [unordered-containers] depends tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  17589. 815.91 s [unordered-containers] depends tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  17590. 815.91 s [unordered-containers] depends unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  17591. 815.91 s [unordered-containers] Using Cabal-3.8.1.0 compiled by ghc-9.4
  17592. 815.91 s [unordered-containers] Using compiler: ghc-9.4.8
  17593. 815.91 s [unordered-containers] Using install prefix:
  17594. 815.91 s [unordered-containers] /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1
  17595. 815.91 s [unordered-containers] Executables installed in:
  17596. 815.91 s [unordered-containers] /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/bin
  17597. 815.91 s [unordered-containers] Libraries installed in:
  17598. 815.91 s [unordered-containers] /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  17599. 815.91 s [unordered-containers] Dynamic Libraries installed in:
  17600. 815.91 s [unordered-containers] /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  17601. 815.92 s [unordered-containers] Private executables installed in:
  17602. 815.92 s [unordered-containers] /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.4.8/unordered-containers-0.2.20.1
  17603. 815.92 s [unordered-containers] Data files installed in:
  17604. 815.92 s [unordered-containers] /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.4.8/unordered-containers-0.2.20.1
  17605. 815.92 s [unordered-containers] Documentation installed in:
  17606. 815.92 s [unordered-containers] /nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  17607. 815.92 s [unordered-containers] Configuration files installed in:
  17608. 815.92 s [unordered-containers] /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/etc
  17609. 815.92 s [unordered-containers] No alex found
  17610. 815.92 s [unordered-containers] Using ar found on system at:
  17611. 815.92 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  17612. 815.92 s [unordered-containers] No c2hs found
  17613. 815.92 s [unordered-containers] No cpphs found
  17614. 815.92 s [unordered-containers] No doctest found
  17615. 815.92 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  17616. 815.92 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  17617. 815.92 s [unordered-containers] Using ghc version 9.4.8 found on system at:
  17618. 815.92 s [unordered-containers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  17619. 815.92 s [unordered-containers] Using ghc-pkg version 9.4.8 found on system at:
  17620. 815.92 s [unordered-containers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  17621. 815.92 s [unordered-containers] No ghcjs found
  17622. 815.92 s [unordered-containers] No ghcjs-pkg found
  17623. 815.92 s [unordered-containers] No greencard found
  17624. 815.92 s [unordered-containers] Using haddock version 2.27.0 found on system at:
  17625. 815.92 s [unordered-containers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  17626. 815.92 s [unordered-containers] No happy found
  17627. 815.92 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  17628. 815.92 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  17629. 815.92 s [unordered-containers] No hmake found
  17630. 815.92 s [unordered-containers] Using hpc version 0.68 found on system at:
  17631. 815.92 s [unordered-containers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  17632. 815.92 s [unordered-containers] Using hsc2hs version 0.68.8 found on system at:
  17633. 815.92 s [unordered-containers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  17634. 815.92 s [unordered-containers] Using hscolour version 1.25 found on system at:
  17635. 815.92 s [unordered-containers] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  17636. 815.92 s [unordered-containers] No jhc found
  17637. 815.92 s [unordered-containers] Using ld found on system at:
  17638. 815.92 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  17639. 815.92 s [unordered-containers] No pkg-config found
  17640. 815.92 s [unordered-containers] Using runghc version 9.4.8 found on system at:
  17641. 815.92 s [unordered-containers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  17642. 815.92 s [unordered-containers] Using strip version 2.44 found on system at:
  17643. 815.92 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  17644. 815.92 s [unordered-containers] Using tar found on system at:
  17645. 815.92 s [unordered-containers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  17646. 815.92 s [unordered-containers] No uhc found
  17647. 815.92 s [unordered-containers] Phase: buildPhase
  17648. 815.98 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
  17649. 815.99 s [unordered-containers] Building library for unordered-containers-0.2.20.1..
  17650. 816.23 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.o, dist/build/Data/HashMap/Internal/Array.dyn_o )
  17651. 817.03 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.o, dist/build/Data/HashMap/Internal/List.dyn_o )
  17652. 817.03 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.o, dist/build/Data/HashMap/Internal.dyn_o )
  17653. 824.46 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.o, dist/build/Data/HashMap/Internal/Debug.dyn_o )
  17654. 824.76 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.o, dist/build/Data/HashMap/Internal/Strict.dyn_o )
  17655. 826.80 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.o, dist/build/Data/HashSet/Internal.dyn_o )
  17656. 826.80 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  17657. 826.80 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.o, dist/build/Data/HashMap/Strict.dyn_o )
  17658. 826.82 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.o, dist/build/Data/HashMap/Lazy.dyn_o )
  17659. 827.30 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  17660. 828.21 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  17661. 828.21 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  17662. 836.67 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  17663. 837.20 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  17664. 839.61 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  17665. 839.61 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  17666. 839.61 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  17667. 839.72 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  17668. 840.94 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  17669. 840.94 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  17670. 841.13 s [unordered-containers] [1 of 9] Compiling Properties.List ( tests/Properties/List.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/List.o )
  17671. 841.39 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  17672. 844.18 s [unordered-containers] [3 of 9] Compiling Util.Key ( tests/Util/Key.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Util/Key.o )
  17673. 844.22 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  17674. 844.22 s [unordered-containers] [5 of 9] Compiling Properties.HashSet ( tests/Properties/HashSet.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashSet.o )
  17675. 844.22 s [unordered-containers] [6 of 9] Compiling Properties.HashMapStrict ( tests/Properties/HashMapStrict.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapStrict.o )
  17676. 850.56 s [unordered-containers] [7 of 9] Compiling Properties.HashMapLazy ( tests/Properties/HashMapLazy.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapLazy.o )
  17677. 850.59 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  17678. 850.59 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  17679. 851.05 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  17680. 852.12 s [unordered-containers] buildPhase completed in 36 seconds
  17681. 852.12 s [unordered-containers] Phase: checkPhase
  17682. 852.18 s [unordered-containers] Running 1 test suites...
  17683. 852.18 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  17684. 852.21 s [unordered-containers] All
  17685. 852.21 s [unordered-containers] Properties
  17686. 852.21 s [unordered-containers] Data.HashMap.Lazy
  17687. 852.21 s [unordered-containers] instances
  17688. 852.21 s [unordered-containers] Eq
  17689. 852.26 s [unordered-containers] ==: OK (0.06s)
  17690. 852.26 s [unordered-containers] +++ OK, passed 100 tests.
  17691. 852.26 s [unordered-containers] /=: OK (0.04s)
  17692. 852.26 s [unordered-containers] +++ OK, passed 100 tests.
  17693. 852.26 s [unordered-containers] Ord
  17694. 852.27 s [unordered-containers] compare reflexive: OK (0.03s)
  17695. 852.27 s [unordered-containers] +++ OK, passed 100 tests.
  17696. 852.33 s [unordered-containers] compare transitive: OK (0.12s)
  17697. 852.33 s [unordered-containers] +++ OK, passed 100 tests.
  17698. 852.33 s [unordered-containers] compare antisymmetric: OK (0.07s)
  17699. 852.33 s [unordered-containers] +++ OK, passed 100 tests.
  17700. 852.33 s [unordered-containers] Ord => Eq: OK (0.04s)
  17701. 852.33 s [unordered-containers] +++ OK, passed 100 tests.
  17702. 852.67 s [unordered-containers] Read/Show: OK (0.39s)
  17703. 852.67 s [unordered-containers] +++ OK, passed 100 tests.
  17704. 852.67 s [unordered-containers] Functor: OK (0.14s)
  17705. 852.67 s [unordered-containers] +++ OK, passed 100 tests.
  17706. 852.67 s [unordered-containers] Foldable: OK (0.07s)
  17707. 852.67 s [unordered-containers] +++ OK, passed 100 tests.
  17708. 852.67 s [unordered-containers] Bifoldable
  17709. 852.67 s [unordered-containers] bifoldMap: OK (0.01s)
  17710. 852.67 s [unordered-containers] +++ OK, passed 100 tests.
  17711. 852.67 s [unordered-containers] bifoldr: OK (0.04s)
  17712. 852.67 s [unordered-containers] +++ OK, passed 100 tests.
  17713. 852.67 s [unordered-containers] bifoldl: OK (0.09s)
  17714. 852.67 s [unordered-containers] +++ OK, passed 100 tests.
  17715. 852.67 s [unordered-containers] Hashable: OK (0.07s)
  17716. 852.67 s [unordered-containers] +++ OK, passed 100 tests.
  17717. 852.67 s [unordered-containers] empty
  17718. 852.67 s [unordered-containers] valid: OK
  17719. 852.67 s [unordered-containers] +++ OK, passed 1 test.
  17720. 852.67 s [unordered-containers] singleton
  17721. 852.71 s [unordered-containers] valid: OK (0.02s)
  17722. 852.71 s [unordered-containers] +++ OK, passed 100 tests.
  17723. 852.71 s [unordered-containers] size: OK (0.06s)
  17724. 852.71 s [unordered-containers] +++ OK, passed 100 tests.
  17725. 852.71 s [unordered-containers] member: OK
  17726. 852.71 s [unordered-containers] +++ OK, passed 100 tests.
  17727. 852.71 s [unordered-containers] lookup: OK
  17728. 852.71 s [unordered-containers] +++ OK, passed 100 tests.
  17729. 852.71 s [unordered-containers] !?: OK (0.05s)
  17730. 852.71 s [unordered-containers] +++ OK, passed 100 tests.
  17731. 852.71 s [unordered-containers] insert
  17732. 852.71 s [unordered-containers] model: OK (0.02s)
  17733. 852.71 s [unordered-containers] +++ OK, passed 100 tests.
  17734. 852.71 s [unordered-containers] valid: OK
  17735. 852.71 s [unordered-containers] +++ OK, passed 100 tests.
  17736. 852.71 s [unordered-containers] insertWith
  17737. 852.71 s [unordered-containers] insertWith: OK (0.04s)
  17738. 852.71 s [unordered-containers] +++ OK, passed 100 tests.
  17739. 852.71 s [unordered-containers] valid: OK (0.05s)
  17740. 852.71 s [unordered-containers] +++ OK, passed 100 tests.
  17741. 852.71 s [unordered-containers] delete
  17742. 852.71 s [unordered-containers] model: OK (0.02s)
  17743. 852.71 s [unordered-containers] +++ OK, passed 100 tests.
  17744. 852.71 s [unordered-containers] valid: OK
  17745. 852.71 s [unordered-containers] +++ OK, passed 100 tests.
  17746. 852.71 s [unordered-containers] adjust
  17747. 852.72 s [unordered-containers] model: OK (0.07s)
  17748. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17749. 852.72 s [unordered-containers] valid: OK (0.04s)
  17750. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17751. 852.72 s [unordered-containers] update
  17752. 852.72 s [unordered-containers] model: OK (0.02s)
  17753. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17754. 852.72 s [unordered-containers] valid: OK
  17755. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17756. 852.72 s [unordered-containers] alter
  17757. 852.72 s [unordered-containers] model: OK (0.01s)
  17758. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17759. 852.72 s [unordered-containers] valid: OK
  17760. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17761. 852.72 s [unordered-containers] alterF
  17762. 852.72 s [unordered-containers] model
  17763. 852.72 s [unordered-containers] []: OK (0.12s)
  17764. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17765. 852.72 s [unordered-containers] adjust: OK (0.08s)
  17766. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17767. 852.72 s [unordered-containers] insert: OK (0.01s)
  17768. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17769. 852.72 s [unordered-containers] insertWith: OK (0.04s)
  17770. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17771. 852.72 s [unordered-containers] delete: OK (0.01s)
  17772. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17773. 852.72 s [unordered-containers] lookup: OK (0.03s)
  17774. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17775. 852.72 s [unordered-containers] valid: OK (0.05s)
  17776. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17777. 852.72 s [unordered-containers] isSubmapOf
  17778. 852.72 s [unordered-containers] model: OK (0.10s)
  17779. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17780. 852.72 s [unordered-containers] m ⊆ m: OK (0.03s)
  17781. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17782. 852.72 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK
  17783. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17784. 852.72 s [unordered-containers] m1\m2 ⊆ m1: OK (0.08s)
  17785. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17786. 852.72 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.09s)
  17787. 852.72 s [unordered-containers] +++ OK, passed 100 tests; 163 discarded.
  17788. 852.72 s [unordered-containers] delete k m ⊆ m: OK (0.03s)
  17789. 852.72 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  17790. 852.72 s [unordered-containers] m ⊈ delete k m : OK (0.07s)
  17791. 852.72 s [unordered-containers] +++ OK, passed 100 tests; 12 discarded.
  17792. 852.72 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.02s)
  17793. 852.72 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  17794. 852.72 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.01s)
  17795. 852.72 s [unordered-containers] +++ OK, passed 100 tests; 9 discarded.
  17796. 852.72 s [unordered-containers] union
  17797. 852.72 s [unordered-containers] model: OK (0.02s)
  17798. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17799. 852.72 s [unordered-containers] valid: OK (0.04s)
  17800. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17801. 852.72 s [unordered-containers] unionWith
  17802. 852.72 s [unordered-containers] model: OK (0.16s)
  17803. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17804. 852.72 s [unordered-containers] valid: OK (0.04s)
  17805. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17806. 852.72 s [unordered-containers] unionWithKey
  17807. 852.72 s [unordered-containers] model: OK (0.09s)
  17808. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17809. 852.72 s [unordered-containers] valid: OK (0.02s)
  17810. 852.72 s [unordered-containers] +++ OK, passed 100 tests.
  17811. 852.72 s [unordered-containers] unions
  17812. 853.71 s [unordered-containers] model: OK (1.36s)
  17813. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17814. 853.71 s [unordered-containers] valid: OK (0.79s)
  17815. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17816. 853.71 s [unordered-containers] difference
  17817. 853.71 s [unordered-containers] model: OK (0.04s)
  17818. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17819. 853.71 s [unordered-containers] valid: OK (0.05s)
  17820. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17821. 853.71 s [unordered-containers] differenceWith
  17822. 853.71 s [unordered-containers] model: OK (0.06s)
  17823. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17824. 853.71 s [unordered-containers] valid: OK (0.10s)
  17825. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17826. 853.71 s [unordered-containers] intersection
  17827. 853.71 s [unordered-containers] model: OK (0.06s)
  17828. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17829. 853.71 s [unordered-containers] valid: OK (0.04s)
  17830. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17831. 853.71 s [unordered-containers] intersectionWith
  17832. 853.71 s [unordered-containers] model: OK (0.10s)
  17833. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17834. 853.71 s [unordered-containers] valid: OK (0.04s)
  17835. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17836. 853.71 s [unordered-containers] intersectionWithKey
  17837. 853.71 s [unordered-containers] model: OK (0.14s)
  17838. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17839. 853.71 s [unordered-containers] valid: OK (0.09s)
  17840. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17841. 853.71 s [unordered-containers] compose
  17842. 853.71 s [unordered-containers] valid: OK (0.09s)
  17843. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17844. 853.71 s [unordered-containers] map
  17845. 853.71 s [unordered-containers] model: OK (0.12s)
  17846. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17847. 853.71 s [unordered-containers] valid: OK (0.06s)
  17848. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17849. 853.71 s [unordered-containers] traverseWithKey
  17850. 853.71 s [unordered-containers] model: OK (0.47s)
  17851. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17852. 853.71 s [unordered-containers] valid: OK (0.05s)
  17853. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17854. 853.71 s [unordered-containers] mapKeys
  17855. 853.71 s [unordered-containers] model: OK (0.05s)
  17856. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17857. 853.71 s [unordered-containers] valid: OK (0.85s)
  17858. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17859. 853.71 s [unordered-containers] foldr: OK (0.08s)
  17860. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17861. 853.71 s [unordered-containers] foldl: OK (0.06s)
  17862. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17863. 853.71 s [unordered-containers] foldrWithKey: OK (0.09s)
  17864. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17865. 853.71 s [unordered-containers] foldlWithKey: OK (0.06s)
  17866. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17867. 853.71 s [unordered-containers] foldrWithKey': OK (0.06s)
  17868. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17869. 853.71 s [unordered-containers] foldlWithKey': OK (0.05s)
  17870. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17871. 853.71 s [unordered-containers] foldl': OK (0.09s)
  17872. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17873. 853.71 s [unordered-containers] foldr': OK (0.10s)
  17874. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17875. 853.71 s [unordered-containers] foldMapWithKey: OK (0.07s)
  17876. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17877. 853.71 s [unordered-containers] filter
  17878. 853.71 s [unordered-containers] model: OK (0.13s)
  17879. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17880. 853.71 s [unordered-containers] valid: OK (0.09s)
  17881. 853.71 s [unordered-containers] +++ OK, passed 100 tests.
  17882. 853.71 s [unordered-containers] filterWithKey
  17883. 854.10 s [unordered-containers] model: OK (1.60s)
  17884. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17885. 854.10 s [unordered-containers] valid: OK (0.81s)
  17886. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17887. 854.10 s [unordered-containers] mapMaybe
  17888. 854.10 s [unordered-containers] model: OK (0.19s)
  17889. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17890. 854.10 s [unordered-containers] valid: OK (0.08s)
  17891. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17892. 854.10 s [unordered-containers] mapMaybeWithKey
  17893. 854.10 s [unordered-containers] model: OK (1.56s)
  17894. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17895. 854.10 s [unordered-containers] valid: OK (1.10s)
  17896. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17897. 854.10 s [unordered-containers] elems: OK (0.04s)
  17898. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17899. 854.10 s [unordered-containers] keys: OK (0.04s)
  17900. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17901. 854.10 s [unordered-containers] fromList
  17902. 854.10 s [unordered-containers] model: OK (0.06s)
  17903. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17904. 854.10 s [unordered-containers] valid: OK (0.01s)
  17905. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17906. 854.10 s [unordered-containers] fromListWith
  17907. 854.10 s [unordered-containers] model: OK (0.03s)
  17908. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17909. 854.10 s [unordered-containers] valid: OK (0.04s)
  17910. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17911. 854.10 s [unordered-containers] fromListWithKey
  17912. 854.10 s [unordered-containers] model: OK (0.02s)
  17913. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17914. 854.10 s [unordered-containers] valid: OK (0.02s)
  17915. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17916. 854.10 s [unordered-containers] toList: OK (0.04s)
  17917. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17918. 854.10 s [unordered-containers] Data.HashMap.Strict
  17919. 854.10 s [unordered-containers] instances
  17920. 854.10 s [unordered-containers] Eq
  17921. 854.10 s [unordered-containers] ==: OK (0.03s)
  17922. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17923. 854.10 s [unordered-containers] /=: OK (0.05s)
  17924. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17925. 854.10 s [unordered-containers] Ord
  17926. 854.10 s [unordered-containers] compare reflexive: OK (0.02s)
  17927. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17928. 854.10 s [unordered-containers] compare transitive: OK (0.05s)
  17929. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17930. 854.10 s [unordered-containers] compare antisymmetric: OK
  17931. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17932. 854.10 s [unordered-containers] Ord => Eq: OK (0.02s)
  17933. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17934. 854.10 s [unordered-containers] Read/Show: OK (0.51s)
  17935. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17936. 854.10 s [unordered-containers] Functor: OK (0.17s)
  17937. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17938. 854.10 s [unordered-containers] Foldable: OK (0.07s)
  17939. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17940. 854.10 s [unordered-containers] Bifoldable
  17941. 854.10 s [unordered-containers] bifoldMap: OK (0.05s)
  17942. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17943. 854.10 s [unordered-containers] bifoldr: OK (0.06s)
  17944. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17945. 854.10 s [unordered-containers] bifoldl: OK (0.04s)
  17946. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17947. 854.10 s [unordered-containers] Hashable: OK (0.04s)
  17948. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17949. 854.10 s [unordered-containers] empty
  17950. 854.10 s [unordered-containers] valid: OK (0.01s)
  17951. 854.10 s [unordered-containers] +++ OK, passed 1 test.
  17952. 854.10 s [unordered-containers] singleton
  17953. 854.10 s [unordered-containers] valid: OK (0.10s)
  17954. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17955. 854.10 s [unordered-containers] size: OK (0.07s)
  17956. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17957. 854.10 s [unordered-containers] member: OK
  17958. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17959. 854.10 s [unordered-containers] lookup: OK (0.01s)
  17960. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17961. 854.10 s [unordered-containers] !?: OK (0.02s)
  17962. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17963. 854.10 s [unordered-containers] insert
  17964. 854.10 s [unordered-containers] model: OK (0.05s)
  17965. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17966. 854.10 s [unordered-containers] valid: OK (0.03s)
  17967. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17968. 854.10 s [unordered-containers] insertWith
  17969. 854.10 s [unordered-containers] insertWith: OK (0.06s)
  17970. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17971. 854.10 s [unordered-containers] valid: OK (0.02s)
  17972. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17973. 854.10 s [unordered-containers] delete
  17974. 854.10 s [unordered-containers] model: OK (0.04s)
  17975. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17976. 854.10 s [unordered-containers] valid: OK (0.04s)
  17977. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17978. 854.10 s [unordered-containers] adjust
  17979. 854.10 s [unordered-containers] model: OK (0.04s)
  17980. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17981. 854.10 s [unordered-containers] valid: OK (0.01s)
  17982. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17983. 854.10 s [unordered-containers] update
  17984. 854.10 s [unordered-containers] model: OK (0.05s)
  17985. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17986. 854.10 s [unordered-containers] valid: OK (0.06s)
  17987. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17988. 854.10 s [unordered-containers] alter
  17989. 854.10 s [unordered-containers] model: OK (0.04s)
  17990. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17991. 854.10 s [unordered-containers] valid: OK (0.02s)
  17992. 854.10 s [unordered-containers] +++ OK, passed 100 tests.
  17993. 854.10 s [unordered-containers] alterF
  17994. 854.11 s [unordered-containers] model
  17995. 854.11 s [unordered-containers] []: OK (0.28s)
  17996. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  17997. 854.11 s [unordered-containers] adjust: OK
  17998. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  17999. 854.11 s [unordered-containers] insert: OK (0.02s)
  18000. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18001. 854.11 s [unordered-containers] insertWith: OK (0.02s)
  18002. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18003. 854.11 s [unordered-containers] delete: OK (0.05s)
  18004. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18005. 854.11 s [unordered-containers] lookup: OK (0.04s)
  18006. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18007. 854.11 s [unordered-containers] valid: OK (0.08s)
  18008. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18009. 854.11 s [unordered-containers] isSubmapOf
  18010. 854.11 s [unordered-containers] model: OK (0.05s)
  18011. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18012. 854.11 s [unordered-containers] m ⊆ m: OK (0.01s)
  18013. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18014. 854.11 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.05s)
  18015. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18016. 854.11 s [unordered-containers] m1\m2 ⊆ m1: OK (0.12s)
  18017. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18018. 854.11 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.07s)
  18019. 854.11 s [unordered-containers] +++ OK, passed 100 tests; 138 discarded.
  18020. 854.11 s [unordered-containers] delete k m ⊆ m: OK (0.02s)
  18021. 854.11 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  18022. 854.11 s [unordered-containers] m ⊈ delete k m : OK (0.03s)
  18023. 854.11 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  18024. 854.11 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.02s)
  18025. 854.11 s [unordered-containers] +++ OK, passed 100 tests; 12 discarded.
  18026. 854.11 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  18027. 854.11 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  18028. 854.11 s [unordered-containers] union
  18029. 854.11 s [unordered-containers] model: OK (0.06s)
  18030. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18031. 854.11 s [unordered-containers] valid: OK (0.06s)
  18032. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18033. 854.11 s [unordered-containers] unionWith
  18034. 854.11 s [unordered-containers] model: OK (0.15s)
  18035. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18036. 854.11 s [unordered-containers] valid: OK (0.06s)
  18037. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18038. 854.11 s [unordered-containers] unionWithKey
  18039. 854.11 s [unordered-containers] model: OK (0.28s)
  18040. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18041. 854.11 s [unordered-containers] valid: OK (0.16s)
  18042. 854.11 s [unordered-containers] +++ OK, passed 100 tests.
  18043. 854.11 s [unordered-containers] unions
  18044. 854.20 s [unordered-containers] model: OK (1.23s)
  18045. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18046. 854.20 s [unordered-containers] valid: OK (0.79s)
  18047. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18048. 854.20 s [unordered-containers] difference
  18049. 854.20 s [unordered-containers] model: OK (0.08s)
  18050. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18051. 854.20 s [unordered-containers] valid: OK (0.02s)
  18052. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18053. 854.20 s [unordered-containers] differenceWith
  18054. 854.20 s [unordered-containers] model: OK (0.09s)
  18055. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18056. 854.20 s [unordered-containers] valid: OK (0.06s)
  18057. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18058. 854.20 s [unordered-containers] intersection
  18059. 854.20 s [unordered-containers] model: OK (0.05s)
  18060. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18061. 854.20 s [unordered-containers] valid: OK (0.07s)
  18062. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18063. 854.20 s [unordered-containers] intersectionWith
  18064. 854.20 s [unordered-containers] model: OK (0.07s)
  18065. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18066. 854.20 s [unordered-containers] valid: OK (0.09s)
  18067. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18068. 854.20 s [unordered-containers] intersectionWithKey
  18069. 854.20 s [unordered-containers] model: OK (0.21s)
  18070. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18071. 854.20 s [unordered-containers] valid: OK (0.16s)
  18072. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18073. 854.20 s [unordered-containers] compose
  18074. 854.20 s [unordered-containers] valid: OK (0.06s)
  18075. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18076. 854.20 s [unordered-containers] map
  18077. 854.20 s [unordered-containers] model: OK (0.14s)
  18078. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18079. 854.20 s [unordered-containers] valid: OK (0.10s)
  18080. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18081. 854.20 s [unordered-containers] traverseWithKey
  18082. 854.20 s [unordered-containers] model: OK (0.19s)
  18083. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18084. 854.20 s [unordered-containers] valid: OK (0.05s)
  18085. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18086. 854.20 s [unordered-containers] mapKeys
  18087. 854.20 s [unordered-containers] model: OK (0.03s)
  18088. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18089. 854.20 s [unordered-containers] valid: OK (0.52s)
  18090. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18091. 854.20 s [unordered-containers] foldr: OK (0.03s)
  18092. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18093. 854.20 s [unordered-containers] foldl: OK (0.03s)
  18094. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18095. 854.20 s [unordered-containers] foldrWithKey: OK (0.02s)
  18096. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18097. 854.20 s [unordered-containers] foldlWithKey: OK (0.03s)
  18098. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18099. 854.20 s [unordered-containers] foldrWithKey': OK (0.03s)
  18100. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18101. 854.20 s [unordered-containers] foldlWithKey': OK (0.03s)
  18102. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18103. 854.20 s [unordered-containers] foldl': OK (0.04s)
  18104. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18105. 854.20 s [unordered-containers] foldr': OK (0.04s)
  18106. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18107. 854.20 s [unordered-containers] foldMapWithKey: OK (0.01s)
  18108. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18109. 854.20 s [unordered-containers] filter
  18110. 854.20 s [unordered-containers] model: OK (0.07s)
  18111. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18112. 854.20 s [unordered-containers] valid: OK (0.04s)
  18113. 854.20 s [unordered-containers] +++ OK, passed 100 tests.
  18114. 854.20 s [unordered-containers] filterWithKey
  18115. 854.30 s [unordered-containers] model: OK (0.99s)
  18116. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18117. 854.30 s [unordered-containers] valid: OK (0.68s)
  18118. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18119. 854.30 s [unordered-containers] mapMaybe
  18120. 854.30 s [unordered-containers] model: OK (0.12s)
  18121. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18122. 854.30 s [unordered-containers] valid: OK (0.07s)
  18123. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18124. 854.30 s [unordered-containers] mapMaybeWithKey
  18125. 854.30 s [unordered-containers] model: OK (0.97s)
  18126. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18127. 854.30 s [unordered-containers] valid: OK (0.75s)
  18128. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18129. 854.30 s [unordered-containers] elems: OK (0.04s)
  18130. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18131. 854.30 s [unordered-containers] keys: OK (0.03s)
  18132. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18133. 854.30 s [unordered-containers] fromList
  18134. 854.30 s [unordered-containers] model: OK (0.02s)
  18135. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18136. 854.30 s [unordered-containers] valid: OK (0.04s)
  18137. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18138. 854.30 s [unordered-containers] fromListWith
  18139. 854.30 s [unordered-containers] model: OK (0.02s)
  18140. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18141. 854.30 s [unordered-containers] valid: OK
  18142. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18143. 854.30 s [unordered-containers] fromListWithKey
  18144. 854.30 s [unordered-containers] model: OK (0.04s)
  18145. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18146. 854.30 s [unordered-containers] valid: OK (0.06s)
  18147. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18148. 854.30 s [unordered-containers] toList: OK (0.03s)
  18149. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18150. 854.30 s [unordered-containers] Data.HashSet
  18151. 854.30 s [unordered-containers] instances
  18152. 854.30 s [unordered-containers] Eq
  18153. 854.30 s [unordered-containers] ==: OK (0.02s)
  18154. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18155. 854.30 s [unordered-containers] == permutations: OK
  18156. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18157. 854.30 s [unordered-containers] /=: OK (0.07s)
  18158. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18159. 854.30 s [unordered-containers] Ord
  18160. 854.30 s [unordered-containers] compare reflexive: OK
  18161. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18162. 854.30 s [unordered-containers] compare transitive: OK (0.08s)
  18163. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18164. 854.30 s [unordered-containers] compare antisymmetric: OK (0.03s)
  18165. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18166. 854.30 s [unordered-containers] Ord => Eq: OK (0.01s)
  18167. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18168. 854.30 s [unordered-containers] Read/Show: OK (0.22s)
  18169. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18170. 854.30 s [unordered-containers] Foldable: OK (0.03s)
  18171. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18172. 854.30 s [unordered-containers] Hashable: OK (0.03s)
  18173. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18174. 854.30 s [unordered-containers] size: OK (0.01s)
  18175. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18176. 854.30 s [unordered-containers] member: OK (0.02s)
  18177. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18178. 854.30 s [unordered-containers] insert: OK (0.02s)
  18179. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18180. 854.30 s [unordered-containers] delete: OK (0.01s)
  18181. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18182. 854.30 s [unordered-containers] union: OK (0.04s)
  18183. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18184. 854.30 s [unordered-containers] map: OK (0.62s)
  18185. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18186. 854.30 s [unordered-containers] foldr: OK (0.02s)
  18187. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18188. 854.30 s [unordered-containers] foldl': OK
  18189. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18190. 854.30 s [unordered-containers] filter: OK (0.64s)
  18191. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18192. 854.30 s [unordered-containers] toList: OK
  18193. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18194. 854.30 s [unordered-containers] Data.HashMap.Internal.List
  18195. 854.30 s [unordered-containers] isPermutationBy: OK
  18196. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18197. 854.30 s [unordered-containers] isPermutationBy of different length: OK (0.02s)
  18198. 854.30 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  18199. 854.30 s [unordered-containers] pUnorderedCompare: OK (0.11s)
  18200. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18201. 854.30 s [unordered-containers] modelUnorderedCompare
  18202. 854.30 s [unordered-containers] reflexive: OK (0.02s)
  18203. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18204. 854.30 s [unordered-containers] anti-symmetric: OK (0.02s)
  18205. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18206. 854.30 s [unordered-containers] transitive: OK (0.03s)
  18207. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18208. 854.30 s [unordered-containers] Regression tests
  18209. 854.30 s [unordered-containers] issue32: OK
  18210. 854.30 s [unordered-containers] issue39a: OK
  18211. 854.30 s [unordered-containers] issue39b: OK (0.01s)
  18212. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18213. 854.30 s [unordered-containers] issue254 lazy: OK (0.02s)
  18214. 854.30 s [unordered-containers] issue254 strict: OK (0.01s)
  18215. 854.30 s [unordered-containers] issue379
  18216. 854.30 s [unordered-containers] Lazy.unionWith: OK (0.03s)
  18217. 854.30 s [unordered-containers] union: OK
  18218. 854.30 s [unordered-containers] Strict.unionWith: OK
  18219. 854.30 s [unordered-containers] Strict.unionWithKey: OK
  18220. 854.30 s [unordered-containers] issue381
  18221. 854.30 s [unordered-containers] mapMaybe: OK
  18222. 854.30 s [unordered-containers] mapMaybeWithKey: OK
  18223. 854.30 s [unordered-containers] issue382: OK
  18224. 854.30 s [unordered-containers] issue383: OK
  18225. 854.30 s [unordered-containers] issue420: OK
  18226. 854.30 s [unordered-containers] issue491
  18227. 854.30 s [unordered-containers] 1: OK
  18228. 854.30 s [unordered-containers] 2: OK
  18229. 854.30 s [unordered-containers] 3: OK
  18230. 854.30 s [unordered-containers] Strictness
  18231. 854.30 s [unordered-containers] HashMap.Strict
  18232. 854.30 s [unordered-containers] singleton is key-strict: OK
  18233. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18234. 854.30 s [unordered-containers] singleton is value-strict: OK
  18235. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18236. 854.30 s [unordered-containers] member is key-strict: OK
  18237. 854.30 s [unordered-containers] +++ OK, passed 100 tests.
  18238. 854.31 s [unordered-containers] lookup is key-strict: OK
  18239. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18240. 854.31 s [unordered-containers] lookupDefault is key-strict: OK
  18241. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18242. 854.31 s [unordered-containers] findWithDefault is key-strict: OK
  18243. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18244. 854.31 s [unordered-containers] ! is key-strict: OK
  18245. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18246. 854.31 s [unordered-containers] delete is key-strict: OK
  18247. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18248. 854.31 s [unordered-containers] adjust is key-strict: OK
  18249. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18250. 854.31 s [unordered-containers] adjust is value-strict: OK
  18251. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18252. 854.31 s [unordered-containers] insert is key-strict: OK
  18253. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18254. 854.31 s [unordered-containers] insert is value-strict: OK
  18255. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18256. 854.31 s [unordered-containers] insertWith is key-strict: OK
  18257. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18258. 854.31 s [unordered-containers] insertWith is value-strict: OK
  18259. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18260. 854.31 s [unordered-containers] fromList is key-strict: OK
  18261. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18262. 854.31 s [unordered-containers] fromList is value-strict: OK
  18263. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18264. 854.31 s [unordered-containers] fromListWith is key-strict: OK
  18265. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18266. 854.31 s [unordered-containers] fromListWith is value-strict: OK
  18267. 854.31 s [unordered-containers] +++ OK, passed 100 tests.
  18268. 854.31 s [unordered-containers]
  18269. 854.31 s [unordered-containers] All 257 tests passed (2.10s)
  18270. 854.32 s [unordered-containers] Test suite unordered-containers-tests: PASS
  18271. 854.32 s [unordered-containers] Test suite logged to:
  18272. 854.32 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  18273. 854.32 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  18274. 854.33 s [unordered-containers] Phase: haddockPhase
  18275. 854.48 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
  18276. 854.48 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1..
  18277. 854.56 s [unordered-containers] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  18278. 855.01 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  18279. 855.02 s [unordered-containers] Missing documentation for:
  18280. 855.02 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  18281. 855.02 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  18282. 855.02 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:207)
  18283. 855.02 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:224)
  18284. 855.02 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:228)
  18285. 855.02 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:232)
  18286. 855.02 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:241)
  18287. 855.02 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:153)
  18288. 855.02 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:161)
  18289. 855.02 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:248)
  18290. 855.02 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:254)
  18291. 855.02 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:261)
  18292. 855.02 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:273)
  18293. 855.02 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:267)
  18294. 855.02 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:139)
  18295. 855.02 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:279)
  18296. 855.02 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:285)
  18297. 855.02 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:135)
  18298. 855.02 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:291)
  18299. 855.02 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:313)
  18300. 855.02 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:403)
  18301. 855.02 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:374)
  18302. 855.02 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:393)
  18303. 855.02 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:384)
  18304. 855.02 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:416)
  18305. 855.02 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:435)
  18306. 855.02 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:460)
  18307. 855.02 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:536)
  18308. 855.02 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:552)
  18309. 855.02 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:528)
  18310. 855.02 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:493)
  18311. 855.02 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:505)
  18312. 855.17 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  18313. 855.17 s [unordered-containers] Missing documentation for:
  18314. 855.17 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:39)
  18315. 855.17 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:82)
  18316. 855.17 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:67)
  18317. 855.53 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  18318. 855.53 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  18319. 855.53 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  18320. 855.53 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  18321. 855.53 s [unordered-containers] by specifying the type/value namespace explicitly.
  18322. 855.53 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  18323. 855.53 s [unordered-containers] Warning: 'at' is out of scope.
  18324. 855.53 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18325. 855.53 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  18326. 855.53 s [unordered-containers] Missing documentation for:
  18327. 855.53 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  18328. 855.53 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1858)
  18329. 855.53 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2372)
  18330. 855.53 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:512)
  18331. 855.53 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:496)
  18332. 855.53 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:679)
  18333. 855.53 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  18334. 855.53 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:661)
  18335. 855.53 s [unordered-containers] insert' (Data/HashMap/Internal.hs:807)
  18336. 855.53 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1125)
  18337. 855.53 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:849)
  18338. 855.53 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:884)
  18339. 856.01 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  18340. 856.15 s [unordered-containers] Missing documentation for:
  18341. 856.15 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:97)
  18342. 856.15 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  18343. 856.15 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  18344. 856.15 s [unordered-containers] Warning: 'lookup' is out of scope.
  18345. 856.15 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18346. 856.15 s [unordered-containers] Warning: 'at' is out of scope.
  18347. 856.15 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18348. 856.15 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  18349. 856.22 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  18350. 856.26 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  18351. 856.26 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  18352. 856.27 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  18353. 859.50 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/index.html,
  18354. 859.50 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  18355. 859.55 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  18356. 859.56 s [unordered-containers] Phase: installPhase
  18357. 859.63 s [unordered-containers] Installing library in /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  18358. 860.07 s [unordered-containers] Phase: fixupPhase
  18359. 860.09 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1
  18360. 860.10 s [unordered-containers] shrinking /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSunordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF-ghc9.4.8.so
  18361. 860.11 s [unordered-containers] checking for references to /build/ in /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1...
  18362. 860.14 s [unordered-containers] patching script interpreter paths in /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1
  18363. 860.14 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/lib
  18364. 860.26 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc
  18365. 860.28 s [unordered-containers] checking for references to /build/ in /nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc...
  18366. 860.30 s [unordered-containers] patching script interpreter paths in /nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc
  18367. 860.41 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1
  18368. 860.98 s [unordered-containers:post-build] Pushing 2 paths (41 are already present) using zstd to cache sellout ⏳
  18369. 860.98 s [unordered-containers:post-build]
  18370. 861.36 s [unordered-containers:post-build] Pushing /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1 (9.59 MiB)
  18371. 861.42 s [unordered-containers:post-build] Pushing /nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc (4.81 MiB)
  18372. 863.26 s [unordered-containers:post-build]
  18373. 863.26 s [unordered-containers:post-build] All done.
  18374. 863.27 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1
  18375. 863.32 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18376. 863.56 s [unordered-containers:post-build] copying 2 paths...
  18377. 863.56 s [unordered-containers:post-build] copying path '/nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc' to 'https://cache.nix-ci.com'...
  18378. 864.27 s [unordered-containers:post-build] copying path '/nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  18379. 866.59 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18380. 866.84 s [unordered-containers:post-build] copying 1 paths...
  18381. 866.88 s [unordered-containers:post-build] copying path '/nix/store/mmzj631fgjvc2yysr8cz9r3dgsgnn5hy-unordered-containers-0.2.20.1.drv' to 'https://cache.nix-ci.com'...
  18382. 867.08 s Progress: 29 of 43 built, 373 of 373 downloaded from cache
  18383. 867.13 s Building /nix/store/ffy7nn4y5lqn69jjccamkm4bq5p7x6b2-quickcheck-instances-0.3.33.drv
  18384. 867.26 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  18385. 867.27 s [quickcheck-instances] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  18386. 867.47 s [quickcheck-instances] Phase: unpackPhase
  18387. 867.47 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  18388. 867.48 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  18389. 867.48 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  18390. 867.49 s [quickcheck-instances] Phase: patchPhase
  18391. 867.49 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  18392. 867.50 s [quickcheck-instances] Phase: compileBuildDriverPhase
  18393. 867.50 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.hhxR9W3kJU/setup-package.conf.d -threaded
  18394. 867.55 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.hhxR9W3kJU/Main.o )
  18395. 867.59 s [quickcheck-instances] [2 of 2] Linking Setup
  18396. 868.76 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  18397. 868.77 s [quickcheck-instances] Phase: configurePhase
  18398. 868.78 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.hhxR9W3kJU/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  18399. 869.20 s [quickcheck-instances] Using Parsec parser
  18400. 869.20 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  18401. 869.20 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  18402. 869.20 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  18403. 869.20 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.4.0
  18404. 869.20 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.17.2.1
  18405. 869.20 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.11.5.3
  18406. 869.20 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  18407. 869.20 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.7
  18408. 869.20 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  18409. 869.20 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
  18410. 869.20 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  18411. 869.20 s [quickcheck-instances] integer-logarithms-1.0.4
  18412. 869.20 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  18413. 869.20 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  18414. 869.20 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  18415. 869.20 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  18416. 869.20 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  18417. 869.20 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  18418. 869.20 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.0.2
  18419. 869.20 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  18420. 869.20 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  18421. 869.20 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  18422. 869.20 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.5.6.2
  18423. 869.20 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  18424. 869.20 s [quickcheck-instances] unordered-containers-0.2.20.1
  18425. 869.20 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  18426. 869.20 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  18427. 869.20 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  18428. 869.20 s [quickcheck-instances] Dependency base: using base-4.17.2.1
  18429. 869.20 s [quickcheck-instances] Dependency containers: using containers-0.6.7
  18430. 869.20 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  18431. 869.20 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  18432. 869.20 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  18433. 869.20 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  18434. 869.33 s [quickcheck-instances] Source component graph:
  18435. 869.33 s [quickcheck-instances] component lib
  18436. 869.33 s [quickcheck-instances] component test:self-test dependency lib
  18437. 869.33 s [quickcheck-instances] Configured component graph:
  18438. 869.33 s [quickcheck-instances] component quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18439. 869.33 s [quickcheck-instances] include OneTuple-0.4.2-1qNCJdsVRsJDqD4lsm4n6x
  18440. 869.33 s [quickcheck-instances] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18441. 869.33 s [quickcheck-instances] include array-0.5.4.0
  18442. 869.33 s [quickcheck-instances] include base-4.17.2.1
  18443. 869.33 s [quickcheck-instances] include bytestring-0.11.5.3
  18444. 869.33 s [quickcheck-instances] include case-insensitive-1.2.1.0-3POgu6RVhJnIExPH4NIHY6
  18445. 869.33 s [quickcheck-instances] include containers-0.6.7
  18446. 869.33 s [quickcheck-instances] include data-fix-0.3.4-EXaUt9ZWYJVKId4auerdzD
  18447. 869.33 s [quickcheck-instances] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  18448. 869.33 s [quickcheck-instances] include integer-logarithms-1.0.4-2UdkECKTVE99Cdcd46YJ5h
  18449. 869.33 s [quickcheck-instances] include old-time-1.1.0.4-JCK1cuUA8uoGpLymN8cquI
  18450. 869.33 s [quickcheck-instances] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  18451. 869.33 s [quickcheck-instances] include scientific-0.3.8.0-GvGwmF7EL59B4HGbGJmnI
  18452. 869.33 s [quickcheck-instances] include splitmix-0.1.3.1-GyE00mUD5GrGc7M9pXZzrh
  18453. 869.33 s [quickcheck-instances] include strict-0.5.1-J2JTQGR4MtH99TeEdgQVXd
  18454. 869.33 s [quickcheck-instances] include tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  18455. 869.33 s [quickcheck-instances] include text-2.0.2
  18456. 869.33 s [quickcheck-instances] include text-short-0.1.6-746hHyaAgVO47s9DKqHa5a
  18457. 869.33 s [quickcheck-instances] include these-1.2.1-FSMxiwnoUcjLDvhbSYo7wq
  18458. 869.33 s [quickcheck-instances] include time-compat-1.9.8-ABavUctu5Y0BahPH45lQWm
  18459. 869.33 s [quickcheck-instances] include transformers-0.5.6.2
  18460. 869.33 s [quickcheck-instances] include unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  18461. 869.33 s [quickcheck-instances] include uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  18462. 869.33 s [quickcheck-instances] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  18463. 869.33 s [quickcheck-instances] component quickcheck-instances-0.3.33-AXjKe9ynNR226iwrbrlnxm-self-test
  18464. 869.33 s [quickcheck-instances] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18465. 869.33 s [quickcheck-instances] include base-4.17.2.1
  18466. 869.33 s [quickcheck-instances] include containers-0.6.7
  18467. 869.33 s [quickcheck-instances] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  18468. 869.33 s [quickcheck-instances] include quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18469. 869.33 s [quickcheck-instances] include tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  18470. 869.33 s [quickcheck-instances] include uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  18471. 869.33 s [quickcheck-instances] Linked component graph:
  18472. 869.33 s [quickcheck-instances] unit quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18473. 869.33 s [quickcheck-instances] include OneTuple-0.4.2-1qNCJdsVRsJDqD4lsm4n6x
  18474. 869.33 s [quickcheck-instances] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18475. 869.33 s [quickcheck-instances] include array-0.5.4.0
  18476. 869.33 s [quickcheck-instances] include base-4.17.2.1
  18477. 869.33 s [quickcheck-instances] include bytestring-0.11.5.3
  18478. 869.33 s [quickcheck-instances] include case-insensitive-1.2.1.0-3POgu6RVhJnIExPH4NIHY6
  18479. 869.33 s [quickcheck-instances] include containers-0.6.7
  18480. 869.33 s [quickcheck-instances] include data-fix-0.3.4-EXaUt9ZWYJVKId4auerdzD
  18481. 869.33 s [quickcheck-instances] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  18482. 869.33 s [quickcheck-instances] include integer-logarithms-1.0.4-2UdkECKTVE99Cdcd46YJ5h
  18483. 869.33 s [quickcheck-instances] include old-time-1.1.0.4-JCK1cuUA8uoGpLymN8cquI
  18484. 869.33 s [quickcheck-instances] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  18485. 869.33 s [quickcheck-instances] include scientific-0.3.8.0-GvGwmF7EL59B4HGbGJmnI
  18486. 869.33 s [quickcheck-instances] include splitmix-0.1.3.1-GyE00mUD5GrGc7M9pXZzrh
  18487. 869.33 s [quickcheck-instances] include strict-0.5.1-J2JTQGR4MtH99TeEdgQVXd
  18488. 869.33 s [quickcheck-instances] include tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  18489. 869.33 s [quickcheck-instances] include text-2.0.2
  18490. 869.33 s [quickcheck-instances] include text-short-0.1.6-746hHyaAgVO47s9DKqHa5a
  18491. 869.33 s [quickcheck-instances] include these-1.2.1-FSMxiwnoUcjLDvhbSYo7wq
  18492. 869.33 s [quickcheck-instances] include time-compat-1.9.8-ABavUctu5Y0BahPH45lQWm
  18493. 869.33 s [quickcheck-instances] include transformers-0.5.6.2
  18494. 869.33 s [quickcheck-instances] include unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  18495. 869.33 s [quickcheck-instances] include uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  18496. 869.33 s [quickcheck-instances] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  18497. 869.33 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Void
  18498. 869.33 s [quickcheck-instances] unit quickcheck-instances-0.3.33-AXjKe9ynNR226iwrbrlnxm-self-test
  18499. 869.33 s [quickcheck-instances] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18500. 869.33 s [quickcheck-instances] include base-4.17.2.1
  18501. 869.33 s [quickcheck-instances] include containers-0.6.7
  18502. 869.33 s [quickcheck-instances] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  18503. 869.33 s [quickcheck-instances] include quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18504. 869.33 s [quickcheck-instances] include tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  18505. 869.33 s [quickcheck-instances] include uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  18506. 869.33 s [quickcheck-instances] Ready component graph:
  18507. 869.33 s [quickcheck-instances] definite quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18508. 869.33 s [quickcheck-instances] depends OneTuple-0.4.2-1qNCJdsVRsJDqD4lsm4n6x
  18509. 869.33 s [quickcheck-instances] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18510. 869.33 s [quickcheck-instances] depends array-0.5.4.0
  18511. 869.33 s [quickcheck-instances] depends base-4.17.2.1
  18512. 869.33 s [quickcheck-instances] depends bytestring-0.11.5.3
  18513. 869.33 s [quickcheck-instances] depends case-insensitive-1.2.1.0-3POgu6RVhJnIExPH4NIHY6
  18514. 869.33 s [quickcheck-instances] depends containers-0.6.7
  18515. 869.33 s [quickcheck-instances] depends data-fix-0.3.4-EXaUt9ZWYJVKId4auerdzD
  18516. 869.33 s [quickcheck-instances] depends hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  18517. 869.33 s [quickcheck-instances] depends integer-logarithms-1.0.4-2UdkECKTVE99Cdcd46YJ5h
  18518. 869.33 s [quickcheck-instances] depends old-time-1.1.0.4-JCK1cuUA8uoGpLymN8cquI
  18519. 869.33 s [quickcheck-instances] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  18520. 869.33 s [quickcheck-instances] depends scientific-0.3.8.0-GvGwmF7EL59B4HGbGJmnI
  18521. 869.33 s [quickcheck-instances] depends splitmix-0.1.3.1-GyE00mUD5GrGc7M9pXZzrh
  18522. 869.33 s [quickcheck-instances] depends strict-0.5.1-J2JTQGR4MtH99TeEdgQVXd
  18523. 869.33 s [quickcheck-instances] depends tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  18524. 869.33 s [quickcheck-instances] depends text-2.0.2
  18525. 869.33 s [quickcheck-instances] depends text-short-0.1.6-746hHyaAgVO47s9DKqHa5a
  18526. 869.33 s [quickcheck-instances] depends these-1.2.1-FSMxiwnoUcjLDvhbSYo7wq
  18527. 869.33 s [quickcheck-instances] depends time-compat-1.9.8-ABavUctu5Y0BahPH45lQWm
  18528. 869.33 s [quickcheck-instances] depends transformers-0.5.6.2
  18529. 869.33 s [quickcheck-instances] depends unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  18530. 869.33 s [quickcheck-instances] depends uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  18531. 869.33 s [quickcheck-instances] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  18532. 869.33 s [quickcheck-instances] definite quickcheck-instances-0.3.33-AXjKe9ynNR226iwrbrlnxm-self-test
  18533. 869.33 s [quickcheck-instances] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18534. 869.33 s [quickcheck-instances] depends base-4.17.2.1
  18535. 869.33 s [quickcheck-instances] depends containers-0.6.7
  18536. 869.33 s [quickcheck-instances] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  18537. 869.33 s [quickcheck-instances] depends quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18538. 869.51 s [quickcheck-instances] depends tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  18539. 869.51 s [quickcheck-instances] depends uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  18540. 869.51 s [quickcheck-instances] Using Cabal-3.8.1.0 compiled by ghc-9.4
  18541. 869.51 s [quickcheck-instances] Using compiler: ghc-9.4.8
  18542. 869.51 s [quickcheck-instances] Using install prefix:
  18543. 869.51 s [quickcheck-instances] /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33
  18544. 869.51 s [quickcheck-instances] Executables installed in:
  18545. 869.52 s [quickcheck-instances] /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/bin
  18546. 869.52 s [quickcheck-instances] Libraries installed in:
  18547. 869.52 s [quickcheck-instances] /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18548. 869.52 s [quickcheck-instances] Dynamic Libraries installed in:
  18549. 869.52 s [quickcheck-instances] /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  18550. 869.52 s [quickcheck-instances] Private executables installed in:
  18551. 869.52 s [quickcheck-instances] /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.4.8/quickcheck-instances-0.3.33
  18552. 869.52 s [quickcheck-instances] Data files installed in:
  18553. 869.52 s [quickcheck-instances] /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.4.8/quickcheck-instances-0.3.33
  18554. 869.52 s [quickcheck-instances] Documentation installed in:
  18555. 869.52 s [quickcheck-instances] /nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  18556. 869.52 s [quickcheck-instances] Configuration files installed in:
  18557. 869.52 s [quickcheck-instances] /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/etc
  18558. 869.52 s [quickcheck-instances] No alex found
  18559. 869.52 s [quickcheck-instances] Using ar found on system at:
  18560. 869.52 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  18561. 869.52 s [quickcheck-instances] No c2hs found
  18562. 869.52 s [quickcheck-instances] No cpphs found
  18563. 869.52 s [quickcheck-instances] No doctest found
  18564. 869.52 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  18565. 869.52 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  18566. 869.52 s [quickcheck-instances] Using ghc version 9.4.8 found on system at:
  18567. 869.52 s [quickcheck-instances] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  18568. 869.52 s [quickcheck-instances] Using ghc-pkg version 9.4.8 found on system at:
  18569. 869.52 s [quickcheck-instances] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  18570. 869.52 s [quickcheck-instances] No ghcjs found
  18571. 869.52 s [quickcheck-instances] No ghcjs-pkg found
  18572. 869.52 s [quickcheck-instances] No greencard found
  18573. 869.52 s [quickcheck-instances] Using haddock version 2.27.0 found on system at:
  18574. 869.52 s [quickcheck-instances] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  18575. 869.52 s [quickcheck-instances] No happy found
  18576. 869.52 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  18577. 869.52 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18578. 869.52 s [quickcheck-instances] No hmake found
  18579. 869.52 s [quickcheck-instances] Using hpc version 0.68 found on system at:
  18580. 869.52 s [quickcheck-instances] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  18581. 869.52 s [quickcheck-instances] Using hsc2hs version 0.68.8 found on system at:
  18582. 869.52 s [quickcheck-instances] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  18583. 869.52 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  18584. 869.52 s [quickcheck-instances] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  18585. 869.52 s [quickcheck-instances] No jhc found
  18586. 869.52 s [quickcheck-instances] Using ld found on system at:
  18587. 869.52 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  18588. 869.52 s [quickcheck-instances] No pkg-config found
  18589. 869.52 s [quickcheck-instances] Using runghc version 9.4.8 found on system at:
  18590. 869.52 s [quickcheck-instances] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  18591. 869.52 s [quickcheck-instances] Using strip version 2.44 found on system at:
  18592. 869.52 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  18593. 869.52 s [quickcheck-instances] Using tar found on system at:
  18594. 869.52 s [quickcheck-instances] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  18595. 869.52 s [quickcheck-instances] No uhc found
  18596. 869.53 s [quickcheck-instances] Phase: buildPhase
  18597. 869.58 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
  18598. 869.58 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33..
  18599. 869.68 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.o, dist/build/Test/QuickCheck/Instances/Containers.dyn_o )
  18600. 869.74 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.o, dist/build/Test/QuickCheck/Instances/CustomPrelude.dyn_o )
  18601. 869.93 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.o, dist/build/Test/QuickCheck/Instances/CaseInsensitive.dyn_o )
  18602. 870.00 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.o, dist/build/Test/QuickCheck/Instances/ByteString.dyn_o )
  18603. 870.13 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.o, dist/build/Test/QuickCheck/Instances/Array.dyn_o )
  18604. 870.24 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.o, dist/build/Test/QuickCheck/Instances/DataFix.dyn_o )
  18605. 870.24 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.o, dist/build/Test/QuickCheck/Instances/Hashable.dyn_o )
  18606. 870.24 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.o, dist/build/Test/QuickCheck/Instances/Natural.dyn_o )
  18607. 870.24 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.o, dist/build/Test/QuickCheck/Instances/OldTime.dyn_o )
  18608. 870.25 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.o, dist/build/Test/QuickCheck/Instances/Primitive.dyn_o )
  18609. 870.25 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, dist/build/Test/QuickCheck/Instances/Array/Byte.o, dist/build/Test/QuickCheck/Instances/Array/Byte.dyn_o )
  18610. 870.25 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.o, dist/build/Test/QuickCheck/Instances/Scientific.dyn_o )
  18611. 870.25 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.o, dist/build/Test/QuickCheck/Instances/Semigroup.dyn_o )
  18612. 870.25 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.o, dist/build/Test/QuickCheck/Instances/Solo.dyn_o )
  18613. 870.25 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.o, dist/build/Test/QuickCheck/Instances/Strict.dyn_o )
  18614. 870.26 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.o, dist/build/Test/QuickCheck/Instances/Tagged.dyn_o )
  18615. 870.26 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.o, dist/build/Test/QuickCheck/Instances/Text.dyn_o )
  18616. 870.26 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, dist/build/Test/QuickCheck/Instances/Text/Short.o, dist/build/Test/QuickCheck/Instances/Text/Short.dyn_o )
  18617. 870.26 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.o, dist/build/Test/QuickCheck/Instances/These.dyn_o )
  18618. 870.26 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.o, dist/build/Test/QuickCheck/Instances/Time.dyn_o )
  18619. 870.62 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.o, dist/build/Test/QuickCheck/Instances/Transformer.dyn_o )
  18620. 870.62 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.o, dist/build/Test/QuickCheck/Instances/UUID.dyn_o )
  18621. 870.62 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.o, dist/build/Test/QuickCheck/Instances/UnorderedContainers.dyn_o )
  18622. 870.62 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.o, dist/build/Test/QuickCheck/Instances/Vector.dyn_o )
  18623. 870.62 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.o, dist/build/Test/QuickCheck/Instances/Void.dyn_o )
  18624. 870.62 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.o, dist/build/Test/QuickCheck/Instances.dyn_o )
  18625. 870.94 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.p_o )
  18626. 871.09 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.p_o )
  18627. 871.09 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.p_o )
  18628. 871.67 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.p_o )
  18629. 871.85 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.p_o )
  18630. 871.95 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.p_o )
  18631. 871.95 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.p_o )
  18632. 871.95 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.p_o )
  18633. 871.95 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.p_o )
  18634. 871.95 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.p_o )
  18635. 871.95 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, dist/build/Test/QuickCheck/Instances/Array/Byte.p_o )
  18636. 871.95 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.p_o )
  18637. 871.95 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.p_o )
  18638. 871.95 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.p_o )
  18639. 871.95 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.p_o )
  18640. 871.95 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.p_o )
  18641. 871.95 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.p_o )
  18642. 871.95 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, dist/build/Test/QuickCheck/Instances/Text/Short.p_o )
  18643. 871.95 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.p_o )
  18644. 871.95 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.p_o )
  18645. 872.06 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.p_o )
  18646. 872.06 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.p_o )
  18647. 872.06 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.p_o )
  18648. 872.06 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.p_o )
  18649. 872.06 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.p_o )
  18650. 872.06 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  18651. 873.66 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
  18652. 873.66 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33..
  18653. 873.72 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  18654. 874.01 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  18655. 874.77 s [quickcheck-instances] Phase: checkPhase
  18656. 874.79 s [quickcheck-instances] Running 1 test suites...
  18657. 874.79 s [quickcheck-instances] Test suite self-test: RUNNING...
  18658. 874.79 s [quickcheck-instances] +++ OK, passed 100 tests.
  18659. 874.80 s [quickcheck-instances] +++ OK, passed 100 tests.
  18660. 874.80 s [quickcheck-instances] +++ OK, passed 100 tests.
  18661. 874.80 s [quickcheck-instances] +++ OK, passed 100 tests.
  18662. 874.80 s [quickcheck-instances] +++ OK, passed 100 tests.
  18663. 874.80 s [quickcheck-instances] Test suite self-test: PASS
  18664. 874.80 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  18665. 874.80 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  18666. 874.82 s [quickcheck-instances] Phase: haddockPhase
  18667. 874.94 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
  18668. 874.94 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33..
  18669. 874.95 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  18670. 874.95 s [quickcheck-instances] links will be generated to these packages: foldable1-classes-compat-0.1.2,
  18671. 874.95 s [quickcheck-instances] vector-0.13.2.0
  18672. 875.01 s [quickcheck-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  18673. 875.15 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  18674. 875.15 s [quickcheck-instances] Missing documentation for:
  18675. 875.15 s [quickcheck-instances] Module header
  18676. 875.20 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  18677. 875.20 s [quickcheck-instances] Missing documentation for:
  18678. 875.20 s [quickcheck-instances] Module header
  18679. 875.26 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  18680. 875.26 s [quickcheck-instances] Missing documentation for:
  18681. 875.26 s [quickcheck-instances] Module header
  18682. 875.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  18683. 875.27 s [quickcheck-instances] Missing documentation for:
  18684. 875.27 s [quickcheck-instances] Module header
  18685. 875.28 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  18686. 875.28 s [quickcheck-instances] Missing documentation for:
  18687. 875.28 s [quickcheck-instances] Module header
  18688. 875.29 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  18689. 875.29 s [quickcheck-instances] Missing documentation for:
  18690. 875.29 s [quickcheck-instances] Module header
  18691. 875.29 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  18692. 875.29 s [quickcheck-instances] Missing documentation for:
  18693. 875.29 s [quickcheck-instances] Module header
  18694. 875.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  18695. 875.30 s [quickcheck-instances] Missing documentation for:
  18696. 875.30 s [quickcheck-instances] Module header
  18697. 875.34 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  18698. 875.34 s [quickcheck-instances] Missing documentation for:
  18699. 875.34 s [quickcheck-instances] Module header
  18700. 875.34 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  18701. 875.34 s [quickcheck-instances] Missing documentation for:
  18702. 875.34 s [quickcheck-instances] Module header
  18703. 875.35 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  18704. 875.35 s [quickcheck-instances] Missing documentation for:
  18705. 875.35 s [quickcheck-instances] Module header
  18706. 875.36 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  18707. 875.36 s [quickcheck-instances] Missing documentation for:
  18708. 875.36 s [quickcheck-instances] Module header
  18709. 875.44 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  18710. 875.44 s [quickcheck-instances] Missing documentation for:
  18711. 875.44 s [quickcheck-instances] Module header
  18712. 875.47 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  18713. 875.47 s [quickcheck-instances] Missing documentation for:
  18714. 875.47 s [quickcheck-instances] Module header
  18715. 875.51 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  18716. 875.51 s [quickcheck-instances] Missing documentation for:
  18717. 875.51 s [quickcheck-instances] Module header
  18718. 875.52 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  18719. 875.52 s [quickcheck-instances] Missing documentation for:
  18720. 875.52 s [quickcheck-instances] Module header
  18721. 875.53 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  18722. 875.53 s [quickcheck-instances] Missing documentation for:
  18723. 875.53 s [quickcheck-instances] Module header
  18724. 875.54 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  18725. 875.54 s [quickcheck-instances] Missing documentation for:
  18726. 875.54 s [quickcheck-instances] Module header
  18727. 875.58 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  18728. 875.58 s [quickcheck-instances] Missing documentation for:
  18729. 875.58 s [quickcheck-instances] Module header
  18730. 875.61 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  18731. 875.61 s [quickcheck-instances] Missing documentation for:
  18732. 875.61 s [quickcheck-instances] Module header
  18733. 875.62 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  18734. 875.62 s [quickcheck-instances] Missing documentation for:
  18735. 875.62 s [quickcheck-instances] Module header
  18736. 875.63 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  18737. 875.63 s [quickcheck-instances] Missing documentation for:
  18738. 875.63 s [quickcheck-instances] Module header
  18739. 875.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  18740. 875.67 s [quickcheck-instances] Missing documentation for:
  18741. 875.67 s [quickcheck-instances] Module header
  18742. 875.78 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  18743. 875.78 s [quickcheck-instances] Missing documentation for:
  18744. 875.78 s [quickcheck-instances] Module header
  18745. 875.78 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  18746. 875.92 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  18747. 875.92 s [quickcheck-instances]
  18748. 875.92 s [quickcheck-instances] - Data.Vector.Vector
  18749. 875.92 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  18750. 875.92 s [quickcheck-instances] - Data.Vector.Storable.Vector
  18751. 875.92 s [quickcheck-instances] - Data.Vector.Strict.Vector
  18752. 875.92 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  18753. 875.92 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  18754. 878.65 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/index.html,
  18755. 878.65 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  18756. 878.72 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
  18757. 878.72 s [quickcheck-instances] Phase: installPhase
  18758. 878.76 s [quickcheck-instances] Installing library in /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18759. 879.18 s [quickcheck-instances] Phase: fixupPhase
  18760. 879.19 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33
  18761. 879.20 s [quickcheck-instances] shrinking /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSquickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv-ghc9.4.8.so
  18762. 879.22 s [quickcheck-instances] checking for references to /build/ in /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33...
  18763. 879.25 s [quickcheck-instances] patching script interpreter paths in /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33
  18764. 879.26 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/lib
  18765. 879.34 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc
  18766. 879.36 s [quickcheck-instances] checking for references to /build/ in /nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc...
  18767. 879.38 s [quickcheck-instances] patching script interpreter paths in /nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc
  18768. 879.48 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33 /nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc
  18769. 880.08 s [quickcheck-instances:post-build] Pushing 2 paths (102 are already present) using zstd to cache sellout ⏳
  18770. 880.08 s [quickcheck-instances:post-build]
  18771. 880.53 s [quickcheck-instances:post-build] Pushing /nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc (1.61 MiB)
  18772. 880.53 s [quickcheck-instances:post-build] Pushing /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33 (5.57 MiB)
  18773. 881.65 s [quickcheck-instances:post-build]
  18774. 881.65 s [quickcheck-instances:post-build] All done.
  18775. 881.67 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33 /nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc
  18776. 881.71 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18777. 881.91 s [quickcheck-instances:post-build] copying 2 paths...
  18778. 881.91 s [quickcheck-instances:post-build] copying path '/nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc' to 'https://cache.nix-ci.com'...
  18779. 882.34 s [quickcheck-instances:post-build] copying path '/nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  18780. 883.77 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18781. 884.01 s [quickcheck-instances:post-build] copying 1 paths...
  18782. 884.06 s [quickcheck-instances:post-build] copying path '/nix/store/ffy7nn4y5lqn69jjccamkm4bq5p7x6b2-quickcheck-instances-0.3.33.drv' to 'https://cache.nix-ci.com'...
  18783. 884.30 s Progress: 30 of 43 built, 373 of 373 downloaded from cache
  18784. 884.39 s Building /nix/store/qn7lk4qpbww9swg7wp6jj3qbrwghkxvr-extra-1.8.1.drv
  18785. 884.54 s [extra] Phase: setupCompilerEnvironmentPhase
  18786. 884.54 s [extra] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  18787. 884.73 s [extra] Phase: unpackPhase
  18788. 884.73 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  18789. 884.74 s [extra] source root is extra-1.8.1
  18790. 884.74 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  18791. 884.75 s [extra] Phase: patchPhase
  18792. 884.75 s [extra] Phase: compileBuildDriverPhase
  18793. 884.76 s [extra] setupCompileFlags: -package-db=/build/tmp.GDXP0WmFYS/setup-package.conf.d -threaded
  18794. 884.80 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.GDXP0WmFYS/Main.o )
  18795. 884.85 s [extra] [2 of 2] Linking Setup
  18796. 886.02 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  18797. 886.03 s [extra] Phase: configurePhase
  18798. 886.03 s [extra] configureFlags: --verbose --prefix=/nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.GDXP0WmFYS/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  18799. 886.44 s [extra] Using Parsec parser
  18800. 886.44 s [extra] Configuring extra-1.8.1...
  18801. 886.44 s [extra] Dependency base >=4.9 && <5: using base-4.17.2.1
  18802. 886.44 s [extra] Dependency clock >=0.7: using clock-0.8.4
  18803. 886.44 s [extra] Dependency directory: using directory-1.3.7.1
  18804. 886.44 s [extra] Dependency filepath: using filepath-1.4.2.2
  18805. 886.44 s [extra] Dependency process: using process-1.6.18.0
  18806. 886.44 s [extra] Dependency time: using time-1.12.2
  18807. 886.44 s [extra] Dependency unix: using unix-2.7.3
  18808. 886.44 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  18809. 886.44 s [extra] Dependency base >=4 && <5: using base-4.17.2.1
  18810. 886.44 s [extra] Dependency directory: using directory-1.3.7.1
  18811. 886.44 s [extra] Dependency extra: using extra-1.8.1
  18812. 886.44 s [extra] Dependency filepath: using filepath-1.4.2.2
  18813. 886.44 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  18814. 886.44 s [extra] Dependency unix: using unix-2.7.3
  18815. 886.75 s [extra] Source component graph:
  18816. 886.75 s [extra] component lib
  18817. 886.75 s [extra] component test:extra-test dependency lib
  18818. 886.75 s [extra] Configured component graph:
  18819. 886.75 s [extra] component extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  18820. 886.75 s [extra] include base-4.17.2.1
  18821. 886.75 s [extra] include clock-0.8.4-BfeoV556mf87NJyLkMXuRF
  18822. 886.75 s [extra] include directory-1.3.7.1
  18823. 886.75 s [extra] include filepath-1.4.2.2
  18824. 886.75 s [extra] include process-1.6.18.0
  18825. 886.75 s [extra] include time-1.12.2
  18826. 886.75 s [extra] include unix-2.7.3
  18827. 886.75 s [extra] component extra-1.8.1-EMlICjHujfzJ7Uu7yvyGlk-extra-test
  18828. 886.75 s [extra] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18829. 886.75 s [extra] include base-4.17.2.1
  18830. 886.75 s [extra] include directory-1.3.7.1
  18831. 886.75 s [extra] include extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  18832. 886.75 s [extra] include filepath-1.4.2.2
  18833. 886.75 s [extra] include quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18834. 886.75 s [extra] include unix-2.7.3
  18835. 886.75 s [extra] Linked component graph:
  18836. 886.75 s [extra] unit extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  18837. 886.75 s [extra] include base-4.17.2.1
  18838. 886.75 s [extra] include clock-0.8.4-BfeoV556mf87NJyLkMXuRF
  18839. 886.75 s [extra] include directory-1.3.7.1
  18840. 886.75 s [extra] include filepath-1.4.2.2
  18841. 886.75 s [extra] include process-1.6.18.0
  18842. 886.75 s [extra] include time-1.12.2
  18843. 886.75 s [extra] include unix-2.7.3
  18844. 886.75 s [extra] Control.Concurrent.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Version.Extra,Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Extra,Numeric.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Numeric.Extra,System.Directory.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Environment.Extra,System.IO.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.IO.Extra,System.Info.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Info.Extra,System.Process.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Process.Extra,System.Time.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Time.Extra,Text.Read.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Text.Read.Extra
  18845. 886.75 s [extra] unit extra-1.8.1-EMlICjHujfzJ7Uu7yvyGlk-extra-test
  18846. 886.75 s [extra] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18847. 886.75 s [extra] include base-4.17.2.1
  18848. 886.75 s [extra] include directory-1.3.7.1
  18849. 886.75 s [extra] include extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  18850. 886.75 s [extra] include filepath-1.4.2.2
  18851. 886.75 s [extra] include quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18852. 886.75 s [extra] include unix-2.7.3
  18853. 886.75 s [extra] Ready component graph:
  18854. 886.75 s [extra] definite extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  18855. 886.75 s [extra] depends base-4.17.2.1
  18856. 886.75 s [extra] depends clock-0.8.4-BfeoV556mf87NJyLkMXuRF
  18857. 886.75 s [extra] depends directory-1.3.7.1
  18858. 886.75 s [extra] depends filepath-1.4.2.2
  18859. 886.75 s [extra] depends process-1.6.18.0
  18860. 886.75 s [extra] depends time-1.12.2
  18861. 886.75 s [extra] depends unix-2.7.3
  18862. 886.75 s [extra] definite extra-1.8.1-EMlICjHujfzJ7Uu7yvyGlk-extra-test
  18863. 886.75 s [extra] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18864. 886.75 s [extra] depends base-4.17.2.1
  18865. 886.75 s [extra] depends directory-1.3.7.1
  18866. 886.75 s [extra] depends extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  18867. 886.75 s [extra] depends filepath-1.4.2.2
  18868. 886.75 s [extra] depends quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18869. 886.75 s [extra] depends unix-2.7.3
  18870. 886.75 s [extra] Using Cabal-3.8.1.0 compiled by ghc-9.4
  18871. 886.75 s [extra] Using compiler: ghc-9.4.8
  18872. 886.75 s [extra] Using install prefix: /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1
  18873. 886.75 s [extra] Executables installed in:
  18874. 886.75 s [extra] /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/bin
  18875. 886.75 s [extra] Libraries installed in:
  18876. 886.75 s [extra] /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  18877. 886.75 s [extra] Dynamic Libraries installed in:
  18878. 886.75 s [extra] /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  18879. 886.75 s [extra] Private executables installed in:
  18880. 886.75 s [extra] /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/libexec/x86_64-linux-ghc-9.4.8/extra-1.8.1
  18881. 886.75 s [extra] Data files installed in:
  18882. 886.75 s [extra] /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/share/x86_64-linux-ghc-9.4.8/extra-1.8.1
  18883. 886.75 s [extra] Documentation installed in:
  18884. 886.75 s [extra] /nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc/share/doc/extra-1.8.1
  18885. 886.75 s [extra] Configuration files installed in:
  18886. 886.75 s [extra] /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/etc
  18887. 886.75 s [extra] No alex found
  18888. 886.75 s [extra] Using ar found on system at:
  18889. 886.75 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  18890. 886.75 s [extra] No c2hs found
  18891. 886.75 s [extra] No cpphs found
  18892. 886.75 s [extra] No doctest found
  18893. 886.75 s [extra] Using gcc version 14.3.0 given by user at:
  18894. 886.75 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  18895. 886.75 s [extra] Using ghc version 9.4.8 found on system at:
  18896. 886.75 s [extra] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  18897. 886.75 s [extra] Using ghc-pkg version 9.4.8 found on system at:
  18898. 886.75 s [extra] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  18899. 886.75 s [extra] No ghcjs found
  18900. 886.75 s [extra] No ghcjs-pkg found
  18901. 886.75 s [extra] No greencard found
  18902. 886.75 s [extra] Using haddock version 2.27.0 found on system at:
  18903. 886.75 s [extra] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  18904. 886.75 s [extra] No happy found
  18905. 886.75 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  18906. 886.75 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18907. 886.75 s [extra] No hmake found
  18908. 886.75 s [extra] Using hpc version 0.68 found on system at:
  18909. 886.75 s [extra] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  18910. 886.75 s [extra] Using hsc2hs version 0.68.8 found on system at:
  18911. 886.75 s [extra] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  18912. 886.75 s [extra] Using hscolour version 1.25 found on system at:
  18913. 886.75 s [extra] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  18914. 886.75 s [extra] No jhc found
  18915. 886.75 s [extra] Using ld found on system at:
  18916. 886.75 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  18917. 886.75 s [extra] No pkg-config found
  18918. 886.75 s [extra] Using runghc version 9.4.8 found on system at:
  18919. 886.75 s [extra] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  18920. 886.75 s [extra] Using strip version 2.44 found on system at:
  18921. 886.75 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  18922. 886.76 s [extra] Using tar found on system at:
  18923. 886.76 s [extra] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  18924. 886.76 s [extra] No uhc found
  18925. 886.76 s [extra] Phase: buildPhase
  18926. 886.81 s [extra] Preprocessing library for extra-1.8.1..
  18927. 886.81 s [extra] Building library for extra-1.8.1..
  18928. 887.03 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.o, dist/build/Data/IORef/Extra.dyn_o )
  18929. 887.12 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.o, dist/build/Data/Monoid/Extra.dyn_o )
  18930. 887.12 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.o, dist/build/Data/Tuple/Extra.dyn_o )
  18931. 887.13 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.o, dist/build/Data/Typeable/Extra.dyn_o )
  18932. 887.13 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  18933. 887.13 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  18934. 887.13 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.o, dist/build/Data/List/Extra.dyn_o )
  18935. 888.14 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.o, dist/build/Data/Version/Extra.dyn_o )
  18936. 888.20 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.o, dist/build/Data/List/NonEmpty/Extra.dyn_o )
  18937. 888.27 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.o, dist/build/Data/Either/Extra.dyn_o )
  18938. 888.27 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.o, dist/build/Control/Exception/Extra.dyn_o )
  18939. 888.27 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.o, dist/build/Control/Monad/Extra.dyn_o )
  18940. 888.47 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.o, dist/build/Data/Foldable/Extra.dyn_o )
  18941. 888.54 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.o, dist/build/Control/Concurrent/Extra.dyn_o )
  18942. 888.69 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.o, dist/build/System/Directory/Extra.dyn_o )
  18943. 888.69 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.o, dist/build/System/Environment/Extra.dyn_o )
  18944. 888.69 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.o, dist/build/System/IO/Extra.dyn_o )
  18945. 888.84 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.o, dist/build/System/Info/Extra.dyn_o )
  18946. 888.84 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.o, dist/build/System/Process/Extra.dyn_o )
  18947. 888.89 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.o, dist/build/System/Time/Extra.dyn_o )
  18948. 888.89 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  18949. 888.94 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.o, dist/build/Text/Read/Extra.dyn_o )
  18950. 889.31 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  18951. 889.51 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  18952. 889.61 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  18953. 889.61 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  18954. 889.61 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  18955. 889.61 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  18956. 889.61 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  18957. 890.60 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  18958. 890.74 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  18959. 890.81 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  18960. 890.81 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  18961. 890.81 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  18962. 891.09 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  18963. 891.26 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  18964. 891.42 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  18965. 891.42 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  18966. 891.42 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  18967. 891.64 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  18968. 891.64 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  18969. 891.77 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  18970. 891.77 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  18971. 891.88 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  18972. 893.09 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
  18973. 893.09 s [extra] Building test suite 'extra-test' for extra-1.8.1..
  18974. 893.15 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  18975. 893.44 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  18976. 895.28 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  18977. 895.32 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  18978. 895.53 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  18979. 896.27 s [extra] Phase: checkPhase
  18980. 896.30 s [extra] Running 1 test suites...
  18981. 896.30 s [extra] Test suite extra-test: RUNNING...
  18982. 896.30 s [extra] withTempFile
  18983. 896.30 s [extra] +++ OK, passed 100 tests.
  18984. 896.30 s [extra] captureOutput
  18985. 896.30 s [extra] +++ OK, passed 100 tests.
  18986. 896.30 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  18987. 896.33 s [extra] +++ OK, passed 100 tests.
  18988. 896.33 s [extra] \(x :: IO Int) -> join (once x) == x
  18989. 896.36 s [extra] +++ OK, passed 100 tests.
  18990. 896.36 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  18991. 896.38 s [extra] +++ OK, passed 100 tests.
  18992. 896.38 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  18993. 896.41 s [extra] +++ OK, passed 100 tests.
  18994. 896.41 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  18995. 896.44 s [extra] +++ OK, passed 100 tests.
  18996. 896.44 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  18997. 896.47 s [extra] +++ OK, passed 100 tests.
  18998. 896.47 s [extra] stringException "test" == pure "test"
  18999. 896.47 s [extra] +++ OK, passed 100 tests.
  19000. 896.47 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  19001. 896.47 s [extra] +++ OK, passed 100 tests.
  19002. 896.47 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  19003. 896.47 s [extra] +++ OK, passed 100 tests.
  19004. 896.47 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  19005. 896.47 s [extra] +++ OK, passed 100 tests.
  19006. 896.47 s [extra] ignore (print 1) == print 1
  19007. 896.47 s [extra] +++ OK, passed 100 tests.
  19008. 896.47 s [extra] ignore (fail "die") == pure ()
  19009. 896.47 s [extra] +++ OK, passed 100 tests.
  19010. 896.47 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  19011. 896.47 s [extra] +++ OK, passed 100 tests.
  19012. 896.47 s [extra] seq (errorIO "foo") (print 1) == print 1
  19013. 896.47 s [extra] +++ OK, passed 100 tests.
  19014. 896.47 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  19015. 896.47 s [extra] +++ OK, passed 100 tests.
  19016. 896.47 s [extra] seq (assertIO False) (print 1) == print 1
  19017. 896.47 s [extra] +++ OK, passed 100 tests.
  19018. 896.47 s [extra] retry 1 (print "x") == print "x"
  19019. 896.47 s [extra] +++ OK, passed 100 tests.
  19020. 896.47 s [extra] retry 3 (fail "die") == fail "die"
  19021. 896.47 s [extra] +++ OK, passed 100 tests.
  19022. 896.47 s [extra] whenJust Nothing print == pure ()
  19023. 896.48 s [extra] +++ OK, passed 100 tests.
  19024. 896.48 s [extra] whenJust (Just 1) print == print 1
  19025. 896.48 s [extra] +++ OK, passed 100 tests.
  19026. 896.48 s [extra] pureIf @Maybe True 5 == Just 5
  19027. 896.48 s [extra] +++ OK, passed 100 tests.
  19028. 896.48 s [extra] pureIf @Maybe False 5 == Nothing
  19029. 896.48 s [extra] +++ OK, passed 100 tests.
  19030. 896.48 s [extra] pureIf @[] True 5 == [5]
  19031. 896.48 s [extra] +++ OK, passed 100 tests.
  19032. 896.48 s [extra] pureIf @[] False 5 == []
  19033. 896.48 s [extra] +++ OK, passed 100 tests.
  19034. 896.48 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  19035. 896.48 s [extra] +++ OK, passed 100 tests.
  19036. 896.48 s [extra] whenMaybe False (print 1) == pure Nothing
  19037. 896.48 s [extra] +++ OK, passed 100 tests.
  19038. 896.48 s [extra] \(x :: Maybe ()) -> unit x == x
  19039. 896.48 s [extra] +++ OK, passed 100 tests.
  19040. 896.48 s [extra] guarded even 2 == [2]
  19041. 896.48 s [extra] +++ OK, passed 100 tests.
  19042. 896.48 s [extra] guarded odd 2 == Nothing
  19043. 896.48 s [extra] +++ OK, passed 100 tests.
  19044. 896.48 s [extra] guarded (not.null) "My Name" == Just "My Name"
  19045. 896.48 s [extra] +++ OK, passed 100 tests.
  19046. 896.48 s [extra] guardedA (return . even) 42 == Just [42]
  19047. 896.48 s [extra] +++ OK, passed 100 tests.
  19048. 896.48 s [extra] guardedA (return . odd) 42 == Just []
  19049. 896.48 s [extra] +++ OK, passed 100 tests.
  19050. 896.48 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  19051. 896.48 s [extra] +++ OK, passed 100 tests.
  19052. 896.48 s [extra] fold1M (\x y -> Just x) [] == undefined
  19053. 896.48 s [extra] +++ OK, passed 100 tests.
  19054. 896.48 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  19055. 896.48 s [extra] +++ OK, passed 100 tests.
  19056. 896.48 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  19057. 896.48 s [extra] +++ OK, passed 100 tests.
  19058. 896.48 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  19059. 896.48 s [extra] +++ OK, passed 100 tests.
  19060. 896.48 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  19061. 896.48 s [extra] +++ OK, passed 100 tests.
  19062. 896.48 s [extra] Just True ||^ undefined == Just True
  19063. 896.48 s [extra] +++ OK, passed 100 tests.
  19064. 896.48 s [extra] Just False ||^ Just True == Just True
  19065. 896.48 s [extra] +++ OK, passed 100 tests.
  19066. 896.48 s [extra] Just False ||^ Just False == Just False
  19067. 896.48 s [extra] +++ OK, passed 100 tests.
  19068. 896.48 s [extra] Just False &&^ undefined == Just False
  19069. 896.48 s [extra] +++ OK, passed 100 tests.
  19070. 896.48 s [extra] Just True &&^ Just True == Just True
  19071. 896.48 s [extra] +++ OK, passed 100 tests.
  19072. 896.48 s [extra] Just True &&^ Just False == Just False
  19073. 896.48 s [extra] +++ OK, passed 100 tests.
  19074. 896.48 s [extra] anyM Just [False,True ,undefined] == Just True
  19075. 896.48 s [extra] +++ OK, passed 100 tests.
  19076. 896.48 s [extra] anyM Just [False,False,undefined] == undefined
  19077. 896.48 s [extra] +++ OK, passed 100 tests.
  19078. 896.48 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  19079. 896.48 s [extra] +++ OK, passed 100 tests.
  19080. 896.48 s [extra] allM Just [True,False,undefined] == Just False
  19081. 896.48 s [extra] +++ OK, passed 100 tests.
  19082. 896.48 s [extra] allM Just [True,True ,undefined] == undefined
  19083. 896.48 s [extra] +++ OK, passed 100 tests.
  19084. 896.48 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  19085. 896.48 s [extra] +++ OK, passed 100 tests.
  19086. 896.48 s [extra] orM [Just False,Just True ,undefined] == Just True
  19087. 896.48 s [extra] +++ OK, passed 100 tests.
  19088. 896.48 s [extra] orM [Just False,Just False,undefined] == undefined
  19089. 896.48 s [extra] +++ OK, passed 100 tests.
  19090. 896.48 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  19091. 896.48 s [extra] +++ OK, passed 100 tests.
  19092. 896.48 s [extra] andM [Just True,Just False,undefined] == Just False
  19093. 896.48 s [extra] +++ OK, passed 100 tests.
  19094. 896.48 s [extra] andM [Just True,Just True ,undefined] == undefined
  19095. 896.48 s [extra] +++ OK, passed 100 tests.
  19096. 896.48 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  19097. 896.48 s [extra] +++ OK, passed 100 tests.
  19098. 896.48 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  19099. 896.48 s [extra] +++ OK, passed 100 tests.
  19100. 896.49 s [extra] findM (Just . isUpper) "test" == Just Nothing
  19101. 896.49 s [extra] +++ OK, passed 100 tests.
  19102. 896.49 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  19103. 896.49 s [extra] +++ OK, passed 100 tests.
  19104. 896.49 s [extra] fromLeft 1 (Left 3) == 3
  19105. 896.49 s [extra] +++ OK, passed 100 tests.
  19106. 896.49 s [extra] fromLeft 1 (Right "foo") == 1
  19107. 896.49 s [extra] +++ OK, passed 100 tests.
  19108. 896.49 s [extra] fromRight 1 (Right 3) == 3
  19109. 896.49 s [extra] +++ OK, passed 100 tests.
  19110. 896.49 s [extra] fromRight 1 (Left "foo") == 1
  19111. 896.49 s [extra] +++ OK, passed 100 tests.
  19112. 896.49 s [extra] \x -> fromLeft' (Left x) == x
  19113. 896.49 s [extra] +++ OK, passed 100 tests.
  19114. 896.49 s [extra] \x -> fromLeft' (Right x) == undefined
  19115. 896.49 s [extra] +++ OK, passed 100 tests.
  19116. 896.49 s [extra] \x -> fromRight' (Right x) == x
  19117. 896.49 s [extra] +++ OK, passed 100 tests.
  19118. 896.49 s [extra] \x -> fromRight' (Left x) == undefined
  19119. 896.49 s [extra] +++ OK, passed 100 tests.
  19120. 896.49 s [extra] \x -> fromEither (Left x ) == x
  19121. 896.49 s [extra] +++ OK, passed 100 tests.
  19122. 896.49 s [extra] \x -> fromEither (Right x) == x
  19123. 896.49 s [extra] +++ OK, passed 100 tests.
  19124. 896.49 s [extra] \a b -> maybeToEither a (Just b) == Right b
  19125. 896.49 s [extra] +++ OK, passed 100 tests.
  19126. 896.49 s [extra] \a -> maybeToEither a Nothing == Left a
  19127. 896.49 s [extra] +++ OK, passed 100 tests.
  19128. 896.49 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  19129. 896.49 s [extra] +++ OK, passed 100 tests.
  19130. 896.49 s [extra] \x -> eitherToMaybe (Right x) == Just x
  19131. 896.49 s [extra] +++ OK, passed 100 tests.
  19132. 896.49 s [extra] mapLeft show (Left 1) == Left "1"
  19133. 896.49 s [extra] +++ OK, passed 100 tests.
  19134. 896.49 s [extra] mapLeft show (Right True) == Right True
  19135. 896.49 s [extra] +++ OK, passed 100 tests.
  19136. 896.49 s [extra] mapRight show (Left 1) == Left 1
  19137. 896.49 s [extra] +++ OK, passed 100 tests.
  19138. 896.49 s [extra] mapRight show (Right True) == Right "True"
  19139. 896.49 s [extra] +++ OK, passed 100 tests.
  19140. 896.49 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  19141. 896.49 s [extra] +++ OK, passed 100 tests.
  19142. 896.49 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  19143. 896.50 s [extra] +++ OK, passed 100 tests.
  19144. 896.50 s [extra] \xs -> repeatedly line1 xs == lines xs
  19145. 896.50 s [extra] +++ OK, passed 100 tests.
  19146. 896.50 s [extra] disjoint [1,2,3] [4,5] == True
  19147. 896.50 s [extra] +++ OK, passed 100 tests.
  19148. 896.50 s [extra] disjoint [1,2,3] [4,1] == False
  19149. 896.50 s [extra] +++ OK, passed 100 tests.
  19150. 896.50 s [extra] disjointOrd [1,2,3] [4,5] == True
  19151. 896.50 s [extra] +++ OK, passed 100 tests.
  19152. 896.50 s [extra] disjointOrd [1,2,3] [4,1] == False
  19153. 896.50 s [extra] +++ OK, passed 100 tests.
  19154. 896.50 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  19155. 896.50 s [extra] +++ OK, passed 100 tests.
  19156. 896.50 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  19157. 896.50 s [extra] +++ OK, passed 100 tests.
  19158. 896.50 s [extra] anySame [1,1,2] == True
  19159. 896.50 s [extra] +++ OK, passed 100 tests.
  19160. 896.50 s [extra] anySame [1,2,3] == False
  19161. 896.50 s [extra] +++ OK, passed 100 tests.
  19162. 896.50 s [extra] anySame (1:2:1:undefined) == True
  19163. 896.50 s [extra] +++ OK, passed 100 tests.
  19164. 896.50 s [extra] anySame [] == False
  19165. 896.50 s [extra] +++ OK, passed 100 tests.
  19166. 896.50 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  19167. 896.50 s [extra] +++ OK, passed 100 tests.
  19168. 896.50 s [extra] allSame [1,1,2] == False
  19169. 896.50 s [extra] +++ OK, passed 100 tests.
  19170. 896.50 s [extra] allSame [1,1,1] == True
  19171. 896.50 s [extra] +++ OK, passed 100 tests.
  19172. 896.50 s [extra] allSame [1] == True
  19173. 896.50 s [extra] +++ OK, passed 100 tests.
  19174. 896.50 s [extra] allSame [] == True
  19175. 896.50 s [extra] +++ OK, passed 100 tests.
  19176. 896.50 s [extra] allSame (1:1:2:undefined) == False
  19177. 896.50 s [extra] +++ OK, passed 100 tests.
  19178. 896.50 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  19179. 896.50 s [extra] +++ OK, passed 100 tests.
  19180. 896.50 s [extra] headDef 1 [] == 1
  19181. 896.50 s [extra] +++ OK, passed 100 tests.
  19182. 896.50 s [extra] headDef 1 [2,3,4] == 2
  19183. 896.50 s [extra] +++ OK, passed 100 tests.
  19184. 896.50 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  19185. 896.50 s [extra] +++ OK, passed 100 tests.
  19186. 896.50 s [extra] lastDef 1 [] == 1
  19187. 896.50 s [extra] +++ OK, passed 100 tests.
  19188. 896.50 s [extra] lastDef 1 [2,3,4] == 4
  19189. 896.50 s [extra] +++ OK, passed 100 tests.
  19190. 896.50 s [extra] \x xs -> lastDef x xs == last (x:xs)
  19191. 896.50 s [extra] +++ OK, passed 100 tests.
  19192. 896.50 s [extra] [2,3,4] !? 1 == Just 3
  19193. 896.50 s [extra] +++ OK, passed 100 tests.
  19194. 896.50 s [extra] [2,3,4] !? (-1) == Nothing
  19195. 896.50 s [extra] +++ OK, passed 100 tests.
  19196. 896.50 s [extra] [] !? 0 == Nothing
  19197. 896.50 s [extra] +++ OK, passed 100 tests.
  19198. 896.50 s [extra] notNull [] == False
  19199. 896.50 s [extra] +++ OK, passed 100 tests.
  19200. 896.50 s [extra] notNull [1] == True
  19201. 896.50 s [extra] +++ OK, passed 100 tests.
  19202. 896.50 s [extra] \xs -> notNull xs == not (null xs)
  19203. 896.50 s [extra] +++ OK, passed 100 tests.
  19204. 896.50 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  19205. 896.50 s [extra] +++ OK, passed 100 tests.
  19206. 896.50 s [extra] list 1 (\v _ -> v - 2) [] == 1
  19207. 896.50 s [extra] +++ OK, passed 100 tests.
  19208. 896.50 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  19209. 896.50 s [extra] +++ OK, passed 100 tests.
  19210. 896.50 s [extra] unsnoc "test" == Just ("tes",'t')
  19211. 896.50 s [extra] +++ OK, passed 100 tests.
  19212. 896.50 s [extra] unsnoc "" == Nothing
  19213. 896.50 s [extra] +++ OK, passed 100 tests.
  19214. 896.50 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  19215. 896.50 s [extra] +++ OK, passed 100 tests.
  19216. 896.50 s [extra] cons 't' "est" == "test"
  19217. 896.50 s [extra] +++ OK, passed 100 tests.
  19218. 896.50 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  19219. 896.50 s [extra] +++ OK, passed 100 tests.
  19220. 896.51 s [extra] snoc "tes" 't' == "test"
  19221. 896.51 s [extra] +++ OK, passed 100 tests.
  19222. 896.51 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  19223. 896.51 s [extra] +++ OK, passed 100 tests.
  19224. 896.51 s [extra] enumerate == [False, True]
  19225. 896.51 s [extra] +++ OK, passed 100 tests.
  19226. 896.51 s [extra] takeEnd 3 "hello" == "llo"
  19227. 896.51 s [extra] +++ OK, passed 100 tests.
  19228. 896.51 s [extra] takeEnd 5 "bye" == "bye"
  19229. 896.51 s [extra] +++ OK, passed 100 tests.
  19230. 896.51 s [extra] takeEnd (-1) "bye" == ""
  19231. 896.51 s [extra] +++ OK, passed 100 tests.
  19232. 896.51 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  19233. 896.51 s [extra] +++ OK, passed 100 tests.
  19234. 896.51 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  19235. 896.51 s [extra] +++ OK, passed 100 tests.
  19236. 896.51 s [extra] dropEnd 3 "hello" == "he"
  19237. 896.51 s [extra] +++ OK, passed 100 tests.
  19238. 896.51 s [extra] dropEnd 5 "bye" == ""
  19239. 896.51 s [extra] +++ OK, passed 100 tests.
  19240. 896.51 s [extra] dropEnd (-1) "bye" == "bye"
  19241. 896.51 s [extra] +++ OK, passed 100 tests.
  19242. 896.51 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  19243. 896.51 s [extra] +++ OK, passed 100 tests.
  19244. 896.51 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  19245. 896.51 s [extra] +++ OK, passed 100 tests.
  19246. 896.51 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  19247. 896.51 s [extra] +++ OK, passed 100 tests.
  19248. 896.51 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  19249. 896.51 s [extra] +++ OK, passed 100 tests.
  19250. 896.51 s [extra] splitAtEnd 3 "he" == ("", "he")
  19251. 896.51 s [extra] +++ OK, passed 100 tests.
  19252. 896.51 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  19253. 896.51 s [extra] +++ OK, passed 100 tests.
  19254. 896.51 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  19255. 896.51 s [extra] +++ OK, passed 100 tests.
  19256. 896.51 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  19257. 896.51 s [extra] +++ OK, passed 100 tests.
  19258. 896.51 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  19259. 896.51 s [extra] +++ OK, passed 100 tests.
  19260. 896.51 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  19261. 896.51 s [extra] +++ OK, passed 100 tests.
  19262. 896.51 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  19263. 896.51 s [extra] +++ OK, passed 100 tests.
  19264. 896.51 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  19265. 896.51 s [extra] +++ OK, passed 100 tests.
  19266. 896.51 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  19267. 896.51 s [extra] +++ OK, passed 100 tests.
  19268. 896.51 s [extra] trim " hello " == "hello"
  19269. 896.51 s [extra] +++ OK, passed 100 tests.
  19270. 896.51 s [extra] trimStart " hello " == "hello "
  19271. 896.51 s [extra] +++ OK, passed 100 tests.
  19272. 896.51 s [extra] trimEnd " hello " == " hello"
  19273. 896.51 s [extra] +++ OK, passed 100 tests.
  19274. 896.51 s [extra] \s -> trim s == trimEnd (trimStart s)
  19275. 896.51 s [extra] +++ OK, passed 100 tests.
  19276. 896.51 s [extra] lower "This is A TEST" == "this is a test"
  19277. 896.51 s [extra] +++ OK, passed 100 tests.
  19278. 896.51 s [extra] lower "" == ""
  19279. 896.51 s [extra] +++ OK, passed 100 tests.
  19280. 896.51 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  19281. 896.51 s [extra] +++ OK, passed 100 tests.
  19282. 896.51 s [extra] upper "" == ""
  19283. 896.51 s [extra] +++ OK, passed 100 tests.
  19284. 896.51 s [extra] word1 "" == ("", "")
  19285. 896.51 s [extra] +++ OK, passed 100 tests.
  19286. 896.51 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  19287. 896.51 s [extra] +++ OK, passed 100 tests.
  19288. 896.51 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  19289. 896.51 s [extra] +++ OK, passed 100 tests.
  19290. 896.51 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  19291. 896.51 s [extra] +++ OK, passed 100 tests.
  19292. 896.51 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  19293. 896.52 s [extra] +++ OK, passed 100 tests.
  19294. 896.52 s [extra] line1 "" == ("", "")
  19295. 896.52 s [extra] +++ OK, passed 100 tests.
  19296. 896.52 s [extra] line1 "test" == ("test","")
  19297. 896.52 s [extra] +++ OK, passed 100 tests.
  19298. 896.52 s [extra] line1 "test\n" == ("test","")
  19299. 896.52 s [extra] +++ OK, passed 100 tests.
  19300. 896.52 s [extra] line1 "test\nrest" == ("test","rest")
  19301. 896.52 s [extra] +++ OK, passed 100 tests.
  19302. 896.52 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  19303. 896.52 s [extra] +++ OK, passed 100 tests.
  19304. 896.52 s [extra] escapeHTML "this is a test" == "this is a test"
  19305. 896.52 s [extra] +++ OK, passed 100 tests.
  19306. 896.52 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  19307. 896.52 s [extra] +++ OK, passed 100 tests.
  19308. 896.52 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  19309. 896.52 s [extra] +++ OK, passed 100 tests.
  19310. 896.52 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  19311. 896.52 s [extra] +++ OK, passed 100 tests.
  19312. 896.52 s [extra] escapeJSON "this is a test" == "this is a test"
  19313. 896.52 s [extra] +++ OK, passed 100 tests.
  19314. 896.52 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  19315. 896.52 s [extra] +++ OK, passed 100 tests.
  19316. 896.52 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  19317. 896.52 s [extra] +++ OK, passed 100 tests.
  19318. 896.52 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  19319. 896.52 s [extra] +++ OK, passed 100 tests.
  19320. 896.52 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  19321. 896.52 s [extra] +++ OK, passed 100 tests.
  19322. 896.52 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  19323. 896.52 s [extra] +++ OK, passed 100 tests.
  19324. 896.52 s [extra] maximumOn id [] == undefined
  19325. 896.52 s [extra] +++ OK, passed 100 tests.
  19326. 896.52 s [extra] maximumOn length ["test","extra","a"] == "extra"
  19327. 896.52 s [extra] +++ OK, passed 100 tests.
  19328. 896.52 s [extra] minimumOn id [] == undefined
  19329. 896.52 s [extra] +++ OK, passed 100 tests.
  19330. 896.52 s [extra] minimumOn length ["test","extra","a"] == "a"
  19331. 896.52 s [extra] +++ OK, passed 100 tests.
  19332. 896.52 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  19333. 896.52 s [extra] +++ OK, passed 100 tests.
  19334. 896.52 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  19335. 896.52 s [extra] +++ OK, passed 100 tests.
  19336. 896.52 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  19337. 896.52 s [extra] +++ OK, passed 100 tests.
  19338. 896.52 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  19339. 896.52 s [extra] +++ OK, passed 100 tests.
  19340. 896.52 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  19341. 896.52 s [extra] +++ OK, passed 100 tests.
  19342. 896.52 s [extra] sum' [1, 2, 3] == 6
  19343. 896.52 s [extra] +++ OK, passed 100 tests.
  19344. 896.52 s [extra] sumOn' read ["1", "2", "3"] == 6
  19345. 896.52 s [extra] +++ OK, passed 100 tests.
  19346. 896.52 s [extra] product' [1, 2, 4] == 8
  19347. 896.52 s [extra] +++ OK, passed 100 tests.
  19348. 896.52 s [extra] productOn' read ["1", "2", "4"] == 8
  19349. 896.52 s [extra] +++ OK, passed 100 tests.
  19350. 896.52 s [extra] merge "ace" "bd" == "abcde"
  19351. 896.52 s [extra] +++ OK, passed 100 tests.
  19352. 896.52 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  19353. 896.53 s [extra] +++ OK, passed 100 tests.
  19354. 896.53 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  19355. 896.53 s [extra] +++ OK, passed 100 tests.
  19356. 896.53 s [extra] replace "el" "e" "Hello" == "Helo"
  19357. 896.53 s [extra] +++ OK, passed 100 tests.
  19358. 896.53 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  19359. 896.53 s [extra] +++ OK, passed 100 tests.
  19360. 896.53 s [extra] replace "" "x" "" == "x"
  19361. 896.53 s [extra] +++ OK, passed 100 tests.
  19362. 896.53 s [extra] \xs ys -> replace xs xs ys == ys
  19363. 896.53 s [extra] +++ OK, passed 100 tests.
  19364. 896.53 s [extra] breakEnd isLower "youRE" == ("you","RE")
  19365. 896.53 s [extra] +++ OK, passed 100 tests.
  19366. 896.53 s [extra] breakEnd isLower "youre" == ("youre","")
  19367. 896.53 s [extra] +++ OK, passed 100 tests.
  19368. 896.53 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  19369. 896.53 s [extra] +++ OK, passed 100 tests.
  19370. 896.53 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  19371. 896.53 s [extra] +++ OK, passed 100 tests.
  19372. 896.53 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  19373. 896.53 s [extra] +++ OK, passed 100 tests.
  19374. 896.53 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  19375. 896.53 s [extra] +++ OK, passed 100 tests.
  19376. 896.53 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  19377. 896.53 s [extra] +++ OK, passed 100 tests.
  19378. 896.53 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  19379. 896.53 s [extra] +++ OK, passed 100 tests.
  19380. 896.53 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  19381. 896.53 s [extra] +++ OK, passed 100 tests.
  19382. 896.53 s [extra] \s -> wordsBy isSpace s == words s
  19383. 896.53 s [extra] +++ OK, passed 100 tests.
  19384. 896.53 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  19385. 896.53 s [extra] +++ OK, passed 100 tests.
  19386. 896.53 s [extra] \s -> linesBy (== '\n') s == lines s
  19387. 896.53 s [extra] +++ OK, passed 100 tests.
  19388. 896.53 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  19389. 896.53 s [extra] +++ OK, passed 100 tests.
  19390. 896.53 s [extra] firstJust id [Nothing,Just 3] == Just 3
  19391. 896.53 s [extra] +++ OK, passed 100 tests.
  19392. 896.53 s [extra] firstJust id [Nothing,Nothing] == Nothing
  19393. 896.53 s [extra] +++ OK, passed 100 tests.
  19394. 896.53 s [extra] drop1 "" == ""
  19395. 896.53 s [extra] +++ OK, passed 100 tests.
  19396. 896.53 s [extra] drop1 "test" == "est"
  19397. 896.53 s [extra] +++ OK, passed 100 tests.
  19398. 896.53 s [extra] \xs -> drop 1 xs == drop1 xs
  19399. 896.53 s [extra] +++ OK, passed 100 tests.
  19400. 896.53 s [extra] dropEnd1 "" == ""
  19401. 896.53 s [extra] +++ OK, passed 100 tests.
  19402. 896.53 s [extra] dropEnd1 "test" == "tes"
  19403. 896.53 s [extra] +++ OK, passed 100 tests.
  19404. 896.53 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  19405. 896.53 s [extra] +++ OK, passed 100 tests.
  19406. 896.53 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  19407. 896.53 s [extra] +++ OK, passed 100 tests.
  19408. 896.53 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  19409. 896.55 s [extra] +++ OK, passed 100 tests.
  19410. 896.55 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  19411. 896.55 s [extra] +++ OK, passed 100 tests.
  19412. 896.55 s [extra] breakOn "/" "foobar" == ("foobar", "")
  19413. 896.55 s [extra] +++ OK, passed 100 tests.
  19414. 896.55 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  19415. 896.55 s [extra] +++ OK, passed 100 tests.
  19416. 896.55 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  19417. 896.55 s [extra] +++ OK, passed 100 tests.
  19418. 896.55 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  19419. 896.55 s [extra] +++ OK, passed 100 tests.
  19420. 896.55 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  19421. 896.55 s [extra] +++ OK, passed 100 tests.
  19422. 896.55 s [extra] splitOn "x" "x" == ["",""]
  19423. 896.55 s [extra] +++ OK, passed 100 tests.
  19424. 896.55 s [extra] splitOn "x" "" == [""]
  19425. 896.55 s [extra] +++ OK, passed 100 tests.
  19426. 896.55 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  19427. 896.55 s [extra] +++ OK, passed 100 tests; 17 discarded.
  19428. 896.55 s [extra] \c x -> splitOn [c] x == split (==c) x
  19429. 896.55 s [extra] +++ OK, passed 100 tests.
  19430. 896.55 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  19431. 896.55 s [extra] +++ OK, passed 100 tests.
  19432. 896.55 s [extra] split (== 'a') "" == [""]
  19433. 896.55 s [extra] +++ OK, passed 100 tests.
  19434. 896.55 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  19435. 896.55 s [extra] +++ OK, passed 100 tests.
  19436. 896.55 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  19437. 896.55 s [extra] +++ OK, passed 100 tests.
  19438. 896.55 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  19439. 896.55 s [extra] +++ OK, passed 100 tests.
  19440. 896.55 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  19441. 896.55 s [extra] +++ OK, passed 100 tests.
  19442. 896.55 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  19443. 896.55 s [extra] +++ OK, passed 100 tests.
  19444. 896.55 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  19445. 896.55 s [extra] +++ OK, passed 100 tests.
  19446. 896.55 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  19447. 896.55 s [extra] +++ OK, passed 100 tests.
  19448. 896.55 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  19449. 896.55 s [extra] +++ OK, passed 100 tests.
  19450. 896.55 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  19451. 896.55 s [extra] +++ OK, passed 100 tests.
  19452. 896.55 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  19453. 896.55 s [extra] +++ OK, passed 100 tests.
  19454. 896.55 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  19455. 896.55 s [extra] +++ OK, passed 100 tests.
  19456. 896.55 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  19457. 896.55 s [extra] +++ OK, passed 100 tests.
  19458. 896.55 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  19459. 896.55 s [extra] +++ OK, passed 100 tests.
  19460. 896.55 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  19461. 896.55 s [extra] +++ OK, passed 100 tests.
  19462. 896.55 s [extra] stripSuffix "" "baz" == Just "baz"
  19463. 896.55 s [extra] +++ OK, passed 100 tests.
  19464. 896.55 s [extra] stripSuffix "foo" "quux" == Nothing
  19465. 896.55 s [extra] +++ OK, passed 100 tests.
  19466. 896.55 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  19467. 896.55 s [extra] +++ OK, passed 100 tests.
  19468. 896.55 s [extra] stripInfix "/" "foobar" == Nothing
  19469. 896.55 s [extra] +++ OK, passed 100 tests.
  19470. 896.55 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  19471. 896.55 s [extra] +++ OK, passed 100 tests.
  19472. 896.55 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  19473. 896.55 s [extra] +++ OK, passed 100 tests.
  19474. 896.55 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  19475. 896.55 s [extra] +++ OK, passed 100 tests.
  19476. 896.55 s [extra] chunksOf 8 "" == []
  19477. 896.55 s [extra] +++ OK, passed 100 tests.
  19478. 896.55 s [extra] chunksOf 0 "test" == undefined
  19479. 896.55 s [extra] +++ OK, passed 100 tests.
  19480. 896.55 s [extra] nubSort "this is a test" == " aehist"
  19481. 896.55 s [extra] +++ OK, passed 100 tests.
  19482. 896.55 s [extra] \xs -> nubSort xs == nub (sort xs)
  19483. 896.56 s [extra] +++ OK, passed 100 tests.
  19484. 896.56 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  19485. 896.56 s [extra] +++ OK, passed 100 tests.
  19486. 896.56 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  19487. 896.56 s [extra] +++ OK, passed 100 tests.
  19488. 896.56 s [extra] nubOrd "this is a test" == "this ae"
  19489. 896.56 s [extra] +++ OK, passed 100 tests.
  19490. 896.56 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  19491. 896.56 s [extra] +++ OK, passed 100 tests.
  19492. 896.56 s [extra] \xs -> nubOrd xs == nub xs
  19493. 896.56 s [extra] +++ OK, passed 100 tests.
  19494. 896.56 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  19495. 896.56 s [extra] +++ OK, passed 100 tests.
  19496. 896.56 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  19497. 896.56 s [extra] +++ OK, passed 100 tests.
  19498. 896.56 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  19499. 896.56 s [extra] +++ OK, passed 100 tests.
  19500. 896.56 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  19501. 896.56 s [extra] +++ OK, passed 100 tests.
  19502. 896.56 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  19503. 896.56 s [extra] +++ OK, passed 100 tests.
  19504. 896.56 s [extra] comparingLength [1,2,3] [False] == GT
  19505. 896.56 s [extra] +++ OK, passed 100 tests.
  19506. 896.56 s [extra] comparingLength [1,2] "ab" == EQ
  19507. 896.56 s [extra] +++ OK, passed 100 tests.
  19508. 896.56 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  19509. 896.56 s [extra] +++ OK, passed 100 tests.
  19510. 896.56 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  19511. 896.56 s [extra] +++ OK, passed 100 tests.
  19512. 896.56 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  19513. 896.56 s [extra] +++ OK, passed 100 tests.
  19514. 896.56 s [extra] mwhen True "test" == "test"
  19515. 896.56 s [extra] +++ OK, passed 100 tests.
  19516. 896.56 s [extra] mwhen False "test" == ""
  19517. 896.56 s [extra] +++ OK, passed 100 tests.
  19518. 896.56 s [extra] first succ (1,"test") == (2,"test")
  19519. 896.56 s [extra] +++ OK, passed 100 tests.
  19520. 896.56 s [extra] second reverse (1,"test") == (1,"tset")
  19521. 896.56 s [extra] +++ OK, passed 100 tests.
  19522. 896.56 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  19523. 896.56 s [extra] +++ OK, passed 100 tests.
  19524. 896.56 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  19525. 896.56 s [extra] +++ OK, passed 100 tests.
  19526. 896.56 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  19527. 896.56 s [extra] +++ OK, passed 100 tests.
  19528. 896.56 s [extra] (succ &&& pred) 1 == (2,0)
  19529. 896.56 s [extra] +++ OK, passed 100 tests.
  19530. 896.56 s [extra] dupe 12 == (12, 12)
  19531. 896.56 s [extra] +++ OK, passed 100 tests.
  19532. 896.56 s [extra] both succ (1,2) == (2,3)
  19533. 896.56 s [extra] +++ OK, passed 100 tests.
  19534. 896.56 s [extra] first3 succ (1,1,1) == (2,1,1)
  19535. 896.56 s [extra] +++ OK, passed 100 tests.
  19536. 896.56 s [extra] second3 succ (1,1,1) == (1,2,1)
  19537. 896.56 s [extra] +++ OK, passed 100 tests.
  19538. 896.56 s [extra] third3 succ (1,1,1) == (1,1,2)
  19539. 896.56 s [extra] +++ OK, passed 100 tests.
  19540. 896.56 s [extra] \x -> readVersion (showVersion x) == x
  19541. 896.56 s [extra] +++ OK, passed 100 tests.
  19542. 896.56 s [extra] readVersion "hello" == undefined
  19543. 896.56 s [extra] +++ OK, passed 100 tests.
  19544. 896.56 s [extra] showDP 4 pi == "3.1416"
  19545. 896.56 s [extra] +++ OK, passed 100 tests.
  19546. 896.56 s [extra] showDP 0 pi == "3"
  19547. 896.56 s [extra] +++ OK, passed 100 tests.
  19548. 896.56 s [extra] showDP 2 3 == "3.00"
  19549. 896.56 s [extra] +++ OK, passed 100 tests.
  19550. 896.56 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  19551. 896.56 s [extra] +++ OK, passed 100 tests.
  19552. 896.56 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  19553. 896.56 s [extra] +++ OK, passed 100 tests.
  19554. 896.56 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  19555. 896.56 s [extra] +++ OK, passed 100 tests.
  19556. 896.56 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  19557. 896.57 s [extra] +++ OK, passed 100 tests.
  19558. 896.57 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  19559. 896.57 s [extra] +++ OK, passed 100 tests.
  19560. 896.57 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  19561. 896.57 s [extra] +++ OK, passed 100 tests.
  19562. 896.57 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  19563. 896.57 s [extra] +++ OK, passed 100 tests.
  19564. 896.57 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  19565. 896.57 s [extra] +++ OK, passed 100 tests.
  19566. 896.57 s [extra] isWindows == (os == "mingw32")
  19567. 896.57 s [extra] +++ OK, passed 100 tests.
  19568. 896.57 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  19569. 896.58 s [extra] +++ OK, passed 100 tests.
  19570. 896.58 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  19571. 896.60 s [extra] +++ OK, passed 100 tests.
  19572. 896.60 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  19573. 896.61 s [extra] +++ OK, passed 100 tests.
  19574. 896.61 s [extra] captureOutput (print 1) == pure ("1\n",())
  19575. 896.61 s [extra] +++ OK, passed 100 tests.
  19576. 896.61 s [extra] withTempFile doesFileExist == pure True
  19577. 896.61 s [extra] +++ OK, passed 100 tests.
  19578. 896.61 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  19579. 896.61 s [extra] +++ OK, passed 100 tests.
  19580. 896.61 s [extra] withTempFile readFile' == pure ""
  19581. 896.61 s [extra] +++ OK, passed 100 tests.
  19582. 896.61 s [extra] withTempDir doesDirectoryExist == pure True
  19583. 896.62 s [extra] +++ OK, passed 100 tests.
  19584. 896.62 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  19585. 896.62 s [extra] +++ OK, passed 100 tests.
  19586. 896.62 s [extra] withTempDir listFiles == pure []
  19587. 896.62 s [extra] +++ OK, passed 100 tests.
  19588. 896.62 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  19589. 896.62 s [extra] +++ OK, passed 100 tests.
  19590. 896.62 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  19591. 896.62 s [extra] +++ OK, passed 100 tests.
  19592. 896.62 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  19593. 896.62 s [extra] +++ OK, passed 100 tests.
  19594. 896.62 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  19595. 896.62 s [extra] +++ OK, passed 100 tests.
  19596. 896.62 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  19597. 896.62 s [extra] +++ OK, passed 100 tests.
  19598. 896.62 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  19599. 896.62 s [extra] +++ OK, passed 100 tests.
  19600. 896.62 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  19601. 897.62 s [extra] +++ OK, passed 100 tests.
  19602. 897.62 s [extra] timeout (-3) (print 1) == pure Nothing
  19603. 897.62 s [extra] +++ OK, passed 100 tests.
  19604. 897.62 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  19605. 897.62 s [extra] +++ OK, passed 100 tests.
  19606. 897.62 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  19607. 897.72 s [extra] 0.100301766
  19608. 897.72 s [extra] +++ OK, passed 100 tests.
  19609. 897.72 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  19610. 897.82 s [extra] +++ OK, passed 100 tests.
  19611. 897.82 s [extra] showDuration 3.435 == "3.44s"
  19612. 897.82 s [extra] +++ OK, passed 100 tests.
  19613. 897.82 s [extra] showDuration 623.8 == "10m24s"
  19614. 897.82 s [extra] +++ OK, passed 100 tests.
  19615. 897.82 s [extra] showDuration 62003.8 == "17h13m"
  19616. 897.82 s [extra] +++ OK, passed 100 tests.
  19617. 897.82 s [extra] showDuration 1e8 == "27777h47m"
  19618. 897.82 s [extra] +++ OK, passed 100 tests.
  19619. 897.82 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  19620. 897.82 s [extra] +++ OK, passed 100 tests.
  19621. 897.82 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  19622. 898.82 s [extra] +++ OK, passed 100 tests.
  19623. 898.82 s [extra] Extra export
  19624. 898.82 s [extra] +++ OK, passed 100 tests.
  19625. 898.82 s [extra] withTempFile
  19626. 898.83 s [extra] ....done
  19627. 898.83 s [extra] withTempDir
  19628. 898.85 s [extra] ....done
  19629. 898.85 s [extra] retry
  19630. 898.85 s [extra] +++ OK, passed 100 tests.
  19631. 898.85 s [extra] barrier
  19632. 898.85 s [extra] Success (325 tests)
  19633. 898.87 s [extra] Test suite extra-test: PASS
  19634. 898.87 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  19635. 898.87 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  19636. 898.89 s [extra] Phase: haddockPhase
  19637. 899.02 s [extra] Preprocessing library for extra-1.8.1..
  19638. 899.02 s [extra] Running Haddock on library for extra-1.8.1..
  19639. 899.07 s [extra] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  19640. 899.30 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  19641. 899.34 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  19642. 899.35 s [extra] Warning: 'Arrow' is out of scope.
  19643. 899.35 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19644. 899.35 s [extra] 100% ( 22 / 22) in 'Data.Tuple.Extra'
  19645. 899.35 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  19646. 899.36 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  19647. 899.43 s [extra] Warning: '(:)' is out of scope.
  19648. 899.43 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19649. 899.43 s [extra] Warning: 'firstJustM' is out of scope.
  19650. 899.43 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19651. 899.43 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  19652. 899.54 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  19653. 899.56 s [extra] Warning: 'length' is ambiguous. It is defined
  19654. 899.56 s [extra] * in ‘Data.Foldable’
  19655. 899.56 s [extra] * in ‘Data.List.NonEmpty’
  19656. 899.56 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19657. 899.56 s [extra] by specifying the type/value namespace explicitly.
  19658. 899.56 s [extra] Defaulting to the one defined in ‘Data.Foldable’
  19659. 899.56 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  19660. 899.58 s [extra] Warning: 'fromJust' is out of scope.
  19661. 899.58 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19662. 899.58 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  19663. 899.60 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  19664. 899.63 s [extra] Warning: 'partition' is out of scope.
  19665. 899.63 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19666. 899.63 s [extra] Warning: 'mconcatMap' is out of scope.
  19667. 899.63 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19668. 899.63 s [extra] Warning: 'find' is out of scope.
  19669. 899.63 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19670. 899.63 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  19671. 899.70 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  19672. 899.70 s [extra] Missing documentation for:
  19673. 899.70 s [extra] Module header
  19674. 899.72 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  19675. 899.74 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  19676. 899.75 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  19677. 899.78 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  19678. 899.79 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  19679. 899.80 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  19680. 899.81 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  19681. 899.89 s [extra] 100% (270 /270) in 'Extra'
  19682. 899.90 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  19683. 902.13 s [extra] Documentation created: dist/doc/html/extra/index.html,
  19684. 902.13 s [extra] dist/doc/html/extra/extra.txt
  19685. 902.29 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
  19686. 902.29 s [extra] Phase: installPhase
  19687. 902.29 s [extra] Installing library in /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  19688. 902.62 s [extra] Phase: fixupPhase
  19689. 902.63 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1
  19690. 902.64 s [extra] shrinking /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSextra-1.8.1-BqjEmdQfbI9KG2nXkLylMj-ghc9.4.8.so
  19691. 902.65 s [extra] checking for references to /build/ in /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1...
  19692. 902.68 s [extra] patching script interpreter paths in /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1
  19693. 902.68 s [extra] stripping (with command strip and flags -S -p) in /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/lib
  19694. 902.79 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc
  19695. 902.81 s [extra] checking for references to /build/ in /nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc...
  19696. 902.84 s [extra] patching script interpreter paths in /nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc
  19697. 902.97 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1 /nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc
  19698. 903.44 s [extra:post-build] Pushing 2 paths (39 are already present) using zstd to cache sellout ⏳
  19699. 903.44 s [extra:post-build]
  19700. 903.81 s [extra:post-build] Pushing /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1 (4.30 MiB)
  19701. 903.95 s [extra:post-build] Pushing /nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc (3.22 MiB)
  19702. 905.05 s [extra:post-build]
  19703. 905.05 s [extra:post-build] All done.
  19704. 905.06 s [extra:post-build] Uploading to the NixCI cache: /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1 /nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc
  19705. 905.11 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19706. 905.35 s [extra:post-build] copying 2 paths...
  19707. 905.35 s [extra:post-build] copying path '/nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc' to 'https://cache.nix-ci.com'...
  19708. 905.94 s [extra:post-build] copying path '/nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1' to 'https://cache.nix-ci.com'...
  19709. 907.25 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19710. 907.50 s [extra:post-build] copying 1 paths...
  19711. 907.55 s [extra:post-build] copying path '/nix/store/qn7lk4qpbww9swg7wp6jj3qbrwghkxvr-extra-1.8.1.drv' to 'https://cache.nix-ci.com'...
  19712. 907.73 s Progress: 31 of 43 built, 373 of 373 downloaded from cache
  19713. 907.80 s Building /nix/store/r3bxf573i0cz6mglqadf5v8dx13xad0g-algebraic-graphs-0.7.drv
  19714. 907.88 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  19715. 907.91 s [algebraic-graphs] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  19716. 908.04 s [algebraic-graphs] Phase: unpackPhase
  19717. 908.04 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  19718. 908.05 s [algebraic-graphs] source root is algebraic-graphs-0.7
  19719. 908.05 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  19720. 908.06 s [algebraic-graphs] Phase: patchPhase
  19721. 908.06 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  19722. 908.07 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  19723. 908.07 s [algebraic-graphs] patching file algebraic-graphs.cabal
  19724. 908.07 s [algebraic-graphs] Phase: compileBuildDriverPhase
  19725. 908.07 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.7uwJvT1eoD/setup-package.conf.d -threaded
  19726. 908.12 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.7uwJvT1eoD/Main.o )
  19727. 908.16 s [algebraic-graphs] [2 of 2] Linking Setup
  19728. 909.34 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  19729. 909.35 s [algebraic-graphs] Phase: configurePhase
  19730. 909.36 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.7uwJvT1eoD/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/lib
  19731. 909.73 s [algebraic-graphs] Using Parsec parser
  19732. 909.73 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  19733. 909.73 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.4.0
  19734. 909.73 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.17.2.1
  19735. 909.73 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
  19736. 909.73 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.0
  19737. 909.73 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.5.6.2
  19738. 909.73 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  19739. 909.73 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  19740. 909.73 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.4.0
  19741. 909.73 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.17.2.1
  19742. 909.73 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
  19743. 909.73 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.0
  19744. 909.73 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  19745. 909.73 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  19746. 909.73 s [algebraic-graphs] inspection-testing-0.6.2
  19747. 909.73 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.5.6.2
  19748. 910.02 s [algebraic-graphs] Source component graph:
  19749. 910.02 s [algebraic-graphs] component lib
  19750. 910.02 s [algebraic-graphs] component test:main dependency lib
  19751. 910.02 s [algebraic-graphs] Configured component graph:
  19752. 910.02 s [algebraic-graphs] component algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19753. 910.02 s [algebraic-graphs] include array-0.5.4.0
  19754. 910.02 s [algebraic-graphs] include base-4.17.2.1
  19755. 910.02 s [algebraic-graphs] include containers-0.6.7
  19756. 910.02 s [algebraic-graphs] include deepseq-1.4.8.0
  19757. 910.02 s [algebraic-graphs] include transformers-0.5.6.2
  19758. 910.02 s [algebraic-graphs] component algebraic-graphs-0.7-CDF05JauRV59ivFa6tjL5p-main
  19759. 910.02 s [algebraic-graphs] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  19760. 910.02 s [algebraic-graphs] include algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19761. 910.02 s [algebraic-graphs] include array-0.5.4.0
  19762. 910.02 s [algebraic-graphs] include base-4.17.2.1
  19763. 910.02 s [algebraic-graphs] include containers-0.6.7
  19764. 910.02 s [algebraic-graphs] include deepseq-1.4.8.0
  19765. 910.02 s [algebraic-graphs] include extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  19766. 910.02 s [algebraic-graphs] include inspection-testing-0.6.2-6gWzQuOn6w33uuxsSUSZFy
  19767. 910.02 s [algebraic-graphs] include transformers-0.5.6.2
  19768. 910.02 s [algebraic-graphs] Linked component graph:
  19769. 910.02 s [algebraic-graphs] unit algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19770. 910.02 s [algebraic-graphs] include array-0.5.4.0
  19771. 910.02 s [algebraic-graphs] include base-4.17.2.1
  19772. 910.02 s [algebraic-graphs] include containers-0.6.7
  19773. 910.02 s [algebraic-graphs] include deepseq-1.4.8.0
  19774. 910.02 s [algebraic-graphs] include transformers-0.5.6.2
  19775. 910.02 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Data.Graph.Typed
  19776. 910.02 s [algebraic-graphs] unit algebraic-graphs-0.7-CDF05JauRV59ivFa6tjL5p-main
  19777. 910.02 s [algebraic-graphs] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  19778. 910.02 s [algebraic-graphs] include algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19779. 910.02 s [algebraic-graphs] include array-0.5.4.0
  19780. 910.02 s [algebraic-graphs] include base-4.17.2.1
  19781. 910.02 s [algebraic-graphs] include containers-0.6.7
  19782. 910.02 s [algebraic-graphs] include deepseq-1.4.8.0
  19783. 910.02 s [algebraic-graphs] include extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  19784. 910.02 s [algebraic-graphs] include inspection-testing-0.6.2-6gWzQuOn6w33uuxsSUSZFy
  19785. 910.02 s [algebraic-graphs] include transformers-0.5.6.2
  19786. 910.02 s [algebraic-graphs] Ready component graph:
  19787. 910.02 s [algebraic-graphs] definite algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19788. 910.02 s [algebraic-graphs] depends array-0.5.4.0
  19789. 910.02 s [algebraic-graphs] depends base-4.17.2.1
  19790. 910.02 s [algebraic-graphs] depends containers-0.6.7
  19791. 910.02 s [algebraic-graphs] depends deepseq-1.4.8.0
  19792. 910.02 s [algebraic-graphs] depends transformers-0.5.6.2
  19793. 910.02 s [algebraic-graphs] definite algebraic-graphs-0.7-CDF05JauRV59ivFa6tjL5p-main
  19794. 910.02 s [algebraic-graphs] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  19795. 910.02 s [algebraic-graphs] depends algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19796. 910.02 s [algebraic-graphs] depends array-0.5.4.0
  19797. 910.02 s [algebraic-graphs] depends base-4.17.2.1
  19798. 910.02 s [algebraic-graphs] depends containers-0.6.7
  19799. 910.02 s [algebraic-graphs] depends deepseq-1.4.8.0
  19800. 910.02 s [algebraic-graphs] depends extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  19801. 910.02 s [algebraic-graphs] depends inspection-testing-0.6.2-6gWzQuOn6w33uuxsSUSZFy
  19802. 910.02 s [algebraic-graphs] depends transformers-0.5.6.2
  19803. 910.02 s [algebraic-graphs] Using Cabal-3.8.1.0 compiled by ghc-9.4
  19804. 910.02 s [algebraic-graphs] Using compiler: ghc-9.4.8
  19805. 910.02 s [algebraic-graphs] Using install prefix:
  19806. 910.02 s [algebraic-graphs] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7
  19807. 910.02 s [algebraic-graphs] Executables installed in:
  19808. 910.02 s [algebraic-graphs] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/bin
  19809. 910.02 s [algebraic-graphs] Libraries installed in:
  19810. 910.02 s [algebraic-graphs] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19811. 910.02 s [algebraic-graphs] Dynamic Libraries installed in:
  19812. 910.02 s [algebraic-graphs] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  19813. 910.02 s [algebraic-graphs] Private executables installed in:
  19814. 910.02 s [algebraic-graphs] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.4.8/algebraic-graphs-0.7
  19815. 910.02 s [algebraic-graphs] Data files installed in:
  19816. 910.02 s [algebraic-graphs] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.4.8/algebraic-graphs-0.7
  19817. 910.02 s [algebraic-graphs] Documentation installed in:
  19818. 910.02 s [algebraic-graphs] /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  19819. 910.02 s [algebraic-graphs] Configuration files installed in:
  19820. 910.02 s [algebraic-graphs] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/etc
  19821. 910.02 s [algebraic-graphs] No alex found
  19822. 910.02 s [algebraic-graphs] Using ar found on system at:
  19823. 910.02 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  19824. 910.02 s [algebraic-graphs] No c2hs found
  19825. 910.02 s [algebraic-graphs] No cpphs found
  19826. 910.02 s [algebraic-graphs] No doctest found
  19827. 910.02 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  19828. 910.02 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  19829. 910.02 s [algebraic-graphs] Using ghc version 9.4.8 found on system at:
  19830. 910.02 s [algebraic-graphs] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  19831. 910.02 s [algebraic-graphs] Using ghc-pkg version 9.4.8 found on system at:
  19832. 910.02 s [algebraic-graphs] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  19833. 910.02 s [algebraic-graphs] No ghcjs found
  19834. 910.02 s [algebraic-graphs] No ghcjs-pkg found
  19835. 910.02 s [algebraic-graphs] No greencard found
  19836. 910.02 s [algebraic-graphs] Using haddock version 2.27.0 found on system at:
  19837. 910.02 s [algebraic-graphs] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  19838. 910.02 s [algebraic-graphs] No happy found
  19839. 910.02 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  19840. 910.02 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  19841. 910.02 s [algebraic-graphs] No hmake found
  19842. 910.02 s [algebraic-graphs] Using hpc version 0.68 found on system at:
  19843. 910.02 s [algebraic-graphs] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  19844. 910.02 s [algebraic-graphs] Using hsc2hs version 0.68.8 found on system at:
  19845. 910.02 s [algebraic-graphs] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  19846. 910.02 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  19847. 910.02 s [algebraic-graphs] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  19848. 910.02 s [algebraic-graphs] No jhc found
  19849. 910.02 s [algebraic-graphs] Using ld found on system at:
  19850. 910.02 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  19851. 910.02 s [algebraic-graphs] No pkg-config found
  19852. 910.02 s [algebraic-graphs] Using runghc version 9.4.8 found on system at:
  19853. 910.02 s [algebraic-graphs] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  19854. 910.02 s [algebraic-graphs] Using strip version 2.44 found on system at:
  19855. 910.02 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  19856. 910.02 s [algebraic-graphs] Using tar found on system at:
  19857. 910.02 s [algebraic-graphs] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  19858. 910.02 s [algebraic-graphs] No uhc found
  19859. 910.04 s [algebraic-graphs] Phase: buildPhase
  19860. 910.09 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  19861. 910.09 s [algebraic-graphs] Building library for algebraic-graphs-0.7..
  19862. 910.18 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.o, dist/build/Algebra/Graph/AdjacencyMap.dyn_o )
  19863. 911.08 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.o, dist/build/Algebra/Graph/AdjacencyIntMap.dyn_o )
  19864. 911.65 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.dyn_o )
  19865. 912.00 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.o, dist/build/Algebra/Graph/Internal.dyn_o )
  19866. 912.00 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  19867. 913.03 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.o, dist/build/Algebra/Graph/HigherKinded/Class.dyn_o )
  19868. 913.28 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.dyn_o )
  19869. 913.76 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.dyn_o )
  19870. 914.46 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.o, dist/build/Algebra/Graph/Label.dyn_o )
  19871. 914.46 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.o, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.dyn_o )
  19872. 914.46 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.dyn_o )
  19873. 914.46 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.o, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.dyn_o )
  19874. 914.46 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.o, dist/build/Algebra/Graph/ToGraph.dyn_o )
  19875. 914.46 s [algebraic-graphs]
  19876. 914.46 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [-Wtype-equality-requires-operators]
  19877. 914.46 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19878. 914.46 s [algebraic-graphs] will become an error in a future GHC release.
  19879. 914.46 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19880. 914.46 s [algebraic-graphs] |
  19881. 914.46 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19882. 914.46 s [algebraic-graphs] | ^
  19883. 914.46 s [algebraic-graphs]
  19884. 914.46 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [-Wtype-equality-requires-operators]
  19885. 914.46 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19886. 914.46 s [algebraic-graphs] will become an error in a future GHC release.
  19887. 914.46 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19888. 914.46 s [algebraic-graphs] |
  19889. 914.46 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19890. 914.46 s [algebraic-graphs] | ^
  19891. 914.46 s [algebraic-graphs]
  19892. 914.46 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [-Wtype-equality-requires-operators]
  19893. 914.46 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19894. 914.46 s [algebraic-graphs] will become an error in a future GHC release.
  19895. 914.46 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19896. 914.46 s [algebraic-graphs] |
  19897. 914.46 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19898. 914.46 s [algebraic-graphs] | ^
  19899. 914.46 s [algebraic-graphs]
  19900. 914.46 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [-Wtype-equality-requires-operators]
  19901. 914.46 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19902. 914.46 s [algebraic-graphs] will become an error in a future GHC release.
  19903. 914.46 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19904. 914.46 s [algebraic-graphs] |
  19905. 914.46 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19906. 914.46 s [algebraic-graphs] | ^
  19907. 914.46 s [algebraic-graphs]
  19908. 914.46 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [-Wtype-equality-requires-operators]
  19909. 914.46 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19910. 914.46 s [algebraic-graphs] will become an error in a future GHC release.
  19911. 914.46 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19912. 914.46 s [algebraic-graphs] |
  19913. 914.46 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19914. 914.46 s [algebraic-graphs] | ^
  19915. 914.46 s [algebraic-graphs]
  19916. 914.46 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [-Wtype-equality-requires-operators]
  19917. 914.46 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19918. 914.46 s [algebraic-graphs] will become an error in a future GHC release.
  19919. 914.46 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19920. 914.46 s [algebraic-graphs] |
  19921. 914.46 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19922. 914.46 s [algebraic-graphs] | ^
  19923. 914.46 s [algebraic-graphs]
  19924. 914.46 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [-Wtype-equality-requires-operators]
  19925. 914.46 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19926. 914.46 s [algebraic-graphs] will become an error in a future GHC release.
  19927. 914.46 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19928. 914.46 s [algebraic-graphs] |
  19929. 914.46 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19930. 914.46 s [algebraic-graphs] | ^
  19931. 914.46 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.o, dist/build/Algebra/Graph/Relation.dyn_o )
  19932. 914.46 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.o, dist/build/Algebra/Graph/Relation/Symmetric.dyn_o )
  19933. 914.78 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.o, dist/build/Algebra/Graph/NonEmpty.dyn_o )
  19934. 914.87 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.o, dist/build/Algebra/Graph/Labelled/AdjacencyMap.dyn_o )
  19935. 914.87 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.o, dist/build/Algebra/Graph/Labelled.dyn_o )
  19936. 914.87 s [algebraic-graphs]
  19937. 914.87 s [algebraic-graphs] src/Algebra/Graph/Labelled.hs:74:10: warning: [-Wredundant-constraints]
  19938. 914.87 s [algebraic-graphs] • Redundant constraint: Eq e
  19939. 914.87 s [algebraic-graphs] • In the instance declaration for ‘Ord (Graph e a)’
  19940. 914.87 s [algebraic-graphs] |
  19941. 914.87 s [algebraic-graphs] 74 | instance (Eq e, Monoid e, Ord a, Ord e) => Ord (Graph e a) where
  19942. 914.87 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  19943. 915.53 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.o, dist/build/Algebra/Graph/Labelled/Example/Network.dyn_o )
  19944. 915.68 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.o, dist/build/Algebra/Graph/Labelled/Example/Automaton.dyn_o )
  19945. 915.89 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.o, dist/build/Algebra/Graph/Export.dyn_o )
  19946. 915.89 s [algebraic-graphs]
  19947. 915.89 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [-Wtype-equality-requires-operators]
  19948. 915.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19949. 915.89 s [algebraic-graphs] will become an error in a future GHC release.
  19950. 915.89 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19951. 915.89 s [algebraic-graphs] |
  19952. 915.89 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19953. 915.89 s [algebraic-graphs] | ^
  19954. 915.89 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.o, dist/build/Algebra/Graph/Export/Dot.dyn_o )
  19955. 915.89 s [algebraic-graphs]
  19956. 915.89 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [-Wtype-equality-requires-operators]
  19957. 915.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19958. 915.89 s [algebraic-graphs] will become an error in a future GHC release.
  19959. 915.89 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19960. 915.89 s [algebraic-graphs] |
  19961. 915.89 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19962. 915.89 s [algebraic-graphs] | ^
  19963. 915.89 s [algebraic-graphs]
  19964. 915.89 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [-Wtype-equality-requires-operators]
  19965. 915.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19966. 915.89 s [algebraic-graphs] will become an error in a future GHC release.
  19967. 915.89 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19968. 915.89 s [algebraic-graphs] |
  19969. 915.89 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19970. 915.89 s [algebraic-graphs] | ^
  19971. 915.89 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.o, dist/build/Algebra/Graph/Undirected.dyn_o )
  19972. 915.89 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.o, dist/build/Algebra/Graph/Class.dyn_o )
  19973. 915.89 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.o, dist/build/Algebra/Graph/Relation/Transitive.dyn_o )
  19974. 915.89 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.o, dist/build/Algebra/Graph/Relation/Reflexive.dyn_o )
  19975. 915.89 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.o, dist/build/Algebra/Graph/Relation/Preorder.dyn_o )
  19976. 915.89 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.o, dist/build/Algebra/Graph/Example/Todo.dyn_o )
  19977. 915.89 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.o, dist/build/Data/Graph/Typed.dyn_o )
  19978. 916.13 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  19979. 917.01 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  19980. 917.69 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.p_o )
  19981. 918.05 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  19982. 918.05 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  19983. 919.26 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.p_o )
  19984. 919.63 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.p_o )
  19985. 920.03 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.p_o )
  19986. 920.73 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  19987. 920.73 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.p_o )
  19988. 920.73 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.p_o )
  19989. 920.73 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.p_o )
  19990. 920.73 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  19991. 920.73 s [algebraic-graphs]
  19992. 920.73 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [-Wtype-equality-requires-operators]
  19993. 920.73 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19994. 920.73 s [algebraic-graphs] will become an error in a future GHC release.
  19995. 920.73 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19996. 920.73 s [algebraic-graphs] |
  19997. 920.73 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19998. 920.74 s [algebraic-graphs] | ^
  19999. 920.74 s [algebraic-graphs]
  20000. 920.74 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [-Wtype-equality-requires-operators]
  20001. 920.74 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20002. 920.74 s [algebraic-graphs] will become an error in a future GHC release.
  20003. 920.74 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  20004. 920.74 s [algebraic-graphs] |
  20005. 920.74 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  20006. 920.74 s [algebraic-graphs] | ^
  20007. 920.74 s [algebraic-graphs]
  20008. 920.74 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [-Wtype-equality-requires-operators]
  20009. 920.74 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20010. 920.74 s [algebraic-graphs] will become an error in a future GHC release.
  20011. 920.74 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  20012. 920.74 s [algebraic-graphs] |
  20013. 920.74 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  20014. 920.74 s [algebraic-graphs] | ^
  20015. 920.74 s [algebraic-graphs]
  20016. 920.74 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [-Wtype-equality-requires-operators]
  20017. 920.74 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20018. 920.74 s [algebraic-graphs] will become an error in a future GHC release.
  20019. 920.74 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  20020. 920.74 s [algebraic-graphs] |
  20021. 920.74 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  20022. 920.74 s [algebraic-graphs] | ^
  20023. 920.74 s [algebraic-graphs]
  20024. 920.74 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [-Wtype-equality-requires-operators]
  20025. 920.74 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20026. 920.74 s [algebraic-graphs] will become an error in a future GHC release.
  20027. 920.74 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  20028. 920.74 s [algebraic-graphs] |
  20029. 920.74 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  20030. 920.74 s [algebraic-graphs] | ^
  20031. 920.74 s [algebraic-graphs]
  20032. 920.74 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [-Wtype-equality-requires-operators]
  20033. 920.74 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20034. 920.74 s [algebraic-graphs] will become an error in a future GHC release.
  20035. 920.74 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  20036. 920.74 s [algebraic-graphs] |
  20037. 920.74 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  20038. 920.74 s [algebraic-graphs] | ^
  20039. 920.74 s [algebraic-graphs]
  20040. 920.74 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [-Wtype-equality-requires-operators]
  20041. 920.74 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20042. 920.74 s [algebraic-graphs] will become an error in a future GHC release.
  20043. 920.74 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  20044. 920.74 s [algebraic-graphs] |
  20045. 920.74 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  20046. 920.74 s [algebraic-graphs] | ^
  20047. 920.74 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  20048. 920.92 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.p_o )
  20049. 921.32 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  20050. 921.32 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.p_o )
  20051. 921.32 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  20052. 921.32 s [algebraic-graphs]
  20053. 921.32 s [algebraic-graphs] src/Algebra/Graph/Labelled.hs:74:10: warning: [-Wredundant-constraints]
  20054. 921.32 s [algebraic-graphs] • Redundant constraint: Eq e
  20055. 921.32 s [algebraic-graphs] • In the instance declaration for ‘Ord (Graph e a)’
  20056. 921.32 s [algebraic-graphs] |
  20057. 921.32 s [algebraic-graphs] 74 | instance (Eq e, Monoid e, Ord a, Ord e) => Ord (Graph e a) where
  20058. 921.32 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  20059. 921.77 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.p_o )
  20060. 922.02 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.p_o )
  20061. 922.20 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  20062. 922.20 s [algebraic-graphs]
  20063. 922.20 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [-Wtype-equality-requires-operators]
  20064. 922.20 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20065. 922.20 s [algebraic-graphs] will become an error in a future GHC release.
  20066. 922.20 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  20067. 922.20 s [algebraic-graphs] |
  20068. 922.20 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  20069. 922.20 s [algebraic-graphs] | ^
  20070. 922.20 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.p_o )
  20071. 922.20 s [algebraic-graphs]
  20072. 922.20 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [-Wtype-equality-requires-operators]
  20073. 922.20 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20074. 922.20 s [algebraic-graphs] will become an error in a future GHC release.
  20075. 922.20 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  20076. 922.20 s [algebraic-graphs] |
  20077. 922.20 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  20078. 922.20 s [algebraic-graphs] | ^
  20079. 922.20 s [algebraic-graphs]
  20080. 922.20 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [-Wtype-equality-requires-operators]
  20081. 922.20 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20082. 922.20 s [algebraic-graphs] will become an error in a future GHC release.
  20083. 922.20 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  20084. 922.20 s [algebraic-graphs] |
  20085. 922.20 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  20086. 922.20 s [algebraic-graphs] | ^
  20087. 922.20 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  20088. 922.20 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  20089. 922.20 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.p_o )
  20090. 922.30 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.p_o )
  20091. 922.30 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.p_o )
  20092. 922.30 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.p_o )
  20093. 922.30 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  20094. 923.23 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  20095. 923.31 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7..
  20096. 923.33 s [algebraic-graphs] [ 1 of 23] Compiling Algebra.Graph.Test.Arbitrary ( test/Algebra/Graph/Test/Arbitrary.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.o, dist/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.dyn_o )
  20097. 924.34 s [algebraic-graphs] [ 2 of 23] Compiling Algebra.Graph.Test.API ( test/Algebra/Graph/Test/API.hs, dist/build/main/main-tmp/Algebra/Graph/Test/API.o, dist/build/main/main-tmp/Algebra/Graph/Test/API.dyn_o )
  20098. 926.80 s [algebraic-graphs] [ 3 of 23] Compiling Algebra.Graph.Test ( test/Algebra/Graph/Test.hs, dist/build/main/main-tmp/Algebra/Graph/Test.o, dist/build/main/main-tmp/Algebra/Graph/Test.dyn_o )
  20099. 926.80 s [algebraic-graphs] [ 4 of 23] Compiling Algebra.Graph.Test.Acyclic.AdjacencyMap ( test/Algebra/Graph/Test/Acyclic/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.dyn_o )
  20100. 926.85 s [algebraic-graphs] [ 5 of 23] Compiling Algebra.Graph.Test.Bipartite.AdjacencyMap ( test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.dyn_o )
  20101. 929.03 s [algebraic-graphs] [ 6 of 23] Compiling Algebra.Graph.Test.Example.Todo ( test/Algebra/Graph/Test/Example/Todo.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.o, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.dyn_o )
  20102. 929.09 s [algebraic-graphs] [ 7 of 23] Compiling Algebra.Graph.Test.Export ( test/Algebra/Graph/Test/Export.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Export.o, dist/build/main/main-tmp/Algebra/Graph/Test/Export.dyn_o )
  20103. 929.09 s [algebraic-graphs] [ 8 of 23] Compiling Algebra.Graph.Test.Generic ( test/Algebra/Graph/Test/Generic.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Generic.o, dist/build/main/main-tmp/Algebra/Graph/Test/Generic.dyn_o )
  20104. 932.08 s [algebraic-graphs] [ 9 of 23] Compiling Algebra.Graph.Test.AdjacencyMap ( test/Algebra/Graph/Test/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.dyn_o )
  20105. 932.20 s [algebraic-graphs] [10 of 23] Compiling Algebra.Graph.Test.AdjacencyIntMap ( test/Algebra/Graph/Test/AdjacencyIntMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.dyn_o )
  20106. 932.21 s [algebraic-graphs] [11 of 23] Compiling Algebra.Graph.Test.Graph ( test/Algebra/Graph/Test/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.dyn_o )
  20107. 932.76 s [algebraic-graphs] [12 of 23] Compiling Algebra.Graph.Test.Internal ( test/Algebra/Graph/Test/Internal.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Internal.o, dist/build/main/main-tmp/Algebra/Graph/Test/Internal.dyn_o )
  20108. 932.76 s [algebraic-graphs] [13 of 23] Compiling Algebra.Graph.Test.Label ( test/Algebra/Graph/Test/Label.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Label.o, dist/build/main/main-tmp/Algebra/Graph/Test/Label.dyn_o )
  20109. 932.76 s [algebraic-graphs] [14 of 23] Compiling Algebra.Graph.Test.Labelled.AdjacencyMap ( test/Algebra/Graph/Test/Labelled/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.dyn_o )
  20110. 933.73 s [algebraic-graphs] [15 of 23] Compiling Algebra.Graph.Test.Labelled.Graph ( test/Algebra/Graph/Test/Labelled/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.dyn_o )
  20111. 933.73 s [algebraic-graphs] [16 of 23] Compiling Algebra.Graph.Test.NonEmpty.AdjacencyMap ( test/Algebra/Graph/Test/NonEmpty/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.dyn_o )
  20112. 933.73 s [algebraic-graphs] [17 of 23] Compiling Algebra.Graph.Test.NonEmpty.Graph ( test/Algebra/Graph/Test/NonEmpty/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.dyn_o )
  20113. 933.73 s [algebraic-graphs] [18 of 23] Compiling Algebra.Graph.Test.Relation ( test/Algebra/Graph/Test/Relation.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.dyn_o )
  20114. 933.73 s [algebraic-graphs] [19 of 23] Compiling Algebra.Graph.Test.Relation.Symmetric ( test/Algebra/Graph/Test/Relation/Symmetric.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.dyn_o )
  20115. 933.73 s [algebraic-graphs] [20 of 23] Compiling Algebra.Graph.Test.RewriteRules ( test/Algebra/Graph/Test/RewriteRules.hs, dist/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.o, dist/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.dyn_o )
  20116. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  20117. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  20118. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  20119. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  20120. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.[] passed.
  20121. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  20122. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.[] passed.
  20123. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  20124. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.[] passed.
  20125. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  20126. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  20127. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.[] passed.
  20128. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  20129. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.[] passed.
  20130. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  20131. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.[] passed.
  20132. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  20133. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  20134. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  20135. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  20136. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  20137. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  20138. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  20139. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  20140. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  20141. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  20142. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  20143. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  20144. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  20145. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  20146. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  20147. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  20148. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  20149. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  20150. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.[] passed.
  20151. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  20152. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  20153. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  20154. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  20155. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.[] passed.
  20156. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  20157. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  20158. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  20159. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  20160. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  20161. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  20162. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.[] passed.
  20163. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  20164. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  20165. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  20166. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.[] passed.
  20167. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  20168. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  20169. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  20170. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  20171. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  20172. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  20173. 933.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  20174. 933.73 s [algebraic-graphs] inspection testing successful
  20175. 933.73 s [algebraic-graphs] expected successes: 58
  20176. 933.73 s [algebraic-graphs] [21 of 23] Compiling Algebra.Graph.Test.Undirected ( test/Algebra/Graph/Test/Undirected.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Undirected.o, dist/build/main/main-tmp/Algebra/Graph/Test/Undirected.dyn_o )
  20177. 933.73 s [algebraic-graphs] [22 of 23] Compiling Data.Graph.Test.Typed ( test/Data/Graph/Test/Typed.hs, dist/build/main/main-tmp/Data/Graph/Test/Typed.o, dist/build/main/main-tmp/Data/Graph/Test/Typed.dyn_o )
  20178. 933.74 s [algebraic-graphs] [23 of 23] Compiling Main ( test/Main.hs, dist/build/main/main-tmp/Main.o, dist/build/main/main-tmp/Main.dyn_o )
  20179. 934.41 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  20180. 935.24 s [algebraic-graphs] Phase: checkPhase
  20181. 935.26 s [algebraic-graphs] Running 1 test suites...
  20182. 935.33 s [algebraic-graphs] Test suite main: RUNNING...
  20183. 941.24 s [algebraic-graphs]
  20184. 941.24 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  20185. 941.27 s [algebraic-graphs] OK: show empty == "empty"
  20186. 941.27 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  20187. 941.27 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  20188. 941.27 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  20189. 941.27 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  20190. 941.27 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  20191. 941.27 s [algebraic-graphs]
  20192. 941.27 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  20193. 941.27 s [algebraic-graphs] OK: fromAcyclic empty == empty
  20194. 941.27 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  20195. 941.27 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  20196. 941.27 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  20197. 941.27 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  20198. 941.27 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  20199. 941.27 s [algebraic-graphs]
  20200. 941.27 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  20201. 941.27 s [algebraic-graphs] OK: isEmpty empty == True
  20202. 941.27 s [algebraic-graphs] OK: hasVertex x empty == False
  20203. 941.27 s [algebraic-graphs] OK: vertexCount empty == 0
  20204. 941.27 s [algebraic-graphs] OK: edgeCount empty == 0
  20205. 941.27 s [algebraic-graphs]
  20206. 941.27 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  20207. 941.27 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20208. 941.27 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20209. 941.27 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20210. 941.27 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20211. 941.27 s [algebraic-graphs]
  20212. 941.27 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  20213. 941.27 s [algebraic-graphs] OK: vertices [] == empty
  20214. 941.27 s [algebraic-graphs] OK: vertices [x] == vertex x
  20215. 941.28 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20216. 941.28 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20217. 941.28 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20218. 941.28 s [algebraic-graphs]
  20219. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  20220. 941.28 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  20221. 941.28 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  20222. 941.28 s [algebraic-graphs]
  20223. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  20224. 941.28 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  20225. 941.28 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  20226. 941.28 s [algebraic-graphs]
  20227. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  20228. 941.28 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20229. 941.28 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20230. 941.28 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20231. 941.28 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  20232. 941.28 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20233. 941.28 s [algebraic-graphs]
  20234. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  20235. 941.28 s [algebraic-graphs] OK: isEmpty empty == True
  20236. 941.28 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20237. 941.28 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20238. 941.28 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  20239. 941.28 s [algebraic-graphs]
  20240. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  20241. 941.28 s [algebraic-graphs] OK: hasVertex x empty == False
  20242. 941.28 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20243. 941.28 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20244. 941.28 s [algebraic-graphs]
  20245. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  20246. 941.28 s [algebraic-graphs] OK: hasEdge x y empty == False
  20247. 941.28 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20248. 941.28 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  20249. 941.28 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20250. 941.28 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20251. 941.28 s [algebraic-graphs]
  20252. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  20253. 941.28 s [algebraic-graphs] OK: vertexCount empty == 0
  20254. 941.28 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20255. 941.28 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20256. 941.28 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20257. 941.28 s [algebraic-graphs]
  20258. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  20259. 941.28 s [algebraic-graphs] OK: edgeCount empty == 0
  20260. 941.28 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20261. 941.28 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  20262. 941.28 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20263. 941.28 s [algebraic-graphs]
  20264. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  20265. 941.28 s [algebraic-graphs] OK: vertexList empty == []
  20266. 941.28 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20267. 941.28 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20268. 941.28 s [algebraic-graphs]
  20269. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  20270. 941.28 s [algebraic-graphs] OK: edgeList empty == []
  20271. 941.28 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20272. 941.28 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  20273. 941.28 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20274. 941.28 s [algebraic-graphs]
  20275. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  20276. 941.28 s [algebraic-graphs] OK: adjacencyList empty == []
  20277. 941.28 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20278. 941.28 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  20279. 941.28 s [algebraic-graphs]
  20280. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  20281. 941.28 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20282. 941.28 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20283. 941.28 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20284. 941.28 s [algebraic-graphs]
  20285. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  20286. 941.28 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20287. 941.28 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20288. 941.28 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  20289. 941.28 s [algebraic-graphs]
  20290. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  20291. 941.28 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20292. 941.28 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20293. 941.28 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  20294. 941.28 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  20295. 941.28 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  20296. 941.28 s [algebraic-graphs]
  20297. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  20298. 941.28 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20299. 941.28 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20300. 941.28 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  20301. 941.28 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  20302. 941.28 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  20303. 941.28 s [algebraic-graphs]
  20304. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  20305. 941.28 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20306. 941.28 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20307. 941.28 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  20308. 941.28 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20309. 941.28 s [algebraic-graphs]
  20310. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  20311. 941.28 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  20312. 941.28 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20313. 941.28 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20314. 941.28 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  20315. 941.28 s [algebraic-graphs]
  20316. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  20317. 941.28 s [algebraic-graphs] OK: transpose empty == empty
  20318. 941.28 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20319. 941.28 s [algebraic-graphs] OK: transpose . transpose == id
  20320. 941.28 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20321. 941.28 s [algebraic-graphs]
  20322. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  20323. 941.28 s [algebraic-graphs] OK: induce (const True ) x == x
  20324. 941.28 s [algebraic-graphs] OK: induce (const False) x == empty
  20325. 941.28 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20326. 941.28 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20327. 941.28 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20328. 941.28 s [algebraic-graphs]
  20329. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  20330. 941.28 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20331. 941.28 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  20332. 941.28 s [algebraic-graphs]
  20333. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  20334. 941.28 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  20335. 941.28 s [algebraic-graphs]
  20336. 941.28 s [algebraic-graphs] OK: box x y ~~ box y x
  20337. 941.28 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20338. 941.28 s [algebraic-graphs] OK: box x empty ~~ empty
  20339. 941.28 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20340. 941.28 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20341. 941.28 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20342. 941.28 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20343. 941.28 s [algebraic-graphs]
  20344. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  20345. 941.28 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20346. 941.28 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20347. 941.28 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  20348. 941.28 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20349. 941.28 s [algebraic-graphs]
  20350. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  20351. 941.28 s [algebraic-graphs] OK: topSort empty == []
  20352. 941.28 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  20353. 941.28 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  20354. 941.28 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  20355. 941.28 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  20356. 941.28 s [algebraic-graphs]
  20357. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  20358. 941.28 s [algebraic-graphs] OK: scc empty == empty
  20359. 941.28 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  20360. 941.28 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  20361. 941.28 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  20362. 941.28 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  20363. 941.28 s [algebraic-graphs]
  20364. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  20365. 941.28 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  20366. 941.28 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  20367. 941.28 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  20368. 941.28 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  20369. 941.28 s [algebraic-graphs]
  20370. 941.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  20371. 941.28 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  20372. 941.28 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  20373. 941.28 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  20374. 941.28 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  20375. 941.28 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  20376. 941.28 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  20377. 944.07 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  20378. 944.07 s [algebraic-graphs]
  20379. 944.07 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  20380. 944.07 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  20381. 944.07 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  20382. 944.07 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  20383. 944.07 s [algebraic-graphs]
  20384. 944.07 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  20385. 944.07 s [algebraic-graphs] OK: Arbitrary
  20386. 944.07 s [algebraic-graphs] OK: empty
  20387. 944.07 s [algebraic-graphs] OK: vertex
  20388. 944.07 s [algebraic-graphs] OK: vertices
  20389. 944.07 s [algebraic-graphs] OK: union
  20390. 944.07 s [algebraic-graphs] OK: join
  20391. 944.07 s [algebraic-graphs] OK: transpose
  20392. 944.07 s [algebraic-graphs] OK: box
  20393. 944.07 s [algebraic-graphs] OK: transitiveClosure
  20394. 944.07 s [algebraic-graphs] OK: scc
  20395. 944.07 s [algebraic-graphs] OK: toAcyclic
  20396. 944.07 s [algebraic-graphs] OK: toAcyclicOrd
  20397. 944.07 s [algebraic-graphs]
  20398. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap ============
  20399. 944.07 s [algebraic-graphs] OK: Axioms of graphs
  20400. 944.07 s [algebraic-graphs]
  20401. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  20402. 944.07 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  20403. 944.07 s [algebraic-graphs]
  20404. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  20405. 944.07 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20406. 944.07 s [algebraic-graphs]
  20407. 944.07 s [algebraic-graphs] OK: consistent empty == True
  20408. 944.07 s [algebraic-graphs] OK: consistent (vertex x) == True
  20409. 944.07 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20410. 944.07 s [algebraic-graphs] OK: consistent (connect x y) == True
  20411. 944.07 s [algebraic-graphs] OK: consistent (edge x y) == True
  20412. 944.07 s [algebraic-graphs] OK: consistent (edges xs) == True
  20413. 944.07 s [algebraic-graphs] OK: consistent (stars xs) == True
  20414. 944.07 s [algebraic-graphs]
  20415. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  20416. 944.07 s [algebraic-graphs] OK: show (empty ) == "empty"
  20417. 944.07 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20418. 944.07 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20419. 944.07 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20420. 944.07 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20421. 944.07 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20422. 944.07 s [algebraic-graphs]
  20423. 944.07 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20424. 944.07 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20425. 944.07 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20426. 944.07 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20427. 944.07 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20428. 944.07 s [algebraic-graphs]
  20429. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  20430. 944.07 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20431. 944.07 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20432. 944.07 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20433. 944.07 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20434. 944.07 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20435. 944.07 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20436. 944.07 s [algebraic-graphs] OK: x <= x + y
  20437. 944.07 s [algebraic-graphs] OK: x + y <= x * y
  20438. 944.07 s [algebraic-graphs]
  20439. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  20440. 944.07 s [algebraic-graphs] OK: isEmpty empty == True
  20441. 944.07 s [algebraic-graphs] OK: hasVertex x empty == False
  20442. 944.07 s [algebraic-graphs] OK: vertexCount empty == 0
  20443. 944.07 s [algebraic-graphs] OK: edgeCount empty == 0
  20444. 944.07 s [algebraic-graphs]
  20445. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  20446. 944.07 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20447. 944.07 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20448. 944.07 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20449. 944.07 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20450. 944.07 s [algebraic-graphs]
  20451. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  20452. 944.07 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20453. 944.07 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20454. 944.07 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20455. 944.07 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20456. 944.07 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20457. 944.07 s [algebraic-graphs]
  20458. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  20459. 944.07 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20460. 944.07 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20461. 944.07 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20462. 944.07 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20463. 944.07 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20464. 944.07 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20465. 944.07 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20466. 944.07 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20467. 944.07 s [algebraic-graphs]
  20468. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  20469. 944.07 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20470. 944.07 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20471. 944.07 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20472. 944.07 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20473. 944.07 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20474. 944.07 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20475. 944.07 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20476. 944.07 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20477. 944.07 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20478. 944.07 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20479. 944.07 s [algebraic-graphs]
  20480. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  20481. 944.07 s [algebraic-graphs] OK: vertices [] == empty
  20482. 944.07 s [algebraic-graphs] OK: vertices [x] == vertex x
  20483. 944.07 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20484. 944.07 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20485. 944.07 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20486. 944.07 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20487. 944.07 s [algebraic-graphs]
  20488. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  20489. 944.07 s [algebraic-graphs] OK: edges [] == empty
  20490. 944.07 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20491. 944.07 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20492. 944.07 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20493. 944.07 s [algebraic-graphs]
  20494. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  20495. 944.07 s [algebraic-graphs] OK: overlays [] == empty
  20496. 944.07 s [algebraic-graphs] OK: overlays [x] == x
  20497. 944.07 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20498. 944.07 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20499. 944.07 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20500. 944.07 s [algebraic-graphs]
  20501. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  20502. 944.07 s [algebraic-graphs] OK: connects [] == empty
  20503. 944.07 s [algebraic-graphs] OK: connects [x] == x
  20504. 944.07 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20505. 944.07 s [algebraic-graphs] OK: connects == foldr connect empty
  20506. 944.07 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20507. 944.07 s [algebraic-graphs]
  20508. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  20509. 944.07 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  20510. 944.07 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  20511. 944.07 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  20512. 944.07 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  20513. 944.07 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  20514. 944.07 s [algebraic-graphs]
  20515. 944.07 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  20516. 944.07 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20517. 944.08 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20518. 944.08 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20519. 944.08 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20520. 944.08 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20521. 944.08 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20522. 944.08 s [algebraic-graphs]
  20523. 944.08 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  20524. 944.08 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20525. 944.08 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20526. 944.08 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20527. 944.08 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20528. 944.08 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20529. 944.08 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20530. 944.08 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20531. 944.08 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20532. 944.08 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20533. 944.08 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20534. 944.08 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20535. 944.08 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20536. 944.08 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20537. 944.08 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20538. 944.08 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20539. 944.08 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20540. 944.08 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20541. 944.08 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20542. 944.08 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20543. 944.08 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20544. 944.08 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20545. 944.08 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20546. 944.08 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20547. 944.08 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20548. 944.08 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20549. 944.08 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20550. 944.08 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20551. 944.08 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20552. 944.08 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20553. 944.08 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20554. 944.08 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20555. 944.08 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20556. 944.08 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20557. 944.08 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20558. 944.73 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20559. 944.73 s [algebraic-graphs]
  20560. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  20561. 944.73 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20562. 944.73 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20563. 944.73 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20564. 944.73 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20565. 944.73 s [algebraic-graphs]
  20566. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  20567. 944.73 s [algebraic-graphs] OK: isEmpty empty == True
  20568. 944.73 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20569. 944.73 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20570. 944.73 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20571. 944.73 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20572. 944.73 s [algebraic-graphs]
  20573. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  20574. 944.73 s [algebraic-graphs] OK: hasVertex x empty == False
  20575. 944.73 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20576. 944.73 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20577. 944.73 s [algebraic-graphs]
  20578. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  20579. 944.73 s [algebraic-graphs] OK: hasEdge x y empty == False
  20580. 944.73 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20581. 944.73 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20582. 944.73 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20583. 944.73 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20584. 944.73 s [algebraic-graphs]
  20585. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  20586. 944.73 s [algebraic-graphs] OK: vertexCount empty == 0
  20587. 944.73 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20588. 944.73 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20589. 944.73 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20590. 944.73 s [algebraic-graphs]
  20591. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  20592. 944.73 s [algebraic-graphs] OK: edgeCount empty == 0
  20593. 944.73 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20594. 944.73 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20595. 944.73 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20596. 944.73 s [algebraic-graphs]
  20597. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  20598. 944.73 s [algebraic-graphs] OK: vertexList empty == []
  20599. 944.73 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20600. 944.73 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20601. 944.73 s [algebraic-graphs]
  20602. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  20603. 944.73 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20604. 944.73 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20605. 944.73 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20606. 944.73 s [algebraic-graphs]
  20607. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  20608. 944.73 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20609. 944.73 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20610. 944.73 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20611. 944.73 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20612. 944.73 s [algebraic-graphs]
  20613. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  20614. 944.73 s [algebraic-graphs] OK: edgeList empty == []
  20615. 944.73 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20616. 944.73 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20617. 944.73 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20618. 944.73 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20619. 944.73 s [algebraic-graphs]
  20620. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  20621. 944.73 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20622. 944.73 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20623. 944.73 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20624. 944.73 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20625. 944.73 s [algebraic-graphs]
  20626. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  20627. 944.73 s [algebraic-graphs] OK: adjacencyList empty == []
  20628. 944.73 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20629. 944.73 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20630. 944.73 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20631. 944.73 s [algebraic-graphs]
  20632. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  20633. 944.73 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20634. 944.73 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20635. 944.73 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20636. 944.73 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20637. 944.73 s [algebraic-graphs]
  20638. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  20639. 944.73 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20640. 944.73 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20641. 944.73 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20642. 944.73 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20643. 944.73 s [algebraic-graphs]
  20644. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  20645. 944.73 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20646. 944.73 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20647. 944.73 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20648. 944.73 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20649. 944.73 s [algebraic-graphs]
  20650. 944.73 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  20651. 944.73 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20652. 944.73 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20653. 944.73 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20654. 944.73 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20655. 944.73 s [algebraic-graphs]
  20656. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  20657. 944.74 s [algebraic-graphs] OK: path [] == empty
  20658. 944.74 s [algebraic-graphs] OK: path [x] == vertex x
  20659. 944.74 s [algebraic-graphs] OK: path [x,y] == edge x y
  20660. 944.74 s [algebraic-graphs]
  20661. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  20662. 944.74 s [algebraic-graphs] OK: circuit [] == empty
  20663. 944.74 s [algebraic-graphs] OK: circuit [x] == edge x x
  20664. 944.74 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20665. 944.74 s [algebraic-graphs]
  20666. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  20667. 944.74 s [algebraic-graphs] OK: clique [] == empty
  20668. 944.74 s [algebraic-graphs] OK: clique [x] == vertex x
  20669. 944.74 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20670. 944.74 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20671. 944.74 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20672. 944.74 s [algebraic-graphs]
  20673. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  20674. 944.74 s [algebraic-graphs] OK: biclique [] [] == empty
  20675. 944.74 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20676. 944.74 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20677. 944.74 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20678. 944.74 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20679. 944.74 s [algebraic-graphs]
  20680. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  20681. 944.74 s [algebraic-graphs] OK: star x [] == vertex x
  20682. 944.74 s [algebraic-graphs] OK: star x [y] == edge x y
  20683. 944.74 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20684. 944.74 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20685. 944.74 s [algebraic-graphs]
  20686. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  20687. 944.74 s [algebraic-graphs] OK: stars [] == empty
  20688. 944.74 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20689. 944.74 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20690. 944.74 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20691. 944.74 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20692. 944.74 s [algebraic-graphs] OK: stars . adjacencyList == id
  20693. 944.74 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20694. 944.74 s [algebraic-graphs]
  20695. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  20696. 944.74 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20697. 944.74 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20698. 944.74 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20699. 944.74 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20700. 944.74 s [algebraic-graphs]
  20701. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  20702. 944.74 s [algebraic-graphs] OK: forest [] == empty
  20703. 944.74 s [algebraic-graphs] OK: forest [x] == tree x
  20704. 944.74 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20705. 944.74 s [algebraic-graphs] OK: forest == overlays . map tree
  20706. 944.74 s [algebraic-graphs]
  20707. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  20708. 944.74 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20709. 944.74 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20710. 944.74 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20711. 944.74 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20712. 944.74 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20713. 944.74 s [algebraic-graphs]
  20714. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  20715. 944.74 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20716. 944.74 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20717. 944.74 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20718. 944.74 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20719. 944.74 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20720. 944.74 s [algebraic-graphs]
  20721. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  20722. 944.74 s [algebraic-graphs] OK: replaceVertex x x == id
  20723. 944.74 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20724. 944.74 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20725. 944.74 s [algebraic-graphs]
  20726. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  20727. 944.74 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20728. 944.74 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20729. 944.74 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20730. 944.74 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20731. 944.74 s [algebraic-graphs]
  20732. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  20733. 944.74 s [algebraic-graphs] OK: transpose empty == empty
  20734. 944.74 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20735. 944.74 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20736. 944.74 s [algebraic-graphs] OK: transpose . transpose == id
  20737. 944.74 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20738. 944.74 s [algebraic-graphs]
  20739. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  20740. 944.74 s [algebraic-graphs] OK: gmap f empty == empty
  20741. 944.74 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20742. 944.74 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20743. 944.74 s [algebraic-graphs] OK: gmap id == id
  20744. 944.74 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20745. 944.74 s [algebraic-graphs]
  20746. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  20747. 944.74 s [algebraic-graphs] OK: induce (const True ) x == x
  20748. 944.74 s [algebraic-graphs] OK: induce (const False) x == empty
  20749. 944.74 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20750. 944.74 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20751. 944.74 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20752. 944.74 s [algebraic-graphs]
  20753. 944.74 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  20754. 944.74 s [algebraic-graphs] OK: compose empty x == empty
  20755. 944.74 s [algebraic-graphs] OK: compose x empty == empty
  20756. 944.74 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20757. 944.74 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20758. 944.74 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20759. 944.74 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20760. 944.94 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20761. 944.94 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20762. 944.94 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20763. 944.94 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20764. 944.94 s [algebraic-graphs]
  20765. 944.94 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  20766. 944.94 s [algebraic-graphs] OK: closure empty == empty
  20767. 944.95 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20768. 944.95 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20769. 944.95 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20770. 944.95 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20771. 944.95 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20772. 944.95 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20773. 944.95 s [algebraic-graphs] OK: closure . closure == closure
  20774. 944.95 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20775. 944.95 s [algebraic-graphs]
  20776. 944.95 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  20777. 944.95 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20778. 944.95 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20779. 944.95 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20780. 944.95 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20781. 944.95 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20782. 944.95 s [algebraic-graphs]
  20783. 944.95 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  20784. 944.95 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20785. 944.95 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20786. 944.95 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20787. 944.95 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20788. 944.95 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20789. 944.95 s [algebraic-graphs]
  20790. 944.95 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  20791. 944.95 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20792. 944.95 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20793. 944.95 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20794. 944.95 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20795. 944.95 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20796. 944.95 s [algebraic-graphs]
  20797. 944.95 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  20798. 944.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20799. 944.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20800. 944.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20801. 944.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20802. 944.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20803. 944.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20804. 944.95 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20805. 944.95 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20806. 944.95 s [algebraic-graphs] OK: bfsForest x [] == []
  20807. 944.95 s [algebraic-graphs] OK: bfsForest empty vs == []
  20808. 944.95 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20809. 944.95 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20810. 944.95 s [algebraic-graphs]
  20811. 944.95 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  20812. 944.95 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20813. 944.95 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20814. 944.95 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20815. 944.95 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20816. 944.95 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20817. 944.95 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20818. 944.95 s [algebraic-graphs] OK: bfs empty vs == []
  20819. 944.95 s [algebraic-graphs] OK: bfs x [] == []
  20820. 944.95 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20821. 944.95 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20822. 944.95 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20823. 944.95 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20824. 944.95 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20825. 944.95 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20826. 944.95 s [algebraic-graphs]
  20827. 944.95 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  20828. 944.95 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20829. 944.95 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20830. 944.95 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20831. 944.95 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20832. 944.95 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20833. 944.95 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20834. 944.95 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20835. 944.95 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20836. 944.95 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20837. 944.95 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20838. 944.95 s [algebraic-graphs]
  20839. 944.95 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  20840. 944.95 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20841. 944.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20842. 944.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20843. 944.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20844. 944.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20845. 944.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20846. 944.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20847. 944.95 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20848. 944.95 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20849. 944.95 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20850. 944.95 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20851. 944.95 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20852. 944.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20853. 944.95 s [algebraic-graphs]
  20854. 944.95 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20855. 944.95 s [algebraic-graphs] OK: dfs empty vs == []
  20856. 944.95 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20857. 944.95 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20858. 944.95 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20859. 944.95 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20860. 944.95 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20861. 944.95 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20862. 944.95 s [algebraic-graphs] OK: dfs x [] == []
  20863. 944.95 s [algebraic-graphs]
  20864. 944.95 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20865. 944.95 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20866. 944.95 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20867. 944.95 s [algebraic-graphs]
  20868. 944.95 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20869. 944.95 s [algebraic-graphs] OK: reachable empty x == []
  20870. 944.95 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20871. 944.95 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20872. 944.95 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20873. 944.95 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20874. 944.95 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20875. 944.95 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20876. 944.95 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20877. 944.95 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20878. 944.95 s [algebraic-graphs]
  20879. 944.95 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20880. 944.95 s [algebraic-graphs]
  20881. 944.95 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  20882. 944.95 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20883. 944.95 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20884. 944.95 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20885. 944.95 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20886. 944.95 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20887. 944.95 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20888. 944.95 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20889. 944.95 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20890. 944.95 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20891. 944.95 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20892. 944.95 s [algebraic-graphs]
  20893. 944.95 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  20894. 944.95 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20895. 944.95 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20896. 944.95 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20897. 944.95 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20898. 944.95 s [algebraic-graphs]
  20899. 944.95 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  20900. 944.95 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20901. 944.95 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20902. 944.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20903. 944.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20904. 944.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20905. 944.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20906. 944.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20907. 944.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20908. 944.95 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20909. 944.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20910. 944.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20911. 944.95 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20912. 944.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20913. 948.97 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20914. 948.97 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20915. 949.12 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20916. 949.12 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20917. 949.12 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20918. 949.12 s [algebraic-graphs]
  20919. 949.12 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  20920. 949.12 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20921. 949.12 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20922. 949.12 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20923. 949.12 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20924. 949.12 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20925. 949.12 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20926. 949.12 s [algebraic-graphs]
  20927. 949.12 s [algebraic-graphs] ============ AdjacencyMap ============
  20928. 949.12 s [algebraic-graphs] OK: Axioms of graphs
  20929. 949.12 s [algebraic-graphs]
  20930. 949.12 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  20931. 949.12 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20932. 949.12 s [algebraic-graphs]
  20933. 949.12 s [algebraic-graphs] OK: consistent empty == True
  20934. 949.12 s [algebraic-graphs] OK: consistent (vertex x) == True
  20935. 949.12 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20936. 949.12 s [algebraic-graphs] OK: consistent (connect x y) == True
  20937. 949.12 s [algebraic-graphs] OK: consistent (edge x y) == True
  20938. 949.12 s [algebraic-graphs] OK: consistent (edges xs) == True
  20939. 949.12 s [algebraic-graphs] OK: consistent (stars xs) == True
  20940. 949.12 s [algebraic-graphs]
  20941. 949.12 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  20942. 949.12 s [algebraic-graphs] OK: show (empty ) == "empty"
  20943. 949.12 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20944. 949.12 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20945. 949.12 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20946. 949.12 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20947. 949.12 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20948. 949.12 s [algebraic-graphs]
  20949. 949.12 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20950. 949.12 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20951. 949.12 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20952. 949.12 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20953. 949.12 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20954. 949.12 s [algebraic-graphs]
  20955. 949.12 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  20956. 949.12 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20957. 949.12 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20958. 949.12 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20959. 949.12 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20960. 949.12 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20961. 949.12 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20962. 949.12 s [algebraic-graphs] OK: x <= x + y
  20963. 949.12 s [algebraic-graphs] OK: x + y <= x * y
  20964. 949.12 s [algebraic-graphs]
  20965. 949.12 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  20966. 949.12 s [algebraic-graphs] OK: isEmpty empty == True
  20967. 949.12 s [algebraic-graphs] OK: hasVertex x empty == False
  20968. 949.12 s [algebraic-graphs] OK: vertexCount empty == 0
  20969. 949.12 s [algebraic-graphs] OK: edgeCount empty == 0
  20970. 949.12 s [algebraic-graphs]
  20971. 949.12 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  20972. 949.12 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20973. 949.12 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20974. 949.12 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20975. 949.12 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20976. 949.12 s [algebraic-graphs]
  20977. 949.12 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  20978. 949.12 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20979. 949.12 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20980. 949.12 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20981. 949.12 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20982. 949.12 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20983. 949.12 s [algebraic-graphs]
  20984. 949.12 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  20985. 949.12 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20986. 949.12 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20987. 949.12 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20988. 949.12 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20989. 949.12 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20990. 949.12 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20991. 949.12 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20992. 949.12 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20993. 949.12 s [algebraic-graphs]
  20994. 949.12 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  20995. 949.12 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20996. 949.12 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20997. 949.12 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20998. 949.12 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20999. 949.12 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21000. 949.12 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21001. 949.12 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  21002. 949.12 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21003. 949.12 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21004. 949.12 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21005. 949.12 s [algebraic-graphs]
  21006. 949.12 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  21007. 949.12 s [algebraic-graphs] OK: vertices [] == empty
  21008. 949.12 s [algebraic-graphs] OK: vertices [x] == vertex x
  21009. 949.12 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21010. 949.12 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21011. 949.12 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21012. 949.12 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21013. 949.12 s [algebraic-graphs]
  21014. 949.12 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  21015. 949.12 s [algebraic-graphs] OK: edges [] == empty
  21016. 949.12 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21017. 949.12 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21018. 949.12 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21019. 949.13 s [algebraic-graphs]
  21020. 949.13 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  21021. 949.13 s [algebraic-graphs] OK: overlays [] == empty
  21022. 949.13 s [algebraic-graphs] OK: overlays [x] == x
  21023. 949.13 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21024. 949.13 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21025. 949.13 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21026. 949.13 s [algebraic-graphs]
  21027. 949.13 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  21028. 949.13 s [algebraic-graphs] OK: connects [] == empty
  21029. 949.13 s [algebraic-graphs] OK: connects [x] == x
  21030. 949.13 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21031. 949.13 s [algebraic-graphs] OK: connects == foldr connect empty
  21032. 949.13 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21033. 949.13 s [algebraic-graphs]
  21034. 949.13 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  21035. 949.13 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  21036. 949.13 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  21037. 949.13 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  21038. 949.13 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  21039. 949.13 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  21040. 949.13 s [algebraic-graphs]
  21041. 949.13 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  21042. 949.13 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21043. 949.13 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21044. 949.13 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21045. 949.13 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21046. 949.13 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21047. 949.13 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21048. 949.13 s [algebraic-graphs]
  21049. 949.13 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  21050. 949.13 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21051. 949.13 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21052. 949.13 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21053. 949.13 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21054. 949.13 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21055. 949.13 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21056. 949.13 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21057. 949.13 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21058. 949.13 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21059. 949.13 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21060. 949.13 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21061. 949.13 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21062. 949.13 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  21063. 949.13 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  21064. 949.13 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  21065. 949.13 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  21066. 949.13 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  21067. 949.13 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21068. 949.13 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21069. 949.13 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21070. 949.13 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21071. 949.13 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21072. 949.13 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21073. 949.13 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21074. 949.13 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21075. 949.13 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21076. 949.13 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21077. 949.13 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21078. 949.13 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21079. 949.13 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21080. 949.13 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21081. 949.13 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21082. 949.13 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21083. 950.48 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21084. 950.48 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21085. 950.48 s [algebraic-graphs]
  21086. 950.48 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  21087. 950.48 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  21088. 950.48 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  21089. 950.48 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  21090. 950.48 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  21091. 950.48 s [algebraic-graphs]
  21092. 950.48 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  21093. 950.48 s [algebraic-graphs] OK: isEmpty empty == True
  21094. 950.48 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21095. 950.48 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21096. 950.48 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21097. 950.48 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21098. 950.48 s [algebraic-graphs]
  21099. 950.48 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  21100. 950.48 s [algebraic-graphs] OK: hasVertex x empty == False
  21101. 950.48 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21102. 950.48 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21103. 950.48 s [algebraic-graphs]
  21104. 950.48 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  21105. 950.48 s [algebraic-graphs] OK: hasEdge x y empty == False
  21106. 950.48 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21107. 950.48 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21108. 950.48 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21109. 950.48 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21110. 950.48 s [algebraic-graphs]
  21111. 950.48 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  21112. 950.48 s [algebraic-graphs] OK: vertexCount empty == 0
  21113. 950.48 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21114. 950.48 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21115. 950.48 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21116. 950.48 s [algebraic-graphs]
  21117. 950.48 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  21118. 950.48 s [algebraic-graphs] OK: edgeCount empty == 0
  21119. 950.48 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21120. 950.48 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21121. 950.48 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21122. 950.48 s [algebraic-graphs]
  21123. 950.48 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  21124. 950.48 s [algebraic-graphs] OK: vertexList empty == []
  21125. 950.48 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21126. 950.48 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21127. 950.48 s [algebraic-graphs]
  21128. 950.48 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  21129. 950.48 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21130. 950.48 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21131. 950.48 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21132. 950.48 s [algebraic-graphs]
  21133. 950.48 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  21134. 950.48 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21135. 950.48 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  21136. 950.48 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  21137. 950.48 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  21138. 950.48 s [algebraic-graphs]
  21139. 950.48 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  21140. 950.48 s [algebraic-graphs] OK: edgeList empty == []
  21141. 950.48 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21142. 950.48 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21143. 950.48 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  21144. 950.48 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21145. 950.48 s [algebraic-graphs]
  21146. 950.48 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  21147. 950.48 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21148. 950.48 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21149. 950.48 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21150. 950.48 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21151. 950.48 s [algebraic-graphs]
  21152. 950.48 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  21153. 950.48 s [algebraic-graphs] OK: adjacencyList empty == []
  21154. 950.48 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  21155. 950.48 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  21156. 950.48 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  21157. 950.48 s [algebraic-graphs]
  21158. 950.48 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  21159. 950.48 s [algebraic-graphs] OK: preSet x empty == Set.empty
  21160. 950.48 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  21161. 950.48 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  21162. 950.48 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  21163. 950.48 s [algebraic-graphs]
  21164. 950.48 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  21165. 950.48 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  21166. 950.48 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  21167. 950.48 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  21168. 950.48 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  21169. 950.48 s [algebraic-graphs]
  21170. 950.48 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  21171. 950.49 s [algebraic-graphs] OK: postSet x empty == Set.empty
  21172. 950.49 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  21173. 950.49 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  21174. 950.49 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  21175. 950.49 s [algebraic-graphs]
  21176. 950.49 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  21177. 950.49 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  21178. 950.49 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  21179. 950.49 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  21180. 950.49 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  21181. 950.49 s [algebraic-graphs]
  21182. 950.49 s [algebraic-graphs] ============ AdjacencyMap.path ============
  21183. 950.49 s [algebraic-graphs] OK: path [] == empty
  21184. 950.49 s [algebraic-graphs] OK: path [x] == vertex x
  21185. 950.49 s [algebraic-graphs] OK: path [x,y] == edge x y
  21186. 950.49 s [algebraic-graphs]
  21187. 950.49 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  21188. 950.49 s [algebraic-graphs] OK: circuit [] == empty
  21189. 950.49 s [algebraic-graphs] OK: circuit [x] == edge x x
  21190. 950.49 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21191. 950.49 s [algebraic-graphs]
  21192. 950.49 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  21193. 950.49 s [algebraic-graphs] OK: clique [] == empty
  21194. 950.49 s [algebraic-graphs] OK: clique [x] == vertex x
  21195. 950.49 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21196. 950.49 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21197. 950.49 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21198. 950.49 s [algebraic-graphs]
  21199. 950.49 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  21200. 950.49 s [algebraic-graphs] OK: biclique [] [] == empty
  21201. 950.49 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21202. 950.49 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21203. 950.49 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21204. 950.49 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21205. 950.49 s [algebraic-graphs]
  21206. 950.49 s [algebraic-graphs] ============ AdjacencyMap.star ============
  21207. 950.49 s [algebraic-graphs] OK: star x [] == vertex x
  21208. 950.49 s [algebraic-graphs] OK: star x [y] == edge x y
  21209. 950.49 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21210. 950.49 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21211. 950.49 s [algebraic-graphs]
  21212. 950.49 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  21213. 950.49 s [algebraic-graphs] OK: stars [] == empty
  21214. 950.49 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21215. 950.49 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21216. 950.49 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21217. 950.49 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21218. 950.49 s [algebraic-graphs] OK: stars . adjacencyList == id
  21219. 950.49 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21220. 950.49 s [algebraic-graphs]
  21221. 950.49 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  21222. 950.49 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21223. 950.49 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21224. 950.49 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21225. 950.49 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21226. 950.49 s [algebraic-graphs]
  21227. 950.49 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  21228. 950.49 s [algebraic-graphs] OK: forest [] == empty
  21229. 950.49 s [algebraic-graphs] OK: forest [x] == tree x
  21230. 950.49 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21231. 950.49 s [algebraic-graphs] OK: forest == overlays . map tree
  21232. 950.49 s [algebraic-graphs]
  21233. 950.49 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  21234. 950.49 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21235. 950.49 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21236. 950.49 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21237. 950.49 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21238. 950.49 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21239. 950.49 s [algebraic-graphs]
  21240. 950.49 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  21241. 950.49 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21242. 950.49 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21243. 950.49 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21244. 950.49 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21245. 950.49 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21246. 950.49 s [algebraic-graphs]
  21247. 950.49 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  21248. 950.49 s [algebraic-graphs] OK: replaceVertex x x == id
  21249. 950.49 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21250. 950.49 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21251. 950.49 s [algebraic-graphs]
  21252. 950.49 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  21253. 950.49 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21254. 950.49 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21255. 950.49 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21256. 950.49 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21257. 950.49 s [algebraic-graphs]
  21258. 950.49 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  21259. 950.49 s [algebraic-graphs] OK: transpose empty == empty
  21260. 950.49 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  21261. 950.49 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  21262. 950.49 s [algebraic-graphs] OK: transpose . transpose == id
  21263. 950.49 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  21264. 950.49 s [algebraic-graphs]
  21265. 950.49 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  21266. 950.49 s [algebraic-graphs] OK: gmap f empty == empty
  21267. 950.49 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21268. 950.49 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21269. 950.49 s [algebraic-graphs] OK: gmap id == id
  21270. 950.49 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21271. 950.49 s [algebraic-graphs]
  21272. 950.49 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  21273. 950.49 s [algebraic-graphs] OK: induce (const True ) x == x
  21274. 950.49 s [algebraic-graphs] OK: induce (const False) x == empty
  21275. 950.49 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21276. 950.49 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21277. 950.49 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21278. 950.49 s [algebraic-graphs]
  21279. 950.49 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  21280. 950.49 s [algebraic-graphs] OK: compose empty x == empty
  21281. 950.49 s [algebraic-graphs] OK: compose x empty == empty
  21282. 950.49 s [algebraic-graphs] OK: compose (vertex x) y == empty
  21283. 950.49 s [algebraic-graphs] OK: compose x (vertex y) == empty
  21284. 950.49 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  21285. 950.49 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  21286. 952.26 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  21287. 952.26 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  21288. 952.26 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  21289. 952.26 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  21290. 952.26 s [algebraic-graphs]
  21291. 952.26 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  21292. 952.26 s [algebraic-graphs] OK: closure empty == empty
  21293. 952.26 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  21294. 952.26 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  21295. 952.26 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  21296. 952.26 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  21297. 952.26 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  21298. 952.26 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  21299. 952.26 s [algebraic-graphs] OK: closure . closure == closure
  21300. 952.26 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  21301. 952.26 s [algebraic-graphs]
  21302. 952.26 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  21303. 952.26 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  21304. 952.26 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  21305. 952.26 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  21306. 952.26 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  21307. 952.26 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  21308. 952.26 s [algebraic-graphs]
  21309. 952.26 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  21310. 952.26 s [algebraic-graphs] OK: symmetricClosure empty == empty
  21311. 952.26 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  21312. 952.26 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  21313. 952.26 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  21314. 952.26 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  21315. 952.26 s [algebraic-graphs]
  21316. 952.26 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  21317. 952.26 s [algebraic-graphs] OK: transitiveClosure empty == empty
  21318. 952.26 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  21319. 952.26 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  21320. 952.26 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  21321. 952.26 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  21322. 952.26 s [algebraic-graphs]
  21323. 952.26 s [algebraic-graphs] ============ AdjacencyMap.box ============
  21324. 952.26 s [algebraic-graphs] OK: box x y ~~ box y x
  21325. 952.26 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  21326. 952.26 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  21327. 952.26 s [algebraic-graphs] OK: box x empty ~~ empty
  21328. 952.26 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21329. 952.26 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  21330. 952.26 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  21331. 952.26 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21332. 952.26 s [algebraic-graphs]
  21333. 952.26 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  21334. 952.26 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  21335. 952.26 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  21336. 952.26 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  21337. 952.26 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  21338. 952.26 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  21339. 952.26 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  21340. 952.26 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  21341. 952.26 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  21342. 952.26 s [algebraic-graphs] OK: bfsForest x [] == []
  21343. 952.26 s [algebraic-graphs] OK: bfsForest empty vs == []
  21344. 952.26 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  21345. 952.26 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  21346. 952.26 s [algebraic-graphs]
  21347. 952.26 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  21348. 952.26 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  21349. 952.26 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  21350. 952.26 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  21351. 952.26 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  21352. 952.26 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  21353. 952.26 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  21354. 952.26 s [algebraic-graphs] OK: bfs empty vs == []
  21355. 952.26 s [algebraic-graphs] OK: bfs x [] == []
  21356. 952.26 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  21357. 952.26 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  21358. 952.26 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  21359. 952.26 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  21360. 952.26 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  21361. 952.26 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  21362. 952.26 s [algebraic-graphs]
  21363. 952.26 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  21364. 952.26 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  21365. 952.26 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  21366. 952.26 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  21367. 952.26 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  21368. 952.26 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  21369. 952.26 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  21370. 952.26 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  21371. 952.26 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  21372. 952.26 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  21373. 952.26 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  21374. 952.26 s [algebraic-graphs]
  21375. 952.26 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  21376. 952.26 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  21377. 952.26 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  21378. 952.26 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  21379. 952.26 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  21380. 952.26 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  21381. 952.26 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  21382. 952.26 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  21383. 952.26 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  21384. 952.26 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  21385. 952.26 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  21386. 952.26 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  21387. 952.26 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  21388. 952.26 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  21389. 952.26 s [algebraic-graphs]
  21390. 952.26 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  21391. 952.26 s [algebraic-graphs] OK: dfs empty vs == []
  21392. 952.26 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  21393. 952.26 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  21394. 952.26 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  21395. 952.26 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  21396. 952.26 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  21397. 952.26 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  21398. 952.26 s [algebraic-graphs] OK: dfs x [] == []
  21399. 952.26 s [algebraic-graphs]
  21400. 952.26 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  21401. 952.26 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  21402. 952.26 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  21403. 952.26 s [algebraic-graphs]
  21404. 952.26 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  21405. 952.26 s [algebraic-graphs] OK: reachable empty x == []
  21406. 952.26 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  21407. 952.26 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  21408. 952.26 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  21409. 952.26 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  21410. 952.26 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  21411. 952.26 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  21412. 952.26 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  21413. 952.26 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  21414. 952.26 s [algebraic-graphs]
  21415. 952.26 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  21416. 952.26 s [algebraic-graphs]
  21417. 952.26 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  21418. 952.26 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  21419. 952.26 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  21420. 952.26 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  21421. 952.26 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  21422. 952.26 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  21423. 952.26 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  21424. 952.26 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  21425. 952.26 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  21426. 952.26 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  21427. 952.26 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  21428. 952.26 s [algebraic-graphs]
  21429. 952.26 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  21430. 952.26 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  21431. 952.26 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  21432. 952.26 s [algebraic-graphs] OK: isAcyclic . circuit == null
  21433. 952.26 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  21434. 952.26 s [algebraic-graphs]
  21435. 952.26 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  21436. 952.26 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  21437. 952.26 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  21438. 952.26 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  21439. 952.26 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  21440. 952.26 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  21441. 952.26 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  21442. 952.26 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  21443. 956.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  21444. 956.81 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  21445. 956.96 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  21446. 956.96 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  21447. 956.96 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  21448. 956.96 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  21449. 956.96 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  21450. 956.96 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  21451. 956.96 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  21452. 956.96 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  21453. 956.96 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  21454. 956.96 s [algebraic-graphs]
  21455. 956.96 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  21456. 956.96 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  21457. 956.96 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  21458. 956.96 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  21459. 956.96 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  21460. 956.96 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  21461. 956.96 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  21462. 956.96 s [algebraic-graphs]
  21463. 956.96 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  21464. 956.96 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21465. 956.96 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21466. 956.96 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21467. 956.96 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21468. 956.96 s [algebraic-graphs]
  21469. 956.96 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  21470. 956.96 s [algebraic-graphs] OK: scc empty == empty
  21471. 956.96 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  21472. 956.96 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  21473. 956.96 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  21474. 956.96 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  21475. 956.96 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  21476. 956.96 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  21477. 956.96 s [algebraic-graphs] OK: isAcyclic . scc == const True
  21478. 956.96 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  21479. 956.96 s [algebraic-graphs] OK: scc g == KL.scc g
  21480. 956.96 s [algebraic-graphs]
  21481. 956.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  21482. 956.96 s [algebraic-graphs] OK: 0 == rightVertex 0
  21483. 956.96 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  21484. 956.96 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  21485. 956.96 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  21486. 956.96 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  21487. 956.96 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  21488. 956.96 s [algebraic-graphs]
  21489. 956.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  21490. 956.96 s [algebraic-graphs] OK: show empty == "empty"
  21491. 956.96 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  21492. 956.96 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  21493. 956.96 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  21494. 956.96 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  21495. 956.96 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  21496. 956.96 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  21497. 956.96 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  21498. 956.96 s [algebraic-graphs]
  21499. 956.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  21500. 956.96 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  21501. 956.96 s [algebraic-graphs]
  21502. 956.96 s [algebraic-graphs] OK: x + y == y + x
  21503. 956.96 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  21504. 956.96 s [algebraic-graphs] OK: x * empty == x
  21505. 956.96 s [algebraic-graphs] OK: empty * x == x
  21506. 956.96 s [algebraic-graphs] OK: x * y == y * x
  21507. 956.96 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  21508. 956.96 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  21509. 956.96 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  21510. 956.96 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  21511. 956.96 s [algebraic-graphs] OK: x + empty == x
  21512. 956.96 s [algebraic-graphs] OK: empty + x == x
  21513. 956.96 s [algebraic-graphs] OK: x + x == x
  21514. 956.96 s [algebraic-graphs] OK: x * y + x + y == x * y
  21515. 956.96 s [algebraic-graphs] OK: x * x * x == x * x
  21516. 956.96 s [algebraic-graphs]
  21517. 956.96 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  21518. 956.96 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  21519. 956.96 s [algebraic-graphs]
  21520. 956.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  21521. 956.96 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  21522. 956.96 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  21523. 956.96 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  21524. 956.96 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  21525. 956.96 s [algebraic-graphs]
  21526. 956.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  21527. 956.96 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  21528. 956.96 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  21529. 956.96 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  21530. 956.96 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  21531. 956.96 s [algebraic-graphs]
  21532. 956.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  21533. 956.96 s [algebraic-graphs] OK: isEmpty empty == True
  21534. 956.96 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  21535. 956.96 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  21536. 956.96 s [algebraic-graphs] OK: hasVertex x empty == False
  21537. 956.96 s [algebraic-graphs]
  21538. 956.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  21539. 956.96 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  21540. 956.96 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  21541. 956.96 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21542. 956.96 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21543. 956.96 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  21544. 956.96 s [algebraic-graphs]
  21545. 956.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  21546. 956.96 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  21547. 956.96 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  21548. 956.96 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21549. 956.96 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21550. 956.96 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  21551. 956.96 s [algebraic-graphs]
  21552. 956.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  21553. 956.96 s [algebraic-graphs] OK: vertex . Left == leftVertex
  21554. 956.96 s [algebraic-graphs] OK: vertex . Right == rightVertex
  21555. 956.96 s [algebraic-graphs]
  21556. 956.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  21557. 956.96 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  21558. 956.96 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  21559. 956.96 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  21560. 956.96 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21561. 956.96 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  21562. 956.96 s [algebraic-graphs]
  21563. 956.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  21564. 956.96 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21565. 956.96 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21566. 956.97 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21567. 956.97 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21568. 956.97 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21569. 956.97 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21570. 956.97 s [algebraic-graphs]
  21571. 956.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  21572. 956.97 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  21573. 956.97 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  21574. 956.97 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  21575. 956.97 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  21576. 956.97 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  21577. 956.97 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21578. 956.97 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21579. 956.97 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21580. 956.97 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21581. 956.97 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21582. 956.97 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  21583. 956.97 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  21584. 956.97 s [algebraic-graphs]
  21585. 956.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  21586. 956.97 s [algebraic-graphs] OK: vertices [] [] == empty
  21587. 956.97 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  21588. 956.97 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  21589. 956.97 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  21590. 956.97 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  21591. 956.97 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  21592. 956.97 s [algebraic-graphs]
  21593. 956.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  21594. 956.97 s [algebraic-graphs] OK: edges [] == empty
  21595. 956.97 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21596. 956.97 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21597. 956.97 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  21598. 956.97 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21599. 956.97 s [algebraic-graphs]
  21600. 956.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  21601. 956.97 s [algebraic-graphs] OK: overlays [] == empty
  21602. 956.97 s [algebraic-graphs] OK: overlays [x] == x
  21603. 956.97 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21604. 956.97 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21605. 956.97 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21606. 956.97 s [algebraic-graphs]
  21607. 956.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  21608. 956.97 s [algebraic-graphs] OK: connects [] == empty
  21609. 956.97 s [algebraic-graphs] OK: connects [x] == x
  21610. 956.97 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21611. 956.97 s [algebraic-graphs] OK: connects == foldr connect empty
  21612. 956.97 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21613. 956.97 s [algebraic-graphs]
  21614. 956.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  21615. 957.91 s [algebraic-graphs] OK: swap empty == empty
  21616. 957.91 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  21617. 957.91 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  21618. 957.91 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  21619. 957.91 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  21620. 957.91 s [algebraic-graphs] OK: swap . swap == id
  21621. 957.91 s [algebraic-graphs]
  21622. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  21623. 957.91 s [algebraic-graphs] OK: toBipartite empty == empty
  21624. 957.91 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  21625. 957.91 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  21626. 957.91 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  21627. 957.91 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  21628. 957.91 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  21629. 957.91 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  21630. 957.91 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  21631. 957.91 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  21632. 957.91 s [algebraic-graphs]
  21633. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  21634. 957.91 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  21635. 957.91 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  21636. 957.91 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  21637. 957.91 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  21638. 957.91 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  21639. 957.91 s [algebraic-graphs]
  21640. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  21641. 957.91 s [algebraic-graphs] OK: fromBipartite empty == empty
  21642. 957.91 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  21643. 957.91 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  21644. 957.91 s [algebraic-graphs]
  21645. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  21646. 957.91 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  21647. 957.91 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  21648. 957.91 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  21649. 957.91 s [algebraic-graphs]
  21650. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  21651. 957.91 s [algebraic-graphs] OK: isEmpty empty == True
  21652. 957.91 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21653. 957.91 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21654. 957.91 s [algebraic-graphs] OK: isEmpty == (==) empty
  21655. 957.91 s [algebraic-graphs]
  21656. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  21657. 957.91 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  21658. 957.91 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21659. 957.91 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21660. 957.91 s [algebraic-graphs]
  21661. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  21662. 957.91 s [algebraic-graphs] OK: hasRightVertex x empty == False
  21663. 957.91 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21664. 957.91 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21665. 957.91 s [algebraic-graphs]
  21666. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  21667. 957.91 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  21668. 957.91 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  21669. 957.91 s [algebraic-graphs]
  21670. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  21671. 957.91 s [algebraic-graphs] OK: hasEdge x y empty == False
  21672. 957.91 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21673. 957.91 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21674. 957.91 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21675. 957.91 s [algebraic-graphs]
  21676. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  21677. 957.91 s [algebraic-graphs] OK: leftVertexCount empty == 0
  21678. 957.91 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  21679. 957.91 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  21680. 957.91 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  21681. 957.91 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  21682. 957.91 s [algebraic-graphs]
  21683. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  21684. 957.91 s [algebraic-graphs] OK: rightVertexCount empty == 0
  21685. 957.91 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  21686. 957.91 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  21687. 957.91 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  21688. 957.91 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  21689. 957.91 s [algebraic-graphs]
  21690. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  21691. 957.91 s [algebraic-graphs] OK: vertexCount empty == 0
  21692. 957.91 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21693. 957.91 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  21694. 957.91 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  21695. 957.91 s [algebraic-graphs]
  21696. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  21697. 957.91 s [algebraic-graphs] OK: edgeCount empty == 0
  21698. 957.91 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21699. 957.91 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21700. 957.91 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21701. 957.91 s [algebraic-graphs]
  21702. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  21703. 957.91 s [algebraic-graphs] OK: leftVertexList empty == []
  21704. 957.91 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  21705. 957.91 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  21706. 957.91 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  21707. 957.91 s [algebraic-graphs]
  21708. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  21709. 957.91 s [algebraic-graphs] OK: rightVertexList empty == []
  21710. 957.91 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  21711. 957.91 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  21712. 957.91 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  21713. 957.91 s [algebraic-graphs]
  21714. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  21715. 957.91 s [algebraic-graphs] OK: vertexList empty == []
  21716. 957.91 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21717. 957.91 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  21718. 957.91 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  21719. 957.91 s [algebraic-graphs]
  21720. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  21721. 957.91 s [algebraic-graphs] OK: edgeList empty == []
  21722. 957.91 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21723. 957.91 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21724. 957.91 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21725. 957.91 s [algebraic-graphs]
  21726. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  21727. 957.91 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  21728. 957.91 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  21729. 957.91 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  21730. 957.91 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  21731. 957.91 s [algebraic-graphs]
  21732. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  21733. 957.91 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  21734. 957.91 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  21735. 957.91 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  21736. 957.91 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  21737. 957.91 s [algebraic-graphs]
  21738. 957.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  21739. 957.91 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21740. 957.91 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21741. 957.91 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  21742. 957.91 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  21743. 957.91 s [algebraic-graphs]
  21744. 957.92 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  21745. 957.92 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21746. 957.92 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21747. 957.92 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21748. 957.92 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21749. 957.92 s [algebraic-graphs]
  21750. 957.92 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  21751. 957.92 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  21752. 957.92 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  21753. 957.92 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  21754. 957.92 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  21755. 957.92 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  21756. 957.92 s [algebraic-graphs]
  21757. 957.92 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  21758. 957.92 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  21759. 957.92 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  21760. 957.92 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  21761. 957.92 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  21762. 957.92 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  21763. 957.92 s [algebraic-graphs]
  21764. 957.92 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  21765. 957.92 s [algebraic-graphs] OK: evenList [] == Nil
  21766. 957.92 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  21767. 957.92 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  21768. 957.92 s [algebraic-graphs]
  21769. 957.92 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  21770. 957.92 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  21771. 957.92 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  21772. 957.92 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  21773. 957.92 s [algebraic-graphs]
  21774. 957.92 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  21775. 957.92 s [algebraic-graphs] OK: path Nil == empty
  21776. 957.92 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  21777. 957.92 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  21778. 957.92 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  21779. 957.92 s [algebraic-graphs]
  21780. 957.92 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  21781. 957.92 s [algebraic-graphs] OK: circuit [] == empty
  21782. 957.92 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  21783. 957.92 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  21784. 957.92 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  21785. 957.92 s [algebraic-graphs]
  21786. 957.92 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  21787. 957.92 s [algebraic-graphs] OK: biclique [] [] == empty
  21788. 957.92 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  21789. 957.92 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  21790. 957.92 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  21791. 957.92 s [algebraic-graphs]
  21792. 957.92 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  21793. 957.92 s [algebraic-graphs] OK: star x [] == leftVertex x
  21794. 957.92 s [algebraic-graphs] OK: star x [y] == edge x y
  21795. 957.92 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21796. 957.92 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  21797. 957.92 s [algebraic-graphs]
  21798. 957.92 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  21799. 957.92 s [algebraic-graphs] OK: stars [] == empty
  21800. 957.92 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  21801. 957.92 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21802. 957.92 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21803. 961.95 s Waiting for lock on pandoc-lua-engine
  21804. 961.95 s Waiting for lock on pandoc-server-0.1.0.11-doc
  21805. 973.57 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21806. 973.57 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21807. 973.61 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21808. 973.61 s [algebraic-graphs]
  21809. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  21810. 973.61 s [algebraic-graphs] OK: mesh xs [] == empty
  21811. 973.61 s [algebraic-graphs] OK: mesh [] ys == empty
  21812. 973.61 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  21813. 973.61 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  21814. 973.61 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  21815. 973.61 s [algebraic-graphs]
  21816. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  21817. 973.61 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  21818. 973.61 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  21819. 973.61 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  21820. 973.61 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  21821. 973.61 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  21822. 973.61 s [algebraic-graphs]
  21823. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  21824. 973.61 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  21825. 973.61 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  21826. 973.61 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  21827. 973.61 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  21828. 973.61 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  21829. 973.61 s [algebraic-graphs]
  21830. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  21831. 973.61 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  21832. 973.61 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21833. 973.61 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  21834. 973.61 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  21835. 973.61 s [algebraic-graphs]
  21836. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  21837. 973.61 s [algebraic-graphs] OK: bimap f g empty == empty
  21838. 973.61 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  21839. 973.61 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  21840. 973.61 s [algebraic-graphs] OK: bimap id id == id
  21841. 973.61 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  21842. 973.61 s [algebraic-graphs]
  21843. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  21844. 973.61 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  21845. 973.61 s [algebraic-graphs]
  21846. 973.61 s [algebraic-graphs] OK: box x y ~~ box y x
  21847. 973.61 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21848. 973.61 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21849. 973.61 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  21850. 973.61 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  21851. 973.61 s [algebraic-graphs] OK: box x empty ~~ empty
  21852. 973.61 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  21853. 973.61 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21854. 973.61 s [algebraic-graphs]
  21855. 973.61 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  21856. 973.61 s [algebraic-graphs]
  21857. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  21858. 973.61 s [algebraic-graphs] OK: consistent empty == True
  21859. 973.61 s [algebraic-graphs] OK: consistent (vertex x) == True
  21860. 973.61 s [algebraic-graphs] OK: consistent (edge x y) == True
  21861. 973.61 s [algebraic-graphs] OK: consistent (edges x) == True
  21862. 973.61 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  21863. 973.61 s [algebraic-graphs] OK: consistent (swap x) == True
  21864. 973.61 s [algebraic-graphs] OK: consistent (circuit xs) == True
  21865. 973.61 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  21866. 973.61 s [algebraic-graphs]
  21867. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  21868. 973.61 s [algebraic-graphs] OK: detectParts empty == Right empty
  21869. 973.61 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  21870. 973.61 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  21871. 973.61 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  21872. 973.61 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  21873. 973.61 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  21874. 973.61 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  21875. 973.61 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  21876. 973.61 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  21877. 973.61 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  21878. 973.61 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  21879. 973.61 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  21880. 973.61 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  21881. 973.61 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  21882. 973.61 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  21883. 973.61 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  21884. 973.61 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  21885. 973.61 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  21886. 973.61 s [algebraic-graphs]
  21887. 973.61 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  21888. 973.61 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  21889. 973.61 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  21890. 973.61 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  21891. 973.61 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  21892. 973.61 s [algebraic-graphs]
  21893. 973.61 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21894. 973.61 s [algebraic-graphs] OK: show (matching []) == "matching []"
  21895. 973.61 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  21896. 973.61 s [algebraic-graphs]
  21897. 973.61 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21898. 973.61 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  21899. 973.61 s [algebraic-graphs]
  21900. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  21901. 973.61 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  21902. 973.61 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  21903. 973.61 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  21904. 973.61 s [algebraic-graphs]
  21905. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  21906. 973.61 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  21907. 973.61 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  21908. 973.61 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  21909. 973.61 s [algebraic-graphs]
  21910. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  21911. 973.61 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  21912. 973.61 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  21913. 973.61 s [algebraic-graphs]
  21914. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  21915. 973.61 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  21916. 973.61 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  21917. 973.61 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  21918. 973.61 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  21919. 973.61 s [algebraic-graphs]
  21920. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  21921. 973.61 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  21922. 973.61 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  21923. 973.61 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  21924. 973.61 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  21925. 973.61 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  21926. 973.61 s [algebraic-graphs]
  21927. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  21928. 973.61 s [algebraic-graphs] OK: maxMatching empty == matching []
  21929. 973.61 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  21930. 973.61 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  21931. 973.61 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  21932. 973.61 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  21933. 973.61 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21934. 973.61 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  21935. 973.61 s [algebraic-graphs]
  21936. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  21937. 973.61 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  21938. 973.61 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21939. 973.61 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  21940. 973.61 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  21941. 973.61 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  21942. 973.61 s [algebraic-graphs]
  21943. 973.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  21944. 973.61 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  21945. 975.71 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  21946. 975.71 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  21947. 975.71 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  21948. 975.71 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21949. 975.71 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  21950. 975.71 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  21951. 975.71 s [algebraic-graphs]
  21952. 975.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  21953. 975.71 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  21954. 975.71 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21955. 975.71 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  21956. 975.71 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  21957. 975.71 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  21958. 975.71 s [algebraic-graphs]
  21959. 975.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  21960. 975.71 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  21961. 975.71 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  21962. 975.71 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  21963. 975.71 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  21964. 975.71 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  21965. 975.71 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  21966. 975.71 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  21967. 975.71 s [algebraic-graphs]
  21968. 975.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  21969. 975.71 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  21970. 975.71 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  21971. 975.71 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  21972. 975.71 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  21973. 975.71 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  21974. 975.71 s [algebraic-graphs]
  21975. 975.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  21976. 975.71 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  21977. 975.71 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  21978. 975.71 s [algebraic-graphs]
  21979. 975.71 s [algebraic-graphs] ============ Export.Eq ============
  21980. 975.71 s [algebraic-graphs] OK: mempty /= literal ""
  21981. 975.71 s [algebraic-graphs]
  21982. 975.71 s [algebraic-graphs] ============ Export.Ord ============
  21983. 975.71 s [algebraic-graphs] OK: mempty < literal ""
  21984. 975.71 s [algebraic-graphs]
  21985. 975.71 s [algebraic-graphs] ============ Export.isEmpty ============
  21986. 975.71 s [algebraic-graphs] OK: isEmpty mempty == True
  21987. 975.71 s [algebraic-graphs] OK: isEmpty (literal "") == False
  21988. 975.71 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  21989. 975.71 s [algebraic-graphs]
  21990. 975.71 s [algebraic-graphs] ============ Export.literal ============
  21991. 975.71 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  21992. 975.71 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  21993. 975.71 s [algebraic-graphs] OK: render . literal == id
  21994. 975.71 s [algebraic-graphs]
  21995. 975.71 s [algebraic-graphs] ============ Export.render ============
  21996. 975.71 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  21997. 975.71 s [algebraic-graphs] OK: render mempty == mempty
  21998. 975.71 s [algebraic-graphs]
  21999. 975.71 s [algebraic-graphs] ============ Export.<+> ============
  22000. 975.71 s [algebraic-graphs] OK: x <+> mempty == x
  22001. 975.71 s [algebraic-graphs] OK: mempty <+> x == x
  22002. 975.71 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  22003. 975.71 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  22004. 975.71 s [algebraic-graphs]
  22005. 975.71 s [algebraic-graphs] ============ Export.brackets ============
  22006. 975.71 s [algebraic-graphs] OK: brackets "i" == "[i]"
  22007. 975.71 s [algebraic-graphs] OK: brackets mempty == "[]"
  22008. 975.71 s [algebraic-graphs]
  22009. 975.71 s [algebraic-graphs] ============ Export.doubleQuotes ============
  22010. 975.71 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  22011. 975.71 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  22012. 975.71 s [algebraic-graphs]
  22013. 975.71 s [algebraic-graphs] ============ Export.indent ============
  22014. 975.71 s [algebraic-graphs] OK: indent 0 == id
  22015. 975.71 s [algebraic-graphs] OK: indent 1 mempty == " "
  22016. 975.71 s [algebraic-graphs]
  22017. 975.71 s [algebraic-graphs] ============ Export.unlines ============
  22018. 975.71 s [algebraic-graphs] OK: unlines [] == mempty
  22019. 975.71 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  22020. 975.71 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  22021. 975.71 s [algebraic-graphs]
  22022. 975.71 s [algebraic-graphs] ============ Export.export ============
  22023. 975.71 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  22024. 975.71 s [algebraic-graphs]
  22025. 975.71 s [algebraic-graphs] ============ Export.Dot.export ============
  22026. 975.71 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  22027. 975.71 s [algebraic-graphs]
  22028. 975.71 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  22029. 975.71 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  22030. 975.71 s [algebraic-graphs]
  22031. 975.71 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  22032. 975.71 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  22033. 975.71 s [algebraic-graphs]
  22034. 975.71 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  22035. 975.71 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  22036. 975.71 s [algebraic-graphs]
  22037. 975.71 s [algebraic-graphs] ============ Graph ============
  22038. 975.71 s [algebraic-graphs] OK: Axioms of graphs
  22039. 975.71 s [algebraic-graphs] OK: Theorems of graphs
  22040. 975.71 s [algebraic-graphs]
  22041. 975.71 s [algebraic-graphs] ============ Graph.Ord ============
  22042. 975.71 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22043. 975.71 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22044. 975.71 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22045. 975.71 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22046. 975.71 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22047. 975.71 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22048. 975.71 s [algebraic-graphs] OK: x <= x + y
  22049. 975.71 s [algebraic-graphs] OK: x + y <= x * y
  22050. 975.71 s [algebraic-graphs]
  22051. 975.71 s [algebraic-graphs] ============ Graph.empty ============
  22052. 975.71 s [algebraic-graphs] OK: isEmpty empty == True
  22053. 975.71 s [algebraic-graphs] OK: hasVertex x empty == False
  22054. 975.71 s [algebraic-graphs] OK: vertexCount empty == 0
  22055. 975.71 s [algebraic-graphs] OK: edgeCount empty == 0
  22056. 975.71 s [algebraic-graphs]
  22057. 975.71 s [algebraic-graphs] ============ Graph.vertex ============
  22058. 975.71 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22059. 975.71 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22060. 975.71 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22061. 975.71 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22062. 975.71 s [algebraic-graphs]
  22063. 975.71 s [algebraic-graphs] ============ Graph.edge ============
  22064. 975.71 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22065. 975.71 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22066. 975.71 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22067. 975.71 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22068. 975.71 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22069. 975.71 s [algebraic-graphs]
  22070. 975.71 s [algebraic-graphs] ============ Graph.overlay ============
  22071. 975.71 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22072. 975.71 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22073. 975.71 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22074. 975.71 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22075. 975.71 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22076. 975.71 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22077. 975.71 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22078. 975.71 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22079. 975.71 s [algebraic-graphs]
  22080. 975.71 s [algebraic-graphs] ============ Graph.connect ============
  22081. 975.71 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  22082. 975.71 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22083. 975.71 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22084. 975.71 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22085. 975.71 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22086. 975.71 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22087. 975.72 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22088. 975.72 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22089. 975.72 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22090. 975.72 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22091. 975.72 s [algebraic-graphs]
  22092. 975.72 s [algebraic-graphs] ============ Graph.vertices ============
  22093. 975.72 s [algebraic-graphs] OK: vertices [] == empty
  22094. 975.72 s [algebraic-graphs] OK: vertices [x] == vertex x
  22095. 975.72 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22096. 975.72 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22097. 975.72 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22098. 975.72 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22099. 975.72 s [algebraic-graphs]
  22100. 975.72 s [algebraic-graphs] ============ Graph.edges ============
  22101. 975.72 s [algebraic-graphs] OK: edges [] == empty
  22102. 975.72 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  22103. 975.72 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  22104. 975.72 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  22105. 975.72 s [algebraic-graphs]
  22106. 975.72 s [algebraic-graphs] ============ Graph.overlays ============
  22107. 975.72 s [algebraic-graphs] OK: overlays [] == empty
  22108. 975.72 s [algebraic-graphs] OK: overlays [x] == x
  22109. 975.72 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22110. 975.72 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22111. 975.72 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22112. 975.72 s [algebraic-graphs]
  22113. 975.72 s [algebraic-graphs] ============ Graph.connects ============
  22114. 975.72 s [algebraic-graphs] OK: connects [] == empty
  22115. 975.72 s [algebraic-graphs] OK: connects [x] == x
  22116. 975.72 s [algebraic-graphs] OK: connects [x,y] == connect x y
  22117. 975.72 s [algebraic-graphs] OK: connects == foldr connect empty
  22118. 975.72 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  22119. 975.72 s [algebraic-graphs]
  22120. 975.72 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  22121. 975.72 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22122. 975.72 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22123. 975.72 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22124. 975.72 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22125. 975.72 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  22126. 975.72 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22127. 975.72 s [algebraic-graphs]
  22128. 975.72 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  22129. 975.72 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  22130. 975.72 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  22131. 975.72 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  22132. 975.72 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  22133. 975.72 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  22134. 975.72 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  22135. 975.72 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  22136. 975.72 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  22137. 975.72 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  22138. 976.42 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  22139. 976.42 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  22140. 976.42 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  22141. 976.42 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  22142. 976.42 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  22143. 976.42 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  22144. 976.42 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  22145. 976.42 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  22146. 976.42 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  22147. 976.42 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  22148. 976.42 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  22149. 976.42 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  22150. 976.42 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  22151. 976.42 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  22152. 976.42 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  22153. 976.42 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  22154. 976.42 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  22155. 976.42 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  22156. 976.42 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  22157. 976.42 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  22158. 976.42 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  22159. 976.42 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  22160. 976.42 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  22161. 976.42 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  22162. 976.42 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  22163. 976.42 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  22164. 976.42 s [algebraic-graphs]
  22165. 976.42 s [algebraic-graphs] ============ Graph.foldg ============
  22166. 976.42 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  22167. 976.42 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  22168. 976.42 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  22169. 976.42 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  22170. 976.42 s [algebraic-graphs]
  22171. 976.42 s [algebraic-graphs] ============ Graph.isEmpty ============
  22172. 976.42 s [algebraic-graphs] OK: isEmpty empty == True
  22173. 976.42 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22174. 976.42 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22175. 976.42 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22176. 976.42 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  22177. 976.42 s [algebraic-graphs]
  22178. 976.42 s [algebraic-graphs] ============ Graph.hasVertex ============
  22179. 976.42 s [algebraic-graphs] OK: hasVertex x empty == False
  22180. 976.42 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22181. 976.42 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22182. 976.42 s [algebraic-graphs]
  22183. 976.42 s [algebraic-graphs] ============ Graph.hasEdge ============
  22184. 976.42 s [algebraic-graphs] OK: hasEdge x y empty == False
  22185. 976.42 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22186. 976.42 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22187. 976.42 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22188. 976.42 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22189. 976.42 s [algebraic-graphs]
  22190. 976.42 s [algebraic-graphs] ============ Graph.vertexCount ============
  22191. 976.42 s [algebraic-graphs] OK: vertexCount empty == 0
  22192. 976.42 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22193. 976.42 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22194. 976.42 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22195. 976.42 s [algebraic-graphs]
  22196. 976.42 s [algebraic-graphs] ============ Graph.edgeCount ============
  22197. 976.42 s [algebraic-graphs] OK: edgeCount empty == 0
  22198. 976.42 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22199. 976.42 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22200. 976.42 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22201. 976.42 s [algebraic-graphs]
  22202. 976.42 s [algebraic-graphs] ============ Graph.vertexList ============
  22203. 976.42 s [algebraic-graphs] OK: vertexList empty == []
  22204. 976.42 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22205. 976.42 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22206. 976.42 s [algebraic-graphs]
  22207. 976.42 s [algebraic-graphs] ============ Graph.vertexSet ============
  22208. 976.42 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22209. 976.42 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22210. 976.42 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22211. 976.42 s [algebraic-graphs]
  22212. 976.42 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  22213. 976.42 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  22214. 976.42 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  22215. 976.42 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  22216. 976.42 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  22217. 976.42 s [algebraic-graphs]
  22218. 976.42 s [algebraic-graphs] ============ Graph.edgeList ============
  22219. 976.42 s [algebraic-graphs] OK: edgeList empty == []
  22220. 976.42 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22221. 976.42 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22222. 976.42 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22223. 976.42 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  22224. 976.42 s [algebraic-graphs]
  22225. 976.42 s [algebraic-graphs] ============ Graph.edgeSet ============
  22226. 976.42 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22227. 976.42 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22228. 976.42 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22229. 976.42 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  22230. 976.42 s [algebraic-graphs]
  22231. 976.42 s [algebraic-graphs] ============ Graph.adjacencyList ============
  22232. 976.42 s [algebraic-graphs] OK: adjacencyList empty == []
  22233. 976.42 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  22234. 976.42 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  22235. 976.42 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  22236. 976.42 s [algebraic-graphs]
  22237. 976.42 s [algebraic-graphs] ============ Graph.preSet ============
  22238. 976.42 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22239. 976.42 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22240. 976.42 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22241. 976.42 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22242. 976.42 s [algebraic-graphs]
  22243. 976.42 s [algebraic-graphs] ============ Graph.preIntSet ============
  22244. 976.42 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  22245. 976.42 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  22246. 976.42 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  22247. 976.42 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  22248. 976.42 s [algebraic-graphs]
  22249. 976.42 s [algebraic-graphs] ============ Graph.postSet ============
  22250. 976.42 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22251. 976.42 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22252. 976.42 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22253. 976.42 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22254. 976.42 s [algebraic-graphs]
  22255. 976.42 s [algebraic-graphs] ============ Graph.postIntSet ============
  22256. 976.42 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  22257. 976.42 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  22258. 976.42 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  22259. 976.42 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  22260. 976.42 s [algebraic-graphs]
  22261. 976.42 s [algebraic-graphs] ============ Graph.size ============
  22262. 976.42 s [algebraic-graphs] OK: size empty == 1
  22263. 976.42 s [algebraic-graphs] OK: size (vertex x) == 1
  22264. 976.42 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22265. 976.42 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22266. 976.42 s [algebraic-graphs] OK: size x >= 1
  22267. 976.42 s [algebraic-graphs] OK: size x >= vertexCount x
  22268. 976.42 s [algebraic-graphs]
  22269. 976.42 s [algebraic-graphs] ============ Graph.path ============
  22270. 976.42 s [algebraic-graphs] OK: path [] == empty
  22271. 976.42 s [algebraic-graphs] OK: path [x] == vertex x
  22272. 976.42 s [algebraic-graphs] OK: path [x,y] == edge x y
  22273. 976.42 s [algebraic-graphs]
  22274. 976.42 s [algebraic-graphs] ============ Graph.circuit ============
  22275. 976.42 s [algebraic-graphs] OK: circuit [] == empty
  22276. 976.42 s [algebraic-graphs] OK: circuit [x] == edge x x
  22277. 976.42 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  22278. 976.42 s [algebraic-graphs]
  22279. 976.42 s [algebraic-graphs] ============ Graph.clique ============
  22280. 976.42 s [algebraic-graphs] OK: clique [] == empty
  22281. 976.42 s [algebraic-graphs] OK: clique [x] == vertex x
  22282. 976.42 s [algebraic-graphs] OK: clique [x,y] == edge x y
  22283. 976.42 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  22284. 976.42 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  22285. 976.42 s [algebraic-graphs]
  22286. 976.42 s [algebraic-graphs] ============ Graph.biclique ============
  22287. 976.42 s [algebraic-graphs] OK: biclique [] [] == empty
  22288. 976.42 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  22289. 976.42 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  22290. 976.42 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22291. 976.42 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  22292. 976.42 s [algebraic-graphs]
  22293. 976.42 s [algebraic-graphs] ============ Graph.star ============
  22294. 976.42 s [algebraic-graphs] OK: star x [] == vertex x
  22295. 976.42 s [algebraic-graphs] OK: star x [y] == edge x y
  22296. 976.42 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  22297. 976.42 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  22298. 976.42 s [algebraic-graphs]
  22299. 976.42 s [algebraic-graphs] ============ Graph.stars ============
  22300. 976.42 s [algebraic-graphs] OK: stars [] == empty
  22301. 976.42 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  22302. 976.42 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  22303. 976.42 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  22304. 976.42 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  22305. 976.42 s [algebraic-graphs] OK: stars . adjacencyList == id
  22306. 976.42 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  22307. 976.42 s [algebraic-graphs]
  22308. 976.42 s [algebraic-graphs] ============ Graph.tree ============
  22309. 976.42 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22310. 976.42 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  22311. 976.42 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22312. 976.42 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  22313. 976.42 s [algebraic-graphs]
  22314. 976.42 s [algebraic-graphs] ============ Graph.forest ============
  22315. 976.42 s [algebraic-graphs] OK: forest [] == empty
  22316. 976.42 s [algebraic-graphs] OK: forest [x] == tree x
  22317. 976.42 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  22318. 976.42 s [algebraic-graphs] OK: forest == overlays . map tree
  22319. 976.42 s [algebraic-graphs]
  22320. 976.42 s [algebraic-graphs] ============ Graph.removeVertex ============
  22321. 979.80 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22322. 979.80 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22323. 979.80 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  22324. 979.93 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  22325. 979.93 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22326. 979.93 s [algebraic-graphs]
  22327. 979.93 s [algebraic-graphs] ============ Graph.removeEdge ============
  22328. 979.93 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  22329. 979.93 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22330. 979.93 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22331. 979.93 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22332. 979.93 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22333. 979.93 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  22334. 979.93 s [algebraic-graphs]
  22335. 979.93 s [algebraic-graphs] ============ Graph.replaceVertex ============
  22336. 979.93 s [algebraic-graphs] OK: replaceVertex x x == id
  22337. 979.93 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22338. 979.93 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22339. 979.93 s [algebraic-graphs]
  22340. 979.93 s [algebraic-graphs] ============ Graph.mergeVertices ============
  22341. 979.93 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22342. 979.93 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22343. 979.93 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22344. 979.93 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22345. 979.93 s [algebraic-graphs]
  22346. 979.93 s [algebraic-graphs] ============ Graph.transpose ============
  22347. 979.93 s [algebraic-graphs] OK: transpose empty == empty
  22348. 979.93 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22349. 979.93 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22350. 979.93 s [algebraic-graphs] OK: transpose . transpose == id
  22351. 979.93 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22352. 979.93 s [algebraic-graphs]
  22353. 979.93 s [algebraic-graphs] ============ Graph.gmap ============
  22354. 979.93 s [algebraic-graphs] OK: gmap f empty == empty
  22355. 979.93 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22356. 979.93 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  22357. 979.93 s [algebraic-graphs] OK: gmap id == id
  22358. 979.93 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22359. 979.93 s [algebraic-graphs]
  22360. 979.93 s [algebraic-graphs] ============ Graph.induce ============
  22361. 979.93 s [algebraic-graphs] OK: induce (const True ) x == x
  22362. 979.93 s [algebraic-graphs] OK: induce (const False) x == empty
  22363. 979.93 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22364. 979.93 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22365. 979.93 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22366. 979.93 s [algebraic-graphs]
  22367. 979.93 s [algebraic-graphs] ============ Graph.induceJust ============
  22368. 979.93 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22369. 979.93 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22370. 979.93 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22371. 979.93 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22372. 979.93 s [algebraic-graphs]
  22373. 979.93 s [algebraic-graphs] ============ Graph.compose ============
  22374. 979.93 s [algebraic-graphs] OK: compose empty x == empty
  22375. 979.93 s [algebraic-graphs] OK: compose x empty == empty
  22376. 979.93 s [algebraic-graphs] OK: compose (vertex x) y == empty
  22377. 979.93 s [algebraic-graphs] OK: compose x (vertex y) == empty
  22378. 979.93 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  22379. 979.93 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  22380. 979.93 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  22381. 979.93 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  22382. 979.93 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  22383. 979.93 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  22384. 979.93 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  22385. 979.93 s [algebraic-graphs]
  22386. 979.93 s [algebraic-graphs] ============ Graph.(===) ============
  22387. 979.93 s [algebraic-graphs] OK: x === x == True
  22388. 979.93 s [algebraic-graphs] OK: x === x + empty == False
  22389. 979.93 s [algebraic-graphs] OK: x + y === x + y == True
  22390. 979.93 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  22391. 979.93 s [algebraic-graphs] OK: x + y === x * y == False
  22392. 979.93 s [algebraic-graphs]
  22393. 979.93 s [algebraic-graphs] ============ Graph.mesh ============
  22394. 979.93 s [algebraic-graphs] OK: mesh xs [] == empty
  22395. 979.93 s [algebraic-graphs] OK: mesh [] ys == empty
  22396. 979.93 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  22397. 979.93 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  22398. 979.93 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  22399. 979.93 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  22400. 979.93 s [algebraic-graphs]
  22401. 979.93 s [algebraic-graphs] ============ Graph.torus ============
  22402. 979.93 s [algebraic-graphs] OK: torus xs [] == empty
  22403. 979.93 s [algebraic-graphs] OK: torus [] ys == empty
  22404. 979.93 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  22405. 979.93 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  22406. 979.93 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  22407. 979.93 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  22408. 979.93 s [algebraic-graphs]
  22409. 979.93 s [algebraic-graphs] ============ Graph.deBruijn ============
  22410. 979.93 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  22411. 979.93 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  22412. 979.93 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  22413. 979.93 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  22414. 979.93 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  22415. 979.93 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  22416. 979.93 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  22417. 979.93 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  22418. 979.93 s [algebraic-graphs]
  22419. 979.93 s [algebraic-graphs] ============ Graph.splitVertex ============
  22420. 979.93 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  22421. 979.93 s [algebraic-graphs] OK: splitVertex x [x] == id
  22422. 979.93 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  22423. 979.93 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  22424. 979.93 s [algebraic-graphs]
  22425. 979.93 s [algebraic-graphs] ============ Graph.bind ============
  22426. 979.93 s [algebraic-graphs] OK: bind empty f == empty
  22427. 979.93 s [algebraic-graphs] OK: bind (vertex x) f == f x
  22428. 979.93 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  22429. 979.93 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  22430. 979.93 s [algebraic-graphs] OK: bind x (const empty) == empty
  22431. 979.93 s [algebraic-graphs] OK: bind x vertex == x
  22432. 979.93 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  22433. 979.93 s [algebraic-graphs]
  22434. 979.93 s [algebraic-graphs] ============ Graph.simplify ============
  22435. 979.93 s [algebraic-graphs] OK: simplify == id
  22436. 979.93 s [algebraic-graphs] OK: size (simplify x) <= size x
  22437. 979.93 s [algebraic-graphs]
  22438. 979.93 s [algebraic-graphs] ============ Graph.box ============
  22439. 979.93 s [algebraic-graphs] OK: box x y ~~ box y x
  22440. 979.93 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  22441. 979.93 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  22442. 979.93 s [algebraic-graphs] OK: box x empty ~~ empty
  22443. 979.93 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  22444. 979.93 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22445. 979.93 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  22446. 979.93 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  22447. 979.93 s [algebraic-graphs]
  22448. 979.93 s [algebraic-graphs] ============ Graph.sparsify ============
  22449. 979.93 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  22450. 979.93 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  22451. 979.93 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  22452. 979.93 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  22453. 979.93 s [algebraic-graphs]
  22454. 979.93 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  22455. 979.93 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  22456. 979.93 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  22457. 979.93 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  22458. 979.93 s [algebraic-graphs]
  22459. 979.93 s [algebraic-graphs] ============ Graph.context ============
  22460. 979.93 s [algebraic-graphs] OK: context (const False) x == Nothing
  22461. 979.93 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  22462. 979.93 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  22463. 979.93 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  22464. 979.93 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  22465. 979.93 s [algebraic-graphs]
  22466. 979.93 s [algebraic-graphs] ============ Graph.buildg ============
  22467. 979.93 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  22468. 979.93 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  22469. 979.93 s [algebraic-graphs] OK: buildg (\e v o c -> o (foldg e v o c x) (foldg e v o c y)) == overlay x y
  22470. 979.93 s [algebraic-graphs] OK: buildg (\e v o c -> c (foldg e v o c x) (foldg e v o c y)) == connect x y
  22471. 979.93 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  22472. 979.93 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  22473. 979.93 s [algebraic-graphs]
  22474. 979.93 s [algebraic-graphs] ============ Internal.List ============
  22475. 979.93 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  22476. 979.93 s [algebraic-graphs]
  22477. 979.93 s [algebraic-graphs] ============ Graph.Label ============
  22478. 979.93 s [algebraic-graphs]
  22479. 979.93 s [algebraic-graphs] ============ Any: instances ============
  22480. 979.93 s [algebraic-graphs] OK: Semiring
  22481. 979.93 s [algebraic-graphs] OK: StarSemiring
  22482. 979.93 s [algebraic-graphs] OK: Dioid
  22483. 979.93 s [algebraic-graphs]
  22484. 979.93 s [algebraic-graphs] ============ Distance Int: instances ============
  22485. 979.93 s [algebraic-graphs] OK: Semiring
  22486. 979.93 s [algebraic-graphs] OK: StarSemiring
  22487. 979.93 s [algebraic-graphs] OK: Dioid
  22488. 979.93 s [algebraic-graphs]
  22489. 979.93 s [algebraic-graphs] ============ Capacity Int: instances ============
  22490. 979.93 s [algebraic-graphs] OK: Semiring
  22491. 979.93 s [algebraic-graphs] OK: StarSemiring
  22492. 979.93 s [algebraic-graphs] OK: Dioid
  22493. 979.93 s [algebraic-graphs]
  22494. 979.93 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  22495. 979.93 s [algebraic-graphs] OK: LeftNearRing
  22496. 979.93 s [algebraic-graphs]
  22497. 979.93 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  22498. 979.93 s [algebraic-graphs] OK: Semiring
  22499. 979.93 s [algebraic-graphs] OK: Dioid
  22500. 979.93 s [algebraic-graphs]
  22501. 979.93 s [algebraic-graphs] ============ Count Int: instances ============
  22502. 979.93 s [algebraic-graphs] OK: Semiring
  22503. 979.93 s [algebraic-graphs] OK: StarSemiring
  22504. 979.93 s [algebraic-graphs]
  22505. 979.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  22506. 979.93 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  22507. 979.93 s [algebraic-graphs] OK: empty
  22508. 979.93 s [algebraic-graphs] OK: vertex
  22509. 979.93 s [algebraic-graphs] OK: edge
  22510. 979.93 s [algebraic-graphs] OK: overlay
  22511. 979.93 s [algebraic-graphs] OK: connect
  22512. 979.93 s [algebraic-graphs] OK: vertices
  22513. 979.93 s [algebraic-graphs] OK: edges
  22514. 979.93 s [algebraic-graphs] OK: overlays
  22515. 979.93 s [algebraic-graphs] OK: fromAdjacencyMaps
  22516. 979.93 s [algebraic-graphs] OK: removeVertex
  22517. 979.93 s [algebraic-graphs] OK: removeEdge
  22518. 979.93 s [algebraic-graphs] OK: replaceVertex
  22519. 979.93 s [algebraic-graphs] OK: replaceEdge
  22520. 979.93 s [algebraic-graphs] OK: transpose
  22521. 979.93 s [algebraic-graphs] OK: gmap
  22522. 979.93 s [algebraic-graphs] OK: emap
  22523. 979.93 s [algebraic-graphs] OK: induce
  22524. 979.93 s [algebraic-graphs] OK: closure
  22525. 979.93 s [algebraic-graphs] OK: reflexiveClosure
  22526. 979.93 s [algebraic-graphs] OK: symmetricClosure
  22527. 979.93 s [algebraic-graphs] OK: transitiveClosure
  22528. 979.93 s [algebraic-graphs]
  22529. 979.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  22530. 979.93 s [algebraic-graphs] OK: isEmpty empty == True
  22531. 979.93 s [algebraic-graphs] OK: hasVertex x empty == False
  22532. 979.93 s [algebraic-graphs] OK: vertexCount empty == 0
  22533. 979.93 s [algebraic-graphs] OK: edgeCount empty == 0
  22534. 979.93 s [algebraic-graphs]
  22535. 979.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  22536. 979.93 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22537. 979.93 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22538. 979.93 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22539. 979.93 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22540. 979.93 s [algebraic-graphs]
  22541. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  22542. 982.19 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22543. 982.19 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22544. 982.19 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22545. 982.19 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22546. 982.19 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22547. 982.19 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22548. 982.19 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22549. 982.19 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22550. 982.19 s [algebraic-graphs]
  22551. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  22552. 982.19 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22553. 982.19 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22554. 982.19 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22555. 982.19 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22556. 982.19 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22557. 982.19 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22558. 982.19 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22559. 982.19 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22560. 982.19 s [algebraic-graphs]
  22561. 982.19 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22562. 982.19 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22563. 982.19 s [algebraic-graphs]
  22564. 982.19 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22565. 982.19 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22566. 982.19 s [algebraic-graphs]
  22567. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  22568. 982.19 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22569. 982.19 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22570. 982.19 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22571. 982.19 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22572. 982.19 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22573. 982.19 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22574. 982.19 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22575. 982.19 s [algebraic-graphs]
  22576. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  22577. 982.19 s [algebraic-graphs] OK: vertices [] == empty
  22578. 982.19 s [algebraic-graphs] OK: vertices [x] == vertex x
  22579. 982.19 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22580. 982.19 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22581. 982.19 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22582. 982.19 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22583. 982.19 s [algebraic-graphs]
  22584. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  22585. 982.19 s [algebraic-graphs] OK: edges [] == empty
  22586. 982.19 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22587. 982.19 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22588. 982.19 s [algebraic-graphs]
  22589. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  22590. 982.19 s [algebraic-graphs] OK: overlays [] == empty
  22591. 982.19 s [algebraic-graphs] OK: overlays [x] == x
  22592. 982.19 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22593. 982.19 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22594. 982.19 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22595. 982.19 s [algebraic-graphs]
  22596. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  22597. 982.19 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  22598. 982.19 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  22599. 982.19 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  22600. 982.19 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  22601. 982.19 s [algebraic-graphs]
  22602. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  22603. 982.19 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22604. 982.19 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22605. 982.19 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22606. 982.19 s [algebraic-graphs]
  22607. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  22608. 982.19 s [algebraic-graphs] OK: isEmpty empty == True
  22609. 982.19 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22610. 982.19 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22611. 982.19 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22612. 982.19 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22613. 982.19 s [algebraic-graphs]
  22614. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  22615. 982.19 s [algebraic-graphs] OK: hasVertex x empty == False
  22616. 982.19 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22617. 982.19 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22618. 982.19 s [algebraic-graphs]
  22619. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  22620. 982.19 s [algebraic-graphs] OK: hasEdge x y empty == False
  22621. 982.19 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22622. 982.19 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22623. 982.19 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22624. 982.19 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22625. 982.19 s [algebraic-graphs]
  22626. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  22627. 982.19 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22628. 982.19 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22629. 982.19 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22630. 982.19 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22631. 982.19 s [algebraic-graphs]
  22632. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  22633. 982.19 s [algebraic-graphs] OK: vertexCount empty == 0
  22634. 982.19 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22635. 982.19 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22636. 982.19 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22637. 982.19 s [algebraic-graphs]
  22638. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  22639. 982.19 s [algebraic-graphs] OK: edgeCount empty == 0
  22640. 982.19 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22641. 982.19 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22642. 982.19 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22643. 982.19 s [algebraic-graphs]
  22644. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  22645. 982.19 s [algebraic-graphs] OK: vertexList empty == []
  22646. 982.19 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22647. 982.19 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22648. 982.19 s [algebraic-graphs]
  22649. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  22650. 982.19 s [algebraic-graphs] OK: edgeList empty == []
  22651. 982.19 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22652. 982.19 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22653. 982.19 s [algebraic-graphs]
  22654. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  22655. 982.19 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22656. 982.19 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22657. 982.19 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22658. 982.19 s [algebraic-graphs]
  22659. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  22660. 982.19 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22661. 982.19 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22662. 982.19 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22663. 982.19 s [algebraic-graphs]
  22664. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  22665. 982.19 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22666. 982.19 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22667. 982.19 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22668. 982.19 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22669. 982.19 s [algebraic-graphs]
  22670. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  22671. 982.19 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22672. 982.19 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22673. 982.19 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22674. 982.19 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22675. 982.19 s [algebraic-graphs]
  22676. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  22677. 982.19 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  22678. 982.19 s [algebraic-graphs]
  22679. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  22680. 982.19 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22681. 982.19 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22682. 982.19 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22683. 982.19 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22684. 982.19 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22685. 982.19 s [algebraic-graphs]
  22686. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  22687. 982.19 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22688. 982.19 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22689. 982.19 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22690. 982.19 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22691. 982.19 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22692. 982.19 s [algebraic-graphs]
  22693. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  22694. 982.19 s [algebraic-graphs] OK: replaceVertex x x == id
  22695. 982.19 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22696. 982.19 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  22697. 982.19 s [algebraic-graphs]
  22698. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  22699. 982.19 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22700. 982.19 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22701. 982.19 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22702. 982.19 s [algebraic-graphs]
  22703. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  22704. 982.19 s [algebraic-graphs] OK: transpose empty == empty
  22705. 982.19 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22706. 982.19 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22707. 982.19 s [algebraic-graphs] OK: transpose . transpose == id
  22708. 982.19 s [algebraic-graphs]
  22709. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  22710. 982.19 s [algebraic-graphs] OK: gmap f empty == empty
  22711. 982.19 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22712. 982.19 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  22713. 982.19 s [algebraic-graphs] OK: gmap id == id
  22714. 982.19 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22715. 982.19 s [algebraic-graphs]
  22716. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  22717. 982.19 s [algebraic-graphs] OK: emap h empty == empty
  22718. 982.19 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22719. 982.19 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22720. 982.19 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22721. 982.19 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22722. 982.19 s [algebraic-graphs] OK: emap id == id
  22723. 982.19 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22724. 982.19 s [algebraic-graphs]
  22725. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  22726. 982.19 s [algebraic-graphs] OK: induce (const True ) x == x
  22727. 982.19 s [algebraic-graphs] OK: induce (const False) x == empty
  22728. 982.19 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22729. 982.19 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22730. 982.19 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22731. 982.19 s [algebraic-graphs]
  22732. 982.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  22733. 983.30 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22734. 983.30 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22735. 983.30 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22736. 983.30 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22737. 983.30 s [algebraic-graphs]
  22738. 983.30 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  22739. 983.30 s [algebraic-graphs] OK: closure empty == empty
  22740. 983.30 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22741. 983.30 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22742. 983.30 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22743. 983.30 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22744. 983.30 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22745. 983.30 s [algebraic-graphs] OK: closure . closure == closure
  22746. 983.30 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22747. 983.30 s [algebraic-graphs]
  22748. 983.30 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  22749. 983.30 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22750. 983.30 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22751. 983.30 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22752. 983.30 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22753. 983.30 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22754. 983.30 s [algebraic-graphs]
  22755. 983.30 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  22756. 983.30 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22757. 983.30 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22758. 983.30 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22759. 983.30 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22760. 983.30 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22761. 983.30 s [algebraic-graphs]
  22762. 983.30 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  22763. 983.30 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22764. 983.30 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22765. 983.30 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22766. 983.30 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22767. 983.30 s [algebraic-graphs]
  22768. 983.30 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  22769. 983.30 s [algebraic-graphs] OK: isEmpty empty == True
  22770. 983.30 s [algebraic-graphs] OK: hasVertex x empty == False
  22771. 983.30 s [algebraic-graphs] OK: vertexCount empty == 0
  22772. 983.30 s [algebraic-graphs] OK: edgeCount empty == 0
  22773. 983.30 s [algebraic-graphs]
  22774. 983.30 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  22775. 983.30 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22776. 983.30 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22777. 983.30 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22778. 983.30 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22779. 983.30 s [algebraic-graphs]
  22780. 983.30 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  22781. 983.30 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22782. 983.30 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22783. 983.30 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22784. 983.30 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22785. 983.30 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22786. 983.30 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22787. 983.30 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22788. 983.30 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22789. 983.30 s [algebraic-graphs]
  22790. 983.30 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  22791. 983.30 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22792. 983.30 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22793. 983.30 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22794. 983.30 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22795. 983.30 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22796. 983.30 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22797. 983.30 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22798. 983.30 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22799. 983.30 s [algebraic-graphs]
  22800. 983.30 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22801. 983.30 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22802. 983.30 s [algebraic-graphs]
  22803. 983.30 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22804. 983.30 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22805. 983.30 s [algebraic-graphs]
  22806. 983.30 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  22807. 983.30 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22808. 983.30 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22809. 983.30 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22810. 983.30 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22811. 983.30 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22812. 983.30 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22813. 983.30 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22814. 983.30 s [algebraic-graphs]
  22815. 983.30 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  22816. 983.30 s [algebraic-graphs] OK: vertices [] == empty
  22817. 983.30 s [algebraic-graphs] OK: vertices [x] == vertex x
  22818. 983.30 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22819. 983.30 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22820. 983.30 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22821. 983.30 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22822. 983.30 s [algebraic-graphs]
  22823. 983.30 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  22824. 983.30 s [algebraic-graphs] OK: edges [] == empty
  22825. 983.30 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22826. 983.30 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22827. 983.30 s [algebraic-graphs]
  22828. 983.30 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  22829. 983.30 s [algebraic-graphs] OK: overlays [] == empty
  22830. 983.30 s [algebraic-graphs] OK: overlays [x] == x
  22831. 983.30 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22832. 983.30 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22833. 983.30 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22834. 983.30 s [algebraic-graphs]
  22835. 983.30 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  22836. 983.30 s [algebraic-graphs] OK: foldg empty vertex connect == id
  22837. 983.30 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  22838. 983.30 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  22839. 983.30 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  22840. 983.30 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  22841. 983.30 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  22842. 983.30 s [algebraic-graphs]
  22843. 983.30 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  22844. 983.30 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  22845. 983.30 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  22846. 983.30 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  22847. 983.30 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  22848. 983.30 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  22849. 983.30 s [algebraic-graphs]
  22850. 983.30 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  22851. 983.30 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22852. 983.30 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22853. 983.30 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22854. 983.30 s [algebraic-graphs]
  22855. 983.30 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  22856. 983.30 s [algebraic-graphs] OK: isEmpty empty == True
  22857. 983.30 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22858. 983.30 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22859. 983.30 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22860. 983.30 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22861. 983.30 s [algebraic-graphs]
  22862. 983.30 s [algebraic-graphs] ============ Labelled.Graph.size ============
  22863. 983.30 s [algebraic-graphs] OK: size empty == 1
  22864. 983.30 s [algebraic-graphs] OK: size (vertex x) == 1
  22865. 983.30 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22866. 983.30 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22867. 983.30 s [algebraic-graphs] OK: size x >= 1
  22868. 983.30 s [algebraic-graphs] OK: size x >= vertexCount x
  22869. 983.30 s [algebraic-graphs]
  22870. 983.30 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  22871. 983.30 s [algebraic-graphs] OK: hasVertex x empty == False
  22872. 983.30 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22873. 983.30 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22874. 983.30 s [algebraic-graphs]
  22875. 983.30 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  22876. 983.30 s [algebraic-graphs] OK: hasEdge x y empty == False
  22877. 983.30 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22878. 983.30 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22879. 983.30 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22880. 983.30 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22881. 983.30 s [algebraic-graphs]
  22882. 983.30 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  22883. 983.30 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22884. 983.30 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22885. 983.30 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22886. 983.30 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22887. 983.30 s [algebraic-graphs]
  22888. 983.30 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  22889. 983.30 s [algebraic-graphs] OK: vertexCount empty == 0
  22890. 983.30 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22891. 983.30 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22892. 983.30 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22893. 983.30 s [algebraic-graphs]
  22894. 983.30 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  22895. 983.30 s [algebraic-graphs] OK: edgeCount empty == 0
  22896. 983.30 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22897. 983.30 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22898. 983.30 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22899. 983.30 s [algebraic-graphs]
  22900. 983.30 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  22901. 983.30 s [algebraic-graphs] OK: vertexList empty == []
  22902. 983.30 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22903. 983.30 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22904. 983.30 s [algebraic-graphs]
  22905. 983.30 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  22906. 983.30 s [algebraic-graphs] OK: edgeList empty == []
  22907. 983.31 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22908. 983.31 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22909. 983.31 s [algebraic-graphs]
  22910. 983.31 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  22911. 983.31 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22912. 983.31 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22913. 983.31 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22914. 983.31 s [algebraic-graphs]
  22915. 983.31 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  22916. 983.31 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22917. 983.31 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22918. 983.31 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22919. 983.31 s [algebraic-graphs]
  22920. 983.31 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  22921. 983.31 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22922. 983.31 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22923. 985.84 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22924. 986.00 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22925. 986.00 s [algebraic-graphs]
  22926. 986.00 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  22927. 986.00 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22928. 986.00 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22929. 986.00 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22930. 986.00 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22931. 986.00 s [algebraic-graphs]
  22932. 986.00 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  22933. 986.00 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22934. 986.00 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22935. 986.00 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22936. 986.00 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22937. 986.00 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22938. 986.00 s [algebraic-graphs]
  22939. 986.00 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  22940. 986.00 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22941. 986.00 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22942. 986.00 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22943. 986.00 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22944. 986.00 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22945. 986.00 s [algebraic-graphs]
  22946. 986.00 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  22947. 986.00 s [algebraic-graphs] OK: replaceVertex x x == id
  22948. 986.00 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22949. 986.00 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  22950. 986.00 s [algebraic-graphs]
  22951. 986.00 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  22952. 986.00 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22953. 986.00 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22954. 986.00 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22955. 986.00 s [algebraic-graphs]
  22956. 986.00 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  22957. 986.00 s [algebraic-graphs] OK: transpose empty == empty
  22958. 986.00 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22959. 986.00 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22960. 986.00 s [algebraic-graphs] OK: transpose . transpose == id
  22961. 986.00 s [algebraic-graphs]
  22962. 986.00 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  22963. 986.00 s [algebraic-graphs] OK: fmap f empty == empty
  22964. 986.00 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22965. 986.00 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  22966. 986.00 s [algebraic-graphs] OK: fmap id == id
  22967. 986.00 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22968. 986.00 s [algebraic-graphs]
  22969. 986.00 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  22970. 986.00 s [algebraic-graphs] OK: emap h empty == empty
  22971. 986.00 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22972. 986.00 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22973. 986.00 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22974. 986.00 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22975. 986.00 s [algebraic-graphs] OK: emap id == id
  22976. 986.00 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22977. 986.00 s [algebraic-graphs]
  22978. 986.00 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  22979. 986.00 s [algebraic-graphs] OK: induce (const True ) x == x
  22980. 986.00 s [algebraic-graphs] OK: induce (const False) x == empty
  22981. 986.00 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22982. 986.00 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22983. 986.00 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22984. 986.00 s [algebraic-graphs]
  22985. 986.00 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  22986. 986.00 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22987. 986.00 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22988. 986.00 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22989. 986.00 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22990. 986.00 s [algebraic-graphs]
  22991. 986.00 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  22992. 986.00 s [algebraic-graphs] OK: closure empty == empty
  22993. 986.00 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22994. 986.00 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22995. 986.00 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22996. 986.00 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22997. 986.00 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22998. 986.00 s [algebraic-graphs] OK: closure . closure == closure
  22999. 986.00 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23000. 986.00 s [algebraic-graphs]
  23001. 986.00 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  23002. 986.00 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  23003. 986.00 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  23004. 986.00 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  23005. 986.00 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  23006. 986.00 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23007. 986.00 s [algebraic-graphs]
  23008. 986.00 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  23009. 986.00 s [algebraic-graphs] OK: symmetricClosure empty == empty
  23010. 986.00 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23011. 986.00 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  23012. 986.00 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23013. 986.00 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23014. 986.00 s [algebraic-graphs]
  23015. 986.00 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  23016. 986.00 s [algebraic-graphs] OK: transitiveClosure empty == empty
  23017. 986.01 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23018. 986.01 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  23019. 986.01 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23020. 986.01 s [algebraic-graphs]
  23021. 986.01 s [algebraic-graphs] ============ Labelled.Graph.context ============
  23022. 986.01 s [algebraic-graphs] OK: context (const False) x == Nothing
  23023. 986.01 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  23024. 986.01 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  23025. 986.01 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  23026. 986.01 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  23027. 986.01 s [algebraic-graphs]
  23028. 986.01 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  23029. 986.01 s [algebraic-graphs] OK: Axioms of non-empty graphs
  23030. 986.01 s [algebraic-graphs] OK: Theorems of non-empty graphs
  23031. 986.01 s [algebraic-graphs]
  23032. 986.01 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  23033. 986.01 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23034. 986.01 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23035. 986.01 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23036. 986.01 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23037. 986.01 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23038. 986.01 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23039. 986.01 s [algebraic-graphs] OK: x <= x + y
  23040. 986.01 s [algebraic-graphs] OK: x + y <= x * y
  23041. 986.01 s [algebraic-graphs]
  23042. 986.01 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  23043. 986.01 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  23044. 986.01 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  23045. 986.01 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  23046. 986.01 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  23047. 986.01 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  23048. 986.01 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  23049. 986.01 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  23050. 986.01 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  23051. 986.01 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  23052. 986.01 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  23053. 986.01 s [algebraic-graphs]
  23054. 986.01 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  23055. 986.01 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  23056. 986.01 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  23057. 986.01 s [algebraic-graphs]
  23058. 986.01 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  23059. 986.01 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  23060. 986.01 s [algebraic-graphs]
  23061. 986.01 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  23062. 986.01 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23063. 986.01 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23064. 986.01 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23065. 986.01 s [algebraic-graphs]
  23066. 986.01 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  23067. 986.01 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23068. 986.01 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23069. 986.01 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23070. 986.01 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23071. 986.01 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23072. 986.01 s [algebraic-graphs]
  23073. 986.01 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  23074. 986.01 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23075. 986.01 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23076. 986.01 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23077. 986.01 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23078. 986.01 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23079. 986.01 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23080. 986.01 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23081. 986.01 s [algebraic-graphs]
  23082. 986.01 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  23083. 986.01 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23084. 986.01 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23085. 986.01 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23086. 986.01 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23087. 986.01 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23088. 986.01 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23089. 986.01 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23090. 986.01 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23091. 986.01 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23092. 986.01 s [algebraic-graphs]
  23093. 986.01 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  23094. 986.01 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  23095. 986.01 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  23096. 986.01 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  23097. 986.01 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  23098. 986.01 s [algebraic-graphs]
  23099. 986.01 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  23100. 986.01 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  23101. 986.01 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  23102. 986.01 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  23103. 986.01 s [algebraic-graphs]
  23104. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  23105. 988.72 s [algebraic-graphs] OK: overlays1 [x] == x
  23106. 988.72 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  23107. 988.72 s [algebraic-graphs]
  23108. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  23109. 988.72 s [algebraic-graphs] OK: connects1 [x] == x
  23110. 988.72 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  23111. 988.72 s [algebraic-graphs]
  23112. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  23113. 988.72 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23114. 988.72 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23115. 988.72 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  23116. 988.72 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23117. 988.72 s [algebraic-graphs]
  23118. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  23119. 988.72 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23120. 988.72 s [algebraic-graphs]
  23121. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  23122. 988.72 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23123. 988.72 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23124. 988.72 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23125. 988.72 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23126. 988.72 s [algebraic-graphs]
  23127. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  23128. 988.72 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23129. 988.72 s [algebraic-graphs] OK: vertexCount x >= 1
  23130. 988.72 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  23131. 988.72 s [algebraic-graphs]
  23132. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  23133. 988.72 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23134. 988.72 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23135. 988.72 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23136. 988.72 s [algebraic-graphs]
  23137. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  23138. 988.72 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  23139. 988.72 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  23140. 988.72 s [algebraic-graphs]
  23141. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  23142. 988.72 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23143. 988.72 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23144. 988.72 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23145. 988.72 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  23146. 988.72 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23147. 988.72 s [algebraic-graphs]
  23148. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  23149. 988.72 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23150. 988.72 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  23151. 988.72 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  23152. 988.72 s [algebraic-graphs]
  23153. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  23154. 988.72 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23155. 988.72 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23156. 988.72 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  23157. 988.72 s [algebraic-graphs]
  23158. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  23159. 988.72 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  23160. 988.72 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  23161. 988.72 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  23162. 988.72 s [algebraic-graphs]
  23163. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  23164. 988.72 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  23165. 988.72 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  23166. 988.72 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  23167. 988.72 s [algebraic-graphs]
  23168. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  23169. 988.72 s [algebraic-graphs] OK: path1 [x] == vertex x
  23170. 988.72 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  23171. 988.72 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  23172. 988.72 s [algebraic-graphs]
  23173. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  23174. 988.72 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  23175. 988.72 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  23176. 988.72 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  23177. 988.72 s [algebraic-graphs]
  23178. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  23179. 988.72 s [algebraic-graphs] OK: clique1 [x] == vertex x
  23180. 988.72 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  23181. 988.72 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  23182. 988.72 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  23183. 988.72 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  23184. 988.72 s [algebraic-graphs]
  23185. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  23186. 988.72 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23187. 988.72 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  23188. 988.72 s [algebraic-graphs]
  23189. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  23190. 988.72 s [algebraic-graphs] OK: star x [] == vertex x
  23191. 988.72 s [algebraic-graphs] OK: star x [y] == edge x y
  23192. 988.72 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  23193. 988.72 s [algebraic-graphs]
  23194. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  23195. 988.72 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  23196. 988.72 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  23197. 988.72 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  23198. 988.72 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  23199. 988.72 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  23200. 988.72 s [algebraic-graphs]
  23201. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  23202. 988.72 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23203. 988.72 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  23204. 988.72 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23205. 988.72 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  23206. 988.72 s [algebraic-graphs]
  23207. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  23208. 988.72 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  23209. 988.72 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  23210. 988.72 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  23211. 988.72 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  23212. 988.72 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  23213. 988.72 s [algebraic-graphs]
  23214. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  23215. 988.72 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  23216. 988.72 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23217. 988.72 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23218. 988.72 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23219. 988.72 s [algebraic-graphs]
  23220. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  23221. 988.72 s [algebraic-graphs] OK: replaceVertex x x == id
  23222. 988.72 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23223. 988.72 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23224. 988.72 s [algebraic-graphs]
  23225. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  23226. 988.72 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23227. 988.72 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23228. 988.72 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23229. 988.72 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23230. 988.72 s [algebraic-graphs]
  23231. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  23232. 988.72 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23233. 988.72 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23234. 988.72 s [algebraic-graphs] OK: transpose . transpose == id
  23235. 988.72 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23236. 988.72 s [algebraic-graphs]
  23237. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  23238. 988.72 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23239. 988.72 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23240. 988.72 s [algebraic-graphs] OK: gmap id == id
  23241. 988.72 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23242. 988.72 s [algebraic-graphs]
  23243. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  23244. 988.72 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  23245. 988.72 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  23246. 988.72 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  23247. 988.72 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  23248. 988.72 s [algebraic-graphs]
  23249. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  23250. 988.72 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  23251. 988.72 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  23252. 988.72 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  23253. 988.72 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  23254. 988.72 s [algebraic-graphs]
  23255. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  23256. 988.72 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23257. 988.72 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23258. 988.72 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  23259. 988.72 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  23260. 988.72 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23261. 988.72 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23262. 988.72 s [algebraic-graphs] OK: closure . closure == closure
  23263. 988.72 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23264. 988.72 s [algebraic-graphs]
  23265. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  23266. 988.72 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23267. 988.72 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23268. 988.72 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  23269. 988.72 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23270. 988.72 s [algebraic-graphs]
  23271. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  23272. 988.72 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23273. 988.72 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  23274. 988.72 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23275. 988.72 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23276. 988.72 s [algebraic-graphs]
  23277. 988.72 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  23278. 988.72 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23279. 988.72 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23280. 988.72 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  23281. 988.72 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23282. 988.72 s [algebraic-graphs]
  23283. 988.72 s [algebraic-graphs] ============ NonEmpty.Graph.============
  23284. 988.72 s [algebraic-graphs] OK: Axioms of non-empty graphs
  23285. 988.72 s [algebraic-graphs] OK: Theorems of non-empty graphs
  23286. 988.72 s [algebraic-graphs]
  23287. 988.72 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  23288. 988.72 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23289. 988.72 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23290. 988.72 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23291. 988.72 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23292. 988.72 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23293. 988.72 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23294. 988.72 s [algebraic-graphs] OK: x <= x + y
  23295. 988.72 s [algebraic-graphs] OK: x + y <= x * y
  23296. 988.72 s [algebraic-graphs]
  23297. 988.72 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  23298. 988.72 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  23299. 988.72 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  23300. 988.72 s [algebraic-graphs] OK: fmap id == id
  23301. 988.72 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  23302. 988.72 s [algebraic-graphs]
  23303. 988.72 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  23304. 988.72 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  23305. 990.04 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  23306. 990.04 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  23307. 990.04 s [algebraic-graphs] OK: (x >>= vertex) == x
  23308. 990.04 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  23309. 990.04 s [algebraic-graphs]
  23310. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  23311. 990.04 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  23312. 990.04 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  23313. 990.04 s [algebraic-graphs]
  23314. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  23315. 990.04 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23316. 990.04 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23317. 990.04 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23318. 990.04 s [algebraic-graphs] OK: size (vertex x) == 1
  23319. 990.04 s [algebraic-graphs]
  23320. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  23321. 990.04 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23322. 990.04 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23323. 990.04 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23324. 990.04 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23325. 990.04 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23326. 990.04 s [algebraic-graphs]
  23327. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  23328. 990.04 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23329. 990.04 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23330. 990.04 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23331. 990.04 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23332. 990.04 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23333. 990.04 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  23334. 990.04 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23335. 990.04 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23336. 990.04 s [algebraic-graphs]
  23337. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  23338. 990.04 s [algebraic-graphs] OK: overlay1 empty x == x
  23339. 990.04 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  23340. 990.04 s [algebraic-graphs]
  23341. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  23342. 990.04 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23343. 990.04 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23344. 990.04 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23345. 990.04 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23346. 990.04 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23347. 990.04 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23348. 990.04 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23349. 990.04 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  23350. 990.04 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23351. 990.04 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23352. 990.04 s [algebraic-graphs]
  23353. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  23354. 990.04 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  23355. 990.04 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  23356. 990.04 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  23357. 990.04 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  23358. 990.04 s [algebraic-graphs]
  23359. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  23360. 990.04 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  23361. 990.04 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  23362. 990.04 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  23363. 990.04 s [algebraic-graphs]
  23364. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  23365. 990.04 s [algebraic-graphs] OK: overlays1 [x] == x
  23366. 990.04 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  23367. 990.04 s [algebraic-graphs]
  23368. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  23369. 990.04 s [algebraic-graphs] OK: connects1 [x] == x
  23370. 990.04 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  23371. 990.04 s [algebraic-graphs]
  23372. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  23373. 990.04 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  23374. 990.04 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  23375. 990.04 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  23376. 990.04 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  23377. 990.04 s [algebraic-graphs]
  23378. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  23379. 990.04 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23380. 990.04 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23381. 990.04 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  23382. 990.04 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23383. 990.04 s [algebraic-graphs]
  23384. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  23385. 990.04 s [algebraic-graphs] OK: x === x == True
  23386. 990.04 s [algebraic-graphs] OK: x + y === x + y == True
  23387. 990.04 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  23388. 990.04 s [algebraic-graphs] OK: x + y === x * y == False
  23389. 990.04 s [algebraic-graphs]
  23390. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  23391. 990.04 s [algebraic-graphs] OK: size (vertex x) == 1
  23392. 990.04 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  23393. 990.04 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  23394. 990.04 s [algebraic-graphs] OK: size x >= 1
  23395. 990.04 s [algebraic-graphs] OK: size x >= vertexCount x
  23396. 990.04 s [algebraic-graphs]
  23397. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  23398. 990.04 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23399. 990.04 s [algebraic-graphs]
  23400. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  23401. 990.04 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23402. 990.04 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23403. 990.04 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23404. 990.04 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23405. 990.04 s [algebraic-graphs]
  23406. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  23407. 990.04 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23408. 990.04 s [algebraic-graphs] OK: vertexCount x >= 1
  23409. 990.04 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  23410. 990.04 s [algebraic-graphs]
  23411. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  23412. 990.04 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23413. 990.04 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23414. 990.04 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23415. 990.04 s [algebraic-graphs]
  23416. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  23417. 990.04 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  23418. 990.04 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  23419. 990.04 s [algebraic-graphs]
  23420. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  23421. 990.04 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23422. 990.04 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23423. 990.04 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23424. 990.04 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  23425. 990.04 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23426. 990.04 s [algebraic-graphs]
  23427. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  23428. 990.04 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23429. 990.04 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  23430. 990.04 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  23431. 990.04 s [algebraic-graphs]
  23432. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  23433. 990.04 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23434. 990.04 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23435. 990.04 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  23436. 990.04 s [algebraic-graphs]
  23437. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  23438. 990.04 s [algebraic-graphs] OK: path1 [x] == vertex x
  23439. 990.04 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  23440. 990.04 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  23441. 990.04 s [algebraic-graphs]
  23442. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  23443. 990.04 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  23444. 990.04 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  23445. 990.04 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  23446. 990.04 s [algebraic-graphs]
  23447. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  23448. 990.04 s [algebraic-graphs] OK: clique1 [x] == vertex x
  23449. 990.04 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  23450. 990.04 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  23451. 990.04 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  23452. 990.04 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  23453. 990.04 s [algebraic-graphs]
  23454. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  23455. 990.04 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23456. 990.04 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  23457. 990.04 s [algebraic-graphs]
  23458. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  23459. 990.04 s [algebraic-graphs] OK: star x [] == vertex x
  23460. 990.04 s [algebraic-graphs] OK: star x [y] == edge x y
  23461. 990.04 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  23462. 990.04 s [algebraic-graphs]
  23463. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  23464. 990.04 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  23465. 990.04 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  23466. 990.04 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  23467. 990.04 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  23468. 990.04 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  23469. 990.04 s [algebraic-graphs]
  23470. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  23471. 990.04 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23472. 990.04 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  23473. 990.04 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23474. 990.04 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  23475. 990.04 s [algebraic-graphs]
  23476. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  23477. 990.04 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  23478. 990.04 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  23479. 990.04 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  23480. 990.04 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  23481. 990.04 s [algebraic-graphs]
  23482. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  23483. 990.04 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  23484. 990.04 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  23485. 990.04 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  23486. 990.04 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  23487. 990.04 s [algebraic-graphs]
  23488. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  23489. 990.04 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  23490. 990.04 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  23491. 990.04 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  23492. 990.04 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  23493. 990.04 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  23494. 990.04 s [algebraic-graphs]
  23495. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  23496. 990.04 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  23497. 990.04 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23498. 990.04 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23499. 990.04 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23500. 990.04 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  23501. 990.04 s [algebraic-graphs]
  23502. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  23503. 990.04 s [algebraic-graphs] OK: replaceVertex x x == id
  23504. 990.04 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23505. 990.04 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23506. 990.04 s [algebraic-graphs]
  23507. 990.04 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  23508. 990.04 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23509. 995.96 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23510. 995.96 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23511. 996.00 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23512. 996.00 s [algebraic-graphs]
  23513. 996.00 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  23514. 996.00 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  23515. 996.00 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  23516. 996.00 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  23517. 996.00 s [algebraic-graphs]
  23518. 996.00 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  23519. 996.00 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23520. 996.00 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23521. 996.00 s [algebraic-graphs] OK: transpose . transpose == id
  23522. 996.00 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  23523. 996.00 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23524. 996.00 s [algebraic-graphs]
  23525. 996.00 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  23526. 996.00 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  23527. 996.00 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  23528. 996.00 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  23529. 996.00 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  23530. 996.00 s [algebraic-graphs]
  23531. 996.00 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  23532. 996.00 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  23533. 996.00 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  23534. 996.00 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  23535. 996.00 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  23536. 996.00 s [algebraic-graphs]
  23537. 996.00 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  23538. 996.00 s [algebraic-graphs] OK: simplify == id
  23539. 996.00 s [algebraic-graphs] OK: size (simplify x) <= size x
  23540. 996.00 s [algebraic-graphs] OK: simplify 1 === 1
  23541. 996.00 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  23542. 996.00 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  23543. 996.00 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  23544. 996.00 s [algebraic-graphs]
  23545. 996.00 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  23546. 996.00 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  23547. 996.00 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  23548. 996.00 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  23549. 996.00 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  23550. 996.00 s [algebraic-graphs]
  23551. 996.00 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  23552. 996.01 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  23553. 996.01 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  23554. 996.01 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  23555. 996.01 s [algebraic-graphs]
  23556. 996.01 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  23557. 996.01 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  23558. 996.01 s [algebraic-graphs] OK: box x y ~~ box y x
  23559. 996.01 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  23560. 996.01 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  23561. 996.01 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  23562. 996.01 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  23563. 996.01 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  23564. 996.01 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  23565. 996.01 s [algebraic-graphs]
  23566. 996.01 s [algebraic-graphs] ============ Relation ============
  23567. 996.01 s [algebraic-graphs] OK: Axioms of graphs
  23568. 996.01 s [algebraic-graphs]
  23569. 996.01 s [algebraic-graphs] ============ Relation.consistent ============
  23570. 996.01 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23571. 996.01 s [algebraic-graphs]
  23572. 996.01 s [algebraic-graphs] OK: consistent empty == True
  23573. 996.01 s [algebraic-graphs] OK: consistent (vertex x) == True
  23574. 996.01 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23575. 996.01 s [algebraic-graphs] OK: consistent (connect x y) == True
  23576. 996.01 s [algebraic-graphs] OK: consistent (edge x y) == True
  23577. 996.01 s [algebraic-graphs] OK: consistent (edges xs) == True
  23578. 996.01 s [algebraic-graphs] OK: consistent (stars xs) == True
  23579. 996.01 s [algebraic-graphs]
  23580. 996.01 s [algebraic-graphs] ============ Relation.Show ============
  23581. 996.01 s [algebraic-graphs] OK: show (empty ) == "empty"
  23582. 996.01 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23583. 996.01 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23584. 996.01 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23585. 996.01 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23586. 996.01 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23587. 996.01 s [algebraic-graphs]
  23588. 996.01 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23589. 996.01 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23590. 996.01 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23591. 996.01 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23592. 996.01 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23593. 996.01 s [algebraic-graphs]
  23594. 996.01 s [algebraic-graphs] ============ Relation.Ord ============
  23595. 996.01 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23596. 996.01 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23597. 996.01 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23598. 996.01 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23599. 996.01 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23600. 996.01 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23601. 996.01 s [algebraic-graphs] OK: x <= x + y
  23602. 996.01 s [algebraic-graphs] OK: x + y <= x * y
  23603. 996.01 s [algebraic-graphs]
  23604. 996.01 s [algebraic-graphs] ============ Relation.empty ============
  23605. 996.01 s [algebraic-graphs] OK: isEmpty empty == True
  23606. 996.01 s [algebraic-graphs] OK: hasVertex x empty == False
  23607. 996.01 s [algebraic-graphs] OK: vertexCount empty == 0
  23608. 996.01 s [algebraic-graphs] OK: edgeCount empty == 0
  23609. 996.01 s [algebraic-graphs]
  23610. 996.01 s [algebraic-graphs] ============ Relation.vertex ============
  23611. 996.01 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23612. 996.01 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23613. 996.01 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23614. 996.01 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23615. 996.01 s [algebraic-graphs]
  23616. 996.01 s [algebraic-graphs] ============ Relation.edge ============
  23617. 996.01 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23618. 996.01 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23619. 996.01 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23620. 996.01 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23621. 996.01 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23622. 996.01 s [algebraic-graphs]
  23623. 996.01 s [algebraic-graphs] ============ Relation.overlay ============
  23624. 996.01 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23625. 996.01 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23626. 996.01 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23627. 996.01 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23628. 996.01 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23629. 996.01 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23630. 996.01 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23631. 996.01 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23632. 996.01 s [algebraic-graphs]
  23633. 996.01 s [algebraic-graphs] ============ Relation.connect ============
  23634. 996.01 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23635. 996.01 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23636. 996.01 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23637. 996.01 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23638. 996.01 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23639. 996.01 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23640. 996.01 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23641. 996.01 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23642. 996.01 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23643. 996.01 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23644. 996.01 s [algebraic-graphs]
  23645. 996.01 s [algebraic-graphs] ============ Relation.vertices ============
  23646. 996.01 s [algebraic-graphs] OK: vertices [] == empty
  23647. 996.01 s [algebraic-graphs] OK: vertices [x] == vertex x
  23648. 996.01 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23649. 996.01 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23650. 996.01 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23651. 996.01 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23652. 996.01 s [algebraic-graphs]
  23653. 996.01 s [algebraic-graphs] ============ Relation.edges ============
  23654. 996.01 s [algebraic-graphs] OK: edges [] == empty
  23655. 996.01 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23656. 996.01 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  23657. 996.01 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  23658. 996.01 s [algebraic-graphs]
  23659. 996.01 s [algebraic-graphs] ============ Relation.overlays ============
  23660. 996.01 s [algebraic-graphs] OK: overlays [] == empty
  23661. 996.01 s [algebraic-graphs] OK: overlays [x] == x
  23662. 996.01 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23663. 996.01 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23664. 996.01 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23665. 996.01 s [algebraic-graphs]
  23666. 996.01 s [algebraic-graphs] ============ Relation.connects ============
  23667. 996.01 s [algebraic-graphs] OK: connects [] == empty
  23668. 996.01 s [algebraic-graphs] OK: connects [x] == x
  23669. 996.01 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23670. 996.01 s [algebraic-graphs] OK: connects == foldr connect empty
  23671. 996.01 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23672. 996.01 s [algebraic-graphs]
  23673. 996.01 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  23674. 996.01 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23675. 996.01 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23676. 996.01 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23677. 996.01 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23678. 996.01 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23679. 996.01 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23680. 996.01 s [algebraic-graphs]
  23681. 996.01 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  23682. 996.01 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23683. 996.01 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23684. 996.01 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23685. 996.01 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23686. 996.01 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23687. 996.01 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23688. 996.01 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23689. 996.01 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23690. 996.01 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23691. 996.01 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23692. 996.01 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23693. 996.01 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23694. 996.01 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  23695. 996.01 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  23696. 996.01 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  23697. 996.01 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  23698. 996.01 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  23699. 999.12 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23700. 999.12 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23701. 999.12 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23702. 999.12 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23703. 999.12 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23704. 999.12 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23705. 999.12 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23706. 999.12 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23707. 999.12 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23708. 999.12 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23709. 999.12 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23710. 999.12 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23711. 999.12 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23712. 999.12 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23713. 999.12 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23714. 999.12 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23715. 999.12 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23716. 999.12 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23717. 999.12 s [algebraic-graphs]
  23718. 999.12 s [algebraic-graphs] ============ Relation.foldg ============
  23719. 999.12 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  23720. 999.12 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  23721. 999.12 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  23722. 999.12 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  23723. 999.12 s [algebraic-graphs]
  23724. 999.12 s [algebraic-graphs] ============ Relation.isEmpty ============
  23725. 999.12 s [algebraic-graphs] OK: isEmpty empty == True
  23726. 999.12 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23727. 999.12 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23728. 999.12 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23729. 999.12 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23730. 999.12 s [algebraic-graphs]
  23731. 999.12 s [algebraic-graphs] ============ Relation.hasVertex ============
  23732. 999.12 s [algebraic-graphs] OK: hasVertex x empty == False
  23733. 999.12 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23734. 999.12 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23735. 999.12 s [algebraic-graphs]
  23736. 999.12 s [algebraic-graphs] ============ Relation.hasEdge ============
  23737. 999.12 s [algebraic-graphs] OK: hasEdge x y empty == False
  23738. 999.12 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23739. 999.12 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23740. 999.12 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23741. 999.12 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23742. 999.12 s [algebraic-graphs]
  23743. 999.12 s [algebraic-graphs] ============ Relation.vertexCount ============
  23744. 999.12 s [algebraic-graphs] OK: vertexCount empty == 0
  23745. 999.12 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23746. 999.12 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23747. 999.12 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23748. 999.12 s [algebraic-graphs]
  23749. 999.12 s [algebraic-graphs] ============ Relation.edgeCount ============
  23750. 999.12 s [algebraic-graphs] OK: edgeCount empty == 0
  23751. 999.12 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23752. 999.12 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23753. 999.12 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23754. 999.12 s [algebraic-graphs]
  23755. 999.12 s [algebraic-graphs] ============ Relation.vertexList ============
  23756. 999.12 s [algebraic-graphs] OK: vertexList empty == []
  23757. 999.12 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23758. 999.12 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23759. 999.12 s [algebraic-graphs]
  23760. 999.12 s [algebraic-graphs] ============ Relation.vertexSet ============
  23761. 999.12 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23762. 999.12 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23763. 999.12 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23764. 999.12 s [algebraic-graphs]
  23765. 999.12 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  23766. 999.12 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23767. 999.12 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23768. 999.12 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23769. 999.12 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23770. 999.12 s [algebraic-graphs]
  23771. 999.12 s [algebraic-graphs] ============ Relation.edgeList ============
  23772. 999.12 s [algebraic-graphs] OK: edgeList empty == []
  23773. 999.12 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23774. 999.12 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23775. 999.12 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23776. 999.12 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  23777. 999.12 s [algebraic-graphs]
  23778. 999.12 s [algebraic-graphs] ============ Relation.edgeSet ============
  23779. 999.12 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23780. 999.12 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23781. 999.12 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23782. 999.12 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  23783. 999.12 s [algebraic-graphs]
  23784. 999.12 s [algebraic-graphs] ============ Relation.adjacencyList ============
  23785. 999.12 s [algebraic-graphs] OK: adjacencyList empty == []
  23786. 999.12 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23787. 999.12 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  23788. 999.12 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  23789. 999.12 s [algebraic-graphs]
  23790. 999.12 s [algebraic-graphs] ============ Relation.preSet ============
  23791. 999.12 s [algebraic-graphs] OK: preSet x empty == Set.empty
  23792. 999.12 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  23793. 999.12 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  23794. 999.12 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  23795. 999.12 s [algebraic-graphs]
  23796. 999.12 s [algebraic-graphs] ============ Relation.preIntSet ============
  23797. 999.12 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  23798. 999.12 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  23799. 999.12 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  23800. 999.12 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  23801. 999.12 s [algebraic-graphs]
  23802. 999.12 s [algebraic-graphs] ============ Relation.postSet ============
  23803. 999.12 s [algebraic-graphs] OK: postSet x empty == Set.empty
  23804. 999.12 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  23805. 999.12 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  23806. 999.12 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  23807. 999.12 s [algebraic-graphs]
  23808. 999.12 s [algebraic-graphs] ============ Relation.postIntSet ============
  23809. 999.12 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  23810. 999.12 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  23811. 999.12 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  23812. 999.12 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  23813. 999.12 s [algebraic-graphs]
  23814. 999.12 s [algebraic-graphs] ============ Relation.path ============
  23815. 999.12 s [algebraic-graphs] OK: path [] == empty
  23816. 999.12 s [algebraic-graphs] OK: path [x] == vertex x
  23817. 999.12 s [algebraic-graphs] OK: path [x,y] == edge x y
  23818. 999.12 s [algebraic-graphs]
  23819. 999.12 s [algebraic-graphs] ============ Relation.circuit ============
  23820. 999.12 s [algebraic-graphs] OK: circuit [] == empty
  23821. 999.12 s [algebraic-graphs] OK: circuit [x] == edge x x
  23822. 999.12 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23823. 999.12 s [algebraic-graphs]
  23824. 999.12 s [algebraic-graphs] ============ Relation.clique ============
  23825. 999.12 s [algebraic-graphs] OK: clique [] == empty
  23826. 999.12 s [algebraic-graphs] OK: clique [x] == vertex x
  23827. 999.12 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23828. 999.12 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23829. 999.12 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23830. 999.12 s [algebraic-graphs]
  23831. 999.12 s [algebraic-graphs] ============ Relation.biclique ============
  23832. 999.12 s [algebraic-graphs] OK: biclique [] [] == empty
  23833. 999.12 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23834. 999.12 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23835. 999.12 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23836. 999.12 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23837. 999.12 s [algebraic-graphs]
  23838. 999.12 s [algebraic-graphs] ============ Relation.star ============
  23839. 999.12 s [algebraic-graphs] OK: star x [] == vertex x
  23840. 999.12 s [algebraic-graphs] OK: star x [y] == edge x y
  23841. 999.12 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23842. 999.12 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23843. 999.12 s [algebraic-graphs]
  23844. 999.12 s [algebraic-graphs] ============ Relation.stars ============
  23845. 999.12 s [algebraic-graphs] OK: stars [] == empty
  23846. 999.12 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23847. 999.12 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23848. 999.12 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23849. 999.12 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23850. 999.12 s [algebraic-graphs] OK: stars . adjacencyList == id
  23851. 999.12 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23852. 999.12 s [algebraic-graphs]
  23853. 999.12 s [algebraic-graphs] ============ Relation.tree ============
  23854. 999.12 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23855. 999.12 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23856. 999.12 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23857. 999.12 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23858. 999.12 s [algebraic-graphs]
  23859. 999.12 s [algebraic-graphs] ============ Relation.forest ============
  23860. 999.12 s [algebraic-graphs] OK: forest [] == empty
  23861. 999.12 s [algebraic-graphs] OK: forest [x] == tree x
  23862. 999.12 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23863. 999.12 s [algebraic-graphs] OK: forest == overlays . map tree
  23864. 999.12 s [algebraic-graphs]
  23865. 999.12 s [algebraic-graphs] ============ Relation.removeVertex ============
  23866. 999.12 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23867. 999.12 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23868. 999.12 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23869. 999.12 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23870. 999.12 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23871. 999.12 s [algebraic-graphs]
  23872. 999.12 s [algebraic-graphs] ============ Relation.removeEdge ============
  23873. 999.12 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23874. 999.12 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23875. 999.12 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23876. 999.12 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23877. 999.12 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23878. 999.12 s [algebraic-graphs]
  23879. 999.12 s [algebraic-graphs] ============ Relation.replaceVertex ============
  23880. 999.12 s [algebraic-graphs] OK: replaceVertex x x == id
  23881. 999.12 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23882. 999.12 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23883. 999.12 s [algebraic-graphs]
  23884. 999.12 s [algebraic-graphs] ============ Relation.mergeVertices ============
  23885. 999.12 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23886. 1019.16 s Waiting for lock on pandoc-cli
  23887. 1020.54 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23888. 1020.54 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23889. 1020.58 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23890. 1020.58 s [algebraic-graphs]
  23891. 1020.58 s [algebraic-graphs] ============ Relation.transpose ============
  23892. 1020.58 s [algebraic-graphs] OK: transpose empty == empty
  23893. 1020.58 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23894. 1020.58 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23895. 1020.58 s [algebraic-graphs] OK: transpose . transpose == id
  23896. 1020.58 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23897. 1020.58 s [algebraic-graphs]
  23898. 1020.58 s [algebraic-graphs] ============ Relation.gmap ============
  23899. 1020.58 s [algebraic-graphs] OK: gmap f empty == empty
  23900. 1020.58 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23901. 1020.58 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23902. 1020.58 s [algebraic-graphs] OK: gmap id == id
  23903. 1020.58 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23904. 1020.58 s [algebraic-graphs]
  23905. 1020.58 s [algebraic-graphs] ============ Relation.induce ============
  23906. 1020.58 s [algebraic-graphs] OK: induce (const True ) x == x
  23907. 1020.58 s [algebraic-graphs] OK: induce (const False) x == empty
  23908. 1020.58 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23909. 1020.58 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23910. 1020.58 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23911. 1020.58 s [algebraic-graphs]
  23912. 1020.58 s [algebraic-graphs] ============ Relation.compose ============
  23913. 1020.58 s [algebraic-graphs] OK: compose empty x == empty
  23914. 1020.58 s [algebraic-graphs] OK: compose x empty == empty
  23915. 1020.58 s [algebraic-graphs] OK: compose (vertex x) y == empty
  23916. 1020.58 s [algebraic-graphs] OK: compose x (vertex y) == empty
  23917. 1020.58 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  23918. 1020.58 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  23919. 1020.58 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  23920. 1020.58 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  23921. 1020.58 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  23922. 1020.58 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  23923. 1020.58 s [algebraic-graphs]
  23924. 1020.58 s [algebraic-graphs] ============ Relation.closure ============
  23925. 1020.58 s [algebraic-graphs] OK: closure empty == empty
  23926. 1020.58 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23927. 1020.58 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23928. 1020.58 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23929. 1020.58 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  23930. 1020.58 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23931. 1020.58 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23932. 1020.58 s [algebraic-graphs] OK: closure . closure == closure
  23933. 1020.58 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23934. 1020.58 s [algebraic-graphs]
  23935. 1020.58 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  23936. 1020.58 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  23937. 1020.58 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23938. 1020.58 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23939. 1020.58 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23940. 1020.58 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23941. 1020.58 s [algebraic-graphs]
  23942. 1020.58 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  23943. 1020.58 s [algebraic-graphs] OK: symmetricClosure empty == empty
  23944. 1020.58 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23945. 1020.58 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  23946. 1020.58 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23947. 1020.58 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23948. 1020.58 s [algebraic-graphs]
  23949. 1020.58 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  23950. 1020.58 s [algebraic-graphs] OK: transitiveClosure empty == empty
  23951. 1020.58 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23952. 1020.58 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23953. 1020.58 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  23954. 1020.58 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23955. 1020.58 s [algebraic-graphs]
  23956. 1020.58 s [algebraic-graphs] ============ Relation.induceJust ============
  23957. 1020.58 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23958. 1020.58 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23959. 1020.58 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23960. 1020.58 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23961. 1020.58 s [algebraic-graphs]
  23962. 1020.58 s [algebraic-graphs] ============ ReflexiveRelation ============
  23963. 1020.58 s [algebraic-graphs] OK: Axioms of reflexive graphs
  23964. 1020.58 s [algebraic-graphs]
  23965. 1020.58 s [algebraic-graphs] ============ TransitiveRelation ============
  23966. 1020.58 s [algebraic-graphs] OK: Axioms of transitive graphs
  23967. 1020.58 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  23968. 1020.58 s [algebraic-graphs]
  23969. 1020.58 s [algebraic-graphs] ============ PreorderRelation ============
  23970. 1020.58 s [algebraic-graphs] OK: Axioms of preorder graphs
  23971. 1020.58 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  23972. 1020.58 s [algebraic-graphs]
  23973. 1020.58 s [algebraic-graphs] ============ Symmetric.Relation ============
  23974. 1020.58 s [algebraic-graphs] OK: Axioms of undirected graphs
  23975. 1020.58 s [algebraic-graphs]
  23976. 1020.58 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  23977. 1020.58 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23978. 1020.58 s [algebraic-graphs]
  23979. 1020.58 s [algebraic-graphs] OK: consistent empty == True
  23980. 1020.58 s [algebraic-graphs] OK: consistent (vertex x) == True
  23981. 1020.58 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23982. 1020.58 s [algebraic-graphs] OK: consistent (connect x y) == True
  23983. 1020.58 s [algebraic-graphs] OK: consistent (edge x y) == True
  23984. 1020.58 s [algebraic-graphs] OK: consistent (edges xs) == True
  23985. 1020.58 s [algebraic-graphs] OK: consistent (stars xs) == True
  23986. 1020.58 s [algebraic-graphs]
  23987. 1020.58 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  23988. 1020.58 s [algebraic-graphs] OK: show (empty ) == "empty"
  23989. 1020.58 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23990. 1020.58 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23991. 1020.58 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23992. 1020.58 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23993. 1020.58 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23994. 1020.58 s [algebraic-graphs]
  23995. 1020.58 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23996. 1020.58 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23997. 1020.58 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23998. 1020.58 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23999. 1020.58 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  24000. 1020.58 s [algebraic-graphs]
  24001. 1020.58 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  24002. 1020.58 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  24003. 1020.58 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  24004. 1020.58 s [algebraic-graphs]
  24005. 1020.58 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  24006. 1020.58 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  24007. 1020.58 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  24008. 1020.58 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  24009. 1020.58 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  24010. 1020.58 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  24011. 1020.58 s [algebraic-graphs]
  24012. 1020.58 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  24013. 1020.58 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  24014. 1020.58 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  24015. 1020.58 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  24016. 1020.58 s [algebraic-graphs]
  24017. 1020.58 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  24018. 1020.58 s [algebraic-graphs] OK: vertex 1 < vertex 2
  24019. 1020.59 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  24020. 1020.59 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  24021. 1020.59 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  24022. 1020.59 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  24023. 1020.59 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  24024. 1020.59 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  24025. 1020.59 s [algebraic-graphs] OK: x <= x + y
  24026. 1020.59 s [algebraic-graphs] OK: x + y <= x * y
  24027. 1020.59 s [algebraic-graphs]
  24028. 1020.59 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  24029. 1020.59 s [algebraic-graphs] OK: isEmpty empty == True
  24030. 1020.59 s [algebraic-graphs] OK: hasVertex x empty == False
  24031. 1020.59 s [algebraic-graphs] OK: vertexCount empty == 0
  24032. 1020.59 s [algebraic-graphs] OK: edgeCount empty == 0
  24033. 1020.59 s [algebraic-graphs]
  24034. 1020.59 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  24035. 1020.59 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  24036. 1020.59 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  24037. 1020.59 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  24038. 1020.59 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  24039. 1020.59 s [algebraic-graphs]
  24040. 1020.59 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  24041. 1020.59 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  24042. 1020.59 s [algebraic-graphs] OK: edge x y == edge y x
  24043. 1020.59 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  24044. 1020.59 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  24045. 1020.59 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  24046. 1020.59 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  24047. 1020.59 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  24048. 1020.59 s [algebraic-graphs]
  24049. 1020.59 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  24050. 1020.59 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  24051. 1020.59 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  24052. 1020.59 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  24053. 1020.59 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  24054. 1020.59 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  24055. 1020.59 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  24056. 1020.59 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  24057. 1020.59 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  24058. 1020.59 s [algebraic-graphs]
  24059. 1020.59 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  24060. 1020.59 s [algebraic-graphs] OK: connect x y == connect y x
  24061. 1020.59 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  24062. 1020.59 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  24063. 1020.59 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  24064. 1020.59 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  24065. 1020.59 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  24066. 1020.59 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  24067. 1020.59 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  24068. 1020.59 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  24069. 1020.59 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  24070. 1020.59 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  24071. 1020.59 s [algebraic-graphs]
  24072. 1020.59 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  24073. 1020.59 s [algebraic-graphs] OK: vertices [] == empty
  24074. 1020.59 s [algebraic-graphs] OK: vertices [x] == vertex x
  24075. 1020.59 s [algebraic-graphs] OK: vertices == overlays . map vertex
  24076. 1020.59 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  24077. 1020.59 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  24078. 1020.59 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  24079. 1020.59 s [algebraic-graphs]
  24080. 1020.59 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  24081. 1020.59 s [algebraic-graphs] OK: edges [] == empty
  24082. 1020.59 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  24083. 1020.59 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  24084. 1020.59 s [algebraic-graphs]
  24085. 1020.59 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  24086. 1020.59 s [algebraic-graphs] OK: overlays [] == empty
  24087. 1032.98 s [algebraic-graphs] OK: overlays [x] == x
  24088. 1033.02 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  24089. 1033.02 s [algebraic-graphs] OK: overlays == foldr overlay empty
  24090. 1033.02 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  24091. 1033.02 s [algebraic-graphs]
  24092. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  24093. 1033.02 s [algebraic-graphs] OK: connects [] == empty
  24094. 1033.02 s [algebraic-graphs] OK: connects [x] == x
  24095. 1033.02 s [algebraic-graphs] OK: connects [x,y] == connect x y
  24096. 1033.02 s [algebraic-graphs] OK: connects == foldr connect empty
  24097. 1033.02 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  24098. 1033.02 s [algebraic-graphs] OK: connects == connects . reverse
  24099. 1033.02 s [algebraic-graphs]
  24100. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  24101. 1033.02 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  24102. 1033.02 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  24103. 1033.02 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  24104. 1033.02 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  24105. 1033.02 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  24106. 1033.02 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  24107. 1033.02 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  24108. 1033.02 s [algebraic-graphs]
  24109. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  24110. 1033.02 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  24111. 1033.02 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  24112. 1033.02 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  24113. 1033.02 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  24114. 1033.02 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  24115. 1033.02 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  24116. 1033.02 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  24117. 1033.02 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  24118. 1033.02 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  24119. 1033.02 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  24120. 1033.02 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  24121. 1033.02 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  24122. 1033.02 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  24123. 1033.02 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  24124. 1033.02 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  24125. 1033.02 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  24126. 1033.02 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  24127. 1033.02 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  24128. 1033.02 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  24129. 1033.02 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  24130. 1033.02 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  24131. 1033.02 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  24132. 1033.02 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  24133. 1033.02 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  24134. 1033.02 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  24135. 1033.02 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  24136. 1033.02 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  24137. 1033.02 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  24138. 1033.02 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  24139. 1033.02 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  24140. 1033.02 s [algebraic-graphs]
  24141. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  24142. 1033.02 s [algebraic-graphs] OK: isEmpty empty == True
  24143. 1033.02 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  24144. 1033.02 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  24145. 1033.02 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  24146. 1033.02 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  24147. 1033.02 s [algebraic-graphs]
  24148. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  24149. 1033.02 s [algebraic-graphs] OK: hasVertex x empty == False
  24150. 1033.02 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  24151. 1033.02 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  24152. 1033.02 s [algebraic-graphs]
  24153. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  24154. 1033.02 s [algebraic-graphs] OK: hasEdge x y empty == False
  24155. 1033.02 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  24156. 1033.02 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  24157. 1033.02 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  24158. 1033.02 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  24159. 1033.02 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  24160. 1033.02 s [algebraic-graphs]
  24161. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  24162. 1033.02 s [algebraic-graphs] OK: vertexCount empty == 0
  24163. 1033.02 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  24164. 1033.02 s [algebraic-graphs] OK: vertexCount == length . vertexList
  24165. 1033.02 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  24166. 1033.02 s [algebraic-graphs]
  24167. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  24168. 1033.02 s [algebraic-graphs] OK: edgeCount empty == 0
  24169. 1033.02 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  24170. 1033.02 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  24171. 1033.02 s [algebraic-graphs] OK: edgeCount == length . edgeList
  24172. 1033.02 s [algebraic-graphs]
  24173. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  24174. 1033.02 s [algebraic-graphs] OK: vertexList empty == []
  24175. 1033.02 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  24176. 1033.02 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  24177. 1033.02 s [algebraic-graphs]
  24178. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  24179. 1033.02 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  24180. 1033.02 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  24181. 1033.02 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  24182. 1033.02 s [algebraic-graphs]
  24183. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  24184. 1033.02 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  24185. 1033.02 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  24186. 1033.02 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  24187. 1033.02 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  24188. 1033.02 s [algebraic-graphs]
  24189. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  24190. 1033.02 s [algebraic-graphs] OK: edgeList empty == []
  24191. 1033.02 s [algebraic-graphs] OK: edgeList (vertex x) == []
  24192. 1033.02 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  24193. 1033.02 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  24194. 1033.02 s [algebraic-graphs]
  24195. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  24196. 1033.02 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  24197. 1033.02 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  24198. 1033.02 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  24199. 1033.02 s [algebraic-graphs]
  24200. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  24201. 1033.02 s [algebraic-graphs] OK: adjacencyList empty == []
  24202. 1033.02 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  24203. 1033.02 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  24204. 1033.02 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  24205. 1033.02 s [algebraic-graphs]
  24206. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  24207. 1033.02 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  24208. 1033.02 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  24209. 1033.02 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  24210. 1033.02 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  24211. 1033.02 s [algebraic-graphs]
  24212. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  24213. 1033.02 s [algebraic-graphs] OK: path [] == empty
  24214. 1033.02 s [algebraic-graphs] OK: path [x] == vertex x
  24215. 1033.02 s [algebraic-graphs] OK: path [x,y] == edge x y
  24216. 1033.02 s [algebraic-graphs] OK: path == path . reverse
  24217. 1033.02 s [algebraic-graphs]
  24218. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  24219. 1033.02 s [algebraic-graphs] OK: circuit [] == empty
  24220. 1033.02 s [algebraic-graphs] OK: circuit [x] == edge x x
  24221. 1033.02 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  24222. 1033.02 s [algebraic-graphs] OK: circuit == circuit . reverse
  24223. 1033.02 s [algebraic-graphs]
  24224. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  24225. 1033.02 s [algebraic-graphs] OK: clique [] == empty
  24226. 1033.02 s [algebraic-graphs] OK: clique [x] == vertex x
  24227. 1033.02 s [algebraic-graphs] OK: clique [x,y] == edge x y
  24228. 1033.02 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  24229. 1033.02 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  24230. 1033.02 s [algebraic-graphs] OK: clique == clique . reverse
  24231. 1033.02 s [algebraic-graphs]
  24232. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  24233. 1033.02 s [algebraic-graphs] OK: biclique [] [] == empty
  24234. 1033.02 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  24235. 1033.02 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  24236. 1033.02 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  24237. 1033.02 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  24238. 1033.02 s [algebraic-graphs]
  24239. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  24240. 1033.02 s [algebraic-graphs] OK: star x [] == vertex x
  24241. 1033.02 s [algebraic-graphs] OK: star x [y] == edge x y
  24242. 1033.02 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  24243. 1033.02 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  24244. 1033.02 s [algebraic-graphs]
  24245. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  24246. 1033.02 s [algebraic-graphs] OK: stars [] == empty
  24247. 1033.02 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  24248. 1033.02 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  24249. 1033.02 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  24250. 1033.02 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  24251. 1033.02 s [algebraic-graphs] OK: stars . adjacencyList == id
  24252. 1033.02 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  24253. 1033.02 s [algebraic-graphs]
  24254. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  24255. 1033.02 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  24256. 1033.02 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  24257. 1033.02 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  24258. 1033.02 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  24259. 1033.02 s [algebraic-graphs]
  24260. 1033.02 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  24261. 1033.02 s [algebraic-graphs] OK: forest [] == empty
  24262. 1039.34 s [algebraic-graphs] OK: forest [x] == tree x
  24263. 1039.34 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  24264. 1039.39 s [algebraic-graphs] OK: forest == overlays . map tree
  24265. 1039.39 s [algebraic-graphs]
  24266. 1039.39 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  24267. 1039.39 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  24268. 1039.39 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  24269. 1039.39 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  24270. 1039.39 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  24271. 1039.39 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  24272. 1039.39 s [algebraic-graphs]
  24273. 1039.39 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  24274. 1039.39 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  24275. 1039.39 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  24276. 1039.39 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  24277. 1039.39 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  24278. 1039.39 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  24279. 1039.39 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  24280. 1039.39 s [algebraic-graphs]
  24281. 1039.39 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  24282. 1039.39 s [algebraic-graphs] OK: replaceVertex x x == id
  24283. 1039.39 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  24284. 1039.39 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  24285. 1039.39 s [algebraic-graphs]
  24286. 1039.39 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  24287. 1039.39 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  24288. 1039.39 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  24289. 1039.39 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  24290. 1039.39 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24291. 1039.39 s [algebraic-graphs]
  24292. 1039.39 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  24293. 1039.39 s [algebraic-graphs] OK: gmap f empty == empty
  24294. 1039.39 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24295. 1039.39 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24296. 1039.39 s [algebraic-graphs] OK: gmap id == id
  24297. 1039.39 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24298. 1039.39 s [algebraic-graphs]
  24299. 1039.39 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  24300. 1039.39 s [algebraic-graphs] OK: induce (const True ) x == x
  24301. 1039.39 s [algebraic-graphs] OK: induce (const False) x == empty
  24302. 1039.39 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24303. 1039.39 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24304. 1039.39 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24305. 1039.39 s [algebraic-graphs]
  24306. 1039.39 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  24307. 1039.39 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24308. 1039.39 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24309. 1039.39 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24310. 1039.39 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24311. 1039.39 s [algebraic-graphs]
  24312. 1039.39 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  24313. 1039.39 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  24314. 1039.39 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  24315. 1039.39 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  24316. 1039.39 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  24317. 1039.39 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  24318. 1039.39 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  24319. 1039.39 s [algebraic-graphs]
  24320. 1039.39 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  24321. 1039.39 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  24322. 1039.39 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  24323. 1039.39 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  24324. 1039.39 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  24325. 1039.39 s [algebraic-graphs]
  24326. 1039.39 s [algebraic-graphs] ============ Typed ============
  24327. 1039.39 s [algebraic-graphs]
  24328. 1039.39 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  24329. 1039.39 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  24330. 1039.39 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  24331. 1039.39 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  24332. 1039.39 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  24333. 1039.39 s [algebraic-graphs]
  24334. 1039.39 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  24335. 1039.39 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  24336. 1039.39 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  24337. 1039.39 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  24338. 1039.39 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  24339. 1039.39 s [algebraic-graphs]
  24340. 1039.39 s [algebraic-graphs] ============ Typed.dfsForest ============
  24341. 1039.39 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  24342. 1039.39 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  24343. 1039.39 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  24344. 1039.39 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  24345. 1039.39 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  24346. 1039.39 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  24347. 1039.39 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  24348. 1039.39 s [algebraic-graphs]
  24349. 1039.39 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  24350. 1039.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  24351. 1039.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  24352. 1039.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  24353. 1039.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  24354. 1039.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  24355. 1039.39 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  24356. 1039.39 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  24357. 1039.39 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  24358. 1039.39 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  24359. 1039.39 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  24360. 1039.39 s [algebraic-graphs]
  24361. 1039.39 s [algebraic-graphs] ============ Typed.dfs ============
  24362. 1039.39 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  24363. 1039.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  24364. 1039.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  24365. 1039.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  24366. 1039.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  24367. 1039.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  24368. 1039.39 s [algebraic-graphs] OK: dfs % x $ [] == []
  24369. 1039.39 s [algebraic-graphs]
  24370. 1039.39 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  24371. 1039.39 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  24372. 1039.39 s [algebraic-graphs]
  24373. 1039.39 s [algebraic-graphs] ============ Typed.topSort ============
  24374. 1039.39 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  24375. 1039.39 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  24376. 1039.39 s [algebraic-graphs]
  24377. 1039.39 s [algebraic-graphs] ============ Graph.Undirected ============
  24378. 1039.39 s [algebraic-graphs] OK: Axioms of undirected graphs
  24379. 1039.39 s [algebraic-graphs]
  24380. 1039.39 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  24381. 1039.39 s [algebraic-graphs] OK: show (empty ) == "empty"
  24382. 1039.39 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  24383. 1039.39 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  24384. 1039.39 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  24385. 1039.39 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  24386. 1039.39 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  24387. 1039.39 s [algebraic-graphs]
  24388. 1039.39 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  24389. 1039.39 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  24390. 1039.39 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  24391. 1039.39 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  24392. 1039.39 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  24393. 1039.39 s [algebraic-graphs]
  24394. 1039.39 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  24395. 1039.39 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  24396. 1039.39 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  24397. 1039.39 s [algebraic-graphs]
  24398. 1039.39 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  24399. 1039.39 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  24400. 1039.39 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  24401. 1039.39 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  24402. 1039.39 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  24403. 1039.39 s [algebraic-graphs]
  24404. 1039.39 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  24405. 1039.39 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  24406. 1039.39 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  24407. 1039.39 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  24408. 1039.39 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  24409. 1039.39 s [algebraic-graphs]
  24410. 1039.39 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  24411. 1039.39 s [algebraic-graphs] OK: complement empty == empty
  24412. 1039.39 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  24413. 1039.39 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  24414. 1039.39 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  24415. 1039.39 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  24416. 1039.39 s [algebraic-graphs] OK: complement . complement == id
  24417. 1039.39 s [algebraic-graphs]
  24418. 1039.39 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  24419. 1039.39 s [algebraic-graphs] OK: vertex 1 < vertex 2
  24420. 1039.39 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  24421. 1039.39 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  24422. 1039.39 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  24423. 1039.39 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  24424. 1039.39 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  24425. 1039.39 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  24426. 1039.39 s [algebraic-graphs] OK: x <= x + y
  24427. 1039.39 s [algebraic-graphs] OK: x + y <= x * y
  24428. 1039.39 s [algebraic-graphs]
  24429. 1039.39 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  24430. 1039.39 s [algebraic-graphs] OK: isEmpty empty == True
  24431. 1039.39 s [algebraic-graphs] OK: hasVertex x empty == False
  24432. 1039.39 s [algebraic-graphs] OK: vertexCount empty == 0
  24433. 1039.39 s [algebraic-graphs] OK: edgeCount empty == 0
  24434. 1039.39 s [algebraic-graphs]
  24435. 1039.39 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  24436. 1039.39 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  24437. 1039.39 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  24438. 1039.39 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  24439. 1039.39 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  24440. 1039.39 s [algebraic-graphs]
  24441. 1039.39 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  24442. 1039.39 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  24443. 1039.39 s [algebraic-graphs] OK: edge x y == edge y x
  24444. 1047.66 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  24445. 1047.66 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  24446. 1047.66 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  24447. 1047.69 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  24448. 1047.69 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  24449. 1047.69 s [algebraic-graphs]
  24450. 1047.69 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  24451. 1047.69 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  24452. 1047.69 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  24453. 1047.69 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  24454. 1047.69 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  24455. 1047.69 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  24456. 1047.69 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  24457. 1047.70 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  24458. 1047.70 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  24459. 1047.70 s [algebraic-graphs]
  24460. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  24461. 1047.70 s [algebraic-graphs] OK: connect x y == connect y x
  24462. 1047.70 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  24463. 1047.70 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  24464. 1047.70 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  24465. 1047.70 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  24466. 1047.70 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  24467. 1047.70 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  24468. 1047.70 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  24469. 1047.70 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  24470. 1047.70 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  24471. 1047.70 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  24472. 1047.70 s [algebraic-graphs]
  24473. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  24474. 1047.70 s [algebraic-graphs] OK: vertices [] == empty
  24475. 1047.70 s [algebraic-graphs] OK: vertices [x] == vertex x
  24476. 1047.70 s [algebraic-graphs] OK: vertices == overlays . map vertex
  24477. 1047.70 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  24478. 1047.70 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  24479. 1047.70 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  24480. 1047.70 s [algebraic-graphs]
  24481. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  24482. 1047.70 s [algebraic-graphs] OK: edges [] == empty
  24483. 1047.70 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  24484. 1047.70 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  24485. 1047.70 s [algebraic-graphs]
  24486. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  24487. 1047.70 s [algebraic-graphs] OK: overlays [] == empty
  24488. 1047.70 s [algebraic-graphs] OK: overlays [x] == x
  24489. 1047.70 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  24490. 1047.70 s [algebraic-graphs] OK: overlays == foldr overlay empty
  24491. 1047.70 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  24492. 1047.70 s [algebraic-graphs]
  24493. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  24494. 1047.70 s [algebraic-graphs] OK: connects [] == empty
  24495. 1047.70 s [algebraic-graphs] OK: connects [x] == x
  24496. 1047.70 s [algebraic-graphs] OK: connects [x,y] == connect x y
  24497. 1047.70 s [algebraic-graphs] OK: connects == foldr connect empty
  24498. 1047.70 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  24499. 1047.70 s [algebraic-graphs] OK: connects == connects . reverse
  24500. 1047.70 s [algebraic-graphs]
  24501. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  24502. 1047.70 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  24503. 1047.70 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  24504. 1047.70 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  24505. 1047.70 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  24506. 1047.70 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  24507. 1047.70 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  24508. 1047.70 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  24509. 1047.70 s [algebraic-graphs]
  24510. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.path ============
  24511. 1047.70 s [algebraic-graphs] OK: path [] == empty
  24512. 1047.70 s [algebraic-graphs] OK: path [x] == vertex x
  24513. 1047.70 s [algebraic-graphs] OK: path [x,y] == edge x y
  24514. 1047.70 s [algebraic-graphs] OK: path == path . reverse
  24515. 1047.70 s [algebraic-graphs]
  24516. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  24517. 1047.70 s [algebraic-graphs] OK: circuit [] == empty
  24518. 1047.70 s [algebraic-graphs] OK: circuit [x] == edge x x
  24519. 1047.70 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  24520. 1047.70 s [algebraic-graphs] OK: circuit == circuit . reverse
  24521. 1047.70 s [algebraic-graphs]
  24522. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  24523. 1047.70 s [algebraic-graphs] OK: clique [] == empty
  24524. 1047.70 s [algebraic-graphs] OK: clique [x] == vertex x
  24525. 1047.70 s [algebraic-graphs] OK: clique [x,y] == edge x y
  24526. 1047.70 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  24527. 1047.70 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  24528. 1047.70 s [algebraic-graphs] OK: clique == clique . reverse
  24529. 1047.70 s [algebraic-graphs]
  24530. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  24531. 1047.70 s [algebraic-graphs] OK: biclique [] [] == empty
  24532. 1047.70 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  24533. 1047.70 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  24534. 1047.70 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  24535. 1047.70 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  24536. 1047.70 s [algebraic-graphs]
  24537. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.star ============
  24538. 1047.70 s [algebraic-graphs] OK: star x [] == vertex x
  24539. 1047.70 s [algebraic-graphs] OK: star x [y] == edge x y
  24540. 1047.70 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  24541. 1047.70 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  24542. 1047.70 s [algebraic-graphs]
  24543. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  24544. 1047.70 s [algebraic-graphs] OK: stars [] == empty
  24545. 1047.70 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  24546. 1047.70 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  24547. 1047.70 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  24548. 1047.70 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  24549. 1047.70 s [algebraic-graphs] OK: stars . adjacencyList == id
  24550. 1047.70 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  24551. 1047.70 s [algebraic-graphs]
  24552. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  24553. 1047.70 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  24554. 1047.70 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  24555. 1047.70 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  24556. 1047.70 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  24557. 1047.70 s [algebraic-graphs]
  24558. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  24559. 1047.70 s [algebraic-graphs] OK: forest [] == empty
  24560. 1047.70 s [algebraic-graphs] OK: forest [x] == tree x
  24561. 1047.70 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  24562. 1047.70 s [algebraic-graphs] OK: forest == overlays . map tree
  24563. 1047.70 s [algebraic-graphs]
  24564. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  24565. 1047.70 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  24566. 1047.70 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  24567. 1047.70 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  24568. 1047.70 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  24569. 1047.70 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  24570. 1047.70 s [algebraic-graphs]
  24571. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  24572. 1047.70 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  24573. 1047.70 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  24574. 1047.70 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  24575. 1047.70 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  24576. 1047.70 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  24577. 1047.70 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  24578. 1047.70 s [algebraic-graphs]
  24579. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  24580. 1047.70 s [algebraic-graphs] OK: replaceVertex x x == id
  24581. 1047.70 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  24582. 1047.70 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  24583. 1047.70 s [algebraic-graphs]
  24584. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  24585. 1047.70 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  24586. 1047.70 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  24587. 1047.70 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  24588. 1047.70 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24589. 1047.70 s [algebraic-graphs]
  24590. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  24591. 1047.70 s [algebraic-graphs] OK: gmap f empty == empty
  24592. 1047.70 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24593. 1047.70 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24594. 1047.70 s [algebraic-graphs] OK: gmap id == id
  24595. 1047.70 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24596. 1047.70 s [algebraic-graphs]
  24597. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  24598. 1047.70 s [algebraic-graphs] OK: induce (const True ) x == x
  24599. 1047.70 s [algebraic-graphs] OK: induce (const False) x == empty
  24600. 1047.70 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24601. 1047.70 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24602. 1047.70 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24603. 1047.70 s [algebraic-graphs]
  24604. 1047.70 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  24605. 1047.70 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24606. 1047.70 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24607. 1047.70 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24608. 1047.70 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24609. 1047.70 s [algebraic-graphs] Test suite main: PASS
  24610. 1047.70 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  24611. 1047.70 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  24612. 1047.70 s [algebraic-graphs] checkPhase completed in 1 minutes 52 seconds
  24613. 1047.70 s [algebraic-graphs] Phase: haddockPhase
  24614. 1047.84 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  24615. 1047.84 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  24616. 1047.89 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  24617. 1048.28 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  24618. 1048.39 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  24619. 1048.45 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24620. 1048.45 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24621. 1048.45 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24622. 1048.45 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24623. 1048.45 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  24624. 1048.45 s [algebraic-graphs] Missing documentation for:
  24625. 1048.45 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  24626. 1048.60 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  24627. 1048.60 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24628. 1048.60 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  24629. 1048.72 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  24630. 1048.85 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  24631. 1048.85 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24632. 1048.85 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  24633. 1048.85 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24634. 1048.85 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  24635. 1048.85 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24636. 1048.85 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  24637. 1048.85 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24638. 1048.85 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24639. 1048.85 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24640. 1048.85 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  24641. 1048.85 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24642. 1048.85 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24643. 1048.85 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24644. 1048.85 s [algebraic-graphs] Warning: 'box' is out of scope.
  24645. 1048.85 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24646. 1048.85 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  24647. 1048.85 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24648. 1048.85 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  24649. 1049.02 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24650. 1049.02 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24651. 1049.02 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  24652. 1049.12 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  24653. 1049.12 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24654. 1049.12 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  24655. 1049.28 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  24656. 1049.56 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24657. 1049.57 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24658. 1049.57 s [algebraic-graphs] Warning: 'empty' is out of scope.
  24659. 1049.57 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24660. 1049.57 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24661. 1049.57 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24662. 1049.57 s [algebraic-graphs] Warning: 'edges' is out of scope.
  24663. 1049.57 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24664. 1049.57 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24665. 1049.57 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24666. 1049.57 s [algebraic-graphs] Warning: 'stars' is out of scope.
  24667. 1049.57 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24668. 1049.57 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  24669. 1049.65 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24670. 1049.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24671. 1049.65 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24672. 1049.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24673. 1049.65 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  24674. 1049.65 s [algebraic-graphs] Missing documentation for:
  24675. 1049.65 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  24676. 1049.74 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  24677. 1049.80 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  24678. 1049.85 s [algebraic-graphs]
  24679. 1049.85 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [-Wtype-equality-requires-operators]
  24680. 1049.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24681. 1049.85 s [algebraic-graphs] will become an error in a future GHC release.
  24682. 1049.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24683. 1049.85 s [algebraic-graphs] |
  24684. 1049.85 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  24685. 1049.85 s [algebraic-graphs] | ^
  24686. 1049.85 s [algebraic-graphs]
  24687. 1049.85 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [-Wtype-equality-requires-operators]
  24688. 1049.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24689. 1049.85 s [algebraic-graphs] will become an error in a future GHC release.
  24690. 1049.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24691. 1049.85 s [algebraic-graphs] |
  24692. 1049.85 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24693. 1049.85 s [algebraic-graphs] | ^
  24694. 1049.85 s [algebraic-graphs]
  24695. 1049.85 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [-Wtype-equality-requires-operators]
  24696. 1049.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24697. 1049.85 s [algebraic-graphs] will become an error in a future GHC release.
  24698. 1049.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24699. 1049.85 s [algebraic-graphs] |
  24700. 1049.85 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24701. 1049.85 s [algebraic-graphs] | ^
  24702. 1049.85 s [algebraic-graphs]
  24703. 1049.85 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [-Wtype-equality-requires-operators]
  24704. 1049.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24705. 1049.85 s [algebraic-graphs] will become an error in a future GHC release.
  24706. 1049.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24707. 1049.85 s [algebraic-graphs] |
  24708. 1049.85 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24709. 1049.85 s [algebraic-graphs] | ^
  24710. 1049.85 s [algebraic-graphs]
  24711. 1049.85 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [-Wtype-equality-requires-operators]
  24712. 1049.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24713. 1049.85 s [algebraic-graphs] will become an error in a future GHC release.
  24714. 1049.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24715. 1049.85 s [algebraic-graphs] |
  24716. 1049.85 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24717. 1049.85 s [algebraic-graphs] | ^
  24718. 1049.85 s [algebraic-graphs]
  24719. 1049.85 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [-Wtype-equality-requires-operators]
  24720. 1049.86 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24721. 1049.86 s [algebraic-graphs] will become an error in a future GHC release.
  24722. 1049.86 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24723. 1049.86 s [algebraic-graphs] |
  24724. 1049.86 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24725. 1049.86 s [algebraic-graphs] | ^
  24726. 1049.86 s [algebraic-graphs]
  24727. 1049.86 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [-Wtype-equality-requires-operators]
  24728. 1049.86 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24729. 1049.86 s [algebraic-graphs] will become an error in a future GHC release.
  24730. 1049.86 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24731. 1049.86 s [algebraic-graphs] |
  24732. 1049.86 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24733. 1049.86 s [algebraic-graphs] | ^
  24734. 1050.01 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  24735. 1050.01 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24736. 1050.01 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  24737. 1050.11 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  24738. 1050.23 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24739. 1050.23 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24740. 1050.23 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  24741. 1050.35 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  24742. 1050.57 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  24743. 1050.62 s [algebraic-graphs]
  24744. 1050.63 s [algebraic-graphs] src/Algebra/Graph/Labelled.hs:74:10: warning: [-Wredundant-constraints]
  24745. 1050.63 s [algebraic-graphs] • Redundant constraint: Eq e
  24746. 1050.63 s [algebraic-graphs] • In the instance declaration for ‘Ord (Graph e a)’
  24747. 1050.63 s [algebraic-graphs] |
  24748. 1050.63 s [algebraic-graphs] 74 | instance (Eq e, Monoid e, Ord a, Ord e) => Ord (Graph e a) where
  24749. 1050.63 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  24750. 1050.64 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  24751. 1050.65 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  24752. 1050.67 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  24753. 1050.67 s [algebraic-graphs]
  24754. 1050.68 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [-Wtype-equality-requires-operators]
  24755. 1050.68 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24756. 1050.68 s [algebraic-graphs] will become an error in a future GHC release.
  24757. 1050.68 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24758. 1050.68 s [algebraic-graphs] |
  24759. 1050.68 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  24760. 1050.68 s [algebraic-graphs] | ^
  24761. 1050.69 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  24762. 1050.69 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24763. 1050.69 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  24764. 1050.70 s [algebraic-graphs]
  24765. 1050.70 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [-Wtype-equality-requires-operators]
  24766. 1050.70 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24767. 1050.70 s [algebraic-graphs] will become an error in a future GHC release.
  24768. 1050.70 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24769. 1050.70 s [algebraic-graphs] |
  24770. 1050.70 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  24771. 1050.70 s [algebraic-graphs] | ^
  24772. 1050.70 s [algebraic-graphs]
  24773. 1050.70 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [-Wtype-equality-requires-operators]
  24774. 1050.70 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24775. 1050.70 s [algebraic-graphs] will become an error in a future GHC release.
  24776. 1050.70 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24777. 1050.70 s [algebraic-graphs] |
  24778. 1050.70 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  24779. 1050.70 s [algebraic-graphs] | ^
  24780. 1050.75 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  24781. 1050.82 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  24782. 1050.85 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  24783. 1050.85 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24784. 1050.85 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  24785. 1050.86 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  24786. 1050.86 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24787. 1050.86 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  24788. 1050.87 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  24789. 1050.87 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24790. 1050.87 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  24791. 1050.89 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  24792. 1050.89 s [algebraic-graphs] Missing documentation for:
  24793. 1050.89 s [algebraic-graphs] Module header
  24794. 1050.89 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  24795. 1050.89 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:41)
  24796. 1050.89 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:22)
  24797. 1050.89 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:26)
  24798. 1050.89 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:34)
  24799. 1050.89 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:38)
  24800. 1050.89 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:30)
  24801. 1050.92 s [algebraic-graphs] Warning: 'array' is out of scope.
  24802. 1050.92 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24803. 1050.92 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  24804. 1050.92 s [algebraic-graphs] Missing documentation for:
  24805. 1050.92 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:191)
  24806. 1051.35 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  24807. 1051.35 s [algebraic-graphs]
  24808. 1051.35 s [algebraic-graphs] - Algebra.Graph.Labelled.Focus
  24809. 1055.44 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/index.html,
  24810. 1055.44 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  24811. 1055.59 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  24812. 1055.59 s [algebraic-graphs] Phase: installPhase
  24813. 1055.60 s [algebraic-graphs] Installing library in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  24814. 1056.33 s [algebraic-graphs] Phase: fixupPhase
  24815. 1056.35 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7
  24816. 1056.35 s [algebraic-graphs] shrinking /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSalgebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F-ghc9.4.8.so
  24817. 1056.37 s [algebraic-graphs] checking for references to /build/ in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7...
  24818. 1056.41 s [algebraic-graphs] patching script interpreter paths in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7
  24819. 1056.41 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/lib
  24820. 1056.68 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc
  24821. 1056.70 s [algebraic-graphs] checking for references to /build/ in /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc...
  24822. 1056.73 s [algebraic-graphs] patching script interpreter paths in /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc
  24823. 1056.88 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7 /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc
  24824. 1057.32 s [algebraic-graphs:post-build] Pushing 2 paths (37 are already present) using zstd to cache sellout ⏳
  24825. 1057.32 s [algebraic-graphs:post-build]
  24826. 1057.70 s [algebraic-graphs:post-build] Pushing /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc (11.26 MiB)
  24827. 1057.78 s [algebraic-graphs:post-build] Pushing /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7 (24.72 MiB)
  24828. 1059.17 s [algebraic-graphs:post-build]
  24829. 1059.17 s [algebraic-graphs:post-build] All done.
  24830. 1059.19 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7 /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc
  24831. 1059.23 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24832. 1059.25 s [algebraic-graphs:post-build] copying 2 paths...
  24833. 1059.25 s [algebraic-graphs:post-build] copying path '/nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  24834. 1060.97 s [algebraic-graphs:post-build] copying path '/nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  24835. 1067.59 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24836. 1067.86 s [algebraic-graphs:post-build] copying 1 paths...
  24837. 1067.90 s [algebraic-graphs:post-build] copying path '/nix/store/r3bxf573i0cz6mglqadf5v8dx13xad0g-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  24838. 1068.09 s Progress: 32 of 40 built, 373 of 373 downloaded from cache
  24839. 1068.32 s Building /nix/store/02yrxwdw9ww8gy4c575h5n7kddkn3fxs-ghc-9.4.8-with-packages.drv
  24840. 1068.38 s [ghc-9.4.8-with-packages] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/nix-support:
  24841. 1068.38 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24842. 1068.39 s [ghc-9.4.8-with-packages] /nix/store/xhxf8fh0kdv3jyvi7barm5q9ihmwzbna-ghc-compat-plugin-0.1.0.1/nix-support:
  24843. 1068.39 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24844. 1068.39 s [ghc-9.4.8-with-packages] /nix/store/nkwi1bfw3z5c4n1fnrlakrslkcgwbk8v-hedgehog-1.5/nix-support:
  24845. 1068.39 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24846. 1068.39 s [ghc-9.4.8-with-packages] /nix/store/nkwi1bfw3z5c4n1fnrlakrslkcgwbk8v-hedgehog-1.5/nix-support:
  24847. 1068.39 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24848. 1068.40 s [ghc-9.4.8-with-packages] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/nix-support:
  24849. 1068.40 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24850. 1068.43 s [ghc-9.4.8-with-packages] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/nix-support:
  24851. 1068.43 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24852. 1068.45 s [ghc-9.4.8-with-packages] /nix/store/7mkrfmdp83xvrhkybsly3wry9bhvgji6-temporary-1.3/nix-support:
  24853. 1068.45 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24854. 1068.45 s [ghc-9.4.8-with-packages] /nix/store/7mkrfmdp83xvrhkybsly3wry9bhvgji6-temporary-1.3/nix-support:
  24855. 1068.45 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24856. 1068.45 s [ghc-9.4.8-with-packages] /nix/store/5xxjc2n7b0wb1pivm6f897512r965zh1-ansi-terminal-1.1.3/nix-support:
  24857. 1068.45 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24858. 1068.45 s [ghc-9.4.8-with-packages] /nix/store/5xxjc2n7b0wb1pivm6f897512r965zh1-ansi-terminal-1.1.3/nix-support:
  24859. 1068.45 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24860. 1068.45 s [ghc-9.4.8-with-packages] /nix/store/v6mn5q2pffwalmdqam9hshx6lnmab5av-async-2.2.5/nix-support:
  24861. 1068.45 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24862. 1068.45 s [ghc-9.4.8-with-packages] /nix/store/v6mn5q2pffwalmdqam9hshx6lnmab5av-async-2.2.5/nix-support:
  24863. 1068.45 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24864. 1068.45 s [ghc-9.4.8-with-packages] /nix/store/c60sg81w1z2925kyw9drag0v1khnr9fp-barbies-2.1.1.0/nix-support:
  24865. 1068.45 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24866. 1068.46 s [ghc-9.4.8-with-packages] /nix/store/c60sg81w1z2925kyw9drag0v1khnr9fp-barbies-2.1.1.0/nix-support:
  24867. 1068.46 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24868. 1068.46 s [ghc-9.4.8-with-packages] /nix/store/462yg7zm4bgfkzfsrxiryirhjx1s0cab-concurrent-output-1.10.21/nix-support:
  24869. 1068.46 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24870. 1068.46 s [ghc-9.4.8-with-packages] /nix/store/462yg7zm4bgfkzfsrxiryirhjx1s0cab-concurrent-output-1.10.21/nix-support:
  24871. 1068.46 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24872. 1068.47 s [ghc-9.4.8-with-packages] /nix/store/3y7qlb5nyiqq18v1mv2936ks9fnw43hp-lifted-async-0.10.2.7/nix-support:
  24873. 1068.47 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24874. 1068.47 s [ghc-9.4.8-with-packages] /nix/store/3y7qlb5nyiqq18v1mv2936ks9fnw43hp-lifted-async-0.10.2.7/nix-support:
  24875. 1068.47 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24876. 1068.47 s [ghc-9.4.8-with-packages] /nix/store/2f9yr728820hr5hknnbpj6pcndghrvrv-mmorph-1.2.1/nix-support:
  24877. 1068.47 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24878. 1068.47 s [ghc-9.4.8-with-packages] /nix/store/2f9yr728820hr5hknnbpj6pcndghrvrv-mmorph-1.2.1/nix-support:
  24879. 1068.47 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24880. 1068.48 s [ghc-9.4.8-with-packages] /nix/store/cxmidfcc1pfg15jhwcskjp0sak71m4vz-monad-control-1.0.3.1/nix-support:
  24881. 1068.48 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24882. 1068.48 s [ghc-9.4.8-with-packages] /nix/store/cxmidfcc1pfg15jhwcskjp0sak71m4vz-monad-control-1.0.3.1/nix-support:
  24883. 1068.48 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24884. 1068.48 s [ghc-9.4.8-with-packages] /nix/store/233bl99xi6ilwyb0n0z8lqcq8wghjbw3-pretty-show-1.10/nix-support:
  24885. 1068.48 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24886. 1068.48 s [ghc-9.4.8-with-packages] /nix/store/233bl99xi6ilwyb0n0z8lqcq8wghjbw3-pretty-show-1.10/nix-support:
  24887. 1068.48 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24888. 1068.48 s [ghc-9.4.8-with-packages] /nix/store/cyijhm1wvqdhm9b4b41ap0v8a8ar8pr2-primitive-0.9.1.0/nix-support:
  24889. 1068.48 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24890. 1068.48 s [ghc-9.4.8-with-packages] /nix/store/cyijhm1wvqdhm9b4b41ap0v8a8ar8pr2-primitive-0.9.1.0/nix-support:
  24891. 1068.48 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24892. 1068.49 s [ghc-9.4.8-with-packages] /nix/store/sys9r5vn8pmzbrffdps9mrd0j9c3v21w-random-1.2.1.3/nix-support:
  24893. 1068.49 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24894. 1068.49 s [ghc-9.4.8-with-packages] /nix/store/sys9r5vn8pmzbrffdps9mrd0j9c3v21w-random-1.2.1.3/nix-support:
  24895. 1068.49 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24896. 1068.49 s [ghc-9.4.8-with-packages] /nix/store/7qjvf35fl0pkv9wj8n3cx182j24zwm7l-resourcet-1.3.0/nix-support:
  24897. 1068.49 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24898. 1068.49 s [ghc-9.4.8-with-packages] /nix/store/7qjvf35fl0pkv9wj8n3cx182j24zwm7l-resourcet-1.3.0/nix-support:
  24899. 1068.49 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24900. 1068.49 s [ghc-9.4.8-with-packages] /nix/store/r3x9zl5gmlbbclkxs9x9xv5plbqghp68-safe-exceptions-0.1.7.4/nix-support:
  24901. 1068.49 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24902. 1068.49 s [ghc-9.4.8-with-packages] /nix/store/r3x9zl5gmlbbclkxs9x9xv5plbqghp68-safe-exceptions-0.1.7.4/nix-support:
  24903. 1068.49 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24904. 1068.50 s [ghc-9.4.8-with-packages] /nix/store/0hy1fhipcn6f0ygjb20116nb5dvgsaj5-transformers-base-0.4.6/nix-support:
  24905. 1068.50 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24906. 1068.50 s [ghc-9.4.8-with-packages] /nix/store/0hy1fhipcn6f0ygjb20116nb5dvgsaj5-transformers-base-0.4.6/nix-support:
  24907. 1068.50 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24908. 1068.50 s [ghc-9.4.8-with-packages] /nix/store/4ls456xhh8ms32l43agldrhi4m3wl838-wl-pprint-annotated-0.1.0.1/nix-support:
  24909. 1068.50 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24910. 1068.50 s [ghc-9.4.8-with-packages] /nix/store/4ls456xhh8ms32l43agldrhi4m3wl838-wl-pprint-annotated-0.1.0.1/nix-support:
  24911. 1068.50 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24912. 1068.50 s [ghc-9.4.8-with-packages] /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0/nix-support:
  24913. 1068.50 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24914. 1068.52 s [ghc-9.4.8-with-packages] /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0/nix-support:
  24915. 1068.52 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24916. 1068.53 s [ghc-9.4.8-with-packages] /nix/store/ncm10l6pk5zmkb3sapfqv4hkg45n16cr-ansi-terminal-types-1.1.3/nix-support:
  24917. 1068.53 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24918. 1068.53 s [ghc-9.4.8-with-packages] /nix/store/ncm10l6pk5zmkb3sapfqv4hkg45n16cr-ansi-terminal-types-1.1.3/nix-support:
  24919. 1068.53 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24920. 1068.53 s [ghc-9.4.8-with-packages] /nix/store/jspa0h3jp93qrkbc5g5a4fzx6pgrf890-hashable-1.4.7.0/nix-support:
  24921. 1068.53 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24922. 1068.54 s [ghc-9.4.8-with-packages] /nix/store/jspa0h3jp93qrkbc5g5a4fzx6pgrf890-hashable-1.4.7.0/nix-support:
  24923. 1068.54 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24924. 1068.54 s [ghc-9.4.8-with-packages] /nix/store/pl48aarrvj4a78524196ynrp0kfa0rlz-distributive-0.6.2.1/nix-support:
  24925. 1068.54 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24926. 1068.54 s [ghc-9.4.8-with-packages] /nix/store/pl48aarrvj4a78524196ynrp0kfa0rlz-distributive-0.6.2.1/nix-support:
  24927. 1068.54 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24928. 1068.54 s [ghc-9.4.8-with-packages] /nix/store/1r4jmk61ibj9l32555cqwkzcizkr9msd-constraints-0.14.2/nix-support:
  24929. 1068.54 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24930. 1068.54 s [ghc-9.4.8-with-packages] /nix/store/1r4jmk61ibj9l32555cqwkzcizkr9msd-constraints-0.14.2/nix-support:
  24931. 1068.54 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24932. 1068.55 s [ghc-9.4.8-with-packages] /nix/store/jcn2fbz35mdbic6gbp9r5vqgh4h265a7-lifted-base-0.2.3.12/nix-support:
  24933. 1068.55 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24934. 1068.55 s [ghc-9.4.8-with-packages] /nix/store/jcn2fbz35mdbic6gbp9r5vqgh4h265a7-lifted-base-0.2.3.12/nix-support:
  24935. 1068.55 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24936. 1068.55 s [ghc-9.4.8-with-packages] /nix/store/9i2ipcbxnddqba4h5kqlz8skd6c4yb9f-transformers-compat-0.7.2/nix-support:
  24937. 1068.55 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24938. 1068.55 s [ghc-9.4.8-with-packages] /nix/store/9i2ipcbxnddqba4h5kqlz8skd6c4yb9f-transformers-compat-0.7.2/nix-support:
  24939. 1068.55 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24940. 1068.56 s [ghc-9.4.8-with-packages] /nix/store/wjr31kxrg5xzjyfjwgfdh31m908893an-splitmix-0.1.3.1/nix-support:
  24941. 1068.56 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24942. 1068.56 s [ghc-9.4.8-with-packages] /nix/store/wjr31kxrg5xzjyfjwgfdh31m908893an-splitmix-0.1.3.1/nix-support:
  24943. 1068.56 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24944. 1068.56 s [ghc-9.4.8-with-packages] /nix/store/w2wfk6ad9zqz33q8cjrm1rnq4rzrkc2f-unliftio-core-0.2.1.0/nix-support:
  24945. 1068.56 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24946. 1068.56 s [ghc-9.4.8-with-packages] /nix/store/w2wfk6ad9zqz33q8cjrm1rnq4rzrkc2f-unliftio-core-0.2.1.0/nix-support:
  24947. 1068.56 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24948. 1068.56 s [ghc-9.4.8-with-packages] /nix/store/lnflkc76zbjzj6nz862nr3d0hgn8y5g5-base-orphans-0.9.3/nix-support:
  24949. 1068.56 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24950. 1068.56 s [ghc-9.4.8-with-packages] /nix/store/lnflkc76zbjzj6nz862nr3d0hgn8y5g5-base-orphans-0.9.3/nix-support:
  24951. 1068.56 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24952. 1068.56 s [ghc-9.4.8-with-packages] /nix/store/rvw80ra5wr1an100njnn6i9gp1wdcipr-os-string-2.0.8/nix-support:
  24953. 1068.56 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24954. 1068.57 s [ghc-9.4.8-with-packages] /nix/store/rvw80ra5wr1an100njnn6i9gp1wdcipr-os-string-2.0.8/nix-support:
  24955. 1068.57 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24956. 1068.57 s [ghc-9.4.8-with-packages] /nix/store/nqfx6vm4r7yzwzfxas9klvp0myx0ijvd-tagged-0.8.9/nix-support:
  24957. 1068.57 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24958. 1068.57 s [ghc-9.4.8-with-packages] /nix/store/nqfx6vm4r7yzwzfxas9klvp0myx0ijvd-tagged-0.8.9/nix-support:
  24959. 1068.57 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24960. 1068.57 s [ghc-9.4.8-with-packages] /nix/store/yrlcjwmlwwmk9x9a3cy8vvn4mlww8kn1-boring-0.2.2/nix-support:
  24961. 1068.57 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24962. 1068.57 s [ghc-9.4.8-with-packages] /nix/store/yrlcjwmlwwmk9x9a3cy8vvn4mlww8kn1-boring-0.2.2/nix-support:
  24963. 1068.57 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24964. 1069.67 s [ghc-9.4.8-with-packages] Warning: haddock-interfaces: /nix/store/nkwi1bfw3z5c4n1fnrlakrslkcgwbk8v-hedgehog-1.5/share/doc/x86_64-linux-ghc-9.4.8/hedgehog-1.5/html/hedgehog.haddock doesn't exist or isn't a file
  24965. 1069.67 s [ghc-9.4.8-with-packages] Warning: haddock-html: /nix/store/nkwi1bfw3z5c4n1fnrlakrslkcgwbk8v-hedgehog-1.5/share/doc/x86_64-linux-ghc-9.4.8/hedgehog-1.5/html doesn't exist or isn't a directory
  24966. 1070.75 s [ghc-9.4.8-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/px8knjkzgqv1lwri5d8mnvwyrs7h2bpy-ghc-9.4.8-with-packages
  24967. 1071.32 s [ghc-9.4.8-with-packages:post-build] Pushing 1 paths (120 are already present) using zstd to cache sellout ⏳
  24968. 1071.32 s [ghc-9.4.8-with-packages:post-build]
  24969. 1071.67 s [ghc-9.4.8-with-packages:post-build] Pushing /nix/store/px8knjkzgqv1lwri5d8mnvwyrs7h2bpy-ghc-9.4.8-with-packages (4.85 MiB)
  24970. 1073.16 s [ghc-9.4.8-with-packages:post-build]
  24971. 1073.25 s [ghc-9.4.8-with-packages:post-build] All done.
  24972. 1073.25 s [ghc-9.4.8-with-packages:post-build] Uploading to the NixCI cache: /nix/store/px8knjkzgqv1lwri5d8mnvwyrs7h2bpy-ghc-9.4.8-with-packages
  24973. 1073.25 s [ghc-9.4.8-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24974. 1073.44 s [ghc-9.4.8-with-packages:post-build] copying 1 paths...
  24975. 1073.44 s [ghc-9.4.8-with-packages:post-build] copying path '/nix/store/px8knjkzgqv1lwri5d8mnvwyrs7h2bpy-ghc-9.4.8-with-packages' to 'https://cache.nix-ci.com'...
  24976. 1074.60 s [ghc-9.4.8-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24977. 1074.84 s [ghc-9.4.8-with-packages:post-build] copying 1 paths...
  24978. 1074.84 s [ghc-9.4.8-with-packages:post-build] copying path '/nix/store/02yrxwdw9ww8gy4c575h5n7kddkn3fxs-ghc-9.4.8-with-packages.drv' to 'https://cache.nix-ci.com'...
  24979. 1075.09 s Progress: 33 of 39 built, 373 of 373 downloaded from cache
  24980. 1106.13 s Waiting for lock on shellcheck
  24981. 1116.15 s Waiting for lock on bash-language-server
  24982. 1131.17 s Waiting for lock on project-manager-path-for-duoids
  24983. 1136.27 s Building /nix/store/xmk0d975yf6dpxf5mzj40wk6lljw70y7-ghc-shell-for-packages-0.drv
  24984. 1136.37 s [ghc-shell-for-packages:post-build] Uploading to cachix cache "sellout": /nix/store/052n9sp3dh54c951592nkbfkpk4l5l9z-ghc-shell-for-packages-0
  24985. 1136.92 s [ghc-shell-for-packages:post-build] Pushing 1 paths (322 are already present) using zstd to cache sellout ⏳
  24986. 1136.92 s [ghc-shell-for-packages:post-build]
  24987. 1137.30 s [ghc-shell-for-packages:post-build] Pushing /nix/store/052n9sp3dh54c951592nkbfkpk4l5l9z-ghc-shell-for-packages-0 (256.00 B)
  24988. 1138.32 s [ghc-shell-for-packages:post-build]
  24989. 1138.32 s [ghc-shell-for-packages:post-build] All done.
  24990. 1138.34 s [ghc-shell-for-packages:post-build] Uploading to the NixCI cache: /nix/store/052n9sp3dh54c951592nkbfkpk4l5l9z-ghc-shell-for-packages-0
  24991. 1138.38 s [ghc-shell-for-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24992. 1138.41 s [ghc-shell-for-packages:post-build] copying 1 paths...
  24993. 1138.41 s [ghc-shell-for-packages:post-build] copying path '/nix/store/052n9sp3dh54c951592nkbfkpk4l5l9z-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...
  24994. 1138.79 s [ghc-shell-for-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24995. 1139.16 s [ghc-shell-for-packages:post-build] copying 1 paths...
  24996. 1139.16 s [ghc-shell-for-packages:post-build] copying path '/nix/store/xmk0d975yf6dpxf5mzj40wk6lljw70y7-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...
  24997. 1139.39 s Progress: 34 of 35 built, 373 of 373 downloaded from cache
  24998. 1139.39 s Progress: 35 of 35 built, 373 of 373 downloaded from cache
  24999. 1139.39 s /nix/store/052n9sp3dh54c951592nkbfkpk4l5l9z-ghc-shell-for-packages-0
  25000. 1139.44 s Build succeeded.
Tail Raw Logs