1158.60 s
[pandoc] #1: OK (0.02s)
1158.61 s
[pandoc] #2: OK (0.01s)
1158.61 s
[pandoc] 256.md
1158.62 s
[pandoc] #1: OK (0.01s)
1158.63 s
[pandoc] #2: OK
1158.63 s
[pandoc] pandoc-citeproc-401.md
1158.75 s
[pandoc] #1: OK (0.12s)
1158.75 s
[pandoc] 3736.md
1158.76 s
[pandoc] #1: OK
1158.77 s
[pandoc] #2: OK
1158.77 s
[pandoc] #3: OK
1158.77 s
[pandoc] 3708.md
1158.78 s
[pandoc] #1: OK
1158.78 s
[pandoc] 6783.md
1158.82 s
[pandoc] #1: OK (0.04s)
1158.82 s
[pandoc] 8487.md
1158.83 s
[pandoc] #1: OK
1158.83 s
[pandoc] 9472.md
1158.87 s
[pandoc] #1: OK (0.04s)
1158.87 s
[pandoc] 7953.md
1158.88 s
[pandoc] #1: OK
1158.88 s
[pandoc] 3968.md
1158.88 s
[pandoc] #1: OK
1158.89 s
[pandoc] biblatex-knuth-ct-b.md
1158.93 s
[pandoc] #1: OK (0.05s)
1158.93 s
[pandoc] biblatex-cms.md
1158.97 s
[pandoc] #1: OK (0.03s)
1158.97 s
[pandoc] biblatex-hyman.md
1159.00 s
[pandoc] #1: OK (0.03s)
1159.00 s
[pandoc] 9603.md
1159.01 s
[pandoc] #1: OK (0.01s)
1159.01 s
[pandoc] 8003.md
1159.03 s
[pandoc] #1: OK (0.02s)
1159.03 s
[pandoc] 3701.md
1159.04 s
[pandoc] #1: OK (0.01s)
1159.05 s
[pandoc] #2: OK (0.02s)
1159.05 s
[pandoc] 10855.md
1159.07 s
[pandoc] #1: OK (0.01s)
1159.09 s
[pandoc] #2: OK (0.02s)
1159.10 s
[pandoc] #3: OK (0.01s)
1159.11 s
[pandoc] #4: OK (0.01s)
1159.11 s
[pandoc] 5936.md
1159.12 s
[pandoc] #1: OK
1159.13 s
[pandoc] #2: OK
1159.13 s
[pandoc] 7064.md
1159.14 s
[pandoc] #1: OK (0.01s)
1159.14 s
[pandoc] 10825.md
1159.15 s
[pandoc] #1: OK (0.01s)
1159.15 s
[pandoc] pandoc-citeproc-chicago-fullnote-bibliography.md
1159.33 s
[pandoc] #1: OK (0.18s)
1159.33 s
[pandoc] 5116.md
1159.35 s
[pandoc] #1: OK (0.02s)
1159.38 s
[pandoc] #2: OK (0.03s)
1159.39 s
[pandoc] #3: OK (0.02s)
1159.39 s
[pandoc] figures-jira.md
1159.40 s
[pandoc] #1: OK (0.01s)
1159.40 s
[pandoc] biblatex-cotton.md
1159.44 s
[pandoc] #1: OK (0.04s)
1159.44 s
[pandoc] input-with-endinput.md
1159.45 s
[pandoc] #1: OK
1159.45 s
[pandoc] biblatex-report.md
1159.49 s
[pandoc] #1: OK (0.03s)
1159.49 s
[pandoc] 7003.md
1159.60 s
[pandoc] #1: OK (0.12s)
1159.60 s
[pandoc] 10862.md
1159.61 s
[pandoc] #1: OK (0.01s)
1159.61 s
[pandoc] biblatex-moore-related.md
1159.64 s
[pandoc] #1: OK (0.03s)
1159.64 s
[pandoc] 4877.md
1159.65 s
[pandoc] #1: OK
1159.65 s
[pandoc] #2: OK
1159.65 s
[pandoc] 3537.md
1159.66 s
[pandoc] #1: OK
1159.67 s
[pandoc] #2: OK
1159.68 s
[pandoc] #3: OK
1159.68 s
[pandoc] 9017.md
1159.72 s
[pandoc] #1: OK (0.04s)
1159.72 s
[pandoc] biblatex-augustine.md
1159.74 s
[pandoc] #1: OK (0.02s)
1159.74 s
[pandoc] sloppypar.md
1159.75 s
[pandoc] #1: OK (0.01s)
1159.76 s
[pandoc] #2: OK
1159.76 s
[pandoc] figures-rst.md
1159.77 s
[pandoc] #1: OK
1159.77 s
[pandoc] empty_paragraphs.md
1159.85 s
[pandoc] #1: OK (0.08s)
1159.93 s
[pandoc] #2: OK (0.08s)
1160.01 s
[pandoc] #3: OK (0.08s)
1160.06 s
[pandoc] #4: OK (0.05s)
1160.07 s
[pandoc] #5: OK
1160.08 s
[pandoc] #6: OK (0.01s)
1160.09 s
[pandoc] #7: OK
1160.10 s
[pandoc] #8: OK
1160.11 s
[pandoc] #9: OK
1160.12 s
[pandoc] #10: OK (0.01s)
1160.12 s
[pandoc] biblatex-issue288.md
1160.15 s
[pandoc] #1: OK (0.03s)
1160.15 s
[pandoc] 4007.md
1160.16 s
[pandoc] #1: OK
1160.17 s
[pandoc] #2: OK
1160.18 s
[pandoc] #3: OK
1160.18 s
[pandoc] 5795.md
1160.19 s
[pandoc] #1: OK (0.01s)
1160.20 s
[pandoc] #2: OK
1160.21 s
[pandoc] #3: OK
1160.21 s
[pandoc] 3401.md
1160.22 s
[pandoc] #1: OK
1160.23 s
[pandoc] #2: OK
1160.23 s
[pandoc] 4199.md
1160.24 s
[pandoc] #1: OK
1160.24 s
[pandoc] 5793.md
1160.25 s
[pandoc] #1: OK (0.01s)
1160.26 s
[pandoc] #2: OK (0.01s)
1160.26 s
[pandoc] 6774.md
1160.27 s
[pandoc] #1: OK
1160.28 s
[pandoc] #2: OK (0.01s)
1160.29 s
[pandoc] #3: OK (0.01s)
1160.31 s
[pandoc] #4: OK (0.01s)
1160.31 s
[pandoc] 9579.md
1160.32 s
[pandoc] #1: OK
1160.33 s
[pandoc] #2: OK (0.01s)
1160.33 s
[pandoc] biblatex-kowalik.md
1160.39 s
[pandoc] #1: OK (0.06s)
1160.39 s
[pandoc] 9088.md
1160.40 s
[pandoc] #1: OK (0.01s)
1160.40 s
[pandoc] 4832.md
1160.41 s
[pandoc] #1: OK
1160.42 s
[pandoc] #2: OK
1160.43 s
[pandoc] #3: OK
1160.43 s
[pandoc] 9038.md
1160.43 s
[pandoc] #1: OK
1160.44 s
[pandoc] 9047.md
1160.44 s
[pandoc] #1: OK
1160.46 s
[pandoc] #2: OK (0.01s)
1160.47 s
[pandoc] #3: OK (0.01s)
1160.47 s
[pandoc] #4: OK
1160.47 s
[pandoc] 5340.md
1160.48 s
[pandoc] #1: OK
1160.48 s
[pandoc] pandoc-citeproc-70.md
1160.59 s
[pandoc] #1: OK (0.11s)
1160.59 s
[pandoc] biblatex-wassenberg.md
1160.62 s
[pandoc] #1: OK (0.03s)
1160.62 s
[pandoc] 7678.md
1160.64 s
[pandoc] #1: OK (0.02s)
1160.66 s
[pandoc] #2: OK (0.02s)
1160.66 s
[pandoc] 4056.md
1160.67 s
[pandoc] #1: OK
1160.68 s
[pandoc] #2: OK
1160.68 s
[pandoc] 6265.md
1160.69 s
[pandoc] #1: OK
1160.69 s
[pandoc] pandoc-citeproc-77.md
1160.80 s
[pandoc] #1: OK (0.11s)
1160.80 s
[pandoc] biblatex-coleridge.md
1160.85 s
[pandoc] #1: OK (0.05s)
1160.85 s
[pandoc] pandoc-citeproc-move-period-inside-quote.md
1160.89 s
[pandoc] #1: OK (0.04s)
1160.89 s
[pandoc] 7546.md
1160.90 s
[pandoc] #1: OK
1160.90 s
[pandoc] 7272.md
1160.91 s
[pandoc] #1: OK
1160.91 s
[pandoc] 8070.md
1160.92 s
[pandoc] #1: OK
1160.92 s
[pandoc] 7557.md
1160.93 s
[pandoc] #1: OK
1160.93 s
[pandoc] 3526.md
1160.93 s
[pandoc] #1: OK
1160.93 s
[pandoc] pandoc-citeproc-399.md
1161.04 s
[pandoc] #1: OK (0.10s)
1161.04 s
[pandoc] 7436.md
1161.04 s
[pandoc] #1: OK
1161.05 s
[pandoc] 9630.md
1161.06 s
[pandoc] #1: OK (0.01s)
1161.06 s
[pandoc] pandoc-citeproc-118.md
1161.10 s
[pandoc] #1: OK (0.04s)
1161.10 s
[pandoc] biblatex-book-coleridge.md
1161.13 s
[pandoc] #1: OK (0.03s)
1161.13 s
[pandoc] 3804.md
1161.14 s
[pandoc] #1: OK
1161.14 s
[pandoc] unicode-collation.md
1161.25 s
[pandoc] #1: OK (0.11s)
1161.36 s
[pandoc] #2: OK (0.10s)
1161.46 s
[pandoc] #3: OK (0.10s)
1161.46 s
[pandoc] 2397.md
1161.47 s
[pandoc] #1: OK (0.01s)
1161.47 s
[pandoc] 4240.md
1161.48 s
[pandoc] #1: OK (0.01s)
1161.48 s
[pandoc] pandoc-citeproc-locators-integrated.md
1161.54 s
[pandoc] #1: OK (0.06s)
1161.54 s
[pandoc] tasklist.md
1161.55 s
[pandoc] #1: OK (0.01s)
1161.57 s
[pandoc] #2: OK (0.01s)
1161.58 s
[pandoc] #3: OK (0.02s)
1161.59 s
[pandoc] #4: OK
1161.60 s
[pandoc] #5: OK
1161.60 s
[pandoc] 5714.md
1161.61 s
[pandoc] #1: OK
1161.61 s
[pandoc] pandoc-citeproc-ieee.md
1161.72 s
[pandoc] #1: OK (0.10s)
1161.72 s
[pandoc] 3523.md
1161.73 s
[pandoc] #1: OK (0.02s)
1161.73 s
[pandoc] 10631.md
1161.74 s
[pandoc] #1: OK
1161.74 s
[pandoc] 7099.md
1161.75 s
[pandoc] #1: OK
1161.75 s
[pandoc] #2: OK
1161.75 s
[pandoc] 2103.md
1161.76 s
[pandoc] #1: OK
1161.76 s
[pandoc] 5119.md
1161.77 s
[pandoc] #1: OK (0.01s)
1161.77 s
[pandoc] 4019.md
1161.78 s
[pandoc] #1: OK
1161.78 s
[pandoc] 8354.md
1161.82 s
[pandoc] #1: OK (0.04s)
1161.83 s
[pandoc] 10459.md
1161.83 s
[pandoc] #1: OK
1161.83 s
[pandoc] bibtex-basic.md
1161.85 s
[pandoc] #1: OK (0.02s)
1161.85 s
[pandoc] 6958.md
1161.86 s
[pandoc] #1: OK (0.01s)
1161.86 s
[pandoc] biblatex-knuth-ct-related.md
1161.90 s
[pandoc] #1: OK (0.04s)
1161.91 s
[pandoc] 1745.md
1161.92 s
[pandoc] #1: OK (0.01s)
1161.92 s
[pandoc] 8079.md
1161.93 s
[pandoc] #1: OK
1161.93 s
[pandoc] biblatex-vangennep.md
1161.95 s
[pandoc] #1: OK (0.02s)
1161.95 s
[pandoc] 4171.md
1161.96 s
[pandoc] #1: OK (0.01s)
1161.98 s
[pandoc] #2: OK (0.02s)
1161.98 s
[pandoc] #3: OK
1161.98 s
[pandoc] 3422.md
1161.99 s
[pandoc] #1: OK
1161.99 s
[pandoc] 9878.md
1162.00 s
[pandoc] #1: OK
1162.01 s
[pandoc] #2: OK
1162.01 s
[pandoc] latex-command-comment.md
1162.02 s
[pandoc] #1: OK (0.01s)
1162.02 s
[pandoc] 4068.md
1162.04 s
[pandoc] #1: OK (0.01s)
1162.04 s
[pandoc] figures-html.md
1162.05 s
[pandoc] #1: OK (0.01s)
1162.06 s
[pandoc] #2: OK (0.01s)
1162.07 s
[pandoc] #3: OK (0.01s)
1162.08 s
[pandoc] #4: OK (0.01s)
1162.10 s
[pandoc] #5: OK (0.01s)
1162.11 s
[pandoc] #6: OK (0.01s)
1162.11 s
[pandoc] 6741.md
1162.27 s
[pandoc] #1: OK (0.16s)
1162.27 s
[pandoc] 8365.md
1162.28 s
[pandoc] #1: OK
1162.28 s
[pandoc] 10071.md
1162.29 s
[pandoc] #1: OK
1162.29 s
[pandoc] 7847.md
1162.30 s
[pandoc] #1: OK (0.01s)
1162.31 s
[pandoc] #2: OK (0.01s)
1162.32 s
[pandoc] #3: OK (0.01s)
1162.32 s
[pandoc] biblatex-dates.md
1162.38 s
[pandoc] #1: OK (0.05s)
1162.38 s
[pandoc] 8179.md
1162.39 s
[pandoc] #1: OK (0.01s)
1162.39 s
[pandoc] 5416.md
1162.40 s
[pandoc] #1: OK
1162.41 s
[pandoc] #2: OK (0.01s)
1162.41 s
[pandoc] biblatex-cicero.md
1162.46 s
[pandoc] #1: OK (0.05s)
1162.46 s
[pandoc] 10328.md
1162.55 s
[pandoc] #1: OK (0.02s)
1162.55 s
[pandoc] 5876.md
1162.55 s
[pandoc] #1: OK (0.01s)
1162.55 s
[pandoc] #2: OK (0.01s)
1162.55 s
[pandoc] #3: OK
1162.55 s
[pandoc] #4: OK
1162.55 s
[pandoc] 4550.md
1162.55 s
[pandoc] #1: OK
1162.55 s
[pandoc] 9150.md
1162.55 s
[pandoc] #1: OK (0.01s)
1162.55 s
[pandoc] #2: OK (0.01s)
1162.56 s
[pandoc] #3: OK (0.02s)
1162.56 s
[pandoc] bits-book-meta.md
1162.56 s
[pandoc] #1: OK
1162.56 s
[pandoc] biblatex-gerhardt.md
1162.59 s
[pandoc] #1: OK (0.03s)
1162.59 s
[pandoc] biblatex-article.md
1162.63 s
[pandoc] #1: OK (0.04s)
1162.63 s
[pandoc] 5014.md
1162.65 s
[pandoc] #1: OK (0.01s)
1162.65 s
[pandoc] 4742.md
1162.66 s
[pandoc] #1: OK (0.02s)
1162.67 s
[pandoc] #2: OK (0.01s)
1162.69 s
[pandoc] #3: OK (0.01s)
1162.69 s
[pandoc] pandoc-citeproc-75.md
1162.73 s
[pandoc] #1: OK (0.04s)
1162.73 s
[pandoc] 9358.md
1162.75 s
[pandoc] #1: OK (0.02s)
1162.75 s
[pandoc] pandoc-citeproc-locators-delimited.md
1162.79 s
[pandoc] #1: OK (0.04s)
1162.79 s
[pandoc] biblatex-glashow.md
1162.81 s
[pandoc] #1: OK (0.02s)
1162.81 s
[pandoc] 8764.md
1162.81 s
[pandoc] #1: OK
1162.81 s
[pandoc] 5684.md
1162.82 s
[pandoc] #1: OK
1162.82 s
[pandoc] 10730.md
1162.83 s
[pandoc] #1: OK
1162.83 s
[pandoc] 5797.md
1162.84 s
[pandoc] #1: OK
1162.85 s
[pandoc] #2: OK
1162.85 s
[pandoc] #3: OK
1162.85 s
[pandoc] 9445.md
1162.86 s
[pandoc] #1: OK
1162.86 s
[pandoc] 4454.md
1162.87 s
[pandoc] #1: OK
1162.87 s
[pandoc] 5476.md
1162.88 s
[pandoc] #1: OK
1162.88 s
[pandoc] 4382.md
1162.88 s
[pandoc] #1: OK
1162.88 s
[pandoc] 1279.md
1162.89 s
[pandoc] #1: OK
1162.89 s
[pandoc] 4470.md
1162.90 s
[pandoc] #1: OK
1162.90 s
[pandoc] #2: OK
1162.91 s
[pandoc] #3: OK
1162.92 s
[pandoc] #4: OK
1162.92 s
[pandoc] 4208.md
1162.93 s
[pandoc] #1: OK (0.01s)
1162.93 s
[pandoc] 3792.md
1162.93 s
[pandoc] #1: OK
1162.93 s
[pandoc] 4186.md
1162.94 s
[pandoc] #1: OK
1163.03 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 )
1163.38 s
[pandoc] #2: OK (0.44s)
1163.38 s
[pandoc] pandoc-citeproc-338.md
1163.41 s
[pandoc] #1: OK (0.03s)
1163.41 s
[pandoc] 10279.md
1163.42 s
[pandoc] #1: OK (0.01s)
1163.42 s
[pandoc] 9371.md
1163.43 s
[pandoc] #1: OK (0.01s)
1163.43 s
[pandoc] 10145.md
1163.45 s
[pandoc] #1: OK (0.01s)
1163.45 s
[pandoc] 1608.md
1163.46 s
[pandoc] #1: OK (0.02s)
1163.46 s
[pandoc] 7321.md
1163.50 s
[pandoc] #1: OK (0.04s)
1163.50 s
[pandoc] 3978.md
1163.51 s
[pandoc] #1: OK
1163.51 s
[pandoc] emoji.md
1163.52 s
[pandoc] #1: OK (0.01s)
1163.53 s
[pandoc] #2: OK (0.01s)
1163.54 s
[pandoc] #3: OK
1163.56 s
[pandoc] #4: OK (0.01s)
1163.56 s
[pandoc] bits-toc-elements.md
1163.56 s
[pandoc] #1: OK
1163.56 s
[pandoc] 3675.md
1163.57 s
[pandoc] #1: OK
1163.57 s
[pandoc] 9676.md
1163.59 s
[pandoc] #1: OK (0.01s)
1163.59 s
[pandoc] biblatex-jcg.md
1163.61 s
[pandoc] #1: OK (0.03s)
1163.62 s
[pandoc] 8402.md
1163.63 s
[pandoc] #1: OK (0.01s)
1163.63 s
[pandoc] 10062.md
1163.63 s
[pandoc] #1: OK
1163.63 s
[pandoc] biblatex-escapedquotes.md
1163.65 s
[pandoc] #1: OK (0.02s)
1163.65 s
[pandoc] 4281.md
1163.66 s
[pandoc] #1: OK
1163.66 s
[pandoc] 7494.md
1163.67 s
[pandoc] #1: OK
1163.69 s
[pandoc] #2: OK (0.01s)
1163.69 s
[pandoc] #3: OK
1163.70 s
[pandoc] #4: OK
1163.71 s
[pandoc] #5: OK
1163.71 s
[pandoc] 6348.md
1163.71 s
[pandoc] #1: OK
1163.72 s
[pandoc] 5686.md
1163.72 s
[pandoc] #1: OK
1163.72 s
[pandoc] pandoc-citeproc-312.md
1163.83 s
[pandoc] #1: OK (0.11s)
1163.83 s
[pandoc] 5898.md
1163.84 s
[pandoc] #1: OK
1163.84 s
[pandoc] 7376.md
1163.89 s
[pandoc] #1: OK (0.05s)
1163.89 s
[pandoc] 1881.md
1163.90 s
[pandoc] #1: OK (0.01s)
1163.91 s
[pandoc] #2: OK
1163.91 s
[pandoc] 4653.md
1163.92 s
[pandoc] #1: OK
1163.92 s
[pandoc] citeproc-17.md
1163.94 s
[pandoc] #1: OK (0.02s)
1163.94 s
[pandoc] 6285.md
1163.99 s
[pandoc] #1: OK (0.05s)
1163.99 s
[pandoc] 6802.md
1163.99 s
[pandoc] #1: OK
1163.99 s
[pandoc] shift-heading-level-by.md
1164.00 s
[pandoc] #1: OK
1164.01 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 )
1164.01 s
[pandoc] #2: OK (0.01s)
1164.01 s
[pandoc] 4960.md
1164.02 s
[pandoc] #1: OK
1164.03 s
[pandoc] #2: OK
1164.04 s
[pandoc] #3: OK (0.01s)
1164.04 s
[pandoc] biblatex-shore.md
1164.09 s
[pandoc] #1: OK (0.04s)
1164.09 s
[pandoc] 9902.md
1164.10 s
[pandoc] #1: OK
1164.10 s
[pandoc] 3958.md
1164.11 s
[pandoc] #1: OK (0.01s)
1164.12 s
[pandoc] #2: OK (0.01s)
1164.13 s
[pandoc] #3: OK
1164.13 s
[pandoc] biblatex-worman.md
1164.16 s
[pandoc] #1: OK (0.03s)
1164.16 s
[pandoc] 2994.md
1164.21 s
[vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
1164.23 s
[pandoc] #1: OK (0.07s)
1164.23 s
[pandoc] 4159.md
1164.23 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 )
1164.24 s
[pandoc] #1: OK
1164.24 s
[pandoc] 6588.md
1164.25 s
[pandoc] #1: OK (0.01s)
1164.25 s
[pandoc] biblatex-companion.md
1164.29 s
[pandoc] #1: OK (0.04s)
1164.29 s
[pandoc] 6844.md
1164.29 s
[pandoc] #1: OK
1164.30 s
[pandoc] #2: OK
1164.31 s
[pandoc] #3: OK
1164.31 s
[pandoc] 4465.md
1164.32 s
[pandoc] #1: OK
1164.32 s
[pandoc] 9387.md
1164.32 s
[pandoc] #1: OK
1164.33 s
[pandoc] #2: OK
1164.33 s
[pandoc] 8661.md
1164.34 s
[pandoc] #1: OK
1164.34 s
[pandoc] 3510.md
1164.35 s
[pandoc] #1: OK
1164.35 s
[pandoc] 3539.md
1164.36 s
[pandoc] #1: OK
1164.37 s
[pandoc] #2: OK
1164.37 s
[pandoc] #3: OK
1164.38 s
[pandoc] #4: OK
1164.39 s
[pandoc] #5: OK
1164.40 s
[pandoc] #6: OK (0.01s)
1164.40 s
[pandoc] 9388.md
1164.41 s
[pandoc] #1: OK (0.01s)
1164.41 s
[pandoc] 3494.md
1164.43 s
[pandoc] #1: OK (0.02s)
1164.43 s
[pandoc] 7112.md
1164.45 s
[pandoc] #1: OK (0.01s)
1164.45 s
[pandoc] 7434.md
1164.47 s
[pandoc] #1: OK (0.02s)
1164.47 s
[pandoc] 5241.md
1164.48 s
[pandoc] #1: OK
1164.48 s
[pandoc] 8997.md
1164.49 s
[pandoc] #1: OK
1164.50 s
[pandoc] #2: OK
1164.50 s
[pandoc] 853.md
1164.51 s
[pandoc] #1: OK (0.01s)
1164.51 s
[pandoc] 10271.md
1164.52 s
[pandoc] #1: OK
1164.54 s
[pandoc] #2: OK (0.02s)
1164.55 s
[pandoc] #3: OK
1164.55 s
[pandoc] #4: OK
1164.56 s
[pandoc] 4113.md
1164.56 s
[pandoc] #1: OK
1164.56 s
[pandoc] 7573.md
1164.57 s
[pandoc] #1: OK
1164.57 s
[pandoc] biblatex-yoon.md
1164.61 s
[pandoc] #1: OK (0.03s)
1164.61 s
[pandoc] biblatex-inbook-title-booktitle-maintitle-series.md
1164.62 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 )
1164.62 s
[vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
1164.62 s
[vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
1164.62 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 )
1164.63 s
[pandoc] #1: OK (0.02s)
1164.63 s
[pandoc] 8611.md
1164.64 s
[pandoc] #1: OK (0.02s)
1164.64 s
[pandoc] csv.md
1164.65 s
[pandoc] #1: OK (0.01s)
1164.65 s
[pandoc] figures-fb2.md
1164.66 s
[pandoc] #1: OK
1164.66 s
[pandoc] rst_block_subst.md
1164.67 s
[pandoc] #1: OK
1164.67 s
[pandoc] 7568.md
1164.68 s
[pandoc] #1: OK (0.01s)
1164.68 s
[pandoc] 8236.md
1164.69 s
[pandoc] #1: OK
1164.69 s
[pandoc] 5099.md
1164.70 s
[pandoc] #1: OK
1164.70 s
[pandoc] #2: OK
1164.70 s
[pandoc] 8770-block.md
1164.72 s
[pandoc] #1: OK (0.01s)
1164.72 s
[pandoc] 5541-localLink.md
1164.73 s
[pandoc] #1: OK (0.02s)
1164.73 s
[pandoc] bits-book-part-wrapper.md
1164.75 s
[pandoc] #1: OK
1164.75 s
[pandoc] 3512.md
1164.76 s
[pandoc] #1: OK
1164.77 s
[pandoc] #2: OK
1164.77 s
[pandoc] 7219.md
1164.81 s
[pandoc] #1: OK (0.03s)
1164.81 s
[pandoc] 5708.md
1164.82 s
[pandoc] #1: OK (0.01s)
1164.82 s
[pandoc] pandoc-citeproc-160.md
1164.87 s
[pandoc] #1: OK (0.05s)
1164.87 s
[pandoc] biblatex-basic.md
1164.91 s
[pandoc] #1: OK (0.04s)
1164.91 s
[pandoc] nested-table-to-asciidoc-6942.md
1164.94 s
[pandoc] #1: OK (0.03s)
1164.96 s
[pandoc] #2: OK (0.02s)
1164.96 s
[pandoc] 6837.md
1164.97 s
[pandoc] #1: OK (0.01s)
1164.98 s
[pandoc] #2: OK
1164.98 s
[pandoc] #3: OK
1164.98 s
[pandoc] 4528.md
1164.99 s
[pandoc] #1: OK
1165.00 s
[pandoc] #2: OK
1165.01 s
[pandoc] #3: OK
1165.02 s
[pandoc] #4: OK
1165.02 s
[pandoc] #5: OK
1165.04 s
[pandoc] #6: OK
1165.04 s
[pandoc] #7: OK
1165.05 s
[pandoc] #8: OK
1165.06 s
[pandoc] #9: OK
1165.07 s
[pandoc] #10: OK
1165.08 s
[pandoc] #11: OK
1165.09 s
[pandoc] #12: OK (0.01s)
1165.10 s
[pandoc] #13: OK
1165.11 s
[pandoc] #14: OK
1165.12 s
[pandoc] #15: OK
1165.13 s
[pandoc] #16: OK
1165.14 s
[pandoc] #17: OK (0.01s)
1165.15 s
[pandoc] #18: OK
1165.16 s
[pandoc] #19: OK
1165.17 s
[pandoc] #20: OK
1165.38 s
[pandoc] #21: OK (0.20s)
1165.38 s
[pandoc] biblatex-kastenholz.md
1165.42 s
[pandoc] #1: OK (0.04s)
1165.42 s
[pandoc] 3755.md
1165.43 s
[pandoc] #1: OK
1165.44 s
[pandoc] #2: OK
1165.44 s
[pandoc] 6620.md
1165.45 s
[pandoc] #1: OK (0.01s)
1165.45 s
[pandoc] 4420.md
1165.46 s
[pandoc] #1: OK
1165.46 s
[pandoc] 4908.md
1165.47 s
[pandoc] #1: OK
1165.47 s
[pandoc] biblatex-nietzsche-historie.md
1165.50 s
[pandoc] #1: OK (0.03s)
1165.50 s
[pandoc] 3558.md
1165.51 s
[pandoc] #1: OK (0.01s)
1165.51 s
[pandoc] 5986.md
1165.56 s
[pandoc] #1: OK (0.04s)
1165.56 s
[pandoc] biblatex-strings.md
1165.58 s
[pandoc] #1: OK (0.02s)
1165.58 s
[pandoc] figures-xwiki.md
1165.58 s
[pandoc] #1: OK
1165.59 s
[pandoc] 4054.md
1165.59 s
[pandoc] #1: OK
1165.61 s
[pandoc] #2: OK (0.01s)
1165.61 s
[pandoc] 9202.md
1165.62 s
[pandoc] #1: OK (0.01s)
1165.63 s
[pandoc] #2: OK
1165.64 s
[pandoc] #3: OK
1165.65 s
[pandoc] #4: OK (0.01s)
1165.65 s
[pandoc] #5: OK
1165.65 s
[pandoc] biblatex-gaonkar-in.md
1165.67 s
[pandoc] #1: OK (0.02s)
1165.67 s
[pandoc] biblatex-inbook-title-booktitle-maintitle-series-2.md
1165.70 s
[pandoc] #1: OK (0.03s)
1165.70 s
[pandoc] pandoc-citeproc-31.md
1165.83 s
[pandoc] #1: OK (0.13s)
1165.83 s
[pandoc] 7067.md
1165.84 s
[pandoc] #1: OK (0.01s)
1165.85 s
[pandoc] #2: OK (0.01s)
1165.86 s
[pandoc] #3: OK
1165.86 s
[pandoc] 6765.md
1165.91 s
[pandoc] #1: OK (0.05s)
1165.91 s
[pandoc] 4545.md
1165.92 s
[pandoc] #1: OK (0.01s)
1165.93 s
[pandoc] #2: OK
1165.93 s
[pandoc] pandoc-citeproc-392.md
1165.97 s
[pandoc] #1: OK (0.04s)
1165.97 s
[pandoc] 5565.md
1165.97 s
[pandoc] #1: OK
1165.97 s
[pandoc] 7520.md
1165.98 s
[pandoc] #1: OK
1165.98 s
[pandoc] pandoc-citeproc-250.md
1166.03 s
[pandoc] #1: OK (0.04s)
1166.03 s
[pandoc] 9275.md
1166.05 s
[pandoc] #1: OK (0.02s)
1166.06 s
[pandoc] #2: OK (0.02s)
1166.06 s
[pandoc] typst-property-output.md
1166.07 s
[pandoc] #1: OK
1166.09 s
[pandoc] #2: OK (0.01s)
1166.10 s
[pandoc] #3: OK (0.01s)
1166.11 s
[pandoc] #4: OK (0.01s)
1166.12 s
[pandoc] #5: OK
1166.13 s
[pandoc] #6: OK
1166.14 s
[pandoc] #7: OK
1166.15 s
[pandoc] #8: OK (0.01s)
1166.16 s
[pandoc] #9: OK
1166.16 s
[pandoc] #10: OK
1166.17 s
[pandoc] #11: OK
1166.18 s
[pandoc] #12: OK
1166.19 s
[pandoc] #13: OK
1166.20 s
[pandoc] #14: OK (0.01s)
1166.22 s
[pandoc] #15: OK (0.01s)
1166.22 s
[pandoc] bits-book-part-wrapper-meta.md
1166.23 s
[pandoc] #1: OK (0.01s)
1166.23 s
[pandoc] 7397.md
1166.24 s
[pandoc] #1: OK
1166.25 s
[pandoc] 3450.md
1166.27 s
[pandoc] #1: OK (0.03s)
1166.28 s
[pandoc] #2: OK (0.01s)
1166.28 s
[pandoc] 6858.md
1166.30 s
[pandoc] #1: OK (0.01s)
1166.30 s
[pandoc] #2: OK
1166.30 s
[pandoc] pandoc-citeproc-51.md
1166.42 s
[pandoc] #1: OK (0.11s)
1166.42 s
[pandoc] 5071.md
1166.43 s
[pandoc] #1: OK (0.01s)
1166.44 s
[pandoc] #2: OK (0.01s)
1166.46 s
[pandoc] #3: OK (0.01s)
1166.47 s
[pandoc] #4: OK (0.01s)
1166.47 s
[pandoc] 4012.md
1166.48 s
[pandoc] #1: OK (0.01s)
1166.48 s
[pandoc] 4162.md
1166.49 s
[pandoc] #1: OK
1166.49 s
[pandoc] 3619.md
1166.50 s
[pandoc] #1: OK
1166.51 s
[pandoc] #2: OK (0.01s)
1166.52 s
[pandoc] #3: OK
1166.52 s
[pandoc] 8380.md
1166.53 s
[pandoc] #1: OK
1166.53 s
[pandoc] #2: OK
1166.54 s
[pandoc] #3: OK
1166.54 s
[pandoc] 4677.md
1166.56 s
[pandoc] #1: OK (0.02s)
1166.56 s
[pandoc] 4172.md
1166.57 s
[pandoc] #1: OK (0.01s)
1166.59 s
[pandoc] #2: OK (0.01s)
1166.59 s
[pandoc] 7930.md
1166.61 s
[pandoc] #1: OK (0.02s)
1166.61 s
[pandoc] 7173.md
1166.62 s
[pandoc] #1: OK (0.02s)
1166.64 s
[pandoc] #2: OK (0.02s)
1166.66 s
[pandoc] #3: OK (0.02s)
1166.67 s
[pandoc] #4: OK (0.02s)
1166.69 s
[pandoc] #5: OK (0.01s)
1166.69 s
[pandoc] 512.md
1166.70 s
[pandoc] #1: OK (0.01s)
1166.72 s
[pandoc] #2: OK (0.01s)
1166.73 s
[pandoc] #3: OK (0.02s)
1166.73 s
[pandoc] 10781.md
1166.74 s
[pandoc] #1: OK (0.01s)
1166.74 s
[pandoc] pandoc-citeproc-no-author.md
1166.86 s
[pandoc] #1: OK (0.12s)
1166.86 s
[pandoc] biblatex-crossref-nested.md
1166.89 s
[pandoc] #1: OK (0.03s)
1166.89 s
[pandoc] 5805.md
1166.90 s
[pandoc] #1: OK (0.01s)
1166.91 s
[pandoc] #2: OK
1166.92 s
[pandoc] #3: OK
1166.92 s
[pandoc] 7324.md
1166.97 s
[pandoc] #1: OK (0.04s)
1166.97 s
[pandoc] 3432a.md
1166.98 s
[pandoc] #1: OK (0.01s)
1166.98 s
[pandoc] 6137.md
1167.00 s
[pandoc] #1: OK (0.02s)
1167.00 s
[pandoc] biblatex-westfahl-frontier.md
1167.06 s
[pandoc] #1: OK (0.06s)
1167.07 s
[pandoc] 5967.md
1167.08 s
[pandoc] #1: OK (0.01s)
1167.08 s
[pandoc] 2118.md
1167.09 s
[pandoc] #1: OK (0.02s)
1167.09 s
[pandoc] 10490.md
1167.12 s
[pandoc] #1: OK (0.02s)
1167.12 s
[pandoc] 8513.md
1167.13 s
[pandoc] #1: OK (0.01s)
1167.14 s
[pandoc] #2: OK (0.01s)
1167.16 s
[pandoc] #3: OK (0.02s)
1167.16 s
[pandoc] 7329.md
1167.18 s
[pandoc] #1: OK (0.02s)
1167.23 s
[pandoc] #2: OK (0.05s)
1167.28 s
[pandoc] #3: OK (0.05s)
1167.31 s
[pandoc] #4: OK (0.03s)
1167.31 s
[pandoc] 3257.md
1167.32 s
[pandoc] #1: OK (0.01s)
1167.33 s
[pandoc] #2: OK (0.01s)
1167.33 s
[pandoc] 4845.md
1167.35 s
[pandoc] #1: OK (0.01s)
1167.36 s
[pandoc] biblatex-bibstring-resolution.md
1167.39 s
[pandoc] #1: OK (0.04s)
1167.39 s
[pandoc] 3348.md
1167.41 s
[pandoc] #1: OK (0.02s)
1167.41 s
[pandoc] defaults-inheritance-2.md
1167.41 s
[pandoc] #1: OK
1167.41 s
[pandoc] 9635.md
1167.43 s
[pandoc] #1: OK (0.01s)
1167.43 s
[pandoc] pandoc-citeproc-386.md
1167.47 s
[pandoc] #1: OK (0.05s)
1167.47 s
[pandoc] 7861.md
1167.56 s
[pandoc] #1: OK
1167.56 s
[pandoc] pandoc-citeproc-76.md
1167.60 s
[pandoc] #1: OK (0.12s)
1167.60 s
[pandoc] 10537.md
1167.62 s
[pandoc] #1: OK
1167.63 s
[pandoc] #2: OK
1167.63 s
[pandoc] 8984.md
1167.64 s
[pandoc] #1: OK (0.01s)
1167.65 s
[pandoc] #2: OK (0.01s)
1167.65 s
[pandoc] 3511.md
1167.66 s
[pandoc] #1: OK (0.01s)
1167.67 s
[pandoc] #2: OK (0.01s)
1167.67 s
[pandoc] pandoc-citeproc-307.md
1167.71 s
[pandoc] #1: OK (0.03s)
1167.71 s
[pandoc] 8178.md
1167.71 s
[pandoc] #1: OK
1167.72 s
[pandoc] #2: OK
1167.73 s
[pandoc] #3: OK
1167.73 s
[pandoc] 9209.md
1167.74 s
[pandoc] #1: OK
1167.74 s
[pandoc] 5360.md
1167.75 s
[pandoc] #1: OK
1167.75 s
[pandoc] dots.md
1167.75 s
[pandoc] #1: OK
1167.75 s
[pandoc] 6033.md
1167.77 s
[pandoc] #1: OK (0.01s)
1167.77 s
[pandoc] 8028.md
1167.78 s
[pandoc] #1: OK (0.01s)
1167.78 s
[pandoc] 9045.md
1167.79 s
[pandoc] #1: OK
1167.79 s
[pandoc] 4768.md
1167.79 s
[pandoc] #1: OK
1167.79 s
[pandoc] 6719.md
1167.80 s
[pandoc] #1: OK
1167.81 s
[pandoc] #2: OK
1167.81 s
[pandoc] 4669.md
1167.81 s
[pandoc] #1: OK
1167.83 s
[pandoc] #2: OK (0.01s)
1167.83 s
[pandoc] biblatex-incollection-2.md
1167.87 s
[pandoc] #1: OK (0.04s)
1167.87 s
[pandoc] biblatex-spiegelberg.md
1167.91 s
[pandoc] #1: OK (0.04s)
1167.91 s
[pandoc] 8789.md
1167.92 s
[pandoc] #1: OK (0.02s)
1167.92 s
[pandoc] 8777.md
1167.93 s
[pandoc] #1: OK
1167.93 s
[pandoc] 10148.md
1167.94 s
[pandoc] #1: OK
1167.94 s
[pandoc] 5177.md
1167.95 s
[pandoc] #1: OK
1167.95 s
[pandoc] nested-spanlike.md
1167.96 s
[pandoc] #1: OK
1167.96 s
[pandoc] 3771.md
1167.96 s
[pandoc] #1: OK
1167.96 s
[pandoc] 4598.md
1167.97 s
[pandoc] #1: OK (0.01s)
1167.97 s
[pandoc] latex-color.md
1167.98 s
[pandoc] #1: OK
1167.99 s
[pandoc] #2: OK
1168.00 s
[pandoc] #3: OK
1168.00 s
[pandoc] #4: OK
1168.01 s
[pandoc] #5: OK (0.01s)
1168.02 s
[pandoc] #6: OK
1168.03 s
[pandoc] #7: OK
1168.04 s
[pandoc] #8: OK
1168.05 s
[pandoc] #9: OK (0.01s)
1168.05 s
[pandoc] #10: OK
1168.06 s
[pandoc] #11: OK
1168.08 s
[pandoc] #12: OK (0.01s)
1168.08 s
[pandoc] 6796.md
1168.09 s
[pandoc] #1: OK
1168.09 s
[pandoc] 4842.md
1168.18 s
[pandoc] #1: OK
1168.18 s
[pandoc] 3752.md
1168.27 s
[pandoc] #1: OK (0.18s)
1168.30 s
[pandoc] #2: OK (0.02s)
1168.31 s
[pandoc] #3: OK (0.02s)
1168.31 s
[pandoc] 3779.md
1168.33 s
[pandoc] #1: OK (0.01s)
1168.33 s
[pandoc] 3407.md
1168.35 s
[pandoc] #1: OK (0.02s)
1168.35 s
[pandoc] #2: OK
1168.35 s
[pandoc] 8201.md
1168.36 s
[pandoc] #1: OK (0.01s)
1168.36 s
[pandoc] 4639.md
1168.38 s
[pandoc] #1: OK (0.01s)
1168.38 s
[pandoc] 6466.md
1168.39 s
[pandoc] #1: OK (0.01s)
1168.39 s
[pandoc] biblatex-almendro.md
1168.42 s
[pandoc] #1: OK (0.03s)
1168.42 s
[pandoc] biblatex-knuth-ct.md
1168.45 s
[pandoc] #1: OK (0.03s)
1168.45 s
[pandoc] 5627.md
1168.47 s
[pandoc] #1: OK (0.02s)
1168.50 s
[pandoc] #2: OK (0.03s)
1168.52 s
[pandoc] #3: OK (0.02s)
1168.52 s
[pandoc] translations.md
1168.53 s
[pandoc] #1: OK (0.01s)
1168.54 s
[pandoc] #2: OK (0.01s)
1168.55 s
[pandoc] #3: OK (0.01s)
1168.56 s
[pandoc] #4: OK (0.01s)
1168.56 s
[pandoc] 6384.md
1168.58 s
[pandoc] #1: OK (0.02s)
1168.58 s
[pandoc] biblatex-thesis.md
1168.62 s
[pandoc] #1: OK (0.03s)
1168.62 s
[pandoc] 1841.md
1168.63 s
[pandoc] #1: OK (0.01s)
1168.65 s
[pandoc] #2: OK (0.01s)
1168.65 s
[pandoc] 5010.md
1168.65 s
[pandoc] #1: OK
1168.66 s
[pandoc] #2: OK
1168.66 s
[pandoc] 5620.md
1168.67 s
[pandoc] #1: OK
1168.67 s
[pandoc] 5053.md
1168.68 s
[pandoc] #1: OK (0.01s)
1168.69 s
[pandoc] #2: OK (0.01s)
1168.69 s
[pandoc] 7208.md
1168.70 s
[pandoc] #1: OK
1168.70 s
[pandoc] 9002.md
1168.72 s
[pandoc] #1: OK (0.02s)
1168.72 s
[pandoc] yaml-with-chomp.md
1168.73 s
[pandoc] #1: OK (0.01s)
1168.73 s
[pandoc] 4061.md
1168.75 s
[pandoc] #1: OK (0.01s)
1168.75 s
[pandoc] 6869.md
1168.76 s
[pandoc] #1: OK (0.01s)
1168.76 s
[pandoc] biblatex-inbook.md
1168.80 s
[pandoc] #1: OK (0.04s)
1168.80 s
[pandoc] 5321.md
1168.81 s
[pandoc] #1: OK
1168.81 s
[pandoc] #2: OK
1168.81 s
[pandoc] macro-defs-in-preamble.md
1168.83 s
[pandoc] #1: OK (0.01s)
1168.83 s
[pandoc] 9517.md
1168.84 s
[pandoc] #1: OK (0.02s)
1168.84 s
[pandoc] 7743.md
1168.86 s
[pandoc] #1: OK (0.02s)
1168.87 s
[pandoc] #2: OK
1168.87 s
[pandoc] #3: OK
1168.88 s
[pandoc] #4: OK
1168.89 s
[pandoc] #5: OK
1168.89 s
[pandoc] #6: OK
1168.97 s
[pandoc] #7: OK (0.07s)
1168.98 s
[pandoc] #8: OK
1168.98 s
[pandoc] 10497.md
1168.99 s
[pandoc] #1: OK (0.01s)
1168.99 s
[pandoc] pandoc-citeproc-327.md
1169.03 s
[pandoc] #1: OK (0.04s)
1169.03 s
[pandoc] 3518.md
1169.04 s
[pandoc] #1: OK (0.02s)
1169.04 s
[pandoc] 7134.md
1169.05 s
[pandoc] #1: OK (0.01s)
1169.05 s
[pandoc] biblatex-laufenberg.md
1169.08 s
[pandoc] #1: OK (0.03s)
1169.08 s
[pandoc] biblatex-maron.md
1169.11 s
[pandoc] #1: OK (0.03s)
1169.11 s
[pandoc] biblatex-inproceedings.md
1169.16 s
[pandoc] #1: OK (0.05s)
1169.16 s
[pandoc] 5635.md
1169.17 s
[pandoc] #1: OK
1169.18 s
[pandoc] #2: OK
1169.18 s
[pandoc] pandoc-citeproc-64.md
1169.28 s
[pandoc] #1: OK (0.10s)
1169.28 s
[pandoc] 6951.md
1169.37 s
[pandoc] #1: OK (0.09s)
1169.37 s
[pandoc] biblatex-nietzsche-ksa1.md
1169.40 s
[pandoc] #1: OK (0.04s)
1169.41 s
[pandoc] figures-jats.md
1169.41 s
[pandoc] #1: OK
1169.42 s
[pandoc] #2: OK
1169.42 s
[pandoc] biblatex-sorace.md
1169.46 s
[pandoc] #1: OK (0.03s)
1169.46 s
[pandoc] biblatex-test-case-conversion.md
1169.50 s
[pandoc] #1: OK (0.04s)
1169.50 s
[pandoc] 4748.md
1169.51 s
[pandoc] #1: OK (0.01s)
1169.51 s
[pandoc] 8511.md
1169.52 s
[pandoc] #1: OK (0.01s)
1169.53 s
[pandoc] #2: OK
1169.53 s
[pandoc] 6699.md
1169.54 s
[pandoc] #1: OK (0.01s)
1169.54 s
[pandoc] 9555.md
1169.55 s
[pandoc] #1: OK (0.01s)
1169.55 s
[pandoc] pandoc-citeproc-361.md
1169.61 s
[pandoc] #1: OK (0.06s)
1169.61 s
[pandoc] 7339.md
1169.62 s
[pandoc] #1: OK (0.01s)
1169.62 s
[pandoc] 8251.md
1169.63 s
[pandoc] #1: OK (0.01s)
1169.64 s
[pandoc] #2: OK
1169.65 s
[pandoc] 6723.md
1169.71 s
[pandoc] #1: OK (0.06s)
1169.71 s
[pandoc] 2874.md
1169.72 s
[pandoc] #1: OK (0.01s)
1169.73 s
[pandoc] #2: OK
1169.73 s
[pandoc] 4667.md
1169.74 s
[pandoc] #1: OK
1169.74 s
[pandoc] 5072.md
1169.74 s
[pandoc] #1: OK
1169.75 s
[pandoc] figures-textile.md
1169.75 s
[pandoc] #1: OK
1169.76 s
[pandoc] #2: OK
1169.76 s
[pandoc] 5543.md
1169.77 s
[pandoc] #1: OK
1169.77 s
[pandoc] 4499.md
1169.79 s
[pandoc] #1: OK (0.01s)
1169.80 s
[pandoc] #2: OK (0.02s)
1169.81 s
[pandoc] #3: OK (0.01s)
1169.82 s
[pandoc] #4: OK
1169.83 s
[pandoc] #5: OK
1169.84 s
[pandoc] #6: OK (0.01s)
1169.85 s
[pandoc] #7: OK (0.01s)
1169.87 s
[pandoc] #8: OK (0.01s)
1169.87 s
[pandoc] #9: OK (0.01s)
1169.88 s
[pandoc] #10: OK
1169.89 s
[pandoc] #11: OK (0.01s)
1169.90 s
[pandoc] #12: OK
1169.90 s
[pandoc] 3816.md
1169.92 s
[pandoc] #1: OK (0.01s)
1169.92 s
[pandoc] 3236.md
1169.93 s
[pandoc] #1: OK (0.01s)
1169.93 s
[pandoc] 4589.md
1169.94 s
[pandoc] #1: OK
1169.94 s
[pandoc] 9193.md
1169.94 s
[pandoc] #1: OK
1169.94 s
[pandoc] 4781.md
1169.95 s
[pandoc] #1: OK
1169.96 s
[pandoc] #2: OK
1169.96 s
[pandoc] 1166.md
1169.98 s
[pandoc] #1: OK (0.02s)
1169.98 s
[pandoc] 4715.md
1169.99 s
[pandoc] #1: OK
1169.99 s
[pandoc] 4594.md
1170.00 s
[pandoc] #1: OK (0.01s)
1170.00 s
[pandoc] pandoc-citeproc-14.md
1170.11 s
[pandoc] #1: OK (0.11s)
1170.11 s
[pandoc] 5107.md
1170.12 s
[pandoc] #1: OK (0.01s)
1170.13 s
[pandoc] #2: OK
1170.13 s
[pandoc] 3840.md
1170.15 s
[pandoc] #1: OK (0.01s)
1170.16 s
[pandoc] #2: OK (0.01s)
1170.16 s
[pandoc] 7006.md
1170.17 s
[pandoc] #1: OK (0.01s)
1170.17 s
[pandoc] 3667.md
1170.18 s
[pandoc] #1: OK
1170.18 s
[pandoc] 4102.md
1170.19 s
[pandoc] #1: OK
1170.19 s
[pandoc] 4062.md
1170.20 s
[pandoc] #1: OK
1170.20 s
[pandoc] short-caption.md
1170.21 s
[pandoc] #1: OK
1170.21 s
[pandoc] figures-org.md
1170.22 s
[pandoc] #1: OK
1170.23 s
[pandoc] #2: OK (0.01s)
1170.23 s
[pandoc] biblatex-murray.md
1170.27 s
[pandoc] #1: OK (0.04s)
1170.27 s
[pandoc] 3773.md
1170.28 s
[pandoc] #1: OK (0.01s)
1170.28 s
[pandoc] figures-context.md
1170.29 s
[pandoc] #1: OK
1170.30 s
[pandoc] #2: OK (0.01s)
1170.30 s
[pandoc] 5574.md
1170.31 s
[pandoc] #1: OK
1170.31 s
[pandoc] 8948.md
1170.33 s
[pandoc] #1: OK (0.02s)
1170.35 s
[pandoc] #2: OK (0.02s)
1170.36 s
[pandoc] #3: OK (0.02s)
1170.36 s
[pandoc] html-writer-a-in-a.md
1170.38 s
[pandoc] #1: OK (0.01s)
1170.38 s
[pandoc] 9777-b.md
1170.39 s
[pandoc] #1: OK
1170.39 s
[pandoc] 6114.md
1170.40 s
[pandoc] #1: OK (0.01s)
1170.40 s
[pandoc] 7919.md
1170.41 s
[pandoc] #1: OK (0.01s)
1170.43 s
[pandoc] #2: OK (0.02s)
1170.44 s
[pandoc] #3: OK (0.01s)
1170.45 s
[pandoc] #4: OK (0.01s)
1170.46 s
[pandoc] #5: OK (0.01s)
1170.48 s
[pandoc] #6: OK (0.02s)
1170.48 s
[pandoc] 6925.md
1170.49 s
[pandoc] #1: OK (0.01s)
1170.49 s
[pandoc] pandoc-citeproc-65.md
1170.53 s
[pandoc] #1: OK (0.04s)
1170.53 s
[pandoc] 6541.md
1170.55 s
[pandoc] #1: OK (0.01s)
1170.55 s
[pandoc] 3533-rst-csv-tables.md
1170.57 s
[pandoc] #1: OK (0.02s)
1170.59 s
[pandoc] #2: OK (0.02s)
1170.61 s
[pandoc] #3: OK (0.02s)
1170.61 s
[pandoc] 9639.md
1170.61 s
[pandoc] #1: OK
1170.61 s
[pandoc] 3309.md
1170.62 s
[pandoc] #1: OK
1170.63 s
[pandoc] #2: OK (0.01s)
1170.64 s
[pandoc] #3: OK (0.01s)
1170.64 s
[pandoc] 6755.md
1170.65 s
[pandoc] #1: OK
1170.65 s
[pandoc] 4578.md
1170.67 s
[pandoc] #1: OK (0.01s)
1170.67 s
[pandoc] 4183.md
1170.68 s
[pandoc] #1: OK (0.01s)
1170.69 s
[pandoc] #2: OK (0.01s)
1170.70 s
[pandoc] #3: OK (0.01s)
1170.70 s
[pandoc] 7181.md
1170.71 s
[pandoc] #1: OK (0.01s)
1170.71 s
[pandoc] biblatex-gonzalez.md
1170.76 s
[pandoc] #1: OK (0.04s)
1170.76 s
[pandoc] 6133.md
1170.77 s
[pandoc] #1: OK (0.01s)
1170.77 s
[pandoc] biblatex-massa.md
1170.80 s
[pandoc] #1: OK (0.03s)
1170.80 s
[pandoc] 4306.md
1170.81 s
[pandoc] #1: OK (0.01s)
1170.81 s
[pandoc] mdoc-Bl-column.md
1170.83 s
[pandoc] #1: OK (0.01s)
1170.83 s
[pandoc] 5650.md
1170.84 s
[pandoc] #1: OK (0.01s)
1170.86 s
[pandoc] #2: OK (0.02s)
1170.86 s
[pandoc] 7129.md
1170.87 s
[pandoc] #1: OK (0.01s)
1170.87 s
[pandoc] 10659.md
1170.88 s
[pandoc] #1: OK (0.01s)
1170.90 s
[pandoc] #2: OK (0.01s)
1170.91 s
[pandoc] #3: OK (0.01s)
1170.91 s
[pandoc] 8437.md
1170.93 s
[pandoc] #1: OK (0.02s)
1170.95 s
[pandoc] #2: OK (0.02s)
1170.96 s
[pandoc] #3: OK (0.01s)
1170.96 s
[pandoc] 9090.md
1170.98 s
[pandoc] #1: OK
1170.98 s
[pandoc] 6739.md
1171.00 s
[pandoc] #1: OK (0.03s)
1171.01 s
[pandoc] #2: OK (0.01s)
1171.01 s
[pandoc] 8770-document.md
1171.03 s
[pandoc] #1: OK (0.02s)
1171.03 s
[pandoc] 7810.md
1171.04 s
[pandoc] #1: OK (0.01s)
1171.05 s
[pandoc] #2: OK (0.01s)
1171.07 s
[pandoc] #3: OK (0.01s)
1171.07 s
[pandoc] biblatex-vangennep-related.md
1171.09 s
[pandoc] #1: OK (0.03s)
1171.09 s
[pandoc] 4063.md
1171.11 s
[pandoc] #1: OK (0.02s)
1171.11 s
[pandoc] smart.md
1171.12 s
[pandoc] #1: OK (0.01s)
1171.13 s
[pandoc] #2: OK (0.01s)
1171.14 s
[pandoc] #3: OK (0.01s)
1171.16 s
[pandoc] #4: OK (0.01s)
1171.16 s
[pandoc] #5: OK
1171.18 s
[pandoc] #6: OK (0.01s)
1171.18 s
[pandoc] 7858.md
1171.19 s
[pandoc] #1: OK (0.01s)
1171.19 s
[pandoc] 10812.md
1171.20 s
[pandoc] #1: OK (0.01s)
1171.22 s
[pandoc] #2: OK (0.01s)
1171.22 s
[pandoc] 10093.md
1171.23 s
[pandoc] #1: OK (0.02s)
1171.25 s
[pandoc] #2: OK (0.02s)
1171.25 s
[pandoc] 4690.md
1171.26 s
[pandoc] #1: OK (0.01s)
1171.26 s
[pandoc] 5836.md
1171.27 s
[pandoc] #1: OK (0.01s)
1171.29 s
[pandoc] #2: OK (0.01s)
1171.29 s
[pandoc] #3: OK
1171.29 s
[pandoc] biblatex-averroes-bland.md
1171.34 s
[pandoc] #1: OK (0.05s)
1171.34 s
[pandoc] 5740.md
1171.35 s
[pandoc] #1: OK (0.01s)
1171.35 s
[pandoc] 4442.md
1171.37 s
[pandoc] #1: OK (0.02s)
1171.37 s
[pandoc] pandoc-citeproc-320a.md
1171.54 s
[pandoc] #1: OK (0.17s)
1171.54 s
[pandoc] citeproc-7b.md
1171.57 s
[pandoc] #1: OK (0.04s)
1171.57 s
[pandoc] rst-links.md
1171.59 s
[pandoc] #1: OK (0.02s)
1171.61 s
[pandoc] #2: OK (0.01s)
1171.61 s
[pandoc] figures-zimwiki.md
1171.62 s
[pandoc] #1: OK (0.01s)
1171.62 s
[pandoc] alerts.md
1171.63 s
[pandoc] #1: OK
1171.64 s
[pandoc] #2: OK
1171.64 s
[pandoc] #3: OK
1171.66 s
[pandoc] #4: OK (0.01s)
1171.67 s
[pandoc] #5: OK (0.01s)
1171.67 s
[pandoc] 9391.md
1171.70 s
[pandoc] #1: OK (0.03s)
1171.70 s
[pandoc] biblatex-herrmann.md
1171.74 s
[pandoc] #1: OK (0.04s)
1171.74 s
[pandoc] biblatex-book-averroes.md
1171.79 s
[pandoc] #1: OK (0.05s)
1171.79 s
[pandoc] 3531.md
1171.80 s
[pandoc] #1: OK (0.01s)
1171.80 s
[pandoc] 7155.md
1171.81 s
[pandoc] #1: OK (0.01s)
1171.82 s
[pandoc] #2: OK
1171.82 s
[pandoc] pandoc-citeproc-213.md
1171.88 s
[pandoc] #1: OK (0.06s)
1171.88 s
[pandoc] latex-tabular-column-specs.md
1171.89 s
[pandoc] #1: OK (0.01s)
1171.89 s
[pandoc] Old
1171.89 s
[pandoc] markdown
1171.89 s
[pandoc] writer
1172.03 s
[pandoc] basic: OK (0.14s)
1172.08 s
[pandoc] tables: OK (0.04s)
1172.10 s
[pandoc] lhs to normal: OK (0.02s)
1172.11 s
[pandoc] lhs to lhs: OK (0.02s)
1172.23 s
[pandoc] basic: OK (0.11s)
1172.28 s
[pandoc] tables: OK (0.05s)
1172.32 s
[pandoc] planets table: OK (0.04s)
1172.33 s
[pandoc] nordics table: OK (0.02s)
1172.35 s
[pandoc] students table: OK (0.02s)
1172.35 s
[pandoc] reader
1172.52 s
[pandoc] basic: OK (0.17s)
1172.61 s
[pandoc] tables: OK (0.04s)
1172.61 s
[vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
1172.61 s
[pandoc] pipe tables: OK (0.05s)
1172.69 s
[pandoc] more: OK (0.08s)
1172.70 s
[pandoc] lhs: OK (0.01s)
1172.70 s
[pandoc] citations
1172.73 s
[pandoc] citations: OK (0.03s)
1172.73 s
[pandoc] rst
1172.73 s
[pandoc] writer
1172.84 s
[pandoc] basic: OK (0.11s)
1172.88 s
[pandoc] tables: OK (0.03s)
1172.89 s
[pandoc] lhs to normal: OK (0.02s)
1172.91 s
[pandoc] lhs to lhs: OK (0.02s)
1172.91 s
[pandoc] reader
1173.02 s
[pandoc] basic: OK (0.11s)
1173.08 s
[pandoc] tables: OK (0.06s)
1173.10 s
[pandoc] lhs: OK (0.02s)
1173.10 s
[pandoc] latex
1173.10 s
[pandoc] writer
1173.21 s
[pandoc] basic: OK (0.11s)
1173.25 s
[pandoc] tables: OK (0.04s)
1173.30 s
[pandoc] planets table: OK (0.05s)
1173.32 s
[pandoc] nordics table: OK (0.03s)
1173.34 s
[pandoc] students table: OK (0.02s)
1173.36 s
[pandoc] lhs to normal: OK (0.02s)
1173.38 s
[pandoc] lhs to lhs: OK (0.02s)
1173.38 s
[pandoc] reader
1173.48 s
[pandoc] basic: OK (0.10s)
1173.49 s
[pandoc] lhs: OK (0.01s)
1173.49 s
[pandoc] html
1173.49 s
[pandoc] writer
1173.66 s
[pandoc] basic: OK (0.17s)
1173.71 s
[pandoc] tables: OK (0.05s)
1173.76 s
[pandoc] planets table: OK (0.04s)
1173.77 s
[pandoc] nordics table: OK (0.02s)
1173.79 s
[pandoc] students table: OK (0.02s)
1173.99 s
[pandoc] basic: OK (0.20s)
1174.05 s
[pandoc] tables: OK (0.06s)
1174.10 s
[pandoc] planets table: OK (0.05s)
1174.14 s
[pandoc] nordics table: OK (0.05s)
1174.17 s
[pandoc] students table: OK (0.03s)
1174.22 s
[pandoc] lhs to normal: OK (0.05s)
1174.68 s
[pandoc] lhs to lhs: OK (0.46s)
1174.85 s
[pandoc] reader: OK (0.17s)
1174.85 s
[pandoc] s5
1174.89 s
[pandoc] s5 writer (basic): OK (0.04s)
1174.92 s
[pandoc] s5 writer (fancy): OK (0.03s)
1174.95 s
[pandoc] html4 writer (fragment): OK (0.03s)
1174.98 s
[pandoc] html4 writer (inserts): OK (0.04s)
1174.98 s
[pandoc] textile
1174.98 s
[pandoc] writer
1175.10 s
[pandoc] basic: OK (0.12s)
1175.14 s
[pandoc] tables: OK (0.03s)
1175.18 s
[pandoc] reader: OK (0.05s)
1175.18 s
[pandoc] djot
1175.18 s
[pandoc] writer
1175.28 s
[pandoc] basic: OK (0.10s)
1175.32 s
[pandoc] tables: OK (0.04s)
1175.37 s
[pandoc] reader: OK (0.04s)
1175.37 s
[pandoc] docbook
1175.37 s
[pandoc] writer
1175.48 s
[pandoc] basic: OK (0.11s)
1175.52 s
[pandoc] tables: OK (0.04s)
1175.63 s
[pandoc] reader: OK (0.11s)
1175.64 s
[pandoc] reader: OK (0.01s)
1175.66 s
[pandoc] reader: OK (0.02s)
1175.66 s
[pandoc] docbook5
1175.66 s
[pandoc] writer
1175.78 s
[pandoc] basic: OK (0.12s)
1175.83 s
[pandoc] tables: OK (0.05s)
1175.83 s
[pandoc] jats
1175.83 s
[pandoc] writer
1175.83 s
[pandoc] jats_archiving
1175.99 s
[pandoc] basic: OK (0.16s)
1176.04 s
[pandoc] tables: OK (0.05s)
1176.07 s
[pandoc] planets table: OK (0.04s)
1176.09 s
[pandoc] nordics table: OK (0.02s)
1176.12 s
[pandoc] students table: OK (0.03s)
1176.12 s
[pandoc] jats_articleauthoring
1176.25 s
[pandoc] basic: OK (0.13s)
1176.29 s
[pandoc] tables: OK (0.04s)
1176.29 s
[pandoc] jats_publishing
1176.42 s
[pandoc] basic: OK (0.13s)
1176.47 s
[pandoc] tables: OK (0.05s)
1176.59 s
[pandoc] reader: OK (0.13s)
1176.59 s
[pandoc] jira
1176.59 s
[pandoc] writer
1176.71 s
[pandoc] basic: OK (0.11s)
1176.74 s
[pandoc] tables: OK (0.04s)
1176.78 s
[pandoc] reader: OK (0.04s)
1176.78 s
[pandoc] native
1176.78 s
[pandoc] writer
1176.93 s
[pandoc] basic: OK (0.15s)
1176.99 s
[pandoc] tables: OK (0.06s)
1177.00 s
[vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
1177.12 s
[pandoc] reader: OK (0.13s)
1177.12 s
[pandoc] fb2
1177.14 s
[pandoc] basic: OK (0.02s)
1177.15 s
[pandoc] titles: OK
1177.17 s
[pandoc] images: OK (0.02s)
1177.19 s
[pandoc] images-embedded: OK (0.02s)
1177.21 s
[pandoc] math: OK (0.01s)
1177.21 s
[pandoc] meta: OK
1177.26 s
[pandoc] tables: OK (0.05s)
1177.37 s
[pandoc] testsuite: OK (0.11s)
1177.37 s
[pandoc] mediawiki
1177.37 s
[pandoc] writer
1177.46 s
[pandoc] basic: OK (0.09s)
1177.50 s
[pandoc] tables: OK (0.03s)
1177.58 s
[pandoc] basic: OK (0.08s)
1177.62 s
[pandoc] tables: OK (0.04s)
1177.74 s
[pandoc] planets table: OK (0.03s)
1177.74 s
[pandoc] nordics table: OK (0.02s)
1177.74 s
[pandoc] students table: OK (0.01s)
1177.78 s
[pandoc] reader: OK (0.10s)
1177.78 s
[pandoc] vimwiki
1177.91 s
[pandoc] reader: OK (0.12s)
1177.91 s
[pandoc] dokuwiki
1177.91 s
[pandoc] writer
1178.01 s
[pandoc] basic: OK (0.10s)
1178.04 s
[pandoc] tables: OK (0.04s)
1178.06 s
[pandoc] inline_formatting: OK (0.01s)
1178.07 s
[pandoc] multiblock table: OK (0.01s)
1178.08 s
[pandoc] external images: OK (0.01s)
1178.08 s
[pandoc] opml
1178.22 s
[pandoc] basic: OK (0.13s)
1178.25 s
[pandoc] reader: OK (0.03s)
1178.25 s
[pandoc] haddock
1178.25 s
[pandoc] writer
1178.39 s
[pandoc] basic: OK (0.14s)
1178.47 s
[pandoc] tables: OK (0.08s)
1178.51 s
[pandoc] reader: OK (0.04s)
1178.51 s
[pandoc] txt2tags
1178.82 s
[pandoc] reader: OK (0.32s)
1178.82 s
[pandoc] epub
1179.07 s
[pandoc] features: OK (0.24s)
1179.44 s
[pandoc] wasteland: OK (0.38s)
1179.94 s
[pandoc] formatting: OK (0.49s)
1179.94 s
[pandoc] twiki
1180.01 s
[pandoc] reader: OK (0.07s)
1180.01 s
[pandoc] tikiwiki
1180.07 s
[pandoc] reader: OK (0.07s)
1180.07 s
[pandoc] other writers
1180.07 s
[pandoc] opendocument
1180.27 s
[pandoc] basic: OK (0.20s)
1180.32 s
[pandoc] tables: OK (0.05s)
1180.32 s
[pandoc] context
1180.44 s
[pandoc] basic: OK (0.12s)
1180.49 s
[pandoc] tables: OK (0.06s)
1180.49 s
[pandoc] texinfo
1180.63 s
[pandoc] basic: OK (0.13s)
1180.68 s
[pandoc] tables: OK (0.06s)
1180.68 s
[pandoc] icml
1180.90 s
[pandoc] basic: OK (0.22s)
1180.97 s
[pandoc] tables: OK (0.07s)
1180.98 s
[pandoc] tei
1181.12 s
[pandoc] basic: OK (0.14s)
1181.16 s
[pandoc] tables: OK (0.04s)
1181.16 s
[pandoc] man
1181.32 s
[pandoc] basic: OK (0.17s)
1181.37 s
[pandoc] tables: OK (0.05s)
1181.37 s
[pandoc] plain
1181.59 s
[pandoc] basic: OK (0.22s)
1181.68 s
[pandoc] tables: OK (0.09s)
1181.68 s
[pandoc] asciidoc
1181.89 s
[pandoc] basic: OK (0.21s)
1181.95 s
[pandoc] tables: OK (0.06s)
1181.96 s
[pandoc] asciidoc_legacy
1182.15 s
[pandoc] basic: OK (0.20s)
1182.22 s
[pandoc] tables: OK (0.07s)
1182.22 s
[pandoc] xwiki
1182.33 s
[vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
1182.45 s
[pandoc] basic: OK (0.23s)
1182.52 s
[pandoc] tables: OK (0.07s)
1182.52 s
[pandoc] zimwiki
1182.80 s
[pandoc] basic: OK (0.28s)
1182.90 s
[pandoc] tables: OK (0.11s)
1182.94 s
[pandoc] writers-lang-and-dir
1183.01 s
[pandoc] latex: OK (0.11s)
1183.07 s
[pandoc] context: OK (0.06s)
1183.07 s
[pandoc] muse
1183.07 s
[pandoc] writer
1183.36 s
[pandoc] basic: OK (0.28s)
1183.46 s
[pandoc] tables: OK (0.10s)
1183.46 s
[pandoc] ms
1183.76 s
[pandoc] basic: OK (0.30s)
1183.84 s
[pandoc] tables: OK (0.08s)
1183.84 s
[pandoc] typst
1183.84 s
[pandoc] writer
1183.89 s
[vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
1184.09 s
[pandoc] basic: OK (0.24s)
1184.14 s
[pandoc] tables: OK (0.06s)
1184.39 s
[pandoc] basic: OK (0.25s)
1184.49 s
[pandoc] tables: OK (0.10s)
1184.56 s
[pandoc] planets table: OK (0.06s)
1184.59 s
[pandoc] nordics table: OK (0.04s)
1184.62 s
[pandoc] students table: OK (0.03s)
1184.62 s
[pandoc] reader
1185.63 s
[pandoc] typst-reader: OK (1.01s)
1185.63 s
[pandoc] creole
1185.71 s
[pandoc] reader: OK (0.09s)
1185.71 s
[pandoc] man
1185.76 s
[pandoc] reader: OK (0.05s)
1185.76 s
[pandoc] org
1185.80 s
[pandoc] reader: OK (0.04s)
1185.80 s
[pandoc] writer
1186.00 s
[pandoc] basic: OK (0.20s)
1186.06 s
[pandoc] tables: OK (0.06s)
1186.06 s
[pandoc] rtf
1186.06 s
[pandoc] writer
1186.31 s
[pandoc] basic: OK (0.25s)
1186.37 s
[pandoc] tables: OK (0.06s)
1186.37 s
[pandoc] endnotexml
1186.40 s
[pandoc] reader: OK (0.02s)
1186.40 s
[pandoc] ipynb
1186.44 s
[pandoc] reader: OK (0.05s)
1186.48 s
[pandoc] writer: OK (0.04s)
1186.49 s
[pandoc] reader: OK (0.02s)
1186.53 s
[pandoc] writer: OK (0.03s)
1186.57 s
[pandoc] reader: OK (0.04s)
1186.57 s
[pandoc] markua
1186.57 s
[pandoc] writer
1186.73 s
[pandoc] basic: OK (0.16s)
1186.79 s
[pandoc] tables: OK (0.06s)
1186.79 s
[pandoc] ansi
1186.87 s
[pandoc] ansi: OK (0.08s)
1186.87 s
[pandoc] pod
1186.89 s
[pandoc] pod: OK (0.03s)
1186.89 s
[pandoc] Shared
1186.89 s
[pandoc] compactifyDL
1186.89 s
[pandoc] compactifyDL with empty def: OK
1186.89 s
[pandoc] collapseFilePath
1186.89 s
[pandoc] collapse: OK
1186.89 s
[pandoc] collapse: OK
1186.89 s
[pandoc] collapse: OK
1186.89 s
[pandoc] collapse: OK
1186.89 s
[pandoc] collapse: OK
1186.89 s
[pandoc] collapse: OK
1186.89 s
[pandoc] collapse: OK
1186.89 s
[pandoc] collapse: OK
1186.89 s
[pandoc] collapse: OK
1186.89 s
[pandoc] collapse: OK
1186.90 s
[pandoc] collapse: OK
1186.90 s
[pandoc] collapse: OK
1186.90 s
[pandoc] collapse: OK
1186.90 s
[pandoc] collapse: OK
1186.90 s
[pandoc] collapse: OK
1186.90 s
[pandoc] collapse: OK
1186.90 s
[pandoc] collapse: OK
1186.90 s
[pandoc] collapse: OK
1186.90 s
[pandoc] toLegacyTable
1186.90 s
[pandoc] decomposes a table with head: OK
1186.90 s
[pandoc] decomposes a table without head: OK
1186.90 s
[pandoc] decomposes the table from issue 7683: OK
1186.90 s
[pandoc] table of contents
1186.90 s
[pandoc] empty case: OK
1186.90 s
[pandoc] no headers: OK
1186.90 s
[pandoc] unlinked header: OK
1186.90 s
[pandoc] linked header: OK
1186.90 s
[pandoc] nested headlines: OK
1186.90 s
[pandoc] only referenced headers: OK
1186.90 s
[pandoc] section id used as backup: OK
1186.91 s
[pandoc] makeSections
1187.20 s
[pandoc] makeSections is idempotent: OK (0.30s)
1187.20 s
[pandoc] +++ OK, passed 100 tests.
1187.20 s
[pandoc] makeSections is idempotent for test case: OK
1187.20 s
[pandoc] MediaBag
1187.20 s
[pandoc] test fillMediaBag & extractMedia: OK
1187.21 s
[pandoc] Writers
1187.21 s
[pandoc] Native
1189.53 s
[pandoc] p_write_rt: OK (2.33s)
1189.60 s
[pandoc] +++ OK, passed 100 tests.
1189.88 s
[pandoc] p_write_blocks_rt: OK (0.36s)
1189.88 s
[pandoc] +++ OK, passed 100 tests.
1189.88 s
[pandoc] ConTeXt
1189.88 s
[pandoc] inline code
1189.88 s
[pandoc] with '}': OK
1189.88 s
[pandoc] without '}': OK
1189.88 s
[pandoc] span with ID: OK
1189.89 s
[pandoc] code property: OK
1189.89 s
[pandoc] +++ OK, passed 100 tests.
1189.89 s
[pandoc] headers
1189.89 s
[pandoc] level 1: OK
1189.89 s
[pandoc] Section as top-level: OK
1189.89 s
[pandoc] bullet lists
1189.89 s
[pandoc] nested: OK
1189.89 s
[pandoc] natural tables
1189.89 s
[pandoc] table with header and caption: OK
1189.89 s
[pandoc] LaTeX
1189.89 s
[pandoc] code blocks
1189.89 s
[pandoc] in footnotes: OK
1189.89 s
[pandoc] identifier: OK
1189.89 s
[pandoc] no identifier: OK
1189.89 s
[pandoc] definition lists
1189.89 s
[pandoc] with internal link: OK
1189.89 s
[pandoc] math
1189.89 s
[pandoc] escape |: OK
1189.89 s
[pandoc] headers
1189.89 s
[pandoc] unnumbered header: OK
1189.89 s
[pandoc] in list item: OK
1189.89 s
[pandoc] in definition list item: OK
1189.89 s
[pandoc] containing image: OK
1189.89 s
[pandoc] inline code
1189.89 s
[pandoc] struck out and highlighted: OK
1189.89 s
[pandoc] struck out and not highlighted: OK
1189.89 s
[pandoc] single quotes: OK
1189.89 s
[pandoc] backtick: OK
1189.89 s
[pandoc] inline note
1189.89 s
[pandoc] Big note in emph: OK
1189.89 s
[pandoc] Big note in strong: OK
1189.89 s
[pandoc] Big note in underline: OK
1189.89 s
[pandoc] Big note in strikeout: OK
1189.89 s
[pandoc] Small note in emph: OK
1189.89 s
[pandoc] Big note nested in emph and strong: OK
1189.89 s
[pandoc] Two Big notes in emph: OK
1189.89 s
[pandoc] writer options
1189.89 s
[pandoc] top-level division
1189.89 s
[pandoc] sections as top-level: OK
1189.89 s
[pandoc] chapters as top-level: OK
1189.89 s
[pandoc] parts as top-level: OK
1189.89 s
[pandoc] default top-level: OK
1189.89 s
[pandoc] sections as top-level in beamer: OK
1189.89 s
[pandoc] chapters are as part in beamer: OK
1189.89 s
[pandoc] parts as top-level in beamer: OK
1189.90 s
[pandoc] default top-level in beamer: OK
1189.92 s
[pandoc] part top-level, section not in toc: OK
1189.92 s
[pandoc] HTML
1189.93 s
[pandoc] inline code
1190.06 s
[pandoc] basic: OK
1190.06 s
[pandoc] haskell: OK
1190.41 s
[pandoc] nolanguage: OK (0.51s)
1190.41 s
[pandoc] images
1190.41 s
[pandoc] alt with formatting: OK
1190.41 s
[pandoc] blocks
1190.41 s
[pandoc] definition list with empty <dt>: OK
1190.41 s
[pandoc] heading with disallowed attributes: OK
1190.41 s
[pandoc] quotes
1190.41 s
[pandoc] quote with cite attribute (without q-tags): OK
1190.41 s
[pandoc] quote with cite attribute (with q-tags): OK
1190.41 s
[pandoc] code
1190.41 s
[pandoc] code should be rendered correctly: OK
1190.41 s
[pandoc] sample
1190.41 s
[pandoc] sample should be rendered correctly: OK
1190.41 s
[pandoc] variable
1190.41 s
[pandoc] variable should be rendered correctly: OK
1190.41 s
[pandoc] sample with style
1190.41 s
[pandoc] samp should wrap highlighted code: OK
1190.41 s
[pandoc] variable with style
1190.41 s
[pandoc] var should wrap highlighted code: OK
1190.41 s
[pandoc] footnotes
1190.41 s
[pandoc] at the end of a document: OK
1190.41 s
[pandoc] at the end of a block: OK
1190.41 s
[pandoc] at the end of a section: OK
1190.41 s
[pandoc] at the end of a section, with section divs: OK
1190.41 s
[pandoc] JATS
1190.41 s
[pandoc] inline code
1190.41 s
[pandoc] basic: OK
1190.41 s
[pandoc] block code
1190.41 s
[pandoc] basic: OK
1190.41 s
[pandoc] lang: OK
1190.41 s
[pandoc] images
1190.41 s
[pandoc] basic: OK
1190.41 s
[pandoc] inlines
1190.41 s
[pandoc] Emphasis: OK
1190.41 s
[pandoc] footnote in articleauthoring tag set: OK
1190.41 s
[pandoc] bullet list
1190.41 s
[pandoc] plain items: OK
1190.42 s
[pandoc] item with implicit figure: OK
1190.42 s
[pandoc] definition lists
1190.42 s
[pandoc] with internal link: OK
1190.42 s
[pandoc] math
1190.42 s
[pandoc] escape |: OK
1190.42 s
[pandoc] headers
1190.42 s
[pandoc] unnumbered header: OK
1190.42 s
[pandoc] unnumbered sub header: OK
1190.42 s
[pandoc] containing image: OK
1190.42 s
[pandoc] ids
1190.42 s
[pandoc] non-ASCII in header ID: OK
1190.42 s
[pandoc] disallowed symbol in header id: OK
1190.42 s
[pandoc] disallowed symbols in internal link target: OK
1190.42 s
[pandoc] code id starting with a number: OK
1190.42 s
[pandoc] spans
1190.42 s
[pandoc] unwrapped if no attributes given: OK
1190.42 s
[pandoc] converted to named-content element if class given: OK
1190.42 s
[pandoc] unwrapped if styled-content element would have no at...: OK
1190.42 s
[pandoc] use content-type attribute if present: OK
1190.42 s
[pandoc] Jira
1190.42 s
[pandoc] inlines
1190.42 s
[pandoc] underlined text: OK
1190.42 s
[pandoc] image with attributes: OK
1190.42 s
[pandoc] links
1190.42 s
[pandoc] external link: OK
1190.42 s
[pandoc] external link without description: OK
1190.42 s
[pandoc] email link: OK
1190.42 s
[pandoc] email link without description: OK
1190.42 s
[pandoc] attachment link: OK
1190.42 s
[pandoc] attachment link without description: OK
1190.42 s
[pandoc] user link: OK
1190.42 s
[pandoc] user link with user as description: OK
1190.42 s
[pandoc] 'smart' link: OK
1190.42 s
[pandoc] 'smart' card: OK
1190.42 s
[pandoc] spans
1190.42 s
[pandoc] id is used as anchor: OK
1190.42 s
[pandoc] use `color` attribute: OK
1190.42 s
[pandoc] code
1190.42 s
[pandoc] code block with known language: OK
1190.42 s
[pandoc] code block without language: OK
1190.42 s
[pandoc] blocks
1190.42 s
[pandoc] div
1190.42 s
[pandoc] empty attributes: OK
1190.42 s
[pandoc] just identifier: OK
1190.42 s
[pandoc] with class 'panel': OK
1190.42 s
[pandoc] panel with id: OK
1190.42 s
[pandoc] title attribute: OK
1190.42 s
[pandoc] nested panels: OK
1190.42 s
[pandoc] Docbook
1190.42 s
[pandoc] inline elements
1190.42 s
[pandoc] links
1190.42 s
[pandoc] db4 external link: OK
1190.42 s
[pandoc] db5 external link: OK
1190.42 s
[pandoc] anchor: OK
1190.42 s
[pandoc] automatic anchor: OK
1190.42 s
[pandoc] line blocks
1190.42 s
[pandoc] none: OK
1190.42 s
[pandoc] basic: OK
1190.42 s
[pandoc] blockquote: OK
1190.42 s
[pandoc] footnote: OK
1190.42 s
[pandoc] divs
1190.42 s
[pandoc] admonition: OK
1190.42 s
[pandoc] admonition-with-title: OK
1190.43 s
[pandoc] admonition-with-title-in-para: OK
1190.43 s
[pandoc] single-child: OK
1190.43 s
[pandoc] single-literal-child: OK
1190.43 s
[pandoc] multiple-children: OK
1190.43 s
[pandoc] compact lists
1190.43 s
[pandoc] bullet
1190.43 s
[pandoc] compact: OK
1190.43 s
[pandoc] loose: OK
1190.43 s
[pandoc] ordered
1190.43 s
[pandoc] compact: OK
1190.43 s
[pandoc] loose: OK
1190.43 s
[pandoc] definition
1190.43 s
[pandoc] compact: OK
1190.43 s
[pandoc] loose: OK
1190.43 s
[pandoc] writer options
1190.43 s
[pandoc] top-level division
1190.43 s
[pandoc] sections as top-level: OK
1190.43 s
[pandoc] chapters as top-level: OK
1190.43 s
[pandoc] parts as top-level: OK
1190.43 s
[pandoc] default top-level: OK
1190.43 s
[pandoc] section attributes
1190.43 s
[pandoc] sections with attributes (db5): OK
1190.43 s
[pandoc] sections with attributes (db4): OK
1190.43 s
[pandoc] Markdown
1190.43 s
[pandoc] indented code after list: OK
1190.43 s
[pandoc] list with tight sublist: OK
1190.43 s
[pandoc] emph/strong with spaces (#10696): OK
1190.43 s
[pandoc] note and reference location
1190.43 s
[pandoc] footnotes at the end of a document: OK
1190.43 s
[pandoc] footnotes at the end of blocks: OK
1190.43 s
[pandoc] footnotes and reference links at the end of blocks: OK
1190.43 s
[pandoc] footnotes at the end of section: OK
1190.43 s
[pandoc] Shortcut reference links
1190.43 s
[pandoc] Simple link (shortcutable): OK
1190.43 s
[pandoc] Followed by another link (unshortcutable): OK
1190.43 s
[pandoc] Followed by space and another link (unshortcutable): OK
1190.43 s
[pandoc] Reference link is used multiple times (unshortcutable): OK
1190.43 s
[pandoc] Reference link is used multiple times (unshortcutable): OK
1190.43 s
[pandoc] Reference link is followed by text in brackets: OK
1190.43 s
[pandoc] Reference link is followed by space and text in brac...: OK
1190.43 s
[pandoc] Reference link is followed by RawInline: OK
1190.44 s
[pandoc] Reference link is followed by space and RawInline: OK
1190.44 s
[pandoc] Reference link is followed by RawInline with space: OK
1190.44 s
[pandoc] Reference link is followed by citation: OK
1190.44 s
[pandoc] Reference link is followed by space and citation: OK
1190.44 s
[pandoc] Org
1190.44 s
[pandoc] links
1190.44 s
[pandoc] simple link: OK
1190.44 s
[pandoc] internal link to anchor: OK
1190.44 s
[pandoc] lists
1190.44 s
[pandoc] bullet task list: OK
1190.44 s
[pandoc] ordered task list: OK
1190.44 s
[pandoc] ordered task list with starting number: OK
1190.44 s
[pandoc] bullet without task_lists: OK
1190.44 s
[pandoc] code blocks
1190.44 s
[pandoc] identifier: OK
1190.44 s
[pandoc] attributes: OK
1190.44 s
[pandoc] Plain
1190.44 s
[pandoc] strongly emphasized text to uppercase: OK
1190.44 s
[pandoc] AsciiDoc
1190.44 s
[pandoc] emphasis
1190.44 s
[pandoc] emph word before: OK
1190.44 s
[pandoc] emph word after: OK
1190.44 s
[pandoc] emph quoted: OK
1190.44 s
[pandoc] strong word before: OK
1190.44 s
[pandoc] strong word after: OK
1190.44 s
[pandoc] strong quoted: OK
1190.44 s
[pandoc] blocks
1190.44 s
[pandoc] code block without line numbers: OK
1190.44 s
[pandoc] code block with line numbers: OK
1190.44 s
[pandoc] sidebar block: OK
1190.44 s
[pandoc] tables
1190.44 s
[pandoc] empty cells: OK
1190.44 s
[pandoc] multiblock cells: OK
1190.44 s
[pandoc] lists
1190.44 s
[pandoc] bullet task list: OK
1190.44 s
[pandoc] Docx
1190.44 s
[pandoc] inlines
1190.69 s
[pandoc] font formatting: OK (0.25s)
1190.78 s
[pandoc] hyperlinks: OK (0.09s)
1190.91 s
[pandoc] inline image: OK (0.13s)
1191.04 s
[pandoc] inline images: OK (0.13s)
1191.18 s
[pandoc] handling unicode input: OK (0.14s)
1191.33 s
[pandoc] inline code: OK (0.15s)
1191.52 s
[pandoc] inline code in subscript and superscript: OK (0.19s)
1191.52 s
[pandoc] blocks
1191.70 s
[pandoc] headers: OK (0.18s)
1191.91 s
[pandoc] nested anchor spans in header: OK (0.20s)
1192.15 s
[pandoc] lists: OK (0.23s)
1192.29 s
[pandoc] lists continuing after interruption: OK (0.14s)
1192.43 s
[pandoc] lists restarting after interruption: OK (0.14s)
1192.66 s
[pandoc] lists with multiple initial list levels: OK (0.23s)
1192.77 s
[pandoc] lists with div bullets: OK (0.11s)
1192.87 s
[pandoc] definition lists: OK (0.10s)
1193.03 s
[pandoc] task lists: OK (0.14s)
1193.17 s
[pandoc] issue 9994: OK (0.14s)
1193.31 s
[pandoc] footnotes and endnotes: OK (0.14s)
1193.41 s
[pandoc] links in footnotes and endnotes: OK (0.09s)
1193.47 s
[pandoc] blockquotes: OK (0.06s)
1193.52 s
[pandoc] tables: OK (0.05s)
1193.60 s
[pandoc] tables without explicit column widths: OK (0.08s)
1193.73 s
[pandoc] tables with lists in cells: OK (0.12s)
1193.88 s
[pandoc] tables with one row: OK (0.15s)
1194.17 s
[pandoc] tables separated with RawBlock: OK (0.28s)
1194.31 s
[pandoc] code block: OK (0.14s)
1194.42 s
[pandoc] raw OOXML blocks: OK (0.11s)
1194.57 s
[pandoc] raw bookmark markers: OK (0.14s)
1194.57 s
[pandoc] track changes
1194.70 s
[pandoc] insertion: OK (0.13s)
1194.82 s
[pandoc] deletion: OK (0.12s)
1194.98 s
[pandoc] move text: OK (0.16s)
1195.16 s
[pandoc] comments: OK (0.19s)
1195.33 s
[pandoc] scrubbed metadata: OK (0.16s)
1195.33 s
[pandoc] custom styles
1195.54 s
[pandoc] custom styles without reference.docx: OK (0.21s)
1195.84 s
[pandoc] custom styles with reference.docx: OK (0.29s)
1196.02 s
[pandoc] suppress custom style for headers and blockquotes: OK (0.18s)
1196.02 s
[pandoc] metadata
1196.17 s
[pandoc] document properties (core, custom): OK (0.15s)
1196.31 s
[pandoc] document properties (short description): OK (0.14s)
1196.31 s
[pandoc] RST
1196.31 s
[pandoc] rubrics
1196.31 s
[pandoc] in list item: OK
1196.31 s
[pandoc] in definition list item: OK
1196.31 s
[pandoc] in block quote: OK
1196.31 s
[pandoc] with id: OK
1196.31 s
[pandoc] with id class: OK
1196.31 s
[pandoc] ligatures
1196.31 s
[pandoc] a list is closed by a comment before a quote: OK
1196.31 s
[pandoc] flatten
1196.31 s
[pandoc] emerges nested styles as expected: OK
1196.31 s
[pandoc] could introduce trailing spaces: OK
1196.31 s
[pandoc] preserves empty parents: OK
1196.31 s
[pandoc] inlines
1196.31 s
[pandoc] are removed when empty: OK
1196.31 s
[pandoc] do not cause the introduction of extra spaces when r...: OK
1196.31 s
[pandoc] spaces are stripped at beginning and end: OK
1196.31 s
[pandoc] single space stripped: OK
1196.31 s
[pandoc] give priority to strong style over emphasis: OK
1196.31 s
[pandoc] links are not elided by outer style: OK
1196.31 s
[pandoc] RST inlines cannot start nor end with spaces: OK
1196.31 s
[pandoc] keeps quotes: OK
1196.31 s
[pandoc] backslash inserted between str and code: OK
1196.31 s
[pandoc] headings
1196.31 s
[pandoc] normal heading: OK
1196.31 s
[pandoc] heading levels: OK
1196.31 s
[pandoc] minimal heading levels: OK
1196.31 s
[pandoc] subtitle: OK
1196.31 s
[pandoc] TEI
1196.31 s
[pandoc] block elements
1196.31 s
[pandoc] para: OK
1196.31 s
[pandoc] inlines
1196.31 s
[pandoc] Emphasis: OK
1196.31 s
[pandoc] SingleQuoted: OK
1196.31 s
[pandoc] DoubleQuoted: OK
1196.31 s
[pandoc] NestedQuoted: OK
1196.31 s
[pandoc] markua
1196.31 s
[pandoc] simple blurb/aside
1196.31 s
[pandoc] blurb: OK
1196.31 s
[pandoc] aside: OK
1196.31 s
[pandoc] multiclass blurb/aside
1196.31 s
[pandoc] blurb: OK
1196.31 s
[pandoc] aside: OK
1196.31 s
[pandoc] Muse
1196.31 s
[pandoc] block elements
1196.31 s
[pandoc] plain: OK
1196.31 s
[pandoc] paragraphs
1196.31 s
[pandoc] single paragraph: OK
1196.31 s
[pandoc] two paragraphs: OK
1196.31 s
[pandoc] line block: OK
1196.31 s
[pandoc] code block: OK
1196.31 s
[pandoc] html raw block: OK
1196.31 s
[pandoc] block quote: OK
1196.31 s
[pandoc] lists
1196.31 s
[pandoc] simple lists
1196.31 s
[pandoc] ordered list: OK
1196.31 s
[pandoc] ordered list with Roman numerals: OK
1196.31 s
[pandoc] bullet list: OK
1196.31 s
[pandoc] definition list: OK
1196.31 s
[pandoc] definition list with multiple descriptions: OK
1196.31 s
[pandoc] definition list with empty term: OK
1196.31 s
[pandoc] definition list terms starting with space: OK
1196.31 s
[pandoc] definition list terms starting with list markers: OK
1196.31 s
[pandoc] sequential lists
1196.31 s
[pandoc] bullet lists: OK
1196.31 s
[pandoc] ordered lists of the same style: OK
1196.32 s
[pandoc] ordered lists with equal styles: OK
1196.32 s
[pandoc] bullet and ordered lists: OK
1196.32 s
[pandoc] different style ordered lists: OK
1196.32 s
[pandoc] nested lists
1196.32 s
[pandoc] nested ordered list: OK
1196.32 s
[pandoc] nested bullet lists: OK
1196.32 s
[pandoc] nested definition lists: OK
1196.32 s
[pandoc] list item starting with list: OK
1196.32 s
[pandoc] List inside block quote: OK
1196.32 s
[pandoc] headings
1196.32 s
[pandoc] normal heading: OK
1196.32 s
[pandoc] heading levels: OK
1196.32 s
[pandoc] heading with ID: OK
1196.32 s
[pandoc] empty heading: OK
1196.32 s
[pandoc] horizontal rule: OK
1196.32 s
[pandoc] escape horizontal rule: OK
1196.32 s
[pandoc] escape long horizontal rule: OK
1196.32 s
[pandoc] don't escape horizontal inside paragraph: OK
1196.32 s
[pandoc] escape nonbreaking space: OK
1196.32 s
[pandoc] escape > in the beginning of line: OK
1196.32 s
[pandoc] escape string with > and space in the beginning of l...: OK
1196.32 s
[pandoc] tables
1196.32 s
[pandoc] table without header: OK
1196.32 s
[pandoc] table with header: OK
1196.32 s
[pandoc] table with header and caption: OK
1196.32 s
[pandoc] table inside bullet list: OK
1196.32 s
[pandoc] table with one column: OK
1196.32 s
[pandoc] div with bullet list: OK
1196.32 s
[pandoc] inline elements
1196.32 s
[pandoc] string
1196.32 s
[pandoc] string: OK
1196.32 s
[pandoc] escape footnote: OK
1196.32 s
[pandoc] escape secondary note: OK
1196.32 s
[pandoc] do not escape brackets: OK
1196.32 s
[pandoc] escape verbatim close tag: OK
1196.32 s
[pandoc] escape link-like text: OK
1196.32 s
[pandoc] escape pipe to avoid accidental tables: OK
1196.32 s
[pandoc] escape hash to avoid accidental anchors: OK
1196.32 s
[pandoc] escape definition list markers: OK
1196.32 s
[pandoc] normalize strings before escaping: OK
1196.32 s
[pandoc] do not escape colon: OK
1196.32 s
[pandoc] escape - to avoid accidental unordered lists: OK
1196.32 s
[pandoc] escape - inside a list to avoid accidental nested un...: OK
1196.32 s
[pandoc] escape strings starting with - inside a list: OK
1196.32 s
[pandoc] escape - inside a note: OK
1196.32 s
[pandoc] escape - after softbreak in note: OK
1196.32 s
[pandoc] escape ; to avoid accidental comments: OK
1196.32 s
[pandoc] escape strings starting with ; and space: OK
1196.32 s
[pandoc] escape ; after softbreak: OK
1196.32 s
[pandoc] escape ; after linebreak: OK
1196.32 s
[pandoc] do not escape ; inside paragraph: OK
1196.32 s
[pandoc] escape newlines: OK
1196.32 s
[pandoc] emphasis
1196.33 s
[pandoc] emphasis: OK
1196.33 s
[pandoc] emphasis inside word: OK
1196.33 s
[pandoc] emphasis before comma: OK
1196.33 s
[pandoc] emphasis before period: OK
1196.33 s
[pandoc] empty emphasis: OK
1196.33 s
[pandoc] empty strong: OK
1196.33 s
[pandoc] empty strong emphasis: OK
1196.33 s
[pandoc] empty emphasized strong: OK
1196.33 s
[pandoc] emphasized empty string: OK
1196.33 s
[pandoc] strong empty string: OK
1196.33 s
[pandoc] strong emphasized empty string: OK
1196.33 s
[pandoc] emphasized strong empty string: OK
1196.33 s
[pandoc] emphasized string with space: OK
1196.33 s
[pandoc] emphasized string ending with space: OK
1196.33 s
[pandoc] emphasized string with tab: OK
1196.33 s
[pandoc] emphasized space between empty strings: OK
1196.33 s
[pandoc] strong: OK
1196.33 s
[pandoc] strong inside word: OK
1196.33 s
[pandoc] strong emphasis: OK
1196.33 s
[pandoc] strong after emphasis: OK
1196.33 s
[pandoc] strong emphasis after emphasis: OK
1196.33 s
[pandoc] strong in the end of emphasis: OK
1196.33 s
[pandoc] switch to lightweight markup after <em> tag: OK
1196.33 s
[pandoc] strikeout: OK
1196.33 s
[pandoc] space at the beginning of emphasis: OK
1196.33 s
[pandoc] space at the end of emphasis: OK
1196.33 s
[pandoc] space at the beginning of strong: OK
1196.33 s
[pandoc] space at the end of strong: OK
1196.33 s
[pandoc] space at the beginning of strong emphasis: OK
1196.33 s
[pandoc] space at the end of strong emphasis: OK
1196.33 s
[pandoc] space at the beginning of emphasiszed strong: OK
1196.33 s
[pandoc] space at the end of emphasized strong: OK
1196.33 s
[pandoc] superscript: OK
1196.33 s
[pandoc] subscript: OK
1196.33 s
[pandoc] smallcaps: OK
1196.33 s
[pandoc] smallcaps near emphasis: OK
1196.33 s
[pandoc] single quoted: OK
1196.33 s
[pandoc] double quoted: OK
1196.33 s
[pandoc] code
1196.33 s
[pandoc] simple: OK
1196.33 s
[pandoc] empty: OK
1196.33 s
[pandoc] space: OK
1196.33 s
[pandoc] space at the beginning: OK
1196.33 s
[pandoc] space at the end: OK
1196.33 s
[pandoc] use tags for =: OK
1196.33 s
[pandoc] escape tag: OK
1196.33 s
[pandoc] normalization with attributes: OK
1196.33 s
[pandoc] code tag: OK
1196.33 s
[pandoc] normalization: OK
1196.33 s
[pandoc] normalization with empty string: OK
1196.33 s
[pandoc] emphasized code: OK
1196.33 s
[pandoc] strong code: OK
1196.33 s
[pandoc] spaces
1196.33 s
[pandoc] space: OK
1196.33 s
[pandoc] soft break: OK
1196.33 s
[pandoc] remove soft break: OK
1196.33 s
[pandoc] line break: OK
1196.33 s
[pandoc] line break at the end: OK
1196.33 s
[pandoc] no newline after line break in header: OK
1196.33 s
[pandoc] no softbreak in header: OK
1196.33 s
[pandoc] math
1196.33 s
[pandoc] inline math: OK
1196.33 s
[pandoc] display math: OK
1196.33 s
[pandoc] multiple letters in inline math: OK
1196.33 s
[pandoc] expand math before normalization: OK
1196.33 s
[pandoc] multiple math expressions inside one inline list: OK
1196.33 s
[pandoc] raw inline: OK
1196.33 s
[pandoc] links
1196.33 s
[pandoc] link with description: OK
1196.33 s
[pandoc] link without description: OK
1196.33 s
[pandoc] link to anchor: OK
1196.34 s
[pandoc] link to image with description: OK
1196.34 s
[pandoc] link to image without description: OK
1196.34 s
[pandoc] escape brackets in links
1196.34 s
[pandoc] link with description: OK
1196.34 s
[pandoc] link without description: OK
1196.34 s
[pandoc] image link with description: OK
1196.34 s
[pandoc] image link without description: OK
1196.34 s
[pandoc] image: OK
1196.34 s
[pandoc] image with width: OK
1196.34 s
[pandoc] left-aligned image with width: OK
1196.34 s
[pandoc] right-aligned image with width: OK
1196.34 s
[pandoc] escape brackets in image title: OK
1196.34 s
[pandoc] note: OK
1196.34 s
[pandoc] note location
1196.34 s
[pandoc] footnotes at the end of document: OK
1196.34 s
[pandoc] footnotes at the end of block: OK
1196.34 s
[pandoc] footnotes at the end of section: OK
1196.34 s
[pandoc] span with class: OK
1196.34 s
[pandoc] span without class: OK
1196.34 s
[pandoc] span with anchor: OK
1196.34 s
[pandoc] empty span with anchor: OK
1196.34 s
[pandoc] empty span without class and anchor: OK
1196.34 s
[pandoc] span with class and anchor: OK
1196.34 s
[pandoc] adjacent spans: OK
1196.34 s
[pandoc] RTL
1196.34 s
[pandoc] RTL span: OK
1196.34 s
[pandoc] LTR span: OK
1196.34 s
[pandoc] RTL span with a class: OK
1196.34 s
[pandoc] LTR span with a class: OK
1196.34 s
[pandoc] Escape <<< and >>>: OK
1196.34 s
[pandoc] combined
1196.34 s
[pandoc] emph word before: OK
1196.34 s
[pandoc] emph word after: OK
1196.34 s
[pandoc] emph quoted: OK
1196.34 s
[pandoc] strong word before: OK
1196.34 s
[pandoc] strong word after: OK
1196.34 s
[pandoc] strong quoted: OK
1196.34 s
[pandoc] FB2
1196.34 s
[pandoc] block elements
1196.34 s
[pandoc] para: OK
1196.34 s
[pandoc] inlines
1196.34 s
[pandoc] Emphasis: OK
1196.34 s
[pandoc] bullet list: OK
1196.34 s
[pandoc] PowerPoint
1196.34 s
[pandoc] Default slide formatting
1196.46 s
[pandoc] Inline formatting: OK (0.12s)
1196.59 s
[pandoc] Slide breaks (default slide-level): OK (0.13s)
1196.71 s
[vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
1196.71 s
[vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
1196.77 s
[pandoc] slide breaks (slide-level set to 1): OK (0.18s)
1197.03 s
[pandoc] lists: OK (0.25s)
1197.37 s
[pandoc] start ordered list at specified num: OK (0.32s)
1197.60 s
[pandoc] List continuation paragraph indentation: OK (0.26s)
1197.86 s
[pandoc] tables: OK (0.26s)
1198.02 s
[pandoc] table of contents: OK (0.16s)
1198.14 s
[pandoc] end notes: OK (0.12s)
1198.45 s
[pandoc] end notes, with table of contents: OK (0.31s)
1198.75 s
[pandoc] images: OK (0.31s)
1198.92 s
[pandoc] two-column layout: OK (0.16s)
1199.13 s
[pandoc] two-column (not comparison): OK (0.22s)
1199.39 s
[pandoc] speaker notes: OK (0.26s)
1200.01 s
[pandoc] speaker notes after a separating block: OK (0.61s)
1200.26 s
[pandoc] speaker notes after a separating header: OK (0.25s)
1200.60 s
[pandoc] speaker notes after metadata: OK (0.34s)
1200.86 s
[pandoc] remove empty slides: OK (0.27s)
1201.16 s
[pandoc] raw ooxml: OK (0.29s)
1201.55 s
[pandoc] metadata, custom properties: OK (0.40s)
1201.83 s
[pandoc] metadata, short description: OK (0.28s)
1202.12 s
[pandoc] inline code and code blocks: OK (0.29s)
1202.40 s
[pandoc] inline code and code blocks, custom formatting: OK (0.28s)
1202.40 s
[pandoc] Using slide level 0, if the first thing on a slide is
1202.57 s
[pandoc] a h1 it's used as the slide title: OK (0.17s)
1202.77 s
[pandoc] a h2 it's used as the slide title: OK (0.19s)
1202.77 s
[pandoc] a heading it's used as the slide title
1203.05 s
[pandoc] (works with a table): OK (0.28s)
1203.26 s
[pandoc] (content with caption layout): OK (0.22s)
1203.26 s
[pandoc] comparison layout
1203.26 s
[pandoc] comparison layout is used...
1203.54 s
[pandoc] when two columns contain text + non-text: OK (0.28s)
1203.85 s
[pandoc] even when only one col contains text + non-text: OK (0.30s)
1203.85 s
[pandoc] extra ... in one column gets overlaid
1204.10 s
[pandoc] text: OK (0.26s)
1204.46 s
[pandoc] image: OK (0.32s)
1204.69 s
[pandoc] is not used if the non-text comes first: OK (0.26s)
1204.69 s
[pandoc] Content with Caption layout is ...
1204.92 s
[pandoc] used for heading, text, image on the same slide: OK (0.23s)
1205.14 s
[pandoc] used for text and an image on the same slide: OK (0.22s)
1205.40 s
[pandoc] not used if the image comes first: OK (0.25s)
1205.40 s
[pandoc] The Blank layout is used if a slide contains only...
1205.67 s
[pandoc] speaker notes: OK (0.27s)
1205.96 s
[pandoc] an empty heading with a body of only NBSPs: OK (0.29s)
1206.18 s
[pandoc] a heading containing only non-breaking spaces: OK (0.22s)
1206.68 s
[pandoc] Incremental lists are supported: OK (0.50s)
1207.16 s
[pandoc] One-off incremental lists are supported: OK (0.48s)
1207.51 s
[pandoc] Background images: OK (0.35s)
1207.51 s
[pandoc] With `--reference-doc` pptx file
1207.93 s
[pandoc] Inline formatting: OK (0.42s)
1208.35 s
[pandoc] Slide breaks (default slide-level): OK (0.43s)
1208.60 s
[pandoc] slide breaks (slide-level set to 1): OK (0.25s)
1208.84 s
[pandoc] lists: OK (0.24s)
1209.13 s
[pandoc] start ordered list at specified num: OK (0.29s)
1209.38 s
[pandoc] List continuation paragraph indentation: OK (0.25s)
1209.52 s
[vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
1209.52 s
[vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
1209.52 s
[vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
1209.52 s
[vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
1209.52 s
[vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
1209.67 s
[pandoc] tables: OK (0.29s)
1209.87 s
[pandoc] table of contents: OK (0.20s)
1210.21 s
[pandoc] end notes: OK (0.32s)
1210.38 s
[pandoc] end notes, with table of contents: OK (0.18s)
1210.52 s
[pandoc] images: OK (0.14s)
1210.52 s
[vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
1210.52 s
[vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
1210.63 s
[pandoc] two-column layout: OK (0.11s)
1210.77 s
[pandoc] two-column (not comparison): OK (0.13s)
1210.91 s
[pandoc] speaker notes: OK (0.14s)
1211.18 s
[pandoc] speaker notes after a separating block: OK (0.28s)
1211.36 s
[pandoc] speaker notes after a separating header: OK (0.17s)
1211.52 s
[pandoc] speaker notes after metadata: OK (0.16s)
1211.67 s
[pandoc] remove empty slides: OK (0.14s)
1211.82 s
[pandoc] raw ooxml: OK (0.16s)
1211.97 s
[pandoc] metadata, custom properties: OK (0.14s)
1212.16 s
[pandoc] metadata, short description: OK (0.19s)
1212.39 s
[pandoc] inline code and code blocks: OK (0.23s)
1212.66 s
[pandoc] inline code and code blocks, custom formatting: OK (0.27s)
1212.66 s
[pandoc] Using slide level 0, if the first thing on a slide is
1212.90 s
[pandoc] a h1 it's used as the slide title: OK (0.24s)
1213.18 s
[pandoc] a h2 it's used as the slide title: OK (0.28s)
1213.18 s
[pandoc] a heading it's used as the slide title
1213.29 s
[pandoc] (works with a table): OK (0.12s)
1213.46 s
[pandoc] (content with caption layout): OK (0.16s)
1213.46 s
[pandoc] comparison layout
1213.46 s
[pandoc] comparison layout is used...
1213.67 s
[pandoc] when two columns contain text + non-text: OK (0.21s)
1213.98 s
[pandoc] even when only one col contains text + non-text: OK (0.31s)
1213.98 s
[pandoc] extra ... in one column gets overlaid
1214.13 s
[pandoc] text: OK (0.15s)
1214.32 s
[pandoc] image: OK (0.19s)
1214.56 s
[pandoc] is not used if the non-text comes first: OK (0.24s)
1214.56 s
[pandoc] Content with Caption layout is ...
1214.77 s
[pandoc] used for heading, text, image on the same slide: OK (0.21s)
1214.98 s
[pandoc] used for text and an image on the same slide: OK (0.21s)
1215.14 s
[pandoc] not used if the image comes first: OK (0.15s)
1215.14 s
[pandoc] The Blank layout is used if a slide contains only...
1215.27 s
[pandoc] speaker notes: OK (0.14s)
1215.38 s
[pandoc] an empty heading with a body of only NBSPs: OK (0.11s)
1215.57 s
[pandoc] a heading containing only non-breaking spaces: OK (0.19s)
1215.96 s
[pandoc] Incremental lists are supported: OK (0.39s)
1216.12 s
[pandoc] One-off incremental lists are supported: OK (0.16s)
1216.38 s
[pandoc] Background images: OK (0.26s)
1216.51 s
[pandoc] Basic footer: OK (0.13s)
1216.71 s
[pandoc] Footer with fixed date, replaced by meta block date: OK (0.20s)
1216.95 s
[pandoc] Footer not shown on title slide: OK (0.24s)
1217.27 s
[pandoc] Footer with slide number starting from 3: OK (0.31s)
1217.74 s
[pandoc] Layouts can be moved around in reference doc: OK (0.47s)
1217.85 s
[pandoc] Layouts can be missing from the reference doc: OK (0.11s)
1217.85 s
[pandoc] Ms
1217.85 s
[pandoc] code blocks
1217.85 s
[pandoc] basic: OK
1217.85 s
[pandoc] escape starting .: OK
1217.85 s
[pandoc] AnnotatedTable
1217.85 s
[pandoc] toTable
1217.85 s
[pandoc] annotates a sample table properly: OK
1218.25 s
[vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
1218.62 s
[pandoc] normalizes like the table builder: OK (0.76s)
1218.62 s
[pandoc] +++ OK, passed 50 tests.
1218.63 s
[pandoc] has valid final cell columns: OK
1218.63 s
[pandoc] +++ OK, passed 50 tests.
1218.64 s
[pandoc] has valid first row column data: OK
1218.64 s
[pandoc] +++ OK, passed 50 tests.
1218.64 s
[pandoc] has valid all row column data: OK
1218.64 s
[pandoc] +++ OK, passed 50 tests.
1218.64 s
[pandoc] has valid cell column data lengths: OK
1218.64 s
[pandoc] +++ OK, passed 50 tests.
1218.64 s
[pandoc] Readers
1218.64 s
[pandoc] LaTeX
1218.64 s
[pandoc] basic
1218.64 s
[pandoc] simple: OK
1218.64 s
[pandoc] space: OK
1218.65 s
[pandoc] emphasized: OK
1218.65 s
[pandoc] headers
1218.65 s
[pandoc] level 1: OK
1218.65 s
[pandoc] level 2: OK
1218.65 s
[pandoc] level 3: OK
1218.65 s
[pandoc] emph: OK
1218.65 s
[pandoc] link: OK
1218.65 s
[pandoc] math
1218.65 s
[pandoc] escaped $: OK
1218.65 s
[pandoc] space and comments
1218.65 s
[pandoc] blank lines + space at beginning: OK
1218.65 s
[pandoc] blank lines + space + comments: OK
1218.65 s
[pandoc] comment in paragraph: OK
1218.65 s
[pandoc] code blocks
1218.65 s
[pandoc] identifier: OK
1218.65 s
[pandoc] no identifier: OK
1218.65 s
[pandoc] tables
1218.65 s
[pandoc] Single cell table: OK
1218.65 s
[pandoc] Multi cell table: OK
1218.65 s
[pandoc] Multi line table: OK
1218.65 s
[pandoc] Empty table: OK
1218.65 s
[pandoc] Table with fixed column width: OK
1218.65 s
[pandoc] Table with empty column separators: OK
1218.66 s
[pandoc] Table with custom column separators: OK
1218.66 s
[pandoc] Table with vertical alignment argument: OK
1218.66 s
[pandoc] Table with multicolumn item: OK
1218.66 s
[pandoc] table with multicolumn item (#6596): OK
1218.66 s
[pandoc] Table with multirow item: OK
1218.67 s
[pandoc] Table with multirow item using full prototype: OK
1218.67 s
[pandoc] Table with nested multirow/multicolumn item: OK
1218.67 s
[pandoc] Table with multicolumn header: OK
1218.67 s
[pandoc] Table with normal empty cells: OK
1218.67 s
[pandoc] citations
1218.67 s
[pandoc] natbib
1218.67 s
[pandoc] citet: OK
1218.68 s
[pandoc] suffix: OK
1218.68 s
[pandoc] suffix long: OK
1218.68 s
[pandoc] multiple: OK
1218.68 s
[pandoc] group: OK
1218.68 s
[pandoc] suffix and locator: OK
1218.68 s
[pandoc] suffix only: OK
1218.68 s
[pandoc] no author: OK
1218.68 s
[pandoc] markup: OK
1218.68 s
[pandoc] biblatex
1218.68 s
[pandoc] textcite: OK
1218.68 s
[pandoc] suffix: OK
1218.68 s
[pandoc] suffix long: OK
1218.68 s
[pandoc] multiple: OK
1218.68 s
[pandoc] group: OK
1218.69 s
[pandoc] suffix and locator: OK
1218.69 s
[pandoc] suffix only: OK
1218.69 s
[pandoc] no author: OK
1218.69 s
[pandoc] markup: OK
1218.69 s
[pandoc] parencite: OK
1218.69 s
[pandoc] images
1218.69 s
[pandoc] Basic image: OK
1218.69 s
[pandoc] Basic image with blank options: OK
1218.69 s
[pandoc] Image with both width and height: OK
1218.69 s
[pandoc] Image with width and height and a bunch of other opt...: OK
1218.69 s
[pandoc] Image with just width: OK
1218.69 s
[pandoc] Image with just height: OK
1218.69 s
[pandoc] Image width relative to textsize: OK
1218.69 s
[pandoc] Image with options with spaces: OK
1218.69 s
[pandoc] Character Escapes
1218.69 s
[pandoc] Two-character escapes: OK
1218.69 s
[pandoc] One-character escapes: OK
1218.69 s
[pandoc] memoir scene breaks
1218.69 s
[pandoc] plainbreak: OK
1218.69 s
[pandoc] plainbreak*: OK
1218.69 s
[pandoc] fancybreak: OK
1218.69 s
[pandoc] fancybreak*: OK
1218.69 s
[pandoc] plainfancybreak: OK
1218.69 s
[pandoc] plainfancybreak*: OK
1218.69 s
[pandoc] pfbreak: OK
1218.69 s
[pandoc] pfbreak*: OK
1218.69 s
[pandoc] biblatex roman numerals
1218.69 s
[pandoc] upper: OK
1218.69 s
[pandoc] lower: OK
1218.69 s
[pandoc] leading zero: OK
1218.70 s
[pandoc] surrounding spaces: OK
1218.70 s
[pandoc] zero: OK
1218.70 s
[pandoc] space then unbraced argument: OK
1218.70 s
[pandoc] space before braced argument: OK
1218.70 s
[pandoc] polyglossia language spans
1218.70 s
[pandoc] french: OK
1218.70 s
[pandoc] nested: OK
1218.70 s
[pandoc] with formatting: OK
1218.70 s
[pandoc] language options: OK
1218.70 s
[pandoc] unknown option fallback: OK
1218.70 s
[pandoc] Markdown
1218.70 s
[pandoc] inline code
1218.70 s
[pandoc] with attribute: OK
1218.70 s
[pandoc] with attribute space: OK
1218.70 s
[pandoc] inline code in lists (regression tests for #6284)
1218.70 s
[pandoc] code with list marker in text in ordered list: OK
1218.70 s
[pandoc] code with list marker at start in ordered list: OK
1218.70 s
[pandoc] code with list marker at start in ordered list: OK
1218.70 s
[pandoc] code with list marker after literal backticks in ord...: OK
1218.70 s
[pandoc] code with list marker after literal backticks in ord...: OK
1218.70 s
[pandoc] code with list marker in text in bullet list: OK
1218.70 s
[pandoc] code with list marker at start in bullet list: OK
1218.70 s
[pandoc] code with list marker at start in bullet list: OK
1218.70 s
[pandoc] code with list marker after literal backticks in bul...: OK
1218.70 s
[pandoc] code with list marker after literal backticks in bul...: OK
1218.70 s
[pandoc] lists with newlines in backticks: OK
1218.70 s
[pandoc] lists with newlines in backticks: OK
1218.70 s
[pandoc] lists with newlines in backticks: OK
1218.70 s
[pandoc] lists with newlines in backticks: OK
1218.71 s
[pandoc] lists with newlines in backticks: OK
1218.71 s
[pandoc] lists with newlines in backticks: OK
1218.71 s
[pandoc] lists with newlines in backticks: OK
1218.71 s
[pandoc] lists with newlines in backticks: OK
1218.71 s
[pandoc] lists with blank lines and indent in backticks: OK
1218.71 s
[pandoc] lists with blank lines and indent in backticks: OK
1218.71 s
[pandoc] lists with blank lines and indent in backticks: OK
1218.71 s
[pandoc] lists with blank lines and indent in backticks: OK
1218.71 s
[pandoc] lists with blank lines and indent in backticks: OK
1218.71 s
[pandoc] lists with blank lines and indent in backticks: OK
1218.71 s
[pandoc] lists with blank lines and indent in backticks: OK
1218.71 s
[pandoc] lists with blank lines and indent in backticks: OK
1218.71 s
[pandoc] emph and strong
1218.71 s
[pandoc] two strongs in emph: OK
1218.71 s
[pandoc] emph and strong emph alternating: OK
1218.71 s
[pandoc] emph with spaced strong: OK
1218.71 s
[pandoc] intraword underscore with opening underscore (#1121): OK
1218.71 s
[pandoc] raw LaTeX
1218.71 s
[pandoc] in URL: OK
1218.71 s
[pandoc] raw HTML
1218.71 s
[pandoc] nesting (issue #1330): OK
1218.71 s
[pandoc] invalid tag (issue #1820: OK
1218.71 s
[pandoc] technically invalid comment: OK
1218.72 s
[pandoc] issue 2469: OK
1218.72 s
[pandoc] raw email addresses
1218.72 s
[pandoc] issue 2940: OK
1218.72 s
[pandoc] emoji
1218.73 s
[pandoc] emoji symbols: OK
1218.96 s
[pandoc] unbalanced brackets: OK (0.25s)
1218.96 s
[pandoc] backslash escapes
1218.96 s
[pandoc] in URL: OK
1218.97 s
[pandoc] in title: OK
1218.97 s
[pandoc] in reference link title: OK
1218.97 s
[pandoc] in reference link URL: OK
1218.97 s
[pandoc] bare URIs
1218.97 s
[pandoc] http://google.com is a search engine.: OK
1218.97 s
[pandoc] <a href="http://foo.bar.baz">http://foo.bar.baz</a>: OK
1218.97 s
[pandoc] Try this query: http://google.com?search=fish&time=h...: OK
1218.97 s
[pandoc] HTTPS://GOOGLE.COM,: OK
1218.97 s
[pandoc] http://el.wikipedia.org/wiki/Τεχνολογία,: OK
1218.97 s
[pandoc] doi:10.1000/182,: OK
1218.97 s
[pandoc] git://github.com/foo/bar.git,: OK
1218.97 s
[pandoc] file:///Users/joe/joe.txt, and: OK
1218.97 s
[pandoc] mailto:someone@somedomain.com.: OK
1218.97 s
[pandoc] Use http: this is not a link!: OK
1218.97 s
[pandoc] (http://google.com).: OK
1218.98 s
[pandoc] http://en.wikipedia.org/wiki/Sprite_(computer_graphi...: OK
1218.98 s
[pandoc] http://en.wikipedia.org/wiki/Sprite_[computer_graphi...: OK
1218.98 s
[pandoc] http://en.wikipedia.org/wiki/Sprite_{computer_graphi...: OK
1218.98 s
[pandoc] http://example.com/Notification_Center-GitHub-201011...: OK
1218.98 s
[pandoc] https://github.com/github/hubot/blob/master/scripts/...: OK
1218.98 s
[pandoc] http://www.rubyonrails.com: OK
1218.98 s
[pandoc] http://www.rubyonrails.com:80: OK
1218.98 s
[pandoc] http://www.rubyonrails.com/~minam: OK
1218.98 s
[pandoc] https://www.rubyonrails.com/~minam: OK
1218.98 s
[pandoc] http://www.rubyonrails.com/~minam/url%20with%20spaces: OK
1218.98 s
[pandoc] http://www.rubyonrails.com/foo.cgi?something=here: OK
1218.98 s
[pandoc] http://www.rubyonrails.com/foo.cgi?something=here&an...: OK
1218.98 s
[pandoc] http://www.rubyonrails.com/contact;new: OK
1218.98 s
[pandoc] http://www.rubyonrails.com/contact;new%20with%20spaces: OK
1218.98 s
[pandoc] http://www.rubyonrails.com/contact;new?with=query&st...: OK
1218.98 s
[pandoc] http://www.rubyonrails.com/~minam/contact;new?with=q...: OK
1218.98 s
[pandoc] http://en.wikipedia.org/wiki/Wikipedia:Today%27s_fea...: OK
1218.98 s
[pandoc] http://www.mail-archive.com/rails@lists.rubyonrails....: OK
1218.99 s
[pandoc] http://www.amazon.com/Testing-Equal-Sign-In-Path/ref...: OK
1218.99 s
[pandoc] http://en.wikipedia.org/wiki/Texas_hold%27em: OK
1218.99 s
[pandoc] https://www.google.com/doku.php?id=gps:resource:scs:...: OK
1218.99 s
[pandoc] http://www.rubyonrails.com: OK
1218.99 s
[pandoc] http://manuals.ruby-on-rails.com/read/chapter.need_a...: OK
1218.99 s
[pandoc] http://foo.example.com/controller/action?parm=value&...: OK
1218.99 s
[pandoc] http://foo.example.com:3000/controller/action: OK
1218.99 s
[pandoc] http://foo.example.com:3000/controller/action+pack: OK
1218.99 s
[pandoc] http://business.timesonline.co.uk/article/0,,9065-24...: OK
1218.99 s
[pandoc] http://www.mail-archive.com/ruby-talk@ruby-lang.org/: OK
1218.99 s
[pandoc] https://example.org/?anchor=lala-: OK
1218.99 s
[pandoc] https://example.org/?anchor=-lala: OK
1218.99 s
[pandoc] autolinks
1218.99 s
[pandoc] with unicode dash following: OK
1218.99 s
[pandoc] a partial URL (#2277): OK
1218.99 s
[pandoc] with some attributes: OK
1218.99 s
[pandoc] with some attributes and spaces: OK
1218.99 s
[pandoc] links
1218.99 s
[pandoc] no autolink inside link: OK
1218.99 s
[pandoc] no inline link inside link: OK
1219.00 s
[pandoc] no bare URI inside link: OK
1219.00 s
[pandoc] Github wiki links
1219.00 s
[pandoc] autolink: OK
1219.00 s
[pandoc] link with title: OK
1219.00 s
[pandoc] bad link with title: OK
1219.00 s
[pandoc] autolink not being a link: OK
1219.00 s
[pandoc] autolink not being a link with a square bracket: OK
1219.01 s
[pandoc] link with inline start should be a link: OK
1219.01 s
[pandoc] Headers
1219.01 s
[pandoc] blank line before header: OK
1219.01 s
[pandoc] bracketed text (#2062): OK
1219.01 s
[pandoc] ATX header without trailing #s: OK
1219.01 s
[pandoc] ATX header without trailing #s: OK
1219.01 s
[pandoc] setext header: OK
1219.01 s
[pandoc] Implicit header references
1219.01 s
[pandoc] ATX header without trailing #s: OK
1219.01 s
[pandoc] ATX header with trailing #s: OK
1219.01 s
[pandoc] setext header: OK
1219.01 s
[pandoc] smart punctuation
1219.01 s
[pandoc] quote before ellipses: OK
1219.01 s
[pandoc] apostrophe before emph: OK
1219.01 s
[pandoc] apostrophe in French: OK
1219.02 s
[pandoc] apostrophe after math: OK
1219.02 s
[pandoc] unclosed double quote: OK
1219.02 s
[pandoc] sub- and superscripts
1219.02 s
[pandoc] normal subscript: OK
1219.02 s
[pandoc] normal superscript: OK
1219.02 s
[pandoc] short subscript delimited by space: OK
1219.02 s
[pandoc] short subscript delimited by newline: OK
1219.02 s
[pandoc] short subscript delimited by EOF: OK
1219.02 s
[pandoc] short subscript delimited by punctuation: OK
1219.02 s
[pandoc] short subscript delimited by emph: OK
1219.02 s
[pandoc] no nesting in short subscripts: OK
1219.02 s
[pandoc] short superscript delimited by space: OK
1219.02 s
[pandoc] short superscript delimited by newline: OK
1219.02 s
[pandoc] short superscript delimited by ExF: OK
1219.02 s
[pandoc] short superscript delimited by punctuation: OK
1219.02 s
[pandoc] short superscript delimited by emph: OK
1219.02 s
[pandoc] no nesting in short superscripts: OK
1219.02 s
[pandoc] footnotes
1219.02 s
[pandoc] indent followed by newline and flush-left text: OK
1219.02 s
[pandoc] indent followed by newline and indented text: OK
1219.02 s
[pandoc] recursive note: OK
1219.02 s
[pandoc] lhs
1219.02 s
[pandoc] inverse bird tracks and html: OK
1219.02 s
[pandoc] definition lists
1219.02 s
[pandoc] no blank space: OK
1219.02 s
[pandoc] blank space before first def: OK
1219.03 s
[pandoc] blank space before second def: OK
1219.03 s
[pandoc] laziness: OK
1219.03 s
[pandoc] no blank space before first of two paragraphs: OK
1219.03 s
[pandoc] first line not indented: OK
1219.03 s
[pandoc] list in definition: OK
1219.03 s
[pandoc] in div: OK
1219.03 s
[pandoc] +compact_definition_lists
1219.03 s
[pandoc] basic compact list: OK
1219.03 s
[pandoc] lists
1219.03 s
[pandoc] issue #1154: OK
1219.03 s
[pandoc] issue #1636: OK
1219.03 s
[pandoc] entities
1219.03 s
[pandoc] character references: OK
1219.03 s
[pandoc] numeric: OK
1219.03 s
[pandoc] in link title: OK
1219.03 s
[pandoc] citations
1219.03 s
[pandoc] simple: OK
1219.03 s
[pandoc] key starts with digit: OK
1219.03 s
[pandoc] footnote/link following citation
1219.03 s
[pandoc] footnote: OK
1219.03 s
[pandoc] normal link: OK
1219.03 s
[pandoc] reference link: OK
1219.03 s
[pandoc] short reference link: OK
1219.03 s
[pandoc] implicit header link: OK
1219.04 s
[pandoc] regular citation: OK
1219.04 s
[pandoc] HTML
1219.04 s
[pandoc] base tag
1219.04 s
[pandoc] simple: OK
1219.04 s
[pandoc] slash at end of base: OK
1219.04 s
[pandoc] slash at beginning of href: OK
1219.04 s
[pandoc] absolute URL: OK
1219.04 s
[pandoc] anchors
1219.04 s
[pandoc] anchor without href: OK
1219.04 s
[pandoc] img
1219.04 s
[pandoc] data-external attribute: OK
1219.04 s
[pandoc] title: OK
1219.04 s
[pandoc] lang
1219.04 s
[pandoc] lang on <html>: OK
1219.04 s
[pandoc] xml:lang on <html>: OK
1219.04 s
[pandoc] main
1219.04 s
[pandoc] <main> contents are parsed: OK
1219.04 s
[pandoc] <main role=X> becomes <div role=X>: OK
1219.04 s
[pandoc] <main> has attributes preserved: OK
1219.04 s
[pandoc] <main> closes <p>: OK
1219.04 s
[pandoc] <main> followed by text: OK
1219.04 s
[pandoc] code
1219.04 s
[pandoc] inline code block: OK
1219.04 s
[pandoc] tt
1219.04 s
[pandoc] inline tt block: OK
1219.04 s
[pandoc] samp
1219.04 s
[pandoc] inline samp block: OK
1219.04 s
[pandoc] var
1219.04 s
[pandoc] inline var block: OK
1219.04 s
[pandoc] header
1219.04 s
[pandoc] <header> is parsed as a div: OK
1219.04 s
[pandoc] code block
1219.04 s
[pandoc] attributes in pre > code element: OK
1219.05 s
[pandoc] attributes in pre take precedence: OK
1220.18 s
[pandoc] Round trip: OK (1.14s)
1220.18 s
[pandoc] +++ OK, passed 25 tests.
1220.18 s
[pandoc] JATS
1220.18 s
[pandoc] inline code
1220.18 s
[pandoc] basic: OK
1220.18 s
[pandoc] block code
1220.18 s
[pandoc] basic: OK
1220.18 s
[pandoc] lang: OK
1220.18 s
[pandoc] images
1220.18 s
[pandoc] basic: OK
1220.18 s
[pandoc] alt-text: OK
1220.18 s
[pandoc] bullet list: OK
1220.18 s
[pandoc] definition lists
1220.18 s
[pandoc] with internal link: OK
1220.18 s
[pandoc] math
1220.18 s
[pandoc] escape |: OK
1220.18 s
[pandoc] tex-math only: OK
1220.18 s
[pandoc] math ml only: OK
1220.19 s
[pandoc] headers
1220.19 s
[pandoc] unnumbered sub header: OK
1220.19 s
[pandoc] containing image: OK
1220.19 s
[pandoc] metadata
1220.19 s
[pandoc] abstract: OK
1220.19 s
[pandoc] Jira
1220.19 s
[pandoc] para
1220.19 s
[pandoc] Simple sentence: OK
1220.19 s
[pandoc] leading blank lines: OK
1220.19 s
[pandoc] header
1220.19 s
[pandoc] header: OK
1220.19 s
[pandoc] list
1220.19 s
[pandoc] simple list: OK
1220.19 s
[pandoc] list with minus as bullets: OK
1220.19 s
[pandoc] ordered list / enumeration: OK
1220.19 s
[pandoc] block quote
1220.19 s
[pandoc] simple block quote: OK
1220.19 s
[pandoc] block quote between paragraphs: OK
1220.19 s
[pandoc] table
1220.19 s
[pandoc] table without header: OK
1220.20 s
[pandoc] table with header: OK
1220.20 s
[pandoc] table with column header: OK
1220.20 s
[pandoc] table after paragraph: OK
1220.20 s
[pandoc] panel
1220.20 s
[pandoc] simple panel: OK
1220.20 s
[pandoc] inlines
1220.20 s
[pandoc] emphasis: OK
1220.20 s
[pandoc] deleted: OK
1220.20 s
[pandoc] monospaced: OK
1220.20 s
[pandoc] sub- and superscript: OK
1220.20 s
[pandoc] citation: OK
1220.20 s
[pandoc] color: OK
1220.20 s
[pandoc] hexcolor: OK
1220.20 s
[pandoc] linebreak: OK
1220.20 s
[pandoc] links
1220.20 s
[pandoc] external: OK
1220.20 s
[pandoc] URL in alias: OK
1220.20 s
[pandoc] email: OK
1220.20 s
[pandoc] email with description: OK
1220.20 s
[pandoc] attachment: OK
1220.20 s
[pandoc] attachment with description: OK
1220.20 s
[pandoc] user: OK
1220.20 s
[pandoc] user with description: OK
1220.20 s
[pandoc] 'smart' link: OK
1220.20 s
[pandoc] 'smart' card: OK
1220.20 s
[pandoc] image: OK
1220.20 s
[pandoc] thumbnail image: OK
1220.20 s
[pandoc] image with attributes: OK
1220.20 s
[pandoc] inserted text: OK
1220.20 s
[pandoc] HTML entity: OK
1220.20 s
[pandoc] non-strikeout dashes: OK
1220.20 s
[pandoc] Org
1220.20 s
[pandoc] Inlines
1220.20 s
[pandoc] Plain String: OK
1220.20 s
[pandoc] Emphasis: OK
1220.21 s
[pandoc] Strong: OK
1220.21 s
[pandoc] Strong Emphasis: OK
1220.21 s
[pandoc] Emphasized Strong preceded by space: OK
1220.21 s
[pandoc] Underline: OK
1220.21 s
[pandoc] Strikeout: OK
1220.21 s
[pandoc] Verbatim: OK
1220.21 s
[pandoc] Code: OK
1220.21 s
[pandoc] Math $..$: OK
1220.21 s
[pandoc] Math $$..$$: OK
1220.21 s
[pandoc] Math \[..\]: OK
1220.21 s
[pandoc] Math \(..\): OK
1220.21 s
[pandoc] Symbol: OK
1220.21 s
[pandoc] Superscript simple expression: OK
1220.21 s
[pandoc] Superscript multi char: OK
1220.21 s
[pandoc] Subscript simple expression: OK
1220.21 s
[pandoc] Subscript multi char: OK
1220.21 s
[pandoc] Linebreak: OK
1220.21 s
[pandoc] Inline note: OK
1220.22 s
[pandoc] By default, markup-chars not occurring on word break...: OK
1220.22 s
[pandoc] No empty markup: OK
1220.22 s
[pandoc] Adherence to Org's rules for markup borders: OK
1220.22 s
[pandoc] Quotes are allowed border chars: OK
1220.22 s
[pandoc] Spaces are forbidden border chars: OK
1220.22 s
[pandoc] Zero width spaces are forbidden border chars: OK
1220.22 s
[pandoc] Markup should work properly after a blank line: OK
1220.22 s
[pandoc] Inline math must stay within three lines: OK
1220.22 s
[pandoc] Single-character math: OK
1220.23 s
[pandoc] Markup may not span more than two lines: OK
1220.23 s
[pandoc] Sub- and superscript expressions: OK
1220.23 s
[pandoc] Verbatim text can contain equal signs (=): OK
1220.23 s
[pandoc] Images
1220.23 s
[pandoc] Image: OK
1220.23 s
[pandoc] Image with explicit file: prefix: OK
1220.23 s
[pandoc] Multiple images within a paragraph: OK
1220.23 s
[pandoc] Image with html attributes: OK
1220.23 s
[pandoc] HTML attributes can have trailing spaces: OK
1220.23 s
[pandoc] Uppercase extension: OK
1220.23 s
[pandoc] Explicit link: OK
1220.23 s
[pandoc] Self-link: OK
1220.23 s
[pandoc] Internal self-link (reference): OK
1220.23 s
[pandoc] Absolute file link: OK
1220.23 s
[pandoc] Link to file in parent directory: OK
1220.24 s
[pandoc] Empty link (for gitit interop): OK
1220.24 s
[pandoc] Image link: OK
1220.24 s
[pandoc] Image link with non-image target: OK
1220.24 s
[pandoc] Link to image: OK
1220.24 s
[pandoc] Plain link: OK
1220.24 s
[pandoc] Angle link: OK
1220.24 s
[pandoc] Absolute file link: OK
1220.24 s
[pandoc] File link: OK
1220.24 s
[pandoc] Anchor: OK
1220.24 s
[pandoc] Inline code block: OK
1220.24 s
[pandoc] Inline code block with arguments: OK
1220.24 s
[pandoc] Inline code block with a blank argument array: OK
1220.24 s
[pandoc] Inline code block with toggle: OK
1220.24 s
[pandoc] Inline LaTeX symbol: OK
1220.24 s
[pandoc] Inline LaTeX command: OK
1220.25 s
[pandoc] Inline LaTeX command with spaces: OK
1220.25 s
[pandoc] Inline math symbols: OK
1220.25 s
[pandoc] Inline LaTeX math command: OK
1220.25 s
[pandoc] Unknown inline LaTeX command: OK
1220.25 s
[pandoc] Export snippet: OK
1220.25 s
[pandoc] MathML symbol in LaTeX-style: OK
1220.25 s
[pandoc] MathML symbol in LaTeX-style, including braces: OK
1220.25 s
[pandoc] MathML copy sign: OK
1220.25 s
[pandoc] MathML symbols, space separated: OK
1220.25 s
[pandoc] Macro: OK
1220.25 s
[pandoc] Macro duplicating its argument: OK
1220.25 s
[pandoc] Macro called with too few arguments: OK
1220.25 s
[pandoc] Macro called with an escaped comma: OK
1220.25 s
[pandoc] Citations
1220.26 s
[pandoc] Org-cite citations
1220.26 s
[pandoc] Citation: OK
1220.26 s
[pandoc] Citation containing text: OK
1220.26 s
[pandoc] Author-in-text citation with locator and suffix: OK
1220.26 s
[pandoc] org-ref citations
1220.26 s
[pandoc] simple citation: OK
1220.26 s
[pandoc] simple citation with underscores: OK
1220.26 s
[pandoc] simple citation succeeded by comma: OK
1220.26 s
[pandoc] simple citation succeeded by dot: OK
1220.26 s
[pandoc] simple citation succeeded by colon: OK
1220.26 s
[pandoc] simple citep citation: OK
1220.26 s
[pandoc] multiple simple citations: OK
1220.26 s
[pandoc] multiple simple citations succeeded by comma: OK
1220.26 s
[pandoc] extended citation: OK
1220.26 s
[pandoc] LaTeX citation: OK
1220.26 s
[pandoc] Footnotes
1220.26 s
[pandoc] Footnote: OK
1220.26 s
[pandoc] Two footnotes: OK
1220.26 s
[pandoc] Emphasized text before footnote: OK
1220.26 s
[pandoc] Footnote that starts with emphasized text: OK
1220.26 s
[pandoc] Footnote followed by header: OK
1220.26 s
[pandoc] Footnote followed by two blank lines: OK
1220.26 s
[pandoc] Smart punctuation
1220.26 s
[pandoc] quote before ellipses: OK
1220.26 s
[pandoc] apostrophe before emph: OK
1220.27 s
[pandoc] apostrophe in French: OK
1220.27 s
[pandoc] Quotes cannot occur at the end of emphasized text: OK
1220.27 s
[pandoc] Dashes are allowed at the borders of emphasis': OK
1220.27 s
[pandoc] Single quotes can be followed by emphasized text: OK
1220.27 s
[pandoc] Double quotes can be followed by emphasized text: OK
1220.27 s
[pandoc] Basic Blocks
1220.27 s
[pandoc] Paragraph: OK
1220.27 s
[pandoc] Paragraph starting with an asterisk: OK
1220.27 s
[pandoc] Paragraph containing asterisk at beginning of line: OK
1220.27 s
[pandoc] Example block: OK
1220.27 s
[pandoc] Example block surrounded by text: OK
1220.27 s
[pandoc] Horizontal Rule: OK
1220.27 s
[pandoc] Not a Horizontal Rule: OK
1220.27 s
[pandoc] Comments
1220.27 s
[pandoc] Comment Block: OK
1220.27 s
[pandoc] Comment line: OK
1220.27 s
[pandoc] Empty comment line: OK
1220.27 s
[pandoc] Blocks and fragments
1220.27 s
[pandoc] HTML block: OK
1220.27 s
[pandoc] Quote block: OK
1220.27 s
[pandoc] Verse block: OK
1220.27 s
[pandoc] Verse block with blank lines: OK
1220.27 s
[pandoc] Verse block with varying indentation: OK
1220.27 s
[pandoc] Raw block LaTeX: OK
1220.27 s
[pandoc] Raw LaTeX line: OK
1220.27 s
[pandoc] Raw Beamer line: OK
1220.27 s
[pandoc] Raw HTML line: OK
1220.28 s
[pandoc] Export block HTML: OK
1220.28 s
[pandoc] LaTeX fragment: OK
1220.28 s
[pandoc] One-line LaTeX fragment: OK
1220.28 s
[pandoc] LaTeX fragment with more arguments: OK
1220.28 s
[pandoc] Convert blank lines in blocks to single newlines: OK
1220.28 s
[pandoc] Accept `attr_html` attributes for generic block: OK
1220.28 s
[pandoc] Headers
1220.28 s
[pandoc] First Level Header: OK
1220.28 s
[pandoc] Third Level Header: OK
1220.28 s
[pandoc] Compact Headers with Paragraph: OK
1220.28 s
[pandoc] Separated Headers with Paragraph: OK
1220.28 s
[pandoc] Headers not preceded by a blank line: OK
1220.28 s
[pandoc] Todo keywords
1220.28 s
[pandoc] Header with known todo keyword: OK
1220.28 s
[pandoc] Header marked as done: OK
1220.28 s
[pandoc] emphasis in first word: OK
1220.28 s
[pandoc] Header with unknown todo keyword: OK
1220.28 s
[pandoc] Custom todo keywords: OK
1220.28 s
[pandoc] Custom todo keywords with multiple done-states: OK
1220.28 s
[pandoc] Tagged headers: OK
1220.28 s
[pandoc] Untagged header containing colons: OK
1220.28 s
[pandoc] Untagged header time followed by colon: OK
1220.28 s
[pandoc] tag followed by text: OK
1220.28 s
[pandoc] Header starting with strokeout text: OK
1220.29 s
[pandoc] Comment Trees: OK
1220.29 s
[pandoc] Nothing but a COMMENT header: OK
1220.29 s
[pandoc] Tree with :noexport:: OK
1220.29 s
[pandoc] Subtree with :noexport:: OK
1220.29 s
[pandoc] Preferences are treated as header attributes: OK
1220.29 s
[pandoc] Headers marked with a unnumbered property get a clas...: OK
1220.29 s
[pandoc] planning information
1220.29 s
[pandoc] Planning info is not included in output: OK
1220.29 s
[pandoc] Properties after planning info are recognized: OK
1220.29 s
[pandoc] Planning info followed by test: OK
1220.29 s
[pandoc] third and forth level headers: OK
1220.29 s
[pandoc] Figures
1220.29 s
[pandoc] Figure: OK
1220.29 s
[pandoc] Figure with no name: OK
1220.29 s
[pandoc] Figure with `fig:` prefix in name: OK
1220.30 s
[pandoc] Figure with HTML attributes: OK
1220.30 s
[pandoc] LaTeX attributes are ignored: OK
1220.30 s
[pandoc] Labelled figure: OK
1220.30 s
[pandoc] Figure with empty caption: OK
1220.30 s
[pandoc] Lists
1220.30 s
[pandoc] Simple Bullet Lists: OK
1220.30 s
[pandoc] Simple Bullet List with Ignored Counter Cookie: OK
1220.30 s
[pandoc] Indented Bullet Lists: OK
1220.30 s
[pandoc] Unindented *: OK
1220.30 s
[pandoc] Multi-line Bullet Lists: OK
1220.30 s
[pandoc] Nested Bullet Lists: OK
1220.30 s
[pandoc] Bullet List with Decreasing Indent: OK
1220.30 s
[pandoc] Header follows Bullet List: OK
1220.30 s
[pandoc] Bullet List Unindented with trailing Header: OK
1220.30 s
[pandoc] Empty bullet points: OK
1220.30 s
[pandoc] Task list: OK
1220.30 s
[pandoc] Task List with Counter Cookies: OK
1220.30 s
[pandoc] Task with alphabetical markers and counter cookie: OK
1220.30 s
[pandoc] Simple Ordered List: OK
1220.31 s
[pandoc] Simple Ordered List with fancy lists extension: OK
1220.31 s
[pandoc] Simple Ordered List with lower alpha marker: OK
1220.31 s
[pandoc] Simple Ordered List with upper and lower alpha markers: OK
1220.31 s
[pandoc] Simple Ordered List with Counter Cookie: OK
1220.31 s
[pandoc] Simple Ordered List with Alphabetical Counter Cookie: OK
1220.31 s
[pandoc] Simple Ordered List with Ignored Counter Cookie: OK
1220.31 s
[pandoc] Simple Ordered List with Parens: OK
1220.31 s
[pandoc] Indented Ordered List: OK
1220.31 s
[pandoc] Empty ordered list item: OK
1220.31 s
[pandoc] Empty ordered list item with fancy lists extension: OK
1220.31 s
[pandoc] Empty ordered list item with counter cookie: OK
1220.31 s
[pandoc] Nested Ordered Lists: OK
1220.31 s
[pandoc] Ordered List in Bullet List: OK
1220.31 s
[pandoc] Bullet List in Ordered List: OK
1220.31 s
[pandoc] Definition List: OK
1220.31 s
[pandoc] Definition list with multi-word term: OK
1220.31 s
[pandoc] Compact definition list: OK
1220.31 s
[pandoc] Definition List With Trailing Header: OK
1220.31 s
[pandoc] Definition lists double-colon markers must be surrou...: OK
1220.31 s
[pandoc] Loose bullet list: OK
1220.32 s
[pandoc] Recognize preceding paragraphs in non-list contexts: OK
1220.32 s
[pandoc] Markup after header and list: OK
1220.32 s
[pandoc] CodeBlocks
1220.32 s
[pandoc] Source block: OK
1220.32 s
[pandoc] Source block with indented code: OK
1220.32 s
[pandoc] Source block with tab-indented code: OK
1220.32 s
[pandoc] Empty source block: OK
1220.32 s
[pandoc] Source block between paragraphs: OK
1220.32 s
[pandoc] Source block with babel arguments: OK
1220.32 s
[pandoc] Source block with results and :exports both: OK
1220.32 s
[pandoc] Source block with results and :exports code: OK
1220.32 s
[pandoc] Source block with results and :exports results: OK
1220.32 s
[pandoc] Source block with results and :exports none: OK
1220.32 s
[pandoc] Source block with toggling header arguments: OK
1220.32 s
[pandoc] Source block with line number switch: OK
1220.32 s
[pandoc] Source block with multi-word parameter values: OK
1220.32 s
[pandoc] Example block: OK
1220.32 s
[pandoc] Code block with caption: OK
1220.32 s
[pandoc] Non-letter chars in source block parameters: OK
1220.32 s
[pandoc] Tables
1220.32 s
[pandoc] Single cell table: OK
1220.32 s
[pandoc] Multi cell table: OK
1220.32 s
[pandoc] Multi line table: OK
1220.32 s
[pandoc] Empty table: OK
1220.33 s
[pandoc] Glider Table: OK
1220.33 s
[pandoc] Table between Paragraphs: OK
1220.33 s
[pandoc] Table with Header: OK
1220.33 s
[pandoc] Table with final hline: OK
1220.33 s
[pandoc] Table in a box: OK
1220.33 s
[pandoc] Table with empty cells: OK
1220.33 s
[pandoc] Table with empty rows: OK
1220.33 s
[pandoc] Table with alignment row: OK
1220.33 s
[pandoc] Pipe within text doesn't start a table: OK
1220.34 s
[pandoc] Missing pipe at end of row: OK
1220.34 s
[pandoc] Table with differing row lengths: OK
1220.34 s
[pandoc] Table with caption: OK
1220.34 s
[pandoc] named table: OK
1220.34 s
[pandoc] Meta Information
1220.34 s
[pandoc] Comments
1220.34 s
[pandoc] Comment: OK
1220.34 s
[pandoc] Hash not followed by space is text: OK
1220.34 s
[pandoc] Comment surrounded by Text: OK
1220.34 s
[pandoc] Export settings
1220.34 s
[pandoc] Title: OK
1220.34 s
[pandoc] Author
1220.34 s
[pandoc] sets 'author' field: OK
1220.34 s
[pandoc] Multiple author lines: OK
1220.34 s
[pandoc] Date: OK
1220.34 s
[pandoc] Description
1220.34 s
[pandoc] Single line: OK
1220.34 s
[pandoc] Multiline: OK
1220.34 s
[pandoc] Subtitle: OK
1220.34 s
[pandoc] Keywords: OK
1220.34 s
[pandoc] Institute: OK
1220.34 s
[pandoc] Document language: OK
1220.34 s
[pandoc] Todo sequences
1220.34 s
[pandoc] not included in document: OK
1220.34 s
[pandoc] can contain multiple pipe characters: OK
1220.34 s
[pandoc] LaTeX
1220.34 s
[pandoc] LATEX_HEADER: OK
1220.34 s
[pandoc] LATEX_HEADER_EXTRA: OK
1220.34 s
[pandoc] LaTeX_CLASS
1220.34 s
[pandoc] stored as documentclass: OK
1220.34 s
[pandoc] last definition takes precedence: OK
1220.34 s
[pandoc] LATEX_CLASS_OPTIONS as classoption: OK
1220.34 s
[pandoc] HTML
1220.34 s
[pandoc] HTML_HEAD values are added to header-includes: OK
1220.34 s
[pandoc] HTML_HEAD_EXTRA behaves like HTML_HEAD: OK
1220.34 s
[pandoc] Non-export keywords
1220.34 s
[pandoc] #+link
1220.34 s
[pandoc] Link abbreviation: OK
1220.35 s
[pandoc] Link abbreviation, defined after first use: OK
1220.35 s
[pandoc] Link abbreviation, URL encoded arguments: OK
1220.35 s
[pandoc] Link abbreviation, append arguments: OK
1220.35 s
[pandoc] emphasis config
1220.35 s
[pandoc] Changing pre chars for emphasis: OK
1220.35 s
[pandoc] Changing post chars for emphasis: OK
1220.35 s
[pandoc] setting an invalid value restores the default: OK
1220.35 s
[pandoc] Unknown keyword: OK
1220.35 s
[pandoc] Properties drawer: OK
1220.35 s
[pandoc] Logbook drawer: OK
1220.35 s
[pandoc] Drawer surrounded by text: OK
1220.35 s
[pandoc] Drawer markers must be the only text in the line: OK
1220.35 s
[pandoc] Drawers can be arbitrary: OK
1220.35 s
[pandoc] Anchor reference: OK
1220.35 s
[pandoc] Search links are read as emph: OK
1220.35 s
[pandoc] Link to nonexistent anchor: OK
1220.35 s
[pandoc] Directives
1220.35 s
[pandoc] export options
1220.35 s
[pandoc] disable simple sub/superscript syntax: OK
1220.35 s
[pandoc] directly select drawers to be exported: OK
1220.35 s
[pandoc] exclude drawers from being exported: OK
1220.35 s
[pandoc] don't include archive trees: OK
1220.35 s
[pandoc] include complete archive trees: OK
1220.35 s
[pandoc] include archive tree header only: OK
1220.35 s
[pandoc] limit headline depth: OK
1220.36 s
[pandoc] turn all headlines into lists: OK
1220.36 s
[pandoc] preserve linebreaks as hard breaks: OK
1220.36 s
[pandoc] disable author export: OK
1220.36 s
[pandoc] disable creator export: OK
1220.36 s
[pandoc] disable email export: OK
1220.36 s
[pandoc] disable MathML-like entities: OK
1220.36 s
[pandoc] Option f
1220.36 s
[pandoc] disable inline footnotes: OK
1220.36 s
[pandoc] disable reference footnotes: OK
1220.36 s
[pandoc] disable inclusion of todo keywords: OK
1220.36 s
[pandoc] remove tags from headlines: OK
1220.36 s
[pandoc] LaTeX
1220.36 s
[pandoc] Include LaTeX fragments
1220.36 s
[pandoc] Inline command: OK
1220.36 s
[pandoc] Alpha: OK
1220.36 s
[pandoc] equation environment: OK
1220.36 s
[pandoc] Ignore LaTeX fragments
1220.36 s
[pandoc] Inline command: OK
1220.36 s
[pandoc] MathML symbol (alpha): OK
1220.36 s
[pandoc] equation environment: OK
1220.36 s
[pandoc] Verbatim LaTeX
1220.36 s
[pandoc] Inline command: OK
1220.36 s
[pandoc] MathML symbol (alpha): OK
1220.36 s
[pandoc] equation environment: OK
1220.36 s
[pandoc] planning information
1220.36 s
[pandoc] include planning info after headlines: OK
1220.36 s
[pandoc] empty planning info is not included: OK
1220.36 s
[pandoc] Option |
1220.37 s
[pandoc] disable export of tables: OK
1220.37 s
[pandoc] unknown options
1220.37 s
[pandoc] unknown options are ignored: OK
1220.37 s
[pandoc] highlighting after unknown option: OK
1220.37 s
[pandoc] unknown option interleaved with known: OK
1220.37 s
[pandoc] Include
1220.37 s
[pandoc] file inclusion: OK
1220.37 s
[pandoc] Included file belongs to item: OK
1220.37 s
[pandoc] Default include preserves level: OK
1220.37 s
[pandoc] Minlevel shifts level leftward: OK
1220.37 s
[pandoc] Minlevel shifts level rightward: OK
1220.37 s
[pandoc] Include file as source code snippet: OK
1220.37 s
[pandoc] Include file as export snippet: OK
1220.37 s
[pandoc] include directive is limited to one line: OK
1220.37 s
[pandoc] RST
1220.37 s
[pandoc] line block with blank line: OK
1220.37 s
[pandoc] field list
1220.38 s
[pandoc] general: OK
1220.38 s
[pandoc] metadata: OK
1220.38 s
[pandoc] with inline markup: OK
1220.38 s
[pandoc] URLs with following punctuation: OK
1220.38 s
[pandoc] Reference names with special characters: OK
1220.38 s
[pandoc] Code directive with class and number-lines: OK
1220.38 s
[pandoc] Code directive with number-lines, no line specified: OK
1220.38 s
[pandoc] literal / line / code blocks
1220.38 s
[pandoc] indented literal block: OK
1220.38 s
[pandoc] line block with 3 lines: OK
1220.38 s
[pandoc] line blocks with blank lines: OK
1220.46 s
[pandoc] quoted literal block using >: OK
1220.46 s
[pandoc] quoted literal block using | (not a line block): OK
1220.46 s
[pandoc] class directive with single paragraph: OK
1220.46 s
[pandoc] class directive with two paragraphs: OK
1220.46 s
[pandoc] class directive around literal block: OK
1220.46 s
[pandoc] interpreted text roles
1220.46 s
[pandoc] literal role prefix: OK
1220.46 s
[pandoc] literal role postfix: OK
1220.46 s
[pandoc] literal text: OK
1220.46 s
[pandoc] code role: OK
1220.46 s
[pandoc] inherited code role: OK
1220.46 s
[pandoc] custom code role with language field: OK
1220.46 s
[pandoc] custom role with class field: OK
1220.46 s
[pandoc] custom role with class field containing multiple whi...: OK
1220.46 s
[pandoc] custom role with inherited class field: OK
1220.46 s
[pandoc] custom role with unspecified parent role: OK
1220.46 s
[pandoc] role with recursive inheritance: OK
1220.46 s
[pandoc] unknown role: OK
1220.46 s
[pandoc] footnotes
1220.46 s
[pandoc] remove space before note: OK
1220.46 s
[pandoc] inlines
1220.46 s
[pandoc] links can contain an URI without being parsed twice ...: OK
1220.46 s
[pandoc] inline markup cannot be nested: OK
1220.46 s
[pandoc] bare URI parsing disabled inside emphasis (#4561): OK
1220.46 s
[pandoc] include newlines: OK
1220.46 s
[pandoc] RTF
1220.48 s
[pandoc] footnote: OK (0.08s)
1220.48 s
[pandoc] accent: OK
1220.48 s
[pandoc] unicode: OK
1220.49 s
[pandoc] image: OK (0.01s)
1220.49 s
[pandoc] link: OK
1220.51 s
[pandoc] heading: OK (0.01s)
1220.51 s
[pandoc] formatting: OK
1220.52 s
[pandoc] list_simple: OK
1220.55 s
[pandoc] list_complex: OK (0.03s)
1220.55 s
[pandoc] bookmark: OK
1220.55 s
[pandoc] table_simple: OK
1220.57 s
[pandoc] table_error_codes: OK (0.01s)
1220.57 s
[pandoc] Docx
1220.57 s
[pandoc] document
1220.57 s
[pandoc] allow different document.xml file as defined in _rel...: OK
1220.57 s
[pandoc] inlines
1220.57 s
[pandoc] font formatting: OK
1220.57 s
[pandoc] font formatting with character styles: OK
1220.57 s
[pandoc] hyperlinks: OK
1220.57 s
[pandoc] hyperlinks in <w:instrText> tag: OK
1220.58 s
[pandoc] nested fields with <w:instrText> tag: OK
1220.58 s
[pandoc] empty fields with <w:instrText> tag: OK
1220.58 s
[pandoc] pageref hyperlinks in <w:instrText> tag: OK
1220.58 s
[pandoc] inline image: OK
1220.58 s
[pandoc] VML image: OK
1220.58 s
[pandoc] VML image as object: OK
1220.58 s
[pandoc] inline image in links: OK
1220.58 s
[pandoc] handling unicode input: OK
1220.58 s
[pandoc] literal tabs: OK
1220.58 s
[pandoc] special punctuation: OK
1220.58 s
[pandoc] normalizing inlines: OK
1220.58 s
[pandoc] normalizing inlines deep inside blocks: OK
1220.58 s
[pandoc] move trailing spaces outside of formatting: OK
1220.58 s
[pandoc] remove trailing spaces from last inline: OK
1220.58 s
[pandoc] inline code (with VerbatimChar style): OK
1220.58 s
[pandoc] inline code in subscript and superscript: OK
1220.59 s
[pandoc] inlines inside of Structured Document Tags: OK
1220.59 s
[pandoc] Structured Document Tags in footnotes: OK
1220.59 s
[pandoc] nested Structured Document Tags: OK
1220.60 s
[pandoc] nested Smart Tags: OK (0.01s)
1220.60 s
[pandoc] remove anchor spans with nothing pointing to them: OK
1220.60 s
[pandoc] collapse overlapping targets (anchor spans): OK
1220.60 s
[pandoc] anchor in header after anchor: OK
1220.61 s
[pandoc] text in shape format: OK
1220.61 s
[pandoc] blocks
1220.61 s
[pandoc] headers: OK
1220.61 s
[pandoc] headers already having auto identifiers: OK
1220.61 s
[pandoc] avoid zero-level headers: OK
1220.61 s
[pandoc] nested anchor spans in header: OK
1220.61 s
[pandoc] single numbered item not made into list: OK
1220.61 s
[pandoc] enumerated headers not made into numbered list: OK
1220.62 s
[pandoc] i18n blocks (headers and blockquotes): OK
1220.62 s
[pandoc] lists: OK
1220.62 s
[pandoc] compact lists: OK
1220.62 s
[pandoc] lists with level overrides: OK
1220.62 s
[pandoc] lists continuing after interruption: OK
1220.62 s
[pandoc] lists restarting after interruption: OK
1220.62 s
[pandoc] sublists reset numbering to 1: OK
1220.62 s
[pandoc] definition lists: OK
1220.62 s
[pandoc] task lists: OK
1220.62 s
[pandoc] custom defined lists in styles: OK
1220.62 s
[pandoc] user deletes bullet after list item (=> part of item...: OK
1220.63 s
[pandoc] user deletes bullet after par (=> new par): OK
1220.63 s
[pandoc] footnotes and endnotes: OK
1220.63 s
[pandoc] links in footnotes and endnotes: OK
1220.63 s
[pandoc] blockquotes (parsing indent as blockquote): OK
1220.63 s
[pandoc] blockquotes (parsing indent relative to the indent o...: OK
1220.63 s
[pandoc] hanging indents: OK
1220.64 s
[pandoc] tables: OK
1220.65 s
[pandoc] tables with lists in cells: OK
1220.66 s
[pandoc] a table with a header which contains rowspans greate...: OK (0.02s)
1220.67 s
[pandoc] tables with one row: OK
1220.67 s
[pandoc] tables with just one row, which is a header: OK
1220.67 s
[pandoc] tables with variable width: OK
1220.67 s
[pandoc] tables with captions which contain a Table field: OK
1220.67 s
[pandoc] tables with captions which don't contain a Table field: OK
1220.67 s
[pandoc] code block: OK
1220.68 s
[pandoc] combine adjacent code blocks: OK
1220.69 s
[pandoc] dropcap paragraphs: OK
1220.69 s
[pandoc] citations
1220.70 s
[pandoc] zotero with -citations: OK
1220.71 s
[pandoc] zotero with +citations: OK (0.02s)
1220.71 s
[pandoc] mendeley with -citations: OK
1220.73 s
[pandoc] mendeley with +citations: OK (0.02s)
1220.73 s
[pandoc] track changes
1220.73 s
[pandoc] insertion (default): OK
1220.73 s
[pandoc] insert insertion (accept): OK
1220.73 s
[pandoc] remove insertion (reject): OK
1220.73 s
[pandoc] deletion (default): OK
1220.73 s
[pandoc] remove deletion (accept): OK
1220.73 s
[pandoc] insert deletion (reject): OK
1220.74 s
[pandoc] keep insertion (all): OK
1220.74 s
[pandoc] keep deletion (all): OK
1220.74 s
[pandoc] move text (accept): OK
1220.74 s
[pandoc] move text (reject): OK
1220.74 s
[pandoc] move text (all): OK
1220.74 s
[pandoc] comments (accept -- no comments): OK
1220.74 s
[pandoc] comments (reject -- comments): OK
1220.74 s
[pandoc] comments (all comments): OK
1220.74 s
[pandoc] paragraph insertion/deletion (accept): OK
1220.74 s
[pandoc] paragraph insertion/deletion (reject): OK
1220.75 s
[pandoc] paragraph insertion/deletion (all): OK
1220.75 s
[pandoc] paragraph insertion/deletion (all): OK
1220.75 s
[pandoc] comment warnings (accept -- no warnings): OK
1220.75 s
[pandoc] comment warnings (reject -- no warnings): OK
1220.75 s
[pandoc] comment warnings (all): OK
1220.75 s
[pandoc] comments (with styles extension): OK
1220.75 s
[pandoc] media
1220.75 s
[pandoc] image extraction: OK
1220.75 s
[pandoc] custom styles
1220.75 s
[pandoc] custom styles (`+styles`) not enabled (default): OK
1220.75 s
[pandoc] custom styles (`+styles`) enabled: OK
1220.75 s
[pandoc] custom styles (`+styles`): Compact style is removed ...: OK
1220.75 s
[pandoc] metadata
1220.75 s
[pandoc] metadata fields: OK
1220.76 s
[pandoc] stop recording metadata with normal text: OK
1220.76 s
[pandoc] ODT
1220.76 s
[pandoc] blockquote2: OK
1220.76 s
[pandoc] bold: OK
1220.76 s
[pandoc] endnote: OK
1220.77 s
[pandoc] externalLink: OK
1220.77 s
[pandoc] footnote: OK
1220.77 s
[pandoc] formula: OK
1220.77 s
[pandoc] headers: OK
1220.77 s
[pandoc] italic: OK
1220.77 s
[pandoc] paragraph: OK
1220.77 s
[pandoc] strikeout: OK
1220.77 s
[pandoc] underlined: OK
1220.77 s
[pandoc] blockquote: OK
1220.78 s
[pandoc] image: OK
1220.78 s
[pandoc] imageIndex: OK
1220.79 s
[pandoc] imageWithCaption: OK
1220.79 s
[pandoc] inlinedCode: OK
1220.79 s
[pandoc] listContinueNumbering: OK
1220.80 s
[pandoc] listContinueNumbering2: OK
1220.80 s
[pandoc] orderedListMixed: OK
1220.80 s
[pandoc] orderedListRoman: OK
1220.81 s
[pandoc] orderedListSimple: OK
1220.81 s
[pandoc] orderedListHeader: OK
1220.81 s
[pandoc] referenceToChapter: OK
1220.82 s
[pandoc] referenceToListItem: OK
1220.82 s
[pandoc] referenceToText: OK
1220.83 s
[pandoc] simpleTable: OK
1220.83 s
[pandoc] simpleTableWithCaption: OK
1220.83 s
[pandoc] tab: OK
1220.83 s
[pandoc] textMixedStyles: OK
1220.84 s
[pandoc] tableWithContents: OK
1220.84 s
[pandoc] unicode: OK
1220.84 s
[pandoc] unorderedList: OK
1220.85 s
[pandoc] unorderedListHeader: OK
1220.85 s
[pandoc] Txt2Tags
1220.85 s
[pandoc] Inlines
1220.85 s
[pandoc] Plain String: OK
1220.85 s
[pandoc] Emphasis: OK
1220.85 s
[pandoc] Strong: OK
1220.85 s
[pandoc] Strong Emphasis: OK
1220.85 s
[pandoc] Strikeout: OK
1220.85 s
[pandoc] Verbatim: OK
1220.85 s
[pandoc] Symbol: OK
1220.85 s
[pandoc] No empty markup: OK
1220.85 s
[pandoc] Inline markup is greedy: OK
1220.85 s
[pandoc] Markup must be greedy: OK
1220.85 s
[pandoc] Inlines must be glued: OK
1220.85 s
[pandoc] Macros: Date: OK
1220.85 s
[pandoc] Macros: Mod Time: OK
1220.85 s
[pandoc] Macros: Infile: OK
1220.85 s
[pandoc] Macros: Outfile: OK
1220.85 s
[pandoc] Autolink: OK
1220.85 s
[pandoc] JPEG Image: OK
1220.85 s
[pandoc] PNG Image: OK
1220.85 s
[pandoc] Link: OK
1220.85 s
[pandoc] Image link: OK
1220.85 s
[pandoc] Invalid link: No trailing space: OK
1220.85 s
[pandoc] Basic Blocks
1220.85 s
[pandoc] Paragraph, lines grouped together: OK
1220.85 s
[pandoc] Paragraph, ignore leading and trailing spaces: OK
1220.86 s
[pandoc] Comment line in paragraph: OK
1220.86 s
[pandoc] Paragraph: OK
1220.86 s
[pandoc] First Level Header: OK
1220.86 s
[pandoc] Third Level Header: OK
1220.86 s
[pandoc] Header with label: OK
1220.86 s
[pandoc] Invalid header, mismatched delimiters: OK
1220.86 s
[pandoc] Invalid header, spaces in label: OK
1220.86 s
[pandoc] Invalid header, invalid label character: OK
1220.86 s
[pandoc] Headers not preceded by a blank line: OK
1220.86 s
[pandoc] Paragraph starting with an equals: OK
1220.86 s
[pandoc] Paragraph containing asterisk at beginning of line: OK
1220.86 s
[pandoc] Horizontal Rule: OK
1220.86 s
[pandoc] Comment Block: OK
1220.86 s
[pandoc] Lists
1220.86 s
[pandoc] Simple Bullet Lists: OK
1220.86 s
[pandoc] Indented Bullet Lists: OK
1220.86 s
[pandoc] Nested Bullet Lists: OK
1220.86 s
[pandoc] Simple Ordered List: OK
1220.86 s
[pandoc] Indented Ordered List: OK
1220.86 s
[pandoc] Nested Ordered Lists: OK
1220.86 s
[pandoc] Ordered List in Bullet List: OK
1220.86 s
[pandoc] Bullet List in Ordered List: OK
1220.87 s
[pandoc] Definition List: OK
1220.87 s
[pandoc] Loose bullet list: OK
1220.87 s
[pandoc] Tables
1220.87 s
[pandoc] Single cell table: OK
1220.87 s
[pandoc] Multi cell table: OK
1220.87 s
[pandoc] Multi line table: OK
1220.87 s
[pandoc] Empty table: OK
1220.87 s
[pandoc] Glider Table: OK
1220.88 s
[pandoc] Table with Header: OK
1220.88 s
[pandoc] Table alignment determined by spacing: OK
1220.88 s
[pandoc] Pipe within text doesn't start a table: OK
1220.88 s
[pandoc] Table with differing row lengths: OK
1220.88 s
[pandoc] Blocks and fragments
1220.88 s
[pandoc] Source block: OK
1220.88 s
[pandoc] tagged block: OK
1220.88 s
[pandoc] Quote block: OK
1220.88 s
[pandoc] EPUB
1220.88 s
[pandoc] EPUB Mediabag
1220.88 s
[pandoc] features bag: OK
1220.91 s
[pandoc] EPUB3 cover bag: OK (0.03s)
1220.92 s
[pandoc] EPUB3 no cover bag: OK
1220.92 s
[pandoc] EPUB2 picture bag: OK
1220.92 s
[pandoc] EPUB2 cover bag: OK
1220.92 s
[pandoc] EPUB2 no cover bag: OK
1220.92 s
[pandoc] Muse
1220.92 s
[pandoc] Inlines
1220.92 s
[pandoc] Plain String: OK
1220.92 s
[pandoc] Muse is not XML: OK
1220.92 s
[pandoc] Emphasis: OK
1220.92 s
[pandoc] Newline in the beginning of emphasis: OK
1220.92 s
[pandoc] Newline in the end of emphasis: OK
1220.92 s
[pandoc] Comma after closing *: OK
1220.92 s
[pandoc] Letter after closing *: OK
1220.93 s
[pandoc] Letter before opening *: OK
1220.93 s
[pandoc] Digit after closing *: OK
1220.93 s
[pandoc] Emphasis tag: OK
1220.93 s
[pandoc] Strong: OK
1220.93 s
[pandoc] Strong tag: OK
1220.93 s
[pandoc] Strong Emphasis: OK
1220.93 s
[pandoc] Strong inside emphasis: OK
1220.93 s
[pandoc] Emphasis inside strong: OK
1220.93 s
[pandoc] Opening asterisk can't be preceded by another one: OK
1220.93 s
[pandoc] Asterisk between words does not terminate emphasis: OK
1220.93 s
[pandoc] Two asterisks between words do not terminate emphasis: OK
1220.93 s
[pandoc] Three asterisks between words do not terminate empha...: OK
1220.93 s
[pandoc] Two asterisks between words do not terminate strong: OK
1220.93 s
[pandoc] Three asterisks between words do not terminate strong: OK
1220.93 s
[pandoc] Three asterisks between words do not terminate stron...: OK
1220.93 s
[pandoc] Six asterisks between words do not terminate strong ...: OK
1220.93 s
[pandoc] Underline: OK
1220.93 s
[pandoc] Superscript tag: OK
1220.93 s
[pandoc] Subscript tag: OK
1220.93 s
[pandoc] Strikeout tag: OK
1220.93 s
[pandoc] Opening inline tags: OK
1220.94 s
[pandoc] Closing inline tags: OK
1220.94 s
[pandoc] Tag soup: OK
1220.94 s
[pandoc] No multiparagraph inline tags: OK
1220.94 s
[pandoc] Linebreak: OK
1220.94 s
[pandoc] Trailing whitespace inside paragraph: OK
1220.94 s
[pandoc] Non-breaking space: OK
1220.94 s
[pandoc] Single ~: OK
1220.94 s
[pandoc] Code markup
1220.94 s
[pandoc] Code: OK
1220.94 s
[pandoc] Not code: OK
1220.94 s
[pandoc] Not code if closing = is detached: OK
1220.94 s
[pandoc] Not code if opening = is detached: OK
1220.94 s
[pandoc] Code if followed by comma: OK
1220.94 s
[pandoc] Not code if followed by digit: OK
1220.94 s
[pandoc] One character code: OK
1220.94 s
[pandoc] Code with equal sign: OK
1220.94 s
[pandoc] Three = characters is not a code: OK
1220.94 s
[pandoc] Multiline code markup: OK
1220.94 s
[pandoc] No multiparagraph code: OK
1220.94 s
[pandoc] Code at the beginning of paragraph but not first col...: OK
1220.94 s
[pandoc] Code tag: OK
1220.94 s
[pandoc] Math tag: OK
1220.94 s
[pandoc] Verbatim tag: OK
1220.94 s
[pandoc] Verbatim inside code: OK
1220.95 s
[pandoc] Verbatim tag after text: OK
1220.95 s
[pandoc] Verbatim tag escapes block level markup: OK
1220.95 s
[pandoc] Class tag: OK
1220.95 s
[pandoc] Class tag without name: OK
1220.95 s
[pandoc] RTL: OK
1220.95 s
[pandoc] LTR: OK
1220.95 s
[pandoc] Nested "</em>" inside em tag: OK
1220.95 s
[pandoc] Links
1220.95 s
[pandoc] Link without description: OK
1220.95 s
[pandoc] Link with description: OK
1220.95 s
[pandoc] Link with empty description: OK
1220.95 s
[pandoc] Image: OK
1220.95 s
[pandoc] Closing bracket is not allowed in image filename: OK
1220.95 s
[pandoc] Image with description: OK
1220.95 s
[pandoc] Image with space in filename: OK
1220.95 s
[pandoc] Image with width: OK
1220.95 s
[pandoc] At least one space is required between image filenam...: OK
1220.95 s
[pandoc] Left-aligned image with width: OK
1220.95 s
[pandoc] Right-aligned image with width: OK
1220.95 s
[pandoc] Image link: OK
1220.95 s
[pandoc] Image link with description: OK
1220.96 s
[pandoc] No implicit links: OK
1220.96 s
[pandoc] Link with empty URL: OK
1220.96 s
[pandoc] No footnotes inside links: OK
1220.96 s
[pandoc] Image inside link: OK
1220.96 s
[pandoc] Link inside image description: OK
1220.96 s
[pandoc] Literal
1220.96 s
[pandoc] Inline literal: OK
1220.96 s
[pandoc] Single inline literal in paragraph: OK
1220.96 s
[pandoc] Blocks
1220.96 s
[pandoc] Block elements end paragraphs: OK
1220.96 s
[pandoc] Horizontal rule
1220.96 s
[pandoc] Less than 4 dashes is not a horizontal rule: OK
1220.96 s
[pandoc] 4 dashes is a horizontal rule: OK
1220.96 s
[pandoc] 5 dashes is a horizontal rule: OK
1220.96 s
[pandoc] 4 dashes with spaces is a horizontal rule: OK
1220.96 s
[pandoc] Page breaks
1220.96 s
[pandoc] Page break: OK
1220.96 s
[pandoc] Page break with trailing space: OK
1220.96 s
[pandoc] Paragraphs
1220.96 s
[pandoc] Simple paragraph: OK
1220.96 s
[pandoc] Indented paragraph: OK
1220.96 s
[pandoc] Indentation in the middle of paragraph: OK
1220.96 s
[pandoc] Quote: OK
1220.96 s
[pandoc] Indentation does not indicate quote inside quote tag: OK
1220.96 s
[pandoc] Multiline quote: OK
1220.96 s
[pandoc] Div
1220.96 s
[pandoc] Div without id: OK
1220.96 s
[pandoc] Div with id: OK
1220.97 s
[pandoc] Biblio: OK
1220.97 s
[pandoc] Play: OK
1220.97 s
[pandoc] Verse: OK
1220.97 s
[pandoc] Verse in list: OK
1220.97 s
[pandoc] Verse line starting with emphasis: OK
1220.97 s
[pandoc] Multiline verse in list: OK
1220.97 s
[pandoc] Paragraph after verse in list: OK
1220.97 s
[pandoc] Empty quote tag: OK
1220.97 s
[pandoc] Quote tag: OK
1220.97 s
[pandoc] Nested quote tag: OK
1220.97 s
[pandoc] Indented quote inside list: OK
1220.97 s
[pandoc] Verse tag: OK
1220.97 s
[pandoc] Verse tag with empty line inside: OK
1220.97 s
[pandoc] Verse tag with verbatim close tag inside: OK
1220.97 s
[pandoc] Example
1220.97 s
[pandoc] Braces on separate lines: OK
1220.97 s
[pandoc] Spaces after opening braces: OK
1220.97 s
[pandoc] One blank line in the beginning: OK
1220.97 s
[pandoc] One blank line in the end: OK
1220.97 s
[pandoc] Indented braces: OK
1220.97 s
[pandoc] Tabs: OK
1220.97 s
[pandoc] One line: OK
1220.97 s
[pandoc] Example tag
1220.97 s
[pandoc] Tags on separate lines: OK
1220.97 s
[pandoc] One line: OK
1220.97 s
[pandoc] One blank line in the beginning: OK
1220.97 s
[pandoc] One blank line in the end: OK
1220.97 s
[pandoc] Example inside list: OK
1220.97 s
[pandoc] Empty example inside list: OK
1220.97 s
[pandoc] Example inside list with empty lines: OK
1220.97 s
[pandoc] Indented example inside list: OK
1220.97 s
[pandoc] Example inside definition list: OK
1220.97 s
[pandoc] Example inside list definition with empty lines: OK
1220.97 s
[pandoc] Example inside note: OK
1220.97 s
[pandoc] Literal blocks
1220.97 s
[pandoc] Literal block: OK
1220.97 s
[pandoc] Center: OK
1220.97 s
[pandoc] Right: OK
1220.97 s
[pandoc] Comments
1220.97 s
[pandoc] Comment tag: OK
1220.98 s
[pandoc] Line comment: OK
1220.98 s
[pandoc] Empty comment: OK
1220.98 s
[pandoc] Text after empty comment: OK
1220.98 s
[pandoc] Not a comment (does not start with a semicolon): OK
1220.98 s
[pandoc] Not a comment (has no space after semicolon): OK
1220.98 s
[pandoc] Not a comment (semicolon not in the first column): OK
1220.98 s
[pandoc] Headers
1220.98 s
[pandoc] Part: OK
1220.98 s
[pandoc] Chapter: OK
1220.98 s
[pandoc] Section: OK
1220.98 s
[pandoc] Subsection: OK
1220.98 s
[pandoc] Subsubsection: OK
1220.98 s
[pandoc] Whitespace is required after *: OK
1220.98 s
[pandoc] No headers in footnotes: OK
1220.98 s
[pandoc] No headers in quotes: OK
1220.98 s
[pandoc] Headers consume anchors: OK
1220.98 s
[pandoc] Headers don't consume anchors separated with a blank...: OK
1220.98 s
[pandoc] Headers terminate paragraph: OK
1220.98 s
[pandoc] Headers terminate lists: OK
1220.98 s
[pandoc] Paragraphs terminate Emacs Muse headers: OK
1220.98 s
[pandoc] Paragraphs don't terminate Text::Amuse headers: OK
1220.98 s
[pandoc] Empty header: OK
1220.98 s
[pandoc] Auto identifiers: OK
1220.98 s
[pandoc] Directives
1220.98 s
[pandoc] Title: OK
1220.98 s
[pandoc] Disable tables: OK
1220.98 s
[pandoc] Multiple directives: OK
1220.98 s
[pandoc] Multiline directive: OK
1220.98 s
[pandoc] Amusewiki's #cover is translated to pandoc's #cover-...: OK
1220.98 s
[pandoc] Anchors
1220.98 s
[pandoc] Anchor: OK
1220.98 s
[pandoc] Anchor cannot start with a number: OK
1220.98 s
[pandoc] Not anchor if starts with a space: OK
1220.98 s
[pandoc] Anchor inside a paragraph: OK
1220.99 s
[pandoc] Anchor with "-": OK
1220.99 s
[pandoc] Footnotes
1220.99 s
[pandoc] Simple footnote: OK
1220.99 s
[pandoc] Simple secondary footnote: OK
1220.99 s
[pandoc] Missing footnote: OK
1220.99 s
[pandoc] Missing secondary note: OK
1220.99 s
[pandoc] Wrong note type: OK
1220.99 s
[pandoc] Recursive footnote: OK
1220.99 s
[pandoc] Nested footnotes: OK
1220.99 s
[pandoc] No zero footnotes: OK
1220.99 s
[pandoc] Footnotes can't start with zero: OK
1220.99 s
[pandoc] Multiparagraph footnotes
1220.99 s
[pandoc] Amusewiki multiparagraph footnotes: OK
1220.99 s
[pandoc] Note continuation with verse: OK
1220.99 s
[pandoc] Footnote ending in self-terminating element and foll...: OK
1221.00 s
[pandoc] Footnote starting with empty line: OK
1221.00 s
[pandoc] Indentation in footnote starting with empty line: OK
1221.00 s
[pandoc] Emacs multiparagraph footnotes: OK
1221.00 s
[pandoc] Tables
1221.00 s
[pandoc] Two cell table: OK
1221.00 s
[pandoc] Table with multiple words: OK
1221.00 s
[pandoc] Not a table: OK
1221.00 s
[pandoc] Not a table again: OK
1221.00 s
[pandoc] Two line table: OK
1221.00 s
[pandoc] Table with one header: OK
1221.00 s
[pandoc] Table with two headers: OK
1221.01 s
[pandoc] Header and footer reordering: OK
1221.01 s
[pandoc] Table with caption: OK
1221.01 s
[pandoc] Table caption with +: OK
1221.01 s
[pandoc] Caption without table: OK
1221.01 s
[pandoc] Table indented with space: OK
1221.01 s
[pandoc] Empty cells: OK
1221.01 s
[pandoc] Empty cell in the middle: OK
1221.01 s
[pandoc] Grid table: OK
1221.02 s
[pandoc] Grid table inside list: OK
1221.02 s
[pandoc] Grid table with two rows: OK
1221.02 s
[pandoc] Grid table inside grid table: OK
1221.02 s
[pandoc] Grid table with example: OK
1221.02 s
[pandoc] Lists
1221.02 s
[pandoc] Bullet list: OK
1221.02 s
[pandoc] Ordered list: OK
1221.02 s
[pandoc] Ordered list with implicit numbers: OK
1221.02 s
[pandoc] Ordered list with roman numerals: OK
1221.02 s
[pandoc] Bullet list with empty items: OK
1221.02 s
[pandoc] Ordered list with empty items: OK
1221.02 s
[pandoc] Bullet list with last item empty: OK
1221.03 s
[pandoc] Nested lists
1221.03 s
[pandoc] Nested bullet list: OK
1221.03 s
[pandoc] Nested ordered list: OK
1221.03 s
[pandoc] Mixed nested list: OK
1221.03 s
[pandoc] Text::Amuse includes only one space in list marker: OK
1221.03 s
[pandoc] List continuation: OK
1221.03 s
[pandoc] List continuation after nested list: OK
1221.03 s
[pandoc] Blank lines
1221.03 s
[pandoc] Blank lines between list items are not required: OK
1221.03 s
[pandoc] One blank line between list items is allowed: OK
1221.03 s
[pandoc] Two blank lines separate lists: OK
1221.03 s
[pandoc] No blank line after multiline first item: OK
1221.03 s
[pandoc] One blank line after multiline first item: OK
1221.04 s
[pandoc] Two blank lines after multiline first item: OK
1221.04 s
[pandoc] No blank line after list continuation: OK
1221.04 s
[pandoc] One blank line after list continuation: OK
1221.04 s
[pandoc] Two blank lines after list continuation: OK
1221.04 s
[pandoc] No blank line after blockquote: OK
1221.04 s
[pandoc] One blank line after blockquote: OK
1221.04 s
[pandoc] Two blank lines after blockquote: OK
1221.04 s
[pandoc] No blank line after verse: OK
1221.04 s
[pandoc] One blank line after verse: OK
1221.04 s
[pandoc] Two blank lines after verse: OK
1221.04 s
[pandoc] List ending in self-terminating element and followed...: OK
1221.04 s
[pandoc] Not a definition list: OK
1221.04 s
[pandoc] Emacs Muse definition list: OK
1221.04 s
[pandoc] Definition list: OK
1221.04 s
[pandoc] Definition list term cannot include newline: OK
1221.04 s
[pandoc] One-line definition list: OK
1221.05 s
[pandoc] Definition list term may include single colon: OK
1221.05 s
[pandoc] Definition list term with emphasis: OK
1221.05 s
[pandoc] Definition list term with :: inside code: OK
1221.05 s
[pandoc] Multi-line definition lists: OK
1221.05 s
[pandoc] Definition list with verse: OK
1221.05 s
[pandoc] Definition list with table: OK
1221.05 s
[pandoc] Definition list with table inside bullet list: OK
1221.05 s
[pandoc] Multi-line definition lists from Emacs Muse manual: OK
1221.06 s
[pandoc] Multi-line definition lists from Emacs Muse manual w...: OK
1221.06 s
[pandoc] One-line nested definition list: OK
1221.06 s
[pandoc] Nested definition list: OK
1221.06 s
[pandoc] Definition lists with multiple descriptions
1221.06 s
[pandoc] Correctly indented second description: OK
1221.06 s
[pandoc] Incorrectly indented second description: OK
1221.06 s
[pandoc] Two blank lines separate definition lists: OK
1221.06 s
[pandoc] No headers in list continuation: OK
1221.06 s
[pandoc] Bullet list inside a tag: OK
1221.06 s
[pandoc] Ordered list inside a tag: OK
1221.06 s
[pandoc] Do not consume whitespace while looking for end tag: OK
1221.06 s
[pandoc] Unclosed quote tag: OK
1221.06 s
[pandoc] Unclosed quote tag inside list: OK
1221.06 s
[pandoc] No indented closing tags: OK
1221.06 s
[pandoc] Creole
1221.06 s
[pandoc] Basic Text Formatting
1221.06 s
[pandoc] bold, single line, fully delimited: OK
1221.06 s
[pandoc] italics, single line, fully delimited: OK
1221.07 s
[pandoc] bold in italics, fully delimited: OK
1221.07 s
[pandoc] italics in bold, fully delimited: OK
1221.07 s
[pandoc] escape bold marker: OK
1221.07 s
[pandoc] escape italics marker: OK
1221.07 s
[pandoc] inline nowiki, simple: OK
1221.07 s
[pandoc] inline nowiki, curly braces inside: OK
1221.07 s
[pandoc] placeholder: OK
1221.07 s
[pandoc] placeholder escaped: OK
1221.07 s
[pandoc] Headers
1221.07 s
[pandoc] header level 1, no space, no trailing =: OK
1221.07 s
[pandoc] header level 1, leading space, trailing =: OK
1221.07 s
[pandoc] header level 2, no space, no trailing =: OK
1221.07 s
[pandoc] header level 2, leading space, no trailing =: OK
1221.07 s
[pandoc] header level 3, no space, no trailing =: OK
1221.07 s
[pandoc] header level 3, no space, > 3 trailing =: OK
1221.07 s
[pandoc] header level 4, no space, no trailing =: OK
1221.07 s
[pandoc] header level 4, no space, < 4 trailing =: OK
1221.07 s
[pandoc] header level 5, no space, no trailing =: OK
1221.07 s
[pandoc] header level 6, no space, no trailing =: OK
1221.07 s
[pandoc] Paragraphs
1221.07 s
[pandoc] paragraphs: multiple, one line: OK
1221.07 s
[pandoc] Lists
1221.07 s
[pandoc] unordered list, two entries, one separating space: OK
1221.07 s
[pandoc] unordered list, three entries, one separating space: OK
1221.07 s
[pandoc] para followed by, unordered list, two entries, one s...: OK
1221.07 s
[pandoc] nested unordered list, one separating space: OK
1221.07 s
[pandoc] nested many unordered lists, one separating space: OK
1221.08 s
[pandoc] nested unordered list, mixed separating space: OK
1221.08 s
[pandoc] nested unordered list, one separating space, trailin...: OK
1221.08 s
[pandoc] ordered list, two entries, one separating space: OK
1221.08 s
[pandoc] ordered list, three entries, one separating space: OK
1221.08 s
[pandoc] para followed by, ordered list, two entries, one sep...: OK
1221.08 s
[pandoc] nested ordered list, one separating space: OK
1221.08 s
[pandoc] nested ordered list, one separating space, trailing ...: OK
1221.08 s
[pandoc] nested many ordered lists, one separating space: OK
1221.08 s
[pandoc] nested ordered list, mixed separating space: OK
1221.08 s
[pandoc] mixed nested ordered and unordered lists, one separa...: OK
1221.08 s
[pandoc] NoWiki
1221.08 s
[pandoc] quoted block, simple: OK
1221.08 s
[pandoc] quoted block, curly bracket exception: OK
1221.09 s
[pandoc] forced line breaks: OK
1221.09 s
[pandoc] quoted block, after trailing white space: OK
1221.09 s
[pandoc] Images and Links
1221.09 s
[pandoc] image simple: OK
1221.09 s
[pandoc] image with alt text: OK
1221.09 s
[pandoc] auto link: OK
1221.09 s
[pandoc] escaped auto link: OK
1221.09 s
[pandoc] wiki link simple: OK
1221.09 s
[pandoc] wiki link with name: OK
1221.09 s
[pandoc] image link: OK
1221.09 s
[pandoc] Table
1221.09 s
[pandoc] Table with Header: OK
1221.09 s
[pandoc] Table without Header: OK
1221.10 s
[pandoc] Table without Header, no markers at line ends: OK
1221.10 s
[pandoc] Table with Header, with formatting: OK
1221.10 s
[pandoc] Man
1221.10 s
[pandoc] Macros
1221.10 s
[pandoc] Bold: OK
1221.10 s
[pandoc] Italic: OK
1221.10 s
[pandoc] BoldItalic: OK
1221.10 s
[pandoc] H1: OK
1221.10 s
[pandoc] H2: OK
1221.10 s
[pandoc] Macro args: OK
1221.10 s
[pandoc] Argument from next line: OK
1221.10 s
[pandoc] comment: OK
1221.10 s
[pandoc] link: OK
1221.10 s
[pandoc] Escapes
1221.10 s
[pandoc] fonts: OK
1221.10 s
[pandoc] nested fonts: OK
1221.10 s
[pandoc] nested fonts 2: OK
1221.10 s
[pandoc] skip: OK
1221.10 s
[pandoc] replace: OK
1221.10 s
[pandoc] replace2: OK
1221.10 s
[pandoc] comment with \": OK
1221.10 s
[pandoc] comment with \#: OK
1221.10 s
[pandoc] two letter escapes: OK
1221.10 s
[pandoc] bracketed escapes: OK
1221.10 s
[pandoc] unicode escapes: OK
1221.10 s
[pandoc] unicode escapes (combined): OK
1221.10 s
[pandoc] unknown escape (#5034): OK
1221.10 s
[pandoc] Lists
1221.10 s
[pandoc] bullet: OK
1221.10 s
[pandoc] ordered: OK
1221.10 s
[pandoc] upper: OK
1221.10 s
[pandoc] nested: OK
1221.10 s
[pandoc] change in list style: OK
1221.10 s
[pandoc] CodeBlocks
1221.10 s
[pandoc] cb1: OK
1221.10 s
[pandoc] Tables
1221.10 s
[pandoc] t1: OK
1221.10 s
[pandoc] longcell: OK
1221.10 s
[pandoc] Mdoc
1221.10 s
[pandoc] one-line enclosures
1221.10 s
[pandoc] Dq: OK
1221.10 s
[pandoc] Sq: OK
1221.10 s
[pandoc] empty: OK
1221.10 s
[pandoc] nested: OK
1221.11 s
[pandoc] nested with closing delimiters: OK
1221.11 s
[pandoc] nested multiline enclosure: OK
1221.11 s
[pandoc] with inlines: OK
1221.11 s
[pandoc] with text production: OK
1221.11 s
[pandoc] with Ns: OK
1221.11 s
[pandoc] ending with open delimiter: OK
1221.11 s
[pandoc] multiline enclosures
1221.11 s
[pandoc] nested multiline: OK
1221.11 s
[pandoc] nested on one line: OK
1221.11 s
[pandoc] with wacky delimiters: OK
1221.11 s
[pandoc] simple inlines
1221.11 s
[pandoc] Sy: OK
1221.11 s
[pandoc] Em: OK
1221.11 s
[pandoc] Ev: OK
1221.11 s
[pandoc] Ar: OK
1221.11 s
[pandoc] In: OK
1221.11 s
[pandoc] Mt: OK
1221.11 s
[pandoc] No: OK
1221.11 s
[pandoc] empty Pa with closing punctuation: OK
1221.11 s
[pandoc] delimiters: OK
1221.11 s
[pandoc] multiple: OK
1221.11 s
[pandoc] Fl
1221.11 s
[pandoc] simple: OK
1221.11 s
[pandoc] multiple: OK
1221.11 s
[pandoc] empty with following macro: OK
1221.11 s
[pandoc] enclosed with following macro: OK
1221.11 s
[pandoc] enclosed with following delimiters: OK
1221.11 s
[pandoc] following Ns: OK
1221.11 s
[pandoc] GNU: OK
1221.11 s
[pandoc] GNU escaped: OK
1221.11 s
[pandoc] GNU Fl Fl: OK
1221.11 s
[pandoc] punctuation: OK
1221.11 s
[pandoc] middle close paren: OK
1221.12 s
[pandoc] empty with close paren: OK
1221.12 s
[pandoc] empty with pipe: OK
1221.12 s
[pandoc] empty with parens: OK
1221.12 s
[pandoc] links
1221.12 s
[pandoc] basic: OK
1221.12 s
[pandoc] complicated: OK
1221.12 s
[pandoc] unnamed: OK
1221.12 s
[pandoc] Ns macro
1221.12 s
[pandoc] at the beginning of a macro line (mandoc delta): OK
1221.12 s
[pandoc] after a block closing macro: OK
1221.12 s
[pandoc] in the middle of a macro line: OK
1221.12 s
[pandoc] before closing punctuation: OK
1221.12 s
[pandoc] after closing punctuation: OK
1221.12 s
[pandoc] at the end of a macro line: OK
1221.12 s
[pandoc] at the end of a partial-implicit line: OK
1221.12 s
[pandoc] normal words: OK
1221.13 s
[pandoc] opening punctuation: OK
1221.13 s
[pandoc] closing punctuation: OK
1221.13 s
[pandoc] spacing mode
1221.13 s
[pandoc] all text: OK
1221.13 s
[pandoc] text around macro: OK
1221.13 s
[pandoc] mulitple macros: OK
1221.13 s
[pandoc] mulitple control lines: OK
1221.13 s
[pandoc] mixed control and text lines: OK
1221.13 s
[pandoc] delimiters: OK
1221.13 s
[pandoc] Ap macro
1221.13 s
[pandoc] in the middle of a macro line: OK
1221.13 s
[pandoc] with punctuation and called macro: OK
1221.13 s
[pandoc] Pf macro
1221.14 s
[pandoc] closing punctuation: OK
1221.14 s
[pandoc] double punctuation: OK
1221.14 s
[pandoc] opening punctuation: OK
1221.14 s
[pandoc] unparsed argument: OK
1221.14 s
[pandoc] text production
1221.14 s
[pandoc] early NetBSD versions: OK
1221.14 s
[pandoc] with Ns: OK
1221.14 s
[pandoc] with punctuation: OK
1221.14 s
[pandoc] with argument and punctuation: OK
1221.14 s
[pandoc] BSD alone: OK
1221.14 s
[pandoc] BSD with macro: OK
1221.14 s
[pandoc] BSD with version: OK
1221.14 s
[pandoc] BSD with variant: OK
1221.14 s
[pandoc] inline punctuation
1221.14 s
[pandoc] leading punctuation
1221.14 s
[pandoc] open paren: OK
1221.14 s
[pandoc] open square bracket: OK
1221.14 s
[pandoc] pipe: OK
1221.14 s
[pandoc] period: OK
1221.14 s
[pandoc] comma: OK
1221.14 s
[pandoc] semicolon: OK
1221.14 s
[pandoc] colon: OK
1221.14 s
[pandoc] question mark: OK
1221.14 s
[pandoc] exclamation: OK
1221.14 s
[pandoc] close paren: OK
1221.14 s
[pandoc] close square bracket: OK
1221.14 s
[pandoc] trailing punctuation
1221.14 s
[pandoc] open paren: OK
1221.14 s
[pandoc] open square bracket: OK
1221.14 s
[pandoc] pipe: OK
1221.14 s
[pandoc] period: OK
1221.14 s
[pandoc] comma: OK
1221.14 s
[pandoc] semicolon: OK
1221.14 s
[pandoc] colon: OK
1221.14 s
[pandoc] question mark: OK
1221.14 s
[pandoc] exclamation: OK
1221.14 s
[pandoc] close parens: OK
1221.14 s
[pandoc] close square bracket: OK
1221.15 s
[pandoc] middle punctuation
1221.15 s
[pandoc] open paren: OK
1221.15 s
[pandoc] open square bracket: OK
1221.15 s
[pandoc] pipe: OK
1221.15 s
[pandoc] period: OK
1221.15 s
[pandoc] comma: OK
1221.15 s
[pandoc] semicolon: OK
1221.15 s
[pandoc] colon: OK
1221.15 s
[pandoc] question mark: OK
1221.15 s
[pandoc] exclamation: OK
1221.15 s
[pandoc] close paren: OK
1221.15 s
[pandoc] close square bracket: OK
1221.15 s
[pandoc] FB2
1221.15 s
[pandoc] Emphasis: OK
1221.15 s
[pandoc] Titles: OK
1221.15 s
[pandoc] Epigraph: OK
1221.15 s
[pandoc] Poem: OK
1221.15 s
[pandoc] Meta: OK
1221.15 s
[pandoc] Notes: OK
1221.15 s
[pandoc] DokuWiki
1221.15 s
[pandoc] inlines
1221.15 s
[pandoc] Bold: OK
1221.15 s
[pandoc] Italic: OK
1221.15 s
[pandoc] Underlined: OK
1221.15 s
[pandoc] Monospaced: OK
1221.15 s
[pandoc] Monospaced with nowiki: OK
1221.15 s
[pandoc] Combined: OK
1221.15 s
[pandoc] Nowiki: OK
1221.15 s
[pandoc] Percent: OK
1221.16 s
[pandoc] Subscript: OK
1221.16 s
[pandoc] Superscript: OK
1221.16 s
[pandoc] Deleted: OK
1221.16 s
[pandoc] Inline code: OK
1221.16 s
[pandoc] Inline file: OK
1221.16 s
[pandoc] Inline HTML: OK
1221.16 s
[pandoc] Inline PHP: OK
1221.16 s
[pandoc] Linebreak: OK
1221.16 s
[pandoc] External links
1221.16 s
[pandoc] Autolink: OK
1221.16 s
[pandoc] Link without description: OK
1221.16 s
[pandoc] Link with description: OK
1221.16 s
[pandoc] Trim whitespace around link and description: OK
1221.16 s
[pandoc] Email address: OK
1221.16 s
[pandoc] Internal links
1221.16 s
[pandoc] Current namespace: OK
1221.16 s
[pandoc] Current namespace starting with dot: OK
1221.16 s
[pandoc] Current namespace starting with dot and colon: OK
1221.16 s
[pandoc] Root namespace: OK
1221.16 s
[pandoc] Parent namespace: OK
1221.16 s
[pandoc] Parent namespace with colon: OK
1221.16 s
[pandoc] Beneath the root namespace: OK
1221.16 s
[pandoc] Explicitly beneath the root namespace: OK
1221.16 s
[pandoc] Interwiki links
1221.16 s
[pandoc] Interwiki without description: OK
1221.16 s
[pandoc] Interwiki link with description: OK
1221.16 s
[pandoc] Footnote: OK
1221.16 s
[pandoc] Images
1221.16 s
[pandoc] Image: OK
1221.16 s
[pandoc] Image with caption: OK
1221.16 s
[pandoc] Image with } in caption: OK
1221.16 s
[pandoc] Wiki namespace starting with dot: OK
1221.16 s
[pandoc] Left aligned image: OK
1221.16 s
[pandoc] Right aligned image: OK
1221.16 s
[pandoc] Centered image: OK
1221.16 s
[pandoc] Image with width: OK
1221.16 s
[pandoc] Image with width and height: OK
1221.16 s
[pandoc] Linkonly: OK
1221.16 s
[pandoc] Ignore ~~NOTOC~~: OK
1221.16 s
[pandoc] Ignore ~~NOCACHE~~: OK
1221.16 s
[pandoc] Sectioning
1221.16 s
[pandoc] Headline level 1: OK
1221.16 s
[pandoc] Headline level 2: OK
1221.16 s
[pandoc] Headline level 3: OK
1221.16 s
[pandoc] Headline level 4: OK
1221.16 s
[pandoc] Headline level 5: OK
1221.16 s
[pandoc] Only two closing = are required: OK
1221.17 s
[pandoc] One closing = is not enough: OK
1221.17 s
[pandoc] One closing = is not enough: OK
1221.17 s
[pandoc] Horizontal line: OK
1221.17 s
[pandoc] Lists
1221.17 s
[pandoc] Unordered list: OK
1221.17 s
[pandoc] Ordered list: OK
1221.17 s
[pandoc] Multiline list items: OK
1221.17 s
[pandoc] Block HTML: OK
1221.17 s
[pandoc] Block PHP: OK
1221.17 s
[pandoc] Quote: OK
1221.17 s
[pandoc] Code block: OK
1221.17 s
[pandoc] Java code block: OK
1221.17 s
[pandoc] File with filename and no language: OK
1221.17 s
[pandoc] Table: OK
1221.17 s
[pandoc] Table with header: OK
1221.17 s
[pandoc] Table with alignment: OK
1221.18 s
[pandoc] Table with colspan: OK
1221.18 s
[pandoc] Indented code block: OK
1221.18 s
[pandoc] Pod
1221.18 s
[pandoc] inlines
1221.18 s
[pandoc] code with nested inlines: OK
1221.18 s
[pandoc] compact in compact: OK
1221.18 s
[pandoc] expanded in compact: OK
1221.18 s
[pandoc] compact in expanded: OK
1221.18 s
[pandoc] expanded in expanded: OK
1221.18 s
[pandoc] links
1221.18 s
[pandoc] compact
1221.18 s
[pandoc] URL: OK
1221.18 s
[pandoc] URL with link text: OK
1221.18 s
[pandoc] perl manual: OK
1221.18 s
[pandoc] manual with quoted section: OK
1221.18 s
[pandoc] manual with section and formatted link text: OK
1221.18 s
[pandoc] internal link: OK
1221.18 s
[pandoc] internal link with formatting: OK
1221.18 s
[pandoc] link with angle bracket: OK
1221.18 s
[pandoc] empty name: OK
1221.18 s
[pandoc] expanded
1221.18 s
[pandoc] URL: OK
1221.18 s
[pandoc] URL with link text: OK
1221.18 s
[pandoc] perl manual: OK
1221.18 s
[pandoc] manual with quoted section: OK
1221.18 s
[pandoc] manual with section and formatted link text: OK
1221.18 s
[pandoc] internal link: OK
1221.18 s
[pandoc] internal link with formatting: OK
1221.18 s
[pandoc] link with angle bracket: OK
1221.18 s
[pandoc] empty name: OK
1221.18 s
[pandoc] entities
1221.18 s
[pandoc] required
1221.18 s
[pandoc] quot: OK
1221.18 s
[pandoc] amp: OK
1221.18 s
[pandoc] apos: OK
1221.18 s
[pandoc] lt: OK
1221.18 s
[pandoc] gt: OK
1221.18 s
[pandoc] sol: OK
1221.18 s
[pandoc] verbar: OK
1221.18 s
[pandoc] lchevron: OK
1221.18 s
[pandoc] rchevron: OK
1221.18 s
[pandoc] numeric
1221.18 s
[pandoc] decimal: OK
1221.18 s
[pandoc] octal: OK
1221.18 s
[pandoc] hexadecimal: OK
1221.18 s
[pandoc] hexadecimal variant: OK
1221.18 s
[pandoc] actually decimal: OK
1221.18 s
[pandoc] bogus
1221.18 s
[pandoc] 0XA2: OK
1221.18 s
[pandoc] not a real entity: OK
1221.18 s
[pandoc] 162 1: OK
1221.18 s
[pandoc] 99 bottles of beer: OK
1221.19 s
[pandoc] 0xhh: OK
1221.19 s
[pandoc] 077x: OK
1221.19 s
[pandoc] 0x63 skidoo: OK
1221.19 s
[pandoc]
1221.19 s
[pandoc] All 3625 tests passed (81.69s)
1221.25 s
[pandoc] Test suite test-pandoc: PASS
1221.25 s
[pandoc] Test suite logged to: dist/test/pandoc-3.7.0.2-test-pandoc.log
1221.26 s
[pandoc] 1 of 1 test suites (1 of 1 test cases) passed.
1221.29 s
[pandoc] checkPhase completed in 1 minutes 25 seconds
1221.29 s
[pandoc] Phase: haddockPhase
1221.74 s
[pandoc] Phase: installPhase
1222.07 s
[pandoc] Installing internal library xml-light in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-3.7.0.2-KGPTJkDqL6PHRGo9hEntgT-xml-light
1222.16 s
[pandoc] Installing library in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
1226.06 s
[vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
1231.15 s
[pandoc] Phase: fixupPhase
1231.16 s
[pandoc] shrinking RPATHs of ELF executables and libraries in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2
1231.16 s
[pandoc] shrinking /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSpandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3-ghc9.10.3.so
1231.33 s
[pandoc] shrinking /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSpandoc-3.7.0.2-KGPTJkDqL6PHRGo9hEntgT-xml-light-ghc9.10.3.so
1231.50 s
[pandoc] checking for references to /build/ in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2...
1231.69 s
[pandoc] patching script interpreter paths in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2
1231.70 s
[pandoc] stripping (with command strip and flags -S -p) in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib
1234.64 s
[vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
1236.25 s
[vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0..
1236.25 s
[vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0..
1236.60 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 )
1237.02 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 )
1240.04 s
[pandoc] shrinking RPATHs of ELF executables and libraries in /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data
1240.12 s
[pandoc] checking for references to /build/ in /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data...
1240.13 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 )
1240.13 s
[vector]
1240.13 s
[vector] tests/Utilities.hs:244:17: warning : [ GHC-63394 ] [ -Wx-partial ]
1240.13 s
[vector] In the use of ‘tail’
1240.13 s
[vector] (imported from Prelude, but defined in GHC.List):
1240.13 s
[vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1240.13 s
[vector] |
1240.13 s
[vector] 244 | postscanl f z = tail . scanl f z
1240.13 s
[vector] | ^^^^
1240.13 s
[vector]
1240.13 s
[vector] tests/Utilities.hs:245:16: warning : [ GHC-63394 ] [ -Wx-partial ]
1240.13 s
[vector] In the use of ‘tail’
1240.13 s
[vector] (imported from Prelude, but defined in GHC.List):
1240.13 s
[vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1240.13 s
[vector] |
1240.13 s
[vector] 245 | prescanr f z = tail . scanr f z
1240.13 s
[vector] | ^^^^
1240.13 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 )
1240.22 s
[pandoc] patching script interpreter paths in /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data
1240.22 s
[vector]
1240.22 s
[vector] tests/Tests/Vector/Property.hs:243:68: warning : [ GHC-63394 ] [ -Wx-partial ]
1240.22 s
[vector] In the use of ‘head’
1240.22 s
[vector] (imported from Data.List, but defined in GHC.List):
1240.22 s
[vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1240.22 s
[vector] |
1240.22 s
[vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
1240.22 s
[vector] | ^^^^
1240.22 s
[vector]
1240.22 s
[vector] tests/Tests/Vector/Property.hs:256:76: warning : [ GHC-63394 ] [ -Wx-partial ]
1240.22 s
[vector] In the use of ‘head’
1240.22 s
[vector] (imported from Data.List, but defined in GHC.List):
1240.22 s
[vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1240.22 s
[vector] |
1240.22 s
[vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
1240.22 s
[vector] | ^^^^
1240.22 s
[vector]
1240.22 s
[vector] tests/Tests/Vector/Property.hs:272:65: warning : [ GHC-63394 ] [ -Wx-partial ]
1240.22 s
[vector] In the use of ‘tail’
1240.22 s
[vector] (imported from Data.List, but defined in GHC.List):
1240.22 s
[vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1240.22 s
[vector] |
1240.22 s
[vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
1240.23 s
[vector] | ^^^^
1240.23 s
[vector]
1240.23 s
[vector] tests/Tests/Vector/Property.hs:439:26: warning : [ GHC-63394 ] [ -Wx-partial ]
1240.23 s
[vector] In the use of ‘head’
1240.23 s
[vector] (imported from Data.List, but defined in GHC.List):
1240.23 s
[vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1240.23 s
[vector] |
1240.23 s
[vector] 439 | = V.uniq `eq` (map head . group)
1240.23 s
[vector] | ^^^^
1241.30 s
[pandoc:post-build] Uploading to cachix cache "sellout": /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2 /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data
1241.72 s
[pandoc:post-build] Nothing to push - all store paths are already on Cachix.
1241.75 s
[pandoc:post-build] Uploading to the NixCI cache: /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2 /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data
1241.80 s
[pandoc:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1241.92 s
[pandoc:post-build] copying 1 paths...
1241.92 s
[pandoc:post-build] copying path '/nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2' to 'https://cache.nix-ci.com'...
1415.30 s
[pandoc:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1415.43 s
[pandoc:post-build] copying 0 paths...
1415.45 s
Progress: 22 of 38 built (1 building), 559 of 559 downloaded from cache
1415.59 s
Building /nix/store/97khgz4lrmr215dy798mkwnwd89b9kzw-pandoc-lua-engine-0.4.3.drv
1415.68 s
Building /nix/store/s3jg3bgm7jkn4xv5miw4v3w05qrkza0r-pandoc-server-0.1.0.11.drv
1415.68 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 )
1415.68 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 )
1415.68 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 )
1415.68 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 )
1415.68 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 )
1415.68 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 )
1415.68 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 )
1415.68 s
[vector]
1415.68 s
[vector] tests/Tests/Bundle.hs:76:77: warning : [ GHC-63394 ] [ -Wx-partial ]
1415.68 s
[vector] In the use of ‘head’
1415.68 s
[vector] (imported from Prelude, but defined in GHC.List):
1415.68 s
[vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1415.68 s
[vector] |
1415.68 s
[vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
1415.68 s
[vector] | ^^^^
1415.68 s
[vector]
1415.68 s
[vector] tests/Tests/Bundle.hs:92:83: warning : [ GHC-63394 ] [ -Wx-partial ]
1415.68 s
[vector] In the use of ‘tail’
1415.68 s
[vector] (imported from Prelude, but defined in GHC.List):
1415.68 s
[vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1415.68 s
[vector] |
1415.68 s
[vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
1415.68 s
[vector] | ^^^^
1415.68 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 )
1415.68 s
[vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
1415.68 s
[vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0..
1415.68 s
[vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0..
1415.68 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 )
1415.68 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 )
1415.68 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 )
1415.68 s
[vector]
1415.68 s
[vector] tests/Utilities.hs:244:17: warning : [ GHC-63394 ] [ -Wx-partial ]
1415.68 s
[vector] In the use of ‘tail’
1415.68 s
[vector] (imported from Prelude, but defined in GHC.List):
1415.68 s
[vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1415.68 s
[vector] |
1415.68 s
[vector] 244 | postscanl f z = tail . scanl f z
1415.68 s
[vector] | ^^^^
1415.68 s
[vector]
1415.68 s
[vector] tests/Utilities.hs:245:16: warning : [ GHC-63394 ] [ -Wx-partial ]
1415.68 s
[vector] In the use of ‘tail’
1415.68 s
[vector] (imported from Prelude, but defined in GHC.List):
1415.68 s
[vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1415.68 s
[vector] |
1415.68 s
[vector] 245 | prescanr f z = tail . scanr f z
1415.68 s
[vector] | ^^^^
1415.68 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 )
1415.68 s
[vector]
1415.68 s
[vector] tests/Tests/Vector/Property.hs:243:68: warning : [ GHC-63394 ] [ -Wx-partial ]
1415.68 s
[vector] In the use of ‘head’
1415.68 s
[vector] (imported from Data.List, but defined in GHC.List):
1415.68 s
[vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1415.68 s
[vector] |
1415.68 s
[vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
1415.68 s
[vector] | ^^^^
1415.68 s
[vector]
1415.68 s
[vector] tests/Tests/Vector/Property.hs:256:76: warning : [ GHC-63394 ] [ -Wx-partial ]
1415.68 s
[vector] In the use of ‘head’
1415.68 s
[vector] (imported from Data.List, but defined in GHC.List):
1415.68 s
[vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1415.68 s
[vector] |
1415.68 s
[vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
1415.68 s
[vector] | ^^^^
1415.68 s
[vector]
1415.68 s
[vector] tests/Tests/Vector/Property.hs:272:65: warning : [ GHC-63394 ] [ -Wx-partial ]
1415.68 s
[vector] In the use of ‘tail’
1415.68 s
[vector] (imported from Data.List, but defined in GHC.List):
1415.68 s
[vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1415.68 s
[vector] |
1415.68 s
[vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
1415.68 s
[vector] | ^^^^
1415.68 s
[vector]
1415.68 s
[vector] tests/Tests/Vector/Property.hs:439:26: warning : [ GHC-63394 ] [ -Wx-partial ]
1415.68 s
[vector] In the use of ‘head’
1415.68 s
[vector] (imported from Data.List, but defined in GHC.List):
1415.68 s
[vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1415.68 s
[vector] |
1415.68 s
[vector] 439 | = V.uniq `eq` (map head . group)
1415.68 s
[vector] | ^^^^
1415.68 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 )
1415.68 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 )
1415.68 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 )
1415.68 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 )
1415.68 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 )
1415.68 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 )
1415.68 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 )
1415.69 s
[vector]
1415.69 s
[vector] tests/Tests/Bundle.hs:76:77: warning : [ GHC-63394 ] [ -Wx-partial ]
1415.69 s
[vector] In the use of ‘head’
1415.69 s
[vector] (imported from Prelude, but defined in GHC.List):
1415.69 s
[vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1415.69 s
[vector] |
1415.69 s
[vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
1415.69 s
[vector] | ^^^^
1415.69 s
[vector]
1415.69 s
[vector] tests/Tests/Bundle.hs:92:83: warning : [ GHC-63394 ] [ -Wx-partial ]
1415.69 s
[vector] In the use of ‘tail’
1415.69 s
[vector] (imported from Prelude, but defined in GHC.List):
1415.69 s
[vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1415.69 s
[vector] |
1415.69 s
[vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
1415.69 s
[vector] | ^^^^
1415.69 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 )
1415.69 s
[vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
1415.69 s
[vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0..
1415.69 s
[vector] Building library 'benchmarks-O2' for vector-0.13.2.0..
1415.69 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 )
1415.69 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 )
1415.69 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 )
1415.69 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 )
1415.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 )
1415.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 )
1415.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 )
1415.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 )
1415.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 )
1415.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 )
1415.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 )
1415.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 )
1415.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 )
1415.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 )
1415.69 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 )
1415.69 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 )
1415.69 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 )
1415.69 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 )
1415.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.p_o )
1415.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.p_o )
1415.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.p_o )
1415.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.p_o )
1415.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.p_o )
1415.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.p_o )
1415.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.p_o )
1415.69 s
[vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
1415.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.p_o )
1415.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.p_o )
1415.69 s
[vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0..
1415.69 s
[vector] Building test suite 'vector-inspection' for vector-0.13.2.0..
1415.69 s
[vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
1415.69 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 )
1415.69 s
[vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
1415.69 s
[vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
1415.69 s
[vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
1415.69 s
[vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0..
1415.69 s
[vector] Building test suite 'vector-doctest' for vector-0.13.2.0..
1415.69 s
[vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
1415.69 s
[vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
1415.69 s
[vector] buildPhase completed in 4 minutes 4 seconds
1415.69 s
[vector] Phase: checkPhase
1415.69 s
[vector] Running 2 test suites...
1415.69 s
[vector] Test suite vector-tests-O0: RUNNING...
1415.69 s
[vector] toplevel
1415.69 s
[vector] Data.Vector.Fusion.Bundle
1415.69 s
[vector] fromList.toList == id: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] toList.fromList == id: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] eq: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] length: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] null: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] empty: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] singleton: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] replicate: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] cons: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] snoc: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] append: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] head: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.69 s
[vector] last: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.69 s
[vector] index: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.69 s
[vector] extract: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] init: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.69 s
[vector] tail: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.69 s
[vector] take: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] drop: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] map: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] zipWith: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] zipWith3: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] filter: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] takeWhile: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] dropWhile: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] elem: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] notElem: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] find: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] findIndex: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] foldl: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] foldl1: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.69 s
[vector] foldl': OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] foldl1': OK
1415.69 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.69 s
[vector] foldr: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] foldr1: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.69 s
[vector] prescanl: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] prescanl': OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] postscanl: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] postscanl': OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] scanl: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] scanl': OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] scanl1: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.69 s
[vector] scanl1': OK
1415.69 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.69 s
[vector] concatMap: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] unfoldr: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] and: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] or: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] Tests.Vector.Boxed
1415.69 s
[vector] Bool
1415.69 s
[vector] fromList.toList == id: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] toList.fromList == id: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] unstream.stream == id: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] stream.unstream == id: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] eq: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] length: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] null: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] index: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.69 s
[vector] safeIndex: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] head: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.69 s
[vector] last: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.69 s
[vector] unsafeIndex: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1415.69 s
[vector] unsafeHead: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.69 s
[vector] unsafeLast: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.69 s
[vector] slice: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] init: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.69 s
[vector] tail: OK
1415.69 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.69 s
[vector] take: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] drop: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] splitAt: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] empty: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] singleton: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] replicate: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] generate: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] iterateN: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] iterateNM: OK (0.09s)
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] generateM: OK (0.02s)
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] replicateM: OK (0.02s)
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] create: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] createT: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] unfoldr: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] unfoldrN: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] unfoldrExactN: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] unfoldrM: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] unfoldrNM: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] unfoldrExactNM: OK (0.07s)
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] constructN: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] constructrN: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] cons: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] snoc: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] append: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] concat: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] force: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] upd: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] accum: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] reverse: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] backpermute: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] map: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] imap: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] concatMap: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] mapM: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] mapM_: OK (0.01s)
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] forM: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] forM_: OK (0.01s)
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] imapM: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] imapM_: OK (0.01s)
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] zipWith: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] zipWith3: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] izipWith: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] izipWith3: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] izipWithM: OK
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] izipWithM_: OK (0.01s)
1415.69 s
[vector] +++ OK, passed 100 tests.
1415.69 s
[vector] zipWithM: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] zipWithM_: OK (0.01s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] filter: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] ifilter: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] filterM: OK (0.02s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] uniq: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mapMaybe: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] imapMaybe: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] takeWhile: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] dropWhile: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] partition: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] partitionWith: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] span: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] break: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] spanR: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] breakR: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] groupBy: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] elem: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] notElem: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] find: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] findIndex: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] findIndexR: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] findIndices: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] elemIndex: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] elemIndices: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] foldl: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] foldl1: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.70 s
[vector] foldl': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] foldl1': OK
1415.70 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.70 s
[vector] foldr: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] foldr1: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.70 s
[vector] foldr': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] foldr1': OK
1415.70 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.70 s
[vector] ifoldl: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] ifoldl': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] ifoldr: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] ifoldr': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] ifoldM: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] ifoldM': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] ifoldM_: OK (0.01s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] ifoldM'_: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] all: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] any: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] prescanl: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] prescanl': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] postscanl: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] postscanl': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] scanl: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] scanl': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] scanl1: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] scanl1': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] iscanl: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] iscanl': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] prescanr: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] prescanr': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] postscanr: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] postscanr': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] scanr: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] scanr': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] scanr1: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] scanr1': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] iscanr: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] iscanr': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_read: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.70 s
[vector] mut_write: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.70 s
[vector] mut_modify: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.70 s
[vector] mut_generate: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_generateM: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_mapM_: OK (0.01s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_imapM_: OK (0.01s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_forM_: OK (0.01s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_iforM_: OK (0.01s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_foldr: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_foldr': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_foldl: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_foldl': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_ifoldr: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_ifoldr': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_ifoldl: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_ifoldl': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_foldM: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_foldM': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_foldrM: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_foldrM': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_ifoldM: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_ifoldM': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_ifoldrM: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mut_ifoldrM': OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] compare: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] maximum: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.70 s
[vector] minimum: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1415.70 s
[vector] minIndex: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.70 s
[vector] maxIndex: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 25 discarded.
1415.70 s
[vector] maximumBy: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.70 s
[vector] minimumBy: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.70 s
[vector] maximumOn: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.70 s
[vector] minimumOn: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.70 s
[vector] maxIndexBy: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.70 s
[vector] minIndexBy: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.70 s
[vector] ListFirstMaxIndexWins: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.70 s
[vector] FalseListFirstMaxIndexWins: OK
1415.70 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.70 s
[vector] Exception:
1415.70 s
[vector] Prelude.foldr1: empty list
1415.70 s
[vector] CallStack (from HasCallStack):
1415.70 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.70 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.70 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.70 s
[vector] []
1415.70 s
[vector] zip: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] zip3: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] unzip: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] unzip3: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] indexed: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] update: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] concat: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mempty: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mappend: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mconcat: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] fmap: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] return: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] bind: OK (0.01s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mzip: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] munzip: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] applicative_pure: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] applicative_appl: OK (0.02s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] alternative_empty: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] alternative_or: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] sequence: OK (0.02s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] sequence_: OK (0.01s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] glength: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] and: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] or: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] Int
1415.70 s
[vector] fromList.toList == id: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] toList.fromList == id: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] unstream.stream == id: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] stream.unstream == id: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] eq: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] length: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] null: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] index: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.70 s
[vector] safeIndex: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] head: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.70 s
[vector] last: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.70 s
[vector] unsafeIndex: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1415.70 s
[vector] unsafeHead: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.70 s
[vector] unsafeLast: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.70 s
[vector] slice: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] init: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.70 s
[vector] tail: OK
1415.70 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.70 s
[vector] take: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] drop: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] splitAt: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] empty: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] singleton: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] replicate: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] generate: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] iterateN: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] iterateNM: OK (0.05s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] generateM: OK (0.02s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] replicateM: OK (0.02s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] create: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] createT: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] unfoldr: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] unfoldrN: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] unfoldrExactN: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] unfoldrM: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] unfoldrNM: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] unfoldrExactNM: OK (0.05s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] constructN: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] constructrN: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] cons: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] snoc: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] append: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] concat: OK (0.01s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] force: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] upd: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] accum: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] reverse: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] backpermute: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] map: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] imap: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] concatMap: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mapM: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] mapM_: OK (0.02s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] forM: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] forM_: OK (0.02s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] imapM: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] imapM_: OK (0.02s)
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] zipWith: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.70 s
[vector] zipWith3: OK
1415.70 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] izipWith: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] izipWith3: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] izipWithM: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] izipWithM_: OK (0.02s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] zipWithM: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] zipWithM_: OK (0.02s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] filter: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] ifilter: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] filterM: OK (0.03s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] uniq: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mapMaybe: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] imapMaybe: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] takeWhile: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] dropWhile: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] partition: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] partitionWith: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] span: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] break: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] spanR: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] breakR: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] groupBy: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] elem: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] notElem: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] find: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] findIndex: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] findIndexR: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] findIndices: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] elemIndex: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] elemIndices: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] foldl: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] foldl1: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.71 s
[vector] foldl': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] foldl1': OK
1415.71 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.71 s
[vector] foldr: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] foldr1: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.71 s
[vector] foldr': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] foldr1': OK
1415.71 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.71 s
[vector] ifoldl: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] ifoldl': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] ifoldr: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] ifoldr': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] ifoldM: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] ifoldM': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] ifoldM_: OK (0.02s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] ifoldM'_: OK (0.02s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] all: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] any: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] prescanl: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] prescanl': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] postscanl: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] postscanl': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] scanl: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] scanl': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] scanl1: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] scanl1': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] iscanl: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] iscanl': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] prescanr: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] prescanr': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] postscanr: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] postscanr': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] scanr: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] scanr': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] scanr1: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] scanr1': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] iscanr: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] iscanr': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_read: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.71 s
[vector] mut_write: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.71 s
[vector] mut_modify: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.71 s
[vector] mut_generate: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_generateM: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_mapM_: OK (0.02s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_imapM_: OK (0.02s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_forM_: OK (0.02s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_iforM_: OK (0.02s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_foldr: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_foldr': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_foldl: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_foldl': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_ifoldr: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_ifoldr': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_ifoldl: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_ifoldl': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_foldM: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_foldM': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_foldrM: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_foldrM': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_ifoldM: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_ifoldM': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_ifoldrM: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mut_ifoldrM': OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] compare: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] maximum: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1415.71 s
[vector] minimum: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.71 s
[vector] minIndex: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.71 s
[vector] maxIndex: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1415.71 s
[vector] maximumBy: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.71 s
[vector] minimumBy: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.71 s
[vector] maximumOn: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.71 s
[vector] minimumOn: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.71 s
[vector] maxIndexBy: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.71 s
[vector] minIndexBy: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.71 s
[vector] ListFirstMaxIndexWins: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.71 s
[vector] FalseListFirstMaxIndexWins: OK
1415.71 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.71 s
[vector] Exception:
1415.71 s
[vector] Prelude.foldr1: empty list
1415.71 s
[vector] CallStack (from HasCallStack):
1415.71 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.71 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.71 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.71 s
[vector] []
1415.71 s
[vector] zip: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] zip3: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] unzip: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] unzip3: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] indexed: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] update: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] concat: OK (0.01s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mempty: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mappend: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mconcat: OK (0.03s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] fmap: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] return: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] bind: OK (0.02s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] mzip: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] munzip: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] applicative_pure: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] applicative_appl: OK (0.05s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] alternative_empty: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] alternative_or: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] sequence: OK (0.03s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] sequence_: OK (0.01s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] glength: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] sum: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] product: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] enumFromN: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] enumFromThenN: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] enumFromTo: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] enumFromThenTo: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.71 s
[vector] unstream
1415.71 s
[vector] unstream == vunstream (exact): OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] unstream == vunstream (unknown): OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] unstreamR ~= vunstream (exact): OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] unstreamR ~= vunstream (unknown): OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] Tests.Vector.Primitive
1415.71 s
[vector] Int
1415.71 s
[vector] fromList.toList == id: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] toList.fromList == id: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] unstream.stream == id: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] stream.unstream == id: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] eq: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] length: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] null: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] index: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.71 s
[vector] safeIndex: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] head: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.71 s
[vector] last: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.71 s
[vector] unsafeIndex: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.71 s
[vector] unsafeHead: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.71 s
[vector] unsafeLast: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.71 s
[vector] slice: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] init: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.71 s
[vector] tail: OK
1415.71 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.71 s
[vector] take: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] drop: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] splitAt: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] empty: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] singleton: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] replicate: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] generate: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] iterateN: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] iterateNM: OK (0.03s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] generateM: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] replicateM: OK (0.03s)
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] create: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] createT: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] unfoldr: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] unfoldrN: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] unfoldrExactN: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] unfoldrM: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] unfoldrNM: OK
1415.71 s
[vector] +++ OK, passed 100 tests.
1415.71 s
[vector] unfoldrExactNM: OK (0.01s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] constructN: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] constructrN: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] cons: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] snoc: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] append: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] concat: OK (0.02s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] force: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] upd: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] accum: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] reverse: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] backpermute: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] map: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] imap: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] concatMap: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mapM: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mapM_: OK (0.02s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] forM: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] forM_: OK (0.02s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] imapM: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] imapM_: OK (0.02s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] zipWith: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] zipWith3: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] izipWith: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] izipWith3: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] izipWithM: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] izipWithM_: OK (0.01s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] zipWithM: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] zipWithM_: OK (0.02s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] filter: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] ifilter: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] filterM: OK (0.03s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] uniq: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mapMaybe: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] imapMaybe: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] takeWhile: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] dropWhile: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] partition: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] partitionWith: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] span: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] break: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] spanR: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] breakR: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] groupBy: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] elem: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] notElem: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] find: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] findIndex: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] findIndexR: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] findIndices: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] elemIndex: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] elemIndices: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] foldl: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] foldl1: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.72 s
[vector] foldl': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] foldl1': OK
1415.72 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.72 s
[vector] foldr: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] foldr1: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.72 s
[vector] foldr': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] foldr1': OK
1415.72 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.72 s
[vector] ifoldl: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] ifoldl': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] ifoldr: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] ifoldr': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] ifoldM: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] ifoldM': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] ifoldM_: OK (0.02s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] ifoldM'_: OK (0.02s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] all: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] any: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] prescanl: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] prescanl': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] postscanl: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] postscanl': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] scanl: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] scanl': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] scanl1: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] scanl1': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] iscanl: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] iscanl': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] prescanr: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] prescanr': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] postscanr: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] postscanr': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] scanr: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] scanr': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] scanr1: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] scanr1': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] iscanr: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] iscanr': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_read: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.72 s
[vector] mut_write: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.72 s
[vector] mut_modify: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.72 s
[vector] mut_generate: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_generateM: OK (0.01s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_mapM_: OK (0.02s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_imapM_: OK (0.02s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_forM_: OK (0.01s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_iforM_: OK (0.02s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_foldr: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_foldr': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_foldl: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_foldl': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_ifoldr: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_ifoldr': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_ifoldl: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_ifoldl': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_foldM: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_foldM': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_foldrM: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_foldrM': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_ifoldM: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_ifoldM': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_ifoldrM: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mut_ifoldrM': OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] compare: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] maximum: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.72 s
[vector] minimum: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.72 s
[vector] minIndex: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.72 s
[vector] maxIndex: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.72 s
[vector] maximumBy: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.72 s
[vector] minimumBy: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.72 s
[vector] maximumOn: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.72 s
[vector] minimumOn: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.72 s
[vector] maxIndexBy: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.72 s
[vector] minIndexBy: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.72 s
[vector] ListFirstMaxIndexWins: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.72 s
[vector] FalseListFirstMaxIndexWins: OK
1415.72 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.72 s
[vector] Exception:
1415.72 s
[vector] Prelude.foldr1: empty list
1415.72 s
[vector] CallStack (from HasCallStack):
1415.72 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.72 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.72 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.72 s
[vector] []
1415.72 s
[vector] mempty: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mappend: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] mconcat: OK (0.02s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] glength: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] sum: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] product: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] enumFromN: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] enumFromThenN: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] enumFromTo: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] enumFromThenTo: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1415.72 s
[vector] Double
1415.72 s
[vector] fromList.toList == id: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] toList.fromList == id: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] unstream.stream == id: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] stream.unstream == id: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] eq: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] length: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] null: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] index: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.72 s
[vector] safeIndex: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] head: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.72 s
[vector] last: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.72 s
[vector] unsafeIndex: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.72 s
[vector] unsafeHead: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.72 s
[vector] unsafeLast: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1415.72 s
[vector] slice: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] init: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.72 s
[vector] tail: OK
1415.72 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1415.72 s
[vector] take: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] drop: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] splitAt: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] empty: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] singleton: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] replicate: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] generate: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] iterateN: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] iterateNM: OK (0.04s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] generateM: OK (0.04s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] replicateM: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] create: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] createT: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] unfoldr: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] unfoldrN: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] unfoldrExactN: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] unfoldrM: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] unfoldrNM: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] unfoldrExactNM: OK (0.02s)
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.72 s
[vector] constructN: OK
1415.72 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] constructrN: OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] cons: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] snoc: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] append: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] concat: OK (0.03s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] force: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] upd: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] accum: OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] reverse: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] backpermute: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] map: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] imap: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] concatMap: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mapM: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mapM_: OK (0.03s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] forM: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] forM_: OK (0.04s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] imapM: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] imapM_: OK (0.03s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] zipWith: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] zipWith3: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] izipWith: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] izipWith3: OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] izipWithM: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] izipWithM_: OK (0.04s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] zipWithM: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] zipWithM_: OK (0.03s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] filter: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] ifilter: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] filterM: OK (0.05s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] uniq: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mapMaybe: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] imapMaybe: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] takeWhile: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] dropWhile: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] partition: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] partitionWith: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] span: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] break: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] spanR: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] breakR: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] groupBy: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] elem: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] notElem: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] find: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] findIndex: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] findIndexR: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] findIndices: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] elemIndex: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] elemIndices: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] foldl: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] foldl1: OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.73 s
[vector] foldl': OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] foldl1': OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.73 s
[vector] foldr: OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] foldr1: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.73 s
[vector] foldr': OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] foldr1': OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.73 s
[vector] ifoldl: OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] ifoldl': OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] ifoldr: OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] ifoldr': OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] ifoldM: OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] ifoldM': OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] ifoldM_: OK (0.04s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] ifoldM'_: OK (0.05s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] all: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] any: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] prescanl: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] prescanl': OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] postscanl: OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] postscanl': OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] scanl: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] scanl': OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] scanl1: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] scanl1': OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] iscanl: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] iscanl': OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] prescanr: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] prescanr': OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] postscanr: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] postscanr': OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] scanr: OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] scanr': OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] scanr1: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] scanr1': OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] iscanr: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] iscanr': OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_read: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.73 s
[vector] mut_write: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.73 s
[vector] mut_modify: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.73 s
[vector] mut_generate: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_generateM: OK (0.03s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_mapM_: OK (0.04s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_imapM_: OK (0.05s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_forM_: OK (0.04s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_iforM_: OK (0.04s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_foldr: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_foldr': OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_foldl: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_foldl': OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_ifoldr: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_ifoldr': OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_ifoldl: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_ifoldl': OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_foldM: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_foldM': OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_foldrM: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_foldrM': OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_ifoldM: OK (0.01s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_ifoldM': OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_ifoldrM: OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mut_ifoldrM': OK (0.02s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] compare: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] maximum: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.73 s
[vector] minimum: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.73 s
[vector] minIndex: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.73 s
[vector] maxIndex: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.73 s
[vector] maximumBy: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.73 s
[vector] minimumBy: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.73 s
[vector] maximumOn: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1415.73 s
[vector] minimumOn: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.73 s
[vector] maxIndexBy: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.73 s
[vector] minIndexBy: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.73 s
[vector] ListFirstMaxIndexWins: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.73 s
[vector] FalseListFirstMaxIndexWins: OK
1415.73 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.73 s
[vector] Exception:
1415.73 s
[vector] Prelude.foldr1: empty list
1415.73 s
[vector] CallStack (from HasCallStack):
1415.73 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.73 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.73 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.73 s
[vector] []
1415.73 s
[vector] mempty: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mappend: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] mconcat: OK (0.03s)
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] glength: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] sum: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] product: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] enumFromN: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] enumFromThenN: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] enumFromTo: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] enumFromThenTo: OK
1415.73 s
[vector] +++ OK, passed 100 tests; 3 discarded.
1415.73 s
[vector] unstream
1415.73 s
[vector] unstream == vunstream (exact): OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] unstream == vunstream (unknown): OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] unstreamR ~= vunstream (exact): OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] unstreamR ~= vunstream (unknown): OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] Tests.Vector.Storable
1415.73 s
[vector] Data.Vector.Storable.Vector (Int)
1415.73 s
[vector] fromList.toList == id: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] toList.fromList == id: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] unstream.stream == id: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] stream.unstream == id: OK
1415.73 s
[vector] +++ OK, passed 100 tests.
1415.73 s
[vector] eq: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] length: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] null: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] index: OK
1415.74 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.74 s
[vector] safeIndex: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] head: OK
1415.74 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.74 s
[vector] last: OK
1415.74 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.74 s
[vector] unsafeIndex: OK
1415.74 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.74 s
[vector] unsafeHead: OK
1415.74 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.74 s
[vector] unsafeLast: OK
1415.74 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.74 s
[vector] slice: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] init: OK
1415.74 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.74 s
[vector] tail: OK
1415.74 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.74 s
[vector] take: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] drop: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] splitAt: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] empty: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] singleton: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] replicate: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] generate: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] iterateN: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] iterateNM: OK (0.01s)
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] generateM: OK (0.03s)
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] replicateM: OK (0.02s)
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] create: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] createT: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] unfoldr: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] unfoldrN: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] unfoldrExactN: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] unfoldrM: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] unfoldrNM: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] unfoldrExactNM: OK (0.05s)
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] constructN: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] constructrN: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] cons: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] snoc: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] append: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] concat: OK (0.01s)
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] force: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] upd: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] accum: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] reverse: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] backpermute: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] map: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] imap: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] concatMap: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] mapM: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] mapM_: OK (0.02s)
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] forM: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] forM_: OK (0.02s)
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] imapM: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] imapM_: OK (0.02s)
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] zipWith: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] zipWith3: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] izipWith: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] izipWith3: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] izipWithM: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] izipWithM_: OK (0.01s)
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] zipWithM: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] zipWithM_: OK (0.01s)
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] filter: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] ifilter: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] filterM: OK (0.03s)
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] uniq: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] mapMaybe: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] imapMaybe: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] takeWhile: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] dropWhile: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] partition: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] partitionWith: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] span: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] break: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] spanR: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] breakR: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] groupBy: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] elem: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] notElem: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] find: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] findIndex: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] findIndexR: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] findIndices: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] elemIndex: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] elemIndices: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] foldl: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] foldl1: OK
1415.74 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.74 s
[vector] foldl': OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] foldl1': OK
1415.74 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.74 s
[vector] foldr: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] foldr1: OK
1415.74 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.74 s
[vector] foldr': OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] foldr1': OK
1415.74 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.74 s
[vector] ifoldl: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] ifoldl': OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] ifoldr: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] ifoldr': OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] ifoldM: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] ifoldM': OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] ifoldM_: OK (0.02s)
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] ifoldM'_: OK (0.02s)
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] all: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] any: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] prescanl: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] prescanl': OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] postscanl: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] postscanl': OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] scanl: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] scanl': OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] scanl1: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] scanl1': OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] iscanl: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] iscanl': OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.74 s
[vector] prescanr: OK
1415.74 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] prescanr': OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] postscanr: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] postscanr': OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] scanr: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] scanr': OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] scanr1: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] scanr1': OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] iscanr: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] iscanr': OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_read: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.75 s
[vector] mut_write: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.75 s
[vector] mut_modify: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.75 s
[vector] mut_generate: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_generateM: OK (0.01s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_mapM_: OK (0.02s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_imapM_: OK (0.02s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_forM_: OK (0.02s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_iforM_: OK (0.02s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_foldr: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_foldr': OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_foldl: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_foldl': OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_ifoldr: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_ifoldr': OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_ifoldl: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_ifoldl': OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_foldM: OK (0.01s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_foldM': OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_foldrM: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_foldrM': OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_ifoldM: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_ifoldM': OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_ifoldrM: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mut_ifoldrM': OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] compare: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] maximum: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.75 s
[vector] minimum: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.75 s
[vector] minIndex: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.75 s
[vector] maxIndex: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.75 s
[vector] maximumBy: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.75 s
[vector] minimumBy: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.75 s
[vector] maximumOn: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.75 s
[vector] minimumOn: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.75 s
[vector] maxIndexBy: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.75 s
[vector] minIndexBy: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.75 s
[vector] ListFirstMaxIndexWins: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.75 s
[vector] FalseListFirstMaxIndexWins: OK
1415.75 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.75 s
[vector] Exception:
1415.75 s
[vector] Prelude.foldr1: empty list
1415.75 s
[vector] CallStack (from HasCallStack):
1415.75 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.75 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.75 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.75 s
[vector] []
1415.75 s
[vector] mempty: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mappend: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] mconcat: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] glength: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] sum: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] product: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] enumFromN: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] enumFromThenN: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] enumFromTo: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] enumFromThenTo: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 10 discarded.
1415.75 s
[vector] Data.Vector.Storable.Vector (Double)
1415.75 s
[vector] fromList.toList == id: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] toList.fromList == id: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] unstream.stream == id: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] stream.unstream == id: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] eq: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] length: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] null: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] index: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.75 s
[vector] safeIndex: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] head: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.75 s
[vector] last: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.75 s
[vector] unsafeIndex: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.75 s
[vector] unsafeHead: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.75 s
[vector] unsafeLast: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.75 s
[vector] slice: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] init: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.75 s
[vector] tail: OK
1415.75 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.75 s
[vector] take: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] drop: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] splitAt: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] empty: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] singleton: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] replicate: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] generate: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] iterateN: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] iterateNM: OK (0.05s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] generateM: OK (0.02s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] replicateM: OK (0.01s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] create: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] createT: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] unfoldr: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] unfoldrN: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] unfoldrExactN: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] unfoldrM: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] unfoldrNM: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] unfoldrExactNM: OK (0.08s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] constructN: OK (0.02s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] constructrN: OK (0.01s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] cons: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] snoc: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] append: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] concat: OK (0.02s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] force: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] upd: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] accum: OK (0.02s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] reverse: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] backpermute: OK
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] map: OK (0.01s)
1415.75 s
[vector] +++ OK, passed 100 tests.
1415.75 s
[vector] imap: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] concatMap: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] mapM: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] mapM_: OK (0.05s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] forM: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] forM_: OK (0.07s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] imapM: OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] imapM_: OK (0.06s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] zipWith: OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] zipWith3: OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] izipWith: OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] izipWith3: OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] izipWithM: OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] izipWithM_: OK (0.04s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] zipWithM: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] zipWithM_: OK (0.05s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] filter: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] ifilter: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] filterM: OK (0.07s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] uniq: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] mapMaybe: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] imapMaybe: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] takeWhile: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] dropWhile: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] partition: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] partitionWith: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] span: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] break: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] spanR: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] breakR: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] groupBy: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] elem: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] notElem: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] find: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] findIndex: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] findIndexR: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] findIndices: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] elemIndex: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] elemIndices: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] foldl: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] foldl1: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.76 s
[vector] foldl': OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] foldl1': OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.76 s
[vector] foldr: OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] foldr1: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.76 s
[vector] foldr': OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] foldr1': OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.76 s
[vector] ifoldl: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] ifoldl': OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] ifoldr: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] ifoldr': OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] ifoldM: OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] ifoldM': OK (0.03s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] ifoldM_: OK (0.05s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] ifoldM'_: OK (0.04s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] all: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] any: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] prescanl: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] prescanl': OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] postscanl: OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] postscanl': OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] scanl: OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] scanl': OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] scanl1: OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] scanl1': OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] iscanl: OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] iscanl': OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] prescanr: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] prescanr': OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] postscanr: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] postscanr': OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] scanr: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] scanr': OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] scanr1: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] scanr1': OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] iscanr: OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] iscanr': OK (0.01s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] mut_read: OK
1415.76 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.76 s
[vector] mut_write: OK
1415.76 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.76 s
[vector] mut_modify: OK
1415.76 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.76 s
[vector] mut_generate: OK
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] mut_generateM: OK (0.02s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] mut_mapM_: OK (0.04s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] mut_imapM_: OK (0.04s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] mut_forM_: OK (0.04s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] mut_iforM_: OK (0.03s)
1415.76 s
[vector] +++ OK, passed 100 tests.
1415.76 s
[vector] mut_foldr: OK (0.01s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_foldr': OK (0.01s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_foldl: OK (0.01s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_foldl': OK (0.01s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_ifoldr: OK (0.01s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_ifoldr': OK (0.02s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_ifoldl: OK (0.01s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_ifoldl': OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_foldM: OK (0.01s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_foldM': OK (0.01s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_foldrM: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_foldrM': OK (0.01s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_ifoldM: OK (0.02s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_ifoldM': OK (0.02s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_ifoldrM: OK (0.01s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mut_ifoldrM': OK (0.03s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] compare: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] maximum: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.77 s
[vector] minimum: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.77 s
[vector] minIndex: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.77 s
[vector] maxIndex: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.77 s
[vector] maximumBy: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.77 s
[vector] minimumBy: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.77 s
[vector] maximumOn: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.77 s
[vector] minimumOn: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.77 s
[vector] maxIndexBy: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.77 s
[vector] minIndexBy: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.77 s
[vector] ListFirstMaxIndexWins: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.77 s
[vector] FalseListFirstMaxIndexWins: OK
1415.77 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.77 s
[vector] Exception:
1415.77 s
[vector] Prelude.foldr1: empty list
1415.77 s
[vector] CallStack (from HasCallStack):
1415.77 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.77 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.77 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.77 s
[vector] []
1415.77 s
[vector] mempty: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mappend: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] mconcat: OK (0.02s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] glength: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] sum: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] product: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] enumFromN: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] enumFromThenN: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] enumFromTo: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] enumFromThenTo: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] unstream
1415.77 s
[vector] unstream == vunstream (exact): OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] unstream == vunstream (unknown): OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] unstreamR ~= vunstream (exact): OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] unstreamR ~= vunstream (unknown): OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] Tests.Vector.Strict
1415.77 s
[vector] Bool
1415.77 s
[vector] fromList.toList == id: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] toList.fromList == id: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] unstream.stream == id: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] stream.unstream == id: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] eq: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] length: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] null: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] index: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.77 s
[vector] safeIndex: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] head: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.77 s
[vector] last: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.77 s
[vector] unsafeIndex: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.77 s
[vector] unsafeHead: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.77 s
[vector] unsafeLast: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 25 discarded.
1415.77 s
[vector] slice: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] init: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.77 s
[vector] tail: OK
1415.77 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.77 s
[vector] take: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] drop: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] splitAt: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] empty: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] singleton: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] replicate: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] generate: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] iterateN: OK
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] iterateNM: OK (0.02s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.77 s
[vector] generateM: OK (0.03s)
1415.77 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] replicateM: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] create: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] createT: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] unfoldr: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] unfoldrN: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] unfoldrExactN: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] unfoldrM: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] unfoldrNM: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] unfoldrExactNM: OK (0.05s)
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] constructN: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] constructrN: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] cons: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] snoc: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] append: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] concat: OK (0.01s)
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] force: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] upd: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] accum: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] reverse: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] backpermute: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] map: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] imap: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] concatMap: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] mapM: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] mapM_: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] forM: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] forM_: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] imapM: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] imapM_: OK (0.01s)
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] zipWith: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] zipWith3: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] izipWith: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] izipWith3: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] izipWithM: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] izipWithM_: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] zipWithM: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] zipWithM_: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] filter: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] ifilter: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] filterM: OK (0.01s)
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] uniq: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] mapMaybe: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] imapMaybe: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] takeWhile: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] dropWhile: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] partition: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] partitionWith: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] span: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] break: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] spanR: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] breakR: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] groupBy: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] elem: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] notElem: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] find: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] findIndex: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] findIndexR: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] findIndices: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] elemIndex: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] elemIndices: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] foldl: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] foldl1: OK
1415.78 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.78 s
[vector] foldl': OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] foldl1': OK
1415.78 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.78 s
[vector] foldr: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] foldr1: OK
1415.78 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.78 s
[vector] foldr': OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] foldr1': OK
1415.78 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.78 s
[vector] ifoldl: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] ifoldl': OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] ifoldr: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] ifoldr': OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] ifoldM: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] ifoldM': OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] ifoldM_: OK (0.01s)
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] ifoldM'_: OK (0.01s)
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] all: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] any: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] prescanl: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] prescanl': OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] postscanl: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] postscanl': OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] scanl: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] scanl': OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] scanl1: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] scanl1': OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] iscanl: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] iscanl': OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] prescanr: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] prescanr': OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] postscanr: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] postscanr': OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] scanr: OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.78 s
[vector] scanr': OK
1415.78 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] scanr1: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] scanr1': OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] iscanr: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] iscanr': OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_read: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.79 s
[vector] mut_write: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.79 s
[vector] mut_modify: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.79 s
[vector] mut_generate: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_generateM: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_mapM_: OK (0.01s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_imapM_: OK (0.01s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_forM_: OK (0.01s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_iforM_: OK (0.01s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_foldr: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_foldr': OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_foldl: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_foldl': OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_ifoldr: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_ifoldr': OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_ifoldl: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_ifoldl': OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_foldM: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_foldM': OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_foldrM: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_foldrM': OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_ifoldM: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_ifoldM': OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_ifoldrM: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mut_ifoldrM': OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] compare: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] maximum: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.79 s
[vector] minimum: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.79 s
[vector] minIndex: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.79 s
[vector] maxIndex: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.79 s
[vector] maximumBy: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.79 s
[vector] minimumBy: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.79 s
[vector] maximumOn: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.79 s
[vector] minimumOn: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.79 s
[vector] maxIndexBy: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.79 s
[vector] minIndexBy: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1415.79 s
[vector] ListFirstMaxIndexWins: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.79 s
[vector] FalseListFirstMaxIndexWins: OK
1415.79 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.79 s
[vector] Exception:
1415.79 s
[vector] Prelude.foldr1: empty list
1415.79 s
[vector] CallStack (from HasCallStack):
1415.79 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.79 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.79 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.79 s
[vector] []
1415.79 s
[vector] zip: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] zip3: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] unzip: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] unzip3: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] indexed: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] update: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] concat: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mempty: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mappend: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mconcat: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] fmap: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] return: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] bind: OK (0.01s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mzip: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] munzip: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] applicative_pure: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] applicative_appl: OK (0.02s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] alternative_empty: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] alternative_or: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] sequence: OK (0.02s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] sequence_: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] glength: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] and: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] or: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] Int
1415.79 s
[vector] fromList.toList == id: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] toList.fromList == id: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] unstream.stream == id: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] stream.unstream == id: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] eq: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] length: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] null: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] index: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.79 s
[vector] safeIndex: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] head: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.79 s
[vector] last: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.79 s
[vector] unsafeIndex: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 26 discarded.
1415.79 s
[vector] unsafeHead: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.79 s
[vector] unsafeLast: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.79 s
[vector] slice: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] init: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.79 s
[vector] tail: OK
1415.79 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.79 s
[vector] take: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] drop: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] splitAt: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] empty: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] singleton: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] replicate: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] generate: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] iterateN: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] iterateNM: OK (0.03s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] generateM: OK (0.02s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] replicateM: OK (0.03s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] create: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] createT: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] unfoldr: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] unfoldrN: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] unfoldrExactN: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] unfoldrM: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] unfoldrNM: OK (0.02s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] unfoldrExactNM: OK (0.04s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] constructN: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] constructrN: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] cons: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] snoc: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] append: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] concat: OK (0.01s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] force: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] upd: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] accum: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] reverse: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] backpermute: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] map: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] imap: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] concatMap: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mapM: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] mapM_: OK (0.02s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] forM: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] forM_: OK (0.02s)
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] imapM: OK
1415.79 s
[vector] +++ OK, passed 100 tests.
1415.79 s
[vector] imapM_: OK (0.02s)
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] zipWith: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] zipWith3: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] izipWith: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] izipWith3: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] izipWithM: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] izipWithM_: OK (0.01s)
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] zipWithM: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] zipWithM_: OK (0.02s)
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] filter: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] ifilter: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] filterM: OK (0.02s)
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] uniq: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] mapMaybe: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] imapMaybe: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] takeWhile: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] dropWhile: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] partition: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] partitionWith: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] span: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] break: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] spanR: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] breakR: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] groupBy: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] elem: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] notElem: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] find: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] findIndex: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] findIndexR: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] findIndices: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] elemIndex: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] elemIndices: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] foldl: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] foldl1: OK
1415.80 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1415.80 s
[vector] foldl': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] foldl1': OK
1415.80 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.80 s
[vector] foldr: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] foldr1: OK
1415.80 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.80 s
[vector] foldr': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] foldr1': OK
1415.80 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.80 s
[vector] ifoldl: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] ifoldl': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] ifoldr: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] ifoldr': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] ifoldM: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] ifoldM': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] ifoldM_: OK (0.02s)
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] ifoldM'_: OK (0.02s)
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] all: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] any: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] prescanl: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] prescanl': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] postscanl: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] postscanl': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] scanl: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] scanl': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] scanl1: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] scanl1': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] iscanl: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] iscanl': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] prescanr: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] prescanr': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] postscanr: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] postscanr': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] scanr: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] scanr': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] scanr1: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] scanr1': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] iscanr: OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] iscanr': OK
1415.80 s
[vector] +++ OK, passed 100 tests.
1415.80 s
[vector] mut_read: OK
1415.80 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.81 s
[vector] mut_write: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.81 s
[vector] mut_modify: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.81 s
[vector] mut_generate: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_generateM: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_mapM_: OK (0.02s)
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_imapM_: OK (0.02s)
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_forM_: OK (0.02s)
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_iforM_: OK (0.02s)
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_foldr: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_foldr': OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_foldl: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_foldl': OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_ifoldr: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_ifoldr': OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_ifoldl: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_ifoldl': OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_foldM: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_foldM': OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_foldrM: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_foldrM': OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_ifoldM: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_ifoldM': OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_ifoldrM: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mut_ifoldrM': OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] compare: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] maximum: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.81 s
[vector] minimum: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.81 s
[vector] minIndex: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.81 s
[vector] maxIndex: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.81 s
[vector] maximumBy: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1415.81 s
[vector] minimumBy: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.81 s
[vector] maximumOn: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.81 s
[vector] minimumOn: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.81 s
[vector] maxIndexBy: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.81 s
[vector] minIndexBy: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.81 s
[vector] ListFirstMaxIndexWins: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.81 s
[vector] FalseListFirstMaxIndexWins: OK
1415.81 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.81 s
[vector] Exception:
1415.81 s
[vector] Prelude.foldr1: empty list
1415.81 s
[vector] CallStack (from HasCallStack):
1415.81 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.81 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.81 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.81 s
[vector] []
1415.81 s
[vector] zip: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] zip3: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] unzip: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] unzip3: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] indexed: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] update: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] concat: OK (0.01s)
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mempty: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mappend: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mconcat: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] fmap: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] return: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] bind: OK (0.02s)
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] mzip: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] munzip: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] applicative_pure: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] applicative_appl: OK (0.04s)
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] alternative_empty: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] alternative_or: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] sequence: OK (0.04s)
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] sequence_: OK (0.01s)
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] glength: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] sum: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] product: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] enumFromN: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] enumFromThenN: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] enumFromTo: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] enumFromThenTo: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.81 s
[vector] unstream
1415.81 s
[vector] unstream == vunstream (exact): OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] unstream == vunstream (unknown): OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] unstreamR ~= vunstream (exact): OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] unstreamR ~= vunstream (unknown): OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] Tests.Vector.Unboxed
1415.81 s
[vector] ()
1415.81 s
[vector] fromList.toList == id: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] toList.fromList == id: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] unstream.stream == id: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] stream.unstream == id: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] eq: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] length: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] null: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] index: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1415.81 s
[vector] safeIndex: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] head: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.81 s
[vector] last: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.81 s
[vector] unsafeIndex: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.81 s
[vector] unsafeHead: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.81 s
[vector] unsafeLast: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.81 s
[vector] slice: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] init: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.81 s
[vector] tail: OK
1415.81 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.81 s
[vector] take: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] drop: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] splitAt: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] empty: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] singleton: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] replicate: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] generate: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] iterateN: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] iterateNM: OK (0.04s)
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] generateM: OK (0.03s)
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] replicateM: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] create: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] createT: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] unfoldr: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] unfoldrN: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] unfoldrExactN: OK
1415.81 s
[vector] +++ OK, passed 100 tests.
1415.81 s
[vector] unfoldrM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] unfoldrNM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] unfoldrExactNM: OK (0.04s)
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] constructN: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] constructrN: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] cons: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] snoc: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] append: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] concat: OK (0.01s)
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] force: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] upd: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] accum: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] reverse: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] backpermute: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] map: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] imap: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] concatMap: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mapM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mapM_: OK (0.01s)
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] forM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] forM_: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] imapM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] imapM_: OK (0.01s)
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] zipWith: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] zipWith3: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] izipWith: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] izipWith3: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] izipWithM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] izipWithM_: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] zipWithM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] zipWithM_: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] filter: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] ifilter: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] filterM: OK (0.02s)
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] uniq: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mapMaybe: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] imapMaybe: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] takeWhile: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] dropWhile: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] partition: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] partitionWith: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] span: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] break: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] spanR: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] breakR: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] groupBy: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] elem: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] notElem: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] find: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] findIndex: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] findIndexR: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] findIndices: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] elemIndex: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] elemIndices: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] foldl: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] foldl1: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.82 s
[vector] foldl': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] foldl1': OK
1415.82 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.82 s
[vector] foldr: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] foldr1: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.82 s
[vector] foldr': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] foldr1': OK
1415.82 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.82 s
[vector] ifoldl: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] ifoldl': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] ifoldr: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] ifoldr': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] ifoldM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] ifoldM': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] ifoldM_: OK (0.01s)
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] ifoldM'_: OK (0.01s)
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] all: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] any: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] prescanl: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] prescanl': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] postscanl: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] postscanl': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] scanl: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] scanl': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] scanl1: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] scanl1': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] iscanl: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] iscanl': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] prescanr: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] prescanr': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] postscanr: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] postscanr': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] scanr: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] scanr': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] scanr1: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] scanr1': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] iscanr: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] iscanr': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_read: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.82 s
[vector] mut_write: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.82 s
[vector] mut_modify: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.82 s
[vector] mut_generate: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_generateM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_mapM_: OK (0.01s)
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_imapM_: OK (0.01s)
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_forM_: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_iforM_: OK (0.01s)
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_foldr: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_foldr': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_foldl: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_foldl': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_ifoldr: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_ifoldr': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_ifoldl: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_ifoldl': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_foldM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_foldM': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_foldrM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_foldrM': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_ifoldM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_ifoldM': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_ifoldrM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mut_ifoldrM': OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] compare: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] maximum: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.82 s
[vector] minimum: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 26 discarded.
1415.82 s
[vector] minIndex: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1415.82 s
[vector] maxIndex: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.82 s
[vector] maximumBy: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.82 s
[vector] minimumBy: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.82 s
[vector] maximumOn: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.82 s
[vector] minimumOn: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.82 s
[vector] maxIndexBy: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.82 s
[vector] minIndexBy: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.82 s
[vector] ListFirstMaxIndexWins: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.82 s
[vector] FalseListFirstMaxIndexWins: OK
1415.82 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.82 s
[vector] Exception:
1415.82 s
[vector] Prelude.foldr1: empty list
1415.82 s
[vector] CallStack (from HasCallStack):
1415.82 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.82 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.82 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.82 s
[vector] []
1415.82 s
[vector] zip: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] zip3: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] unzip: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] unzip3: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] indexed: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] update: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mempty: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mappend: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] mconcat: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] glength: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] (Bool)
1415.82 s
[vector] fromList.toList == id: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] toList.fromList == id: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] unstream.stream == id: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] stream.unstream == id: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] eq: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] length: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] null: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] index: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.82 s
[vector] safeIndex: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] head: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.82 s
[vector] last: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.82 s
[vector] unsafeIndex: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.82 s
[vector] unsafeHead: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.82 s
[vector] unsafeLast: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.82 s
[vector] slice: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] init: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.82 s
[vector] tail: OK
1415.82 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1415.82 s
[vector] take: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] drop: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] splitAt: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] empty: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] singleton: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] replicate: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] generate: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] iterateN: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] iterateNM: OK (0.05s)
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] generateM: OK (0.01s)
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] replicateM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] create: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] createT: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] unfoldr: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] unfoldrN: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] unfoldrExactN: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] unfoldrM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] unfoldrNM: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] unfoldrExactNM: OK (0.04s)
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.82 s
[vector] constructN: OK
1415.82 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] constructrN: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] cons: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] snoc: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] append: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] concat: OK (0.01s)
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] force: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] upd: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] accum: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] reverse: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] backpermute: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] map: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] imap: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] concatMap: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mapM: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mapM_: OK (0.01s)
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] forM: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] forM_: OK (0.01s)
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] imapM: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] imapM_: OK (0.01s)
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] zipWith: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] zipWith3: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] izipWith: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] izipWith3: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] izipWithM: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] izipWithM_: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] zipWithM: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] zipWithM_: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] filter: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] ifilter: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] filterM: OK (0.03s)
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] uniq: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mapMaybe: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] imapMaybe: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] takeWhile: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] dropWhile: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] partition: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] partitionWith: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] span: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] break: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] spanR: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] breakR: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] groupBy: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] elem: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] notElem: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] find: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] findIndex: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] findIndexR: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] findIndices: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] elemIndex: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] elemIndices: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] foldl: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] foldl1: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.83 s
[vector] foldl': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] foldl1': OK
1415.83 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.83 s
[vector] foldr: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] foldr1: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.83 s
[vector] foldr': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] foldr1': OK
1415.83 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.83 s
[vector] ifoldl: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] ifoldl': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] ifoldr: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] ifoldr': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] ifoldM: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] ifoldM': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] ifoldM_: OK (0.01s)
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] ifoldM'_: OK (0.01s)
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] all: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] any: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] prescanl: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] prescanl': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] postscanl: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] postscanl': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] scanl: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] scanl': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] scanl1: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] scanl1': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] iscanl: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] iscanl': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] prescanr: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] prescanr': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] postscanr: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] postscanr': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] scanr: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] scanr': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] scanr1: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] scanr1': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] iscanr: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] iscanr': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_read: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.83 s
[vector] mut_write: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.83 s
[vector] mut_modify: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.83 s
[vector] mut_generate: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_generateM: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_mapM_: OK (0.01s)
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_imapM_: OK (0.01s)
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_forM_: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_iforM_: OK (0.01s)
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_foldr: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_foldr': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_foldl: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_foldl': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_ifoldr: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_ifoldr': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_ifoldl: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_ifoldl': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_foldM: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_foldM': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_foldrM: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_foldrM': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_ifoldM: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_ifoldM': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_ifoldrM: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mut_ifoldrM': OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] compare: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] maximum: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.83 s
[vector] minimum: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.83 s
[vector] minIndex: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.83 s
[vector] maxIndex: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.83 s
[vector] maximumBy: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.83 s
[vector] minimumBy: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.83 s
[vector] maximumOn: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1415.83 s
[vector] minimumOn: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.83 s
[vector] maxIndexBy: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.83 s
[vector] minIndexBy: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1415.83 s
[vector] ListFirstMaxIndexWins: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.83 s
[vector] FalseListFirstMaxIndexWins: OK
1415.83 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.83 s
[vector] Exception:
1415.83 s
[vector] Prelude.foldr1: empty list
1415.83 s
[vector] CallStack (from HasCallStack):
1415.83 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.83 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.83 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.83 s
[vector] []
1415.83 s
[vector] zip: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] zip3: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] unzip: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] unzip3: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] indexed: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] update: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mempty: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mappend: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] mconcat: OK (0.02s)
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] glength: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] and: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] or: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] (Int)
1415.83 s
[vector] fromList.toList == id: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] toList.fromList == id: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] unstream.stream == id: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] stream.unstream == id: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] eq: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] length: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] null: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] index: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.83 s
[vector] safeIndex: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] head: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.83 s
[vector] last: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.83 s
[vector] unsafeIndex: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1415.83 s
[vector] unsafeHead: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.83 s
[vector] unsafeLast: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.83 s
[vector] slice: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] init: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.83 s
[vector] tail: OK
1415.83 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1415.83 s
[vector] take: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] drop: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] splitAt: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] empty: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] singleton: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] replicate: OK
1415.83 s
[vector] +++ OK, passed 100 tests.
1415.83 s
[vector] generate: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] iterateN: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] iterateNM: OK (0.03s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] generateM: OK (0.02s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] replicateM: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] create: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] createT: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] unfoldr: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] unfoldrN: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] unfoldrExactN: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] unfoldrM: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] unfoldrNM: OK (0.02s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] unfoldrExactNM: OK (0.02s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] constructN: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] constructrN: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] cons: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] snoc: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] append: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] concat: OK (0.02s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] force: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] upd: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] accum: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] reverse: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] backpermute: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] map: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] imap: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] concatMap: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mapM: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mapM_: OK (0.03s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] forM: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] forM_: OK (0.02s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] imapM: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] imapM_: OK (0.02s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] zipWith: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] zipWith3: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] izipWith: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] izipWith3: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] izipWithM: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] izipWithM_: OK (0.01s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] zipWithM: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] zipWithM_: OK (0.01s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] filter: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] ifilter: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] filterM: OK (0.03s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] uniq: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mapMaybe: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] imapMaybe: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] takeWhile: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] dropWhile: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] partition: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] partitionWith: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] span: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] break: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] spanR: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] breakR: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] groupBy: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] elem: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] notElem: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] find: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] findIndex: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] findIndexR: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] findIndices: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] elemIndex: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] elemIndices: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] foldl: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] foldl1: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.84 s
[vector] foldl': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] foldl1': OK
1415.84 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.84 s
[vector] foldr: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] foldr1: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.84 s
[vector] foldr': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] foldr1': OK
1415.84 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.84 s
[vector] ifoldl: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] ifoldl': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] ifoldr: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] ifoldr': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] ifoldM: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] ifoldM': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] ifoldM_: OK (0.02s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] ifoldM'_: OK (0.02s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] all: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] any: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] prescanl: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] prescanl': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] postscanl: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] postscanl': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] scanl: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] scanl': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] scanl1: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] scanl1': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] iscanl: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] iscanl': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] prescanr: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] prescanr': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] postscanr: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] postscanr': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] scanr: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] scanr': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] scanr1: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] scanr1': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] iscanr: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] iscanr': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_read: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.84 s
[vector] mut_write: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.84 s
[vector] mut_modify: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.84 s
[vector] mut_generate: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_generateM: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_mapM_: OK (0.02s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_imapM_: OK (0.02s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_forM_: OK (0.02s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_iforM_: OK (0.02s)
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_foldr: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_foldr': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_foldl: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_foldl': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_ifoldr: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_ifoldr': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_ifoldl: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_ifoldl': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_foldM: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_foldM': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_foldrM: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_foldrM': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_ifoldM: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_ifoldM': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_ifoldrM: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] mut_ifoldrM': OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] compare: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] maximum: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1415.84 s
[vector] minimum: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.84 s
[vector] minIndex: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.84 s
[vector] maxIndex: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.84 s
[vector] maximumBy: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.84 s
[vector] minimumBy: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.84 s
[vector] maximumOn: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.84 s
[vector] minimumOn: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.84 s
[vector] maxIndexBy: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.84 s
[vector] minIndexBy: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.84 s
[vector] ListFirstMaxIndexWins: OK
1415.84 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.84 s
[vector] FalseListFirstMaxIndexWins: OK
1415.84 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.84 s
[vector] Exception:
1415.84 s
[vector] Prelude.foldr1: empty list
1415.84 s
[vector] CallStack (from HasCallStack):
1415.84 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.84 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.84 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.84 s
[vector] []
1415.84 s
[vector] zip: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] zip3: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] unzip: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] unzip3: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.84 s
[vector] indexed: OK
1415.84 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] update: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] mempty: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] mappend: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] mconcat: OK (0.02s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] glength: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] sum: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] product: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] enumFromN: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] enumFromThenN: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] enumFromTo: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] enumFromThenTo: OK
1415.85 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.85 s
[vector] (Float)
1415.85 s
[vector] fromList.toList == id: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] toList.fromList == id: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] unstream.stream == id: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] stream.unstream == id: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] eq: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] length: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] null: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] index: OK
1415.85 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.85 s
[vector] safeIndex: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] head: OK
1415.85 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.85 s
[vector] last: OK
1415.85 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.85 s
[vector] unsafeIndex: OK
1415.85 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.85 s
[vector] unsafeHead: OK
1415.85 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.85 s
[vector] unsafeLast: OK
1415.85 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.85 s
[vector] slice: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] init: OK
1415.85 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.85 s
[vector] tail: OK
1415.85 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1415.85 s
[vector] take: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] drop: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] splitAt: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] empty: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] singleton: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] replicate: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] generate: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] iterateN: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] iterateNM: OK (0.02s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] generateM: OK (0.02s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] replicateM: OK (0.01s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] create: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] createT: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] unfoldr: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] unfoldrN: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] unfoldrExactN: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] unfoldrM: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] unfoldrNM: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] unfoldrExactNM: OK (0.03s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] constructN: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] constructrN: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] cons: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] snoc: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] append: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] concat: OK (0.02s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] force: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] upd: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] accum: OK (0.01s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] reverse: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] backpermute: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] map: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] imap: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] concatMap: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] mapM: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] mapM_: OK (0.03s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] forM: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] forM_: OK (0.04s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] imapM: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] imapM_: OK (0.04s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] zipWith: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] zipWith3: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] izipWith: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] izipWith3: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] izipWithM: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] izipWithM_: OK (0.03s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] zipWithM: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] zipWithM_: OK (0.03s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] filter: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] ifilter: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] filterM: OK (0.04s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] uniq: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] mapMaybe: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] imapMaybe: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] takeWhile: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] dropWhile: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] partition: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] partitionWith: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] span: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] break: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] spanR: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] breakR: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] groupBy: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] elem: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] notElem: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] find: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] findIndex: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] findIndexR: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] findIndices: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] elemIndex: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] elemIndices: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] foldl: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] foldl1: OK
1415.85 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.85 s
[vector] foldl': OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] foldl1': OK
1415.85 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.85 s
[vector] foldr: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] foldr1: OK
1415.85 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.85 s
[vector] foldr': OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] foldr1': OK
1415.85 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.85 s
[vector] ifoldl: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] ifoldl': OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] ifoldr: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] ifoldr': OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] ifoldM: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] ifoldM': OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] ifoldM_: OK (0.04s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] ifoldM'_: OK (0.03s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] all: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] any: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] prescanl: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] prescanl': OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] postscanl: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] postscanl': OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] scanl: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] scanl': OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] scanl1: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] scanl1': OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] iscanl: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] iscanl': OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] prescanr: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] prescanr': OK (0.01s)
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] postscanr: OK
1415.85 s
[vector] +++ OK, passed 100 tests.
1415.85 s
[vector] postscanr': OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] scanr: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] scanr': OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] scanr1: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] scanr1': OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] iscanr: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] iscanr': OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_read: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.86 s
[vector] mut_write: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.86 s
[vector] mut_modify: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.86 s
[vector] mut_generate: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_generateM: OK (0.02s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_mapM_: OK (0.03s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_imapM_: OK (0.03s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_forM_: OK (0.03s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_iforM_: OK (0.04s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_foldr: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_foldr': OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_foldl: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_foldl': OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_ifoldr: OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_ifoldr': OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_ifoldl: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_ifoldl': OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_foldM: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_foldM': OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_foldrM: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_foldrM': OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_ifoldM: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_ifoldM': OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_ifoldrM: OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mut_ifoldrM': OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] compare: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] maximum: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.86 s
[vector] minimum: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.86 s
[vector] minIndex: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.86 s
[vector] maxIndex: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.86 s
[vector] maximumBy: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.86 s
[vector] minimumBy: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 25 discarded.
1415.86 s
[vector] maximumOn: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.86 s
[vector] minimumOn: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1415.86 s
[vector] maxIndexBy: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.86 s
[vector] minIndexBy: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.86 s
[vector] ListFirstMaxIndexWins: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.86 s
[vector] FalseListFirstMaxIndexWins: OK
1415.86 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.86 s
[vector] Exception:
1415.86 s
[vector] Prelude.foldr1: empty list
1415.86 s
[vector] CallStack (from HasCallStack):
1415.86 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.86 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.86 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.86 s
[vector] []
1415.86 s
[vector] zip: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] zip3: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] unzip: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] unzip3: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] indexed: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] update: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mempty: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mappend: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mconcat: OK (0.02s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] glength: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] sum: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] product: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] enumFromN: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] enumFromThenN: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] enumFromTo: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] enumFromThenTo: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 2 discarded.
1415.86 s
[vector] (Double)
1415.86 s
[vector] fromList.toList == id: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] toList.fromList == id: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] unstream.stream == id: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] stream.unstream == id: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] eq: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] length: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] null: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] index: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.86 s
[vector] safeIndex: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] head: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.86 s
[vector] last: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.86 s
[vector] unsafeIndex: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.86 s
[vector] unsafeHead: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1415.86 s
[vector] unsafeLast: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.86 s
[vector] slice: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] init: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.86 s
[vector] tail: OK
1415.86 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.86 s
[vector] take: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] drop: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] splitAt: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] empty: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] singleton: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] replicate: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] generate: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] iterateN: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] iterateNM: OK (0.03s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] generateM: OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] replicateM: OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] create: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] createT: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] unfoldr: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] unfoldrN: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] unfoldrExactN: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] unfoldrM: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] unfoldrNM: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] unfoldrExactNM: OK (0.06s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] constructN: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] constructrN: OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] cons: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] snoc: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] append: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] concat: OK (0.03s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] force: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] upd: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] accum: OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] reverse: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] backpermute: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] map: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] imap: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] concatMap: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mapM: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mapM_: OK (0.04s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] forM: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] forM_: OK (0.04s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] imapM: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] imapM_: OK (0.03s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] zipWith: OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] zipWith3: OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] izipWith: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] izipWith3: OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] izipWithM: OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] izipWithM_: OK (0.03s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] zipWithM: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] zipWithM_: OK (0.03s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] filter: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] ifilter: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] filterM: OK (0.04s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] uniq: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] mapMaybe: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] imapMaybe: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] takeWhile: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] dropWhile: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] partition: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] partitionWith: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] span: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] break: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] spanR: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] breakR: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] groupBy: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] elem: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] notElem: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] find: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] findIndex: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] findIndexR: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] findIndices: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] elemIndex: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] elemIndices: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] foldl: OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] foldl1: OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.86 s
[vector] foldl': OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] foldl1': OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.86 s
[vector] foldr: OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] foldr1: OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.86 s
[vector] foldr': OK
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] foldr1': OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.86 s
[vector] ifoldl: OK (0.01s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] ifoldl': OK (0.02s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] ifoldr: OK (0.02s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] ifoldr': OK (0.02s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] ifoldM: OK (0.02s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] ifoldM': OK (0.02s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.86 s
[vector] ifoldM_: OK (0.04s)
1415.86 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] ifoldM'_: OK (0.05s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] all: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] any: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] prescanl: OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] prescanl': OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] postscanl: OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] postscanl': OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] scanl: OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] scanl': OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] scanl1: OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] scanl1': OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] iscanl: OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] iscanl': OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] prescanr: OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] prescanr': OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] postscanr: OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] postscanr': OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] scanr: OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] scanr': OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] scanr1: OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] scanr1': OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] iscanr: OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] iscanr': OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_read: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.87 s
[vector] mut_write: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.87 s
[vector] mut_modify: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.87 s
[vector] mut_generate: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_generateM: OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_mapM_: OK (0.04s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_imapM_: OK (0.04s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_forM_: OK (0.04s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_iforM_: OK (0.06s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_foldr: OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_foldr': OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_foldl: OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_foldl': OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_ifoldr: OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_ifoldr': OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_ifoldl: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_ifoldl': OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_foldM: OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_foldM': OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_foldrM: OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_foldrM': OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_ifoldM: OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_ifoldM': OK (0.03s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_ifoldrM: OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mut_ifoldrM': OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] compare: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] maximum: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.87 s
[vector] minimum: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.87 s
[vector] minIndex: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.87 s
[vector] maxIndex: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.87 s
[vector] maximumBy: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.87 s
[vector] minimumBy: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.87 s
[vector] maximumOn: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.87 s
[vector] minimumOn: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.87 s
[vector] maxIndexBy: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.87 s
[vector] minIndexBy: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.87 s
[vector] ListFirstMaxIndexWins: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.87 s
[vector] FalseListFirstMaxIndexWins: OK
1415.87 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.87 s
[vector] Exception:
1415.87 s
[vector] Prelude.foldr1: empty list
1415.87 s
[vector] CallStack (from HasCallStack):
1415.87 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.87 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.87 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.87 s
[vector] []
1415.87 s
[vector] zip: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] zip3: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] unzip: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] unzip3: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] indexed: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] update: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mempty: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mappend: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] mconcat: OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] glength: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] sum: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] product: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] enumFromN: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] enumFromThenN: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] enumFromTo: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] enumFromThenTo: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 3 discarded.
1415.87 s
[vector] (Int,Bool)
1415.87 s
[vector] fromList.toList == id: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] toList.fromList == id: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] unstream.stream == id: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] stream.unstream == id: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] eq: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] length: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] null: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] index: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.87 s
[vector] safeIndex: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] head: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.87 s
[vector] last: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.87 s
[vector] unsafeIndex: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.87 s
[vector] unsafeHead: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1415.87 s
[vector] unsafeLast: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.87 s
[vector] slice: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] init: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.87 s
[vector] tail: OK
1415.87 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.87 s
[vector] take: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] drop: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] splitAt: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] empty: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] singleton: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] replicate: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] generate: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] iterateN: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] iterateNM: OK (0.02s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] generateM: OK (0.05s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] replicateM: OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] create: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] createT: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] unfoldr: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] unfoldrN: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] unfoldrExactN: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] unfoldrM: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] unfoldrNM: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] unfoldrExactNM: OK (0.05s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] constructN: OK (0.01s)
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] constructrN: OK
1415.87 s
[vector] +++ OK, passed 100 tests.
1415.87 s
[vector] cons: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] snoc: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] append: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] concat: OK (0.04s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] force: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] upd: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] accum: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] reverse: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] backpermute: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] map: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] imap: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] concatMap: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mapM: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mapM_: OK (0.03s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] forM: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] forM_: OK (0.03s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] imapM: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] imapM_: OK (0.05s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] zipWith: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] zipWith3: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] izipWith: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] izipWith3: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] izipWithM: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] izipWithM_: OK (0.03s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] zipWithM: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] zipWithM_: OK (0.02s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] filter: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] ifilter: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] filterM: OK (0.04s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] uniq: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mapMaybe: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] imapMaybe: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] takeWhile: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] dropWhile: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] partition: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] partitionWith: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] span: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] break: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] spanR: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] breakR: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] groupBy: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] elem: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] notElem: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] find: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] findIndex: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] findIndexR: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] findIndices: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] elemIndex: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] elemIndices: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] foldl: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] foldl1: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1415.88 s
[vector] foldl': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] foldl1': OK
1415.88 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1415.88 s
[vector] foldr: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] foldr1: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.88 s
[vector] foldr': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] foldr1': OK
1415.88 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.88 s
[vector] ifoldl: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] ifoldl': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] ifoldr: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] ifoldr': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] ifoldM: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] ifoldM': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] ifoldM_: OK (0.03s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] ifoldM'_: OK (0.03s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] all: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] any: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] prescanl: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] prescanl': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] postscanl: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] postscanl': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] scanl: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] scanl': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] scanl1: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] scanl1': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] iscanl: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] iscanl': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] prescanr: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] prescanr': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] postscanr: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] postscanr': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] scanr: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] scanr': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] scanr1: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] scanr1': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] iscanr: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] iscanr': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_read: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.88 s
[vector] mut_write: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.88 s
[vector] mut_modify: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1415.88 s
[vector] mut_generate: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_generateM: OK (0.02s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_mapM_: OK (0.03s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_imapM_: OK (0.04s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_forM_: OK (0.03s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_iforM_: OK (0.03s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_foldr: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_foldr': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_foldl: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_foldl': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_ifoldr: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_ifoldr': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_ifoldl: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_ifoldl': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_foldM: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_foldM': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_foldrM: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_foldrM': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_ifoldM: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_ifoldM': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_ifoldrM: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mut_ifoldrM': OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] compare: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] maximum: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.88 s
[vector] minimum: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.88 s
[vector] minIndex: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.88 s
[vector] maxIndex: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.88 s
[vector] maximumBy: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.88 s
[vector] minimumBy: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.88 s
[vector] maximumOn: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 25 discarded.
1415.88 s
[vector] minimumOn: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.88 s
[vector] maxIndexBy: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.88 s
[vector] minIndexBy: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.88 s
[vector] ListFirstMaxIndexWins: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.88 s
[vector] FalseListFirstMaxIndexWins: OK
1415.88 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.88 s
[vector] Exception:
1415.88 s
[vector] Prelude.foldr1: empty list
1415.88 s
[vector] CallStack (from HasCallStack):
1415.88 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.88 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.88 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.88 s
[vector] []
1415.88 s
[vector] zip: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] zip3: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] unzip: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] unzip3: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] indexed: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] update: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mempty: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mappend: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] mconcat: OK (0.05s)
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] glength: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] (Int,Bool,Int)
1415.88 s
[vector] fromList.toList == id: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] toList.fromList == id: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] unstream.stream == id: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] stream.unstream == id: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] eq: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] length: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] null: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] index: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.88 s
[vector] safeIndex: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] head: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.88 s
[vector] last: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.88 s
[vector] unsafeIndex: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.88 s
[vector] unsafeHead: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1415.88 s
[vector] unsafeLast: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.88 s
[vector] slice: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] init: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.88 s
[vector] tail: OK
1415.88 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.88 s
[vector] take: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] drop: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.88 s
[vector] splitAt: OK
1415.88 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] empty: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] singleton: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] replicate: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] generate: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] iterateN: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] iterateNM: OK (0.02s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] generateM: OK (0.06s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] replicateM: OK (0.02s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] create: OK (0.02s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] createT: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] unfoldr: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] unfoldrN: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] unfoldrExactN: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] unfoldrM: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] unfoldrNM: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] unfoldrExactNM: OK (0.05s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] constructN: OK (0.01s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] constructrN: OK (0.01s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] cons: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] snoc: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] append: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] concat: OK (0.06s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] force: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] upd: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] accum: OK (0.01s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] reverse: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] backpermute: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] map: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] imap: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] concatMap: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mapM: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mapM_: OK (0.04s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] forM: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] forM_: OK (0.04s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] imapM: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] imapM_: OK (0.06s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] zipWith: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] zipWith3: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] izipWith: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] izipWith3: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] izipWithM: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] izipWithM_: OK (0.03s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] zipWithM: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] zipWithM_: OK (0.04s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] filter: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] ifilter: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] filterM: OK (0.06s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] uniq: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mapMaybe: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] imapMaybe: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] takeWhile: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] dropWhile: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] partition: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] partitionWith: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] span: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] break: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] spanR: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] breakR: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] groupBy: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] elem: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] notElem: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] find: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] findIndex: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] findIndexR: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] findIndices: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] elemIndex: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] elemIndices: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] foldl: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] foldl1: OK
1415.89 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.89 s
[vector] foldl': OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] foldl1': OK
1415.89 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.89 s
[vector] foldr: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] foldr1: OK
1415.89 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1415.89 s
[vector] foldr': OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] foldr1': OK
1415.89 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.89 s
[vector] ifoldl: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] ifoldl': OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] ifoldr: OK (0.01s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] ifoldr': OK (0.01s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] ifoldM: OK (0.01s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] ifoldM': OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] ifoldM_: OK (0.04s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] ifoldM'_: OK (0.04s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] all: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] any: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] prescanl: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] prescanl': OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] postscanl: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] postscanl': OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] scanl: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] scanl': OK (0.01s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] scanl1: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] scanl1': OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] iscanl: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] iscanl': OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] prescanr: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] prescanr': OK (0.02s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] postscanr: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] postscanr': OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] scanr: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] scanr': OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] scanr1: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] scanr1': OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] iscanr: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] iscanr': OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mut_read: OK
1415.89 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1415.89 s
[vector] mut_write: OK
1415.89 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.89 s
[vector] mut_modify: OK
1415.89 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.89 s
[vector] mut_generate: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mut_generateM: OK (0.02s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mut_mapM_: OK (0.04s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mut_imapM_: OK (0.05s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mut_forM_: OK (0.04s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mut_iforM_: OK (0.05s)
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mut_foldr: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mut_foldr': OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mut_foldl: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mut_foldl': OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mut_ifoldr: OK
1415.89 s
[vector] +++ OK, passed 100 tests.
1415.89 s
[vector] mut_ifoldr': OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] mut_ifoldl: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] mut_ifoldl': OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] mut_foldM: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] mut_foldM': OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] mut_foldrM: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] mut_foldrM': OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] mut_ifoldM: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] mut_ifoldM': OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] mut_ifoldrM: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] mut_ifoldrM': OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] compare: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] maximum: OK
1415.90 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1415.90 s
[vector] minimum: OK
1415.90 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.90 s
[vector] minIndex: OK
1415.90 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1415.90 s
[vector] maxIndex: OK
1415.90 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.90 s
[vector] maximumBy: OK
1415.90 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1415.90 s
[vector] minimumBy: OK
1415.90 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.90 s
[vector] maximumOn: OK
1415.90 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.90 s
[vector] minimumOn: OK
1415.90 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.90 s
[vector] maxIndexBy: OK
1415.90 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1415.90 s
[vector] minIndexBy: OK
1415.90 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.90 s
[vector] ListFirstMaxIndexWins: OK
1415.90 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1415.90 s
[vector] FalseListFirstMaxIndexWins: OK
1415.90 s
[vector] +++ OK, failed as expected. (after 1 test):
1415.90 s
[vector] Exception:
1415.90 s
[vector] Prelude.foldr1: empty list
1415.90 s
[vector] CallStack (from HasCallStack):
1415.90 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1415.90 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1415.90 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1415.90 s
[vector] []
1415.90 s
[vector] zip: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] zip3: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] unzip: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] unzip3: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] indexed: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] update: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] mempty: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] mappend: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] mconcat: OK (0.06s)
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] glength: OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] unstream
1415.90 s
[vector] unstream == vunstream (exact): OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] unstream == vunstream (unknown): OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] unstreamR ~= vunstream (exact): OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] unstreamR ~= vunstream (unknown): OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] Data.Vector.Storable.Vector Alignment
1415.90 s
[vector] Aligned Double: OK
1415.90 s
[vector] Aligned Int: OK
1415.90 s
[vector] Regression tests
1415.90 s
[vector] enumFromTo crash #188
1415.90 s
[vector] Word8: OK
1415.90 s
[vector] Word16: OK
1415.90 s
[vector] Word32: OK
1415.90 s
[vector] Word64: OK
1415.90 s
[vector] Word: OK
1415.90 s
[vector] Int8: OK
1415.90 s
[vector] Int16: OK
1415.90 s
[vector] Int32: OK
1415.90 s
[vector] Int64: OK
1415.90 s
[vector] Int: OK
1415.90 s
[vector] Char: OK
1415.90 s
[vector] Negative tests
1415.90 s
[vector] slice out of bounds #257
1415.90 s
[vector] Boxed
1415.90 s
[vector] Negative ix: OK
1415.90 s
[vector] Negative size: OK
1415.90 s
[vector] Negative ix and size: OK
1415.90 s
[vector] Too large ix: OK
1415.90 s
[vector] Too large size: OK
1415.90 s
[vector] Too large ix and size: OK
1415.90 s
[vector] Overflow: OK
1415.90 s
[vector] OutOfMemory: OK
1415.90 s
[vector] Primitive
1415.90 s
[vector] Negative ix: OK
1415.90 s
[vector] Negative size: OK
1415.90 s
[vector] Negative ix and size: OK
1415.90 s
[vector] Too large ix: OK
1415.90 s
[vector] Too large size: OK
1415.90 s
[vector] Too large ix and size: OK
1415.90 s
[vector] Overflow: OK
1415.90 s
[vector] OutOfMemory: OK
1415.90 s
[vector] Storable
1415.90 s
[vector] Negative ix: OK
1415.90 s
[vector] Negative size: OK
1415.90 s
[vector] Negative ix and size: OK
1415.90 s
[vector] Too large ix: OK
1415.90 s
[vector] Too large size: OK
1415.90 s
[vector] Too large ix and size: OK
1415.90 s
[vector] Overflow: OK
1415.90 s
[vector] OutOfMemory: OK
1415.90 s
[vector] Unboxed
1415.90 s
[vector] Negative ix: OK
1415.90 s
[vector] Negative size: OK
1415.90 s
[vector] Negative ix and size: OK
1415.90 s
[vector] Too large ix: OK
1415.90 s
[vector] Too large size: OK
1415.90 s
[vector] Too large ix and size: OK
1415.90 s
[vector] Overflow: OK
1415.90 s
[vector] OutOfMemory: OK
1415.90 s
[vector] take #282
1415.90 s
[vector] Boxed: OK
1415.90 s
[vector] Primitive: OK
1415.90 s
[vector] Storable: OK
1415.90 s
[vector] Unboxed: OK
1415.90 s
[vector] Data.Vector
1415.90 s
[vector] MonadFix: OK
1415.90 s
[vector] toFromArray: OK
1415.90 s
[vector] toFromArraySlice: OK
1415.90 s
[vector] toFromArraySliceUnsafe: OK
1415.90 s
[vector] toFromMutableArray: OK
1415.90 s
[vector] Data.Vector.Mutable (Move): OK
1415.90 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1415.90 s
[vector] Data.Vector.Primitive.Mutable (Move): OK
1415.90 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1415.90 s
[vector] Data.Vector.Unboxed.Mutable (Move): OK
1415.90 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1415.90 s
[vector] Data.Vector.Storable.Mutable (Move): OK
1415.90 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1415.90 s
[vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.01s)
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
1415.90 s
[vector] +++ OK, passed 100 tests.
1415.90 s
[vector]
1415.90 s
[vector] All 2808 tests passed (93.67s)
1415.90 s
[vector] Test suite vector-tests-O0: PASS
1415.90 s
[vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
1415.90 s
[vector] Test suite vector-tests-O2: RUNNING...
1416.05 s
[vector] toplevel
1416.05 s
[vector] Data.Vector.Fusion.Bundle
1416.05 s
[vector] fromList.toList == id: OK
1416.05 s
[vector] +++ OK, passed 100 tests.
1416.05 s
[vector] toList.fromList == id: OK
1416.05 s
[vector] +++ OK, passed 100 tests.
1416.05 s
[vector] eq: OK
1416.05 s
[vector] +++ OK, passed 100 tests.
1416.05 s
[vector] length: OK
1416.05 s
[vector] +++ OK, passed 100 tests.
1416.05 s
[vector] null: OK
1416.05 s
[vector] +++ OK, passed 100 tests.
1416.05 s
[vector] empty: OK
1416.05 s
[vector] +++ OK, passed 100 tests.
1416.05 s
[vector] singleton: OK
1416.05 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] replicate: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] cons: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] snoc: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] append: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] head: OK
1416.08 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1416.08 s
[vector] last: OK
1416.08 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1416.08 s
[vector] index: OK
1416.08 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1416.08 s
[vector] extract: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] init: OK
1416.08 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1416.08 s
[vector] tail: OK
1416.08 s
[vector] +++ OK, passed 100 tests; 34 discarded.
1416.08 s
[vector] take: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] drop: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] map: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] zipWith: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] zipWith3: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] filter: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] takeWhile: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] dropWhile: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] elem: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] notElem: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] find: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.08 s
[vector] findIndex: OK
1416.08 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] foldl: OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] foldl1: OK
1416.09 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1416.09 s
[vector] foldl': OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] foldl1': OK
1416.09 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1416.09 s
[vector] foldr: OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] foldr1: OK
1416.09 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1416.09 s
[vector] prescanl: OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] prescanl': OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] postscanl: OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] postscanl': OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] scanl: OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] scanl': OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] scanl1: OK
1416.09 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1416.09 s
[vector] scanl1': OK
1416.09 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1416.09 s
[vector] concatMap: OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] unfoldr: OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] and: OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] or: OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] Tests.Vector.Boxed
1416.09 s
[vector] Bool
1416.09 s
[vector] fromList.toList == id: OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] toList.fromList == id: OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.09 s
[vector] unstream.stream == id: OK
1416.09 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] stream.unstream == id: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] eq: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] length: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] null: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] index: OK
1416.10 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1416.10 s
[vector] safeIndex: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] head: OK
1416.10 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1416.10 s
[vector] last: OK
1416.10 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1416.10 s
[vector] unsafeIndex: OK
1416.10 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1416.10 s
[vector] unsafeHead: OK
1416.10 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1416.10 s
[vector] unsafeLast: OK
1416.10 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1416.10 s
[vector] slice: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] init: OK
1416.10 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1416.10 s
[vector] tail: OK
1416.10 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1416.10 s
[vector] take: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] drop: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] splitAt: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] empty: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] singleton: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] replicate: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] generate: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] iterateN: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] iterateNM: OK (0.02s)
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] generateM: OK (0.02s)
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] replicateM: OK (0.08s)
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] create: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.10 s
[vector] createT: OK
1416.10 s
[vector] +++ OK, passed 100 tests.
1416.11 s
[vector] unfoldr: OK
1416.11 s
[vector] +++ OK, passed 100 tests.
1416.11 s
[vector] unfoldrN: OK
1416.11 s
[vector] +++ OK, passed 100 tests.
1416.11 s
[vector] unfoldrExactN: OK
1416.11 s
[vector] +++ OK, passed 100 tests.
1416.11 s
[vector] unfoldrM: OK
1416.11 s
[vector] +++ OK, passed 100 tests.
1416.11 s
[vector] unfoldrNM: OK
1416.12 s
[vector] +++ OK, passed 100 tests.
1416.13 s
[vector] unfoldrExactNM: OK (0.02s)
1416.13 s
[vector] +++ OK, passed 100 tests.
1416.14 s
[vector] constructN: OK
1416.14 s
[vector] +++ OK, passed 100 tests.
1416.14 s
[vector] constructrN: OK
1416.14 s
[vector] +++ OK, passed 100 tests.
1416.14 s
[vector] cons: OK
1416.14 s
[vector] +++ OK, passed 100 tests.
1416.14 s
[vector] snoc: OK
1416.14 s
[vector] +++ OK, passed 100 tests.
1416.14 s
[vector] append: OK
1416.16 s
[vector] +++ OK, passed 100 tests.
1416.16 s
[vector] concat: OK (0.02s)
1416.16 s
[vector] +++ OK, passed 100 tests.
1416.16 s
[vector] force: OK
1416.16 s
[vector] +++ OK, passed 100 tests.
1416.17 s
[vector] upd: OK
1416.17 s
[vector] +++ OK, passed 100 tests.
1416.17 s
[vector] accum: OK
1416.17 s
[vector] +++ OK, passed 100 tests.
1416.17 s
[vector] reverse: OK
1416.17 s
[vector] +++ OK, passed 100 tests.
1416.17 s
[vector] backpermute: OK
1416.17 s
[vector] +++ OK, passed 100 tests.
1416.17 s
[vector] map: OK
1416.17 s
[vector] +++ OK, passed 100 tests.
1416.17 s
[vector] imap: OK
1416.17 s
[vector] +++ OK, passed 100 tests.
1416.18 s
[vector] concatMap: OK
1416.18 s
[vector] +++ OK, passed 100 tests.
1416.18 s
[vector] mapM: OK
1416.19 s
[vector] +++ OK, passed 100 tests.
1416.19 s
[vector] mapM_: OK (0.01s)
1416.20 s
[vector] +++ OK, passed 100 tests.
1416.20 s
[vector] forM: OK
1416.20 s
[vector] +++ OK, passed 100 tests.
1416.20 s
[vector] forM_: OK
1416.21 s
[vector] +++ OK, passed 100 tests.
1416.21 s
[vector] imapM: OK
1416.21 s
[vector] +++ OK, passed 100 tests.
1416.21 s
[vector] imapM_: OK (0.01s)
1416.21 s
[vector] +++ OK, passed 100 tests.
1416.21 s
[vector] zipWith: OK
1416.21 s
[vector] +++ OK, passed 100 tests.
1416.21 s
[vector] zipWith3: OK
1416.22 s
[vector] +++ OK, passed 100 tests.
1416.22 s
[vector] izipWith: OK
1416.22 s
[vector] +++ OK, passed 100 tests.
1416.22 s
[vector] izipWith3: OK
1416.22 s
[vector] +++ OK, passed 100 tests.
1416.22 s
[vector] izipWithM: OK
1416.23 s
[vector] +++ OK, passed 100 tests.
1416.23 s
[vector] izipWithM_: OK
1416.23 s
[vector] +++ OK, passed 100 tests.
1416.23 s
[vector] zipWithM: OK
1416.24 s
[vector] +++ OK, passed 100 tests.
1416.24 s
[vector] zipWithM_: OK
1416.24 s
[vector] +++ OK, passed 100 tests.
1416.24 s
[vector] filter: OK
1416.24 s
[vector] +++ OK, passed 100 tests.
1416.24 s
[vector] ifilter: OK
1416.24 s
[vector] +++ OK, passed 100 tests.
1416.25 s
[vector] filterM: OK (0.01s)
1416.25 s
[vector] +++ OK, passed 100 tests.
1416.25 s
[vector] uniq: OK
1416.25 s
[vector] +++ OK, passed 100 tests.
1416.25 s
[vector] mapMaybe: OK
1416.25 s
[vector] +++ OK, passed 100 tests.
1416.26 s
[vector] imapMaybe: OK
1416.26 s
[vector] +++ OK, passed 100 tests.
1416.26 s
[vector] takeWhile: OK
1416.26 s
[vector] +++ OK, passed 100 tests.
1416.26 s
[vector] dropWhile: OK
1416.26 s
[vector] +++ OK, passed 100 tests.
1416.26 s
[vector] partition: OK
1416.26 s
[vector] +++ OK, passed 100 tests.
1416.26 s
[vector] partitionWith: OK
1416.26 s
[vector] +++ OK, passed 100 tests.
1416.26 s
[vector] span: OK
1416.26 s
[vector] +++ OK, passed 100 tests.
1416.26 s
[vector] break: OK
1416.26 s
[vector] +++ OK, passed 100 tests.
1416.26 s
[vector] spanR: OK
1416.26 s
[vector] +++ OK, passed 100 tests.
1416.26 s
[vector] breakR: OK
1416.27 s
[vector] +++ OK, passed 100 tests.
1416.27 s
[vector] groupBy: OK
1416.27 s
[vector] +++ OK, passed 100 tests.
1416.27 s
[vector] elem: OK
1416.27 s
[vector] +++ OK, passed 100 tests.
1416.27 s
[vector] notElem: OK
1416.27 s
[vector] +++ OK, passed 100 tests.
1416.27 s
[vector] find: OK
1416.27 s
[vector] +++ OK, passed 100 tests.
1416.27 s
[vector] findIndex: OK
1416.27 s
[vector] +++ OK, passed 100 tests.
1416.27 s
[vector] findIndexR: OK
1416.27 s
[vector] +++ OK, passed 100 tests.
1416.27 s
[vector] findIndices: OK
1416.27 s
[vector] +++ OK, passed 100 tests.
1416.27 s
[vector] elemIndex: OK
1416.27 s
[vector] +++ OK, passed 100 tests.
1416.27 s
[vector] elemIndices: OK
1416.27 s
[vector] +++ OK, passed 100 tests.
1416.28 s
[vector] foldl: OK
1416.28 s
[vector] +++ OK, passed 100 tests.
1416.28 s
[vector] foldl1: OK
1416.28 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1416.28 s
[vector] foldl': OK
1416.28 s
[vector] +++ OK, passed 100 tests.
1416.28 s
[vector] foldl1': OK
1416.28 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1416.29 s
[vector] foldr: OK
1416.29 s
[vector] +++ OK, passed 100 tests.
1416.29 s
[vector] foldr1: OK
1416.29 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1416.29 s
[vector] foldr': OK
1416.29 s
[vector] +++ OK, passed 100 tests.
1416.29 s
[vector] foldr1': OK
1416.29 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1416.30 s
[vector] ifoldl: OK
1416.30 s
[vector] +++ OK, passed 100 tests.
1416.30 s
[vector] ifoldl': OK
1416.30 s
[vector] +++ OK, passed 100 tests.
1416.31 s
[vector] ifoldr: OK
1416.31 s
[vector] +++ OK, passed 100 tests.
1416.31 s
[vector] ifoldr': OK
1416.31 s
[vector] +++ OK, passed 100 tests.
1416.31 s
[vector] ifoldM: OK
1416.31 s
[vector] +++ OK, passed 100 tests.
1416.32 s
[vector] ifoldM': OK
1416.32 s
[vector] +++ OK, passed 100 tests.
1416.33 s
[vector] ifoldM_: OK (0.01s)
1416.33 s
[vector] +++ OK, passed 100 tests.
1416.34 s
[vector] ifoldM'_: OK
1416.34 s
[vector] +++ OK, passed 100 tests.
1416.34 s
[vector] all: OK
1416.34 s
[vector] +++ OK, passed 100 tests.
1416.34 s
[vector] any: OK
1416.34 s
[vector] +++ OK, passed 100 tests.
1416.35 s
[vector] prescanl: OK
1416.35 s
[vector] +++ OK, passed 100 tests.
1416.35 s
[vector] prescanl': OK
1416.35 s
[vector] +++ OK, passed 100 tests.
1416.35 s
[vector] postscanl: OK
1416.35 s
[vector] +++ OK, passed 100 tests.
1416.35 s
[vector] postscanl': OK
1416.35 s
[vector] +++ OK, passed 100 tests.
1416.35 s
[vector] scanl: OK
1416.35 s
[vector] +++ OK, passed 100 tests.
1416.36 s
[vector] scanl': OK
1416.36 s
[vector] +++ OK, passed 100 tests.
1416.36 s
[vector] scanl1: OK
1416.36 s
[vector] +++ OK, passed 100 tests.
1416.36 s
[vector] scanl1': OK
1416.36 s
[vector] +++ OK, passed 100 tests.
1416.36 s
[vector] iscanl: OK
1416.37 s
[vector] +++ OK, passed 100 tests.
1416.37 s
[vector] iscanl': OK
1416.37 s
[vector] +++ OK, passed 100 tests.
1416.37 s
[pandoc-lua-engine] Phase: setupCompilerEnvironmentPhase
1416.37 s
[vector] prescanr: OK
1416.37 s
[vector] +++ OK, passed 100 tests.
1416.37 s
[vector] prescanr': OK
1416.37 s
[vector] +++ OK, passed 100 tests.
1416.37 s
[vector] postscanr: OK
1416.37 s
[pandoc-lua-engine] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
1416.37 s
[vector] +++ OK, passed 100 tests.
1416.38 s
[vector] postscanr': OK
1416.38 s
[vector] +++ OK, passed 100 tests.
1416.38 s
[vector] scanr: OK
1416.38 s
[vector] +++ OK, passed 100 tests.
1416.38 s
[vector] scanr': OK
1416.38 s
[vector] +++ OK, passed 100 tests.
1416.38 s
[vector] scanr1: OK
1416.38 s
[vector] +++ OK, passed 100 tests.
1416.38 s
[vector] scanr1': OK
1416.39 s
[vector] +++ OK, passed 100 tests.
1416.39 s
[vector] iscanr: OK
1416.39 s
[vector] +++ OK, passed 100 tests.
1416.39 s
[vector] iscanr': OK
1416.39 s
[vector] +++ OK, passed 100 tests.
1416.39 s
[vector] mut_read: OK
1416.39 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1416.39 s
[vector] mut_write: OK
1416.40 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1416.40 s
[vector] mut_modify: OK
1416.40 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1416.40 s
[vector] mut_generate: OK
1416.40 s
[vector] +++ OK, passed 100 tests.
1416.41 s
[vector] mut_generateM: OK
1416.42 s
[vector] +++ OK, passed 100 tests.
1416.42 s
[vector] mut_mapM_: OK (0.01s)
1416.42 s
[vector] +++ OK, passed 100 tests.
1416.43 s
[vector] mut_imapM_: OK
1416.44 s
[vector] +++ OK, passed 100 tests.
1416.44 s
[vector] mut_forM_: OK (0.01s)
1416.44 s
[vector] +++ OK, passed 100 tests.
1416.44 s
[vector] mut_iforM_: OK
1416.44 s
[vector] +++ OK, passed 100 tests.
1416.44 s
[vector] mut_foldr: OK
1416.44 s
[vector] +++ OK, passed 100 tests.
1416.44 s
[vector] mut_foldr': OK
1416.44 s
[vector] +++ OK, passed 100 tests.
1416.45 s
[vector] mut_foldl: OK
1416.45 s
[vector] +++ OK, passed 100 tests.
1416.45 s
[vector] mut_foldl': OK
1416.45 s
[vector] +++ OK, passed 100 tests.
1416.45 s
[vector] mut_ifoldr: OK
1416.45 s
[vector] +++ OK, passed 100 tests.
1416.45 s
[vector] mut_ifoldr': OK
1416.45 s
[vector] +++ OK, passed 100 tests.
1416.45 s
[vector] mut_ifoldl: OK
1416.45 s
[vector] +++ OK, passed 100 tests.
1416.46 s
[vector] mut_ifoldl': OK
1416.46 s
[vector] +++ OK, passed 100 tests.
1416.46 s
[vector] mut_foldM: OK
1416.46 s
[vector] +++ OK, passed 100 tests.
1416.46 s
[vector] mut_foldM': OK
1416.46 s
[vector] +++ OK, passed 100 tests.
1416.46 s
[vector] mut_foldrM: OK
1416.46 s
[vector] +++ OK, passed 100 tests.
1416.46 s
[vector] mut_foldrM': OK
1416.47 s
[vector] +++ OK, passed 100 tests.
1416.47 s
[vector] mut_ifoldM: OK
1416.47 s
[vector] +++ OK, passed 100 tests.
1416.47 s
[vector] mut_ifoldM': OK
1416.47 s
[vector] +++ OK, passed 100 tests.
1416.47 s
[vector] mut_ifoldrM: OK
1416.47 s
[vector] +++ OK, passed 100 tests.
1416.47 s
[vector] mut_ifoldrM': OK
1416.47 s
[vector] +++ OK, passed 100 tests.
1416.47 s
[vector] compare: OK
1416.47 s
[vector] +++ OK, passed 100 tests.
1416.47 s
[vector] maximum: OK
1416.47 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1416.47 s
[vector] minimum: OK
1416.47 s
[vector] +++ OK, passed 100 tests; 26 discarded.
1416.47 s
[vector] minIndex: OK
1416.47 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1416.47 s
[vector] maxIndex: OK
1416.47 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1416.47 s
[vector] maximumBy: OK
1416.47 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1416.48 s
[vector] minimumBy: OK
1416.48 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1416.48 s
[vector] maximumOn: OK
1416.48 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1416.48 s
[vector] minimumOn: OK
1416.48 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1416.48 s
[vector] maxIndexBy: OK
1416.48 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1416.48 s
[vector] minIndexBy: OK
1416.48 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1416.48 s
[vector] ListFirstMaxIndexWins: OK
1416.48 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1416.48 s
[vector] FalseListFirstMaxIndexWins: OK
1416.48 s
[vector] +++ OK, failed as expected. (after 1 test):
1416.48 s
[vector] Exception:
1416.48 s
[vector] Prelude.foldr1: empty list
1416.48 s
[vector] CallStack (from HasCallStack):
1416.48 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1416.48 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1416.48 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1416.48 s
[vector] []
1416.48 s
[vector] zip: OK
1416.48 s
[vector] +++ OK, passed 100 tests.
1416.48 s
[vector] zip3: OK
1416.48 s
[vector] +++ OK, passed 100 tests.
1416.48 s
[vector] unzip: OK
1416.48 s
[vector] +++ OK, passed 100 tests.
1416.48 s
[vector] unzip3: OK
1416.48 s
[vector] +++ OK, passed 100 tests.
1416.48 s
[vector] indexed: OK
1416.49 s
[vector] +++ OK, passed 100 tests.
1416.49 s
[vector] update: OK
1416.49 s
[vector] +++ OK, passed 100 tests.
1416.49 s
[vector] concat: OK
1416.50 s
[vector] +++ OK, passed 100 tests.
1416.50 s
[vector] mempty: OK
1416.50 s
[vector] +++ OK, passed 100 tests.
1416.50 s
[vector] mappend: OK
1416.50 s
[vector] +++ OK, passed 100 tests.
1416.51 s
[vector] mconcat: OK
1416.51 s
[vector] +++ OK, passed 100 tests.
1416.51 s
[vector] fmap: OK
1416.51 s
[vector] +++ OK, passed 100 tests.
1416.51 s
[vector] return: OK
1416.52 s
[vector] +++ OK, passed 100 tests.
1416.52 s
[vector] bind: OK (0.01s)
1416.52 s
[vector] +++ OK, passed 100 tests.
1416.52 s
[vector] mzip: OK
1416.52 s
[vector] +++ OK, passed 100 tests.
1416.52 s
[vector] munzip: OK
1416.52 s
[vector] +++ OK, passed 100 tests.
1416.54 s
[vector] applicative_pure: OK
1416.54 s
[vector] +++ OK, passed 100 tests.
1416.54 s
[vector] applicative_appl: OK (0.02s)
1416.54 s
[vector] +++ OK, passed 100 tests.
1416.54 s
[vector] alternative_empty: OK
1416.54 s
[vector] +++ OK, passed 100 tests.
1416.54 s
[vector] alternative_or: OK
1416.54 s
[vector] +++ OK, passed 100 tests.
1416.54 s
[pandoc-server] Phase: setupCompilerEnvironmentPhase
1416.55 s
[pandoc-server] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
1416.58 s
[vector] sequence: OK (0.03s)
1416.58 s
[vector] +++ OK, passed 100 tests.
1416.58 s
[vector] sequence_: OK
1416.58 s
[vector] +++ OK, passed 100 tests.
1416.58 s
[vector] glength: OK
1416.58 s
[vector] +++ OK, passed 100 tests.
1416.58 s
[vector] and: OK
1416.58 s
[vector] +++ OK, passed 100 tests.
1416.58 s
[vector] or: OK
1416.58 s
[vector] +++ OK, passed 100 tests.
1416.58 s
[vector] Int
1416.58 s
[vector] fromList.toList == id: OK
1416.58 s
[vector] +++ OK, passed 100 tests.
1416.58 s
[vector] toList.fromList == id: OK
1416.58 s
[vector] +++ OK, passed 100 tests.
1416.58 s
[vector] unstream.stream == id: OK
1416.58 s
[vector] +++ OK, passed 100 tests.
1416.58 s
[vector] stream.unstream == id: OK
1416.58 s
[vector] +++ OK, passed 100 tests.
1416.58 s
[vector] eq: OK
1416.58 s
[vector] +++ OK, passed 100 tests.
1416.58 s
[vector] length: OK
1416.58 s
[vector] +++ OK, passed 100 tests.
1416.58 s
[vector] null: OK
1416.59 s
[vector] +++ OK, passed 100 tests.
1416.59 s
[vector] index: OK
1416.59 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1416.59 s
[vector] safeIndex: OK
1416.59 s
[vector] +++ OK, passed 100 tests.
1416.59 s
[vector] head: OK
1416.59 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1416.59 s
[vector] last: OK
1416.59 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1416.59 s
[vector] unsafeIndex: OK
1416.59 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1416.59 s
[vector] unsafeHead: OK
1416.59 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1416.59 s
[vector] unsafeLast: OK
1416.59 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1416.59 s
[vector] slice: OK
1416.59 s
[vector] +++ OK, passed 100 tests.
1416.59 s
[vector] init: OK
1416.59 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1416.59 s
[vector] tail: OK
1416.59 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1416.59 s
[vector] take: OK
1416.59 s
[vector] +++ OK, passed 100 tests.
1416.59 s
[vector] drop: OK
1416.59 s
[vector] +++ OK, passed 100 tests.
1416.59 s
[vector] splitAt: OK
1416.59 s
[vector] +++ OK, passed 100 tests.
1416.59 s
[vector] empty: OK
1416.60 s
[vector] +++ OK, passed 100 tests.
1416.60 s
[vector] singleton: OK
1416.60 s
[vector] +++ OK, passed 100 tests.
1416.60 s
[vector] replicate: OK
1416.60 s
[vector] +++ OK, passed 100 tests.
1416.60 s
[vector] generate: OK
1416.60 s
[vector] +++ OK, passed 100 tests.
1416.60 s
[vector] iterateN: OK
1416.62 s
[vector] +++ OK, passed 100 tests.
1416.66 s
[vector] iterateNM: OK (0.04s)
1416.66 s
[vector] +++ OK, passed 100 tests.
1416.68 s
[vector] generateM: OK (0.03s)
1416.68 s
[vector] +++ OK, passed 100 tests.
1416.68 s
[vector] replicateM: OK
1416.68 s
[vector] +++ OK, passed 100 tests.
1416.68 s
[vector] create: OK
1416.68 s
[vector] +++ OK, passed 100 tests.
1416.68 s
[vector] createT: OK
1416.68 s
[vector] +++ OK, passed 100 tests.
1416.68 s
[vector] unfoldr: OK
1416.68 s
[vector] +++ OK, passed 100 tests.
1416.68 s
[vector] unfoldrN: OK
1416.68 s
[vector] +++ OK, passed 100 tests.
1416.68 s
[vector] unfoldrExactN: OK
1416.68 s
[vector] +++ OK, passed 100 tests.
1416.69 s
[vector] unfoldrM: OK
1416.70 s
[vector] +++ OK, passed 100 tests.
1416.70 s
[vector] unfoldrNM: OK
1416.70 s
[vector] +++ OK, passed 100 tests.
1416.71 s
[vector] unfoldrExactNM: OK (0.02s)
1416.72 s
[vector] +++ OK, passed 100 tests.
1416.72 s
[vector] constructN: OK
1416.72 s
[vector] +++ OK, passed 100 tests.
1416.72 s
[vector] constructrN: OK
1416.72 s
[vector] +++ OK, passed 100 tests.
1416.72 s
[vector] cons: OK
1416.72 s
[vector] +++ OK, passed 100 tests.
1416.72 s
[vector] snoc: OK
1416.72 s
[vector] +++ OK, passed 100 tests.
1416.74 s
[vector] append: OK
1416.74 s
[vector] +++ OK, passed 100 tests.
1416.74 s
[vector] concat: OK (0.01s)
1416.74 s
[vector] +++ OK, passed 100 tests.
1416.74 s
[vector] force: OK
1416.74 s
[vector] +++ OK, passed 100 tests.
1416.74 s
[vector] upd: OK
1416.74 s
[vector] +++ OK, passed 100 tests.
1416.74 s
[vector] accum: OK
1416.74 s
[vector] +++ OK, passed 100 tests.
1416.74 s
[vector] reverse: OK
1416.74 s
[vector] +++ OK, passed 100 tests.
1416.74 s
[vector] backpermute: OK
1416.75 s
[vector] +++ OK, passed 100 tests.
1416.75 s
[vector] map: OK
1416.76 s
[vector] +++ OK, passed 100 tests.
1416.76 s
[vector] imap: OK
1416.76 s
[vector] +++ OK, passed 100 tests.
1416.76 s
[vector] concatMap: OK
1416.76 s
[vector] +++ OK, passed 100 tests.
1416.76 s
[vector] mapM: OK
1416.76 s
[vector] +++ OK, passed 100 tests.
1416.77 s
[vector] mapM_: OK (0.02s)
1416.77 s
[vector] +++ OK, passed 100 tests.
1416.77 s
[vector] forM: OK
1416.77 s
[vector] +++ OK, passed 100 tests.
1416.79 s
[vector] forM_: OK (0.02s)
1416.79 s
[vector] +++ OK, passed 100 tests.
1416.79 s
[vector] imapM: OK
1416.79 s
[vector] +++ OK, passed 100 tests.
1416.81 s
[vector] imapM_: OK (0.02s)
1416.81 s
[vector] +++ OK, passed 100 tests.
1416.81 s
[vector] zipWith: OK
1416.81 s
[vector] +++ OK, passed 100 tests.
1416.81 s
[vector] zipWith3: OK
1416.82 s
[vector] +++ OK, passed 100 tests.
1416.82 s
[vector] izipWith: OK
1416.82 s
[vector] +++ OK, passed 100 tests.
1416.82 s
[vector] izipWith3: OK
1416.82 s
[vector] +++ OK, passed 100 tests.
1416.84 s
[vector] izipWithM: OK
1416.84 s
[vector] +++ OK, passed 100 tests.
1416.84 s
[vector] izipWithM_: OK (0.01s)
1416.84 s
[vector] +++ OK, passed 100 tests.
1416.85 s
[vector] zipWithM: OK
1416.85 s
[vector] +++ OK, passed 100 tests.
1416.85 s
[vector] zipWithM_: OK (0.01s)
1416.85 s
[vector] +++ OK, passed 100 tests.
1416.85 s
[vector] filter: OK
1416.86 s
[vector] +++ OK, passed 100 tests.
1416.88 s
[vector] ifilter: OK
1416.88 s
[vector] +++ OK, passed 100 tests.
1416.90 s
[vector] filterM: OK (0.04s)
1416.90 s
[vector] +++ OK, passed 100 tests.
1416.90 s
[vector] uniq: OK
1416.90 s
[vector] +++ OK, passed 100 tests.
1416.90 s
[vector] mapMaybe: OK
1416.91 s
[vector] +++ OK, passed 100 tests.
1416.91 s
[vector] imapMaybe: OK
1416.91 s
[vector] +++ OK, passed 100 tests.
1416.91 s
[vector] takeWhile: OK
1416.91 s
[vector] +++ OK, passed 100 tests.
1416.91 s
[vector] dropWhile: OK
1416.91 s
[vector] +++ OK, passed 100 tests.
1416.91 s
[vector] partition: OK
1416.91 s
[vector] +++ OK, passed 100 tests.
1416.91 s
[vector] partitionWith: OK
1416.91 s
[vector] +++ OK, passed 100 tests.
1416.91 s
[vector] span: OK
1416.91 s
[vector] +++ OK, passed 100 tests.
1416.92 s
[vector] break: OK
1416.92 s
[vector] +++ OK, passed 100 tests.
1416.92 s
[vector] spanR: OK
1416.92 s
[vector] +++ OK, passed 100 tests.
1416.92 s
[vector] breakR: OK
1416.92 s
[vector] +++ OK, passed 100 tests.
1416.92 s
[vector] groupBy: OK
1416.92 s
[vector] +++ OK, passed 100 tests.
1416.92 s
[vector] elem: OK
1416.92 s
[vector] +++ OK, passed 100 tests.
1416.92 s
[vector] notElem: OK
1416.92 s
[vector] +++ OK, passed 100 tests.
1416.92 s
[vector] find: OK
1416.92 s
[vector] +++ OK, passed 100 tests.
1416.92 s
[vector] findIndex: OK
1416.92 s
[vector] +++ OK, passed 100 tests.
1416.92 s
[vector] findIndexR: OK
1416.92 s
[vector] +++ OK, passed 100 tests.
1416.93 s
[vector] findIndices: OK
1416.93 s
[vector] +++ OK, passed 100 tests.
1416.93 s
[vector] elemIndex: OK
1416.93 s
[vector] +++ OK, passed 100 tests.
1416.93 s
[vector] elemIndices: OK
1416.93 s
[vector] +++ OK, passed 100 tests.
1416.94 s
[vector] foldl: OK
1416.94 s
[vector] +++ OK, passed 100 tests.
1416.94 s
[vector] foldl1: OK
1416.94 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1416.94 s
[vector] foldl': OK
1416.94 s
[vector] +++ OK, passed 100 tests.
1416.94 s
[vector] foldl1': OK
1416.94 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1416.94 s
[vector] foldr: OK
1416.94 s
[vector] +++ OK, passed 100 tests.
1416.94 s
[vector] foldr1: OK
1416.95 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1416.95 s
[vector] foldr': OK
1416.95 s
[vector] +++ OK, passed 100 tests.
1416.95 s
[vector] foldr1': OK
1416.95 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1416.95 s
[vector] ifoldl: OK
1416.96 s
[vector] +++ OK, passed 100 tests.
1416.96 s
[vector] ifoldl': OK
1416.96 s
[vector] +++ OK, passed 100 tests.
1416.96 s
[vector] ifoldr: OK
1416.97 s
[vector] +++ OK, passed 100 tests.
1416.97 s
[vector] ifoldr': OK
1416.97 s
[vector] +++ OK, passed 100 tests.
1416.98 s
[vector] ifoldM: OK
1416.98 s
[vector] +++ OK, passed 100 tests.
1416.98 s
[vector] ifoldM': OK
1416.98 s
[vector] +++ OK, passed 100 tests.
1417.02 s
[vector] ifoldM_: OK (0.03s)
1417.02 s
[vector] +++ OK, passed 100 tests.
1417.03 s
[vector] ifoldM'_: OK (0.02s)
1417.03 s
[vector] +++ OK, passed 100 tests.
1417.03 s
[vector] all: OK
1417.03 s
[vector] +++ OK, passed 100 tests.
1417.03 s
[vector] any: OK
1417.04 s
[vector] +++ OK, passed 100 tests.
1417.04 s
[vector] prescanl: OK
1417.04 s
[vector] +++ OK, passed 100 tests.
1417.04 s
[vector] prescanl': OK
1417.04 s
[vector] +++ OK, passed 100 tests.
1417.04 s
[vector] postscanl: OK
1417.04 s
[vector] +++ OK, passed 100 tests.
1417.05 s
[vector] postscanl': OK
1417.05 s
[vector] +++ OK, passed 100 tests.
1417.05 s
[vector] scanl: OK
1417.05 s
[vector] +++ OK, passed 100 tests.
1417.05 s
[vector] scanl': OK
1417.06 s
[vector] +++ OK, passed 100 tests.
1417.06 s
[vector] scanl1: OK
1417.06 s
[vector] +++ OK, passed 100 tests.
1417.06 s
[vector] scanl1': OK
1417.06 s
[vector] +++ OK, passed 100 tests.
1417.06 s
[vector] iscanl: OK
1417.06 s
[vector] +++ OK, passed 100 tests.
1417.07 s
[vector] iscanl': OK
1417.07 s
[vector] +++ OK, passed 100 tests.
1417.08 s
[vector] prescanr: OK
1417.08 s
[vector] +++ OK, passed 100 tests.
1417.08 s
[vector] prescanr': OK
1417.08 s
[vector] +++ OK, passed 100 tests.
1417.08 s
[vector] postscanr: OK
1417.08 s
[vector] +++ OK, passed 100 tests.
1417.08 s
[vector] postscanr': OK
1417.09 s
[vector] +++ OK, passed 100 tests.
1417.09 s
[vector] scanr: OK
1417.09 s
[vector] +++ OK, passed 100 tests.
1417.09 s
[vector] scanr': OK
1417.09 s
[vector] +++ OK, passed 100 tests.
1417.10 s
[vector] scanr1: OK
1417.10 s
[vector] +++ OK, passed 100 tests.
1417.10 s
[vector] scanr1': OK
1417.11 s
[vector] +++ OK, passed 100 tests.
1417.11 s
[vector] iscanr: OK
1417.11 s
[vector] +++ OK, passed 100 tests.
1417.11 s
[vector] iscanr': OK
1417.11 s
[vector] +++ OK, passed 100 tests.
1417.11 s
[vector] mut_read: OK
1417.12 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1417.12 s
[vector] mut_write: OK
1417.12 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1417.12 s
[vector] mut_modify: OK
1417.12 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1417.14 s
[vector] mut_generate: OK
1417.14 s
[vector] +++ OK, passed 100 tests.
1417.16 s
[vector] mut_generateM: OK (0.02s)
1417.16 s
[vector] +++ OK, passed 100 tests.
1417.18 s
[vector] mut_mapM_: OK (0.04s)
1417.18 s
[vector] +++ OK, passed 100 tests.
1417.20 s
[vector] mut_imapM_: OK (0.02s)
1417.20 s
[vector] +++ OK, passed 100 tests.
1417.20 s
[pandoc-lua-engine] Phase: unpackPhase
1417.21 s
[vector] mut_forM_: OK (0.02s)
1417.21 s
[vector] +++ OK, passed 100 tests.
1417.21 s
[pandoc-lua-engine] unpacking source archive /nix/store/zx6z7rsf1lwrwkbcq94jg1dgi1fp9jls-pandoc-lua-engine-0.4.3.tar.gz
1417.23 s
[pandoc-lua-engine] source root is pandoc-lua-engine-0.4.3
1417.24 s
[vector] mut_iforM_: OK (0.01s)
1417.24 s
[vector] +++ OK, passed 100 tests.
1417.25 s
[vector] mut_foldr: OK
1417.25 s
[vector] +++ OK, passed 100 tests.
1417.25 s
[vector] mut_foldr': OK
1417.25 s
[vector] +++ OK, passed 100 tests.
1417.25 s
[vector] mut_foldl: OK
1417.26 s
[pandoc-lua-engine] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-lua-engine-0.4.3/test/writer-template.out.txt"
1417.26 s
[vector] +++ OK, passed 100 tests.
1417.26 s
[vector] mut_foldl': OK
1417.27 s
[pandoc-lua-engine] Phase: patchPhase
1417.27 s
[vector] +++ OK, passed 100 tests.
1417.27 s
[vector] mut_ifoldr: OK
1417.28 s
[pandoc-lua-engine] Replace Cabal file with edited version from mirror://hackage/pandoc-lua-engine-0.4.3/revision/2.cabal.
1417.28 s
[vector] +++ OK, passed 100 tests.
1417.29 s
[vector] mut_ifoldr': OK (0.01s)
1417.29 s
[vector] +++ OK, passed 100 tests.
1417.29 s
[vector] mut_ifoldl: OK
1417.29 s
[vector] +++ OK, passed 100 tests.
1417.29 s
[vector] mut_ifoldl': OK
1417.29 s
[vector] +++ OK, passed 100 tests.
1417.29 s
[pandoc-lua-engine] Phase: compileBuildDriverPhase
1417.30 s
[vector] mut_foldM: OK
1417.30 s
[vector] +++ OK, passed 100 tests.
1417.30 s
[vector] mut_foldM': OK
1417.30 s
[pandoc-lua-engine] setupCompileFlags: -package-db=/build/tmp.dXHKZTBIpZ/setup-package.conf.d -threaded
1417.30 s
[vector] +++ OK, passed 100 tests.
1417.30 s
[vector] mut_foldrM: OK
1417.30 s
[vector] +++ OK, passed 100 tests.
1417.30 s
[vector] mut_foldrM': OK
1417.30 s
[vector] +++ OK, passed 100 tests.
1417.30 s
[vector] mut_ifoldM: OK
1417.31 s
[vector] +++ OK, passed 100 tests.
1417.31 s
[vector] mut_ifoldM': OK
1417.31 s
[vector] +++ OK, passed 100 tests.
1417.31 s
[vector] mut_ifoldrM: OK
1417.31 s
[vector] +++ OK, passed 100 tests.
1417.31 s
[vector] mut_ifoldrM': OK
1417.31 s
[vector] +++ OK, passed 100 tests.
1417.31 s
[vector] compare: OK
1417.31 s
[vector] +++ OK, passed 100 tests.
1417.31 s
[vector] maximum: OK
1417.31 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1417.31 s
[vector] minimum: OK
1417.31 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1417.32 s
[vector] minIndex: OK
1417.32 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1417.32 s
[vector] maxIndex: OK
1417.32 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1417.32 s
[vector] maximumBy: OK
1417.32 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1417.32 s
[vector] minimumBy: OK
1417.32 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1417.32 s
[vector] maximumOn: OK
1417.32 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1417.32 s
[vector] minimumOn: OK
1417.32 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1417.32 s
[vector] maxIndexBy: OK
1417.32 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1417.32 s
[vector] minIndexBy: OK
1417.32 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1417.32 s
[vector] ListFirstMaxIndexWins: OK
1417.32 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1417.32 s
[vector] FalseListFirstMaxIndexWins: OK
1417.32 s
[vector] +++ OK, failed as expected. (after 1 test):
1417.32 s
[vector] Exception:
1417.32 s
[vector] Prelude.foldr1: empty list
1417.32 s
[vector] CallStack (from HasCallStack):
1417.32 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1417.32 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1417.32 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1417.32 s
[vector] []
1417.32 s
[vector] zip: OK
1417.32 s
[vector] +++ OK, passed 100 tests.
1417.32 s
[vector] zip3: OK
1417.32 s
[vector] +++ OK, passed 100 tests.
1417.32 s
[vector] unzip: OK
1417.32 s
[vector] +++ OK, passed 100 tests.
1417.32 s
[vector] unzip3: OK
1417.32 s
[vector] +++ OK, passed 100 tests.
1417.32 s
[vector] indexed: OK
1417.32 s
[vector] +++ OK, passed 100 tests.
1417.32 s
[vector] update: OK
1417.33 s
[vector] +++ OK, passed 100 tests.
1417.33 s
[vector] concat: OK
1417.33 s
[vector] +++ OK, passed 100 tests.
1417.33 s
[vector] mempty: OK
1417.33 s
[vector] +++ OK, passed 100 tests.
1417.34 s
[vector] mappend: OK
1417.34 s
[vector] +++ OK, passed 100 tests.
1417.34 s
[vector] mconcat: OK
1417.34 s
[vector] +++ OK, passed 100 tests.
1417.34 s
[vector] fmap: OK
1417.34 s
[vector] +++ OK, passed 100 tests.
1417.34 s
[vector] return: OK
1417.36 s
[vector] +++ OK, passed 100 tests.
1417.36 s
[vector] bind: OK (0.02s)
1417.36 s
[vector] +++ OK, passed 100 tests.
1417.36 s
[vector] mzip: OK
1417.36 s
[vector] +++ OK, passed 100 tests.
1417.36 s
[vector] munzip: OK
1417.36 s
[vector] +++ OK, passed 100 tests.
1417.36 s
[vector] applicative_pure: OK
1417.38 s
[vector] +++ OK, passed 100 tests.
1417.39 s
[pandoc-lua-engine] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.dXHKZTBIpZ/Main.o )
1417.39 s
[vector] applicative_appl: OK (0.03s)
1417.39 s
[vector] +++ OK, passed 100 tests.
1417.39 s
[vector] alternative_empty: OK
1417.40 s
[vector] +++ OK, passed 100 tests.
1417.40 s
[vector] alternative_or: OK
1417.40 s
[vector] +++ OK, passed 100 tests.
1417.45 s
[vector] sequence: OK (0.05s)
1417.45 s
[vector] +++ OK, passed 100 tests.
1417.45 s
[vector] sequence_: OK (0.01s)
1417.45 s
[vector] +++ OK, passed 100 tests.
1417.45 s
[vector] glength: OK
1417.45 s
[vector] +++ OK, passed 100 tests.
1417.45 s
[vector] sum: OK
1417.45 s
[vector] +++ OK, passed 100 tests.
1417.45 s
[vector] product: OK
1417.45 s
[vector] +++ OK, passed 100 tests.
1417.45 s
[vector] enumFromN: OK
1417.45 s
[vector] +++ OK, passed 100 tests.
1417.45 s
[vector] enumFromThenN: OK
1417.45 s
[vector] +++ OK, passed 100 tests.
1417.46 s
[vector] enumFromTo: OK
1417.46 s
[vector] +++ OK, passed 100 tests.
1417.46 s
[vector] enumFromThenTo: OK
1417.46 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1417.46 s
[vector] unstream
1417.46 s
[vector] unstream == vunstream (exact): OK
1417.46 s
[vector] +++ OK, passed 100 tests.
1417.46 s
[vector] unstream == vunstream (unknown): OK
1417.46 s
[vector] +++ OK, passed 100 tests.
1417.46 s
[vector] unstreamR ~= vunstream (exact): OK
1417.46 s
[vector] +++ OK, passed 100 tests.
1417.46 s
[vector] unstreamR ~= vunstream (unknown): OK
1417.46 s
[vector] +++ OK, passed 100 tests.
1417.46 s
[vector] Tests.Vector.Primitive
1417.46 s
[vector] Int
1417.46 s
[vector] fromList.toList == id: OK
1417.46 s
[vector] +++ OK, passed 100 tests.
1417.46 s
[vector] toList.fromList == id: OK
1417.46 s
[vector] +++ OK, passed 100 tests.
1417.46 s
[vector] unstream.stream == id: OK
1417.46 s
[vector] +++ OK, passed 100 tests.
1417.46 s
[vector] stream.unstream == id: OK
1417.46 s
[vector] +++ OK, passed 100 tests.
1417.46 s
[vector] eq: OK
1417.46 s
[vector] +++ OK, passed 100 tests.
1417.46 s
[vector] length: OK
1417.46 s
[vector] +++ OK, passed 100 tests.
1417.46 s
[vector] null: OK
1417.46 s
[vector] +++ OK, passed 100 tests.
1417.46 s
[vector] index: OK
1417.46 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1417.46 s
[vector] safeIndex: OK
1417.46 s
[vector] +++ OK, passed 100 tests.
1417.46 s
[vector] head: OK
1417.47 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1417.47 s
[vector] last: OK
1417.47 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1417.47 s
[vector] unsafeIndex: OK
1417.47 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1417.47 s
[vector] unsafeHead: OK
1417.47 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1417.47 s
[vector] unsafeLast: OK
1417.47 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1417.47 s
[vector] slice: OK
1417.47 s
[vector] +++ OK, passed 100 tests.
1417.47 s
[vector] init: OK
1417.47 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1417.47 s
[vector] tail: OK
1417.47 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1417.47 s
[vector] take: OK
1417.47 s
[vector] +++ OK, passed 100 tests.
1417.47 s
[vector] drop: OK
1417.47 s
[vector] +++ OK, passed 100 tests.
1417.47 s
[vector] splitAt: OK
1417.48 s
[vector] +++ OK, passed 100 tests.
1417.48 s
[vector] empty: OK
1417.48 s
[vector] +++ OK, passed 100 tests.
1417.48 s
[vector] singleton: OK
1417.48 s
[vector] +++ OK, passed 100 tests.
1417.48 s
[vector] replicate: OK
1417.48 s
[vector] +++ OK, passed 100 tests.
1417.48 s
[vector] generate: OK
1417.48 s
[vector] +++ OK, passed 100 tests.
1417.50 s
[vector] iterateN: OK
1417.50 s
[vector] +++ OK, passed 100 tests.
1417.51 s
[pandoc-server] Phase: unpackPhase
1417.52 s
[pandoc-server] unpacking source archive /nix/store/4kqsjsplqpsanrihsxp1wxshjqr4snkl-pandoc-server-0.1.0.11.tar.gz
1417.52 s
[vector] iterateNM: OK (0.02s)
1417.52 s
[vector] +++ OK, passed 100 tests.
1417.52 s
[pandoc-lua-engine] [2 of 2] Linking Setup
1417.52 s
[pandoc-server] source root is pandoc-server-0.1.0.11
1417.54 s
[pandoc-server] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-server-0.1.0.11/src/Text/Pandoc/Server.hs"
1417.54 s
[pandoc-server] Phase: patchPhase
1417.56 s
[vector] generateM: OK (0.04s)
1417.56 s
[vector] +++ OK, passed 100 tests.
1417.56 s
[pandoc-server] Phase: compileBuildDriverPhase
1417.57 s
[vector] replicateM: OK (0.02s)
1417.57 s
[vector] +++ OK, passed 100 tests.
1417.57 s
[vector] create: OK
1417.57 s
[vector] +++ OK, passed 100 tests.
1417.57 s
[pandoc-server] setupCompileFlags: -package-db=/build/tmp.QfXhG0cDsW/setup-package.conf.d -threaded
1417.58 s
[vector] createT: OK
1417.58 s
[vector] +++ OK, passed 100 tests.
1417.58 s
[vector] unfoldr: OK
1417.58 s
[vector] +++ OK, passed 100 tests.
1417.58 s
[vector] unfoldrN: OK
1417.58 s
[vector] +++ OK, passed 100 tests.
1417.59 s
[vector] unfoldrExactN: OK
1417.59 s
[vector] +++ OK, passed 100 tests.
1417.60 s
[vector] unfoldrM: OK
1417.60 s
[vector] +++ OK, passed 100 tests.
1417.62 s
[vector] unfoldrNM: OK
1417.62 s
[vector] +++ OK, passed 100 tests.
1417.62 s
[vector] unfoldrExactNM: OK (0.02s)
1417.62 s
[vector] +++ OK, passed 100 tests.
1417.62 s
[vector] constructN: OK
1417.63 s
[vector] +++ OK, passed 100 tests.
1417.63 s
[vector] constructrN: OK
1417.63 s
[vector] +++ OK, passed 100 tests.
1417.63 s
[vector] cons: OK
1417.63 s
[vector] +++ OK, passed 100 tests.
1417.63 s
[vector] snoc: OK
1417.63 s
[vector] +++ OK, passed 100 tests.
1417.64 s
[vector] append: OK
1417.64 s
[vector] +++ OK, passed 100 tests.
1417.65 s
[vector] concat: OK (0.02s)
1417.65 s
[vector] +++ OK, passed 100 tests.
1417.66 s
[vector] force: OK
1417.66 s
[vector] +++ OK, passed 100 tests.
1417.66 s
[vector] upd: OK
1417.66 s
[vector] +++ OK, passed 100 tests.
1417.66 s
[vector] accum: OK
1417.66 s
[vector] +++ OK, passed 100 tests.
1417.67 s
[pandoc-server] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.QfXhG0cDsW/Main.o )
1417.68 s
[vector] reverse: OK
1417.68 s
[vector] +++ OK, passed 100 tests.
1417.68 s
[vector] backpermute: OK
1417.68 s
[vector] +++ OK, passed 100 tests.
1417.68 s
[vector] map: OK
1417.68 s
[vector] +++ OK, passed 100 tests.
1417.68 s
[vector] imap: OK
1417.69 s
[vector] +++ OK, passed 100 tests.
1417.70 s
[vector] concatMap: OK
1417.70 s
[vector] +++ OK, passed 100 tests.
1417.70 s
[vector] mapM: OK
1417.70 s
[vector] +++ OK, passed 100 tests.
1417.70 s
[vector] mapM_: OK (0.02s)
1417.70 s
[vector] +++ OK, passed 100 tests.
1417.70 s
[vector] forM: OK
1417.70 s
[vector] +++ OK, passed 100 tests.
1417.73 s
[vector] forM_: OK (0.02s)
1417.73 s
[vector] +++ OK, passed 100 tests.
1417.73 s
[vector] imapM: OK
1417.73 s
[vector] +++ OK, passed 100 tests.
1417.73 s
[vector] imapM_: OK (0.01s)
1417.73 s
[vector] +++ OK, passed 100 tests.
1417.73 s
[vector] zipWith: OK
1417.74 s
[vector] +++ OK, passed 100 tests.
1417.74 s
[vector] zipWith3: OK
1417.74 s
[vector] +++ OK, passed 100 tests.
1417.74 s
[pandoc-server] [2 of 2] Linking Setup
1417.75 s
[vector] izipWith: OK
1417.75 s
[vector] +++ OK, passed 100 tests.
1417.75 s
[vector] izipWith3: OK
1417.75 s
[vector] +++ OK, passed 100 tests.
1417.75 s
[vector] izipWithM: OK
1417.76 s
[vector] +++ OK, passed 100 tests.
1417.77 s
[vector] izipWithM_: OK (0.01s)
1417.77 s
[vector] +++ OK, passed 100 tests.
1417.78 s
[vector] zipWithM: OK
1417.78 s
[vector] +++ OK, passed 100 tests.
1417.79 s
[vector] zipWithM_: OK (0.02s)
1417.79 s
[vector] +++ OK, passed 100 tests.
1417.79 s
[vector] filter: OK
1417.79 s
[vector] +++ OK, passed 100 tests.
1417.79 s
[vector] ifilter: OK
1417.79 s
[vector] +++ OK, passed 100 tests.
1417.81 s
[vector] filterM: OK (0.02s)
1417.81 s
[vector] +++ OK, passed 100 tests.
1417.82 s
[vector] uniq: OK
1417.82 s
[vector] +++ OK, passed 100 tests.
1417.82 s
[vector] mapMaybe: OK
1417.82 s
[vector] +++ OK, passed 100 tests.
1417.82 s
[vector] imapMaybe: OK
1417.82 s
[vector] +++ OK, passed 100 tests.
1417.82 s
[vector] takeWhile: OK
1417.82 s
[vector] +++ OK, passed 100 tests.
1417.83 s
[vector] dropWhile: OK
1417.83 s
[vector] +++ OK, passed 100 tests.
1417.83 s
[vector] partition: OK
1417.84 s
[vector] +++ OK, passed 100 tests.
1417.84 s
[vector] partitionWith: OK
1417.84 s
[vector] +++ OK, passed 100 tests.
1417.84 s
[vector] span: OK
1417.84 s
[vector] +++ OK, passed 100 tests.
1417.84 s
[vector] break: OK
1417.84 s
[vector] +++ OK, passed 100 tests.
1417.84 s
[vector] spanR: OK
1417.85 s
[vector] +++ OK, passed 100 tests.
1417.85 s
[vector] breakR: OK
1417.85 s
[vector] +++ OK, passed 100 tests.
1417.85 s
[vector] groupBy: OK
1417.85 s
[vector] +++ OK, passed 100 tests.
1417.85 s
[vector] elem: OK
1417.85 s
[vector] +++ OK, passed 100 tests.
1417.86 s
[vector] notElem: OK
1417.86 s
[vector] +++ OK, passed 100 tests.
1417.86 s
[vector] find: OK
1417.86 s
[vector] +++ OK, passed 100 tests.
1417.86 s
[vector] findIndex: OK
1417.86 s
[vector] +++ OK, passed 100 tests.
1417.86 s
[vector] findIndexR: OK
1417.86 s
[vector] +++ OK, passed 100 tests.
1417.86 s
[vector] findIndices: OK
1417.86 s
[vector] +++ OK, passed 100 tests.
1417.86 s
[vector] elemIndex: OK
1417.86 s
[vector] +++ OK, passed 100 tests.
1417.86 s
[vector] elemIndices: OK
1417.86 s
[vector] +++ OK, passed 100 tests.
1417.87 s
[vector] foldl: OK
1417.87 s
[vector] +++ OK, passed 100 tests.
1417.87 s
[vector] foldl1: OK
1417.87 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1417.87 s
[vector] foldl': OK
1417.87 s
[vector] +++ OK, passed 100 tests.
1417.88 s
[vector] foldl1': OK
1417.89 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1417.89 s
[vector] foldr: OK
1417.89 s
[vector] +++ OK, passed 100 tests.
1417.89 s
[vector] foldr1: OK
1417.89 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1417.90 s
[vector] foldr': OK
1417.90 s
[vector] +++ OK, passed 100 tests.
1417.90 s
[vector] foldr1': OK
1417.90 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1417.91 s
[vector] ifoldl: OK
1417.91 s
[vector] +++ OK, passed 100 tests.
1417.92 s
[vector] ifoldl': OK
1417.92 s
[vector] +++ OK, passed 100 tests.
1417.92 s
[vector] ifoldr: OK
1417.92 s
[vector] +++ OK, passed 100 tests.
1417.93 s
[vector] ifoldr': OK
1417.93 s
[vector] +++ OK, passed 100 tests.
1417.93 s
[vector] ifoldM: OK
1417.93 s
[vector] +++ OK, passed 100 tests.
1417.94 s
[vector] ifoldM': OK
1417.94 s
[vector] +++ OK, passed 100 tests.
1417.96 s
[vector] ifoldM_: OK (0.02s)
1417.96 s
[vector] +++ OK, passed 100 tests.
1417.97 s
[vector] ifoldM'_: OK (0.01s)
1417.97 s
[vector] +++ OK, passed 100 tests.
1417.97 s
[vector] all: OK
1417.97 s
[vector] +++ OK, passed 100 tests.
1417.97 s
[vector] any: OK
1417.97 s
[vector] +++ OK, passed 100 tests.
1417.97 s
[vector] prescanl: OK
1417.97 s
[vector] +++ OK, passed 100 tests.
1417.98 s
[vector] prescanl': OK
1417.98 s
[vector] +++ OK, passed 100 tests.
1417.98 s
[vector] postscanl: OK
1417.98 s
[vector] +++ OK, passed 100 tests.
1417.98 s
[vector] postscanl': OK
1417.98 s
[vector] +++ OK, passed 100 tests.
1417.99 s
[vector] scanl: OK
1417.99 s
[vector] +++ OK, passed 100 tests.
1417.99 s
[vector] scanl': OK
1417.99 s
[vector] +++ OK, passed 100 tests.
1417.99 s
[vector] scanl1: OK
1417.99 s
[vector] +++ OK, passed 100 tests.
1417.99 s
[vector] scanl1': OK
1418.00 s
[vector] +++ OK, passed 100 tests.
1418.00 s
[vector] iscanl: OK
1418.00 s
[vector] +++ OK, passed 100 tests.
1418.00 s
[vector] iscanl': OK
1418.00 s
[vector] +++ OK, passed 100 tests.
1418.01 s
[vector] prescanr: OK
1418.01 s
[vector] +++ OK, passed 100 tests.
1418.01 s
[vector] prescanr': OK
1418.01 s
[vector] +++ OK, passed 100 tests.
1418.01 s
[vector] postscanr: OK
1418.01 s
[vector] +++ OK, passed 100 tests.
1418.02 s
[vector] postscanr': OK
1418.02 s
[vector] +++ OK, passed 100 tests.
1418.02 s
[vector] scanr: OK
1418.02 s
[vector] +++ OK, passed 100 tests.
1418.02 s
[vector] scanr': OK
1418.02 s
[vector] +++ OK, passed 100 tests.
1418.03 s
[vector] scanr1: OK
1418.03 s
[vector] +++ OK, passed 100 tests.
1418.03 s
[vector] scanr1': OK
1418.03 s
[vector] +++ OK, passed 100 tests.
1418.03 s
[vector] iscanr: OK
1418.03 s
[vector] +++ OK, passed 100 tests.
1418.03 s
[vector] iscanr': OK
1418.03 s
[vector] +++ OK, passed 100 tests.
1418.03 s
[vector] mut_read: OK
1418.03 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1418.04 s
[vector] mut_write: OK
1418.04 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1418.04 s
[vector] mut_modify: OK
1418.04 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1418.04 s
[vector] mut_generate: OK
1418.04 s
[vector] +++ OK, passed 100 tests.
1418.05 s
[vector] mut_generateM: OK
1418.05 s
[vector] +++ OK, passed 100 tests.
1418.07 s
[vector] mut_mapM_: OK (0.02s)
1418.07 s
[vector] +++ OK, passed 100 tests.
1418.08 s
[vector] mut_imapM_: OK
1418.08 s
[vector] +++ OK, passed 100 tests.
1418.11 s
[vector] mut_forM_: OK (0.02s)
1418.11 s
[vector] +++ OK, passed 100 tests.
1418.12 s
[vector] mut_iforM_: OK (0.02s)
1418.12 s
[vector] +++ OK, passed 100 tests.
1418.12 s
[vector] mut_foldr: OK
1418.12 s
[vector] +++ OK, passed 100 tests.
1418.12 s
[vector] mut_foldr': OK
1418.12 s
[vector] +++ OK, passed 100 tests.
1418.12 s
[vector] mut_foldl: OK
1418.13 s
[vector] +++ OK, passed 100 tests.
1418.13 s
[vector] mut_foldl': OK
1418.14 s
[vector] +++ OK, passed 100 tests.
1418.14 s
[vector] mut_ifoldr: OK
1418.14 s
[vector] +++ OK, passed 100 tests.
1418.15 s
[vector] mut_ifoldr': OK
1418.15 s
[vector] +++ OK, passed 100 tests.
1418.15 s
[vector] mut_ifoldl: OK
1418.15 s
[vector] +++ OK, passed 100 tests.
1418.15 s
[vector] mut_ifoldl': OK
1418.15 s
[vector] +++ OK, passed 100 tests.
1418.15 s
[vector] mut_foldM: OK
1418.15 s
[vector] +++ OK, passed 100 tests.
1418.15 s
[vector] mut_foldM': OK
1418.16 s
[vector] +++ OK, passed 100 tests.
1418.16 s
[vector] mut_foldrM: OK
1418.16 s
[vector] +++ OK, passed 100 tests.
1418.16 s
[vector] mut_foldrM': OK
1418.17 s
[vector] +++ OK, passed 100 tests.
1418.17 s
[vector] mut_ifoldM: OK
1418.17 s
[vector] +++ OK, passed 100 tests.
1418.17 s
[vector] mut_ifoldM': OK
1418.17 s
[vector] +++ OK, passed 100 tests.
1418.17 s
[vector] mut_ifoldrM: OK
1418.17 s
[vector] +++ OK, passed 100 tests.
1418.17 s
[vector] mut_ifoldrM': OK
1418.17 s
[vector] +++ OK, passed 100 tests.
1418.17 s
[vector] compare: OK
1418.17 s
[vector] +++ OK, passed 100 tests.
1418.17 s
[vector] maximum: OK
1418.17 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1418.17 s
[vector] minimum: OK
1418.17 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1418.17 s
[vector] minIndex: OK
1418.18 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1418.18 s
[vector] maxIndex: OK
1418.18 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1418.18 s
[vector] maximumBy: OK
1418.18 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1418.18 s
[vector] minimumBy: OK
1418.18 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1418.18 s
[vector] maximumOn: OK
1418.18 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1418.18 s
[vector] minimumOn: OK
1418.18 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1418.18 s
[vector] maxIndexBy: OK
1418.18 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1418.18 s
[vector] minIndexBy: OK
1418.18 s
[vector] +++ OK, passed 100 tests; 27 discarded.
1418.18 s
[vector] ListFirstMaxIndexWins: OK
1418.18 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1418.18 s
[vector] FalseListFirstMaxIndexWins: OK
1418.18 s
[vector] +++ OK, failed as expected. (after 1 test):
1418.18 s
[vector] Exception:
1418.18 s
[vector] Prelude.foldr1: empty list
1418.18 s
[vector] CallStack (from HasCallStack):
1418.18 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1418.18 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1418.18 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1418.18 s
[vector] []
1418.18 s
[vector] mempty: OK
1418.18 s
[vector] +++ OK, passed 100 tests.
1418.18 s
[vector] mappend: OK
1418.18 s
[vector] +++ OK, passed 100 tests.
1418.21 s
[vector] mconcat: OK (0.03s)
1418.21 s
[vector] +++ OK, passed 100 tests.
1418.21 s
[vector] glength: OK
1418.21 s
[vector] +++ OK, passed 100 tests.
1418.21 s
[vector] sum: OK
1418.21 s
[vector] +++ OK, passed 100 tests.
1418.21 s
[vector] product: OK
1418.21 s
[vector] +++ OK, passed 100 tests.
1418.22 s
[vector] enumFromN: OK
1418.22 s
[vector] +++ OK, passed 100 tests.
1418.22 s
[vector] enumFromThenN: OK
1418.22 s
[vector] +++ OK, passed 100 tests.
1418.22 s
[vector] enumFromTo: OK
1418.22 s
[vector] +++ OK, passed 100 tests.
1418.22 s
[vector] enumFromThenTo: OK
1418.22 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1418.22 s
[vector] Double
1418.22 s
[vector] fromList.toList == id: OK
1418.22 s
[vector] +++ OK, passed 100 tests.
1418.22 s
[vector] toList.fromList == id: OK
1418.22 s
[vector] +++ OK, passed 100 tests.
1418.22 s
[vector] unstream.stream == id: OK
1418.22 s
[vector] +++ OK, passed 100 tests.
1418.22 s
[vector] stream.unstream == id: OK
1418.22 s
[vector] +++ OK, passed 100 tests.
1418.22 s
[vector] eq: OK
1418.22 s
[vector] +++ OK, passed 100 tests.
1418.22 s
[vector] length: OK
1418.22 s
[vector] +++ OK, passed 100 tests.
1418.23 s
[vector] null: OK
1418.23 s
[vector] +++ OK, passed 100 tests.
1418.23 s
[vector] index: OK
1418.23 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1418.23 s
[vector] safeIndex: OK
1418.23 s
[vector] +++ OK, passed 100 tests.
1418.23 s
[vector] head: OK
1418.23 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1418.23 s
[vector] last: OK
1418.23 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1418.23 s
[vector] unsafeIndex: OK
1418.24 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1418.24 s
[vector] unsafeHead: OK
1418.24 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1418.24 s
[vector] unsafeLast: OK
1418.24 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1418.24 s
[vector] slice: OK
1418.24 s
[vector] +++ OK, passed 100 tests.
1418.24 s
[vector] init: OK
1418.24 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1418.24 s
[vector] tail: OK
1418.24 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1418.24 s
[vector] take: OK
1418.24 s
[vector] +++ OK, passed 100 tests.
1418.24 s
[vector] drop: OK
1418.24 s
[vector] +++ OK, passed 100 tests.
1418.25 s
[vector] splitAt: OK
1418.25 s
[vector] +++ OK, passed 100 tests.
1418.25 s
[vector] empty: OK
1418.25 s
[vector] +++ OK, passed 100 tests.
1418.25 s
[vector] singleton: OK
1418.25 s
[vector] +++ OK, passed 100 tests.
1418.26 s
[vector] replicate: OK
1418.26 s
[vector] +++ OK, passed 100 tests.
1418.26 s
[vector] generate: OK
1418.26 s
[vector] +++ OK, passed 100 tests.
1418.26 s
[vector] iterateN: OK
1418.26 s
[vector] +++ OK, passed 100 tests.
1418.32 s
[vector] iterateNM: OK (0.04s)
1418.32 s
[vector] +++ OK, passed 100 tests.
1418.36 s
[vector] generateM: OK (0.04s)
1418.36 s
[vector] +++ OK, passed 100 tests.
1418.38 s
[vector] replicateM: OK (0.03s)
1418.38 s
[vector] +++ OK, passed 100 tests.
1418.38 s
[vector] create: OK
1418.38 s
[vector] +++ OK, passed 100 tests.
1418.38 s
[vector] createT: OK
1418.38 s
[vector] +++ OK, passed 100 tests.
1418.38 s
[vector] unfoldr: OK
1418.38 s
[vector] +++ OK, passed 100 tests.
1418.39 s
[vector] unfoldrN: OK
1418.39 s
[vector] +++ OK, passed 100 tests.
1418.39 s
[vector] unfoldrExactN: OK
1418.39 s
[vector] +++ OK, passed 100 tests.
1418.39 s
[vector] unfoldrM: OK
1418.39 s
[vector] +++ OK, passed 100 tests.
1418.40 s
[vector] unfoldrNM: OK
1418.40 s
[vector] +++ OK, passed 100 tests.
1418.42 s
[vector] unfoldrExactNM: OK (0.02s)
1418.42 s
[vector] +++ OK, passed 100 tests.
1418.43 s
[vector] constructN: OK (0.01s)
1418.43 s
[vector] +++ OK, passed 100 tests.
1418.44 s
[vector] constructrN: OK (0.01s)
1418.44 s
[vector] +++ OK, passed 100 tests.
1418.44 s
[vector] cons: OK
1418.44 s
[vector] +++ OK, passed 100 tests.
1418.44 s
[vector] snoc: OK
1418.44 s
[vector] +++ OK, passed 100 tests.
1418.44 s
[vector] append: OK
1418.44 s
[vector] +++ OK, passed 100 tests.
1418.46 s
[vector] concat: OK (0.03s)
1418.47 s
[vector] +++ OK, passed 100 tests.
1418.48 s
[vector] force: OK
1418.48 s
[vector] +++ OK, passed 100 tests.
1418.50 s
[vector] upd: OK
1418.50 s
[vector] +++ OK, passed 100 tests.
1418.50 s
[vector] accum: OK (0.02s)
1418.50 s
[vector] +++ OK, passed 100 tests.
1418.50 s
[vector] reverse: OK
1418.50 s
[vector] +++ OK, passed 100 tests.
1418.50 s
[vector] backpermute: OK
1418.50 s
[vector] +++ OK, passed 100 tests.
1418.51 s
[vector] map: OK
1418.51 s
[vector] +++ OK, passed 100 tests.
1418.52 s
[vector] imap: OK
1418.52 s
[vector] +++ OK, passed 100 tests.
1418.52 s
[vector] concatMap: OK
1418.52 s
[vector] +++ OK, passed 100 tests.
1418.52 s
[vector] mapM: OK
1418.52 s
[vector] +++ OK, passed 100 tests.
1418.58 s
[vector] mapM_: OK (0.04s)
1418.58 s
[vector] +++ OK, passed 100 tests.
1418.60 s
[vector] forM: OK (0.02s)
1418.60 s
[vector] +++ OK, passed 100 tests.
1418.65 s
[vector] forM_: OK (0.05s)
1418.66 s
[vector] +++ OK, passed 100 tests.
1418.66 s
[vector] imapM: OK (0.01s)
1418.66 s
[vector] +++ OK, passed 100 tests.
1418.70 s
[vector] imapM_: OK (0.04s)
1418.70 s
[vector] +++ OK, passed 100 tests.
1418.71 s
[vector] zipWith: OK (0.01s)
1418.72 s
[vector] +++ OK, passed 100 tests.
1418.72 s
[vector] zipWith3: OK (0.01s)
1418.72 s
[vector] +++ OK, passed 100 tests.
1418.74 s
[vector] izipWith: OK (0.03s)
1418.74 s
[vector] +++ OK, passed 100 tests.
1418.76 s
[vector] izipWith3: OK (0.02s)
1418.76 s
[vector] +++ OK, passed 100 tests.
1418.78 s
[vector] izipWithM: OK (0.01s)
1418.78 s
[vector] +++ OK, passed 100 tests.
1418.82 s
[vector] izipWithM_: OK (0.04s)
1418.82 s
[vector] +++ OK, passed 100 tests.
1418.84 s
[vector] zipWithM: OK (0.02s)
1418.84 s
[vector] +++ OK, passed 100 tests.
1418.89 s
[vector] zipWithM_: OK (0.05s)
1418.90 s
[vector] +++ OK, passed 100 tests.
1418.90 s
[vector] filter: OK (0.01s)
1418.92 s
[vector] +++ OK, passed 100 tests.
1418.92 s
[vector] ifilter: OK (0.01s)
1418.92 s
[vector] +++ OK, passed 100 tests.
1418.98 s
[vector] filterM: OK (0.07s)
1418.98 s
[vector] +++ OK, passed 100 tests.
1418.98 s
[vector] uniq: OK
1418.98 s
[vector] +++ OK, passed 100 tests.
1419.00 s
[vector] mapMaybe: OK (0.01s)
1419.00 s
[vector] +++ OK, passed 100 tests.
1419.00 s
[vector] imapMaybe: OK
1419.00 s
[vector] +++ OK, passed 100 tests.
1419.00 s
[vector] takeWhile: OK
1419.00 s
[vector] +++ OK, passed 100 tests.
1419.01 s
[vector] dropWhile: OK
1419.01 s
[vector] +++ OK, passed 100 tests.
1419.01 s
[vector] partition: OK
1419.01 s
[vector] +++ OK, passed 100 tests.
1419.02 s
[vector] partitionWith: OK
1419.02 s
[vector] +++ OK, passed 100 tests.
1419.02 s
[vector] span: OK
1419.02 s
[vector] +++ OK, passed 100 tests.
1419.02 s
[vector] break: OK
1419.02 s
[vector] +++ OK, passed 100 tests.
1419.02 s
[vector] spanR: OK
1419.02 s
[vector] +++ OK, passed 100 tests.
1419.02 s
[vector] breakR: OK
1419.04 s
[vector] +++ OK, passed 100 tests.
1419.04 s
[vector] groupBy: OK (0.02s)
1419.04 s
[vector] +++ OK, passed 100 tests.
1419.04 s
[vector] elem: OK
1419.04 s
[vector] +++ OK, passed 100 tests.
1419.04 s
[vector] notElem: OK
1419.05 s
[vector] +++ OK, passed 100 tests.
1419.05 s
[vector] find: OK
1419.05 s
[vector] +++ OK, passed 100 tests.
1419.05 s
[vector] findIndex: OK
1419.05 s
[vector] +++ OK, passed 100 tests.
1419.05 s
[vector] findIndexR: OK
1419.06 s
[vector] +++ OK, passed 100 tests.
1419.06 s
[vector] findIndices: OK (0.01s)
1419.06 s
[vector] +++ OK, passed 100 tests.
1419.07 s
[vector] elemIndex: OK
1419.07 s
[vector] +++ OK, passed 100 tests.
1419.07 s
[vector] elemIndices: OK
1419.08 s
[vector] +++ OK, passed 100 tests.
1419.10 s
[vector] foldl: OK (0.02s)
1419.10 s
[vector] +++ OK, passed 100 tests.
1419.10 s
[vector] foldl1: OK (0.02s)
1419.10 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1419.12 s
[vector] foldl': OK (0.01s)
1419.12 s
[vector] +++ OK, passed 100 tests.
1419.16 s
[vector] foldl1': OK (0.02s)
1419.16 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1419.18 s
[vector] foldr: OK (0.02s)
1419.18 s
[vector] +++ OK, passed 100 tests.
1419.20 s
[vector] foldr1: OK (0.02s)
1419.20 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1419.20 s
[vector] foldr': OK (0.02s)
1419.20 s
[vector] +++ OK, passed 100 tests.
1419.24 s
[vector] foldr1': OK (0.03s)
1419.24 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1419.28 s
[vector] ifoldl: OK (0.04s)
1419.28 s
[vector] +++ OK, passed 100 tests.
1419.30 s
[vector] ifoldl': OK (0.03s)
1419.30 s
[vector] +++ OK, passed 100 tests.
1419.34 s
[vector] ifoldr: OK (0.03s)
1419.34 s
[vector] +++ OK, passed 100 tests.
1419.35 s
[vector] ifoldr': OK (0.03s)
1419.35 s
[vector] +++ OK, passed 100 tests.
1419.40 s
[vector] ifoldM: OK (0.02s)
1419.40 s
[vector] +++ OK, passed 100 tests.
1419.42 s
[vector] ifoldM': OK (0.02s)
1419.42 s
[vector] +++ OK, passed 100 tests.
1419.44 s
[vector] ifoldM_: OK (0.03s)
1419.44 s
[vector] +++ OK, passed 100 tests.
1419.47 s
[vector] ifoldM'_: OK (0.04s)
1419.47 s
[vector] +++ OK, passed 100 tests.
1419.48 s
[vector] all: OK
1419.48 s
[vector] +++ OK, passed 100 tests.
1419.48 s
[vector] any: OK
1419.48 s
[vector] +++ OK, passed 100 tests.
1419.50 s
[vector] prescanl: OK (0.01s)
1419.50 s
[vector] +++ OK, passed 100 tests.
1419.52 s
[vector] prescanl': OK (0.02s)
1419.52 s
[vector] +++ OK, passed 100 tests.
1419.54 s
[vector] postscanl: OK (0.02s)
1419.54 s
[vector] +++ OK, passed 100 tests.
1419.56 s
[vector] postscanl': OK (0.02s)
1419.56 s
[vector] +++ OK, passed 100 tests.
1419.56 s
[vector] scanl: OK (0.02s)
1419.56 s
[vector] +++ OK, passed 100 tests.
1419.58 s
[vector] scanl': OK (0.01s)
1419.58 s
[vector] +++ OK, passed 100 tests.
1419.60 s
[vector] scanl1: OK (0.02s)
1419.60 s
[vector] +++ OK, passed 100 tests.
1419.60 s
[pandoc-lua-engine] Phase: updateAutotoolsGnuConfigScriptsPhase
1419.61 s
[vector] scanl1': OK (0.01s)
1419.61 s
[pandoc-lua-engine] Phase: configurePhase
1419.62 s
[vector] +++ OK, passed 100 tests.
1419.62 s
[vector] iscanl: OK (0.02s)
1419.62 s
[vector] +++ OK, passed 100 tests.
1419.62 s
[pandoc-lua-engine] configureFlags: --verbose --prefix=/nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc/share/doc/pandoc-lua-engine-0.4.3 --with-gcc=gcc --package-db=/build/tmp.dXHKZTBIpZ/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
1419.63 s
[pandoc-lua-engine] Using Parsec parser
1419.63 s
[pandoc-lua-engine] Configuring pandoc-lua-engine-0.4.3...
1419.64 s
[vector] iscanl': OK (0.02s)
1419.64 s
[vector] +++ OK, passed 100 tests.
1419.66 s
[vector] prescanr: OK (0.02s)
1419.66 s
[vector] +++ OK, passed 100 tests.
1419.68 s
[vector] prescanr': OK (0.02s)
1419.68 s
[vector] +++ OK, passed 100 tests.
1419.70 s
[vector] postscanr: OK (0.01s)
1419.70 s
[vector] +++ OK, passed 100 tests.
1419.70 s
[vector] postscanr': OK (0.01s)
1419.70 s
[vector] +++ OK, passed 100 tests.
1419.72 s
[vector] scanr: OK (0.02s)
1419.72 s
[vector] +++ OK, passed 100 tests.
1419.76 s
[vector] scanr': OK (0.03s)
1419.76 s
[vector] +++ OK, passed 100 tests.
1419.77 s
[vector] scanr1: OK (0.02s)
1419.77 s
[vector] +++ OK, passed 100 tests.
1419.78 s
[vector] scanr1': OK
1419.78 s
[vector] +++ OK, passed 100 tests.
1419.80 s
[vector] iscanr: OK
1419.80 s
[vector] +++ OK, passed 100 tests.
1419.82 s
[vector] iscanr': OK (0.02s)
1419.82 s
[vector] +++ OK, passed 100 tests.
1419.82 s
[vector] mut_read: OK
1419.84 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1419.84 s
[vector] mut_write: OK
1419.84 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1419.84 s
[vector] mut_modify: OK
1419.84 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1419.84 s
[vector] mut_generate: OK
1419.84 s
[vector] +++ OK, passed 100 tests.
1419.86 s
[vector] mut_generateM: OK (0.02s)
1419.86 s
[vector] +++ OK, passed 100 tests.
1419.88 s
[pandoc-server] Phase: updateAutotoolsGnuConfigScriptsPhase
1419.89 s
[pandoc-server] Phase: configurePhase
1419.90 s
[vector] mut_mapM_: OK (0.04s)
1419.90 s
[vector] +++ OK, passed 100 tests.
1419.90 s
[pandoc-server] configureFlags: --verbose --prefix=/nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc/share/doc/pandoc-server-0.1.0.11 --with-gcc=gcc --package-db=/build/tmp.QfXhG0cDsW/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
1419.91 s
[pandoc-server] Using Parsec parser
1419.91 s
[pandoc-server] Configuring pandoc-server-0.1.0.11...
1419.94 s
[vector] mut_imapM_: OK (0.04s)
1419.94 s
[vector] +++ OK, passed 100 tests.
1419.96 s
[vector] mut_forM_: OK (0.04s)
1419.96 s
[vector] +++ OK, passed 100 tests.
1420.00 s
[vector] mut_iforM_: OK (0.04s)
1420.00 s
[vector] +++ OK, passed 100 tests.
1420.02 s
[vector] mut_foldr: OK (0.01s)
1420.02 s
[vector] +++ OK, passed 100 tests.
1420.04 s
[vector] mut_foldr': OK (0.01s)
1420.04 s
[vector] +++ OK, passed 100 tests.
1420.06 s
[vector] mut_foldl: OK (0.01s)
1420.06 s
[vector] +++ OK, passed 100 tests.
1420.06 s
[vector] mut_foldl': OK (0.01s)
1420.08 s
[vector] +++ OK, passed 100 tests.
1420.08 s
[vector] mut_ifoldr: OK (0.01s)
1420.10 s
[vector] +++ OK, passed 100 tests.
1420.10 s
[vector] mut_ifoldr': OK (0.02s)
1420.10 s
[vector] +++ OK, passed 100 tests.
1420.11 s
[vector] mut_ifoldl: OK (0.02s)
1420.11 s
[vector] +++ OK, passed 100 tests.
1420.11 s
[vector] mut_ifoldl': OK (0.01s)
1420.11 s
[vector] +++ OK, passed 100 tests.
1420.14 s
[vector] mut_foldM: OK (0.01s)
1420.14 s
[vector] +++ OK, passed 100 tests.
1420.16 s
[vector] mut_foldM': OK (0.02s)
1420.16 s
[vector] +++ OK, passed 100 tests.
1420.18 s
[vector] mut_foldrM: OK (0.02s)
1420.18 s
[vector] +++ OK, passed 100 tests.
1420.19 s
[vector] mut_foldrM': OK (0.02s)
1420.19 s
[vector] +++ OK, passed 100 tests.
1420.19 s
[vector] mut_ifoldM: OK (0.02s)
1420.19 s
[vector] +++ OK, passed 100 tests.
1420.22 s
[vector] mut_ifoldM': OK (0.02s)
1420.22 s
[vector] +++ OK, passed 100 tests.
1420.24 s
[vector] mut_ifoldrM: OK (0.02s)
1420.24 s
[vector] +++ OK, passed 100 tests.
1420.27 s
[vector] mut_ifoldrM': OK (0.03s)
1420.27 s
[vector] +++ OK, passed 100 tests.
1420.27 s
[vector] compare: OK
1420.27 s
[vector] +++ OK, passed 100 tests.
1420.27 s
[vector] maximum: OK
1420.27 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1420.27 s
[vector] minimum: OK
1420.27 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1420.27 s
[vector] minIndex: OK
1420.27 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1420.27 s
[vector] maxIndex: OK
1420.27 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1420.27 s
[vector] maximumBy: OK
1420.28 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1420.28 s
[vector] minimumBy: OK
1420.28 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1420.28 s
[vector] maximumOn: OK
1420.28 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1420.28 s
[vector] minimumOn: OK
1420.28 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1420.28 s
[vector] maxIndexBy: OK
1420.28 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1420.28 s
[vector] minIndexBy: OK
1420.28 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1420.29 s
[vector] ListFirstMaxIndexWins: OK
1420.29 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1420.29 s
[vector] FalseListFirstMaxIndexWins: OK
1420.29 s
[vector] +++ OK, failed as expected. (after 1 test):
1420.29 s
[vector] Exception:
1420.29 s
[vector] Prelude.foldr1: empty list
1420.29 s
[vector] CallStack (from HasCallStack):
1420.29 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1420.29 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1420.29 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1420.29 s
[vector] []
1420.29 s
[vector] mempty: OK
1420.29 s
[vector] +++ OK, passed 100 tests.
1420.29 s
[vector] mappend: OK
1420.29 s
[vector] +++ OK, passed 100 tests.
1420.33 s
[vector] mconcat: OK (0.04s)
1420.94 s
[vector] +++ OK, passed 100 tests.
1420.94 s
[vector] glength: OK
1420.94 s
[vector] +++ OK, passed 100 tests.
1420.94 s
[vector] sum: OK
1420.94 s
[vector] +++ OK, passed 100 tests.
1420.94 s
[vector] product: OK
1420.94 s
[vector] +++ OK, passed 100 tests.
1420.94 s
[vector] enumFromN: OK
1420.94 s
[vector] +++ OK, passed 100 tests.
1420.94 s
[vector] enumFromThenN: OK
1420.94 s
[vector] +++ OK, passed 100 tests.
1420.94 s
[vector] enumFromTo: OK
1420.94 s
[vector] +++ OK, passed 100 tests.
1420.94 s
[vector] enumFromThenTo: OK
1420.94 s
[vector] +++ OK, passed 100 tests.
1420.94 s
[vector] unstream
1420.94 s
[vector] unstream == vunstream (exact): OK
1420.94 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] unstream == vunstream (unknown): OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] unstreamR ~= vunstream (exact): OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] unstreamR ~= vunstream (unknown): OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] Tests.Vector.Storable
1420.95 s
[vector] Data.Vector.Storable.Vector (Int)
1420.95 s
[vector] fromList.toList == id: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] toList.fromList == id: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] unstream.stream == id: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] stream.unstream == id: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] eq: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] length: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] null: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] index: OK
1420.95 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1420.95 s
[vector] safeIndex: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] head: OK
1420.95 s
[vector] +++ OK, passed 100 tests; 10 discarded.
1420.95 s
[vector] last: OK
1420.95 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1420.95 s
[vector] unsafeIndex: OK
1420.95 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1420.95 s
[vector] unsafeHead: OK
1420.95 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1420.95 s
[vector] unsafeLast: OK
1420.95 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1420.95 s
[vector] slice: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] init: OK
1420.95 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1420.95 s
[vector] tail: OK
1420.95 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1420.95 s
[vector] take: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] drop: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] splitAt: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] empty: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] singleton: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] replicate: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] generate: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] iterateN: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] iterateNM: OK (0.03s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] generateM: OK (0.03s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] replicateM: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] create: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] createT: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] unfoldr: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] unfoldrN: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] unfoldrExactN: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] unfoldrM: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] unfoldrNM: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] unfoldrExactNM: OK (0.02s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] constructN: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] constructrN: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] cons: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] snoc: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] append: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] concat: OK (0.01s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] force: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] upd: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] accum: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] reverse: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] backpermute: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] map: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] imap: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] concatMap: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] mapM: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] mapM_: OK (0.02s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] forM: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] forM_: OK (0.01s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] imapM: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] imapM_: OK (0.01s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] zipWith: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] zipWith3: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] izipWith: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] izipWith3: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] izipWithM: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] izipWithM_: OK (0.02s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] zipWithM: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] zipWithM_: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] filter: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] ifilter: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] filterM: OK (0.02s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] uniq: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] mapMaybe: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] imapMaybe: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] takeWhile: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] dropWhile: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] partition: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] partitionWith: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] span: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] break: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] spanR: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] breakR: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] groupBy: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] elem: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] notElem: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] find: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] findIndex: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] findIndexR: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] findIndices: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] elemIndex: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] elemIndices: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] foldl: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] foldl1: OK
1420.95 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1420.95 s
[vector] foldl': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] foldl1': OK
1420.95 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1420.95 s
[vector] foldr: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] foldr1: OK
1420.95 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1420.95 s
[vector] foldr': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] foldr1': OK
1420.95 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1420.95 s
[vector] ifoldl: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] ifoldl': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] ifoldr: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] ifoldr': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] ifoldM: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] ifoldM': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] ifoldM_: OK (0.01s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] ifoldM'_: OK (0.02s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] all: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] any: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] prescanl: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] prescanl': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] postscanl: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] postscanl': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] scanl: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] scanl': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] scanl1: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] scanl1': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] iscanl: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] iscanl': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] prescanr: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] prescanr': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] postscanr: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] postscanr': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] scanr: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] scanr': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] scanr1: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] scanr1': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] iscanr: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] iscanr': OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] mut_read: OK
1420.95 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1420.95 s
[vector] mut_write: OK
1420.95 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1420.95 s
[vector] mut_modify: OK
1420.95 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1420.95 s
[vector] mut_generate: OK
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] mut_generateM: OK (0.01s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] mut_mapM_: OK (0.02s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] mut_imapM_: OK (0.01s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[vector] mut_forM_: OK (0.02s)
1420.95 s
[vector] +++ OK, passed 100 tests.
1420.95 s
[pandoc-lua-engine] Dependency aeson: using aeson-2.2.3.0
1420.95 s
[pandoc-lua-engine] Dependency base >=4.12 && <5: using base-4.20.2.0
1420.95 s
[pandoc-lua-engine] Dependency bytestring >=0.9 && <0.13: using bytestring-0.12.2.0
1420.95 s
[pandoc-lua-engine] Dependency citeproc >=0.8 && <0.10: using citeproc-0.9.0.1
1420.95 s
[pandoc-lua-engine] Dependency containers >=0.6.0.1 && <0.9: using containers-0.7
1420.95 s
[pandoc-lua-engine] Dependency crypton >=0.30 && <1.1: using crypton-1.0.4
1420.95 s
[pandoc-lua-engine] Dependency data-default >=0.4 && <0.9: using data-default-0.8.0.1
1420.96 s
[pandoc-lua-engine] Dependency doclayout >=0.5 && <0.6: using doclayout-0.5.0.1
1420.96 s
[pandoc-lua-engine] Dependency doctemplates >=0.11 && <0.12: using doctemplates-0.11.0.1
1420.96 s
[pandoc-lua-engine] Dependency exceptions >=0.8 && <0.11: using exceptions-0.10.9
1420.96 s
[pandoc-lua-engine] Dependency hslua >=2.3 && <2.5: using hslua-2.3.1
1420.96 s
[pandoc-lua-engine] Dependency hslua-module-doclayout >=1.2 && <1.3: using
1420.96 s
[pandoc-lua-engine] hslua-module-doclayout-1.2.0.1
1420.96 s
[pandoc-lua-engine] Dependency hslua-module-path >=1.1 && <1.2: using hslua-module-path-1.1.1
1420.96 s
[pandoc-lua-engine] Dependency hslua-module-system >=1.1 && <1.3: using hslua-module-system-1.1.3
1420.96 s
[pandoc-lua-engine] Dependency hslua-module-text >=1.1 && <1.2: using hslua-module-text-1.1.1
1420.96 s
[pandoc-lua-engine] Dependency hslua-module-version >=1.1 && <1.2: using
1420.96 s
[pandoc-lua-engine] hslua-module-version-1.1.1
1420.96 s
[pandoc-lua-engine] Dependency hslua-module-zip >=1.1.3 && <1.2: using hslua-module-zip-1.1.4
1420.96 s
[pandoc-lua-engine] Dependency hslua-repl >=0.1.1 && <0.2: using hslua-repl-0.1.2
1420.96 s
[pandoc-lua-engine] Dependency lpeg >=1.1 && <1.2: using lpeg-1.1.0
1420.96 s
[pandoc-lua-engine] Dependency mtl >=2.2 && <2.4: using mtl-2.3.1
1420.96 s
[pandoc-lua-engine] Dependency pandoc >=3.7 && <3.8: using pandoc-3.7.0.2
1420.96 s
[pandoc-lua-engine] Dependency pandoc-lua-marshal >=0.3 && <0.4: using pandoc-lua-marshal-0.3.1
1420.96 s
[pandoc-lua-engine] Dependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
1420.96 s
[pandoc-lua-engine] Dependency parsec >=3.1 && <3.2: using parsec-3.1.18.0
1420.96 s
[pandoc-lua-engine] Dependency text >=1.1.1 && <2.2: using text-2.1.3
1420.96 s
[pandoc-lua-engine] Dependency base >=4.12 && <5: using base-4.20.2.0
1420.96 s
[pandoc-lua-engine] Dependency bytestring: using bytestring-0.12.2.0
1420.96 s
[pandoc-lua-engine] Dependency data-default: using data-default-0.8.0.1
1420.96 s
[pandoc-lua-engine] Dependency directory: using directory-1.3.8.5
1420.96 s
[pandoc-lua-engine] Dependency exceptions >=0.8 && <0.11: using exceptions-0.10.9
1420.96 s
[pandoc-lua-engine] Dependency filepath: using filepath-1.5.4.0
1420.96 s
[pandoc-lua-engine] Dependency hslua >=2.3 && <2.5: using hslua-2.3.1
1420.96 s
[pandoc-lua-engine] Dependency pandoc: using pandoc-3.7.0.2
1420.96 s
[pandoc-lua-engine] Dependency pandoc-lua-engine: using pandoc-lua-engine-0.4.3
1420.96 s
[pandoc-lua-engine] Dependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
1420.96 s
[pandoc-lua-engine] Dependency tasty: using tasty-1.5.3
1420.96 s
[pandoc-lua-engine] Dependency tasty-golden: using tasty-golden-2.3.5
1420.96 s
[pandoc-lua-engine] Dependency tasty-hunit: using tasty-hunit-0.10.2
1420.96 s
[pandoc-lua-engine] Dependency tasty-lua >=1.1 && <1.2: using tasty-lua-1.1.2
1420.96 s
[pandoc-lua-engine] Dependency text >=1.1.1 && <2.2: using text-2.1.3
1420.96 s
[pandoc-lua-engine] Source component graph:
1420.96 s
[pandoc-lua-engine] component lib
1420.96 s
[pandoc-lua-engine] component test:test-pandoc-lua-engine dependency lib
1420.96 s
[pandoc-lua-engine] Configured component graph:
1420.96 s
[pandoc-lua-engine] component pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
1420.96 s
[pandoc-lua-engine] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
1420.96 s
[pandoc-lua-engine] include base-4.20.2.0-64da
1420.96 s
[pandoc-lua-engine] include bytestring-0.12.2.0-262e
1420.96 s
[pandoc-lua-engine] include citeproc-0.9.0.1-8eZIkwGUgwZIclKUEeSqkh
1420.96 s
[pandoc-lua-engine] include containers-0.7-504a
1420.96 s
[pandoc-lua-engine] include crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
1420.96 s
[pandoc-lua-engine] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
1420.96 s
[pandoc-lua-engine] include doclayout-0.5.0.1-ETXOcBr0tml6gEsSGXL6oV
1420.96 s
[pandoc-lua-engine] include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
1420.96 s
[pandoc-lua-engine] include exceptions-0.10.9-1a12
1420.96 s
[pandoc-lua-engine] include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
1420.96 s
[pandoc-lua-engine] include hslua-module-doclayout-1.2.0.1-ErY6mbvHQgAEdxA7VP30qJ
1420.96 s
[pandoc-lua-engine] include hslua-module-path-1.1.1-u1nrCdvNoJBLk9wjMCk0d
1420.96 s
[pandoc-lua-engine] include hslua-module-system-1.1.3-C64Ey1CTges1ct5bp4x6FI
1420.96 s
[pandoc-lua-engine] include hslua-module-text-1.1.1-KHVA6Tk8C366LjT6lG2vsI
1420.96 s
[pandoc-lua-engine] include hslua-module-version-1.1.1-31iUzkcfJgL8o5QdosdhcV
1420.96 s
[pandoc-lua-engine] include hslua-module-zip-1.1.4-7o7wUu0Aa5uJq1MktjFd3a
1420.96 s
[pandoc-lua-engine] include hslua-repl-0.1.2-Juvw7nYrTHo9eZBtoxILD7
1420.96 s
[pandoc-lua-engine] include lpeg-1.1.0-84tlw7PTtFB7quUkAvIAre
1420.96 s
[pandoc-lua-engine] include mtl-2.3.1-b4af
1420.96 s
[pandoc-lua-engine] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
1420.96 s
[pandoc-lua-engine] include pandoc-lua-marshal-0.3.1-CEai8TZ59D36cGPSocsWLC
1420.96 s
[pandoc-lua-engine] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
1420.96 s
[pandoc-lua-engine] include parsec-3.1.18.0-b178
1420.96 s
[pandoc-lua-engine] include text-2.1.3-c691
1420.96 s
[pandoc-lua-engine] component pandoc-lua-engine-0.4.3-3LEmP89EEdjCRAN3LsL1y3-test-pandoc-lua-engine
1420.96 s
[pandoc-lua-engine] include base-4.20.2.0-64da
1420.96 s
[pandoc-lua-engine] include bytestring-0.12.2.0-262e
1420.96 s
[pandoc-lua-engine] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
1420.96 s
[pandoc-lua-engine] include directory-1.3.8.5-c84a
1420.96 s
[pandoc-lua-engine] include exceptions-0.10.9-1a12
1420.96 s
[pandoc-lua-engine] include filepath-1.5.4.0-e600
1420.96 s
[pandoc-lua-engine] include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
1420.96 s
[pandoc-lua-engine] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
1420.96 s
[pandoc-lua-engine] include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
1420.96 s
[pandoc-lua-engine] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
1420.96 s
[pandoc-lua-engine] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
1420.96 s
[pandoc-lua-engine] include tasty-golden-2.3.5-3QQ0reIfFJ36gfVIlepFcf
1420.96 s
[pandoc-lua-engine] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
1420.96 s
[pandoc-lua-engine] include tasty-lua-1.1.2-1O8o765OPu9IHWrmpruNIo
1420.96 s
[pandoc-lua-engine] include text-2.1.3-c691
1420.96 s
[pandoc-lua-engine] Linked component graph:
1420.96 s
[pandoc-lua-engine] unit pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
1420.96 s
[pandoc-lua-engine] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
1420.96 s
[pandoc-lua-engine] include base-4.20.2.0-64da
1420.96 s
[pandoc-lua-engine] include bytestring-0.12.2.0-262e
1420.96 s
[pandoc-lua-engine] include citeproc-0.9.0.1-8eZIkwGUgwZIclKUEeSqkh
1420.96 s
[pandoc-lua-engine] include containers-0.7-504a
1420.96 s
[pandoc-lua-engine] include crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
1420.96 s
[pandoc-lua-engine] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
1420.96 s
[pandoc-lua-engine] include doclayout-0.5.0.1-ETXOcBr0tml6gEsSGXL6oV
1420.96 s
[pandoc-lua-engine] include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
1420.96 s
[pandoc-lua-engine] include exceptions-0.10.9-1a12
1420.96 s
[pandoc-lua-engine] include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
1420.96 s
[pandoc-lua-engine] include hslua-module-doclayout-1.2.0.1-ErY6mbvHQgAEdxA7VP30qJ
1420.96 s
[pandoc-lua-engine] include hslua-module-path-1.1.1-u1nrCdvNoJBLk9wjMCk0d
1420.96 s
[pandoc-lua-engine] include hslua-module-system-1.1.3-C64Ey1CTges1ct5bp4x6FI
1420.96 s
[pandoc-lua-engine] include hslua-module-text-1.1.1-KHVA6Tk8C366LjT6lG2vsI
1420.96 s
[pandoc-lua-engine] include hslua-module-version-1.1.1-31iUzkcfJgL8o5QdosdhcV
1420.96 s
[pandoc-lua-engine] include hslua-module-zip-1.1.4-7o7wUu0Aa5uJq1MktjFd3a
1420.96 s
[pandoc-lua-engine] include hslua-repl-0.1.2-Juvw7nYrTHo9eZBtoxILD7
1420.96 s
[pandoc-lua-engine] include lpeg-1.1.0-84tlw7PTtFB7quUkAvIAre
1420.96 s
[pandoc-lua-engine] include mtl-2.3.1-b4af
1420.96 s
[pandoc-lua-engine] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
1420.96 s
[pandoc-lua-engine] include pandoc-lua-marshal-0.3.1-CEai8TZ59D36cGPSocsWLC
1420.96 s
[pandoc-lua-engine] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
1420.96 s
[pandoc-lua-engine] include parsec-3.1.18.0-b178
1420.96 s
[pandoc-lua-engine] include text-2.1.3-c691
1420.96 s
[pandoc-lua-engine] Text.Pandoc.Lua=pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4:Text.Pandoc.Lua
1420.96 s
[pandoc-lua-engine] unit pandoc-lua-engine-0.4.3-3LEmP89EEdjCRAN3LsL1y3-test-pandoc-lua-engine
1420.96 s
[pandoc-lua-engine] include base-4.20.2.0-64da
1420.96 s
[pandoc-lua-engine] include bytestring-0.12.2.0-262e
1420.96 s
[pandoc-lua-engine] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
1420.96 s
[pandoc-lua-engine] include directory-1.3.8.5-c84a
1420.96 s
[pandoc-lua-engine] include exceptions-0.10.9-1a12
1420.96 s
[pandoc-lua-engine] include filepath-1.5.4.0-e600
1420.96 s
[pandoc-lua-engine] include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
1420.96 s
[pandoc-lua-engine] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
1420.96 s
[pandoc-lua-engine] include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
1420.96 s
[pandoc-lua-engine] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
1420.96 s
[pandoc-lua-engine] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
1420.96 s
[pandoc-lua-engine] include tasty-golden-2.3.5-3QQ0reIfFJ36gfVIlepFcf
1420.96 s
[pandoc-lua-engine] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
1420.96 s
[pandoc-lua-engine] include tasty-lua-1.1.2-1O8o765OPu9IHWrmpruNIo
1420.96 s
[pandoc-lua-engine] include text-2.1.3-c691
1420.96 s
[pandoc-lua-engine] Ready component graph:
1420.96 s
[pandoc-lua-engine] definite pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
1420.96 s
[pandoc-lua-engine] depends aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
1420.96 s
[pandoc-lua-engine] depends base-4.20.2.0-64da
1420.96 s
[pandoc-lua-engine] depends bytestring-0.12.2.0-262e
1420.96 s
[pandoc-lua-engine] depends citeproc-0.9.0.1-8eZIkwGUgwZIclKUEeSqkh
1420.96 s
[pandoc-lua-engine] depends containers-0.7-504a
1420.96 s
[pandoc-lua-engine] depends crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
1420.96 s
[pandoc-lua-engine] depends data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
1420.96 s
[pandoc-lua-engine] depends doclayout-0.5.0.1-ETXOcBr0tml6gEsSGXL6oV
1420.96 s
[pandoc-lua-engine] depends doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
1420.96 s
[pandoc-lua-engine] depends exceptions-0.10.9-1a12
1420.96 s
[pandoc-lua-engine] depends hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
1420.96 s
[pandoc-lua-engine] depends hslua-module-doclayout-1.2.0.1-ErY6mbvHQgAEdxA7VP30qJ
1420.96 s
[pandoc-lua-engine] depends hslua-module-path-1.1.1-u1nrCdvNoJBLk9wjMCk0d
1420.96 s
[pandoc-lua-engine] depends hslua-module-system-1.1.3-C64Ey1CTges1ct5bp4x6FI
1420.96 s
[pandoc-lua-engine] depends hslua-module-text-1.1.1-KHVA6Tk8C366LjT6lG2vsI
1420.96 s
[pandoc-lua-engine] depends hslua-module-version-1.1.1-31iUzkcfJgL8o5QdosdhcV
1420.96 s
[pandoc-lua-engine] depends hslua-module-zip-1.1.4-7o7wUu0Aa5uJq1MktjFd3a
1420.96 s
[pandoc-lua-engine] depends hslua-repl-0.1.2-Juvw7nYrTHo9eZBtoxILD7
1420.96 s
[pandoc-lua-engine] depends lpeg-1.1.0-84tlw7PTtFB7quUkAvIAre
1420.96 s
[pandoc-lua-engine] depends mtl-2.3.1-b4af
1420.96 s
[pandoc-lua-engine] depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
1420.96 s
[vector] mut_iforM_: OK (0.02s)
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_foldr: OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_foldr': OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_foldl: OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_foldl': OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_ifoldr: OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_ifoldr': OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_ifoldl: OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_ifoldl': OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_foldM: OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_foldM': OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_foldrM: OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_foldrM': OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_ifoldM: OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_ifoldM': OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_ifoldrM: OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mut_ifoldrM': OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] compare: OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] maximum: OK
1420.96 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1420.96 s
[vector] minimum: OK
1420.96 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1420.96 s
[vector] minIndex: OK
1420.96 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1420.96 s
[vector] maxIndex: OK
1420.96 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1420.96 s
[vector] maximumBy: OK
1420.96 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1420.96 s
[vector] minimumBy: OK
1420.96 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1420.96 s
[vector] maximumOn: OK
1420.96 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1420.96 s
[vector] minimumOn: OK
1420.96 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1420.96 s
[vector] maxIndexBy: OK
1420.96 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1420.96 s
[vector] minIndexBy: OK
1420.96 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1420.96 s
[vector] ListFirstMaxIndexWins: OK
1420.96 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1420.96 s
[vector] FalseListFirstMaxIndexWins: OK
1420.96 s
[vector] +++ OK, failed as expected. (after 1 test):
1420.96 s
[vector] Exception:
1420.96 s
[vector] Prelude.foldr1: empty list
1420.96 s
[vector] CallStack (from HasCallStack):
1420.96 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1420.96 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1420.96 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1420.96 s
[vector] []
1420.96 s
[vector] mempty: OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mappend: OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] mconcat: OK (0.02s)
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.96 s
[vector] glength: OK
1420.96 s
[vector] +++ OK, passed 100 tests.
1420.97 s
[vector] sum: OK
1420.97 s
[vector] +++ OK, passed 100 tests.
1420.97 s
[vector] product: OK
1420.97 s
[vector] +++ OK, passed 100 tests.
1420.97 s
[vector] enumFromN: OK
1420.97 s
[vector] +++ OK, passed 100 tests.
1420.97 s
[vector] enumFromThenN: OK
1420.97 s
[vector] +++ OK, passed 100 tests.
1420.97 s
[vector] enumFromTo: OK
1420.97 s
[vector] +++ OK, passed 100 tests.
1420.97 s
[vector] enumFromThenTo: OK
1420.97 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1420.97 s
[vector] Data.Vector.Storable.Vector (Double)
1420.97 s
[vector] fromList.toList == id: OK
1420.97 s
[vector] +++ OK, passed 100 tests.
1420.97 s
[vector] toList.fromList == id: OK
1420.97 s
[vector] +++ OK, passed 100 tests.
1420.97 s
[vector] unstream.stream == id: OK
1420.97 s
[vector] +++ OK, passed 100 tests.
1420.97 s
[vector] stream.unstream == id: OK
1420.97 s
[vector] +++ OK, passed 100 tests.
1420.97 s
[vector] eq: OK
1420.97 s
[vector] +++ OK, passed 100 tests.
1420.97 s
[vector] length: OK
1420.97 s
[vector] +++ OK, passed 100 tests.
1420.97 s
[vector] null: OK
1420.97 s
[vector] +++ OK, passed 100 tests.
1420.98 s
[vector] index: OK
1420.98 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1420.98 s
[vector] safeIndex: OK
1420.98 s
[vector] +++ OK, passed 100 tests.
1420.98 s
[vector] head: OK
1420.98 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1420.98 s
[vector] last: OK
1420.98 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1420.98 s
[vector] unsafeIndex: OK
1420.98 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1420.98 s
[vector] unsafeHead: OK
1420.98 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1420.98 s
[vector] unsafeLast: OK
1420.98 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1420.98 s
[vector] slice: OK
1420.98 s
[vector] +++ OK, passed 100 tests.
1420.98 s
[vector] init: OK
1420.99 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1420.99 s
[vector] tail: OK
1420.99 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1420.99 s
[vector] take: OK
1420.99 s
[vector] +++ OK, passed 100 tests.
1420.99 s
[vector] drop: OK
1420.99 s
[vector] +++ OK, passed 100 tests.
1421.00 s
[vector] splitAt: OK
1421.00 s
[vector] +++ OK, passed 100 tests.
1421.00 s
[vector] empty: OK
1421.00 s
[vector] +++ OK, passed 100 tests.
1421.00 s
[vector] singleton: OK
1421.00 s
[vector] +++ OK, passed 100 tests.
1421.00 s
[vector] replicate: OK
1421.00 s
[vector] +++ OK, passed 100 tests.
1421.00 s
[vector] generate: OK
1421.00 s
[vector] +++ OK, passed 100 tests.
1421.00 s
[vector] iterateN: OK
1421.00 s
[vector] +++ OK, passed 100 tests.
1421.00 s
[pandoc-lua-engine] depends pandoc-lua-marshal-0.3.1-CEai8TZ59D36cGPSocsWLC
1421.00 s
[pandoc-lua-engine] depends pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
1421.00 s
[pandoc-lua-engine] depends parsec-3.1.18.0-b178
1421.00 s
[pandoc-lua-engine] depends text-2.1.3-c691
1421.00 s
[pandoc-lua-engine] definite pandoc-lua-engine-0.4.3-3LEmP89EEdjCRAN3LsL1y3-test-pandoc-lua-engine
1421.00 s
[pandoc-lua-engine] depends base-4.20.2.0-64da
1421.00 s
[pandoc-lua-engine] depends bytestring-0.12.2.0-262e
1421.00 s
[pandoc-lua-engine] depends data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
1421.00 s
[pandoc-lua-engine] depends directory-1.3.8.5-c84a
1421.00 s
[pandoc-lua-engine] depends exceptions-0.10.9-1a12
1421.00 s
[pandoc-lua-engine] depends filepath-1.5.4.0-e600
1421.00 s
[pandoc-lua-engine] depends hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
1421.00 s
[pandoc-lua-engine] depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
1421.00 s
[pandoc-lua-engine] depends pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
1421.00 s
[pandoc-lua-engine] depends pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
1421.00 s
[pandoc-lua-engine] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
1421.00 s
[pandoc-lua-engine] depends tasty-golden-2.3.5-3QQ0reIfFJ36gfVIlepFcf
1421.00 s
[pandoc-lua-engine] depends tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
1421.00 s
[pandoc-lua-engine] depends tasty-lua-1.1.2-1O8o765OPu9IHWrmpruNIo
1421.00 s
[pandoc-lua-engine] depends text-2.1.3-c691
1421.00 s
[pandoc-lua-engine] Using Cabal-3.12.1.0 compiled by ghc-9.10
1421.00 s
[pandoc-lua-engine] Using compiler: ghc-9.10.3
1421.00 s
[pandoc-lua-engine] Using install prefix:
1421.00 s
[pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3
1421.00 s
[pandoc-lua-engine] Executables installed in:
1421.00 s
[pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/bin
1421.00 s
[pandoc-lua-engine] Libraries installed in:
1421.00 s
[pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
1421.01 s
[pandoc-lua-engine] Dynamic Libraries installed in:
1421.01 s
[pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
1421.01 s
[pandoc-lua-engine] Private executables installed in:
1421.01 s
[pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/libexec/x86_64-linux-ghc-9.10.3-05f6/pandoc-lua-engine-0.4.3
1421.01 s
[pandoc-lua-engine] Data files installed in:
1421.01 s
[pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/share/x86_64-linux-ghc-9.10.3-05f6/pandoc-lua-engine-0.4.3
1421.01 s
[pandoc-lua-engine] Documentation installed in:
1421.01 s
[pandoc-lua-engine] /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc/share/doc/pandoc-lua-engine-0.4.3
1421.01 s
[pandoc-lua-engine] Configuration files installed in:
1421.01 s
[pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/etc
1421.01 s
[pandoc-lua-engine] No alex found
1421.01 s
[pandoc-lua-engine] Using ar found on system at:
1421.01 s
[pandoc-lua-engine] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
1421.01 s
[pandoc-lua-engine] No c2hs found
1421.01 s
[pandoc-lua-engine] No cpphs found
1421.01 s
[pandoc-lua-engine] No doctest found
1421.01 s
[pandoc-lua-engine] Using gcc version 14.3.0 given by user at:
1421.01 s
[pandoc-lua-engine] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
1421.01 s
[pandoc-lua-engine] Using ghc version 9.10.3 found on system at:
1421.01 s
[pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
1421.01 s
[pandoc-lua-engine] Using ghc-pkg version 9.10.3 found on system at:
1421.01 s
[pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
1421.01 s
[pandoc-lua-engine] No ghcjs found
1421.01 s
[pandoc-lua-engine] No ghcjs-pkg found
1421.01 s
[pandoc-lua-engine] No greencard found
1421.01 s
[pandoc-lua-engine] Using haddock version 2.31.1 found on system at:
1421.01 s
[pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
1421.01 s
[pandoc-lua-engine] No happy found
1421.01 s
[pandoc-lua-engine] Using haskell-suite found on system at: haskell-suite-dummy-location
1421.01 s
[pandoc-lua-engine] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1421.01 s
[pandoc-lua-engine] No hmake found
1421.01 s
[pandoc-lua-engine] Using hpc version 0.69 found on system at:
1421.01 s
[pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
1421.01 s
[pandoc-lua-engine] Using hsc2hs version 0.68.10 found on system at:
1421.01 s
[pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
1421.01 s
[pandoc-lua-engine] Using hscolour version 1.25 found on system at:
1421.01 s
[pandoc-lua-engine] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
1421.01 s
[pandoc-lua-engine] No jhc found
1421.01 s
[pandoc-lua-engine] Using ld found on system at:
1421.01 s
[pandoc-lua-engine] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
1421.01 s
[pandoc-lua-engine] No pkg-config found
1421.01 s
[pandoc-lua-engine] Using runghc version 9.10.3 found on system at:
1421.01 s
[pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
1421.01 s
[pandoc-lua-engine] Using strip version 2.44 found on system at:
1421.01 s
[pandoc-lua-engine] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
1421.01 s
[pandoc-lua-engine] Using tar found on system at:
1421.01 s
[pandoc-lua-engine] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
1421.01 s
[pandoc-lua-engine] No uhc found
1421.02 s
[vector] iterateNM: OK (0.02s)
1421.02 s
[vector] +++ OK, passed 100 tests.
1421.06 s
[vector] generateM: OK (0.03s)
1421.06 s
[vector] +++ OK, passed 100 tests.
1421.06 s
[vector] replicateM: OK
1421.06 s
[vector] +++ OK, passed 100 tests.
1421.06 s
[vector] create: OK
1421.06 s
[vector] +++ OK, passed 100 tests.
1421.06 s
[vector] createT: OK
1421.06 s
[vector] +++ OK, passed 100 tests.
1421.06 s
[vector] unfoldr: OK
1421.06 s
[vector] +++ OK, passed 100 tests.
1421.06 s
[vector] unfoldrN: OK
1421.06 s
[vector] +++ OK, passed 100 tests.
1421.08 s
[vector] unfoldrExactN: OK
1421.08 s
[vector] +++ OK, passed 100 tests.
1421.08 s
[vector] unfoldrM: OK
1421.08 s
[vector] +++ OK, passed 100 tests.
1421.08 s
[vector] unfoldrNM: OK
1421.08 s
[vector] +++ OK, passed 100 tests.
1421.11 s
[vector] unfoldrExactNM: OK (0.03s)
1421.12 s
[vector] +++ OK, passed 100 tests.
1421.12 s
[vector] constructN: OK (0.01s)
1421.12 s
[vector] +++ OK, passed 100 tests.
1421.13 s
[vector] constructrN: OK (0.02s)
1421.13 s
[vector] +++ OK, passed 100 tests.
1421.13 s
[vector] cons: OK
1421.13 s
[vector] +++ OK, passed 100 tests.
1421.13 s
[vector] snoc: OK
1421.13 s
[vector] +++ OK, passed 100 tests.
1421.13 s
[vector] append: OK
1421.13 s
[vector] +++ OK, passed 100 tests.
1421.15 s
[vector] concat: OK (0.02s)
1421.15 s
[vector] +++ OK, passed 100 tests.
1421.15 s
[vector] force: OK
1421.15 s
[vector] +++ OK, passed 100 tests.
1421.16 s
[vector] upd: OK
1421.16 s
[vector] +++ OK, passed 100 tests.
1421.17 s
[vector] accum: OK (0.02s)
1421.17 s
[vector] +++ OK, passed 100 tests.
1421.18 s
[vector] reverse: OK
1421.18 s
[vector] +++ OK, passed 100 tests.
1421.18 s
[vector] backpermute: OK
1421.18 s
[vector] +++ OK, passed 100 tests.
1421.20 s
[vector] map: OK (0.01s)
1421.20 s
[vector] +++ OK, passed 100 tests.
1421.20 s
[vector] imap: OK (0.01s)
1421.20 s
[vector] +++ OK, passed 100 tests.
1421.22 s
[vector] concatMap: OK (0.01s)
1421.22 s
[vector] +++ OK, passed 100 tests.
1421.24 s
[vector] mapM: OK (0.01s)
1421.24 s
[vector] +++ OK, passed 100 tests.
1421.27 s
[vector] mapM_: OK (0.05s)
1421.28 s
[pandoc-server] Dependency aeson >=2.0 && <2.3: using aeson-2.2.3.0
1421.28 s
[pandoc-server] Dependency base >=4.12 && <5: using base-4.20.2.0
1421.28 s
[pandoc-server] Dependency base64-bytestring >=0.1 && <1.3: using base64-bytestring-1.2.1.0
1421.28 s
[pandoc-server] Dependency bytestring >=0.9 && <0.13: using bytestring-0.12.2.0
1421.28 s
[pandoc-server] Dependency containers >=0.6.0.1 && <0.9: using containers-0.7
1421.28 s
[pandoc-server] Dependency data-default >=0.4 && <0.9: using data-default-0.8.0.1
1421.28 s
[pandoc-server] Dependency doctemplates >=0.11 && <0.12: using doctemplates-0.11.0.1
1421.28 s
[pandoc-server] Dependency pandoc >=3.5 && <3.8: using pandoc-3.7.0.2
1421.28 s
[pandoc-server] Dependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
1421.28 s
[pandoc-server] Dependency servant-server >=0.19 && <0.21: using servant-server-0.20.3.0
1421.28 s
[pandoc-server] Dependency skylighting >=0.13 && <0.15: using skylighting-0.14.7
1421.28 s
[pandoc-server] Dependency text >=1.1.1.0 && <2.2: using text-2.1.3
1421.28 s
[pandoc-server] Dependency unicode-collation >=0.1.1 && <0.2: using unicode-collation-0.1.3.6
1421.28 s
[pandoc-server] Dependency wai >=3.2 && <3.3: using wai-3.2.4
1421.28 s
[pandoc-server] Dependency wai-cors >=0.2.7 && <0.3: using wai-cors-0.2.7
1421.28 s
[pandoc-server] Source component graph: component lib
1421.28 s
[pandoc-server] Configured component graph:
1421.28 s
[pandoc-server] component pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
1421.28 s
[pandoc-server] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
1421.28 s
[pandoc-server] include base-4.20.2.0-64da
1421.28 s
[pandoc-server] include base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
1421.28 s
[pandoc-server] include bytestring-0.12.2.0-262e
1421.28 s
[pandoc-server] include containers-0.7-504a
1421.28 s
[pandoc-server] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
1421.28 s
[pandoc-server] include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
1421.28 s
[pandoc-server] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
1421.28 s
[pandoc-server] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
1421.28 s
[pandoc-server] include servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
1421.28 s
[pandoc-server] include skylighting-0.14.7-E1NlMTbMaxi21IaCy26ZSc
1421.28 s
[pandoc-server] include text-2.1.3-c691
1421.28 s
[pandoc-server] include unicode-collation-0.1.3.6-GNgjxqiCGZCDNShq4d28XS
1421.28 s
[pandoc-server] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
1421.28 s
[pandoc-server] include wai-cors-0.2.7-LUOr3sfxSGX6rgruuv5vs2
1421.28 s
[pandoc-server] Linked component graph:
1421.28 s
[pandoc-server] unit pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
1421.28 s
[pandoc-server] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
1421.28 s
[pandoc-server] include base-4.20.2.0-64da
1421.28 s
[pandoc-server] include base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
1421.28 s
[pandoc-server] include bytestring-0.12.2.0-262e
1421.28 s
[pandoc-server] include containers-0.7-504a
1421.28 s
[pandoc-server] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
1421.28 s
[pandoc-server] include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
1421.28 s
[pandoc-server] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
1421.28 s
[pandoc-server] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
1421.28 s
[pandoc-server] include servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
1421.28 s
[pandoc-server] include skylighting-0.14.7-E1NlMTbMaxi21IaCy26ZSc
1421.28 s
[pandoc-server] include text-2.1.3-c691
1421.28 s
[pandoc-server] include unicode-collation-0.1.3.6-GNgjxqiCGZCDNShq4d28XS
1421.28 s
[pandoc-server] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
1421.28 s
[pandoc-server] include wai-cors-0.2.7-LUOr3sfxSGX6rgruuv5vs2
1421.28 s
[pandoc-server] Text.Pandoc.Server=pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM:Text.Pandoc.Server
1421.28 s
[pandoc-server] Ready component graph:
1421.28 s
[pandoc-server] definite pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
1421.28 s
[pandoc-server] depends aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
1421.28 s
[pandoc-server] depends base-4.20.2.0-64da
1421.28 s
[pandoc-server] depends base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
1421.28 s
[pandoc-server] depends bytestring-0.12.2.0-262e
1421.28 s
[pandoc-server] depends containers-0.7-504a
1421.28 s
[pandoc-server] depends data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
1421.28 s
[pandoc-server] depends doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
1421.28 s
[pandoc-server] depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
1421.28 s
[pandoc-server] depends pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
1421.28 s
[pandoc-server] depends servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
1421.28 s
[pandoc-server] depends skylighting-0.14.7-E1NlMTbMaxi21IaCy26ZSc
1421.28 s
[pandoc-server] depends text-2.1.3-c691
1421.28 s
[pandoc-server] depends unicode-collation-0.1.3.6-GNgjxqiCGZCDNShq4d28XS
1421.28 s
[pandoc-server] depends wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
1421.28 s
[pandoc-server] depends wai-cors-0.2.7-LUOr3sfxSGX6rgruuv5vs2
1421.28 s
[pandoc-server] Using Cabal-3.12.1.0 compiled by ghc-9.10
1421.28 s
[pandoc-server] Using compiler: ghc-9.10.3
1421.28 s
[pandoc-server] Using install prefix:
1421.28 s
[pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
1421.28 s
[pandoc-server] Executables installed in:
1421.28 s
[pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/bin
1421.28 s
[pandoc-server] Libraries installed in:
1421.28 s
[vector] +++ OK, passed 100 tests.
1421.28 s
[pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
1421.28 s
[pandoc-server] Dynamic Libraries installed in:
1421.28 s
[pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
1421.28 s
[pandoc-server] Private executables installed in:
1421.28 s
[pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/libexec/x86_64-linux-ghc-9.10.3-05f6/pandoc-server-0.1.0.11
1421.28 s
[pandoc-server] Data files installed in:
1421.28 s
[pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/share/x86_64-linux-ghc-9.10.3-05f6/pandoc-server-0.1.0.11
1421.28 s
[pandoc-server] Documentation installed in:
1421.28 s
[pandoc-server] /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc/share/doc/pandoc-server-0.1.0.11
1421.28 s
[pandoc-server] Configuration files installed in:
1421.28 s
[pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/etc
1421.28 s
[pandoc-server] No alex found
1421.28 s
[pandoc-server] Using ar found on system at:
1421.28 s
[pandoc-server] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
1421.28 s
[pandoc-server] No c2hs found
1421.28 s
[pandoc-server] No cpphs found
1421.28 s
[pandoc-server] No doctest found
1421.28 s
[pandoc-server] Using gcc version 14.3.0 given by user at:
1421.28 s
[pandoc-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
1421.28 s
[pandoc-server] Using ghc version 9.10.3 found on system at:
1421.28 s
[pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
1421.28 s
[pandoc-server] Using ghc-pkg version 9.10.3 found on system at:
1421.28 s
[pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
1421.28 s
[pandoc-server] No ghcjs found
1421.28 s
[pandoc-server] No ghcjs-pkg found
1421.28 s
[pandoc-server] No greencard found
1421.28 s
[pandoc-server] Using haddock version 2.31.1 found on system at:
1421.28 s
[pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
1421.28 s
[pandoc-server] No happy found
1421.28 s
[pandoc-server] Using haskell-suite found on system at: haskell-suite-dummy-location
1421.28 s
[pandoc-server] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1421.28 s
[pandoc-server] No hmake found
1421.28 s
[pandoc-server] Using hpc version 0.69 found on system at:
1421.28 s
[pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
1421.28 s
[pandoc-server] Using hsc2hs version 0.68.10 found on system at:
1421.28 s
[pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
1421.28 s
[pandoc-server] Using hscolour version 1.25 found on system at:
1421.28 s
[pandoc-server] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
1421.28 s
[pandoc-server] No jhc found
1421.28 s
[pandoc-server] Using ld found on system at:
1421.28 s
[pandoc-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
1421.28 s
[pandoc-server] No pkg-config found
1421.28 s
[pandoc-server] Using runghc version 9.10.3 found on system at:
1421.28 s
[pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
1421.28 s
[pandoc-server] Using strip version 2.44 found on system at:
1421.28 s
[pandoc-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
1421.28 s
[pandoc-server] Using tar found on system at:
1421.28 s
[pandoc-server] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
1421.28 s
[pandoc-server] No uhc found
1421.28 s
[vector] forM: OK
1421.28 s
[vector] +++ OK, passed 100 tests.
1421.32 s
[vector] forM_: OK (0.04s)
1421.32 s
[vector] +++ OK, passed 100 tests.
1421.32 s
[vector] imapM: OK
1421.32 s
[vector] +++ OK, passed 100 tests.
1421.37 s
[vector] imapM_: OK (0.04s)
1421.38 s
[vector] +++ OK, passed 100 tests.
1421.38 s
[vector] zipWith: OK (0.01s)
1421.38 s
[vector] +++ OK, passed 100 tests.
1421.41 s
[vector] zipWith3: OK (0.01s)
1421.42 s
[vector] +++ OK, passed 100 tests.
1421.42 s
[vector] izipWith: OK (0.01s)
1421.42 s
[vector] +++ OK, passed 100 tests.
1421.42 s
[vector] izipWith3: OK (0.01s)
1421.42 s
[vector] +++ OK, passed 100 tests.
1421.44 s
[vector] izipWithM: OK (0.01s)
1421.44 s
[vector] +++ OK, passed 100 tests.
1421.47 s
[vector] izipWithM_: OK (0.04s)
1421.48 s
[vector] +++ OK, passed 100 tests.
1421.48 s
[vector] zipWithM: OK (0.01s)
1421.48 s
[vector] +++ OK, passed 100 tests.
1421.51 s
[vector] zipWithM_: OK (0.03s)
1421.52 s
[vector] +++ OK, passed 100 tests.
1421.52 s
[vector] filter: OK
1421.52 s
[vector] +++ OK, passed 100 tests.
1421.52 s
[vector] ifilter: OK
1421.52 s
[vector] +++ OK, passed 100 tests.
1421.57 s
[vector] filterM: OK (0.03s)
1421.57 s
[vector] +++ OK, passed 100 tests.
1421.58 s
[vector] uniq: OK
1421.58 s
[vector] +++ OK, passed 100 tests.
1421.59 s
[vector] mapMaybe: OK
1421.59 s
[vector] +++ OK, passed 100 tests.
1421.59 s
[vector] imapMaybe: OK
1421.60 s
[vector] +++ OK, passed 100 tests.
1421.60 s
[vector] takeWhile: OK
1421.60 s
[vector] +++ OK, passed 100 tests.
1421.60 s
[vector] dropWhile: OK
1421.60 s
[vector] +++ OK, passed 100 tests.
1421.61 s
[vector] partition: OK
1421.61 s
[vector] +++ OK, passed 100 tests.
1421.61 s
[vector] partitionWith: OK
1421.61 s
[vector] +++ OK, passed 100 tests.
1421.61 s
[vector] span: OK
1421.61 s
[vector] +++ OK, passed 100 tests.
1421.61 s
[vector] break: OK
1421.61 s
[vector] +++ OK, passed 100 tests.
1421.62 s
[vector] spanR: OK
1421.62 s
[vector] +++ OK, passed 100 tests.
1421.62 s
[vector] breakR: OK
1421.62 s
[vector] +++ OK, passed 100 tests.
1421.63 s
[vector] groupBy: OK (0.01s)
1421.63 s
[vector] +++ OK, passed 100 tests.
1421.63 s
[vector] elem: OK
1421.63 s
[vector] +++ OK, passed 100 tests.
1421.63 s
[vector] notElem: OK
1421.63 s
[vector] +++ OK, passed 100 tests.
1421.64 s
[vector] find: OK
1421.64 s
[vector] +++ OK, passed 100 tests.
1421.64 s
[vector] findIndex: OK
1421.64 s
[vector] +++ OK, passed 100 tests.
1421.64 s
[vector] findIndexR: OK
1421.64 s
[vector] +++ OK, passed 100 tests.
1421.64 s
[vector] findIndices: OK
1421.64 s
[vector] +++ OK, passed 100 tests.
1421.64 s
[vector] elemIndex: OK
1421.64 s
[vector] +++ OK, passed 100 tests.
1421.66 s
[vector] elemIndices: OK
1421.66 s
[vector] +++ OK, passed 100 tests.
1421.66 s
[vector] foldl: OK (0.01s)
1421.66 s
[vector] +++ OK, passed 100 tests.
1421.68 s
[vector] foldl1: OK (0.01s)
1421.68 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1421.69 s
[vector] foldl': OK (0.02s)
1421.70 s
[vector] +++ OK, passed 100 tests.
1421.70 s
[vector] foldl1': OK (0.01s)
1421.70 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1421.72 s
[vector] foldr: OK (0.01s)
1421.72 s
[vector] +++ OK, passed 100 tests.
1421.73 s
[vector] foldr1: OK (0.02s)
1421.73 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1421.74 s
[vector] foldr': OK (0.01s)
1421.74 s
[vector] +++ OK, passed 100 tests.
1421.76 s
[vector] foldr1': OK (0.01s)
1421.76 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1421.78 s
[vector] ifoldl: OK (0.01s)
1421.78 s
[vector] +++ OK, passed 100 tests.
1421.79 s
[pandoc-lua-engine] Phase: buildPhase
1421.79 s
[vector] ifoldl': OK (0.01s)
1421.80 s
[vector] +++ OK, passed 100 tests.
1421.80 s
[vector] ifoldr: OK (0.02s)
1421.80 s
[vector] +++ OK, passed 100 tests.
1421.82 s
[vector] ifoldr': OK (0.01s)
1421.82 s
[vector] +++ OK, passed 100 tests.
1421.83 s
[vector] ifoldM: OK (0.01s)
1421.84 s
[vector] +++ OK, passed 100 tests.
1421.84 s
[vector] ifoldM': OK (0.01s)
1421.84 s
[vector] +++ OK, passed 100 tests.
1421.88 s
[vector] ifoldM_: OK (0.03s)
1421.88 s
[vector] +++ OK, passed 100 tests.
1421.91 s
[vector] ifoldM'_: OK (0.03s)
1421.91 s
[vector] +++ OK, passed 100 tests.
1421.91 s
[vector] all: OK
1421.91 s
[vector] +++ OK, passed 100 tests.
1421.91 s
[vector] any: OK
1421.92 s
[vector] +++ OK, passed 100 tests.
1421.93 s
[pandoc-lua-engine] Preprocessing library for pandoc-lua-engine-0.4.3...
1421.93 s
[vector] prescanl: OK (0.01s)
1421.94 s
[vector] +++ OK, passed 100 tests.
1421.94 s
[vector] prescanl': OK (0.01s)
1421.94 s
[vector] +++ OK, passed 100 tests.
1421.94 s
[pandoc-lua-engine] Building library for pandoc-lua-engine-0.4.3...
1421.96 s
[vector] postscanl: OK (0.02s)
1421.96 s
[vector] +++ OK, passed 100 tests.
1421.96 s
[vector] postscanl': OK (0.01s)
1421.96 s
[vector] +++ OK, passed 100 tests.
1421.98 s
[vector] scanl: OK
1421.98 s
[vector] +++ OK, passed 100 tests.
1422.00 s
[vector] scanl': OK (0.01s)
1422.00 s
[vector] +++ OK, passed 100 tests.
1422.02 s
[vector] scanl1: OK (0.01s)
1422.02 s
[vector] +++ OK, passed 100 tests.
1422.04 s
[vector] scanl1': OK (0.02s)
1422.04 s
[vector] +++ OK, passed 100 tests.
1422.05 s
[vector] iscanl: OK (0.01s)
1422.06 s
[vector] +++ OK, passed 100 tests.
1422.06 s
[vector] iscanl': OK (0.02s)
1422.06 s
[vector] +++ OK, passed 100 tests.
1422.07 s
[vector] prescanr: OK (0.02s)
1422.07 s
[vector] +++ OK, passed 100 tests.
1422.08 s
[pandoc-server] Phase: buildPhase
1422.08 s
[vector] prescanr': OK
1422.08 s
[vector] +++ OK, passed 100 tests.
1422.10 s
[vector] postscanr: OK (0.01s)
1422.10 s
[vector] +++ OK, passed 100 tests.
1422.12 s
[vector] postscanr': OK (0.01s)
1422.12 s
[vector] +++ OK, passed 100 tests.
1422.12 s
[vector] scanr: OK (0.01s)
1422.12 s
[vector] +++ OK, passed 100 tests.
1422.13 s
[vector] scanr': OK
1422.14 s
[vector] +++ OK, passed 100 tests.
1422.16 s
[vector] scanr1: OK (0.01s)
1422.16 s
[vector] +++ OK, passed 100 tests.
1422.18 s
[vector] scanr1': OK (0.01s)
1422.18 s
[vector] +++ OK, passed 100 tests.
1422.18 s
[vector] iscanr: OK (0.01s)
1422.18 s
[vector] +++ OK, passed 100 tests.
1422.19 s
[vector] iscanr': OK (0.01s)
1422.19 s
[vector] +++ OK, passed 100 tests.
1422.19 s
[vector] mut_read: OK
1422.19 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1422.19 s
[vector] mut_write: OK
1422.19 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1422.19 s
[vector] mut_modify: OK
1422.19 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1422.20 s
[vector] mut_generate: OK
1422.20 s
[vector] +++ OK, passed 100 tests.
1422.20 s
[vector] mut_generateM: OK (0.01s)
1422.21 s
[vector] +++ OK, passed 100 tests.
1422.22 s
[pandoc-server] Preprocessing library for pandoc-server-0.1.0.11...
1422.22 s
[pandoc-server] Building library for pandoc-server-0.1.0.11...
1422.25 s
[vector] mut_mapM_: OK (0.03s)
1422.25 s
[vector] +++ OK, passed 100 tests.
1422.25 s
[pandoc-lua-engine] [ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
1422.30 s
[vector] mut_imapM_: OK (0.03s)
1422.30 s
[vector] +++ OK, passed 100 tests.
1422.34 s
[pandoc-server] [1 of 1] Compiling Text.Pandoc.Server
1422.36 s
[vector] mut_forM_: OK (0.06s)
1422.36 s
[vector] +++ OK, passed 100 tests.
1422.42 s
[vector] mut_iforM_: OK (0.07s)
1422.42 s
[vector] +++ OK, passed 100 tests.
1422.44 s
[vector] mut_foldr: OK (0.02s)
1422.44 s
[vector] +++ OK, passed 100 tests.
1422.46 s
[vector] mut_foldr': OK (0.02s)
1422.46 s
[vector] +++ OK, passed 100 tests.
1422.48 s
[vector] mut_foldl: OK (0.02s)
1422.48 s
[vector] +++ OK, passed 100 tests.
1422.50 s
[vector] mut_foldl': OK (0.02s)
1422.50 s
[vector] +++ OK, passed 100 tests.
1422.52 s
[vector] mut_ifoldr: OK (0.02s)
1422.52 s
[vector] +++ OK, passed 100 tests.
1422.54 s
[vector] mut_ifoldr': OK (0.02s)
1422.54 s
[vector] +++ OK, passed 100 tests.
1422.56 s
[vector] mut_ifoldl: OK (0.02s)
1422.56 s
[vector] +++ OK, passed 100 tests.
1422.59 s
[vector] mut_ifoldl': OK (0.03s)
1422.60 s
[vector] +++ OK, passed 100 tests.
1422.60 s
[vector] mut_foldM: OK (0.02s)
1422.60 s
[vector] +++ OK, passed 100 tests.
1422.62 s
[vector] mut_foldM': OK (0.01s)
1422.62 s
[vector] +++ OK, passed 100 tests.
1422.64 s
[vector] mut_foldrM: OK (0.01s)
1422.64 s
[vector] +++ OK, passed 100 tests.
1422.64 s
[vector] mut_foldrM': OK (0.01s)
1422.64 s
[vector] +++ OK, passed 100 tests.
1422.66 s
[vector] mut_ifoldM: OK (0.02s)
1422.66 s
[vector] +++ OK, passed 100 tests.
1422.70 s
[vector] mut_ifoldM': OK (0.03s)
1422.70 s
[vector] +++ OK, passed 100 tests.
1422.72 s
[vector] mut_ifoldrM: OK (0.02s)
1422.72 s
[vector] +++ OK, passed 100 tests.
1422.72 s
[vector] mut_ifoldrM': OK (0.02s)
1422.72 s
[vector] +++ OK, passed 100 tests.
1422.72 s
[vector] compare: OK
1422.72 s
[vector] +++ OK, passed 100 tests.
1422.72 s
[vector] maximum: OK
1422.72 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1422.72 s
[vector] minimum: OK
1422.72 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1422.73 s
[vector] minIndex: OK
1422.73 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1422.73 s
[vector] maxIndex: OK
1422.73 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1422.73 s
[vector] maximumBy: OK
1422.73 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1422.73 s
[vector] minimumBy: OK
1422.73 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1422.73 s
[vector] maximumOn: OK
1422.73 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1422.74 s
[vector] minimumOn: OK
1422.74 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1422.74 s
[vector] maxIndexBy: OK
1422.74 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1422.74 s
[vector] minIndexBy: OK
1422.74 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1422.74 s
[vector] ListFirstMaxIndexWins: OK
1422.74 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1422.74 s
[vector] FalseListFirstMaxIndexWins: OK
1422.74 s
[vector] +++ OK, failed as expected. (after 1 test):
1422.74 s
[vector] Exception:
1422.74 s
[vector] Prelude.foldr1: empty list
1422.74 s
[vector] CallStack (from HasCallStack):
1422.74 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1422.74 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1422.74 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1422.74 s
[vector] []
1422.74 s
[vector] mempty: OK
1422.75 s
[vector] +++ OK, passed 100 tests.
1422.75 s
[vector] mappend: OK
1422.76 s
[vector] +++ OK, passed 100 tests.
1422.79 s
[vector] mconcat: OK (0.03s)
1422.79 s
[vector] +++ OK, passed 100 tests.
1422.79 s
[vector] glength: OK
1422.79 s
[vector] +++ OK, passed 100 tests.
1422.79 s
[vector] sum: OK
1422.79 s
[vector] +++ OK, passed 100 tests.
1422.79 s
[vector] product: OK
1422.79 s
[vector] +++ OK, passed 100 tests.
1422.79 s
[vector] enumFromN: OK
1422.79 s
[vector] +++ OK, passed 100 tests.
1422.79 s
[vector] enumFromThenN: OK
1422.79 s
[vector] +++ OK, passed 100 tests.
1422.79 s
[vector] enumFromTo: OK
1422.79 s
[vector] +++ OK, passed 100 tests.
1422.79 s
[vector] enumFromThenTo: OK
1422.79 s
[vector] +++ OK, passed 100 tests; 1 discarded.
1422.79 s
[vector] unstream
1422.79 s
[vector] unstream == vunstream (exact): OK
1422.79 s
[vector] +++ OK, passed 100 tests.
1422.79 s
[vector] unstream == vunstream (unknown): OK
1422.79 s
[vector] +++ OK, passed 100 tests.
1422.79 s
[vector] unstreamR ~= vunstream (exact): OK
1422.79 s
[vector] +++ OK, passed 100 tests.
1422.80 s
[vector] unstreamR ~= vunstream (unknown): OK
1422.80 s
[vector] +++ OK, passed 100 tests.
1422.80 s
[vector] Tests.Vector.Strict
1422.80 s
[vector] Bool
1422.80 s
[vector] fromList.toList == id: OK
1422.80 s
[vector] +++ OK, passed 100 tests.
1422.80 s
[vector] toList.fromList == id: OK
1422.80 s
[vector] +++ OK, passed 100 tests.
1422.80 s
[vector] unstream.stream == id: OK
1422.80 s
[vector] +++ OK, passed 100 tests.
1422.80 s
[vector] stream.unstream == id: OK
1422.80 s
[vector] +++ OK, passed 100 tests.
1422.80 s
[vector] eq: OK
1422.80 s
[vector] +++ OK, passed 100 tests.
1422.80 s
[vector] length: OK
1422.80 s
[vector] +++ OK, passed 100 tests.
1422.80 s
[vector] null: OK
1422.80 s
[vector] +++ OK, passed 100 tests.
1422.80 s
[vector] index: OK
1422.80 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1422.80 s
[vector] safeIndex: OK
1422.80 s
[vector] +++ OK, passed 100 tests.
1422.80 s
[vector] head: OK
1422.80 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1422.80 s
[vector] last: OK
1422.80 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1422.80 s
[vector] unsafeIndex: OK
1422.80 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1422.80 s
[vector] unsafeHead: OK
1422.80 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1422.80 s
[vector] unsafeLast: OK
1422.80 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1422.80 s
[vector] slice: OK
1422.80 s
[vector] +++ OK, passed 100 tests.
1422.81 s
[vector] init: OK
1422.81 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1422.81 s
[vector] tail: OK
1422.81 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1422.81 s
[vector] take: OK
1422.81 s
[vector] +++ OK, passed 100 tests.
1422.81 s
[vector] drop: OK
1422.81 s
[vector] +++ OK, passed 100 tests.
1422.81 s
[vector] splitAt: OK
1422.81 s
[vector] +++ OK, passed 100 tests.
1422.81 s
[vector] empty: OK
1422.81 s
[vector] +++ OK, passed 100 tests.
1422.81 s
[vector] singleton: OK
1422.81 s
[vector] +++ OK, passed 100 tests.
1422.81 s
[vector] replicate: OK
1422.81 s
[vector] +++ OK, passed 100 tests.
1422.81 s
[vector] generate: OK
1422.81 s
[vector] +++ OK, passed 100 tests.
1422.81 s
[vector] iterateN: OK
1422.82 s
[vector] +++ OK, passed 100 tests.
1422.84 s
[vector] iterateNM: OK (0.02s)
1422.84 s
[vector] +++ OK, passed 100 tests.
1422.86 s
[vector] generateM: OK (0.02s)
1422.86 s
[vector] +++ OK, passed 100 tests.
1422.86 s
[vector] replicateM: OK
1422.86 s
[vector] +++ OK, passed 100 tests.
1422.86 s
[vector] create: OK
1422.86 s
[vector] +++ OK, passed 100 tests.
1422.86 s
[vector] createT: OK
1422.86 s
[vector] +++ OK, passed 100 tests.
1422.86 s
[vector] unfoldr: OK
1422.86 s
[vector] +++ OK, passed 100 tests.
1422.86 s
[vector] unfoldrN: OK
1422.86 s
[vector] +++ OK, passed 100 tests.
1422.86 s
[vector] unfoldrExactN: OK
1422.87 s
[vector] +++ OK, passed 100 tests.
1422.87 s
[vector] unfoldrM: OK
1422.87 s
[vector] +++ OK, passed 100 tests.
1422.87 s
[vector] unfoldrNM: OK
1422.88 s
[vector] +++ OK, passed 100 tests.
1422.89 s
[vector] unfoldrExactNM: OK (0.02s)
1422.89 s
[vector] +++ OK, passed 100 tests.
1422.89 s
[vector] constructN: OK
1422.89 s
[vector] +++ OK, passed 100 tests.
1422.89 s
[vector] constructrN: OK
1422.90 s
[vector] +++ OK, passed 100 tests.
1422.90 s
[vector] cons: OK
1422.90 s
[vector] +++ OK, passed 100 tests.
1422.90 s
[vector] snoc: OK
1422.91 s
[vector] +++ OK, passed 100 tests.
1422.91 s
[vector] append: OK
1422.91 s
[vector] +++ OK, passed 100 tests.
1422.91 s
[vector] concat: OK
1422.91 s
[vector] +++ OK, passed 100 tests.
1422.91 s
[vector] force: OK
1422.91 s
[vector] +++ OK, passed 100 tests.
1422.91 s
[vector] upd: OK
1422.91 s
[vector] +++ OK, passed 100 tests.
1422.91 s
[vector] accum: OK
1422.91 s
[vector] +++ OK, passed 100 tests.
1422.91 s
[vector] reverse: OK
1422.91 s
[vector] +++ OK, passed 100 tests.
1422.91 s
[vector] backpermute: OK
1422.91 s
[vector] +++ OK, passed 100 tests.
1422.91 s
[vector] map: OK
1422.91 s
[vector] +++ OK, passed 100 tests.
1422.91 s
[vector] imap: OK
1422.92 s
[vector] +++ OK, passed 100 tests.
1422.92 s
[vector] concatMap: OK
1422.93 s
[vector] +++ OK, passed 100 tests.
1422.93 s
[vector] mapM: OK
1422.93 s
[vector] +++ OK, passed 100 tests.
1422.93 s
[vector] mapM_: OK
1422.93 s
[vector] +++ OK, passed 100 tests.
1422.94 s
[vector] forM: OK
1422.94 s
[vector] +++ OK, passed 100 tests.
1422.94 s
[vector] forM_: OK
1422.94 s
[vector] +++ OK, passed 100 tests.
1422.94 s
[vector] imapM: OK
1422.95 s
[vector] +++ OK, passed 100 tests.
1422.95 s
[vector] imapM_: OK
1422.95 s
[vector] +++ OK, passed 100 tests.
1422.95 s
[vector] zipWith: OK
1422.95 s
[vector] +++ OK, passed 100 tests.
1422.95 s
[vector] zipWith3: OK
1422.96 s
[vector] +++ OK, passed 100 tests.
1422.96 s
[vector] izipWith: OK
1422.96 s
[vector] +++ OK, passed 100 tests.
1422.96 s
[vector] izipWith3: OK
1422.96 s
[vector] +++ OK, passed 100 tests.
1422.97 s
[vector] izipWithM: OK
1422.97 s
[vector] +++ OK, passed 100 tests.
1422.97 s
[vector] izipWithM_: OK
1422.97 s
[vector] +++ OK, passed 100 tests.
1422.98 s
[vector] zipWithM: OK
1422.98 s
[vector] +++ OK, passed 100 tests.
1422.98 s
[vector] zipWithM_: OK
1422.98 s
[vector] +++ OK, passed 100 tests.
1422.98 s
[vector] filter: OK
1422.98 s
[vector] +++ OK, passed 100 tests.
1422.98 s
[vector] ifilter: OK
1422.98 s
[vector] +++ OK, passed 100 tests.
1423.02 s
[vector] filterM: OK (0.04s)
1423.02 s
[vector] +++ OK, passed 100 tests.
1423.02 s
[vector] uniq: OK
1423.02 s
[vector] +++ OK, passed 100 tests.
1423.03 s
[vector] mapMaybe: OK
1423.03 s
[vector] +++ OK, passed 100 tests.
1423.03 s
[vector] imapMaybe: OK
1423.03 s
[vector] +++ OK, passed 100 tests.
1423.03 s
[vector] takeWhile: OK
1423.03 s
[vector] +++ OK, passed 100 tests.
1423.03 s
[vector] dropWhile: OK
1423.03 s
[vector] +++ OK, passed 100 tests.
1423.04 s
[vector] partition: OK
1423.04 s
[vector] +++ OK, passed 100 tests.
1423.04 s
[vector] partitionWith: OK
1423.04 s
[vector] +++ OK, passed 100 tests.
1423.05 s
[vector] span: OK
1423.05 s
[vector] +++ OK, passed 100 tests.
1423.05 s
[vector] break: OK
1423.05 s
[vector] +++ OK, passed 100 tests.
1423.05 s
[vector] spanR: OK
1423.05 s
[vector] +++ OK, passed 100 tests.
1423.05 s
[vector] breakR: OK
1423.05 s
[vector] +++ OK, passed 100 tests.
1423.05 s
[vector] groupBy: OK
1423.06 s
[vector] +++ OK, passed 100 tests.
1423.06 s
[vector] elem: OK
1423.06 s
[vector] +++ OK, passed 100 tests.
1423.06 s
[vector] notElem: OK
1423.06 s
[vector] +++ OK, passed 100 tests.
1423.06 s
[vector] find: OK
1423.07 s
[vector] +++ OK, passed 100 tests.
1423.07 s
[vector] findIndex: OK
1423.07 s
[vector] +++ OK, passed 100 tests.
1423.07 s
[vector] findIndexR: OK
1423.07 s
[vector] +++ OK, passed 100 tests.
1423.07 s
[vector] findIndices: OK
1423.07 s
[vector] +++ OK, passed 100 tests.
1423.07 s
[vector] elemIndex: OK
1423.07 s
[vector] +++ OK, passed 100 tests.
1423.07 s
[vector] elemIndices: OK
1423.07 s
[vector] +++ OK, passed 100 tests.
1423.07 s
[vector] foldl: OK
1423.08 s
[vector] +++ OK, passed 100 tests.
1423.08 s
[vector] foldl1: OK
1423.08 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1423.08 s
[vector] foldl': OK
1423.08 s
[vector] +++ OK, passed 100 tests.
1423.08 s
[vector] foldl1': OK
1423.08 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1423.08 s
[vector] foldr: OK
1423.08 s
[vector] +++ OK, passed 100 tests.
1423.08 s
[vector] foldr1: OK
1423.08 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1423.09 s
[vector] foldr': OK
1423.09 s
[vector] +++ OK, passed 100 tests.
1423.09 s
[vector] foldr1': OK
1423.09 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1423.09 s
[vector] ifoldl: OK
1423.09 s
[vector] +++ OK, passed 100 tests.
1423.10 s
[vector] ifoldl': OK
1423.10 s
[vector] +++ OK, passed 100 tests.
1423.11 s
[vector] ifoldr: OK
1423.12 s
[vector] +++ OK, passed 100 tests.
1423.12 s
[vector] ifoldr': OK
1423.12 s
[vector] +++ OK, passed 100 tests.
1423.12 s
[vector] ifoldM: OK
1423.12 s
[vector] +++ OK, passed 100 tests.
1423.12 s
[vector] ifoldM': OK
1423.12 s
[vector] +++ OK, passed 100 tests.
1423.12 s
[vector] ifoldM_: OK
1423.12 s
[vector] +++ OK, passed 100 tests.
1423.12 s
[vector] ifoldM'_: OK
1423.12 s
[vector] +++ OK, passed 100 tests.
1423.12 s
[vector] all: OK
1423.12 s
[vector] +++ OK, passed 100 tests.
1423.12 s
[vector] any: OK
1423.12 s
[vector] +++ OK, passed 100 tests.
1423.12 s
[vector] prescanl: OK
1423.12 s
[vector] +++ OK, passed 100 tests.
1423.12 s
[vector] prescanl': OK
1423.12 s
[vector] +++ OK, passed 100 tests.
1423.12 s
[vector] postscanl: OK
1423.12 s
[vector] +++ OK, passed 100 tests.
1423.13 s
[vector] postscanl': OK
1423.13 s
[vector] +++ OK, passed 100 tests.
1423.13 s
[vector] scanl: OK
1423.13 s
[vector] +++ OK, passed 100 tests.
1423.13 s
[vector] scanl': OK
1423.13 s
[vector] +++ OK, passed 100 tests.
1423.13 s
[vector] scanl1: OK
1423.13 s
[vector] +++ OK, passed 100 tests.
1423.13 s
[vector] scanl1': OK
1423.13 s
[vector] +++ OK, passed 100 tests.
1423.13 s
[vector] iscanl: OK
1423.13 s
[vector] +++ OK, passed 100 tests.
1423.13 s
[vector] iscanl': OK
1423.13 s
[vector] +++ OK, passed 100 tests.
1423.13 s
[vector] prescanr: OK
1423.13 s
[vector] +++ OK, passed 100 tests.
1423.13 s
[vector] prescanr': OK
1423.13 s
[vector] +++ OK, passed 100 tests.
1423.13 s
[vector] postscanr: OK
1423.13 s
[vector] +++ OK, passed 100 tests.
1423.14 s
[vector] postscanr': OK
1423.14 s
[vector] +++ OK, passed 100 tests.
1423.14 s
[vector] scanr: OK
1423.14 s
[vector] +++ OK, passed 100 tests.
1423.14 s
[vector] scanr': OK
1423.14 s
[vector] +++ OK, passed 100 tests.
1423.14 s
[vector] scanr1: OK
1423.14 s
[vector] +++ OK, passed 100 tests.
1423.14 s
[vector] scanr1': OK
1423.14 s
[vector] +++ OK, passed 100 tests.
1423.14 s
[vector] iscanr: OK
1423.14 s
[vector] +++ OK, passed 100 tests.
1423.14 s
[vector] iscanr': OK
1423.14 s
[vector] +++ OK, passed 100 tests.
1423.14 s
[vector] mut_read: OK
1423.14 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1423.15 s
[vector] mut_write: OK
1423.15 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1423.15 s
[vector] mut_modify: OK
1423.15 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1423.15 s
[vector] mut_generate: OK
1423.16 s
[vector] +++ OK, passed 100 tests.
1423.17 s
[vector] mut_generateM: OK
1423.17 s
[vector] +++ OK, passed 100 tests.
1423.17 s
[vector] mut_mapM_: OK
1423.17 s
[vector] +++ OK, passed 100 tests.
1423.17 s
[vector] mut_imapM_: OK
1423.18 s
[vector] +++ OK, passed 100 tests.
1423.20 s
[vector] mut_forM_: OK
1423.20 s
[vector] +++ OK, passed 100 tests.
1423.20 s
[vector] mut_iforM_: OK (0.02s)
1423.20 s
[vector] +++ OK, passed 100 tests.
1423.20 s
[vector] mut_foldr: OK
1423.21 s
[vector] +++ OK, passed 100 tests.
1423.21 s
[vector] mut_foldr': OK
1423.21 s
[vector] +++ OK, passed 100 tests.
1423.21 s
[vector] mut_foldl: OK
1423.21 s
[vector] +++ OK, passed 100 tests.
1423.21 s
[vector] mut_foldl': OK
1423.21 s
[vector] +++ OK, passed 100 tests.
1423.21 s
[vector] mut_ifoldr: OK
1423.21 s
[vector] +++ OK, passed 100 tests.
1423.21 s
[vector] mut_ifoldr': OK
1423.21 s
[vector] +++ OK, passed 100 tests.
1423.22 s
[vector] mut_ifoldl: OK
1423.22 s
[vector] +++ OK, passed 100 tests.
1423.22 s
[vector] mut_ifoldl': OK
1423.22 s
[vector] +++ OK, passed 100 tests.
1423.22 s
[vector] mut_foldM: OK
1423.22 s
[vector] +++ OK, passed 100 tests.
1423.22 s
[vector] mut_foldM': OK
1423.22 s
[vector] +++ OK, passed 100 tests.
1423.22 s
[vector] mut_foldrM: OK
1423.22 s
[vector] +++ OK, passed 100 tests.
1423.22 s
[vector] mut_foldrM': OK
1423.22 s
[vector] +++ OK, passed 100 tests.
1423.22 s
[vector] mut_ifoldM: OK
1423.22 s
[vector] +++ OK, passed 100 tests.
1423.22 s
[vector] mut_ifoldM': OK
1423.23 s
[vector] +++ OK, passed 100 tests.
1423.23 s
[vector] mut_ifoldrM: OK
1423.23 s
[vector] +++ OK, passed 100 tests.
1423.23 s
[vector] mut_ifoldrM': OK
1423.23 s
[vector] +++ OK, passed 100 tests.
1423.23 s
[vector] compare: OK
1423.23 s
[vector] +++ OK, passed 100 tests.
1423.23 s
[vector] maximum: OK
1423.23 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1423.23 s
[vector] minimum: OK
1423.23 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1423.23 s
[vector] minIndex: OK
1423.23 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1423.23 s
[vector] maxIndex: OK
1423.23 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1423.23 s
[vector] maximumBy: OK
1423.23 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1423.23 s
[vector] minimumBy: OK
1423.23 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1423.23 s
[vector] maximumOn: OK
1423.23 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1423.23 s
[vector] minimumOn: OK
1423.23 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1423.23 s
[vector] maxIndexBy: OK
1423.23 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1423.23 s
[vector] minIndexBy: OK
1423.23 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1423.23 s
[vector] ListFirstMaxIndexWins: OK
1423.23 s
[vector] +++ OK, passed 100 tests; 25 discarded.
1423.23 s
[vector] FalseListFirstMaxIndexWins: OK
1423.23 s
[vector] +++ OK, failed as expected. (after 1 test):
1423.23 s
[vector] Exception:
1423.23 s
[vector] Prelude.foldr1: empty list
1423.23 s
[vector] CallStack (from HasCallStack):
1423.23 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1423.23 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1423.23 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1423.23 s
[vector] []
1423.23 s
[vector] zip: OK
1423.23 s
[vector] +++ OK, passed 100 tests.
1423.23 s
[vector] zip3: OK
1423.24 s
[vector] +++ OK, passed 100 tests.
1423.24 s
[vector] unzip: OK
1423.24 s
[vector] +++ OK, passed 100 tests.
1423.24 s
[vector] unzip3: OK
1423.24 s
[vector] +++ OK, passed 100 tests.
1423.24 s
[vector] indexed: OK
1423.24 s
[vector] +++ OK, passed 100 tests.
1423.24 s
[vector] update: OK
1423.24 s
[vector] +++ OK, passed 100 tests.
1423.24 s
[vector] concat: OK
1423.24 s
[vector] +++ OK, passed 100 tests.
1423.24 s
[vector] mempty: OK
1423.24 s
[vector] +++ OK, passed 100 tests.
1423.24 s
[vector] mappend: OK
1423.25 s
[vector] +++ OK, passed 100 tests.
1423.26 s
[vector] mconcat: OK
1423.26 s
[vector] +++ OK, passed 100 tests.
1423.26 s
[vector] fmap: OK
1423.26 s
[vector] +++ OK, passed 100 tests.
1423.26 s
[vector] return: OK
1423.27 s
[vector] +++ OK, passed 100 tests.
1423.27 s
[vector] bind: OK (0.01s)
1423.27 s
[vector] +++ OK, passed 100 tests.
1423.27 s
[vector] mzip: OK
1423.27 s
[vector] +++ OK, passed 100 tests.
1423.27 s
[vector] munzip: OK
1423.27 s
[pandoc-lua-engine] [ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
1423.27 s
[pandoc-lua-engine] [ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
1423.27 s
[pandoc-lua-engine] [ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
1423.27 s
[pandoc-lua-engine] [ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
1423.27 s
[pandoc-lua-engine] [ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
1423.27 s
[pandoc-lua-engine] [ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
1423.27 s
[pandoc-lua-engine] [ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
1423.27 s
[pandoc-lua-engine] [ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
1423.27 s
[pandoc-lua-engine] [10 of 39] Compiling Text.Pandoc.Lua.PandocLua
1423.28 s
[vector] +++ OK, passed 100 tests.
1423.28 s
[vector] applicative_pure: OK
1423.28 s
[vector] +++ OK, passed 100 tests.
1423.28 s
[vector] applicative_appl: OK (0.01s)
1423.28 s
[vector] +++ OK, passed 100 tests.
1423.30 s
[vector] alternative_empty: OK
1423.30 s
[vector] +++ OK, passed 100 tests.
1423.30 s
[vector] alternative_or: OK
1423.30 s
[vector] +++ OK, passed 100 tests.
1423.33 s
[vector] sequence: OK (0.04s)
1423.33 s
[vector] +++ OK, passed 100 tests.
1423.33 s
[vector] sequence_: OK (0.01s)
1423.33 s
[vector] +++ OK, passed 100 tests.
1423.33 s
[vector] glength: OK
1423.33 s
[vector] +++ OK, passed 100 tests.
1423.33 s
[vector] and: OK
1423.33 s
[vector] +++ OK, passed 100 tests.
1423.33 s
[vector] or: OK
1423.33 s
[vector] +++ OK, passed 100 tests.
1423.33 s
[vector] Int
1423.33 s
[vector] fromList.toList == id: OK
1423.33 s
[vector] +++ OK, passed 100 tests.
1423.33 s
[vector] toList.fromList == id: OK
1423.33 s
[vector] +++ OK, passed 100 tests.
1423.33 s
[vector] unstream.stream == id: OK
1423.34 s
[vector] +++ OK, passed 100 tests.
1423.34 s
[vector] stream.unstream == id: OK
1423.34 s
[vector] +++ OK, passed 100 tests.
1423.34 s
[vector] eq: OK
1423.34 s
[vector] +++ OK, passed 100 tests.
1423.34 s
[vector] length: OK
1423.34 s
[vector] +++ OK, passed 100 tests.
1423.34 s
[vector] null: OK
1423.34 s
[vector] +++ OK, passed 100 tests.
1423.34 s
[vector] index: OK
1423.34 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1423.34 s
[vector] safeIndex: OK
1423.34 s
[vector] +++ OK, passed 100 tests.
1423.34 s
[vector] head: OK
1423.34 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1423.34 s
[vector] last: OK
1423.34 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1423.34 s
[vector] unsafeIndex: OK
1423.34 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1423.34 s
[vector] unsafeHead: OK
1423.34 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1423.34 s
[vector] unsafeLast: OK
1423.34 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1423.34 s
[vector] slice: OK
1423.34 s
[vector] +++ OK, passed 100 tests.
1423.34 s
[vector] init: OK
1423.35 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1423.35 s
[vector] tail: OK
1423.35 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1423.36 s
[vector] take: OK
1423.36 s
[vector] +++ OK, passed 100 tests.
1423.36 s
[vector] drop: OK
1423.36 s
[vector] +++ OK, passed 100 tests.
1423.36 s
[vector] splitAt: OK
1423.36 s
[vector] +++ OK, passed 100 tests.
1423.36 s
[vector] empty: OK
1423.36 s
[vector] +++ OK, passed 100 tests.
1423.36 s
[vector] singleton: OK
1423.36 s
[vector] +++ OK, passed 100 tests.
1423.36 s
[vector] replicate: OK
1423.36 s
[vector] +++ OK, passed 100 tests.
1423.36 s
[vector] generate: OK
1423.36 s
[vector] +++ OK, passed 100 tests.
1423.37 s
[vector] iterateN: OK
1423.38 s
[vector] +++ OK, passed 100 tests.
1423.38 s
[vector] iterateNM: OK (0.01s)
1423.38 s
[vector] +++ OK, passed 100 tests.
1423.40 s
[vector] generateM: OK (0.03s)
1423.40 s
[vector] +++ OK, passed 100 tests.
1423.40 s
[vector] replicateM: OK
1423.40 s
[vector] +++ OK, passed 100 tests.
1423.40 s
[vector] create: OK
1423.40 s
[vector] +++ OK, passed 100 tests.
1423.40 s
[vector] createT: OK
1423.41 s
[vector] +++ OK, passed 100 tests.
1423.41 s
[vector] unfoldr: OK
1423.41 s
[vector] +++ OK, passed 100 tests.
1423.41 s
[vector] unfoldrN: OK
1423.41 s
[vector] +++ OK, passed 100 tests.
1423.41 s
[vector] unfoldrExactN: OK
1423.41 s
[vector] +++ OK, passed 100 tests.
1423.41 s
[vector] unfoldrM: OK
1423.41 s
[vector] +++ OK, passed 100 tests.
1423.42 s
[vector] unfoldrNM: OK
1423.42 s
[vector] +++ OK, passed 100 tests.
1423.43 s
[vector] unfoldrExactNM: OK (0.02s)
1423.43 s
[vector] +++ OK, passed 100 tests.
1423.44 s
[vector] constructN: OK
1423.44 s
[vector] +++ OK, passed 100 tests.
1423.44 s
[vector] constructrN: OK
1423.44 s
[vector] +++ OK, passed 100 tests.
1423.44 s
[vector] cons: OK
1423.44 s
[vector] +++ OK, passed 100 tests.
1423.44 s
[vector] snoc: OK
1423.45 s
[pandoc-lua-engine] [11 of 39] Compiling Text.Pandoc.Lua.Module.Types
1423.45 s
[vector] +++ OK, passed 100 tests.
1423.45 s
[vector] append: OK
1423.46 s
[vector] +++ OK, passed 100 tests.
1423.46 s
[vector] concat: OK (0.01s)
1423.46 s
[vector] +++ OK, passed 100 tests.
1423.46 s
[vector] force: OK
1423.46 s
[vector] +++ OK, passed 100 tests.
1423.46 s
[vector] upd: OK
1423.46 s
[vector] +++ OK, passed 100 tests.
1423.46 s
[vector] accum: OK
1423.46 s
[vector] +++ OK, passed 100 tests.
1423.46 s
[vector] reverse: OK
1423.47 s
[vector] +++ OK, passed 100 tests.
1423.47 s
[vector] backpermute: OK
1423.47 s
[vector] +++ OK, passed 100 tests.
1423.48 s
[vector] map: OK
1423.48 s
[vector] +++ OK, passed 100 tests.
1423.49 s
[vector] imap: OK
1423.49 s
[vector] +++ OK, passed 100 tests.
1423.49 s
[vector] concatMap: OK
1423.50 s
[vector] +++ OK, passed 100 tests.
1423.50 s
[vector] mapM: OK
1423.52 s
[vector] +++ OK, passed 100 tests.
1423.53 s
[vector] mapM_: OK (0.03s)
1423.53 s
[vector] +++ OK, passed 100 tests.
1423.53 s
[pandoc-lua-engine] [12 of 39] Compiling Text.Pandoc.Lua.Module.Text
1423.54 s
[vector] forM: OK
1423.54 s
[vector] +++ OK, passed 100 tests.
1423.55 s
[vector] forM_: OK (0.02s)
1423.55 s
[vector] +++ OK, passed 100 tests.
1423.55 s
[vector] imapM: OK
1423.56 s
[vector] +++ OK, passed 100 tests.
1423.57 s
[pandoc-lua-engine] [13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
1423.58 s
[vector] imapM_: OK (0.03s)
1423.58 s
[vector] +++ OK, passed 100 tests.
1423.58 s
[vector] zipWith: OK
1423.58 s
[vector] +++ OK, passed 100 tests.
1423.58 s
[vector] zipWith3: OK
1423.58 s
[vector] +++ OK, passed 100 tests.
1423.59 s
[vector] izipWith: OK
1423.59 s
[vector] +++ OK, passed 100 tests.
1423.59 s
[vector] izipWith3: OK
1423.59 s
[vector] +++ OK, passed 100 tests.
1423.60 s
[vector] izipWithM: OK
1423.60 s
[vector] +++ OK, passed 100 tests.
1423.61 s
[vector] izipWithM_: OK (0.01s)
1423.61 s
[vector] +++ OK, passed 100 tests.
1423.61 s
[vector] zipWithM: OK
1423.61 s
[vector] +++ OK, passed 100 tests.
1423.62 s
[vector] zipWithM_: OK (0.01s)
1423.62 s
[vector] +++ OK, passed 100 tests.
1423.62 s
[vector] filter: OK
1423.62 s
[vector] +++ OK, passed 100 tests.
1423.62 s
[vector] ifilter: OK
1423.62 s
[vector] +++ OK, passed 100 tests.
1423.65 s
[vector] filterM: OK (0.01s)
1423.66 s
[vector] +++ OK, passed 100 tests.
1423.66 s
[vector] uniq: OK
1423.66 s
[vector] +++ OK, passed 100 tests.
1423.66 s
[vector] mapMaybe: OK
1423.66 s
[vector] +++ OK, passed 100 tests.
1423.66 s
[vector] imapMaybe: OK
1423.66 s
[vector] +++ OK, passed 100 tests.
1423.66 s
[vector] takeWhile: OK
1423.66 s
[vector] +++ OK, passed 100 tests.
1423.66 s
[vector] dropWhile: OK
1423.66 s
[vector] +++ OK, passed 100 tests.
1423.66 s
[vector] partition: OK
1423.66 s
[vector] +++ OK, passed 100 tests.
1423.66 s
[vector] partitionWith: OK
1423.66 s
[vector] +++ OK, passed 100 tests.
1423.66 s
[vector] span: OK
1423.66 s
[vector] +++ OK, passed 100 tests.
1423.66 s
[vector] break: OK
1423.66 s
[vector] +++ OK, passed 100 tests.
1423.66 s
[vector] spanR: OK
1423.66 s
[vector] +++ OK, passed 100 tests.
1423.67 s
[vector] breakR: OK
1423.67 s
[vector] +++ OK, passed 100 tests.
1423.67 s
[vector] groupBy: OK
1423.67 s
[vector] +++ OK, passed 100 tests.
1423.67 s
[vector] elem: OK
1423.67 s
[vector] +++ OK, passed 100 tests.
1423.67 s
[vector] notElem: OK
1423.67 s
[vector] +++ OK, passed 100 tests.
1423.67 s
[vector] find: OK
1423.67 s
[vector] +++ OK, passed 100 tests.
1423.67 s
[vector] findIndex: OK
1423.67 s
[vector] +++ OK, passed 100 tests.
1423.67 s
[vector] findIndexR: OK
1423.67 s
[vector] +++ OK, passed 100 tests.
1423.67 s
[vector] findIndices: OK
1423.67 s
[vector] +++ OK, passed 100 tests.
1423.67 s
[vector] elemIndex: OK
1423.67 s
[vector] +++ OK, passed 100 tests.
1423.68 s
[vector] elemIndices: OK
1423.68 s
[vector] +++ OK, passed 100 tests.
1423.68 s
[vector] foldl: OK
1423.68 s
[vector] +++ OK, passed 100 tests.
1423.68 s
[vector] foldl1: OK
1423.68 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1423.68 s
[vector] foldl': OK
1423.68 s
[vector] +++ OK, passed 100 tests.
1423.68 s
[vector] foldl1': OK
1423.68 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1423.68 s
[vector] foldr: OK
1423.68 s
[vector] +++ OK, passed 100 tests.
1423.69 s
[vector] foldr1: OK
1423.69 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1423.69 s
[vector] foldr': OK
1423.70 s
[vector] +++ OK, passed 100 tests.
1423.70 s
[vector] foldr1': OK
1423.70 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1423.70 s
[vector] ifoldl: OK
1423.70 s
[vector] +++ OK, passed 100 tests.
1423.70 s
[vector] ifoldl': OK
1423.71 s
[vector] +++ OK, passed 100 tests.
1423.71 s
[vector] ifoldr: OK
1423.71 s
[vector] +++ OK, passed 100 tests.
1423.71 s
[vector] ifoldr': OK
1423.71 s
[vector] +++ OK, passed 100 tests.
1423.72 s
[vector] ifoldM: OK
1423.72 s
[vector] +++ OK, passed 100 tests.
1423.72 s
[vector] ifoldM': OK
1423.72 s
[vector] +++ OK, passed 100 tests.
1423.74 s
[vector] ifoldM_: OK (0.02s)
1423.74 s
[vector] +++ OK, passed 100 tests.
1423.74 s
[vector] ifoldM'_: OK (0.01s)
1423.74 s
[vector] +++ OK, passed 100 tests.
1423.75 s
[vector] all: OK
1423.75 s
[vector] +++ OK, passed 100 tests.
1423.75 s
[vector] any: OK
1423.75 s
[vector] +++ OK, passed 100 tests.
1423.75 s
[vector] prescanl: OK
1423.75 s
[vector] +++ OK, passed 100 tests.
1423.75 s
[vector] prescanl': OK
1423.75 s
[vector] +++ OK, passed 100 tests.
1423.75 s
[vector] postscanl: OK
1423.75 s
[vector] +++ OK, passed 100 tests.
1423.76 s
[vector] postscanl': OK
1423.76 s
[vector] +++ OK, passed 100 tests.
1423.76 s
[vector] scanl: OK
1423.76 s
[vector] +++ OK, passed 100 tests.
1423.76 s
[vector] scanl': OK
1423.76 s
[vector] +++ OK, passed 100 tests.
1423.77 s
[vector] scanl1: OK
1423.77 s
[vector] +++ OK, passed 100 tests.
1423.77 s
[vector] scanl1': OK
1423.77 s
[vector] +++ OK, passed 100 tests.
1423.77 s
[vector] iscanl: OK
1423.77 s
[vector] +++ OK, passed 100 tests.
1423.78 s
[vector] iscanl': OK
1423.78 s
[vector] +++ OK, passed 100 tests.
1423.78 s
[vector] prescanr: OK
1423.78 s
[vector] +++ OK, passed 100 tests.
1423.78 s
[vector] prescanr': OK
1423.78 s
[vector] +++ OK, passed 100 tests.
1423.78 s
[vector] postscanr: OK
1423.78 s
[vector] +++ OK, passed 100 tests.
1423.78 s
[vector] postscanr': OK
1423.78 s
[vector] +++ OK, passed 100 tests.
1423.79 s
[vector] scanr: OK
1423.79 s
[vector] +++ OK, passed 100 tests.
1423.79 s
[vector] scanr': OK
1423.79 s
[vector] +++ OK, passed 100 tests.
1423.79 s
[vector] scanr1: OK
1423.79 s
[vector] +++ OK, passed 100 tests.
1423.80 s
[vector] scanr1': OK
1423.80 s
[vector] +++ OK, passed 100 tests.
1423.80 s
[vector] iscanr: OK
1423.80 s
[vector] +++ OK, passed 100 tests.
1423.80 s
[vector] iscanr': OK
1423.80 s
[vector] +++ OK, passed 100 tests.
1423.80 s
[vector] mut_read: OK
1423.80 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1423.80 s
[vector] mut_write: OK
1423.80 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1423.80 s
[vector] mut_modify: OK
1423.80 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1423.81 s
[vector] mut_generate: OK
1423.82 s
[vector] +++ OK, passed 100 tests.
1423.82 s
[vector] mut_generateM: OK
1423.82 s
[vector] +++ OK, passed 100 tests.
1423.84 s
[vector] mut_mapM_: OK (0.01s)
1423.84 s
[vector] +++ OK, passed 100 tests.
1423.86 s
[vector] mut_imapM_: OK (0.02s)
1423.86 s
[vector] +++ OK, passed 100 tests.
1423.87 s
[vector] mut_forM_: OK (0.02s)
1423.87 s
[vector] +++ OK, passed 100 tests.
1423.89 s
[vector] mut_iforM_: OK
1423.89 s
[vector] +++ OK, passed 100 tests.
1423.89 s
[vector] mut_foldr: OK
1423.90 s
[vector] +++ OK, passed 100 tests.
1423.90 s
[vector] mut_foldr': OK
1423.90 s
[vector] +++ OK, passed 100 tests.
1423.90 s
[vector] mut_foldl: OK
1423.90 s
[vector] +++ OK, passed 100 tests.
1423.90 s
[vector] mut_foldl': OK
1423.91 s
[vector] +++ OK, passed 100 tests.
1423.91 s
[vector] mut_ifoldr: OK
1423.91 s
[vector] +++ OK, passed 100 tests.
1423.92 s
[vector] mut_ifoldr': OK
1423.92 s
[vector] +++ OK, passed 100 tests.
1423.93 s
[vector] mut_ifoldl: OK
1423.93 s
[vector] +++ OK, passed 100 tests.
1423.93 s
[vector] mut_ifoldl': OK
1423.93 s
[vector] +++ OK, passed 100 tests.
1423.94 s
[vector] mut_foldM: OK
1423.94 s
[vector] +++ OK, passed 100 tests.
1423.94 s
[vector] mut_foldM': OK
1423.94 s
[vector] +++ OK, passed 100 tests.
1423.95 s
[vector] mut_foldrM: OK
1423.96 s
[vector] +++ OK, passed 100 tests.
1423.96 s
[vector] mut_foldrM': OK
1423.96 s
[vector] +++ OK, passed 100 tests.
1423.97 s
[vector] mut_ifoldM: OK
1423.97 s
[vector] +++ OK, passed 100 tests.
1423.97 s
[vector] mut_ifoldM': OK
1423.98 s
[vector] +++ OK, passed 100 tests.
1423.98 s
[vector] mut_ifoldrM: OK
1423.99 s
[vector] +++ OK, passed 100 tests.
1423.99 s
[vector] mut_ifoldrM': OK
1423.99 s
[vector] +++ OK, passed 100 tests.
1423.99 s
[vector] compare: OK
1423.99 s
[vector] +++ OK, passed 100 tests.
1423.99 s
[vector] maximum: OK
1423.99 s
[vector] +++ OK, passed 100 tests; 25 discarded.
1423.99 s
[vector] minimum: OK
1423.99 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1424.00 s
[vector] minIndex: OK
1424.00 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1424.00 s
[vector] maxIndex: OK
1424.00 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1424.00 s
[vector] maximumBy: OK
1424.00 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1424.00 s
[vector] minimumBy: OK
1424.00 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1424.00 s
[vector] maximumOn: OK
1424.00 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1424.00 s
[vector] minimumOn: OK
1424.00 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1424.00 s
[vector] maxIndexBy: OK
1424.00 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1424.01 s
[vector] minIndexBy: OK
1424.01 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1424.01 s
[vector] ListFirstMaxIndexWins: OK
1424.01 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1424.01 s
[vector] FalseListFirstMaxIndexWins: OK
1424.01 s
[vector] +++ OK, failed as expected. (after 1 test):
1424.01 s
[vector] Exception:
1424.01 s
[vector] Prelude.foldr1: empty list
1424.01 s
[vector] CallStack (from HasCallStack):
1424.01 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1424.01 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1424.01 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1424.01 s
[vector] []
1424.01 s
[vector] zip: OK
1424.01 s
[vector] +++ OK, passed 100 tests.
1424.02 s
[vector] zip3: OK
1424.02 s
[vector] +++ OK, passed 100 tests.
1424.02 s
[vector] unzip: OK
1424.02 s
[vector] +++ OK, passed 100 tests.
1424.02 s
[vector] unzip3: OK
1424.02 s
[vector] +++ OK, passed 100 tests.
1424.02 s
[vector] indexed: OK
1424.02 s
[vector] +++ OK, passed 100 tests.
1424.04 s
[vector] update: OK
1424.04 s
[vector] +++ OK, passed 100 tests.
1424.04 s
[vector] concat: OK (0.01s)
1424.04 s
[vector] +++ OK, passed 100 tests.
1424.04 s
[vector] mempty: OK
1424.04 s
[vector] +++ OK, passed 100 tests.
1424.05 s
[vector] mappend: OK
1424.05 s
[vector] +++ OK, passed 100 tests.
1424.05 s
[vector] mconcat: OK (0.02s)
1424.05 s
[vector] +++ OK, passed 100 tests.
1424.05 s
[vector] fmap: OK
1424.06 s
[vector] +++ OK, passed 100 tests.
1424.06 s
[vector] return: OK
1424.06 s
[vector] +++ OK, passed 100 tests.
1424.10 s
[vector] bind: OK (0.04s)
1424.10 s
[vector] +++ OK, passed 100 tests.
1424.10 s
[vector] mzip: OK
1424.10 s
[vector] +++ OK, passed 100 tests.
1424.10 s
[vector] munzip: OK
1424.10 s
[vector] +++ OK, passed 100 tests.
1424.12 s
[vector] applicative_pure: OK
1424.12 s
[vector] +++ OK, passed 100 tests.
1424.15 s
[vector] applicative_appl: OK (0.05s)
1424.15 s
[vector] +++ OK, passed 100 tests.
1424.15 s
[vector] alternative_empty: OK
1424.15 s
[vector] +++ OK, passed 100 tests.
1424.15 s
[vector] alternative_or: OK
1424.16 s
[vector] +++ OK, passed 100 tests.
1424.20 s
[vector] sequence: OK (0.04s)
1424.20 s
[vector] +++ OK, passed 100 tests.
1424.20 s
[vector] sequence_: OK (0.02s)
1424.20 s
[vector] +++ OK, passed 100 tests.
1424.20 s
[vector] glength: OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] sum: OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] product: OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] enumFromN: OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] enumFromThenN: OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] enumFromTo: OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] enumFromThenTo: OK
1424.21 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1424.21 s
[vector] unstream
1424.21 s
[vector] unstream == vunstream (exact): OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] unstream == vunstream (unknown): OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] unstreamR ~= vunstream (exact): OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] unstreamR ~= vunstream (unknown): OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] Tests.Vector.Unboxed
1424.21 s
[vector] ()
1424.21 s
[vector] fromList.toList == id: OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] toList.fromList == id: OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] unstream.stream == id: OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] stream.unstream == id: OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] eq: OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] length: OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] null: OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] index: OK
1424.21 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1424.21 s
[vector] safeIndex: OK
1424.21 s
[vector] +++ OK, passed 100 tests.
1424.21 s
[vector] head: OK
1424.21 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1424.22 s
[vector] last: OK
1424.22 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1424.22 s
[vector] unsafeIndex: OK
1424.22 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1424.22 s
[vector] unsafeHead: OK
1424.22 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1424.22 s
[vector] unsafeLast: OK
1424.22 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1424.22 s
[vector] slice: OK
1424.22 s
[vector] +++ OK, passed 100 tests.
1424.22 s
[vector] init: OK
1424.22 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1424.22 s
[vector] tail: OK
1424.22 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1424.22 s
[vector] take: OK
1424.22 s
[vector] +++ OK, passed 100 tests.
1424.22 s
[vector] drop: OK
1424.22 s
[vector] +++ OK, passed 100 tests.
1424.22 s
[vector] splitAt: OK
1424.22 s
[vector] +++ OK, passed 100 tests.
1424.22 s
[vector] empty: OK
1424.22 s
[vector] +++ OK, passed 100 tests.
1424.22 s
[vector] singleton: OK
1424.22 s
[vector] +++ OK, passed 100 tests.
1424.22 s
[vector] replicate: OK
1424.22 s
[vector] +++ OK, passed 100 tests.
1424.22 s
[vector] generate: OK
1424.22 s
[vector] +++ OK, passed 100 tests.
1424.22 s
[vector] iterateN: OK
1424.22 s
[vector] +++ OK, passed 100 tests.
1424.28 s
[vector] iterateNM: OK (0.04s)
1424.28 s
[vector] +++ OK, passed 100 tests.
1424.31 s
[vector] generateM: OK (0.02s)
1424.31 s
[vector] +++ OK, passed 100 tests.
1424.31 s
[vector] replicateM: OK (0.03s)
1424.31 s
[vector] +++ OK, passed 100 tests.
1424.32 s
[vector] create: OK
1424.32 s
[vector] +++ OK, passed 100 tests.
1424.32 s
[vector] createT: OK
1424.32 s
[vector] +++ OK, passed 100 tests.
1424.33 s
[vector] unfoldr: OK
1424.33 s
[vector] +++ OK, passed 100 tests.
1424.33 s
[vector] unfoldrN: OK
1424.33 s
[vector] +++ OK, passed 100 tests.
1424.33 s
[vector] unfoldrExactN: OK
1424.33 s
[vector] +++ OK, passed 100 tests.
1424.33 s
[vector] unfoldrM: OK
1424.33 s
[vector] +++ OK, passed 100 tests.
1424.34 s
[vector] unfoldrNM: OK
1424.34 s
[vector] +++ OK, passed 100 tests.
1424.35 s
[vector] unfoldrExactNM: OK (0.02s)
1424.35 s
[vector] +++ OK, passed 100 tests.
1424.35 s
[vector] constructN: OK
1424.35 s
[vector] +++ OK, passed 100 tests.
1424.35 s
[vector] constructrN: OK
1424.35 s
[vector] +++ OK, passed 100 tests.
1424.35 s
[vector] cons: OK
1424.35 s
[vector] +++ OK, passed 100 tests.
1424.35 s
[vector] snoc: OK
1424.35 s
[vector] +++ OK, passed 100 tests.
1424.36 s
[vector] append: OK
1424.36 s
[vector] +++ OK, passed 100 tests.
1424.36 s
[vector] concat: OK (0.01s)
1424.36 s
[vector] +++ OK, passed 100 tests.
1424.36 s
[vector] force: OK
1424.36 s
[vector] +++ OK, passed 100 tests.
1424.37 s
[vector] upd: OK
1424.37 s
[vector] +++ OK, passed 100 tests.
1424.37 s
[vector] accum: OK
1424.37 s
[vector] +++ OK, passed 100 tests.
1424.37 s
[vector] reverse: OK
1424.37 s
[vector] +++ OK, passed 100 tests.
1424.37 s
[vector] backpermute: OK
1424.37 s
[vector] +++ OK, passed 100 tests.
1424.37 s
[vector] map: OK
1424.37 s
[vector] +++ OK, passed 100 tests.
1424.37 s
[vector] imap: OK
1424.37 s
[vector] +++ OK, passed 100 tests.
1424.37 s
[vector] concatMap: OK
1424.37 s
[vector] +++ OK, passed 100 tests.
1424.37 s
[vector] mapM: OK
1424.37 s
[vector] +++ OK, passed 100 tests.
1424.38 s
[vector] mapM_: OK
1424.38 s
[vector] +++ OK, passed 100 tests.
1424.38 s
[vector] forM: OK
1424.40 s
[vector] +++ OK, passed 100 tests.
1424.40 s
[vector] forM_: OK (0.02s)
1424.40 s
[vector] +++ OK, passed 100 tests.
1424.40 s
[vector] imapM: OK
1424.42 s
[vector] +++ OK, passed 100 tests.
1424.42 s
[vector] imapM_: OK (0.01s)
1424.42 s
[vector] +++ OK, passed 100 tests.
1424.42 s
[vector] zipWith: OK
1424.42 s
[vector] +++ OK, passed 100 tests.
1424.42 s
[vector] zipWith3: OK
1424.43 s
[vector] +++ OK, passed 100 tests.
1424.43 s
[vector] izipWith: OK
1424.43 s
[vector] +++ OK, passed 100 tests.
1424.44 s
[vector] izipWith3: OK
1424.44 s
[vector] +++ OK, passed 100 tests.
1424.44 s
[vector] izipWithM: OK
1424.44 s
[vector] +++ OK, passed 100 tests.
1424.44 s
[vector] izipWithM_: OK
1424.44 s
[vector] +++ OK, passed 100 tests.
1424.45 s
[vector] zipWithM: OK
1424.45 s
[vector] +++ OK, passed 100 tests.
1424.45 s
[vector] zipWithM_: OK
1424.45 s
[vector] +++ OK, passed 100 tests.
1424.45 s
[vector] filter: OK
1424.45 s
[vector] +++ OK, passed 100 tests.
1424.45 s
[vector] ifilter: OK
1424.45 s
[vector] +++ OK, passed 100 tests.
1424.47 s
[vector] filterM: OK (0.01s)
1424.47 s
[vector] +++ OK, passed 100 tests.
1424.48 s
[vector] uniq: OK
1424.48 s
[vector] +++ OK, passed 100 tests.
1424.48 s
[vector] mapMaybe: OK
1424.48 s
[vector] +++ OK, passed 100 tests.
1424.48 s
[vector] imapMaybe: OK
1424.48 s
[vector] +++ OK, passed 100 tests.
1424.48 s
[vector] takeWhile: OK
1424.48 s
[vector] +++ OK, passed 100 tests.
1424.48 s
[vector] dropWhile: OK
1424.48 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] partition: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] partitionWith: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] span: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] break: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] spanR: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] breakR: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] groupBy: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] elem: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] notElem: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] find: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] findIndex: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] findIndexR: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] findIndices: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] elemIndex: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] elemIndices: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] foldl: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] foldl1: OK
1424.49 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1424.49 s
[vector] foldl': OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] foldl1': OK
1424.49 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1424.49 s
[vector] foldr: OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] foldr1: OK
1424.49 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1424.49 s
[vector] foldr': OK
1424.49 s
[vector] +++ OK, passed 100 tests.
1424.49 s
[vector] foldr1': OK
1424.49 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1424.49 s
[vector] ifoldl: OK
1424.50 s
[vector] +++ OK, passed 100 tests.
1424.50 s
[vector] ifoldl': OK
1424.50 s
[vector] +++ OK, passed 100 tests.
1424.50 s
[vector] ifoldr: OK
1424.50 s
[vector] +++ OK, passed 100 tests.
1424.50 s
[vector] ifoldr': OK
1424.50 s
[vector] +++ OK, passed 100 tests.
1424.50 s
[vector] ifoldM: OK
1424.50 s
[vector] +++ OK, passed 100 tests.
1424.50 s
[vector] ifoldM': OK
1424.50 s
[vector] +++ OK, passed 100 tests.
1424.50 s
[vector] ifoldM_: OK
1424.50 s
[vector] +++ OK, passed 100 tests.
1424.51 s
[vector] ifoldM'_: OK
1424.51 s
[vector] +++ OK, passed 100 tests.
1424.51 s
[vector] all: OK
1424.51 s
[vector] +++ OK, passed 100 tests.
1424.51 s
[vector] any: OK
1424.51 s
[vector] +++ OK, passed 100 tests.
1424.51 s
[vector] prescanl: OK
1424.51 s
[vector] +++ OK, passed 100 tests.
1424.52 s
[vector] prescanl': OK
1424.52 s
[vector] +++ OK, passed 100 tests.
1424.52 s
[vector] postscanl: OK
1424.52 s
[vector] +++ OK, passed 100 tests.
1424.52 s
[vector] postscanl': OK
1424.52 s
[vector] +++ OK, passed 100 tests.
1424.52 s
[vector] scanl: OK
1424.52 s
[vector] +++ OK, passed 100 tests.
1424.52 s
[vector] scanl': OK
1424.52 s
[vector] +++ OK, passed 100 tests.
1424.52 s
[vector] scanl1: OK
1424.52 s
[vector] +++ OK, passed 100 tests.
1424.52 s
[vector] scanl1': OK
1424.52 s
[vector] +++ OK, passed 100 tests.
1424.52 s
[vector] iscanl: OK
1424.52 s
[vector] +++ OK, passed 100 tests.
1424.52 s
[vector] iscanl': OK
1424.53 s
[vector] +++ OK, passed 100 tests.
1424.53 s
[vector] prescanr: OK
1424.53 s
[vector] +++ OK, passed 100 tests.
1424.53 s
[vector] prescanr': OK
1424.53 s
[vector] +++ OK, passed 100 tests.
1424.53 s
[vector] postscanr: OK
1424.53 s
[vector] +++ OK, passed 100 tests.
1424.53 s
[vector] postscanr': OK
1424.53 s
[vector] +++ OK, passed 100 tests.
1424.53 s
[vector] scanr: OK
1424.53 s
[vector] +++ OK, passed 100 tests.
1424.53 s
[vector] scanr': OK
1424.53 s
[vector] +++ OK, passed 100 tests.
1424.53 s
[vector] scanr1: OK
1424.53 s
[vector] +++ OK, passed 100 tests.
1424.53 s
[vector] scanr1': OK
1424.53 s
[pandoc-lua-engine] [14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
1424.54 s
[pandoc-lua-engine] [15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
1424.54 s
[pandoc-lua-engine] [16 of 39] Compiling Text.Pandoc.Lua.Module.Template
1424.54 s
[vector] +++ OK, passed 100 tests.
1424.54 s
[vector] iscanr: OK
1424.54 s
[vector] +++ OK, passed 100 tests.
1424.54 s
[vector] iscanr': OK
1424.54 s
[vector] +++ OK, passed 100 tests.
1424.54 s
[vector] mut_read: OK
1424.54 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1424.54 s
[vector] mut_write: OK
1424.54 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1424.54 s
[vector] mut_modify: OK
1424.54 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1424.54 s
[vector] mut_generate: OK
1424.55 s
[vector] +++ OK, passed 100 tests.
1424.56 s
[vector] mut_generateM: OK
1424.56 s
[vector] +++ OK, passed 100 tests.
1424.56 s
[vector] mut_mapM_: OK
1424.56 s
[vector] +++ OK, passed 100 tests.
1424.57 s
[vector] mut_imapM_: OK
1424.57 s
[vector] +++ OK, passed 100 tests.
1424.58 s
[vector] mut_forM_: OK
1424.58 s
[vector] +++ OK, passed 100 tests.
1424.58 s
[vector] mut_iforM_: OK (0.01s)
1424.58 s
[vector] +++ OK, passed 100 tests.
1424.58 s
[vector] mut_foldr: OK
1424.59 s
[vector] +++ OK, passed 100 tests.
1424.59 s
[vector] mut_foldr': OK
1424.59 s
[vector] +++ OK, passed 100 tests.
1424.59 s
[vector] mut_foldl: OK
1424.59 s
[vector] +++ OK, passed 100 tests.
1424.59 s
[vector] mut_foldl': OK
1424.59 s
[vector] +++ OK, passed 100 tests.
1424.59 s
[vector] mut_ifoldr: OK
1424.59 s
[vector] +++ OK, passed 100 tests.
1424.59 s
[vector] mut_ifoldr': OK
1424.59 s
[vector] +++ OK, passed 100 tests.
1424.59 s
[vector] mut_ifoldl: OK
1424.59 s
[vector] +++ OK, passed 100 tests.
1424.59 s
[vector] mut_ifoldl': OK
1424.59 s
[vector] +++ OK, passed 100 tests.
1424.59 s
[vector] mut_foldM: OK
1424.60 s
[vector] +++ OK, passed 100 tests.
1424.60 s
[vector] mut_foldM': OK
1424.60 s
[vector] +++ OK, passed 100 tests.
1424.60 s
[vector] mut_foldrM: OK
1424.60 s
[vector] +++ OK, passed 100 tests.
1424.60 s
[vector] mut_foldrM': OK
1424.60 s
[vector] +++ OK, passed 100 tests.
1424.60 s
[vector] mut_ifoldM: OK
1424.60 s
[vector] +++ OK, passed 100 tests.
1424.60 s
[vector] mut_ifoldM': OK
1424.60 s
[vector] +++ OK, passed 100 tests.
1424.60 s
[vector] mut_ifoldrM: OK
1424.60 s
[vector] +++ OK, passed 100 tests.
1424.60 s
[vector] mut_ifoldrM': OK
1424.60 s
[vector] +++ OK, passed 100 tests.
1424.60 s
[vector] compare: OK
1424.60 s
[vector] +++ OK, passed 100 tests.
1424.60 s
[vector] maximum: OK
1424.60 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1424.60 s
[vector] minimum: OK
1424.60 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1424.60 s
[vector] minIndex: OK
1424.60 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1424.60 s
[vector] maxIndex: OK
1424.60 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1424.60 s
[vector] maximumBy: OK
1424.60 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1424.60 s
[vector] minimumBy: OK
1424.60 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1424.60 s
[vector] maximumOn: OK
1424.60 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1424.60 s
[vector] minimumOn: OK
1424.60 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1424.60 s
[vector] maxIndexBy: OK
1424.61 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1424.61 s
[vector] minIndexBy: OK
1424.61 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1424.61 s
[vector] ListFirstMaxIndexWins: OK
1424.61 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1424.61 s
[vector] FalseListFirstMaxIndexWins: OK
1424.61 s
[vector] +++ OK, failed as expected. (after 1 test):
1424.61 s
[vector] Exception:
1424.61 s
[vector] Prelude.foldr1: empty list
1424.61 s
[vector] CallStack (from HasCallStack):
1424.61 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1424.61 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1424.61 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1424.61 s
[vector] []
1424.61 s
[vector] zip: OK
1424.61 s
[vector] +++ OK, passed 100 tests.
1424.61 s
[vector] zip3: OK
1424.62 s
[vector] +++ OK, passed 100 tests.
1424.62 s
[vector] unzip: OK
1424.62 s
[vector] +++ OK, passed 100 tests.
1424.62 s
[vector] unzip3: OK
1424.62 s
[vector] +++ OK, passed 100 tests.
1424.62 s
[vector] indexed: OK
1424.62 s
[vector] +++ OK, passed 100 tests.
1424.62 s
[vector] update: OK
1424.62 s
[vector] +++ OK, passed 100 tests.
1424.62 s
[vector] mempty: OK
1424.62 s
[vector] +++ OK, passed 100 tests.
1424.63 s
[vector] mappend: OK
1424.64 s
[vector] +++ OK, passed 100 tests.
1424.64 s
[vector] mconcat: OK (0.01s)
1424.64 s
[vector] +++ OK, passed 100 tests.
1424.64 s
[vector] glength: OK
1424.64 s
[vector] +++ OK, passed 100 tests.
1424.64 s
[vector] (Bool)
1424.64 s
[vector] fromList.toList == id: OK
1424.64 s
[vector] +++ OK, passed 100 tests.
1424.64 s
[vector] toList.fromList == id: OK
1424.64 s
[vector] +++ OK, passed 100 tests.
1424.64 s
[vector] unstream.stream == id: OK
1424.64 s
[vector] +++ OK, passed 100 tests.
1424.64 s
[vector] stream.unstream == id: OK
1424.64 s
[vector] +++ OK, passed 100 tests.
1424.64 s
[vector] eq: OK
1424.64 s
[vector] +++ OK, passed 100 tests.
1424.64 s
[vector] length: OK
1424.64 s
[vector] +++ OK, passed 100 tests.
1424.65 s
[vector] null: OK
1424.65 s
[vector] +++ OK, passed 100 tests.
1424.65 s
[vector] index: OK
1424.65 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1424.65 s
[vector] safeIndex: OK
1424.65 s
[vector] +++ OK, passed 100 tests.
1424.65 s
[vector] head: OK
1424.65 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1424.65 s
[vector] last: OK
1424.65 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1424.65 s
[vector] unsafeIndex: OK
1424.65 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1424.65 s
[vector] unsafeHead: OK
1424.65 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1424.65 s
[vector] unsafeLast: OK
1424.65 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1424.65 s
[vector] slice: OK
1424.65 s
[vector] +++ OK, passed 100 tests.
1424.65 s
[vector] init: OK
1424.65 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1424.65 s
[vector] tail: OK
1424.65 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1424.65 s
[vector] take: OK
1424.65 s
[vector] +++ OK, passed 100 tests.
1424.65 s
[vector] drop: OK
1424.65 s
[vector] +++ OK, passed 100 tests.
1424.65 s
[vector] splitAt: OK
1424.65 s
[vector] +++ OK, passed 100 tests.
1424.65 s
[vector] empty: OK
1424.65 s
[vector] +++ OK, passed 100 tests.
1424.65 s
[vector] singleton: OK
1424.65 s
[vector] +++ OK, passed 100 tests.
1424.65 s
[vector] replicate: OK
1424.65 s
[vector] +++ OK, passed 100 tests.
1424.65 s
[vector] generate: OK
1424.65 s
[vector] +++ OK, passed 100 tests.
1424.65 s
[vector] iterateN: OK
1424.66 s
[vector] +++ OK, passed 100 tests.
1424.69 s
[vector] iterateNM: OK (0.02s)
1424.69 s
[vector] +++ OK, passed 100 tests.
1424.70 s
[vector] generateM: OK (0.01s)
1424.70 s
[vector] +++ OK, passed 100 tests.
1424.70 s
[vector] replicateM: OK
1424.70 s
[vector] +++ OK, passed 100 tests.
1424.70 s
[vector] create: OK
1424.70 s
[vector] +++ OK, passed 100 tests.
1424.70 s
[vector] createT: OK
1424.70 s
[vector] +++ OK, passed 100 tests.
1424.70 s
[vector] unfoldr: OK
1424.70 s
[vector] +++ OK, passed 100 tests.
1424.70 s
[vector] unfoldrN: OK
1424.70 s
[vector] +++ OK, passed 100 tests.
1424.70 s
[vector] unfoldrExactN: OK
1424.70 s
[vector] +++ OK, passed 100 tests.
1424.70 s
[vector] unfoldrM: OK
1424.70 s
[vector] +++ OK, passed 100 tests.
1424.70 s
[vector] unfoldrNM: OK
1424.70 s
[pandoc-lua-engine] [17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
1424.70 s
[pandoc-lua-engine] [18 of 39] Compiling Text.Pandoc.Lua.Module.Format
1424.70 s
[pandoc-lua-engine] [19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
1424.72 s
[vector] +++ OK, passed 100 tests.
1424.73 s
[vector] unfoldrExactNM: OK (0.02s)
1424.73 s
[vector] +++ OK, passed 100 tests.
1424.73 s
[vector] constructN: OK
1424.73 s
[vector] +++ OK, passed 100 tests.
1424.73 s
[vector] constructrN: OK
1424.73 s
[vector] +++ OK, passed 100 tests.
1424.73 s
[vector] cons: OK
1424.73 s
[vector] +++ OK, passed 100 tests.
1424.73 s
[vector] snoc: OK
1424.73 s
[vector] +++ OK, passed 100 tests.
1424.73 s
[vector] append: OK
1424.74 s
[vector] +++ OK, passed 100 tests.
1424.75 s
[vector] concat: OK (0.01s)
1424.75 s
[vector] +++ OK, passed 100 tests.
1424.75 s
[vector] force: OK
1424.75 s
[vector] +++ OK, passed 100 tests.
1424.75 s
[vector] upd: OK
1424.75 s
[vector] +++ OK, passed 100 tests.
1424.75 s
[vector] accum: OK
1424.75 s
[vector] +++ OK, passed 100 tests.
1424.75 s
[vector] reverse: OK
1424.75 s
[vector] +++ OK, passed 100 tests.
1424.75 s
[vector] backpermute: OK
1424.75 s
[vector] +++ OK, passed 100 tests.
1424.76 s
[vector] map: OK
1424.76 s
[vector] +++ OK, passed 100 tests.
1424.76 s
[vector] imap: OK
1424.76 s
[vector] +++ OK, passed 100 tests.
1424.77 s
[vector] concatMap: OK
1424.77 s
[vector] +++ OK, passed 100 tests.
1424.78 s
[vector] mapM: OK
1424.78 s
[vector] +++ OK, passed 100 tests.
1424.78 s
[vector] mapM_: OK
1424.78 s
[vector] +++ OK, passed 100 tests.
1424.78 s
[vector] forM: OK
1424.78 s
[vector] +++ OK, passed 100 tests.
1424.78 s
[vector] forM_: OK (0.01s)
1424.78 s
[vector] +++ OK, passed 100 tests.
1424.79 s
[vector] imapM: OK
1424.79 s
[vector] +++ OK, passed 100 tests.
1424.80 s
[vector] imapM_: OK (0.01s)
1424.80 s
[vector] +++ OK, passed 100 tests.
1424.80 s
[vector] zipWith: OK
1424.80 s
[vector] +++ OK, passed 100 tests.
1424.80 s
[vector] zipWith3: OK
1424.80 s
[vector] +++ OK, passed 100 tests.
1424.80 s
[vector] izipWith: OK
1424.80 s
[vector] +++ OK, passed 100 tests.
1424.80 s
[vector] izipWith3: OK
1424.81 s
[vector] +++ OK, passed 100 tests.
1424.81 s
[vector] izipWithM: OK
1424.81 s
[vector] +++ OK, passed 100 tests.
1424.82 s
[vector] izipWithM_: OK
1424.82 s
[vector] +++ OK, passed 100 tests.
1424.82 s
[vector] zipWithM: OK
1424.82 s
[vector] +++ OK, passed 100 tests.
1424.82 s
[vector] zipWithM_: OK
1424.82 s
[vector] +++ OK, passed 100 tests.
1424.82 s
[vector] filter: OK
1424.82 s
[vector] +++ OK, passed 100 tests.
1424.82 s
[vector] ifilter: OK
1424.82 s
[vector] +++ OK, passed 100 tests.
1424.84 s
[vector] filterM: OK (0.01s)
1424.84 s
[vector] +++ OK, passed 100 tests.
1424.84 s
[vector] uniq: OK
1424.84 s
[vector] +++ OK, passed 100 tests.
1424.84 s
[vector] mapMaybe: OK
1424.84 s
[vector] +++ OK, passed 100 tests.
1424.84 s
[vector] imapMaybe: OK
1424.84 s
[vector] +++ OK, passed 100 tests.
1424.84 s
[vector] takeWhile: OK
1424.84 s
[vector] +++ OK, passed 100 tests.
1424.84 s
[vector] dropWhile: OK
1424.85 s
[vector] +++ OK, passed 100 tests.
1424.85 s
[vector] partition: OK
1424.85 s
[vector] +++ OK, passed 100 tests.
1424.85 s
[vector] partitionWith: OK
1424.85 s
[vector] +++ OK, passed 100 tests.
1424.85 s
[vector] span: OK
1424.85 s
[vector] +++ OK, passed 100 tests.
1424.85 s
[vector] break: OK
1424.85 s
[vector] +++ OK, passed 100 tests.
1424.85 s
[vector] spanR: OK
1424.85 s
[vector] +++ OK, passed 100 tests.
1424.85 s
[vector] breakR: OK
1424.85 s
[vector] +++ OK, passed 100 tests.
1424.85 s
[vector] groupBy: OK
1424.85 s
[vector] +++ OK, passed 100 tests.
1424.85 s
[vector] elem: OK
1424.85 s
[vector] +++ OK, passed 100 tests.
1424.86 s
[vector] notElem: OK
1424.86 s
[vector] +++ OK, passed 100 tests.
1424.86 s
[vector] find: OK
1424.86 s
[vector] +++ OK, passed 100 tests.
1424.86 s
[vector] findIndex: OK
1424.86 s
[vector] +++ OK, passed 100 tests.
1424.86 s
[vector] findIndexR: OK
1424.86 s
[vector] +++ OK, passed 100 tests.
1424.86 s
[vector] findIndices: OK
1424.86 s
[vector] +++ OK, passed 100 tests.
1424.86 s
[vector] elemIndex: OK
1424.86 s
[vector] +++ OK, passed 100 tests.
1424.86 s
[vector] elemIndices: OK
1424.86 s
[vector] +++ OK, passed 100 tests.
1424.86 s
[vector] foldl: OK
1424.86 s
[vector] +++ OK, passed 100 tests.
1424.86 s
[vector] foldl1: OK
1424.86 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1424.86 s
[vector] foldl': OK
1424.86 s
[vector] +++ OK, passed 100 tests.
1424.86 s
[vector] foldl1': OK
1424.87 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1424.87 s
[vector] foldr: OK
1424.87 s
[vector] +++ OK, passed 100 tests.
1424.87 s
[vector] foldr1: OK
1424.87 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1424.88 s
[vector] foldr': OK
1424.88 s
[vector] +++ OK, passed 100 tests.
1424.88 s
[vector] foldr1': OK
1424.88 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1424.88 s
[vector] ifoldl: OK
1424.88 s
[vector] +++ OK, passed 100 tests.
1424.88 s
[vector] ifoldl': OK
1424.88 s
[vector] +++ OK, passed 100 tests.
1424.88 s
[vector] ifoldr: OK
1424.88 s
[vector] +++ OK, passed 100 tests.
1424.88 s
[vector] ifoldr': OK
1424.88 s
[vector] +++ OK, passed 100 tests.
1424.89 s
[vector] ifoldM: OK
1424.90 s
[vector] +++ OK, passed 100 tests.
1424.90 s
[vector] ifoldM': OK
1424.90 s
[vector] +++ OK, passed 100 tests.
1424.90 s
[vector] ifoldM_: OK (0.01s)
1424.90 s
[vector] +++ OK, passed 100 tests.
1424.90 s
[vector] ifoldM'_: OK (0.01s)
1424.91 s
[vector] +++ OK, passed 100 tests.
1424.91 s
[vector] all: OK
1424.91 s
[vector] +++ OK, passed 100 tests.
1424.91 s
[vector] any: OK
1424.91 s
[vector] +++ OK, passed 100 tests.
1424.91 s
[vector] prescanl: OK
1424.91 s
[vector] +++ OK, passed 100 tests.
1424.91 s
[vector] prescanl': OK
1424.91 s
[vector] +++ OK, passed 100 tests.
1424.91 s
[vector] postscanl: OK
1424.91 s
[vector] +++ OK, passed 100 tests.
1424.91 s
[vector] postscanl': OK
1424.91 s
[vector] +++ OK, passed 100 tests.
1424.92 s
[vector] scanl: OK
1424.92 s
[vector] +++ OK, passed 100 tests.
1424.92 s
[vector] scanl': OK
1424.92 s
[vector] +++ OK, passed 100 tests.
1424.92 s
[vector] scanl1: OK
1424.92 s
[vector] +++ OK, passed 100 tests.
1424.92 s
[vector] scanl1': OK
1424.92 s
[vector] +++ OK, passed 100 tests.
1424.92 s
[vector] iscanl: OK
1424.93 s
[vector] +++ OK, passed 100 tests.
1424.93 s
[vector] iscanl': OK
1424.93 s
[vector] +++ OK, passed 100 tests.
1424.93 s
[vector] prescanr: OK
1424.93 s
[vector] +++ OK, passed 100 tests.
1424.93 s
[vector] prescanr': OK
1424.93 s
[vector] +++ OK, passed 100 tests.
1424.94 s
[vector] postscanr: OK
1424.94 s
[vector] +++ OK, passed 100 tests.
1424.94 s
[vector] postscanr': OK
1424.94 s
[vector] +++ OK, passed 100 tests.
1424.94 s
[vector] scanr: OK
1424.95 s
[vector] +++ OK, passed 100 tests.
1424.95 s
[vector] scanr': OK
1424.95 s
[vector] +++ OK, passed 100 tests.
1424.95 s
[vector] scanr1: OK
1424.96 s
[vector] +++ OK, passed 100 tests.
1424.96 s
[vector] scanr1': OK
1424.96 s
[vector] +++ OK, passed 100 tests.
1424.96 s
[vector] iscanr: OK
1424.96 s
[vector] +++ OK, passed 100 tests.
1424.97 s
[vector] iscanr': OK
1424.97 s
[vector] +++ OK, passed 100 tests.
1424.97 s
[vector] mut_read: OK
1424.97 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1424.97 s
[vector] mut_write: OK
1424.97 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1424.97 s
[vector] mut_modify: OK
1424.97 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1424.97 s
[vector] mut_generate: OK
1424.98 s
[vector] +++ OK, passed 100 tests.
1425.00 s
[vector] mut_generateM: OK (0.01s)
1425.00 s
[vector] +++ OK, passed 100 tests.
1425.01 s
[vector] mut_mapM_: OK (0.01s)
1425.01 s
[vector] +++ OK, passed 100 tests.
1425.02 s
[vector] mut_imapM_: OK (0.01s)
1425.02 s
[vector] +++ OK, passed 100 tests.
1425.03 s
[vector] mut_forM_: OK (0.01s)
1425.03 s
[vector] +++ OK, passed 100 tests.
1425.04 s
[vector] mut_iforM_: OK (0.01s)
1425.04 s
[vector] +++ OK, passed 100 tests.
1425.04 s
[vector] mut_foldr: OK
1425.04 s
[vector] +++ OK, passed 100 tests.
1425.04 s
[vector] mut_foldr': OK
1425.04 s
[vector] +++ OK, passed 100 tests.
1425.04 s
[vector] mut_foldl: OK
1425.04 s
[vector] +++ OK, passed 100 tests.
1425.04 s
[vector] mut_foldl': OK
1425.04 s
[vector] +++ OK, passed 100 tests.
1425.05 s
[vector] mut_ifoldr: OK
1425.05 s
[vector] +++ OK, passed 100 tests.
1425.05 s
[vector] mut_ifoldr': OK
1425.05 s
[vector] +++ OK, passed 100 tests.
1425.05 s
[vector] mut_ifoldl: OK
1425.05 s
[vector] +++ OK, passed 100 tests.
1425.05 s
[vector] mut_ifoldl': OK
1425.05 s
[vector] +++ OK, passed 100 tests.
1425.05 s
[vector] mut_foldM: OK
1425.05 s
[vector] +++ OK, passed 100 tests.
1425.05 s
[vector] mut_foldM': OK
1425.05 s
[vector] +++ OK, passed 100 tests.
1425.06 s
[vector] mut_foldrM: OK
1425.06 s
[vector] +++ OK, passed 100 tests.
1425.06 s
[vector] mut_foldrM': OK
1425.06 s
[vector] +++ OK, passed 100 tests.
1425.06 s
[vector] mut_ifoldM: OK
1425.06 s
[vector] +++ OK, passed 100 tests.
1425.06 s
[vector] mut_ifoldM': OK
1425.06 s
[vector] +++ OK, passed 100 tests.
1425.06 s
[vector] mut_ifoldrM: OK
1425.06 s
[vector] +++ OK, passed 100 tests.
1425.06 s
[vector] mut_ifoldrM': OK
1425.06 s
[vector] +++ OK, passed 100 tests.
1425.06 s
[vector] compare: OK
1425.06 s
[vector] +++ OK, passed 100 tests.
1425.06 s
[vector] maximum: OK
1425.06 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1425.06 s
[vector] minimum: OK
1425.06 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1425.06 s
[vector] minIndex: OK
1425.07 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1425.07 s
[vector] maxIndex: OK
1425.07 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1425.07 s
[vector] maximumBy: OK
1425.07 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1425.07 s
[vector] minimumBy: OK
1425.07 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1425.07 s
[vector] maximumOn: OK
1425.07 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1425.07 s
[vector] minimumOn: OK
1425.07 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1425.07 s
[vector] maxIndexBy: OK
1425.07 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1425.07 s
[vector] minIndexBy: OK
1425.07 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1425.07 s
[vector] ListFirstMaxIndexWins: OK
1425.07 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1425.07 s
[vector] FalseListFirstMaxIndexWins: OK
1425.07 s
[vector] +++ OK, failed as expected. (after 1 test):
1425.07 s
[vector] Exception:
1425.07 s
[vector] Prelude.foldr1: empty list
1425.07 s
[vector] CallStack (from HasCallStack):
1425.07 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1425.07 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1425.07 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1425.07 s
[vector] []
1425.07 s
[vector] zip: OK
1425.07 s
[vector] +++ OK, passed 100 tests.
1425.07 s
[vector] zip3: OK
1425.07 s
[vector] +++ OK, passed 100 tests.
1425.07 s
[vector] unzip: OK
1425.07 s
[vector] +++ OK, passed 100 tests.
1425.08 s
[vector] unzip3: OK
1425.08 s
[vector] +++ OK, passed 100 tests.
1425.08 s
[vector] indexed: OK
1425.08 s
[vector] +++ OK, passed 100 tests.
1425.08 s
[vector] update: OK
1425.08 s
[vector] +++ OK, passed 100 tests.
1425.08 s
[vector] mempty: OK
1425.09 s
[vector] +++ OK, passed 100 tests.
1425.10 s
[vector] mappend: OK
1425.10 s
[vector] +++ OK, passed 100 tests.
1425.10 s
[vector] mconcat: OK (0.01s)
1425.10 s
[vector] +++ OK, passed 100 tests.
1425.10 s
[vector] glength: OK
1425.10 s
[vector] +++ OK, passed 100 tests.
1425.10 s
[vector] and: OK
1425.10 s
[vector] +++ OK, passed 100 tests.
1425.10 s
[vector] or: OK
1425.10 s
[vector] +++ OK, passed 100 tests.
1425.10 s
[vector] (Int)
1425.10 s
[vector] fromList.toList == id: OK
1425.10 s
[vector] +++ OK, passed 100 tests.
1425.10 s
[vector] toList.fromList == id: OK
1425.10 s
[vector] +++ OK, passed 100 tests.
1425.10 s
[vector] unstream.stream == id: OK
1425.10 s
[vector] +++ OK, passed 100 tests.
1425.10 s
[vector] stream.unstream == id: OK
1425.10 s
[vector] +++ OK, passed 100 tests.
1425.10 s
[vector] eq: OK
1425.10 s
[vector] +++ OK, passed 100 tests.
1425.10 s
[vector] length: OK
1425.10 s
[vector] +++ OK, passed 100 tests.
1425.10 s
[vector] null: OK
1425.10 s
[vector] +++ OK, passed 100 tests.
1425.10 s
[vector] index: OK
1425.10 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1425.10 s
[vector] safeIndex: OK
1425.10 s
[vector] +++ OK, passed 100 tests.
1425.10 s
[vector] head: OK
1425.10 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1425.10 s
[vector] last: OK
1425.10 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1425.10 s
[vector] unsafeIndex: OK
1425.11 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1425.11 s
[vector] unsafeHead: OK
1425.11 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1425.11 s
[vector] unsafeLast: OK
1425.11 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1425.11 s
[vector] slice: OK
1425.11 s
[vector] +++ OK, passed 100 tests.
1425.11 s
[vector] init: OK
1425.11 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1425.11 s
[vector] tail: OK
1425.11 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1425.11 s
[vector] take: OK
1425.11 s
[vector] +++ OK, passed 100 tests.
1425.11 s
[vector] drop: OK
1425.11 s
[vector] +++ OK, passed 100 tests.
1425.11 s
[vector] splitAt: OK
1425.11 s
[vector] +++ OK, passed 100 tests.
1425.11 s
[vector] empty: OK
1425.11 s
[vector] +++ OK, passed 100 tests.
1425.11 s
[vector] singleton: OK
1425.12 s
[vector] +++ OK, passed 100 tests.
1425.12 s
[vector] replicate: OK
1425.12 s
[vector] +++ OK, passed 100 tests.
1425.12 s
[vector] generate: OK
1425.12 s
[vector] +++ OK, passed 100 tests.
1425.12 s
[vector] iterateN: OK
1425.12 s
[vector] +++ OK, passed 100 tests.
1425.16 s
[vector] iterateNM: OK (0.03s)
1425.16 s
[vector] +++ OK, passed 100 tests.
1425.17 s
[vector] generateM: OK (0.02s)
1425.17 s
[vector] +++ OK, passed 100 tests.
1425.17 s
[vector] replicateM: OK
1425.17 s
[vector] +++ OK, passed 100 tests.
1425.17 s
[vector] create: OK
1425.17 s
[vector] +++ OK, passed 100 tests.
1425.17 s
[vector] createT: OK
1425.17 s
[vector] +++ OK, passed 100 tests.
1425.17 s
[vector] unfoldr: OK
1425.17 s
[vector] +++ OK, passed 100 tests.
1425.17 s
[vector] unfoldrN: OK
1425.18 s
[vector] +++ OK, passed 100 tests.
1425.18 s
[vector] unfoldrExactN: OK
1425.18 s
[vector] +++ OK, passed 100 tests.
1425.18 s
[vector] unfoldrM: OK
1425.18 s
[vector] +++ OK, passed 100 tests.
1425.19 s
[vector] unfoldrNM: OK
1425.19 s
[vector] +++ OK, passed 100 tests.
1425.20 s
[vector] unfoldrExactNM: OK (0.02s)
1425.20 s
[vector] +++ OK, passed 100 tests.
1425.20 s
[vector] constructN: OK
1425.20 s
[vector] +++ OK, passed 100 tests.
1425.20 s
[vector] constructrN: OK
1425.20 s
[vector] +++ OK, passed 100 tests.
1425.20 s
[vector] cons: OK
1425.20 s
[vector] +++ OK, passed 100 tests.
1425.20 s
[vector] snoc: OK
1425.20 s
[vector] +++ OK, passed 100 tests.
1425.20 s
[vector] append: OK
1425.22 s
[vector] +++ OK, passed 100 tests.
1425.22 s
[vector] concat: OK (0.02s)
1425.22 s
[vector] +++ OK, passed 100 tests.
1425.22 s
[vector] force: OK
1425.22 s
[vector] +++ OK, passed 100 tests.
1425.22 s
[vector] upd: OK
1425.23 s
[vector] +++ OK, passed 100 tests.
1425.23 s
[vector] accum: OK
1425.23 s
[vector] +++ OK, passed 100 tests.
1425.23 s
[vector] reverse: OK
1425.23 s
[vector] +++ OK, passed 100 tests.
1425.23 s
[vector] backpermute: OK
1425.23 s
[vector] +++ OK, passed 100 tests.
1425.23 s
[vector] map: OK
1425.23 s
[vector] +++ OK, passed 100 tests.
1425.23 s
[vector] imap: OK
1425.24 s
[vector] +++ OK, passed 100 tests.
1425.24 s
[vector] concatMap: OK
1425.24 s
[vector] +++ OK, passed 100 tests.
1425.24 s
[vector] mapM: OK
1425.24 s
[vector] +++ OK, passed 100 tests.
1425.25 s
[vector] mapM_: OK (0.02s)
1425.25 s
[vector] +++ OK, passed 100 tests.
1425.25 s
[vector] forM: OK
1425.26 s
[vector] +++ OK, passed 100 tests.
1425.28 s
[vector] forM_: OK (0.02s)
1425.28 s
[vector] +++ OK, passed 100 tests.
1425.28 s
[vector] imapM: OK
1425.30 s
[vector] +++ OK, passed 100 tests.
1425.31 s
[vector] imapM_: OK (0.03s)
1425.31 s
[vector] +++ OK, passed 100 tests.
1425.31 s
[vector] zipWith: OK
1425.31 s
[vector] +++ OK, passed 100 tests.
1425.32 s
[vector] zipWith3: OK
1425.32 s
[vector] +++ OK, passed 100 tests.
1425.32 s
[vector] izipWith: OK
1425.32 s
[vector] +++ OK, passed 100 tests.
1425.33 s
[vector] izipWith3: OK
1425.34 s
[vector] +++ OK, passed 100 tests.
1425.59 s
[vector] izipWithM: OK
1425.59 s
[vector] +++ OK, passed 100 tests.
1425.59 s
[vector] izipWithM_: OK (0.02s)
1425.59 s
[vector] +++ OK, passed 100 tests.
1425.59 s
[vector] zipWithM: OK
1425.59 s
[vector] +++ OK, passed 100 tests.
1425.59 s
[vector] zipWithM_: OK (0.01s)
1425.59 s
[vector] +++ OK, passed 100 tests.
1425.59 s
[vector] filter: OK
1425.59 s
[vector] +++ OK, passed 100 tests.
1425.59 s
[vector] ifilter: OK
1425.59 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] filterM: OK (0.04s)
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] uniq: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] mapMaybe: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] imapMaybe: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] takeWhile: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] dropWhile: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] partition: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] partitionWith: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] span: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] break: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] spanR: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] breakR: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] groupBy: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] elem: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] notElem: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] find: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] findIndex: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] findIndexR: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] findIndices: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] elemIndex: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] elemIndices: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] foldl: OK
1425.60 s
[vector] +++ OK, passed 100 tests.
1425.60 s
[vector] foldl1: OK
1425.60 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1425.61 s
[vector] foldl': OK
1425.61 s
[vector] +++ OK, passed 100 tests.
1425.61 s
[vector] foldl1': OK
1425.61 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1425.61 s
[vector] foldr: OK
1425.61 s
[vector] +++ OK, passed 100 tests.
1425.61 s
[vector] foldr1: OK
1425.61 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1425.61 s
[vector] foldr': OK
1425.61 s
[vector] +++ OK, passed 100 tests.
1425.61 s
[vector] foldr1': OK
1425.61 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1425.61 s
[vector] ifoldl: OK
1425.61 s
[vector] +++ OK, passed 100 tests.
1425.61 s
[vector] ifoldl': OK
1425.61 s
[vector] +++ OK, passed 100 tests.
1425.61 s
[vector] ifoldr: OK
1425.61 s
[vector] +++ OK, passed 100 tests.
1425.61 s
[vector] ifoldr': OK
1425.61 s
[vector] +++ OK, passed 100 tests.
1425.61 s
[vector] ifoldM: OK (0.01s)
1425.61 s
[vector] +++ OK, passed 100 tests.
1425.61 s
[vector] ifoldM': OK
1425.61 s
[vector] +++ OK, passed 100 tests.
1425.61 s
[pandoc-lua-engine] [20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
1425.61 s
[vector] ifoldM_: OK (0.03s)
1425.61 s
[vector] +++ OK, passed 100 tests.
1425.61 s
[vector] ifoldM'_: OK (0.03s)
1425.61 s
[vector] +++ OK, passed 100 tests.
1425.61 s
[vector] all: OK
1425.61 s
[vector] +++ OK, passed 100 tests.
1425.61 s
[vector] any: OK
1425.61 s
[vector] +++ OK, passed 100 tests.
1425.61 s
[vector] prescanl: OK
1425.62 s
[vector] +++ OK, passed 100 tests.
1425.62 s
[vector] prescanl': OK
1425.62 s
[vector] +++ OK, passed 100 tests.
1425.62 s
[vector] postscanl: OK
1425.63 s
[vector] +++ OK, passed 100 tests.
1425.63 s
[vector] postscanl': OK
1425.63 s
[vector] +++ OK, passed 100 tests.
1425.64 s
[vector] scanl: OK
1425.64 s
[vector] +++ OK, passed 100 tests.
1425.64 s
[vector] scanl': OK
1425.64 s
[vector] +++ OK, passed 100 tests.
1425.64 s
[vector] scanl1: OK
1425.65 s
[vector] +++ OK, passed 100 tests.
1425.65 s
[vector] scanl1': OK
1425.65 s
[vector] +++ OK, passed 100 tests.
1425.65 s
[vector] iscanl: OK
1425.65 s
[vector] +++ OK, passed 100 tests.
1425.65 s
[vector] iscanl': OK
1425.66 s
[vector] +++ OK, passed 100 tests.
1425.66 s
[vector] prescanr: OK
1425.66 s
[vector] +++ OK, passed 100 tests.
1425.66 s
[vector] prescanr': OK
1425.66 s
[vector] +++ OK, passed 100 tests.
1425.66 s
[vector] postscanr: OK
1425.67 s
[vector] +++ OK, passed 100 tests.
1425.67 s
[vector] postscanr': OK
1425.67 s
[vector] +++ OK, passed 100 tests.
1425.67 s
[vector] scanr: OK
1425.67 s
[vector] +++ OK, passed 100 tests.
1425.68 s
[vector] scanr': OK
1425.68 s
[vector] +++ OK, passed 100 tests.
1425.68 s
[vector] scanr1: OK
1425.68 s
[vector] +++ OK, passed 100 tests.
1425.68 s
[vector] scanr1': OK
1425.68 s
[vector] +++ OK, passed 100 tests.
1425.68 s
[vector] iscanr: OK
1425.69 s
[vector] +++ OK, passed 100 tests.
1425.69 s
[vector] iscanr': OK
1425.69 s
[vector] +++ OK, passed 100 tests.
1425.69 s
[vector] mut_read: OK
1425.69 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1425.69 s
[vector] mut_write: OK
1425.69 s
[vector] +++ OK, passed 100 tests; 25 discarded.
1425.69 s
[vector] mut_modify: OK
1425.69 s
[vector] +++ OK, passed 100 tests; 10 discarded.
1425.69 s
[vector] mut_generate: OK
1425.70 s
[vector] +++ OK, passed 100 tests.
1425.70 s
[vector] mut_generateM: OK
1425.71 s
[vector] +++ OK, passed 100 tests.
1425.72 s
[vector] mut_mapM_: OK (0.01s)
1425.72 s
[vector] +++ OK, passed 100 tests.
1425.74 s
[vector] mut_imapM_: OK (0.02s)
1425.74 s
[vector] +++ OK, passed 100 tests.
1425.76 s
[vector] mut_forM_: OK (0.02s)
1425.76 s
[vector] +++ OK, passed 100 tests.
1425.77 s
[vector] mut_iforM_: OK (0.02s)
1425.77 s
[vector] +++ OK, passed 100 tests.
1425.77 s
[vector] mut_foldr: OK
1425.77 s
[vector] +++ OK, passed 100 tests.
1425.77 s
[vector] mut_foldr': OK
1425.77 s
[vector] +++ OK, passed 100 tests.
1425.77 s
[vector] mut_foldl: OK
1425.77 s
[vector] +++ OK, passed 100 tests.
1425.77 s
[vector] mut_foldl': OK
1425.77 s
[vector] +++ OK, passed 100 tests.
1425.78 s
[vector] mut_ifoldr: OK
1425.78 s
[vector] +++ OK, passed 100 tests.
1425.78 s
[vector] mut_ifoldr': OK
1425.78 s
[vector] +++ OK, passed 100 tests.
1425.79 s
[vector] mut_ifoldl: OK
1425.79 s
[vector] +++ OK, passed 100 tests.
1425.79 s
[vector] mut_ifoldl': OK
1425.79 s
[vector] +++ OK, passed 100 tests.
1425.79 s
[vector] mut_foldM: OK
1425.79 s
[vector] +++ OK, passed 100 tests.
1425.79 s
[vector] mut_foldM': OK
1425.79 s
[vector] +++ OK, passed 100 tests.
1425.79 s
[vector] mut_foldrM: OK
1425.80 s
[vector] +++ OK, passed 100 tests.
1425.80 s
[vector] mut_foldrM': OK
1425.80 s
[vector] +++ OK, passed 100 tests.
1425.80 s
[vector] mut_ifoldM: OK
1425.80 s
[vector] +++ OK, passed 100 tests.
1425.80 s
[vector] mut_ifoldM': OK
1425.80 s
[vector] +++ OK, passed 100 tests.
1425.81 s
[vector] mut_ifoldrM: OK
1425.81 s
[vector] +++ OK, passed 100 tests.
1425.82 s
[vector] mut_ifoldrM': OK
1425.82 s
[vector] +++ OK, passed 100 tests.
1425.82 s
[vector] compare: OK
1425.82 s
[vector] +++ OK, passed 100 tests.
1425.82 s
[vector] maximum: OK
1425.82 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1425.82 s
[vector] minimum: OK
1425.82 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1425.82 s
[vector] minIndex: OK
1425.82 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1425.82 s
[vector] maxIndex: OK
1425.83 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1425.83 s
[vector] maximumBy: OK
1425.83 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1425.83 s
[vector] minimumBy: OK
1425.83 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1425.83 s
[vector] maximumOn: OK
1425.83 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1425.83 s
[vector] minimumOn: OK
1425.83 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1425.83 s
[vector] maxIndexBy: OK
1425.84 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1425.84 s
[vector] minIndexBy: OK
1425.84 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1425.84 s
[vector] ListFirstMaxIndexWins: OK
1425.84 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1425.84 s
[vector] FalseListFirstMaxIndexWins: OK
1425.84 s
[vector] +++ OK, failed as expected. (after 1 test):
1425.84 s
[vector] Exception:
1425.84 s
[vector] Prelude.foldr1: empty list
1425.84 s
[vector] CallStack (from HasCallStack):
1425.84 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1425.84 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1425.84 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1425.84 s
[vector] []
1425.84 s
[vector] zip: OK
1425.84 s
[vector] +++ OK, passed 100 tests.
1425.84 s
[vector] zip3: OK
1425.84 s
[vector] +++ OK, passed 100 tests.
1425.84 s
[vector] unzip: OK
1425.84 s
[vector] +++ OK, passed 100 tests.
1425.85 s
[vector] unzip3: OK
1425.85 s
[vector] +++ OK, passed 100 tests.
1425.85 s
[vector] indexed: OK
1425.85 s
[vector] +++ OK, passed 100 tests.
1425.85 s
[vector] update: OK
1425.85 s
[vector] +++ OK, passed 100 tests.
1425.85 s
[vector] mempty: OK
1425.85 s
[vector] +++ OK, passed 100 tests.
1425.85 s
[vector] mappend: OK
1425.85 s
[vector] +++ OK, passed 100 tests.
1425.87 s
[vector] mconcat: OK (0.01s)
1425.87 s
[vector] +++ OK, passed 100 tests.
1425.87 s
[vector] glength: OK
1425.87 s
[vector] +++ OK, passed 100 tests.
1425.87 s
[vector] sum: OK
1425.87 s
[vector] +++ OK, passed 100 tests.
1425.87 s
[vector] product: OK
1425.87 s
[vector] +++ OK, passed 100 tests.
1425.87 s
[vector] enumFromN: OK
1425.87 s
[vector] +++ OK, passed 100 tests.
1425.87 s
[vector] enumFromThenN: OK
1425.87 s
[vector] +++ OK, passed 100 tests.
1425.87 s
[vector] enumFromTo: OK
1425.88 s
[vector] +++ OK, passed 100 tests.
1425.88 s
[vector] enumFromThenTo: OK
1425.88 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1425.88 s
[vector] (Float)
1425.88 s
[vector] fromList.toList == id: OK
1425.88 s
[vector] +++ OK, passed 100 tests.
1425.88 s
[vector] toList.fromList == id: OK
1425.88 s
[vector] +++ OK, passed 100 tests.
1425.88 s
[vector] unstream.stream == id: OK
1425.88 s
[vector] +++ OK, passed 100 tests.
1425.88 s
[vector] stream.unstream == id: OK
1425.88 s
[vector] +++ OK, passed 100 tests.
1425.88 s
[vector] eq: OK
1425.88 s
[vector] +++ OK, passed 100 tests.
1425.88 s
[vector] length: OK
1425.88 s
[vector] +++ OK, passed 100 tests.
1425.88 s
[vector] null: OK
1425.88 s
[vector] +++ OK, passed 100 tests.
1425.88 s
[vector] index: OK
1425.88 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1425.88 s
[vector] safeIndex: OK
1425.88 s
[vector] +++ OK, passed 100 tests.
1425.88 s
[vector] head: OK
1425.88 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1425.88 s
[vector] last: OK
1425.88 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1425.88 s
[vector] unsafeIndex: OK
1425.88 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1425.89 s
[vector] unsafeHead: OK
1425.89 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1425.89 s
[vector] unsafeLast: OK
1425.89 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1425.89 s
[vector] slice: OK
1425.89 s
[vector] +++ OK, passed 100 tests.
1425.89 s
[vector] init: OK
1425.89 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1425.89 s
[vector] tail: OK
1425.89 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1425.89 s
[vector] take: OK
1425.89 s
[vector] +++ OK, passed 100 tests.
1425.89 s
[vector] drop: OK
1425.89 s
[vector] +++ OK, passed 100 tests.
1425.89 s
[vector] splitAt: OK
1425.89 s
[vector] +++ OK, passed 100 tests.
1425.89 s
[vector] empty: OK
1425.89 s
[vector] +++ OK, passed 100 tests.
1425.90 s
[vector] singleton: OK
1425.90 s
[vector] +++ OK, passed 100 tests.
1425.90 s
[vector] replicate: OK
1425.90 s
[vector] +++ OK, passed 100 tests.
1425.90 s
[vector] generate: OK
1425.90 s
[vector] +++ OK, passed 100 tests.
1425.92 s
[vector] iterateN: OK
1425.92 s
[vector] +++ OK, passed 100 tests.
1425.96 s
[vector] iterateNM: OK (0.04s)
1425.96 s
[vector] +++ OK, passed 100 tests.
1425.98 s
[vector] generateM: OK (0.04s)
1425.98 s
[vector] +++ OK, passed 100 tests.
1425.99 s
[vector] replicateM: OK
1425.99 s
[vector] +++ OK, passed 100 tests.
1425.99 s
[vector] create: OK
1425.99 s
[vector] +++ OK, passed 100 tests.
1425.99 s
[vector] createT: OK
1425.99 s
[vector] +++ OK, passed 100 tests.
1425.99 s
[vector] unfoldr: OK
1425.99 s
[vector] +++ OK, passed 100 tests.
1425.99 s
[vector] unfoldrN: OK
1426.00 s
[vector] +++ OK, passed 100 tests.
1426.00 s
[vector] unfoldrExactN: OK
1426.00 s
[vector] +++ OK, passed 100 tests.
1426.00 s
[vector] unfoldrM: OK
1426.00 s
[vector] +++ OK, passed 100 tests.
1426.00 s
[vector] unfoldrNM: OK
1426.00 s
[vector] +++ OK, passed 100 tests.
1426.04 s
[vector] unfoldrExactNM: OK
1426.04 s
[vector] +++ OK, passed 100 tests.
1426.04 s
[vector] constructN: OK
1426.05 s
[vector] +++ OK, passed 100 tests.
1426.05 s
[vector] constructrN: OK
1426.05 s
[vector] +++ OK, passed 100 tests.
1426.05 s
[vector] cons: OK
1426.05 s
[vector] +++ OK, passed 100 tests.
1426.05 s
[vector] snoc: OK
1426.05 s
[vector] +++ OK, passed 100 tests.
1426.06 s
[vector] append: OK
1426.06 s
[vector] +++ OK, passed 100 tests.
1426.08 s
[vector] concat: OK (0.02s)
1426.08 s
[vector] +++ OK, passed 100 tests.
1426.08 s
[vector] force: OK
1426.08 s
[vector] +++ OK, passed 100 tests.
1426.08 s
[vector] upd: OK
1426.08 s
[vector] +++ OK, passed 100 tests.
1426.09 s
[vector] accum: OK
1426.09 s
[vector] +++ OK, passed 100 tests.
1426.09 s
[vector] reverse: OK
1426.09 s
[vector] +++ OK, passed 100 tests.
1426.09 s
[vector] backpermute: OK
1426.10 s
[vector] +++ OK, passed 100 tests.
1426.10 s
[vector] map: OK
1426.10 s
[vector] +++ OK, passed 100 tests.
1426.11 s
[vector] imap: OK
1426.11 s
[vector] +++ OK, passed 100 tests.
1426.12 s
[vector] concatMap: OK
1426.12 s
[vector] +++ OK, passed 100 tests.
1426.12 s
[vector] mapM: OK
1426.12 s
[vector] +++ OK, passed 100 tests.
1426.15 s
[vector] mapM_: OK (0.03s)
1426.15 s
[vector] +++ OK, passed 100 tests.
1426.15 s
[vector] forM: OK
1426.16 s
[vector] +++ OK, passed 100 tests.
1426.19 s
[vector] forM_: OK (0.03s)
1426.20 s
[vector] +++ OK, passed 100 tests.
1426.20 s
[vector] imapM: OK
1426.20 s
[vector] +++ OK, passed 100 tests.
1426.24 s
[vector] imapM_: OK (0.04s)
1426.24 s
[vector] +++ OK, passed 100 tests.
1426.26 s
[vector] zipWith: OK (0.01s)
1426.26 s
[vector] +++ OK, passed 100 tests.
1426.28 s
[vector] zipWith3: OK (0.01s)
1426.28 s
[vector] +++ OK, passed 100 tests.
1426.28 s
[vector] izipWith: OK (0.01s)
1426.28 s
[vector] +++ OK, passed 100 tests.
1426.30 s
[vector] izipWith3: OK (0.02s)
1426.30 s
[vector] +++ OK, passed 100 tests.
1426.32 s
[vector] izipWithM: OK (0.01s)
1426.32 s
[vector] +++ OK, passed 100 tests.
1426.38 s
[vector] izipWithM_: OK (0.05s)
1426.38 s
[vector] +++ OK, passed 100 tests.
1426.38 s
[vector] zipWithM: OK (0.01s)
1426.38 s
[vector] +++ OK, passed 100 tests.
1426.40 s
[vector] zipWithM_: OK (0.04s)
1426.40 s
[vector] +++ OK, passed 100 tests.
1426.40 s
[vector] filter: OK
1426.41 s
[vector] +++ OK, passed 100 tests.
1426.41 s
[vector] ifilter: OK
1426.42 s
[vector] +++ OK, passed 100 tests.
1426.46 s
[vector] filterM: OK (0.05s)
1426.46 s
[vector] +++ OK, passed 100 tests.
1426.46 s
[vector] uniq: OK
1426.47 s
[vector] +++ OK, passed 100 tests.
1426.48 s
[vector] mapMaybe: OK
1426.48 s
[vector] +++ OK, passed 100 tests.
1426.48 s
[vector] imapMaybe: OK
1426.48 s
[vector] +++ OK, passed 100 tests.
1426.48 s
[vector] takeWhile: OK
1426.48 s
[vector] +++ OK, passed 100 tests.
1426.49 s
[vector] dropWhile: OK
1426.49 s
[vector] +++ OK, passed 100 tests.
1426.49 s
[vector] partition: OK
1426.49 s
[vector] +++ OK, passed 100 tests.
1426.49 s
[vector] partitionWith: OK
1426.49 s
[vector] +++ OK, passed 100 tests.
1426.50 s
[vector] span: OK
1426.50 s
[vector] +++ OK, passed 100 tests.
1426.50 s
[vector] break: OK
1426.50 s
[vector] +++ OK, passed 100 tests.
1426.50 s
[vector] spanR: OK
1426.50 s
[vector] +++ OK, passed 100 tests.
1426.51 s
[vector] breakR: OK
1426.51 s
[vector] +++ OK, passed 100 tests.
1426.51 s
[vector] groupBy: OK
1426.51 s
[vector] +++ OK, passed 100 tests.
1426.51 s
[vector] elem: OK
1426.51 s
[vector] +++ OK, passed 100 tests.
1426.51 s
[vector] notElem: OK
1426.51 s
[vector] +++ OK, passed 100 tests.
1426.52 s
[vector] find: OK
1426.52 s
[vector] +++ OK, passed 100 tests.
1426.52 s
[vector] findIndex: OK
1426.52 s
[vector] +++ OK, passed 100 tests.
1426.52 s
[vector] findIndexR: OK
1426.52 s
[vector] +++ OK, passed 100 tests.
1426.52 s
[vector] findIndices: OK
1426.52 s
[vector] +++ OK, passed 100 tests.
1426.52 s
[vector] elemIndex: OK
1426.52 s
[vector] +++ OK, passed 100 tests.
1426.54 s
[vector] elemIndices: OK
1426.54 s
[vector] +++ OK, passed 100 tests.
1426.54 s
[vector] foldl: OK
1426.54 s
[vector] +++ OK, passed 100 tests.
1426.54 s
[vector] foldl1: OK
1426.54 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1426.56 s
[vector] foldl': OK
1426.56 s
[vector] +++ OK, passed 100 tests.
1426.57 s
[vector] foldl1': OK
1426.57 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1426.57 s
[vector] foldr: OK
1426.57 s
[pandoc-lua-engine] [21 of 39] Compiling Text.Pandoc.Lua.Module.Image
1426.57 s
[pandoc-lua-engine] [22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
1426.57 s
[pandoc-lua-engine] [23 of 39] Compiling Text.Pandoc.Lua.Orphans
1426.57 s
[pandoc-lua-engine] [24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
1426.57 s
[pandoc-lua-engine] [25 of 39] Compiling Text.Pandoc.Lua.Global
1426.57 s
[pandoc-lua-engine] [26 of 39] Compiling Text.Pandoc.Lua.Filter
1426.57 s
[pandoc-lua-engine] [27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
1426.57 s
[pandoc-lua-engine] [28 of 39] Compiling Text.Pandoc.Lua.SourcePos
1426.57 s
[pandoc-lua-engine] [29 of 39] Compiling Text.Pandoc.Lua.Module.Log
1426.57 s
[pandoc-lua-engine] [30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
1426.57 s
[pandoc-lua-engine] [31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
1426.57 s
[vector] +++ OK, passed 100 tests.
1426.58 s
[vector] foldr1: OK
1426.58 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1426.58 s
[vector] foldr': OK
1426.58 s
[vector] +++ OK, passed 100 tests.
1426.59 s
[vector] foldr1': OK
1426.59 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1426.60 s
[vector] ifoldl: OK
1426.60 s
[vector] +++ OK, passed 100 tests.
1426.62 s
[vector] ifoldl': OK (0.01s)
1426.62 s
[vector] +++ OK, passed 100 tests.
1426.63 s
[vector] ifoldr: OK (0.01s)
1426.64 s
[vector] +++ OK, passed 100 tests.
1426.64 s
[vector] ifoldr': OK
1426.65 s
[vector] +++ OK, passed 100 tests.
1426.66 s
[vector] ifoldM: OK
1426.66 s
[vector] +++ OK, passed 100 tests.
1426.66 s
[vector] ifoldM': OK
1426.66 s
[vector] +++ OK, passed 100 tests.
1426.69 s
[vector] ifoldM_: OK (0.04s)
1426.69 s
[vector] +++ OK, passed 100 tests.
1426.72 s
[vector] ifoldM'_: OK (0.03s)
1426.72 s
[vector] +++ OK, passed 100 tests.
1426.72 s
[vector] all: OK
1426.72 s
[vector] +++ OK, passed 100 tests.
1426.73 s
[vector] any: OK
1426.73 s
[vector] +++ OK, passed 100 tests.
1426.73 s
[vector] prescanl: OK
1426.74 s
[vector] +++ OK, passed 100 tests.
1426.74 s
[vector] prescanl': OK
1426.75 s
[vector] +++ OK, passed 100 tests.
1426.76 s
[vector] postscanl: OK
1426.76 s
[vector] +++ OK, passed 100 tests.
1426.76 s
[vector] postscanl': OK
1426.76 s
[vector] +++ OK, passed 100 tests.
1426.77 s
[vector] scanl: OK
1426.78 s
[vector] +++ OK, passed 100 tests.
1426.78 s
[vector] scanl': OK
1426.78 s
[vector] +++ OK, passed 100 tests.
1426.78 s
[vector] scanl1: OK
1426.78 s
[vector] +++ OK, passed 100 tests.
1426.79 s
[vector] scanl1': OK
1426.79 s
[vector] +++ OK, passed 100 tests.
1426.81 s
[vector] iscanl: OK (0.02s)
1426.81 s
[vector] +++ OK, passed 100 tests.
1426.82 s
[vector] iscanl': OK (0.01s)
1426.82 s
[vector] +++ OK, passed 100 tests.
1426.85 s
[vector] prescanr: OK (0.01s)
1426.85 s
[vector] +++ OK, passed 100 tests.
1426.85 s
[vector] prescanr': OK
1426.85 s
[vector] +++ OK, passed 100 tests.
1426.85 s
[vector] postscanr: OK
1426.85 s
[vector] +++ OK, passed 100 tests.
1426.86 s
[vector] postscanr': OK
1426.86 s
[vector] +++ OK, passed 100 tests.
1426.87 s
[vector] scanr: OK (0.01s)
1426.88 s
[vector] +++ OK, passed 100 tests.
1426.88 s
[vector] scanr': OK
1426.88 s
[vector] +++ OK, passed 100 tests.
1426.88 s
[vector] scanr1: OK
1426.89 s
[vector] +++ OK, passed 100 tests.
1426.91 s
[vector] scanr1': OK
1426.92 s
[vector] +++ OK, passed 100 tests.
1426.93 s
[vector] iscanr: OK (0.03s)
1426.93 s
[vector] +++ OK, passed 100 tests.
1426.94 s
[vector] iscanr': OK (0.01s)
1426.94 s
[vector] +++ OK, passed 100 tests.
1426.94 s
[vector] mut_read: OK
1426.94 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1426.94 s
[vector] mut_write: OK
1426.94 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1426.94 s
[vector] mut_modify: OK
1426.94 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1426.95 s
[vector] mut_generate: OK
1426.96 s
[vector] +++ OK, passed 100 tests.
1426.96 s
[vector] mut_generateM: OK (0.02s)
1426.96 s
[vector] +++ OK, passed 100 tests.
1427.00 s
[vector] mut_mapM_: OK (0.04s)
1427.00 s
[vector] +++ OK, passed 100 tests.
1427.04 s
[vector] mut_imapM_: OK (0.04s)
1427.04 s
[vector] +++ OK, passed 100 tests.
1427.08 s
[vector] mut_forM_: OK (0.03s)
1427.08 s
[vector] +++ OK, passed 100 tests.
1427.10 s
[vector] mut_iforM_: OK (0.03s)
1427.10 s
[vector] +++ OK, passed 100 tests.
1427.11 s
[vector] mut_foldr: OK
1427.11 s
[vector] +++ OK, passed 100 tests.
1427.11 s
[vector] mut_foldr': OK
1427.12 s
[vector] +++ OK, passed 100 tests.
1427.12 s
[vector] mut_foldl: OK
1427.12 s
[vector] +++ OK, passed 100 tests.
1427.12 s
[vector] mut_foldl': OK
1427.12 s
[vector] +++ OK, passed 100 tests.
1427.13 s
[vector] mut_ifoldr: OK
1427.14 s
[vector] +++ OK, passed 100 tests.
1427.15 s
[vector] mut_ifoldr': OK (0.01s)
1427.16 s
[vector] +++ OK, passed 100 tests.
1427.16 s
[vector] mut_ifoldl: OK
1427.16 s
[vector] +++ OK, passed 100 tests.
1427.17 s
[vector] mut_ifoldl': OK (0.01s)
1427.18 s
[vector] +++ OK, passed 100 tests.
1427.18 s
[vector] mut_foldM: OK
1427.18 s
[vector] +++ OK, passed 100 tests.
1427.18 s
[vector] mut_foldM': OK
1427.18 s
[vector] +++ OK, passed 100 tests.
1427.19 s
[vector] mut_foldrM: OK
1427.20 s
[vector] +++ OK, passed 100 tests.
1427.20 s
[vector] mut_foldrM': OK
1427.20 s
[vector] +++ OK, passed 100 tests.
1427.21 s
[vector] mut_ifoldM: OK
1427.22 s
[vector] +++ OK, passed 100 tests.
1427.22 s
[vector] mut_ifoldM': OK
1427.22 s
[vector] +++ OK, passed 100 tests.
1427.22 s
[vector] mut_ifoldrM: OK
1427.22 s
[vector] +++ OK, passed 100 tests.
1427.23 s
[vector] mut_ifoldrM': OK
1427.23 s
[vector] +++ OK, passed 100 tests.
1427.23 s
[vector] compare: OK
1427.23 s
[vector] +++ OK, passed 100 tests.
1427.23 s
[vector] maximum: OK
1427.23 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1427.23 s
[vector] minimum: OK
1427.23 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1427.23 s
[vector] minIndex: OK
1427.23 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1427.23 s
[vector] maxIndex: OK
1427.23 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1427.23 s
[vector] maximumBy: OK
1427.23 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1427.23 s
[vector] minimumBy: OK
1427.23 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1427.23 s
[vector] maximumOn: OK
1427.23 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1427.23 s
[vector] minimumOn: OK
1427.24 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1427.24 s
[vector] maxIndexBy: OK
1427.24 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1427.24 s
[vector] minIndexBy: OK
1427.24 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1427.24 s
[vector] ListFirstMaxIndexWins: OK
1427.24 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1427.24 s
[vector] FalseListFirstMaxIndexWins: OK
1427.24 s
[vector] +++ OK, failed as expected. (after 1 test):
1427.24 s
[vector] Exception:
1427.24 s
[vector] Prelude.foldr1: empty list
1427.24 s
[vector] CallStack (from HasCallStack):
1427.24 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1427.24 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1427.24 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1427.24 s
[vector] []
1427.24 s
[vector] zip: OK
1427.24 s
[vector] +++ OK, passed 100 tests.
1427.24 s
[vector] zip3: OK
1427.24 s
[vector] +++ OK, passed 100 tests.
1427.25 s
[vector] unzip: OK
1427.25 s
[vector] +++ OK, passed 100 tests.
1427.25 s
[vector] unzip3: OK
1427.25 s
[vector] +++ OK, passed 100 tests.
1427.25 s
[vector] indexed: OK
1427.25 s
[vector] +++ OK, passed 100 tests.
1427.25 s
[vector] update: OK
1427.25 s
[vector] +++ OK, passed 100 tests.
1427.25 s
[vector] mempty: OK
1427.25 s
[vector] +++ OK, passed 100 tests.
1427.25 s
[vector] mappend: OK
1427.26 s
[vector] +++ OK, passed 100 tests.
1427.28 s
[vector] mconcat: OK (0.03s)
1427.28 s
[vector] +++ OK, passed 100 tests.
1427.29 s
[vector] glength: OK
1427.29 s
[vector] +++ OK, passed 100 tests.
1427.29 s
[vector] sum: OK
1427.29 s
[vector] +++ OK, passed 100 tests.
1427.29 s
[vector] product: OK
1427.29 s
[vector] +++ OK, passed 100 tests.
1427.29 s
[vector] enumFromN: OK
1427.29 s
[vector] +++ OK, passed 100 tests.
1427.29 s
[vector] enumFromThenN: OK
1427.29 s
[vector] +++ OK, passed 100 tests.
1427.29 s
[vector] enumFromTo: OK
1427.29 s
[vector] +++ OK, passed 100 tests.
1427.29 s
[vector] enumFromThenTo: OK
1427.29 s
[vector] +++ OK, passed 100 tests; 2 discarded.
1427.29 s
[vector] (Double)
1427.29 s
[vector] fromList.toList == id: OK
1427.29 s
[vector] +++ OK, passed 100 tests.
1427.29 s
[vector] toList.fromList == id: OK
1427.29 s
[vector] +++ OK, passed 100 tests.
1427.29 s
[vector] unstream.stream == id: OK
1427.29 s
[vector] +++ OK, passed 100 tests.
1427.29 s
[vector] stream.unstream == id: OK
1427.29 s
[vector] +++ OK, passed 100 tests.
1427.30 s
[vector] eq: OK
1427.30 s
[vector] +++ OK, passed 100 tests.
1427.30 s
[vector] length: OK
1427.30 s
[vector] +++ OK, passed 100 tests.
1427.30 s
[vector] null: OK
1427.30 s
[vector] +++ OK, passed 100 tests.
1427.30 s
[vector] index: OK
1427.30 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1427.30 s
[vector] safeIndex: OK
1427.30 s
[vector] +++ OK, passed 100 tests.
1427.30 s
[vector] head: OK
1427.30 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1427.30 s
[vector] last: OK
1427.30 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1427.30 s
[vector] unsafeIndex: OK
1427.30 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1427.30 s
[vector] unsafeHead: OK
1427.30 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1427.30 s
[vector] unsafeLast: OK
1427.30 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1427.30 s
[vector] slice: OK
1427.30 s
[vector] +++ OK, passed 100 tests.
1427.30 s
[vector] init: OK
1427.30 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1427.30 s
[vector] tail: OK
1427.30 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1427.31 s
[vector] take: OK
1427.31 s
[vector] +++ OK, passed 100 tests.
1427.31 s
[vector] drop: OK
1427.31 s
[vector] +++ OK, passed 100 tests.
1427.31 s
[vector] splitAt: OK
1427.31 s
[vector] +++ OK, passed 100 tests.
1427.31 s
[vector] empty: OK
1427.31 s
[vector] +++ OK, passed 100 tests.
1427.31 s
[vector] singleton: OK
1427.31 s
[vector] +++ OK, passed 100 tests.
1427.31 s
[vector] replicate: OK
1427.31 s
[vector] +++ OK, passed 100 tests.
1427.31 s
[vector] generate: OK
1427.31 s
[vector] +++ OK, passed 100 tests.
1427.32 s
[vector] iterateN: OK
1427.32 s
[vector] +++ OK, passed 100 tests.
1427.36 s
[vector] iterateNM: OK (0.02s)
1427.36 s
[vector] +++ OK, passed 100 tests.
1427.38 s
[vector] generateM: OK (0.03s)
1427.38 s
[vector] +++ OK, passed 100 tests.
1427.38 s
[vector] replicateM: OK
1427.38 s
[vector] +++ OK, passed 100 tests.
1427.38 s
[vector] create: OK
1427.38 s
[vector] +++ OK, passed 100 tests.
1427.38 s
[vector] createT: OK
1427.38 s
[vector] +++ OK, passed 100 tests.
1427.38 s
[vector] unfoldr: OK
1427.38 s
[vector] +++ OK, passed 100 tests.
1427.38 s
[vector] unfoldrN: OK
1427.38 s
[vector] +++ OK, passed 100 tests.
1427.38 s
[vector] unfoldrExactN: OK
1427.38 s
[vector] +++ OK, passed 100 tests.
1427.40 s
[vector] unfoldrM: OK
1427.40 s
[vector] +++ OK, passed 100 tests.
1427.40 s
[vector] unfoldrNM: OK
1427.41 s
[vector] +++ OK, passed 100 tests.
1427.42 s
[vector] unfoldrExactNM: OK (0.02s)
1427.42 s
[vector] +++ OK, passed 100 tests.
1427.44 s
[vector] constructN: OK (0.02s)
1427.44 s
[vector] +++ OK, passed 100 tests.
1427.44 s
[vector] constructrN: OK (0.01s)
1427.44 s
[vector] +++ OK, passed 100 tests.
1427.46 s
[vector] cons: OK
1427.46 s
[vector] +++ OK, passed 100 tests.
1427.46 s
[vector] snoc: OK
1427.46 s
[vector] +++ OK, passed 100 tests.
1427.46 s
[vector] append: OK
1427.46 s
[vector] +++ OK, passed 100 tests.
1427.47 s
[vector] concat: OK (0.03s)
1427.47 s
[vector] +++ OK, passed 100 tests.
1427.47 s
[vector] force: OK
1427.47 s
[vector] +++ OK, passed 100 tests.
1427.47 s
[vector] upd: OK
1427.47 s
[vector] +++ OK, passed 100 tests.
1427.48 s
[vector] accum: OK (0.01s)
1427.48 s
[vector] +++ OK, passed 100 tests.
1427.48 s
[vector] reverse: OK
1427.48 s
[vector] +++ OK, passed 100 tests.
1427.49 s
[vector] backpermute: OK
1427.49 s
[vector] +++ OK, passed 100 tests.
1427.50 s
[vector] map: OK
1427.50 s
[vector] +++ OK, passed 100 tests.
1427.50 s
[vector] imap: OK
1427.50 s
[vector] +++ OK, passed 100 tests.
1427.52 s
[vector] concatMap: OK
1427.52 s
[vector] +++ OK, passed 100 tests.
1427.52 s
[vector] mapM: OK
1427.54 s
[vector] +++ OK, passed 100 tests.
1427.56 s
[vector] mapM_: OK (0.03s)
1427.56 s
[vector] +++ OK, passed 100 tests.
1427.58 s
[vector] forM: OK (0.01s)
1427.58 s
[vector] +++ OK, passed 100 tests.
1427.61 s
[vector] forM_: OK (0.04s)
1427.62 s
[vector] +++ OK, passed 100 tests.
1427.62 s
[vector] imapM: OK
1427.62 s
[vector] +++ OK, passed 100 tests.
1427.66 s
[vector] imapM_: OK (0.03s)
1427.66 s
[vector] +++ OK, passed 100 tests.
1427.67 s
[vector] zipWith: OK
1427.67 s
[pandoc-server] [1 of 1] Compiling Text.Pandoc.Server
1427.68 s
[vector] +++ OK, passed 100 tests.
1427.68 s
[vector] zipWith3: OK (0.01s)
1427.68 s
[vector] +++ OK, passed 100 tests.
1427.68 s
[vector] izipWith: OK
1427.69 s
[vector] +++ OK, passed 100 tests.
1427.70 s
[vector] izipWith3: OK (0.01s)
1427.70 s
[vector] +++ OK, passed 100 tests.
1427.72 s
[vector] izipWithM: OK (0.01s)
1427.72 s
[vector] +++ OK, passed 100 tests.
1427.74 s
[vector] izipWithM_: OK (0.03s)
1427.74 s
[vector] +++ OK, passed 100 tests.
1427.74 s
[vector] zipWithM: OK
1427.74 s
[vector] +++ OK, passed 100 tests.
1427.78 s
[vector] zipWithM_: OK (0.03s)
1427.78 s
[vector] +++ OK, passed 100 tests.
1427.78 s
[vector] filter: OK
1427.78 s
[vector] +++ OK, passed 100 tests.
1427.80 s
[vector] ifilter: OK
1427.80 s
[vector] +++ OK, passed 100 tests.
1427.82 s
[vector] filterM: OK (0.04s)
1427.83 s
[vector] +++ OK, passed 100 tests.
1427.84 s
[vector] uniq: OK
1427.84 s
[vector] +++ OK, passed 100 tests.
1427.84 s
[vector] mapMaybe: OK
1427.84 s
[vector] +++ OK, passed 100 tests.
1427.84 s
[vector] imapMaybe: OK
1427.84 s
[vector] +++ OK, passed 100 tests.
1427.85 s
[vector] takeWhile: OK
1427.86 s
[vector] +++ OK, passed 100 tests.
1427.86 s
[vector] dropWhile: OK
1427.86 s
[vector] +++ OK, passed 100 tests.
1427.86 s
[vector] partition: OK
1427.86 s
[vector] +++ OK, passed 100 tests.
1427.86 s
[vector] partitionWith: OK
1427.86 s
[vector] +++ OK, passed 100 tests.
1427.86 s
[vector] span: OK
1427.86 s
[vector] +++ OK, passed 100 tests.
1427.86 s
[vector] break: OK
1427.86 s
[vector] +++ OK, passed 100 tests.
1427.86 s
[vector] spanR: OK
1427.86 s
[vector] +++ OK, passed 100 tests.
1427.86 s
[vector] breakR: OK
1427.86 s
[vector] +++ OK, passed 100 tests.
1427.87 s
[vector] groupBy: OK
1427.87 s
[vector] +++ OK, passed 100 tests.
1427.88 s
[vector] elem: OK
1427.88 s
[vector] +++ OK, passed 100 tests.
1427.88 s
[vector] notElem: OK
1427.88 s
[vector] +++ OK, passed 100 tests.
1427.89 s
[vector] find: OK
1427.89 s
[vector] +++ OK, passed 100 tests.
1427.89 s
[vector] findIndex: OK
1427.89 s
[vector] +++ OK, passed 100 tests.
1427.89 s
[vector] findIndexR: OK
1427.89 s
[vector] +++ OK, passed 100 tests.
1427.89 s
[vector] findIndices: OK
1427.89 s
[vector] +++ OK, passed 100 tests.
1427.89 s
[vector] elemIndex: OK
1427.89 s
[vector] +++ OK, passed 100 tests.
1427.89 s
[vector] elemIndices: OK
1427.90 s
[vector] +++ OK, passed 100 tests.
1427.91 s
[vector] foldl: OK (0.01s)
1427.92 s
[vector] +++ OK, passed 100 tests.
1427.92 s
[vector] foldl1: OK (0.01s)
1427.92 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1427.93 s
[vector] foldl': OK (0.01s)
1427.94 s
[vector] +++ OK, passed 100 tests.
1427.94 s
[vector] foldl1': OK (0.01s)
1427.94 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1427.96 s
[vector] foldr: OK (0.01s)
1427.96 s
[vector] +++ OK, passed 100 tests.
1427.96 s
[vector] foldr1: OK (0.01s)
1427.96 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1427.97 s
[vector] foldr': OK
1427.97 s
[vector] +++ OK, passed 100 tests.
1427.99 s
[vector] foldr1': OK (0.01s)
1428.00 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1428.00 s
[vector] ifoldl: OK (0.01s)
1428.00 s
[vector] +++ OK, passed 100 tests.
1428.02 s
[vector] ifoldl': OK (0.01s)
1428.02 s
[vector] +++ OK, passed 100 tests.
1428.04 s
[vector] ifoldr: OK (0.01s)
1428.04 s
[vector] +++ OK, passed 100 tests.
1428.05 s
[vector] ifoldr': OK (0.02s)
1428.06 s
[vector] +++ OK, passed 100 tests.
1428.06 s
[vector] ifoldM: OK (0.01s)
1428.06 s
[vector] +++ OK, passed 100 tests.
1428.08 s
[vector] ifoldM': OK (0.01s)
1428.08 s
[vector] +++ OK, passed 100 tests.
1428.12 s
[vector] ifoldM_: OK (0.04s)
1428.12 s
[vector] +++ OK, passed 100 tests.
1428.14 s
[vector] ifoldM'_: OK (0.03s)
1428.14 s
[vector] +++ OK, passed 100 tests.
1428.14 s
[vector] all: OK
1428.14 s
[vector] +++ OK, passed 100 tests.
1428.14 s
[pandoc-lua-engine] [32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
1428.14 s
[pandoc-lua-engine] [33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
1428.14 s
[pandoc-lua-engine] [34 of 39] Compiling Text.Pandoc.Lua.Module
1428.15 s
[vector] any: OK
1428.15 s
[vector] +++ OK, passed 100 tests.
1428.15 s
[vector] prescanl: OK (0.01s)
1428.15 s
[vector] +++ OK, passed 100 tests.
1428.17 s
[vector] prescanl': OK
1428.17 s
[vector] +++ OK, passed 100 tests.
1428.17 s
[vector] postscanl: OK (0.01s)
1428.17 s
[vector] +++ OK, passed 100 tests.
1428.20 s
[vector] postscanl': OK (0.01s)
1428.20 s
[vector] +++ OK, passed 100 tests.
1428.21 s
[vector] scanl: OK (0.01s)
1428.22 s
[vector] +++ OK, passed 100 tests.
1428.22 s
[vector] scanl': OK (0.01s)
1428.22 s
[vector] +++ OK, passed 100 tests.
1428.24 s
[vector] scanl1: OK (0.01s)
1428.24 s
[vector] +++ OK, passed 100 tests.
1428.26 s
[vector] scanl1': OK (0.01s)
1428.26 s
[vector] +++ OK, passed 100 tests.
1428.26 s
[vector] iscanl: OK (0.01s)
1428.26 s
[vector] +++ OK, passed 100 tests.
1428.28 s
[vector] iscanl': OK (0.02s)
1428.28 s
[vector] +++ OK, passed 100 tests.
1428.30 s
[vector] prescanr: OK (0.01s)
1428.30 s
[vector] +++ OK, passed 100 tests.
1428.31 s
[vector] prescanr': OK (0.01s)
1428.31 s
[vector] +++ OK, passed 100 tests.
1428.31 s
[vector] postscanr: OK (0.01s)
1428.31 s
[vector] +++ OK, passed 100 tests.
1428.34 s
[vector] postscanr': OK
1428.34 s
[vector] +++ OK, passed 100 tests.
1428.34 s
[vector] scanr: OK (0.01s)
1428.34 s
[vector] +++ OK, passed 100 tests.
1428.36 s
[vector] scanr': OK (0.01s)
1428.36 s
[vector] +++ OK, passed 100 tests.
1428.38 s
[vector] scanr1: OK (0.01s)
1428.38 s
[vector] +++ OK, passed 100 tests.
1428.40 s
[vector] scanr1': OK (0.01s)
1428.40 s
[vector] +++ OK, passed 100 tests.
1428.42 s
[vector] iscanr: OK (0.03s)
1428.42 s
[vector] +++ OK, passed 100 tests.
1428.44 s
[vector] iscanr': OK (0.03s)
1428.44 s
[vector] +++ OK, passed 100 tests.
1428.44 s
[vector] mut_read: OK
1428.44 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1428.44 s
[vector] mut_write: OK
1428.44 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1428.44 s
[vector] mut_modify: OK
1428.44 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1428.45 s
[pandoc-lua-engine] [35 of 39] Compiling Text.Pandoc.Lua.Init
1428.46 s
[vector] mut_generate: OK
1428.46 s
[vector] +++ OK, passed 100 tests.
1428.50 s
[vector] mut_generateM: OK (0.03s)
1428.50 s
[vector] +++ OK, passed 100 tests.
1428.52 s
[vector] mut_mapM_: OK (0.04s)
1428.52 s
[vector] +++ OK, passed 100 tests.
1428.53 s
[pandoc-lua-engine] [36 of 39] Compiling Text.Pandoc.Lua.Run
1428.56 s
[vector] mut_imapM_: OK (0.03s)
1428.56 s
[vector] +++ OK, passed 100 tests.
1428.60 s
[vector] mut_forM_: OK (0.03s)
1428.60 s
[vector] +++ OK, passed 100 tests.
1428.63 s
[vector] mut_iforM_: OK (0.03s)
1428.63 s
[vector] +++ OK, passed 100 tests.
1428.63 s
[vector] mut_foldr: OK (0.01s)
1428.63 s
[vector] +++ OK, passed 100 tests.
1428.63 s
[pandoc-lua-engine] [37 of 39] Compiling Text.Pandoc.Lua.Custom
1428.64 s
[vector] mut_foldr': OK
1428.64 s
[vector] +++ OK, passed 100 tests.
1428.67 s
[vector] mut_foldl: OK (0.01s)
1428.68 s
[vector] +++ OK, passed 100 tests.
1428.68 s
[vector] mut_foldl': OK (0.02s)
1428.68 s
[vector] +++ OK, passed 100 tests.
1428.70 s
[vector] mut_ifoldr: OK (0.02s)
1428.70 s
[vector] +++ OK, passed 100 tests.
1428.72 s
[vector] mut_ifoldr': OK (0.02s)
1428.72 s
[vector] +++ OK, passed 100 tests.
1428.74 s
[vector] mut_ifoldl: OK (0.01s)
1428.74 s
[vector] +++ OK, passed 100 tests.
1428.76 s
[vector] mut_ifoldl': OK (0.01s)
1428.76 s
[vector] +++ OK, passed 100 tests.
1428.76 s
[vector] mut_foldM: OK (0.02s)
1428.76 s
[vector] +++ OK, passed 100 tests.
1428.78 s
[vector] mut_foldM': OK
1428.78 s
[vector] +++ OK, passed 100 tests.
1428.80 s
[vector] mut_foldrM: OK (0.02s)
1428.80 s
[vector] +++ OK, passed 100 tests.
1428.81 s
[vector] mut_foldrM': OK (0.01s)
1428.82 s
[vector] +++ OK, passed 100 tests.
1428.82 s
[vector] mut_ifoldM: OK (0.01s)
1428.82 s
[vector] +++ OK, passed 100 tests.
1428.84 s
[vector] mut_ifoldM': OK (0.01s)
1428.84 s
[vector] +++ OK, passed 100 tests.
1428.85 s
[vector] mut_ifoldrM: OK (0.01s)
1428.85 s
[vector] +++ OK, passed 100 tests.
1428.86 s
[vector] mut_ifoldrM': OK (0.01s)
1428.86 s
[vector] +++ OK, passed 100 tests.
1428.86 s
[vector] compare: OK
1428.86 s
[vector] +++ OK, passed 100 tests.
1428.86 s
[vector] maximum: OK
1428.86 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1428.86 s
[vector] minimum: OK
1428.86 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1428.86 s
[vector] minIndex: OK
1428.86 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1428.86 s
[vector] maxIndex: OK
1428.86 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1428.86 s
[vector] maximumBy: OK
1428.86 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1428.86 s
[vector] minimumBy: OK
1428.86 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1428.86 s
[vector] maximumOn: OK
1428.86 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1428.87 s
[vector] minimumOn: OK
1428.87 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1428.87 s
[vector] maxIndexBy: OK
1428.87 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1428.87 s
[vector] minIndexBy: OK
1428.87 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1428.87 s
[vector] ListFirstMaxIndexWins: OK
1428.87 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1428.87 s
[vector] FalseListFirstMaxIndexWins: OK
1428.87 s
[vector] +++ OK, failed as expected. (after 1 test):
1428.87 s
[vector] Exception:
1428.87 s
[vector] Prelude.foldr1: empty list
1428.87 s
[vector] CallStack (from HasCallStack):
1428.87 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1428.87 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1428.87 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1428.87 s
[vector] []
1428.87 s
[vector] zip: OK
1428.88 s
[vector] +++ OK, passed 100 tests.
1428.88 s
[vector] zip3: OK
1428.88 s
[vector] +++ OK, passed 100 tests.
1428.88 s
[vector] unzip: OK
1428.88 s
[vector] +++ OK, passed 100 tests.
1428.88 s
[vector] unzip3: OK
1428.88 s
[vector] +++ OK, passed 100 tests.
1428.88 s
[vector] indexed: OK
1428.88 s
[vector] +++ OK, passed 100 tests.
1428.88 s
[vector] update: OK
1428.88 s
[vector] +++ OK, passed 100 tests.
1428.89 s
[vector] mempty: OK
1428.89 s
[vector] +++ OK, passed 100 tests.
1428.90 s
[vector] mappend: OK
1428.90 s
[vector] +++ OK, passed 100 tests.
1428.91 s
[vector] mconcat: OK (0.02s)
1428.91 s
[vector] +++ OK, passed 100 tests.
1428.91 s
[vector] glength: OK
1428.91 s
[vector] +++ OK, passed 100 tests.
1428.91 s
[vector] sum: OK
1428.91 s
[vector] +++ OK, passed 100 tests.
1428.92 s
[vector] product: OK
1428.92 s
[vector] +++ OK, passed 100 tests.
1428.92 s
[vector] enumFromN: OK
1428.92 s
[vector] +++ OK, passed 100 tests.
1428.92 s
[vector] enumFromThenN: OK
1428.92 s
[vector] +++ OK, passed 100 tests.
1428.92 s
[vector] enumFromTo: OK
1428.92 s
[vector] +++ OK, passed 100 tests.
1428.92 s
[vector] enumFromThenTo: OK
1428.92 s
[vector] +++ OK, passed 100 tests.
1428.92 s
[vector] (Int,Bool)
1428.92 s
[vector] fromList.toList == id: OK
1428.92 s
[vector] +++ OK, passed 100 tests.
1428.92 s
[vector] toList.fromList == id: OK
1428.92 s
[vector] +++ OK, passed 100 tests.
1428.92 s
[vector] unstream.stream == id: OK
1428.92 s
[vector] +++ OK, passed 100 tests.
1428.92 s
[vector] stream.unstream == id: OK
1428.92 s
[vector] +++ OK, passed 100 tests.
1428.92 s
[vector] eq: OK
1428.92 s
[vector] +++ OK, passed 100 tests.
1428.92 s
[vector] length: OK
1428.92 s
[vector] +++ OK, passed 100 tests.
1428.92 s
[vector] null: OK
1428.92 s
[vector] +++ OK, passed 100 tests.
1428.93 s
[vector] index: OK
1428.93 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1428.93 s
[vector] safeIndex: OK
1428.93 s
[vector] +++ OK, passed 100 tests.
1428.93 s
[vector] head: OK
1428.93 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1428.93 s
[vector] last: OK
1428.93 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1428.93 s
[vector] unsafeIndex: OK
1428.93 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1428.93 s
[vector] unsafeHead: OK
1428.93 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1428.93 s
[vector] unsafeLast: OK
1428.93 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1428.93 s
[vector] slice: OK
1428.93 s
[vector] +++ OK, passed 100 tests.
1428.93 s
[vector] init: OK
1428.93 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1428.93 s
[vector] tail: OK
1428.93 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1428.93 s
[vector] take: OK
1428.94 s
[vector] +++ OK, passed 100 tests.
1428.94 s
[vector] drop: OK
1428.94 s
[vector] +++ OK, passed 100 tests.
1428.94 s
[vector] splitAt: OK
1428.94 s
[vector] +++ OK, passed 100 tests.
1428.94 s
[vector] empty: OK
1428.94 s
[vector] +++ OK, passed 100 tests.
1428.94 s
[vector] singleton: OK
1428.94 s
[vector] +++ OK, passed 100 tests.
1428.94 s
[vector] replicate: OK
1428.96 s
[vector] +++ OK, passed 100 tests.
1428.96 s
[vector] generate: OK
1428.96 s
[vector] +++ OK, passed 100 tests.
1428.96 s
[vector] iterateN: OK
1428.96 s
[vector] +++ OK, passed 100 tests.
1428.98 s
[vector] iterateNM: OK (0.02s)
1428.98 s
[vector] +++ OK, passed 100 tests.
1428.98 s
[pandoc-lua-engine] [38 of 39] Compiling Text.Pandoc.Lua.Engine
1429.02 s
[vector] generateM: OK (0.05s)
1429.02 s
[vector] +++ OK, passed 100 tests.
1429.05 s
[vector] replicateM: OK (0.04s)
1429.05 s
[vector] +++ OK, passed 100 tests.
1429.05 s
[vector] create: OK
1429.05 s
[vector] +++ OK, passed 100 tests.
1429.05 s
[vector] createT: OK
1429.05 s
[vector] +++ OK, passed 100 tests.
1429.05 s
[vector] unfoldr: OK
1429.05 s
[vector] +++ OK, passed 100 tests.
1429.05 s
[vector] unfoldrN: OK
1429.05 s
[vector] +++ OK, passed 100 tests.
1429.06 s
[vector] unfoldrExactN: OK
1429.07 s
[vector] +++ OK, passed 100 tests.
1429.07 s
[vector] unfoldrM: OK
1429.07 s
[vector] +++ OK, passed 100 tests.
1429.07 s
[vector] unfoldrNM: OK
1429.07 s
[vector] +++ OK, passed 100 tests.
1429.09 s
[pandoc-lua-engine] [39 of 39] Compiling Text.Pandoc.Lua
1429.09 s
[vector] unfoldrExactNM: OK (0.02s)
1429.09 s
[vector] +++ OK, passed 100 tests.
1429.09 s
[vector] constructN: OK
1429.10 s
[vector] +++ OK, passed 100 tests.
1429.11 s
[vector] constructrN: OK
1429.11 s
[vector] +++ OK, passed 100 tests.
1429.11 s
[vector] cons: OK
1429.11 s
[vector] +++ OK, passed 100 tests.
1429.11 s
[vector] snoc: OK
1429.11 s
[vector] +++ OK, passed 100 tests.
1429.11 s
[vector] append: OK
1429.12 s
[vector] +++ OK, passed 100 tests.
1429.17 s
[vector] concat: OK (0.06s)
1429.17 s
[vector] +++ OK, passed 100 tests.
1429.17 s
[vector] force: OK
1429.19 s
[vector] +++ OK, passed 100 tests.
1429.21 s
[vector] upd: OK (0.03s)
1429.21 s
[vector] +++ OK, passed 100 tests.
1429.21 s
[vector] accum: OK
1429.21 s
[vector] +++ OK, passed 100 tests.
1429.21 s
[vector] reverse: OK
1429.21 s
[vector] +++ OK, passed 100 tests.
1429.21 s
[vector] backpermute: OK
1429.21 s
[vector] +++ OK, passed 100 tests.
1429.22 s
[vector] map: OK
1429.22 s
[vector] +++ OK, passed 100 tests.
1429.22 s
[vector] imap: OK
1429.22 s
[vector] +++ OK, passed 100 tests.
1429.22 s
[vector] concatMap: OK
1429.23 s
[vector] +++ OK, passed 100 tests.
1429.24 s
[vector] mapM: OK
1429.24 s
[vector] +++ OK, passed 100 tests.
1429.26 s
[vector] mapM_: OK (0.03s)
1429.28 s
[vector] +++ OK, passed 100 tests.
1429.28 s
[vector] forM: OK
1429.28 s
[vector] +++ OK, passed 100 tests.
1429.29 s
[vector] forM_: OK (0.03s)
1429.30 s
[vector] +++ OK, passed 100 tests.
1429.30 s
[vector] imapM: OK
1429.30 s
[vector] +++ OK, passed 100 tests.
1429.32 s
[vector] imapM_: OK (0.03s)
1429.33 s
[vector] +++ OK, passed 100 tests.
1429.34 s
[vector] zipWith: OK
1429.34 s
[vector] +++ OK, passed 100 tests.
1429.34 s
[vector] zipWith3: OK
1429.34 s
[vector] +++ OK, passed 100 tests.
1429.34 s
[vector] izipWith: OK
1429.34 s
[vector] +++ OK, passed 100 tests.
1429.34 s
[vector] izipWith3: OK
1429.34 s
[vector] +++ OK, passed 100 tests.
1429.34 s
[vector] izipWithM: OK
1429.34 s
[vector] +++ OK, passed 100 tests.
1429.36 s
[vector] izipWithM_: OK
1429.37 s
[vector] +++ OK, passed 100 tests.
1429.37 s
[vector] zipWithM: OK
1429.38 s
[vector] +++ OK, passed 100 tests.
1429.40 s
[vector] zipWithM_: OK (0.02s)
1429.40 s
[vector] +++ OK, passed 100 tests.
1429.40 s
[vector] filter: OK
1429.42 s
[vector] +++ OK, passed 100 tests.
1429.42 s
[vector] ifilter: OK
1429.42 s
[vector] +++ OK, passed 100 tests.
1429.44 s
[vector] filterM: OK (0.03s)
1429.44 s
[vector] +++ OK, passed 100 tests.
1429.44 s
[vector] uniq: OK
1429.44 s
[vector] +++ OK, passed 100 tests.
1429.44 s
[vector] mapMaybe: OK
1429.44 s
[vector] +++ OK, passed 100 tests.
1429.44 s
[vector] imapMaybe: OK
1429.44 s
[vector] +++ OK, passed 100 tests.
1429.44 s
[vector] takeWhile: OK
1429.44 s
[vector] +++ OK, passed 100 tests.
1429.44 s
[vector] dropWhile: OK
1429.44 s
[vector] +++ OK, passed 100 tests.
1429.45 s
[vector] partition: OK
1429.45 s
[vector] +++ OK, passed 100 tests.
1429.45 s
[vector] partitionWith: OK
1429.45 s
[vector] +++ OK, passed 100 tests.
1429.45 s
[vector] span: OK
1429.45 s
[vector] +++ OK, passed 100 tests.
1429.46 s
[vector] break: OK
1429.46 s
[vector] +++ OK, passed 100 tests.
1429.46 s
[vector] spanR: OK
1429.46 s
[vector] +++ OK, passed 100 tests.
1429.47 s
[vector] breakR: OK
1429.47 s
[vector] +++ OK, passed 100 tests.
1429.47 s
[vector] groupBy: OK
1429.47 s
[vector] +++ OK, passed 100 tests.
1429.47 s
[vector] elem: OK
1429.47 s
[vector] +++ OK, passed 100 tests.
1429.47 s
[vector] notElem: OK
1429.47 s
[vector] +++ OK, passed 100 tests.
1429.48 s
[vector] find: OK
1429.48 s
[vector] +++ OK, passed 100 tests.
1429.48 s
[vector] findIndex: OK
1429.49 s
[vector] +++ OK, passed 100 tests.
1429.49 s
[vector] findIndexR: OK
1429.49 s
[vector] +++ OK, passed 100 tests.
1429.49 s
[vector] findIndices: OK
1429.49 s
[vector] +++ OK, passed 100 tests.
1429.50 s
[vector] elemIndex: OK
1429.50 s
[vector] +++ OK, passed 100 tests.
1429.50 s
[vector] elemIndices: OK
1429.51 s
[vector] +++ OK, passed 100 tests.
1429.51 s
[vector] foldl: OK
1429.52 s
[vector] +++ OK, passed 100 tests.
1429.52 s
[vector] foldl1: OK
1429.52 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1429.52 s
[vector] foldl': OK
1429.52 s
[vector] +++ OK, passed 100 tests.
1429.52 s
[vector] foldl1': OK
1429.52 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1429.54 s
[vector] foldr: OK (0.02s)
1429.54 s
[vector] +++ OK, passed 100 tests.
1429.54 s
[vector] foldr1: OK
1429.55 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1429.55 s
[vector] foldr': OK
1429.56 s
[vector] +++ OK, passed 100 tests.
1429.56 s
[vector] foldr1': OK
1429.56 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1429.56 s
[vector] ifoldl: OK
1429.56 s
[vector] +++ OK, passed 100 tests.
1429.56 s
[vector] ifoldl': OK
1429.56 s
[vector] +++ OK, passed 100 tests.
1429.56 s
[vector] ifoldr: OK
1429.56 s
[vector] +++ OK, passed 100 tests.
1429.56 s
[vector] ifoldr': OK
1429.56 s
[vector] +++ OK, passed 100 tests.
1429.57 s
[vector] ifoldM: OK
1429.58 s
[vector] +++ OK, passed 100 tests.
1429.58 s
[vector] ifoldM': OK
1429.58 s
[vector] +++ OK, passed 100 tests.
1429.60 s
[vector] ifoldM_: OK (0.02s)
1429.60 s
[vector] +++ OK, passed 100 tests.
1429.62 s
[vector] ifoldM'_: OK (0.02s)
1429.62 s
[vector] +++ OK, passed 100 tests.
1429.62 s
[vector] all: OK
1429.62 s
[vector] +++ OK, passed 100 tests.
1429.62 s
[vector] any: OK
1429.62 s
[vector] +++ OK, passed 100 tests.
1429.63 s
[vector] prescanl: OK
1429.63 s
[vector] +++ OK, passed 100 tests.
1429.64 s
[vector] prescanl': OK
1429.64 s
[vector] +++ OK, passed 100 tests.
1429.64 s
[vector] postscanl: OK
1429.64 s
[vector] +++ OK, passed 100 tests.
1429.64 s
[vector] postscanl': OK
1429.64 s
[vector] +++ OK, passed 100 tests.
1429.65 s
[vector] scanl: OK
1429.65 s
[vector] +++ OK, passed 100 tests.
1429.65 s
[vector] scanl': OK
1429.66 s
[vector] +++ OK, passed 100 tests.
1429.66 s
[vector] scanl1: OK
1429.66 s
[vector] +++ OK, passed 100 tests.
1429.66 s
[vector] scanl1': OK
1429.66 s
[vector] +++ OK, passed 100 tests.
1429.67 s
[vector] iscanl: OK
1429.67 s
[vector] +++ OK, passed 100 tests.
1429.67 s
[vector] iscanl': OK
1429.67 s
[vector] +++ OK, passed 100 tests.
1429.68 s
[vector] prescanr: OK
1429.68 s
[vector] +++ OK, passed 100 tests.
1429.69 s
[vector] prescanr': OK
1429.69 s
[vector] +++ OK, passed 100 tests.
1429.69 s
[vector] postscanr: OK
1429.69 s
[vector] +++ OK, passed 100 tests.
1429.69 s
[vector] postscanr': OK
1429.69 s
[vector] +++ OK, passed 100 tests.
1429.69 s
[vector] scanr: OK
1429.69 s
[vector] +++ OK, passed 100 tests.
1429.70 s
[vector] scanr': OK
1429.70 s
[vector] +++ OK, passed 100 tests.
1429.70 s
[vector] scanr1: OK
1429.71 s
[vector] +++ OK, passed 100 tests.
1429.71 s
[vector] scanr1': OK
1429.72 s
[vector] +++ OK, passed 100 tests.
1429.72 s
[vector] iscanr: OK
1429.72 s
[vector] +++ OK, passed 100 tests.
1429.72 s
[vector] iscanr': OK
1429.72 s
[vector] +++ OK, passed 100 tests.
1429.72 s
[vector] mut_read: OK
1429.72 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1429.72 s
[vector] mut_write: OK
1429.72 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1429.72 s
[vector] mut_modify: OK
1429.74 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1429.74 s
[vector] mut_generate: OK
1429.74 s
[vector] +++ OK, passed 100 tests.
1429.76 s
[vector] mut_generateM: OK (0.02s)
1429.76 s
[vector] +++ OK, passed 100 tests.
1429.78 s
[vector] mut_mapM_: OK (0.02s)
1429.78 s
[vector] +++ OK, passed 100 tests.
1429.80 s
[vector] mut_imapM_: OK (0.02s)
1429.80 s
[vector] +++ OK, passed 100 tests.
1429.82 s
[vector] mut_forM_: OK (0.03s)
1429.82 s
[vector] +++ OK, passed 100 tests.
1429.86 s
[vector] mut_iforM_: OK (0.03s)
1429.86 s
[vector] +++ OK, passed 100 tests.
1429.86 s
[vector] mut_foldr: OK
1429.86 s
[vector] +++ OK, passed 100 tests.
1429.86 s
[vector] mut_foldr': OK
1429.86 s
[vector] +++ OK, passed 100 tests.
1429.87 s
[vector] mut_foldl: OK
1429.87 s
[vector] +++ OK, passed 100 tests.
1429.87 s
[vector] mut_foldl': OK
1429.87 s
[vector] +++ OK, passed 100 tests.
1429.87 s
[vector] mut_ifoldr: OK
1429.87 s
[vector] +++ OK, passed 100 tests.
1429.88 s
[vector] mut_ifoldr': OK
1429.88 s
[vector] +++ OK, passed 100 tests.
1429.88 s
[vector] mut_ifoldl: OK
1429.88 s
[vector] +++ OK, passed 100 tests.
1429.88 s
[vector] mut_ifoldl': OK
1429.88 s
[vector] +++ OK, passed 100 tests.
1429.89 s
[vector] mut_foldM: OK
1429.89 s
[vector] +++ OK, passed 100 tests.
1429.90 s
[vector] mut_foldM': OK
1429.90 s
[vector] +++ OK, passed 100 tests.
1429.90 s
[vector] mut_foldrM: OK
1429.90 s
[vector] +++ OK, passed 100 tests.
1429.90 s
[vector] mut_foldrM': OK
1429.90 s
[vector] +++ OK, passed 100 tests.
1429.91 s
[vector] mut_ifoldM: OK
1429.91 s
[vector] +++ OK, passed 100 tests.
1429.91 s
[vector] mut_ifoldM': OK
1429.91 s
[vector] +++ OK, passed 100 tests.
1429.92 s
[vector] mut_ifoldrM: OK
1429.92 s
[vector] +++ OK, passed 100 tests.
1429.92 s
[vector] mut_ifoldrM': OK
1429.92 s
[vector] +++ OK, passed 100 tests.
1429.92 s
[vector] compare: OK
1429.92 s
[vector] +++ OK, passed 100 tests.
1429.92 s
[vector] maximum: OK
1429.92 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1429.92 s
[vector] minimum: OK
1429.92 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1429.92 s
[vector] minIndex: OK
1429.92 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1429.92 s
[vector] maxIndex: OK
1429.92 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1429.92 s
[vector] maximumBy: OK
1429.92 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1429.92 s
[vector] minimumBy: OK
1429.92 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1429.92 s
[vector] maximumOn: OK
1429.93 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1429.93 s
[vector] minimumOn: OK
1429.93 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1429.93 s
[vector] maxIndexBy: OK
1429.93 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1429.93 s
[vector] minIndexBy: OK
1429.93 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1429.93 s
[vector] ListFirstMaxIndexWins: OK
1429.93 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1429.93 s
[vector] FalseListFirstMaxIndexWins: OK
1429.94 s
[vector] +++ OK, failed as expected. (after 1 test):
1429.94 s
[vector] Exception:
1429.94 s
[vector] Prelude.foldr1: empty list
1429.94 s
[vector] CallStack (from HasCallStack):
1429.94 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1429.94 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1429.94 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1429.94 s
[vector] []
1429.94 s
[vector] zip: OK
1429.94 s
[vector] +++ OK, passed 100 tests.
1429.95 s
[vector] zip3: OK
1429.95 s
[vector] +++ OK, passed 100 tests.
1429.95 s
[vector] unzip: OK
1429.96 s
[vector] +++ OK, passed 100 tests.
1429.96 s
[vector] unzip3: OK
1429.96 s
[vector] +++ OK, passed 100 tests.
1429.96 s
[vector] indexed: OK
1429.96 s
[vector] +++ OK, passed 100 tests.
1429.96 s
[vector] update: OK
1429.96 s
[vector] +++ OK, passed 100 tests.
1429.96 s
[vector] mempty: OK
1429.96 s
[vector] +++ OK, passed 100 tests.
1429.96 s
[vector] mappend: OK
1429.96 s
[vector] +++ OK, passed 100 tests.
1429.99 s
[vector] mconcat: OK (0.03s)
1429.99 s
[vector] +++ OK, passed 100 tests.
1429.99 s
[vector] glength: OK
1429.99 s
[vector] +++ OK, passed 100 tests.
1429.99 s
[vector] (Int,Bool,Int)
1429.99 s
[vector] fromList.toList == id: OK
1429.99 s
[vector] +++ OK, passed 100 tests.
1429.99 s
[vector] toList.fromList == id: OK
1429.99 s
[vector] +++ OK, passed 100 tests.
1429.99 s
[vector] unstream.stream == id: OK
1429.99 s
[vector] +++ OK, passed 100 tests.
1429.99 s
[vector] stream.unstream == id: OK
1429.99 s
[vector] +++ OK, passed 100 tests.
1429.99 s
[vector] eq: OK
1429.99 s
[vector] +++ OK, passed 100 tests.
1429.99 s
[vector] length: OK
1429.99 s
[vector] +++ OK, passed 100 tests.
1429.99 s
[vector] null: OK
1429.99 s
[vector] +++ OK, passed 100 tests.
1430.00 s
[vector] index: OK
1430.00 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1430.00 s
[vector] safeIndex: OK
1430.00 s
[vector] +++ OK, passed 100 tests.
1430.00 s
[vector] head: OK
1430.00 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1430.00 s
[vector] last: OK
1430.00 s
[vector] +++ OK, passed 100 tests; 25 discarded.
1430.00 s
[vector] unsafeIndex: OK
1430.00 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1430.01 s
[vector] unsafeHead: OK
1430.01 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1430.01 s
[vector] unsafeLast: OK
1430.01 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1430.01 s
[vector] slice: OK
1430.01 s
[vector] +++ OK, passed 100 tests.
1430.01 s
[vector] init: OK
1430.01 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1430.01 s
[vector] tail: OK
1430.01 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1430.01 s
[vector] take: OK
1430.01 s
[vector] +++ OK, passed 100 tests.
1430.01 s
[vector] drop: OK
1430.01 s
[vector] +++ OK, passed 100 tests.
1430.01 s
[vector] splitAt: OK
1430.01 s
[vector] +++ OK, passed 100 tests.
1430.01 s
[vector] empty: OK
1430.01 s
[vector] +++ OK, passed 100 tests.
1430.01 s
[vector] singleton: OK
1430.01 s
[vector] +++ OK, passed 100 tests.
1430.01 s
[vector] replicate: OK
1430.01 s
[vector] +++ OK, passed 100 tests.
1430.02 s
[vector] generate: OK
1430.02 s
[vector] +++ OK, passed 100 tests.
1430.02 s
[vector] iterateN: OK
1430.02 s
[vector] +++ OK, passed 100 tests.
1430.04 s
[vector] iterateNM: OK (0.02s)
1430.04 s
[vector] +++ OK, passed 100 tests.
1430.06 s
[vector] generateM: OK (0.02s)
1430.06 s
[vector] +++ OK, passed 100 tests.
1430.07 s
[vector] replicateM: OK (0.02s)
1430.07 s
[vector] +++ OK, passed 100 tests.
1430.07 s
[vector] create: OK
1430.08 s
[vector] +++ OK, passed 100 tests.
1430.08 s
[vector] createT: OK
1430.08 s
[vector] +++ OK, passed 100 tests.
1430.08 s
[vector] unfoldr: OK
1430.08 s
[vector] +++ OK, passed 100 tests.
1430.08 s
[vector] unfoldrN: OK
1430.08 s
[vector] +++ OK, passed 100 tests.
1430.09 s
[vector] unfoldrExactN: OK
1430.10 s
[vector] +++ OK, passed 100 tests.
1430.10 s
[vector] unfoldrM: OK
1430.10 s
[vector] +++ OK, passed 100 tests.
1430.10 s
[vector] unfoldrNM: OK
1430.10 s
[vector] +++ OK, passed 100 tests.
1430.11 s
[vector] unfoldrExactNM: OK (0.02s)
1430.11 s
[vector] +++ OK, passed 100 tests.
1430.12 s
[vector] constructN: OK
1430.12 s
[vector] +++ OK, passed 100 tests.
1430.12 s
[vector] constructrN: OK
1430.12 s
[vector] +++ OK, passed 100 tests.
1430.13 s
[vector] cons: OK
1430.13 s
[vector] +++ OK, passed 100 tests.
1430.14 s
[vector] snoc: OK
1430.14 s
[vector] +++ OK, passed 100 tests.
1430.14 s
[vector] append: OK
1430.14 s
[vector] +++ OK, passed 100 tests.
1430.21 s
[vector] concat: OK (0.07s)
1430.21 s
[vector] +++ OK, passed 100 tests.
1430.21 s
[vector] force: OK
1430.21 s
[vector] +++ OK, passed 100 tests.
1430.21 s
[vector] upd: OK
1430.21 s
[vector] +++ OK, passed 100 tests.
1430.22 s
[vector] accum: OK
1430.22 s
[vector] +++ OK, passed 100 tests.
1430.22 s
[vector] reverse: OK
1430.22 s
[vector] +++ OK, passed 100 tests.
1430.22 s
[vector] backpermute: OK
1430.22 s
[vector] +++ OK, passed 100 tests.
1430.24 s
[pandoc-lua-engine] [ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
1430.24 s
[vector] map: OK
1430.24 s
[vector] +++ OK, passed 100 tests.
1430.24 s
[vector] imap: OK
1430.25 s
[vector] +++ OK, passed 100 tests.
1430.25 s
[vector] concatMap: OK (0.01s)
1430.25 s
[vector] +++ OK, passed 100 tests.
1430.25 s
[vector] mapM: OK
1430.25 s
[vector] +++ OK, passed 100 tests.
1430.29 s
[vector] mapM_: OK (0.04s)
1430.29 s
[vector] +++ OK, passed 100 tests.
1430.30 s
[vector] forM: OK
1430.30 s
[vector] +++ OK, passed 100 tests.
1430.35 s
[vector] forM_: OK (0.04s)
1430.51 s
[vector] +++ OK, passed 100 tests.
1430.51 s
[vector] imapM: OK
1430.51 s
[vector] +++ OK, passed 100 tests.
1430.51 s
[vector] imapM_: OK (0.04s)
1430.51 s
[vector] +++ OK, passed 100 tests.
1430.51 s
[vector] zipWith: OK
1430.51 s
[vector] +++ OK, passed 100 tests.
1430.51 s
[vector] zipWith3: OK (0.01s)
1430.51 s
[vector] +++ OK, passed 100 tests.
1430.51 s
[vector] izipWith: OK (0.01s)
1430.51 s
[vector] +++ OK, passed 100 tests.
1430.51 s
[vector] izipWith3: OK
1430.51 s
[vector] +++ OK, passed 100 tests.
1430.51 s
[vector] izipWithM: OK
1430.51 s
[vector] +++ OK, passed 100 tests.
1430.51 s
[vector] izipWithM_: OK (0.03s)
1430.51 s
[vector] +++ OK, passed 100 tests.
1430.51 s
[vector] zipWithM: OK
1430.51 s
[vector] +++ OK, passed 100 tests.
1430.53 s
[vector] zipWithM_: OK (0.05s)
1430.54 s
[vector] +++ OK, passed 100 tests.
1430.56 s
[vector] filter: OK
1430.56 s
[vector] +++ OK, passed 100 tests.
1430.56 s
[vector] ifilter: OK
1430.56 s
[vector] +++ OK, passed 100 tests.
1430.63 s
[vector] filterM: OK (0.09s)
1430.64 s
[vector] +++ OK, passed 100 tests.
1430.64 s
[vector] uniq: OK
1430.64 s
[vector] +++ OK, passed 100 tests.
1430.64 s
[vector] mapMaybe: OK
1430.65 s
[vector] +++ OK, passed 100 tests.
1430.65 s
[vector] imapMaybe: OK
1430.65 s
[vector] +++ OK, passed 100 tests.
1430.65 s
[vector] takeWhile: OK
1430.66 s
[vector] +++ OK, passed 100 tests.
1430.66 s
[vector] dropWhile: OK
1430.67 s
[vector] +++ OK, passed 100 tests.
1430.67 s
[vector] partition: OK
1430.67 s
[vector] +++ OK, passed 100 tests.
1430.67 s
[vector] partitionWith: OK
1430.67 s
[vector] +++ OK, passed 100 tests.
1430.68 s
[vector] span: OK
1430.68 s
[vector] +++ OK, passed 100 tests.
1430.68 s
[vector] break: OK
1430.68 s
[vector] +++ OK, passed 100 tests.
1430.68 s
[vector] spanR: OK
1430.68 s
[vector] +++ OK, passed 100 tests.
1430.68 s
[vector] breakR: OK
1430.69 s
[vector] +++ OK, passed 100 tests.
1430.69 s
[vector] groupBy: OK
1430.69 s
[vector] +++ OK, passed 100 tests.
1430.69 s
[vector] elem: OK
1430.70 s
[vector] +++ OK, passed 100 tests.
1430.70 s
[vector] notElem: OK
1430.70 s
[vector] +++ OK, passed 100 tests.
1430.70 s
[vector] find: OK
1430.70 s
[vector] +++ OK, passed 100 tests.
1430.70 s
[vector] findIndex: OK
1430.70 s
[vector] +++ OK, passed 100 tests.
1430.70 s
[vector] findIndexR: OK
1430.71 s
[vector] +++ OK, passed 100 tests.
1430.71 s
[vector] findIndices: OK
1430.71 s
[vector] +++ OK, passed 100 tests.
1430.71 s
[vector] elemIndex: OK
1430.71 s
[vector] +++ OK, passed 100 tests.
1430.72 s
[vector] elemIndices: OK
1430.72 s
[vector] +++ OK, passed 100 tests.
1430.72 s
[vector] foldl: OK
1430.72 s
[vector] +++ OK, passed 100 tests.
1430.74 s
[vector] foldl1: OK
1430.74 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1430.74 s
[vector] foldl': OK
1430.75 s
[vector] +++ OK, passed 100 tests.
1430.76 s
[vector] foldl1': OK
1430.76 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1430.76 s
[vector] foldr: OK
1430.76 s
[vector] +++ OK, passed 100 tests.
1430.77 s
[vector] foldr1: OK
1430.78 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1430.78 s
[vector] foldr': OK
1430.78 s
[vector] +++ OK, passed 100 tests.
1430.78 s
[vector] foldr1': OK
1430.79 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1430.81 s
[vector] ifoldl: OK
1430.81 s
[vector] +++ OK, passed 100 tests.
1430.82 s
[vector] ifoldl': OK (0.03s)
1430.82 s
[vector] +++ OK, passed 100 tests.
1430.84 s
[vector] ifoldr: OK (0.01s)
1430.84 s
[vector] +++ OK, passed 100 tests.
1430.84 s
[vector] ifoldr': OK (0.01s)
1430.84 s
[vector] +++ OK, passed 100 tests.
1430.86 s
[vector] ifoldM: OK (0.01s)
1430.86 s
[vector] +++ OK, passed 100 tests.
1430.88 s
[vector] ifoldM': OK (0.02s)
1430.88 s
[vector] +++ OK, passed 100 tests.
1430.96 s
[vector] ifoldM_: OK (0.08s)
1430.96 s
[vector] +++ OK, passed 100 tests.
1431.01 s
[vector] ifoldM'_: OK (0.06s)
1431.01 s
[vector] +++ OK, passed 100 tests.
1431.01 s
[vector] all: OK
1431.01 s
[vector] +++ OK, passed 100 tests.
1431.01 s
[vector] any: OK
1431.02 s
[vector] +++ OK, passed 100 tests.
1431.03 s
[vector] prescanl: OK (0.01s)
1431.03 s
[vector] +++ OK, passed 100 tests.
1431.04 s
[vector] prescanl': OK
1431.04 s
[vector] +++ OK, passed 100 tests.
1431.04 s
[vector] postscanl: OK
1431.05 s
[vector] +++ OK, passed 100 tests.
1431.06 s
[vector] postscanl': OK
1431.06 s
[vector] +++ OK, passed 100 tests.
1431.06 s
[vector] scanl: OK
1431.07 s
[vector] +++ OK, passed 100 tests.
1431.08 s
[vector] scanl': OK (0.01s)
1431.08 s
[vector] +++ OK, passed 100 tests.
1431.08 s
[vector] scanl1: OK (0.01s)
1431.08 s
[vector] +++ OK, passed 100 tests.
1431.10 s
[vector] scanl1': OK
1431.10 s
[vector] +++ OK, passed 100 tests.
1431.12 s
[vector] iscanl: OK (0.02s)
1431.12 s
[vector] +++ OK, passed 100 tests.
1431.14 s
[vector] iscanl': OK (0.02s)
1431.14 s
[vector] +++ OK, passed 100 tests.
1431.16 s
[vector] prescanr: OK (0.01s)
1431.16 s
[vector] +++ OK, passed 100 tests.
1431.17 s
[vector] prescanr': OK (0.01s)
1431.17 s
[vector] +++ OK, passed 100 tests.
1431.18 s
[vector] postscanr: OK (0.01s)
1431.18 s
[vector] +++ OK, passed 100 tests.
1431.19 s
[vector] postscanr': OK (0.01s)
1431.19 s
[vector] +++ OK, passed 100 tests.
1431.20 s
[vector] scanr: OK (0.01s)
1431.20 s
[vector] +++ OK, passed 100 tests.
1431.23 s
[vector] scanr': OK (0.01s)
1431.23 s
[vector] +++ OK, passed 100 tests.
1431.23 s
[vector] scanr1: OK (0.01s)
1431.23 s
[vector] +++ OK, passed 100 tests.
1431.24 s
[vector] scanr1': OK (0.01s)
1431.24 s
[vector] +++ OK, passed 100 tests.
1431.26 s
[vector] iscanr: OK (0.01s)
1431.26 s
[vector] +++ OK, passed 100 tests.
1431.26 s
[vector] iscanr': OK (0.01s)
1431.26 s
[vector] +++ OK, passed 100 tests.
1431.26 s
[vector] mut_read: OK
1431.26 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1431.26 s
[vector] mut_write: OK
1431.27 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1431.27 s
[vector] mut_modify: OK
1431.27 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1431.27 s
[vector] mut_generate: OK
1431.27 s
[vector] +++ OK, passed 100 tests.
1431.30 s
[vector] mut_generateM: OK (0.02s)
1431.30 s
[vector] +++ OK, passed 100 tests.
1431.34 s
[vector] mut_mapM_: OK (0.04s)
1431.34 s
[vector] +++ OK, passed 100 tests.
1431.38 s
[vector] mut_imapM_: OK (0.03s)
1431.38 s
[vector] +++ OK, passed 100 tests.
1431.42 s
[vector] mut_forM_: OK (0.05s)
1431.42 s
[vector] +++ OK, passed 100 tests.
1431.46 s
[vector] mut_iforM_: OK (0.04s)
1431.46 s
[vector] +++ OK, passed 100 tests.
1431.46 s
[vector] mut_foldr: OK
1431.46 s
[vector] +++ OK, passed 100 tests.
1431.47 s
[vector] mut_foldr': OK
1431.47 s
[vector] +++ OK, passed 100 tests.
1431.48 s
[vector] mut_foldl: OK
1431.48 s
[vector] +++ OK, passed 100 tests.
1431.49 s
[vector] mut_foldl': OK
1431.49 s
[vector] +++ OK, passed 100 tests.
1431.49 s
[vector] mut_ifoldr: OK
1431.49 s
[vector] +++ OK, passed 100 tests.
1431.50 s
[vector] mut_ifoldr': OK
1431.50 s
[vector] +++ OK, passed 100 tests.
1431.51 s
[vector] mut_ifoldl: OK
1431.51 s
[vector] +++ OK, passed 100 tests.
1431.51 s
[pandoc-lua-engine] [ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
1431.52 s
[pandoc-lua-engine] [ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
1431.52 s
[pandoc-lua-engine] [ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
1431.52 s
[pandoc-lua-engine] [ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
1431.52 s
[pandoc-lua-engine] [ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
1431.52 s
[pandoc-lua-engine] [ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
1431.52 s
[pandoc-lua-engine] [ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
1431.52 s
[pandoc-lua-engine] [ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
1431.52 s
[pandoc-lua-engine] [10 of 39] Compiling Text.Pandoc.Lua.PandocLua
1431.52 s
[vector] mut_ifoldl': OK
1431.52 s
[vector] +++ OK, passed 100 tests.
1431.52 s
[vector] mut_foldM: OK
1431.53 s
[vector] +++ OK, passed 100 tests.
1431.54 s
[vector] mut_foldM': OK
1431.54 s
[vector] +++ OK, passed 100 tests.
1431.54 s
[vector] mut_foldrM: OK
1431.54 s
[vector] +++ OK, passed 100 tests.
1431.54 s
[vector] mut_foldrM': OK
1431.54 s
[vector] +++ OK, passed 100 tests.
1431.54 s
[vector] mut_ifoldM: OK
1431.54 s
[vector] +++ OK, passed 100 tests.
1431.54 s
[vector] mut_ifoldM': OK
1431.54 s
[vector] +++ OK, passed 100 tests.
1431.55 s
[vector] mut_ifoldrM: OK
1431.55 s
[vector] +++ OK, passed 100 tests.
1431.55 s
[vector] mut_ifoldrM': OK
1431.55 s
[vector] +++ OK, passed 100 tests.
1431.56 s
[vector] compare: OK
1431.56 s
[vector] +++ OK, passed 100 tests.
1431.56 s
[vector] maximum: OK
1431.56 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1431.56 s
[vector] minimum: OK
1431.56 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1431.56 s
[vector] minIndex: OK
1431.56 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1431.56 s
[vector] maxIndex: OK
1431.56 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1431.57 s
[vector] maximumBy: OK
1431.57 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1431.57 s
[vector] minimumBy: OK
1431.57 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1431.57 s
[vector] maximumOn: OK
1431.57 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1431.57 s
[vector] minimumOn: OK
1431.57 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1431.58 s
[vector] maxIndexBy: OK
1431.58 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1431.58 s
[vector] minIndexBy: OK
1431.58 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1431.58 s
[vector] ListFirstMaxIndexWins: OK
1431.58 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1431.58 s
[vector] FalseListFirstMaxIndexWins: OK
1431.58 s
[vector] +++ OK, failed as expected. (after 1 test):
1431.58 s
[vector] Exception:
1431.58 s
[vector] Prelude.foldr1: empty list
1431.58 s
[vector] CallStack (from HasCallStack):
1431.58 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1431.58 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1431.58 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1431.58 s
[vector] []
1431.58 s
[vector] zip: OK
1431.58 s
[vector] +++ OK, passed 100 tests.
1431.58 s
[vector] zip3: OK
1431.58 s
[vector] +++ OK, passed 100 tests.
1431.58 s
[vector] unzip: OK
1431.58 s
[vector] +++ OK, passed 100 tests.
1431.59 s
[vector] unzip3: OK
1431.59 s
[vector] +++ OK, passed 100 tests.
1431.59 s
[vector] indexed: OK
1431.59 s
[vector] +++ OK, passed 100 tests.
1431.59 s
[vector] update: OK
1431.59 s
[vector] +++ OK, passed 100 tests.
1431.60 s
[vector] mempty: OK
1431.60 s
[vector] +++ OK, passed 100 tests.
1431.62 s
[vector] mappend: OK
1431.62 s
[vector] +++ OK, passed 100 tests.
1431.66 s
[vector] mconcat: OK (0.06s)
1431.66 s
[vector] +++ OK, passed 100 tests.
1431.66 s
[vector] glength: OK
1431.66 s
[vector] +++ OK, passed 100 tests.
1431.66 s
[vector] unstream
1431.66 s
[vector] unstream == vunstream (exact): OK
1431.66 s
[vector] +++ OK, passed 100 tests.
1431.66 s
[vector] unstream == vunstream (unknown): OK
1431.66 s
[vector] +++ OK, passed 100 tests.
1431.66 s
[vector] unstreamR ~= vunstream (exact): OK
1431.66 s
[vector] +++ OK, passed 100 tests.
1431.66 s
[vector] unstreamR ~= vunstream (unknown): OK
1431.66 s
[vector] +++ OK, passed 100 tests.
1431.66 s
[vector] Data.Vector.Storable.Vector Alignment
1431.66 s
[vector] Aligned Double: OK
1431.66 s
[vector] Aligned Int: OK
1431.66 s
[vector] Regression tests
1431.66 s
[vector] enumFromTo crash #188
1431.66 s
[vector] Word8: OK
1431.66 s
[vector] Word16: OK
1431.66 s
[vector] Word32: OK
1431.66 s
[vector] Word64: OK
1431.66 s
[vector] Word: OK
1431.66 s
[vector] Int8: OK
1431.66 s
[vector] Int16: OK
1431.66 s
[vector] Int32: OK
1431.66 s
[vector] Int64: OK
1431.66 s
[vector] Int: OK
1431.66 s
[vector] Char: OK
1431.66 s
[vector] Negative tests
1431.66 s
[vector] slice out of bounds #257
1431.66 s
[vector] Boxed
1431.66 s
[vector] Negative ix: OK
1431.66 s
[vector] Negative size: OK
1431.66 s
[vector] Negative ix and size: OK
1431.66 s
[vector] Too large ix: OK
1431.66 s
[vector] Too large size: OK
1431.66 s
[vector] Too large ix and size: OK
1431.66 s
[vector] Overflow: OK
1431.66 s
[vector] OutOfMemory: OK
1431.66 s
[vector] Primitive
1431.66 s
[vector] Negative ix: OK
1431.66 s
[vector] Negative size: OK
1431.66 s
[vector] Negative ix and size: OK
1431.66 s
[vector] Too large ix: OK
1431.66 s
[vector] Too large size: OK
1431.66 s
[vector] Too large ix and size: OK
1431.66 s
[vector] Overflow: OK
1431.66 s
[vector] OutOfMemory: OK
1431.66 s
[vector] Storable
1431.66 s
[vector] Negative ix: OK
1431.67 s
[vector] Negative size: OK
1431.67 s
[vector] Negative ix and size: OK
1431.67 s
[vector] Too large ix: OK
1431.67 s
[vector] Too large size: OK
1431.67 s
[vector] Too large ix and size: OK
1431.67 s
[vector] Overflow: OK
1431.67 s
[vector] OutOfMemory: OK
1431.69 s
[vector] Unboxed
1431.70 s
[vector] Negative ix: OK
1431.71 s
[vector] Negative size: OK
1431.71 s
[vector] Negative ix and size: OK
1431.71 s
[vector] Too large ix: OK
1431.71 s
[vector] Too large size: OK
1431.71 s
[vector] Too large ix and size: OK
1431.71 s
[vector] Overflow: OK
1431.71 s
[vector] OutOfMemory: OK
1431.71 s
[vector] take #282
1431.71 s
[vector] Boxed: OK
1431.71 s
[vector] Primitive: OK
1431.71 s
[vector] Storable: OK
1431.71 s
[vector] Unboxed: OK
1431.71 s
[vector] Data.Vector
1431.71 s
[vector] MonadFix: OK
1431.71 s
[vector] toFromArray: OK
1431.71 s
[vector] toFromArraySlice: OK
1431.71 s
[vector] toFromArraySliceUnsafe: OK
1431.71 s
[vector] toFromMutableArray: OK
1431.71 s
[vector] Data.Vector.Mutable (Move): OK
1431.71 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1431.71 s
[vector] Data.Vector.Primitive.Mutable (Move): OK
1431.71 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1431.71 s
[vector] Data.Vector.Unboxed.Mutable (Move): OK
1431.71 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1431.71 s
[vector] Data.Vector.Storable.Mutable (Move): OK
1431.71 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1431.71 s
[vector] Data.Vector.Generic.Mutable (nextPermutation): OK
1431.71 s
[vector] +++ OK, passed 100 tests.
1431.71 s
[vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.03s)
1431.71 s
[vector] +++ OK, passed 100 tests.
1431.71 s
[vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
1431.71 s
[vector] +++ OK, passed 100 tests.
1431.71 s
[vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
1431.71 s
[vector] +++ OK, passed 100 tests.
1431.71 s
[vector]
1431.71 s
[vector] All 2808 tests passed (15.81s)
1431.72 s
[vector] Test suite vector-tests-O2: PASS
1431.72 s
[vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
1431.72 s
[vector] 2 of 2 test suites (2 of 2 test cases) passed.
1431.73 s
[vector] checkPhase completed in 1 minutes 49 seconds
1431.73 s
[vector] Phase: haddockPhase
1431.74 s
[vector] Phase: installPhase
1431.85 s
[vector] Installing library in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
1431.94 s
[pandoc-lua-engine] [11 of 39] Compiling Text.Pandoc.Lua.Module.Types
1432.30 s
[pandoc-lua-engine] [12 of 39] Compiling Text.Pandoc.Lua.Module.Text
1432.48 s
[pandoc-lua-engine] [13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
1433.47 s
[pandoc-lua-engine] [14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
1433.47 s
[pandoc-lua-engine] [15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
1433.47 s
[pandoc-lua-engine] [16 of 39] Compiling Text.Pandoc.Lua.Module.Template
1433.57 s
[vector] Installing internal library benchmarks-O2 in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/vector-0.13.2.0-8ewGTjYPAbxD2TcU88MBz1-benchmarks-O2
1433.96 s
[pandoc-lua-engine] [17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
1433.96 s
[pandoc-lua-engine] [18 of 39] Compiling Text.Pandoc.Lua.Module.Format
1433.96 s
[pandoc-lua-engine] [19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
1434.14 s
[vector] Phase: fixupPhase
1434.19 s
[vector] shrinking RPATHs of ELF executables and libraries in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0
1434.19 s
[vector] shrinking /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSvector-0.13.2.0-F7uk3pysgNW73MNfNvohpp-ghc9.8.4.so
1434.45 s
[vector] shrinking /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSvector-0.13.2.0-8ewGTjYPAbxD2TcU88MBz1-benchmarks-O2-ghc9.8.4.so
1434.60 s
[vector] checking for references to /build/ in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0...
1434.65 s
[vector] patching script interpreter paths in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0
1434.66 s
[vector] stripping (with command strip and flags -S -p) in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib
1435.45 s
[pandoc-lua-engine] [20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
1436.04 s
[vector:post-build] Uploading to cachix cache "sellout": /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0
1436.58 s
[vector:post-build] Nothing to push - all store paths are already on Cachix.
1436.61 s
[vector:post-build] Uploading to the NixCI cache: /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0
1436.69 s
[vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1436.71 s
[vector:post-build] copying 1 paths...
1436.71 s
[vector:post-build] copying path '/nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
1460.36 s
[vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1460.46 s
[vector:post-build] copying 0 paths...
1460.49 s
Progress: 23 of 38 built (2 building), 559 of 559 downloaded from cache
1460.63 s
Building /nix/store/kpynsivk6619d2xvq96g6bqk5vmphbas-nothunks-0.3.1.drv
1460.63 s
[pandoc-lua-engine] [21 of 39] Compiling Text.Pandoc.Lua.Module.Image
1460.63 s
[pandoc-lua-engine] [22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
1460.63 s
[pandoc-lua-engine] [23 of 39] Compiling Text.Pandoc.Lua.Orphans
1460.63 s
[pandoc-lua-engine] [24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
1460.63 s
[pandoc-lua-engine] [25 of 39] Compiling Text.Pandoc.Lua.Global
1460.63 s
[pandoc-lua-engine] [26 of 39] Compiling Text.Pandoc.Lua.Filter
1460.63 s
[pandoc-lua-engine] [27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
1460.63 s
[pandoc-lua-engine] [28 of 39] Compiling Text.Pandoc.Lua.SourcePos
1460.63 s
[pandoc-lua-engine] [29 of 39] Compiling Text.Pandoc.Lua.Module.Log
1460.63 s
[pandoc-lua-engine] [30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
1460.63 s
[pandoc-lua-engine] [31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
1460.63 s
[pandoc-lua-engine] [32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
1460.63 s
[pandoc-lua-engine] [33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
1460.63 s
[pandoc-lua-engine] [34 of 39] Compiling Text.Pandoc.Lua.Module
1460.63 s
[pandoc-lua-engine] [35 of 39] Compiling Text.Pandoc.Lua.Init
1460.63 s
[pandoc-lua-engine] [36 of 39] Compiling Text.Pandoc.Lua.Run
1460.63 s
[pandoc-lua-engine] [37 of 39] Compiling Text.Pandoc.Lua.Custom
1460.63 s
[pandoc-lua-engine] [38 of 39] Compiling Text.Pandoc.Lua.Engine
1460.63 s
[pandoc-lua-engine] [39 of 39] Compiling Text.Pandoc.Lua
1460.63 s
[pandoc-lua-engine] Preprocessing test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
1460.63 s
[pandoc-lua-engine] Building test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
1460.63 s
[pandoc-lua-engine] [1 of 5] Compiling Tests.Lua
1460.63 s
[pandoc-lua-engine] [2 of 5] Compiling Tests.Lua.Module
1460.63 s
[pandoc-lua-engine] [3 of 5] Compiling Tests.Lua.Reader
1460.63 s
[pandoc-lua-engine] [4 of 5] Compiling Tests.Lua.Writer
1460.63 s
[pandoc-lua-engine] [5 of 5] Compiling Main
1460.63 s
[pandoc-lua-engine] [6 of 6] Linking dist/build/test-pandoc-lua-engine/test-pandoc-lua-engine
1460.63 s
[pandoc-server] Phase: checkPhase
1460.63 s
[pandoc-server] Package has no test suites.
1460.63 s
[pandoc-server] Phase: haddockPhase
1460.63 s
[pandoc-server] Preprocessing library for pandoc-server-0.1.0.11...
1460.63 s
[pandoc-server] Running Haddock on library for pandoc-server-0.1.0.11...
1460.63 s
[pandoc-server] Warning: The documentation for the following packages are not installed. No
1460.63 s
[pandoc-server] links will be generated to these packages: attoparsec-0.14.4,
1460.63 s
[pandoc-server] attoparsec-0.14.4, libyaml-clib-0.2.5, pandoc-3.7.0.2, pandoc-3.7.0.2,
1460.63 s
[pandoc-server] vector-0.13.2.0
1460.63 s
[pandoc-server] [1 of 1] Compiling Text.Pandoc.Server
1460.63 s
[pandoc-server] Haddock coverage:
1460.63 s
[pandoc-server] 0% ( 0 / 7) in 'Text.Pandoc.Server'
1460.63 s
[pandoc-server] Missing documentation for:
1460.63 s
[pandoc-server] Module header
1460.63 s
[pandoc-server] app (src/Text/Pandoc/Server.hs:200)
1460.63 s
[pandoc-server] API (src/Text/Pandoc/Server.hs:186)
1460.63 s
[pandoc-server] ServerOpts (src/Text/Pandoc/Server.hs:55)
1460.63 s
[pandoc-server] Params (src/Text/Pandoc/Server.hs:125)
1460.63 s
[pandoc-server] Blob (src/Text/Pandoc/Server.hs:112)
1460.63 s
[pandoc-server] parseServerOptsFromArgs (src/Text/Pandoc/Server.hs:99)
1460.63 s
[pandoc-server] Warning: Text.Pandoc.Server: could not find link destinations for:
1460.63 s
[pandoc-server] - Text.Pandoc.App.Opt.Opt
1460.63 s
[pandoc-server] - Text.Pandoc.Server.Output
1460.85 s
[nothunks] Phase: setupCompilerEnvironmentPhase
1460.86 s
[nothunks] Build with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
1461.17 s
[nothunks] Phase: unpackPhase
1461.17 s
[nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
1461.18 s
[nothunks] source root is nothunks-0.3.1
1461.19 s
[nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
1461.20 s
[nothunks] Phase: patchPhase
1461.20 s
[nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
1461.21 s
[nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
1461.23 s
[nothunks] Phase: compileBuildDriverPhase
1461.24 s
[nothunks] setupCompileFlags: -package-db=/build/tmp.35XporISMq/setup-package.conf.d -threaded
1461.31 s
[nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.35XporISMq/Main.o )
1461.43 s
[nothunks] [2 of 2] Linking Setup
1463.19 s
[nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
1463.21 s
[nothunks] Phase: configurePhase
1463.22 s
[nothunks] configureFlags: --verbose --prefix=/nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.35XporISMq/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
1463.23 s
[nothunks] Using Parsec parser
1463.23 s
[nothunks] Configuring nothunks-0.3.1...
1463.78 s
[nothunks] Flags chosen: bytestring=True, text=True, vector=True
1463.78 s
[nothunks] Dependency base: using base-4.19.2.0
1463.78 s
[nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.1.0
1463.78 s
[nothunks] Dependency containers: using containers-0.6.8
1463.78 s
[nothunks] Dependency ghc-heap: using ghc-heap-9.8.4
1463.78 s
[nothunks] Dependency stm: using stm-2.5.3.1
1463.78 s
[nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.1
1463.78 s
[nothunks] Dependency time: using time-1.12.2
1463.78 s
[nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
1463.78 s
[nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
1463.78 s
[nothunks] Dependency base: using base-4.19.2.0
1463.78 s
[nothunks] Dependency containers: using containers-0.6.8
1463.78 s
[nothunks] Dependency ghc-prim: using ghc-prim-0.11.0
1463.78 s
[nothunks] Dependency hedgehog: using hedgehog-1.5
1463.78 s
[nothunks] Dependency nothunks: using nothunks-0.3.1
1463.78 s
[nothunks] Dependency random: using random-1.2.1.3
1463.78 s
[nothunks] Dependency stm: using stm-2.5.3.1
1463.78 s
[nothunks] Dependency tasty: using tasty-1.5.3
1463.78 s
[nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
1464.62 s
[nothunks] Source component graph:
1464.62 s
[nothunks] component lib
1464.62 s
[nothunks] component test:nothunks-test dependency lib
1464.62 s
[nothunks] Configured component graph:
1464.62 s
[nothunks] component nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
1464.62 s
[nothunks] include base-4.19.2.0-8274
1464.62 s
[nothunks] include bytestring-0.12.1.0-b028
1464.62 s
[nothunks] include containers-0.6.8-15d9
1464.62 s
[nothunks] include ghc-heap-9.8.4-88b3
1464.62 s
[nothunks] include stm-2.5.3.1-4dae
1464.63 s
[nothunks] include text-2.1.1-5314
1464.63 s
[nothunks] include time-1.12.2-b11c
1464.63 s
[nothunks] include vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
1464.63 s
[nothunks] include wherefrom-compat-0.1.1.1-B8a6B2BvUCzGz8OFtoo8AO
1464.63 s
[nothunks] component nothunks-0.3.1-8INgIczvs3nGsVHBs6bUjZ-nothunks-test
1464.63 s
[nothunks] include base-4.19.2.0-8274
1464.63 s
[nothunks] include containers-0.6.8-15d9
1464.63 s
[nothunks] include ghc-prim-0.11.0-01ae
1464.63 s
[nothunks] include hedgehog-1.5-EdloAR8nvuADWiK72c4fzc
1464.63 s
[nothunks] include nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
1464.63 s
[nothunks] include random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
1464.63 s
[nothunks] include stm-2.5.3.1-4dae
1464.63 s
[nothunks] include tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
1464.63 s
[nothunks] include tasty-hedgehog-1.4.0.2-4SLwErL9Pq6G86T5KSGqTH
1464.63 s
[nothunks] Linked component graph:
1464.63 s
[nothunks] unit nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
1464.63 s
[nothunks] include base-4.19.2.0-8274
1464.63 s
[nothunks] include bytestring-0.12.1.0-b028
1464.63 s
[nothunks] include containers-0.6.8-15d9
1464.63 s
[nothunks] include ghc-heap-9.8.4-88b3
1464.63 s
[nothunks] include stm-2.5.3.1-4dae
1464.63 s
[nothunks] include text-2.1.1-5314
1464.63 s
[nothunks] include time-1.12.2-b11c
1464.63 s
[nothunks] include vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
1464.63 s
[nothunks] include wherefrom-compat-0.1.1.1-B8a6B2BvUCzGz8OFtoo8AO
1464.63 s
[nothunks] NoThunks.Class=nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So:NoThunks.Class
1464.63 s
[nothunks] unit nothunks-0.3.1-8INgIczvs3nGsVHBs6bUjZ-nothunks-test
1464.63 s
[nothunks] include base-4.19.2.0-8274
1464.63 s
[nothunks] include containers-0.6.8-15d9
1464.63 s
[nothunks] include ghc-prim-0.11.0-01ae
1464.63 s
[nothunks] include hedgehog-1.5-EdloAR8nvuADWiK72c4fzc
1464.63 s
[nothunks] include nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
1464.63 s
[nothunks] include random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
1464.63 s
[nothunks] include stm-2.5.3.1-4dae
1464.63 s
[nothunks] include tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
1464.63 s
[nothunks] include tasty-hedgehog-1.4.0.2-4SLwErL9Pq6G86T5KSGqTH
1464.63 s
[nothunks] Ready component graph:
1464.63 s
[nothunks] definite nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
1464.63 s
[nothunks] depends base-4.19.2.0-8274
1464.63 s
[nothunks] depends bytestring-0.12.1.0-b028
1464.63 s
[nothunks] depends containers-0.6.8-15d9
1464.63 s
[nothunks] depends ghc-heap-9.8.4-88b3
1464.63 s
[nothunks] depends stm-2.5.3.1-4dae
1464.63 s
[nothunks] depends text-2.1.1-5314
1464.63 s
[nothunks] depends time-1.12.2-b11c
1464.63 s
[nothunks] depends vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
1464.63 s
[nothunks] depends wherefrom-compat-0.1.1.1-B8a6B2BvUCzGz8OFtoo8AO
1464.63 s
[nothunks] definite nothunks-0.3.1-8INgIczvs3nGsVHBs6bUjZ-nothunks-test
1464.63 s
[nothunks] depends base-4.19.2.0-8274
1464.63 s
[nothunks] depends containers-0.6.8-15d9
1464.63 s
[nothunks] depends ghc-prim-0.11.0-01ae
1464.63 s
[nothunks] depends hedgehog-1.5-EdloAR8nvuADWiK72c4fzc
1464.63 s
[nothunks] depends nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
1464.63 s
[nothunks] depends random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
1464.63 s
[nothunks] depends stm-2.5.3.1-4dae
1464.63 s
[nothunks] depends tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
1464.63 s
[nothunks] depends tasty-hedgehog-1.4.0.2-4SLwErL9Pq6G86T5KSGqTH
1464.63 s
[nothunks] Using Cabal-3.10.3.0 compiled by ghc-9.8
1464.63 s
[nothunks] Using compiler: ghc-9.8.4
1464.63 s
[nothunks] Using install prefix:
1464.63 s
[nothunks] /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1
1464.63 s
[nothunks] Executables installed in:
1464.63 s
[nothunks] /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/bin
1464.63 s
[nothunks] Libraries installed in:
1464.63 s
[nothunks] /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
1464.63 s
[nothunks] Dynamic Libraries installed in:
1464.63 s
[nothunks] /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
1464.63 s
[nothunks] Private executables installed in:
1464.63 s
[nothunks] /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.8.4/nothunks-0.3.1
1464.63 s
[nothunks] Data files installed in:
1464.63 s
[nothunks] /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/share/x86_64-linux-ghc-9.8.4/nothunks-0.3.1
1464.63 s
[nothunks] Documentation installed in:
1464.63 s
[nothunks] /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
1464.63 s
[nothunks] Configuration files installed in:
1464.63 s
[nothunks] /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/etc
1464.63 s
[nothunks] No alex found
1464.63 s
[nothunks] Using ar found on system at:
1464.63 s
[nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
1464.63 s
[nothunks] No c2hs found
1464.63 s
[nothunks] No cpphs found
1464.63 s
[nothunks] No doctest found
1464.63 s
[nothunks] Using gcc version 14.3.0 given by user at:
1464.63 s
[nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
1464.63 s
[nothunks] Using ghc version 9.8.4 found on system at:
1464.63 s
[nothunks] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
1464.63 s
[nothunks] Using ghc-pkg version 9.8.4 found on system at:
1464.63 s
[nothunks] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
1464.63 s
[nothunks] No ghcjs found
1464.63 s
[nothunks] No ghcjs-pkg found
1464.63 s
[nothunks] No greencard found
1464.63 s
[nothunks] Using haddock version 2.30.0 found on system at:
1464.63 s
[nothunks] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
1464.63 s
[nothunks] No happy found
1464.63 s
[nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
1464.63 s
[nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1464.63 s
[nothunks] No hmake found
1464.63 s
[nothunks] Using hpc version 0.69 found on system at:
1464.63 s
[nothunks] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
1464.63 s
[nothunks] Using hsc2hs version 0.68.10 found on system at:
1464.63 s
[nothunks] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
1464.63 s
[nothunks] Using hscolour version 1.25 found on system at:
1464.63 s
[nothunks] /nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
1464.63 s
[nothunks] No jhc found
1464.63 s
[nothunks] Using ld found on system at:
1464.63 s
[nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
1464.63 s
[nothunks] No pkg-config found
1464.63 s
[nothunks] Using runghc version 9.8.4 found on system at:
1464.63 s
[nothunks] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
1464.63 s
[nothunks] Using strip version 2.44 found on system at:
1464.63 s
[nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
1464.63 s
[nothunks] Using tar found on system at:
1464.63 s
[nothunks] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
1464.63 s
[nothunks] No uhc found
1465.30 s
[nothunks] Phase: buildPhase
1465.38 s
[nothunks] Preprocessing library for nothunks-0.3.1..
1465.38 s
[nothunks] Building library for nothunks-0.3.1..
1465.49 s
[nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
1466.51 s
[pandoc-server] Documentation created: dist/doc/html/pandoc-server/,
1466.55 s
[pandoc-server] dist/doc/html/pandoc-server/pandoc-server.txt
1466.60 s
[pandoc-server] Phase: installPhase
1466.83 s
[pandoc-server] Installing library in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
1467.34 s
[pandoc-server] Phase: fixupPhase
1467.36 s
[pandoc-server] shrinking RPATHs of ELF executables and libraries in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
1467.37 s
[pandoc-server] shrinking /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSpandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM-ghc9.10.3.so
1467.56 s
[pandoc-server] checking for references to /build/ in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11...
1467.59 s
[pandoc-server] patching script interpreter paths in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
1467.59 s
[pandoc-server] stripping (with command strip and flags -S -p) in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib
1467.90 s
[pandoc-server] shrinking RPATHs of ELF executables and libraries in /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc
1467.90 s
[pandoc-server] checking for references to /build/ in /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc...
1467.92 s
[pandoc-server] patching script interpreter paths in /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc
1468.16 s
[pandoc-server:post-build] Uploading to cachix cache "sellout": /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
1468.61 s
[pandoc-server:post-build] Nothing to push - all store paths are already on Cachix.
1468.64 s
[pandoc-server:post-build] Uploading to the NixCI cache: /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
1468.70 s
[pandoc-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1468.77 s
[pandoc-server:post-build] copying 1 paths...
1468.78 s
[pandoc-server:post-build] copying path '/nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11' to 'https://cache.nix-ci.com'...
1469.73 s
[pandoc-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1469.85 s
[pandoc-server:post-build] copying 0 paths...
1469.87 s
Progress: 24 of 38 built (2 building), 559 of 559 downloaded from cache
1469.88 s
[nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
1469.88 s
[pandoc-lua-engine] buildPhase completed in 47 seconds
1469.88 s
[pandoc-lua-engine] Phase: checkPhase
1469.88 s
[pandoc-lua-engine] Running 1 test suites...
1469.88 s
[pandoc-lua-engine] Test suite test-pandoc-lua-engine: RUNNING...
1469.88 s
[pandoc-lua-engine] pandoc Lua engine
1469.88 s
[pandoc-lua-engine] Lua filters
1469.88 s
[pandoc-lua-engine] macro expansion via filter: OK (0.01s)
1469.88 s
[pandoc-lua-engine] convert all plains to paras: OK
1469.88 s
[pandoc-lua-engine] convert display math to inline math: OK (0.03s)
1469.88 s
[pandoc-lua-engine] make hello world document: OK
1469.88 s
[pandoc-lua-engine] implicit doc filter: OK
1469.88 s
[pandoc-lua-engine] parse raw markdown blocks: OK
1469.88 s
[pandoc-lua-engine] allow shorthand functions for quote types: OK
1469.88 s
[pandoc-lua-engine] Count inlines via metatable catch-all: OK
1469.88 s
[pandoc-lua-engine] Count blocks via Block-specific catch-all: OK
1469.88 s
[pandoc-lua-engine] Smart constructors: OK
1469.88 s
[pandoc-lua-engine] Convert header upper case: OK
1469.88 s
[pandoc-lua-engine] Attribute lists are convenient to use: OK
1469.88 s
[pandoc-lua-engine] Filter list of inlines: OK
1469.88 s
[pandoc-lua-engine] Filter list of blocks: OK
1469.88 s
[pandoc-lua-engine] Filter Meta: OK
1469.88 s
[pandoc-lua-engine] Script filename is set: OK
1469.88 s
[pandoc-lua-engine] Pandoc version is set: OK
1469.88 s
[pandoc-lua-engine] Pandoc types version is set: OK
1469.88 s
[pandoc-lua-engine] require file: OK
1469.88 s
[pandoc-lua-engine] Allow singleton inline in constructors: OK
1469.88 s
[pandoc-lua-engine] Elements with Attr have `attr` accessor: OK
1469.88 s
[pandoc-lua-engine] module `pandoc.system` is present: OK
1469.88 s
[pandoc-lua-engine] global modules
1469.88 s
[pandoc-lua-engine] module 'lpeg' is loaded into a global: OK
1469.88 s
[pandoc-lua-engine] module 're' is loaded into a global: OK
1469.88 s
[pandoc-lua-engine] module 'lpeg' is available via `require`: OK
1469.88 s
[pandoc-lua-engine] module 're' is available via `require`: OK
1469.88 s
[pandoc-lua-engine] informative error messages: OK
1469.88 s
[pandoc-lua-engine] Lua modules
1469.88 s
[pandoc-lua-engine] pandoc: OK (0.02s)
1469.88 s
[pandoc-lua-engine] +++ Success: 79 Lua tests passed
1469.88 s
[pandoc-lua-engine] pandoc.List: OK
1469.88 s
[pandoc-lua-engine] +++ Success: 22 Lua tests passed
1469.88 s
[pandoc-lua-engine] pandoc.format: OK
1469.88 s
[pandoc-lua-engine] +++ Success: 3 Lua tests passed
1469.88 s
[pandoc-lua-engine] pandoc.image: OK
1469.88 s
[pandoc-lua-engine] +++ Success: 6 Lua tests passed
1469.88 s
[pandoc-lua-engine] pandoc.json: OK
1469.88 s
[pandoc-lua-engine] +++ Success: 21 Lua tests passed
1469.88 s
[pandoc-lua-engine] pandoc.log: OK
1469.88 s
[pandoc-lua-engine] +++ Success: 8 Lua tests passed
1469.88 s
[pandoc-lua-engine] pandoc.mediabag: OK
1469.88 s
[pandoc-lua-engine] +++ Success: 9 Lua tests passed
1469.88 s
[pandoc-lua-engine] pandoc.path: OK
1469.88 s
[pandoc-lua-engine] +++ Success: 5 Lua tests passed
1469.88 s
[pandoc-lua-engine] pandoc.structure: OK
1469.88 s
[pandoc-lua-engine] +++ Success: 11 Lua tests passed
1469.88 s
[pandoc-lua-engine] pandoc.template: OK (0.03s)
1469.88 s
[pandoc-lua-engine] +++ Success: 16 Lua tests passed
1469.88 s
[pandoc-lua-engine] pandoc.text: OK
1469.88 s
[pandoc-lua-engine] +++ Success: 9 Lua tests passed
1469.88 s
[pandoc-lua-engine] pandoc.types: OK
1469.88 s
[pandoc-lua-engine] +++ Success: 13 Lua tests passed
1469.88 s
[pandoc-lua-engine] pandoc.utils: OK
1469.88 s
[pandoc-lua-engine] +++ Success: 45 Lua tests passed
1469.88 s
[pandoc-lua-engine] globals: OK (0.02s)
1469.88 s
[pandoc-lua-engine] +++ Success: 42 Lua tests passed
1469.88 s
[pandoc-lua-engine] Custom writers
1469.88 s
[pandoc-lua-engine] default testsuite: OK (0.08s)
1469.88 s
[pandoc-lua-engine] tables testsuite: OK (0.04s)
1469.88 s
[pandoc-lua-engine] bytestring writer: OK
1469.88 s
[pandoc-lua-engine] template: OK
1469.88 s
[pandoc-lua-engine] preset extensions: OK
1469.88 s
[pandoc-lua-engine] modified extensions: OK
1469.88 s
[pandoc-lua-engine] Custom readers
1469.88 s
[pandoc-lua-engine] read binary to code block: OK
1469.88 s
[pandoc-lua-engine]
1469.88 s
[pandoc-lua-engine] All 48 tests passed (0.37s)
1469.88 s
[pandoc-lua-engine] Test suite test-pandoc-lua-engine: PASS
1469.88 s
[pandoc-lua-engine] Test suite logged to:
1469.88 s
[pandoc-lua-engine] dist/test/pandoc-lua-engine-0.4.3-test-pandoc-lua-engine.log
1469.88 s
[pandoc-lua-engine] 1 of 1 test suites (1 of 1 test cases) passed.
1469.88 s
[pandoc-lua-engine] Phase: haddockPhase
1469.88 s
[pandoc-lua-engine] Preprocessing library for pandoc-lua-engine-0.4.3...
1469.88 s
[pandoc-lua-engine] Running Haddock on library for pandoc-lua-engine-0.4.3...
1469.88 s
[pandoc-lua-engine] Warning: The documentation for the following packages are not installed. No
1469.88 s
[pandoc-lua-engine] links will be generated to these packages: attoparsec-0.14.4,
1469.88 s
[pandoc-lua-engine] attoparsec-0.14.4, libyaml-clib-0.2.5, pandoc-3.7.0.2, pandoc-3.7.0.2,
1469.88 s
[pandoc-lua-engine] vector-0.13.2.0
1470.03 s
[pandoc-lua-engine] [ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
1470.55 s
[pandoc-lua-engine] [ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
1470.61 s
[pandoc-lua-engine] [ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
1471.09 s
[pandoc-lua-engine] [ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
1471.14 s
[pandoc-lua-engine] [ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
1471.16 s
[pandoc-lua-engine] [ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
1471.18 s
[pandoc-lua-engine] [ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
1471.48 s
[pandoc-lua-engine] [ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
1471.78 s
[pandoc-lua-engine] [ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
1471.83 s
[pandoc-lua-engine] [10 of 39] Compiling Text.Pandoc.Lua.PandocLua
1471.99 s
[pandoc-lua-engine] [11 of 39] Compiling Text.Pandoc.Lua.Module.Types
1472.00 s
[pandoc-lua-engine] [12 of 39] Compiling Text.Pandoc.Lua.Module.Text
1472.01 s
[pandoc-lua-engine] [13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
1472.09 s
[pandoc-lua-engine] [14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
1472.20 s
[pandoc-lua-engine] [15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
1472.22 s
[pandoc-lua-engine] [16 of 39] Compiling Text.Pandoc.Lua.Module.Template
1472.27 s
[pandoc-lua-engine] [17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
1472.33 s
[pandoc-lua-engine] [18 of 39] Compiling Text.Pandoc.Lua.Module.Format
1472.34 s
[pandoc-lua-engine] [19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
1472.44 s
[pandoc-lua-engine] [20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
1472.51 s
[pandoc-lua-engine] [21 of 39] Compiling Text.Pandoc.Lua.Module.Image
1472.55 s
[pandoc-lua-engine] [22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
1472.59 s
[pandoc-lua-engine] [23 of 39] Compiling Text.Pandoc.Lua.Orphans
1472.62 s
[pandoc-lua-engine] [24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
1472.71 s
[pandoc-lua-engine] [25 of 39] Compiling Text.Pandoc.Lua.Global
1472.72 s
[pandoc-lua-engine] [26 of 39] Compiling Text.Pandoc.Lua.Filter
1472.74 s
[pandoc-lua-engine] [27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
1472.88 s
[pandoc-lua-engine] [28 of 39] Compiling Text.Pandoc.Lua.SourcePos
1472.89 s
[pandoc-lua-engine] [29 of 39] Compiling Text.Pandoc.Lua.Module.Log
1472.91 s
[pandoc-lua-engine] [30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
1473.33 s
[pandoc-lua-engine] [31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
1473.49 s
[pandoc-lua-engine] [32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
1473.66 s
[pandoc-lua-engine] [33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
1473.67 s
[pandoc-lua-engine] [34 of 39] Compiling Text.Pandoc.Lua.Module
1473.72 s
[pandoc-lua-engine] [35 of 39] Compiling Text.Pandoc.Lua.Init
1473.74 s
[pandoc-lua-engine] [36 of 39] Compiling Text.Pandoc.Lua.Run
1473.87 s
[pandoc-lua-engine] [37 of 39] Compiling Text.Pandoc.Lua.Custom
1473.93 s
[pandoc-lua-engine] [38 of 39] Compiling Text.Pandoc.Lua.Engine
1473.95 s
[pandoc-lua-engine] [39 of 39] Compiling Text.Pandoc.Lua
1473.96 s
[pandoc-lua-engine] Haddock coverage:
1473.96 s
[pandoc-lua-engine] Warning: 'Chunk' is ambiguous. It is defined
1473.96 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
1473.96 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
1473.96 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1473.96 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1473.96 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Chunks’
1473.96 s
[pandoc-lua-engine] Warning: 'ChunkedDoc' is ambiguous. It is defined
1473.96 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
1473.96 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
1473.96 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1473.96 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1473.96 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Chunks’
1473.96 s
[pandoc-lua-engine] Warning: 'Reference' is ambiguous. It is defined
1473.96 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1473.96 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1473.96 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1473.97 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1473.97 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
1473.97 s
[pandoc-lua-engine] Warning: 'ItemId' is ambiguous. It is defined
1473.97 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1473.97 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1473.97 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1473.97 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1473.97 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
1473.97 s
[pandoc-lua-engine] Warning: 'Name' is ambiguous. It is defined
1473.97 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1473.97 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1473.97 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1473.97 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1473.97 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
1473.97 s
[pandoc-lua-engine] Warning: 'Date' is ambiguous. It is defined
1473.97 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1473.97 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1473.97 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1473.97 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1473.97 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
1473.97 s
[pandoc-lua-engine] Warning: 'Sources' is ambiguous. It is defined
1473.97 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Sources’
1473.97 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Sources’
1473.97 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1473.97 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1473.97 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Sources’
1473.97 s
[pandoc-lua-engine] Warning: 'Lua' is ambiguous. It is defined
1473.97 s
[pandoc-lua-engine] * in ‘HsLua.Core.Error’
1473.97 s
[pandoc-lua-engine] * in ‘HsLua.Core.Types’
1473.97 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1473.98 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1473.98 s
[pandoc-lua-engine] Defaulting to the one defined in ‘HsLua.Core.Error’
1473.98 s
[pandoc-lua-engine] Warning: 'PandocLua' is ambiguous. It is defined
1473.98 s
[pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:23
1473.98 s
[pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:1
1473.98 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1473.98 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1473.98 s
[pandoc-lua-engine] Defaulting to the one defined at src/Text/Pandoc/Lua/PandocLua.hs:36:1
1473.98 s
[pandoc-lua-engine] Warning: 'ExtensionConfig' is out of scope.
1473.98 s
[pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
1473.98 s
[pandoc-lua-engine] Warning: 'ExtensionsConfig' is ambiguous. It is defined
1473.98 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Format’
1473.98 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Format’
1473.98 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1473.98 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1473.98 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Format’
1473.98 s
[pandoc-lua-engine] Warning: 'enable' is out of scope.
1473.98 s
[pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
1473.98 s
[pandoc-lua-engine] Warning: 'disable' is out of scope.
1473.98 s
[pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
1473.98 s
[pandoc-lua-engine] Warning: 'WriterOptions' is ambiguous. It is defined
1473.98 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Options’
1473.98 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Options’
1473.98 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1473.98 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1473.98 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Options’
1473.98 s
[pandoc-lua-engine] Warning: 'Pandoc' is ambiguous. It is defined
1473.98 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Definition’
1473.98 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Definition’
1473.98 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1473.98 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1473.98 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Definition’
1473.98 s
[pandoc-lua-engine] Warning: 'Chunk' is out of scope.
1473.98 s
[pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
1473.98 s
[pandoc-lua-engine] Warning: 'ReaderOptions' is ambiguous. It is defined
1473.98 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Options’
1473.98 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Options’
1473.98 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1473.98 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1473.98 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Options’
1473.98 s
[pandoc-lua-engine] Warning: 'read' is out of scope.
1473.98 s
[pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
1473.99 s
[pandoc-lua-engine] Warning: 'PandocLua' is ambiguous. It is defined
1473.99 s
[pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:23
1473.99 s
[pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:1
1473.99 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1473.99 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1473.99 s
[pandoc-lua-engine] Defaulting to the one defined at src/Text/Pandoc/Lua/PandocLua.hs:36:1
1473.99 s
[pandoc-lua-engine] 100% ( 11 / 11) in 'Text.Pandoc.Lua'
1474.01 s
[nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
1474.01 s
[nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1..
1474.16 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 )
1475.99 s
[pandoc-lua-engine] Warning: Text.Pandoc.Lua: could not find link destinations for:
1475.99 s
[pandoc-lua-engine] - Text.Pandoc.Options.WriterOptions
1475.99 s
[pandoc-lua-engine] - Text.Pandoc.Error.PandocError
1475.99 s
[pandoc-lua-engine] - Text.Pandoc.Options.ReaderOptions
1475.99 s
[pandoc-lua-engine] - Text.Pandoc.Class.CommonState.CommonState
1475.99 s
[pandoc-lua-engine] - Text.Pandoc.Class.PandocMonad.PandocMonad
1475.99 s
[pandoc-lua-engine] - Text.Pandoc.Scripting.ScriptingEngine
1475.99 s
[pandoc-lua-engine] - Text.Pandoc.Filter.Environment.Environment
1475.99 s
[pandoc-lua-engine] - Text.Pandoc.Scripting.CustomComponents
1477.53 s
[nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
1477.95 s
[nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
1479.32 s
[nothunks] Phase: checkPhase
1479.41 s
[nothunks] Running 1 test suites...
1479.41 s
[nothunks] Test suite nothunks-test: RUNNING...
1479.41 s
[nothunks] Tests
1479.41 s
[nothunks] NoThunks.Class
1479.41 s
[nothunks] Sanity
1479.41 s
[nothunks] IntNotNF: OK
1479.41 s
[nothunks] ✓ <interactive> passed 1 test.
1479.41 s
[nothunks] IntIsNF: OK
1479.41 s
[nothunks] ✓ <interactive> passed 1 test.
1479.41 s
[nothunks] Pair: OK
1479.41 s
[nothunks] ✓ <interactive> passed 1 test.
1479.41 s
[nothunks] Sum: OK
1479.41 s
[nothunks] ✓ <interactive> passed 1 test.
1479.41 s
[nothunks] Fn: OK
1479.41 s
[nothunks] ✓ <interactive> passed 1 test.
1479.42 s
[nothunks] IO: OK
1479.42 s
[nothunks] ✓ <interactive> passed 1 test.
1479.42 s
[nothunks] InspectHeap
1479.44 s
[nothunks] Int: OK (0.02s)
1479.44 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.44 s
[nothunks] Just ["Int"] 50% ██████████··········
1479.44 s
[nothunks] Nothing 50% █████████▉··········
1479.46 s
[nothunks] IntInt: OK (0.02s)
1479.46 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.46 s
[nothunks] Just ["Int","Tuple2"] 35% ███████·············
1479.46 s
[nothunks] Just ["Tuple2"] 53% ██████████▌·········
1479.46 s
[nothunks] Nothing 12% ██▍·················
1479.48 s
[nothunks] SumInt: OK (0.02s)
1479.48 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.48 s
[nothunks] Just ["Either"] 34% ██████▊·············
1479.48 s
[nothunks] Just ["Int","Either"] 35% ██████▉·············
1479.48 s
[nothunks] Nothing 31% ██████▎·············
1479.50 s
[nothunks] ListInt: OK (0.02s)
1479.50 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.50 s
[nothunks] Just ["Int","List"] 22% ████▍···············
1479.50 s
[nothunks] Just ["List"] 44% ████████▉···········
1479.50 s
[nothunks] Nothing 33% ██████▌·············
1479.53 s
[nothunks] IntListInt: OK (0.03s)
1479.53 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.53 s
[nothunks] Just ["Int","List","Tuple2"] 4% ▊···················
1479.53 s
[nothunks] Just ["Int","Tuple2"] 26% █████▏··············
1479.53 s
[nothunks] Just ["List","Tuple2"] 12% ██▎·················
1479.53 s
[nothunks] Just ["Tuple2"] 50% ██████████··········
1479.53 s
[nothunks] Nothing 8% █▋··················
1479.56 s
[nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
1479.56 s
[nothunks] after 13 tests and 1 shrink.
1479.56 s
[nothunks] shrink path: 13:c
1479.56 s
[nothunks] Just ["Int","Seq"] 23% ████▌···············
1479.56 s
[nothunks] Nothing 69% █████████████▊······
1479.56 s
[nothunks]
1479.56 s
[nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
1479.56 s
[nothunks] 166 ┃ testWithModel :: forall a. FromModel a
1479.56 s
[nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
1479.56 s
[nothunks] 168 ┃ -> Proxy a
1479.56 s
[nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
1479.56 s
[nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
1479.56 s
[nothunks] 171 ┃ -- context we will get from the model will be too detailed.
1479.56 s
[nothunks] 172 ┃ -> Property
1479.56 s
[nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
1479.56 s
[nothunks] 174 ┃ m :: Model a <- forAll genModel
1479.56 s
[nothunks] ┃ │ Wrap
1479.56 s
[nothunks] ┃ │ { unwrap =
1479.56 s
[nothunks] ┃ │ SeqEnqueue
1479.56 s
[nothunks] ┃ │ (IntValue 0)
1479.56 s
[nothunks] ┃ │ (SeqEnqueue
1479.56 s
[nothunks] ┃ │ (IntValue 0)
1479.56 s
[nothunks] ┃ │ (SeqEnqueue
1479.56 s
[nothunks] ┃ │ (IntValue 0)
1479.56 s
[nothunks] ┃ │ (SeqEnqueue
1479.56 s
[nothunks] ┃ │ (IntValue 0)
1479.56 s
[nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
1479.56 s
[nothunks] ┃ │ }
1479.56 s
[nothunks] 175 ┃ collect $ modelUnexpected [] m
1479.56 s
[nothunks] 176 ┃ fromModel m $ \a -> do
1479.56 s
[nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
1479.56 s
[nothunks] ┃ │ IsNF
1479.56 s
[nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
1479.56 s
[nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
1479.56 s
[nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1479.56 s
[nothunks] ┃ │ ━━━ Failed (- lhs ) (+ rhs ) ━━━
1479.56 s
[nothunks] ┃ │ - Just
1479.56 s
[nothunks] ┃ │ - ThunkInfo
1479.56 s
[nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
1479.56 s
[nothunks] ┃ │ + Nothing
1479.56 s
[nothunks]
1479.56 s
[nothunks] This failure can be reproduced by running:
1479.56 s
[nothunks] > recheckAt (Seed 7658446290982696329 9142656414718942013) "13:c" EXPECTED FAILURE
1479.56 s
[nothunks]
1479.56 s
[nothunks] OK (0.02s)
1479.56 s
[nothunks] ✓ <interactive> passed 1 test.
1479.56 s
[nothunks] Model
1479.58 s
[nothunks] Int: OK (0.02s)
1479.58 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.58 s
[nothunks] Just ["Int"] 52% ██████████▎·········
1479.58 s
[nothunks] Nothing 48% █████████▋··········
1479.60 s
[nothunks] IntInt: OK (0.02s)
1479.60 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.60 s
[nothunks] Just ["Int","Tuple2"] 38% ███████▌············
1479.60 s
[nothunks] Just ["Tuple2"] 50% █████████▉··········
1479.60 s
[nothunks] Nothing 12% ██▍·················
1479.62 s
[nothunks] SumInt: OK (0.02s)
1479.62 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.62 s
[nothunks] Just ["Either"] 36% ███████▏············
1479.62 s
[nothunks] Just ["Int","Either"] 29% █████▊··············
1479.62 s
[nothunks] Nothing 35% ██████▉·············
1479.62 s
[nothunks] ListInt: OK (0.02s)
1479.62 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.62 s
[nothunks] Just ["Int","List"] 20% ████················
1479.62 s
[nothunks] Just ["List"] 46% █████████▎··········
1479.62 s
[nothunks] Nothing 33% ██████▌·············
1479.66 s
[nothunks] IntListInt: OK (0.01s)
1479.66 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.66 s
[nothunks] Just ["Int","List","Tuple2"] 6% █▏··················
1479.66 s
[nothunks] Just ["Int","Tuple2"] 25% █████···············
1479.66 s
[nothunks] Just ["List","Tuple2"] 11% ██▏·················
1479.66 s
[nothunks] Just ["Tuple2"] 50% █████████▉··········
1479.66 s
[nothunks] Nothing 8% █▋··················
1479.74 s
[nothunks] SeqInt: OK (0.09s)
1479.74 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.74 s
[nothunks] Just ["Int","Seq"] 45% █████████···········
1479.74 s
[nothunks] Nothing 55% ██████████▉·········
1479.78 s
[nothunks] AllowThunksIn: OK (0.03s)
1479.78 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.78 s
[nothunks] Just ["Int","field2","Record"] 26% █████···············
1479.78 s
[nothunks] Just ["Record"] 51% ██████████▏·········
1479.78 s
[nothunks] Nothing 24% ████▋···············
1479.78 s
[nothunks] Fn: OK (0.01s)
1479.78 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.78 s
[nothunks] Just ["->"] 23% ████▌···············
1479.78 s
[nothunks] Nothing 77% ███████████████▍····
1479.80 s
[nothunks] IO: OK (0.01s)
1479.80 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.80 s
[nothunks] Just ["IO"] 25% ████▉···············
1479.80 s
[nothunks] Nothing 75% ███████████████·····
1479.82 s
[nothunks] ThunkFreeFn: OK (0.01s)
1479.82 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.82 s
[nothunks] Just ["->"] 25% █████···············
1479.82 s
[nothunks] Just ["...","->"] 38% ███████▌············
1479.82 s
[nothunks] Nothing 37% ███████▍············
1479.82 s
[nothunks] ThunkFreeIO: OK (0.01s)
1479.82 s
[nothunks] ✓ <interactive> passed 1000 tests.
1479.82 s
[nothunks] Just ["...","IO"] 39% ███████▋············
1479.82 s
[nothunks] Just ["IO"] 25% ████▉···············
1479.82 s
[nothunks] Nothing 37% ███████▎············
1479.82 s
[nothunks] MutableVars
1479.82 s
[nothunks] IORef
1479.82 s
[nothunks] NotNF: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NF: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NotNFPure: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NFPure: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NotNFAtomically: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NFAtomically: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] MVar
1479.82 s
[nothunks] NotNF: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NF: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NotNFPure: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NFPure: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NotNFAtomically: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NFAtomically: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] TVar
1479.82 s
[nothunks] NotNF: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NF: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NotNFPure: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NFPure: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NotNFAtomically: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks] NFAtomically: OK
1479.82 s
[nothunks] ✓ <interactive> passed 1 test.
1479.82 s
[nothunks]
1479.82 s
[nothunks] All 41 tests passed (0.41s)
1479.82 s
[nothunks] Test suite nothunks-test: PASS
1479.82 s
[nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
1479.82 s
[nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
1479.83 s
[nothunks] Phase: haddockPhase
1479.98 s
[nothunks] Preprocessing library for nothunks-0.3.1..
1479.98 s
[nothunks] Running Haddock on library for nothunks-0.3.1..
1479.98 s
[nothunks] Warning: The documentation for the following packages are not installed. No
1479.98 s
[nothunks] links will be generated to these packages: vector-0.13.2.0
1480.03 s
[nothunks] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1480.22 s
[nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
1480.79 s
[nothunks] Haddock coverage:
1480.79 s
[nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
1480.79 s
[nothunks] * at src/NoThunks/Class.hs:334:48
1480.79 s
[nothunks] * at src/NoThunks/Class.hs:334:1
1480.79 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
1480.79 s
[nothunks] by specifying the type/value namespace explicitly.
1480.79 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
1480.79 s
[nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
1480.79 s
[nothunks] * at src/NoThunks/Class.hs:353:25
1480.79 s
[nothunks] * at src/NoThunks/Class.hs:353:1
1480.79 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
1480.79 s
[nothunks] by specifying the type/value namespace explicitly.
1480.79 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
1480.79 s
[nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
1480.79 s
[nothunks] * at src/NoThunks/Class.hs:358:47
1480.79 s
[nothunks] * at src/NoThunks/Class.hs:358:1
1480.79 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
1480.79 s
[nothunks] by specifying the type/value namespace explicitly.
1480.79 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
1480.79 s
[nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
1480.79 s
[nothunks] * at src/NoThunks/Class.hs:308:27
1480.79 s
[nothunks] * at src/NoThunks/Class.hs:308:1
1480.79 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
1480.80 s
[nothunks] by specifying the type/value namespace explicitly.
1480.80 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
1480.80 s
[nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
1480.80 s
[nothunks] * at src/NoThunks/Class.hs:230:18
1480.80 s
[nothunks] * at src/NoThunks/Class.hs:230:1
1480.80 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
1480.80 s
[nothunks] by specifying the type/value namespace explicitly.
1480.80 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
1480.80 s
[nothunks] Warning: 'GHC' is out of scope.
1480.80 s
[nothunks] If you qualify the identifier, haddock can try to link it anyway.
1480.80 s
[nothunks] Warning: 'a' is out of scope.
1480.80 s
[nothunks] If you qualify the identifier, haddock can try to link it anyway.
1480.80 s
[nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
1480.80 s
[nothunks] Missing documentation for:
1480.80 s
[nothunks] Module header
1481.39 s
[nothunks] Warning: NoThunks.Class: could not find link destinations for:
1481.39 s
[nothunks] - Data.Vector.Vector
1481.39 s
[nothunks] - Data.Vector.Unboxed.Base.Vector
1481.39 s
[nothunks] - NoThunks.Class.HasFields
1481.39 s
[nothunks] - NoThunks.Class.Elem
1481.39 s
[nothunks] - NoThunks.Class.GShowTypeOf
1481.39 s
[nothunks] - NoThunks.Class.GWRecordField
1481.39 s
[nothunks] - NoThunks.Class.checkContainsThunks
1485.49 s
[nothunks] Documentation created: dist/doc/html/nothunks/,
1485.53 s
[nothunks] dist/doc/html/nothunks/nothunks.txt
1485.60 s
[nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
1485.61 s
[nothunks] Phase: installPhase
1485.78 s
[nothunks] Installing library in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
1486.05 s
[nothunks] Phase: fixupPhase
1486.07 s
[nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1
1486.08 s
[nothunks] shrinking /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSnothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So-ghc9.8.4.so
1486.09 s
[nothunks] checking for references to /build/ in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1...
1486.11 s
[nothunks] patching script interpreter paths in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1
1486.11 s
[nothunks] stripping (with command strip and flags -S -p) in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib
1486.19 s
[nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc
1486.20 s
[nothunks] checking for references to /build/ in /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc...
1486.22 s
[nothunks] patching script interpreter paths in /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc
1486.35 s
[nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1 /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc
1486.82 s
[nothunks:post-build] Nothing to push - all store paths are already on Cachix.
1486.84 s
[nothunks:post-build] Uploading to the NixCI cache: /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1 /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc
1486.90 s
[nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1486.97 s
[nothunks:post-build] copying 1 paths...
1486.97 s
[nothunks:post-build] copying path '/nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
1487.82 s
[nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1487.92 s
[nothunks:post-build] copying 0 paths...
1487.95 s
Progress: 25 of 38 built (1 building), 559 of 559 downloaded from cache
1488.02 s
Building /nix/store/mr7yxhpx752pnr1i2yrqdpqk587ricjc-unordered-containers-0.2.20.1.drv
1488.02 s
[pandoc-lua-engine] Documentation created: dist/doc/html/pandoc-lua-engine/,
1488.02 s
[pandoc-lua-engine] dist/doc/html/pandoc-lua-engine/pandoc-lua-engine.txt
1488.02 s
[pandoc-lua-engine] Preprocessing test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
1488.02 s
[pandoc-lua-engine] Phase: installPhase
1488.16 s
[unordered-containers] Phase: setupCompilerEnvironmentPhase
1488.16 s
[unordered-containers] Build with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
1488.19 s
[pandoc-lua-engine] Installing library in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
1488.36 s
[unordered-containers] Phase: unpackPhase
1488.36 s
[unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
1488.37 s
[unordered-containers] source root is unordered-containers-0.2.20.1
1488.38 s
[unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
1488.38 s
[unordered-containers] Phase: patchPhase
1488.39 s
[unordered-containers] Phase: compileBuildDriverPhase
1488.40 s
[unordered-containers] setupCompileFlags: -package-db=/build/tmp.F4TDaT7Clm/setup-package.conf.d -threaded
1488.45 s
[unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.F4TDaT7Clm/Main.o )
1488.54 s
[unordered-containers] [2 of 2] Linking Setup
1489.28 s
[pandoc-lua-engine] Phase: fixupPhase
1489.30 s
[pandoc-lua-engine] shrinking RPATHs of ELF executables and libraries in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3
1489.31 s
[pandoc-lua-engine] shrinking /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSpandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4-ghc9.10.3.so
1489.45 s
[pandoc-lua-engine] checking for references to /build/ in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3...
1489.49 s
[pandoc-lua-engine] patching script interpreter paths in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3
1489.50 s
[pandoc-lua-engine] stripping (with command strip and flags -S -p) in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib
1489.81 s
[pandoc-lua-engine] shrinking RPATHs of ELF executables and libraries in /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc
1489.83 s
[pandoc-lua-engine] checking for references to /build/ in /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc...
1489.85 s
[pandoc-lua-engine] patching script interpreter paths in /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc
1490.17 s
[pandoc-lua-engine:post-build] Uploading to cachix cache "sellout": /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3 /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc
1490.65 s
[pandoc-lua-engine:post-build] Nothing to push - all store paths are already on Cachix.
1490.68 s
[pandoc-lua-engine:post-build] Uploading to the NixCI cache: /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3 /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc
1490.74 s
[pandoc-lua-engine:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1490.81 s
[pandoc-lua-engine:post-build] copying 1 paths...
1490.81 s
[pandoc-lua-engine:post-build] copying path '/nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3' to 'https://cache.nix-ci.com'...
1498.12 s
[pandoc-lua-engine:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1498.26 s
[pandoc-lua-engine:post-build] copying 0 paths...
1498.29 s
Progress: 26 of 38 built (1 building), 559 of 559 downloaded from cache
1498.39 s
Building /nix/store/qmy7ps3m9d54gh5mmi24jf976jzhgy36-pandoc-cli-3.7.0.2.drv
1498.39 s
[unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
1498.39 s
[unordered-containers] Phase: configurePhase
1498.40 s
[unordered-containers] configureFlags: --verbose --prefix=/nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.F4TDaT7Clm/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
1498.40 s
[unordered-containers] Using Parsec parser
1498.40 s
[unordered-containers] Configuring unordered-containers-0.2.20.1...
1498.40 s
[unordered-containers] Flags chosen: debug=False
1498.40 s
[unordered-containers] Dependency base >=4.10 && <5: using base-4.19.2.0
1498.40 s
[unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.1.0
1498.40 s
[unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
1498.40 s
[unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.21.0.0
1498.40 s
[unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
1498.40 s
[unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
1498.40 s
[unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
1498.40 s
[unordered-containers] Dependency base: using base-4.19.2.0
1498.40 s
[unordered-containers] Dependency containers >=0.5.8: using containers-0.6.8
1498.40 s
[unordered-containers] Dependency hashable: using hashable-1.5.0.0
1498.40 s
[unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
1498.40 s
[unordered-containers] Dependency random: using random-1.2.1.3
1498.40 s
[unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
1498.40 s
[unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
1498.40 s
[unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
1498.40 s
[unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
1498.40 s
[unordered-containers] Source component graph:
1498.40 s
[unordered-containers] component lib
1498.40 s
[unordered-containers] component test:unordered-containers-tests dependency lib
1498.40 s
[unordered-containers] Configured component graph:
1498.40 s
[unordered-containers] component unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
1498.40 s
[unordered-containers] include base-4.19.2.0-8274
1498.40 s
[unordered-containers] include deepseq-1.5.1.0-c64e
1498.40 s
[unordered-containers] include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
1498.40 s
[unordered-containers] include template-haskell-2.21.0.0-cbc4
1498.40 s
[unordered-containers] component unordered-containers-0.2.20.1-8p5Y26GgM36CrnRklz7hG5-unordered-containers-tests
1498.40 s
[unordered-containers] include ChasingBottoms-1.3.1.17-EmoCAwMoPH0CCHL2NpXdat
1498.40 s
[unordered-containers] include HUnit-1.6.2.0-Db1bFs6D9VKLsZfaOMc6ct
1498.40 s
[unordered-containers] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1498.40 s
[unordered-containers] include base-4.19.2.0-8274
1498.40 s
[unordered-containers] include containers-0.6.8-15d9
1498.40 s
[unordered-containers] include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
1498.40 s
[unordered-containers] include nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
1498.40 s
[unordered-containers] include random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
1498.40 s
[unordered-containers] include tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
1498.40 s
[unordered-containers] include tasty-hunit-0.10.2-KzZfdY6N22V4CcWQecXPjL
1498.40 s
[unordered-containers] include tasty-quickcheck-0.11.1-2kmHUdfkSdKIEfY8qRwL5K
1498.40 s
[unordered-containers] include unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
1498.40 s
[unordered-containers] Linked component graph:
1498.40 s
[unordered-containers] unit unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
1498.40 s
[unordered-containers] include base-4.19.2.0-8274
1498.40 s
[unordered-containers] include deepseq-1.5.1.0-c64e
1498.40 s
[unordered-containers] include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
1498.40 s
[unordered-containers] include template-haskell-2.21.0.0-cbc4
1498.40 s
[unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashSet.Internal
1498.40 s
[unordered-containers] unit unordered-containers-0.2.20.1-8p5Y26GgM36CrnRklz7hG5-unordered-containers-tests
1498.40 s
[unordered-containers] include ChasingBottoms-1.3.1.17-EmoCAwMoPH0CCHL2NpXdat
1498.40 s
[unordered-containers] include HUnit-1.6.2.0-Db1bFs6D9VKLsZfaOMc6ct
1498.40 s
[unordered-containers] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1498.40 s
[unordered-containers] include base-4.19.2.0-8274
1498.40 s
[unordered-containers] include containers-0.6.8-15d9
1498.40 s
[unordered-containers] include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
1498.40 s
[unordered-containers] include nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
1498.40 s
[unordered-containers] include random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
1498.40 s
[unordered-containers] include tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
1498.40 s
[unordered-containers] include tasty-hunit-0.10.2-KzZfdY6N22V4CcWQecXPjL
1498.40 s
[unordered-containers] include tasty-quickcheck-0.11.1-2kmHUdfkSdKIEfY8qRwL5K
1498.40 s
[unordered-containers] include unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
1498.40 s
[unordered-containers] Ready component graph:
1498.40 s
[unordered-containers] definite unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
1498.40 s
[unordered-containers] depends base-4.19.2.0-8274
1498.40 s
[unordered-containers] depends deepseq-1.5.1.0-c64e
1498.40 s
[unordered-containers] depends hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
1498.40 s
[unordered-containers] depends template-haskell-2.21.0.0-cbc4
1498.40 s
[unordered-containers] definite unordered-containers-0.2.20.1-8p5Y26GgM36CrnRklz7hG5-unordered-containers-tests
1498.40 s
[unordered-containers] depends ChasingBottoms-1.3.1.17-EmoCAwMoPH0CCHL2NpXdat
1498.40 s
[unordered-containers] depends HUnit-1.6.2.0-Db1bFs6D9VKLsZfaOMc6ct
1498.40 s
[unordered-containers] depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1498.40 s
[unordered-containers] depends base-4.19.2.0-8274
1498.40 s
[unordered-containers] depends containers-0.6.8-15d9
1498.40 s
[unordered-containers] depends hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
1498.40 s
[unordered-containers] depends nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
1498.40 s
[unordered-containers] depends random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
1498.40 s
[unordered-containers] depends tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
1498.40 s
[unordered-containers] depends tasty-hunit-0.10.2-KzZfdY6N22V4CcWQecXPjL
1498.40 s
[unordered-containers] depends tasty-quickcheck-0.11.1-2kmHUdfkSdKIEfY8qRwL5K
1498.40 s
[unordered-containers] depends unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
1498.40 s
[unordered-containers] Using Cabal-3.10.3.0 compiled by ghc-9.8
1498.40 s
[unordered-containers] Using compiler: ghc-9.8.4
1498.40 s
[unordered-containers] Using install prefix:
1498.40 s
[unordered-containers] /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1
1498.40 s
[unordered-containers] Executables installed in:
1498.40 s
[unordered-containers] /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/bin
1498.40 s
[unordered-containers] Libraries installed in:
1498.40 s
[unordered-containers] /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
1498.40 s
[unordered-containers] Dynamic Libraries installed in:
1498.40 s
[unordered-containers] /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
1498.40 s
[unordered-containers] Private executables installed in:
1498.40 s
[unordered-containers] /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1
1498.40 s
[unordered-containers] Data files installed in:
1498.40 s
[unordered-containers] /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1
1498.40 s
[unordered-containers] Documentation installed in:
1498.40 s
[unordered-containers] /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
1498.40 s
[unordered-containers] Configuration files installed in:
1498.40 s
[unordered-containers] /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/etc
1498.40 s
[unordered-containers] No alex found
1498.40 s
[unordered-containers] Using ar found on system at:
1498.40 s
[unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
1498.40 s
[unordered-containers] No c2hs found
1498.40 s
[unordered-containers] No cpphs found
1498.40 s
[unordered-containers] No doctest found
1498.40 s
[unordered-containers] Using gcc version 14.3.0 given by user at:
1498.40 s
[unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
1498.40 s
[unordered-containers] Using ghc version 9.8.4 found on system at:
1498.40 s
[unordered-containers] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
1498.40 s
[unordered-containers] Using ghc-pkg version 9.8.4 found on system at:
1498.40 s
[unordered-containers] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
1498.40 s
[unordered-containers] No ghcjs found
1498.40 s
[unordered-containers] No ghcjs-pkg found
1498.40 s
[unordered-containers] No greencard found
1498.40 s
[unordered-containers] Using haddock version 2.30.0 found on system at:
1498.40 s
[unordered-containers] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
1498.40 s
[unordered-containers] No happy found
1498.40 s
[unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
1498.40 s
[unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1498.40 s
[unordered-containers] No hmake found
1498.40 s
[unordered-containers] Using hpc version 0.69 found on system at:
1498.40 s
[unordered-containers] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
1498.40 s
[unordered-containers] Using hsc2hs version 0.68.10 found on system at:
1498.40 s
[unordered-containers] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
1498.40 s
[unordered-containers] Using hscolour version 1.25 found on system at:
1498.40 s
[unordered-containers] /nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
1498.40 s
[unordered-containers] No jhc found
1498.40 s
[unordered-containers] Using ld found on system at:
1498.40 s
[unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
1498.41 s
[unordered-containers] No pkg-config found
1498.41 s
[unordered-containers] Using runghc version 9.8.4 found on system at:
1498.41 s
[unordered-containers] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
1498.41 s
[unordered-containers] Using strip version 2.44 found on system at:
1498.41 s
[unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
1498.41 s
[unordered-containers] Using tar found on system at:
1498.41 s
[unordered-containers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
1498.41 s
[unordered-containers] No uhc found
1498.41 s
[unordered-containers] Phase: buildPhase
1498.41 s
[unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
1498.41 s
[unordered-containers] Building library for unordered-containers-0.2.20.1..
1498.41 s
[unordered-containers]
1498.41 s
[unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning : [ GHC-53692 ] [ -Wdeprecated-flags ]
1498.41 s
[unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
1498.41 s
[unordered-containers] |
1498.41 s
[unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
1498.41 s
[unordered-containers] | ^^^^^^^^^^
1498.41 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 )
1498.41 s
[unordered-containers]
1498.41 s
[unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning : [ GHC-66111 ] [ -Wunused-imports ]
1498.41 s
[unordered-containers] The import of ‘Control.Applicative’ is redundant
1498.41 s
[unordered-containers] except perhaps to import instances from ‘Control.Applicative’
1498.41 s
[unordered-containers] To import instances alone, use: import Control.Applicative()
1498.41 s
[unordered-containers] |
1498.41 s
[unordered-containers] 83 | import Control.Applicative (liftA2)
1498.41 s
[unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1498.41 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 )
1498.41 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 )
1499.25 s
[pandoc-cli] Phase: setupCompilerEnvironmentPhase
1499.26 s
[pandoc-cli] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
1500.00 s
[pandoc-cli] Phase: unpackPhase
1500.01 s
[pandoc-cli] unpacking source archive /nix/store/l1s1s9sdrxfqabvc0hl1i6jbdyzaj2ci-pandoc-cli-3.7.0.2.tar.gz
1500.02 s
[pandoc-cli] source root is pandoc-cli-3.7.0.2
1500.03 s
[pandoc-cli] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-cli-3.7.0.2/src/pandoc.hs"
1500.03 s
[pandoc-cli] Phase: patchPhase
1500.05 s
[pandoc-cli] Phase: compileBuildDriverPhase
1500.05 s
[pandoc-cli] setupCompileFlags: -package-db=/build/tmp.wfHYidRJRl/setup-package.conf.d -threaded
1500.13 s
[pandoc-cli] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.wfHYidRJRl/Main.o )
1500.19 s
[pandoc-cli] [2 of 2] Linking Setup
1500.34 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 )
1500.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 )
1502.05 s
[pandoc-cli] Phase: updateAutotoolsGnuConfigScriptsPhase
1502.06 s
[pandoc-cli] Phase: configurePhase
1502.07 s
[pandoc-cli] configureFlags: --verbose --prefix=/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.wfHYidRJRl/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --disable-library-profiling --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 -fembed_data_files --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
1502.08 s
[pandoc-cli] Using Parsec parser
1502.08 s
[pandoc-cli] Configuring pandoc-cli-3.7.0.2...
1502.76 s
[pandoc-cli] Flags chosen: lua=True, nightly=False, server=True
1503.15 s
[pandoc-cli] Dependency base >=4.12 && <5: using base-4.20.2.0
1503.15 s
[pandoc-cli] Dependency hslua-cli >=1.4.1 && <1.5: using hslua-cli-1.4.3
1503.15 s
[pandoc-cli] Dependency pandoc ==3.7.0.2: using pandoc-3.7.0.2
1503.15 s
[pandoc-cli] Dependency pandoc-lua-engine >=0.4.3 && <0.5: using pandoc-lua-engine-0.4.3
1503.15 s
[pandoc-cli] Dependency pandoc-server >=0.1.0.9 && <0.2: using pandoc-server-0.1.0.11
1503.15 s
[pandoc-cli] Dependency safe: using safe-0.3.21
1503.15 s
[pandoc-cli] Dependency temporary >=1.1 && <1.4: using temporary-1.3
1503.15 s
[pandoc-cli] Dependency text: using text-2.1.3
1503.15 s
[pandoc-cli] Dependency wai-extra >=3.0.24: using wai-extra-3.1.18
1503.15 s
[pandoc-cli] Dependency warp: using warp-3.4.9
1503.15 s
[pandoc-cli] Source component graph: component exe:pandoc
1503.15 s
[pandoc-cli] Configured component graph:
1503.15 s
[pandoc-cli] component pandoc-cli-3.7.0.2-BdFEXtx4yoTCmeDPYT8eTr-pandoc
1503.15 s
[pandoc-cli] include base-4.20.2.0-64da
1503.15 s
[pandoc-cli] include hslua-cli-1.4.3-GEWVAFQbzS1ZD0qJxIIXy
1503.15 s
[pandoc-cli] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
1503.15 s
[pandoc-cli] include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
1503.15 s
[pandoc-cli] include pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
1503.15 s
[pandoc-cli] include safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
1503.15 s
[pandoc-cli] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
1503.15 s
[pandoc-cli] include text-2.1.3-c691
1503.15 s
[pandoc-cli] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
1503.15 s
[pandoc-cli] include warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
1503.15 s
[pandoc-cli] Linked component graph:
1503.15 s
[pandoc-cli] unit pandoc-cli-3.7.0.2-BdFEXtx4yoTCmeDPYT8eTr-pandoc
1503.15 s
[pandoc-cli] include base-4.20.2.0-64da
1503.15 s
[pandoc-cli] include hslua-cli-1.4.3-GEWVAFQbzS1ZD0qJxIIXy
1503.15 s
[pandoc-cli] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
1503.15 s
[pandoc-cli] include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
1503.15 s
[pandoc-cli] include pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
1503.15 s
[pandoc-cli] include safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
1503.15 s
[pandoc-cli] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
1503.15 s
[pandoc-cli] include text-2.1.3-c691
1503.15 s
[pandoc-cli] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
1503.15 s
[pandoc-cli] include warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
1503.15 s
[pandoc-cli] Ready component graph:
1503.15 s
[pandoc-cli] definite pandoc-cli-3.7.0.2-BdFEXtx4yoTCmeDPYT8eTr-pandoc
1503.15 s
[pandoc-cli] depends base-4.20.2.0-64da
1503.15 s
[pandoc-cli] depends hslua-cli-1.4.3-GEWVAFQbzS1ZD0qJxIIXy
1503.15 s
[pandoc-cli] depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
1503.16 s
[pandoc-cli] depends pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
1503.16 s
[pandoc-cli] depends pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
1503.16 s
[pandoc-cli] depends safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
1503.16 s
[pandoc-cli] depends temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
1503.16 s
[pandoc-cli] depends text-2.1.3-c691
1503.16 s
[pandoc-cli] depends wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
1503.16 s
[pandoc-cli] depends warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
1503.16 s
[pandoc-cli] Using Cabal-3.12.1.0 compiled by ghc-9.10
1503.16 s
[pandoc-cli] Using compiler: ghc-9.10.3
1503.16 s
[pandoc-cli] Using install prefix:
1503.16 s
[pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
1503.16 s
[pandoc-cli] Executables installed in:
1503.16 s
[pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin
1503.16 s
[pandoc-cli] Libraries installed in:
1503.16 s
[pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-cli-3.7.0.2
1503.16 s
[pandoc-cli] Dynamic Libraries installed in:
1503.16 s
[pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
1503.16 s
[pandoc-cli] Private executables installed in:
1503.16 s
[pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/libexec/x86_64-linux-ghc-9.10.3-05f6/pandoc-cli-3.7.0.2
1503.16 s
[pandoc-cli] Data files installed in:
1503.16 s
[pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/share/x86_64-linux-ghc-9.10.3-05f6/pandoc-cli-3.7.0.2
1503.16 s
[pandoc-cli] Documentation installed in:
1503.16 s
[pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/share/doc/x86_64-linux-ghc-9.10.3-05f6/pandoc-cli-3.7.0.2
1503.16 s
[pandoc-cli] Configuration files installed in:
1503.16 s
[pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/etc
1503.16 s
[pandoc-cli] No alex found
1503.16 s
[pandoc-cli] Using ar found on system at:
1503.16 s
[pandoc-cli] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
1503.16 s
[pandoc-cli] No c2hs found
1503.16 s
[pandoc-cli] No cpphs found
1503.16 s
[pandoc-cli] No doctest found
1503.16 s
[pandoc-cli] Using gcc version 14.3.0 given by user at:
1503.16 s
[pandoc-cli] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
1503.16 s
[pandoc-cli] Using ghc version 9.10.3 found on system at:
1503.16 s
[pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
1503.16 s
[pandoc-cli] Using ghc-pkg version 9.10.3 found on system at:
1503.16 s
[pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
1503.16 s
[pandoc-cli] No ghcjs found
1503.16 s
[pandoc-cli] No ghcjs-pkg found
1503.16 s
[pandoc-cli] No greencard found
1503.16 s
[pandoc-cli] Using haddock version 2.31.1 found on system at:
1503.16 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 )
1503.16 s
[pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
1503.16 s
[pandoc-cli] No happy found
1503.16 s
[pandoc-cli] Using haskell-suite found on system at: haskell-suite-dummy-location
1503.16 s
[pandoc-cli] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1503.16 s
[pandoc-cli] No hmake found
1503.16 s
[pandoc-cli] Using hpc version 0.69 found on system at:
1503.16 s
[pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
1503.16 s
[pandoc-cli] Using hsc2hs version 0.68.10 found on system at:
1503.16 s
[pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
1503.16 s
[pandoc-cli] No hscolour found
1503.16 s
[pandoc-cli] No jhc found
1503.16 s
[pandoc-cli] Using ld found on system at:
1503.16 s
[pandoc-cli] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
1503.16 s
[pandoc-cli] No pkg-config found
1503.16 s
[pandoc-cli] Using runghc version 9.10.3 found on system at:
1503.16 s
[pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
1503.16 s
[pandoc-cli] Using strip version 2.44 found on system at:
1503.16 s
[pandoc-cli] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
1503.16 s
[pandoc-cli] Using tar found on system at:
1503.16 s
[pandoc-cli] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
1503.16 s
[pandoc-cli] No uhc found
1503.16 s
[unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
1503.16 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 )
1503.18 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 )
1503.47 s
[unordered-containers]
1503.47 s
[unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning : [ GHC-53692 ] [ -Wdeprecated-flags ]
1503.50 s
[unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
1503.50 s
[unordered-containers] |
1503.50 s
[unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
1503.50 s
[unordered-containers] | ^^^^^^^^^^
1503.70 s
[unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
1503.87 s
[unordered-containers]
1503.87 s
[unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning : [ GHC-66111 ] [ -Wunused-imports ]
1503.87 s
[unordered-containers] The import of ‘Control.Applicative’ is redundant
1503.87 s
[unordered-containers] except perhaps to import instances from ‘Control.Applicative’
1503.87 s
[unordered-containers] To import instances alone, use: import Control.Applicative()
1503.87 s
[unordered-containers] |
1503.87 s
[unordered-containers] 83 | import Control.Applicative (liftA2)
1503.87 s
[unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1504.05 s
[pandoc-cli] Phase: buildPhase
1504.21 s
[pandoc-cli] Preprocessing executable 'pandoc' for pandoc-cli-3.7.0.2...
1504.22 s
[pandoc-cli] Building executable 'pandoc' for pandoc-cli-3.7.0.2...
1504.36 s
[pandoc-cli] [1 of 3] Compiling PandocCLI.Lua
1504.71 s
[pandoc-cli] [2 of 3] Compiling PandocCLI.Server
1504.71 s
[pandoc-cli] [3 of 3] Compiling Main
1504.77 s
[unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
1504.77 s
[unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
1505.22 s
[pandoc-cli] [4 of 4] Linking dist/build/pandoc/pandoc
1514.30 s
[unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
1515.00 s
[unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
1515.97 s
[pandoc-cli] Phase: checkPhase
1516.06 s
[pandoc-cli] Package has no test suites.
1516.07 s
[pandoc-cli] Phase: haddockPhase
1516.07 s
[pandoc-cli] Phase: installPhase
1516.26 s
[pandoc-cli] Installing executable pandoc in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin
1516.26 s
[pandoc-cli] Warning: The directory
1516.26 s
[pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin is not in
1516.26 s
[pandoc-cli] the system search path.
1517.82 s
[unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
1517.82 s
[unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
1517.82 s
[unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
1517.94 s
[unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
1519.37 s
[unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
1519.39 s
[unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
1519.54 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 )
1519.82 s
[unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
1519.82 s
[unordered-containers]
1519.82 s
[unordered-containers] tests/Regressions.hs:93:16: warning : [ GHC-63394 ] [ -Wx-partial ]
1519.82 s
[unordered-containers] In the use of ‘head’
1519.82 s
[unordered-containers] (imported from Prelude, but defined in GHC.List):
1519.82 s
[unordered-containers] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1519.82 s
[unordered-containers] |
1519.82 s
[unordered-containers] 93 | k = head keys
1519.82 s
[unordered-containers] | ^^^^
1520.55 s
[pandoc-cli] Phase: fixupPhase
1520.57 s
[pandoc-cli] shrinking RPATHs of ELF executables and libraries in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
1520.57 s
[pandoc-cli] shrinking /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin/pandoc
1521.04 s
[pandoc-cli] checking for references to /build/ in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2...
1521.44 s
[pandoc-cli] gzipping man pages under /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/share/man/
1521.48 s
[pandoc-cli] patching script interpreter paths in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
1521.49 s
[pandoc-cli] stripping (with command strip and flags -S -p) in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin
1522.74 s
[pandoc-cli:post-build] Uploading to cachix cache "sellout": /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
1523.19 s
[pandoc-cli:post-build] Nothing to push - all store paths are already on Cachix.
1523.22 s
[pandoc-cli:post-build] Uploading to the NixCI cache: /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
1523.27 s
[pandoc-cli:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1523.29 s
[pandoc-cli:post-build] copying 1 paths...
1523.29 s
[pandoc-cli:post-build] copying path '/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2' to 'https://cache.nix-ci.com'...
1602.74 s
[pandoc-cli:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1602.86 s
[pandoc-cli:post-build] copying 0 paths...
1602.89 s
Progress: 27 of 38 built (1 building), 559 of 559 downloaded from cache
1602.96 s
Building /nix/store/10xzxxdy2m2dv7z9mzid70kwihb0p0z3-shellcheck-0.11.0.drv
1602.96 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 )
1602.96 s
[unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
1602.96 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 )
1602.96 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 )
1602.96 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 )
1602.96 s
[unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
1602.96 s
[unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
1602.96 s
[unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
1602.96 s
[unordered-containers] buildPhase completed in 40 seconds
1602.96 s
[unordered-containers] Phase: checkPhase
1602.96 s
[unordered-containers] Running 1 test suites...
1602.96 s
[unordered-containers] Test suite unordered-containers-tests: RUNNING...
1602.96 s
[unordered-containers] All
1602.96 s
[unordered-containers] Properties
1602.96 s
[unordered-containers] Data.HashMap.Lazy
1602.96 s
[unordered-containers] instances
1602.96 s
[unordered-containers] Eq
1602.96 s
[unordered-containers] ==: OK (0.04s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] /=: OK (0.03s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] Ord
1602.96 s
[unordered-containers] compare reflexive: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] compare transitive: OK (0.02s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] compare antisymmetric: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] Ord => Eq: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] Read/Show: OK (0.13s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] Functor: OK (0.03s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] Foldable: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] Bifoldable
1602.96 s
[unordered-containers] bifoldMap: OK (0.01s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] bifoldr: OK (0.01s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] bifoldl: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] Hashable: OK (0.02s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] empty
1602.96 s
[unordered-containers] valid: OK
1602.96 s
[unordered-containers] +++ OK, passed 1 test.
1602.96 s
[unordered-containers] singleton
1602.96 s
[unordered-containers] valid: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] size: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] member: OK (0.01s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] lookup: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] !?: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] insert
1602.96 s
[unordered-containers] model: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] valid: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] insertWith
1602.96 s
[unordered-containers] insertWith: OK (0.01s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] valid: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] delete
1602.96 s
[unordered-containers] model: OK (0.01s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] valid: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] adjust
1602.96 s
[unordered-containers] model: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] valid: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] update
1602.96 s
[unordered-containers] model: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] valid: OK (0.02s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] alter
1602.96 s
[unordered-containers] model: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] valid: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] alterF
1602.96 s
[unordered-containers] model
1602.96 s
[unordered-containers] []: OK (0.07s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] adjust: OK (0.01s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] insert: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] insertWith: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] delete: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] lookup: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] valid: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] isSubmapOf
1602.96 s
[unordered-containers] model: OK (0.03s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] m ⊆ m: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] m1 ⊆ m1 ∪ m2: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] m1\m2 ⊆ m1: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.01s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests; 217 discarded.
1602.96 s
[unordered-containers] delete k m ⊆ m: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests; 19 discarded.
1602.96 s
[unordered-containers] m ⊈ delete k m : OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests; 15 discarded.
1602.96 s
[unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests; 12 discarded.
1602.96 s
[unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
1602.96 s
[unordered-containers] +++ OK, passed 100 tests; 9 discarded.
1602.96 s
[unordered-containers] union
1602.96 s
[unordered-containers] model: OK (0.01s)
1602.96 s
[unordered-containers] +++ OK, passed 100 tests.
1602.96 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] unionWith
1602.97 s
[unordered-containers] model: OK (0.01s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] unionWithKey
1602.97 s
[unordered-containers] model: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] unions
1602.97 s
[unordered-containers] model: OK (0.79s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.37s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] difference
1602.97 s
[unordered-containers] model: OK (0.01s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] differenceWith
1602.97 s
[unordered-containers] model: OK (0.03s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.04s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] intersection
1602.97 s
[unordered-containers] model: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] intersectionWith
1602.97 s
[unordered-containers] model: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] intersectionWithKey
1602.97 s
[unordered-containers] model: OK (0.03s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] compose
1602.97 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] map
1602.97 s
[unordered-containers] model: OK (0.06s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] traverseWithKey
1602.97 s
[unordered-containers] model: OK (0.16s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.04s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] mapKeys
1602.97 s
[unordered-containers] model: OK (0.01s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.22s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] foldr: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] foldl: OK (0.01s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] foldrWithKey: OK (0.01s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] foldlWithKey: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] foldrWithKey': OK (0.01s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] foldlWithKey': OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] foldl': OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] foldr': OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] foldMapWithKey: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] filter
1602.97 s
[unordered-containers] model: OK (0.05s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.03s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] filterWithKey
1602.97 s
[unordered-containers] model: OK (1.09s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.40s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] mapMaybe
1602.97 s
[unordered-containers] model: OK (0.05s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.05s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] mapMaybeWithKey
1602.97 s
[unordered-containers] model: OK (1.03s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.48s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] elems: OK (0.03s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] keys: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] fromList
1602.97 s
[unordered-containers] model: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] fromListWith
1602.97 s
[unordered-containers] model: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.01s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] fromListWithKey
1602.97 s
[unordered-containers] model: OK (0.04s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] toList: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] Data.HashMap.Strict
1602.97 s
[unordered-containers] instances
1602.97 s
[unordered-containers] Eq
1602.97 s
[unordered-containers] ==: OK (0.03s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] /=: OK (0.05s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] Ord
1602.97 s
[unordered-containers] compare reflexive: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] compare transitive: OK (0.07s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] compare antisymmetric: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] Ord => Eq: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] Read/Show: OK (0.31s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] Functor: OK (0.07s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] Foldable: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] Bifoldable
1602.97 s
[unordered-containers] bifoldMap: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] bifoldr: OK (0.03s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] bifoldl: OK (0.01s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] Hashable: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] empty
1602.97 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 1 test.
1602.97 s
[unordered-containers] singleton
1602.97 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] size: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] member: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] lookup: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] !?: OK (0.01s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] insert
1602.97 s
[unordered-containers] model: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] insertWith
1602.97 s
[unordered-containers] insertWith: OK (0.04s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] delete
1602.97 s
[unordered-containers] model: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] adjust
1602.97 s
[unordered-containers] model: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] update
1602.97 s
[unordered-containers] model: OK (0.01s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] alter
1602.97 s
[unordered-containers] model: OK (0.01s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] alterF
1602.97 s
[unordered-containers] model
1602.97 s
[unordered-containers] []: OK (0.13s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] adjust: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] insert: OK (0.03s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] insertWith: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] delete: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] lookup: OK (0.01s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.05s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] isSubmapOf
1602.97 s
[unordered-containers] model: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] m ⊆ m: OK (0.01s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] m1 ⊆ m1 ∪ m2: OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] m1\m2 ⊆ m1: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.04s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests; 166 discarded.
1602.97 s
[unordered-containers] delete k m ⊆ m: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests; 16 discarded.
1602.97 s
[unordered-containers] m ⊈ delete k m : OK
1602.97 s
[unordered-containers] +++ OK, passed 100 tests; 19 discarded.
1602.97 s
[unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests; 4 discarded.
1602.97 s
[unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests; 11 discarded.
1602.97 s
[unordered-containers] union
1602.97 s
[unordered-containers] model: OK (0.04s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] unionWith
1602.97 s
[unordered-containers] model: OK (0.06s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.05s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] unionWithKey
1602.97 s
[unordered-containers] model: OK (0.10s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.10s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] unions
1602.97 s
[unordered-containers] model: OK (0.89s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.64s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] difference
1602.97 s
[unordered-containers] model: OK (0.03s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.03s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] differenceWith
1602.97 s
[unordered-containers] model: OK (0.09s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.08s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] intersection
1602.97 s
[unordered-containers] model: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] intersectionWith
1602.97 s
[unordered-containers] model: OK (0.07s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.05s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] intersectionWithKey
1602.97 s
[unordered-containers] model: OK (0.13s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.07s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] compose
1602.97 s
[unordered-containers] valid: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] map
1602.97 s
[unordered-containers] model: OK (0.15s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.05s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] traverseWithKey
1602.97 s
[unordered-containers] model: OK (0.67s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] mapKeys
1602.97 s
[unordered-containers] model: OK (0.02s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] valid: OK (0.47s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.97 s
[unordered-containers] foldr: OK (0.04s)
1602.97 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] foldl: OK (0.03s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] foldrWithKey: OK (0.02s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] foldlWithKey: OK (0.02s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] foldrWithKey': OK (0.01s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] foldlWithKey': OK (0.02s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] foldl': OK (0.02s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] foldr': OK (0.04s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] foldMapWithKey: OK (0.03s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] filter
1602.98 s
[unordered-containers] model: OK (0.10s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] valid: OK (0.06s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] filterWithKey
1602.98 s
[unordered-containers] model: OK (0.78s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] valid: OK (0.64s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] mapMaybe
1602.98 s
[unordered-containers] model: OK (0.08s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] valid: OK (0.07s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] mapMaybeWithKey
1602.98 s
[unordered-containers] model: OK (0.77s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] valid: OK (0.47s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] elems: OK (0.03s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] keys: OK (0.03s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] fromList
1602.98 s
[unordered-containers] model: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] valid: OK (0.02s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] fromListWith
1602.98 s
[unordered-containers] model: OK (0.03s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] valid: OK (0.05s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] fromListWithKey
1602.98 s
[unordered-containers] model: OK (0.04s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] valid: OK (0.07s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] toList: OK (0.04s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] Data.HashSet
1602.98 s
[unordered-containers] instances
1602.98 s
[unordered-containers] Eq
1602.98 s
[unordered-containers] ==: OK (0.04s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] == permutations: OK (0.02s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] /=: OK (0.03s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] Ord
1602.98 s
[unordered-containers] compare reflexive: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] compare transitive: OK (0.03s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] compare antisymmetric: OK (0.05s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] Ord => Eq: OK (0.04s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] Read/Show: OK (0.31s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] Foldable: OK (0.02s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] Hashable: OK (0.02s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] size: OK (0.02s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] member: OK (0.01s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] insert: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] delete: OK (0.04s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] union: OK (0.04s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] map: OK (0.52s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] foldr: OK (0.03s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] foldl': OK (0.04s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] filter: OK (0.45s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] toList: OK (0.03s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] Data.HashMap.Internal.List
1602.98 s
[unordered-containers] isPermutationBy: OK (0.02s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] isPermutationBy of different length: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests; 18 discarded.
1602.98 s
[unordered-containers] pUnorderedCompare: OK (0.07s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] modelUnorderedCompare
1602.98 s
[unordered-containers] reflexive: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] anti-symmetric: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] transitive: OK (0.03s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] Regression tests
1602.98 s
[unordered-containers] issue32: OK
1602.98 s
[unordered-containers] issue39a: OK
1602.98 s
[unordered-containers] issue39b: OK (0.03s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] issue254 lazy: OK
1602.98 s
[unordered-containers] issue254 strict: OK
1602.98 s
[unordered-containers] issue379
1602.98 s
[unordered-containers] Lazy.unionWith: OK
1602.98 s
[unordered-containers] union: OK
1602.98 s
[unordered-containers] Strict.unionWith: OK
1602.98 s
[unordered-containers] Strict.unionWithKey: OK
1602.98 s
[unordered-containers] issue381
1602.98 s
[unordered-containers] mapMaybe: OK
1602.98 s
[unordered-containers] mapMaybeWithKey: OK
1602.98 s
[unordered-containers] issue382: OK (0.01s)
1602.98 s
[unordered-containers] issue383: OK
1602.98 s
[unordered-containers] issue420: OK
1602.98 s
[unordered-containers] issue491
1602.98 s
[unordered-containers] 1: OK
1602.98 s
[unordered-containers] 2: OK
1602.98 s
[unordered-containers] 3: OK
1602.98 s
[unordered-containers] Strictness
1602.98 s
[unordered-containers] HashMap.Strict
1602.98 s
[unordered-containers] singleton is key-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] singleton is value-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] member is key-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] lookup is key-strict: OK (0.02s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] lookupDefault is key-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] findWithDefault is key-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] ! is key-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] delete is key-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] adjust is key-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] adjust is value-strict: OK (0.02s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] insert is key-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] insert is value-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] insertWith is key-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] insertWith is value-strict: OK (0.02s)
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] fromList is key-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] fromList is value-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] fromListWith is key-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers] fromListWith is value-strict: OK
1602.98 s
[unordered-containers] +++ OK, passed 100 tests.
1602.98 s
[unordered-containers]
1602.98 s
[unordered-containers] All 257 tests passed (1.27s)
1602.98 s
[unordered-containers] Test suite unordered-containers-tests: PASS
1602.98 s
[unordered-containers] Test suite logged to:
1602.98 s
[unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
1602.98 s
[unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
1602.99 s
[unordered-containers] checkPhase completed in 1 minutes 12 seconds
1602.99 s
[unordered-containers] Phase: haddockPhase
1603.02 s
[shellcheck] Phase: unpackPhase
1603.03 s
[shellcheck] unpacking source archive /nix/store/0y569php6xr1v629bbggizl1ba1mrf5b-ShellCheck-0.11.0.tar.gz
1603.04 s
[shellcheck] source root is ShellCheck-0.11.0
1603.05 s
[shellcheck] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "ShellCheck-0.11.0/test/shellcheck.hs"
1603.05 s
[shellcheck] Phase: patchPhase
1603.12 s
[shellcheck] Phase: updateAutotoolsGnuConfigScriptsPhase
1603.13 s
[unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
1603.13 s
[unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1..
1603.14 s
[shellcheck] Phase: configurePhase
1603.18 s
[shellcheck] no configure script, doing nothing
1603.18 s
[shellcheck] Phase: buildPhase
1603.19 s
[unordered-containers] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1603.25 s
[shellcheck] Phase: installPhase
1603.27 s
[shellcheck] Phase: fixupPhase
1603.29 s
[shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin
1603.30 s
[shellcheck] shrinking /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin/bin/shellcheck
1603.31 s
[shellcheck] checking for references to /build/ in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin...
1603.33 s
[shellcheck] patching script interpreter paths in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin
1603.33 s
[shellcheck] stripping (with command strip and flags -S -p) in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin/bin
1603.36 s
[shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man
1603.36 s
[shellcheck] checking for references to /build/ in /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man...
1603.36 s
[unordered-containers]
1603.36 s
[unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning : [ GHC-53692 ] [ -Wdeprecated-flags ]
1603.36 s
[unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
1603.37 s
[unordered-containers] |
1603.37 s
[unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
1603.37 s
[unordered-containers] | ^^^^^^^^^^
1603.37 s
[shellcheck] gzipping man pages under /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man/share/man/
1603.38 s
[shellcheck] patching script interpreter paths in /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man
1603.38 s
[shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc
1603.38 s
[shellcheck] checking for references to /build/ in /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc...
1603.39 s
[shellcheck] patching script interpreter paths in /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc
1603.39 s
[shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0
1603.40 s
[shellcheck] checking for references to /build/ in /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0...
1603.40 s
[shellcheck] patching script interpreter paths in /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0
1603.47 s
[shellcheck:post-build] Uploading to cachix cache "sellout": /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0 /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man
1603.91 s
[shellcheck:post-build] Nothing to push - all store paths are already on Cachix.
1603.92 s
[shellcheck:post-build] Uploading to the NixCI cache: /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0 /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man
1603.97 s
[shellcheck:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1604.00 s
[shellcheck:post-build] copying 1 paths...
1604.00 s
[shellcheck:post-build] copying path '/nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin' to 'https://cache.nix-ci.com'...
1606.42 s
[shellcheck:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1606.57 s
[shellcheck:post-build] copying 0 paths...
1606.62 s
Progress: 28 of 38 built (1 building), 559 of 559 downloaded from cache
1606.67 s
Building /nix/store/na71b1qblfcv0x84nz68yybh61b6qjlv-bash-language-server-5.6.0.drv
1606.67 s
[unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
1606.67 s
[unordered-containers]
1606.67 s
[unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning : [ GHC-66111 ] [ -Wunused-imports ]
1606.68 s
[unordered-containers] The import of ‘Control.Applicative’ is redundant
1606.68 s
[unordered-containers] except perhaps to import instances from ‘Control.Applicative’
1606.68 s
[unordered-containers] To import instances alone, use: import Control.Applicative()
1606.68 s
[unordered-containers] |
1606.68 s
[unordered-containers] 83 | import Control.Applicative (liftA2)
1606.68 s
[unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1606.68 s
[unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
1606.68 s
[unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
1606.68 s
[unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
1606.68 s
[unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
1606.68 s
[unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
1606.68 s
[unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
1606.68 s
[unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
1606.68 s
[unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
1606.68 s
[unordered-containers] Haddock coverage:
1606.68 s
[unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
1606.68 s
[unordered-containers] Missing documentation for:
1606.68 s
[unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
1606.68 s
[unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
1606.68 s
[unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
1606.68 s
[unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
1606.68 s
[unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
1606.68 s
[unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
1606.68 s
[unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
1606.68 s
[unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
1606.68 s
[unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
1606.68 s
[unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
1606.68 s
[unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
1606.68 s
[unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
1606.68 s
[unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
1606.68 s
[unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
1606.68 s
[unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
1606.68 s
[unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
1606.68 s
[unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
1606.68 s
[unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
1606.68 s
[unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
1606.68 s
[unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
1606.68 s
[unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
1606.68 s
[unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
1606.68 s
[unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
1606.68 s
[unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
1606.68 s
[unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
1606.68 s
[unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
1606.68 s
[unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
1606.68 s
[unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
1606.68 s
[unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
1606.68 s
[unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
1606.68 s
[unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
1606.68 s
[unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
1606.68 s
[unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
1606.68 s
[unordered-containers] Missing documentation for:
1606.68 s
[unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
1606.68 s
[unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
1606.68 s
[unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
1606.68 s
[unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
1606.68 s
[unordered-containers] * at Data/HashMap/Internal.hs:227:7
1606.68 s
[unordered-containers] * at Data/HashMap/Internal.hs:187:1
1606.68 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1606.68 s
[unordered-containers] by specifying the type/value namespace explicitly.
1606.68 s
[unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
1606.68 s
[unordered-containers] Warning: 'at' is out of scope.
1606.68 s
[unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
1606.68 s
[unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
1606.68 s
[unordered-containers] Missing documentation for:
1606.68 s
[unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
1606.68 s
[unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1859)
1606.68 s
[unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
1606.68 s
[unordered-containers] equalKeys (Data/HashMap/Internal.hs:513)
1606.68 s
[unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:497)
1606.68 s
[unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:680)
1606.68 s
[unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
1606.68 s
[unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:662)
1606.68 s
[unordered-containers] insert' (Data/HashMap/Internal.hs:808)
1606.68 s
[unordered-containers] delete' (Data/HashMap/Internal.hs:1126)
1606.68 s
[unordered-containers] insertNewKey (Data/HashMap/Internal.hs:850)
1606.68 s
[unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:885)
1606.68 s
[unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
1606.68 s
[unordered-containers] Missing documentation for:
1606.68 s
[unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
1606.68 s
[unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
1606.68 s
[unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
1606.68 s
[unordered-containers] Warning: 'lookup' is out of scope.
1606.68 s
[unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
1606.68 s
[unordered-containers] Warning: 'at' is out of scope.
1606.68 s
[unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
1606.68 s
[unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
1606.68 s
[unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
1606.68 s
[unordered-containers] * at Data/HashSet/Internal.hs:112:21
1606.68 s
[unordered-containers] * at Data/HashSet/Internal.hs:112:1
1606.68 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1606.68 s
[unordered-containers] by specifying the type/value namespace explicitly.
1606.68 s
[unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
1606.68 s
[unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
1606.68 s
[unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
1606.68 s
[unordered-containers] * at Data/HashSet/Internal.hs:112:21
1606.68 s
[unordered-containers] * at Data/HashSet/Internal.hs:112:1
1606.68 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1606.68 s
[unordered-containers] by specifying the type/value namespace explicitly.
1606.68 s
[unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
1606.68 s
[unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
1606.68 s
[unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
1606.68 s
[unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
1606.68 s
[unordered-containers] Warning: Data.HashMap.Internal: could not find link destinations for:
1606.68 s
[unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
1606.68 s
[unordered-containers] Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
1606.68 s
[unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
1606.68 s
[unordered-containers] Warning: Data.HashSet.Internal: could not find link destinations for:
1606.68 s
[unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
1606.68 s
[unordered-containers] Warning: Data.HashSet: could not find link destinations for:
1606.68 s
[unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
1606.68 s
[unordered-containers] Warning: Data.HashMap.Strict: could not find link destinations for:
1606.68 s
[unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
1606.68 s
[unordered-containers] Warning: Data.HashMap.Lazy: could not find link destinations for:
1606.68 s
[unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
1606.71 s
[bash-language-server] Using versionCheckHook
1606.75 s
[bash-language-server] Phase: unpackPhase
1606.76 s
[bash-language-server] unpacking source archive /nix/store/lxydhrakpk9ccbjzavdgm3f3imkypnw2-source
1606.79 s
[bash-language-server] source root is source
1606.80 s
[bash-language-server] Phase: patchPhase
1606.81 s
[bash-language-server] Phase: updateAutotoolsGnuConfigScriptsPhase
1606.82 s
[bash-language-server] Phase: configurePhase
1606.83 s
[bash-language-server] no configure script, doing nothing
1606.83 s
[bash-language-server] Executing pnpmConfigHook
1607.39 s
[bash-language-server] Found 'pnpm' with version '10.28.0'
1607.39 s
[bash-language-server] Using fetcherVersion: 3
1607.39 s
[bash-language-server] Configuring pnpm store
1607.81 s
[bash-language-server] /build /build/source
1608.17 s
[bash-language-server] /build/source
1608.73 s
[bash-language-server] Installing dependencies
1608.88 s
[unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
1608.88 s
[unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
1608.95 s
[unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
1608.96 s
[unordered-containers] Phase: installPhase
1609.02 s
[unordered-containers] Installing library in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
1609.09 s
[bash-language-server] Lockfile is up to date, resolution step is skipped
1609.12 s
[bash-language-server] Progress: resolved 1 , reused 0 , downloaded 0 , added 0
1609.17 s
[bash-language-server] . | +416
1609.17 s
[bash-language-server] Progress: resolved 1 , reused 0 , downloaded 0 , added 0
1609.32 s
[bash-language-server] Progress: resolved 416 , reused 244 , downloaded 0 , added 0
1609.43 s
[unordered-containers] Phase: fixupPhase
1609.45 s
[unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1
1609.45 s
[unordered-containers] shrinking /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSunordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78-ghc9.8.4.so
1609.48 s
[unordered-containers] checking for references to /build/ in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1...
1609.50 s
[unordered-containers] patching script interpreter paths in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1
1609.50 s
[unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib
1609.52 s
[bash-language-server] Progress: resolved 416 , reused 416 , downloaded 0 , added 224
1609.64 s
[unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc
1609.65 s
[unordered-containers] checking for references to /build/ in /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc...
1609.68 s
[unordered-containers] patching script interpreter paths in /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc
1609.81 s
[unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1
1610.18 s
[unordered-containers:post-build] Nothing to push - all store paths are already on Cachix.
1610.20 s
[unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1
1610.25 s
[unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1610.29 s
[unordered-containers:post-build] copying 1 paths...
1610.29 s
[unordered-containers:post-build] copying path '/nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
1612.75 s
[unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1612.82 s
[unordered-containers:post-build] copying 0 paths...
1612.84 s
Progress: 29 of 38 built (1 building), 559 of 559 downloaded from cache
1612.90 s
Building /nix/store/c1cwys0z767qcz2bh7ipnhm9pcrxdypk-quickcheck-instances-0.3.33.drv
1612.90 s
[bash-language-server] Progress: resolved 416 , reused 416 , downloaded 0 , added 413
1612.90 s
[bash-language-server] Progress: resolved 416 , reused 416 , downloaded 0 , added 416 , done
1612.90 s
[bash-language-server] Done in 1.2s using pnpm v10.28.0
1612.90 s
[bash-language-server] Patching scripts
1612.90 s
[bash-language-server] patching script interpreter paths in node_modules/@types node_modules/@typescript-eslint node_modules/cross-spawn node_modules/eslint node_modules/eslint-config-prettier node_modules/eslint-plugin-jest node_modules/eslint-plugin-prettier node_modules/eslint-plugin-simple-import-sort node_modules/eslint-plugin-sort-class-members node_modules/jest node_modules/prettier node_modules/ts-jest node_modules/typescript node_modules/vscode-languageserver node_modules/vscode-languageserver-textdocument node_modules/.bin node_modules/.modules.yaml node_modules/.pnpm node_modules/.pnpm-workspace-state-v1.json
1612.90 s
[bash-language-server] node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.bin/eslint-config-prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.bin/ts-jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.bin/installServerIntoExtension: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.bin/jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.bin/prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/eslint-config-prettier@9.1.0_eslint@8.57.1/node_modules/eslint-config-prettier/bin/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.90 s
[bash-language-server] node_modules/.pnpm/eslint-config-prettier@9.1.0_eslint@8.57.1/node_modules/eslint-config-prettier/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/istanbul-lib-instrument@6.0.0/node_modules/istanbul-lib-instrument/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/istanbul-lib-instrument@6.0.0/node_modules/istanbul-lib-instrument/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/exit@0.1.2/node_modules/exit/test/fixtures/create-files.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/bash"
1612.90 s
[bash-language-server] node_modules/.pnpm/@typescript-eslint+type-utils@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/type-utils/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/@typescript-eslint+type-utils@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/type-utils/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/@typescript-eslint+type-utils@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/type-utils/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/editorconfig@2.0.1/node_modules/editorconfig/bin/editorconfig: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.90 s
[bash-language-server] node_modules/.pnpm/editorconfig@2.0.1/node_modules/editorconfig/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/esprima@4.0.1/node_modules/esprima/bin/esvalidate.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.90 s
[bash-language-server] node_modules/.pnpm/esprima@4.0.1/node_modules/esprima/bin/esparse.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.90 s
[bash-language-server] node_modules/.pnpm/import-local@3.1.0/node_modules/import-local/fixtures/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.90 s
[bash-language-server] node_modules/.pnpm/ejs@3.1.10/node_modules/ejs/bin/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.90 s
[bash-language-server] node_modules/.pnpm/ejs@3.1.10/node_modules/ejs/node_modules/.bin/jake: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/make-dir@3.1.0/node_modules/make-dir/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/@typescript-eslint+utils@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/utils/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/flat-cache@3.0.4/node_modules/flat-cache/node_modules/.bin/rimraf: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/@babel+parser@7.22.6/node_modules/@babel/parser/bin/babel-parser.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.90 s
[bash-language-server] node_modules/.pnpm/eslint-plugin-jest@28.11.0_@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+p_bba564ecab3f9dda53acf7b3e4516a01/node_modules/eslint-plugin-jest/node_modules/.bin/jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/eslint-plugin-jest@28.11.0_@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+p_bba564ecab3f9dda53acf7b3e4516a01/node_modules/eslint-plugin-jest/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/@eslint+eslintrc@2.1.4/node_modules/@eslint/eslintrc/node_modules/.bin/js-yaml: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/semver@6.3.1/node_modules/semver/bin/semver.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.90 s
[bash-language-server] node_modules/.pnpm/browserslist@4.21.9/node_modules/browserslist/node_modules/.bin/update-browserslist-db: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/browserslist@4.21.9/node_modules/browserslist/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.90 s
[bash-language-server] node_modules/.pnpm/resolve@1.22.2/node_modules/resolve/bin/resolve: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.90 s
[bash-language-server] node_modules/.pnpm/@types+babel__template@7.4.1/node_modules/@types/babel__template/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/@babel+helper-compilation-targets@7.22.6_@babel+core@7.22.6/node_modules/@babel/helper-compilation-targets/node_modules/.bin/browserslist: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/@babel+helper-compilation-targets@7.22.6_@babel+core@7.22.6/node_modules/@babel/helper-compilation-targets/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/@typescript-eslint+parser@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/parser/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/@typescript-eslint+parser@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/parser/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/@typescript-eslint+parser@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/parser/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/acorn-jsx@5.3.2_acorn@8.9.0/node_modules/acorn-jsx/node_modules/.bin/acorn: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/eslint@8.57.1/node_modules/eslint/bin/eslint.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.90 s
[bash-language-server] node_modules/.pnpm/eslint@8.57.1/node_modules/eslint/node_modules/.bin/js-yaml: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.90 s
[bash-language-server] node_modules/.pnpm/@babel+template@7.22.5/node_modules/@babel/template/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/jest-snapshot@29.7.0/node_modules/jest-snapshot/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/espree@9.6.1/node_modules/espree/node_modules/.bin/acorn: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/istanbul-lib-instrument@5.2.1/node_modules/istanbul-lib-instrument/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/istanbul-lib-instrument@5.2.1/node_modules/istanbul-lib-instrument/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/@babel+core@7.22.6/node_modules/@babel/core/node_modules/.bin/json5: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/@babel+core@7.22.6/node_modules/@babel/core/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/@babel+core@7.22.6/node_modules/@babel/core/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/json5@2.2.3/node_modules/json5/lib/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.91 s
[bash-language-server] node_modules/.pnpm/@babel+generator@7.23.0/node_modules/@babel/generator/node_modules/.bin/jsesc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/jest-resolve@29.7.0/node_modules/jest-resolve/node_modules/.bin/resolve: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/@types+babel__core@7.20.1/node_modules/@types/babel__core/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/update-browserslist-db@1.0.11_browserslist@4.21.9/node_modules/update-browserslist-db/node_modules/.bin/browserslist: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/update-browserslist-db@1.0.11_browserslist@4.21.9/node_modules/update-browserslist-db/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.91 s
[bash-language-server] node_modules/.pnpm/typescript@5.6.3/node_modules/typescript/bin/tsc: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.91 s
[bash-language-server] node_modules/.pnpm/typescript@5.6.3/node_modules/typescript/bin/tsserver: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.91 s
[bash-language-server] node_modules/.pnpm/acorn@8.9.0/node_modules/acorn/bin/acorn: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.91 s
[bash-language-server] node_modules/.pnpm/rimraf@3.0.2/node_modules/rimraf/bin.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.91 s
[bash-language-server] node_modules/.pnpm/which@2.0.2/node_modules/which/bin/node-which: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.91 s
[bash-language-server] node_modules/.pnpm/create-jest@29.7.0_@types+node@18.19.86/node_modules/create-jest/bin/create-jest.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.91 s
[bash-language-server] node_modules/.pnpm/@babel+parser@7.23.0/node_modules/@babel/parser/bin/babel-parser.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.91 s
[bash-language-server] node_modules/.pnpm/eslint-plugin-sort-class-members@1.21.0_eslint@8.57.1/node_modules/eslint-plugin-sort-class-members/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/cross-spawn@7.0.6/node_modules/cross-spawn/node_modules/.bin/node-which: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/@typescript-eslint+typescript-estree@7.18.0_typescript@5.6.3/node_modules/@typescript-eslint/typescript-estree/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/@typescript-eslint+typescript-estree@7.18.0_typescript@5.6.3/node_modules/@typescript-eslint/typescript-estree/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/@typescript-eslint+typescript-estree@7.18.0_typescript@5.6.3/node_modules/@typescript-eslint/typescript-estree/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/jest@29.7.0_@types+node@18.19.86/node_modules/jest/bin/jest.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.91 s
[bash-language-server] node_modules/.pnpm/jest@29.7.0_@types+node@18.19.86/node_modules/jest/node_modules/.bin/import-local-fixture: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/jest@29.7.0_@types+node@18.19.86/node_modules/jest/node_modules/.bin/jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/semver@7.7.1/node_modules/semver/bin/semver.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.91 s
[bash-language-server] node_modules/.pnpm/eslint-plugin-simple-import-sort@12.1.1_eslint@8.57.1/node_modules/eslint-plugin-simple-import-sort/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/ts-api-utils@1.3.0_typescript@5.6.3/node_modules/ts-api-utils/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/ts-api-utils@1.3.0_typescript@5.6.3/node_modules/ts-api-utils/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/js-yaml@4.1.0/node_modules/js-yaml/bin/js-yaml.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.91 s
[bash-language-server] node_modules/.pnpm/js-yaml@3.14.1/node_modules/js-yaml/bin/js-yaml.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.91 s
[bash-language-server] node_modules/.pnpm/js-yaml@3.14.1/node_modules/js-yaml/node_modules/.bin/esparse: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/js-yaml@3.14.1/node_modules/js-yaml/node_modules/.bin/esvalidate: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.91 s
[bash-language-server] node_modules/.pnpm/@istanbuljs+load-nyc-config@1.1.0/node_modules/@istanbuljs/load-nyc-config/node_modules/.bin/js-yaml: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.92 s
[bash-language-server] node_modules/.pnpm/@babel+traverse@7.23.2/node_modules/@babel/traverse/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.93 s
[bash-language-server] node_modules/.pnpm/prettier@2.8.8/node_modules/prettier/bin-prettier.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.94 s
[bash-language-server] node_modules/.pnpm/@nicolo-ribaudo+semver-v6@6.3.3/node_modules/@nicolo-ribaudo/semver-v6/bin/semver.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1612.96 s
[bash-language-server] node_modules/.pnpm/@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+parser@7.18.0_eslint@8.57.1__e6014347be2ddc1aabad24015a3e65d1/node_modules/@typescript-eslint/eslint-plugin/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.97 s
[bash-language-server] node_modules/.pnpm/@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+parser@7.18.0_eslint@8.57.1__e6014347be2ddc1aabad24015a3e65d1/node_modules/@typescript-eslint/eslint-plugin/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1612.99 s
[bash-language-server] node_modules/.pnpm/@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+parser@7.18.0_eslint@8.57.1__e6014347be2ddc1aabad24015a3e65d1/node_modules/@typescript-eslint/eslint-plugin/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.00 s
[bash-language-server] node_modules/.pnpm/eslint-plugin-prettier@4.2.1_eslint-config-prettier@9.1.0_eslint@8.57.1__eslint@8.57.1_prettier@2.8.8/node_modules/eslint-plugin-prettier/node_modules/.bin/eslint-config-prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.01 s
[bash-language-server] node_modules/.pnpm/eslint-plugin-prettier@4.2.1_eslint-config-prettier@9.1.0_eslint@8.57.1__eslint@8.57.1_prettier@2.8.8/node_modules/eslint-plugin-prettier/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.02 s
[bash-language-server] node_modules/.pnpm/eslint-plugin-prettier@4.2.1_eslint-config-prettier@9.1.0_eslint@8.57.1__eslint@8.57.1_prettier@2.8.8/node_modules/eslint-plugin-prettier/node_modules/.bin/prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.03 s
[bash-language-server] node_modules/.pnpm/@eslint-community+eslint-utils@4.4.0_eslint@8.57.1/node_modules/@eslint-community/eslint-utils/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.04 s
[bash-language-server] node_modules/.pnpm/vscode-languageserver@8.0.2/node_modules/vscode-languageserver/bin/installServerIntoExtension: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1613.05 s
[bash-language-server] node_modules/.pnpm/jest-cli@29.7.0_@types+node@18.19.86/node_modules/jest-cli/bin/jest.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1613.06 s
[quickcheck-instances] Phase: setupCompilerEnvironmentPhase
1613.06 s
[bash-language-server] node_modules/.pnpm/jest-cli@29.7.0_@types+node@18.19.86/node_modules/jest-cli/node_modules/.bin/import-local-fixture: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.07 s
[quickcheck-instances] Build with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
1613.07 s
[bash-language-server] node_modules/.pnpm/jest-cli@29.7.0_@types+node@18.19.86/node_modules/jest-cli/node_modules/.bin/create-jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.09 s
[bash-language-server] node_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.10 s
[bash-language-server] node_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.11 s
[bash-language-server] node_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/json5: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.13 s
[bash-language-server] node_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.14 s
[bash-language-server] node_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.15 s
[bash-language-server] node_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/ejs: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.16 s
[bash-language-server] node_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1613.17 s
[bash-language-server] node_modules/.pnpm/jsesc@2.5.2/node_modules/jsesc/bin/jsesc: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1613.18 s
[bash-language-server] node_modules/.pnpm/jake@10.9.2/node_modules/jake/bin/bash_completion.sh: interpreter directive changed from "#!/bin/bash" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/bash"
1613.19 s
[bash-language-server] node_modules/.pnpm/jake@10.9.2/node_modules/jake/bin/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
1613.20 s
[bash-language-server] node_modules/.pnpm/@babel+generator@7.22.5/node_modules/@babel/generator/node_modules/.bin/jsesc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.21 s
[bash-language-server] node_modules/.pnpm/@babel+template@7.22.15/node_modules/@babel/template/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1613.22 s
[bash-language-server] Finished pnpmConfigHook
1613.22 s
[bash-language-server] Phase: buildPhase
1613.27 s
[quickcheck-instances] Phase: unpackPhase
1613.28 s
[quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
1613.29 s
[quickcheck-instances] source root is quickcheck-instances-0.3.33
1613.29 s
[quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
1613.30 s
[quickcheck-instances] Phase: patchPhase
1613.30 s
[quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
1613.31 s
[quickcheck-instances] Phase: compileBuildDriverPhase
1613.31 s
[quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.UzC5wXVn3L/setup-package.conf.d -threaded
1613.35 s
[quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.UzC5wXVn3L/Main.o )
1613.42 s
[quickcheck-instances] [2 of 2] Linking Setup
1613.53 s
[bash-language-server]
1613.53 s
[bash-language-server] > @ compile /build/source
1613.53 s
[bash-language-server] > tsc -b server
1613.53 s
[bash-language-server]
1614.95 s
[quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
1614.96 s
[quickcheck-instances] Phase: configurePhase
1614.99 s
[quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.UzC5wXVn3L/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
1614.99 s
[quickcheck-instances] Using Parsec parser
1614.99 s
[quickcheck-instances] Configuring quickcheck-instances-0.3.33...
1615.34 s
[quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
1615.34 s
[quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
1615.34 s
[quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
1615.34 s
[quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.19.2.0
1615.34 s
[quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.1.0
1615.34 s
[quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
1615.34 s
[quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.8
1615.34 s
[quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
1615.34 s
[quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
1615.34 s
[quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
1615.34 s
[quickcheck-instances] integer-logarithms-1.0.4
1615.34 s
[quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
1615.34 s
[quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
1615.34 s
[quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
1615.34 s
[quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
1615.34 s
[quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
1615.34 s
[quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
1615.34 s
[quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.1
1615.34 s
[quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
1615.34 s
[quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
1615.34 s
[quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
1615.34 s
[quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.0
1615.34 s
[quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
1615.35 s
[quickcheck-instances] unordered-containers-0.2.20.1
1615.35 s
[quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
1615.35 s
[quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
1615.35 s
[quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
1615.35 s
[quickcheck-instances] Dependency base: using base-4.19.2.0
1615.35 s
[quickcheck-instances] Dependency containers: using containers-0.6.8
1615.35 s
[quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
1615.35 s
[quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
1615.35 s
[quickcheck-instances] Dependency tagged: using tagged-0.8.9
1615.35 s
[quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
1615.48 s
[bash-language-server] Phase: installPhase
1615.65 s
[quickcheck-instances] Source component graph:
1615.65 s
[quickcheck-instances] component lib
1615.65 s
[quickcheck-instances] component test:self-test dependency lib
1615.65 s
[quickcheck-instances] Configured component graph:
1615.65 s
[quickcheck-instances] component quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
1615.65 s
[quickcheck-instances] include OneTuple-0.4.2-3dnbGs3iswl7RfPlzcJwqJ
1615.65 s
[quickcheck-instances] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1615.65 s
[quickcheck-instances] include array-0.5.8.0-cf4f
1615.65 s
[quickcheck-instances] include base-4.19.2.0-8274
1615.65 s
[quickcheck-instances] include bytestring-0.12.1.0-b028
1615.65 s
[quickcheck-instances] include case-insensitive-1.2.1.0-A80fjc7bt7F8zyu1Co3PYR
1615.65 s
[quickcheck-instances] include containers-0.6.8-15d9
1615.65 s
[quickcheck-instances] include data-fix-0.3.4-360QE3oeLg37mRDz4E1QQM
1615.65 s
[quickcheck-instances] include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
1615.65 s
[quickcheck-instances] include integer-logarithms-1.0.4-agSqjWr09W26NT8ma47bp
1615.65 s
[quickcheck-instances] include old-time-1.1.0.4-D73MxqqL3KfK08Nc3LLQEf
1615.65 s
[quickcheck-instances] include primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
1615.65 s
[quickcheck-instances] include scientific-0.3.8.0-GUBWFK4PPRa6pHV2jzXM87
1615.65 s
[quickcheck-instances] include splitmix-0.1.3.1-Ap5ujF9ygfC1hmiXTupD1c
1615.65 s
[quickcheck-instances] include strict-0.5.1-CPTwyWVhsgEFcK4y38LphJ
1615.65 s
[quickcheck-instances] include tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
1615.65 s
[quickcheck-instances] include text-2.1.1-5314
1615.65 s
[quickcheck-instances] include text-short-0.1.6-DjkPcCVpjvo6ni5Bq060rV
1615.65 s
[quickcheck-instances] include these-1.2.1-ARnkrz7xAAq8aGkU9KnuYZ
1615.65 s
[quickcheck-instances] include time-compat-1.9.8-9ETWUZXGnzD3oVa6CRabZ
1615.65 s
[quickcheck-instances] include transformers-0.6.1.0-388b
1615.65 s
[quickcheck-instances] include unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
1615.65 s
[quickcheck-instances] include uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
1615.65 s
[quickcheck-instances] include vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
1615.65 s
[quickcheck-instances] component quickcheck-instances-0.3.33-DxDfyIwBSY3GtIh6NSz4ux-self-test
1615.65 s
[quickcheck-instances] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1615.65 s
[quickcheck-instances] include base-4.19.2.0-8274
1615.65 s
[quickcheck-instances] include containers-0.6.8-15d9
1615.65 s
[quickcheck-instances] include primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
1615.65 s
[quickcheck-instances] include quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
1615.65 s
[quickcheck-instances] include tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
1615.65 s
[quickcheck-instances] include uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
1615.65 s
[quickcheck-instances] Linked component graph:
1615.65 s
[quickcheck-instances] unit quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
1615.65 s
[quickcheck-instances] include OneTuple-0.4.2-3dnbGs3iswl7RfPlzcJwqJ
1615.65 s
[quickcheck-instances] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1615.65 s
[quickcheck-instances] include array-0.5.8.0-cf4f
1615.65 s
[quickcheck-instances] include base-4.19.2.0-8274
1615.65 s
[quickcheck-instances] include bytestring-0.12.1.0-b028
1615.65 s
[quickcheck-instances] include case-insensitive-1.2.1.0-A80fjc7bt7F8zyu1Co3PYR
1615.65 s
[quickcheck-instances] include containers-0.6.8-15d9
1615.65 s
[quickcheck-instances] include data-fix-0.3.4-360QE3oeLg37mRDz4E1QQM
1615.65 s
[quickcheck-instances] include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
1615.65 s
[quickcheck-instances] include integer-logarithms-1.0.4-agSqjWr09W26NT8ma47bp
1615.65 s
[quickcheck-instances] include old-time-1.1.0.4-D73MxqqL3KfK08Nc3LLQEf
1615.65 s
[quickcheck-instances] include primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
1615.65 s
[quickcheck-instances] include scientific-0.3.8.0-GUBWFK4PPRa6pHV2jzXM87
1615.65 s
[quickcheck-instances] include splitmix-0.1.3.1-Ap5ujF9ygfC1hmiXTupD1c
1615.65 s
[quickcheck-instances] include strict-0.5.1-CPTwyWVhsgEFcK4y38LphJ
1615.65 s
[quickcheck-instances] include tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
1615.65 s
[quickcheck-instances] include text-2.1.1-5314
1615.65 s
[quickcheck-instances] include text-short-0.1.6-DjkPcCVpjvo6ni5Bq060rV
1615.65 s
[quickcheck-instances] include these-1.2.1-ARnkrz7xAAq8aGkU9KnuYZ
1615.65 s
[quickcheck-instances] include time-compat-1.9.8-9ETWUZXGnzD3oVa6CRabZ
1615.65 s
[quickcheck-instances] include transformers-0.6.1.0-388b
1615.65 s
[quickcheck-instances] include unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
1615.65 s
[quickcheck-instances] include uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
1615.65 s
[quickcheck-instances] include vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
1615.65 s
[quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Void
1615.66 s
[quickcheck-instances] unit quickcheck-instances-0.3.33-DxDfyIwBSY3GtIh6NSz4ux-self-test
1615.66 s
[quickcheck-instances] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1615.66 s
[quickcheck-instances] include base-4.19.2.0-8274
1615.66 s
[quickcheck-instances] include containers-0.6.8-15d9
1615.66 s
[quickcheck-instances] include primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
1615.66 s
[quickcheck-instances] include quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
1615.66 s
[quickcheck-instances] include tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
1615.66 s
[quickcheck-instances] include uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
1615.66 s
[quickcheck-instances] Ready component graph:
1615.66 s
[quickcheck-instances] definite quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
1615.66 s
[quickcheck-instances] depends OneTuple-0.4.2-3dnbGs3iswl7RfPlzcJwqJ
1615.66 s
[quickcheck-instances] depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1615.66 s
[quickcheck-instances] depends array-0.5.8.0-cf4f
1615.66 s
[quickcheck-instances] depends base-4.19.2.0-8274
1615.66 s
[quickcheck-instances] depends bytestring-0.12.1.0-b028
1615.66 s
[quickcheck-instances] depends case-insensitive-1.2.1.0-A80fjc7bt7F8zyu1Co3PYR
1615.66 s
[quickcheck-instances] depends containers-0.6.8-15d9
1615.66 s
[quickcheck-instances] depends data-fix-0.3.4-360QE3oeLg37mRDz4E1QQM
1615.66 s
[quickcheck-instances] depends hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
1615.66 s
[quickcheck-instances] depends integer-logarithms-1.0.4-agSqjWr09W26NT8ma47bp
1615.66 s
[quickcheck-instances] depends old-time-1.1.0.4-D73MxqqL3KfK08Nc3LLQEf
1615.66 s
[quickcheck-instances] depends primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
1615.66 s
[quickcheck-instances] depends scientific-0.3.8.0-GUBWFK4PPRa6pHV2jzXM87
1615.66 s
[quickcheck-instances] depends splitmix-0.1.3.1-Ap5ujF9ygfC1hmiXTupD1c
1615.66 s
[quickcheck-instances] depends strict-0.5.1-CPTwyWVhsgEFcK4y38LphJ
1615.66 s
[quickcheck-instances] depends tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
1615.66 s
[quickcheck-instances] depends text-2.1.1-5314
1615.66 s
[quickcheck-instances] depends text-short-0.1.6-DjkPcCVpjvo6ni5Bq060rV
1615.66 s
[quickcheck-instances] depends these-1.2.1-ARnkrz7xAAq8aGkU9KnuYZ
1615.66 s
[quickcheck-instances] depends time-compat-1.9.8-9ETWUZXGnzD3oVa6CRabZ
1615.66 s
[quickcheck-instances] depends transformers-0.6.1.0-388b
1615.66 s
[quickcheck-instances] depends unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
1615.66 s
[quickcheck-instances] depends uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
1615.66 s
[quickcheck-instances] depends vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
1615.66 s
[quickcheck-instances] definite quickcheck-instances-0.3.33-DxDfyIwBSY3GtIh6NSz4ux-self-test
1615.66 s
[quickcheck-instances] depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1615.66 s
[quickcheck-instances] depends base-4.19.2.0-8274
1615.66 s
[quickcheck-instances] depends containers-0.6.8-15d9
1615.68 s
[quickcheck-instances] depends primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
1615.68 s
[quickcheck-instances] depends quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
1615.68 s
[quickcheck-instances] depends tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
1615.68 s
[quickcheck-instances] depends uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
1615.68 s
[quickcheck-instances] Using Cabal-3.10.3.0 compiled by ghc-9.8
1615.68 s
[quickcheck-instances] Using compiler: ghc-9.8.4
1615.68 s
[quickcheck-instances] Using install prefix:
1615.68 s
[quickcheck-instances] /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33
1615.68 s
[quickcheck-instances] Executables installed in:
1615.68 s
[quickcheck-instances] /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/bin
1615.68 s
[quickcheck-instances] Libraries installed in:
1615.68 s
[quickcheck-instances] /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
1615.68 s
[quickcheck-instances] Dynamic Libraries installed in:
1615.68 s
[quickcheck-instances] /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
1615.68 s
[quickcheck-instances] Private executables installed in:
1615.68 s
[quickcheck-instances] /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33
1615.68 s
[quickcheck-instances] Data files installed in:
1615.68 s
[quickcheck-instances] /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33
1615.68 s
[quickcheck-instances] Documentation installed in:
1615.68 s
[quickcheck-instances] /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
1615.68 s
[quickcheck-instances] Configuration files installed in:
1615.68 s
[quickcheck-instances] /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/etc
1615.68 s
[quickcheck-instances] No alex found
1615.68 s
[quickcheck-instances] Using ar found on system at:
1615.68 s
[quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
1615.68 s
[quickcheck-instances] No c2hs found
1615.68 s
[quickcheck-instances] No cpphs found
1615.68 s
[quickcheck-instances] No doctest found
1615.68 s
[quickcheck-instances] Using gcc version 14.3.0 given by user at:
1615.68 s
[quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
1615.68 s
[quickcheck-instances] Using ghc version 9.8.4 found on system at:
1615.68 s
[quickcheck-instances] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
1615.68 s
[quickcheck-instances] Using ghc-pkg version 9.8.4 found on system at:
1615.68 s
[quickcheck-instances] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
1615.68 s
[quickcheck-instances] No ghcjs found
1615.68 s
[quickcheck-instances] No ghcjs-pkg found
1615.68 s
[quickcheck-instances] No greencard found
1615.68 s
[quickcheck-instances] Using haddock version 2.30.0 found on system at:
1615.68 s
[quickcheck-instances] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
1615.68 s
[quickcheck-instances] No happy found
1615.68 s
[quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
1615.68 s
[quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1615.68 s
[quickcheck-instances] No hmake found
1615.68 s
[quickcheck-instances] Using hpc version 0.69 found on system at:
1615.68 s
[quickcheck-instances] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
1615.68 s
[quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
1615.68 s
[quickcheck-instances] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
1615.68 s
[quickcheck-instances] Using hscolour version 1.25 found on system at:
1615.68 s
[quickcheck-instances] /nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
1615.68 s
[quickcheck-instances] No jhc found
1615.68 s
[quickcheck-instances] Using ld found on system at:
1615.68 s
[quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
1615.69 s
[quickcheck-instances] No pkg-config found
1615.69 s
[quickcheck-instances] Using runghc version 9.8.4 found on system at:
1615.69 s
[quickcheck-instances] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
1615.69 s
[quickcheck-instances] Using strip version 2.44 found on system at:
1615.69 s
[quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
1615.69 s
[quickcheck-instances] Using tar found on system at:
1615.69 s
[quickcheck-instances] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
1615.69 s
[quickcheck-instances] No uhc found
1615.87 s
[bash-language-server] Lockfile is up to date, resolution step is skipped
1615.90 s
[bash-language-server] Already up to date
1615.93 s
[quickcheck-instances] Phase: buildPhase
1616.01 s
[quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
1616.03 s
[quickcheck-instances] Building library for quickcheck-instances-0.3.33..
1616.56 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 )
1616.80 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 )
1616.82 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 )
1616.84 s
[bash-language-server]
1616.84 s
[bash-language-server] devDependencies:
1616.84 s
[bash-language-server] - @types/jest 29.5.14
1616.84 s
[bash-language-server] - @types/node 18.19.86
1616.84 s
[bash-language-server] - @typescript-eslint/eslint-plugin 7.18.0
1616.84 s
[bash-language-server] - @typescript-eslint/parser 7.18.0
1616.84 s
[bash-language-server] - cross-spawn 7.0.6
1616.84 s
[bash-language-server] - eslint 8.57.1
1616.84 s
[bash-language-server] - eslint-config-prettier 9.1.0
1616.84 s
[bash-language-server] - eslint-plugin-jest 28.11.0
1616.84 s
[bash-language-server] - eslint-plugin-prettier 4.2.1
1616.84 s
[bash-language-server] - eslint-plugin-simple-import-sort 12.1.1
1616.84 s
[bash-language-server] - eslint-plugin-sort-class-members 1.21.0
1616.84 s
[bash-language-server] - jest 29.7.0
1616.84 s
[bash-language-server] - prettier 2.8.8
1616.84 s
[bash-language-server] - ts-jest 29.3.2
1616.85 s
[bash-language-server] - typescript 5.6.3
1616.85 s
[bash-language-server] - vscode-languageserver 8.0.2
1616.85 s
[bash-language-server] - vscode-languageserver-textdocument 1.0.12
1616.85 s
[bash-language-server]
1617.10 s
[bash-language-server] Phase: fixupPhase
1617.10 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 )
1617.12 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 )
1617.12 s
[bash-language-server] shrinking RPATHs of ELF executables and libraries in /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0
1617.26 s
[bash-language-server] shrinking /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/bin/bash-language-server
1617.26 s
[bash-language-server] checking for references to /build/ in /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0...
1617.40 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 )
1617.40 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 )
1617.40 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 )
1617.40 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 )
1617.40 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 )
1617.40 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 )
1617.40 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 )
1617.40 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 )
1617.40 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 )
1617.40 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 )
1617.42 s
[bash-language-server] patching script interpreter paths in /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0
1617.43 s
[bash-language-server] /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/lib/bash-language-server/server/node_modules/.bin/installServerIntoExtension: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1617.44 s
[bash-language-server] /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/lib/bash-language-server/server/node_modules/.bin/editorconfig: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
1617.45 s
[bash-language-server] /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/lib/bash-language-server/server/src/get-options.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/bash"
1617.47 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 )
1617.47 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 )
1617.47 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 )
1617.47 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 )
1617.47 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 )
1617.78 s
[bash-language-server] Phase: installCheckPhase
1617.79 s
[bash-language-server] Executing versionCheckPhase
1617.94 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 )
1617.94 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 )
1617.94 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 )
1617.94 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 )
1617.94 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 )
1617.94 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 )
1617.99 s
[bash-language-server] Did not find version 5.6.0 in the output of the command /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/bin/bash-language-server --help
1617.99 s
[bash-language-server] Usage:
1617.99 s
[bash-language-server] bash-language-server start Start listening on stdin/stdout
1617.99 s
[bash-language-server] bash-language-server -h, --help Display this help and exit
1617.99 s
[bash-language-server] bash-language-server -v, --version Print the version and exit
1617.99 s
[bash-language-server]
1617.99 s
[bash-language-server] Environment variables:
1617.99 s
[bash-language-server] BASH_IDE_LOG_LEVEL Set the log level (default: info)
1617.99 s
[bash-language-server]
1617.99 s
[bash-language-server] Further documentation: https://github.com/bash-lsp/bash-language-server
1617.99 s
[bash-language-server] (node:1257) [DEP0040] DeprecationWarning: The `punycode` module is deprecated. Please use a userland alternative instead.
1617.99 s
[bash-language-server] (Use `bash-language-server --trace-deprecation ...` to show where the warning was created)
1618.17 s
[bash-language-server] Successfully managed to find version 5.6.0 in the output of the command /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/bin/bash-language-server --version
1618.17 s
[bash-language-server] 5.6.0
1618.17 s
[bash-language-server] (node:1268) [DEP0040] DeprecationWarning: The `punycode` module is deprecated. Please use a userland alternative instead.
1618.17 s
[bash-language-server] (Use `bash-language-server --trace-deprecation ...` to show where the warning was created)
1618.17 s
[bash-language-server] Finished versionCheckPhase
1618.17 s
[bash-language-server] no Makefile or custom installCheckPhase, doing nothing
1618.53 s
[bash-language-server:post-build] Uploading to cachix cache "sellout": /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0
1618.97 s
[bash-language-server:post-build] Nothing to push - all store paths are already on Cachix.
1618.99 s
[bash-language-server:post-build] Uploading to the NixCI cache: /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0
1619.04 s
[bash-language-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1619.14 s
[bash-language-server:post-build] copying 1 paths...
1619.14 s
[bash-language-server:post-build] copying path '/nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0' to 'https://cache.nix-ci.com'...
1621.02 s
[bash-language-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1621.14 s
[bash-language-server:post-build] copying 0 paths...
1621.18 s
Progress: 30 of 38 built (1 building), 559 of 559 downloaded from cache
1621.24 s
Building /nix/store/zyxicd0liv81yslrfa6dab201msi5mja-project-manager-path-for-duoids.drv
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 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 )
1621.24 s
[quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
1621.34 s
[project-manager-path-for-duoids] created 346 symlinks in user environment
1621.41 s
[project-manager-path-for-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/1drjlq9sq4ss40gjq9fdih54yrj55abx-project-manager-path-for-duoids
1621.87 s
[project-manager-path-for-duoids:post-build] Nothing to push - all store paths are already on Cachix.
1621.89 s
[project-manager-path-for-duoids:post-build] Uploading to the NixCI cache: /nix/store/1drjlq9sq4ss40gjq9fdih54yrj55abx-project-manager-path-for-duoids
1621.94 s
[project-manager-path-for-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1621.98 s
[project-manager-path-for-duoids:post-build] copying 0 paths...
1622.03 s
[project-manager-path-for-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1622.51 s
[project-manager-path-for-duoids:post-build] copying 0 paths...
1622.53 s
Progress: 31 of 38 built (1 building), 559 of 559 downloaded from cache
1622.53 s
[quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
1622.53 s
[quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33..
1622.53 s
[quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
1622.53 s
[quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
1622.82 s
[quickcheck-instances] Phase: checkPhase
1622.85 s
[quickcheck-instances] Running 1 test suites...
1622.85 s
[quickcheck-instances] Test suite self-test: RUNNING...
1622.86 s
[quickcheck-instances] +++ OK, passed 100 tests.
1622.86 s
[quickcheck-instances] +++ OK, passed 100 tests.
1622.86 s
[quickcheck-instances] +++ OK, passed 100 tests.
1622.86 s
[quickcheck-instances] +++ OK, passed 100 tests.
1622.86 s
[quickcheck-instances] +++ OK, passed 100 tests.
1622.86 s
[quickcheck-instances] Test suite self-test: PASS
1622.86 s
[quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
1622.86 s
[quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
1622.87 s
[quickcheck-instances] Phase: haddockPhase
1622.98 s
[quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
1623.00 s
[quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33..
1623.00 s
[quickcheck-instances] Warning: The documentation for the following packages are not installed. No
1623.00 s
[quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
1623.06 s
[quickcheck-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1623.25 s
[quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
1623.26 s
[quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
1623.27 s
[quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
1623.37 s
[quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
1623.40 s
[quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
1623.42 s
[quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
1623.43 s
[quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
1623.44 s
[quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
1623.44 s
[quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
1623.47 s
[quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
1623.50 s
[quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
1623.51 s
[quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
1623.51 s
[quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
1623.61 s
[quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
1623.62 s
[quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
1623.66 s
[quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
1623.70 s
[quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
1623.71 s
[quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
1623.71 s
[quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
1623.73 s
[quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
1623.79 s
[quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
1623.82 s
[quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
1623.83 s
[quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
1623.84 s
[quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
1624.00 s
[quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
1624.01 s
[quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
1624.01 s
[quickcheck-instances] Haddock coverage:
1624.01 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
1624.01 s
[quickcheck-instances] Missing documentation for:
1624.01 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
1624.02 s
[quickcheck-instances] Missing documentation for:
1624.02 s
[quickcheck-instances] Module header
1624.02 s
[quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
1624.68 s
[quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
1624.68 s
[quickcheck-instances] - Data.Vector.Vector
1624.68 s
[quickcheck-instances] - Data.Vector.Primitive.Vector
1624.68 s
[quickcheck-instances] - Data.Vector.Storable.Vector
1624.68 s
[quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
1624.68 s
[quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
1624.68 s
[quickcheck-instances] - Data.Vector.Strict.Vector
1628.10 s
[quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
1628.10 s
[quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
1628.44 s
[quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
1628.44 s
[quickcheck-instances] Phase: installPhase
1628.44 s
[quickcheck-instances] Installing library in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
1628.65 s
[quickcheck-instances] Phase: fixupPhase
1628.66 s
[quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33
1628.68 s
[quickcheck-instances] shrinking /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSquickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW-ghc9.8.4.so
1628.69 s
[quickcheck-instances] checking for references to /build/ in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33...
1628.73 s
[quickcheck-instances] patching script interpreter paths in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33
1628.73 s
[quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib
1628.82 s
[quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc
1628.83 s
[quickcheck-instances] checking for references to /build/ in /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc...
1628.86 s
[quickcheck-instances] patching script interpreter paths in /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc
1628.98 s
[quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33
1629.42 s
[quickcheck-instances:post-build] Nothing to push - all store paths are already on Cachix.
1629.44 s
[quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33
1629.49 s
[quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1629.53 s
[quickcheck-instances:post-build] copying 1 paths...
1629.53 s
[quickcheck-instances:post-build] copying path '/nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
1630.88 s
[quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1630.96 s
[quickcheck-instances:post-build] copying 0 paths...
1630.98 s
Progress: 32 of 38 built, 559 of 559 downloaded from cache
1631.05 s
Building /nix/store/d0g8hbwhcil6pvpxfxz1sgq1ah60i8mj-extra-1.8.1.drv
1631.20 s
[extra] Phase: setupCompilerEnvironmentPhase
1631.20 s
[extra] Build with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
1631.40 s
[extra] Phase: unpackPhase
1631.41 s
[extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
1631.41 s
[extra] source root is extra-1.8.1
1631.42 s
[extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
1631.42 s
[extra] Phase: patchPhase
1631.43 s
[extra] Phase: compileBuildDriverPhase
1631.44 s
[extra] setupCompileFlags: -package-db=/build/tmp.JkPI8tbbY1/setup-package.conf.d -threaded
1631.48 s
[extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.JkPI8tbbY1/Main.o )
1631.53 s
[extra] [2 of 2] Linking Setup
1632.90 s
[extra] Phase: updateAutotoolsGnuConfigScriptsPhase
1632.91 s
[extra] Phase: configurePhase
1632.92 s
[extra] configureFlags: --verbose --prefix=/nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.JkPI8tbbY1/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
1632.92 s
[extra] Using Parsec parser
1632.92 s
[extra] Configuring extra-1.8.1...
1633.21 s
[extra] Dependency base >=4.9 && <5: using base-4.19.2.0
1633.21 s
[extra] Dependency clock >=0.7: using clock-0.8.4
1633.23 s
[extra] Dependency directory: using directory-1.3.8.5
1633.23 s
[extra] Dependency filepath: using filepath-1.4.301.0
1633.23 s
[extra] Dependency process: using process-1.6.25.0
1633.23 s
[extra] Dependency time: using time-1.12.2
1633.23 s
[extra] Dependency unix: using unix-2.8.6.0
1633.23 s
[extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
1633.23 s
[extra] Dependency base >=4 && <5: using base-4.19.2.0
1633.23 s
[extra] Dependency directory: using directory-1.3.8.5
1633.23 s
[extra] Dependency extra: using extra-1.8.1
1633.23 s
[extra] Dependency filepath: using filepath-1.4.301.0
1633.23 s
[extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
1633.23 s
[extra] Dependency unix: using unix-2.8.6.0
1633.46 s
[extra] Source component graph:
1633.46 s
[extra] component lib
1633.46 s
[extra] component test:extra-test dependency lib
1633.46 s
[extra] Configured component graph:
1633.46 s
[extra] component extra-1.8.1-EssMUQCsBco9gsyBCwwe73
1633.46 s
[extra] include base-4.19.2.0-8274
1633.46 s
[extra] include clock-0.8.4-29TfRxmWsjd5NvULEp3eBt
1633.46 s
[extra] include directory-1.3.8.5-d63d
1633.47 s
[extra] include filepath-1.4.301.0-9527
1633.47 s
[extra] include process-1.6.25.0-6fc5
1633.47 s
[extra] include time-1.12.2-b11c
1633.47 s
[extra] include unix-2.8.6.0-e528
1633.47 s
[extra] component extra-1.8.1-LV1wyo3vfOdDgOxdN7at1y-extra-test
1633.47 s
[extra] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1633.47 s
[extra] include base-4.19.2.0-8274
1633.47 s
[extra] include directory-1.3.8.5-d63d
1633.47 s
[extra] include extra-1.8.1-EssMUQCsBco9gsyBCwwe73
1633.47 s
[extra] include filepath-1.4.301.0-9527
1633.47 s
[extra] include quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
1633.47 s
[extra] include unix-2.8.6.0-e528
1633.47 s
[extra] Linked component graph:
1633.47 s
[extra] unit extra-1.8.1-EssMUQCsBco9gsyBCwwe73
1633.47 s
[extra] include base-4.19.2.0-8274
1633.47 s
[extra] include clock-0.8.4-29TfRxmWsjd5NvULEp3eBt
1633.47 s
[extra] include directory-1.3.8.5-d63d
1633.47 s
[extra] include filepath-1.4.301.0-9527
1633.47 s
[extra] include process-1.6.25.0-6fc5
1633.47 s
[extra] include time-1.12.2-b11c
1633.47 s
[extra] include unix-2.8.6.0-e528
1633.47 s
[extra] Control.Concurrent.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Version.Extra,Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Extra,Numeric.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Numeric.Extra,System.Directory.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Environment.Extra,System.IO.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.IO.Extra,System.Info.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Info.Extra,System.Process.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Process.Extra,System.Time.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Time.Extra,Text.Read.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Text.Read.Extra
1633.47 s
[extra] unit extra-1.8.1-LV1wyo3vfOdDgOxdN7at1y-extra-test
1633.47 s
[extra] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1633.47 s
[extra] include base-4.19.2.0-8274
1633.47 s
[extra] include directory-1.3.8.5-d63d
1633.47 s
[extra] include extra-1.8.1-EssMUQCsBco9gsyBCwwe73
1633.47 s
[extra] include filepath-1.4.301.0-9527
1633.47 s
[extra] include quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
1633.47 s
[extra] include unix-2.8.6.0-e528
1633.47 s
[extra] Ready component graph:
1633.47 s
[extra] definite extra-1.8.1-EssMUQCsBco9gsyBCwwe73
1633.47 s
[extra] depends base-4.19.2.0-8274
1633.47 s
[extra] depends clock-0.8.4-29TfRxmWsjd5NvULEp3eBt
1633.47 s
[extra] depends directory-1.3.8.5-d63d
1633.47 s
[extra] depends filepath-1.4.301.0-9527
1633.47 s
[extra] depends process-1.6.25.0-6fc5
1633.47 s
[extra] depends time-1.12.2-b11c
1633.47 s
[extra] depends unix-2.8.6.0-e528
1633.47 s
[extra] definite extra-1.8.1-LV1wyo3vfOdDgOxdN7at1y-extra-test
1633.47 s
[extra] depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1633.47 s
[extra] depends base-4.19.2.0-8274
1633.47 s
[extra] depends directory-1.3.8.5-d63d
1633.47 s
[extra] depends extra-1.8.1-EssMUQCsBco9gsyBCwwe73
1633.47 s
[extra] depends filepath-1.4.301.0-9527
1633.47 s
[extra] depends quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
1633.47 s
[extra] depends unix-2.8.6.0-e528
1633.47 s
[extra] Using Cabal-3.10.3.0 compiled by ghc-9.8
1633.47 s
[extra] Using compiler: ghc-9.8.4
1633.47 s
[extra] Using install prefix: /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1
1633.47 s
[extra] Executables installed in:
1633.47 s
[extra] /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/bin
1633.47 s
[extra] Libraries installed in:
1633.47 s
[extra] /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/extra-1.8.1-EssMUQCsBco9gsyBCwwe73
1633.47 s
[extra] Dynamic Libraries installed in:
1633.47 s
[extra] /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
1633.47 s
[extra] Private executables installed in:
1633.47 s
[extra] /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/libexec/x86_64-linux-ghc-9.8.4/extra-1.8.1
1633.47 s
[extra] Data files installed in:
1633.47 s
[extra] /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/share/x86_64-linux-ghc-9.8.4/extra-1.8.1
1633.47 s
[extra] Documentation installed in:
1633.47 s
[extra] /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc/share/doc/extra-1.8.1
1633.47 s
[extra] Configuration files installed in:
1633.47 s
[extra] /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/etc
1633.47 s
[extra] No alex found
1633.47 s
[extra] Using ar found on system at:
1633.47 s
[extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
1633.47 s
[extra] No c2hs found
1633.47 s
[extra] No cpphs found
1633.47 s
[extra] No doctest found
1633.47 s
[extra] Using gcc version 14.3.0 given by user at:
1633.47 s
[extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
1633.47 s
[extra] Using ghc version 9.8.4 found on system at:
1633.47 s
[extra] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
1633.47 s
[extra] Using ghc-pkg version 9.8.4 found on system at:
1633.47 s
[extra] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
1633.47 s
[extra] No ghcjs found
1633.47 s
[extra] No ghcjs-pkg found
1633.47 s
[extra] No greencard found
1633.47 s
[extra] Using haddock version 2.30.0 found on system at:
1633.47 s
[extra] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
1633.47 s
[extra] No happy found
1633.47 s
[extra] Using haskell-suite found on system at: haskell-suite-dummy-location
1633.47 s
[extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1633.47 s
[extra] No hmake found
1633.47 s
[extra] Using hpc version 0.69 found on system at:
1633.47 s
[extra] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
1633.47 s
[extra] Using hsc2hs version 0.68.10 found on system at:
1633.47 s
[extra] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
1633.47 s
[extra] Using hscolour version 1.25 found on system at:
1633.47 s
[extra] /nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
1633.47 s
[extra] No jhc found
1633.47 s
[extra] Using ld found on system at:
1633.47 s
[extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
1633.47 s
[extra] No pkg-config found
1633.47 s
[extra] Using runghc version 9.8.4 found on system at:
1633.47 s
[extra] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
1633.47 s
[extra] Using strip version 2.44 found on system at:
1633.47 s
[extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
1633.47 s
[extra] Using tar found on system at:
1633.47 s
[extra] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
1633.47 s
[extra] No uhc found
1633.67 s
[extra] Phase: buildPhase
1633.72 s
[extra] Preprocessing library for extra-1.8.1..
1633.74 s
[extra] Building library for extra-1.8.1..
1633.98 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 )
1634.07 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 )
1634.07 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 )
1634.08 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 )
1634.08 s
[extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
1634.08 s
[extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
1634.08 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 )
1635.15 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 )
1635.21 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 )
1635.30 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 )
1635.30 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 )
1635.30 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 )
1635.49 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 )
1635.55 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 )
1635.77 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 )
1635.77 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 )
1635.77 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 )
1636.29 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 )
1636.29 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 )
1636.34 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 )
1636.34 s
[extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
1636.40 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 )
1636.81 s
[extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
1636.99 s
[extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
1636.99 s
[extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
1637.02 s
[extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
1637.02 s
[extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
1637.02 s
[extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
1637.02 s
[extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
1638.44 s
[extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
1638.85 s
[extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
1638.86 s
[extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
1638.86 s
[extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
1638.86 s
[extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
1639.16 s
[extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
1639.33 s
[extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
1639.85 s
[extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
1639.85 s
[extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
1639.85 s
[extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
1640.10 s
[extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
1640.10 s
[extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
1640.25 s
[extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
1640.25 s
[extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
1640.40 s
[extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
1641.47 s
[extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
1641.47 s
[extra] Building test suite 'extra-test' for extra-1.8.1..
1641.55 s
[extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
1641.93 s
[extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
1643.74 s
[extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
1643.76 s
[extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
1644.03 s
[extra] [5 of 5] Linking dist/build/extra-test/extra-test
1644.87 s
[extra] Phase: checkPhase
1644.90 s
[extra] Running 1 test suites...
1644.90 s
[extra] Test suite extra-test: RUNNING...
1644.91 s
[extra] withTempFile
1644.91 s
[extra] +++ OK, passed 100 tests.
1644.91 s
[extra] captureOutput
1644.91 s
[extra] +++ OK, passed 100 tests.
1644.91 s
[extra] \(x :: IO Int) -> void (once x) == pure ()
1644.94 s
[extra] +++ OK, passed 100 tests.
1644.94 s
[extra] \(x :: IO Int) -> join (once x) == x
1644.97 s
[extra] +++ OK, passed 100 tests.
1644.97 s
[extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
1645.00 s
[extra] +++ OK, passed 100 tests.
1645.00 s
[extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
1645.04 s
[extra] +++ OK, passed 100 tests.
1645.04 s
[extra] \(x :: IO Int) -> join (onceFork x) == x
1645.07 s
[extra] +++ OK, passed 100 tests.
1645.07 s
[extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
1645.10 s
[extra] +++ OK, passed 100 tests.
1645.10 s
[extra] stringException "test" == pure "test"
1645.10 s
[extra] +++ OK, passed 100 tests.
1645.10 s
[extra] stringException ("test" ++ undefined) == pure "test<Exception>"
1645.11 s
[extra] +++ OK, passed 100 tests.
1645.11 s
[extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
1645.11 s
[extra] +++ OK, passed 100 tests.
1645.11 s
[extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
1645.11 s
[extra] +++ OK, passed 100 tests.
1645.11 s
[extra] ignore (print 1) == print 1
1645.11 s
[extra] +++ OK, passed 100 tests.
1645.11 s
[extra] ignore (fail "die") == pure ()
1645.11 s
[extra] +++ OK, passed 100 tests.
1645.11 s
[extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
1645.11 s
[extra] +++ OK, passed 100 tests.
1645.11 s
[extra] seq (errorIO "foo") (print 1) == print 1
1645.11 s
[extra] +++ OK, passed 100 tests.
1645.11 s
[extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
1645.11 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] seq (assertIO False) (print 1) == print 1
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] retry 1 (print "x") == print "x"
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] retry 3 (fail "die") == fail "die"
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] whenJust Nothing print == pure ()
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] whenJust (Just 1) print == print 1
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] pureIf @Maybe True 5 == Just 5
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] pureIf @Maybe False 5 == Nothing
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] pureIf @[] True 5 == [5]
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] pureIf @[] False 5 == []
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] whenMaybe True (print 1) == fmap Just (print 1)
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] whenMaybe False (print 1) == pure Nothing
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] \(x :: Maybe ()) -> unit x == x
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] guarded even 2 == [2]
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] guarded odd 2 == Nothing
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] guarded (not.null) "My Name" == Just "My Name"
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] guardedA (return . even) 42 == Just [42]
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] guardedA (return . odd) 42 == Just []
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] fold1M (\x y -> Just x) [] == undefined
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] partitionM (const Nothing) [1,2,3] == Nothing
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] Just True ||^ undefined == Just True
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] Just False ||^ Just True == Just True
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] Just False ||^ Just False == Just False
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] Just False &&^ undefined == Just False
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] Just True &&^ Just True == Just True
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] Just True &&^ Just False == Just False
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] anyM Just [False,True ,undefined] == Just True
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] anyM Just [False,False,undefined] == undefined
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] allM Just [True,False,undefined] == Just False
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] allM Just [True,True ,undefined] == undefined
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] orM [Just False,Just True ,undefined] == Just True
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] orM [Just False,Just False,undefined] == undefined
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] \xs -> Just (or xs) == orM (map Just xs)
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] andM [Just True,Just False,undefined] == Just False
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] andM [Just True,Just True ,undefined] == undefined
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] \xs -> Just (and xs) == andM (map Just xs)
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] findM (Just . isUpper) "teST" == Just (Just 'S')
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] findM (Just . isUpper) "test" == Just Nothing
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] fromLeft 1 (Left 3) == 3
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] fromLeft 1 (Right "foo") == 1
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] fromRight 1 (Right 3) == 3
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] fromRight 1 (Left "foo") == 1
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] \x -> fromLeft' (Left x) == x
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] \x -> fromLeft' (Right x) == undefined
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] \x -> fromRight' (Right x) == x
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] \x -> fromRight' (Left x) == undefined
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.12 s
[extra] \x -> fromEither (Left x ) == x
1645.12 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \x -> fromEither (Right x) == x
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \a b -> maybeToEither a (Just b) == Right b
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \a -> maybeToEither a Nothing == Left a
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \x -> eitherToMaybe (Left x) == Nothing
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \x -> eitherToMaybe (Right x) == Just x
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] mapLeft show (Left 1) == Left "1"
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] mapLeft show (Right True) == Right True
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] mapRight show (Left 1) == Left 1
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] mapRight show (Right True) == Right "True"
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \xs -> repeatedly word1 (trim xs) == words xs
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \xs -> repeatedly line1 xs == lines xs
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] disjoint [1,2,3] [4,5] == True
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] disjoint [1,2,3] [4,1] == False
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] disjointOrd [1,2,3] [4,5] == True
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] disjointOrd [1,2,3] [4,1] == False
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] anySame [1,1,2] == True
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] anySame [1,2,3] == False
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] anySame (1:2:1:undefined) == True
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] anySame [] == False
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \xs -> anySame xs == (length (nub xs) < length xs)
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] allSame [1,1,2] == False
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] allSame [1,1,1] == True
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] allSame [1] == True
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] allSame [] == True
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] allSame (1:1:2:undefined) == False
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \xs -> allSame xs == (length (nub xs) <= 1)
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] headDef 1 [] == 1
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] headDef 1 [2,3,4] == 2
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] lastDef 1 [] == 1
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] lastDef 1 [2,3,4] == 4
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \x xs -> lastDef x xs == last (x:xs)
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] [2,3,4] !? 1 == Just 3
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] [2,3,4] !? (-1) == Nothing
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] [] !? 0 == Nothing
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] notNull [] == False
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] notNull [1] == True
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \xs -> notNull xs == not (null xs)
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] list 1 (\v _ -> v - 2) [] == 1
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] unsnoc "test" == Just ("tes",'t')
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] unsnoc "" == Nothing
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.13 s
[extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
1645.13 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] cons 't' "est" == "test"
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] \x xs -> uncons (cons x xs) == Just (x,xs)
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] snoc "tes" 't' == "test"
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] enumerate == [False, True]
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] takeEnd 3 "hello" == "llo"
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] takeEnd 5 "bye" == "bye"
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] takeEnd (-1) "bye" == ""
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] \i xs -> takeEnd i xs `isSuffixOf` xs
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] dropEnd 3 "hello" == "he"
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] dropEnd 5 "bye" == ""
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] dropEnd (-1) "bye" == "bye"
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] \i xs -> dropEnd i xs `isPrefixOf` xs
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] splitAtEnd 3 "hello" == ("he","llo")
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] splitAtEnd 3 "he" == ("", "he")
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] \i xs -> uncurry (++) (splitAt i xs) == xs
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] \i xs -> zip [i..] xs == zipFrom i xs
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] zipFrom False [1..3] == [(False,1),(True, 2)]
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] takeWhileEnd even [2,3,4,6] == [4,6]
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] trim " hello " == "hello"
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] trimStart " hello " == "hello "
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] trimEnd " hello " == " hello"
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] \s -> trim s == trimEnd (trimStart s)
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] lower "This is A TEST" == "this is a test"
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] lower "" == ""
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] upper "This is A TEST" == "THIS IS A TEST"
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] upper "" == ""
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] word1 "" == ("", "")
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] word1 "keyword rest of string" == ("keyword","rest of string")
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] \s -> fst (word1 s) == concat (take 1 $ words s)
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] \s -> words (snd $ word1 s) == drop 1 (words s)
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] line1 "" == ("", "")
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] line1 "test" == ("test","")
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] line1 "test\n" == ("test","")
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] line1 "test\nrest" == ("test","rest")
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
1645.14 s
[extra] +++ OK, passed 100 tests.
1645.14 s
[extra] escapeHTML "this is a test" == "this is a test"
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] escapeHTML "<b>\"g&t\"</n>" == "<b>"g&t"</n>"
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] escapeHTML "t'was another test" == "t'was another test"
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] \xs -> unescapeHTML (escapeHTML xs) == xs
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] escapeJSON "this is a test" == "this is a test"
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] \xs -> unescapeJSON (escapeJSON xs) == xs
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] maximumOn id [] == undefined
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] maximumOn length ["test","extra","a"] == "extra"
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] minimumOn id [] == undefined
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] minimumOn length ["test","extra","a"] == "a"
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] sum' [1, 2, 3] == 6
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] sumOn' read ["1", "2", "3"] == 6
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] product' [1, 2, 4] == 8
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] productOn' read ["1", "2", "4"] == 8
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] merge "ace" "bd" == "abcde"
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] replace "el" "e" "Hello" == "Helo"
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] replace "" "x" "Hello" == "xHxexlxlxox"
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] replace "" "x" "" == "x"
1645.15 s
[extra] +++ OK, passed 100 tests.
1645.15 s
[extra] \xs ys -> replace xs xs ys == ys
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] breakEnd isLower "youRE" == ("you","RE")
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] breakEnd isLower "youre" == ("youre","")
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] breakEnd isLower "YOURE" == ("","YOURE")
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] spanEnd isUpper "youRE" == ("you","RE")
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] \s -> wordsBy isSpace s == words s
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] \s -> linesBy (== '\n') s == lines s
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] firstJust id [Nothing,Just 3] == Just 3
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] firstJust id [Nothing,Nothing] == Nothing
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] drop1 "" == ""
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] drop1 "test" == "est"
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] \xs -> drop 1 xs == drop1 xs
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] dropEnd1 "" == ""
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] dropEnd1 "test" == "tes"
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] \xs -> dropEnd 1 xs == dropEnd1 xs
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] mconcatMap Sum [1,2,3] == Sum 6
1645.16 s
[extra] +++ OK, passed 100 tests.
1645.16 s
[extra] \f xs -> mconcatMap f xs == concatMap f xs
1645.17 s
[extra] +++ OK, passed 100 tests.
1645.17 s
[extra] breakOn "::" "a::b::c" == ("a", "::b::c")
1645.17 s
[extra] +++ OK, passed 100 tests.
1645.17 s
[extra] breakOn "/" "foobar" == ("foobar", "")
1645.17 s
[extra] +++ OK, passed 100 tests.
1645.17 s
[extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
1645.17 s
[extra] +++ OK, passed 100 tests.
1645.17 s
[extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
1645.17 s
[extra] +++ OK, passed 100 tests.
1645.17 s
[extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
1645.17 s
[extra] +++ OK, passed 100 tests.
1645.17 s
[extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
1645.17 s
[extra] +++ OK, passed 100 tests.
1645.17 s
[extra] splitOn "x" "x" == ["",""]
1645.17 s
[extra] +++ OK, passed 100 tests.
1645.17 s
[extra] splitOn "x" "" == [""]
1645.17 s
[extra] +++ OK, passed 100 tests.
1645.17 s
[extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
1645.17 s
[extra] +++ OK, passed 100 tests; 21 discarded.
1645.18 s
[extra] \c x -> splitOn [c] x == split (==c) x
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] split (== 'a') "" == [""]
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] split (== ',') "my,list,here" == ["my","list","here"]
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] dropWhileEnd isSpace "ab cde " == "ab cde"
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] last (dropWhileEnd even [undefined,3]) == undefined
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] last (dropWhileEnd' even [undefined,3]) == 3
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] head (dropWhileEnd even (3:undefined)) == 3
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] head (dropWhileEnd' even (3:undefined)) == undefined
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] dropPrefix "Mr. " "Mr. Men" == "Men"
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] dropSuffix "!" "Hello World!" == "Hello World"
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] dropSuffix "!" "Hello World!!" == "Hello World!"
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] dropSuffix "!" "Hello World." == "Hello World."
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] stripSuffix "bar" "foobar" == Just "foo"
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] stripSuffix "" "baz" == Just "baz"
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] stripSuffix "foo" "quux" == Nothing
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] stripInfix "/" "foobar" == Nothing
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] chunksOf 3 "my test" == ["my ","tes","t"]
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] chunksOf 3 "mytest" == ["myt","est"]
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] chunksOf 8 "" == []
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] chunksOf 0 "test" == undefined
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] nubSort "this is a test" == " aehist"
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] \xs -> nubSort xs == nub (sort xs)
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] nubOrd "this is a test" == "this ae"
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] \xs -> nubOrd xs == nub xs
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] comparingLength [1,2,3] [False] == GT
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] comparingLength [1,2] "ab" == EQ
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] comparingLength [1,2] (1:2:3:undefined) == LT
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] comparingLength (1:2:3:undefined) [1,2] == GT
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] mwhen True "test" == "test"
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] mwhen False "test" == ""
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] first succ (1,"test") == (2,"test")
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] second reverse (1,"test") == (1,"tset")
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.18 s
[extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
1645.18 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] (succ *** reverse) (1,"test") == (2,"tset")
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] (succ &&& pred) 1 == (2,0)
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] dupe 12 == (12, 12)
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] both succ (1,2) == (2,3)
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] first3 succ (1,1,1) == (2,1,1)
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] second3 succ (1,1,1) == (1,2,1)
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] third3 succ (1,1,1) == (1,1,2)
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] \x -> readVersion (showVersion x) == x
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] readVersion "hello" == undefined
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] showDP 4 pi == "3.1416"
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] showDP 0 pi == "3"
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] showDP 2 3 == "3.00"
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] isWindows == (os == "mingw32")
1645.19 s
[extra] +++ OK, passed 100 tests.
1645.19 s
[extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
1645.21 s
[extra] +++ OK, passed 100 tests.
1645.21 s
[extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
1645.23 s
[extra] +++ OK, passed 100 tests.
1645.23 s
[extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
1645.24 s
[extra] +++ OK, passed 100 tests.
1645.24 s
[extra] captureOutput (print 1) == pure ("1\n",())
1645.24 s
[extra] +++ OK, passed 100 tests.
1645.24 s
[extra] withTempFile doesFileExist == pure True
1645.24 s
[extra] +++ OK, passed 100 tests.
1645.24 s
[extra] (doesFileExist =<< withTempFile pure) == pure False
1645.24 s
[extra] +++ OK, passed 100 tests.
1645.24 s
[extra] withTempFile readFile' == pure ""
1645.24 s
[extra] +++ OK, passed 100 tests.
1645.24 s
[extra] withTempDir doesDirectoryExist == pure True
1645.25 s
[extra] +++ OK, passed 100 tests.
1645.25 s
[extra] (doesDirectoryExist =<< withTempDir pure) == pure False
1645.25 s
[extra] +++ OK, passed 100 tests.
1645.25 s
[extra] withTempDir listFiles == pure []
1645.25 s
[extra] +++ OK, passed 100 tests.
1645.25 s
[extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
1645.25 s
[extra] +++ OK, passed 100 tests.
1645.25 s
[extra] fileEq "does_not_exist" "does_not_exist" == undefined
1645.25 s
[extra] +++ OK, passed 100 tests.
1645.25 s
[extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
1645.25 s
[extra] +++ OK, passed 100 tests.
1645.25 s
[extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
1645.25 s
[extra] +++ OK, passed 100 tests.
1645.25 s
[extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
1645.25 s
[extra] +++ OK, passed 100 tests.
1645.25 s
[extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
1645.25 s
[extra] +++ OK, passed 100 tests.
1645.25 s
[extra] fmap (round . fst) (duration $ sleep 1) == pure 1
1646.25 s
[extra] +++ OK, passed 100 tests.
1646.25 s
[extra] timeout (-3) (print 1) == pure Nothing
1646.25 s
[extra] +++ OK, passed 100 tests.
1646.25 s
[extra] timeout 0.1 (print 1) == fmap Just (print 1)
1646.25 s
[extra] +++ OK, passed 100 tests.
1646.25 s
[extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
1646.35 s
[extra] 0.10036990300000001
1646.35 s
[extra] +++ OK, passed 100 tests.
1646.35 s
[extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
1646.45 s
[extra] +++ OK, passed 100 tests.
1646.45 s
[extra] showDuration 3.435 == "3.44s"
1646.45 s
[extra] +++ OK, passed 100 tests.
1646.45 s
[extra] showDuration 623.8 == "10m24s"
1646.45 s
[extra] +++ OK, passed 100 tests.
1646.45 s
[extra] showDuration 62003.8 == "17h13m"
1646.45 s
[extra] +++ OK, passed 100 tests.
1646.45 s
[extra] showDuration 1e8 == "27777h47m"
1646.45 s
[extra] +++ OK, passed 100 tests.
1646.45 s
[extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
1646.45 s
[extra] +++ OK, passed 100 tests.
1646.45 s
[extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
1647.46 s
[extra] +++ OK, passed 100 tests.
1647.46 s
[extra] Extra export
1647.46 s
[extra] +++ OK, passed 100 tests.
1647.46 s
[extra] withTempFile
1647.46 s
[extra] ....done
1647.46 s
[extra] withTempDir
1647.48 s
[extra] ....done
1647.48 s
[extra] retry
1647.48 s
[extra] +++ OK, passed 100 tests.
1647.48 s
[extra] barrier
1647.48 s
[extra] Success (325 tests)
1647.50 s
[extra] Test suite extra-test: PASS
1647.50 s
[extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
1647.50 s
[extra] 1 of 1 test suites (1 of 1 test cases) passed.
1647.50 s
[extra] Phase: haddockPhase
1647.62 s
[extra] Preprocessing library for extra-1.8.1..
1647.63 s
[extra] Running Haddock on library for extra-1.8.1..
1647.67 s
[extra] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1647.95 s
[extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
1647.96 s
[extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
1647.97 s
[extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
1647.98 s
[extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
1647.99 s
[extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing )
1648.00 s
[extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
1648.01 s
[extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
1648.26 s
[extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
1648.26 s
[extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
1648.28 s
[extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
1648.29 s
[extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
1648.31 s
[extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
1648.36 s
[extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
1648.37 s
[extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
1648.40 s
[extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
1648.43 s
[extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
1648.43 s
[extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
1648.55 s
[extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
1648.55 s
[extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
1648.57 s
[extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
1648.59 s
[extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing )
1648.65 s
[extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
1648.66 s
[extra] Haddock coverage:
1648.66 s
[extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
1648.66 s
[extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
1648.66 s
[extra] Warning: 'Arrow' is out of scope.
1648.66 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
1648.66 s
[extra] 100% ( 28 / 28) in 'Data.Tuple.Extra'
1648.66 s
[extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
1648.67 s
[extra] 100% ( 7 / 7) in 'Numeric.Extra'
1648.67 s
[extra] Warning: '(:)' is out of scope.
1648.67 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
1648.67 s
[extra] Warning: 'unzip' is ambiguous. It is defined
1648.67 s
[extra] * in ‘Data.Functor’
1648.67 s
[extra] * in ‘GHC.List’
1648.67 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1648.67 s
[extra] by specifying the type/value namespace explicitly.
1648.67 s
[extra] Defaulting to the one defined in ‘GHC.List’
1648.67 s
[extra] Warning: 'firstJustM' is out of scope.
1648.67 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
1648.68 s
[extra] 100% ( 85 / 85) in 'Data.List.Extra'
1648.68 s
[extra] Warning: 'Version' is ambiguous. It is defined
1648.68 s
[extra] * in ‘Data.Version’
1648.68 s
[extra] * in ‘Data.Version’
1648.68 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1648.68 s
[extra] by specifying the type/value namespace explicitly.
1648.68 s
[extra] Defaulting to the one defined in ‘Data.Version’
1648.68 s
[extra] 100% ( 3 / 3) in 'Data.Version.Extra'
1648.68 s
[extra] Warning: 'length' is ambiguous. It is defined
1648.68 s
[extra] * in ‘Data.Foldable’
1648.68 s
[extra] * in ‘Data.List.NonEmpty’
1648.68 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1648.68 s
[extra] by specifying the type/value namespace explicitly.
1648.68 s
[extra] Defaulting to the one defined in ‘Data.List.NonEmpty’
1648.68 s
[extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
1648.68 s
[extra] Warning: 'fromJust' is out of scope.
1648.68 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
1648.68 s
[extra] 100% ( 11 / 11) in 'Data.Either.Extra'
1648.68 s
[extra] Warning: 'ErrorCall' is ambiguous. It is defined
1648.68 s
[extra] * in ‘GHC.Exception’
1648.68 s
[extra] * in ‘GHC.Exception’
1648.68 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1648.68 s
[extra] by specifying the type/value namespace explicitly.
1648.68 s
[extra] Defaulting to the one defined in ‘GHC.Exception’
1648.68 s
[extra] Warning: 'AssertionFailed' is ambiguous. It is defined
1648.68 s
[extra] * in ‘GHC.IO.Exception’
1648.68 s
[extra] * in ‘GHC.IO.Exception’
1648.68 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1648.68 s
[extra] by specifying the type/value namespace explicitly.
1648.68 s
[extra] Defaulting to the one defined in ‘GHC.IO.Exception’
1648.68 s
[extra] Warning: 'SomeException' is ambiguous. It is defined
1648.68 s
[extra] * in ‘GHC.Exception.Type’
1648.68 s
[extra] * in ‘GHC.Exception.Type’
1648.68 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1648.68 s
[extra] by specifying the type/value namespace explicitly.
1648.68 s
[extra] Defaulting to the one defined in ‘GHC.Exception.Type’
1648.68 s
[extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
1648.69 s
[extra] Warning: 'partition' is out of scope.
1648.69 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
1648.69 s
[extra] Warning: 'mconcatMap' is out of scope.
1648.69 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
1648.69 s
[extra] Warning: 'find' is out of scope.
1648.69 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
1648.69 s
[extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
1648.69 s
[extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
1648.69 s
[extra] Missing documentation for:
1648.69 s
[extra] Module header
1648.69 s
[extra] Warning: 'Lock' is ambiguous. It is defined
1648.69 s
[extra] * at src/Control/Concurrent/Extra.hs:106:16
1648.69 s
[extra] * at src/Control/Concurrent/Extra.hs:106:1
1648.69 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1648.69 s
[extra] by specifying the type/value namespace explicitly.
1648.69 s
[extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
1648.69 s
[extra] Warning: 'Var' is ambiguous. It is defined
1648.69 s
[extra] * at src/Control/Concurrent/Extra.hs:146:17
1648.69 s
[extra] * at src/Control/Concurrent/Extra.hs:146:1
1648.69 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1648.69 s
[extra] by specifying the type/value namespace explicitly.
1648.69 s
[extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
1648.69 s
[extra] Warning: 'Barrier' is ambiguous. It is defined
1648.69 s
[extra] * at src/Control/Concurrent/Extra.hs:210:21
1648.69 s
[extra] * at src/Control/Concurrent/Extra.hs:210:1
1648.69 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1648.69 s
[extra] by specifying the type/value namespace explicitly.
1648.69 s
[extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
1648.69 s
[extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
1648.69 s
[extra] 100% ( 8 / 8) in 'System.Directory.Extra'
1648.70 s
[extra] 100% ( 2 / 2) in 'System.Environment.Extra'
1648.70 s
[extra] 100% ( 26 / 26) in 'System.IO.Extra'
1648.70 s
[extra] 100% ( 4 / 4) in 'System.Info.Extra'
1648.70 s
[extra] 100% ( 5 / 5) in 'System.Process.Extra'
1648.70 s
[extra] 100% ( 8 / 8) in 'System.Time.Extra'
1648.70 s
[extra] 100% (270 /270) in 'Extra'
1648.70 s
[extra] 100% ( 2 / 2) in 'Text.Read.Extra'
1649.00 s
[extra] Warning: Data.Tuple.Extra: could not find link destinations for:
1649.00 s
[extra] - GHC.Generics.Rep1_Solo
1649.00 s
[extra] - GHC.Generics.Rep_Solo
1651.91 s
[extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
1651.97 s
[extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
1651.98 s
[extra] Phase: installPhase
1652.04 s
[extra] Installing library in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/extra-1.8.1-EssMUQCsBco9gsyBCwwe73
1652.44 s
[extra] Phase: fixupPhase
1652.47 s
[extra] shrinking RPATHs of ELF executables and libraries in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1
1652.47 s
[extra] shrinking /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSextra-1.8.1-EssMUQCsBco9gsyBCwwe73-ghc9.8.4.so
1652.49 s
[extra] checking for references to /build/ in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1...
1652.52 s
[extra] patching script interpreter paths in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1
1652.52 s
[extra] stripping (with command strip and flags -S -p) in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib
1652.63 s
[extra] shrinking RPATHs of ELF executables and libraries in /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc
1652.66 s
[extra] checking for references to /build/ in /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc...
1652.69 s
[extra] patching script interpreter paths in /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc
1652.83 s
[extra:post-build] Uploading to cachix cache "sellout": /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1
1653.21 s
[extra:post-build] Nothing to push - all store paths are already on Cachix.
1653.23 s
[extra:post-build] Uploading to the NixCI cache: /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1
1653.28 s
[extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1653.31 s
[extra:post-build] copying 1 paths...
1653.31 s
[extra:post-build] copying path '/nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1' to 'https://cache.nix-ci.com'...
1654.59 s
[extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1654.66 s
[extra:post-build] copying 0 paths...
1654.68 s
Progress: 33 of 38 built, 559 of 559 downloaded from cache
1654.72 s
Building /nix/store/26c954c0i89di6h5jdfdb3jks1f0pfl8-algebraic-graphs-0.7.drv
1654.81 s
[algebraic-graphs] Phase: setupCompilerEnvironmentPhase
1654.81 s
[algebraic-graphs] Build with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
1654.94 s
[algebraic-graphs] Phase: unpackPhase
1654.95 s
[algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
1654.96 s
[algebraic-graphs] source root is algebraic-graphs-0.7
1654.96 s
[algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
1654.97 s
[algebraic-graphs] Phase: patchPhase
1654.97 s
[algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
1654.98 s
[algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
1654.98 s
[algebraic-graphs] patching file algebraic-graphs.cabal
1654.98 s
[algebraic-graphs] Phase: compileBuildDriverPhase
1654.98 s
[algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.6GvW7wedJ2/setup-package.conf.d -threaded
1655.02 s
[algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.6GvW7wedJ2/Main.o )
1655.08 s
[algebraic-graphs] [2 of 2] Linking Setup
1656.37 s
[algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
1656.38 s
[algebraic-graphs] Phase: configurePhase
1656.39 s
[algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.6GvW7wedJ2/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 --extra-lib-dirs=/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/lib
1656.39 s
[algebraic-graphs] Using Parsec parser
1656.39 s
[algebraic-graphs] Configuring algebraic-graphs-0.7...
1656.63 s
[algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
1656.63 s
[algebraic-graphs] Dependency base >=4.11 && <5: using base-4.19.2.0
1656.63 s
[algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
1656.63 s
[algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
1656.63 s
[algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
1656.63 s
[algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
1656.63 s
[algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
1656.63 s
[algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
1656.63 s
[algebraic-graphs] Dependency base >=4.11 && <5: using base-4.19.2.0
1656.63 s
[algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
1656.63 s
[algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
1656.63 s
[algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
1656.63 s
[algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
1656.63 s
[algebraic-graphs] inspection-testing-0.6.2
1656.63 s
[algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
1656.86 s
[algebraic-graphs] Source component graph:
1656.86 s
[algebraic-graphs] component lib
1656.86 s
[algebraic-graphs] component test:main dependency lib
1656.86 s
[algebraic-graphs] Configured component graph:
1656.86 s
[algebraic-graphs] component algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
1656.86 s
[algebraic-graphs] include array-0.5.8.0-cf4f
1656.86 s
[algebraic-graphs] include base-4.19.2.0-8274
1656.86 s
[algebraic-graphs] include containers-0.6.8-15d9
1656.86 s
[algebraic-graphs] include deepseq-1.5.1.0-c64e
1656.86 s
[algebraic-graphs] include transformers-0.6.1.0-388b
1656.86 s
[algebraic-graphs] component algebraic-graphs-0.7-5jtLgVA0WOj7VL6Fsh7koE-main
1656.86 s
[algebraic-graphs] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1656.86 s
[algebraic-graphs] include algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
1656.86 s
[algebraic-graphs] include array-0.5.8.0-cf4f
1656.86 s
[algebraic-graphs] include base-4.19.2.0-8274
1656.86 s
[algebraic-graphs] include containers-0.6.8-15d9
1656.86 s
[algebraic-graphs] include deepseq-1.5.1.0-c64e
1656.86 s
[algebraic-graphs] include extra-1.8.1-EssMUQCsBco9gsyBCwwe73
1656.86 s
[algebraic-graphs] include inspection-testing-0.6.2-35R0qsmblLV9uU1qS0yYOA
1656.86 s
[algebraic-graphs] include transformers-0.6.1.0-388b
1656.86 s
[algebraic-graphs] Linked component graph:
1656.86 s
[algebraic-graphs] unit algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
1656.86 s
[algebraic-graphs] include array-0.5.8.0-cf4f
1656.86 s
[algebraic-graphs] include base-4.19.2.0-8274
1656.86 s
[algebraic-graphs] include containers-0.6.8-15d9
1656.86 s
[algebraic-graphs] include deepseq-1.5.1.0-c64e
1656.86 s
[algebraic-graphs] include transformers-0.6.1.0-388b
1656.86 s
[algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Data.Graph.Typed
1656.86 s
[algebraic-graphs] unit algebraic-graphs-0.7-5jtLgVA0WOj7VL6Fsh7koE-main
1656.86 s
[algebraic-graphs] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1656.86 s
[algebraic-graphs] include algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
1656.86 s
[algebraic-graphs] include array-0.5.8.0-cf4f
1656.86 s
[algebraic-graphs] include base-4.19.2.0-8274
1656.86 s
[algebraic-graphs] include containers-0.6.8-15d9
1656.86 s
[algebraic-graphs] include deepseq-1.5.1.0-c64e
1656.86 s
[algebraic-graphs] include extra-1.8.1-EssMUQCsBco9gsyBCwwe73
1656.86 s
[algebraic-graphs] include inspection-testing-0.6.2-35R0qsmblLV9uU1qS0yYOA
1656.86 s
[algebraic-graphs] include transformers-0.6.1.0-388b
1656.86 s
[algebraic-graphs] Ready component graph:
1656.86 s
[algebraic-graphs] definite algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
1656.86 s
[algebraic-graphs] depends array-0.5.8.0-cf4f
1656.86 s
[algebraic-graphs] depends base-4.19.2.0-8274
1656.86 s
[algebraic-graphs] depends containers-0.6.8-15d9
1656.86 s
[algebraic-graphs] depends deepseq-1.5.1.0-c64e
1656.86 s
[algebraic-graphs] depends transformers-0.6.1.0-388b
1656.86 s
[algebraic-graphs] definite algebraic-graphs-0.7-5jtLgVA0WOj7VL6Fsh7koE-main
1656.86 s
[algebraic-graphs] depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
1656.86 s
[algebraic-graphs] depends algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
1656.86 s
[algebraic-graphs] depends array-0.5.8.0-cf4f
1656.86 s
[algebraic-graphs] depends base-4.19.2.0-8274
1656.86 s
[algebraic-graphs] depends containers-0.6.8-15d9
1656.86 s
[algebraic-graphs] depends deepseq-1.5.1.0-c64e
1656.86 s
[algebraic-graphs] depends extra-1.8.1-EssMUQCsBco9gsyBCwwe73
1656.86 s
[algebraic-graphs] depends inspection-testing-0.6.2-35R0qsmblLV9uU1qS0yYOA
1656.86 s
[algebraic-graphs] depends transformers-0.6.1.0-388b
1656.86 s
[algebraic-graphs] Using Cabal-3.10.3.0 compiled by ghc-9.8
1656.86 s
[algebraic-graphs] Using compiler: ghc-9.8.4
1656.86 s
[algebraic-graphs] Using install prefix:
1656.86 s
[algebraic-graphs] /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7
1656.86 s
[algebraic-graphs] Executables installed in:
1656.86 s
[algebraic-graphs] /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/bin
1656.86 s
[algebraic-graphs] Libraries installed in:
1656.86 s
[algebraic-graphs] /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
1656.86 s
[algebraic-graphs] Dynamic Libraries installed in:
1656.86 s
[algebraic-graphs] /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
1656.86 s
[algebraic-graphs] Private executables installed in:
1656.86 s
[algebraic-graphs] /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7
1656.86 s
[algebraic-graphs] Data files installed in:
1656.86 s
[algebraic-graphs] /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7
1656.86 s
[algebraic-graphs] Documentation installed in:
1656.86 s
[algebraic-graphs] /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
1656.86 s
[algebraic-graphs] Configuration files installed in:
1656.86 s
[algebraic-graphs] /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/etc
1656.86 s
[algebraic-graphs] No alex found
1656.86 s
[algebraic-graphs] Using ar found on system at:
1656.86 s
[algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
1656.86 s
[algebraic-graphs] No c2hs found
1656.86 s
[algebraic-graphs] No cpphs found
1656.86 s
[algebraic-graphs] No doctest found
1656.86 s
[algebraic-graphs] Using gcc version 14.3.0 given by user at:
1656.86 s
[algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
1656.86 s
[algebraic-graphs] Using ghc version 9.8.4 found on system at:
1656.86 s
[algebraic-graphs] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
1656.86 s
[algebraic-graphs] Using ghc-pkg version 9.8.4 found on system at:
1656.86 s
[algebraic-graphs] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
1656.86 s
[algebraic-graphs] No ghcjs found
1656.86 s
[algebraic-graphs] No ghcjs-pkg found
1656.87 s
[algebraic-graphs] No greencard found
1656.87 s
[algebraic-graphs] Using haddock version 2.30.0 found on system at:
1656.87 s
[algebraic-graphs] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
1656.87 s
[algebraic-graphs] No happy found
1656.87 s
[algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
1656.87 s
[algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1656.87 s
[algebraic-graphs] No hmake found
1656.87 s
[algebraic-graphs] Using hpc version 0.69 found on system at:
1656.87 s
[algebraic-graphs] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
1656.87 s
[algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
1656.87 s
[algebraic-graphs] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
1656.87 s
[algebraic-graphs] Using hscolour version 1.25 found on system at:
1656.87 s
[algebraic-graphs] /nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
1656.87 s
[algebraic-graphs] No jhc found
1656.87 s
[algebraic-graphs] Using ld found on system at:
1656.87 s
[algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
1656.87 s
[algebraic-graphs] No pkg-config found
1656.87 s
[algebraic-graphs] Using runghc version 9.8.4 found on system at:
1656.87 s
[algebraic-graphs] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
1656.87 s
[algebraic-graphs] Using strip version 2.44 found on system at:
1656.87 s
[algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
1656.87 s
[algebraic-graphs] Using tar found on system at:
1656.87 s
[algebraic-graphs] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
1656.87 s
[algebraic-graphs] No uhc found
1657.03 s
[algebraic-graphs] Phase: buildPhase
1657.07 s
[algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
1657.07 s
[algebraic-graphs] Building library for algebraic-graphs-0.7..
1657.16 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 )
1658.01 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 )
1658.61 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 )
1658.91 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 )
1658.91 s
[algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
1660.01 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 )
1660.24 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 )
1660.73 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 )
1661.37 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 )
1661.37 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 )
1661.37 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 )
1661.37 s
[algebraic-graphs]
1661.37 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning : [ GHC-63394 ] [ -Wx-partial ]
1661.37 s
[algebraic-graphs] In the use of ‘head’
1661.37 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1661.37 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1661.37 s
[algebraic-graphs] |
1661.37 s
[algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
1661.37 s
[algebraic-graphs] | ^^^^
1661.37 s
[algebraic-graphs]
1661.37 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1661.37 s
[algebraic-graphs] In the use of ‘tail’
1661.37 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1661.37 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1661.37 s
[algebraic-graphs] |
1661.37 s
[algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
1661.37 s
[algebraic-graphs] | ^^^^
1661.37 s
[algebraic-graphs]
1661.37 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning : [ GHC-63394 ] [ -Wx-partial ]
1661.37 s
[algebraic-graphs] In the use of ‘head’
1661.37 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1661.37 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1661.37 s
[algebraic-graphs] |
1661.37 s
[algebraic-graphs] 395 | p_v = fst $ head bnd
1661.37 s
[algebraic-graphs] | ^^^^
1661.37 s
[algebraic-graphs]
1661.37 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1661.37 s
[algebraic-graphs] In the use of ‘tail’
1661.37 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1661.37 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1661.37 s
[algebraic-graphs] |
1661.37 s
[algebraic-graphs] 397 | bnd' = tail bnd
1661.37 s
[algebraic-graphs] | ^^^^
1661.37 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 )
1661.37 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 )
1661.37 s
[algebraic-graphs]
1661.37 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1661.37 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1661.37 s
[algebraic-graphs] will become an error in a future GHC release.
1661.37 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1661.37 s
[algebraic-graphs] |
1661.37 s
[algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
1661.37 s
[algebraic-graphs] | ^
1661.37 s
[algebraic-graphs]
1661.37 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1661.37 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1661.37 s
[algebraic-graphs] will become an error in a future GHC release.
1661.37 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1661.37 s
[algebraic-graphs] |
1661.37 s
[algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1661.37 s
[algebraic-graphs] | ^
1661.37 s
[algebraic-graphs]
1661.37 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1661.37 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1661.37 s
[algebraic-graphs] will become an error in a future GHC release.
1661.37 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1661.37 s
[algebraic-graphs] |
1661.37 s
[algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1661.37 s
[algebraic-graphs] | ^
1661.37 s
[algebraic-graphs]
1661.37 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1661.37 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1661.37 s
[algebraic-graphs] will become an error in a future GHC release.
1661.37 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1661.37 s
[algebraic-graphs] |
1661.37 s
[algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1661.37 s
[algebraic-graphs] | ^
1661.37 s
[algebraic-graphs]
1661.37 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1661.37 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1661.37 s
[algebraic-graphs] will become an error in a future GHC release.
1661.37 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1661.37 s
[algebraic-graphs] |
1661.37 s
[algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1661.37 s
[algebraic-graphs] | ^
1661.37 s
[algebraic-graphs]
1661.37 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1661.37 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1661.37 s
[algebraic-graphs] will become an error in a future GHC release.
1661.37 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1661.37 s
[algebraic-graphs] |
1661.37 s
[algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1661.37 s
[algebraic-graphs] | ^
1661.37 s
[algebraic-graphs]
1661.37 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1661.37 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1661.37 s
[algebraic-graphs] will become an error in a future GHC release.
1661.37 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1661.37 s
[algebraic-graphs] |
1661.37 s
[algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1661.37 s
[algebraic-graphs] | ^
1661.37 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 )
1661.43 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 )
1661.74 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 )
1661.81 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 )
1661.81 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 )
1662.21 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 )
1662.35 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 )
1662.56 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 )
1662.56 s
[algebraic-graphs]
1662.56 s
[algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1662.56 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1662.56 s
[algebraic-graphs] will become an error in a future GHC release.
1662.56 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1662.56 s
[algebraic-graphs] |
1662.56 s
[algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
1662.56 s
[algebraic-graphs] | ^
1662.56 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 )
1662.56 s
[algebraic-graphs]
1662.56 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1662.56 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1662.56 s
[algebraic-graphs] will become an error in a future GHC release.
1662.56 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1662.56 s
[algebraic-graphs] |
1662.56 s
[algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
1662.56 s
[algebraic-graphs] | ^
1662.56 s
[algebraic-graphs]
1662.56 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1662.56 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1662.56 s
[algebraic-graphs] will become an error in a future GHC release.
1662.56 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1662.56 s
[algebraic-graphs] |
1662.57 s
[algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
1662.57 s
[algebraic-graphs] | ^
1662.57 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 )
1662.57 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 )
1662.57 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 )
1662.57 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 )
1662.57 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 )
1662.57 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 )
1662.57 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 )
1662.81 s
[algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
1663.74 s
[algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
1664.28 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 )
1664.61 s
[algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
1664.61 s
[algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
1665.71 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 )
1666.05 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 )
1666.48 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 )
1667.18 s
[algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
1667.18 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 )
1667.18 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 )
1667.18 s
[algebraic-graphs]
1667.18 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning : [ GHC-63394 ] [ -Wx-partial ]
1667.18 s
[algebraic-graphs] In the use of ‘head’
1667.18 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1667.18 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1667.18 s
[algebraic-graphs] |
1667.18 s
[algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
1667.18 s
[algebraic-graphs] | ^^^^
1667.18 s
[algebraic-graphs]
1667.18 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1667.18 s
[algebraic-graphs] In the use of ‘tail’
1667.18 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1667.18 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1667.18 s
[algebraic-graphs] |
1667.18 s
[algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
1667.18 s
[algebraic-graphs] | ^^^^
1667.18 s
[algebraic-graphs]
1667.18 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning : [ GHC-63394 ] [ -Wx-partial ]
1667.18 s
[algebraic-graphs] In the use of ‘head’
1667.18 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1667.18 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1667.18 s
[algebraic-graphs] |
1667.18 s
[algebraic-graphs] 395 | p_v = fst $ head bnd
1667.18 s
[algebraic-graphs] | ^^^^
1667.18 s
[algebraic-graphs]
1667.18 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1667.18 s
[algebraic-graphs] In the use of ‘tail’
1667.18 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1667.18 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1667.18 s
[algebraic-graphs] |
1667.18 s
[algebraic-graphs] 397 | bnd' = tail bnd
1667.18 s
[algebraic-graphs] | ^^^^
1667.18 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 )
1667.18 s
[algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
1667.18 s
[algebraic-graphs]
1667.18 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1667.18 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1667.18 s
[algebraic-graphs] will become an error in a future GHC release.
1667.18 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1667.18 s
[algebraic-graphs] |
1667.18 s
[algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
1667.18 s
[algebraic-graphs] | ^
1667.18 s
[algebraic-graphs]
1667.18 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1667.18 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1667.18 s
[algebraic-graphs] will become an error in a future GHC release.
1667.18 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1667.18 s
[algebraic-graphs] |
1667.18 s
[algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1667.18 s
[algebraic-graphs] | ^
1667.18 s
[algebraic-graphs]
1667.18 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1667.18 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1667.18 s
[algebraic-graphs] will become an error in a future GHC release.
1667.18 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1667.18 s
[algebraic-graphs] |
1667.18 s
[algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1667.18 s
[algebraic-graphs] | ^
1667.18 s
[algebraic-graphs]
1667.18 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1667.18 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1667.18 s
[algebraic-graphs] will become an error in a future GHC release.
1667.18 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1667.18 s
[algebraic-graphs] |
1667.18 s
[algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1667.18 s
[algebraic-graphs] | ^
1667.18 s
[algebraic-graphs]
1667.18 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1667.18 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1667.18 s
[algebraic-graphs] will become an error in a future GHC release.
1667.18 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1667.18 s
[algebraic-graphs] |
1667.18 s
[algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1667.18 s
[algebraic-graphs] | ^
1667.18 s
[algebraic-graphs]
1667.18 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1667.18 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1667.18 s
[algebraic-graphs] will become an error in a future GHC release.
1667.18 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1667.18 s
[algebraic-graphs] |
1667.18 s
[algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1667.18 s
[algebraic-graphs] | ^
1667.18 s
[algebraic-graphs]
1667.18 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1667.18 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1667.18 s
[algebraic-graphs] will become an error in a future GHC release.
1667.18 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1667.18 s
[algebraic-graphs] |
1667.18 s
[algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1667.18 s
[algebraic-graphs] | ^
1667.18 s
[algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
1667.34 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 )
1667.74 s
[algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
1667.74 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 )
1667.74 s
[algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
1668.18 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 )
1668.43 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 )
1668.57 s
[algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
1668.57 s
[algebraic-graphs]
1668.57 s
[algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1668.57 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1668.57 s
[algebraic-graphs] will become an error in a future GHC release.
1668.57 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1668.57 s
[algebraic-graphs] |
1668.57 s
[algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
1668.57 s
[algebraic-graphs] | ^
1668.57 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 )
1668.57 s
[algebraic-graphs]
1668.57 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1668.57 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1668.57 s
[algebraic-graphs] will become an error in a future GHC release.
1668.57 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1668.57 s
[algebraic-graphs] |
1668.57 s
[algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
1668.57 s
[algebraic-graphs] | ^
1668.57 s
[algebraic-graphs]
1668.57 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1668.57 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1668.57 s
[algebraic-graphs] will become an error in a future GHC release.
1668.57 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1668.57 s
[algebraic-graphs] |
1668.57 s
[algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
1668.57 s
[algebraic-graphs] | ^
1668.57 s
[algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
1668.57 s
[algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
1668.57 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 )
1668.67 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 )
1668.67 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 )
1668.67 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 )
1668.70 s
[algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
1669.68 s
[algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
1669.68 s
[algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7..
1669.80 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 )
1670.92 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 )
1673.44 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 )
1673.44 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 )
1673.52 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 )
1675.41 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 )
1675.41 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 )
1675.41 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 )
1678.96 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 )
1679.13 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 )
1679.13 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 )
1679.84 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 )
1679.84 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 )
1679.84 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 )
1680.72 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 )
1680.72 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 )
1680.72 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 )
1680.72 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 )
1680.72 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 )
1680.72 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 )
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
1680.72 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
1680.73 s
[algebraic-graphs] inspection testing successful
1680.73 s
[algebraic-graphs] expected successes: 58
1680.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 )
1680.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 )
1680.73 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 )
1681.42 s
[algebraic-graphs] [24 of 24] Linking dist/build/main/main
1682.35 s
[algebraic-graphs] Phase: checkPhase
1682.38 s
[algebraic-graphs] Running 1 test suites...
1682.38 s
[algebraic-graphs] Test suite main: RUNNING...
1688.52 s
[algebraic-graphs]
1688.52 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
1689.29 s
[algebraic-graphs] OK: show empty == "empty"
1689.29 s
[algebraic-graphs] OK: show (shrink 1) == "vertex 1"
1689.29 s
[algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
1689.29 s
[algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
1689.29 s
[algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
1689.29 s
[algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
1689.29 s
[algebraic-graphs] OK: fromAcyclic empty == empty
1689.29 s
[algebraic-graphs] OK: fromAcyclic . vertex == vertex
1689.29 s
[algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
1689.29 s
[algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
1689.29 s
[algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
1689.29 s
[algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
1689.29 s
[algebraic-graphs] OK: isEmpty empty == True
1689.29 s
[algebraic-graphs] OK: hasVertex x empty == False
1689.29 s
[algebraic-graphs] OK: vertexCount empty == 0
1689.29 s
[algebraic-graphs] OK: edgeCount empty == 0
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
1689.29 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1689.29 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1689.29 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1689.29 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
1689.29 s
[algebraic-graphs] OK: vertices [] == empty
1689.29 s
[algebraic-graphs] OK: vertices [x] == vertex x
1689.29 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1689.29 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1689.29 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
1689.29 s
[algebraic-graphs] OK: vertexSet (union x y) == <correct result>
1689.29 s
[algebraic-graphs] OK: edgeSet (union x y) == <correct result>
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
1689.29 s
[algebraic-graphs] OK: vertexSet (join x y) == <correct result>
1689.29 s
[algebraic-graphs] OK: edgeSet (join x y) == <correct result>
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
1689.29 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1689.29 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1689.29 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1689.29 s
[algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
1689.29 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
1689.29 s
[algebraic-graphs] OK: isEmpty empty == True
1689.29 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1689.29 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1689.29 s
[algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
1689.29 s
[algebraic-graphs] OK: hasVertex x empty == False
1689.29 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1689.29 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
1689.29 s
[algebraic-graphs] OK: hasEdge x y empty == False
1689.29 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1689.29 s
[algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
1689.29 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1689.29 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
1689.29 s
[algebraic-graphs] OK: vertexCount empty == 0
1689.29 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1689.29 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1689.29 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
1689.29 s
[algebraic-graphs] OK: edgeCount empty == 0
1689.29 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1689.29 s
[algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
1689.29 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
1689.29 s
[algebraic-graphs] OK: vertexList empty == []
1689.29 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1689.29 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
1689.29 s
[algebraic-graphs] OK: edgeList empty == []
1689.29 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1689.29 s
[algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
1689.29 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
1689.29 s
[algebraic-graphs] OK: adjacencyList empty == []
1689.29 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1689.29 s
[algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
1689.29 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1689.29 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1689.29 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
1689.29 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1689.29 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1689.29 s
[algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
1689.29 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1689.29 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1689.29 s
[algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
1689.29 s
[algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
1689.29 s
[algebraic-graphs] OK: Set.member x . preSet x == const False
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
1689.29 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1689.29 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1689.29 s
[algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
1689.29 s
[algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
1689.29 s
[algebraic-graphs] OK: Set.member x . postSet x == const False
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
1689.29 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1689.29 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1689.29 s
[algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
1689.29 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
1689.29 s
[algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
1689.29 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1689.29 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1689.29 s
[algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
1689.29 s
[algebraic-graphs] OK: transpose empty == empty
1689.29 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1689.29 s
[algebraic-graphs] OK: transpose . transpose == id
1689.29 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
1689.29 s
[algebraic-graphs] OK: induce (const True ) x == x
1689.29 s
[algebraic-graphs] OK: induce (const False) x == empty
1689.29 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1689.29 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1689.29 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
1689.29 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1689.29 s
[algebraic-graphs] OK: induceJust . vertex . Just == vertex
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
1689.29 s
[algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] OK: box x y ~~ box y x
1689.29 s
[algebraic-graphs] OK: box x (vertex ()) ~~ x
1689.29 s
[algebraic-graphs] OK: box x empty ~~ empty
1689.29 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1689.29 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1689.29 s
[algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
1689.29 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
1689.29 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1689.29 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1689.29 s
[algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
1689.29 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
1689.29 s
[algebraic-graphs] OK: topSort empty == []
1689.29 s
[algebraic-graphs] OK: topSort (vertex x) == [x]
1689.29 s
[algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
1689.29 s
[algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
1689.29 s
[algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
1689.29 s
[algebraic-graphs] OK: scc empty == empty
1689.29 s
[algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
1689.29 s
[algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
1689.29 s
[algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
1689.29 s
[algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
1689.29 s
[algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
1689.29 s
[algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
1689.29 s
[algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
1689.29 s
[algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
1689.29 s
[algebraic-graphs]
1689.29 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
1689.29 s
[algebraic-graphs] OK: toAcyclicOrd empty == empty
1689.29 s
[algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
1689.29 s
[algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
1689.29 s
[algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
1689.29 s
[algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
1689.29 s
[algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
1691.77 s
[algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
1691.77 s
[algebraic-graphs]
1691.77 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
1691.77 s
[algebraic-graphs] OK: shrink . AM.vertex == vertex
1691.77 s
[algebraic-graphs] OK: shrink . AM.vertices == vertices
1691.77 s
[algebraic-graphs] OK: shrink . fromAcyclic == id
1691.77 s
[algebraic-graphs]
1691.77 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
1691.77 s
[algebraic-graphs] OK: Arbitrary
1691.77 s
[algebraic-graphs] OK: empty
1691.77 s
[algebraic-graphs] OK: vertex
1691.77 s
[algebraic-graphs] OK: vertices
1691.77 s
[algebraic-graphs] OK: union
1691.77 s
[algebraic-graphs] OK: join
1691.77 s
[algebraic-graphs] OK: transpose
1691.77 s
[algebraic-graphs] OK: box
1691.77 s
[algebraic-graphs] OK: transitiveClosure
1691.77 s
[algebraic-graphs] OK: scc
1691.77 s
[algebraic-graphs] OK: toAcyclic
1691.77 s
[algebraic-graphs] OK: toAcyclicOrd
1691.77 s
[algebraic-graphs]
1691.77 s
[algebraic-graphs] ============ AdjacencyIntMap ============
1691.77 s
[algebraic-graphs] OK: Axioms of graphs
1691.77 s
[algebraic-graphs]
1691.77 s
[algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
1691.77 s
[algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
1691.77 s
[algebraic-graphs]
1691.77 s
[algebraic-graphs] ============ AdjacencyIntMap.consistent ============
1691.77 s
[algebraic-graphs] OK: Consistency of the Arbitrary instance
1691.77 s
[algebraic-graphs]
1691.77 s
[algebraic-graphs] OK: consistent empty == True
1691.77 s
[algebraic-graphs] OK: consistent (vertex x) == True
1691.77 s
[algebraic-graphs] OK: consistent (overlay x y) == True
1691.77 s
[algebraic-graphs] OK: consistent (connect x y) == True
1691.77 s
[algebraic-graphs] OK: consistent (edge x y) == True
1691.77 s
[algebraic-graphs] OK: consistent (edges xs) == True
1691.77 s
[algebraic-graphs] OK: consistent (stars xs) == True
1691.77 s
[algebraic-graphs]
1691.77 s
[algebraic-graphs] ============ AdjacencyIntMap.Show ============
1691.77 s
[algebraic-graphs] OK: show (empty ) == "empty"
1691.77 s
[algebraic-graphs] OK: show (1 ) == "vertex 1"
1691.77 s
[algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
1691.77 s
[algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
1691.77 s
[algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
1691.77 s
[algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
1691.77 s
[algebraic-graphs]
1691.77 s
[algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
1691.77 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
1691.77 s
[algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
1691.77 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
1691.77 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
1691.77 s
[algebraic-graphs]
1691.77 s
[algebraic-graphs] ============ AdjacencyIntMap.Ord ============
1691.77 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1691.77 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1691.77 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1691.77 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1691.77 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1691.77 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1691.77 s
[algebraic-graphs] OK: x <= x + y
1691.77 s
[algebraic-graphs] OK: x + y <= x * y
1691.77 s
[algebraic-graphs]
1691.77 s
[algebraic-graphs] ============ AdjacencyIntMap.empty ============
1691.77 s
[algebraic-graphs] OK: isEmpty empty == True
1691.77 s
[algebraic-graphs] OK: hasVertex x empty == False
1691.77 s
[algebraic-graphs] OK: vertexCount empty == 0
1691.77 s
[algebraic-graphs] OK: edgeCount empty == 0
1691.77 s
[algebraic-graphs]
1691.77 s
[algebraic-graphs] ============ AdjacencyIntMap.vertex ============
1691.77 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1691.77 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1691.77 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1691.77 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1691.77 s
[algebraic-graphs]
1691.77 s
[algebraic-graphs] ============ AdjacencyIntMap.edge ============
1691.77 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1691.77 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1691.77 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1691.77 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1691.77 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1691.77 s
[algebraic-graphs]
1691.77 s
[algebraic-graphs] ============ AdjacencyIntMap.overlay ============
1691.77 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1691.77 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1691.77 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1691.77 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1691.77 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1691.77 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1691.77 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1691.77 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1691.77 s
[algebraic-graphs]
1691.77 s
[algebraic-graphs] ============ AdjacencyIntMap.connect ============
1691.77 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1691.77 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1691.77 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1691.77 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1691.77 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1691.77 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1691.77 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1691.78 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1691.78 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1691.78 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1691.78 s
[algebraic-graphs]
1691.78 s
[algebraic-graphs] ============ AdjacencyIntMap.vertices ============
1691.78 s
[algebraic-graphs] OK: vertices [] == empty
1691.78 s
[algebraic-graphs] OK: vertices [x] == vertex x
1691.78 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1691.78 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1691.78 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1691.78 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1691.78 s
[algebraic-graphs]
1691.78 s
[algebraic-graphs] ============ AdjacencyIntMap.edges ============
1691.78 s
[algebraic-graphs] OK: edges [] == empty
1691.78 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1691.78 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1691.78 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1691.78 s
[algebraic-graphs]
1691.78 s
[algebraic-graphs] ============ AdjacencyIntMap.overlays ============
1691.78 s
[algebraic-graphs] OK: overlays [] == empty
1691.78 s
[algebraic-graphs] OK: overlays [x] == x
1691.78 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1691.78 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1691.78 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1691.78 s
[algebraic-graphs]
1691.78 s
[algebraic-graphs] ============ AdjacencyIntMap.connects ============
1691.78 s
[algebraic-graphs] OK: connects [] == empty
1691.78 s
[algebraic-graphs] OK: connects [x] == x
1691.78 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1691.78 s
[algebraic-graphs] OK: connects == foldr connect empty
1691.78 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1691.78 s
[algebraic-graphs]
1691.78 s
[algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
1691.78 s
[algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
1691.78 s
[algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
1691.78 s
[algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
1691.78 s
[algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
1691.78 s
[algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
1691.78 s
[algebraic-graphs]
1691.78 s
[algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
1691.78 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1691.78 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1691.78 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1691.78 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1691.78 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1691.78 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1691.78 s
[algebraic-graphs]
1691.78 s
[algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
1691.78 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1691.78 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1691.78 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1691.78 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1691.78 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1691.78 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1691.78 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1691.78 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1691.78 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1691.78 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1691.78 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1691.78 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1691.78 s
[algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
1691.78 s
[algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
1691.78 s
[algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
1691.78 s
[algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
1691.78 s
[algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
1691.78 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1691.78 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1691.78 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1691.78 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1691.78 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1691.78 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1691.78 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1691.78 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1691.78 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1691.78 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1691.78 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1691.78 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1691.78 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1691.78 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1691.78 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1691.78 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1691.78 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1692.53 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1692.53 s
[algebraic-graphs]
1692.53 s
[algebraic-graphs] ============ AdjacencyIntMap.foldg ============
1692.53 s
[algebraic-graphs] OK: foldg empty vertex overlay connect == id
1692.53 s
[algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
1692.54 s
[algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
1692.54 s
[algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
1692.54 s
[algebraic-graphs] OK: isEmpty empty == True
1692.54 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1692.54 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1692.54 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1692.54 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
1692.54 s
[algebraic-graphs] OK: hasVertex x empty == False
1692.54 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1692.54 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
1692.54 s
[algebraic-graphs] OK: hasEdge x y empty == False
1692.54 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1692.54 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1692.54 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1692.54 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
1692.54 s
[algebraic-graphs] OK: vertexCount empty == 0
1692.54 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1692.54 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1692.54 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
1692.54 s
[algebraic-graphs] OK: edgeCount empty == 0
1692.54 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1692.54 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1692.54 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
1692.54 s
[algebraic-graphs] OK: vertexList empty == []
1692.54 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1692.54 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
1692.54 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1692.54 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1692.54 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
1692.54 s
[algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
1692.54 s
[algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
1692.54 s
[algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
1692.54 s
[algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
1692.54 s
[algebraic-graphs] OK: edgeList empty == []
1692.54 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1692.54 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1692.54 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1692.54 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
1692.54 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1692.54 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1692.54 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1692.54 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
1692.54 s
[algebraic-graphs] OK: adjacencyList empty == []
1692.54 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1692.54 s
[algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
1692.54 s
[algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.preSet ============
1692.54 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1692.54 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1692.54 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1692.54 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
1692.54 s
[algebraic-graphs] OK: preIntSet x empty == IntSet.empty
1692.54 s
[algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
1692.54 s
[algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
1692.54 s
[algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.postSet ============
1692.54 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1692.54 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1692.54 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1692.54 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
1692.54 s
[algebraic-graphs] OK: postIntSet x empty == IntSet.empty
1692.54 s
[algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
1692.54 s
[algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
1692.54 s
[algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.path ============
1692.54 s
[algebraic-graphs] OK: path [] == empty
1692.54 s
[algebraic-graphs] OK: path [x] == vertex x
1692.54 s
[algebraic-graphs] OK: path [x,y] == edge x y
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.circuit ============
1692.54 s
[algebraic-graphs] OK: circuit [] == empty
1692.54 s
[algebraic-graphs] OK: circuit [x] == edge x x
1692.54 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.clique ============
1692.54 s
[algebraic-graphs] OK: clique [] == empty
1692.54 s
[algebraic-graphs] OK: clique [x] == vertex x
1692.54 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1692.54 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1692.54 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.biclique ============
1692.54 s
[algebraic-graphs] OK: biclique [] [] == empty
1692.54 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1692.54 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1692.54 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1692.54 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.star ============
1692.54 s
[algebraic-graphs] OK: star x [] == vertex x
1692.54 s
[algebraic-graphs] OK: star x [y] == edge x y
1692.54 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1692.54 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.stars ============
1692.54 s
[algebraic-graphs] OK: stars [] == empty
1692.54 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1692.54 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1692.54 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1692.54 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1692.54 s
[algebraic-graphs] OK: stars . adjacencyList == id
1692.54 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.tree ============
1692.54 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1692.54 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1692.54 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1692.54 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.forest ============
1692.54 s
[algebraic-graphs] OK: forest [] == empty
1692.54 s
[algebraic-graphs] OK: forest [x] == tree x
1692.54 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1692.54 s
[algebraic-graphs] OK: forest == overlays . map tree
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
1692.54 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1692.54 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1692.54 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1692.54 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1692.54 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
1692.54 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1692.54 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1692.54 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1692.54 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1692.54 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
1692.54 s
[algebraic-graphs] OK: replaceVertex x x == id
1692.54 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1692.54 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
1692.54 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1692.54 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1692.54 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1692.54 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.transpose ============
1692.54 s
[algebraic-graphs] OK: transpose empty == empty
1692.54 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1692.54 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1692.54 s
[algebraic-graphs] OK: transpose . transpose == id
1692.54 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.gmap ============
1692.54 s
[algebraic-graphs] OK: gmap f empty == empty
1692.54 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1692.54 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1692.54 s
[algebraic-graphs] OK: gmap id == id
1692.54 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.induce ============
1692.54 s
[algebraic-graphs] OK: induce (const True ) x == x
1692.54 s
[algebraic-graphs] OK: induce (const False) x == empty
1692.54 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1692.54 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1692.54 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1692.54 s
[algebraic-graphs]
1692.54 s
[algebraic-graphs] ============ AdjacencyIntMap.compose ============
1692.54 s
[algebraic-graphs] OK: compose empty x == empty
1692.54 s
[algebraic-graphs] OK: compose x empty == empty
1692.54 s
[algebraic-graphs] OK: compose (vertex x) y == empty
1692.54 s
[algebraic-graphs] OK: compose x (vertex y) == empty
1692.54 s
[algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
1692.54 s
[algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
1692.77 s
[algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
1692.77 s
[algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
1692.77 s
[algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
1692.77 s
[algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
1692.77 s
[algebraic-graphs]
1692.77 s
[algebraic-graphs] ============ AdjacencyIntMap.closure ============
1692.77 s
[algebraic-graphs] OK: closure empty == empty
1692.77 s
[algebraic-graphs] OK: closure (vertex x) == edge x x
1692.77 s
[algebraic-graphs] OK: closure (edge x x) == edge x x
1692.77 s
[algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
1692.77 s
[algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
1692.77 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1692.77 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1692.77 s
[algebraic-graphs] OK: closure . closure == closure
1692.77 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1692.77 s
[algebraic-graphs]
1692.77 s
[algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
1692.77 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1692.77 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
1692.77 s
[algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
1692.77 s
[algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
1692.77 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1692.77 s
[algebraic-graphs]
1692.78 s
[algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
1692.78 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1692.78 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1692.78 s
[algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
1692.78 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1692.78 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1692.78 s
[algebraic-graphs]
1692.78 s
[algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
1692.78 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1692.78 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1692.78 s
[algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
1692.78 s
[algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
1692.78 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1692.78 s
[algebraic-graphs]
1692.78 s
[algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
1692.78 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
1692.78 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
1692.78 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
1692.78 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
1692.78 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
1692.78 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
1692.78 s
[algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
1692.78 s
[algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
1692.78 s
[algebraic-graphs] OK: bfsForest x [] == []
1692.78 s
[algebraic-graphs] OK: bfsForest empty vs == []
1692.78 s
[algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
1692.78 s
[algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
1692.78 s
[algebraic-graphs]
1692.78 s
[algebraic-graphs] ============ AdjacencyIntMap.bfs ============
1692.78 s
[algebraic-graphs] OK: bfs (edge 1 2) [0] == []
1692.78 s
[algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
1692.78 s
[algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
1692.78 s
[algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
1692.78 s
[algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
1692.78 s
[algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
1692.78 s
[algebraic-graphs] OK: bfs empty vs == []
1692.78 s
[algebraic-graphs] OK: bfs x [] == []
1692.78 s
[algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
1692.78 s
[algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
1692.78 s
[algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
1692.78 s
[algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
1692.78 s
[algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
1692.78 s
[algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
1692.78 s
[algebraic-graphs]
1692.78 s
[algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
1692.78 s
[algebraic-graphs] OK: forest $ dfsForest empty == empty
1692.78 s
[algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
1692.78 s
[algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
1692.78 s
[algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
1692.78 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
1692.78 s
[algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
1692.78 s
[algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
1692.78 s
[algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
1692.78 s
[algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
1692.78 s
[algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
1692.78 s
[algebraic-graphs]
1692.78 s
[algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
1692.78 s
[algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
1692.78 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
1692.78 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
1692.78 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
1692.78 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
1692.78 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
1692.78 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
1692.78 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
1692.78 s
[algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
1692.78 s
[algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
1692.78 s
[algebraic-graphs] OK: dfsForestFrom x [] == []
1692.78 s
[algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
1692.78 s
[algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
1692.78 s
[algebraic-graphs]
1692.78 s
[algebraic-graphs] ============ AdjacencyIntMap.dfs ============
1692.78 s
[algebraic-graphs] OK: dfs empty vs == []
1692.78 s
[algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
1692.78 s
[algebraic-graphs] OK: dfs (edge 1 2) [0] == []
1692.78 s
[algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
1692.78 s
[algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
1692.78 s
[algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
1692.78 s
[algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
1692.78 s
[algebraic-graphs] OK: dfs x [] == []
1692.78 s
[algebraic-graphs]
1692.78 s
[algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
1692.78 s
[algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
1692.78 s
[algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
1692.78 s
[algebraic-graphs]
1692.78 s
[algebraic-graphs] ============ AdjacencyIntMap.dfs ============
1692.78 s
[algebraic-graphs] OK: reachable empty x == []
1692.78 s
[algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
1692.78 s
[algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
1692.78 s
[algebraic-graphs] OK: reachable (edge 1 2) 0 == []
1692.78 s
[algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
1692.78 s
[algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
1692.78 s
[algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
1692.78 s
[algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
1692.78 s
[algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
1692.78 s
[algebraic-graphs]
1692.78 s
[algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
1692.78 s
[algebraic-graphs]
1692.78 s
[algebraic-graphs] ============ AdjacencyIntMap.topSort ============
1692.78 s
[algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
1692.78 s
[algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
1692.78 s
[algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
1692.78 s
[algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
1692.78 s
[algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
1692.78 s
[algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
1692.78 s
[algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
1692.78 s
[algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
1692.78 s
[algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
1692.78 s
[algebraic-graphs] OK: topSort . vertices == Right . nub . sort
1692.78 s
[algebraic-graphs]
1692.78 s
[algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
1692.78 s
[algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
1692.78 s
[algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
1692.78 s
[algebraic-graphs] OK: isAcyclic . circuit == null
1692.78 s
[algebraic-graphs] OK: isAcyclic == isRight . topSort
1692.78 s
[algebraic-graphs]
1692.78 s
[algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
1692.78 s
[algebraic-graphs] OK: isDfsForestOf [] empty == True
1692.78 s
[algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
1692.78 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
1692.78 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
1692.78 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
1692.78 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
1692.78 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
1692.78 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
1692.78 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
1692.78 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
1692.78 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
1692.78 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
1692.78 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
1697.37 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
1697.37 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
1697.43 s
[algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
1697.43 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
1697.43 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
1697.43 s
[algebraic-graphs]
1697.43 s
[algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
1697.43 s
[algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
1697.43 s
[algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
1697.43 s
[algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
1697.43 s
[algebraic-graphs] OK: isTopSortOf [] empty == True
1697.43 s
[algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
1697.43 s
[algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
1697.43 s
[algebraic-graphs]
1697.43 s
[algebraic-graphs] ============ AdjacencyMap ============
1697.43 s
[algebraic-graphs] OK: Axioms of graphs
1697.43 s
[algebraic-graphs]
1697.43 s
[algebraic-graphs] ============ AdjacencyMap.consistent ============
1697.43 s
[algebraic-graphs] OK: Consistency of the Arbitrary instance
1697.43 s
[algebraic-graphs]
1697.43 s
[algebraic-graphs] OK: consistent empty == True
1697.43 s
[algebraic-graphs] OK: consistent (vertex x) == True
1697.43 s
[algebraic-graphs] OK: consistent (overlay x y) == True
1697.43 s
[algebraic-graphs] OK: consistent (connect x y) == True
1697.43 s
[algebraic-graphs] OK: consistent (edge x y) == True
1697.43 s
[algebraic-graphs] OK: consistent (edges xs) == True
1697.43 s
[algebraic-graphs] OK: consistent (stars xs) == True
1697.43 s
[algebraic-graphs]
1697.43 s
[algebraic-graphs] ============ AdjacencyMap.Show ============
1697.43 s
[algebraic-graphs] OK: show (empty ) == "empty"
1697.43 s
[algebraic-graphs] OK: show (1 ) == "vertex 1"
1697.43 s
[algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
1697.43 s
[algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
1697.43 s
[algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
1697.43 s
[algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
1697.43 s
[algebraic-graphs]
1697.43 s
[algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
1697.43 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
1697.43 s
[algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
1697.43 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
1697.43 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
1697.43 s
[algebraic-graphs]
1697.43 s
[algebraic-graphs] ============ AdjacencyMap.Ord ============
1697.43 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1697.43 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1697.43 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1697.43 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1697.43 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1697.43 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1697.43 s
[algebraic-graphs] OK: x <= x + y
1697.43 s
[algebraic-graphs] OK: x + y <= x * y
1697.43 s
[algebraic-graphs]
1697.43 s
[algebraic-graphs] ============ AdjacencyMap.empty ============
1697.43 s
[algebraic-graphs] OK: isEmpty empty == True
1697.43 s
[algebraic-graphs] OK: hasVertex x empty == False
1697.43 s
[algebraic-graphs] OK: vertexCount empty == 0
1697.43 s
[algebraic-graphs] OK: edgeCount empty == 0
1697.43 s
[algebraic-graphs]
1697.43 s
[algebraic-graphs] ============ AdjacencyMap.vertex ============
1697.43 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1697.43 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1697.43 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1697.43 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1697.43 s
[algebraic-graphs]
1697.43 s
[algebraic-graphs] ============ AdjacencyMap.edge ============
1697.43 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1697.43 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1697.43 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1697.43 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1697.43 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1697.43 s
[algebraic-graphs]
1697.43 s
[algebraic-graphs] ============ AdjacencyMap.overlay ============
1697.43 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1697.43 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1697.43 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1697.43 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1697.43 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1697.43 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1697.43 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1697.43 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1697.43 s
[algebraic-graphs]
1697.43 s
[algebraic-graphs] ============ AdjacencyMap.connect ============
1697.43 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1697.43 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1697.43 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1697.43 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1697.43 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1697.43 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1697.43 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1697.43 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1697.43 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1697.43 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1697.43 s
[algebraic-graphs]
1697.43 s
[algebraic-graphs] ============ AdjacencyMap.vertices ============
1697.43 s
[algebraic-graphs] OK: vertices [] == empty
1697.43 s
[algebraic-graphs] OK: vertices [x] == vertex x
1697.43 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1697.43 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1697.43 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1697.43 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1697.43 s
[algebraic-graphs]
1697.43 s
[algebraic-graphs] ============ AdjacencyMap.edges ============
1697.43 s
[algebraic-graphs] OK: edges [] == empty
1697.43 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1697.43 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1697.43 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1697.44 s
[algebraic-graphs]
1697.44 s
[algebraic-graphs] ============ AdjacencyMap.overlays ============
1697.44 s
[algebraic-graphs] OK: overlays [] == empty
1697.44 s
[algebraic-graphs] OK: overlays [x] == x
1697.44 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1697.44 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1697.44 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1697.44 s
[algebraic-graphs]
1697.44 s
[algebraic-graphs] ============ AdjacencyMap.connects ============
1697.44 s
[algebraic-graphs] OK: connects [] == empty
1697.44 s
[algebraic-graphs] OK: connects [x] == x
1697.44 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1697.44 s
[algebraic-graphs] OK: connects == foldr connect empty
1697.44 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1697.44 s
[algebraic-graphs]
1697.44 s
[algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
1697.44 s
[algebraic-graphs] OK: fromAdjacencySets [] == empty
1697.44 s
[algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
1697.44 s
[algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
1697.44 s
[algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
1697.44 s
[algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
1697.44 s
[algebraic-graphs]
1697.44 s
[algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
1697.44 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1697.44 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1697.44 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1697.44 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1697.44 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1697.44 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1697.44 s
[algebraic-graphs]
1697.44 s
[algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
1697.44 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1697.44 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1697.44 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1697.44 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1697.44 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1697.44 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1697.44 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1697.44 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1697.44 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1697.44 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1697.44 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1697.44 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1697.44 s
[algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
1697.44 s
[algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
1697.44 s
[algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
1697.44 s
[algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
1697.44 s
[algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
1697.44 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1697.44 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1697.44 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1697.44 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1697.44 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1697.44 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1697.44 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1697.44 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1697.44 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1697.44 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1697.44 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1697.44 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1697.44 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1697.44 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1697.44 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1697.44 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1699.07 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1699.07 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.foldg ============
1699.07 s
[algebraic-graphs] OK: foldg empty vertex overlay connect == id
1699.07 s
[algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
1699.07 s
[algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
1699.07 s
[algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.isEmpty ============
1699.07 s
[algebraic-graphs] OK: isEmpty empty == True
1699.07 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1699.07 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1699.07 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1699.07 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.hasVertex ============
1699.07 s
[algebraic-graphs] OK: hasVertex x empty == False
1699.07 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1699.07 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.hasEdge ============
1699.07 s
[algebraic-graphs] OK: hasEdge x y empty == False
1699.07 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1699.07 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1699.07 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1699.07 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.vertexCount ============
1699.07 s
[algebraic-graphs] OK: vertexCount empty == 0
1699.07 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1699.07 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1699.07 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.edgeCount ============
1699.07 s
[algebraic-graphs] OK: edgeCount empty == 0
1699.07 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1699.07 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1699.07 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.vertexList ============
1699.07 s
[algebraic-graphs] OK: vertexList empty == []
1699.07 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1699.07 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.vertexSet ============
1699.07 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1699.07 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1699.07 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
1699.07 s
[algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
1699.07 s
[algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
1699.07 s
[algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
1699.07 s
[algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.edgeList ============
1699.07 s
[algebraic-graphs] OK: edgeList empty == []
1699.07 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1699.07 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1699.07 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1699.07 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.edgeSet ============
1699.07 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1699.07 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1699.07 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1699.07 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
1699.07 s
[algebraic-graphs] OK: adjacencyList empty == []
1699.07 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1699.07 s
[algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
1699.07 s
[algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.preSet ============
1699.07 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1699.07 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1699.07 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1699.07 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.preIntSet ============
1699.07 s
[algebraic-graphs] OK: preIntSet x empty == IntSet.empty
1699.07 s
[algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
1699.07 s
[algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
1699.07 s
[algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.postSet ============
1699.07 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1699.07 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1699.07 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1699.07 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.postIntSet ============
1699.07 s
[algebraic-graphs] OK: postIntSet x empty == IntSet.empty
1699.07 s
[algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
1699.07 s
[algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
1699.07 s
[algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.path ============
1699.07 s
[algebraic-graphs] OK: path [] == empty
1699.07 s
[algebraic-graphs] OK: path [x] == vertex x
1699.07 s
[algebraic-graphs] OK: path [x,y] == edge x y
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.circuit ============
1699.07 s
[algebraic-graphs] OK: circuit [] == empty
1699.07 s
[algebraic-graphs] OK: circuit [x] == edge x x
1699.07 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.clique ============
1699.07 s
[algebraic-graphs] OK: clique [] == empty
1699.07 s
[algebraic-graphs] OK: clique [x] == vertex x
1699.07 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1699.07 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1699.07 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.biclique ============
1699.07 s
[algebraic-graphs] OK: biclique [] [] == empty
1699.07 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1699.07 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1699.07 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1699.07 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.star ============
1699.07 s
[algebraic-graphs] OK: star x [] == vertex x
1699.07 s
[algebraic-graphs] OK: star x [y] == edge x y
1699.07 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1699.07 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.stars ============
1699.07 s
[algebraic-graphs] OK: stars [] == empty
1699.07 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1699.07 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1699.07 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1699.07 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1699.07 s
[algebraic-graphs] OK: stars . adjacencyList == id
1699.07 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.tree ============
1699.07 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1699.07 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1699.07 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1699.07 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.forest ============
1699.07 s
[algebraic-graphs] OK: forest [] == empty
1699.07 s
[algebraic-graphs] OK: forest [x] == tree x
1699.07 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1699.07 s
[algebraic-graphs] OK: forest == overlays . map tree
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.removeVertex ============
1699.07 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1699.07 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1699.07 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1699.07 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1699.07 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.removeEdge ============
1699.07 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1699.07 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1699.07 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1699.07 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1699.07 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
1699.07 s
[algebraic-graphs] OK: replaceVertex x x == id
1699.07 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1699.07 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
1699.07 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1699.07 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1699.07 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1699.07 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.transpose ============
1699.07 s
[algebraic-graphs] OK: transpose empty == empty
1699.07 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1699.07 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1699.07 s
[algebraic-graphs] OK: transpose . transpose == id
1699.07 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.gmap ============
1699.07 s
[algebraic-graphs] OK: gmap f empty == empty
1699.07 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1699.07 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1699.07 s
[algebraic-graphs] OK: gmap id == id
1699.07 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.induce ============
1699.07 s
[algebraic-graphs] OK: induce (const True ) x == x
1699.07 s
[algebraic-graphs] OK: induce (const False) x == empty
1699.07 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1699.07 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1699.07 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1699.07 s
[algebraic-graphs]
1699.07 s
[algebraic-graphs] ============ AdjacencyMap.compose ============
1699.07 s
[algebraic-graphs] OK: compose empty x == empty
1699.07 s
[algebraic-graphs] OK: compose x empty == empty
1699.07 s
[algebraic-graphs] OK: compose (vertex x) y == empty
1699.07 s
[algebraic-graphs] OK: compose x (vertex y) == empty
1699.07 s
[algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
1699.07 s
[algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
1701.34 s
[algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
1701.34 s
[algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
1701.34 s
[algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
1701.34 s
[algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] ============ AdjacencyMap.closure ============
1701.34 s
[algebraic-graphs] OK: closure empty == empty
1701.34 s
[algebraic-graphs] OK: closure (vertex x) == edge x x
1701.34 s
[algebraic-graphs] OK: closure (edge x x) == edge x x
1701.34 s
[algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
1701.34 s
[algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
1701.34 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1701.34 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1701.34 s
[algebraic-graphs] OK: closure . closure == closure
1701.34 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
1701.34 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1701.34 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
1701.34 s
[algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
1701.34 s
[algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
1701.34 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
1701.34 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1701.34 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1701.34 s
[algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
1701.34 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1701.34 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
1701.34 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1701.34 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1701.34 s
[algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
1701.34 s
[algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
1701.34 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] ============ AdjacencyMap.box ============
1701.34 s
[algebraic-graphs] OK: box x y ~~ box y x
1701.34 s
[algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
1701.34 s
[algebraic-graphs] OK: box x (vertex ()) ~~ x
1701.34 s
[algebraic-graphs] OK: box x empty ~~ empty
1701.34 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1701.34 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1701.34 s
[algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
1701.34 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] ============ AdjacencyMap.bfsForest ============
1701.34 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
1701.34 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
1701.34 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
1701.34 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
1701.34 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
1701.34 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
1701.34 s
[algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
1701.34 s
[algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
1701.34 s
[algebraic-graphs] OK: bfsForest x [] == []
1701.34 s
[algebraic-graphs] OK: bfsForest empty vs == []
1701.34 s
[algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
1701.34 s
[algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] ============ AdjacencyMap.bfs ============
1701.34 s
[algebraic-graphs] OK: bfs (edge 1 2) [0] == []
1701.34 s
[algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
1701.34 s
[algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
1701.34 s
[algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
1701.34 s
[algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
1701.34 s
[algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
1701.34 s
[algebraic-graphs] OK: bfs empty vs == []
1701.34 s
[algebraic-graphs] OK: bfs x [] == []
1701.34 s
[algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
1701.34 s
[algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
1701.34 s
[algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
1701.34 s
[algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
1701.34 s
[algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
1701.34 s
[algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] ============ AdjacencyMap.dfsForest ============
1701.34 s
[algebraic-graphs] OK: forest $ dfsForest empty == empty
1701.34 s
[algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
1701.34 s
[algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
1701.34 s
[algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
1701.34 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
1701.34 s
[algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
1701.34 s
[algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
1701.34 s
[algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
1701.34 s
[algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
1701.34 s
[algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
1701.34 s
[algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
1701.34 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
1701.34 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
1701.34 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
1701.34 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
1701.34 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
1701.34 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
1701.34 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
1701.34 s
[algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
1701.34 s
[algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
1701.34 s
[algebraic-graphs] OK: dfsForestFrom x [] == []
1701.34 s
[algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
1701.34 s
[algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] ============ AdjacencyMap.dfs ============
1701.34 s
[algebraic-graphs] OK: dfs empty vs == []
1701.34 s
[algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
1701.34 s
[algebraic-graphs] OK: dfs (edge 1 2) [0] == []
1701.34 s
[algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
1701.34 s
[algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
1701.34 s
[algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
1701.34 s
[algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
1701.34 s
[algebraic-graphs] OK: dfs x [] == []
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
1701.34 s
[algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
1701.34 s
[algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] ============ AdjacencyMap.dfs ============
1701.34 s
[algebraic-graphs] OK: reachable empty x == []
1701.34 s
[algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
1701.34 s
[algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
1701.34 s
[algebraic-graphs] OK: reachable (edge 1 2) 0 == []
1701.34 s
[algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
1701.34 s
[algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
1701.34 s
[algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
1701.34 s
[algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
1701.34 s
[algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] ============ AdjacencyMap.topSort ============
1701.34 s
[algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
1701.34 s
[algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
1701.34 s
[algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
1701.34 s
[algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
1701.34 s
[algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
1701.34 s
[algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
1701.34 s
[algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
1701.34 s
[algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
1701.34 s
[algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
1701.34 s
[algebraic-graphs] OK: topSort . vertices == Right . nub . sort
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
1701.34 s
[algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
1701.34 s
[algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
1701.34 s
[algebraic-graphs] OK: isAcyclic . circuit == null
1701.34 s
[algebraic-graphs] OK: isAcyclic == isRight . topSort
1701.34 s
[algebraic-graphs]
1701.34 s
[algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
1701.34 s
[algebraic-graphs] OK: isDfsForestOf [] empty == True
1701.34 s
[algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
1701.34 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
1701.34 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
1701.34 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
1701.34 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
1701.34 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
1706.71 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
1706.71 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
1706.72 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
1706.72 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
1706.72 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
1706.72 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
1706.72 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
1706.72 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
1706.72 s
[algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
1706.72 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
1706.72 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
1706.72 s
[algebraic-graphs]
1706.72 s
[algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
1706.72 s
[algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
1706.72 s
[algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
1706.72 s
[algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
1706.72 s
[algebraic-graphs] OK: isTopSortOf [] empty == True
1706.72 s
[algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
1706.72 s
[algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
1706.72 s
[algebraic-graphs]
1706.72 s
[algebraic-graphs] ============ AdjacencyMap.induceJust ============
1706.72 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1706.72 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1706.72 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1706.72 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1706.72 s
[algebraic-graphs]
1706.72 s
[algebraic-graphs] ============ AdjacencyMap.scc ============
1706.72 s
[algebraic-graphs] OK: scc empty == empty
1706.72 s
[algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
1706.72 s
[algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
1706.72 s
[algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
1706.72 s
[algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
1706.72 s
[algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
1706.72 s
[algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
1706.72 s
[algebraic-graphs] OK: isAcyclic . scc == const True
1706.72 s
[algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
1706.72 s
[algebraic-graphs] OK: scc g == KL.scc g
1706.72 s
[algebraic-graphs]
1706.72 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
1706.72 s
[algebraic-graphs] OK: 0 == rightVertex 0
1706.72 s
[algebraic-graphs] OK: swap 1 == leftVertex 1
1706.72 s
[algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
1706.72 s
[algebraic-graphs] OK: swap 1 * 2 == edge 1 2
1706.72 s
[algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
1706.72 s
[algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
1706.72 s
[algebraic-graphs]
1706.72 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
1706.72 s
[algebraic-graphs] OK: show empty == "empty"
1706.72 s
[algebraic-graphs] OK: show 1 == "rightVertex 1"
1706.72 s
[algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
1706.72 s
[algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
1706.72 s
[algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
1706.72 s
[algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
1706.72 s
[algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
1706.72 s
[algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
1706.72 s
[algebraic-graphs]
1706.72 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
1706.72 s
[algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
1706.72 s
[algebraic-graphs]
1706.72 s
[algebraic-graphs] OK: x + y == y + x
1706.72 s
[algebraic-graphs] OK: x + (y + z) == (x + y) + z
1706.72 s
[algebraic-graphs] OK: x * empty == x
1706.72 s
[algebraic-graphs] OK: empty * x == x
1706.72 s
[algebraic-graphs] OK: x * y == y * x
1706.72 s
[algebraic-graphs] OK: x * (y * z) == (x * y) * z
1706.72 s
[algebraic-graphs] OK: x * (y + z) == x * y + x * z
1706.72 s
[algebraic-graphs] OK: (x + y) * z == x * z + y * z
1706.72 s
[algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
1706.72 s
[algebraic-graphs] OK: x + empty == x
1706.72 s
[algebraic-graphs] OK: empty + x == x
1706.72 s
[algebraic-graphs] OK: x + x == x
1706.72 s
[algebraic-graphs] OK: x * y + x + y == x * y
1706.72 s
[algebraic-graphs] OK: x * x * x == x * x
1706.72 s
[algebraic-graphs]
1706.72 s
[algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
1706.72 s
[algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
1706.72 s
[algebraic-graphs]
1706.72 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
1706.72 s
[algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
1706.72 s
[algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
1706.72 s
[algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
1706.72 s
[algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
1706.72 s
[algebraic-graphs]
1706.72 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
1706.72 s
[algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
1706.72 s
[algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
1706.72 s
[algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
1706.73 s
[algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
1706.73 s
[algebraic-graphs]
1706.73 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
1706.73 s
[algebraic-graphs] OK: isEmpty empty == True
1706.73 s
[algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
1706.73 s
[algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
1706.73 s
[algebraic-graphs] OK: hasVertex x empty == False
1706.73 s
[algebraic-graphs]
1706.73 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
1706.73 s
[algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
1706.73 s
[algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
1706.73 s
[algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
1706.73 s
[algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
1706.73 s
[algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
1706.73 s
[algebraic-graphs]
1706.73 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
1706.73 s
[algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
1706.73 s
[algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
1706.73 s
[algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
1706.73 s
[algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
1706.73 s
[algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
1706.73 s
[algebraic-graphs]
1706.73 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
1706.73 s
[algebraic-graphs] OK: vertex . Left == leftVertex
1706.73 s
[algebraic-graphs] OK: vertex . Right == rightVertex
1706.73 s
[algebraic-graphs]
1706.73 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
1706.73 s
[algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
1706.73 s
[algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
1706.73 s
[algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
1706.73 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1706.73 s
[algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
1706.73 s
[algebraic-graphs]
1706.73 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
1706.73 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1706.73 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1706.73 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1706.73 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1706.73 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1706.73 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1706.73 s
[algebraic-graphs]
1706.73 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
1706.73 s
[algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
1706.73 s
[algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
1706.73 s
[algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
1706.73 s
[algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
1706.73 s
[algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
1706.73 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1706.73 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1706.73 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1706.73 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1706.73 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1706.73 s
[algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
1706.73 s
[algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
1706.73 s
[algebraic-graphs]
1706.73 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
1706.73 s
[algebraic-graphs] OK: vertices [] [] == empty
1706.73 s
[algebraic-graphs] OK: vertices [x] [] == leftVertex x
1706.73 s
[algebraic-graphs] OK: vertices [] [x] == rightVertex x
1706.73 s
[algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
1706.73 s
[algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
1706.73 s
[algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
1706.73 s
[algebraic-graphs]
1706.73 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
1706.73 s
[algebraic-graphs] OK: edges [] == empty
1706.73 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1706.73 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1706.73 s
[algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
1706.73 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1706.73 s
[algebraic-graphs]
1706.73 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
1706.73 s
[algebraic-graphs] OK: overlays [] == empty
1706.73 s
[algebraic-graphs] OK: overlays [x] == x
1706.73 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1706.73 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1706.73 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1706.73 s
[algebraic-graphs]
1706.73 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
1706.73 s
[algebraic-graphs] OK: connects [] == empty
1706.73 s
[algebraic-graphs] OK: connects [x] == x
1706.73 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1706.73 s
[algebraic-graphs] OK: connects == foldr connect empty
1706.73 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1706.73 s
[algebraic-graphs]
1706.73 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
1707.93 s
[algebraic-graphs] OK: swap empty == empty
1707.93 s
[algebraic-graphs] OK: swap . leftVertex == rightVertex
1707.93 s
[algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
1707.94 s
[algebraic-graphs] OK: swap (edge x y) == edge y x
1707.94 s
[algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
1707.94 s
[algebraic-graphs] OK: swap . swap == id
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
1707.94 s
[algebraic-graphs] OK: toBipartite empty == empty
1707.94 s
[algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
1707.94 s
[algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
1707.94 s
[algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
1707.94 s
[algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
1707.94 s
[algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
1707.94 s
[algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
1707.94 s
[algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
1707.94 s
[algebraic-graphs] OK: toBipartite . fromBipartite == id
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
1707.94 s
[algebraic-graphs] OK: toBipartiteWith f empty == empty
1707.94 s
[algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
1707.94 s
[algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
1707.94 s
[algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
1707.94 s
[algebraic-graphs] OK: toBipartiteWith id == toBipartite
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
1707.94 s
[algebraic-graphs] OK: fromBipartite empty == empty
1707.94 s
[algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
1707.94 s
[algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
1707.94 s
[algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
1707.94 s
[algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
1707.94 s
[algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
1707.94 s
[algebraic-graphs] OK: isEmpty empty == True
1707.94 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1707.94 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1707.94 s
[algebraic-graphs] OK: isEmpty == (==) empty
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
1707.94 s
[algebraic-graphs] OK: hasLeftVertex x empty == False
1707.94 s
[algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
1707.94 s
[algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
1707.94 s
[algebraic-graphs] OK: hasRightVertex x empty == False
1707.94 s
[algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
1707.94 s
[algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
1707.94 s
[algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
1707.94 s
[algebraic-graphs] OK: hasVertex . Right == hasRightVertex
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
1707.94 s
[algebraic-graphs] OK: hasEdge x y empty == False
1707.94 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1707.94 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1707.94 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
1707.94 s
[algebraic-graphs] OK: leftVertexCount empty == 0
1707.94 s
[algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
1707.94 s
[algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
1707.94 s
[algebraic-graphs] OK: leftVertexCount (edge x y) == 1
1707.94 s
[algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
1707.94 s
[algebraic-graphs] OK: rightVertexCount empty == 0
1707.94 s
[algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
1707.94 s
[algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
1707.94 s
[algebraic-graphs] OK: rightVertexCount (edge x y) == 1
1707.94 s
[algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
1707.94 s
[algebraic-graphs] OK: vertexCount empty == 0
1707.94 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1707.94 s
[algebraic-graphs] OK: vertexCount (edge x y) == 2
1707.94 s
[algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
1707.94 s
[algebraic-graphs] OK: edgeCount empty == 0
1707.94 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1707.94 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1707.94 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
1707.94 s
[algebraic-graphs] OK: leftVertexList empty == []
1707.94 s
[algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
1707.94 s
[algebraic-graphs] OK: leftVertexList (rightVertex x) == []
1707.94 s
[algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
1707.94 s
[algebraic-graphs] OK: rightVertexList empty == []
1707.94 s
[algebraic-graphs] OK: rightVertexList (leftVertex x) == []
1707.94 s
[algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
1707.94 s
[algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
1707.94 s
[algebraic-graphs] OK: vertexList empty == []
1707.94 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1707.94 s
[algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
1707.94 s
[algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
1707.94 s
[algebraic-graphs] OK: edgeList empty == []
1707.94 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1707.94 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1707.94 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
1707.94 s
[algebraic-graphs] OK: leftVertexSet empty == Set.empty
1707.94 s
[algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
1707.94 s
[algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
1707.94 s
[algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
1707.94 s
[algebraic-graphs] OK: rightVertexSet empty == Set.empty
1707.94 s
[algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
1707.94 s
[algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
1707.94 s
[algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
1707.94 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1707.94 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1707.94 s
[algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
1707.94 s
[algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
1707.94 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1707.94 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1707.94 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1707.94 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
1707.94 s
[algebraic-graphs] OK: leftAdjacencyList empty == []
1707.94 s
[algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
1707.94 s
[algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
1707.94 s
[algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
1707.94 s
[algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
1707.94 s
[algebraic-graphs] OK: rightAdjacencyList empty == []
1707.94 s
[algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
1707.94 s
[algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
1707.94 s
[algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
1707.94 s
[algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
1707.94 s
[algebraic-graphs] OK: evenList [] == Nil
1707.94 s
[algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
1707.94 s
[algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
1707.94 s
[algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
1707.94 s
[algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
1707.94 s
[algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
1707.94 s
[algebraic-graphs] OK: path Nil == empty
1707.94 s
[algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
1707.94 s
[algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
1707.94 s
[algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
1707.94 s
[algebraic-graphs] OK: circuit [] == empty
1707.94 s
[algebraic-graphs] OK: circuit [(x,y)] == edge x y
1707.94 s
[algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
1707.94 s
[algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
1707.94 s
[algebraic-graphs] OK: biclique [] [] == empty
1707.94 s
[algebraic-graphs] OK: biclique xs [] == vertices xs []
1707.94 s
[algebraic-graphs] OK: biclique [] ys == vertices [] ys
1707.94 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
1707.94 s
[algebraic-graphs] OK: star x [] == leftVertex x
1707.94 s
[algebraic-graphs] OK: star x [y] == edge x y
1707.94 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1707.94 s
[algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
1707.94 s
[algebraic-graphs]
1707.94 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
1707.94 s
[algebraic-graphs] OK: stars [] == empty
1707.94 s
[algebraic-graphs] OK: stars [(x, [])] == leftVertex x
1707.94 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1707.94 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1721.59 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1721.61 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1721.61 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
1721.61 s
[algebraic-graphs] OK: mesh xs [] == empty
1721.61 s
[algebraic-graphs] OK: mesh [] ys == empty
1721.61 s
[algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
1721.61 s
[algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
1721.61 s
[algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
1721.61 s
[algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
1721.61 s
[algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
1721.61 s
[algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
1721.61 s
[algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
1721.61 s
[algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
1721.61 s
[algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
1721.61 s
[algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
1721.61 s
[algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
1721.61 s
[algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
1721.61 s
[algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
1721.61 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
1721.61 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1721.61 s
[algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
1721.61 s
[algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
1721.61 s
[algebraic-graphs] OK: bimap f g empty == empty
1721.61 s
[algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
1721.61 s
[algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
1721.61 s
[algebraic-graphs] OK: bimap id id == id
1721.61 s
[algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
1721.61 s
[algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] OK: box x y ~~ box y x
1721.61 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1721.61 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1721.61 s
[algebraic-graphs] OK: box x (leftVertex ()) ~~ x
1721.61 s
[algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
1721.61 s
[algebraic-graphs] OK: box x empty ~~ empty
1721.61 s
[algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
1721.61 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
1721.61 s
[algebraic-graphs] OK: consistent empty == True
1721.61 s
[algebraic-graphs] OK: consistent (vertex x) == True
1721.61 s
[algebraic-graphs] OK: consistent (edge x y) == True
1721.61 s
[algebraic-graphs] OK: consistent (edges x) == True
1721.61 s
[algebraic-graphs] OK: consistent (toBipartite x) == True
1721.61 s
[algebraic-graphs] OK: consistent (swap x) == True
1721.61 s
[algebraic-graphs] OK: consistent (circuit xs) == True
1721.61 s
[algebraic-graphs] OK: consistent (biclique xs ys) == True
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
1721.61 s
[algebraic-graphs] OK: detectParts empty == Right empty
1721.61 s
[algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
1721.61 s
[algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
1721.61 s
[algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
1721.61 s
[algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
1721.61 s
[algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
1721.61 s
[algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
1721.61 s
[algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
1721.61 s
[algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
1721.61 s
[algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
1721.61 s
[algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
1721.61 s
[algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
1721.61 s
[algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
1721.61 s
[algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
1721.61 s
[algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
1721.61 s
[algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
1721.61 s
[algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
1721.61 s
[algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
1721.61 s
[algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
1721.61 s
[algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
1721.61 s
[algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
1721.61 s
[algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
1721.61 s
[algebraic-graphs] OK: show (matching []) == "matching []"
1721.61 s
[algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
1721.61 s
[algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
1721.61 s
[algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
1721.61 s
[algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
1721.61 s
[algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
1721.61 s
[algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
1721.61 s
[algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
1721.61 s
[algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
1721.61 s
[algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
1721.61 s
[algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
1721.61 s
[algebraic-graphs] OK: isMatchingOf (matching []) x == True
1721.61 s
[algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
1721.61 s
[algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
1721.61 s
[algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
1721.61 s
[algebraic-graphs] OK: matchingSize (matching []) == 0
1721.61 s
[algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
1721.61 s
[algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
1721.61 s
[algebraic-graphs] OK: matchingSize (matching xs) <= length xs
1721.61 s
[algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
1721.61 s
[algebraic-graphs] OK: maxMatching empty == matching []
1721.61 s
[algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
1721.61 s
[algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
1721.61 s
[algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
1721.61 s
[algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
1721.61 s
[algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
1721.61 s
[algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
1721.61 s
[algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
1721.61 s
[algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
1721.61 s
[algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
1721.61 s
[algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
1721.61 s
[algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
1721.61 s
[algebraic-graphs]
1721.61 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
1721.61 s
[algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
1723.65 s
[algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
1723.65 s
[algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
1723.65 s
[algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
1723.65 s
[algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
1723.65 s
[algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
1723.65 s
[algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
1723.65 s
[algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
1723.65 s
[algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
1723.65 s
[algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
1723.65 s
[algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
1723.65 s
[algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
1723.65 s
[algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
1723.65 s
[algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
1723.65 s
[algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
1723.65 s
[algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
1723.65 s
[algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
1723.65 s
[algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
1723.65 s
[algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
1723.65 s
[algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
1723.65 s
[algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
1723.65 s
[algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
1723.65 s
[algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
1723.65 s
[algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
1723.65 s
[algebraic-graphs] OK: consistentMatching (matching xs) == True
1723.65 s
[algebraic-graphs] OK: consistentMatching (maxMatching x) == True
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Export.Eq ============
1723.65 s
[algebraic-graphs] OK: mempty /= literal ""
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Export.Ord ============
1723.65 s
[algebraic-graphs] OK: mempty < literal ""
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Export.isEmpty ============
1723.65 s
[algebraic-graphs] OK: isEmpty mempty == True
1723.65 s
[algebraic-graphs] OK: isEmpty (literal "") == False
1723.65 s
[algebraic-graphs] OK: isEmpty x == (x == mempty)
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Export.literal ============
1723.65 s
[algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
1723.65 s
[algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
1723.65 s
[algebraic-graphs] OK: render . literal == id
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Export.render ============
1723.65 s
[algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
1723.65 s
[algebraic-graphs] OK: render mempty == mempty
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Export.<+> ============
1723.65 s
[algebraic-graphs] OK: x <+> mempty == x
1723.65 s
[algebraic-graphs] OK: mempty <+> x == x
1723.65 s
[algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
1723.65 s
[algebraic-graphs] OK: "name" <+> "surname" == "name surname"
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Export.brackets ============
1723.65 s
[algebraic-graphs] OK: brackets "i" == "[i]"
1723.65 s
[algebraic-graphs] OK: brackets mempty == "[]"
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Export.doubleQuotes ============
1723.65 s
[algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
1723.65 s
[algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Export.indent ============
1723.65 s
[algebraic-graphs] OK: indent 0 == id
1723.65 s
[algebraic-graphs] OK: indent 1 mempty == " "
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Export.unlines ============
1723.65 s
[algebraic-graphs] OK: unlines [] == mempty
1723.65 s
[algebraic-graphs] OK: unlines [mempty] == "\n"
1723.65 s
[algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Export.export ============
1723.65 s
[algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Export.Dot.export ============
1723.65 s
[algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] =========== Export.Dot.attributeQuoting ============
1723.65 s
[algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Export.Dot.exportAsIs ============
1723.65 s
[algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Export.Dot.exportViaShow ============
1723.65 s
[algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Graph ============
1723.65 s
[algebraic-graphs] OK: Axioms of graphs
1723.65 s
[algebraic-graphs] OK: Theorems of graphs
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Graph.Ord ============
1723.65 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1723.65 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1723.65 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1723.65 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1723.65 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1723.65 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1723.65 s
[algebraic-graphs] OK: x <= x + y
1723.65 s
[algebraic-graphs] OK: x + y <= x * y
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Graph.empty ============
1723.65 s
[algebraic-graphs] OK: isEmpty empty == True
1723.65 s
[algebraic-graphs] OK: hasVertex x empty == False
1723.65 s
[algebraic-graphs] OK: vertexCount empty == 0
1723.65 s
[algebraic-graphs] OK: edgeCount empty == 0
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Graph.vertex ============
1723.65 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1723.65 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1723.65 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1723.65 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Graph.edge ============
1723.65 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1723.65 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1723.65 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1723.65 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1723.65 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Graph.overlay ============
1723.65 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1723.65 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1723.65 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1723.65 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1723.65 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1723.65 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1723.65 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1723.65 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Graph.connect ============
1723.65 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1723.65 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1723.65 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1723.65 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1723.65 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1723.65 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1723.65 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1723.65 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1723.65 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1723.65 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Graph.vertices ============
1723.65 s
[algebraic-graphs] OK: vertices [] == empty
1723.65 s
[algebraic-graphs] OK: vertices [x] == vertex x
1723.65 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1723.65 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1723.65 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1723.65 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Graph.edges ============
1723.65 s
[algebraic-graphs] OK: edges [] == empty
1723.65 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1723.65 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1723.65 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Graph.overlays ============
1723.65 s
[algebraic-graphs] OK: overlays [] == empty
1723.65 s
[algebraic-graphs] OK: overlays [x] == x
1723.65 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1723.65 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1723.65 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Graph.connects ============
1723.65 s
[algebraic-graphs] OK: connects [] == empty
1723.65 s
[algebraic-graphs] OK: connects [x] == x
1723.65 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1723.65 s
[algebraic-graphs] OK: connects == foldr connect empty
1723.65 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Graph.isSubgraphOf ============
1723.65 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1723.65 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1723.65 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1723.65 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1723.65 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1723.65 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1723.65 s
[algebraic-graphs]
1723.65 s
[algebraic-graphs] ============ Graph.toGraph et al. ============
1723.65 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1723.65 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1723.65 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1723.65 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1723.65 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1723.65 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1723.65 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1723.65 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1723.65 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1724.31 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1724.31 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1724.31 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1724.31 s
[algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
1724.31 s
[algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
1724.31 s
[algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
1724.31 s
[algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
1724.31 s
[algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
1724.31 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1724.31 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1724.31 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1724.31 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1724.31 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1724.31 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1724.31 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1724.31 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1724.31 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1724.31 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1724.31 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1724.31 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1724.31 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1724.31 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1724.31 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1724.31 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1724.31 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1724.31 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.foldg ============
1724.31 s
[algebraic-graphs] OK: foldg empty vertex overlay connect == id
1724.31 s
[algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
1724.31 s
[algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
1724.31 s
[algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.isEmpty ============
1724.31 s
[algebraic-graphs] OK: isEmpty empty == True
1724.31 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1724.31 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1724.31 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1724.31 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.hasVertex ============
1724.31 s
[algebraic-graphs] OK: hasVertex x empty == False
1724.31 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1724.31 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.hasEdge ============
1724.31 s
[algebraic-graphs] OK: hasEdge x y empty == False
1724.31 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1724.31 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1724.31 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1724.31 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.vertexCount ============
1724.31 s
[algebraic-graphs] OK: vertexCount empty == 0
1724.31 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1724.31 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1724.31 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.edgeCount ============
1724.31 s
[algebraic-graphs] OK: edgeCount empty == 0
1724.31 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1724.31 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1724.31 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.vertexList ============
1724.31 s
[algebraic-graphs] OK: vertexList empty == []
1724.31 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1724.31 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.vertexSet ============
1724.31 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1724.31 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1724.31 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.vertexIntSet ============
1724.31 s
[algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
1724.31 s
[algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
1724.31 s
[algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
1724.31 s
[algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.edgeList ============
1724.31 s
[algebraic-graphs] OK: edgeList empty == []
1724.31 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1724.31 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1724.31 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1724.31 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.edgeSet ============
1724.31 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1724.31 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1724.31 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1724.31 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.adjacencyList ============
1724.31 s
[algebraic-graphs] OK: adjacencyList empty == []
1724.31 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1724.31 s
[algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
1724.31 s
[algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.preSet ============
1724.31 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1724.31 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1724.31 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1724.31 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.preIntSet ============
1724.31 s
[algebraic-graphs] OK: preIntSet x empty == IntSet.empty
1724.31 s
[algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
1724.31 s
[algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
1724.31 s
[algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.postSet ============
1724.31 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1724.31 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1724.31 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1724.31 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.postIntSet ============
1724.31 s
[algebraic-graphs] OK: postIntSet x empty == IntSet.empty
1724.31 s
[algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
1724.31 s
[algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
1724.31 s
[algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.size ============
1724.31 s
[algebraic-graphs] OK: size empty == 1
1724.31 s
[algebraic-graphs] OK: size (vertex x) == 1
1724.31 s
[algebraic-graphs] OK: size (overlay x y) == size x + size y
1724.31 s
[algebraic-graphs] OK: size (connect x y) == size x + size y
1724.31 s
[algebraic-graphs] OK: size x >= 1
1724.31 s
[algebraic-graphs] OK: size x >= vertexCount x
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.path ============
1724.31 s
[algebraic-graphs] OK: path [] == empty
1724.31 s
[algebraic-graphs] OK: path [x] == vertex x
1724.31 s
[algebraic-graphs] OK: path [x,y] == edge x y
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.circuit ============
1724.31 s
[algebraic-graphs] OK: circuit [] == empty
1724.31 s
[algebraic-graphs] OK: circuit [x] == edge x x
1724.31 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.clique ============
1724.31 s
[algebraic-graphs] OK: clique [] == empty
1724.31 s
[algebraic-graphs] OK: clique [x] == vertex x
1724.31 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1724.31 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1724.31 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.biclique ============
1724.31 s
[algebraic-graphs] OK: biclique [] [] == empty
1724.31 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1724.31 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1724.31 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1724.31 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.star ============
1724.31 s
[algebraic-graphs] OK: star x [] == vertex x
1724.31 s
[algebraic-graphs] OK: star x [y] == edge x y
1724.31 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1724.31 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.stars ============
1724.31 s
[algebraic-graphs] OK: stars [] == empty
1724.31 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1724.31 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1724.31 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1724.31 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1724.31 s
[algebraic-graphs] OK: stars . adjacencyList == id
1724.31 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.tree ============
1724.31 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1724.31 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1724.31 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1724.31 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.forest ============
1724.31 s
[algebraic-graphs] OK: forest [] == empty
1724.31 s
[algebraic-graphs] OK: forest [x] == tree x
1724.31 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1724.31 s
[algebraic-graphs] OK: forest == overlays . map tree
1724.31 s
[algebraic-graphs]
1724.31 s
[algebraic-graphs] ============ Graph.removeVertex ============
1727.51 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1727.51 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1727.51 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1727.61 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1727.61 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1727.61 s
[algebraic-graphs]
1727.61 s
[algebraic-graphs] ============ Graph.removeEdge ============
1727.61 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1727.61 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1727.61 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1727.61 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1727.61 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1727.61 s
[algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
1727.61 s
[algebraic-graphs]
1727.61 s
[algebraic-graphs] ============ Graph.replaceVertex ============
1727.61 s
[algebraic-graphs] OK: replaceVertex x x == id
1727.61 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1727.61 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1727.61 s
[algebraic-graphs]
1727.61 s
[algebraic-graphs] ============ Graph.mergeVertices ============
1727.61 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1727.61 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1727.61 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1727.61 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1727.61 s
[algebraic-graphs]
1727.61 s
[algebraic-graphs] ============ Graph.transpose ============
1727.61 s
[algebraic-graphs] OK: transpose empty == empty
1727.61 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1727.61 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1727.61 s
[algebraic-graphs] OK: transpose . transpose == id
1727.61 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1727.61 s
[algebraic-graphs]
1727.61 s
[algebraic-graphs] ============ Graph.gmap ============
1727.61 s
[algebraic-graphs] OK: gmap f empty == empty
1727.61 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1727.61 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1727.61 s
[algebraic-graphs] OK: gmap id == id
1727.61 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1727.61 s
[algebraic-graphs]
1727.61 s
[algebraic-graphs] ============ Graph.induce ============
1727.61 s
[algebraic-graphs] OK: induce (const True ) x == x
1727.61 s
[algebraic-graphs] OK: induce (const False) x == empty
1727.61 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1727.61 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1727.61 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1727.61 s
[algebraic-graphs]
1727.61 s
[algebraic-graphs] ============ Graph.induceJust ============
1727.61 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1727.61 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1727.61 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1727.61 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1727.61 s
[algebraic-graphs]
1727.61 s
[algebraic-graphs] ============ Graph.compose ============
1727.61 s
[algebraic-graphs] OK: compose empty x == empty
1727.61 s
[algebraic-graphs] OK: compose x empty == empty
1727.61 s
[algebraic-graphs] OK: compose (vertex x) y == empty
1727.61 s
[algebraic-graphs] OK: compose x (vertex y) == empty
1727.61 s
[algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
1727.61 s
[algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
1727.61 s
[algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
1727.61 s
[algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
1727.61 s
[algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
1727.61 s
[algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
1727.61 s
[algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
1727.61 s
[algebraic-graphs]
1727.61 s
[algebraic-graphs] ============ Graph.(===) ============
1727.61 s
[algebraic-graphs] OK: x === x == True
1727.61 s
[algebraic-graphs] OK: x === x + empty == False
1727.61 s
[algebraic-graphs] OK: x + y === x + y == True
1727.61 s
[algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
1727.61 s
[algebraic-graphs] OK: x + y === x * y == False
1727.61 s
[algebraic-graphs]
1727.61 s
[algebraic-graphs] ============ Graph.mesh ============
1727.61 s
[algebraic-graphs] OK: mesh xs [] == empty
1727.61 s
[algebraic-graphs] OK: mesh [] ys == empty
1727.61 s
[algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
1727.61 s
[algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
1727.61 s
[algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
1727.61 s
[algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
1727.61 s
[algebraic-graphs]
1727.61 s
[algebraic-graphs] ============ Graph.torus ============
1727.61 s
[algebraic-graphs] OK: torus xs [] == empty
1727.62 s
[algebraic-graphs] OK: torus [] ys == empty
1727.62 s
[algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
1727.62 s
[algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
1727.62 s
[algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
1727.62 s
[algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Graph.deBruijn ============
1727.62 s
[algebraic-graphs] OK: deBruijn 0 xs == edge [] []
1727.62 s
[algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
1727.62 s
[algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
1727.62 s
[algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
1727.62 s
[algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
1727.62 s
[algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
1727.62 s
[algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
1727.62 s
[algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Graph.splitVertex ============
1727.62 s
[algebraic-graphs] OK: splitVertex x [] == removeVertex x
1727.62 s
[algebraic-graphs] OK: splitVertex x [x] == id
1727.62 s
[algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
1727.62 s
[algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Graph.bind ============
1727.62 s
[algebraic-graphs] OK: bind empty f == empty
1727.62 s
[algebraic-graphs] OK: bind (vertex x) f == f x
1727.62 s
[algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
1727.62 s
[algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
1727.62 s
[algebraic-graphs] OK: bind x (const empty) == empty
1727.62 s
[algebraic-graphs] OK: bind x vertex == x
1727.62 s
[algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Graph.simplify ============
1727.62 s
[algebraic-graphs] OK: simplify == id
1727.62 s
[algebraic-graphs] OK: size (simplify x) <= size x
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Graph.box ============
1727.62 s
[algebraic-graphs] OK: box x y ~~ box y x
1727.62 s
[algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
1727.62 s
[algebraic-graphs] OK: box x (vertex ()) ~~ x
1727.62 s
[algebraic-graphs] OK: box x empty ~~ empty
1727.62 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1727.62 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1727.62 s
[algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
1727.62 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Graph.sparsify ============
1727.62 s
[algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
1727.62 s
[algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
1727.62 s
[algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
1727.62 s
[algebraic-graphs] OK: size (sparsify x) <= 3 * size x
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Graph.sparsifyKL ============
1727.62 s
[algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
1727.62 s
[algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
1727.62 s
[algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Graph.context ============
1727.62 s
[algebraic-graphs] OK: context (const False) x == Nothing
1727.62 s
[algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
1727.62 s
[algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
1727.62 s
[algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
1727.62 s
[algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Graph.buildg ============
1727.62 s
[algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
1727.62 s
[algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
1727.62 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
1727.62 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
1727.62 s
[algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
1727.62 s
[algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Internal.List ============
1727.62 s
[algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Graph.Label ============
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Any: instances ============
1727.62 s
[algebraic-graphs] OK: Semiring
1727.62 s
[algebraic-graphs] OK: StarSemiring
1727.62 s
[algebraic-graphs] OK: Dioid
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Distance Int: instances ============
1727.62 s
[algebraic-graphs] OK: Semiring
1727.62 s
[algebraic-graphs] OK: StarSemiring
1727.62 s
[algebraic-graphs] OK: Dioid
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Capacity Int: instances ============
1727.62 s
[algebraic-graphs] OK: Semiring
1727.62 s
[algebraic-graphs] OK: StarSemiring
1727.62 s
[algebraic-graphs] OK: Dioid
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Minimum (Path Int): instances ============
1727.62 s
[algebraic-graphs] OK: LeftNearRing
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ PowerSet (Path Int): instances ============
1727.62 s
[algebraic-graphs] OK: Semiring
1727.62 s
[algebraic-graphs] OK: Dioid
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Count Int: instances ============
1727.62 s
[algebraic-graphs] OK: Semiring
1727.62 s
[algebraic-graphs] OK: StarSemiring
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
1727.62 s
[algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
1727.62 s
[algebraic-graphs] OK: empty
1727.62 s
[algebraic-graphs] OK: vertex
1727.62 s
[algebraic-graphs] OK: edge
1727.62 s
[algebraic-graphs] OK: overlay
1727.62 s
[algebraic-graphs] OK: connect
1727.62 s
[algebraic-graphs] OK: vertices
1727.62 s
[algebraic-graphs] OK: edges
1727.62 s
[algebraic-graphs] OK: overlays
1727.62 s
[algebraic-graphs] OK: fromAdjacencyMaps
1727.62 s
[algebraic-graphs] OK: removeVertex
1727.62 s
[algebraic-graphs] OK: removeEdge
1727.62 s
[algebraic-graphs] OK: replaceVertex
1727.62 s
[algebraic-graphs] OK: replaceEdge
1727.62 s
[algebraic-graphs] OK: transpose
1727.62 s
[algebraic-graphs] OK: gmap
1727.62 s
[algebraic-graphs] OK: emap
1727.62 s
[algebraic-graphs] OK: induce
1727.62 s
[algebraic-graphs] OK: closure
1727.62 s
[algebraic-graphs] OK: reflexiveClosure
1727.62 s
[algebraic-graphs] OK: symmetricClosure
1727.62 s
[algebraic-graphs] OK: transitiveClosure
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
1727.62 s
[algebraic-graphs] OK: isEmpty empty == True
1727.62 s
[algebraic-graphs] OK: hasVertex x empty == False
1727.62 s
[algebraic-graphs] OK: vertexCount empty == 0
1727.62 s
[algebraic-graphs] OK: edgeCount empty == 0
1727.62 s
[algebraic-graphs]
1727.62 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
1727.62 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1727.62 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1727.62 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1727.62 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1727.62 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
1729.91 s
[algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
1729.91 s
[algebraic-graphs] OK: edge zero x y == vertices [x,y]
1729.91 s
[algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
1729.91 s
[algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
1729.91 s
[algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
1729.91 s
[algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
1729.91 s
[algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
1729.91 s
[algebraic-graphs] OK: x -<e>- y == edge e x y
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
1729.91 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1729.91 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1729.91 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1729.91 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1729.91 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1729.91 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1729.91 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1729.91 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
1729.91 s
[algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
1729.91 s
[algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
1729.91 s
[algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
1729.91 s
[algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
1729.91 s
[algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
1729.91 s
[algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
1729.91 s
[algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1729.91 s
[algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
1729.91 s
[algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
1729.91 s
[algebraic-graphs] OK: vertices [] == empty
1729.91 s
[algebraic-graphs] OK: vertices [x] == vertex x
1729.91 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1729.91 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1729.91 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1729.91 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
1729.91 s
[algebraic-graphs] OK: edges [] == empty
1729.91 s
[algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
1729.91 s
[algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
1729.91 s
[algebraic-graphs] OK: overlays [] == empty
1729.91 s
[algebraic-graphs] OK: overlays [x] == x
1729.91 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1729.91 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1729.91 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
1729.91 s
[algebraic-graphs] OK: fromAdjacencyMaps [] == empty
1729.91 s
[algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
1729.91 s
[algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
1729.91 s
[algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
1729.91 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1729.91 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1729.91 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
1729.91 s
[algebraic-graphs] OK: isEmpty empty == True
1729.91 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1729.91 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1729.91 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1729.91 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
1729.91 s
[algebraic-graphs] OK: hasVertex x empty == False
1729.91 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1729.91 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
1729.91 s
[algebraic-graphs] OK: hasEdge x y empty == False
1729.91 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1729.91 s
[algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
1729.91 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1729.91 s
[algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
1729.91 s
[algebraic-graphs] OK: edgeLabel x y empty == zero
1729.91 s
[algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
1729.91 s
[algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
1729.91 s
[algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
1729.91 s
[algebraic-graphs] OK: vertexCount empty == 0
1729.91 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1729.91 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1729.91 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
1729.91 s
[algebraic-graphs] OK: edgeCount empty == 0
1729.91 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1729.91 s
[algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
1729.91 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
1729.91 s
[algebraic-graphs] OK: vertexList empty == []
1729.91 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1729.91 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
1729.91 s
[algebraic-graphs] OK: edgeList empty == []
1729.91 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1729.91 s
[algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
1729.91 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1729.91 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1729.91 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
1729.91 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1729.91 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1729.91 s
[algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
1729.91 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1729.91 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1729.91 s
[algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
1729.91 s
[algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
1729.91 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1729.91 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1729.91 s
[algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
1729.91 s
[algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
1729.91 s
[algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
1729.91 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1729.91 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1729.91 s
[algebraic-graphs] OK: removeVertex x (edge e x x) == empty
1729.91 s
[algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
1729.91 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
1729.91 s
[algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
1729.91 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1729.91 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1729.91 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1729.91 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
1729.91 s
[algebraic-graphs] OK: replaceVertex x x == id
1729.91 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1729.91 s
[algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
1729.91 s
[algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
1729.91 s
[algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
1729.91 s
[algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
1729.91 s
[algebraic-graphs] OK: transpose empty == empty
1729.91 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1729.91 s
[algebraic-graphs] OK: transpose (edge e x y) == edge e y x
1729.91 s
[algebraic-graphs] OK: transpose . transpose == id
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
1729.91 s
[algebraic-graphs] OK: gmap f empty == empty
1729.91 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1729.91 s
[algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
1729.91 s
[algebraic-graphs] OK: gmap id == id
1729.91 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
1729.91 s
[algebraic-graphs] OK: emap h empty == empty
1729.91 s
[algebraic-graphs] OK: emap h (vertex x) == vertex x
1729.91 s
[algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
1729.91 s
[algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
1729.91 s
[algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
1729.91 s
[algebraic-graphs] OK: emap id == id
1729.91 s
[algebraic-graphs] OK: emap g . emap h == emap (g . h)
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
1729.91 s
[algebraic-graphs] OK: induce (const True ) x == x
1729.91 s
[algebraic-graphs] OK: induce (const False) x == empty
1729.91 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1729.91 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1729.91 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1729.91 s
[algebraic-graphs]
1729.91 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
1731.06 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1731.06 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1731.06 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1731.06 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1731.06 s
[algebraic-graphs]
1731.06 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
1731.06 s
[algebraic-graphs] OK: closure empty == empty
1731.06 s
[algebraic-graphs] OK: closure (vertex x) == edge one x x
1731.06 s
[algebraic-graphs] OK: closure (edge e x x) == edge one x x
1731.06 s
[algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
1731.06 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1731.06 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1731.07 s
[algebraic-graphs] OK: closure . closure == closure
1731.07 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
1731.07 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1731.07 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
1731.07 s
[algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
1731.07 s
[algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
1731.07 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
1731.07 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1731.07 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1731.07 s
[algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
1731.07 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1731.07 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
1731.07 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1731.07 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1731.07 s
[algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
1731.07 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.empty ============
1731.07 s
[algebraic-graphs] OK: isEmpty empty == True
1731.07 s
[algebraic-graphs] OK: hasVertex x empty == False
1731.07 s
[algebraic-graphs] OK: vertexCount empty == 0
1731.07 s
[algebraic-graphs] OK: edgeCount empty == 0
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.vertex ============
1731.07 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1731.07 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1731.07 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1731.07 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.edge ============
1731.07 s
[algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
1731.07 s
[algebraic-graphs] OK: edge zero x y == vertices [x,y]
1731.07 s
[algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
1731.07 s
[algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
1731.07 s
[algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
1731.07 s
[algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
1731.07 s
[algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
1731.07 s
[algebraic-graphs] OK: x -<e>- y == edge e x y
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.overlay ============
1731.07 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1731.07 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1731.07 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1731.07 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1731.07 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1731.07 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1731.07 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1731.07 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
1731.07 s
[algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
1731.07 s
[algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.connect ============
1731.07 s
[algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
1731.07 s
[algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
1731.07 s
[algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
1731.07 s
[algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
1731.07 s
[algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1731.07 s
[algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
1731.07 s
[algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.vertices ============
1731.07 s
[algebraic-graphs] OK: vertices [] == empty
1731.07 s
[algebraic-graphs] OK: vertices [x] == vertex x
1731.07 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1731.07 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1731.07 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1731.07 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.edges ============
1731.07 s
[algebraic-graphs] OK: edges [] == empty
1731.07 s
[algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
1731.07 s
[algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.overlays ============
1731.07 s
[algebraic-graphs] OK: overlays [] == empty
1731.07 s
[algebraic-graphs] OK: overlays [x] == x
1731.07 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1731.07 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1731.07 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.foldg ============
1731.07 s
[algebraic-graphs] OK: foldg empty vertex connect == id
1731.07 s
[algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
1731.07 s
[algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
1731.07 s
[algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
1731.07 s
[algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
1731.07 s
[algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.buildg ============
1731.07 s
[algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
1731.07 s
[algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
1731.07 s
[algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
1731.07 s
[algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
1731.07 s
[algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
1731.07 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1731.07 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1731.07 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.isEmpty ============
1731.07 s
[algebraic-graphs] OK: isEmpty empty == True
1731.07 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1731.07 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1731.07 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1731.07 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.size ============
1731.07 s
[algebraic-graphs] OK: size empty == 1
1731.07 s
[algebraic-graphs] OK: size (vertex x) == 1
1731.07 s
[algebraic-graphs] OK: size (overlay x y) == size x + size y
1731.07 s
[algebraic-graphs] OK: size (connect x y) == size x + size y
1731.07 s
[algebraic-graphs] OK: size x >= 1
1731.07 s
[algebraic-graphs] OK: size x >= vertexCount x
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.hasVertex ============
1731.07 s
[algebraic-graphs] OK: hasVertex x empty == False
1731.07 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1731.07 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.hasEdge ============
1731.07 s
[algebraic-graphs] OK: hasEdge x y empty == False
1731.07 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1731.07 s
[algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
1731.07 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1731.07 s
[algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
1731.07 s
[algebraic-graphs] OK: edgeLabel x y empty == zero
1731.07 s
[algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
1731.07 s
[algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
1731.07 s
[algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.vertexCount ============
1731.07 s
[algebraic-graphs] OK: vertexCount empty == 0
1731.07 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1731.07 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1731.07 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.edgeCount ============
1731.07 s
[algebraic-graphs] OK: edgeCount empty == 0
1731.07 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1731.07 s
[algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
1731.07 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.vertexList ============
1731.07 s
[algebraic-graphs] OK: vertexList empty == []
1731.07 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1731.07 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.edgeList ============
1731.07 s
[algebraic-graphs] OK: edgeList empty == []
1731.07 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1731.07 s
[algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.vertexSet ============
1731.07 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1731.07 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1731.07 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.edgeSet ============
1731.07 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1731.07 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1731.07 s
[algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
1731.07 s
[algebraic-graphs]
1731.07 s
[algebraic-graphs] ============ Labelled.Graph.preSet ============
1731.07 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1731.07 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1733.79 s
[algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
1733.86 s
[algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
1733.86 s
[algebraic-graphs]
1733.86 s
[algebraic-graphs] ============ Labelled.Graph.postSet ============
1733.86 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1733.86 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1733.86 s
[algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
1733.86 s
[algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
1733.86 s
[algebraic-graphs]
1733.86 s
[algebraic-graphs] ============ Labelled.Graph.removeVertex ============
1733.86 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1733.86 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1733.86 s
[algebraic-graphs] OK: removeVertex x (edge e x x) == empty
1733.86 s
[algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
1733.86 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1733.86 s
[algebraic-graphs]
1733.86 s
[algebraic-graphs] ============ Labelled.Graph.removeEdge ============
1733.86 s
[algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
1733.86 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1733.86 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1733.86 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1733.86 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1733.86 s
[algebraic-graphs]
1733.86 s
[algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
1733.86 s
[algebraic-graphs] OK: replaceVertex x x == id
1733.86 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1733.86 s
[algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
1733.86 s
[algebraic-graphs]
1733.86 s
[algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
1733.86 s
[algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
1733.87 s
[algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
1733.87 s
[algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ Labelled.Graph.transpose ============
1733.87 s
[algebraic-graphs] OK: transpose empty == empty
1733.87 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1733.87 s
[algebraic-graphs] OK: transpose (edge e x y) == edge e y x
1733.87 s
[algebraic-graphs] OK: transpose . transpose == id
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ Labelled.Graph.fmap ============
1733.87 s
[algebraic-graphs] OK: fmap f empty == empty
1733.87 s
[algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
1733.87 s
[algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
1733.87 s
[algebraic-graphs] OK: fmap id == id
1733.87 s
[algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ Labelled.Graph.emap ============
1733.87 s
[algebraic-graphs] OK: emap h empty == empty
1733.87 s
[algebraic-graphs] OK: emap h (vertex x) == vertex x
1733.87 s
[algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
1733.87 s
[algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
1733.87 s
[algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
1733.87 s
[algebraic-graphs] OK: emap id == id
1733.87 s
[algebraic-graphs] OK: emap g . emap h == emap (g . h)
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ Labelled.Graph.induce ============
1733.87 s
[algebraic-graphs] OK: induce (const True ) x == x
1733.87 s
[algebraic-graphs] OK: induce (const False) x == empty
1733.87 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1733.87 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1733.87 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ Labelled.Graph.induceJust ============
1733.87 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1733.87 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1733.87 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1733.87 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ Labelled.Graph.closure ============
1733.87 s
[algebraic-graphs] OK: closure empty == empty
1733.87 s
[algebraic-graphs] OK: closure (vertex x) == edge one x x
1733.87 s
[algebraic-graphs] OK: closure (edge e x x) == edge one x x
1733.87 s
[algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
1733.87 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1733.87 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1733.87 s
[algebraic-graphs] OK: closure . closure == closure
1733.87 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
1733.87 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1733.87 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
1733.87 s
[algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
1733.87 s
[algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
1733.87 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
1733.87 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1733.87 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1733.87 s
[algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
1733.87 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1733.87 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
1733.87 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1733.87 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1733.87 s
[algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
1733.87 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ Labelled.Graph.context ============
1733.87 s
[algebraic-graphs] OK: context (const False) x == Nothing
1733.87 s
[algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
1733.87 s
[algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
1733.87 s
[algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
1733.87 s
[algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
1733.87 s
[algebraic-graphs] OK: Axioms of non-empty graphs
1733.87 s
[algebraic-graphs] OK: Theorems of non-empty graphs
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
1733.87 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1733.87 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1733.87 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1733.87 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1733.87 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1733.87 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1733.87 s
[algebraic-graphs] OK: x <= x + y
1733.87 s
[algebraic-graphs] OK: x + y <= x * y
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
1733.87 s
[algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
1733.87 s
[algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
1733.87 s
[algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
1733.87 s
[algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
1733.87 s
[algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
1733.87 s
[algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
1733.87 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
1733.87 s
[algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
1733.87 s
[algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
1733.87 s
[algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
1733.87 s
[algebraic-graphs] OK: toNonEmpty empty == Nothing
1733.87 s
[algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
1733.87 s
[algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
1733.87 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1733.87 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1733.87 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
1733.87 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1733.87 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1733.87 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1733.87 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1733.87 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
1733.87 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1733.87 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1733.87 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1733.87 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1733.87 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1733.87 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1733.87 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
1733.87 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1733.87 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1733.87 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1733.87 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1733.87 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1733.87 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1733.87 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1733.87 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1733.87 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
1733.87 s
[algebraic-graphs] OK: vertices1 [x] == vertex x
1733.87 s
[algebraic-graphs] OK: hasVertex x . vertices1 == elem x
1733.87 s
[algebraic-graphs] OK: vertexCount . vertices1 == length . nub
1733.87 s
[algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
1733.87 s
[algebraic-graphs]
1733.87 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
1733.87 s
[algebraic-graphs] OK: edges1 [(x,y)] == edge x y
1733.87 s
[algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
1733.87 s
[algebraic-graphs] OK: edgeCount . edges1 == length . nub
1733.87 s
[algebraic-graphs]
1736.73 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
1736.73 s
[algebraic-graphs] OK: overlays1 [x] == x
1736.73 s
[algebraic-graphs] OK: overlays1 [x,y] == overlay x y
1736.73 s
[algebraic-graphs]
1736.73 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
1736.73 s
[algebraic-graphs] OK: connects1 [x] == x
1736.73 s
[algebraic-graphs] OK: connects1 [x,y] == connect x y
1736.73 s
[algebraic-graphs]
1736.73 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
1736.73 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1736.73 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1736.73 s
[algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
1736.73 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1736.73 s
[algebraic-graphs]
1736.73 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
1736.73 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1736.73 s
[algebraic-graphs]
1736.73 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
1736.73 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1736.73 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1736.73 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1736.73 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1736.73 s
[algebraic-graphs]
1736.73 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
1736.73 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1736.73 s
[algebraic-graphs] OK: vertexCount x >= 1
1736.73 s
[algebraic-graphs] OK: vertexCount == length . vertexList1
1736.73 s
[algebraic-graphs]
1736.73 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
1736.73 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1736.73 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1736.73 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1736.73 s
[algebraic-graphs]
1736.73 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
1736.73 s
[algebraic-graphs] OK: vertexList1 (vertex x) == [x]
1736.73 s
[algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
1736.73 s
[algebraic-graphs]
1736.73 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
1736.73 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1736.73 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1736.73 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1736.74 s
[algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
1736.74 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
1736.74 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1736.74 s
[algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
1736.74 s
[algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
1736.74 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1736.74 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1736.74 s
[algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
1736.74 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1736.74 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1736.74 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
1736.74 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1736.74 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1736.74 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
1736.74 s
[algebraic-graphs] OK: path1 [x] == vertex x
1736.74 s
[algebraic-graphs] OK: path1 [x,y] == edge x y
1736.74 s
[algebraic-graphs] OK: path1 . reverse == transpose . path1
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
1736.74 s
[algebraic-graphs] OK: circuit1 [x] == edge x x
1736.74 s
[algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
1736.74 s
[algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
1736.74 s
[algebraic-graphs] OK: clique1 [x] == vertex x
1736.74 s
[algebraic-graphs] OK: clique1 [x,y] == edge x y
1736.74 s
[algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
1736.74 s
[algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
1736.74 s
[algebraic-graphs] OK: clique1 . reverse == transpose . clique1
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
1736.74 s
[algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1736.74 s
[algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
1736.74 s
[algebraic-graphs] OK: star x [] == vertex x
1736.74 s
[algebraic-graphs] OK: star x [y] == edge x y
1736.74 s
[algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
1736.74 s
[algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
1736.74 s
[algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
1736.74 s
[algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
1736.74 s
[algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
1736.74 s
[algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
1736.74 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1736.74 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
1736.74 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1736.74 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
1736.74 s
[algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
1736.74 s
[algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
1736.74 s
[algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
1736.74 s
[algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
1736.74 s
[algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
1736.74 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
1736.74 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1736.74 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1736.74 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
1736.74 s
[algebraic-graphs] OK: replaceVertex x x == id
1736.74 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1736.74 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
1736.74 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1736.74 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1736.74 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1736.74 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
1736.74 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1736.74 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1736.74 s
[algebraic-graphs] OK: transpose . transpose == id
1736.74 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
1736.74 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1736.74 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1736.74 s
[algebraic-graphs] OK: gmap id == id
1736.74 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
1736.74 s
[algebraic-graphs] OK: induce1 (const True ) x == Just x
1736.74 s
[algebraic-graphs] OK: induce1 (const False) x == Nothing
1736.74 s
[algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
1736.74 s
[algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
1736.74 s
[algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
1736.74 s
[algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
1736.74 s
[algebraic-graphs] OK: induceJust1 . gmap Just == Just
1736.74 s
[algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
1736.74 s
[algebraic-graphs] OK: closure (vertex x) == edge x x
1736.74 s
[algebraic-graphs] OK: closure (edge x x) == edge x x
1736.74 s
[algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
1736.74 s
[algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
1736.74 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1736.74 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1736.74 s
[algebraic-graphs] OK: closure . closure == closure
1736.74 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
1736.74 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
1736.74 s
[algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
1736.74 s
[algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
1736.74 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
1736.74 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1736.74 s
[algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
1736.74 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1736.74 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
1736.74 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1736.74 s
[algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
1736.74 s
[algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
1736.74 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ NonEmpty.Graph.============
1736.74 s
[algebraic-graphs] OK: Axioms of non-empty graphs
1736.74 s
[algebraic-graphs] OK: Theorems of non-empty graphs
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
1736.74 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1736.74 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1736.74 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1736.74 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1736.74 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1736.74 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1736.74 s
[algebraic-graphs] OK: x <= x + y
1736.74 s
[algebraic-graphs] OK: x + y <= x * y
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
1736.74 s
[algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
1736.74 s
[algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
1736.74 s
[algebraic-graphs] OK: fmap id == id
1736.74 s
[algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
1736.74 s
[algebraic-graphs]
1736.74 s
[algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
1736.74 s
[algebraic-graphs] OK: (vertex x >>= f) == f x
1738.06 s
[algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
1738.06 s
[algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
1738.06 s
[algebraic-graphs] OK: (x >>= vertex) == x
1738.06 s
[algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
1738.06 s
[algebraic-graphs] OK: toNonEmpty empty == Nothing
1738.06 s
[algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.vertex ============
1738.06 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1738.06 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1738.06 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1738.06 s
[algebraic-graphs] OK: size (vertex x) == 1
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.edge ============
1738.06 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1738.06 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1738.06 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1738.06 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1738.06 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.overlay ============
1738.06 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1738.06 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1738.06 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1738.06 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1738.06 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1738.06 s
[algebraic-graphs] OK: size (overlay x y) == size x + size y
1738.06 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1738.06 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
1738.06 s
[algebraic-graphs] OK: overlay1 empty x == x
1738.06 s
[algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.connect ============
1738.06 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1738.06 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1738.06 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1738.06 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1738.06 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1738.06 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1738.06 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1738.06 s
[algebraic-graphs] OK: size (connect x y) == size x + size y
1738.06 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1738.06 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
1738.06 s
[algebraic-graphs] OK: vertices1 [x] == vertex x
1738.06 s
[algebraic-graphs] OK: hasVertex x . vertices1 == elem x
1738.06 s
[algebraic-graphs] OK: vertexCount . vertices1 == length . nub
1738.06 s
[algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
1738.06 s
[algebraic-graphs] OK: edges1 [(x,y)] == edge x y
1738.06 s
[algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
1738.06 s
[algebraic-graphs] OK: edgeCount . edges1 == length . nub
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
1738.06 s
[algebraic-graphs] OK: overlays1 [x] == x
1738.06 s
[algebraic-graphs] OK: overlays1 [x,y] == overlay x y
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
1738.06 s
[algebraic-graphs] OK: connects1 [x] == x
1738.06 s
[algebraic-graphs] OK: connects1 [x,y] == connect x y
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
1738.06 s
[algebraic-graphs] OK: foldg1 vertex overlay connect == id
1738.06 s
[algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
1738.06 s
[algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
1738.06 s
[algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
1738.06 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1738.06 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1738.06 s
[algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
1738.06 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.(===) ============
1738.06 s
[algebraic-graphs] OK: x === x == True
1738.06 s
[algebraic-graphs] OK: x + y === x + y == True
1738.06 s
[algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
1738.06 s
[algebraic-graphs] OK: x + y === x * y == False
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.size ============
1738.06 s
[algebraic-graphs] OK: size (vertex x) == 1
1738.06 s
[algebraic-graphs] OK: size (overlay x y) == size x + size y
1738.06 s
[algebraic-graphs] OK: size (connect x y) == size x + size y
1738.06 s
[algebraic-graphs] OK: size x >= 1
1738.06 s
[algebraic-graphs] OK: size x >= vertexCount x
1738.06 s
[algebraic-graphs]
1738.06 s
[algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
1738.07 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
1738.07 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1738.07 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1738.07 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1738.07 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
1738.07 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1738.07 s
[algebraic-graphs] OK: vertexCount x >= 1
1738.07 s
[algebraic-graphs] OK: vertexCount == length . vertexList1
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
1738.07 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1738.07 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1738.07 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
1738.07 s
[algebraic-graphs] OK: vertexList1 (vertex x) == [x]
1738.07 s
[algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
1738.07 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1738.07 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1738.07 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1738.07 s
[algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
1738.07 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
1738.07 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1738.07 s
[algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
1738.07 s
[algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
1738.07 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1738.07 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1738.07 s
[algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.path1 ============
1738.07 s
[algebraic-graphs] OK: path1 [x] == vertex x
1738.07 s
[algebraic-graphs] OK: path1 [x,y] == edge x y
1738.07 s
[algebraic-graphs] OK: path1 . reverse == transpose . path1
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
1738.07 s
[algebraic-graphs] OK: circuit1 [x] == edge x x
1738.07 s
[algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
1738.07 s
[algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
1738.07 s
[algebraic-graphs] OK: clique1 [x] == vertex x
1738.07 s
[algebraic-graphs] OK: clique1 [x,y] == edge x y
1738.07 s
[algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
1738.07 s
[algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
1738.07 s
[algebraic-graphs] OK: clique1 . reverse == transpose . clique1
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
1738.07 s
[algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1738.07 s
[algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.star ============
1738.07 s
[algebraic-graphs] OK: star x [] == vertex x
1738.07 s
[algebraic-graphs] OK: star x [y] == edge x y
1738.07 s
[algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
1738.07 s
[algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
1738.07 s
[algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
1738.07 s
[algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
1738.07 s
[algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
1738.07 s
[algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.tree ============
1738.07 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1738.07 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
1738.07 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1738.07 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
1738.07 s
[algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
1738.07 s
[algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
1738.07 s
[algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
1738.07 s
[algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
1738.07 s
[algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
1738.07 s
[algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
1738.07 s
[algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
1738.07 s
[algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
1738.07 s
[algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
1738.07 s
[algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
1738.07 s
[algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
1738.07 s
[algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
1738.07 s
[algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
1738.07 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
1738.07 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1738.07 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1738.07 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1738.07 s
[algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
1738.07 s
[algebraic-graphs] OK: replaceVertex x x == id
1738.07 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1738.07 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1738.07 s
[algebraic-graphs]
1738.07 s
[algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
1738.07 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1743.76 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1743.76 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1743.77 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
1743.77 s
[algebraic-graphs] OK: splitVertex1 x [x] == id
1743.77 s
[algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
1743.77 s
[algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ NonEmpty.Graph.transpose ============
1743.77 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1743.77 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1743.77 s
[algebraic-graphs] OK: transpose . transpose == id
1743.77 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1743.77 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
1743.77 s
[algebraic-graphs] OK: induce1 (const True ) x == Just x
1743.77 s
[algebraic-graphs] OK: induce1 (const False) x == Nothing
1743.77 s
[algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
1743.77 s
[algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
1743.77 s
[algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
1743.77 s
[algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
1743.77 s
[algebraic-graphs] OK: induceJust1 . fmap Just == Just
1743.77 s
[algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ NonEmpty.Graph.simplify ============
1743.77 s
[algebraic-graphs] OK: simplify == id
1743.77 s
[algebraic-graphs] OK: size (simplify x) <= size x
1743.77 s
[algebraic-graphs] OK: simplify 1 === 1
1743.77 s
[algebraic-graphs] OK: simplify (1 + 1) === 1
1743.77 s
[algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
1743.77 s
[algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
1743.77 s
[algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
1743.77 s
[algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
1743.77 s
[algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
1743.77 s
[algebraic-graphs] OK: size (sparsify x) <= 3 * size x
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
1743.77 s
[algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
1743.77 s
[algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
1743.77 s
[algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ NonEmpty.Graph.box ============
1743.77 s
[algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
1743.77 s
[algebraic-graphs] OK: box x y ~~ box y x
1743.77 s
[algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
1743.77 s
[algebraic-graphs] OK: box x (vertex ()) ~~ x
1743.77 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1743.77 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1743.77 s
[algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
1743.77 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation ============
1743.77 s
[algebraic-graphs] OK: Axioms of graphs
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation.consistent ============
1743.77 s
[algebraic-graphs] OK: Consistency of the Arbitrary instance
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] OK: consistent empty == True
1743.77 s
[algebraic-graphs] OK: consistent (vertex x) == True
1743.77 s
[algebraic-graphs] OK: consistent (overlay x y) == True
1743.77 s
[algebraic-graphs] OK: consistent (connect x y) == True
1743.77 s
[algebraic-graphs] OK: consistent (edge x y) == True
1743.77 s
[algebraic-graphs] OK: consistent (edges xs) == True
1743.77 s
[algebraic-graphs] OK: consistent (stars xs) == True
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation.Show ============
1743.77 s
[algebraic-graphs] OK: show (empty ) == "empty"
1743.77 s
[algebraic-graphs] OK: show (1 ) == "vertex 1"
1743.77 s
[algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
1743.77 s
[algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
1743.77 s
[algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
1743.77 s
[algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
1743.77 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
1743.77 s
[algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
1743.77 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
1743.77 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation.Ord ============
1743.77 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1743.77 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1743.77 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1743.77 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1743.77 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1743.77 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1743.77 s
[algebraic-graphs] OK: x <= x + y
1743.77 s
[algebraic-graphs] OK: x + y <= x * y
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation.empty ============
1743.77 s
[algebraic-graphs] OK: isEmpty empty == True
1743.77 s
[algebraic-graphs] OK: hasVertex x empty == False
1743.77 s
[algebraic-graphs] OK: vertexCount empty == 0
1743.77 s
[algebraic-graphs] OK: edgeCount empty == 0
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation.vertex ============
1743.77 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1743.77 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1743.77 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1743.77 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation.edge ============
1743.77 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1743.77 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1743.77 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1743.77 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1743.77 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation.overlay ============
1743.77 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1743.77 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1743.77 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1743.77 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1743.77 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1743.77 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1743.77 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1743.77 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation.connect ============
1743.77 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1743.77 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1743.77 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1743.77 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1743.77 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1743.77 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1743.77 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1743.77 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1743.77 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1743.77 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation.vertices ============
1743.77 s
[algebraic-graphs] OK: vertices [] == empty
1743.77 s
[algebraic-graphs] OK: vertices [x] == vertex x
1743.77 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1743.77 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1743.77 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1743.77 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation.edges ============
1743.77 s
[algebraic-graphs] OK: edges [] == empty
1743.77 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1743.77 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1743.77 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation.overlays ============
1743.77 s
[algebraic-graphs] OK: overlays [] == empty
1743.77 s
[algebraic-graphs] OK: overlays [x] == x
1743.77 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1743.77 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1743.77 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation.connects ============
1743.77 s
[algebraic-graphs] OK: connects [] == empty
1743.77 s
[algebraic-graphs] OK: connects [x] == x
1743.77 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1743.77 s
[algebraic-graphs] OK: connects == foldr connect empty
1743.77 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation.isSubgraphOf ============
1743.77 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1743.77 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1743.77 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1743.77 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1743.77 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1743.77 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1743.77 s
[algebraic-graphs]
1743.77 s
[algebraic-graphs] ============ Relation.toGraph et al. ============
1743.77 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1743.77 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1743.77 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1743.77 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1743.77 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1743.77 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1743.77 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1743.77 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1743.77 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1743.77 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1743.77 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1743.77 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1743.77 s
[algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
1743.77 s
[algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
1743.77 s
[algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
1743.77 s
[algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
1743.77 s
[algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
1746.88 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1746.88 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1746.88 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1746.88 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1746.88 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1746.88 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1746.88 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1746.88 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1746.88 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1746.88 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1746.88 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1746.88 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1746.88 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1746.88 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1746.88 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1746.88 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1746.88 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1746.88 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.foldg ============
1746.88 s
[algebraic-graphs] OK: foldg empty vertex overlay connect == id
1746.88 s
[algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
1746.88 s
[algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
1746.88 s
[algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.isEmpty ============
1746.88 s
[algebraic-graphs] OK: isEmpty empty == True
1746.88 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1746.88 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1746.88 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1746.88 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.hasVertex ============
1746.88 s
[algebraic-graphs] OK: hasVertex x empty == False
1746.88 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1746.88 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.hasEdge ============
1746.88 s
[algebraic-graphs] OK: hasEdge x y empty == False
1746.88 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1746.88 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1746.88 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1746.88 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.vertexCount ============
1746.88 s
[algebraic-graphs] OK: vertexCount empty == 0
1746.88 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1746.88 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1746.88 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.edgeCount ============
1746.88 s
[algebraic-graphs] OK: edgeCount empty == 0
1746.88 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1746.88 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1746.88 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.vertexList ============
1746.88 s
[algebraic-graphs] OK: vertexList empty == []
1746.88 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1746.88 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.vertexSet ============
1746.88 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1746.88 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1746.88 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.vertexIntSet ============
1746.88 s
[algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
1746.88 s
[algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
1746.88 s
[algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
1746.88 s
[algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.edgeList ============
1746.88 s
[algebraic-graphs] OK: edgeList empty == []
1746.88 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1746.88 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1746.88 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1746.88 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.edgeSet ============
1746.88 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1746.88 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1746.88 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1746.88 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.adjacencyList ============
1746.88 s
[algebraic-graphs] OK: adjacencyList empty == []
1746.88 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1746.88 s
[algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
1746.88 s
[algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.preSet ============
1746.88 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1746.88 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1746.88 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1746.88 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.preIntSet ============
1746.88 s
[algebraic-graphs] OK: preIntSet x empty == IntSet.empty
1746.88 s
[algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
1746.88 s
[algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
1746.88 s
[algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.postSet ============
1746.88 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1746.88 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1746.88 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1746.88 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.postIntSet ============
1746.88 s
[algebraic-graphs] OK: postIntSet x empty == IntSet.empty
1746.88 s
[algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
1746.88 s
[algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
1746.88 s
[algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.path ============
1746.88 s
[algebraic-graphs] OK: path [] == empty
1746.88 s
[algebraic-graphs] OK: path [x] == vertex x
1746.88 s
[algebraic-graphs] OK: path [x,y] == edge x y
1746.88 s
[algebraic-graphs]
1746.88 s
[algebraic-graphs] ============ Relation.circuit ============
1746.88 s
[algebraic-graphs] OK: circuit [] == empty
1746.88 s
[algebraic-graphs] OK: circuit [x] == edge x x
1746.88 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1746.88 s
[algebraic-graphs]
1746.89 s
[algebraic-graphs] ============ Relation.clique ============
1746.89 s
[algebraic-graphs] OK: clique [] == empty
1746.89 s
[algebraic-graphs] OK: clique [x] == vertex x
1746.89 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1746.89 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1746.89 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1746.89 s
[algebraic-graphs]
1746.89 s
[algebraic-graphs] ============ Relation.biclique ============
1746.89 s
[algebraic-graphs] OK: biclique [] [] == empty
1746.89 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1746.89 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1746.89 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1746.89 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1746.89 s
[algebraic-graphs]
1746.89 s
[algebraic-graphs] ============ Relation.star ============
1746.89 s
[algebraic-graphs] OK: star x [] == vertex x
1746.89 s
[algebraic-graphs] OK: star x [y] == edge x y
1746.89 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1746.89 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1746.89 s
[algebraic-graphs]
1746.89 s
[algebraic-graphs] ============ Relation.stars ============
1746.89 s
[algebraic-graphs] OK: stars [] == empty
1746.89 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1746.89 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1746.89 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1746.89 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1746.89 s
[algebraic-graphs] OK: stars . adjacencyList == id
1746.89 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1746.89 s
[algebraic-graphs]
1746.89 s
[algebraic-graphs] ============ Relation.tree ============
1746.89 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1746.89 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1746.89 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1746.89 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1746.89 s
[algebraic-graphs]
1746.89 s
[algebraic-graphs] ============ Relation.forest ============
1746.89 s
[algebraic-graphs] OK: forest [] == empty
1746.89 s
[algebraic-graphs] OK: forest [x] == tree x
1746.89 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1746.89 s
[algebraic-graphs] OK: forest == overlays . map tree
1746.89 s
[algebraic-graphs]
1746.89 s
[algebraic-graphs] ============ Relation.removeVertex ============
1746.89 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1746.89 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1746.89 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1746.89 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1746.89 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1746.89 s
[algebraic-graphs]
1746.89 s
[algebraic-graphs] ============ Relation.removeEdge ============
1746.89 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1746.89 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1746.89 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1746.89 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1746.89 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1746.89 s
[algebraic-graphs]
1746.89 s
[algebraic-graphs] ============ Relation.replaceVertex ============
1746.89 s
[algebraic-graphs] OK: replaceVertex x x == id
1746.89 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1746.89 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1746.89 s
[algebraic-graphs]
1746.89 s
[algebraic-graphs] ============ Relation.mergeVertices ============
1746.89 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1765.80 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1765.80 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1765.81 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Relation.transpose ============
1765.81 s
[algebraic-graphs] OK: transpose empty == empty
1765.81 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1765.81 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1765.81 s
[algebraic-graphs] OK: transpose . transpose == id
1765.81 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Relation.gmap ============
1765.81 s
[algebraic-graphs] OK: gmap f empty == empty
1765.81 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1765.81 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1765.81 s
[algebraic-graphs] OK: gmap id == id
1765.81 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Relation.induce ============
1765.81 s
[algebraic-graphs] OK: induce (const True ) x == x
1765.81 s
[algebraic-graphs] OK: induce (const False) x == empty
1765.81 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1765.81 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1765.81 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Relation.compose ============
1765.81 s
[algebraic-graphs] OK: compose empty x == empty
1765.81 s
[algebraic-graphs] OK: compose x empty == empty
1765.81 s
[algebraic-graphs] OK: compose (vertex x) y == empty
1765.81 s
[algebraic-graphs] OK: compose x (vertex y) == empty
1765.81 s
[algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
1765.81 s
[algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
1765.81 s
[algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
1765.81 s
[algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
1765.81 s
[algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
1765.81 s
[algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Relation.closure ============
1765.81 s
[algebraic-graphs] OK: closure empty == empty
1765.81 s
[algebraic-graphs] OK: closure (vertex x) == edge x x
1765.81 s
[algebraic-graphs] OK: closure (edge x x) == edge x x
1765.81 s
[algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
1765.81 s
[algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
1765.81 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1765.81 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1765.81 s
[algebraic-graphs] OK: closure . closure == closure
1765.81 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Relation.reflexiveClosure ============
1765.81 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1765.81 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
1765.81 s
[algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
1765.81 s
[algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
1765.81 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Relation.symmetricClosure ============
1765.81 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1765.81 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1765.81 s
[algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
1765.81 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1765.81 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Relation.transitiveClosure ============
1765.81 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1765.81 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1765.81 s
[algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
1765.81 s
[algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
1765.81 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Relation.induceJust ============
1765.81 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1765.81 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1765.81 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1765.81 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ ReflexiveRelation ============
1765.81 s
[algebraic-graphs] OK: Axioms of reflexive graphs
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ TransitiveRelation ============
1765.81 s
[algebraic-graphs] OK: Axioms of transitive graphs
1765.81 s
[algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ PreorderRelation ============
1765.81 s
[algebraic-graphs] OK: Axioms of preorder graphs
1765.81 s
[algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Symmetric.Relation ============
1765.81 s
[algebraic-graphs] OK: Axioms of undirected graphs
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Symmetric.Relation.consistent ============
1765.81 s
[algebraic-graphs] OK: Consistency of the Arbitrary instance
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] OK: consistent empty == True
1765.81 s
[algebraic-graphs] OK: consistent (vertex x) == True
1765.81 s
[algebraic-graphs] OK: consistent (overlay x y) == True
1765.81 s
[algebraic-graphs] OK: consistent (connect x y) == True
1765.81 s
[algebraic-graphs] OK: consistent (edge x y) == True
1765.81 s
[algebraic-graphs] OK: consistent (edges xs) == True
1765.81 s
[algebraic-graphs] OK: consistent (stars xs) == True
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Symmetric.Relation.Show ============
1765.81 s
[algebraic-graphs] OK: show (empty ) == "empty"
1765.81 s
[algebraic-graphs] OK: show (1 ) == "vertex 1"
1765.81 s
[algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
1765.81 s
[algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
1765.81 s
[algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
1765.81 s
[algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
1765.81 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
1765.81 s
[algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
1765.81 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
1765.81 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
1765.81 s
[algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
1765.81 s
[algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
1765.81 s
[algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
1765.81 s
[algebraic-graphs] OK: toSymmetric . fromSymmetric == id
1765.81 s
[algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
1765.81 s
[algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
1765.81 s
[algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
1765.81 s
[algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
1765.81 s
[algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
1765.81 s
[algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Symmetric.Relation.Ord ============
1765.81 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1765.81 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1765.81 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1765.81 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1765.81 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1765.81 s
[algebraic-graphs] OK: edge 2 1 < edge 1 3
1765.81 s
[algebraic-graphs] OK: edge 1 2 == edge 2 1
1765.81 s
[algebraic-graphs] OK: x <= x + y
1765.81 s
[algebraic-graphs] OK: x + y <= x * y
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Symmetric.Relation.empty ============
1765.81 s
[algebraic-graphs] OK: isEmpty empty == True
1765.81 s
[algebraic-graphs] OK: hasVertex x empty == False
1765.81 s
[algebraic-graphs] OK: vertexCount empty == 0
1765.81 s
[algebraic-graphs] OK: edgeCount empty == 0
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Symmetric.Relation.vertex ============
1765.81 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1765.81 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1765.81 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1765.81 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Symmetric.Relation.edge ============
1765.81 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1765.81 s
[algebraic-graphs] OK: edge x y == edge y x
1765.81 s
[algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
1765.81 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1765.81 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1765.81 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1765.81 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Symmetric.Relation.overlay ============
1765.81 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1765.81 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1765.81 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1765.81 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1765.81 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1765.81 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1765.81 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1765.81 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Symmetric.Relation.connect ============
1765.81 s
[algebraic-graphs] OK: connect x y == connect y x
1765.81 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1765.81 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1765.81 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1765.81 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1765.81 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1765.81 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1765.81 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
1765.81 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1765.81 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1765.81 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Symmetric.Relation.vertices ============
1765.81 s
[algebraic-graphs] OK: vertices [] == empty
1765.81 s
[algebraic-graphs] OK: vertices [x] == vertex x
1765.81 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1765.81 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1765.81 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1765.81 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Symmetric.Relation.edges ============
1765.81 s
[algebraic-graphs] OK: edges [] == empty
1765.81 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1765.81 s
[algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
1765.81 s
[algebraic-graphs]
1765.81 s
[algebraic-graphs] ============ Symmetric.Relation.overlays ============
1765.81 s
[algebraic-graphs] OK: overlays [] == empty
1776.48 s
[algebraic-graphs] OK: overlays [x] == x
1776.49 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1776.49 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1776.49 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1776.49 s
[algebraic-graphs]
1776.49 s
[algebraic-graphs] ============ Symmetric.Relation.connects ============
1776.49 s
[algebraic-graphs] OK: connects [] == empty
1776.49 s
[algebraic-graphs] OK: connects [x] == x
1776.49 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1776.49 s
[algebraic-graphs] OK: connects == foldr connect empty
1776.49 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1776.49 s
[algebraic-graphs] OK: connects == connects . reverse
1776.49 s
[algebraic-graphs]
1776.49 s
[algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
1776.49 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1776.49 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1776.49 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1776.49 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1776.49 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1776.49 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1776.49 s
[algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
1776.49 s
[algebraic-graphs]
1776.49 s
[algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
1776.49 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1776.49 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1776.49 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1776.49 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1776.49 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1776.49 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1776.49 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1776.49 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1776.49 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1776.49 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1776.49 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1776.49 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1776.49 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1776.49 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1776.49 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1776.49 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1776.49 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1776.49 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1776.49 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1776.49 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1776.49 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1776.49 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1776.49 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1776.49 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1776.49 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1776.49 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1776.49 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1776.49 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1776.49 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1776.49 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1776.49 s
[algebraic-graphs]
1776.49 s
[algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
1776.49 s
[algebraic-graphs] OK: isEmpty empty == True
1776.49 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1776.49 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1776.49 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1776.49 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1776.49 s
[algebraic-graphs]
1776.49 s
[algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
1776.49 s
[algebraic-graphs] OK: hasVertex x empty == False
1776.49 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1776.49 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1776.49 s
[algebraic-graphs]
1776.49 s
[algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
1776.49 s
[algebraic-graphs] OK: hasEdge x y empty == False
1776.49 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1776.49 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1776.49 s
[algebraic-graphs] OK: hasEdge x y (edge y x) == True
1776.49 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1776.50 s
[algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
1776.50 s
[algebraic-graphs] OK: vertexCount empty == 0
1776.50 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1776.50 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1776.50 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
1776.50 s
[algebraic-graphs] OK: edgeCount empty == 0
1776.50 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1776.50 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1776.50 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.vertexList ============
1776.50 s
[algebraic-graphs] OK: vertexList empty == []
1776.50 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1776.50 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
1776.50 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1776.50 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1776.50 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
1776.50 s
[algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
1776.50 s
[algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
1776.50 s
[algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
1776.50 s
[algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.edgeList ============
1776.50 s
[algebraic-graphs] OK: edgeList empty == []
1776.50 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1776.50 s
[algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
1776.50 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
1776.50 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1776.50 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1776.50 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
1776.50 s
[algebraic-graphs] OK: adjacencyList empty == []
1776.50 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1776.50 s
[algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
1776.50 s
[algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.neighbours ============
1776.50 s
[algebraic-graphs] OK: neighbours x empty == Set.empty
1776.50 s
[algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
1776.50 s
[algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
1776.50 s
[algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.path ============
1776.50 s
[algebraic-graphs] OK: path [] == empty
1776.50 s
[algebraic-graphs] OK: path [x] == vertex x
1776.50 s
[algebraic-graphs] OK: path [x,y] == edge x y
1776.50 s
[algebraic-graphs] OK: path == path . reverse
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.circuit ============
1776.50 s
[algebraic-graphs] OK: circuit [] == empty
1776.50 s
[algebraic-graphs] OK: circuit [x] == edge x x
1776.50 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1776.50 s
[algebraic-graphs] OK: circuit == circuit . reverse
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.clique ============
1776.50 s
[algebraic-graphs] OK: clique [] == empty
1776.50 s
[algebraic-graphs] OK: clique [x] == vertex x
1776.50 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1776.50 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1776.50 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1776.50 s
[algebraic-graphs] OK: clique == clique . reverse
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.biclique ============
1776.50 s
[algebraic-graphs] OK: biclique [] [] == empty
1776.50 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1776.50 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1776.50 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1776.50 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.star ============
1776.50 s
[algebraic-graphs] OK: star x [] == vertex x
1776.50 s
[algebraic-graphs] OK: star x [y] == edge x y
1776.50 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1776.50 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.stars ============
1776.50 s
[algebraic-graphs] OK: stars [] == empty
1776.50 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1776.50 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1776.50 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1776.50 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1776.50 s
[algebraic-graphs] OK: stars . adjacencyList == id
1776.50 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.tree ============
1776.50 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1776.50 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1776.50 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1776.50 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1776.50 s
[algebraic-graphs]
1776.50 s
[algebraic-graphs] ============ Symmetric.Relation.forest ============
1776.50 s
[algebraic-graphs] OK: forest [] == empty
1782.79 s
[algebraic-graphs] OK: forest [x] == tree x
1782.79 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1782.81 s
[algebraic-graphs] OK: forest == overlays . map tree
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
1782.81 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1782.81 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1782.81 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1782.81 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1782.81 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
1782.81 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1782.81 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1782.81 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1782.81 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1782.81 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1782.81 s
[algebraic-graphs] OK: removeEdge x y == removeEdge y x
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
1782.81 s
[algebraic-graphs] OK: replaceVertex x x == id
1782.81 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1782.81 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
1782.81 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1782.81 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1782.81 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1782.81 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Symmetric.Relation.gmap ============
1782.81 s
[algebraic-graphs] OK: gmap f empty == empty
1782.81 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1782.81 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1782.81 s
[algebraic-graphs] OK: gmap id == id
1782.81 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Symmetric.Relation.induce ============
1782.81 s
[algebraic-graphs] OK: induce (const True ) x == x
1782.81 s
[algebraic-graphs] OK: induce (const False) x == empty
1782.81 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1782.81 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1782.81 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Symmetric.Relation.induceJust ============
1782.81 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1782.81 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1782.81 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1782.81 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Example.Todo (Holiday) ============
1782.81 s
[algebraic-graphs] OK: A todo list is semantically Maybe [a]
1782.81 s
[algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
1782.81 s
[algebraic-graphs] OK: The connect operator (*) adds dependency between items
1782.81 s
[algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
1782.81 s
[algebraic-graphs] OK: Introduce item priority to schedule the todo list
1782.81 s
[algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Example.Todo (Commandline) ============
1782.81 s
[algebraic-graphs] OK: The pull connect operator maintains command line semantics
1782.81 s
[algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
1782.81 s
[algebraic-graphs] OK: The usual connect operator breaks semantics
1782.81 s
[algebraic-graphs] OK: Transform command lines by adding optimisation flag
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Typed ============
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Typed.fromAdjacencyMap ============
1782.81 s
[algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
1782.81 s
[algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
1782.81 s
[algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
1782.81 s
[algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
1782.81 s
[algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
1782.81 s
[algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
1782.81 s
[algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
1782.81 s
[algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Typed.dfsForest ============
1782.81 s
[algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
1782.81 s
[algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
1782.81 s
[algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
1782.81 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
1782.81 s
[algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
1782.81 s
[algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
1782.81 s
[algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Typed.dfsForestFrom ============
1782.81 s
[algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
1782.81 s
[algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
1782.81 s
[algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
1782.81 s
[algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
1782.81 s
[algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
1782.81 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
1782.81 s
[algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
1782.81 s
[algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
1782.81 s
[algebraic-graphs] OK: dfsForestFrom % x $ [] == []
1782.81 s
[algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Typed.dfs ============
1782.81 s
[algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
1782.81 s
[algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
1782.81 s
[algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
1782.81 s
[algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
1782.81 s
[algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
1782.81 s
[algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
1782.81 s
[algebraic-graphs] OK: dfs % x $ [] == []
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
1782.81 s
[algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Typed.topSort ============
1782.81 s
[algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
1782.81 s
[algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Graph.Undirected ============
1782.81 s
[algebraic-graphs] OK: Axioms of undirected graphs
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Graph.Undirected.Show ============
1782.81 s
[algebraic-graphs] OK: show (empty ) == "empty"
1782.81 s
[algebraic-graphs] OK: show (1 ) == "vertex 1"
1782.81 s
[algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
1782.81 s
[algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
1782.81 s
[algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
1782.81 s
[algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
1782.81 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
1782.81 s
[algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
1782.81 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
1782.81 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
1782.81 s
[algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
1782.81 s
[algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Graph.Undirected.toUndirected ============
1782.81 s
[algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
1782.81 s
[algebraic-graphs] OK: toUndirected . fromUndirected == id
1782.81 s
[algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
1782.81 s
[algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
1782.81 s
[algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
1782.81 s
[algebraic-graphs] OK: toUndirected . fromUndirected == id
1782.81 s
[algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
1782.81 s
[algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Graph.Undirected.complement ================
1782.81 s
[algebraic-graphs] OK: complement empty == empty
1782.81 s
[algebraic-graphs] OK: complement (vertex x) == vertex x
1782.81 s
[algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
1782.81 s
[algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
1782.81 s
[algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
1782.81 s
[algebraic-graphs] OK: complement . complement == id
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Graph.Undirected.Ord ============
1782.81 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1782.81 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1782.81 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1782.81 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1782.81 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1782.81 s
[algebraic-graphs] OK: edge 2 1 < edge 1 3
1782.81 s
[algebraic-graphs] OK: edge 1 2 == edge 2 1
1782.81 s
[algebraic-graphs] OK: x <= x + y
1782.81 s
[algebraic-graphs] OK: x + y <= x * y
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Graph.Undirected.empty ============
1782.81 s
[algebraic-graphs] OK: isEmpty empty == True
1782.81 s
[algebraic-graphs] OK: hasVertex x empty == False
1782.81 s
[algebraic-graphs] OK: vertexCount empty == 0
1782.81 s
[algebraic-graphs] OK: edgeCount empty == 0
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Graph.Undirected.vertex ============
1782.81 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1782.81 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1782.81 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1782.81 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1782.81 s
[algebraic-graphs]
1782.81 s
[algebraic-graphs] ============ Graph.Undirected.edge ============
1782.81 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1782.81 s
[algebraic-graphs] OK: edge x y == edge y x
1790.25 s
[algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
1790.25 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1790.25 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1790.26 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1790.26 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.overlay ============
1790.26 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1790.26 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1790.26 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1790.26 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1790.26 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1790.26 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1790.26 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1790.26 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.connect ============
1790.26 s
[algebraic-graphs] OK: connect x y == connect y x
1790.26 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1790.26 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1790.26 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1790.26 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1790.26 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1790.26 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1790.26 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
1790.26 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1790.26 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1790.26 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.vertices ============
1790.26 s
[algebraic-graphs] OK: vertices [] == empty
1790.26 s
[algebraic-graphs] OK: vertices [x] == vertex x
1790.26 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1790.26 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1790.26 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1790.26 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.edges ============
1790.26 s
[algebraic-graphs] OK: edges [] == empty
1790.26 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1790.26 s
[algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.overlays ============
1790.26 s
[algebraic-graphs] OK: overlays [] == empty
1790.26 s
[algebraic-graphs] OK: overlays [x] == x
1790.26 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1790.26 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1790.26 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.connects ============
1790.26 s
[algebraic-graphs] OK: connects [] == empty
1790.26 s
[algebraic-graphs] OK: connects [x] == x
1790.26 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1790.26 s
[algebraic-graphs] OK: connects == foldr connect empty
1790.26 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1790.26 s
[algebraic-graphs] OK: connects == connects . reverse
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
1790.26 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1790.26 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1790.26 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1790.26 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1790.26 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1790.26 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1790.26 s
[algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.path ============
1790.26 s
[algebraic-graphs] OK: path [] == empty
1790.26 s
[algebraic-graphs] OK: path [x] == vertex x
1790.26 s
[algebraic-graphs] OK: path [x,y] == edge x y
1790.26 s
[algebraic-graphs] OK: path == path . reverse
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.circuit ============
1790.26 s
[algebraic-graphs] OK: circuit [] == empty
1790.26 s
[algebraic-graphs] OK: circuit [x] == edge x x
1790.26 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1790.26 s
[algebraic-graphs] OK: circuit == circuit . reverse
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.clique ============
1790.26 s
[algebraic-graphs] OK: clique [] == empty
1790.26 s
[algebraic-graphs] OK: clique [x] == vertex x
1790.26 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1790.26 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1790.26 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1790.26 s
[algebraic-graphs] OK: clique == clique . reverse
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.biclique ============
1790.26 s
[algebraic-graphs] OK: biclique [] [] == empty
1790.26 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1790.26 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1790.26 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1790.26 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.star ============
1790.26 s
[algebraic-graphs] OK: star x [] == vertex x
1790.26 s
[algebraic-graphs] OK: star x [y] == edge x y
1790.26 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1790.26 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.stars ============
1790.26 s
[algebraic-graphs] OK: stars [] == empty
1790.26 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1790.26 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1790.26 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1790.26 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1790.26 s
[algebraic-graphs] OK: stars . adjacencyList == id
1790.26 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.tree ============
1790.26 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1790.26 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1790.26 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1790.26 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.forest ============
1790.26 s
[algebraic-graphs] OK: forest [] == empty
1790.26 s
[algebraic-graphs] OK: forest [x] == tree x
1790.26 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1790.26 s
[algebraic-graphs] OK: forest == overlays . map tree
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.removeVertex ============
1790.26 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1790.26 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1790.26 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1790.26 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1790.26 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.removeEdge ============
1790.26 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1790.26 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1790.26 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1790.26 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1790.26 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1790.26 s
[algebraic-graphs] OK: removeEdge x y == removeEdge y x
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
1790.26 s
[algebraic-graphs] OK: replaceVertex x x == id
1790.26 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1790.26 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1790.26 s
[algebraic-graphs]
1790.26 s
[algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
1790.26 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1790.26 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1790.26 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1790.26 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1790.26 s
[algebraic-graphs]
1790.27 s
[algebraic-graphs] ============ Graph.Undirected.gmap ============
1790.27 s
[algebraic-graphs] OK: gmap f empty == empty
1790.27 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1790.27 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1790.27 s
[algebraic-graphs] OK: gmap id == id
1790.27 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1790.27 s
[algebraic-graphs]
1790.27 s
[algebraic-graphs] ============ Graph.Undirected.induce ============
1790.27 s
[algebraic-graphs] OK: induce (const True ) x == x
1790.27 s
[algebraic-graphs] OK: induce (const False) x == empty
1790.27 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1790.27 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1790.27 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1790.27 s
[algebraic-graphs]
1790.27 s
[algebraic-graphs] ============ Graph.Undirected.induceJust ============
1790.27 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1790.27 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1790.27 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1790.27 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1790.27 s
[algebraic-graphs] Test suite main: PASS
1790.27 s
[algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
1790.27 s
[algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
1790.27 s
[algebraic-graphs] checkPhase completed in 1 minutes 48 seconds
1790.27 s
[algebraic-graphs] Phase: haddockPhase
1790.35 s
[algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
1790.35 s
[algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
1790.38 s
[algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1790.48 s
[algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
1790.70 s
[algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
1790.74 s
[algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
1790.78 s
[algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
1790.81 s
[algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
1790.97 s
[algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
1791.00 s
[algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
1791.13 s
[algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
1791.19 s
[algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
1791.35 s
[algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
1791.39 s
[algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
1791.45 s
[algebraic-graphs]
1791.45 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning : [ GHC-63394 ] [ -Wx-partial ]
1791.45 s
[algebraic-graphs] In the use of ‘head’
1791.45 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1791.45 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1791.45 s
[algebraic-graphs] |
1791.45 s
[algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
1791.45 s
[algebraic-graphs] | ^^^^
1791.45 s
[algebraic-graphs]
1791.45 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1791.45 s
[algebraic-graphs] In the use of ‘tail’
1791.45 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1791.45 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1791.45 s
[algebraic-graphs] |
1791.45 s
[algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
1791.45 s
[algebraic-graphs] | ^^^^
1791.45 s
[algebraic-graphs]
1791.45 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning : [ GHC-63394 ] [ -Wx-partial ]
1791.45 s
[algebraic-graphs] In the use of ‘head’
1791.45 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1791.45 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1791.45 s
[algebraic-graphs] |
1791.45 s
[algebraic-graphs] 395 | p_v = fst $ head bnd
1791.45 s
[algebraic-graphs] | ^^^^
1791.45 s
[algebraic-graphs]
1791.46 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1791.46 s
[algebraic-graphs] In the use of ‘tail’
1791.46 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1791.46 s
[algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
1791.46 s
[algebraic-graphs] |
1791.46 s
[algebraic-graphs] 397 | bnd' = tail bnd
1791.46 s
[algebraic-graphs] | ^^^^
1791.46 s
[algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
1791.48 s
[algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
1791.58 s
[algebraic-graphs]
1791.58 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1791.58 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1791.58 s
[algebraic-graphs] will become an error in a future GHC release.
1791.58 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1791.58 s
[algebraic-graphs] |
1791.58 s
[algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
1791.58 s
[algebraic-graphs] | ^
1791.58 s
[algebraic-graphs]
1791.58 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1791.58 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1791.58 s
[algebraic-graphs] will become an error in a future GHC release.
1791.58 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1791.58 s
[algebraic-graphs] |
1791.58 s
[algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1791.58 s
[algebraic-graphs] | ^
1791.58 s
[algebraic-graphs]
1791.58 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1791.58 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1791.58 s
[algebraic-graphs] will become an error in a future GHC release.
1791.58 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1791.58 s
[algebraic-graphs] |
1791.58 s
[algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1791.59 s
[algebraic-graphs] | ^
1791.59 s
[algebraic-graphs]
1791.59 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1791.59 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1791.59 s
[algebraic-graphs] will become an error in a future GHC release.
1791.59 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1791.59 s
[algebraic-graphs] |
1791.59 s
[algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1791.59 s
[algebraic-graphs] | ^
1791.59 s
[algebraic-graphs]
1791.59 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1791.59 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1791.59 s
[algebraic-graphs] will become an error in a future GHC release.
1791.59 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1791.59 s
[algebraic-graphs] |
1791.59 s
[algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1791.59 s
[algebraic-graphs] | ^
1791.59 s
[algebraic-graphs]
1791.59 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1791.59 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1791.59 s
[algebraic-graphs] will become an error in a future GHC release.
1791.59 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1791.59 s
[algebraic-graphs] |
1791.59 s
[algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1791.59 s
[algebraic-graphs] | ^
1791.59 s
[algebraic-graphs]
1791.59 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1791.59 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1791.59 s
[algebraic-graphs] will become an error in a future GHC release.
1791.59 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1791.59 s
[algebraic-graphs] |
1791.59 s
[algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1791.59 s
[algebraic-graphs] | ^
1791.59 s
[algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
1791.65 s
[algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
1791.69 s
[algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
1791.77 s
[algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
1791.89 s
[algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
1791.96 s
[algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
1791.97 s
[algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
1791.98 s
[algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
1791.99 s
[algebraic-graphs]
1791.99 s
[algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1791.99 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1791.99 s
[algebraic-graphs] will become an error in a future GHC release.
1791.99 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1791.99 s
[algebraic-graphs] |
1791.99 s
[algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
1791.99 s
[algebraic-graphs] | ^
1791.99 s
[algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
1792.05 s
[algebraic-graphs]
1792.05 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1792.05 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1792.05 s
[algebraic-graphs] will become an error in a future GHC release.
1792.05 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1792.05 s
[algebraic-graphs] |
1792.05 s
[algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
1792.05 s
[algebraic-graphs] | ^
1792.05 s
[algebraic-graphs]
1792.05 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1792.05 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1792.05 s
[algebraic-graphs] will become an error in a future GHC release.
1792.05 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1792.05 s
[algebraic-graphs] |
1792.05 s
[algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
1792.05 s
[algebraic-graphs] | ^
1792.05 s
[algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
1792.10 s
[algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
1792.13 s
[algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
1792.14 s
[algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
1792.15 s
[algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
1792.16 s
[algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
1792.17 s
[algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
1792.18 s
[algebraic-graphs] Haddock coverage:
1792.19 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1792.19 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
1792.19 s
[algebraic-graphs] * in ‘Data.Map.Internal’
1792.19 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1792.19 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.19 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.19 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
1792.20 s
[algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
1792.20 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1792.20 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
1792.20 s
[algebraic-graphs] * in ‘Data.IntMap.Internal’
1792.20 s
[algebraic-graphs] * in ‘Data.IntSet.Internal’
1792.20 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.20 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.20 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
1792.22 s
[algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
1792.23 s
[algebraic-graphs] Warning: 'nub' is out of scope.
1792.23 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.23 s
[algebraic-graphs] Warning: 'sort' is out of scope.
1792.23 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.23 s
[algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
1792.23 s
[algebraic-graphs] Missing documentation for:
1792.23 s
[algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
1792.23 s
[algebraic-graphs] Warning: 'List' is ambiguous. It is defined
1792.23 s
[algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
1792.23 s
[algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
1792.23 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.23 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.23 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
1792.23 s
[algebraic-graphs] Warning: 'IsList' is out of scope.
1792.23 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.23 s
[algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
1792.23 s
[algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
1792.23 s
[algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
1792.23 s
[algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
1792.23 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.23 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.23 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
1792.24 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1792.24 s
[algebraic-graphs] * at src/Algebra/Graph.hs:316:1
1792.24 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1792.24 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.24 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.24 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
1792.26 s
[algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
1792.26 s
[algebraic-graphs] Warning: 'mplus' is out of scope.
1792.26 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.26 s
[algebraic-graphs] Warning: 'vertexCount' is out of scope.
1792.26 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.26 s
[algebraic-graphs] Warning: 'hasVertex' is out of scope.
1792.26 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.26 s
[algebraic-graphs] Warning: 'vertexSet' is out of scope.
1792.26 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.26 s
[algebraic-graphs] Warning: 'isEmpty' is out of scope.
1792.26 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.26 s
[algebraic-graphs] Warning: 'edgeList' is out of scope.
1792.26 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.26 s
[algebraic-graphs] Warning: 'adjacencyList' is out of scope.
1792.26 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.26 s
[algebraic-graphs] Warning: 'box' is out of scope.
1792.26 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.26 s
[algebraic-graphs] Warning: 'edgeCount' is out of scope.
1792.26 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.27 s
[algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
1792.27 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1792.27 s
[algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
1792.27 s
[algebraic-graphs] * in ‘Data.Map.Internal’
1792.27 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1792.27 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.27 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.27 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
1792.27 s
[algebraic-graphs] Warning: 'nub' is out of scope.
1792.27 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.28 s
[algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
1792.28 s
[algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
1792.28 s
[algebraic-graphs] * in ‘Data.Tuple’
1792.28 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.28 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.28 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
1792.29 s
[algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
1792.29 s
[algebraic-graphs] Warning: 'isRight' is out of scope.
1792.29 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.29 s
[algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
1792.29 s
[algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
1792.29 s
[algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
1792.29 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.29 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.29 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
1792.29 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1792.29 s
[algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
1792.29 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1792.29 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.29 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.29 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
1792.30 s
[algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
1792.30 s
[algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
1792.30 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
1792.30 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
1792.30 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.30 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.30 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
1792.30 s
[algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
1792.30 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
1792.30 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
1792.30 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.30 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.30 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
1792.30 s
[algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
1792.30 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
1792.30 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
1792.30 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.30 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.30 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
1792.30 s
[algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
1792.30 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
1792.30 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
1792.30 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.30 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.30 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
1792.30 s
[algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
1792.30 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
1792.30 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
1792.30 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.30 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.30 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
1792.30 s
[algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
1792.30 s
[algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
1792.30 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
1792.30 s
[algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
1792.30 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.31 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.31 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
1792.31 s
[algebraic-graphs] Warning: 'isEmpty' is out of scope.
1792.31 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.31 s
[algebraic-graphs] Warning: 'empty' is out of scope.
1792.31 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.31 s
[algebraic-graphs] Warning: 'vertexList' is out of scope.
1792.31 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.31 s
[algebraic-graphs] Warning: 'edges' is out of scope.
1792.31 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.31 s
[algebraic-graphs] Warning: 'adjacencyList' is out of scope.
1792.31 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.32 s
[algebraic-graphs] Warning: 'stars' is out of scope.
1792.32 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.32 s
[algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
1792.32 s
[algebraic-graphs] Warning: 'nub' is out of scope.
1792.32 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.32 s
[algebraic-graphs] Warning: 'sort' is out of scope.
1792.32 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.32 s
[algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
1792.32 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
1792.32 s
[algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
1792.32 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.32 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.32 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
1792.32 s
[algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
1792.33 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
1792.33 s
[algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
1792.33 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.33 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.33 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
1792.33 s
[algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
1792.33 s
[algebraic-graphs] Missing documentation for:
1792.33 s
[algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
1792.33 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1792.33 s
[algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
1792.33 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
1792.33 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.33 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.33 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
1792.33 s
[algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
1792.33 s
[algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
1792.33 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
1792.33 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.33 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.33 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
1792.33 s
[algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
1792.33 s
[algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
1792.33 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
1792.33 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.33 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.33 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
1792.33 s
[algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
1792.33 s
[algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
1792.33 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
1792.33 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.33 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.33 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
1792.34 s
[algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
1792.34 s
[algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
1792.34 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
1792.34 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.34 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.34 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
1792.34 s
[algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
1792.34 s
[algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
1792.34 s
[algebraic-graphs] * at src/Algebra/Graph.hs:482:1
1792.34 s
[algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
1792.34 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.34 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.34 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
1792.35 s
[algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
1792.35 s
[algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
1792.35 s
[algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
1792.35 s
[algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
1792.35 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.35 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.35 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
1792.35 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1792.35 s
[algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
1792.35 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1792.35 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.35 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.35 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
1792.36 s
[algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
1792.36 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.42 s
[algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
1792.42 s
[algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
1792.42 s
[algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
1792.42 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
1792.42 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.42 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.42 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
1792.42 s
[algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
1792.42 s
[algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
1792.42 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
1792.42 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.42 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.42 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
1792.42 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1792.42 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
1792.42 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1792.42 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.42 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.43 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
1792.43 s
[algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
1792.44 s
[algebraic-graphs] Warning: 'vertexList' is out of scope.
1792.44 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.45 s
[algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
1792.45 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1792.45 s
[algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
1792.45 s
[algebraic-graphs] * in ‘Data.Map.Internal’
1792.45 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.45 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.45 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
1792.46 s
[algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
1792.46 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
1792.46 s
[algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
1792.46 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.46 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.46 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
1792.46 s
[algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
1792.46 s
[algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
1792.46 s
[algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
1792.46 s
[algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
1792.46 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.46 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.46 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
1792.46 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1792.46 s
[algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
1792.46 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1792.46 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.47 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.47 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
1792.48 s
[algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
1792.48 s
[algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
1792.48 s
[algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
1792.48 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.48 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.48 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
1792.48 s
[algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
1792.48 s
[algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
1792.48 s
[algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
1792.48 s
[algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
1792.48 s
[algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
1792.48 s
[algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
1792.48 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.48 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.48 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
1792.48 s
[algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
1792.48 s
[algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
1792.48 s
[algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
1792.48 s
[algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
1792.48 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.48 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.48 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
1792.49 s
[algebraic-graphs] Warning: 'Graph' is out of scope.
1792.49 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.49 s
[algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
1792.50 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1792.50 s
[algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
1792.50 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1792.50 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.50 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.50 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
1792.50 s
[algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
1792.51 s
[algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
1792.51 s
[algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
1792.51 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
1792.51 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
1792.51 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.51 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.51 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
1792.51 s
[algebraic-graphs] Warning: 'Transitive' is out of scope.
1792.51 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.51 s
[algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
1792.51 s
[algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
1792.51 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
1792.51 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
1792.51 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.51 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.51 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
1792.51 s
[algebraic-graphs] Warning: 'Reflexive' is out of scope.
1792.51 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.51 s
[algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
1792.51 s
[algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
1792.51 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
1792.51 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
1792.51 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.51 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.51 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
1792.51 s
[algebraic-graphs] Warning: 'Preorder' is out of scope.
1792.51 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.51 s
[algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
1792.51 s
[algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
1792.51 s
[algebraic-graphs] Missing documentation for:
1792.51 s
[algebraic-graphs] Module header
1792.51 s
[algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
1792.51 s
[algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
1792.51 s
[algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
1792.51 s
[algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
1792.51 s
[algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
1792.51 s
[algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
1792.51 s
[algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
1792.51 s
[algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
1792.51 s
[algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
1792.51 s
[algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
1792.51 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1792.51 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1792.51 s
[algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
1792.51 s
[algebraic-graphs] Warning: 'array' is out of scope.
1792.51 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1792.52 s
[algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
1792.52 s
[algebraic-graphs] Missing documentation for:
1792.52 s
[algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
1792.66 s
[algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
1792.66 s
[algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
1792.66 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
1792.66 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
1792.67 s
[algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
1792.67 s
[algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
1792.67 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
1792.67 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
1792.67 s
[algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
1792.67 s
[algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
1792.67 s
[algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
1792.67 s
[algebraic-graphs] - Algebra.Graph.Rep_Graph
1792.67 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
1792.67 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
1792.81 s
[algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
1792.81 s
[algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
1792.81 s
[algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
1792.81 s
[algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
1792.81 s
[algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
1792.81 s
[algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
1792.81 s
[algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
1792.81 s
[algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
1792.81 s
[algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
1792.82 s
[algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
1792.82 s
[algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
1792.82 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
1792.82 s
[algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
1792.82 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
1792.82 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
1792.82 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
1792.82 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
1792.82 s
[algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
1792.82 s
[algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
1792.82 s
[algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
1792.82 s
[algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
1792.82 s
[algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
1792.83 s
[algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
1792.83 s
[algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
1792.83 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
1792.83 s
[algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
1792.83 s
[algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
1792.83 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
1792.83 s
[algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
1792.83 s
[algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
1792.84 s
[algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
1792.84 s
[algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
1792.84 s
[algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
1792.84 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
1792.84 s
[algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
1792.84 s
[algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
1792.84 s
[algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
1792.84 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
1792.85 s
[algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
1792.85 s
[algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
1792.85 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
1792.85 s
[algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
1792.85 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
1792.85 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
1792.85 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
1792.85 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
1792.85 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
1792.85 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
1792.85 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
1792.85 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
1792.85 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
1792.85 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
1792.85 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
1792.85 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
1792.85 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
1792.85 s
[algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
1792.85 s
[algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
1792.85 s
[algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
1792.85 s
[algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
1792.85 s
[algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
1792.85 s
[algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
1792.85 s
[algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
1792.85 s
[algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
1792.85 s
[algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
1792.85 s
[algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
1792.85 s
[algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
1792.85 s
[algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
1795.78 s
[algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
1795.88 s
[algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
1795.88 s
[algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
1795.88 s
[algebraic-graphs] Phase: installPhase
1795.89 s
[algebraic-graphs] Installing library in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
1796.44 s
[algebraic-graphs] Phase: fixupPhase
1796.46 s
[algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7
1796.47 s
[algebraic-graphs] shrinking /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSalgebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc-ghc9.8.4.so
1796.48 s
[algebraic-graphs] checking for references to /build/ in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7...
1796.51 s
[algebraic-graphs] patching script interpreter paths in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7
1796.52 s
[algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib
1796.75 s
[algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc
1796.77 s
[algebraic-graphs] checking for references to /build/ in /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc...
1796.80 s
[algebraic-graphs] patching script interpreter paths in /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc
1796.95 s
[algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7 /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc
1797.29 s
[algebraic-graphs:post-build] Nothing to push - all store paths are already on Cachix.
1797.30 s
[algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7 /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc
1797.34 s
[algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1797.35 s
[algebraic-graphs:post-build] copying 2 paths...
1797.35 s
[algebraic-graphs:post-build] copying path '/nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
1798.51 s
[algebraic-graphs:post-build] copying path '/nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
1803.48 s
[algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1803.54 s
[algebraic-graphs:post-build] copying 0 paths...
1803.56 s
Progress: 34 of 38 built, 559 of 559 downloaded from cache
1803.61 s
Building /nix/store/w9blpl2j2z1mg64k6daxymyd52b744r1-ghc-9.8.4-with-packages.drv
1803.66 s
[ghc-9.8.4-with-packages] /nix/store/2klaxh0nypzbiz11icjn7a3gr0w50dfp-doctest-0.24.2/nix-support:
1803.66 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.66 s
[ghc-9.8.4-with-packages] /nix/store/wjan1s58nap9s2y9c6r89bgjgnncm53g-ghc-compat-plugin-0.1.0.1/nix-support:
1803.66 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.67 s
[ghc-9.8.4-with-packages] /nix/store/yjaggp1g4sqis3107rgrlgkvfj8vlxpb-hedgehog-1.5/nix-support:
1803.67 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.69 s
[ghc-9.8.4-with-packages] /nix/store/c23g9fxnkkkmdpb5395r4vf5migp8afg-Cabal-3.12.1.0/nix-support:
1803.69 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.71 s
[ghc-9.8.4-with-packages] /nix/store/2y5q3na3kzygn18zww6mj42gavla7yl6-cabal-doctest-1.0.12/nix-support:
1803.71 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.72 s
[ghc-9.8.4-with-packages] /nix/store/nvg0b7lllw0n51565aqx91sdpa62c52g-temporary-1.3/nix-support:
1803.72 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.72 s
[ghc-9.8.4-with-packages] /nix/store/nvg0b7lllw0n51565aqx91sdpa62c52g-temporary-1.3/nix-support:
1803.72 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.72 s
[ghc-9.8.4-with-packages] /nix/store/z47anpqicydbbjxi2xwvahq4m83j7zm0-ansi-terminal-1.1.3/nix-support:
1803.72 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.72 s
[ghc-9.8.4-with-packages] /nix/store/z47anpqicydbbjxi2xwvahq4m83j7zm0-ansi-terminal-1.1.3/nix-support:
1803.72 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.73 s
[ghc-9.8.4-with-packages] /nix/store/v1bbgll4iw7q1d2b3hkllfblph1gfkfi-async-2.2.5/nix-support:
1803.73 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.73 s
[ghc-9.8.4-with-packages] /nix/store/v1bbgll4iw7q1d2b3hkllfblph1gfkfi-async-2.2.5/nix-support:
1803.73 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.73 s
[ghc-9.8.4-with-packages] /nix/store/0ry8i8l979dmlrvb7zj8fgpgddzlcsgx-barbies-2.1.1.0/nix-support:
1803.73 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.73 s
[ghc-9.8.4-with-packages] /nix/store/0ry8i8l979dmlrvb7zj8fgpgddzlcsgx-barbies-2.1.1.0/nix-support:
1803.73 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.74 s
[ghc-9.8.4-with-packages] /nix/store/cmcnavxnxs21nl079ihfcz9r8bikc3si-concurrent-output-1.10.21/nix-support:
1803.74 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.74 s
[ghc-9.8.4-with-packages] /nix/store/cmcnavxnxs21nl079ihfcz9r8bikc3si-concurrent-output-1.10.21/nix-support:
1803.74 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.74 s
[ghc-9.8.4-with-packages] /nix/store/635raa5l4zzmrxz67jnyzn2ayf0wrn7q-lifted-async-0.10.2.7/nix-support:
1803.74 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.74 s
[ghc-9.8.4-with-packages] /nix/store/635raa5l4zzmrxz67jnyzn2ayf0wrn7q-lifted-async-0.10.2.7/nix-support:
1803.74 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.74 s
[ghc-9.8.4-with-packages] /nix/store/n5sx1iv4pjywxqyhb6644x8lz4i9lba5-mmorph-1.2.1/nix-support:
1803.74 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.75 s
[ghc-9.8.4-with-packages] /nix/store/n5sx1iv4pjywxqyhb6644x8lz4i9lba5-mmorph-1.2.1/nix-support:
1803.75 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.75 s
[ghc-9.8.4-with-packages] /nix/store/g1xwfxzw06xcwk0md2c3dsmbjh53pvfw-monad-control-1.0.3.1/nix-support:
1803.75 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.75 s
[ghc-9.8.4-with-packages] /nix/store/g1xwfxzw06xcwk0md2c3dsmbjh53pvfw-monad-control-1.0.3.1/nix-support:
1803.75 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.75 s
[ghc-9.8.4-with-packages] /nix/store/gjn5g66y2finjvl6qxpygkl4nikgy9sh-pretty-show-1.10/nix-support:
1803.75 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.75 s
[ghc-9.8.4-with-packages] /nix/store/gjn5g66y2finjvl6qxpygkl4nikgy9sh-pretty-show-1.10/nix-support:
1803.75 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.75 s
[ghc-9.8.4-with-packages] /nix/store/47s8r3aghzw86sw2w05qrmks9xfm9i9q-primitive-0.9.1.0/nix-support:
1803.76 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.76 s
[ghc-9.8.4-with-packages] /nix/store/47s8r3aghzw86sw2w05qrmks9xfm9i9q-primitive-0.9.1.0/nix-support:
1803.76 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.76 s
[ghc-9.8.4-with-packages] /nix/store/s79715agzkq8mhyr9fsm43h7z7ac2l04-random-1.2.1.3/nix-support:
1803.76 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.76 s
[ghc-9.8.4-with-packages] /nix/store/s79715agzkq8mhyr9fsm43h7z7ac2l04-random-1.2.1.3/nix-support:
1803.76 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.76 s
[ghc-9.8.4-with-packages] /nix/store/6wqs30zg2ypzn15z1acpafc8zwxkj6wb-resourcet-1.3.0/nix-support:
1803.76 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.76 s
[ghc-9.8.4-with-packages] /nix/store/6wqs30zg2ypzn15z1acpafc8zwxkj6wb-resourcet-1.3.0/nix-support:
1803.76 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.76 s
[ghc-9.8.4-with-packages] /nix/store/11g1dmdb7lifr29wl0i3h589jn673iy7-safe-exceptions-0.1.7.4/nix-support:
1803.76 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.77 s
[ghc-9.8.4-with-packages] /nix/store/11g1dmdb7lifr29wl0i3h589jn673iy7-safe-exceptions-0.1.7.4/nix-support:
1803.77 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.77 s
[ghc-9.8.4-with-packages] /nix/store/f29lcbw106v0cnnl6nz59mwznp2qs70z-transformers-base-0.4.6/nix-support:
1803.77 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.77 s
[ghc-9.8.4-with-packages] /nix/store/f29lcbw106v0cnnl6nz59mwznp2qs70z-transformers-base-0.4.6/nix-support:
1803.77 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.77 s
[ghc-9.8.4-with-packages] /nix/store/ni07y6jsg1apn0srs3jsy6vdbgr9winx-wl-pprint-annotated-0.1.0.1/nix-support:
1803.77 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.77 s
[ghc-9.8.4-with-packages] /nix/store/ni07y6jsg1apn0srs3jsy6vdbgr9winx-wl-pprint-annotated-0.1.0.1/nix-support:
1803.77 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.79 s
[ghc-9.8.4-with-packages] /nix/store/rfmdrav11ynn3sfmv1cci9rwnch8x7ip-Cabal-syntax-3.12.1.0/nix-support:
1803.79 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.80 s
[ghc-9.8.4-with-packages] /nix/store/rfmdrav11ynn3sfmv1cci9rwnch8x7ip-Cabal-syntax-3.12.1.0/nix-support:
1803.80 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.80 s
[ghc-9.8.4-with-packages] /nix/store/005hdm8qnhj4zl0q8788fllgfg6z3fjx-ansi-terminal-types-1.1.3/nix-support:
1803.80 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.80 s
[ghc-9.8.4-with-packages] /nix/store/005hdm8qnhj4zl0q8788fllgfg6z3fjx-ansi-terminal-types-1.1.3/nix-support:
1803.80 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.81 s
[ghc-9.8.4-with-packages] /nix/store/zvhln8s72qwgz4ckrzn2d8cip2j33g64-hashable-1.5.0.0/nix-support:
1803.81 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.81 s
[ghc-9.8.4-with-packages] /nix/store/zvhln8s72qwgz4ckrzn2d8cip2j33g64-hashable-1.5.0.0/nix-support:
1803.81 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.81 s
[ghc-9.8.4-with-packages] /nix/store/qhd0bphgldgkc8ir7ph2q4a66daa2kz5-distributive-0.6.2.1/nix-support:
1803.81 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.81 s
[ghc-9.8.4-with-packages] /nix/store/qhd0bphgldgkc8ir7ph2q4a66daa2kz5-distributive-0.6.2.1/nix-support:
1803.81 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.81 s
[ghc-9.8.4-with-packages] /nix/store/pcgwgbz3q9h42kdk0fzfcv894hi3jywp-constraints-0.14.2/nix-support:
1803.81 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.82 s
[ghc-9.8.4-with-packages] /nix/store/pcgwgbz3q9h42kdk0fzfcv894hi3jywp-constraints-0.14.2/nix-support:
1803.82 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.82 s
[ghc-9.8.4-with-packages] /nix/store/3m25xgvipja12agpxz4qz1m0fx80bh7d-lifted-base-0.2.3.12/nix-support:
1803.82 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.82 s
[ghc-9.8.4-with-packages] /nix/store/3m25xgvipja12agpxz4qz1m0fx80bh7d-lifted-base-0.2.3.12/nix-support:
1803.82 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.82 s
[ghc-9.8.4-with-packages] /nix/store/5rcyrxlp2jfnq536ly1kpk4agsijcxs3-transformers-compat-0.7.2/nix-support:
1803.82 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.82 s
[ghc-9.8.4-with-packages] /nix/store/5rcyrxlp2jfnq536ly1kpk4agsijcxs3-transformers-compat-0.7.2/nix-support:
1803.82 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.83 s
[ghc-9.8.4-with-packages] /nix/store/26jd7x2cwjr44xxw327qly5px101qvj7-splitmix-0.1.3.1/nix-support:
1803.83 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.83 s
[ghc-9.8.4-with-packages] /nix/store/26jd7x2cwjr44xxw327qly5px101qvj7-splitmix-0.1.3.1/nix-support:
1803.83 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.83 s
[ghc-9.8.4-with-packages] /nix/store/idxrblvqkyslgimxh040iyd3rn2jbm6f-unliftio-core-0.2.1.0/nix-support:
1803.83 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.83 s
[ghc-9.8.4-with-packages] /nix/store/idxrblvqkyslgimxh040iyd3rn2jbm6f-unliftio-core-0.2.1.0/nix-support:
1803.83 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.84 s
[ghc-9.8.4-with-packages] /nix/store/xv8k031kh4n0bpk2zy81a5gwvgkkbyjf-base-orphans-0.9.3/nix-support:
1803.84 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.84 s
[ghc-9.8.4-with-packages] /nix/store/xv8k031kh4n0bpk2zy81a5gwvgkkbyjf-base-orphans-0.9.3/nix-support:
1803.84 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.84 s
[ghc-9.8.4-with-packages] /nix/store/f2r5j3mrypcxprcl8sx1p1bn964pbih9-os-string-2.0.8/nix-support:
1803.84 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.84 s
[ghc-9.8.4-with-packages] /nix/store/f2r5j3mrypcxprcl8sx1p1bn964pbih9-os-string-2.0.8/nix-support:
1803.84 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.84 s
[ghc-9.8.4-with-packages] /nix/store/6q8zi610nrws76v0aamfj2xn4f8v6rab-tagged-0.8.9/nix-support:
1803.84 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.84 s
[ghc-9.8.4-with-packages] /nix/store/6q8zi610nrws76v0aamfj2xn4f8v6rab-tagged-0.8.9/nix-support:
1803.84 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.85 s
[ghc-9.8.4-with-packages] /nix/store/415gs6mywspvfwwbwry2pq01k6a9dghd-boring-0.2.2/nix-support:
1803.85 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1803.85 s
[ghc-9.8.4-with-packages] /nix/store/415gs6mywspvfwwbwry2pq01k6a9dghd-boring-0.2.2/nix-support:
1803.85 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1804.43 s
[ghc-9.8.4-with-packages] Warning: include-dirs: /nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages/lib/ghc-9.8.4/lib/../lib/x86_64-linux-ghc-9.8.4/directory-1.3.8.5-d63d/include doesn't exist or isn't a directory
1805.53 s
[ghc-9.8.4-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages
1805.93 s
[ghc-9.8.4-with-packages:post-build] Pushing 1 paths (154 are already present) using zstd to cache sellout ⏳
1805.93 s
[ghc-9.8.4-with-packages:post-build]
1806.27 s
[ghc-9.8.4-with-packages:post-build] Pushing /nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages (4.98 MiB)
1808.15 s
[ghc-9.8.4-with-packages:post-build]
1808.15 s
[ghc-9.8.4-with-packages:post-build] All done.
1808.17 s
[ghc-9.8.4-with-packages:post-build] Uploading to the NixCI cache: /nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages
1808.21 s
[ghc-9.8.4-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1808.35 s
[ghc-9.8.4-with-packages:post-build] copying 1 paths...
1808.35 s
[ghc-9.8.4-with-packages:post-build] copying path '/nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages' to 'https://cache.nix-ci.com'...
1809.37 s
[ghc-9.8.4-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1809.58 s
[ghc-9.8.4-with-packages:post-build] copying 1 paths...
1809.58 s
[ghc-9.8.4-with-packages:post-build] copying path '/nix/store/w9blpl2j2z1mg64k6daxymyd52b744r1-ghc-9.8.4-with-packages.drv' to 'https://cache.nix-ci.com'...
1809.76 s
Progress: 35 of 37 built, 559 of 559 downloaded from cache
1809.82 s
Building /nix/store/xqwrq2d439jy2k1r352psdr2bzjpyr2v-ghc-shell-for-packages-0.drv
1809.92 s
[ghc-shell-for-packages:post-build] Uploading to cachix cache "sellout": /nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0
1810.35 s
[ghc-shell-for-packages:post-build] Pushing 1 paths (337 are already present) using zstd to cache sellout ⏳
1810.35 s
[ghc-shell-for-packages:post-build]
1810.76 s
[ghc-shell-for-packages:post-build] Pushing /nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0 (256.00 B)
1811.67 s
[ghc-shell-for-packages:post-build]
1811.67 s
[ghc-shell-for-packages:post-build] All done.
1811.68 s
[ghc-shell-for-packages:post-build] Uploading to the NixCI cache: /nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0
1811.72 s
[ghc-shell-for-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1811.75 s
[ghc-shell-for-packages:post-build] copying 1 paths...
1811.75 s
[ghc-shell-for-packages:post-build] copying path '/nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...
1811.99 s
[ghc-shell-for-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1812.29 s
[ghc-shell-for-packages:post-build] copying 1 paths...
1812.29 s
[ghc-shell-for-packages:post-build] copying path '/nix/store/xqwrq2d439jy2k1r352psdr2bzjpyr2v-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...
1812.43 s
Progress: 36 of 37 built, 559 of 559 downloaded from cache
1812.43 s
Progress: 37 of 37 built, 559 of 559 downloaded from cache
1812.44 s
/nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0
1812.50 s
Build succeeded.