943.98 s
[pandoc] #2: OK
943.99 s
[pandoc] #3: OK
943.99 s
[pandoc] 9943.md
944.00 s
[pandoc] #1: OK
944.01 s
[pandoc] #2: OK (0.01s)
944.01 s
[pandoc] 7272.md
944.01 s
[pandoc] #1: OK
944.01 s
[pandoc] 3733.md
944.02 s
[pandoc] #1: OK
944.02 s
[pandoc] 6855.md
944.03 s
[pandoc] #1: OK
944.03 s
[pandoc] 5119.md
944.04 s
[pandoc] #1: OK
944.04 s
[pandoc] mmd-metadata.md
944.04 s
[pandoc] #1: OK
944.04 s
[pandoc] 8573.md
944.05 s
[pandoc] #1: OK
944.05 s
[pandoc] 4768.md
944.05 s
[pandoc] #1: OK
944.06 s
[pandoc] citeproc-20.md
944.10 s
[pandoc] #1: OK (0.04s)
944.10 s
[pandoc] biblatex-weinberg.md
944.12 s
[pandoc] #1: OK (0.01s)
944.12 s
[pandoc] 4667.md
944.12 s
[pandoc] #1: OK
944.12 s
[pandoc] 9275.md
944.14 s
[pandoc] #1: OK (0.02s)
944.15 s
[pandoc] #2: OK (0.01s)
944.15 s
[pandoc] 7861.md
944.16 s
[pandoc] #1: OK
944.16 s
[pandoc] 4564.md
944.17 s
[pandoc] #1: OK (0.01s)
944.17 s
[pandoc] 8486.md
944.18 s
[pandoc] #1: OK
944.19 s
[pandoc] #2: OK
944.19 s
[pandoc] 5014.md
944.20 s
[pandoc] #1: OK
944.20 s
[pandoc] 5439.md
944.20 s
[pandoc] #1: OK
944.20 s
[pandoc] 4885.md
944.21 s
[pandoc] #1: OK
944.21 s
[pandoc] parse-raw.md
944.23 s
[pandoc] #1: OK (0.01s)
944.23 s
[pandoc] #2: OK
944.24 s
[pandoc] #3: OK
944.24 s
[pandoc] #4: OK
944.24 s
[pandoc] 6481.md
944.25 s
[pandoc] #1: OK (0.01s)
944.25 s
[pandoc] 9585.md
944.26 s
[pandoc] #1: OK
944.26 s
[pandoc] 4091.md
944.27 s
[pandoc] #1: OK
944.27 s
[pandoc] 9516.md
944.28 s
[pandoc] #1: OK
944.28 s
[pandoc] 7520.md
944.28 s
[pandoc] #1: OK
944.28 s
[pandoc] 7434.md
944.30 s
[pandoc] #1: OK (0.01s)
944.30 s
[pandoc] 7400.md
944.30 s
[pandoc] #1: OK
944.30 s
[pandoc] 7723.md
944.31 s
[pandoc] #1: OK
944.31 s
[pandoc] 5655.md
944.32 s
[pandoc] #1: OK
944.32 s
[pandoc] #2: OK
944.33 s
[pandoc] pandoc-citeproc-119.md
944.40 s
[pandoc] #1: OK (0.08s)
944.40 s
[pandoc] 10791.md
944.41 s
[pandoc] #1: OK
944.41 s
[pandoc] 6792.md
944.43 s
[pandoc] #1: OK (0.01s)
944.43 s
[pandoc] 4748.md
944.43 s
[pandoc] #1: OK
944.43 s
[pandoc] 2378.md
944.44 s
[pandoc] #1: OK
944.44 s
[pandoc] 3487.md
944.44 s
[pandoc] #1: OK
944.45 s
[pandoc] biblatex-sorace.md
944.47 s
[pandoc] #1: OK (0.02s)
944.47 s
[pandoc] 3983.md
944.47 s
[pandoc] #1: OK
944.48 s
[pandoc] #2: OK
944.49 s
[pandoc] #3: OK
944.49 s
[pandoc] newif.md
944.49 s
[pandoc] #1: OK
944.49 s
[pandoc] 7573.md
944.50 s
[pandoc] #1: OK
944.50 s
[pandoc] section-divs.md
944.51 s
[pandoc] #1: OK
944.51 s
[pandoc] 6752.md
944.52 s
[pandoc] #1: OK (0.01s)
944.52 s
[pandoc] biblatex-sarfraz.md
944.54 s
[pandoc] #1: OK (0.02s)
944.54 s
[pandoc] 4374.md
944.55 s
[pandoc] #1: OK
944.55 s
[pandoc] 7340.md
944.55 s
[pandoc] #1: OK
944.55 s
[pandoc] bibtex-basic.md
944.57 s
[pandoc] #1: OK (0.01s)
944.57 s
[pandoc] pandoc-citeproc-408.md
944.63 s
[pandoc] #1: OK (0.06s)
944.63 s
[pandoc] 6802.md
944.63 s
[pandoc] #1: OK
944.63 s
[pandoc] 4579.md
944.64 s
[pandoc] #1: OK
944.64 s
[pandoc] 8661.md
944.65 s
[pandoc] #1: OK
944.65 s
[pandoc] cite-in-inline-note.md
944.66 s
[pandoc] #1: OK
944.66 s
[pandoc] 6288.md
944.66 s
[pandoc] #1: OK
944.66 s
[pandoc] 5195.md
944.67 s
[pandoc] #1: OK
944.67 s
[pandoc] bits-book-meta.md
944.67 s
[pandoc] #1: OK
944.67 s
[pandoc] pandoc-citeproc-locators-delimited.md
944.70 s
[pandoc] #1: OK (0.03s)
944.70 s
[pandoc] biblatex-westfahl-frontier.md
944.72 s
[pandoc] #1: OK (0.02s)
944.72 s
[pandoc] 4639.md
944.73 s
[pandoc] #1: OK
944.73 s
[pandoc] biblatex-kullback-related.md
944.75 s
[pandoc] #1: OK (0.02s)
944.75 s
[pandoc] 10836.md
944.75 s
[pandoc] #1: OK
944.75 s
[pandoc] tasklist.md
944.76 s
[pandoc] #1: OK
944.77 s
[pandoc] #2: OK
944.78 s
[pandoc] #3: OK (0.01s)
944.79 s
[pandoc] #4: OK
944.80 s
[pandoc] #5: OK
944.80 s
[pandoc] 10650.md
944.80 s
[pandoc] #1: OK
944.80 s
[pandoc] 7181.md
944.81 s
[pandoc] #1: OK
944.81 s
[pandoc] 2606.md
944.82 s
[pandoc] #1: OK
944.82 s
[pandoc] #2: OK
944.83 s
[pandoc] #3: OK
944.84 s
[pandoc] #4: OK
944.84 s
[pandoc] biblatex-itzhaki.md
944.87 s
[pandoc] #1: OK (0.02s)
944.87 s
[pandoc] 9387.md
944.87 s
[pandoc] #1: OK
944.88 s
[pandoc] #2: OK
944.88 s
[pandoc] 8251.md
944.89 s
[pandoc] #1: OK
944.89 s
[pandoc] #2: OK
944.89 s
[pandoc] write18.md
944.90 s
[pandoc] #1: OK
944.90 s
[pandoc] #2: OK
944.90 s
[pandoc] biblatex-piccato.md
944.93 s
[pandoc] #1: OK (0.02s)
944.93 s
[pandoc] 4794.md
944.94 s
[pandoc] #1: OK (0.01s)
944.94 s
[pandoc] biblatex-laufenberg.md
944.96 s
[pandoc] #1: OK (0.03s)
944.96 s
[pandoc] 6119.md
944.97 s
[pandoc] #1: OK
944.97 s
[pandoc] 7919.md
944.98 s
[pandoc] #1: OK
944.99 s
[pandoc] #2: OK
945.00 s
[pandoc] #3: OK
945.01 s
[pandoc] #4: OK
945.02 s
[pandoc] #5: OK (0.01s)
945.04 s
[pandoc] #6: OK (0.02s)
945.04 s
[pandoc] 3523.md
945.05 s
[pandoc] #1: OK (0.01s)
945.05 s
[pandoc] 4171.md
945.06 s
[pandoc] #1: OK
945.07 s
[pandoc] #2: OK
945.07 s
[pandoc] #3: OK
945.07 s
[pandoc] 4598.md
945.08 s
[pandoc] #1: OK
945.08 s
[pandoc] pandoc-citeproc-76.md
945.15 s
[pandoc] #1: OK (0.07s)
945.15 s
[pandoc] pandoc-citeproc-77.md
945.23 s
[pandoc] #1: OK (0.08s)
945.23 s
[pandoc] 9445.md
945.24 s
[pandoc] #1: OK
945.24 s
[pandoc] nested-table-to-asciidoc-6942.md
945.24 s
[pandoc] #1: OK
945.25 s
[pandoc] #2: OK
945.25 s
[pandoc] 3974.md
945.26 s
[pandoc] #1: OK
945.26 s
[pandoc] bits-toc-elements.md
945.27 s
[pandoc] #1: OK
945.27 s
[pandoc] latex-tabular-column-specs.md
945.27 s
[pandoc] #1: OK
945.27 s
[pandoc] pandoc-citeproc-75.md
945.30 s
[pandoc] #1: OK (0.03s)
945.30 s
[pandoc] 9630.md
945.38 s
[pandoc] #1: OK
945.38 s
[pandoc] refs.md
945.38 s
[pandoc] #1: OK
945.38 s
[pandoc] #2: OK
945.38 s
[pandoc] #3: OK
945.38 s
[pandoc] #4: OK
945.38 s
[pandoc] #5: OK
945.38 s
[pandoc] #6: OK
945.38 s
[pandoc] #7: OK (0.01s)
945.38 s
[pandoc] #8: OK
945.38 s
[pandoc] 7129.md
945.38 s
[pandoc] #1: OK
945.38 s
[pandoc] 8281.md
945.39 s
[pandoc] #1: OK
945.39 s
[pandoc] macros.md
945.40 s
[pandoc] #1: OK (0.01s)
945.41 s
[pandoc] #2: OK
945.42 s
[pandoc] #3: OK
945.43 s
[pandoc] #4: OK
945.43 s
[pandoc] #5: OK
945.44 s
[pandoc] #6: OK
945.45 s
[pandoc] #7: OK
945.46 s
[pandoc] #8: OK
945.47 s
[pandoc] #9: OK
945.47 s
[pandoc] #10: OK
945.48 s
[pandoc] #11: OK
945.49 s
[pandoc] #12: OK
945.49 s
[pandoc] pandoc-citeproc-58.md
945.52 s
[pandoc] #1: OK (0.03s)
945.52 s
[pandoc] biblatex-averroes-hannes.md
945.54 s
[pandoc] #1: OK (0.03s)
945.54 s
[pandoc] 10825.md
945.55 s
[pandoc] #1: OK
945.55 s
[pandoc] pandoc-citeproc-page-range.md
945.59 s
[pandoc] #1: OK (0.04s)
945.59 s
[pandoc] defaults-inheritance-1.md
945.60 s
[pandoc] #1: OK
945.60 s
[pandoc] 7214.md
945.61 s
[pandoc] #1: OK (0.01s)
945.61 s
[pandoc] 3715.md
945.62 s
[pandoc] #1: OK
945.62 s
[pandoc] 5936.md
945.62 s
[pandoc] #1: OK
945.63 s
[pandoc] #2: OK
945.63 s
[pandoc] 262.md
945.64 s
[pandoc] #1: OK
945.65 s
[pandoc] #2: OK
945.65 s
[pandoc] 3432.md
945.66 s
[pandoc] #1: OK (0.01s)
945.67 s
[pandoc] #2: OK (0.01s)
945.69 s
[pandoc] #3: OK (0.02s)
945.71 s
[pandoc] #4: OK (0.02s)
945.72 s
[pandoc] #5: OK (0.01s)
945.74 s
[pandoc] #6: OK (0.01s)
945.74 s
[pandoc] 9987.md
945.75 s
[pandoc] #1: OK (0.01s)
945.75 s
[pandoc] 9700.md
945.76 s
[pandoc] #1: OK
945.76 s
[pandoc] 9193.md
945.76 s
[pandoc] #1: OK
945.76 s
[pandoc] 3475.md
945.77 s
[pandoc] #1: OK (0.01s)
945.78 s
[pandoc] #2: OK
945.79 s
[pandoc] #3: OK
945.80 s
[pandoc] #4: OK
945.80 s
[pandoc] 7692.md
945.81 s
[pandoc] #1: OK
945.82 s
[pandoc] #2: OK (0.01s)
945.82 s
[pandoc] biblatex-book-title-maintitle-series.md
945.83 s
[pandoc] #1: OK (0.02s)
945.83 s
[pandoc] 8738.md
945.84 s
[pandoc] #1: OK
945.84 s
[pandoc] 5519.md
945.85 s
[pandoc] #1: OK
945.85 s
[pandoc] 5654.md
945.85 s
[pandoc] #1: OK
945.85 s
[pandoc] 4653.md
945.86 s
[pandoc] #1: OK
945.86 s
[pandoc] 6719.md
945.86 s
[pandoc] #1: OK
945.87 s
[pandoc] #2: OK
945.87 s
[pandoc] 4102.md
945.88 s
[pandoc] #1: OK
945.88 s
[pandoc] pandoc-citeproc-371.md
945.91 s
[pandoc] #1: OK (0.03s)
945.91 s
[pandoc] 10185.md
945.93 s
[pandoc] #1: OK (0.03s)
945.96 s
[pandoc] #2: OK (0.03s)
945.96 s
[pandoc] 5072.md
945.96 s
[pandoc] #1: OK
945.97 s
[pandoc] 8777.md
945.97 s
[pandoc] #1: OK
945.97 s
[pandoc] biblatex-nietzsche-ksa1.md
946.00 s
[pandoc] #1: OK (0.02s)
946.00 s
[pandoc] biblatex-test-case-conversion.md
946.02 s
[pandoc] #1: OK (0.03s)
946.02 s
[pandoc] 1279.md
946.03 s
[pandoc] #1: OK
946.03 s
[pandoc] 4960.md
946.03 s
[pandoc] #1: OK
946.04 s
[pandoc] #2: OK
946.04 s
[pandoc] #3: OK
946.04 s
[pandoc] 4253.md
946.05 s
[pandoc] #1: OK
946.05 s
[pandoc] 8079.md
946.06 s
[pandoc] #1: OK
946.06 s
[pandoc] 7668.md
946.07 s
[pandoc] #1: OK (0.01s)
946.07 s
[pandoc] 3236.md
946.07 s
[pandoc] #1: OK
946.07 s
[pandoc] 5340.md
946.08 s
[pandoc] #1: OK
946.08 s
[pandoc] 3401.md
946.09 s
[pandoc] #1: OK
946.09 s
[pandoc] #2: OK
946.09 s
[pandoc] jats-figure-alt-text.md
946.10 s
[pandoc] #1: OK
946.10 s
[pandoc] figures-texinfo.md
946.10 s
[pandoc] #1: OK
946.11 s
[pandoc] #2: OK
946.12 s
[pandoc] #3: OK
946.12 s
[pandoc] #4: OK
946.12 s
[pandoc] 8764.md
946.13 s
[pandoc] #1: OK
946.13 s
[pandoc] 5541-localLink.md
946.14 s
[pandoc] #1: OK (0.01s)
946.14 s
[pandoc] short-caption.md
946.15 s
[pandoc] #1: OK
946.15 s
[pandoc] 6194.md
946.16 s
[pandoc] #1: OK
946.16 s
[pandoc] 3708.md
946.17 s
[pandoc] #1: OK
946.17 s
[pandoc] 10094.md
946.18 s
[pandoc] #1: OK (0.01s)
946.18 s
[pandoc] 4637.md
946.19 s
[pandoc] #1: OK
946.19 s
[pandoc] 5010.md
946.19 s
[pandoc] #1: OK
946.20 s
[pandoc] #2: OK
946.20 s
[pandoc] 10848.md
946.21 s
[pandoc] #1: OK
946.21 s
[pandoc] #2: OK
946.22 s
[pandoc] #3: OK
946.22 s
[pandoc] 9777-b.md
946.22 s
[pandoc] #1: OK
946.22 s
[pandoc] 3840.md
946.23 s
[pandoc] #1: OK
946.24 s
[pandoc] #2: OK
946.24 s
[pandoc] pandoc-citeproc-301.md
946.30 s
[pandoc] #1: OK (0.06s)
946.30 s
[pandoc] 5904.md
946.31 s
[pandoc] #1: OK
946.31 s
[pandoc] 9350.md
946.31 s
[pandoc] #1: OK
946.31 s
[pandoc] 10867.md
946.32 s
[pandoc] #1: OK
946.32 s
[pandoc] biblatex-knuth-ct-a.md
946.35 s
[pandoc] #1: OK (0.03s)
946.35 s
[pandoc] multiple-metadata-blocks.md
946.35 s
[pandoc] #1: OK
946.35 s
[pandoc] 5081.md
946.36 s
[pandoc] #1: OK
946.36 s
[pandoc] 8789.md
946.38 s
[pandoc] #1: OK (0.01s)
946.38 s
[pandoc] 1773.md
946.38 s
[pandoc] #1: OK
946.38 s
[pandoc] bits-book.md
946.39 s
[pandoc] #1: OK (0.01s)
946.39 s
[pandoc] 982.md
946.40 s
[pandoc] #1: OK
946.40 s
[pandoc] 3558.md
946.41 s
[pandoc] #1: OK
946.41 s
[pandoc] 7894.md
946.42 s
[pandoc] #1: OK (0.01s)
946.42 s
[pandoc] 8257.md
946.43 s
[pandoc] #1: OK
946.43 s
[pandoc] biblatex-periodical.md
946.44 s
[pandoc] #1: OK (0.01s)
946.44 s
[pandoc] biblatex-britannica.md
946.47 s
[pandoc] #1: OK (0.02s)
946.47 s
[pandoc] 1841.md
946.48 s
[pandoc] #1: OK (0.02s)
946.49 s
[pandoc] #2: OK
946.49 s
[pandoc] mdoc-Bl-column.md
946.50 s
[pandoc] #1: OK
946.50 s
[pandoc] pandoc-citeproc-437.md
946.52 s
[pandoc] #1: OK (0.02s)
946.52 s
[pandoc] 168.md
946.53 s
[pandoc] #1: OK
946.53 s
[pandoc] #2: OK
946.54 s
[pandoc] #3: OK
946.54 s
[pandoc] 6958.md
946.55 s
[pandoc] #1: OK
946.55 s
[pandoc] 6385.md
946.56 s
[pandoc] #1: OK
946.56 s
[pandoc] 3348.md
946.56 s
[pandoc] #1: OK
946.56 s
[pandoc] 3916.md
946.57 s
[pandoc] #1: OK
946.57 s
[pandoc] 3570.md
946.58 s
[pandoc] #1: OK
946.58 s
[pandoc] 4635.md
946.58 s
[pandoc] #1: OK
946.59 s
[pandoc] #2: OK
946.60 s
[pandoc] #3: OK
946.60 s
[pandoc] #4: OK
946.60 s
[pandoc] biblatex-chiu.md
946.63 s
[pandoc] #1: OK (0.03s)
946.63 s
[pandoc] pandoc-citeproc-7.md
946.66 s
[pandoc] #1: OK (0.03s)
946.66 s
[pandoc] 6424.md
946.66 s
[pandoc] #1: OK
946.66 s
[pandoc] 8097.md
946.67 s
[pandoc] #1: OK
946.67 s
[pandoc] nested-spanlike.md
946.68 s
[pandoc] #1: OK
946.68 s
[pandoc] 5819.md
946.69 s
[pandoc] #1: OK
946.69 s
[pandoc] biblatex-inbook-title-booktitle-maintitle-series-2.md
946.70 s
[pandoc] #1: OK (0.02s)
946.70 s
[pandoc] lists-inside-definition.md
946.71 s
[pandoc] #1: OK
946.72 s
[pandoc] #2: OK
946.72 s
[pandoc] #3: OK
946.72 s
[pandoc] 4624.md
946.73 s
[pandoc] #1: OK
946.73 s
[pandoc] pandoc-citeproc-250.md
946.76 s
[pandoc] #1: OK (0.03s)
946.76 s
[pandoc] biblatex-gaonkar.md
946.77 s
[pandoc] #1: OK (0.02s)
946.77 s
[pandoc] mdoc-Bl-tag.md
946.78 s
[pandoc] #1: OK
946.78 s
[pandoc] 10279.md
946.79 s
[pandoc] #1: OK
946.79 s
[pandoc] 5642.md
946.80 s
[pandoc] #1: OK
946.80 s
[pandoc] 9616.md
946.81 s
[pandoc] #1: OK (0.01s)
946.81 s
[pandoc] 7339.md
946.82 s
[pandoc] #1: OK
946.82 s
[pandoc] 7006.md
946.83 s
[pandoc] #1: OK (0.01s)
946.83 s
[pandoc] biblatex-spiegelberg.md
946.86 s
[pandoc] #1: OK (0.03s)
946.86 s
[pandoc] 6993.md
946.87 s
[pandoc] #1: OK
946.88 s
[pandoc] #2: OK
946.88 s
[pandoc] #3: OK
946.88 s
[pandoc] 4172.md
946.89 s
[pandoc] #1: OK
946.90 s
[pandoc] #2: OK
946.90 s
[pandoc] 9579.md
946.90 s
[pandoc] #1: OK
946.91 s
[pandoc] #2: OK
946.91 s
[pandoc] 3619.md
946.92 s
[pandoc] #1: OK
946.93 s
[pandoc] #2: OK (0.01s)
946.94 s
[pandoc] #3: OK
946.94 s
[pandoc] 7697.md
946.95 s
[pandoc] #1: OK
946.95 s
[pandoc] #2: OK
946.96 s
[pandoc] #3: OK
946.96 s
[pandoc] 5233.md
946.97 s
[pandoc] #1: OK
946.97 s
[pandoc] biblatex-aristotle-rhetoric.md
946.99 s
[pandoc] #1: OK (0.03s)
946.99 s
[pandoc] 6741.md
947.07 s
[pandoc] #1: OK (0.08s)
947.07 s
[pandoc] 8219.md
947.08 s
[pandoc] #1: OK
947.08 s
[pandoc] ifstrequal.md
947.09 s
[pandoc] #1: OK
947.09 s
[pandoc] biblatex-kullback-reprint.md
947.11 s
[pandoc] #1: OK (0.02s)
947.11 s
[pandoc] 1126.md
947.12 s
[pandoc] #1: OK
947.13 s
[pandoc] #2: OK
947.13 s
[pandoc] 9807.md
947.13 s
[pandoc] #1: OK
947.13 s
[pandoc] pandoc-citeproc-31.md
947.21 s
[pandoc] #1: OK (0.07s)
947.21 s
[pandoc] 4063.md
947.21 s
[pandoc] #1: OK
947.21 s
[pandoc] 6549.md
947.22 s
[pandoc] #1: OK
947.22 s
[pandoc] latex-center.md
947.23 s
[pandoc] #1: OK
947.23 s
[pandoc] ascii.md
947.23 s
[pandoc] #1: OK
947.24 s
[pandoc] #2: OK
947.25 s
[pandoc] #3: OK
947.26 s
[pandoc] #4: OK
947.26 s
[pandoc] #5: OK (0.01s)
947.27 s
[pandoc] #6: OK
947.27 s
[pandoc] #7: OK
947.28 s
[pandoc] #8: OK
947.29 s
[pandoc] #9: OK
947.30 s
[pandoc] #10: OK
947.30 s
[pandoc] #11: OK
947.31 s
[pandoc] #12: OK
947.31 s
[pandoc] 3432a.md
947.32 s
[pandoc] #1: OK
947.32 s
[pandoc] 5878.md
947.33 s
[pandoc] #1: OK
947.33 s
[pandoc] 10148.md
947.33 s
[pandoc] #1: OK
947.33 s
[pandoc] 10862.md
947.34 s
[pandoc] #1: OK
947.34 s
[pandoc] 3533-rst-csv-tables.md
947.35 s
[pandoc] #1: OK (0.01s)
947.36 s
[pandoc] #2: OK (0.01s)
947.37 s
[pandoc] #3: OK
947.37 s
[pandoc] 10781.md
947.38 s
[pandoc] #1: OK
947.38 s
[pandoc] 9021.md
947.41 s
[pandoc] #1: OK (0.03s)
947.41 s
[pandoc] 2549.md
947.41 s
[pandoc] #1: OK
947.42 s
[pandoc] #2: OK
947.43 s
[pandoc] #3: OK
947.43 s
[pandoc] #4: OK
947.43 s
[pandoc] 3804.md
947.44 s
[pandoc] #1: OK
947.44 s
[pandoc] biblatex-kullback.md
947.45 s
[pandoc] #1: OK (0.02s)
947.45 s
[pandoc] pandoc-citeproc-68.md
947.49 s
[pandoc] #1: OK (0.04s)
947.49 s
[pandoc] 5857.md
947.50 s
[pandoc] #1: OK
947.50 s
[pandoc] 3450.md
947.51 s
[pandoc] #1: OK (0.01s)
947.52 s
[pandoc] #2: OK
947.52 s
[pandoc] biblatex-inproceedings.md
947.54 s
[pandoc] #1: OK (0.03s)
947.54 s
[pandoc] 7738.md
947.55 s
[pandoc] #1: OK
947.56 s
[pandoc] biblatex-formatting.md
947.58 s
[pandoc] #1: OK (0.03s)
947.58 s
[pandoc] pandoc-citeproc-82.md
947.61 s
[pandoc] #1: OK (0.03s)
947.61 s
[pandoc] 4928.md
947.62 s
[pandoc] #1: OK
947.62 s
[pandoc] #2: OK
947.63 s
[pandoc] #3: OK
947.64 s
[pandoc] #4: OK
947.64 s
[pandoc] #5: OK
947.65 s
[pandoc] #6: OK
947.66 s
[pandoc] #7: OK
947.66 s
[pandoc] 9652.md
947.67 s
[pandoc] #1: OK
947.67 s
[pandoc] 5543.md
947.67 s
[pandoc] #1: OK
947.68 s
[pandoc] 4877.md
947.68 s
[pandoc] #1: OK
947.69 s
[pandoc] #2: OK
947.69 s
[pandoc] 8170.md
947.69 s
[pandoc] #1: OK
947.69 s
[pandoc] 9632.md
947.70 s
[pandoc] #1: OK
947.70 s
[pandoc] 6774.md
947.71 s
[pandoc] #1: OK
947.72 s
[pandoc] #2: OK
947.72 s
[pandoc] #3: OK
947.73 s
[pandoc] #4: OK
947.73 s
[pandoc] biblatex-inbook.md
947.77 s
[pandoc] #1: OK (0.03s)
947.77 s
[pandoc] 8174.md
947.77 s
[pandoc] #1: OK
947.78 s
[pandoc] #2: OK
947.78 s
[pandoc] #3: OK
947.79 s
[pandoc] #4: OK
947.79 s
[pandoc] #5: OK
947.79 s
[pandoc] figures-markdown.md
947.80 s
[pandoc] #1: OK
947.80 s
[pandoc] 8863.md
947.81 s
[pandoc] #1: OK
947.81 s
[pandoc] 8256.md
947.82 s
[pandoc] #1: OK (0.01s)
947.82 s
[pandoc] citeproc-87.md
947.85 s
[pandoc] #1: OK (0.03s)
947.88 s
[pandoc] #2: OK (0.03s)
947.91 s
[pandoc] #3: OK (0.03s)
947.91 s
[pandoc] 3530.md
947.91 s
[pandoc] #1: OK
947.92 s
[pandoc] #2: OK
947.92 s
[pandoc] 9635.md
947.93 s
[pandoc] #1: OK
947.93 s
[pandoc] 4038.md
947.94 s
[pandoc] #1: OK (0.01s)
947.94 s
[pandoc] 10805.md
947.95 s
[pandoc] #1: OK
947.96 s
[pandoc] #2: OK
947.96 s
[pandoc] 8872.md
947.97 s
[pandoc] #1: OK (0.01s)
947.97 s
[pandoc] 4860.md
947.97 s
[pandoc] #1: OK
947.97 s
[pandoc] 5619.md
947.98 s
[pandoc] #1: OK
947.98 s
[pandoc] 4235.md
947.99 s
[pandoc] #1: OK
947.99 s
[pandoc] pandoc-citeproc-64.md
948.05 s
[pandoc] #1: OK (0.06s)
948.05 s
[pandoc] 10152.md
948.08 s
[pandoc] #1: OK (0.02s)
948.11 s
[pandoc] #2: OK (0.03s)
948.14 s
[pandoc] #3: OK (0.03s)
948.16 s
[pandoc] #4: OK (0.03s)
948.19 s
[pandoc] #5: OK (0.03s)
948.21 s
[pandoc] #6: OK (0.02s)
948.23 s
[pandoc] #7: OK (0.02s)
948.23 s
[pandoc] 8437.md
948.25 s
[pandoc] #1: OK (0.01s)
948.26 s
[pandoc] #2: OK (0.01s)
948.26 s
[pandoc] #3: OK
948.26 s
[pandoc] 5420.md
948.27 s
[pandoc] #1: OK
948.27 s
[pandoc] 8070.md
948.28 s
[pandoc] #1: OK
948.28 s
[pandoc] 8110.md
948.29 s
[pandoc] #1: OK
948.29 s
[pandoc] 5686.md
948.30 s
[pandoc] #1: OK
948.30 s
[pandoc] figures-zimwiki.md
948.30 s
[pandoc] #1: OK
948.30 s
[pandoc] 8364.md
948.33 s
[pandoc] #1: OK (0.03s)
948.33 s
[pandoc] 8243.md
948.34 s
[pandoc] #1: OK (0.01s)
948.34 s
[pandoc] 4240.md
948.35 s
[pandoc] #1: OK
948.35 s
[pandoc] 6324.md
948.36 s
[pandoc] #1: OK
948.36 s
[pandoc] biblatex-gaonkar-in.md
948.37 s
[pandoc] #1: OK (0.02s)
948.37 s
[pandoc] 9467.md
948.39 s
[pandoc] #1: OK (0.01s)
948.39 s
[pandoc] biblatex-baez-article.md
948.41 s
[pandoc] #1: OK (0.03s)
948.41 s
[pandoc] 6791.md
948.42 s
[pandoc] #1: OK
948.42 s
[pandoc] biblatex-kant-kpv.md
948.45 s
[pandoc] #1: OK (0.03s)
948.45 s
[pandoc] figures-context.md
948.46 s
[pandoc] #1: OK
948.46 s
[pandoc] #2: OK
948.46 s
[pandoc] biblatex-cotton.md
948.49 s
[pandoc] #1: OK (0.02s)
948.49 s
[pandoc] 4669.md
948.50 s
[pandoc] #1: OK
948.51 s
[pandoc] #2: OK (0.01s)
948.51 s
[pandoc] biblatex-knuth-ct-d.md
948.53 s
[pandoc] #1: OK (0.02s)
948.53 s
[pandoc] 8088.md
948.54 s
[pandoc] #1: OK
948.54 s
[pandoc] pandoc-citeproc-320a.md
948.61 s
[pandoc] #1: OK (0.07s)
948.61 s
[pandoc] 5627.md
948.62 s
[pandoc] #1: OK (0.02s)
948.64 s
[pandoc] #2: OK (0.01s)
948.65 s
[pandoc] #3: OK (0.01s)
948.65 s
[pandoc] 6768.md
948.65 s
[pandoc] #1: OK
948.66 s
[pandoc] #2: OK
948.66 s
[pandoc] 7436.md
948.67 s
[pandoc] #1: OK
948.67 s
[pandoc] 9777.md
948.68 s
[pandoc] #1: OK
948.68 s
[pandoc] biblatex-issue288.md
948.70 s
[pandoc] #1: OK (0.02s)
948.70 s
[pandoc] 3314.md
948.71 s
[pandoc] #1: OK (0.01s)
948.71 s
[pandoc] 8047.md
948.72 s
[pandoc] #1: OK (0.01s)
948.72 s
[pandoc] biblatex-brandt.md
948.74 s
[pandoc] #1: OK (0.03s)
948.74 s
[pandoc] 7494.md
948.75 s
[pandoc] #1: OK
948.76 s
[pandoc] #2: OK
948.76 s
[pandoc] #3: OK
948.77 s
[pandoc] #4: OK
948.77 s
[pandoc] #5: OK
948.77 s
[pandoc] 4183.md
948.78 s
[pandoc] #1: OK
948.79 s
[pandoc] #2: OK
948.79 s
[pandoc] #3: OK
948.79 s
[pandoc] 10621.md
948.80 s
[pandoc] #1: OK
948.80 s
[pandoc] pandoc-citeproc-320.md
948.88 s
[pandoc] #1: OK (0.07s)
948.88 s
[pandoc] 7329.md
948.89 s
[pandoc] #1: OK (0.01s)
948.91 s
[pandoc] #2: OK (0.03s)
948.94 s
[pandoc] #3: OK (0.03s)
948.95 s
[pandoc] #4: OK (0.01s)
948.95 s
[pandoc] 7568.md
948.96 s
[pandoc] #1: OK (0.01s)
948.96 s
[pandoc] biblatex-knuth-ct-b.md
948.99 s
[pandoc] #1: OK (0.02s)
948.99 s
[pandoc] biblatex-hammond.md
949.01 s
[pandoc] #1: OK (0.02s)
949.01 s
[pandoc] hyphenat.md
949.01 s
[pandoc] #1: OK
949.02 s
[pandoc] #2: OK
949.03 s
[pandoc] #3: OK
949.04 s
[pandoc] #4: OK
949.04 s
[pandoc] #5: OK
949.05 s
[pandoc] #6: OK
949.06 s
[pandoc] #7: OK
949.06 s
[pandoc] macro-defs-in-preamble.md
949.06 s
[pandoc] #1: OK
949.06 s
[pandoc] 7847.md
949.07 s
[pandoc] #1: OK
949.08 s
[pandoc] #2: OK
949.09 s
[pandoc] #3: OK
949.09 s
[pandoc] 8681.md
949.10 s
[pandoc] #1: OK
949.10 s
[pandoc] biblatex-strings.md
949.11 s
[pandoc] #1: OK (0.02s)
949.11 s
[pandoc] 5039.md
949.12 s
[pandoc] #1: OK
949.12 s
[pandoc] #2: OK
949.13 s
[pandoc] #3: OK
949.13 s
[pandoc] biblatex-markey.md
949.15 s
[pandoc] #1: OK (0.02s)
949.15 s
[pandoc] 6873.md
949.17 s
[pandoc] #1: OK (0.02s)
949.17 s
[pandoc] duplicate_attributes.md
949.18 s
[pandoc] #1: OK
949.18 s
[pandoc] biblatex-options-url-false-doi-false.md
949.19 s
[pandoc] #1: OK (0.02s)
949.19 s
[pandoc] hspace.md
949.21 s
[pandoc] #1: OK (0.01s)
949.22 s
[pandoc] #2: OK (0.02s)
949.23 s
[pandoc] #3: OK
949.24 s
[pandoc] #4: OK
949.24 s
[pandoc] biblatex-crossref-nested.md
949.26 s
[pandoc] #1: OK (0.02s)
949.26 s
[pandoc] 5079.md
949.27 s
[pandoc] #1: OK
949.27 s
[pandoc] pandoc-citeproc-152.md
949.35 s
[pandoc] #1: OK (0.08s)
949.35 s
[pandoc] html-read-figure.md
949.36 s
[pandoc] #1: OK
949.36 s
[vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
949.37 s
[pandoc] #2: OK (0.01s)
949.38 s
[pandoc] #3: OK
949.38 s
[pandoc] #4: OK
949.39 s
[pandoc] #5: OK
949.39 s
[pandoc] 9121.md
949.39 s
[pandoc] #1: OK
949.40 s
[pandoc] #2: OK
949.40 s
[pandoc] 2552.md
949.41 s
[pandoc] #1: OK
949.41 s
[pandoc] 2118.md
949.42 s
[pandoc] #1: OK
949.42 s
[pandoc] 3113.md
949.42 s
[pandoc] #1: OK
949.42 s
[pandoc] 6308.md
949.43 s
[pandoc] #1: OK
949.43 s
[pandoc] wikilinks_title_before_pipe.md
949.44 s
[pandoc] #1: OK
949.45 s
[pandoc] #2: OK
949.46 s
[pandoc] #3: OK (0.01s)
949.49 s
[pandoc] #4: OK (0.03s)
949.50 s
[pandoc] #5: OK
949.50 s
[pandoc] 5876.md
949.50 s
[pandoc] #1: OK
949.51 s
[pandoc] #2: OK
949.52 s
[pandoc] #3: OK
949.52 s
[pandoc] #4: OK
949.52 s
[pandoc] 8365.md
949.53 s
[pandoc] #1: OK
949.53 s
[pandoc] 4162.md
949.54 s
[pandoc] #1: OK
949.54 s
[pandoc] 10385.md
949.55 s
[pandoc] #1: OK
949.55 s
[pandoc] 3529.md
949.56 s
[pandoc] #1: OK (0.01s)
949.56 s
[pandoc] biblatex-video.md
949.57 s
[pandoc] #1: OK (0.01s)
949.57 s
[pandoc] 8508.md
949.58 s
[pandoc] #1: OK
949.58 s
[pandoc] 10414.md
949.59 s
[pandoc] #1: OK
949.59 s
[pandoc] 9391.md
949.61 s
[pandoc] #1: OK (0.02s)
949.61 s
[pandoc] 7743.md
949.61 s
[pandoc] #1: OK
949.62 s
[pandoc] #2: OK
949.63 s
[pandoc] #3: OK
949.63 s
[pandoc] #4: OK
949.64 s
[pandoc] #5: OK
949.65 s
[pandoc] #6: OK
949.69 s
[pandoc] #7: OK (0.05s)
949.70 s
[pandoc] #8: OK
949.70 s
[pandoc] 7813.md
949.72 s
[pandoc] #1: OK
949.72 s
[pandoc] pandoc-citeproc-401.md
949.80 s
[pandoc] #1: OK (0.09s)
949.80 s
[pandoc] 3674.md
949.81 s
[pandoc] #1: OK
949.82 s
[pandoc] #2: OK
949.82 s
[pandoc] 6755.md
949.82 s
[pandoc] #1: OK
949.82 s
[pandoc] 3407.md
949.83 s
[pandoc] #1: OK
949.84 s
[pandoc] #2: OK
949.84 s
[pandoc] biblatex-online.md
949.86 s
[pandoc] #1: OK (0.03s)
949.86 s
[pandoc] biblatex-jcg.md
949.88 s
[pandoc] #1: OK (0.02s)
949.88 s
[pandoc] dots.md
949.89 s
[pandoc] #1: OK
949.89 s
[pandoc] 3779.md
949.90 s
[pandoc] #1: OK (0.01s)
949.90 s
[pandoc] 3755.md
949.90 s
[pandoc] #1: OK
949.91 s
[pandoc] #2: OK
949.91 s
[pandoc] 6836.md
949.92 s
[pandoc] #1: OK
949.92 s
[pandoc] 5495.md
949.93 s
[pandoc] #1: OK
949.93 s
[pandoc] 4677.md
949.94 s
[pandoc] #1: OK (0.01s)
949.94 s
[pandoc] 4159.md
949.95 s
[pandoc] #1: OK
949.95 s
[pandoc] 4056.md
949.96 s
[pandoc] #1: OK
949.97 s
[pandoc] #2: OK
949.97 s
[pandoc] 9878.md
949.97 s
[pandoc] #1: OK
949.98 s
[pandoc] #2: OK
949.98 s
[pandoc] 1608.md
949.99 s
[pandoc] #1: OK (0.01s)
949.99 s
[pandoc] biblatex-herrmann.md
950.02 s
[pandoc] #1: OK (0.02s)
950.02 s
[pandoc] 3499.md
950.03 s
[pandoc] #1: OK
950.03 s
[pandoc] 3706.md
950.04 s
[pandoc] #1: OK
950.04 s
[pandoc] #2: OK
950.04 s
[pandoc] 8997.md
950.05 s
[pandoc] #1: OK
950.06 s
[pandoc] #2: OK
950.06 s
[pandoc] 5635.md
950.07 s
[pandoc] #1: OK
950.07 s
[pandoc] #2: OK
950.07 s
[pandoc] 3701.md
950.08 s
[pandoc] #1: OK
950.10 s
[pandoc] #2: OK (0.02s)
950.10 s
[pandoc] 4281.md
950.11 s
[pandoc] #1: OK
950.11 s
[pandoc] 9597.md
950.12 s
[pandoc] #1: OK
950.12 s
[pandoc] 9002.md
950.13 s
[pandoc] #1: OK (0.02s)
950.13 s
[pandoc] 5740.md
950.14 s
[pandoc] #1: OK
950.14 s
[pandoc] 5967.md
950.15 s
[pandoc] #1: OK (0.01s)
950.15 s
[pandoc] 7623.md
950.16 s
[pandoc] #1: OK
950.16 s
[pandoc] biblatex-incollection-2.md
950.18 s
[pandoc] #1: OK (0.03s)
950.18 s
[pandoc] 7713.md
950.20 s
[pandoc] #1: OK (0.01s)
950.20 s
[pandoc] 6658.md
950.21 s
[pandoc] #1: OK (0.02s)
950.21 s
[pandoc] 3512.md
950.22 s
[pandoc] #1: OK
950.23 s
[pandoc] #2: OK
950.23 s
[pandoc] biblatex-yoon.md
950.26 s
[pandoc] #1: OK (0.03s)
950.26 s
[pandoc] tex-group.md
950.26 s
[pandoc] #1: OK
950.26 s
[pandoc] 6350.md
950.27 s
[pandoc] #1: OK
950.28 s
[pandoc] #2: OK
950.28 s
[pandoc] 4722.md
950.29 s
[pandoc] #1: OK
950.29 s
[pandoc] #2: OK
950.29 s
[pandoc] biblatex-augustine.md
950.31 s
[pandoc] #1: OK (0.02s)
950.38 s
[pandoc] 3511.md
950.38 s
[pandoc] #1: OK
950.38 s
[pandoc] #2: OK
950.38 s
[pandoc] biblatex-shore.md
950.38 s
[pandoc] #1: OK (0.02s)
950.38 s
[pandoc] 9472.md
950.38 s
[pandoc] #1: OK (0.03s)
950.38 s
[pandoc] 10071.md
950.38 s
[pandoc] #1: OK
950.38 s
[pandoc] 9201.md
950.39 s
[pandoc] #1: OK
950.39 s
[pandoc] 5836.md
950.40 s
[pandoc] #1: OK
950.40 s
[pandoc] #2: OK
950.41 s
[pandoc] #3: OK
950.41 s
[pandoc] 4576.md
950.41 s
[pandoc] #1: OK
950.41 s
[pandoc] 5849-prefix.md
950.42 s
[pandoc] #1: OK
950.42 s
[pandoc] #2: OK
950.44 s
[pandoc] #3: OK (0.01s)
950.45 s
[pandoc] #4: OK (0.01s)
950.46 s
[pandoc] #5: OK (0.01s)
950.46 s
[pandoc] 7858.md
950.47 s
[pandoc] #1: OK
950.47 s
[pandoc] 9388.md
950.48 s
[pandoc] #1: OK
950.48 s
[pandoc] 6925.md
950.49 s
[pandoc] #1: OK
950.49 s
[pandoc] 4715.md
950.49 s
[pandoc] #1: OK
950.49 s
[pandoc] biblatex-basic.md
950.52 s
[pandoc] #1: OK (0.03s)
950.52 s
[pandoc] 5705.md
950.53 s
[pandoc] #1: OK
950.53 s
[pandoc] 4454.md
950.54 s
[pandoc] #1: OK
950.54 s
[pandoc] 8504.md
950.55 s
[pandoc] #1: OK (0.01s)
950.56 s
[pandoc] #2: OK
950.58 s
[pandoc] #3: OK (0.02s)
950.58 s
[pandoc] citeproc-7a.md
950.61 s
[pandoc] #1: OK (0.04s)
950.61 s
[pandoc] pandoc-citeproc-118.md
950.64 s
[pandoc] #1: OK (0.03s)
950.64 s
[pandoc] 6588.md
950.65 s
[pandoc] #1: OK
950.65 s
[pandoc] 7172.md
950.66 s
[pandoc] #1: OK
950.67 s
[pandoc] #2: OK
950.67 s
[pandoc] 4465.md
950.68 s
[pandoc] #1: OK
950.68 s
[pandoc] tabularx.md
950.69 s
[pandoc] #1: OK (0.01s)
950.70 s
[pandoc] #2: OK (0.02s)
950.72 s
[pandoc] #3: OK (0.01s)
950.72 s
[pandoc] 4012.md
950.73 s
[pandoc] #1: OK (0.01s)
950.73 s
[pandoc] 5321.md
950.74 s
[pandoc] #1: OK
950.75 s
[pandoc] #2: OK
950.75 s
[pandoc] 4424.md
950.75 s
[pandoc] #1: OK
950.75 s
[pandoc] 7930.md
950.76 s
[pandoc] #1: OK
950.76 s
[pandoc] 5541-urlLink.md
950.78 s
[pandoc] #1: OK (0.01s)
950.78 s
[pandoc] 6265.md
950.78 s
[pandoc] #1: OK
950.78 s
[pandoc] 10093.md
950.79 s
[pandoc] #1: OK
950.80 s
[pandoc] #2: OK (0.01s)
950.80 s
[pandoc] biblatex-westfahl-space.md
950.83 s
[vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0..
950.83 s
[vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0..
950.83 s
[pandoc] #1: OK (0.03s)
950.83 s
[pandoc] 7299.md
950.84 s
[pandoc] #1: OK
950.84 s
[pandoc] #2: OK
950.85 s
[pandoc] #3: OK
950.85 s
[pandoc] 7557.md
950.86 s
[pandoc] #1: OK
950.86 s
[pandoc] 4208.md
950.87 s
[pandoc] #1: OK (0.01s)
950.87 s
[pandoc] biblatex-manual.md
950.90 s
[pandoc] #1: OK (0.03s)
950.90 s
[pandoc] 8028.md
950.91 s
[pandoc] #1: OK
950.91 s
[pandoc] 6441.md
950.91 s
[pandoc] #1: OK
950.91 s
[pandoc] 8344.md
950.94 s
[pandoc] #1: OK (0.03s)
950.94 s
[pandoc] 10758.md
950.94 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 )
950.95 s
[pandoc] #1: OK
950.95 s
[pandoc] figures-xwiki.md
950.95 s
[pandoc] #1: OK
950.95 s
[pandoc] 4284.md
950.96 s
[pandoc] #1: OK
950.97 s
[pandoc] #2: OK
950.98 s
[pandoc] #3: OK
950.99 s
[pandoc] #4: OK
950.99 s
[pandoc] 5620.md
950.99 s
[pandoc] #1: OK
950.99 s
[pandoc] 8956.md
951.00 s
[pandoc] #1: OK (0.01s)
951.01 s
[pandoc] #2: OK
951.02 s
[pandoc] #3: OK
951.03 s
[pandoc] #4: OK
951.04 s
[pandoc] #5: OK
951.04 s
[pandoc] pandoc-citeproc-365.md
951.07 s
[pandoc] #1: OK (0.03s)
951.07 s
[pandoc] 5549.md
951.07 s
[pandoc] #1: OK
951.07 s
[pandoc] 3937.md
951.07 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 )
951.08 s
[pandoc] #1: OK
951.08 s
[pandoc] biblatex-cms.md
951.11 s
[pandoc] #1: OK (0.03s)
951.11 s
[pandoc] 4054.md
951.11 s
[pandoc] #1: OK
951.12 s
[pandoc] #2: OK
951.12 s
[pandoc] 4781.md
951.12 s
[pandoc] #1: OK
951.13 s
[pandoc] #2: OK
951.13 s
[pandoc] pandoc-citeproc-27.md
951.15 s
[pandoc] #1: OK (0.02s)
951.15 s
[pandoc] biblatex-patent.md
951.18 s
[pandoc] #1: OK (0.03s)
951.18 s
[pandoc] 4913.md
951.19 s
[pandoc] #1: OK
951.20 s
[pandoc] #2: OK
951.21 s
[pandoc] #3: OK
951.21 s
[pandoc] #4: OK
951.22 s
[pandoc] #5: OK
951.22 s
[pandoc] 4442.md
951.23 s
[pandoc] #1: OK
951.23 s
[pandoc] pandoc-citeproc-number-of-volumes.md
951.26 s
[pandoc] #1: OK (0.03s)
951.26 s
[pandoc] 10497.md
951.26 s
[pandoc] #1: OK
951.27 s
[pandoc] 5080.md
951.27 s
[pandoc] #1: OK
951.28 s
[pandoc] #2: OK
951.28 s
[pandoc] 4743.md
951.28 s
[pandoc] #1: OK
951.29 s
[pandoc] #2: OK
951.31 s
[pandoc] #3: OK (0.01s)
951.31 s
[pandoc] Old
951.31 s
[pandoc] markdown
951.31 s
[pandoc] writer
951.39 s
[pandoc] basic: OK (0.09s)
951.42 s
[pandoc] tables: OK (0.03s)
951.43 s
[pandoc] lhs to normal: OK (0.01s)
951.45 s
[pandoc] lhs to lhs: OK (0.01s)
951.55 s
[pandoc] basic: OK (0.10s)
951.59 s
[pandoc] tables: OK (0.04s)
951.62 s
[pandoc] planets table: OK (0.03s)
951.63 s
[pandoc] nordics table: OK (0.01s)
951.64 s
[pandoc] students table: OK (0.01s)
951.64 s
[pandoc] reader
951.73 s
[pandoc] basic: OK (0.08s)
951.75 s
[pandoc] tables: OK (0.02s)
951.78 s
[pandoc] pipe tables: OK (0.03s)
951.84 s
[pandoc] more: OK (0.06s)
951.85 s
[pandoc] lhs: OK
951.85 s
[pandoc] citations
951.87 s
[pandoc] citations: OK (0.02s)
951.87 s
[pandoc] rst
951.87 s
[pandoc] writer
951.94 s
[pandoc] basic: OK (0.08s)
951.98 s
[pandoc] tables: OK (0.03s)
951.99 s
[pandoc] lhs to normal: OK (0.01s)
952.00 s
[pandoc] lhs to lhs: OK (0.01s)
952.00 s
[pandoc] reader
952.09 s
[pandoc] basic: OK (0.09s)
952.13 s
[pandoc] tables: OK (0.04s)
952.15 s
[pandoc] lhs: OK (0.02s)
952.15 s
[pandoc] latex
952.15 s
[pandoc] writer
952.24 s
[pandoc] basic: OK (0.09s)
952.24 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 )
952.24 s
[vector]
952.24 s
[vector] tests/Utilities.hs:244:17: warning : [ GHC-63394 ] [ -Wx-partial ]
952.24 s
[vector] In the use of ‘tail’
952.24 s
[vector] (imported from Prelude, but defined in GHC.List):
952.24 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."
952.24 s
[vector] |
952.24 s
[vector] 244 | postscanl f z = tail . scanl f z
952.24 s
[vector] | ^^^^
952.24 s
[vector]
952.24 s
[vector] tests/Utilities.hs:245:16: warning : [ GHC-63394 ] [ -Wx-partial ]
952.24 s
[vector] In the use of ‘tail’
952.24 s
[vector] (imported from Prelude, but defined in GHC.List):
952.24 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."
952.24 s
[vector] |
952.24 s
[vector] 245 | prescanr f z = tail . scanr f z
952.24 s
[vector] | ^^^^
952.24 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 )
952.24 s
[vector]
952.24 s
[vector] tests/Tests/Vector/Property.hs:243:68: warning : [ GHC-63394 ] [ -Wx-partial ]
952.24 s
[vector] In the use of ‘head’
952.24 s
[vector] (imported from Data.List, but defined in GHC.List):
952.24 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."
952.24 s
[vector] |
952.24 s
[vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
952.24 s
[vector] | ^^^^
952.24 s
[vector]
952.24 s
[vector] tests/Tests/Vector/Property.hs:256:76: warning : [ GHC-63394 ] [ -Wx-partial ]
952.24 s
[vector] In the use of ‘head’
952.24 s
[vector] (imported from Data.List, but defined in GHC.List):
952.24 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."
952.24 s
[vector] |
952.24 s
[vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
952.24 s
[vector] | ^^^^
952.24 s
[vector]
952.24 s
[vector] tests/Tests/Vector/Property.hs:272:65: warning : [ GHC-63394 ] [ -Wx-partial ]
952.24 s
[vector] In the use of ‘tail’
952.24 s
[vector] (imported from Data.List, but defined in GHC.List):
952.24 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."
952.24 s
[vector] |
952.24 s
[vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
952.24 s
[vector] | ^^^^
952.24 s
[vector]
952.24 s
[vector] tests/Tests/Vector/Property.hs:439:26: warning : [ GHC-63394 ] [ -Wx-partial ]
952.24 s
[vector] In the use of ‘head’
952.24 s
[vector] (imported from Data.List, but defined in GHC.List):
952.24 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."
952.24 s
[vector] |
952.24 s
[vector] 439 | = V.uniq `eq` (map head . group)
952.24 s
[vector] | ^^^^
952.27 s
[pandoc] tables: OK (0.03s)
952.29 s
[pandoc] planets table: OK (0.02s)
952.31 s
[pandoc] nordics table: OK (0.01s)
952.32 s
[pandoc] students table: OK
952.33 s
[pandoc] lhs to normal: OK (0.02s)
952.35 s
[pandoc] lhs to lhs: OK (0.01s)
952.35 s
[pandoc] reader
952.43 s
[pandoc] basic: OK (0.08s)
952.44 s
[pandoc] lhs: OK
952.44 s
[pandoc] html
952.44 s
[pandoc] writer
952.53 s
[pandoc] basic: OK (0.10s)
952.57 s
[pandoc] tables: OK (0.03s)
952.60 s
[pandoc] planets table: OK (0.03s)
952.61 s
[pandoc] nordics table: OK (0.01s)
952.62 s
[pandoc] students table: OK (0.01s)
952.72 s
[pandoc] basic: OK (0.10s)
952.76 s
[pandoc] tables: OK (0.04s)
952.79 s
[pandoc] planets table: OK (0.03s)
952.80 s
[pandoc] nordics table: OK (0.02s)
952.82 s
[pandoc] students table: OK (0.01s)
952.84 s
[pandoc] lhs to normal: OK (0.02s)
953.05 s
[pandoc] lhs to lhs: OK (0.21s)
953.14 s
[pandoc] reader: OK (0.10s)
953.14 s
[pandoc] s5
953.17 s
[pandoc] s5 writer (basic): OK (0.03s)
953.19 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 )
953.20 s
[pandoc] s5 writer (fancy): OK (0.03s)
953.23 s
[pandoc] html4 writer (fragment): OK (0.02s)
953.26 s
[pandoc] html4 writer (inserts): OK (0.03s)
953.26 s
[pandoc] textile
953.26 s
[pandoc] writer
953.33 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 )
953.33 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 )
953.33 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 )
953.33 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 )
953.33 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 )
953.33 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 )
953.33 s
[vector]
953.33 s
[vector] tests/Tests/Bundle.hs:76:77: warning : [ GHC-63394 ] [ -Wx-partial ]
953.33 s
[vector] In the use of ‘head’
953.33 s
[vector] (imported from Prelude, but defined in GHC.List):
953.33 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."
953.33 s
[vector] |
953.33 s
[vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
953.33 s
[vector] | ^^^^
953.33 s
[vector]
953.33 s
[vector] tests/Tests/Bundle.hs:92:83: warning : [ GHC-63394 ] [ -Wx-partial ]
953.33 s
[vector] In the use of ‘tail’
953.33 s
[vector] (imported from Prelude, but defined in GHC.List):
953.33 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."
953.33 s
[vector] |
953.33 s
[vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
953.33 s
[vector] | ^^^^
953.33 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 )
953.33 s
[pandoc] basic: OK (0.08s)
953.36 s
[pandoc] tables: OK (0.03s)
953.49 s
[pandoc] reader: OK (0.13s)
953.49 s
[pandoc] djot
953.49 s
[pandoc] writer
953.57 s
[pandoc] basic: OK (0.08s)
953.60 s
[pandoc] tables: OK (0.03s)
953.63 s
[pandoc] reader: OK (0.02s)
953.63 s
[pandoc] docbook
953.63 s
[pandoc] writer
953.72 s
[pandoc] basic: OK (0.09s)
953.75 s
[pandoc] tables: OK (0.03s)
953.81 s
[pandoc] reader: OK (0.06s)
953.82 s
[pandoc] reader: OK
953.83 s
[vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
953.83 s
[pandoc] reader: OK (0.01s)
953.83 s
[pandoc] docbook5
953.83 s
[pandoc] writer
953.91 s
[pandoc] basic: OK (0.08s)
953.94 s
[pandoc] tables: OK (0.03s)
953.94 s
[pandoc] jats
953.94 s
[pandoc] writer
953.94 s
[pandoc] jats_archiving
954.06 s
[pandoc] basic: OK (0.11s)
954.09 s
[pandoc] tables: OK (0.03s)
954.12 s
[pandoc] planets table: OK (0.03s)
954.13 s
[pandoc] nordics table: OK (0.01s)
954.14 s
[pandoc] students table: OK (0.01s)
954.14 s
[pandoc] jats_articleauthoring
954.23 s
[pandoc] basic: OK (0.09s)
954.27 s
[pandoc] tables: OK (0.03s)
954.27 s
[pandoc] jats_publishing
954.36 s
[pandoc] basic: OK (0.10s)
954.40 s
[pandoc] tables: OK (0.04s)
954.48 s
[pandoc] reader: OK (0.08s)
954.48 s
[pandoc] jira
954.48 s
[pandoc] writer
954.56 s
[pandoc] basic: OK (0.08s)
954.59 s
[pandoc] tables: OK (0.03s)
954.62 s
[pandoc] reader: OK (0.03s)
954.62 s
[pandoc] native
954.62 s
[pandoc] writer
954.72 s
[pandoc] basic: OK (0.10s)
954.75 s
[pandoc] tables: OK (0.03s)
954.77 s
[vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0..
954.77 s
[vector] Building test suite 'vector-doctest' for vector-0.13.2.0..
954.84 s
[vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
954.84 s
[pandoc] reader: OK (0.09s)
954.84 s
[pandoc] fb2
954.85 s
[pandoc] basic: OK (0.01s)
954.86 s
[pandoc] titles: OK
954.87 s
[pandoc] images: OK (0.01s)
954.89 s
[pandoc] images-embedded: OK (0.01s)
954.89 s
[pandoc] math: OK
954.90 s
[pandoc] meta: OK
954.93 s
[pandoc] tables: OK (0.03s)
955.02 s
[pandoc] testsuite: OK (0.08s)
955.02 s
[pandoc] mediawiki
955.02 s
[pandoc] writer
955.10 s
[pandoc] basic: OK (0.08s)
955.13 s
[pandoc] tables: OK (0.03s)
955.20 s
[pandoc] basic: OK (0.08s)
955.21 s
[vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
955.23 s
[pandoc] tables: OK (0.03s)
955.25 s
[pandoc] planets table: OK (0.02s)
955.27 s
[pandoc] nordics table: OK (0.01s)
955.28 s
[pandoc] students table: OK (0.01s)
955.33 s
[pandoc] reader: OK (0.05s)
955.33 s
[pandoc] vimwiki
955.41 s
[pandoc] reader: OK (0.08s)
955.46 s
[pandoc] dokuwiki
955.46 s
[pandoc] writer
955.48 s
[pandoc] basic: OK (0.07s)
955.51 s
[pandoc] tables: OK (0.03s)
955.52 s
[pandoc] inline_formatting: OK (0.01s)
955.53 s
[pandoc] multiblock table: OK
955.54 s
[pandoc] external images: OK
955.54 s
[pandoc] opml
955.64 s
[pandoc] basic: OK (0.10s)
955.66 s
[pandoc] reader: OK (0.02s)
955.66 s
[pandoc] haddock
955.66 s
[pandoc] writer
955.73 s
[pandoc] basic: OK (0.08s)
955.76 s
[pandoc] tables: OK (0.03s)
955.78 s
[pandoc] reader: OK (0.01s)
955.78 s
[pandoc] txt2tags
955.89 s
[pandoc] reader: OK (0.11s)
955.89 s
[pandoc] epub
955.96 s
[pandoc] features: OK (0.07s)
956.08 s
[pandoc] wasteland: OK (0.11s)
956.24 s
[pandoc] formatting: OK (0.16s)
956.24 s
[pandoc] twiki
956.28 s
[pandoc] reader: OK (0.04s)
956.28 s
[pandoc] tikiwiki
956.31 s
[pandoc] reader: OK (0.03s)
956.31 s
[pandoc] other writers
956.31 s
[pandoc] opendocument
956.42 s
[pandoc] basic: OK (0.11s)
956.46 s
[pandoc] tables: OK (0.04s)
956.46 s
[pandoc] context
956.54 s
[pandoc] basic: OK (0.08s)
956.57 s
[pandoc] tables: OK (0.03s)
956.57 s
[pandoc] texinfo
956.64 s
[pandoc] basic: OK (0.07s)
956.67 s
[pandoc] tables: OK (0.03s)
956.67 s
[pandoc] icml
956.78 s
[pandoc] basic: OK (0.11s)
956.82 s
[pandoc] tables: OK (0.04s)
956.82 s
[pandoc] tei
956.90 s
[pandoc] basic: OK (0.08s)
956.93 s
[pandoc] tables: OK (0.03s)
956.93 s
[pandoc] man
957.01 s
[pandoc] basic: OK (0.08s)
957.03 s
[pandoc] tables: OK (0.03s)
957.03 s
[pandoc] plain
957.12 s
[pandoc] basic: OK (0.09s)
957.15 s
[pandoc] tables: OK (0.03s)
957.15 s
[pandoc] asciidoc
957.22 s
[pandoc] basic: OK (0.07s)
957.25 s
[pandoc] tables: OK (0.03s)
957.25 s
[pandoc] asciidoc_legacy
957.32 s
[pandoc] basic: OK (0.07s)
957.35 s
[pandoc] tables: OK (0.03s)
957.35 s
[pandoc] xwiki
957.42 s
[pandoc] basic: OK (0.07s)
957.45 s
[pandoc] tables: OK (0.03s)
957.45 s
[pandoc] zimwiki
957.52 s
[pandoc] basic: OK (0.07s)
957.55 s
[pandoc] tables: OK (0.03s)
957.55 s
[pandoc] writers-lang-and-dir
957.58 s
[pandoc] latex: OK (0.03s)
957.60 s
[pandoc] context: OK (0.03s)
957.60 s
[pandoc] muse
957.60 s
[pandoc] writer
957.69 s
[pandoc] basic: OK (0.09s)
957.73 s
[pandoc] tables: OK (0.03s)
957.73 s
[pandoc] ms
957.81 s
[pandoc] basic: OK (0.09s)
957.85 s
[pandoc] tables: OK (0.03s)
957.85 s
[pandoc] typst
957.85 s
[pandoc] writer
957.93 s
[pandoc] basic: OK (0.09s)
957.96 s
[pandoc] tables: OK (0.03s)
958.06 s
[pandoc] basic: OK (0.09s)
958.09 s
[pandoc] tables: OK (0.03s)
958.11 s
[pandoc] planets table: OK (0.02s)
958.12 s
[pandoc] nordics table: OK (0.01s)
958.13 s
[pandoc] students table: OK
958.13 s
[pandoc] reader
958.35 s
[pandoc] typst-reader: OK (0.22s)
958.36 s
[pandoc] creole
958.39 s
[pandoc] reader: OK (0.03s)
958.39 s
[pandoc] man
958.41 s
[pandoc] reader: OK (0.02s)
958.41 s
[pandoc] org
958.43 s
[pandoc] reader: OK (0.02s)
958.43 s
[pandoc] writer
958.51 s
[pandoc] basic: OK (0.08s)
958.54 s
[pandoc] tables: OK (0.03s)
958.54 s
[pandoc] rtf
958.54 s
[pandoc] writer
958.66 s
[pandoc] basic: OK (0.12s)
958.69 s
[pandoc] tables: OK (0.03s)
958.69 s
[pandoc] endnotexml
958.70 s
[pandoc] reader: OK (0.01s)
958.70 s
[pandoc] ipynb
958.71 s
[pandoc] reader: OK (0.01s)
958.73 s
[pandoc] writer: OK (0.02s)
958.74 s
[pandoc] reader: OK
958.75 s
[pandoc] writer: OK (0.01s)
958.78 s
[pandoc] reader: OK (0.02s)
958.78 s
[pandoc] markua
958.78 s
[pandoc] writer
958.87 s
[pandoc] basic: OK (0.10s)
958.90 s
[pandoc] tables: OK (0.03s)
958.90 s
[pandoc] ansi
958.94 s
[pandoc] ansi: OK (0.03s)
958.94 s
[pandoc] pod
958.95 s
[pandoc] pod: OK (0.01s)
958.95 s
[pandoc] Shared
958.95 s
[pandoc] compactifyDL
958.95 s
[pandoc] compactifyDL with empty def: OK
958.95 s
[pandoc] collapseFilePath
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] collapse: OK
958.95 s
[pandoc] toLegacyTable
958.95 s
[pandoc] decomposes a table with head: OK
958.95 s
[pandoc] decomposes a table without head: OK
958.95 s
[pandoc] decomposes the table from issue 7683: OK
958.95 s
[pandoc] table of contents
958.95 s
[pandoc] empty case: OK
958.95 s
[pandoc] no headers: OK
958.95 s
[pandoc] unlinked header: OK
958.95 s
[pandoc] linked header: OK
958.95 s
[pandoc] nested headlines: OK
958.95 s
[pandoc] only referenced headers: OK
958.97 s
[pandoc] section id used as backup: OK
958.98 s
[pandoc] makeSections
959.18 s
[pandoc] makeSections is idempotent: OK (0.22s)
959.18 s
[pandoc] +++ OK, passed 100 tests.
959.18 s
[pandoc] makeSections is idempotent for test case: OK
959.18 s
[pandoc] MediaBag
959.18 s
[pandoc] test fillMediaBag & extractMedia: OK
959.19 s
[pandoc] Writers
959.19 s
[pandoc] Native
959.43 s
[vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0..
959.43 s
[vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0..
959.53 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 )
959.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 )
960.53 s
[pandoc] p_write_rt: OK (1.34s)
960.53 s
[pandoc] +++ OK, passed 100 tests.
961.01 s
[pandoc] p_write_blocks_rt: OK (0.49s)
961.04 s
[pandoc] +++ OK, passed 100 tests.
961.04 s
[pandoc] ConTeXt
961.04 s
[pandoc] inline code
961.04 s
[pandoc] with '}': OK
961.04 s
[pandoc] without '}': OK
961.04 s
[pandoc] span with ID: OK
961.04 s
[pandoc] code property: OK
961.04 s
[pandoc] +++ OK, passed 100 tests.
961.04 s
[pandoc] headers
961.04 s
[pandoc] level 1: OK
961.04 s
[pandoc] Section as top-level: OK
961.04 s
[pandoc] bullet lists
961.04 s
[pandoc] nested: OK
961.04 s
[pandoc] natural tables
961.04 s
[pandoc] table with header and caption: OK
961.04 s
[pandoc] LaTeX
961.04 s
[pandoc] code blocks
961.04 s
[pandoc] in footnotes: OK
961.04 s
[pandoc] identifier: OK
961.04 s
[pandoc] no identifier: OK
961.04 s
[pandoc] definition lists
961.04 s
[pandoc] with internal link: OK
961.04 s
[pandoc] math
961.04 s
[pandoc] escape |: OK
961.04 s
[pandoc] headers
961.04 s
[pandoc] unnumbered header: OK
961.04 s
[pandoc] in list item: OK
961.04 s
[pandoc] in definition list item: OK
961.04 s
[pandoc] containing image: OK
961.04 s
[pandoc] inline code
961.04 s
[pandoc] struck out and highlighted: OK
961.04 s
[pandoc] struck out and not highlighted: OK
961.04 s
[pandoc] single quotes: OK
961.04 s
[pandoc] backtick: OK
961.04 s
[pandoc] inline note
961.04 s
[pandoc] Big note in emph: OK
961.04 s
[pandoc] Big note in strong: OK
961.04 s
[pandoc] Big note in underline: OK
961.04 s
[pandoc] Big note in strikeout: OK
961.04 s
[pandoc] Small note in emph: OK
961.04 s
[pandoc] Big note nested in emph and strong: OK
961.04 s
[pandoc] Two Big notes in emph: OK
961.04 s
[pandoc] writer options
961.04 s
[pandoc] top-level division
961.04 s
[pandoc] sections as top-level: OK
961.04 s
[pandoc] chapters as top-level: OK
961.04 s
[pandoc] parts as top-level: OK
961.04 s
[pandoc] default top-level: OK
961.04 s
[pandoc] sections as top-level in beamer: OK
961.04 s
[pandoc] chapters are as part in beamer: OK
961.04 s
[pandoc] parts as top-level in beamer: OK
961.04 s
[pandoc] default top-level in beamer: OK
961.04 s
[pandoc] part top-level, section not in toc: OK
961.04 s
[pandoc] HTML
961.04 s
[pandoc] inline code
961.04 s
[pandoc] basic: OK
961.04 s
[pandoc] haskell: OK
961.40 s
[pandoc] nolanguage: OK (0.38s)
961.40 s
[pandoc] images
961.40 s
[pandoc] alt with formatting: OK
961.40 s
[pandoc] blocks
961.40 s
[pandoc] definition list with empty <dt>: OK
961.40 s
[pandoc] heading with disallowed attributes: OK
961.40 s
[pandoc] quotes
961.40 s
[pandoc] quote with cite attribute (without q-tags): OK
961.40 s
[pandoc] quote with cite attribute (with q-tags): OK
961.40 s
[pandoc] code
961.40 s
[pandoc] code should be rendered correctly: OK
961.40 s
[pandoc] sample
961.40 s
[pandoc] sample should be rendered correctly: OK
961.40 s
[pandoc] variable
961.40 s
[pandoc] variable should be rendered correctly: OK
961.40 s
[pandoc] sample with style
961.40 s
[pandoc] samp should wrap highlighted code: OK
961.40 s
[pandoc] variable with style
961.41 s
[pandoc] var should wrap highlighted code: OK
961.41 s
[pandoc] footnotes
961.41 s
[pandoc] at the end of a document: OK
961.41 s
[pandoc] at the end of a block: OK
961.41 s
[pandoc] at the end of a section: OK
961.41 s
[pandoc] at the end of a section, with section divs: OK
961.41 s
[pandoc] JATS
961.42 s
[pandoc] inline code
961.42 s
[pandoc] basic: OK
961.42 s
[pandoc] block code
961.42 s
[pandoc] basic: OK
961.42 s
[pandoc] lang: OK
961.42 s
[pandoc] images
961.42 s
[pandoc] basic: OK
961.42 s
[pandoc] inlines
961.42 s
[pandoc] Emphasis: OK
961.42 s
[pandoc] footnote in articleauthoring tag set: OK
961.42 s
[pandoc] bullet list
961.42 s
[pandoc] plain items: OK
961.42 s
[pandoc] item with implicit figure: OK
961.42 s
[pandoc] definition lists
961.42 s
[pandoc] with internal link: OK
961.42 s
[pandoc] math
961.42 s
[pandoc] escape |: OK
961.42 s
[pandoc] headers
961.42 s
[pandoc] unnumbered header: OK
961.42 s
[pandoc] unnumbered sub header: OK
961.42 s
[pandoc] containing image: OK
961.42 s
[pandoc] ids
961.42 s
[pandoc] non-ASCII in header ID: OK
961.42 s
[pandoc] disallowed symbol in header id: OK
961.42 s
[pandoc] disallowed symbols in internal link target: OK
961.42 s
[pandoc] code id starting with a number: OK
961.42 s
[pandoc] spans
961.42 s
[pandoc] unwrapped if no attributes given: OK
961.42 s
[pandoc] converted to named-content element if class given: OK
961.42 s
[pandoc] unwrapped if styled-content element would have no at...: OK
961.42 s
[pandoc] use content-type attribute if present: OK
961.42 s
[pandoc] Jira
961.42 s
[pandoc] inlines
961.42 s
[pandoc] underlined text: OK
961.42 s
[pandoc] image with attributes: OK
961.42 s
[pandoc] links
961.42 s
[pandoc] external link: OK
961.42 s
[pandoc] external link without description: OK
961.42 s
[pandoc] email link: OK
961.42 s
[pandoc] email link without description: OK
961.42 s
[pandoc] attachment link: OK
961.42 s
[pandoc] attachment link without description: OK
961.42 s
[pandoc] user link: OK
961.42 s
[pandoc] user link with user as description: OK
961.42 s
[pandoc] 'smart' link: OK
961.42 s
[pandoc] 'smart' card: OK
961.42 s
[pandoc] spans
961.42 s
[pandoc] id is used as anchor: OK
961.42 s
[pandoc] use `color` attribute: OK
961.42 s
[pandoc] code
961.42 s
[pandoc] code block with known language: OK
961.42 s
[pandoc] code block without language: OK
961.42 s
[pandoc] blocks
961.42 s
[pandoc] div
961.42 s
[pandoc] empty attributes: OK
961.42 s
[pandoc] just identifier: OK
961.42 s
[pandoc] with class 'panel': OK
961.42 s
[pandoc] panel with id: OK
961.42 s
[pandoc] title attribute: OK
961.42 s
[pandoc] nested panels: OK
961.42 s
[pandoc] Docbook
961.42 s
[pandoc] inline elements
961.42 s
[pandoc] links
961.42 s
[pandoc] db4 external link: OK
961.42 s
[pandoc] db5 external link: OK
961.42 s
[pandoc] anchor: OK
961.42 s
[pandoc] automatic anchor: OK
961.42 s
[pandoc] line blocks
961.42 s
[pandoc] none: OK
961.42 s
[pandoc] basic: OK
961.42 s
[pandoc] blockquote: OK
961.42 s
[pandoc] footnote: OK
961.42 s
[pandoc] divs
961.42 s
[pandoc] admonition: OK
961.42 s
[pandoc] admonition-with-title: OK
961.42 s
[pandoc] admonition-with-title-in-para: OK
961.42 s
[pandoc] single-child: OK
961.42 s
[pandoc] single-literal-child: OK
961.42 s
[pandoc] multiple-children: OK
961.42 s
[pandoc] compact lists
961.42 s
[pandoc] bullet
961.42 s
[pandoc] compact: OK
961.43 s
[pandoc] loose: OK
961.43 s
[pandoc] ordered
961.43 s
[pandoc] compact: OK
961.43 s
[pandoc] loose: OK
961.43 s
[pandoc] definition
961.43 s
[pandoc] compact: OK
961.43 s
[pandoc] loose: OK
961.43 s
[pandoc] writer options
961.43 s
[pandoc] top-level division
961.43 s
[pandoc] sections as top-level: OK
961.43 s
[pandoc] chapters as top-level: OK
961.43 s
[pandoc] parts as top-level: OK
961.43 s
[pandoc] default top-level: OK
961.43 s
[pandoc] section attributes
961.43 s
[pandoc] sections with attributes (db5): OK
961.43 s
[pandoc] sections with attributes (db4): OK
961.43 s
[pandoc] Markdown
961.43 s
[pandoc] indented code after list: OK
961.43 s
[pandoc] list with tight sublist: OK
961.43 s
[pandoc] emph/strong with spaces (#10696): OK
961.43 s
[pandoc] note and reference location
961.43 s
[pandoc] footnotes at the end of a document: OK
961.43 s
[pandoc] footnotes at the end of blocks: OK
961.43 s
[pandoc] footnotes and reference links at the end of blocks: OK
961.43 s
[pandoc] footnotes at the end of section: OK
961.43 s
[pandoc] Shortcut reference links
961.43 s
[pandoc] Simple link (shortcutable): OK
961.43 s
[pandoc] Followed by another link (unshortcutable): OK
961.43 s
[pandoc] Followed by space and another link (unshortcutable): OK
961.43 s
[pandoc] Reference link is used multiple times (unshortcutable): OK
961.43 s
[pandoc] Reference link is used multiple times (unshortcutable): OK
961.43 s
[pandoc] Reference link is followed by text in brackets: OK
961.43 s
[pandoc] Reference link is followed by space and text in brac...: OK
961.43 s
[pandoc] Reference link is followed by RawInline: OK
961.43 s
[pandoc] Reference link is followed by space and RawInline: OK
961.43 s
[pandoc] Reference link is followed by RawInline with space: OK
961.43 s
[pandoc] Reference link is followed by citation: OK
961.43 s
[pandoc] Reference link is followed by space and citation: OK
961.43 s
[pandoc] Org
961.43 s
[pandoc] links
961.43 s
[pandoc] simple link: OK
961.43 s
[pandoc] internal link to anchor: OK
961.43 s
[pandoc] lists
961.43 s
[pandoc] bullet task list: OK
961.43 s
[pandoc] ordered task list: OK
961.43 s
[pandoc] ordered task list with starting number: OK
961.43 s
[pandoc] bullet without task_lists: OK
961.43 s
[pandoc] code blocks
961.43 s
[pandoc] identifier: OK
961.43 s
[pandoc] attributes: OK
961.43 s
[pandoc] Plain
961.43 s
[pandoc] strongly emphasized text to uppercase: OK
961.43 s
[pandoc] AsciiDoc
961.43 s
[pandoc] emphasis
961.43 s
[pandoc] emph word before: OK
961.43 s
[pandoc] emph word after: OK
961.43 s
[pandoc] emph quoted: OK
961.43 s
[pandoc] strong word before: OK
961.43 s
[pandoc] strong word after: OK
961.43 s
[pandoc] strong quoted: OK
961.43 s
[pandoc] blocks
961.43 s
[pandoc] code block without line numbers: OK
961.43 s
[pandoc] code block with line numbers: OK
961.43 s
[pandoc] sidebar block: OK
961.43 s
[pandoc] tables
961.43 s
[pandoc] empty cells: OK
961.43 s
[pandoc] multiblock cells: OK
961.43 s
[pandoc] lists
961.43 s
[pandoc] bullet task list: OK
961.43 s
[pandoc] Docx
961.43 s
[pandoc] inlines
961.57 s
[pandoc] font formatting: OK (0.14s)
961.65 s
[pandoc] hyperlinks: OK (0.07s)
961.74 s
[pandoc] inline image: OK (0.09s)
961.80 s
[pandoc] inline images: OK (0.06s)
961.87 s
[pandoc] handling unicode input: OK (0.07s)
961.93 s
[pandoc] inline code: OK (0.06s)
962.00 s
[pandoc] inline code in subscript and superscript: OK (0.06s)
962.00 s
[pandoc] blocks
962.06 s
[pandoc] headers: OK (0.06s)
962.14 s
[pandoc] nested anchor spans in header: OK (0.07s)
962.22 s
[pandoc] lists: OK (0.08s)
962.29 s
[pandoc] lists continuing after interruption: OK (0.08s)
962.37 s
[pandoc] lists restarting after interruption: OK (0.08s)
962.57 s
[pandoc] lists with multiple initial list levels: OK (0.19s)
962.61 s
[pandoc] lists with div bullets: OK (0.04s)
962.64 s
[pandoc] definition lists: OK (0.04s)
962.69 s
[pandoc] task lists: OK (0.04s)
962.73 s
[pandoc] issue 9994: OK (0.04s)
962.79 s
[pandoc] footnotes and endnotes: OK (0.06s)
962.88 s
[pandoc] links in footnotes and endnotes: OK (0.09s)
962.97 s
[pandoc] blockquotes: OK (0.09s)
963.04 s
[pandoc] tables: OK (0.07s)
963.13 s
[pandoc] tables without explicit column widths: OK (0.08s)
963.20 s
[pandoc] tables with lists in cells: OK (0.07s)
963.27 s
[pandoc] tables with one row: OK (0.06s)
963.44 s
[pandoc] tables separated with RawBlock: OK (0.17s)
963.49 s
[pandoc] code block: OK (0.05s)
963.56 s
[pandoc] raw OOXML blocks: OK (0.07s)
963.66 s
[pandoc] raw bookmark markers: OK (0.10s)
963.66 s
[pandoc] track changes
963.72 s
[pandoc] insertion: OK (0.06s)
963.77 s
[pandoc] deletion: OK (0.05s)
963.81 s
[pandoc] move text: OK (0.04s)
963.89 s
[pandoc] comments: OK (0.07s)
963.95 s
[pandoc] scrubbed metadata: OK (0.06s)
963.95 s
[pandoc] custom styles
964.01 s
[pandoc] custom styles without reference.docx: OK (0.06s)
964.08 s
[pandoc] custom styles with reference.docx: OK (0.07s)
964.20 s
[pandoc] suppress custom style for headers and blockquotes: OK (0.13s)
964.20 s
[pandoc] metadata
964.25 s
[pandoc] document properties (core, custom): OK (0.04s)
964.28 s
[pandoc] document properties (short description): OK (0.03s)
964.28 s
[pandoc] RST
964.28 s
[pandoc] rubrics
964.28 s
[pandoc] in list item: OK
964.28 s
[pandoc] in definition list item: OK
964.28 s
[pandoc] in block quote: OK
964.28 s
[pandoc] with id: OK
964.28 s
[pandoc] with id class: OK
964.28 s
[pandoc] ligatures
964.28 s
[pandoc] a list is closed by a comment before a quote: OK
964.28 s
[pandoc] flatten
964.28 s
[pandoc] emerges nested styles as expected: OK
964.28 s
[pandoc] could introduce trailing spaces: OK
964.28 s
[pandoc] preserves empty parents: OK
964.28 s
[pandoc] inlines
964.28 s
[pandoc] are removed when empty: OK
964.28 s
[pandoc] do not cause the introduction of extra spaces when r...: OK
964.28 s
[pandoc] spaces are stripped at beginning and end: OK
964.28 s
[pandoc] single space stripped: OK
964.28 s
[pandoc] give priority to strong style over emphasis: OK
964.28 s
[pandoc] links are not elided by outer style: OK
964.28 s
[pandoc] RST inlines cannot start nor end with spaces: OK
964.28 s
[pandoc] keeps quotes: OK
964.28 s
[pandoc] backslash inserted between str and code: OK
964.28 s
[pandoc] headings
964.28 s
[pandoc] normal heading: OK
964.28 s
[pandoc] heading levels: OK
964.28 s
[pandoc] minimal heading levels: OK
964.28 s
[pandoc] subtitle: OK
964.28 s
[pandoc] TEI
964.28 s
[pandoc] block elements
964.28 s
[pandoc] para: OK
964.28 s
[pandoc] inlines
964.28 s
[pandoc] Emphasis: OK
964.28 s
[pandoc] SingleQuoted: OK
964.28 s
[pandoc] DoubleQuoted: OK
964.28 s
[pandoc] NestedQuoted: OK
964.28 s
[pandoc] markua
964.28 s
[pandoc] simple blurb/aside
964.28 s
[pandoc] blurb: OK
964.28 s
[pandoc] aside: OK
964.28 s
[pandoc] multiclass blurb/aside
964.28 s
[pandoc] blurb: OK
964.28 s
[pandoc] aside: OK
964.28 s
[pandoc] Muse
964.28 s
[pandoc] block elements
964.28 s
[pandoc] plain: OK
964.28 s
[pandoc] paragraphs
964.28 s
[pandoc] single paragraph: OK
964.28 s
[pandoc] two paragraphs: OK
964.28 s
[pandoc] line block: OK
964.28 s
[pandoc] code block: OK
964.28 s
[pandoc] html raw block: OK
964.28 s
[pandoc] block quote: OK
964.28 s
[pandoc] lists
964.28 s
[pandoc] simple lists
964.28 s
[pandoc] ordered list: OK
964.28 s
[pandoc] ordered list with Roman numerals: OK
964.28 s
[pandoc] bullet list: OK
964.28 s
[pandoc] definition list: OK
964.28 s
[pandoc] definition list with multiple descriptions: OK
964.28 s
[pandoc] definition list with empty term: OK
964.28 s
[pandoc] definition list terms starting with space: OK
964.28 s
[pandoc] definition list terms starting with list markers: OK
964.28 s
[pandoc] sequential lists
964.28 s
[pandoc] bullet lists: OK
964.28 s
[pandoc] ordered lists of the same style: OK
964.28 s
[pandoc] ordered lists with equal styles: OK
964.28 s
[pandoc] bullet and ordered lists: OK
964.28 s
[pandoc] different style ordered lists: OK
964.28 s
[pandoc] nested lists
964.29 s
[pandoc] nested ordered list: OK
964.29 s
[pandoc] nested bullet lists: OK
964.29 s
[pandoc] nested definition lists: OK
964.29 s
[pandoc] list item starting with list: OK
964.29 s
[pandoc] List inside block quote: OK
964.29 s
[pandoc] headings
964.29 s
[pandoc] normal heading: OK
964.29 s
[pandoc] heading levels: OK
964.29 s
[pandoc] heading with ID: OK
964.29 s
[pandoc] empty heading: OK
964.29 s
[pandoc] horizontal rule: OK
964.29 s
[pandoc] escape horizontal rule: OK
964.29 s
[pandoc] escape long horizontal rule: OK
964.29 s
[pandoc] don't escape horizontal inside paragraph: OK
964.29 s
[pandoc] escape nonbreaking space: OK
964.29 s
[pandoc] escape > in the beginning of line: OK
964.29 s
[pandoc] escape string with > and space in the beginning of l...: OK
964.29 s
[pandoc] tables
964.29 s
[pandoc] table without header: OK
964.29 s
[pandoc] table with header: OK
964.29 s
[pandoc] table with header and caption: OK
964.29 s
[pandoc] table inside bullet list: OK
964.29 s
[pandoc] table with one column: OK
964.29 s
[pandoc] div with bullet list: OK
964.29 s
[pandoc] inline elements
964.29 s
[pandoc] string
964.29 s
[pandoc] string: OK
964.29 s
[pandoc] escape footnote: OK
964.29 s
[pandoc] escape secondary note: OK
964.29 s
[pandoc] do not escape brackets: OK
964.29 s
[pandoc] escape verbatim close tag: OK
964.29 s
[pandoc] escape link-like text: OK
964.29 s
[pandoc] escape pipe to avoid accidental tables: OK
964.29 s
[pandoc] escape hash to avoid accidental anchors: OK
964.29 s
[pandoc] escape definition list markers: OK
964.29 s
[pandoc] normalize strings before escaping: OK
964.29 s
[pandoc] do not escape colon: OK
964.29 s
[pandoc] escape - to avoid accidental unordered lists: OK
964.29 s
[pandoc] escape - inside a list to avoid accidental nested un...: OK
964.29 s
[pandoc] escape strings starting with - inside a list: OK
964.29 s
[pandoc] escape - inside a note: OK
964.29 s
[pandoc] escape - after softbreak in note: OK
964.29 s
[pandoc] escape ; to avoid accidental comments: OK
964.29 s
[pandoc] escape strings starting with ; and space: OK
964.29 s
[pandoc] escape ; after softbreak: OK
964.29 s
[pandoc] escape ; after linebreak: OK
964.29 s
[pandoc] do not escape ; inside paragraph: OK
964.29 s
[pandoc] escape newlines: OK
964.29 s
[pandoc] emphasis
964.29 s
[pandoc] emphasis: OK
964.29 s
[pandoc] emphasis inside word: OK
964.29 s
[pandoc] emphasis before comma: OK
964.29 s
[pandoc] emphasis before period: OK
964.29 s
[pandoc] empty emphasis: OK
964.29 s
[pandoc] empty strong: OK
964.29 s
[pandoc] empty strong emphasis: OK
964.29 s
[pandoc] empty emphasized strong: OK
964.29 s
[pandoc] emphasized empty string: OK
964.29 s
[pandoc] strong empty string: OK
964.29 s
[pandoc] strong emphasized empty string: OK
964.29 s
[pandoc] emphasized strong empty string: OK
964.29 s
[pandoc] emphasized string with space: OK
964.29 s
[pandoc] emphasized string ending with space: OK
964.29 s
[pandoc] emphasized string with tab: OK
964.29 s
[pandoc] emphasized space between empty strings: OK
964.29 s
[pandoc] strong: OK
964.29 s
[pandoc] strong inside word: OK
964.29 s
[pandoc] strong emphasis: OK
964.29 s
[pandoc] strong after emphasis: OK
964.29 s
[pandoc] strong emphasis after emphasis: OK
964.29 s
[pandoc] strong in the end of emphasis: OK
964.29 s
[pandoc] switch to lightweight markup after <em> tag: OK
964.29 s
[pandoc] strikeout: OK
964.29 s
[pandoc] space at the beginning of emphasis: OK
964.29 s
[pandoc] space at the end of emphasis: OK
964.29 s
[pandoc] space at the beginning of strong: OK
964.29 s
[pandoc] space at the end of strong: OK
964.29 s
[pandoc] space at the beginning of strong emphasis: OK
964.29 s
[pandoc] space at the end of strong emphasis: OK
964.29 s
[pandoc] space at the beginning of emphasiszed strong: OK
964.29 s
[pandoc] space at the end of emphasized strong: OK
964.29 s
[pandoc] superscript: OK
964.29 s
[pandoc] subscript: OK
964.29 s
[pandoc] smallcaps: OK
964.29 s
[pandoc] smallcaps near emphasis: OK
964.29 s
[pandoc] single quoted: OK
964.29 s
[pandoc] double quoted: OK
964.29 s
[pandoc] code
964.29 s
[pandoc] simple: OK
964.29 s
[pandoc] empty: OK
964.29 s
[pandoc] space: OK
964.29 s
[pandoc] space at the beginning: OK
964.29 s
[pandoc] space at the end: OK
964.29 s
[pandoc] use tags for =: OK
964.29 s
[pandoc] escape tag: OK
964.29 s
[pandoc] normalization with attributes: OK
964.29 s
[pandoc] code tag: OK
964.29 s
[pandoc] normalization: OK
964.29 s
[pandoc] normalization with empty string: OK
964.29 s
[pandoc] emphasized code: OK
964.29 s
[pandoc] strong code: OK
964.29 s
[pandoc] spaces
964.29 s
[pandoc] space: OK
964.29 s
[pandoc] soft break: OK
964.29 s
[pandoc] remove soft break: OK
964.29 s
[pandoc] line break: OK
964.29 s
[pandoc] line break at the end: OK
964.29 s
[pandoc] no newline after line break in header: OK
964.29 s
[pandoc] no softbreak in header: OK
964.29 s
[pandoc] math
964.29 s
[pandoc] inline math: OK
964.29 s
[pandoc] display math: OK
964.29 s
[pandoc] multiple letters in inline math: OK
964.29 s
[pandoc] expand math before normalization: OK
964.29 s
[pandoc] multiple math expressions inside one inline list: OK
964.29 s
[pandoc] raw inline: OK
964.29 s
[pandoc] links
964.29 s
[pandoc] link with description: OK
964.29 s
[pandoc] link without description: OK
964.29 s
[pandoc] link to anchor: OK
964.29 s
[pandoc] link to image with description: OK
964.29 s
[pandoc] link to image without description: OK
964.29 s
[pandoc] escape brackets in links
964.29 s
[pandoc] link with description: OK
964.29 s
[pandoc] link without description: OK
964.30 s
[pandoc] image link with description: OK
964.30 s
[pandoc] image link without description: OK
964.30 s
[pandoc] image: OK
964.30 s
[pandoc] image with width: OK
964.30 s
[pandoc] left-aligned image with width: OK
964.30 s
[pandoc] right-aligned image with width: OK
964.30 s
[pandoc] escape brackets in image title: OK
964.30 s
[pandoc] note: OK
964.30 s
[pandoc] note location
964.30 s
[pandoc] footnotes at the end of document: OK
964.30 s
[pandoc] footnotes at the end of block: OK
964.30 s
[pandoc] footnotes at the end of section: OK
964.30 s
[pandoc] span with class: OK
964.30 s
[pandoc] span without class: OK
964.30 s
[pandoc] span with anchor: OK
964.30 s
[pandoc] empty span with anchor: OK
964.30 s
[pandoc] empty span without class and anchor: OK
964.30 s
[pandoc] span with class and anchor: OK
964.30 s
[pandoc] adjacent spans: OK
964.30 s
[pandoc] RTL
964.30 s
[pandoc] RTL span: OK
964.30 s
[pandoc] LTR span: OK
964.30 s
[pandoc] RTL span with a class: OK
964.30 s
[pandoc] LTR span with a class: OK
964.30 s
[pandoc] Escape <<< and >>>: OK
964.30 s
[pandoc] combined
964.30 s
[pandoc] emph word before: OK
964.30 s
[pandoc] emph word after: OK
964.30 s
[pandoc] emph quoted: OK
964.30 s
[pandoc] strong word before: OK
964.30 s
[pandoc] strong word after: OK
964.30 s
[pandoc] strong quoted: OK
964.30 s
[pandoc] FB2
964.30 s
[pandoc] block elements
964.30 s
[pandoc] para: OK
964.30 s
[pandoc] inlines
964.30 s
[pandoc] Emphasis: OK
964.30 s
[pandoc] bullet list: OK
964.30 s
[pandoc] PowerPoint
964.30 s
[pandoc] Default slide formatting
964.35 s
[pandoc] Inline formatting: OK (0.06s)
964.42 s
[pandoc] Slide breaks (default slide-level): OK (0.07s)
964.47 s
[pandoc] slide breaks (slide-level set to 1): OK (0.05s)
964.53 s
[pandoc] lists: OK (0.05s)
964.58 s
[pandoc] start ordered list at specified num: OK (0.05s)
964.65 s
[pandoc] List continuation paragraph indentation: OK (0.06s)
964.71 s
[pandoc] tables: OK (0.07s)
964.77 s
[pandoc] table of contents: OK (0.06s)
964.84 s
[pandoc] end notes: OK (0.07s)
964.91 s
[pandoc] end notes, with table of contents: OK (0.07s)
965.00 s
[pandoc] images: OK (0.09s)
965.07 s
[pandoc] two-column layout: OK (0.07s)
965.16 s
[pandoc] two-column (not comparison): OK (0.09s)
965.27 s
[pandoc] speaker notes: OK (0.10s)
965.37 s
[pandoc] speaker notes after a separating block: OK (0.10s)
965.45 s
[pandoc] speaker notes after a separating header: OK (0.08s)
965.55 s
[pandoc] speaker notes after metadata: OK (0.10s)
965.62 s
[pandoc] remove empty slides: OK (0.07s)
965.69 s
[pandoc] raw ooxml: OK (0.07s)
965.75 s
[pandoc] metadata, custom properties: OK (0.07s)
965.93 s
[pandoc] metadata, short description: OK (0.18s)
966.07 s
[pandoc] inline code and code blocks: OK (0.14s)
966.19 s
[pandoc] inline code and code blocks, custom formatting: OK (0.12s)
966.24 s
[pandoc] Using slide level 0, if the first thing on a slide is
966.28 s
[pandoc] a h1 it's used as the slide title: OK (0.08s)
966.34 s
[pandoc] a h2 it's used as the slide title: OK (0.07s)
966.35 s
[pandoc] a heading it's used as the slide title
966.40 s
[pandoc] (works with a table): OK (0.06s)
966.47 s
[pandoc] (content with caption layout): OK (0.07s)
966.47 s
[pandoc] comparison layout
966.47 s
[pandoc] comparison layout is used...
966.57 s
[pandoc] when two columns contain text + non-text: OK (0.10s)
966.66 s
[pandoc] even when only one col contains text + non-text: OK (0.09s)
966.66 s
[pandoc] extra ... in one column gets overlaid
966.83 s
[pandoc] text: OK (0.16s)
966.94 s
[pandoc] image: OK (0.11s)
967.05 s
[pandoc] is not used if the non-text comes first: OK (0.10s)
967.05 s
[pandoc] Content with Caption layout is ...
967.16 s
[pandoc] used for heading, text, image on the same slide: OK (0.11s)
967.29 s
[vector] [ 3 of 12] Compiling Utilities ( tests/Utilities.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.dyn_o )
967.29 s
[vector]
967.29 s
[vector] tests/Utilities.hs:244:17: warning : [ GHC-63394 ] [ -Wx-partial ]
967.29 s
[vector] In the use of ‘tail’
967.29 s
[vector] (imported from Prelude, but defined in GHC.List):
967.29 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."
967.29 s
[vector] |
967.29 s
[vector] 244 | postscanl f z = tail . scanl f z
967.29 s
[vector] | ^^^^
967.29 s
[vector]
967.29 s
[vector] tests/Utilities.hs:245:16: warning : [ GHC-63394 ] [ -Wx-partial ]
967.29 s
[vector] In the use of ‘tail’
967.29 s
[vector] (imported from Prelude, but defined in GHC.List):
967.29 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."
967.29 s
[vector] |
967.29 s
[vector] 245 | prescanr f z = tail . scanr f z
967.29 s
[vector] | ^^^^
967.29 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 )
967.29 s
[vector]
967.29 s
[vector] tests/Tests/Vector/Property.hs:243:68: warning : [ GHC-63394 ] [ -Wx-partial ]
967.29 s
[vector] In the use of ‘head’
967.29 s
[vector] (imported from Data.List, but defined in GHC.List):
967.29 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."
967.29 s
[vector] |
967.29 s
[vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
967.29 s
[vector] | ^^^^
967.29 s
[vector]
967.29 s
[vector] tests/Tests/Vector/Property.hs:256:76: warning : [ GHC-63394 ] [ -Wx-partial ]
967.29 s
[vector] In the use of ‘head’
967.29 s
[vector] (imported from Data.List, but defined in GHC.List):
967.29 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."
967.29 s
[vector] |
967.29 s
[vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
967.29 s
[vector] | ^^^^
967.29 s
[vector]
967.29 s
[vector] tests/Tests/Vector/Property.hs:272:65: warning : [ GHC-63394 ] [ -Wx-partial ]
967.29 s
[vector] In the use of ‘tail’
967.29 s
[vector] (imported from Data.List, but defined in GHC.List):
967.29 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."
967.29 s
[vector] |
967.29 s
[vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
967.29 s
[vector] | ^^^^
967.29 s
[vector]
967.29 s
[vector] tests/Tests/Vector/Property.hs:439:26: warning : [ GHC-63394 ] [ -Wx-partial ]
967.29 s
[vector] In the use of ‘head’
967.29 s
[vector] (imported from Data.List, but defined in GHC.List):
967.29 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."
967.29 s
[vector] |
967.29 s
[vector] 439 | = V.uniq `eq` (map head . group)
967.29 s
[vector] | ^^^^
967.32 s
[pandoc] used for text and an image on the same slide: OK (0.16s)
967.51 s
[pandoc] not used if the image comes first: OK (0.18s)
967.51 s
[pandoc] The Blank layout is used if a slide contains only...
967.68 s
[pandoc] speaker notes: OK (0.17s)
967.79 s
[pandoc] an empty heading with a body of only NBSPs: OK (0.11s)
967.93 s
[pandoc] a heading containing only non-breaking spaces: OK (0.14s)
968.05 s
[pandoc] Incremental lists are supported: OK (0.12s)
968.17 s
[pandoc] One-off incremental lists are supported: OK (0.11s)
968.38 s
[pandoc] Background images: OK (0.21s)
968.38 s
[pandoc] With `--reference-doc` pptx file
968.82 s
[pandoc] Inline formatting: OK (0.44s)
969.18 s
[pandoc] Slide breaks (default slide-level): OK (0.35s)
969.60 s
[pandoc] slide breaks (slide-level set to 1): OK (0.43s)
969.96 s
[pandoc] lists: OK (0.36s)
970.27 s
[pandoc] start ordered list at specified num: OK (0.30s)
970.61 s
[pandoc] List continuation paragraph indentation: OK (0.33s)
970.82 s
[pandoc] tables: OK (0.22s)
971.04 s
[pandoc] table of contents: OK (0.21s)
971.19 s
[pandoc] end notes: OK (0.15s)
971.31 s
[pandoc] end notes, with table of contents: OK (0.12s)
971.46 s
[pandoc] images: OK (0.15s)
971.58 s
[pandoc] two-column layout: OK (0.12s)
971.71 s
[pandoc] two-column (not comparison): OK (0.13s)
971.82 s
[pandoc] speaker notes: OK (0.12s)
971.93 s
[pandoc] speaker notes after a separating block: OK (0.11s)
972.04 s
[pandoc] speaker notes after a separating header: OK (0.11s)
972.22 s
[pandoc] speaker notes after metadata: OK (0.18s)
972.34 s
[pandoc] remove empty slides: OK (0.12s)
972.44 s
[pandoc] raw ooxml: OK (0.10s)
972.55 s
[pandoc] metadata, custom properties: OK (0.10s)
972.66 s
[pandoc] metadata, short description: OK (0.11s)
972.76 s
[pandoc] inline code and code blocks: OK (0.10s)
972.85 s
[pandoc] inline code and code blocks, custom formatting: OK (0.09s)
972.85 s
[pandoc] Using slide level 0, if the first thing on a slide is
972.93 s
[pandoc] a h1 it's used as the slide title: OK (0.08s)
973.02 s
[pandoc] a h2 it's used as the slide title: OK (0.09s)
973.02 s
[pandoc] a heading it's used as the slide title
973.12 s
[pandoc] (works with a table): OK (0.10s)
973.20 s
[pandoc] (content with caption layout): OK (0.08s)
973.20 s
[pandoc] comparison layout
973.20 s
[pandoc] comparison layout is used...
973.31 s
[pandoc] when two columns contain text + non-text: OK (0.10s)
973.39 s
[pandoc] even when only one col contains text + non-text: OK (0.08s)
973.39 s
[pandoc] extra ... in one column gets overlaid
973.56 s
[pandoc] text: OK (0.17s)
973.69 s
[pandoc] image: OK (0.12s)
973.81 s
[pandoc] is not used if the non-text comes first: OK (0.12s)
973.81 s
[pandoc] Content with Caption layout is ...
973.90 s
[pandoc] used for heading, text, image on the same slide: OK (0.09s)
974.01 s
[pandoc] used for text and an image on the same slide: OK (0.11s)
974.09 s
[pandoc] not used if the image comes first: OK (0.08s)
974.09 s
[pandoc] The Blank layout is used if a slide contains only...
974.19 s
[pandoc] speaker notes: OK (0.10s)
974.28 s
[pandoc] an empty heading with a body of only NBSPs: OK (0.09s)
974.39 s
[pandoc] a heading containing only non-breaking spaces: OK (0.11s)
974.54 s
[pandoc] Incremental lists are supported: OK (0.15s)
974.71 s
[pandoc] One-off incremental lists are supported: OK (0.17s)
974.83 s
[pandoc] Background images: OK (0.12s)
974.95 s
[pandoc] Basic footer: OK (0.13s)
975.14 s
[pandoc] Footer with fixed date, replaced by meta block date: OK (0.19s)
975.26 s
[pandoc] Footer not shown on title slide: OK (0.12s)
975.38 s
[pandoc] Footer with slide number starting from 3: OK (0.12s)
975.53 s
[pandoc] Layouts can be moved around in reference doc: OK (0.15s)
975.62 s
[pandoc] Layouts can be missing from the reference doc: OK (0.09s)
975.62 s
[pandoc] Ms
975.62 s
[pandoc] code blocks
975.62 s
[pandoc] basic: OK
975.62 s
[pandoc] escape starting .: OK
975.62 s
[pandoc] AnnotatedTable
975.62 s
[pandoc] toTable
975.62 s
[pandoc] annotates a sample table properly: OK
976.42 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 )
976.52 s
[pandoc] normalizes like the table builder: OK (0.89s)
976.53 s
[pandoc] +++ OK, passed 50 tests.
976.53 s
[pandoc] has valid final cell columns: OK
976.53 s
[pandoc] +++ OK, passed 50 tests.
976.54 s
[pandoc] has valid first row column data: OK
976.55 s
[pandoc] +++ OK, passed 50 tests.
976.55 s
[pandoc] has valid all row column data: OK
976.55 s
[pandoc] +++ OK, passed 50 tests.
976.55 s
[pandoc] has valid cell column data lengths: OK (0.01s)
976.55 s
[pandoc] +++ OK, passed 50 tests.
976.55 s
[pandoc] Readers
976.55 s
[pandoc] LaTeX
976.55 s
[pandoc] basic
976.55 s
[pandoc] simple: OK
976.55 s
[pandoc] space: OK
976.55 s
[pandoc] emphasized: OK
976.55 s
[pandoc] headers
976.55 s
[pandoc] level 1: OK
976.55 s
[pandoc] level 2: OK
976.55 s
[pandoc] level 3: OK
976.55 s
[pandoc] emph: OK
976.55 s
[pandoc] link: OK
976.55 s
[pandoc] math
976.55 s
[pandoc] escaped $: OK
976.55 s
[pandoc] space and comments
976.55 s
[pandoc] blank lines + space at beginning: OK
976.55 s
[pandoc] blank lines + space + comments: OK
976.55 s
[pandoc] comment in paragraph: OK
976.55 s
[pandoc] code blocks
976.55 s
[pandoc] identifier: OK
976.55 s
[pandoc] no identifier: OK
976.55 s
[pandoc] tables
976.55 s
[pandoc] Single cell table: OK
976.55 s
[pandoc] Multi cell table: OK
976.55 s
[pandoc] Multi line table: OK
976.55 s
[pandoc] Empty table: OK
976.55 s
[pandoc] Table with fixed column width: OK
976.55 s
[pandoc] Table with empty column separators: OK
976.56 s
[pandoc] Table with custom column separators: OK
976.56 s
[pandoc] Table with vertical alignment argument: OK
976.56 s
[pandoc] Table with multicolumn item: OK
976.56 s
[pandoc] table with multicolumn item (#6596): OK
976.56 s
[pandoc] Table with multirow item: OK
976.56 s
[pandoc] Table with multirow item using full prototype: OK
976.56 s
[pandoc] Table with nested multirow/multicolumn item: OK
976.56 s
[pandoc] Table with multicolumn header: OK
976.56 s
[pandoc] Table with normal empty cells: OK
976.56 s
[pandoc] citations
976.56 s
[pandoc] natbib
976.56 s
[pandoc] citet: OK
976.56 s
[pandoc] suffix: OK
976.57 s
[pandoc] suffix long: OK
976.57 s
[pandoc] multiple: OK
976.57 s
[pandoc] group: OK
976.57 s
[pandoc] suffix and locator: OK
976.57 s
[pandoc] suffix only: OK
976.57 s
[pandoc] no author: OK
976.57 s
[pandoc] markup: OK
976.57 s
[pandoc] biblatex
976.57 s
[pandoc] textcite: OK
976.57 s
[pandoc] suffix: OK
976.57 s
[pandoc] suffix long: OK
976.57 s
[pandoc] multiple: OK
976.57 s
[pandoc] group: OK
976.57 s
[pandoc] suffix and locator: OK
976.57 s
[pandoc] suffix only: OK
976.57 s
[pandoc] no author: OK
976.57 s
[pandoc] markup: OK
976.57 s
[pandoc] parencite: OK
976.57 s
[pandoc] images
976.57 s
[pandoc] Basic image: OK
976.57 s
[pandoc] Basic image with blank options: OK
976.58 s
[pandoc] Image with both width and height: OK
976.58 s
[pandoc] Image with width and height and a bunch of other opt...: OK
976.58 s
[pandoc] Image with just width: OK
976.58 s
[pandoc] Image with just height: OK
976.58 s
[pandoc] Image width relative to textsize: OK
976.58 s
[pandoc] Image with options with spaces: OK
976.58 s
[pandoc] Character Escapes
976.58 s
[pandoc] Two-character escapes: OK
976.58 s
[pandoc] One-character escapes: OK
976.58 s
[pandoc] memoir scene breaks
976.58 s
[pandoc] plainbreak: OK
976.58 s
[pandoc] plainbreak*: OK
976.58 s
[pandoc] fancybreak: OK
976.58 s
[pandoc] fancybreak*: OK
976.58 s
[pandoc] plainfancybreak: OK
976.58 s
[pandoc] plainfancybreak*: OK
976.58 s
[pandoc] pfbreak: OK
976.58 s
[pandoc] pfbreak*: OK
976.58 s
[pandoc] biblatex roman numerals
976.58 s
[pandoc] upper: OK
976.58 s
[pandoc] lower: OK
976.58 s
[pandoc] leading zero: OK
976.58 s
[pandoc] surrounding spaces: OK
976.58 s
[pandoc] zero: OK
976.58 s
[pandoc] space then unbraced argument: OK
976.58 s
[pandoc] space before braced argument: OK
976.58 s
[pandoc] polyglossia language spans
976.58 s
[pandoc] french: OK
976.58 s
[pandoc] nested: OK
976.58 s
[pandoc] with formatting: OK
976.59 s
[pandoc] language options: OK
976.59 s
[pandoc] unknown option fallback: OK
976.59 s
[pandoc] Markdown
976.59 s
[pandoc] inline code
976.59 s
[pandoc] with attribute: OK
976.59 s
[pandoc] with attribute space: OK
976.59 s
[pandoc] inline code in lists (regression tests for #6284)
976.59 s
[pandoc] code with list marker in text in ordered list: OK
976.59 s
[pandoc] code with list marker at start in ordered list: OK
976.59 s
[pandoc] code with list marker at start in ordered list: OK
976.59 s
[pandoc] code with list marker after literal backticks in ord...: OK
976.59 s
[pandoc] code with list marker after literal backticks in ord...: OK
976.59 s
[pandoc] code with list marker in text in bullet list: OK
976.59 s
[pandoc] code with list marker at start in bullet list: OK
976.59 s
[pandoc] code with list marker at start in bullet list: OK
976.59 s
[pandoc] code with list marker after literal backticks in bul...: OK
976.59 s
[pandoc] code with list marker after literal backticks in bul...: OK
976.60 s
[pandoc] lists with newlines in backticks: OK
976.60 s
[pandoc] lists with newlines in backticks: OK
976.60 s
[pandoc] lists with newlines in backticks: OK
976.60 s
[pandoc] lists with newlines in backticks: OK
976.60 s
[pandoc] lists with newlines in backticks: OK
976.60 s
[pandoc] lists with newlines in backticks: OK
976.60 s
[pandoc] lists with newlines in backticks: OK
976.60 s
[pandoc] lists with newlines in backticks: OK
976.60 s
[pandoc] lists with blank lines and indent in backticks: OK
976.60 s
[pandoc] lists with blank lines and indent in backticks: OK
976.60 s
[pandoc] lists with blank lines and indent in backticks: OK
976.60 s
[pandoc] lists with blank lines and indent in backticks: OK
976.61 s
[pandoc] lists with blank lines and indent in backticks: OK
976.61 s
[pandoc] lists with blank lines and indent in backticks: OK
976.61 s
[pandoc] lists with blank lines and indent in backticks: OK
976.61 s
[pandoc] lists with blank lines and indent in backticks: OK
976.61 s
[pandoc] emph and strong
976.61 s
[pandoc] two strongs in emph: OK
976.61 s
[pandoc] emph and strong emph alternating: OK
976.61 s
[pandoc] emph with spaced strong: OK
976.61 s
[pandoc] intraword underscore with opening underscore (#1121): OK
976.61 s
[pandoc] raw LaTeX
976.61 s
[pandoc] in URL: OK
976.61 s
[pandoc] raw HTML
976.61 s
[pandoc] nesting (issue #1330): OK
976.61 s
[pandoc] invalid tag (issue #1820: OK
976.61 s
[pandoc] technically invalid comment: OK
976.61 s
[pandoc] issue 2469: OK
976.61 s
[pandoc] raw email addresses
976.61 s
[pandoc] issue 2940: OK
976.61 s
[pandoc] emoji
976.63 s
[pandoc] emoji symbols: OK
976.80 s
[pandoc] unbalanced brackets: OK (0.19s)
976.80 s
[pandoc] backslash escapes
976.80 s
[pandoc] in URL: OK
976.80 s
[pandoc] in title: OK
976.80 s
[pandoc] in reference link title: OK
976.80 s
[pandoc] in reference link URL: OK
976.80 s
[pandoc] bare URIs
976.80 s
[pandoc] http://google.com is a search engine.: OK
976.81 s
[pandoc] <a href="http://foo.bar.baz">http://foo.bar.baz</a>: OK
976.81 s
[pandoc] Try this query: http://google.com?search=fish&time=h...: OK
976.81 s
[pandoc] HTTPS://GOOGLE.COM,: OK
976.81 s
[pandoc] http://el.wikipedia.org/wiki/Τεχνολογία,: OK
976.81 s
[pandoc] doi:10.1000/182,: OK
976.81 s
[pandoc] git://github.com/foo/bar.git,: OK
976.81 s
[pandoc] file:///Users/joe/joe.txt, and: OK
976.81 s
[pandoc] mailto:someone@somedomain.com.: OK
976.81 s
[pandoc] Use http: this is not a link!: OK
976.81 s
[pandoc] (http://google.com).: OK
976.81 s
[pandoc] http://en.wikipedia.org/wiki/Sprite_(computer_graphi...: OK
976.81 s
[pandoc] http://en.wikipedia.org/wiki/Sprite_[computer_graphi...: OK
976.81 s
[pandoc] http://en.wikipedia.org/wiki/Sprite_{computer_graphi...: OK
976.81 s
[pandoc] http://example.com/Notification_Center-GitHub-201011...: OK
976.81 s
[pandoc] https://github.com/github/hubot/blob/master/scripts/...: OK
976.81 s
[pandoc] http://www.rubyonrails.com: OK
976.81 s
[pandoc] http://www.rubyonrails.com:80: OK
976.81 s
[pandoc] http://www.rubyonrails.com/~minam: OK
976.81 s
[pandoc] https://www.rubyonrails.com/~minam: OK
976.81 s
[pandoc] http://www.rubyonrails.com/~minam/url%20with%20spaces: OK
976.81 s
[pandoc] http://www.rubyonrails.com/foo.cgi?something=here: OK
976.81 s
[pandoc] http://www.rubyonrails.com/foo.cgi?something=here&an...: OK
976.81 s
[pandoc] http://www.rubyonrails.com/contact;new: OK
976.81 s
[pandoc] http://www.rubyonrails.com/contact;new%20with%20spaces: OK
976.81 s
[pandoc] http://www.rubyonrails.com/contact;new?with=query&st...: OK
976.81 s
[pandoc] http://www.rubyonrails.com/~minam/contact;new?with=q...: OK
976.81 s
[pandoc] http://en.wikipedia.org/wiki/Wikipedia:Today%27s_fea...: OK
976.81 s
[pandoc] http://www.mail-archive.com/rails@lists.rubyonrails....: OK
976.81 s
[pandoc] http://www.amazon.com/Testing-Equal-Sign-In-Path/ref...: OK
976.82 s
[pandoc] http://en.wikipedia.org/wiki/Texas_hold%27em: OK
976.82 s
[pandoc] https://www.google.com/doku.php?id=gps:resource:scs:...: OK
976.82 s
[pandoc] http://www.rubyonrails.com: OK
976.82 s
[pandoc] http://manuals.ruby-on-rails.com/read/chapter.need_a...: OK
976.82 s
[pandoc] http://foo.example.com/controller/action?parm=value&...: OK
976.82 s
[pandoc] http://foo.example.com:3000/controller/action: OK
976.82 s
[pandoc] http://foo.example.com:3000/controller/action+pack: OK
976.82 s
[pandoc] http://business.timesonline.co.uk/article/0,,9065-24...: OK
976.82 s
[pandoc] http://www.mail-archive.com/ruby-talk@ruby-lang.org/: OK
976.82 s
[pandoc] https://example.org/?anchor=lala-: OK
976.82 s
[pandoc] https://example.org/?anchor=-lala: OK
976.82 s
[pandoc] autolinks
976.82 s
[pandoc] with unicode dash following: OK
976.82 s
[pandoc] a partial URL (#2277): OK
976.82 s
[pandoc] with some attributes: OK
976.82 s
[pandoc] with some attributes and spaces: OK
976.82 s
[pandoc] links
976.82 s
[pandoc] no autolink inside link: OK
976.82 s
[pandoc] no inline link inside link: OK
976.82 s
[pandoc] no bare URI inside link: OK
976.82 s
[pandoc] Github wiki links
976.82 s
[pandoc] autolink: OK
976.82 s
[pandoc] link with title: OK
976.82 s
[pandoc] bad link with title: OK
976.82 s
[pandoc] autolink not being a link: OK
976.82 s
[pandoc] autolink not being a link with a square bracket: OK
976.83 s
[pandoc] link with inline start should be a link: OK
976.83 s
[pandoc] Headers
976.83 s
[pandoc] blank line before header: OK
976.83 s
[pandoc] bracketed text (#2062): OK
976.83 s
[pandoc] ATX header without trailing #s: OK
976.83 s
[pandoc] ATX header without trailing #s: OK
976.83 s
[pandoc] setext header: OK
976.83 s
[pandoc] Implicit header references
976.83 s
[pandoc] ATX header without trailing #s: OK
976.83 s
[pandoc] ATX header with trailing #s: OK
976.83 s
[pandoc] setext header: OK
976.83 s
[pandoc] smart punctuation
976.83 s
[pandoc] quote before ellipses: OK
976.83 s
[pandoc] apostrophe before emph: OK
976.83 s
[pandoc] apostrophe in French: OK
976.83 s
[pandoc] apostrophe after math: OK
976.83 s
[pandoc] unclosed double quote: OK
976.83 s
[pandoc] sub- and superscripts
976.83 s
[pandoc] normal subscript: OK
976.83 s
[pandoc] normal superscript: OK
976.83 s
[pandoc] short subscript delimited by space: OK
976.83 s
[pandoc] short subscript delimited by newline: OK
976.83 s
[pandoc] short subscript delimited by EOF: OK
976.83 s
[pandoc] short subscript delimited by punctuation: OK
976.83 s
[pandoc] short subscript delimited by emph: OK
976.83 s
[pandoc] no nesting in short subscripts: OK
976.83 s
[pandoc] short superscript delimited by space: OK
976.83 s
[pandoc] short superscript delimited by newline: OK
976.83 s
[pandoc] short superscript delimited by ExF: OK
976.83 s
[pandoc] short superscript delimited by punctuation: OK
976.84 s
[pandoc] short superscript delimited by emph: OK
976.84 s
[pandoc] no nesting in short superscripts: OK
976.84 s
[pandoc] footnotes
976.84 s
[pandoc] indent followed by newline and flush-left text: OK
976.84 s
[pandoc] indent followed by newline and indented text: OK
976.84 s
[pandoc] recursive note: OK
976.84 s
[pandoc] lhs
976.84 s
[pandoc] inverse bird tracks and html: OK
976.84 s
[pandoc] definition lists
976.84 s
[pandoc] no blank space: OK
976.84 s
[pandoc] blank space before first def: OK
976.84 s
[pandoc] blank space before second def: OK
976.84 s
[pandoc] laziness: OK
976.84 s
[pandoc] no blank space before first of two paragraphs: OK
976.84 s
[pandoc] first line not indented: OK
976.84 s
[pandoc] list in definition: OK
976.84 s
[pandoc] in div: OK
976.84 s
[pandoc] +compact_definition_lists
976.84 s
[pandoc] basic compact list: OK
976.84 s
[pandoc] lists
976.84 s
[pandoc] issue #1154: OK
976.84 s
[pandoc] issue #1636: OK
976.84 s
[pandoc] entities
976.84 s
[pandoc] character references: OK
976.84 s
[pandoc] numeric: OK
976.85 s
[pandoc] in link title: OK
976.85 s
[pandoc] citations
976.85 s
[pandoc] simple: OK
976.85 s
[pandoc] key starts with digit: OK
976.85 s
[pandoc] footnote/link following citation
976.85 s
[pandoc] footnote: OK
976.85 s
[pandoc] normal link: OK
976.85 s
[pandoc] reference link: OK
976.85 s
[pandoc] short reference link: OK
976.85 s
[pandoc] implicit header link: OK
976.85 s
[pandoc] regular citation: OK
976.85 s
[pandoc] HTML
976.85 s
[pandoc] base tag
976.85 s
[pandoc] simple: OK
976.85 s
[pandoc] slash at end of base: OK
976.85 s
[pandoc] slash at beginning of href: OK
976.85 s
[pandoc] absolute URL: OK
976.85 s
[pandoc] anchors
976.85 s
[pandoc] anchor without href: OK
976.85 s
[pandoc] img
976.85 s
[pandoc] data-external attribute: OK
976.85 s
[pandoc] title: OK
976.85 s
[pandoc] lang
976.85 s
[pandoc] lang on <html>: OK
976.85 s
[pandoc] xml:lang on <html>: OK
976.85 s
[pandoc] main
976.85 s
[pandoc] <main> contents are parsed: OK
976.85 s
[pandoc] <main role=X> becomes <div role=X>: OK
976.85 s
[pandoc] <main> has attributes preserved: OK
976.85 s
[pandoc] <main> closes <p>: OK
976.85 s
[pandoc] <main> followed by text: OK
976.85 s
[pandoc] code
976.85 s
[pandoc] inline code block: OK
976.85 s
[pandoc] tt
976.85 s
[pandoc] inline tt block: OK
976.85 s
[pandoc] samp
976.86 s
[pandoc] inline samp block: OK
976.86 s
[pandoc] var
976.86 s
[pandoc] inline var block: OK
976.86 s
[pandoc] header
976.86 s
[pandoc] <header> is parsed as a div: OK
976.86 s
[pandoc] code block
976.86 s
[pandoc] attributes in pre > code element: OK
976.86 s
[pandoc] attributes in pre take precedence: OK
977.60 s
[pandoc] Round trip: OK (0.74s)
977.60 s
[pandoc] +++ OK, passed 25 tests.
977.60 s
[pandoc] JATS
977.60 s
[pandoc] inline code
977.60 s
[pandoc] basic: OK
977.60 s
[pandoc] block code
977.60 s
[pandoc] basic: OK
977.60 s
[pandoc] lang: OK
977.60 s
[pandoc] images
977.60 s
[pandoc] basic: OK
977.60 s
[pandoc] alt-text: OK
977.60 s
[pandoc] bullet list: OK
977.60 s
[pandoc] definition lists
977.60 s
[pandoc] with internal link: OK
977.60 s
[pandoc] math
977.60 s
[pandoc] escape |: OK
977.60 s
[pandoc] tex-math only: OK
977.60 s
[pandoc] math ml only: OK
977.60 s
[pandoc] headers
977.60 s
[pandoc] unnumbered sub header: OK
977.60 s
[pandoc] containing image: OK
977.60 s
[pandoc] metadata
977.60 s
[pandoc] abstract: OK
977.60 s
[pandoc] Jira
977.60 s
[pandoc] para
977.60 s
[pandoc] Simple sentence: OK
977.60 s
[pandoc] leading blank lines: OK
977.60 s
[pandoc] header
977.60 s
[pandoc] header: OK
977.60 s
[pandoc] list
977.60 s
[pandoc] simple list: OK
977.60 s
[pandoc] list with minus as bullets: OK
977.60 s
[pandoc] ordered list / enumeration: OK
977.60 s
[pandoc] block quote
977.60 s
[pandoc] simple block quote: OK
977.60 s
[pandoc] block quote between paragraphs: OK
977.60 s
[pandoc] table
977.60 s
[pandoc] table without header: OK
977.61 s
[pandoc] table with header: OK
977.61 s
[pandoc] table with column header: OK
977.61 s
[pandoc] table after paragraph: OK
977.61 s
[pandoc] panel
977.61 s
[pandoc] simple panel: OK
977.61 s
[pandoc] inlines
977.61 s
[pandoc] emphasis: OK
977.61 s
[pandoc] deleted: OK
977.61 s
[pandoc] monospaced: OK
977.61 s
[pandoc] sub- and superscript: OK
977.61 s
[pandoc] citation: OK
977.61 s
[pandoc] color: OK
977.61 s
[pandoc] hexcolor: OK
977.61 s
[pandoc] linebreak: OK
977.61 s
[pandoc] links
977.61 s
[pandoc] external: OK
977.61 s
[pandoc] URL in alias: OK
977.61 s
[pandoc] email: OK
977.61 s
[pandoc] email with description: OK
977.61 s
[pandoc] attachment: OK
977.61 s
[pandoc] attachment with description: OK
977.61 s
[pandoc] user: OK
977.61 s
[pandoc] user with description: OK
977.61 s
[pandoc] 'smart' link: OK
977.61 s
[pandoc] 'smart' card: OK
977.61 s
[pandoc] image: OK
977.61 s
[pandoc] thumbnail image: OK
977.61 s
[pandoc] image with attributes: OK
977.61 s
[pandoc] inserted text: OK
977.61 s
[pandoc] HTML entity: OK
977.61 s
[pandoc] non-strikeout dashes: OK
977.61 s
[pandoc] Org
977.61 s
[pandoc] Inlines
977.61 s
[pandoc] Plain String: OK
977.61 s
[pandoc] Emphasis: OK
977.61 s
[pandoc] Strong: OK
977.61 s
[pandoc] Strong Emphasis: OK
977.61 s
[pandoc] Emphasized Strong preceded by space: OK
977.61 s
[pandoc] Underline: OK
977.61 s
[pandoc] Strikeout: OK
977.61 s
[pandoc] Verbatim: OK
977.61 s
[pandoc] Code: OK
977.61 s
[pandoc] Math $..$: OK
977.61 s
[pandoc] Math $$..$$: OK
977.61 s
[pandoc] Math \[..\]: OK
977.61 s
[pandoc] Math \(..\): OK
977.61 s
[pandoc] Symbol: OK
977.61 s
[pandoc] Superscript simple expression: OK
977.61 s
[pandoc] Superscript multi char: OK
977.61 s
[pandoc] Subscript simple expression: OK
977.61 s
[pandoc] Subscript multi char: OK
977.62 s
[pandoc] Linebreak: OK
977.62 s
[pandoc] Inline note: OK
977.62 s
[pandoc] By default, markup-chars not occurring on word break...: OK
977.62 s
[pandoc] No empty markup: OK
977.62 s
[pandoc] Adherence to Org's rules for markup borders: OK
977.62 s
[pandoc] Quotes are allowed border chars: OK
977.62 s
[pandoc] Spaces are forbidden border chars: OK
977.62 s
[pandoc] Zero width spaces are forbidden border chars: OK
977.62 s
[pandoc] Markup should work properly after a blank line: OK
977.62 s
[pandoc] Inline math must stay within three lines: OK
977.62 s
[pandoc] Single-character math: OK
977.62 s
[pandoc] Markup may not span more than two lines: OK
977.62 s
[pandoc] Sub- and superscript expressions: OK
977.62 s
[pandoc] Verbatim text can contain equal signs (=): OK
977.62 s
[pandoc] Images
977.62 s
[pandoc] Image: OK
977.62 s
[pandoc] Image with explicit file: prefix: OK
977.62 s
[pandoc] Multiple images within a paragraph: OK
977.62 s
[pandoc] Image with html attributes: OK
977.62 s
[pandoc] HTML attributes can have trailing spaces: OK
977.62 s
[pandoc] Uppercase extension: OK
977.62 s
[pandoc] Explicit link: OK
977.63 s
[pandoc] Self-link: OK
977.63 s
[pandoc] Internal self-link (reference): OK
977.63 s
[pandoc] Absolute file link: OK
977.63 s
[pandoc] Link to file in parent directory: OK
977.63 s
[pandoc] Empty link (for gitit interop): OK
977.63 s
[pandoc] Image link: OK
977.63 s
[pandoc] Image link with non-image target: OK
977.63 s
[pandoc] Link to image: OK
977.63 s
[pandoc] Plain link: OK
977.63 s
[pandoc] Angle link: OK
977.63 s
[pandoc] Absolute file link: OK
977.63 s
[pandoc] File link: OK
977.63 s
[pandoc] Anchor: OK
977.63 s
[pandoc] Inline code block: OK
977.63 s
[pandoc] Inline code block with arguments: OK
977.63 s
[pandoc] Inline code block with a blank argument array: OK
977.63 s
[pandoc] Inline code block with toggle: OK
977.63 s
[pandoc] Inline LaTeX symbol: OK
977.63 s
[pandoc] Inline LaTeX command: OK
977.63 s
[pandoc] Inline LaTeX command with spaces: OK
977.63 s
[pandoc] Inline math symbols: OK
977.63 s
[pandoc] Inline LaTeX math command: OK
977.64 s
[pandoc] Unknown inline LaTeX command: OK
977.64 s
[pandoc] Export snippet: OK
977.64 s
[pandoc] MathML symbol in LaTeX-style: OK
977.64 s
[pandoc] MathML symbol in LaTeX-style, including braces: OK
977.64 s
[pandoc] MathML copy sign: OK
977.64 s
[pandoc] MathML symbols, space separated: OK
977.64 s
[pandoc] Macro: OK
977.64 s
[pandoc] Macro duplicating its argument: OK
977.64 s
[pandoc] Macro called with too few arguments: OK
977.64 s
[pandoc] Macro called with an escaped comma: OK
977.64 s
[pandoc] Citations
977.64 s
[pandoc] Org-cite citations
977.64 s
[pandoc] Citation: OK
977.64 s
[pandoc] Citation containing text: OK
977.64 s
[pandoc] Author-in-text citation with locator and suffix: OK
977.64 s
[pandoc] org-ref citations
977.64 s
[pandoc] simple citation: OK
977.64 s
[pandoc] simple citation with underscores: OK
977.64 s
[pandoc] simple citation succeeded by comma: OK
977.64 s
[pandoc] simple citation succeeded by dot: OK
977.64 s
[pandoc] simple citation succeeded by colon: OK
977.64 s
[pandoc] simple citep citation: OK
977.64 s
[pandoc] multiple simple citations: OK
977.64 s
[pandoc] multiple simple citations succeeded by comma: OK
977.65 s
[pandoc] extended citation: OK
977.65 s
[pandoc] LaTeX citation: OK
977.65 s
[pandoc] Footnotes
977.65 s
[pandoc] Footnote: OK
977.65 s
[pandoc] Two footnotes: OK
977.65 s
[pandoc] Emphasized text before footnote: OK
977.65 s
[pandoc] Footnote that starts with emphasized text: OK
977.65 s
[pandoc] Footnote followed by header: OK
977.65 s
[pandoc] Footnote followed by two blank lines: OK
977.65 s
[pandoc] Smart punctuation
977.65 s
[pandoc] quote before ellipses: OK
977.65 s
[pandoc] apostrophe before emph: OK
977.65 s
[pandoc] apostrophe in French: OK
977.65 s
[pandoc] Quotes cannot occur at the end of emphasized text: OK
977.65 s
[pandoc] Dashes are allowed at the borders of emphasis': OK
977.65 s
[pandoc] Single quotes can be followed by emphasized text: OK
977.65 s
[pandoc] Double quotes can be followed by emphasized text: OK
977.65 s
[pandoc] Basic Blocks
977.65 s
[pandoc] Paragraph: OK
977.65 s
[pandoc] Paragraph starting with an asterisk: OK
977.65 s
[pandoc] Paragraph containing asterisk at beginning of line: OK
977.65 s
[pandoc] Example block: OK
977.65 s
[pandoc] Example block surrounded by text: OK
977.65 s
[pandoc] Horizontal Rule: OK
977.65 s
[pandoc] Not a Horizontal Rule: OK
977.65 s
[pandoc] Comments
977.65 s
[pandoc] Comment Block: OK
977.65 s
[pandoc] Comment line: OK
977.65 s
[pandoc] Empty comment line: OK
977.65 s
[pandoc] Blocks and fragments
977.65 s
[pandoc] HTML block: OK
977.65 s
[pandoc] Quote block: OK
977.66 s
[pandoc] Verse block: OK
977.66 s
[pandoc] Verse block with blank lines: OK
977.66 s
[pandoc] Verse block with varying indentation: OK
977.66 s
[pandoc] Raw block LaTeX: OK
977.66 s
[pandoc] Raw LaTeX line: OK
977.66 s
[pandoc] Raw Beamer line: OK
977.66 s
[pandoc] Raw HTML line: OK
977.66 s
[pandoc] Export block HTML: OK
977.66 s
[pandoc] LaTeX fragment: OK
977.66 s
[pandoc] One-line LaTeX fragment: OK
977.66 s
[pandoc] LaTeX fragment with more arguments: OK
977.66 s
[pandoc] Convert blank lines in blocks to single newlines: OK
977.66 s
[pandoc] Accept `attr_html` attributes for generic block: OK
977.66 s
[pandoc] Headers
977.66 s
[pandoc] First Level Header: OK
977.66 s
[pandoc] Third Level Header: OK
977.66 s
[pandoc] Compact Headers with Paragraph: OK
977.66 s
[pandoc] Separated Headers with Paragraph: OK
977.66 s
[pandoc] Headers not preceded by a blank line: OK
977.66 s
[pandoc] Todo keywords
977.66 s
[pandoc] Header with known todo keyword: OK
977.66 s
[pandoc] Header marked as done: OK
977.66 s
[pandoc] emphasis in first word: OK
977.66 s
[pandoc] Header with unknown todo keyword: OK
977.66 s
[pandoc] Custom todo keywords: OK
977.66 s
[pandoc] Custom todo keywords with multiple done-states: OK
977.66 s
[pandoc] Tagged headers: OK
977.66 s
[pandoc] Untagged header containing colons: OK
977.66 s
[pandoc] Untagged header time followed by colon: OK
977.67 s
[pandoc] tag followed by text: OK
977.67 s
[pandoc] Header starting with strokeout text: OK
977.67 s
[pandoc] Comment Trees: OK
977.67 s
[pandoc] Nothing but a COMMENT header: OK
977.67 s
[pandoc] Tree with :noexport:: OK
977.67 s
[pandoc] Subtree with :noexport:: OK
977.67 s
[pandoc] Preferences are treated as header attributes: OK
977.67 s
[pandoc] Headers marked with a unnumbered property get a clas...: OK
977.67 s
[pandoc] planning information
977.67 s
[pandoc] Planning info is not included in output: OK
977.67 s
[pandoc] Properties after planning info are recognized: OK
977.67 s
[pandoc] Planning info followed by test: OK
977.67 s
[pandoc] third and forth level headers: OK
977.67 s
[pandoc] Figures
977.67 s
[pandoc] Figure: OK
977.67 s
[pandoc] Figure with no name: OK
977.67 s
[pandoc] Figure with `fig:` prefix in name: OK
977.67 s
[pandoc] Figure with HTML attributes: OK
977.67 s
[pandoc] LaTeX attributes are ignored: OK
977.67 s
[pandoc] Labelled figure: OK
977.68 s
[pandoc] Figure with empty caption: OK
977.68 s
[pandoc] Lists
977.68 s
[pandoc] Simple Bullet Lists: OK
977.68 s
[pandoc] Simple Bullet List with Ignored Counter Cookie: OK
977.68 s
[pandoc] Indented Bullet Lists: OK
977.68 s
[pandoc] Unindented *: OK
977.68 s
[pandoc] Multi-line Bullet Lists: OK
977.68 s
[pandoc] Nested Bullet Lists: OK
977.68 s
[pandoc] Bullet List with Decreasing Indent: OK
977.68 s
[pandoc] Header follows Bullet List: OK
977.68 s
[pandoc] Bullet List Unindented with trailing Header: OK
977.68 s
[pandoc] Empty bullet points: OK
977.68 s
[pandoc] Task list: OK
977.68 s
[pandoc] Task List with Counter Cookies: OK
977.68 s
[pandoc] Task with alphabetical markers and counter cookie: OK
977.68 s
[pandoc] Simple Ordered List: OK
977.68 s
[pandoc] Simple Ordered List with fancy lists extension: OK
977.68 s
[pandoc] Simple Ordered List with lower alpha marker: OK
977.68 s
[pandoc] Simple Ordered List with upper and lower alpha markers: OK
977.68 s
[pandoc] Simple Ordered List with Counter Cookie: OK
977.68 s
[pandoc] Simple Ordered List with Alphabetical Counter Cookie: OK
977.68 s
[pandoc] Simple Ordered List with Ignored Counter Cookie: OK
977.68 s
[pandoc] Simple Ordered List with Parens: OK
977.68 s
[pandoc] Indented Ordered List: OK
977.69 s
[pandoc] Empty ordered list item: OK
977.69 s
[pandoc] Empty ordered list item with fancy lists extension: OK
977.69 s
[pandoc] Empty ordered list item with counter cookie: OK
977.69 s
[pandoc] Nested Ordered Lists: OK
977.69 s
[pandoc] Ordered List in Bullet List: OK
977.69 s
[pandoc] Bullet List in Ordered List: OK
977.69 s
[pandoc] Definition List: OK
977.69 s
[pandoc] Definition list with multi-word term: OK
977.69 s
[pandoc] Compact definition list: OK
977.69 s
[pandoc] Definition List With Trailing Header: OK
977.69 s
[pandoc] Definition lists double-colon markers must be surrou...: OK
977.69 s
[pandoc] Loose bullet list: OK
977.69 s
[pandoc] Recognize preceding paragraphs in non-list contexts: OK
977.69 s
[pandoc] Markup after header and list: OK
977.69 s
[pandoc] CodeBlocks
977.69 s
[pandoc] Source block: OK
977.69 s
[pandoc] Source block with indented code: OK
977.69 s
[pandoc] Source block with tab-indented code: OK
977.69 s
[pandoc] Empty source block: OK
977.69 s
[pandoc] Source block between paragraphs: OK
977.69 s
[pandoc] Source block with babel arguments: OK
977.69 s
[pandoc] Source block with results and :exports both: OK
977.69 s
[pandoc] Source block with results and :exports code: OK
977.69 s
[pandoc] Source block with results and :exports results: OK
977.69 s
[pandoc] Source block with results and :exports none: OK
977.69 s
[pandoc] Source block with toggling header arguments: OK
977.69 s
[pandoc] Source block with line number switch: OK
977.69 s
[pandoc] Source block with multi-word parameter values: OK
977.69 s
[pandoc] Example block: OK
977.69 s
[pandoc] Code block with caption: OK
977.69 s
[pandoc] Non-letter chars in source block parameters: OK
977.70 s
[pandoc] Tables
977.70 s
[pandoc] Single cell table: OK
977.70 s
[pandoc] Multi cell table: OK
977.70 s
[pandoc] Multi line table: OK
977.71 s
[pandoc] Empty table: OK
977.71 s
[pandoc] Glider Table: OK
977.71 s
[pandoc] Table between Paragraphs: OK
977.72 s
[pandoc] Table with Header: OK
977.72 s
[pandoc] Table with final hline: OK
977.73 s
[pandoc] Table in a box: OK
977.73 s
[pandoc] Table with empty cells: OK
977.73 s
[pandoc] Table with empty rows: OK
977.73 s
[pandoc] Table with alignment row: OK
977.73 s
[pandoc] Pipe within text doesn't start a table: OK
977.73 s
[pandoc] Missing pipe at end of row: OK
977.74 s
[pandoc] Table with differing row lengths: OK
977.74 s
[pandoc] Table with caption: OK
977.74 s
[pandoc] named table: OK
977.74 s
[pandoc] Meta Information
977.74 s
[pandoc] Comments
977.74 s
[pandoc] Comment: OK
977.74 s
[pandoc] Hash not followed by space is text: OK
977.74 s
[pandoc] Comment surrounded by Text: OK
977.74 s
[pandoc] Export settings
977.74 s
[pandoc] Title: OK
977.74 s
[pandoc] Author
977.74 s
[pandoc] sets 'author' field: OK
977.74 s
[pandoc] Multiple author lines: OK
977.74 s
[pandoc] Date: OK
977.74 s
[pandoc] Description
977.74 s
[pandoc] Single line: OK
977.74 s
[pandoc] Multiline: OK
977.74 s
[pandoc] Subtitle: OK
977.74 s
[pandoc] Keywords: OK
977.74 s
[pandoc] Institute: OK
977.74 s
[pandoc] Document language: OK
977.74 s
[pandoc] Todo sequences
977.74 s
[pandoc] not included in document: OK
977.74 s
[pandoc] can contain multiple pipe characters: OK
977.74 s
[pandoc] LaTeX
977.74 s
[pandoc] LATEX_HEADER: OK
977.74 s
[pandoc] LATEX_HEADER_EXTRA: OK
977.74 s
[pandoc] LaTeX_CLASS
977.74 s
[pandoc] stored as documentclass: OK
977.74 s
[pandoc] last definition takes precedence: OK
977.75 s
[pandoc] LATEX_CLASS_OPTIONS as classoption: OK
977.75 s
[pandoc] HTML
977.75 s
[pandoc] HTML_HEAD values are added to header-includes: OK
977.75 s
[pandoc] HTML_HEAD_EXTRA behaves like HTML_HEAD: OK
977.75 s
[pandoc] Non-export keywords
977.75 s
[pandoc] #+link
977.75 s
[pandoc] Link abbreviation: OK
977.75 s
[pandoc] Link abbreviation, defined after first use: OK
977.75 s
[pandoc] Link abbreviation, URL encoded arguments: OK
977.75 s
[pandoc] Link abbreviation, append arguments: OK
977.75 s
[pandoc] emphasis config
977.75 s
[pandoc] Changing pre chars for emphasis: OK
977.75 s
[pandoc] Changing post chars for emphasis: OK
977.75 s
[pandoc] setting an invalid value restores the default: OK
977.75 s
[pandoc] Unknown keyword: OK
977.75 s
[pandoc] Properties drawer: OK
977.75 s
[pandoc] Logbook drawer: OK
977.75 s
[pandoc] Drawer surrounded by text: OK
977.75 s
[pandoc] Drawer markers must be the only text in the line: OK
977.75 s
[pandoc] Drawers can be arbitrary: OK
977.75 s
[pandoc] Anchor reference: OK
977.75 s
[pandoc] Search links are read as emph: OK
977.76 s
[pandoc] Link to nonexistent anchor: OK
977.76 s
[pandoc] Directives
977.76 s
[pandoc] export options
977.76 s
[pandoc] disable simple sub/superscript syntax: OK
977.76 s
[pandoc] directly select drawers to be exported: OK
977.76 s
[pandoc] exclude drawers from being exported: OK
977.76 s
[pandoc] don't include archive trees: OK
977.76 s
[pandoc] include complete archive trees: OK
977.76 s
[pandoc] include archive tree header only: OK
977.76 s
[pandoc] limit headline depth: OK
977.76 s
[pandoc] turn all headlines into lists: OK
977.76 s
[pandoc] preserve linebreaks as hard breaks: OK
977.76 s
[pandoc] disable author export: OK
977.76 s
[pandoc] disable creator export: OK
977.76 s
[pandoc] disable email export: OK
977.76 s
[pandoc] disable MathML-like entities: OK
977.76 s
[pandoc] Option f
977.76 s
[pandoc] disable inline footnotes: OK
977.76 s
[pandoc] disable reference footnotes: OK
977.77 s
[pandoc] disable inclusion of todo keywords: OK
977.77 s
[pandoc] remove tags from headlines: OK
977.77 s
[pandoc] LaTeX
977.77 s
[pandoc] Include LaTeX fragments
977.77 s
[pandoc] Inline command: OK
977.77 s
[pandoc] Alpha: OK
977.77 s
[pandoc] equation environment: OK
977.77 s
[pandoc] Ignore LaTeX fragments
977.77 s
[pandoc] Inline command: OK
977.77 s
[pandoc] MathML symbol (alpha): OK
977.77 s
[pandoc] equation environment: OK
977.77 s
[pandoc] Verbatim LaTeX
977.77 s
[pandoc] Inline command: OK
977.77 s
[pandoc] MathML symbol (alpha): OK
977.77 s
[pandoc] equation environment: OK
977.77 s
[pandoc] planning information
977.77 s
[pandoc] include planning info after headlines: OK
977.77 s
[pandoc] empty planning info is not included: OK
977.77 s
[pandoc] Option |
977.77 s
[pandoc] disable export of tables: OK
977.77 s
[pandoc] unknown options
977.77 s
[pandoc] unknown options are ignored: OK
977.77 s
[pandoc] highlighting after unknown option: OK
977.77 s
[pandoc] unknown option interleaved with known: OK
977.77 s
[pandoc] Include
977.77 s
[pandoc] file inclusion: OK
977.77 s
[pandoc] Included file belongs to item: OK
977.77 s
[pandoc] Default include preserves level: OK
977.77 s
[pandoc] Minlevel shifts level leftward: OK
977.77 s
[pandoc] Minlevel shifts level rightward: OK
977.77 s
[pandoc] Include file as source code snippet: OK
977.77 s
[pandoc] Include file as export snippet: OK
977.77 s
[pandoc] include directive is limited to one line: OK
977.78 s
[pandoc] RST
977.78 s
[pandoc] line block with blank line: OK
977.78 s
[pandoc] field list
977.78 s
[pandoc] general: OK
977.78 s
[pandoc] metadata: OK
977.78 s
[pandoc] with inline markup: OK
977.78 s
[pandoc] URLs with following punctuation: OK
977.78 s
[pandoc] Reference names with special characters: OK
977.78 s
[pandoc] Code directive with class and number-lines: OK
977.78 s
[pandoc] Code directive with number-lines, no line specified: OK
977.78 s
[pandoc] literal / line / code blocks
977.78 s
[pandoc] indented literal block: OK
977.78 s
[pandoc] line block with 3 lines: OK
977.79 s
[pandoc] line blocks with blank lines: OK
977.79 s
[pandoc] quoted literal block using >: OK
977.79 s
[pandoc] quoted literal block using | (not a line block): OK
977.79 s
[pandoc] class directive with single paragraph: OK
977.79 s
[pandoc] class directive with two paragraphs: OK
977.79 s
[pandoc] class directive around literal block: OK
977.79 s
[pandoc] interpreted text roles
977.79 s
[pandoc] literal role prefix: OK
977.79 s
[pandoc] literal role postfix: OK
977.79 s
[pandoc] literal text: OK
977.79 s
[pandoc] code role: OK
977.79 s
[pandoc] inherited code role: OK
977.79 s
[pandoc] custom code role with language field: OK
977.79 s
[pandoc] custom role with class field: OK
977.79 s
[pandoc] custom role with class field containing multiple whi...: OK
977.79 s
[pandoc] custom role with inherited class field: OK
977.79 s
[pandoc] custom role with unspecified parent role: OK
977.79 s
[pandoc] role with recursive inheritance: OK
977.79 s
[pandoc] unknown role: OK
977.79 s
[pandoc] footnotes
977.79 s
[pandoc] remove space before note: OK
977.79 s
[pandoc] inlines
977.79 s
[pandoc] links can contain an URI without being parsed twice ...: OK
977.79 s
[pandoc] inline markup cannot be nested: OK
977.79 s
[pandoc] bare URI parsing disabled inside emphasis (#4561): OK
977.79 s
[pandoc] include newlines: OK
977.79 s
[pandoc] RTF
977.79 s
[pandoc] footnote: OK
977.80 s
[pandoc] accent: OK
977.80 s
[pandoc] unicode: OK
977.81 s
[pandoc] image: OK (0.01s)
977.81 s
[pandoc] link: OK
977.82 s
[pandoc] heading: OK (0.01s)
977.83 s
[pandoc] formatting: OK (0.01s)
977.83 s
[pandoc] list_simple: OK
977.85 s
[pandoc] list_complex: OK (0.02s)
977.85 s
[pandoc] bookmark: OK
977.85 s
[pandoc] table_simple: OK
977.86 s
[pandoc] table_error_codes: OK
977.86 s
[pandoc] Docx
977.86 s
[pandoc] document
977.86 s
[pandoc] allow different document.xml file as defined in _rel...: OK
977.86 s
[pandoc] inlines
977.86 s
[pandoc] font formatting: OK
977.86 s
[pandoc] font formatting with character styles: OK
977.87 s
[pandoc] hyperlinks: OK
977.87 s
[pandoc] hyperlinks in <w:instrText> tag: OK
977.87 s
[pandoc] nested fields with <w:instrText> tag: OK
977.87 s
[pandoc] empty fields with <w:instrText> tag: OK
977.87 s
[pandoc] pageref hyperlinks in <w:instrText> tag: OK
977.87 s
[pandoc] inline image: OK
977.87 s
[pandoc] VML image: OK
977.87 s
[pandoc] VML image as object: OK
977.87 s
[pandoc] inline image in links: OK
977.87 s
[pandoc] handling unicode input: OK
977.87 s
[pandoc] literal tabs: OK
977.87 s
[pandoc] special punctuation: OK
977.87 s
[pandoc] normalizing inlines: OK
977.87 s
[pandoc] normalizing inlines deep inside blocks: OK
977.88 s
[pandoc] move trailing spaces outside of formatting: OK
977.88 s
[pandoc] remove trailing spaces from last inline: OK
977.88 s
[pandoc] inline code (with VerbatimChar style): OK
977.88 s
[pandoc] inline code in subscript and superscript: OK
977.88 s
[pandoc] inlines inside of Structured Document Tags: OK
977.88 s
[pandoc] Structured Document Tags in footnotes: OK
977.88 s
[pandoc] nested Structured Document Tags: OK
977.88 s
[pandoc] nested Smart Tags: OK
977.88 s
[pandoc] remove anchor spans with nothing pointing to them: OK
977.88 s
[pandoc] collapse overlapping targets (anchor spans): OK
977.89 s
[pandoc] anchor in header after anchor: OK
977.89 s
[pandoc] text in shape format: OK
977.89 s
[pandoc] blocks
977.89 s
[pandoc] headers: OK
977.89 s
[pandoc] headers already having auto identifiers: OK
977.90 s
[pandoc] avoid zero-level headers: OK
977.90 s
[pandoc] nested anchor spans in header: OK
977.90 s
[pandoc] single numbered item not made into list: OK
977.90 s
[pandoc] enumerated headers not made into numbered list: OK
977.90 s
[pandoc] i18n blocks (headers and blockquotes): OK
977.90 s
[pandoc] lists: OK
977.90 s
[pandoc] compact lists: OK
977.91 s
[pandoc] lists with level overrides: OK
977.91 s
[pandoc] lists continuing after interruption: OK
977.91 s
[pandoc] lists restarting after interruption: OK
977.91 s
[pandoc] sublists reset numbering to 1: OK
977.91 s
[pandoc] definition lists: OK
977.92 s
[pandoc] task lists: OK
977.93 s
[pandoc] custom defined lists in styles: OK
977.93 s
[pandoc] user deletes bullet after list item (=> part of item...: OK
977.94 s
[pandoc] user deletes bullet after par (=> new par): OK
977.94 s
[pandoc] footnotes and endnotes: OK
977.95 s
[pandoc] links in footnotes and endnotes: OK
977.95 s
[pandoc] blockquotes (parsing indent as blockquote): OK
977.95 s
[pandoc] blockquotes (parsing indent relative to the indent o...: OK
977.95 s
[pandoc] hanging indents: OK
977.96 s
[pandoc] tables: OK (0.01s)
977.97 s
[pandoc] tables with lists in cells: OK
977.98 s
[pandoc] a table with a header which contains rowspans greate...: OK (0.01s)
977.98 s
[pandoc] tables with one row: OK
977.98 s
[pandoc] tables with just one row, which is a header: OK
977.98 s
[pandoc] tables with variable width: OK
977.98 s
[pandoc] tables with captions which contain a Table field: OK
977.98 s
[pandoc] tables with captions which don't contain a Table field: OK
977.98 s
[pandoc] code block: OK
977.98 s
[pandoc] combine adjacent code blocks: OK
977.99 s
[pandoc] dropcap paragraphs: OK
977.99 s
[pandoc] citations
977.99 s
[pandoc] zotero with -citations: OK
978.00 s
[pandoc] zotero with +citations: OK
978.00 s
[pandoc] mendeley with -citations: OK
978.00 s
[pandoc] mendeley with +citations: OK
978.00 s
[pandoc] track changes
978.00 s
[pandoc] insertion (default): OK
978.00 s
[pandoc] insert insertion (accept): OK
978.01 s
[pandoc] remove insertion (reject): OK
978.01 s
[pandoc] deletion (default): OK
978.01 s
[pandoc] remove deletion (accept): OK
978.01 s
[pandoc] insert deletion (reject): OK
978.01 s
[pandoc] keep insertion (all): OK
978.01 s
[pandoc] keep deletion (all): OK
978.01 s
[pandoc] move text (accept): OK
978.01 s
[pandoc] move text (reject): OK
978.01 s
[pandoc] move text (all): OK
978.01 s
[pandoc] comments (accept -- no comments): OK
978.01 s
[pandoc] comments (reject -- comments): OK
978.01 s
[pandoc] comments (all comments): OK
978.01 s
[pandoc] paragraph insertion/deletion (accept): OK
978.01 s
[pandoc] paragraph insertion/deletion (reject): OK
978.01 s
[pandoc] paragraph insertion/deletion (all): OK
978.01 s
[pandoc] paragraph insertion/deletion (all): OK
978.01 s
[pandoc] comment warnings (accept -- no warnings): OK
978.01 s
[pandoc] comment warnings (reject -- no warnings): OK
978.01 s
[pandoc] comment warnings (all): OK
978.01 s
[pandoc] comments (with styles extension): OK
978.01 s
[pandoc] media
978.01 s
[pandoc] image extraction: OK
978.01 s
[pandoc] custom styles
978.01 s
[pandoc] custom styles (`+styles`) not enabled (default): OK
978.02 s
[pandoc] custom styles (`+styles`) enabled: OK
978.02 s
[pandoc] custom styles (`+styles`): Compact style is removed ...: OK
978.02 s
[pandoc] metadata
978.02 s
[pandoc] metadata fields: OK
978.02 s
[pandoc] stop recording metadata with normal text: OK
978.02 s
[pandoc] ODT
978.02 s
[pandoc] blockquote2: OK
978.02 s
[pandoc] bold: OK
978.02 s
[pandoc] endnote: OK
978.02 s
[pandoc] externalLink: OK
978.03 s
[pandoc] footnote: OK
978.03 s
[pandoc] formula: OK
978.03 s
[pandoc] headers: OK
978.03 s
[pandoc] italic: OK
978.03 s
[pandoc] paragraph: OK
978.03 s
[pandoc] strikeout: OK
978.03 s
[pandoc] underlined: OK
978.03 s
[pandoc] blockquote: OK
978.03 s
[pandoc] image: OK
978.04 s
[pandoc] imageIndex: OK
978.04 s
[pandoc] imageWithCaption: OK
978.04 s
[pandoc] inlinedCode: OK
978.04 s
[pandoc] listContinueNumbering: OK
978.04 s
[pandoc] listContinueNumbering2: OK
978.05 s
[pandoc] orderedListMixed: OK
978.05 s
[pandoc] orderedListRoman: OK
978.05 s
[pandoc] orderedListSimple: OK
978.05 s
[pandoc] orderedListHeader: OK
978.05 s
[pandoc] referenceToChapter: OK
978.05 s
[pandoc] referenceToListItem: OK
978.06 s
[pandoc] referenceToText: OK
978.06 s
[pandoc] simpleTable: OK
978.06 s
[pandoc] simpleTableWithCaption: OK
978.06 s
[pandoc] tab: OK
978.06 s
[pandoc] textMixedStyles: OK
978.07 s
[pandoc] tableWithContents: OK
978.07 s
[pandoc] unicode: OK
978.07 s
[pandoc] unorderedList: OK
978.07 s
[pandoc] unorderedListHeader: OK
978.07 s
[pandoc] Txt2Tags
978.07 s
[pandoc] Inlines
978.07 s
[pandoc] Plain String: OK
978.07 s
[pandoc] Emphasis: OK
978.07 s
[pandoc] Strong: OK
978.07 s
[pandoc] Strong Emphasis: OK
978.07 s
[pandoc] Strikeout: OK
978.07 s
[pandoc] Verbatim: OK
978.07 s
[pandoc] Symbol: OK
978.07 s
[pandoc] No empty markup: OK
978.07 s
[pandoc] Inline markup is greedy: OK
978.07 s
[pandoc] Markup must be greedy: OK
978.07 s
[pandoc] Inlines must be glued: OK
978.07 s
[pandoc] Macros: Date: OK
978.07 s
[pandoc] Macros: Mod Time: OK
978.07 s
[pandoc] Macros: Infile: OK
978.07 s
[pandoc] Macros: Outfile: OK
978.07 s
[pandoc] Autolink: OK
978.07 s
[pandoc] JPEG Image: OK
978.07 s
[pandoc] PNG Image: OK
978.07 s
[pandoc] Link: OK
978.07 s
[pandoc] Image link: OK
978.07 s
[pandoc] Invalid link: No trailing space: OK
978.07 s
[pandoc] Basic Blocks
978.07 s
[pandoc] Paragraph, lines grouped together: OK
978.07 s
[pandoc] Paragraph, ignore leading and trailing spaces: OK
978.07 s
[pandoc] Comment line in paragraph: OK
978.07 s
[pandoc] Paragraph: OK
978.07 s
[pandoc] First Level Header: OK
978.07 s
[pandoc] Third Level Header: OK
978.07 s
[pandoc] Header with label: OK
978.07 s
[pandoc] Invalid header, mismatched delimiters: OK
978.08 s
[pandoc] Invalid header, spaces in label: OK
978.08 s
[pandoc] Invalid header, invalid label character: OK
978.08 s
[pandoc] Headers not preceded by a blank line: OK
978.08 s
[pandoc] Paragraph starting with an equals: OK
978.08 s
[pandoc] Paragraph containing asterisk at beginning of line: OK
978.08 s
[pandoc] Horizontal Rule: OK
978.08 s
[pandoc] Comment Block: OK
978.08 s
[pandoc] Lists
978.08 s
[pandoc] Simple Bullet Lists: OK
978.08 s
[pandoc] Indented Bullet Lists: OK
978.08 s
[pandoc] Nested Bullet Lists: OK
978.08 s
[pandoc] Simple Ordered List: OK
978.08 s
[pandoc] Indented Ordered List: OK
978.08 s
[pandoc] Nested Ordered Lists: OK
978.08 s
[pandoc] Ordered List in Bullet List: OK
978.08 s
[pandoc] Bullet List in Ordered List: OK
978.08 s
[pandoc] Definition List: OK
978.09 s
[pandoc] Loose bullet list: OK
978.09 s
[pandoc] Tables
978.09 s
[pandoc] Single cell table: OK
978.09 s
[pandoc] Multi cell table: OK
978.09 s
[pandoc] Multi line table: OK
978.09 s
[pandoc] Empty table: OK
978.09 s
[pandoc] Glider Table: OK
978.09 s
[pandoc] Table with Header: OK
978.09 s
[pandoc] Table alignment determined by spacing: OK
978.09 s
[pandoc] Pipe within text doesn't start a table: OK
978.09 s
[pandoc] Table with differing row lengths: OK
978.09 s
[pandoc] Blocks and fragments
978.09 s
[pandoc] Source block: OK
978.09 s
[pandoc] tagged block: OK
978.09 s
[pandoc] Quote block: OK
978.09 s
[pandoc] EPUB
978.09 s
[pandoc] EPUB Mediabag
978.09 s
[pandoc] features bag: OK
978.12 s
[pandoc] EPUB3 cover bag: OK (0.02s)
978.12 s
[pandoc] EPUB3 no cover bag: OK
978.12 s
[pandoc] EPUB2 picture bag: OK
978.12 s
[pandoc] EPUB2 cover bag: OK
978.12 s
[pandoc] EPUB2 no cover bag: OK
978.12 s
[pandoc] Muse
978.12 s
[pandoc] Inlines
978.12 s
[pandoc] Plain String: OK
978.12 s
[pandoc] Muse is not XML: OK
978.12 s
[pandoc] Emphasis: OK
978.12 s
[pandoc] Newline in the beginning of emphasis: OK
978.12 s
[pandoc] Newline in the end of emphasis: OK
978.12 s
[pandoc] Comma after closing *: OK
978.12 s
[pandoc] Letter after closing *: OK
978.13 s
[pandoc] Letter before opening *: OK
978.13 s
[pandoc] Digit after closing *: OK
978.13 s
[pandoc] Emphasis tag: OK
978.13 s
[pandoc] Strong: OK
978.13 s
[pandoc] Strong tag: OK
978.13 s
[pandoc] Strong Emphasis: OK
978.13 s
[pandoc] Strong inside emphasis: OK
978.13 s
[pandoc] Emphasis inside strong: OK
978.13 s
[pandoc] Opening asterisk can't be preceded by another one: OK
978.13 s
[pandoc] Asterisk between words does not terminate emphasis: OK
978.13 s
[pandoc] Two asterisks between words do not terminate emphasis: OK
978.13 s
[pandoc] Three asterisks between words do not terminate empha...: OK
978.13 s
[pandoc] Two asterisks between words do not terminate strong: OK
978.13 s
[pandoc] Three asterisks between words do not terminate strong: OK
978.13 s
[pandoc] Three asterisks between words do not terminate stron...: OK
978.13 s
[pandoc] Six asterisks between words do not terminate strong ...: OK
978.13 s
[pandoc] Underline: OK
978.13 s
[pandoc] Superscript tag: OK
978.13 s
[pandoc] Subscript tag: OK
978.13 s
[pandoc] Strikeout tag: OK
978.13 s
[pandoc] Opening inline tags: OK
978.13 s
[pandoc] Closing inline tags: OK
978.13 s
[pandoc] Tag soup: OK
978.13 s
[pandoc] No multiparagraph inline tags: OK
978.13 s
[pandoc] Linebreak: OK
978.14 s
[pandoc] Trailing whitespace inside paragraph: OK
978.14 s
[pandoc] Non-breaking space: OK
978.14 s
[pandoc] Single ~: OK
978.14 s
[pandoc] Code markup
978.14 s
[pandoc] Code: OK
978.14 s
[pandoc] Not code: OK
978.14 s
[pandoc] Not code if closing = is detached: OK
978.14 s
[pandoc] Not code if opening = is detached: OK
978.14 s
[pandoc] Code if followed by comma: OK
978.14 s
[pandoc] Not code if followed by digit: OK
978.14 s
[pandoc] One character code: OK
978.14 s
[pandoc] Code with equal sign: OK
978.14 s
[pandoc] Three = characters is not a code: OK
978.14 s
[pandoc] Multiline code markup: OK
978.14 s
[pandoc] No multiparagraph code: OK
978.14 s
[pandoc] Code at the beginning of paragraph but not first col...: OK
978.14 s
[pandoc] Code tag: OK
978.14 s
[pandoc] Math tag: OK
978.14 s
[pandoc] Verbatim tag: OK
978.14 s
[pandoc] Verbatim inside code: OK
978.14 s
[pandoc] Verbatim tag after text: OK
978.14 s
[pandoc] Verbatim tag escapes block level markup: OK
978.14 s
[pandoc] Class tag: OK
978.14 s
[pandoc] Class tag without name: OK
978.14 s
[pandoc] RTL: OK
978.14 s
[pandoc] LTR: OK
978.14 s
[pandoc] Nested "</em>" inside em tag: OK
978.14 s
[pandoc] Links
978.14 s
[pandoc] Link without description: OK
978.14 s
[pandoc] Link with description: OK
978.14 s
[pandoc] Link with empty description: OK
978.14 s
[pandoc] Image: OK
978.15 s
[pandoc] Closing bracket is not allowed in image filename: OK
978.15 s
[pandoc] Image with description: OK
978.15 s
[pandoc] Image with space in filename: OK
978.15 s
[pandoc] Image with width: OK
978.16 s
[pandoc] At least one space is required between image filenam...: OK
978.16 s
[pandoc] Left-aligned image with width: OK
978.16 s
[pandoc] Right-aligned image with width: OK
978.17 s
[pandoc] Image link: OK
978.17 s
[pandoc] Image link with description: OK
978.17 s
[pandoc] No implicit links: OK
978.17 s
[pandoc] Link with empty URL: OK
978.17 s
[pandoc] No footnotes inside links: OK
978.18 s
[pandoc] Image inside link: OK
978.18 s
[pandoc] Link inside image description: OK
978.18 s
[pandoc] Literal
978.18 s
[pandoc] Inline literal: OK
978.18 s
[pandoc] Single inline literal in paragraph: OK
978.18 s
[pandoc] Blocks
978.18 s
[pandoc] Block elements end paragraphs: OK
978.18 s
[pandoc] Horizontal rule
978.18 s
[pandoc] Less than 4 dashes is not a horizontal rule: OK
978.18 s
[pandoc] 4 dashes is a horizontal rule: OK
978.18 s
[pandoc] 5 dashes is a horizontal rule: OK
978.18 s
[pandoc] 4 dashes with spaces is a horizontal rule: OK
978.18 s
[pandoc] Page breaks
978.18 s
[pandoc] Page break: OK
978.18 s
[pandoc] Page break with trailing space: OK
978.18 s
[pandoc] Paragraphs
978.18 s
[pandoc] Simple paragraph: OK
978.18 s
[pandoc] Indented paragraph: OK
978.18 s
[pandoc] Indentation in the middle of paragraph: OK
978.18 s
[pandoc] Quote: OK
978.18 s
[pandoc] Indentation does not indicate quote inside quote tag: OK
978.18 s
[pandoc] Multiline quote: OK
978.18 s
[pandoc] Div
978.19 s
[pandoc] Div without id: OK
978.19 s
[pandoc] Div with id: OK
978.19 s
[pandoc] Biblio: OK
978.19 s
[pandoc] Play: OK
978.19 s
[pandoc] Verse: OK
978.19 s
[pandoc] Verse in list: OK
978.19 s
[pandoc] Verse line starting with emphasis: OK
978.19 s
[pandoc] Multiline verse in list: OK
978.19 s
[pandoc] Paragraph after verse in list: OK
978.19 s
[pandoc] Empty quote tag: OK
978.19 s
[pandoc] Quote tag: OK
978.19 s
[pandoc] Nested quote tag: OK
978.19 s
[pandoc] Indented quote inside list: OK
978.19 s
[pandoc] Verse tag: OK
978.19 s
[pandoc] Verse tag with empty line inside: OK
978.19 s
[pandoc] Verse tag with verbatim close tag inside: OK
978.19 s
[pandoc] Example
978.19 s
[pandoc] Braces on separate lines: OK
978.19 s
[pandoc] Spaces after opening braces: OK
978.19 s
[pandoc] One blank line in the beginning: OK
978.19 s
[pandoc] One blank line in the end: OK
978.19 s
[pandoc] Indented braces: OK
978.19 s
[pandoc] Tabs: OK
978.19 s
[pandoc] One line: OK
978.19 s
[pandoc] Example tag
978.19 s
[pandoc] Tags on separate lines: OK
978.19 s
[pandoc] One line: OK
978.19 s
[pandoc] One blank line in the beginning: OK
978.19 s
[pandoc] One blank line in the end: OK
978.19 s
[pandoc] Example inside list: OK
978.19 s
[pandoc] Empty example inside list: OK
978.19 s
[pandoc] Example inside list with empty lines: OK
978.19 s
[pandoc] Indented example inside list: OK
978.19 s
[pandoc] Example inside definition list: OK
978.19 s
[pandoc] Example inside list definition with empty lines: OK
978.20 s
[pandoc] Example inside note: OK
978.20 s
[pandoc] Literal blocks
978.20 s
[pandoc] Literal block: OK
978.20 s
[pandoc] Center: OK
978.20 s
[pandoc] Right: OK
978.20 s
[pandoc] Comments
978.20 s
[pandoc] Comment tag: OK
978.20 s
[pandoc] Line comment: OK
978.20 s
[pandoc] Empty comment: OK
978.20 s
[pandoc] Text after empty comment: OK
978.20 s
[pandoc] Not a comment (does not start with a semicolon): OK
978.20 s
[pandoc] Not a comment (has no space after semicolon): OK
978.20 s
[pandoc] Not a comment (semicolon not in the first column): OK
978.20 s
[pandoc] Headers
978.20 s
[pandoc] Part: OK
978.20 s
[pandoc] Chapter: OK
978.20 s
[pandoc] Section: OK
978.20 s
[pandoc] Subsection: OK
978.20 s
[pandoc] Subsubsection: OK
978.20 s
[pandoc] Whitespace is required after *: OK
978.20 s
[pandoc] No headers in footnotes: OK
978.20 s
[pandoc] No headers in quotes: OK
978.20 s
[pandoc] Headers consume anchors: OK
978.20 s
[pandoc] Headers don't consume anchors separated with a blank...: OK
978.20 s
[pandoc] Headers terminate paragraph: OK
978.20 s
[pandoc] Headers terminate lists: OK
978.20 s
[pandoc] Paragraphs terminate Emacs Muse headers: OK
978.20 s
[pandoc] Paragraphs don't terminate Text::Amuse headers: OK
978.20 s
[pandoc] Empty header: OK
978.20 s
[pandoc] Auto identifiers: OK
978.20 s
[pandoc] Directives
978.20 s
[pandoc] Title: OK
978.20 s
[pandoc] Disable tables: OK
978.20 s
[pandoc] Multiple directives: OK
978.20 s
[pandoc] Multiline directive: OK
978.21 s
[pandoc] Amusewiki's #cover is translated to pandoc's #cover-...: OK
978.21 s
[pandoc] Anchors
978.21 s
[pandoc] Anchor: OK
978.21 s
[pandoc] Anchor cannot start with a number: OK
978.21 s
[pandoc] Not anchor if starts with a space: OK
978.21 s
[pandoc] Anchor inside a paragraph: OK
978.21 s
[pandoc] Anchor with "-": OK
978.21 s
[pandoc] Footnotes
978.21 s
[pandoc] Simple footnote: OK
978.21 s
[pandoc] Simple secondary footnote: OK
978.21 s
[pandoc] Missing footnote: OK
978.21 s
[pandoc] Missing secondary note: OK
978.21 s
[pandoc] Wrong note type: OK
978.21 s
[pandoc] Recursive footnote: OK
978.21 s
[pandoc] Nested footnotes: OK
978.21 s
[pandoc] No zero footnotes: OK
978.21 s
[pandoc] Footnotes can't start with zero: OK
978.21 s
[pandoc] Multiparagraph footnotes
978.22 s
[pandoc] Amusewiki multiparagraph footnotes: OK
978.22 s
[pandoc] Note continuation with verse: OK
978.22 s
[pandoc] Footnote ending in self-terminating element and foll...: OK
978.22 s
[pandoc] Footnote starting with empty line: OK
978.22 s
[pandoc] Indentation in footnote starting with empty line: OK
978.22 s
[pandoc] Emacs multiparagraph footnotes: OK
978.22 s
[pandoc] Tables
978.22 s
[pandoc] Two cell table: OK
978.22 s
[pandoc] Table with multiple words: OK
978.22 s
[pandoc] Not a table: OK
978.22 s
[pandoc] Not a table again: OK
978.22 s
[pandoc] Two line table: OK
978.22 s
[pandoc] Table with one header: OK
978.22 s
[pandoc] Table with two headers: OK
978.23 s
[pandoc] Header and footer reordering: OK
978.23 s
[pandoc] Table with caption: OK
978.23 s
[pandoc] Table caption with +: OK
978.23 s
[pandoc] Caption without table: OK
978.23 s
[pandoc] Table indented with space: OK
978.23 s
[pandoc] Empty cells: OK
978.23 s
[pandoc] Empty cell in the middle: OK
978.23 s
[pandoc] Grid table: OK
978.23 s
[pandoc] Grid table inside list: OK
978.24 s
[pandoc] Grid table with two rows: OK
978.24 s
[pandoc] Grid table inside grid table: OK
978.24 s
[pandoc] Grid table with example: OK
978.24 s
[pandoc] Lists
978.24 s
[pandoc] Bullet list: OK
978.24 s
[pandoc] Ordered list: OK
978.24 s
[pandoc] Ordered list with implicit numbers: OK
978.24 s
[pandoc] Ordered list with roman numerals: OK
978.24 s
[pandoc] Bullet list with empty items: OK
978.24 s
[pandoc] Ordered list with empty items: OK
978.24 s
[pandoc] Bullet list with last item empty: OK
978.24 s
[pandoc] Nested lists
978.25 s
[pandoc] Nested bullet list: OK
978.25 s
[pandoc] Nested ordered list: OK
978.25 s
[pandoc] Mixed nested list: OK
978.25 s
[pandoc] Text::Amuse includes only one space in list marker: OK
978.25 s
[pandoc] List continuation: OK
978.25 s
[pandoc] List continuation after nested list: OK
978.25 s
[pandoc] Blank lines
978.25 s
[pandoc] Blank lines between list items are not required: OK
978.25 s
[pandoc] One blank line between list items is allowed: OK
978.25 s
[pandoc] Two blank lines separate lists: OK
978.25 s
[pandoc] No blank line after multiline first item: OK
978.25 s
[pandoc] One blank line after multiline first item: OK
978.25 s
[pandoc] Two blank lines after multiline first item: OK
978.25 s
[pandoc] No blank line after list continuation: OK
978.25 s
[pandoc] One blank line after list continuation: OK
978.25 s
[pandoc] Two blank lines after list continuation: OK
978.26 s
[pandoc] No blank line after blockquote: OK
978.26 s
[pandoc] One blank line after blockquote: OK
978.26 s
[pandoc] Two blank lines after blockquote: OK
978.26 s
[pandoc] No blank line after verse: OK
978.26 s
[pandoc] One blank line after verse: OK
978.26 s
[pandoc] Two blank lines after verse: OK
978.26 s
[pandoc] List ending in self-terminating element and followed...: OK
978.26 s
[pandoc] Not a definition list: OK
978.26 s
[pandoc] Emacs Muse definition list: OK
978.26 s
[pandoc] Definition list: OK
978.26 s
[pandoc] Definition list term cannot include newline: OK
978.26 s
[pandoc] One-line definition list: OK
978.26 s
[pandoc] Definition list term may include single colon: OK
978.26 s
[pandoc] Definition list term with emphasis: OK
978.26 s
[pandoc] Definition list term with :: inside code: OK
978.26 s
[pandoc] Multi-line definition lists: OK
978.26 s
[pandoc] Definition list with verse: OK
978.26 s
[pandoc] Definition list with table: OK
978.27 s
[pandoc] Definition list with table inside bullet list: OK
978.27 s
[pandoc] Multi-line definition lists from Emacs Muse manual: OK
978.27 s
[pandoc] Multi-line definition lists from Emacs Muse manual w...: OK
978.27 s
[pandoc] One-line nested definition list: OK
978.27 s
[pandoc] Nested definition list: OK
978.27 s
[pandoc] Definition lists with multiple descriptions
978.27 s
[pandoc] Correctly indented second description: OK
978.27 s
[pandoc] Incorrectly indented second description: OK
978.27 s
[pandoc] Two blank lines separate definition lists: OK
978.27 s
[pandoc] No headers in list continuation: OK
978.27 s
[pandoc] Bullet list inside a tag: OK
978.27 s
[pandoc] Ordered list inside a tag: OK
978.28 s
[pandoc] Do not consume whitespace while looking for end tag: OK
978.28 s
[pandoc] Unclosed quote tag: OK
978.28 s
[pandoc] Unclosed quote tag inside list: OK
978.28 s
[pandoc] No indented closing tags: OK
978.28 s
[pandoc] Creole
978.28 s
[pandoc] Basic Text Formatting
978.28 s
[pandoc] bold, single line, fully delimited: OK
978.28 s
[pandoc] italics, single line, fully delimited: OK
978.28 s
[pandoc] bold in italics, fully delimited: OK
978.28 s
[pandoc] italics in bold, fully delimited: OK
978.28 s
[pandoc] escape bold marker: OK
978.28 s
[pandoc] escape italics marker: OK
978.28 s
[pandoc] inline nowiki, simple: OK
978.28 s
[pandoc] inline nowiki, curly braces inside: OK
978.28 s
[pandoc] placeholder: OK
978.28 s
[pandoc] placeholder escaped: OK
978.28 s
[pandoc] Headers
978.28 s
[pandoc] header level 1, no space, no trailing =: OK
978.28 s
[pandoc] header level 1, leading space, trailing =: OK
978.28 s
[pandoc] header level 2, no space, no trailing =: OK
978.28 s
[pandoc] header level 2, leading space, no trailing =: OK
978.28 s
[pandoc] header level 3, no space, no trailing =: OK
978.28 s
[pandoc] header level 3, no space, > 3 trailing =: OK
978.28 s
[pandoc] header level 4, no space, no trailing =: OK
978.28 s
[pandoc] header level 4, no space, < 4 trailing =: OK
978.28 s
[pandoc] header level 5, no space, no trailing =: OK
978.28 s
[pandoc] header level 6, no space, no trailing =: OK
978.28 s
[pandoc] Paragraphs
978.28 s
[pandoc] paragraphs: multiple, one line: OK
978.28 s
[pandoc] Lists
978.28 s
[pandoc] unordered list, two entries, one separating space: OK
978.28 s
[pandoc] unordered list, three entries, one separating space: OK
978.28 s
[pandoc] para followed by, unordered list, two entries, one s...: OK
978.29 s
[pandoc] nested unordered list, one separating space: OK
978.29 s
[pandoc] nested many unordered lists, one separating space: OK
978.29 s
[pandoc] nested unordered list, mixed separating space: OK
978.29 s
[pandoc] nested unordered list, one separating space, trailin...: OK
978.29 s
[pandoc] ordered list, two entries, one separating space: OK
978.29 s
[pandoc] ordered list, three entries, one separating space: OK
978.29 s
[pandoc] para followed by, ordered list, two entries, one sep...: OK
978.30 s
[pandoc] nested ordered list, one separating space: OK
978.30 s
[pandoc] nested ordered list, one separating space, trailing ...: OK
978.30 s
[pandoc] nested many ordered lists, one separating space: OK
978.30 s
[pandoc] nested ordered list, mixed separating space: OK
978.30 s
[pandoc] mixed nested ordered and unordered lists, one separa...: OK
978.30 s
[pandoc] NoWiki
978.30 s
[pandoc] quoted block, simple: OK
978.30 s
[pandoc] quoted block, curly bracket exception: OK
978.30 s
[pandoc] forced line breaks: OK
978.30 s
[pandoc] quoted block, after trailing white space: OK
978.30 s
[pandoc] Images and Links
978.30 s
[pandoc] image simple: OK
978.31 s
[pandoc] image with alt text: OK
978.31 s
[pandoc] auto link: OK
978.31 s
[pandoc] escaped auto link: OK
978.31 s
[pandoc] wiki link simple: OK
978.31 s
[pandoc] wiki link with name: OK
978.31 s
[pandoc] image link: OK
978.31 s
[pandoc] Table
978.31 s
[pandoc] Table with Header: OK
978.31 s
[pandoc] Table without Header: OK
978.31 s
[pandoc] Table without Header, no markers at line ends: OK
978.32 s
[pandoc] Table with Header, with formatting: OK
978.32 s
[pandoc] Man
978.32 s
[pandoc] Macros
978.32 s
[pandoc] Bold: OK
978.32 s
[pandoc] Italic: OK
978.32 s
[pandoc] BoldItalic: OK
978.32 s
[pandoc] H1: OK
978.32 s
[pandoc] H2: OK
978.32 s
[pandoc] Macro args: OK
978.32 s
[pandoc] Argument from next line: OK
978.32 s
[pandoc] comment: OK
978.32 s
[pandoc] link: OK
978.32 s
[pandoc] Escapes
978.32 s
[pandoc] fonts: OK
978.32 s
[pandoc] nested fonts: OK
978.32 s
[pandoc] nested fonts 2: OK
978.32 s
[pandoc] skip: OK
978.32 s
[pandoc] replace: OK
978.32 s
[pandoc] replace2: OK
978.32 s
[pandoc] comment with \": OK
978.32 s
[pandoc] comment with \#: OK
978.32 s
[pandoc] two letter escapes: OK
978.32 s
[pandoc] bracketed escapes: OK
978.32 s
[pandoc] unicode escapes: OK
978.32 s
[pandoc] unicode escapes (combined): OK
978.32 s
[pandoc] unknown escape (#5034): OK
978.32 s
[pandoc] Lists
978.32 s
[pandoc] bullet: OK
978.32 s
[pandoc] ordered: OK
978.32 s
[pandoc] upper: OK
978.32 s
[pandoc] nested: OK
978.32 s
[pandoc] change in list style: OK
978.32 s
[pandoc] CodeBlocks
978.32 s
[pandoc] cb1: OK
978.32 s
[pandoc] Tables
978.32 s
[pandoc] t1: OK
978.32 s
[pandoc] longcell: OK
978.32 s
[pandoc] Mdoc
978.32 s
[pandoc] one-line enclosures
978.32 s
[pandoc] Dq: OK
978.32 s
[pandoc] Sq: OK
978.32 s
[pandoc] empty: OK
978.32 s
[pandoc] nested: OK
978.33 s
[pandoc] nested with closing delimiters: OK
978.33 s
[pandoc] nested multiline enclosure: OK
978.33 s
[pandoc] with inlines: OK
978.33 s
[pandoc] with text production: OK
978.33 s
[pandoc] with Ns: OK
978.33 s
[pandoc] ending with open delimiter: OK
978.33 s
[pandoc] multiline enclosures
978.33 s
[pandoc] nested multiline: OK
978.33 s
[pandoc] nested on one line: OK
978.33 s
[pandoc] with wacky delimiters: OK
978.33 s
[pandoc] simple inlines
978.33 s
[pandoc] Sy: OK
978.33 s
[pandoc] Em: OK
978.33 s
[pandoc] Ev: OK
978.33 s
[pandoc] Ar: OK
978.33 s
[pandoc] In: OK
978.33 s
[pandoc] Mt: OK
978.33 s
[pandoc] No: OK
978.33 s
[pandoc] empty Pa with closing punctuation: OK
978.33 s
[pandoc] delimiters: OK
978.33 s
[pandoc] multiple: OK
978.33 s
[pandoc] Fl
978.33 s
[pandoc] simple: OK
978.33 s
[pandoc] multiple: OK
978.33 s
[pandoc] empty with following macro: OK
978.34 s
[pandoc] enclosed with following macro: OK
978.34 s
[pandoc] enclosed with following delimiters: OK
978.34 s
[pandoc] following Ns: OK
978.34 s
[pandoc] GNU: OK
978.34 s
[pandoc] GNU escaped: OK
978.34 s
[pandoc] GNU Fl Fl: OK
978.34 s
[pandoc] punctuation: OK
978.34 s
[pandoc] middle close paren: OK
978.34 s
[pandoc] empty with close paren: OK
978.34 s
[pandoc] empty with pipe: OK
978.34 s
[pandoc] empty with parens: OK
978.34 s
[pandoc] links
978.34 s
[pandoc] basic: OK
978.34 s
[pandoc] complicated: OK
978.34 s
[pandoc] unnamed: OK
978.34 s
[pandoc] Ns macro
978.34 s
[pandoc] at the beginning of a macro line (mandoc delta): OK
978.34 s
[pandoc] after a block closing macro: OK
978.34 s
[pandoc] in the middle of a macro line: OK
978.34 s
[pandoc] before closing punctuation: OK
978.34 s
[pandoc] after closing punctuation: OK
978.34 s
[pandoc] at the end of a macro line: OK
978.35 s
[pandoc] at the end of a partial-implicit line: OK
978.35 s
[pandoc] normal words: OK
978.35 s
[pandoc] opening punctuation: OK
978.35 s
[pandoc] closing punctuation: OK
978.35 s
[pandoc] spacing mode
978.35 s
[pandoc] all text: OK
978.35 s
[pandoc] text around macro: OK
978.35 s
[pandoc] mulitple macros: OK
978.35 s
[pandoc] mulitple control lines: OK
978.35 s
[pandoc] mixed control and text lines: OK
978.35 s
[pandoc] delimiters: OK
978.35 s
[pandoc] Ap macro
978.35 s
[pandoc] in the middle of a macro line: OK
978.35 s
[pandoc] with punctuation and called macro: OK
978.35 s
[pandoc] Pf macro
978.35 s
[pandoc] closing punctuation: OK
978.35 s
[pandoc] double punctuation: OK
978.35 s
[pandoc] opening punctuation: OK
978.35 s
[pandoc] unparsed argument: OK
978.35 s
[pandoc] text production
978.35 s
[pandoc] early NetBSD versions: OK
978.35 s
[pandoc] with Ns: OK
978.35 s
[pandoc] with punctuation: OK
978.36 s
[pandoc] with argument and punctuation: OK
978.36 s
[pandoc] BSD alone: OK
978.36 s
[pandoc] BSD with macro: OK
978.36 s
[pandoc] BSD with version: OK
978.36 s
[pandoc] BSD with variant: OK
978.36 s
[pandoc] inline punctuation
978.36 s
[pandoc] leading punctuation
978.36 s
[pandoc] open paren: OK
978.37 s
[pandoc] open square bracket: OK
978.37 s
[pandoc] pipe: OK
978.37 s
[pandoc] period: OK
978.37 s
[pandoc] comma: OK
978.37 s
[pandoc] semicolon: OK
978.37 s
[pandoc] colon: OK
978.37 s
[pandoc] question mark: OK
978.37 s
[pandoc] exclamation: OK
978.37 s
[pandoc] close paren: OK
978.37 s
[pandoc] close square bracket: OK
978.37 s
[pandoc] trailing punctuation
978.37 s
[pandoc] open paren: OK
978.37 s
[pandoc] open square bracket: OK
978.37 s
[pandoc] pipe: OK
978.37 s
[pandoc] period: OK
978.37 s
[pandoc] comma: OK
978.37 s
[pandoc] semicolon: OK
978.37 s
[pandoc] colon: OK
978.37 s
[pandoc] question mark: OK
978.37 s
[pandoc] exclamation: OK
978.37 s
[pandoc] close parens: OK
978.38 s
[pandoc] close square bracket: OK
978.38 s
[pandoc] middle punctuation
978.38 s
[pandoc] open paren: OK
978.38 s
[pandoc] open square bracket: OK
978.38 s
[pandoc] pipe: OK
978.38 s
[pandoc] period: OK
978.38 s
[pandoc] comma: OK
978.38 s
[pandoc] semicolon: OK
978.38 s
[pandoc] colon: OK
978.38 s
[pandoc] question mark: OK
978.38 s
[pandoc] exclamation: OK
978.38 s
[pandoc] close paren: OK
978.38 s
[pandoc] close square bracket: OK
978.38 s
[pandoc] FB2
978.38 s
[pandoc] Emphasis: OK
978.38 s
[pandoc] Titles: OK
978.38 s
[pandoc] Epigraph: OK
978.38 s
[pandoc] Poem: OK
978.38 s
[pandoc] Meta: OK
978.38 s
[pandoc] Notes: OK
978.38 s
[pandoc] DokuWiki
978.38 s
[pandoc] inlines
978.39 s
[pandoc] Bold: OK
978.39 s
[pandoc] Italic: OK
978.39 s
[pandoc] Underlined: OK
978.39 s
[pandoc] Monospaced: OK
978.39 s
[pandoc] Monospaced with nowiki: OK
978.39 s
[pandoc] Combined: OK
978.39 s
[pandoc] Nowiki: OK
978.39 s
[pandoc] Percent: OK
978.39 s
[pandoc] Subscript: OK
978.39 s
[pandoc] Superscript: OK
978.39 s
[pandoc] Deleted: OK
978.39 s
[pandoc] Inline code: OK
978.39 s
[pandoc] Inline file: OK
978.39 s
[pandoc] Inline HTML: OK
978.39 s
[pandoc] Inline PHP: OK
978.39 s
[pandoc] Linebreak: OK
978.39 s
[pandoc] External links
978.39 s
[pandoc] Autolink: OK
978.39 s
[pandoc] Link without description: OK
978.39 s
[pandoc] Link with description: OK
978.39 s
[pandoc] Trim whitespace around link and description: OK
978.39 s
[pandoc] Email address: OK
978.39 s
[pandoc] Internal links
978.39 s
[pandoc] Current namespace: OK
978.39 s
[pandoc] Current namespace starting with dot: OK
978.39 s
[pandoc] Current namespace starting with dot and colon: OK
978.39 s
[pandoc] Root namespace: OK
978.39 s
[pandoc] Parent namespace: OK
978.40 s
[pandoc] Parent namespace with colon: OK
978.40 s
[pandoc] Beneath the root namespace: OK
978.40 s
[pandoc] Explicitly beneath the root namespace: OK
978.40 s
[pandoc] Interwiki links
978.40 s
[pandoc] Interwiki without description: OK
978.40 s
[pandoc] Interwiki link with description: OK
978.40 s
[pandoc] Footnote: OK
978.40 s
[pandoc] Images
978.40 s
[pandoc] Image: OK
978.40 s
[pandoc] Image with caption: OK
978.40 s
[pandoc] Image with } in caption: OK
978.40 s
[pandoc] Wiki namespace starting with dot: OK
978.40 s
[pandoc] Left aligned image: OK
978.40 s
[pandoc] Right aligned image: OK
978.40 s
[pandoc] Centered image: OK
978.40 s
[pandoc] Image with width: OK
978.40 s
[pandoc] Image with width and height: OK
978.40 s
[pandoc] Linkonly: OK
978.40 s
[pandoc] Ignore ~~NOTOC~~: OK
978.40 s
[pandoc] Ignore ~~NOCACHE~~: OK
978.40 s
[pandoc] Sectioning
978.40 s
[pandoc] Headline level 1: OK
978.41 s
[pandoc] Headline level 2: OK
978.41 s
[pandoc] Headline level 3: OK
978.41 s
[pandoc] Headline level 4: OK
978.41 s
[pandoc] Headline level 5: OK
978.41 s
[pandoc] Only two closing = are required: OK
978.41 s
[pandoc] One closing = is not enough: OK
978.41 s
[pandoc] One closing = is not enough: OK
978.41 s
[pandoc] Horizontal line: OK
978.41 s
[pandoc] Lists
978.41 s
[pandoc] Unordered list: OK
978.41 s
[pandoc] Ordered list: OK
978.41 s
[pandoc] Multiline list items: OK
978.41 s
[pandoc] Block HTML: OK
978.41 s
[pandoc] Block PHP: OK
978.41 s
[pandoc] Quote: OK
978.41 s
[pandoc] Code block: OK
978.41 s
[pandoc] Java code block: OK
978.41 s
[pandoc] File with filename and no language: OK
978.41 s
[pandoc] Table: OK
978.41 s
[pandoc] Table with header: OK
978.41 s
[pandoc] Table with alignment: OK
978.42 s
[pandoc] Table with colspan: OK
978.42 s
[pandoc] Indented code block: OK
978.42 s
[pandoc] Pod
978.42 s
[pandoc] inlines
978.42 s
[pandoc] code with nested inlines: OK
978.42 s
[pandoc] compact in compact: OK
978.42 s
[pandoc] expanded in compact: OK
978.42 s
[pandoc] compact in expanded: OK
978.42 s
[pandoc] expanded in expanded: OK
978.42 s
[pandoc] links
978.42 s
[pandoc] compact
978.42 s
[pandoc] URL: OK
978.42 s
[pandoc] URL with link text: OK
978.42 s
[pandoc] perl manual: OK
978.42 s
[pandoc] manual with quoted section: OK
978.42 s
[pandoc] manual with section and formatted link text: OK
978.42 s
[pandoc] internal link: OK
978.42 s
[pandoc] internal link with formatting: OK
978.42 s
[pandoc] link with angle bracket: OK
978.42 s
[pandoc] empty name: OK
978.42 s
[pandoc] expanded
978.42 s
[pandoc] URL: OK
978.42 s
[pandoc] URL with link text: OK
978.42 s
[pandoc] perl manual: OK
978.42 s
[pandoc] manual with quoted section: OK
978.42 s
[pandoc] manual with section and formatted link text: OK
978.42 s
[pandoc] internal link: OK
978.42 s
[pandoc] internal link with formatting: OK
978.42 s
[pandoc] link with angle bracket: OK
978.42 s
[pandoc] empty name: OK
978.42 s
[pandoc] entities
978.42 s
[pandoc] required
978.42 s
[pandoc] quot: OK
978.42 s
[pandoc] amp: OK
978.42 s
[pandoc] apos: OK
978.42 s
[pandoc] lt: OK
978.42 s
[pandoc] gt: OK
978.42 s
[pandoc] sol: OK
978.42 s
[pandoc] verbar: OK
978.42 s
[pandoc] lchevron: OK
978.42 s
[pandoc] rchevron: OK
978.42 s
[pandoc] numeric
978.42 s
[pandoc] decimal: OK
978.42 s
[pandoc] octal: OK
978.42 s
[pandoc] hexadecimal: OK
978.42 s
[pandoc] hexadecimal variant: OK
978.42 s
[pandoc] actually decimal: OK
978.42 s
[pandoc] bogus
978.42 s
[pandoc] 0XA2: OK
978.42 s
[pandoc] not a real entity: OK
978.42 s
[pandoc] 162 1: OK
978.42 s
[pandoc] 99 bottles of beer: OK
978.42 s
[pandoc] 0xhh: OK
978.42 s
[pandoc] 077x: OK
978.42 s
[pandoc] 0x63 skidoo: OK
978.42 s
[pandoc]
978.43 s
[pandoc] All 3625 tests passed (46.40s)
978.49 s
[pandoc] Test suite test-pandoc: PASS
978.49 s
[pandoc] Test suite logged to: dist/test/pandoc-3.7.0.2-test-pandoc.log
978.49 s
[pandoc] 1 of 1 test suites (1 of 1 test cases) passed.
978.51 s
[pandoc] checkPhase completed in 48 seconds
978.52 s
[pandoc] Phase: haddockPhase
978.53 s
[pandoc] Phase: installPhase
978.76 s
[pandoc] Installing internal library xml-light in /nix/store/n8l5wkll8ni67c89akjwjrqpdgp51lwl-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/pandoc-3.7.0.2-8ciCt3Y0zfP5f2KwzZL8Fy-xml-light
978.84 s
[pandoc] Installing library in /nix/store/n8l5wkll8ni67c89akjwjrqpdgp51lwl-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/pandoc-3.7.0.2-Bn1GI6jrbMY2zU1Kbgbk8q
985.96 s
[pandoc] Phase: fixupPhase
985.99 s
[pandoc] shrinking RPATHs of ELF executables and libraries in /nix/store/n8l5wkll8ni67c89akjwjrqpdgp51lwl-pandoc-3.7.0.2
986.00 s
[pandoc] shrinking /nix/store/n8l5wkll8ni67c89akjwjrqpdgp51lwl-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSpandoc-3.7.0.2-Bn1GI6jrbMY2zU1Kbgbk8q-ghc9.10.3.so
986.37 s
[pandoc] shrinking /nix/store/n8l5wkll8ni67c89akjwjrqpdgp51lwl-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSpandoc-3.7.0.2-8ciCt3Y0zfP5f2KwzZL8Fy-xml-light-ghc9.10.3.so
986.39 s
[pandoc] checking for references to /build/ in /nix/store/n8l5wkll8ni67c89akjwjrqpdgp51lwl-pandoc-3.7.0.2...
986.61 s
[pandoc] patching script interpreter paths in /nix/store/n8l5wkll8ni67c89akjwjrqpdgp51lwl-pandoc-3.7.0.2
986.62 s
[pandoc] stripping (with command strip and flags -S -p) in /nix/store/n8l5wkll8ni67c89akjwjrqpdgp51lwl-pandoc-3.7.0.2/lib
991.96 s
[pandoc] shrinking RPATHs of ELF executables and libraries in /nix/store/ip65kyn7k0nk9r28v06m9yjraj86444h-pandoc-3.7.0.2-data
992.03 s
[pandoc] checking for references to /build/ in /nix/store/ip65kyn7k0nk9r28v06m9yjraj86444h-pandoc-3.7.0.2-data...
992.10 s
[pandoc] patching script interpreter paths in /nix/store/ip65kyn7k0nk9r28v06m9yjraj86444h-pandoc-3.7.0.2-data
993.17 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/ip65kyn7k0nk9r28v06m9yjraj86444h-pandoc-3.7.0.2-data /nix/store/n8l5wkll8ni67c89akjwjrqpdgp51lwl-pandoc-3.7.0.2
993.83 s
[post-build-hook] Pushing 2 paths (388 are already present) using zstd to cache sellout ⏳
993.83 s
[post-build-hook]
994.20 s
[post-build-hook] Pushing /nix/store/ip65kyn7k0nk9r28v06m9yjraj86444h-pandoc-3.7.0.2-data (918.71 KiB)
994.23 s
[post-build-hook] Pushing /nix/store/n8l5wkll8ni67c89akjwjrqpdgp51lwl-pandoc-3.7.0.2 (441.44 MiB)
999.09 s
[post-build-hook]
999.09 s
[post-build-hook] All done.
999.12 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/ip65kyn7k0nk9r28v06m9yjraj86444h-pandoc-3.7.0.2-data /nix/store/n8l5wkll8ni67c89akjwjrqpdgp51lwl-pandoc-3.7.0.2
999.16 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
999.35 s
[post-build-hook] copying 2 paths...
999.35 s
[post-build-hook] copying path '/nix/store/ip65kyn7k0nk9r28v06m9yjraj86444h-pandoc-3.7.0.2-data' to 'https://cache.nix-ci.com'...
999.67 s
[post-build-hook] copying path '/nix/store/n8l5wkll8ni67c89akjwjrqpdgp51lwl-pandoc-3.7.0.2' to 'https://cache.nix-ci.com'...
1124.56 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1124.81 s
[post-build-hook] copying 1 paths...
1124.82 s
[post-build-hook] copying path '/nix/store/bpdmgx2j78mc6p52hry8p1s76j4gdny8-pandoc-3.7.0.2.drv' to 'https://cache.nix-ci.com'...
1124.99 s
Progress: 34 of 50 built (1 building), 786 of 786 downloaded from cache
1125.13 s
Building pandoc-lua-engine
1125.23 s
Building pandoc-server
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 s
[vector]
1125.23 s
[vector] tests/Tests/Bundle.hs:76:77: warning : [ GHC-63394 ] [ -Wx-partial ]
1125.23 s
[vector] In the use of ‘head’
1125.23 s
[vector] (imported from Prelude, but defined in GHC.List):
1125.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."
1125.23 s
[vector] |
1125.23 s
[vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
1125.23 s
[vector] | ^^^^
1125.23 s
[vector]
1125.23 s
[vector] tests/Tests/Bundle.hs:92:83: warning : [ GHC-63394 ] [ -Wx-partial ]
1125.23 s
[vector] In the use of ‘tail’
1125.23 s
[vector] (imported from Prelude, but defined in GHC.List):
1125.23 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."
1125.23 s
[vector] |
1125.23 s
[vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
1125.23 s
[vector] | ^^^^
1125.23 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 )
1125.23 s
[vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
1125.23 s
[vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0..
1125.23 s
[vector] Building library 'benchmarks-O2' for vector-0.13.2.0..
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 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 )
1125.23 s
[vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
1125.23 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 )
1125.23 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 )
1125.23 s
[vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0..
1125.23 s
[vector] Building test suite 'vector-inspection' for vector-0.13.2.0..
1125.23 s
[vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
1125.23 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 )
1125.23 s
[vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
1125.23 s
[vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
1125.23 s
[vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
1125.23 s
[vector] buildPhase completed in 3 minutes 24 seconds
1125.23 s
[vector] Phase: checkPhase
1125.23 s
[vector] Running 2 test suites...
1125.23 s
[vector] Test suite vector-tests-O0: RUNNING...
1125.23 s
[vector] toplevel
1125.23 s
[vector] Data.Vector.Fusion.Bundle
1125.23 s
[vector] fromList.toList == id: OK
1125.23 s
[vector] +++ OK, passed 100 tests.
1125.23 s
[vector] toList.fromList == id: OK
1125.23 s
[vector] +++ OK, passed 100 tests.
1125.23 s
[vector] eq: OK
1125.23 s
[vector] +++ OK, passed 100 tests.
1125.23 s
[vector] length: OK
1125.23 s
[vector] +++ OK, passed 100 tests.
1125.23 s
[vector] null: OK
1125.23 s
[vector] +++ OK, passed 100 tests.
1125.23 s
[vector] empty: OK
1125.23 s
[vector] +++ OK, passed 100 tests.
1125.23 s
[vector] singleton: OK
1125.23 s
[vector] +++ OK, passed 100 tests.
1125.23 s
[vector] replicate: OK
1125.23 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] cons: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] snoc: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] append: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] head: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.24 s
[vector] last: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.24 s
[vector] index: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.24 s
[vector] extract: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] init: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.24 s
[vector] tail: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.24 s
[vector] take: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] drop: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] map: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] zipWith: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] zipWith3: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] filter: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] takeWhile: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] dropWhile: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] elem: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] notElem: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] find: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] findIndex: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] foldl: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] foldl1: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.24 s
[vector] foldl': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] foldl1': OK
1125.24 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1125.24 s
[vector] foldr: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] foldr1: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.24 s
[vector] prescanl: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] prescanl': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] postscanl: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] postscanl': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] scanl: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] scanl': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] scanl1: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.24 s
[vector] scanl1': OK
1125.24 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.24 s
[vector] concatMap: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] unfoldr: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] and: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] or: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] Tests.Vector.Boxed
1125.24 s
[vector] Bool
1125.24 s
[vector] fromList.toList == id: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] toList.fromList == id: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] unstream.stream == id: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] stream.unstream == id: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] eq: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] length: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] null: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] index: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.24 s
[vector] safeIndex: OK (0.01s)
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] head: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.24 s
[vector] last: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.24 s
[vector] unsafeIndex: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.24 s
[vector] unsafeHead: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1125.24 s
[vector] unsafeLast: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.24 s
[vector] slice: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] init: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1125.24 s
[vector] tail: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.24 s
[vector] take: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] drop: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] splitAt: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] empty: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] singleton: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] replicate: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] generate: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] iterateN: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] iterateNM: OK (0.04s)
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] generateM: OK (0.02s)
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] replicateM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] create: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] createT: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] unfoldr: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] unfoldrN: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] unfoldrExactN: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] unfoldrM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] unfoldrNM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] unfoldrExactNM: OK (0.04s)
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] constructN: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] constructrN: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] cons: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] snoc: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] append: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] concat: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] force: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] upd: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] accum: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] reverse: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] backpermute: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] map: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] imap: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] concatMap: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mapM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mapM_: OK (0.01s)
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] forM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] forM_: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] imapM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] imapM_: OK (0.01s)
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] zipWith: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] zipWith3: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] izipWith: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] izipWith3: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] izipWithM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] izipWithM_: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] zipWithM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] zipWithM_: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] filter: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] ifilter: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] filterM: OK (0.02s)
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] uniq: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mapMaybe: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] imapMaybe: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] takeWhile: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] dropWhile: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] partition: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] partitionWith: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] span: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] break: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] spanR: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] breakR: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] groupBy: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] elem: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] notElem: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] find: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] findIndex: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] findIndexR: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] findIndices: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] elemIndex: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] elemIndices: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] foldl: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] foldl1: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.24 s
[vector] foldl': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] foldl1': OK
1125.24 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1125.24 s
[vector] foldr: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] foldr1: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.24 s
[vector] foldr': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] foldr1': OK
1125.24 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.24 s
[vector] ifoldl: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] ifoldl': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] ifoldr: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] ifoldr': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] ifoldM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] ifoldM': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] ifoldM_: OK (0.01s)
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] ifoldM'_: OK (0.01s)
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] all: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] any: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] prescanl: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] prescanl': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] postscanl: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] postscanl': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] scanl: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] scanl': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] scanl1: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] scanl1': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] iscanl: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] iscanl': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] prescanr: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] prescanr': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] postscanr: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] postscanr': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] scanr: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] scanr': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] scanr1: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] scanr1': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] iscanr: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] iscanr': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_read: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.24 s
[vector] mut_write: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.24 s
[vector] mut_modify: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.24 s
[vector] mut_generate: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_generateM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_mapM_: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_imapM_: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_forM_: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_iforM_: OK (0.01s)
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_foldr: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_foldr': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_foldl: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_foldl': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_ifoldr: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_ifoldr': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_ifoldl: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_ifoldl': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_foldM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_foldM': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_foldrM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_foldrM': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_ifoldM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_ifoldM': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_ifoldrM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mut_ifoldrM': OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] compare: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] maximum: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.24 s
[vector] minimum: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.24 s
[vector] minIndex: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.24 s
[vector] maxIndex: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.24 s
[vector] maximumBy: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1125.24 s
[vector] minimumBy: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.24 s
[vector] maximumOn: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.24 s
[vector] minimumOn: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.24 s
[vector] maxIndexBy: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.24 s
[vector] minIndexBy: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.24 s
[vector] ListFirstMaxIndexWins: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.24 s
[vector] FalseListFirstMaxIndexWins: OK
1125.24 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.24 s
[vector] Exception:
1125.24 s
[vector] Prelude.foldr1: empty list
1125.24 s
[vector] CallStack (from HasCallStack):
1125.24 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.24 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.24 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.24 s
[vector] []
1125.24 s
[vector] zip: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] zip3: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] unzip: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] unzip3: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] indexed: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] update: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] concat: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mempty: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mappend: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mconcat: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] fmap: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] return: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] bind: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] mzip: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] munzip: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] applicative_pure: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] applicative_appl: OK (0.02s)
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] alternative_empty: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] alternative_or: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] sequence: OK (0.03s)
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] sequence_: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] glength: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] and: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] or: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] Int
1125.24 s
[vector] fromList.toList == id: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] toList.fromList == id: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] unstream.stream == id: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] stream.unstream == id: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] eq: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] length: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] null: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] index: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.24 s
[vector] safeIndex: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] head: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.24 s
[vector] last: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.24 s
[vector] unsafeIndex: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.24 s
[vector] unsafeHead: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1125.24 s
[vector] unsafeLast: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.24 s
[vector] slice: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] init: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.24 s
[vector] tail: OK
1125.24 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.24 s
[vector] take: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] drop: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] splitAt: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] empty: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] singleton: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] replicate: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] generate: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] iterateN: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] iterateNM: OK (0.02s)
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] generateM: OK (0.01s)
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] replicateM: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] create: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] createT: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.24 s
[vector] unfoldr: OK
1125.24 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unfoldrN: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unfoldrExactN: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unfoldrM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unfoldrNM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unfoldrExactNM: OK (0.04s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] constructN: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] constructrN: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] cons: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] snoc: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] append: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] concat: OK (0.01s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] force: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] upd: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] accum: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] reverse: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] backpermute: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] map: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] imap: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] concatMap: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mapM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mapM_: OK (0.01s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] forM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] forM_: OK (0.02s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] imapM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] imapM_: OK (0.02s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] zipWith: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] zipWith3: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] izipWith: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] izipWith3: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] izipWithM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] izipWithM_: OK (0.01s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] zipWithM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] zipWithM_: OK (0.01s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] filter: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] ifilter: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] filterM: OK (0.02s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] uniq: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mapMaybe: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] imapMaybe: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] takeWhile: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] dropWhile: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] partition: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] partitionWith: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] span: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] break: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] spanR: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] breakR: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] groupBy: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] elem: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] notElem: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] find: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] findIndex: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] findIndexR: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] findIndices: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] elemIndex: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] elemIndices: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] foldl: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] foldl1: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.25 s
[vector] foldl': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] foldl1': OK
1125.25 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.25 s
[vector] foldr: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] foldr1: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1125.25 s
[vector] foldr': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] foldr1': OK
1125.25 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.25 s
[vector] ifoldl: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] ifoldl': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] ifoldr: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] ifoldr': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] ifoldM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] ifoldM': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] ifoldM_: OK (0.02s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] ifoldM'_: OK (0.02s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] all: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] any: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] prescanl: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] prescanl': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] postscanl: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] postscanl': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] scanl: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] scanl': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] scanl1: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] scanl1': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] iscanl: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] iscanl': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] prescanr: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] prescanr': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] postscanr: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] postscanr': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] scanr: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] scanr': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] scanr1: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] scanr1': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] iscanr: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] iscanr': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_read: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.25 s
[vector] mut_write: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.25 s
[vector] mut_modify: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.25 s
[vector] mut_generate: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_generateM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_mapM_: OK (0.01s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_imapM_: OK (0.02s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_forM_: OK (0.01s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_iforM_: OK (0.01s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_foldr: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_foldr': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_foldl: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_foldl': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_ifoldr: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_ifoldr': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_ifoldl: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_ifoldl': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_foldM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_foldM': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_foldrM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_foldrM': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_ifoldM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_ifoldM': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_ifoldrM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mut_ifoldrM': OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] compare: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] maximum: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.25 s
[vector] minimum: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.25 s
[vector] minIndex: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1125.25 s
[vector] maxIndex: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.25 s
[vector] maximumBy: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.25 s
[vector] minimumBy: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.25 s
[vector] maximumOn: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.25 s
[vector] minimumOn: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.25 s
[vector] maxIndexBy: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.25 s
[vector] minIndexBy: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.25 s
[vector] ListFirstMaxIndexWins: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.25 s
[vector] FalseListFirstMaxIndexWins: OK
1125.25 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.25 s
[vector] Exception:
1125.25 s
[vector] Prelude.foldr1: empty list
1125.25 s
[vector] CallStack (from HasCallStack):
1125.25 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.25 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.25 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.25 s
[vector] []
1125.25 s
[vector] zip: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] zip3: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unzip: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unzip3: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] indexed: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] update: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] concat: OK (0.01s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mempty: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mappend: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mconcat: OK (0.01s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] fmap: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] return: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] bind: OK (0.02s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mzip: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] munzip: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] applicative_pure: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] applicative_appl: OK (0.03s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] alternative_empty: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] alternative_or: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] sequence: OK (0.03s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] sequence_: OK (0.01s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] glength: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] sum: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] product: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] enumFromN: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] enumFromThenN: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] enumFromTo: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] enumFromThenTo: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.25 s
[vector] unstream
1125.25 s
[vector] unstream == vunstream (exact): OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unstream == vunstream (unknown): OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unstreamR ~= vunstream (exact): OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unstreamR ~= vunstream (unknown): OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] Tests.Vector.Primitive
1125.25 s
[vector] Int
1125.25 s
[vector] fromList.toList == id: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] toList.fromList == id: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unstream.stream == id: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] stream.unstream == id: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] eq: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] length: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] null: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] index: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.25 s
[vector] safeIndex: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] head: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.25 s
[vector] last: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.25 s
[vector] unsafeIndex: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.25 s
[vector] unsafeHead: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.25 s
[vector] unsafeLast: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.25 s
[vector] slice: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] init: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.25 s
[vector] tail: OK
1125.25 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.25 s
[vector] take: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] drop: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] splitAt: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] empty: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] singleton: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] replicate: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] generate: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] iterateN: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] iterateNM: OK (0.02s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] generateM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] replicateM: OK (0.01s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] create: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] createT: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unfoldr: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unfoldrN: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unfoldrExactN: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unfoldrM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unfoldrNM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] unfoldrExactNM: OK (0.02s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] constructN: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] constructrN: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] cons: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] snoc: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] append: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] concat: OK (0.02s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] force: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] upd: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] accum: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] reverse: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] backpermute: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] map: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] imap: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] concatMap: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mapM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] mapM_: OK (0.02s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] forM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] forM_: OK (0.02s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] imapM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] imapM_: OK (0.02s)
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] zipWith: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] zipWith3: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] izipWith: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] izipWith3: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.25 s
[vector] izipWithM: OK
1125.25 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] izipWithM_: OK (0.01s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] zipWithM: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] zipWithM_: OK (0.01s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] filter: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] ifilter: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] filterM: OK (0.03s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] uniq: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mapMaybe: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] imapMaybe: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] takeWhile: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] dropWhile: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] partition: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] partitionWith: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] span: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] break: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] spanR: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] breakR: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] groupBy: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] elem: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] notElem: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] find: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] findIndex: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] findIndexR: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] findIndices: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] elemIndex: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] elemIndices: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] foldl: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] foldl1: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.26 s
[vector] foldl': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] foldl1': OK
1125.26 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.26 s
[vector] foldr: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] foldr1: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1125.26 s
[vector] foldr': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] foldr1': OK
1125.26 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.26 s
[vector] ifoldl: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] ifoldl': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] ifoldr: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] ifoldr': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] ifoldM: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] ifoldM': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] ifoldM_: OK (0.02s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] ifoldM'_: OK (0.02s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] all: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] any: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] prescanl: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] prescanl': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] postscanl: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] postscanl': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] scanl: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] scanl': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] scanl1: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] scanl1': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] iscanl: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] iscanl': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] prescanr: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] prescanr': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] postscanr: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] postscanr': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] scanr: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] scanr': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] scanr1: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] scanr1': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] iscanr: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] iscanr': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_read: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.26 s
[vector] mut_write: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.26 s
[vector] mut_modify: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.26 s
[vector] mut_generate: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_generateM: OK (0.01s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_mapM_: OK (0.01s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_imapM_: OK (0.02s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_forM_: OK (0.02s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_iforM_: OK (0.01s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_foldr: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_foldr': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_foldl: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_foldl': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_ifoldr: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_ifoldr': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_ifoldl: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_ifoldl': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_foldM: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_foldM': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_foldrM: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_foldrM': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_ifoldM: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_ifoldM': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_ifoldrM: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mut_ifoldrM': OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] compare: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] maximum: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.26 s
[vector] minimum: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.26 s
[vector] minIndex: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.26 s
[vector] maxIndex: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1125.26 s
[vector] maximumBy: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.26 s
[vector] minimumBy: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.26 s
[vector] maximumOn: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.26 s
[vector] minimumOn: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.26 s
[vector] maxIndexBy: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.26 s
[vector] minIndexBy: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.26 s
[vector] ListFirstMaxIndexWins: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1125.26 s
[vector] FalseListFirstMaxIndexWins: OK
1125.26 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.26 s
[vector] Exception:
1125.26 s
[vector] Prelude.foldr1: empty list
1125.26 s
[vector] CallStack (from HasCallStack):
1125.26 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.26 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.26 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.26 s
[vector] []
1125.26 s
[vector] mempty: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mappend: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mconcat: OK (0.02s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] glength: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] sum: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] product: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] enumFromN: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] enumFromThenN: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] enumFromTo: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] enumFromThenTo: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.26 s
[vector] Double
1125.26 s
[vector] fromList.toList == id: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] toList.fromList == id: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] unstream.stream == id: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] stream.unstream == id: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] eq: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] length: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] null: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] index: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.26 s
[vector] safeIndex: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] head: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.26 s
[vector] last: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.26 s
[vector] unsafeIndex: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.26 s
[vector] unsafeHead: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.26 s
[vector] unsafeLast: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.26 s
[vector] slice: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] init: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.26 s
[vector] tail: OK
1125.26 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.26 s
[vector] take: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] drop: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] splitAt: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] empty: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] singleton: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] replicate: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] generate: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] iterateN: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] iterateNM: OK (0.01s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] generateM: OK (0.03s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] replicateM: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] create: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] createT: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] unfoldr: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] unfoldrN: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] unfoldrExactN: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] unfoldrM: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] unfoldrNM: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] unfoldrExactNM: OK (0.03s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] constructN: OK (0.01s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] constructrN: OK (0.01s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] cons: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] snoc: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] append: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] concat: OK (0.02s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] force: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] upd: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] accum: OK (0.01s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] reverse: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] backpermute: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] map: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] imap: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] concatMap: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mapM: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mapM_: OK (0.03s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] forM: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] forM_: OK (0.04s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] imapM: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] imapM_: OK (0.04s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] zipWith: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] zipWith3: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] izipWith: OK (0.01s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] izipWith3: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] izipWithM: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] izipWithM_: OK (0.03s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] zipWithM: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] zipWithM_: OK (0.02s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] filter: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] ifilter: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] filterM: OK (0.04s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] uniq: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] mapMaybe: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] imapMaybe: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] takeWhile: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] dropWhile: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] partition: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] partitionWith: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] span: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] break: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] spanR: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] breakR: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] groupBy: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] elem: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] notElem: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] find: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] findIndex: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] findIndexR: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] findIndices: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] elemIndex: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] elemIndices: OK
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] foldl: OK (0.01s)
1125.26 s
[vector] +++ OK, passed 100 tests.
1125.26 s
[vector] foldl1: OK (0.01s)
1125.26 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.26 s
[vector] foldl': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] foldl1': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.27 s
[vector] foldr: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] foldr1: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.27 s
[vector] foldr': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] foldr1': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.27 s
[vector] ifoldl: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifoldl': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifoldr: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifoldr': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifoldM: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifoldM': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifoldM_: OK (0.04s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifoldM'_: OK (0.02s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] all: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] any: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] prescanl: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] prescanl': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] postscanl: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] postscanl': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanl: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanl': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanl1: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanl1': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] iscanl: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] iscanl': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] prescanr: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] prescanr': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] postscanr: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] postscanr': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanr: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanr': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanr1: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanr1': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] iscanr: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] iscanr': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_read: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.27 s
[vector] mut_write: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1125.27 s
[vector] mut_modify: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.27 s
[vector] mut_generate: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_generateM: OK (0.02s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_mapM_: OK (0.03s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_imapM_: OK (0.03s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_forM_: OK (0.03s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_iforM_: OK (0.04s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_foldr: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_foldr': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_foldl: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_foldl': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_ifoldr: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_ifoldr': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_ifoldl: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_ifoldl': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_foldM: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_foldM': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_foldrM: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_foldrM': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_ifoldM: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_ifoldM': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_ifoldrM: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_ifoldrM': OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] compare: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] maximum: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.27 s
[vector] minimum: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.27 s
[vector] minIndex: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.27 s
[vector] maxIndex: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.27 s
[vector] maximumBy: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.27 s
[vector] minimumBy: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.27 s
[vector] maximumOn: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.27 s
[vector] minimumOn: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.27 s
[vector] maxIndexBy: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.27 s
[vector] minIndexBy: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.27 s
[vector] ListFirstMaxIndexWins: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.27 s
[vector] FalseListFirstMaxIndexWins: OK
1125.27 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.27 s
[vector] Exception:
1125.27 s
[vector] Prelude.foldr1: empty list
1125.27 s
[vector] CallStack (from HasCallStack):
1125.27 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.27 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.27 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.27 s
[vector] []
1125.27 s
[vector] mempty: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mappend: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mconcat: OK (0.02s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] glength: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] sum: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] product: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] enumFromN: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] enumFromThenN: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] enumFromTo: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] enumFromThenTo: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 2 discarded.
1125.27 s
[vector] unstream
1125.27 s
[vector] unstream == vunstream (exact): OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] unstream == vunstream (unknown): OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] unstreamR ~= vunstream (exact): OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] unstreamR ~= vunstream (unknown): OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] Tests.Vector.Storable
1125.27 s
[vector] Data.Vector.Storable.Vector (Int)
1125.27 s
[vector] fromList.toList == id: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] toList.fromList == id: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] unstream.stream == id: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] stream.unstream == id: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] eq: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] length: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] null: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] index: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.27 s
[vector] safeIndex: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] head: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.27 s
[vector] last: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.27 s
[vector] unsafeIndex: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.27 s
[vector] unsafeHead: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.27 s
[vector] unsafeLast: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.27 s
[vector] slice: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] init: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.27 s
[vector] tail: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.27 s
[vector] take: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] drop: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] splitAt: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] empty: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] singleton: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] replicate: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] generate: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] iterateN: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] iterateNM: OK (0.04s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] generateM: OK (0.02s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] replicateM: OK (0.02s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] create: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] createT: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] unfoldr: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] unfoldrN: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] unfoldrExactN: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] unfoldrM: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] unfoldrNM: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] unfoldrExactNM: OK (0.04s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] constructN: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] constructrN: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] cons: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] snoc: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] append: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] concat: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] force: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] upd: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] accum: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] reverse: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] backpermute: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] map: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] imap: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] concatMap: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mapM: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mapM_: OK (0.02s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] forM: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] forM_: OK (0.02s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] imapM: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] imapM_: OK (0.02s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] zipWith: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] zipWith3: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] izipWith: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] izipWith3: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] izipWithM: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] izipWithM_: OK (0.01s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] zipWithM: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] zipWithM_: OK (0.02s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] filter: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifilter: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] filterM: OK (0.02s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] uniq: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mapMaybe: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] imapMaybe: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] takeWhile: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] dropWhile: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] partition: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] partitionWith: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] span: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] break: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] spanR: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] breakR: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] groupBy: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] elem: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] notElem: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] find: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] findIndex: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] findIndexR: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] findIndices: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] elemIndex: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] elemIndices: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] foldl: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] foldl1: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.27 s
[vector] foldl': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] foldl1': OK
1125.27 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.27 s
[vector] foldr: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] foldr1: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1125.27 s
[vector] foldr': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] foldr1': OK
1125.27 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.27 s
[vector] ifoldl: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifoldl': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifoldr: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifoldr': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifoldM: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifoldM': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifoldM_: OK (0.02s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] ifoldM'_: OK (0.02s)
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] all: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] any: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] prescanl: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] prescanl': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] postscanl: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] postscanl': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanl: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanl': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanl1: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanl1': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] iscanl: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] iscanl': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] prescanr: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] prescanr': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] postscanr: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] postscanr': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanr: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanr': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanr1: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] scanr1': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] iscanr: OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] iscanr': OK
1125.27 s
[vector] +++ OK, passed 100 tests.
1125.27 s
[vector] mut_read: OK
1125.27 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.27 s
[vector] mut_write: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.28 s
[vector] mut_modify: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.28 s
[vector] mut_generate: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_generateM: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_mapM_: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_imapM_: OK (0.02s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_forM_: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_iforM_: OK (0.02s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldr: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldr': OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldl: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldl': OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldr: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldr': OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldl: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldl': OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldM: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldM': OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldrM: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldrM': OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldM: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldM': OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldrM: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldrM': OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] compare: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] maximum: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1125.28 s
[vector] minimum: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1125.28 s
[vector] minIndex: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.28 s
[vector] maxIndex: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1125.28 s
[vector] maximumBy: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.28 s
[vector] minimumBy: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.28 s
[vector] maximumOn: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.28 s
[vector] minimumOn: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.28 s
[vector] maxIndexBy: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1125.28 s
[vector] minIndexBy: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.28 s
[vector] ListFirstMaxIndexWins: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1125.28 s
[vector] FalseListFirstMaxIndexWins: OK
1125.28 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.28 s
[vector] Exception:
1125.28 s
[vector] Prelude.foldr1: empty list
1125.28 s
[vector] CallStack (from HasCallStack):
1125.28 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.28 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.28 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.28 s
[vector] []
1125.28 s
[vector] mempty: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mappend: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mconcat: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] glength: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] sum: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] product: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] enumFromN: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] enumFromThenN: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] enumFromTo: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] enumFromThenTo: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.28 s
[vector] Data.Vector.Storable.Vector (Double)
1125.28 s
[vector] fromList.toList == id: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] toList.fromList == id: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] unstream.stream == id: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] stream.unstream == id: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] eq: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] length: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] null: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] index: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.28 s
[vector] safeIndex: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] head: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.28 s
[vector] last: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.28 s
[vector] unsafeIndex: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.28 s
[vector] unsafeHead: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.28 s
[vector] unsafeLast: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.28 s
[vector] slice: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] init: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.28 s
[vector] tail: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.28 s
[vector] take: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] drop: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] splitAt: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] empty: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] singleton: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] replicate: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] generate: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] iterateN: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] iterateNM: OK (0.03s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] generateM: OK (0.03s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] replicateM: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] create: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] createT: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] unfoldr: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] unfoldrN: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] unfoldrExactN: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] unfoldrM: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] unfoldrNM: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] unfoldrExactNM: OK (0.04s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] constructN: OK (0.03s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] constructrN: OK (0.02s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] cons: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] snoc: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] append: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] concat: OK (0.03s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] force: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] upd: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] accum: OK (0.02s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] reverse: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] backpermute: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] map: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] imap: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] concatMap: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mapM: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mapM_: OK (0.03s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] forM: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] forM_: OK (0.04s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] imapM: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] imapM_: OK (0.04s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] zipWith: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] zipWith3: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] izipWith: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] izipWith3: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] izipWithM: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] izipWithM_: OK (0.03s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] zipWithM: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] zipWithM_: OK (0.03s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] filter: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] ifilter: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] filterM: OK (0.04s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] uniq: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mapMaybe: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] imapMaybe: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] takeWhile: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] dropWhile: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] partition: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] partitionWith: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] span: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] break: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] spanR: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] breakR: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] groupBy: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] elem: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] notElem: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] find: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] findIndex: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] findIndexR: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] findIndices: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] elemIndex: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] elemIndices: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] foldl: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] foldl1: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.28 s
[vector] foldl': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] foldl1': OK
1125.28 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.28 s
[vector] foldr: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] foldr1: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.28 s
[vector] foldr': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] foldr1': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.28 s
[vector] ifoldl: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] ifoldl': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] ifoldr: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] ifoldr': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] ifoldM: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] ifoldM': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] ifoldM_: OK (0.04s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] ifoldM'_: OK (0.04s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] all: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] any: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] prescanl: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] prescanl': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] postscanl: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] postscanl': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] scanl: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] scanl': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] scanl1: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] scanl1': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] iscanl: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] iscanl': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] prescanr: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] prescanr': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] postscanr: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] postscanr': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] scanr: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] scanr': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] scanr1: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] scanr1': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] iscanr: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] iscanr': OK (0.02s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_read: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.28 s
[vector] mut_write: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.28 s
[vector] mut_modify: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.28 s
[vector] mut_generate: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_generateM: OK (0.02s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_mapM_: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_imapM_: OK (0.04s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_forM_: OK (0.03s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_iforM_: OK (0.04s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldr: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldr': OK (0.02s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldl: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldl': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldr: OK (0.02s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldr': OK (0.02s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldl: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldl': OK (0.02s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldM: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldM': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldrM: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_foldrM': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldM: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldM': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldrM: OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] mut_ifoldrM': OK (0.01s)
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] compare: OK
1125.28 s
[vector] +++ OK, passed 100 tests.
1125.28 s
[vector] maximum: OK
1125.28 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.29 s
[vector] minimum: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.29 s
[vector] minIndex: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.29 s
[vector] maxIndex: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.29 s
[vector] maximumBy: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.29 s
[vector] minimumBy: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.29 s
[vector] maximumOn: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1125.29 s
[vector] minimumOn: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 25 discarded.
1125.29 s
[vector] maxIndexBy: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.29 s
[vector] minIndexBy: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.29 s
[vector] ListFirstMaxIndexWins: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.29 s
[vector] FalseListFirstMaxIndexWins: OK
1125.29 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.29 s
[vector] Exception:
1125.29 s
[vector] Prelude.foldr1: empty list
1125.29 s
[vector] CallStack (from HasCallStack):
1125.29 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.29 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.29 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.29 s
[vector] []
1125.29 s
[vector] mempty: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mappend: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mconcat: OK (0.02s)
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] glength: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] sum: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] product: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] enumFromN: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] enumFromThenN: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] enumFromTo: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] enumFromThenTo: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 4 discarded.
1125.29 s
[vector] unstream
1125.29 s
[vector] unstream == vunstream (exact): OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] unstream == vunstream (unknown): OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] unstreamR ~= vunstream (exact): OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] unstreamR ~= vunstream (unknown): OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] Tests.Vector.Strict
1125.29 s
[vector] Bool
1125.29 s
[vector] fromList.toList == id: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] toList.fromList == id: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] unstream.stream == id: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] stream.unstream == id: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] eq: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] length: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] null: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] index: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.29 s
[vector] safeIndex: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] head: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.29 s
[vector] last: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.29 s
[vector] unsafeIndex: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.29 s
[vector] unsafeHead: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.29 s
[vector] unsafeLast: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.29 s
[vector] slice: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] init: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.29 s
[vector] tail: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.29 s
[vector] take: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] drop: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] splitAt: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] empty: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] singleton: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] replicate: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] generate: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] iterateN: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] iterateNM: OK (0.02s)
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] generateM: OK (0.01s)
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] replicateM: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] create: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] createT: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] unfoldr: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] unfoldrN: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] unfoldrExactN: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] unfoldrM: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] unfoldrNM: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] unfoldrExactNM: OK (0.05s)
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] constructN: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] constructrN: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] cons: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] snoc: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] append: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] concat: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] force: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] upd: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] accum: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] reverse: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] backpermute: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] map: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] imap: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] concatMap: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mapM: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mapM_: OK (0.01s)
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] forM: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] forM_: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] imapM: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] imapM_: OK (0.01s)
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] zipWith: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] zipWith3: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] izipWith: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] izipWith3: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] izipWithM: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] izipWithM_: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] zipWithM: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] zipWithM_: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] filter: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] ifilter: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] filterM: OK (0.02s)
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] uniq: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mapMaybe: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] imapMaybe: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] takeWhile: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] dropWhile: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] partition: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] partitionWith: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] span: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] break: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] spanR: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] breakR: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] groupBy: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] elem: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] notElem: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] find: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] findIndex: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] findIndexR: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] findIndices: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] elemIndex: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] elemIndices: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] foldl: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] foldl1: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.29 s
[vector] foldl': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] foldl1': OK
1125.29 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.29 s
[vector] foldr: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] foldr1: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.29 s
[vector] foldr': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] foldr1': OK
1125.29 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.29 s
[vector] ifoldl: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] ifoldl': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] ifoldr: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] ifoldr': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] ifoldM: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] ifoldM': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] ifoldM_: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] ifoldM'_: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] all: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] any: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] prescanl: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] prescanl': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] postscanl: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] postscanl': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] scanl: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] scanl': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] scanl1: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] scanl1': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] iscanl: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] iscanl': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] prescanr: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] prescanr': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] postscanr: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] postscanr': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] scanr: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] scanr': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] scanr1: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] scanr1': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] iscanr: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] iscanr': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_read: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.29 s
[vector] mut_write: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.29 s
[vector] mut_modify: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.29 s
[vector] mut_generate: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_generateM: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_mapM_: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_imapM_: OK (0.01s)
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_forM_: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_iforM_: OK (0.01s)
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_foldr: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_foldr': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_foldl: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_foldl': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_ifoldr: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_ifoldr': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_ifoldl: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_ifoldl': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_foldM: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_foldM': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_foldrM: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_foldrM': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_ifoldM: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_ifoldM': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_ifoldrM: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mut_ifoldrM': OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] compare: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] maximum: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.29 s
[vector] minimum: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.29 s
[vector] minIndex: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.29 s
[vector] maxIndex: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.29 s
[vector] maximumBy: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.29 s
[vector] minimumBy: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.29 s
[vector] maximumOn: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.29 s
[vector] minimumOn: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.29 s
[vector] maxIndexBy: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.29 s
[vector] minIndexBy: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.29 s
[vector] ListFirstMaxIndexWins: OK
1125.29 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.29 s
[vector] FalseListFirstMaxIndexWins: OK
1125.29 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.29 s
[vector] Exception:
1125.29 s
[vector] Prelude.foldr1: empty list
1125.29 s
[vector] CallStack (from HasCallStack):
1125.29 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.29 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.29 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.29 s
[vector] []
1125.29 s
[vector] zip: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] zip3: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] unzip: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] unzip3: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] indexed: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] update: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] concat: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mempty: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mappend: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mconcat: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] fmap: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] return: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] bind: OK (0.01s)
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] mzip: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] munzip: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] applicative_pure: OK
1125.29 s
[vector] +++ OK, passed 100 tests.
1125.29 s
[vector] applicative_appl: OK (0.02s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] alternative_empty: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] alternative_or: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] sequence: OK (0.01s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] sequence_: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] glength: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] and: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] or: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] Int
1125.30 s
[vector] fromList.toList == id: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] toList.fromList == id: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unstream.stream == id: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] stream.unstream == id: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] eq: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] length: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] null: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] index: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.30 s
[vector] safeIndex: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] head: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.30 s
[vector] last: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.30 s
[vector] unsafeIndex: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.30 s
[vector] unsafeHead: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.30 s
[vector] unsafeLast: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1125.30 s
[vector] slice: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] init: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.30 s
[vector] tail: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1125.30 s
[vector] take: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] drop: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] splitAt: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] empty: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] singleton: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] replicate: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] generate: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] iterateN: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] iterateNM: OK (0.05s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] generateM: OK (0.02s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] replicateM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] create: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] createT: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unfoldr: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unfoldrN: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unfoldrExactN: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unfoldrM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unfoldrNM: OK (0.02s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unfoldrExactNM: OK (0.05s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] constructN: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] constructrN: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] cons: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] snoc: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] append: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] concat: OK (0.01s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] force: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] upd: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] accum: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] reverse: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] backpermute: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] map: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] imap: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] concatMap: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mapM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mapM_: OK (0.02s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] forM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] forM_: OK (0.02s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] imapM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] imapM_: OK (0.02s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] zipWith: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] zipWith3: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] izipWith: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] izipWith3: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] izipWithM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] izipWithM_: OK (0.01s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] zipWithM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] zipWithM_: OK (0.01s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] filter: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] ifilter: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] filterM: OK (0.03s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] uniq: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mapMaybe: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] imapMaybe: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] takeWhile: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] dropWhile: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] partition: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] partitionWith: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] span: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] break: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] spanR: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] breakR: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] groupBy: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] elem: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] notElem: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] find: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] findIndex: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] findIndexR: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] findIndices: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] elemIndex: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] elemIndices: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] foldl: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] foldl1: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.30 s
[vector] foldl': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] foldl1': OK
1125.30 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.30 s
[vector] foldr: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] foldr1: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.30 s
[vector] foldr': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] foldr1': OK
1125.30 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.30 s
[vector] ifoldl: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] ifoldl': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] ifoldr: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] ifoldr': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] ifoldM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] ifoldM': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] ifoldM_: OK (0.02s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] ifoldM'_: OK (0.02s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] all: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] any: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] prescanl: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] prescanl': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] postscanl: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] postscanl': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] scanl: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] scanl': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] scanl1: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] scanl1': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] iscanl: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] iscanl': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] prescanr: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] prescanr': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] postscanr: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] postscanr': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] scanr: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] scanr': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] scanr1: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] scanr1': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] iscanr: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] iscanr': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_read: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.30 s
[vector] mut_write: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 26 discarded.
1125.30 s
[vector] mut_modify: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 27 discarded.
1125.30 s
[vector] mut_generate: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_generateM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_mapM_: OK (0.01s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_imapM_: OK (0.02s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_forM_: OK (0.02s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_iforM_: OK (0.02s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_foldr: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_foldr': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_foldl: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_foldl': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_ifoldr: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_ifoldr': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_ifoldl: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_ifoldl': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_foldM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_foldM': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_foldrM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_foldrM': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_ifoldM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_ifoldM': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_ifoldrM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mut_ifoldrM': OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] compare: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] maximum: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.30 s
[vector] minimum: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.30 s
[vector] minIndex: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 25 discarded.
1125.30 s
[vector] maxIndex: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.30 s
[vector] maximumBy: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.30 s
[vector] minimumBy: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.30 s
[vector] maximumOn: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.30 s
[vector] minimumOn: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.30 s
[vector] maxIndexBy: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.30 s
[vector] minIndexBy: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1125.30 s
[vector] ListFirstMaxIndexWins: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1125.30 s
[vector] FalseListFirstMaxIndexWins: OK
1125.30 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.30 s
[vector] Exception:
1125.30 s
[vector] Prelude.foldr1: empty list
1125.30 s
[vector] CallStack (from HasCallStack):
1125.30 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.30 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.30 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.30 s
[vector] []
1125.30 s
[vector] zip: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] zip3: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unzip: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unzip3: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] indexed: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] update: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] concat: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mempty: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mappend: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mconcat: OK (0.01s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] fmap: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] return: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] bind: OK (0.02s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mzip: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] munzip: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] applicative_pure: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] applicative_appl: OK (0.04s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] alternative_empty: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] alternative_or: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] sequence: OK (0.03s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] sequence_: OK (0.01s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] glength: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] sum: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] product: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] enumFromN: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] enumFromThenN: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] enumFromTo: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] enumFromThenTo: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.30 s
[vector] unstream
1125.30 s
[vector] unstream == vunstream (exact): OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unstream == vunstream (unknown): OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unstreamR ~= vunstream (exact): OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unstreamR ~= vunstream (unknown): OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] Tests.Vector.Unboxed
1125.30 s
[vector] ()
1125.30 s
[vector] fromList.toList == id: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] toList.fromList == id: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unstream.stream == id: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] stream.unstream == id: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] eq: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] length: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] null: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] index: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.30 s
[vector] safeIndex: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] head: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.30 s
[vector] last: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.30 s
[vector] unsafeIndex: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.30 s
[vector] unsafeHead: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.30 s
[vector] unsafeLast: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.30 s
[vector] slice: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] init: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1125.30 s
[vector] tail: OK
1125.30 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.30 s
[vector] take: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] drop: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] splitAt: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] empty: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] singleton: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] replicate: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] generate: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] iterateN: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] iterateNM: OK (0.03s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] generateM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] replicateM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] create: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] createT: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unfoldr: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unfoldrN: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unfoldrExactN: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unfoldrM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unfoldrNM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] unfoldrExactNM: OK (0.04s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] constructN: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] constructrN: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] cons: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] snoc: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] append: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] concat: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] force: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] upd: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] accum: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] reverse: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] backpermute: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] map: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] imap: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] concatMap: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mapM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mapM_: OK (0.01s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] forM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] forM_: OK (0.01s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] imapM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] imapM_: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] zipWith: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] zipWith3: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] izipWith: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] izipWith3: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] izipWithM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] izipWithM_: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] zipWithM: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] zipWithM_: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] filter: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] ifilter: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] filterM: OK (0.02s)
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] uniq: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] mapMaybe: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] imapMaybe: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] takeWhile: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] dropWhile: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.30 s
[vector] partition: OK
1125.30 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] partitionWith: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] span: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] break: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] spanR: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] breakR: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] groupBy: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] elem: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] notElem: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] find: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] findIndex: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] findIndexR: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] findIndices: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] elemIndex: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] elemIndices: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] foldl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] foldl1: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.31 s
[vector] foldl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] foldl1': OK
1125.31 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.31 s
[vector] foldr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] foldr1: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.31 s
[vector] foldr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] foldr1': OK
1125.31 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.31 s
[vector] ifoldl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifoldl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifoldr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifoldr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifoldM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifoldM': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifoldM_: OK (0.01s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifoldM'_: OK (0.01s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] all: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] any: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] prescanl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] prescanl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] postscanl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] postscanl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanl1: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanl1': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] iscanl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] iscanl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] prescanr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] prescanr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] postscanr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] postscanr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanr1: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanr1': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] iscanr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] iscanr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_read: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.31 s
[vector] mut_write: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.31 s
[vector] mut_modify: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.31 s
[vector] mut_generate: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_generateM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_mapM_: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_imapM_: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_forM_: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_iforM_: OK (0.01s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldM': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldrM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldrM': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldM': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldrM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldrM': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] compare: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] maximum: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.31 s
[vector] minimum: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.31 s
[vector] minIndex: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.31 s
[vector] maxIndex: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.31 s
[vector] maximumBy: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.31 s
[vector] minimumBy: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.31 s
[vector] maximumOn: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.31 s
[vector] minimumOn: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.31 s
[vector] maxIndexBy: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1125.31 s
[vector] minIndexBy: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1125.31 s
[vector] ListFirstMaxIndexWins: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.31 s
[vector] FalseListFirstMaxIndexWins: OK
1125.31 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.31 s
[vector] Exception:
1125.31 s
[vector] Prelude.foldr1: empty list
1125.31 s
[vector] CallStack (from HasCallStack):
1125.31 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.31 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.31 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.31 s
[vector] []
1125.31 s
[vector] zip: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] zip3: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] unzip: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] unzip3: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] indexed: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] update: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mempty: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mappend: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mconcat: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] glength: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] (Bool)
1125.31 s
[vector] fromList.toList == id: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] toList.fromList == id: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] unstream.stream == id: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] stream.unstream == id: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] eq: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] length: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] null: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] index: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.31 s
[vector] safeIndex: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] head: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.31 s
[vector] last: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.31 s
[vector] unsafeIndex: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.31 s
[vector] unsafeHead: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1125.31 s
[vector] unsafeLast: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.31 s
[vector] slice: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] init: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.31 s
[vector] tail: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.31 s
[vector] take: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] drop: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] splitAt: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] empty: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] singleton: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] replicate: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] generate: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] iterateN: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] iterateNM: OK (0.02s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] generateM: OK (0.01s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] replicateM: OK (0.01s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] create: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] createT: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] unfoldr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] unfoldrN: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] unfoldrExactN: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] unfoldrM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] unfoldrNM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] unfoldrExactNM: OK (0.05s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] constructN: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] constructrN: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] cons: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] snoc: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] append: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] concat: OK (0.01s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] force: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] upd: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] accum: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] reverse: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] backpermute: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] map: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] imap: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] concatMap: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mapM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mapM_: OK (0.01s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] forM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] forM_: OK (0.01s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] imapM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] imapM_: OK (0.01s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] zipWith: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] zipWith3: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] izipWith: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] izipWith3: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] izipWithM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] izipWithM_: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] zipWithM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] zipWithM_: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] filter: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifilter: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] filterM: OK (0.02s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] uniq: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mapMaybe: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] imapMaybe: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] takeWhile: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] dropWhile: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] partition: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] partitionWith: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] span: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] break: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] spanR: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] breakR: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] groupBy: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] elem: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] notElem: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] find: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] findIndex: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] findIndexR: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] findIndices: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] elemIndex: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] elemIndices: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] foldl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] foldl1: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.31 s
[vector] foldl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] foldl1': OK
1125.31 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.31 s
[vector] foldr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] foldr1: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.31 s
[vector] foldr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] foldr1': OK
1125.31 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.31 s
[vector] ifoldl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifoldl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifoldr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifoldr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifoldM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifoldM': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifoldM_: OK (0.01s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] ifoldM'_: OK (0.01s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] all: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] any: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] prescanl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] prescanl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] postscanl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] postscanl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanl1: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanl1': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] iscanl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] iscanl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] prescanr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] prescanr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] postscanr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] postscanr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanr1: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] scanr1': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] iscanr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] iscanr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_read: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.31 s
[vector] mut_write: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.31 s
[vector] mut_modify: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.31 s
[vector] mut_generate: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_generateM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_mapM_: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_imapM_: OK (0.01s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_forM_: OK (0.01s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_iforM_: OK (0.01s)
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldr: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldr': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldl: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldl': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldM': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldrM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_foldrM': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldM': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldrM: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] mut_ifoldrM': OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] compare: OK
1125.31 s
[vector] +++ OK, passed 100 tests.
1125.31 s
[vector] maximum: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.31 s
[vector] minimum: OK
1125.31 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.32 s
[vector] minIndex: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1125.32 s
[vector] maxIndex: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.32 s
[vector] maximumBy: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.32 s
[vector] minimumBy: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.32 s
[vector] maximumOn: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.32 s
[vector] minimumOn: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.32 s
[vector] maxIndexBy: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.32 s
[vector] minIndexBy: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.32 s
[vector] ListFirstMaxIndexWins: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.32 s
[vector] FalseListFirstMaxIndexWins: OK
1125.32 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.32 s
[vector] Exception:
1125.32 s
[vector] Prelude.foldr1: empty list
1125.32 s
[vector] CallStack (from HasCallStack):
1125.32 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.32 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.32 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.32 s
[vector] []
1125.32 s
[vector] zip: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] zip3: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unzip: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unzip3: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] indexed: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] update: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mempty: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mappend: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mconcat: OK (0.01s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] glength: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] and: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] or: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] (Int)
1125.32 s
[vector] fromList.toList == id: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] toList.fromList == id: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unstream.stream == id: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] stream.unstream == id: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] eq: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] length: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] null: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] index: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.32 s
[vector] safeIndex: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] head: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.32 s
[vector] last: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.32 s
[vector] unsafeIndex: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.32 s
[vector] unsafeHead: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.32 s
[vector] unsafeLast: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.32 s
[vector] slice: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] init: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.32 s
[vector] tail: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.32 s
[vector] take: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] drop: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] splitAt: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] empty: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] singleton: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] replicate: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] generate: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] iterateN: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] iterateNM: OK (0.04s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] generateM: OK (0.03s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] replicateM: OK (0.01s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] create: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] createT: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unfoldr: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unfoldrN: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unfoldrExactN: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unfoldrM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unfoldrNM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unfoldrExactNM: OK (0.03s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] constructN: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] constructrN: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] cons: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] snoc: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] append: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] concat: OK (0.02s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] force: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] upd: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] accum: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] reverse: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] backpermute: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] map: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] imap: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] concatMap: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mapM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mapM_: OK (0.02s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] forM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] forM_: OK (0.02s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] imapM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] imapM_: OK (0.02s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] zipWith: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] zipWith3: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] izipWith: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] izipWith3: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] izipWithM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] izipWithM_: OK (0.01s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] zipWithM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] zipWithM_: OK (0.01s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] filter: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] ifilter: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] filterM: OK (0.04s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] uniq: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mapMaybe: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] imapMaybe: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] takeWhile: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] dropWhile: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] partition: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] partitionWith: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] span: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] break: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] spanR: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] breakR: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] groupBy: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] elem: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] notElem: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] find: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] findIndex: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] findIndexR: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] findIndices: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] elemIndex: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] elemIndices: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] foldl: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] foldl1: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.32 s
[vector] foldl': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] foldl1': OK
1125.32 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.32 s
[vector] foldr: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] foldr1: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.32 s
[vector] foldr': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] foldr1': OK
1125.32 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.32 s
[vector] ifoldl: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] ifoldl': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] ifoldr: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] ifoldr': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] ifoldM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] ifoldM': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] ifoldM_: OK (0.02s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] ifoldM'_: OK (0.02s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] all: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] any: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] prescanl: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] prescanl': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] postscanl: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] postscanl': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] scanl: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] scanl': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] scanl1: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] scanl1': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] iscanl: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] iscanl': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] prescanr: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] prescanr': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] postscanr: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] postscanr': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] scanr: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] scanr': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] scanr1: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] scanr1': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] iscanr: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] iscanr': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_read: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.32 s
[vector] mut_write: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.32 s
[vector] mut_modify: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.32 s
[vector] mut_generate: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_generateM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_mapM_: OK (0.02s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_imapM_: OK (0.02s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_forM_: OK (0.02s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_iforM_: OK (0.02s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_foldr: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_foldr': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_foldl: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_foldl': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_ifoldr: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_ifoldr': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_ifoldl: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_ifoldl': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_foldM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_foldM': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_foldrM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_foldrM': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_ifoldM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_ifoldM': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_ifoldrM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mut_ifoldrM': OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] compare: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] maximum: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.32 s
[vector] minimum: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.32 s
[vector] minIndex: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.32 s
[vector] maxIndex: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.32 s
[vector] maximumBy: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.32 s
[vector] minimumBy: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.32 s
[vector] maximumOn: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.32 s
[vector] minimumOn: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.32 s
[vector] maxIndexBy: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.32 s
[vector] minIndexBy: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.32 s
[vector] ListFirstMaxIndexWins: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1125.32 s
[vector] FalseListFirstMaxIndexWins: OK
1125.32 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.32 s
[vector] Exception:
1125.32 s
[vector] Prelude.foldr1: empty list
1125.32 s
[vector] CallStack (from HasCallStack):
1125.32 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.32 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.32 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.32 s
[vector] []
1125.32 s
[vector] zip: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] zip3: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unzip: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unzip3: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] indexed: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] update: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mempty: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mappend: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] mconcat: OK (0.02s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] glength: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] sum: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] product: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] enumFromN: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] enumFromThenN: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] enumFromTo: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] enumFromThenTo: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1125.32 s
[vector] (Float)
1125.32 s
[vector] fromList.toList == id: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] toList.fromList == id: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unstream.stream == id: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] stream.unstream == id: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] eq: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] length: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] null: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] index: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.32 s
[vector] safeIndex: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] head: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.32 s
[vector] last: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.32 s
[vector] unsafeIndex: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.32 s
[vector] unsafeHead: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.32 s
[vector] unsafeLast: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.32 s
[vector] slice: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] init: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.32 s
[vector] tail: OK
1125.32 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.32 s
[vector] take: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] drop: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] splitAt: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] empty: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] singleton: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] replicate: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] generate: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] iterateN: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] iterateNM: OK (0.03s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] generateM: OK (0.02s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] replicateM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] create: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] createT: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unfoldr: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unfoldrN: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unfoldrExactN: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unfoldrM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unfoldrNM: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] unfoldrExactNM: OK (0.07s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] constructN: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] constructrN: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] cons: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] snoc: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] append: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] concat: OK (0.02s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] force: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] upd: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] accum: OK (0.01s)
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.32 s
[vector] reverse: OK
1125.32 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] backpermute: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] map: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] imap: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] concatMap: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mapM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mapM_: OK (0.04s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] forM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] forM_: OK (0.04s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] imapM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] imapM_: OK (0.03s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] zipWith: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] zipWith3: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] izipWith: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] izipWith3: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] izipWithM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] izipWithM_: OK (0.03s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] zipWithM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] zipWithM_: OK (0.03s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] filter: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifilter: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] filterM: OK (0.03s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] uniq: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mapMaybe: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] imapMaybe: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] takeWhile: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] dropWhile: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] partition: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] partitionWith: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] span: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] break: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] spanR: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] breakR: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] groupBy: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] elem: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] notElem: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] find: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] findIndex: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] findIndexR: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] findIndices: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] elemIndex: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] elemIndices: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] foldl: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] foldl1: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.33 s
[vector] foldl': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] foldl1': OK
1125.33 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.33 s
[vector] foldr: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] foldr1: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.33 s
[vector] foldr': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] foldr1': OK
1125.33 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.33 s
[vector] ifoldl: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifoldl': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifoldr: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifoldr': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifoldM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifoldM': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifoldM_: OK (0.04s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifoldM'_: OK (0.03s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] all: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] any: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] prescanl: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] prescanl': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] postscanl: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] postscanl': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanl: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanl': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanl1: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanl1': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] iscanl: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] iscanl': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] prescanr: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] prescanr': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] postscanr: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] postscanr': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanr: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanr': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanr1: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanr1': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] iscanr: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] iscanr': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_read: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.33 s
[vector] mut_write: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.33 s
[vector] mut_modify: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.33 s
[vector] mut_generate: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_generateM: OK (0.02s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_mapM_: OK (0.03s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_imapM_: OK (0.03s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_forM_: OK (0.03s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_iforM_: OK (0.04s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_foldr: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_foldr': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_foldl: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_foldl': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_ifoldr: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_ifoldr': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_ifoldl: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_ifoldl': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_foldM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_foldM': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_foldrM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_foldrM': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_ifoldM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_ifoldM': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_ifoldrM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_ifoldrM': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] compare: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] maximum: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.33 s
[vector] minimum: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.33 s
[vector] minIndex: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.33 s
[vector] maxIndex: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.33 s
[vector] maximumBy: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.33 s
[vector] minimumBy: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.33 s
[vector] maximumOn: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.33 s
[vector] minimumOn: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1125.33 s
[vector] maxIndexBy: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.33 s
[vector] minIndexBy: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.33 s
[vector] ListFirstMaxIndexWins: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.33 s
[vector] FalseListFirstMaxIndexWins: OK
1125.33 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.33 s
[vector] Exception:
1125.33 s
[vector] Prelude.foldr1: empty list
1125.33 s
[vector] CallStack (from HasCallStack):
1125.33 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.33 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.33 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.33 s
[vector] []
1125.33 s
[vector] zip: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] zip3: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] unzip: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] unzip3: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] indexed: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] update: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mempty: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mappend: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mconcat: OK (0.02s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] glength: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] sum: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] product: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] enumFromN: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] enumFromThenN: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] enumFromTo: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] enumFromThenTo: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 5 discarded.
1125.33 s
[vector] (Double)
1125.33 s
[vector] fromList.toList == id: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] toList.fromList == id: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] unstream.stream == id: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] stream.unstream == id: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] eq: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] length: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] null: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] index: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.33 s
[vector] safeIndex: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] head: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.33 s
[vector] last: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.33 s
[vector] unsafeIndex: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.33 s
[vector] unsafeHead: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.33 s
[vector] unsafeLast: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.33 s
[vector] slice: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] init: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.33 s
[vector] tail: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.33 s
[vector] take: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] drop: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] splitAt: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] empty: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] singleton: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] replicate: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] generate: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] iterateN: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] iterateNM: OK (0.02s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] generateM: OK (0.04s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] replicateM: OK (0.02s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] create: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] createT: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] unfoldr: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] unfoldrN: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] unfoldrExactN: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] unfoldrM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] unfoldrNM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] unfoldrExactNM: OK (0.02s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] constructN: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] constructrN: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] cons: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] snoc: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] append: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] concat: OK (0.02s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] force: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] upd: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] accum: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] reverse: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] backpermute: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] map: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] imap: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] concatMap: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mapM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mapM_: OK (0.02s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] forM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] forM_: OK (0.04s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] imapM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] imapM_: OK (0.03s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] zipWith: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] zipWith3: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] izipWith: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] izipWith3: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] izipWithM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] izipWithM_: OK (0.03s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] zipWithM: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] zipWithM_: OK (0.03s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] filter: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifilter: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] filterM: OK (0.05s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] uniq: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mapMaybe: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] imapMaybe: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] takeWhile: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] dropWhile: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] partition: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] partitionWith: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] span: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] break: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] spanR: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] breakR: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] groupBy: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] elem: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] notElem: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] find: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] findIndex: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] findIndexR: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] findIndices: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] elemIndex: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] elemIndices: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] foldl: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] foldl1: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.33 s
[vector] foldl': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] foldl1': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.33 s
[vector] foldr: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] foldr1: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.33 s
[vector] foldr': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] foldr1': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.33 s
[vector] ifoldl: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifoldl': OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifoldr: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifoldr': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifoldM: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifoldM': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifoldM_: OK (0.02s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] ifoldM'_: OK (0.04s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] all: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] any: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] prescanl: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] prescanl': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] postscanl: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] postscanl': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanl: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanl': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanl1: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanl1': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] iscanl: OK (0.02s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] iscanl': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] prescanr: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] prescanr': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] postscanr: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] postscanr': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanr: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanr': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanr1: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] scanr1': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] iscanr: OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] iscanr': OK (0.01s)
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_read: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.33 s
[vector] mut_write: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.33 s
[vector] mut_modify: OK
1125.33 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.33 s
[vector] mut_generate: OK
1125.33 s
[vector] +++ OK, passed 100 tests.
1125.33 s
[vector] mut_generateM: OK (0.02s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_mapM_: OK (0.03s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_imapM_: OK (0.03s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_forM_: OK (0.03s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_iforM_: OK (0.03s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldr: OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldr': OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldl: OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldl': OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldr: OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldr': OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldl: OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldl': OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldM: OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldM': OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldrM: OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldrM': OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldM: OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldM': OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldrM: OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldrM': OK (0.01s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] compare: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] maximum: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.34 s
[vector] minimum: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.34 s
[vector] minIndex: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.34 s
[vector] maxIndex: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.34 s
[vector] maximumBy: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.34 s
[vector] minimumBy: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.34 s
[vector] maximumOn: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.34 s
[vector] minimumOn: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.34 s
[vector] maxIndexBy: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1125.34 s
[vector] minIndexBy: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.34 s
[vector] ListFirstMaxIndexWins: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.34 s
[vector] FalseListFirstMaxIndexWins: OK
1125.34 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.34 s
[vector] Exception:
1125.34 s
[vector] Prelude.foldr1: empty list
1125.34 s
[vector] CallStack (from HasCallStack):
1125.34 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.34 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.34 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.34 s
[vector] []
1125.34 s
[vector] zip: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] zip3: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] unzip: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] unzip3: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] indexed: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] update: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mempty: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mappend: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mconcat: OK (0.03s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] glength: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] sum: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] product: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] enumFromN: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] enumFromThenN: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] enumFromTo: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] enumFromThenTo: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 1 discarded.
1125.34 s
[vector] (Int,Bool)
1125.34 s
[vector] fromList.toList == id: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] toList.fromList == id: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] unstream.stream == id: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] stream.unstream == id: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] eq: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] length: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] null: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] index: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.34 s
[vector] safeIndex: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] head: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.34 s
[vector] last: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.34 s
[vector] unsafeIndex: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.34 s
[vector] unsafeHead: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.34 s
[vector] unsafeLast: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.34 s
[vector] slice: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] init: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.34 s
[vector] tail: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.34 s
[vector] take: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] drop: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] splitAt: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] empty: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] singleton: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] replicate: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] generate: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] iterateN: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] iterateNM: OK (0.04s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] generateM: OK (0.03s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] replicateM: OK (0.04s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] create: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] createT: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] unfoldr: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] unfoldrN: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] unfoldrExactN: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] unfoldrM: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] unfoldrNM: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] unfoldrExactNM: OK (0.03s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] constructN: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] constructrN: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] cons: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] snoc: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] append: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] concat: OK (0.04s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] force: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] upd: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] accum: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] reverse: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] backpermute: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] map: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] imap: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] concatMap: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mapM: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mapM_: OK (0.03s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] forM: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] forM_: OK (0.04s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] imapM: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] imapM_: OK (0.03s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] zipWith: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] zipWith3: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] izipWith: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] izipWith3: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] izipWithM: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] izipWithM_: OK (0.02s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] zipWithM: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] zipWithM_: OK (0.02s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] filter: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] ifilter: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] filterM: OK (0.05s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] uniq: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mapMaybe: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] imapMaybe: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] takeWhile: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] dropWhile: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] partition: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] partitionWith: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] span: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] break: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] spanR: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] breakR: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] groupBy: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] elem: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] notElem: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] find: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] findIndex: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] findIndexR: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] findIndices: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] elemIndex: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] elemIndices: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] foldl: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] foldl1: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.34 s
[vector] foldl': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] foldl1': OK
1125.34 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.34 s
[vector] foldr: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] foldr1: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.34 s
[vector] foldr': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] foldr1': OK
1125.34 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.34 s
[vector] ifoldl: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] ifoldl': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] ifoldr: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] ifoldr': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] ifoldM: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] ifoldM': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] ifoldM_: OK (0.03s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] ifoldM'_: OK (0.03s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] all: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] any: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] prescanl: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] prescanl': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] postscanl: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] postscanl': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] scanl: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] scanl': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] scanl1: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] scanl1': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] iscanl: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] iscanl': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] prescanr: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] prescanr': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] postscanr: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] postscanr': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] scanr: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] scanr': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] scanr1: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] scanr1': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] iscanr: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] iscanr': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_read: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.34 s
[vector] mut_write: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.34 s
[vector] mut_modify: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.34 s
[vector] mut_generate: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_generateM: OK (0.02s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_mapM_: OK (0.03s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_imapM_: OK (0.03s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_forM_: OK (0.03s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_iforM_: OK (0.04s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldr: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldr': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldl: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldl': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldr: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldr': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldl: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldl': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldM: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldM': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldrM: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_foldrM': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldM: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldM': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldrM: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mut_ifoldrM': OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] compare: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] maximum: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.34 s
[vector] minimum: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.34 s
[vector] minIndex: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.34 s
[vector] maxIndex: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.34 s
[vector] maximumBy: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.34 s
[vector] minimumBy: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.34 s
[vector] maximumOn: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.34 s
[vector] minimumOn: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.34 s
[vector] maxIndexBy: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.34 s
[vector] minIndexBy: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.34 s
[vector] ListFirstMaxIndexWins: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.34 s
[vector] FalseListFirstMaxIndexWins: OK
1125.34 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.34 s
[vector] Exception:
1125.34 s
[vector] Prelude.foldr1: empty list
1125.34 s
[vector] CallStack (from HasCallStack):
1125.34 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.34 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.34 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.34 s
[vector] []
1125.34 s
[vector] zip: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] zip3: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] unzip: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] unzip3: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] indexed: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] update: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mempty: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mappend: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] mconcat: OK (0.05s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] glength: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] (Int,Bool,Int)
1125.34 s
[vector] fromList.toList == id: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] toList.fromList == id: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] unstream.stream == id: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] stream.unstream == id: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] eq: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] length: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] null: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] index: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.34 s
[vector] safeIndex: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] head: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.34 s
[vector] last: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.34 s
[vector] unsafeIndex: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1125.34 s
[vector] unsafeHead: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1125.34 s
[vector] unsafeLast: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.34 s
[vector] slice: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] init: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.34 s
[vector] tail: OK
1125.34 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1125.34 s
[vector] take: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] drop: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] splitAt: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] empty: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] singleton: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] replicate: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] generate: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] iterateN: OK
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.34 s
[vector] iterateNM: OK (0.02s)
1125.34 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] generateM: OK (0.04s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] replicateM: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] create: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] createT: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] unfoldr: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] unfoldrN: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] unfoldrExactN: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] unfoldrM: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] unfoldrNM: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] unfoldrExactNM: OK (0.02s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] constructN: OK (0.02s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] constructrN: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] cons: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] snoc: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] append: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] concat: OK (0.06s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] force: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] upd: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] accum: OK (0.01s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] reverse: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] backpermute: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] map: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] imap: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] concatMap: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mapM: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mapM_: OK (0.05s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] forM: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] forM_: OK (0.04s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] imapM: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] imapM_: OK (0.04s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] zipWith: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] zipWith3: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] izipWith: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] izipWith3: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] izipWithM: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] izipWithM_: OK (0.04s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] zipWithM: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] zipWithM_: OK (0.03s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] filter: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] ifilter: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] filterM: OK (0.07s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] uniq: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mapMaybe: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] imapMaybe: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] takeWhile: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] dropWhile: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] partition: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] partitionWith: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] span: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] break: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] spanR: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] breakR: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] groupBy: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] elem: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] notElem: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] find: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] findIndex: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] findIndexR: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] findIndices: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] elemIndex: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] elemIndices: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] foldl: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] foldl1: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.35 s
[vector] foldl': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] foldl1': OK
1125.35 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.35 s
[vector] foldr: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] foldr1: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 25 discarded.
1125.35 s
[vector] foldr': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] foldr1': OK
1125.35 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.35 s
[vector] ifoldl: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] ifoldl': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] ifoldr: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] ifoldr': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] ifoldM: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] ifoldM': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] ifoldM_: OK (0.05s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] ifoldM'_: OK (0.05s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] all: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] any: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] prescanl: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] prescanl': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] postscanl: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] postscanl': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] scanl: OK (0.01s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] scanl': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] scanl1: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] scanl1': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] iscanl: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] iscanl': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] prescanr: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] prescanr': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] postscanr: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] postscanr': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] scanr: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] scanr': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] scanr1: OK (0.01s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] scanr1': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] iscanr: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] iscanr': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_read: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.35 s
[vector] mut_write: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.35 s
[vector] mut_modify: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.35 s
[vector] mut_generate: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_generateM: OK (0.02s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_mapM_: OK (0.05s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_imapM_: OK (0.04s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_forM_: OK (0.04s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_iforM_: OK (0.04s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_foldr: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_foldr': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_foldl: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_foldl': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_ifoldr: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_ifoldr': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_ifoldl: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_ifoldl': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_foldM: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_foldM': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_foldrM: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_foldrM': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_ifoldM: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_ifoldM': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_ifoldrM: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mut_ifoldrM': OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] compare: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] maximum: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.35 s
[vector] minimum: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.35 s
[vector] minIndex: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1125.35 s
[vector] maxIndex: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.35 s
[vector] maximumBy: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.35 s
[vector] minimumBy: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.35 s
[vector] maximumOn: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.35 s
[vector] minimumOn: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.35 s
[vector] maxIndexBy: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.35 s
[vector] minIndexBy: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.35 s
[vector] ListFirstMaxIndexWins: OK
1125.35 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.35 s
[vector] FalseListFirstMaxIndexWins: OK
1125.35 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.35 s
[vector] Exception:
1125.35 s
[vector] Prelude.foldr1: empty list
1125.35 s
[vector] CallStack (from HasCallStack):
1125.35 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.35 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.35 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.35 s
[vector] []
1125.35 s
[vector] zip: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] zip3: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] unzip: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] unzip3: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] indexed: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] update: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mempty: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mappend: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] mconcat: OK (0.06s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] glength: OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] unstream
1125.35 s
[vector] unstream == vunstream (exact): OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] unstream == vunstream (unknown): OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] unstreamR ~= vunstream (exact): OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] unstreamR ~= vunstream (unknown): OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] Data.Vector.Storable.Vector Alignment
1125.35 s
[vector] Aligned Double: OK
1125.35 s
[vector] Aligned Int: OK
1125.35 s
[vector] Regression tests
1125.35 s
[vector] enumFromTo crash #188
1125.35 s
[vector] Word8: OK
1125.35 s
[vector] Word16: OK
1125.35 s
[vector] Word32: OK
1125.35 s
[vector] Word64: OK
1125.35 s
[vector] Word: OK
1125.35 s
[vector] Int8: OK
1125.35 s
[vector] Int16: OK
1125.35 s
[vector] Int32: OK
1125.35 s
[vector] Int64: OK
1125.35 s
[vector] Int: OK
1125.35 s
[vector] Char: OK
1125.35 s
[vector] Negative tests
1125.35 s
[vector] slice out of bounds #257
1125.35 s
[vector] Boxed
1125.35 s
[vector] Negative ix: OK
1125.35 s
[vector] Negative size: OK
1125.35 s
[vector] Negative ix and size: OK
1125.35 s
[vector] Too large ix: OK
1125.35 s
[vector] Too large size: OK
1125.35 s
[vector] Too large ix and size: OK
1125.35 s
[vector] Overflow: OK
1125.35 s
[vector] OutOfMemory: OK
1125.35 s
[vector] Primitive
1125.35 s
[vector] Negative ix: OK
1125.35 s
[vector] Negative size: OK
1125.35 s
[vector] Negative ix and size: OK
1125.35 s
[vector] Too large ix: OK
1125.35 s
[vector] Too large size: OK
1125.35 s
[vector] Too large ix and size: OK
1125.35 s
[vector] Overflow: OK
1125.35 s
[vector] OutOfMemory: OK
1125.35 s
[vector] Storable
1125.35 s
[vector] Negative ix: OK
1125.35 s
[vector] Negative size: OK
1125.35 s
[vector] Negative ix and size: OK
1125.35 s
[vector] Too large ix: OK
1125.35 s
[vector] Too large size: OK
1125.35 s
[vector] Too large ix and size: OK
1125.35 s
[vector] Overflow: OK
1125.35 s
[vector] OutOfMemory: OK
1125.35 s
[vector] Unboxed
1125.35 s
[vector] Negative ix: OK
1125.35 s
[vector] Negative size: OK
1125.35 s
[vector] Negative ix and size: OK
1125.35 s
[vector] Too large ix: OK
1125.35 s
[vector] Too large size: OK
1125.35 s
[vector] Too large ix and size: OK
1125.35 s
[vector] Overflow: OK
1125.35 s
[vector] OutOfMemory: OK
1125.35 s
[vector] take #282
1125.35 s
[vector] Boxed: OK
1125.35 s
[vector] Primitive: OK
1125.35 s
[vector] Storable: OK
1125.35 s
[vector] Unboxed: OK
1125.35 s
[vector] Data.Vector
1125.35 s
[vector] MonadFix: OK
1125.35 s
[vector] toFromArray: OK
1125.35 s
[vector] toFromArraySlice: OK
1125.35 s
[vector] toFromArraySliceUnsafe: OK
1125.35 s
[vector] toFromMutableArray: OK
1125.35 s
[vector] Data.Vector.Mutable (Move): OK
1125.35 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.35 s
[vector] Data.Vector.Primitive.Mutable (Move): OK
1125.35 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.35 s
[vector] Data.Vector.Unboxed.Mutable (Move): OK
1125.35 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.35 s
[vector] Data.Vector.Storable.Mutable (Move): OK
1125.35 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.35 s
[vector] Data.Vector.Generic.Mutable (nextPermutation): OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.02s)
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
1125.35 s
[vector] +++ OK, passed 100 tests.
1125.35 s
[vector]
1125.35 s
[vector] All 2808 tests passed (118.96s)
1125.35 s
[vector] Test suite vector-tests-O0: PASS
1125.35 s
[vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
1125.35 s
[vector] Test suite vector-tests-O2: RUNNING...
1125.47 s
[vector] toplevel
1125.47 s
[vector] Data.Vector.Fusion.Bundle
1125.49 s
[vector] fromList.toList == id: OK
1125.49 s
[vector] +++ OK, passed 100 tests.
1125.49 s
[vector] toList.fromList == id: OK
1125.49 s
[vector] +++ OK, passed 100 tests.
1125.49 s
[vector] eq: OK
1125.49 s
[vector] +++ OK, passed 100 tests.
1125.49 s
[vector] length: OK
1125.49 s
[vector] +++ OK, passed 100 tests.
1125.49 s
[vector] null: OK
1125.49 s
[vector] +++ OK, passed 100 tests.
1125.49 s
[vector] empty: OK
1125.49 s
[vector] +++ OK, passed 100 tests.
1125.49 s
[vector] singleton: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] replicate: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] cons: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] snoc: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] append: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] head: OK
1125.50 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.50 s
[vector] last: OK
1125.50 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1125.50 s
[vector] index: OK
1125.50 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.50 s
[vector] extract: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] init: OK
1125.50 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.50 s
[vector] tail: OK
1125.50 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.50 s
[vector] take: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] drop: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] map: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] zipWith: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] zipWith3: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] filter: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] takeWhile: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] dropWhile: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] elem: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] notElem: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] find: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] findIndex: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] foldl: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] foldl1: OK
1125.50 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.50 s
[vector] foldl': OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] foldl1': OK
1125.50 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.50 s
[vector] foldr: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] foldr1: OK
1125.50 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1125.50 s
[vector] prescanl: OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] prescanl': OK
1125.50 s
[vector] +++ OK, passed 100 tests.
1125.50 s
[vector] postscanl: OK
1125.51 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] postscanl': OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] scanl: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] scanl': OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] scanl1: OK
1125.52 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.52 s
[vector] scanl1': OK
1125.52 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.52 s
[vector] concatMap: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] unfoldr: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] and: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] or: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] Tests.Vector.Boxed
1125.52 s
[vector] Bool
1125.52 s
[vector] fromList.toList == id: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] toList.fromList == id: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] unstream.stream == id: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] stream.unstream == id: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] eq: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] length: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] null: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] index: OK
1125.52 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.52 s
[vector] safeIndex: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] head: OK
1125.52 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1125.52 s
[vector] last: OK
1125.52 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.52 s
[vector] unsafeIndex: OK
1125.52 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.52 s
[vector] unsafeHead: OK
1125.52 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.52 s
[vector] unsafeLast: OK
1125.52 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.52 s
[vector] slice: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] init: OK
1125.52 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1125.52 s
[vector] tail: OK
1125.52 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.52 s
[vector] take: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] drop: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] splitAt: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] empty: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] singleton: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] replicate: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.52 s
[vector] generate: OK
1125.52 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] iterateN: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] iterateNM: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] generateM: OK (0.01s)
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] replicateM: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] create: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] createT: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] unfoldr: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] unfoldrN: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] unfoldrExactN: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] unfoldrM: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] unfoldrNM: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] unfoldrExactNM: OK (0.01s)
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] constructN: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] constructrN: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] cons: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] snoc: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] append: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] concat: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] force: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] upd: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] accum: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] reverse: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] backpermute: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] map: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] imap: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] concatMap: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.53 s
[vector] mapM: OK
1125.53 s
[vector] +++ OK, passed 100 tests.
1125.54 s
[vector] mapM_: OK
1125.54 s
[vector] +++ OK, passed 100 tests.
1125.54 s
[vector] forM: OK
1125.54 s
[vector] +++ OK, passed 100 tests.
1125.54 s
[vector] forM_: OK
1125.55 s
[vector] +++ OK, passed 100 tests.
1125.55 s
[vector] imapM: OK
1125.55 s
[vector] +++ OK, passed 100 tests.
1125.55 s
[vector] imapM_: OK (0.02s)
1125.55 s
[vector] +++ OK, passed 100 tests.
1125.55 s
[vector] zipWith: OK
1125.55 s
[vector] +++ OK, passed 100 tests.
1125.55 s
[vector] zipWith3: OK
1125.55 s
[vector] +++ OK, passed 100 tests.
1125.55 s
[vector] izipWith: OK
1125.55 s
[vector] +++ OK, passed 100 tests.
1125.55 s
[vector] izipWith3: OK
1125.55 s
[vector] +++ OK, passed 100 tests.
1125.55 s
[vector] izipWithM: OK
1125.55 s
[vector] +++ OK, passed 100 tests.
1125.55 s
[vector] izipWithM_: OK
1125.55 s
[vector] +++ OK, passed 100 tests.
1125.55 s
[vector] zipWithM: OK
1125.55 s
[vector] +++ OK, passed 100 tests.
1125.55 s
[vector] zipWithM_: OK
1125.55 s
[vector] +++ OK, passed 100 tests.
1125.55 s
[vector] filter: OK
1125.55 s
[vector] +++ OK, passed 100 tests.
1125.55 s
[vector] ifilter: OK
1125.56 s
[vector] +++ OK, passed 100 tests.
1125.57 s
[vector] filterM: OK (0.02s)
1125.57 s
[vector] +++ OK, passed 100 tests.
1125.57 s
[vector] uniq: OK
1125.57 s
[vector] +++ OK, passed 100 tests.
1125.57 s
[vector] mapMaybe: OK
1125.57 s
[vector] +++ OK, passed 100 tests.
1125.57 s
[vector] imapMaybe: OK
1125.57 s
[vector] +++ OK, passed 100 tests.
1125.57 s
[vector] takeWhile: OK
1125.57 s
[vector] +++ OK, passed 100 tests.
1125.57 s
[vector] dropWhile: OK
1125.57 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] partition: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] partitionWith: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] span: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] break: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] spanR: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] breakR: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] groupBy: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] elem: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] notElem: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] find: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] findIndex: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] findIndexR: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] findIndices: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] elemIndex: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.58 s
[vector] elemIndices: OK
1125.58 s
[vector] +++ OK, passed 100 tests.
1125.59 s
[vector] foldl: OK
1125.59 s
[vector] +++ OK, passed 100 tests.
1125.59 s
[vector] foldl1: OK
1125.59 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.59 s
[vector] foldl': OK
1125.59 s
[vector] +++ OK, passed 100 tests.
1125.59 s
[vector] foldl1': OK
1125.59 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1125.59 s
[vector] foldr: OK
1125.59 s
[vector] +++ OK, passed 100 tests.
1125.59 s
[vector] foldr1: OK
1125.59 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.59 s
[vector] foldr': OK
1125.59 s
[vector] +++ OK, passed 100 tests.
1125.59 s
[vector] foldr1': OK
1125.59 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.59 s
[vector] ifoldl: OK
1125.59 s
[vector] +++ OK, passed 100 tests.
1125.59 s
[vector] ifoldl': OK
1125.59 s
[vector] +++ OK, passed 100 tests.
1125.60 s
[vector] ifoldr: OK
1125.60 s
[vector] +++ OK, passed 100 tests.
1125.60 s
[vector] ifoldr': OK
1125.60 s
[vector] +++ OK, passed 100 tests.
1125.60 s
[vector] ifoldM: OK
1125.61 s
[vector] +++ OK, passed 100 tests.
1125.62 s
[vector] ifoldM': OK
1125.62 s
[vector] +++ OK, passed 100 tests.
1125.62 s
[vector] ifoldM_: OK
1125.62 s
[vector] +++ OK, passed 100 tests.
1125.62 s
[vector] ifoldM'_: OK
1125.62 s
[vector] +++ OK, passed 100 tests.
1125.62 s
[vector] all: OK
1125.62 s
[vector] +++ OK, passed 100 tests.
1125.62 s
[vector] any: OK
1125.62 s
[vector] +++ OK, passed 100 tests.
1125.62 s
[vector] prescanl: OK
1125.63 s
[vector] +++ OK, passed 100 tests.
1125.63 s
[vector] prescanl': OK
1125.63 s
[vector] +++ OK, passed 100 tests.
1125.63 s
[vector] postscanl: OK
1125.63 s
[vector] +++ OK, passed 100 tests.
1125.63 s
[vector] postscanl': OK
1125.63 s
[vector] +++ OK, passed 100 tests.
1125.63 s
[vector] scanl: OK
1125.63 s
[vector] +++ OK, passed 100 tests.
1125.63 s
[vector] scanl': OK
1125.63 s
[vector] +++ OK, passed 100 tests.
1125.64 s
[vector] scanl1: OK
1125.64 s
[vector] +++ OK, passed 100 tests.
1125.64 s
[vector] scanl1': OK
1125.64 s
[vector] +++ OK, passed 100 tests.
1125.64 s
[vector] iscanl: OK
1125.64 s
[vector] +++ OK, passed 100 tests.
1125.64 s
[vector] iscanl': OK
1125.64 s
[vector] +++ OK, passed 100 tests.
1125.64 s
[vector] prescanr: OK
1125.64 s
[vector] +++ OK, passed 100 tests.
1125.64 s
[vector] prescanr': OK
1125.64 s
[vector] +++ OK, passed 100 tests.
1125.64 s
[vector] postscanr: OK
1125.64 s
[vector] +++ OK, passed 100 tests.
1125.64 s
[vector] postscanr': OK
1125.64 s
[vector] +++ OK, passed 100 tests.
1125.64 s
[vector] scanr: OK
1125.64 s
[vector] +++ OK, passed 100 tests.
1125.64 s
[vector] scanr': OK
1125.64 s
[vector] +++ OK, passed 100 tests.
1125.64 s
[vector] scanr1: OK
1125.64 s
[vector] +++ OK, passed 100 tests.
1125.64 s
[vector] scanr1': OK
1125.64 s
[vector] +++ OK, passed 100 tests.
1125.64 s
[vector] iscanr: OK
1125.65 s
[vector] +++ OK, passed 100 tests.
1125.65 s
[vector] iscanr': OK
1125.65 s
[vector] +++ OK, passed 100 tests.
1125.65 s
[vector] mut_read: OK
1125.65 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.65 s
[vector] mut_write: OK
1125.65 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.65 s
[vector] mut_modify: OK
1125.65 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.65 s
[vector] mut_generate: OK
1125.65 s
[vector] +++ OK, passed 100 tests.
1125.65 s
[vector] mut_generateM: OK
1125.65 s
[vector] +++ OK, passed 100 tests.
1125.67 s
[vector] mut_mapM_: OK
1125.68 s
[vector] +++ OK, passed 100 tests.
1125.68 s
[vector] mut_imapM_: OK
1125.68 s
[vector] +++ OK, passed 100 tests.
1125.68 s
[vector] mut_forM_: OK
1125.68 s
[vector] +++ OK, passed 100 tests.
1125.68 s
[vector] mut_iforM_: OK
1125.68 s
[vector] +++ OK, passed 100 tests.
1125.68 s
[vector] mut_foldr: OK
1125.69 s
[vector] +++ OK, passed 100 tests.
1125.69 s
[vector] mut_foldr': OK
1125.69 s
[vector] +++ OK, passed 100 tests.
1125.69 s
[vector] mut_foldl: OK
1125.69 s
[vector] +++ OK, passed 100 tests.
1125.69 s
[vector] mut_foldl': OK
1125.69 s
[vector] +++ OK, passed 100 tests.
1125.69 s
[vector] mut_ifoldr: OK
1125.69 s
[vector] +++ OK, passed 100 tests.
1125.69 s
[vector] mut_ifoldr': OK
1125.69 s
[vector] +++ OK, passed 100 tests.
1125.69 s
[vector] mut_ifoldl: OK
1125.69 s
[vector] +++ OK, passed 100 tests.
1125.69 s
[vector] mut_ifoldl': OK
1125.69 s
[vector] +++ OK, passed 100 tests.
1125.70 s
[vector] mut_foldM: OK
1125.70 s
[vector] +++ OK, passed 100 tests.
1125.70 s
[vector] mut_foldM': OK
1125.70 s
[vector] +++ OK, passed 100 tests.
1125.70 s
[vector] mut_foldrM: OK
1125.70 s
[vector] +++ OK, passed 100 tests.
1125.70 s
[vector] mut_foldrM': OK
1125.70 s
[vector] +++ OK, passed 100 tests.
1125.70 s
[vector] mut_ifoldM: OK
1125.70 s
[vector] +++ OK, passed 100 tests.
1125.70 s
[vector] mut_ifoldM': OK
1125.70 s
[vector] +++ OK, passed 100 tests.
1125.70 s
[vector] mut_ifoldrM: OK
1125.70 s
[vector] +++ OK, passed 100 tests.
1125.70 s
[vector] mut_ifoldrM': OK
1125.70 s
[vector] +++ OK, passed 100 tests.
1125.70 s
[vector] compare: OK
1125.70 s
[vector] +++ OK, passed 100 tests.
1125.70 s
[vector] maximum: OK
1125.70 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.71 s
[vector] minimum: OK
1125.71 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1125.71 s
[vector] minIndex: OK
1125.71 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.71 s
[vector] maxIndex: OK
1125.71 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.71 s
[vector] maximumBy: OK
1125.71 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1125.71 s
[vector] minimumBy: OK
1125.71 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1125.71 s
[vector] maximumOn: OK
1125.71 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.71 s
[vector] minimumOn: OK
1125.71 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.71 s
[vector] maxIndexBy: OK
1125.71 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.71 s
[vector] minIndexBy: OK
1125.71 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1125.71 s
[vector] ListFirstMaxIndexWins: OK
1125.71 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1125.71 s
[vector] FalseListFirstMaxIndexWins: OK
1125.71 s
[vector] +++ OK, failed as expected. (after 1 test):
1125.71 s
[vector] Exception:
1125.71 s
[vector] Prelude.foldr1: empty list
1125.71 s
[vector] CallStack (from HasCallStack):
1125.71 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1125.71 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1125.71 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1125.71 s
[vector] []
1125.71 s
[vector] zip: OK
1125.71 s
[vector] +++ OK, passed 100 tests.
1125.71 s
[vector] zip3: OK
1125.71 s
[vector] +++ OK, passed 100 tests.
1125.71 s
[vector] unzip: OK
1125.71 s
[vector] +++ OK, passed 100 tests.
1125.71 s
[vector] unzip3: OK
1125.71 s
[vector] +++ OK, passed 100 tests.
1125.71 s
[vector] indexed: OK
1125.72 s
[vector] +++ OK, passed 100 tests.
1125.72 s
[vector] update: OK
1125.72 s
[vector] +++ OK, passed 100 tests.
1125.72 s
[vector] concat: OK
1125.72 s
[vector] +++ OK, passed 100 tests.
1125.73 s
[vector] mempty: OK
1125.73 s
[vector] +++ OK, passed 100 tests.
1125.73 s
[vector] mappend: OK
1125.73 s
[vector] +++ OK, passed 100 tests.
1125.73 s
[vector] mconcat: OK
1125.73 s
[vector] +++ OK, passed 100 tests.
1125.73 s
[vector] fmap: OK
1125.73 s
[vector] +++ OK, passed 100 tests.
1125.74 s
[vector] return: OK
1125.74 s
[vector] +++ OK, passed 100 tests.
1125.74 s
[vector] bind: OK (0.01s)
1125.74 s
[vector] +++ OK, passed 100 tests.
1125.74 s
[vector] mzip: OK
1125.74 s
[vector] +++ OK, passed 100 tests.
1125.74 s
[vector] munzip: OK
1125.74 s
[vector] +++ OK, passed 100 tests.
1125.75 s
[vector] applicative_pure: OK
1125.75 s
[vector] +++ OK, passed 100 tests.
1125.75 s
[vector] applicative_appl: OK (0.01s)
1125.75 s
[vector] +++ OK, passed 100 tests.
1125.75 s
[vector] alternative_empty: OK
1125.75 s
[vector] +++ OK, passed 100 tests.
1125.76 s
[vector] alternative_or: OK
1125.76 s
[vector] +++ OK, passed 100 tests.
1125.76 s
[pandoc-lua-engine] Phase: setupCompilerEnvironmentPhase
1125.77 s
[pandoc-lua-engine] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
1125.78 s
[vector] sequence: OK (0.03s)
1125.78 s
[vector] +++ OK, passed 100 tests.
1125.79 s
[vector] sequence_: OK
1125.79 s
[vector] +++ OK, passed 100 tests.
1125.79 s
[vector] glength: OK
1125.79 s
[vector] +++ OK, passed 100 tests.
1125.79 s
[vector] and: OK
1125.79 s
[vector] +++ OK, passed 100 tests.
1125.79 s
[vector] or: OK
1125.79 s
[vector] +++ OK, passed 100 tests.
1125.79 s
[vector] Int
1125.79 s
[vector] fromList.toList == id: OK
1125.79 s
[vector] +++ OK, passed 100 tests.
1125.79 s
[vector] toList.fromList == id: OK
1125.79 s
[vector] +++ OK, passed 100 tests.
1125.79 s
[vector] unstream.stream == id: OK
1125.79 s
[vector] +++ OK, passed 100 tests.
1125.79 s
[vector] stream.unstream == id: OK
1125.79 s
[vector] +++ OK, passed 100 tests.
1125.79 s
[vector] eq: OK
1125.79 s
[vector] +++ OK, passed 100 tests.
1125.79 s
[vector] length: OK
1125.79 s
[vector] +++ OK, passed 100 tests.
1125.79 s
[vector] null: OK
1125.79 s
[vector] +++ OK, passed 100 tests.
1125.79 s
[vector] index: OK
1125.79 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1125.79 s
[vector] safeIndex: OK
1125.79 s
[vector] +++ OK, passed 100 tests.
1125.79 s
[vector] head: OK
1125.79 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.80 s
[vector] last: OK
1125.80 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1125.80 s
[vector] unsafeIndex: OK
1125.80 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1125.80 s
[vector] unsafeHead: OK
1125.80 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.80 s
[vector] unsafeLast: OK
1125.80 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.80 s
[vector] slice: OK
1125.80 s
[vector] +++ OK, passed 100 tests.
1125.80 s
[vector] init: OK
1125.80 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1125.80 s
[vector] tail: OK
1125.80 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1125.80 s
[vector] take: OK
1125.80 s
[vector] +++ OK, passed 100 tests.
1125.80 s
[vector] drop: OK
1125.80 s
[vector] +++ OK, passed 100 tests.
1125.80 s
[vector] splitAt: OK
1125.80 s
[vector] +++ OK, passed 100 tests.
1125.80 s
[vector] empty: OK
1125.80 s
[vector] +++ OK, passed 100 tests.
1125.80 s
[vector] singleton: OK
1125.80 s
[vector] +++ OK, passed 100 tests.
1125.80 s
[vector] replicate: OK
1125.80 s
[vector] +++ OK, passed 100 tests.
1125.80 s
[vector] generate: OK
1125.80 s
[vector] +++ OK, passed 100 tests.
1125.82 s
[vector] iterateN: OK
1125.82 s
[vector] +++ OK, passed 100 tests.
1125.84 s
[vector] iterateNM: OK (0.02s)
1125.84 s
[vector] +++ OK, passed 100 tests.
1125.84 s
[vector] generateM: OK (0.02s)
1125.84 s
[vector] +++ OK, passed 100 tests.
1125.84 s
[vector] replicateM: OK
1125.84 s
[vector] +++ OK, passed 100 tests.
1125.84 s
[vector] create: OK
1125.84 s
[vector] +++ OK, passed 100 tests.
1125.84 s
[vector] createT: OK
1125.84 s
[vector] +++ OK, passed 100 tests.
1125.84 s
[vector] unfoldr: OK
1125.84 s
[vector] +++ OK, passed 100 tests.
1125.84 s
[vector] unfoldrN: OK
1125.84 s
[vector] +++ OK, passed 100 tests.
1125.84 s
[vector] unfoldrExactN: OK
1125.85 s
[vector] +++ OK, passed 100 tests.
1125.85 s
[vector] unfoldrM: OK
1125.85 s
[vector] +++ OK, passed 100 tests.
1125.85 s
[vector] unfoldrNM: OK
1125.86 s
[vector] +++ OK, passed 100 tests.
1125.86 s
[vector] unfoldrExactNM: OK (0.01s)
1125.86 s
[vector] +++ OK, passed 100 tests.
1125.87 s
[vector] constructN: OK
1125.87 s
[vector] +++ OK, passed 100 tests.
1125.87 s
[vector] constructrN: OK
1125.87 s
[vector] +++ OK, passed 100 tests.
1125.87 s
[vector] cons: OK
1125.87 s
[vector] +++ OK, passed 100 tests.
1125.87 s
[vector] snoc: OK
1125.87 s
[vector] +++ OK, passed 100 tests.
1125.87 s
[vector] append: OK
1125.88 s
[vector] +++ OK, passed 100 tests.
1125.88 s
[vector] concat: OK (0.01s)
1125.88 s
[vector] +++ OK, passed 100 tests.
1125.88 s
[vector] force: OK
1125.88 s
[vector] +++ OK, passed 100 tests.
1125.88 s
[pandoc-server] Phase: setupCompilerEnvironmentPhase
1125.89 s
[pandoc-server] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
1125.89 s
[vector] upd: OK
1125.89 s
[vector] +++ OK, passed 100 tests.
1125.89 s
[vector] accum: OK
1125.89 s
[vector] +++ OK, passed 100 tests.
1125.89 s
[vector] reverse: OK
1125.89 s
[vector] +++ OK, passed 100 tests.
1125.89 s
[vector] backpermute: OK
1125.89 s
[vector] +++ OK, passed 100 tests.
1125.89 s
[vector] map: OK
1125.89 s
[vector] +++ OK, passed 100 tests.
1125.89 s
[vector] imap: OK
1125.89 s
[vector] +++ OK, passed 100 tests.
1125.89 s
[vector] concatMap: OK
1125.89 s
[vector] +++ OK, passed 100 tests.
1125.90 s
[vector] mapM: OK
1125.90 s
[vector] +++ OK, passed 100 tests.
1125.91 s
[vector] mapM_: OK
1125.91 s
[vector] +++ OK, passed 100 tests.
1125.91 s
[vector] forM: OK
1125.91 s
[vector] +++ OK, passed 100 tests.
1125.93 s
[vector] forM_: OK (0.02s)
1125.94 s
[vector] +++ OK, passed 100 tests.
1125.94 s
[vector] imapM: OK
1125.94 s
[vector] +++ OK, passed 100 tests.
1125.95 s
[vector] imapM_: OK (0.02s)
1125.95 s
[vector] +++ OK, passed 100 tests.
1125.95 s
[vector] zipWith: OK
1125.95 s
[vector] +++ OK, passed 100 tests.
1125.95 s
[vector] zipWith3: OK
1125.95 s
[vector] +++ OK, passed 100 tests.
1125.95 s
[vector] izipWith: OK
1125.95 s
[vector] +++ OK, passed 100 tests.
1125.95 s
[vector] izipWith3: OK
1125.95 s
[vector] +++ OK, passed 100 tests.
1125.97 s
[vector] izipWithM: OK
1125.97 s
[vector] +++ OK, passed 100 tests.
1125.97 s
[vector] izipWithM_: OK (0.01s)
1125.97 s
[vector] +++ OK, passed 100 tests.
1125.97 s
[vector] zipWithM: OK
1125.98 s
[vector] +++ OK, passed 100 tests.
1125.98 s
[vector] zipWithM_: OK (0.01s)
1125.98 s
[vector] +++ OK, passed 100 tests.
1125.98 s
[vector] filter: OK
1125.98 s
[vector] +++ OK, passed 100 tests.
1125.98 s
[vector] ifilter: OK
1126.00 s
[vector] +++ OK, passed 100 tests.
1126.00 s
[vector] filterM: OK (0.02s)
1126.00 s
[vector] +++ OK, passed 100 tests.
1126.00 s
[vector] uniq: OK
1126.00 s
[vector] +++ OK, passed 100 tests.
1126.00 s
[vector] mapMaybe: OK
1126.00 s
[vector] +++ OK, passed 100 tests.
1126.01 s
[vector] imapMaybe: OK
1126.01 s
[vector] +++ OK, passed 100 tests.
1126.01 s
[vector] takeWhile: OK
1126.01 s
[vector] +++ OK, passed 100 tests.
1126.01 s
[vector] dropWhile: OK
1126.01 s
[vector] +++ OK, passed 100 tests.
1126.01 s
[vector] partition: OK
1126.01 s
[vector] +++ OK, passed 100 tests.
1126.01 s
[vector] partitionWith: OK
1126.01 s
[vector] +++ OK, passed 100 tests.
1126.01 s
[vector] span: OK
1126.01 s
[vector] +++ OK, passed 100 tests.
1126.01 s
[vector] break: OK
1126.01 s
[vector] +++ OK, passed 100 tests.
1126.01 s
[vector] spanR: OK
1126.01 s
[vector] +++ OK, passed 100 tests.
1126.01 s
[vector] breakR: OK
1126.01 s
[vector] +++ OK, passed 100 tests.
1126.01 s
[vector] groupBy: OK
1126.02 s
[vector] +++ OK, passed 100 tests.
1126.02 s
[vector] elem: OK
1126.02 s
[vector] +++ OK, passed 100 tests.
1126.02 s
[vector] notElem: OK
1126.02 s
[vector] +++ OK, passed 100 tests.
1126.02 s
[vector] find: OK
1126.02 s
[vector] +++ OK, passed 100 tests.
1126.02 s
[vector] findIndex: OK
1126.02 s
[vector] +++ OK, passed 100 tests.
1126.02 s
[vector] findIndexR: OK
1126.02 s
[vector] +++ OK, passed 100 tests.
1126.02 s
[vector] findIndices: OK
1126.02 s
[vector] +++ OK, passed 100 tests.
1126.02 s
[vector] elemIndex: OK
1126.02 s
[vector] +++ OK, passed 100 tests.
1126.02 s
[vector] elemIndices: OK
1126.02 s
[vector] +++ OK, passed 100 tests.
1126.02 s
[vector] foldl: OK
1126.02 s
[vector] +++ OK, passed 100 tests.
1126.03 s
[vector] foldl1: OK
1126.03 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1126.03 s
[vector] foldl': OK
1126.03 s
[vector] +++ OK, passed 100 tests.
1126.03 s
[vector] foldl1': OK
1126.03 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1126.03 s
[vector] foldr: OK
1126.03 s
[vector] +++ OK, passed 100 tests.
1126.03 s
[vector] foldr1: OK
1126.04 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1126.04 s
[vector] foldr': OK
1126.04 s
[vector] +++ OK, passed 100 tests.
1126.04 s
[vector] foldr1': OK
1126.04 s
[vector] +++ OK, passed 100 tests; 25 discarded.
1126.04 s
[vector] ifoldl: OK
1126.04 s
[vector] +++ OK, passed 100 tests.
1126.04 s
[vector] ifoldl': OK
1126.05 s
[vector] +++ OK, passed 100 tests.
1126.05 s
[vector] ifoldr: OK
1126.05 s
[vector] +++ OK, passed 100 tests.
1126.05 s
[vector] ifoldr': OK
1126.05 s
[vector] +++ OK, passed 100 tests.
1126.05 s
[vector] ifoldM: OK
1126.05 s
[vector] +++ OK, passed 100 tests.
1126.06 s
[vector] ifoldM': OK
1126.06 s
[vector] +++ OK, passed 100 tests.
1126.08 s
[vector] ifoldM_: OK (0.01s)
1126.08 s
[vector] +++ OK, passed 100 tests.
1126.09 s
[vector] ifoldM'_: OK (0.02s)
1126.09 s
[vector] +++ OK, passed 100 tests.
1126.09 s
[vector] all: OK
1126.09 s
[vector] +++ OK, passed 100 tests.
1126.09 s
[vector] any: OK
1126.09 s
[vector] +++ OK, passed 100 tests.
1126.10 s
[vector] prescanl: OK
1126.10 s
[vector] +++ OK, passed 100 tests.
1126.10 s
[vector] prescanl': OK
1126.10 s
[vector] +++ OK, passed 100 tests.
1126.10 s
[vector] postscanl: OK
1126.10 s
[vector] +++ OK, passed 100 tests.
1126.10 s
[vector] postscanl': OK
1126.10 s
[vector] +++ OK, passed 100 tests.
1126.10 s
[vector] scanl: OK
1126.10 s
[vector] +++ OK, passed 100 tests.
1126.10 s
[vector] scanl': OK
1126.11 s
[vector] +++ OK, passed 100 tests.
1126.11 s
[vector] scanl1: OK
1126.11 s
[vector] +++ OK, passed 100 tests.
1126.11 s
[vector] scanl1': OK
1126.11 s
[vector] +++ OK, passed 100 tests.
1126.11 s
[vector] iscanl: OK
1126.11 s
[vector] +++ OK, passed 100 tests.
1126.11 s
[vector] iscanl': OK
1126.12 s
[vector] +++ OK, passed 100 tests.
1126.12 s
[vector] prescanr: OK
1126.12 s
[vector] +++ OK, passed 100 tests.
1126.12 s
[vector] prescanr': OK
1126.12 s
[vector] +++ OK, passed 100 tests.
1126.12 s
[vector] postscanr: OK
1126.12 s
[vector] +++ OK, passed 100 tests.
1126.12 s
[vector] postscanr': OK
1126.12 s
[vector] +++ OK, passed 100 tests.
1126.13 s
[vector] scanr: OK
1126.13 s
[vector] +++ OK, passed 100 tests.
1126.13 s
[vector] scanr': OK
1126.13 s
[vector] +++ OK, passed 100 tests.
1126.13 s
[vector] scanr1: OK
1126.13 s
[vector] +++ OK, passed 100 tests.
1126.13 s
[vector] scanr1': OK
1126.14 s
[vector] +++ OK, passed 100 tests.
1126.14 s
[vector] iscanr: OK
1126.14 s
[vector] +++ OK, passed 100 tests.
1126.14 s
[vector] iscanr': OK
1126.14 s
[vector] +++ OK, passed 100 tests.
1126.14 s
[vector] mut_read: OK
1126.14 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1126.14 s
[vector] mut_write: OK
1126.14 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1126.14 s
[vector] mut_modify: OK
1126.14 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1126.14 s
[vector] mut_generate: OK
1126.15 s
[vector] +++ OK, passed 100 tests.
1126.16 s
[vector] mut_generateM: OK
1126.16 s
[vector] +++ OK, passed 100 tests.
1126.18 s
[vector] mut_mapM_: OK (0.01s)
1126.18 s
[vector] +++ OK, passed 100 tests.
1126.19 s
[vector] mut_imapM_: OK (0.01s)
1126.19 s
[vector] +++ OK, passed 100 tests.
1126.20 s
[vector] mut_forM_: OK (0.01s)
1126.20 s
[vector] +++ OK, passed 100 tests.
1126.20 s
[vector] mut_iforM_: OK (0.01s)
1126.20 s
[vector] +++ OK, passed 100 tests.
1126.20 s
[vector] mut_foldr: OK
1126.21 s
[vector] +++ OK, passed 100 tests.
1126.21 s
[vector] mut_foldr': OK
1126.21 s
[vector] +++ OK, passed 100 tests.
1126.21 s
[vector] mut_foldl: OK
1126.21 s
[vector] +++ OK, passed 100 tests.
1126.21 s
[vector] mut_foldl': OK
1126.21 s
[vector] +++ OK, passed 100 tests.
1126.21 s
[vector] mut_ifoldr: OK
1126.22 s
[vector] +++ OK, passed 100 tests.
1126.22 s
[vector] mut_ifoldr': OK
1126.22 s
[vector] +++ OK, passed 100 tests.
1126.22 s
[vector] mut_ifoldl: OK
1126.22 s
[vector] +++ OK, passed 100 tests.
1126.22 s
[vector] mut_ifoldl': OK
1126.22 s
[vector] +++ OK, passed 100 tests.
1126.22 s
[vector] mut_foldM: OK
1126.22 s
[vector] +++ OK, passed 100 tests.
1126.23 s
[vector] mut_foldM': OK
1126.23 s
[vector] +++ OK, passed 100 tests.
1126.23 s
[vector] mut_foldrM: OK
1126.23 s
[vector] +++ OK, passed 100 tests.
1126.23 s
[vector] mut_foldrM': OK
1126.23 s
[vector] +++ OK, passed 100 tests.
1126.23 s
[vector] mut_ifoldM: OK
1126.23 s
[vector] +++ OK, passed 100 tests.
1126.23 s
[vector] mut_ifoldM': OK
1126.24 s
[vector] +++ OK, passed 100 tests.
1126.24 s
[vector] mut_ifoldrM: OK
1126.24 s
[vector] +++ OK, passed 100 tests.
1126.24 s
[vector] mut_ifoldrM': OK
1126.24 s
[vector] +++ OK, passed 100 tests.
1126.24 s
[vector] compare: OK
1126.24 s
[vector] +++ OK, passed 100 tests.
1126.24 s
[vector] maximum: OK
1126.24 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1126.24 s
[vector] minimum: OK
1126.24 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1126.24 s
[vector] minIndex: OK
1126.24 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1126.24 s
[vector] maxIndex: OK
1126.24 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1126.24 s
[vector] maximumBy: OK
1126.24 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1126.24 s
[vector] minimumBy: OK
1126.24 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1126.24 s
[vector] maximumOn: OK
1126.24 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1126.24 s
[vector] minimumOn: OK
1126.24 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1126.24 s
[vector] maxIndexBy: OK
1126.24 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1126.24 s
[vector] minIndexBy: OK
1126.24 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1126.24 s
[vector] ListFirstMaxIndexWins: OK
1126.24 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1126.24 s
[vector] FalseListFirstMaxIndexWins: OK
1126.24 s
[vector] +++ OK, failed as expected. (after 1 test):
1126.24 s
[vector] Exception:
1126.24 s
[vector] Prelude.foldr1: empty list
1126.24 s
[vector] CallStack (from HasCallStack):
1126.24 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1126.24 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1126.24 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1126.24 s
[vector] []
1126.24 s
[vector] zip: OK
1126.24 s
[vector] +++ OK, passed 100 tests.
1126.24 s
[vector] zip3: OK
1126.25 s
[vector] +++ OK, passed 100 tests.
1126.25 s
[vector] unzip: OK
1126.25 s
[vector] +++ OK, passed 100 tests.
1126.25 s
[vector] unzip3: OK
1126.25 s
[vector] +++ OK, passed 100 tests.
1126.25 s
[vector] indexed: OK
1126.25 s
[vector] +++ OK, passed 100 tests.
1126.26 s
[vector] update: OK
1126.26 s
[vector] +++ OK, passed 100 tests.
1126.26 s
[vector] concat: OK
1126.26 s
[vector] +++ OK, passed 100 tests.
1126.26 s
[vector] mempty: OK
1126.26 s
[vector] +++ OK, passed 100 tests.
1126.27 s
[vector] mappend: OK
1126.27 s
[vector] +++ OK, passed 100 tests.
1126.27 s
[vector] mconcat: OK
1126.27 s
[vector] +++ OK, passed 100 tests.
1126.27 s
[vector] fmap: OK
1126.27 s
[vector] +++ OK, passed 100 tests.
1126.28 s
[vector] return: OK
1126.28 s
[vector] +++ OK, passed 100 tests.
1126.28 s
[vector] bind: OK (0.01s)
1126.28 s
[vector] +++ OK, passed 100 tests.
1126.28 s
[vector] mzip: OK
1126.28 s
[vector] +++ OK, passed 100 tests.
1126.28 s
[vector] munzip: OK
1126.28 s
[vector] +++ OK, passed 100 tests.
1126.30 s
[vector] applicative_pure: OK
1126.30 s
[vector] +++ OK, passed 100 tests.
1126.32 s
[vector] applicative_appl: OK (0.04s)
1126.32 s
[vector] +++ OK, passed 100 tests.
1126.32 s
[vector] alternative_empty: OK
1126.32 s
[vector] +++ OK, passed 100 tests.
1126.32 s
[vector] alternative_or: OK
1126.32 s
[vector] +++ OK, passed 100 tests.
1126.36 s
[vector] sequence: OK (0.02s)
1126.36 s
[vector] +++ OK, passed 100 tests.
1126.36 s
[pandoc-lua-engine] Phase: unpackPhase
1126.37 s
[pandoc-lua-engine] unpacking source archive /nix/store/zx6z7rsf1lwrwkbcq94jg1dgi1fp9jls-pandoc-lua-engine-0.4.3.tar.gz
1126.37 s
[vector] sequence_: OK (0.01s)
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[vector] glength: OK
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[vector] sum: OK
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[vector] product: OK
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[vector] enumFromN: OK
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[vector] enumFromThenN: OK
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[vector] enumFromTo: OK
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[vector] enumFromThenTo: OK
1126.37 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1126.37 s
[vector] unstream
1126.37 s
[vector] unstream == vunstream (exact): OK
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[vector] unstream == vunstream (unknown): OK
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[vector] unstreamR ~= vunstream (exact): OK
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[vector] unstreamR ~= vunstream (unknown): OK
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[vector] Tests.Vector.Primitive
1126.37 s
[vector] Int
1126.37 s
[vector] fromList.toList == id: OK
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[vector] toList.fromList == id: OK
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[vector] unstream.stream == id: OK
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[vector] stream.unstream == id: OK
1126.37 s
[vector] +++ OK, passed 100 tests.
1126.37 s
[pandoc-lua-engine] source root is pandoc-lua-engine-0.4.3
1126.38 s
[vector] eq: OK
1126.38 s
[vector] +++ OK, passed 100 tests.
1126.38 s
[vector] length: OK
1126.38 s
[vector] +++ OK, passed 100 tests.
1126.38 s
[vector] null: OK
1126.38 s
[vector] +++ OK, passed 100 tests.
1126.38 s
[vector] index: OK
1126.38 s
[vector] +++ OK, passed 100 tests; 31 discarded.
1126.38 s
[vector] safeIndex: OK
1126.38 s
[vector] +++ OK, passed 100 tests.
1126.38 s
[vector] head: OK
1126.38 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1126.38 s
[vector] last: OK
1126.38 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1126.38 s
[vector] unsafeIndex: OK
1126.38 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1126.38 s
[vector] unsafeHead: OK
1126.38 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1126.38 s
[vector] unsafeLast: OK
1126.38 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1126.38 s
[vector] slice: OK
1126.38 s
[vector] +++ OK, passed 100 tests.
1126.38 s
[vector] init: OK
1126.38 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1126.38 s
[vector] tail: OK
1126.38 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1126.38 s
[pandoc-lua-engine] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-lua-engine-0.4.3/test/writer-template.out.txt"
1126.38 s
[vector] take: OK
1126.38 s
[vector] +++ OK, passed 100 tests.
1126.38 s
[vector] drop: OK
1126.38 s
[vector] +++ OK, passed 100 tests.
1126.39 s
[vector] splitAt: OK
1126.39 s
[vector] +++ OK, passed 100 tests.
1126.39 s
[vector] empty: OK
1126.39 s
[vector] +++ OK, passed 100 tests.
1126.39 s
[vector] singleton: OK
1126.39 s
[vector] +++ OK, passed 100 tests.
1126.39 s
[vector] replicate: OK
1126.39 s
[vector] +++ OK, passed 100 tests.
1126.39 s
[vector] generate: OK
1126.39 s
[vector] +++ OK, passed 100 tests.
1126.39 s
[pandoc-lua-engine] Phase: patchPhase
1126.39 s
[pandoc-lua-engine] Replace Cabal file with edited version from mirror://hackage/pandoc-lua-engine-0.4.3/revision/2.cabal.
1126.40 s
[vector] iterateN: OK
1126.40 s
[vector] +++ OK, passed 100 tests.
1126.40 s
[pandoc-lua-engine] Phase: compileBuildDriverPhase
1126.41 s
[pandoc-lua-engine] setupCompileFlags: -package-db=/build/tmp.Cct0YVRSkE/setup-package.conf.d -threaded
1126.41 s
[vector] iterateNM: OK
1126.42 s
[vector] +++ OK, passed 100 tests.
1126.42 s
[vector] generateM: OK (0.01s)
1126.42 s
[vector] +++ OK, passed 100 tests.
1126.42 s
[vector] replicateM: OK
1126.42 s
[vector] +++ OK, passed 100 tests.
1126.42 s
[vector] create: OK
1126.42 s
[vector] +++ OK, passed 100 tests.
1126.42 s
[vector] createT: OK
1126.42 s
[vector] +++ OK, passed 100 tests.
1126.42 s
[vector] unfoldr: OK
1126.42 s
[vector] +++ OK, passed 100 tests.
1126.42 s
[vector] unfoldrN: OK
1126.42 s
[vector] +++ OK, passed 100 tests.
1126.42 s
[vector] unfoldrExactN: OK
1126.42 s
[vector] +++ OK, passed 100 tests.
1126.42 s
[vector] unfoldrM: OK
1126.42 s
[vector] +++ OK, passed 100 tests.
1126.44 s
[vector] unfoldrNM: OK
1126.44 s
[vector] +++ OK, passed 100 tests.
1126.45 s
[vector] unfoldrExactNM: OK (0.02s)
1126.45 s
[vector] +++ OK, passed 100 tests.
1126.45 s
[vector] constructN: OK
1126.45 s
[vector] +++ OK, passed 100 tests.
1126.45 s
[vector] constructrN: OK
1126.45 s
[vector] +++ OK, passed 100 tests.
1126.45 s
[vector] cons: OK
1126.45 s
[vector] +++ OK, passed 100 tests.
1126.45 s
[vector] snoc: OK
1126.45 s
[vector] +++ OK, passed 100 tests.
1126.46 s
[vector] append: OK
1126.46 s
[vector] +++ OK, passed 100 tests.
1126.46 s
[pandoc-lua-engine] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.Cct0YVRSkE/Main.o )
1126.47 s
[vector] concat: OK (0.02s)
1126.47 s
[vector] +++ OK, passed 100 tests.
1126.47 s
[vector] force: OK
1126.47 s
[vector] +++ OK, passed 100 tests.
1126.48 s
[vector] upd: OK
1126.48 s
[vector] +++ OK, passed 100 tests.
1126.48 s
[vector] accum: OK
1126.48 s
[vector] +++ OK, passed 100 tests.
1126.48 s
[vector] reverse: OK
1126.48 s
[vector] +++ OK, passed 100 tests.
1126.48 s
[vector] backpermute: OK
1126.48 s
[vector] +++ OK, passed 100 tests.
1126.48 s
[vector] map: OK
1126.48 s
[vector] +++ OK, passed 100 tests.
1126.49 s
[vector] imap: OK
1126.49 s
[vector] +++ OK, passed 100 tests.
1126.49 s
[vector] concatMap: OK
1126.50 s
[vector] +++ OK, passed 100 tests.
1126.50 s
[vector] mapM: OK
1126.50 s
[vector] +++ OK, passed 100 tests.
1126.50 s
[vector] mapM_: OK (0.01s)
1126.51 s
[pandoc-server] Phase: unpackPhase
1126.51 s
[vector] +++ OK, passed 100 tests.
1126.51 s
[pandoc-server] unpacking source archive /nix/store/4kqsjsplqpsanrihsxp1wxshjqr4snkl-pandoc-server-0.1.0.11.tar.gz
1126.52 s
[vector] forM: OK
1126.52 s
[vector] +++ OK, passed 100 tests.
1126.52 s
[vector] forM_: OK (0.01s)
1126.52 s
[vector] +++ OK, passed 100 tests.
1126.52 s
[vector] imapM: OK
1126.52 s
[vector] +++ OK, passed 100 tests.
1126.52 s
[pandoc-lua-engine] [2 of 2] Linking Setup
1126.52 s
[pandoc-server] source root is pandoc-server-0.1.0.11
1126.53 s
[pandoc-server] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-server-0.1.0.11/src/Text/Pandoc/Server.hs"
1126.53 s
[pandoc-server] Phase: patchPhase
1126.54 s
[vector] imapM_: OK
1126.54 s
[vector] +++ OK, passed 100 tests.
1126.54 s
[vector] zipWith: OK
1126.54 s
[vector] +++ OK, passed 100 tests.
1126.54 s
[vector] zipWith3: OK
1126.54 s
[vector] +++ OK, passed 100 tests.
1126.54 s
[vector] izipWith: OK
1126.54 s
[vector] +++ OK, passed 100 tests.
1126.54 s
[pandoc-server] Phase: compileBuildDriverPhase
1126.54 s
[vector] izipWith3: OK
1126.54 s
[vector] +++ OK, passed 100 tests.
1126.55 s
[pandoc-server] setupCompileFlags: -package-db=/build/tmp.YhKdfDoWze/setup-package.conf.d -threaded
1126.56 s
[vector] izipWithM: OK
1126.56 s
[vector] +++ OK, passed 100 tests.
1126.56 s
[vector] izipWithM_: OK (0.01s)
1126.56 s
[vector] +++ OK, passed 100 tests.
1126.56 s
[vector] zipWithM: OK
1126.57 s
[vector] +++ OK, passed 100 tests.
1126.57 s
[vector] zipWithM_: OK (0.01s)
1126.57 s
[vector] +++ OK, passed 100 tests.
1126.57 s
[vector] filter: OK
1126.57 s
[vector] +++ OK, passed 100 tests.
1126.57 s
[vector] ifilter: OK
1126.57 s
[vector] +++ OK, passed 100 tests.
1126.60 s
[pandoc-server] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.YhKdfDoWze/Main.o )
1126.61 s
[vector] filterM: OK (0.03s)
1126.61 s
[vector] +++ OK, passed 100 tests.
1126.61 s
[vector] uniq: OK
1126.61 s
[vector] +++ OK, passed 100 tests.
1126.61 s
[vector] mapMaybe: OK
1126.61 s
[vector] +++ OK, passed 100 tests.
1126.61 s
[vector] imapMaybe: OK
1126.61 s
[vector] +++ OK, passed 100 tests.
1126.61 s
[vector] takeWhile: OK
1126.61 s
[vector] +++ OK, passed 100 tests.
1126.61 s
[vector] dropWhile: OK
1126.61 s
[vector] +++ OK, passed 100 tests.
1126.62 s
[vector] partition: OK
1126.62 s
[vector] +++ OK, passed 100 tests.
1126.62 s
[vector] partitionWith: OK
1126.62 s
[vector] +++ OK, passed 100 tests.
1126.62 s
[vector] span: OK
1126.62 s
[vector] +++ OK, passed 100 tests.
1126.62 s
[vector] break: OK
1126.62 s
[vector] +++ OK, passed 100 tests.
1126.62 s
[vector] spanR: OK
1126.62 s
[vector] +++ OK, passed 100 tests.
1126.62 s
[vector] breakR: OK
1126.62 s
[vector] +++ OK, passed 100 tests.
1126.63 s
[vector] groupBy: OK
1126.63 s
[vector] +++ OK, passed 100 tests.
1126.63 s
[vector] elem: OK
1126.63 s
[vector] +++ OK, passed 100 tests.
1126.63 s
[vector] notElem: OK
1126.63 s
[vector] +++ OK, passed 100 tests.
1126.63 s
[vector] find: OK
1126.63 s
[vector] +++ OK, passed 100 tests.
1126.63 s
[vector] findIndex: OK
1126.63 s
[vector] +++ OK, passed 100 tests.
1126.63 s
[vector] findIndexR: OK
1126.63 s
[vector] +++ OK, passed 100 tests.
1126.63 s
[vector] findIndices: OK
1126.63 s
[vector] +++ OK, passed 100 tests.
1126.63 s
[vector] elemIndex: OK
1126.63 s
[vector] +++ OK, passed 100 tests.
1126.64 s
[vector] elemIndices: OK
1126.64 s
[vector] +++ OK, passed 100 tests.
1126.64 s
[vector] foldl: OK
1126.65 s
[vector] +++ OK, passed 100 tests.
1126.65 s
[vector] foldl1: OK
1126.66 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1126.66 s
[vector] foldl': OK
1126.66 s
[vector] +++ OK, passed 100 tests.
1126.66 s
[vector] foldl1': OK
1126.66 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1126.66 s
[vector] foldr: OK
1126.66 s
[vector] +++ OK, passed 100 tests.
1126.66 s
[vector] foldr1: OK
1126.66 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1126.66 s
[vector] foldr': OK
1126.66 s
[vector] +++ OK, passed 100 tests.
1126.66 s
[vector] foldr1': OK
1126.67 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1126.67 s
[pandoc-server] [2 of 2] Linking Setup
1126.67 s
[vector] ifoldl: OK
1126.68 s
[vector] +++ OK, passed 100 tests.
1126.68 s
[vector] ifoldl': OK
1126.68 s
[vector] +++ OK, passed 100 tests.
1126.70 s
[vector] ifoldr: OK
1126.70 s
[vector] +++ OK, passed 100 tests.
1126.70 s
[vector] ifoldr': OK
1126.70 s
[vector] +++ OK, passed 100 tests.
1126.70 s
[vector] ifoldM: OK
1126.70 s
[vector] +++ OK, passed 100 tests.
1126.70 s
[vector] ifoldM': OK
1126.70 s
[vector] +++ OK, passed 100 tests.
1126.71 s
[vector] ifoldM_: OK (0.01s)
1126.71 s
[vector] +++ OK, passed 100 tests.
1126.71 s
[vector] ifoldM'_: OK (0.01s)
1126.71 s
[vector] +++ OK, passed 100 tests.
1126.71 s
[vector] all: OK
1126.72 s
[vector] +++ OK, passed 100 tests.
1126.72 s
[vector] any: OK
1126.72 s
[vector] +++ OK, passed 100 tests.
1126.72 s
[vector] prescanl: OK
1126.72 s
[vector] +++ OK, passed 100 tests.
1126.72 s
[vector] prescanl': OK
1126.72 s
[vector] +++ OK, passed 100 tests.
1126.73 s
[vector] postscanl: OK
1126.73 s
[vector] +++ OK, passed 100 tests.
1126.73 s
[vector] postscanl': OK
1126.73 s
[vector] +++ OK, passed 100 tests.
1126.74 s
[vector] scanl: OK
1126.74 s
[vector] +++ OK, passed 100 tests.
1126.74 s
[vector] scanl': OK
1126.74 s
[vector] +++ OK, passed 100 tests.
1126.74 s
[vector] scanl1: OK
1126.74 s
[vector] +++ OK, passed 100 tests.
1126.74 s
[vector] scanl1': OK
1126.74 s
[vector] +++ OK, passed 100 tests.
1126.74 s
[vector] iscanl: OK
1126.74 s
[vector] +++ OK, passed 100 tests.
1126.74 s
[vector] iscanl': OK
1126.74 s
[vector] +++ OK, passed 100 tests.
1126.74 s
[vector] prescanr: OK
1126.74 s
[vector] +++ OK, passed 100 tests.
1126.74 s
[vector] prescanr': OK
1126.75 s
[vector] +++ OK, passed 100 tests.
1126.75 s
[vector] postscanr: OK
1126.75 s
[vector] +++ OK, passed 100 tests.
1126.75 s
[vector] postscanr': OK
1126.75 s
[vector] +++ OK, passed 100 tests.
1126.75 s
[vector] scanr: OK
1126.75 s
[vector] +++ OK, passed 100 tests.
1126.75 s
[vector] scanr': OK
1126.76 s
[vector] +++ OK, passed 100 tests.
1126.76 s
[vector] scanr1: OK
1126.76 s
[vector] +++ OK, passed 100 tests.
1126.76 s
[vector] scanr1': OK
1126.76 s
[vector] +++ OK, passed 100 tests.
1126.76 s
[vector] iscanr: OK
1126.76 s
[vector] +++ OK, passed 100 tests.
1126.77 s
[vector] iscanr': OK
1126.77 s
[vector] +++ OK, passed 100 tests.
1126.77 s
[vector] mut_read: OK
1126.77 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1126.77 s
[vector] mut_write: OK
1126.77 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1126.77 s
[vector] mut_modify: OK
1126.77 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1126.77 s
[vector] mut_generate: OK
1126.78 s
[vector] +++ OK, passed 100 tests.
1126.79 s
[vector] mut_generateM: OK
1126.80 s
[vector] +++ OK, passed 100 tests.
1126.80 s
[vector] mut_mapM_: OK (0.01s)
1126.80 s
[vector] +++ OK, passed 100 tests.
1126.82 s
[vector] mut_imapM_: OK (0.01s)
1126.82 s
[vector] +++ OK, passed 100 tests.
1126.82 s
[vector] mut_forM_: OK (0.01s)
1126.82 s
[vector] +++ OK, passed 100 tests.
1126.83 s
[vector] mut_iforM_: OK
1126.83 s
[vector] +++ OK, passed 100 tests.
1126.84 s
[vector] mut_foldr: OK
1126.84 s
[vector] +++ OK, passed 100 tests.
1126.84 s
[vector] mut_foldr': OK
1126.84 s
[vector] +++ OK, passed 100 tests.
1126.84 s
[vector] mut_foldl: OK
1126.85 s
[vector] +++ OK, passed 100 tests.
1126.85 s
[vector] mut_foldl': OK
1126.85 s
[vector] +++ OK, passed 100 tests.
1126.85 s
[vector] mut_ifoldr: OK
1126.85 s
[vector] +++ OK, passed 100 tests.
1126.85 s
[vector] mut_ifoldr': OK
1126.85 s
[vector] +++ OK, passed 100 tests.
1126.85 s
[vector] mut_ifoldl: OK
1126.85 s
[vector] +++ OK, passed 100 tests.
1126.86 s
[vector] mut_ifoldl': OK
1126.86 s
[vector] +++ OK, passed 100 tests.
1126.86 s
[vector] mut_foldM: OK
1126.86 s
[vector] +++ OK, passed 100 tests.
1126.86 s
[vector] mut_foldM': OK
1126.86 s
[vector] +++ OK, passed 100 tests.
1126.87 s
[vector] mut_foldrM: OK
1126.87 s
[vector] +++ OK, passed 100 tests.
1126.87 s
[vector] mut_foldrM': OK
1126.87 s
[vector] +++ OK, passed 100 tests.
1126.87 s
[vector] mut_ifoldM: OK
1126.88 s
[vector] +++ OK, passed 100 tests.
1126.88 s
[vector] mut_ifoldM': OK
1126.88 s
[vector] +++ OK, passed 100 tests.
1126.88 s
[vector] mut_ifoldrM: OK
1126.88 s
[vector] +++ OK, passed 100 tests.
1126.88 s
[vector] mut_ifoldrM': OK
1126.88 s
[vector] +++ OK, passed 100 tests.
1126.88 s
[vector] compare: OK
1126.88 s
[vector] +++ OK, passed 100 tests.
1126.88 s
[vector] maximum: OK
1126.88 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1126.88 s
[vector] minimum: OK
1126.88 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1126.88 s
[vector] minIndex: OK
1126.88 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1126.88 s
[vector] maxIndex: OK
1126.88 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1126.88 s
[vector] maximumBy: OK
1126.88 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1126.88 s
[vector] minimumBy: OK
1126.88 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1126.88 s
[vector] maximumOn: OK
1126.88 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1126.88 s
[vector] minimumOn: OK
1126.88 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1126.88 s
[vector] maxIndexBy: OK
1126.88 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1126.88 s
[vector] minIndexBy: OK
1126.88 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1126.88 s
[vector] ListFirstMaxIndexWins: OK
1126.88 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1126.88 s
[vector] FalseListFirstMaxIndexWins: OK
1126.88 s
[vector] +++ OK, failed as expected. (after 1 test):
1126.89 s
[vector] Exception:
1126.89 s
[vector] Prelude.foldr1: empty list
1126.89 s
[vector] CallStack (from HasCallStack):
1126.89 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1126.89 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1126.89 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1126.89 s
[vector] []
1126.89 s
[vector] mempty: OK
1126.89 s
[vector] +++ OK, passed 100 tests.
1126.90 s
[vector] mappend: OK
1126.90 s
[vector] +++ OK, passed 100 tests.
1126.90 s
[vector] mconcat: OK (0.01s)
1126.90 s
[vector] +++ OK, passed 100 tests.
1126.90 s
[vector] glength: OK
1126.90 s
[vector] +++ OK, passed 100 tests.
1126.90 s
[vector] sum: OK
1126.90 s
[vector] +++ OK, passed 100 tests.
1126.90 s
[vector] product: OK
1126.90 s
[vector] +++ OK, passed 100 tests.
1126.90 s
[vector] enumFromN: OK
1126.90 s
[vector] +++ OK, passed 100 tests.
1126.90 s
[vector] enumFromThenN: OK
1126.90 s
[vector] +++ OK, passed 100 tests.
1126.90 s
[vector] enumFromTo: OK
1126.90 s
[vector] +++ OK, passed 100 tests.
1126.90 s
[vector] enumFromThenTo: OK
1126.90 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1126.90 s
[vector] Double
1126.90 s
[vector] fromList.toList == id: OK
1126.90 s
[vector] +++ OK, passed 100 tests.
1126.91 s
[vector] toList.fromList == id: OK
1126.91 s
[vector] +++ OK, passed 100 tests.
1126.91 s
[vector] unstream.stream == id: OK
1126.91 s
[vector] +++ OK, passed 100 tests.
1126.91 s
[vector] stream.unstream == id: OK
1126.91 s
[vector] +++ OK, passed 100 tests.
1126.91 s
[vector] eq: OK
1126.91 s
[vector] +++ OK, passed 100 tests.
1126.91 s
[vector] length: OK
1126.91 s
[vector] +++ OK, passed 100 tests.
1126.91 s
[vector] null: OK
1126.91 s
[vector] +++ OK, passed 100 tests.
1126.91 s
[vector] index: OK
1126.91 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1126.91 s
[vector] safeIndex: OK
1126.91 s
[vector] +++ OK, passed 100 tests.
1126.91 s
[vector] head: OK
1126.91 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1126.91 s
[vector] last: OK
1126.91 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1126.91 s
[vector] unsafeIndex: OK
1126.91 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1126.91 s
[vector] unsafeHead: OK
1126.91 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1126.91 s
[vector] unsafeLast: OK
1126.91 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1126.91 s
[vector] slice: OK
1126.91 s
[vector] +++ OK, passed 100 tests.
1126.91 s
[vector] init: OK
1126.91 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1126.92 s
[vector] tail: OK
1126.92 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1126.92 s
[vector] take: OK
1126.92 s
[vector] +++ OK, passed 100 tests.
1126.92 s
[vector] drop: OK
1126.92 s
[vector] +++ OK, passed 100 tests.
1126.92 s
[vector] splitAt: OK
1126.92 s
[vector] +++ OK, passed 100 tests.
1126.92 s
[vector] empty: OK
1126.92 s
[vector] +++ OK, passed 100 tests.
1126.92 s
[vector] singleton: OK
1126.92 s
[vector] +++ OK, passed 100 tests.
1126.92 s
[vector] replicate: OK
1126.92 s
[vector] +++ OK, passed 100 tests.
1126.92 s
[vector] generate: OK
1126.92 s
[vector] +++ OK, passed 100 tests.
1126.94 s
[vector] iterateN: OK
1126.94 s
[vector] +++ OK, passed 100 tests.
1126.98 s
[vector] iterateNM: OK (0.03s)
1126.98 s
[vector] +++ OK, passed 100 tests.
1126.99 s
[vector] generateM: OK (0.02s)
1126.99 s
[vector] +++ OK, passed 100 tests.
1126.99 s
[vector] replicateM: OK
1126.99 s
[vector] +++ OK, passed 100 tests.
1126.99 s
[vector] create: OK
1126.99 s
[vector] +++ OK, passed 100 tests.
1126.99 s
[vector] createT: OK
1126.99 s
[vector] +++ OK, passed 100 tests.
1126.99 s
[vector] unfoldr: OK
1126.99 s
[vector] +++ OK, passed 100 tests.
1126.99 s
[vector] unfoldrN: OK
1127.00 s
[vector] +++ OK, passed 100 tests.
1127.00 s
[vector] unfoldrExactN: OK
1127.00 s
[vector] +++ OK, passed 100 tests.
1127.00 s
[vector] unfoldrM: OK
1127.00 s
[vector] +++ OK, passed 100 tests.
1127.02 s
[vector] unfoldrNM: OK
1127.02 s
[vector] +++ OK, passed 100 tests.
1127.03 s
[vector] unfoldrExactNM: OK (0.02s)
1127.03 s
[vector] +++ OK, passed 100 tests.
1127.04 s
[vector] constructN: OK (0.01s)
1127.04 s
[vector] +++ OK, passed 100 tests.
1127.05 s
[vector] constructrN: OK (0.01s)
1127.05 s
[vector] +++ OK, passed 100 tests.
1127.05 s
[vector] cons: OK
1127.05 s
[vector] +++ OK, passed 100 tests.
1127.05 s
[vector] snoc: OK
1127.05 s
[vector] +++ OK, passed 100 tests.
1127.05 s
[vector] append: OK
1127.06 s
[vector] +++ OK, passed 100 tests.
1127.08 s
[vector] concat: OK (0.03s)
1127.08 s
[vector] +++ OK, passed 100 tests.
1127.08 s
[vector] force: OK
1127.08 s
[vector] +++ OK, passed 100 tests.
1127.09 s
[vector] upd: OK
1127.10 s
[vector] +++ OK, passed 100 tests.
1127.10 s
[vector] accum: OK (0.01s)
1127.10 s
[vector] +++ OK, passed 100 tests.
1127.10 s
[vector] reverse: OK
1127.10 s
[vector] +++ OK, passed 100 tests.
1127.11 s
[vector] backpermute: OK
1127.11 s
[vector] +++ OK, passed 100 tests.
1127.12 s
[vector] map: OK
1127.12 s
[vector] +++ OK, passed 100 tests.
1127.12 s
[vector] imap: OK (0.01s)
1127.12 s
[vector] +++ OK, passed 100 tests.
1127.13 s
[vector] concatMap: OK
1127.13 s
[vector] +++ OK, passed 100 tests.
1127.14 s
[vector] mapM: OK
1127.14 s
[vector] +++ OK, passed 100 tests.
1127.18 s
[vector] mapM_: OK (0.04s)
1127.18 s
[vector] +++ OK, passed 100 tests.
1127.18 s
[vector] forM: OK
1127.18 s
[vector] +++ OK, passed 100 tests.
1127.22 s
[vector] forM_: OK (0.03s)
1127.22 s
[vector] +++ OK, passed 100 tests.
1127.22 s
[vector] imapM: OK
1127.22 s
[vector] +++ OK, passed 100 tests.
1127.25 s
[vector] imapM_: OK (0.03s)
1127.26 s
[vector] +++ OK, passed 100 tests.
1127.26 s
[vector] zipWith: OK
1127.26 s
[vector] +++ OK, passed 100 tests.
1127.27 s
[vector] zipWith3: OK (0.01s)
1127.28 s
[vector] +++ OK, passed 100 tests.
1127.28 s
[vector] izipWith: OK
1127.28 s
[vector] +++ OK, passed 100 tests.
1127.29 s
[vector] izipWith3: OK
1127.30 s
[vector] +++ OK, passed 100 tests.
1127.30 s
[vector] izipWithM: OK
1127.30 s
[vector] +++ OK, passed 100 tests.
1127.32 s
[vector] izipWithM_: OK (0.03s)
1127.32 s
[vector] +++ OK, passed 100 tests.
1127.33 s
[vector] zipWithM: OK
1127.34 s
[vector] +++ OK, passed 100 tests.
1127.37 s
[vector] zipWithM_: OK (0.03s)
1127.37 s
[vector] +++ OK, passed 100 tests.
1127.37 s
[vector] filter: OK
1127.38 s
[vector] +++ OK, passed 100 tests.
1127.38 s
[vector] ifilter: OK
1127.38 s
[vector] +++ OK, passed 100 tests.
1127.42 s
[vector] filterM: OK (0.04s)
1127.42 s
[vector] +++ OK, passed 100 tests.
1127.42 s
[vector] uniq: OK
1127.42 s
[vector] +++ OK, passed 100 tests.
1127.43 s
[vector] mapMaybe: OK
1127.43 s
[vector] +++ OK, passed 100 tests.
1127.43 s
[vector] imapMaybe: OK
1127.43 s
[vector] +++ OK, passed 100 tests.
1127.43 s
[vector] takeWhile: OK
1127.43 s
[vector] +++ OK, passed 100 tests.
1127.44 s
[vector] dropWhile: OK
1127.45 s
[vector] +++ OK, passed 100 tests.
1127.45 s
[vector] partition: OK
1127.45 s
[vector] +++ OK, passed 100 tests.
1127.45 s
[vector] partitionWith: OK
1127.45 s
[vector] +++ OK, passed 100 tests.
1127.46 s
[vector] span: OK
1127.46 s
[vector] +++ OK, passed 100 tests.
1127.46 s
[vector] break: OK
1127.46 s
[vector] +++ OK, passed 100 tests.
1127.46 s
[vector] spanR: OK
1127.46 s
[vector] +++ OK, passed 100 tests.
1127.47 s
[vector] breakR: OK
1127.47 s
[vector] +++ OK, passed 100 tests.
1127.48 s
[vector] groupBy: OK (0.01s)
1127.48 s
[vector] +++ OK, passed 100 tests.
1127.48 s
[vector] elem: OK
1127.48 s
[vector] +++ OK, passed 100 tests.
1127.48 s
[vector] notElem: OK
1127.48 s
[vector] +++ OK, passed 100 tests.
1127.48 s
[vector] find: OK
1127.48 s
[vector] +++ OK, passed 100 tests.
1127.48 s
[vector] findIndex: OK
1127.48 s
[vector] +++ OK, passed 100 tests.
1127.49 s
[vector] findIndexR: OK
1127.49 s
[vector] +++ OK, passed 100 tests.
1127.50 s
[vector] findIndices: OK
1127.50 s
[vector] +++ OK, passed 100 tests.
1127.50 s
[vector] elemIndex: OK
1127.50 s
[vector] +++ OK, passed 100 tests.
1127.51 s
[vector] elemIndices: OK
1127.51 s
[vector] +++ OK, passed 100 tests.
1127.51 s
[vector] foldl: OK (0.01s)
1127.51 s
[vector] +++ OK, passed 100 tests.
1127.52 s
[vector] foldl1: OK (0.01s)
1127.52 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1127.52 s
[vector] foldl': OK (0.01s)
1127.52 s
[vector] +++ OK, passed 100 tests.
1127.55 s
[vector] foldl1': OK
1127.56 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1127.56 s
[vector] foldr: OK (0.01s)
1127.56 s
[vector] +++ OK, passed 100 tests.
1127.58 s
[vector] foldr1: OK (0.01s)
1127.58 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1127.58 s
[vector] foldr': OK (0.01s)
1127.58 s
[vector] +++ OK, passed 100 tests.
1127.59 s
[vector] foldr1': OK
1127.59 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1127.61 s
[vector] ifoldl: OK (0.01s)
1127.62 s
[vector] +++ OK, passed 100 tests.
1127.62 s
[vector] ifoldl': OK (0.01s)
1127.62 s
[vector] +++ OK, passed 100 tests.
1127.63 s
[vector] ifoldr: OK (0.01s)
1127.63 s
[vector] +++ OK, passed 100 tests.
1127.65 s
[vector] ifoldr': OK
1127.66 s
[vector] +++ OK, passed 100 tests.
1127.66 s
[vector] ifoldM: OK (0.01s)
1127.66 s
[vector] +++ OK, passed 100 tests.
1127.68 s
[vector] ifoldM': OK (0.02s)
1127.68 s
[vector] +++ OK, passed 100 tests.
1127.71 s
[vector] ifoldM_: OK (0.04s)
1127.71 s
[vector] +++ OK, passed 100 tests.
1127.74 s
[vector] ifoldM'_: OK (0.03s)
1127.74 s
[vector] +++ OK, passed 100 tests.
1127.75 s
[vector] all: OK
1127.75 s
[vector] +++ OK, passed 100 tests.
1127.76 s
[vector] any: OK
1127.76 s
[vector] +++ OK, passed 100 tests.
1127.76 s
[vector] prescanl: OK (0.02s)
1127.76 s
[vector] +++ OK, passed 100 tests.
1127.79 s
[vector] prescanl': OK
1127.80 s
[vector] +++ OK, passed 100 tests.
1127.80 s
[vector] postscanl: OK (0.02s)
1127.80 s
[vector] +++ OK, passed 100 tests.
1127.82 s
[vector] postscanl': OK (0.02s)
1127.82 s
[vector] +++ OK, passed 100 tests.
1127.84 s
[vector] scanl: OK (0.01s)
1127.84 s
[vector] +++ OK, passed 100 tests.
1127.85 s
[vector] scanl': OK (0.01s)
1127.85 s
[vector] +++ OK, passed 100 tests.
1127.85 s
[vector] scanl1: OK (0.01s)
1127.85 s
[vector] +++ OK, passed 100 tests.
1127.88 s
[vector] scanl1': OK (0.01s)
1127.88 s
[vector] +++ OK, passed 100 tests.
1127.90 s
[vector] iscanl: OK (0.02s)
1127.90 s
[vector] +++ OK, passed 100 tests.
1127.91 s
[vector] iscanl': OK (0.01s)
1127.92 s
[vector] +++ OK, passed 100 tests.
1127.92 s
[vector] prescanr: OK (0.01s)
1127.92 s
[vector] +++ OK, passed 100 tests.
1127.94 s
[vector] prescanr': OK (0.01s)
1127.94 s
[vector] +++ OK, passed 100 tests.
1127.95 s
[vector] postscanr: OK (0.01s)
1127.95 s
[vector] +++ OK, passed 100 tests.
1127.96 s
[vector] postscanr': OK (0.01s)
1127.96 s
[vector] +++ OK, passed 100 tests.
1127.97 s
[vector] scanr: OK (0.02s)
1127.97 s
[vector] +++ OK, passed 100 tests.
1127.97 s
[pandoc-lua-engine] Phase: updateAutotoolsGnuConfigScriptsPhase
1127.98 s
[vector] scanr': OK
1127.98 s
[vector] +++ OK, passed 100 tests.
1127.99 s
[pandoc-lua-engine] Phase: configurePhase
1127.99 s
[vector] scanr1: OK (0.01s)
1127.99 s
[vector] +++ OK, passed 100 tests.
1128.00 s
[pandoc-lua-engine] configureFlags: --verbose --prefix=/nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/afm4wyap4sbadgn4yb21k7aszlkwhgrc-pandoc-lua-engine-0.4.3-doc/share/doc/pandoc-lua-engine-0.4.3 --with-gcc=gcc --package-db=/build/tmp.Cct0YVRSkE/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
1128.01 s
[pandoc-lua-engine] Using Parsec parser
1128.01 s
[pandoc-lua-engine] Configuring pandoc-lua-engine-0.4.3...
1128.02 s
[vector] scanr1': OK (0.01s)
1128.02 s
[vector] +++ OK, passed 100 tests.
1128.03 s
[vector] iscanr: OK (0.01s)
1128.03 s
[vector] +++ OK, passed 100 tests.
1128.03 s
[vector] iscanr': OK (0.01s)
1128.03 s
[vector] +++ OK, passed 100 tests.
1128.03 s
[vector] mut_read: OK
1128.03 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1128.04 s
[vector] mut_write: OK
1128.04 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1128.06 s
[vector] mut_modify: OK
1128.08 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1128.08 s
[vector] mut_generate: OK
1128.08 s
[vector] +++ OK, passed 100 tests.
1128.08 s
[vector] mut_generateM: OK (0.03s)
1128.08 s
[vector] +++ OK, passed 100 tests.
1128.12 s
[vector] mut_mapM_: OK (0.03s)
1128.12 s
[vector] +++ OK, passed 100 tests.
1128.14 s
[vector] mut_imapM_: OK (0.03s)
1128.14 s
[vector] +++ OK, passed 100 tests.
1128.16 s
[vector] mut_forM_: OK (0.03s)
1128.16 s
[vector] +++ OK, passed 100 tests.
1128.21 s
[vector] mut_iforM_: OK (0.02s)
1128.21 s
[vector] +++ OK, passed 100 tests.
1128.22 s
[vector] mut_foldr: OK (0.01s)
1128.22 s
[vector] +++ OK, passed 100 tests.
1128.22 s
[pandoc-server] Phase: updateAutotoolsGnuConfigScriptsPhase
1128.24 s
[vector] mut_foldr': OK (0.01s)
1128.24 s
[vector] +++ OK, passed 100 tests.
1128.25 s
[vector] mut_foldl: OK (0.01s)
1128.26 s
[vector] +++ OK, passed 100 tests.
1128.26 s
[vector] mut_foldl': OK (0.01s)
1128.26 s
[vector] +++ OK, passed 100 tests.
1128.27 s
[pandoc-server] Phase: configurePhase
1128.27 s
[vector] mut_ifoldr: OK (0.01s)
1128.28 s
[vector] +++ OK, passed 100 tests.
1128.28 s
[pandoc-server] configureFlags: --verbose --prefix=/nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/3j1008pz7rfr2k0141d78adq5awkm1r7-pandoc-server-0.1.0.11-doc/share/doc/pandoc-server-0.1.0.11 --with-gcc=gcc --package-db=/build/tmp.YhKdfDoWze/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
1128.28 s
[vector] mut_ifoldr': OK (0.01s)
1128.28 s
[vector] +++ OK, passed 100 tests.
1128.29 s
[pandoc-server] Using Parsec parser
1128.29 s
[pandoc-server] Configuring pandoc-server-0.1.0.11...
1128.30 s
[vector] mut_ifoldl: OK (0.01s)
1128.30 s
[vector] +++ OK, passed 100 tests.
1128.31 s
[vector] mut_ifoldl': OK (0.01s)
1128.32 s
[vector] +++ OK, passed 100 tests.
1128.32 s
[vector] mut_foldM: OK (0.01s)
1128.32 s
[vector] +++ OK, passed 100 tests.
1128.34 s
[vector] mut_foldM': OK (0.01s)
1128.34 s
[vector] +++ OK, passed 100 tests.
1128.36 s
[vector] mut_foldrM: OK (0.02s)
1128.36 s
[vector] +++ OK, passed 100 tests.
1128.38 s
[vector] mut_foldrM': OK (0.01s)
1128.38 s
[vector] +++ OK, passed 100 tests.
1128.39 s
[vector] mut_ifoldM: OK (0.02s)
1128.39 s
[vector] +++ OK, passed 100 tests.
1128.40 s
[vector] mut_ifoldM': OK (0.01s)
1128.40 s
[vector] +++ OK, passed 100 tests.
1128.42 s
[vector] mut_ifoldrM: OK (0.02s)
1128.42 s
[vector] +++ OK, passed 100 tests.
1128.43 s
[vector] mut_ifoldrM': OK (0.02s)
1128.43 s
[vector] +++ OK, passed 100 tests.
1128.43 s
[vector] compare: OK
1128.43 s
[vector] +++ OK, passed 100 tests.
1128.43 s
[vector] maximum: OK
1128.43 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1128.43 s
[vector] minimum: OK
1128.43 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1128.43 s
[vector] minIndex: OK
1128.43 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1128.43 s
[vector] maxIndex: OK
1128.43 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1128.43 s
[vector] maximumBy: OK
1128.43 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1128.43 s
[vector] minimumBy: OK
1128.43 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1128.43 s
[vector] maximumOn: OK
1128.43 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1128.43 s
[vector] minimumOn: OK
1128.43 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1128.44 s
[vector] maxIndexBy: OK
1128.44 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1128.44 s
[vector] minIndexBy: OK
1128.44 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1128.44 s
[vector] ListFirstMaxIndexWins: OK
1128.44 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1128.44 s
[vector] FalseListFirstMaxIndexWins: OK
1128.44 s
[vector] +++ OK, failed as expected. (after 1 test):
1128.44 s
[vector] Exception:
1128.44 s
[vector] Prelude.foldr1: empty list
1128.44 s
[vector] CallStack (from HasCallStack):
1128.44 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1128.44 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1128.44 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1128.44 s
[vector] []
1128.44 s
[vector] mempty: OK
1128.44 s
[vector] +++ OK, passed 100 tests.
1128.46 s
[vector] mappend: OK
1128.46 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] mconcat: OK (0.03s)
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] glength: OK
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] sum: OK
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] product: OK
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] enumFromN: OK
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] enumFromThenN: OK
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] enumFromTo: OK
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] enumFromThenTo: OK
1128.47 s
[vector] +++ OK, passed 100 tests; 2 discarded.
1128.47 s
[vector] unstream
1128.47 s
[vector] unstream == vunstream (exact): OK
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] unstream == vunstream (unknown): OK
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] unstreamR ~= vunstream (exact): OK
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] unstreamR ~= vunstream (unknown): OK
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] Tests.Vector.Storable
1128.47 s
[vector] Data.Vector.Storable.Vector (Int)
1128.47 s
[vector] fromList.toList == id: OK
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] toList.fromList == id: OK
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] unstream.stream == id: OK
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.47 s
[vector] stream.unstream == id: OK
1128.47 s
[vector] +++ OK, passed 100 tests.
1128.48 s
[vector] eq: OK
1128.48 s
[vector] +++ OK, passed 100 tests.
1128.48 s
[vector] length: OK
1128.48 s
[vector] +++ OK, passed 100 tests.
1128.48 s
[vector] null: OK
1128.48 s
[vector] +++ OK, passed 100 tests.
1128.48 s
[vector] index: OK
1128.48 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1128.48 s
[vector] safeIndex: OK
1128.48 s
[vector] +++ OK, passed 100 tests.
1128.48 s
[vector] head: OK
1128.48 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1128.48 s
[vector] last: OK
1128.48 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1128.48 s
[vector] unsafeIndex: OK
1128.48 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1128.48 s
[vector] unsafeHead: OK
1128.48 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1128.48 s
[vector] unsafeLast: OK
1128.48 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1128.48 s
[vector] slice: OK
1128.48 s
[vector] +++ OK, passed 100 tests.
1128.48 s
[vector] init: OK
1128.48 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1128.48 s
[vector] tail: OK
1128.48 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1128.48 s
[vector] take: OK
1128.48 s
[vector] +++ OK, passed 100 tests.
1128.48 s
[vector] drop: OK
1128.48 s
[vector] +++ OK, passed 100 tests.
1128.48 s
[vector] splitAt: OK
1128.48 s
[vector] +++ OK, passed 100 tests.
1128.48 s
[vector] empty: OK
1128.48 s
[vector] +++ OK, passed 100 tests.
1128.48 s
[vector] singleton: OK
1128.48 s
[vector] +++ OK, passed 100 tests.
1128.49 s
[vector] replicate: OK
1128.49 s
[vector] +++ OK, passed 100 tests.
1128.49 s
[vector] generate: OK
1128.49 s
[vector] +++ OK, passed 100 tests.
1128.49 s
[vector] iterateN: OK
1128.49 s
[vector] +++ OK, passed 100 tests.
1128.51 s
[vector] iterateNM: OK
1128.51 s
[vector] +++ OK, passed 100 tests.
1128.51 s
[vector] generateM: OK (0.01s)
1128.51 s
[vector] +++ OK, passed 100 tests.
1128.51 s
[vector] replicateM: OK
1128.51 s
[vector] +++ OK, passed 100 tests.
1128.52 s
[vector] create: OK
1128.52 s
[vector] +++ OK, passed 100 tests.
1128.52 s
[vector] createT: OK
1128.52 s
[vector] +++ OK, passed 100 tests.
1128.52 s
[vector] unfoldr: OK
1128.52 s
[vector] +++ OK, passed 100 tests.
1128.52 s
[vector] unfoldrN: OK
1128.52 s
[vector] +++ OK, passed 100 tests.
1128.53 s
[vector] unfoldrExactN: OK
1128.53 s
[vector] +++ OK, passed 100 tests.
1128.53 s
[vector] unfoldrM: OK
1128.53 s
[vector] +++ OK, passed 100 tests.
1128.53 s
[vector] unfoldrNM: OK
1128.54 s
[vector] +++ OK, passed 100 tests.
1128.55 s
[vector] unfoldrExactNM: OK (0.02s)
1128.55 s
[vector] +++ OK, passed 100 tests.
1128.55 s
[vector] constructN: OK
1128.55 s
[vector] +++ OK, passed 100 tests.
1128.55 s
[vector] constructrN: OK
1128.55 s
[vector] +++ OK, passed 100 tests.
1128.55 s
[vector] cons: OK
1128.55 s
[vector] +++ OK, passed 100 tests.
1128.55 s
[vector] snoc: OK
1128.55 s
[vector] +++ OK, passed 100 tests.
1128.55 s
[vector] append: OK
1128.55 s
[vector] +++ OK, passed 100 tests.
1128.57 s
[vector] concat: OK (0.01s)
1128.57 s
[vector] +++ OK, passed 100 tests.
1128.57 s
[vector] force: OK
1128.57 s
[vector] +++ OK, passed 100 tests.
1128.57 s
[vector] upd: OK
1128.57 s
[vector] +++ OK, passed 100 tests.
1128.58 s
[vector] accum: OK
1128.58 s
[vector] +++ OK, passed 100 tests.
1128.58 s
[vector] reverse: OK
1128.58 s
[vector] +++ OK, passed 100 tests.
1128.58 s
[vector] backpermute: OK
1128.58 s
[vector] +++ OK, passed 100 tests.
1128.58 s
[vector] map: OK
1128.58 s
[vector] +++ OK, passed 100 tests.
1128.58 s
[vector] imap: OK
1128.58 s
[vector] +++ OK, passed 100 tests.
1128.58 s
[vector] concatMap: OK
1128.58 s
[vector] +++ OK, passed 100 tests.
1128.58 s
[vector] mapM: OK
1128.60 s
[vector] +++ OK, passed 100 tests.
1128.60 s
[vector] mapM_: OK (0.01s)
1128.61 s
[vector] +++ OK, passed 100 tests.
1128.62 s
[vector] forM: OK
1128.62 s
[vector] +++ OK, passed 100 tests.
1128.62 s
[vector] forM_: OK (0.02s)
1128.62 s
[vector] +++ OK, passed 100 tests.
1128.63 s
[vector] imapM: OK
1128.63 s
[vector] +++ OK, passed 100 tests.
1128.64 s
[vector] imapM_: OK (0.02s)
1128.64 s
[vector] +++ OK, passed 100 tests.
1128.64 s
[vector] zipWith: OK
1128.64 s
[vector] +++ OK, passed 100 tests.
1128.64 s
[vector] zipWith3: OK
1128.64 s
[vector] +++ OK, passed 100 tests.
1128.64 s
[vector] izipWith: OK
1128.64 s
[vector] +++ OK, passed 100 tests.
1128.65 s
[vector] izipWith3: OK
1128.65 s
[vector] +++ OK, passed 100 tests.
1128.66 s
[vector] izipWithM: OK
1128.66 s
[vector] +++ OK, passed 100 tests.
1128.66 s
[vector] izipWithM_: OK (0.01s)
1128.68 s
[vector] +++ OK, passed 100 tests.
1128.68 s
[vector] zipWithM: OK
1128.68 s
[vector] +++ OK, passed 100 tests.
1128.68 s
[vector] zipWithM_: OK (0.01s)
1128.68 s
[vector] +++ OK, passed 100 tests.
1128.68 s
[vector] filter: OK
1128.68 s
[vector] +++ OK, passed 100 tests.
1128.68 s
[vector] ifilter: OK
1128.70 s
[vector] +++ OK, passed 100 tests.
1128.70 s
[vector] filterM: OK (0.02s)
1128.70 s
[vector] +++ OK, passed 100 tests.
1128.70 s
[vector] uniq: OK
1128.70 s
[vector] +++ OK, passed 100 tests.
1128.71 s
[vector] mapMaybe: OK
1128.71 s
[vector] +++ OK, passed 100 tests.
1128.71 s
[vector] imapMaybe: OK
1128.71 s
[vector] +++ OK, passed 100 tests.
1128.71 s
[vector] takeWhile: OK
1128.71 s
[vector] +++ OK, passed 100 tests.
1128.71 s
[vector] dropWhile: OK
1128.71 s
[vector] +++ OK, passed 100 tests.
1128.71 s
[vector] partition: OK
1128.71 s
[vector] +++ OK, passed 100 tests.
1128.71 s
[vector] partitionWith: OK
1128.71 s
[vector] +++ OK, passed 100 tests.
1128.71 s
[vector] span: OK
1128.71 s
[vector] +++ OK, passed 100 tests.
1128.72 s
[vector] break: OK
1128.72 s
[vector] +++ OK, passed 100 tests.
1128.72 s
[vector] spanR: OK
1128.72 s
[vector] +++ OK, passed 100 tests.
1128.72 s
[vector] breakR: OK
1128.72 s
[vector] +++ OK, passed 100 tests.
1128.72 s
[vector] groupBy: OK
1128.72 s
[vector] +++ OK, passed 100 tests.
1128.72 s
[vector] elem: OK
1128.72 s
[vector] +++ OK, passed 100 tests.
1128.72 s
[vector] notElem: OK
1128.72 s
[vector] +++ OK, passed 100 tests.
1128.72 s
[vector] find: OK
1128.72 s
[vector] +++ OK, passed 100 tests.
1128.72 s
[vector] findIndex: OK
1128.72 s
[vector] +++ OK, passed 100 tests.
1128.72 s
[vector] findIndexR: OK
1128.72 s
[vector] +++ OK, passed 100 tests.
1128.72 s
[vector] findIndices: OK
1128.72 s
[vector] +++ OK, passed 100 tests.
1128.72 s
[vector] elemIndex: OK
1128.72 s
[vector] +++ OK, passed 100 tests.
1128.72 s
[vector] elemIndices: OK
1128.73 s
[vector] +++ OK, passed 100 tests.
1128.73 s
[vector] foldl: OK
1128.73 s
[vector] +++ OK, passed 100 tests.
1128.73 s
[vector] foldl1: OK
1128.73 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1128.73 s
[vector] foldl': OK
1128.73 s
[vector] +++ OK, passed 100 tests.
1128.73 s
[vector] foldl1': OK
1128.73 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1128.74 s
[vector] foldr: OK
1128.74 s
[vector] +++ OK, passed 100 tests.
1128.74 s
[vector] foldr1: OK
1128.74 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1128.74 s
[vector] foldr': OK
1128.74 s
[vector] +++ OK, passed 100 tests.
1128.74 s
[vector] foldr1': OK
1128.74 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1128.74 s
[vector] ifoldl: OK
1128.75 s
[vector] +++ OK, passed 100 tests.
1128.75 s
[vector] ifoldl': OK
1128.75 s
[vector] +++ OK, passed 100 tests.
1128.76 s
[vector] ifoldr: OK
1128.76 s
[vector] +++ OK, passed 100 tests.
1128.76 s
[vector] ifoldr': OK
1128.76 s
[vector] +++ OK, passed 100 tests.
1128.76 s
[vector] ifoldM: OK
1128.76 s
[vector] +++ OK, passed 100 tests.
1128.76 s
[vector] ifoldM': OK
1128.76 s
[vector] +++ OK, passed 100 tests.
1128.79 s
[vector] ifoldM_: OK (0.02s)
1128.79 s
[vector] +++ OK, passed 100 tests.
1128.79 s
[vector] ifoldM'_: OK (0.02s)
1128.79 s
[vector] +++ OK, passed 100 tests.
1128.79 s
[vector] all: OK
1128.79 s
[vector] +++ OK, passed 100 tests.
1128.79 s
[vector] any: OK
1128.80 s
[vector] +++ OK, passed 100 tests.
1128.80 s
[vector] prescanl: OK
1128.80 s
[vector] +++ OK, passed 100 tests.
1128.81 s
[vector] prescanl': OK
1128.81 s
[vector] +++ OK, passed 100 tests.
1128.81 s
[vector] postscanl: OK
1128.82 s
[vector] +++ OK, passed 100 tests.
1128.82 s
[vector] postscanl': OK
1128.82 s
[vector] +++ OK, passed 100 tests.
1128.82 s
[vector] scanl: OK
1128.82 s
[vector] +++ OK, passed 100 tests.
1128.82 s
[vector] scanl': OK
1128.82 s
[vector] +++ OK, passed 100 tests.
1128.82 s
[vector] scanl1: OK
1128.82 s
[vector] +++ OK, passed 100 tests.
1128.82 s
[vector] scanl1': OK
1128.82 s
[vector] +++ OK, passed 100 tests.
1128.82 s
[vector] iscanl: OK
1128.82 s
[vector] +++ OK, passed 100 tests.
1128.83 s
[vector] iscanl': OK
1128.83 s
[vector] +++ OK, passed 100 tests.
1128.84 s
[vector] prescanr: OK
1128.84 s
[vector] +++ OK, passed 100 tests.
1128.84 s
[vector] prescanr': OK
1128.84 s
[vector] +++ OK, passed 100 tests.
1128.84 s
[vector] postscanr: OK
1128.85 s
[vector] +++ OK, passed 100 tests.
1128.85 s
[vector] postscanr': OK
1128.85 s
[vector] +++ OK, passed 100 tests.
1128.85 s
[vector] scanr: OK
1128.85 s
[vector] +++ OK, passed 100 tests.
1128.85 s
[vector] scanr': OK
1128.85 s
[vector] +++ OK, passed 100 tests.
1128.85 s
[vector] scanr1: OK
1128.85 s
[vector] +++ OK, passed 100 tests.
1128.86 s
[vector] scanr1': OK
1128.86 s
[vector] +++ OK, passed 100 tests.
1128.86 s
[vector] iscanr: OK
1128.86 s
[vector] +++ OK, passed 100 tests.
1128.86 s
[vector] iscanr': OK
1128.86 s
[vector] +++ OK, passed 100 tests.
1128.88 s
[vector] mut_read: OK
1128.88 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1128.89 s
[vector] mut_write: OK
1128.89 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1128.89 s
[vector] mut_modify: OK
1128.89 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1128.89 s
[vector] mut_generate: OK
1128.90 s
[vector] +++ OK, passed 100 tests.
1128.90 s
[vector] mut_generateM: OK
1128.90 s
[vector] +++ OK, passed 100 tests.
1128.90 s
[vector] mut_mapM_: OK (0.02s)
1128.90 s
[vector] +++ OK, passed 100 tests.
1128.90 s
[vector] mut_imapM_: OK (0.01s)
1128.90 s
[vector] +++ OK, passed 100 tests.
1128.92 s
[vector] mut_forM_: OK (0.01s)
1128.92 s
[vector] +++ OK, passed 100 tests.
1128.92 s
[vector] mut_iforM_: OK (0.01s)
1128.92 s
[vector] +++ OK, passed 100 tests.
1128.92 s
[vector] mut_foldr: OK
1128.92 s
[vector] +++ OK, passed 100 tests.
1128.93 s
[vector] mut_foldr': OK
1128.93 s
[vector] +++ OK, passed 100 tests.
1128.93 s
[vector] mut_foldl: OK
1128.93 s
[vector] +++ OK, passed 100 tests.
1128.93 s
[vector] mut_foldl': OK
1128.93 s
[vector] +++ OK, passed 100 tests.
1128.93 s
[vector] mut_ifoldr: OK
1128.93 s
[vector] +++ OK, passed 100 tests.
1128.94 s
[vector] mut_ifoldr': OK
1128.94 s
[vector] +++ OK, passed 100 tests.
1128.94 s
[vector] mut_ifoldl: OK
1128.94 s
[vector] +++ OK, passed 100 tests.
1128.94 s
[vector] mut_ifoldl': OK
1128.94 s
[vector] +++ OK, passed 100 tests.
1128.94 s
[pandoc-lua-engine] Dependency aeson: using aeson-2.2.3.0
1128.94 s
[pandoc-lua-engine] Dependency base >=4.12 && <5: using base-4.20.2.0
1128.94 s
[pandoc-lua-engine] Dependency bytestring >=0.9 && <0.13: using bytestring-0.12.2.0
1128.94 s
[pandoc-lua-engine] Dependency citeproc >=0.8 && <0.10: using citeproc-0.9.0.1
1128.94 s
[pandoc-lua-engine] Dependency containers >=0.6.0.1 && <0.9: using containers-0.7
1128.94 s
[pandoc-lua-engine] Dependency crypton >=0.30 && <1.1: using crypton-1.0.4
1128.94 s
[pandoc-lua-engine] Dependency data-default >=0.4 && <0.9: using data-default-0.8.0.1
1128.94 s
[pandoc-lua-engine] Dependency doclayout >=0.5 && <0.6: using doclayout-0.5.0.1
1128.94 s
[pandoc-lua-engine] Dependency doctemplates >=0.11 && <0.12: using doctemplates-0.11.0.1
1128.94 s
[pandoc-lua-engine] Dependency exceptions >=0.8 && <0.11: using exceptions-0.10.9
1128.94 s
[pandoc-lua-engine] Dependency hslua >=2.3 && <2.5: using hslua-2.3.1
1128.94 s
[pandoc-lua-engine] Dependency hslua-module-doclayout >=1.2 && <1.3: using
1128.94 s
[pandoc-lua-engine] hslua-module-doclayout-1.2.0.1
1128.94 s
[pandoc-lua-engine] Dependency hslua-module-path >=1.1 && <1.2: using hslua-module-path-1.1.1
1128.94 s
[pandoc-lua-engine] Dependency hslua-module-system >=1.1 && <1.3: using hslua-module-system-1.1.3
1128.94 s
[pandoc-lua-engine] Dependency hslua-module-text >=1.1 && <1.2: using hslua-module-text-1.1.1
1128.94 s
[pandoc-lua-engine] Dependency hslua-module-version >=1.1 && <1.2: using
1128.94 s
[pandoc-lua-engine] hslua-module-version-1.1.1
1128.94 s
[pandoc-lua-engine] Dependency hslua-module-zip >=1.1.3 && <1.2: using hslua-module-zip-1.1.4
1128.94 s
[pandoc-lua-engine] Dependency hslua-repl >=0.1.1 && <0.2: using hslua-repl-0.1.2
1128.94 s
[pandoc-lua-engine] Dependency lpeg >=1.1 && <1.2: using lpeg-1.1.0
1128.94 s
[pandoc-lua-engine] Dependency mtl >=2.2 && <2.4: using mtl-2.3.1
1128.94 s
[pandoc-lua-engine] Dependency pandoc >=3.7 && <3.8: using pandoc-3.7.0.2
1128.94 s
[pandoc-lua-engine] Dependency pandoc-lua-marshal >=0.3 && <0.4: using pandoc-lua-marshal-0.3.1
1128.94 s
[pandoc-lua-engine] Dependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
1128.94 s
[pandoc-lua-engine] Dependency parsec >=3.1 && <3.2: using parsec-3.1.18.0
1128.94 s
[pandoc-lua-engine] Dependency text >=1.1.1 && <2.2: using text-2.1.3
1128.94 s
[pandoc-lua-engine] Dependency base >=4.12 && <5: using base-4.20.2.0
1128.94 s
[pandoc-lua-engine] Dependency bytestring: using bytestring-0.12.2.0
1128.94 s
[pandoc-lua-engine] Dependency data-default: using data-default-0.8.0.1
1128.94 s
[pandoc-lua-engine] Dependency directory: using directory-1.3.8.5
1128.94 s
[pandoc-lua-engine] Dependency exceptions >=0.8 && <0.11: using exceptions-0.10.9
1128.94 s
[pandoc-lua-engine] Dependency filepath: using filepath-1.5.4.0
1128.94 s
[pandoc-lua-engine] Dependency hslua >=2.3 && <2.5: using hslua-2.3.1
1128.94 s
[pandoc-lua-engine] Dependency pandoc: using pandoc-3.7.0.2
1128.94 s
[pandoc-lua-engine] Dependency pandoc-lua-engine: using pandoc-lua-engine-0.4.3
1128.94 s
[pandoc-lua-engine] Dependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
1128.94 s
[pandoc-lua-engine] Dependency tasty: using tasty-1.5.3
1128.94 s
[pandoc-lua-engine] Dependency tasty-golden: using tasty-golden-2.3.5
1128.94 s
[pandoc-lua-engine] Dependency tasty-hunit: using tasty-hunit-0.10.2
1128.94 s
[pandoc-lua-engine] Dependency tasty-lua >=1.1 && <1.2: using tasty-lua-1.1.2
1128.94 s
[pandoc-lua-engine] Dependency text >=1.1.1 && <2.2: using text-2.1.3
1128.94 s
[pandoc-lua-engine] Source component graph:
1128.94 s
[pandoc-lua-engine] component lib
1128.94 s
[pandoc-lua-engine] component test:test-pandoc-lua-engine dependency lib
1128.94 s
[pandoc-lua-engine] Configured component graph:
1128.94 s
[pandoc-lua-engine] component pandoc-lua-engine-0.4.3-K29XjFgYv9PKG3hN7s3H98
1128.94 s
[pandoc-lua-engine] include aeson-2.2.3.0-ESmD3GqN1sq7uUIfk5Xldf
1128.94 s
[pandoc-lua-engine] include base-4.20.2.0-acb8
1128.94 s
[pandoc-lua-engine] include bytestring-0.12.2.0-04d5
1128.94 s
[pandoc-lua-engine] include citeproc-0.9.0.1-DGjZWk97dAqLu5JPkrzNQH
1128.94 s
[pandoc-lua-engine] include containers-0.7-a3f6
1128.94 s
[pandoc-lua-engine] include crypton-1.0.4-5iUP1fuV9nO64XZJT1F5E7
1128.94 s
[pandoc-lua-engine] include data-default-0.8.0.1-D96698ID2QCBmiljjCEkHD
1128.94 s
[pandoc-lua-engine] include doclayout-0.5.0.1-2QwCUNCmEm01FCKwH9l5Ui
1128.94 s
[pandoc-lua-engine] include doctemplates-0.11.0.1-2nIsdmsSzGZGCmInluLEdq
1128.94 s
[pandoc-lua-engine] include exceptions-0.10.9-0130
1128.94 s
[pandoc-lua-engine] include hslua-2.3.1-K5JjE6c2N7Y8HzEIAtnAnI
1128.94 s
[pandoc-lua-engine] include hslua-module-doclayout-1.2.0.1-KXu7zXAhK3h85G7RkBJsuZ
1128.94 s
[pandoc-lua-engine] include hslua-module-path-1.1.1-IAgUxSqc4pZDHGn3yNAkwV
1128.94 s
[pandoc-lua-engine] include hslua-module-system-1.1.3-29Tt1UxbHEv2JSKgrsV82X
1128.95 s
[pandoc-lua-engine] include hslua-module-text-1.1.1-E0D9NifM42sFpWHXJFaqCg
1128.95 s
[pandoc-lua-engine] include hslua-module-version-1.1.1-FyWN9p27qn56ooG8Zt42PN
1128.95 s
[pandoc-lua-engine] include hslua-module-zip-1.1.4-DkUgaAIlv8MDh7tn9CIUZ3
1128.95 s
[pandoc-lua-engine] include hslua-repl-0.1.2-4LecQgluZRM5h2R4OZQvKE
1128.95 s
[pandoc-lua-engine] include lpeg-1.1.0-wPlPBI6E32Bs1DZfZyhVf
1128.95 s
[pandoc-lua-engine] include mtl-2.3.1-0163
1128.95 s
[pandoc-lua-engine] include pandoc-3.7.0.2-Bn1GI6jrbMY2zU1Kbgbk8q
1128.95 s
[pandoc-lua-engine] include pandoc-lua-marshal-0.3.1-Dj373jh12pPEFkVyt3xyk0
1128.95 s
[pandoc-lua-engine] include pandoc-types-1.23.1-6b23qRFL47vHhjXYPEkRt8
1128.95 s
[pandoc-lua-engine] include parsec-3.1.18.0-bc09
1128.95 s
[pandoc-lua-engine] include text-2.1.3-e138
1128.95 s
[pandoc-lua-engine] component pandoc-lua-engine-0.4.3-GFTUE2cThrfAY9HQNTR8hv-test-pandoc-lua-engine
1128.95 s
[pandoc-lua-engine] include base-4.20.2.0-acb8
1128.95 s
[pandoc-lua-engine] include bytestring-0.12.2.0-04d5
1128.95 s
[pandoc-lua-engine] include data-default-0.8.0.1-D96698ID2QCBmiljjCEkHD
1128.95 s
[pandoc-lua-engine] include directory-1.3.8.5-e377
1128.95 s
[pandoc-lua-engine] include exceptions-0.10.9-0130
1128.95 s
[pandoc-lua-engine] include filepath-1.5.4.0-c4eb
1128.95 s
[pandoc-lua-engine] include hslua-2.3.1-K5JjE6c2N7Y8HzEIAtnAnI
1128.95 s
[pandoc-lua-engine] include pandoc-3.7.0.2-Bn1GI6jrbMY2zU1Kbgbk8q
1128.95 s
[pandoc-lua-engine] include pandoc-lua-engine-0.4.3-K29XjFgYv9PKG3hN7s3H98
1128.95 s
[pandoc-lua-engine] include pandoc-types-1.23.1-6b23qRFL47vHhjXYPEkRt8
1128.95 s
[pandoc-lua-engine] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
1128.95 s
[pandoc-lua-engine] include tasty-golden-2.3.5-ImVFdafZxiKCbwMSngPa79
1128.95 s
[pandoc-lua-engine] include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
1128.95 s
[pandoc-lua-engine] include tasty-lua-1.1.2-HIl06gBFQBCL7HlR8CA6f8
1128.95 s
[pandoc-lua-engine] include text-2.1.3-e138
1128.95 s
[pandoc-lua-engine] Linked component graph:
1128.95 s
[pandoc-lua-engine] unit pandoc-lua-engine-0.4.3-K29XjFgYv9PKG3hN7s3H98
1128.95 s
[pandoc-lua-engine] include aeson-2.2.3.0-ESmD3GqN1sq7uUIfk5Xldf
1128.95 s
[pandoc-lua-engine] include base-4.20.2.0-acb8
1128.95 s
[pandoc-lua-engine] include bytestring-0.12.2.0-04d5
1128.95 s
[pandoc-lua-engine] include citeproc-0.9.0.1-DGjZWk97dAqLu5JPkrzNQH
1128.95 s
[pandoc-lua-engine] include containers-0.7-a3f6
1128.95 s
[pandoc-lua-engine] include crypton-1.0.4-5iUP1fuV9nO64XZJT1F5E7
1128.95 s
[pandoc-lua-engine] include data-default-0.8.0.1-D96698ID2QCBmiljjCEkHD
1128.95 s
[pandoc-lua-engine] include doclayout-0.5.0.1-2QwCUNCmEm01FCKwH9l5Ui
1128.95 s
[pandoc-lua-engine] include doctemplates-0.11.0.1-2nIsdmsSzGZGCmInluLEdq
1128.95 s
[pandoc-lua-engine] include exceptions-0.10.9-0130
1128.95 s
[pandoc-lua-engine] include hslua-2.3.1-K5JjE6c2N7Y8HzEIAtnAnI
1128.95 s
[pandoc-lua-engine] include hslua-module-doclayout-1.2.0.1-KXu7zXAhK3h85G7RkBJsuZ
1128.95 s
[pandoc-lua-engine] include hslua-module-path-1.1.1-IAgUxSqc4pZDHGn3yNAkwV
1128.95 s
[pandoc-lua-engine] include hslua-module-system-1.1.3-29Tt1UxbHEv2JSKgrsV82X
1128.95 s
[pandoc-lua-engine] include hslua-module-text-1.1.1-E0D9NifM42sFpWHXJFaqCg
1128.95 s
[pandoc-lua-engine] include hslua-module-version-1.1.1-FyWN9p27qn56ooG8Zt42PN
1128.95 s
[pandoc-lua-engine] include hslua-module-zip-1.1.4-DkUgaAIlv8MDh7tn9CIUZ3
1128.95 s
[pandoc-lua-engine] include hslua-repl-0.1.2-4LecQgluZRM5h2R4OZQvKE
1128.95 s
[pandoc-lua-engine] include lpeg-1.1.0-wPlPBI6E32Bs1DZfZyhVf
1128.95 s
[pandoc-lua-engine] include mtl-2.3.1-0163
1128.95 s
[pandoc-lua-engine] include pandoc-3.7.0.2-Bn1GI6jrbMY2zU1Kbgbk8q
1128.95 s
[pandoc-lua-engine] include pandoc-lua-marshal-0.3.1-Dj373jh12pPEFkVyt3xyk0
1128.95 s
[pandoc-lua-engine] include pandoc-types-1.23.1-6b23qRFL47vHhjXYPEkRt8
1128.95 s
[pandoc-lua-engine] include parsec-3.1.18.0-bc09
1128.95 s
[pandoc-lua-engine] include text-2.1.3-e138
1128.95 s
[pandoc-lua-engine] Text.Pandoc.Lua=pandoc-lua-engine-0.4.3-K29XjFgYv9PKG3hN7s3H98:Text.Pandoc.Lua
1128.95 s
[pandoc-lua-engine] unit pandoc-lua-engine-0.4.3-GFTUE2cThrfAY9HQNTR8hv-test-pandoc-lua-engine
1128.95 s
[pandoc-lua-engine] include base-4.20.2.0-acb8
1128.95 s
[pandoc-lua-engine] include bytestring-0.12.2.0-04d5
1128.95 s
[pandoc-lua-engine] include data-default-0.8.0.1-D96698ID2QCBmiljjCEkHD
1128.95 s
[pandoc-lua-engine] include directory-1.3.8.5-e377
1128.95 s
[pandoc-lua-engine] include exceptions-0.10.9-0130
1128.95 s
[pandoc-lua-engine] include filepath-1.5.4.0-c4eb
1128.95 s
[pandoc-lua-engine] include hslua-2.3.1-K5JjE6c2N7Y8HzEIAtnAnI
1128.95 s
[pandoc-lua-engine] include pandoc-3.7.0.2-Bn1GI6jrbMY2zU1Kbgbk8q
1128.95 s
[pandoc-lua-engine] include pandoc-lua-engine-0.4.3-K29XjFgYv9PKG3hN7s3H98
1128.95 s
[pandoc-lua-engine] include pandoc-types-1.23.1-6b23qRFL47vHhjXYPEkRt8
1128.95 s
[pandoc-lua-engine] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
1128.95 s
[pandoc-lua-engine] include tasty-golden-2.3.5-ImVFdafZxiKCbwMSngPa79
1128.95 s
[pandoc-lua-engine] include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
1128.95 s
[pandoc-lua-engine] include tasty-lua-1.1.2-HIl06gBFQBCL7HlR8CA6f8
1128.95 s
[pandoc-lua-engine] include text-2.1.3-e138
1128.95 s
[pandoc-lua-engine] Ready component graph:
1128.95 s
[pandoc-lua-engine] definite pandoc-lua-engine-0.4.3-K29XjFgYv9PKG3hN7s3H98
1128.95 s
[pandoc-lua-engine] depends aeson-2.2.3.0-ESmD3GqN1sq7uUIfk5Xldf
1128.95 s
[pandoc-lua-engine] depends base-4.20.2.0-acb8
1128.95 s
[pandoc-lua-engine] depends bytestring-0.12.2.0-04d5
1128.95 s
[pandoc-lua-engine] depends citeproc-0.9.0.1-DGjZWk97dAqLu5JPkrzNQH
1128.95 s
[pandoc-lua-engine] depends containers-0.7-a3f6
1128.95 s
[pandoc-lua-engine] depends crypton-1.0.4-5iUP1fuV9nO64XZJT1F5E7
1128.95 s
[pandoc-lua-engine] depends data-default-0.8.0.1-D96698ID2QCBmiljjCEkHD
1128.95 s
[pandoc-lua-engine] depends doclayout-0.5.0.1-2QwCUNCmEm01FCKwH9l5Ui
1128.95 s
[pandoc-lua-engine] depends doctemplates-0.11.0.1-2nIsdmsSzGZGCmInluLEdq
1128.95 s
[pandoc-lua-engine] depends exceptions-0.10.9-0130
1128.95 s
[pandoc-lua-engine] depends hslua-2.3.1-K5JjE6c2N7Y8HzEIAtnAnI
1128.95 s
[pandoc-lua-engine] depends hslua-module-doclayout-1.2.0.1-KXu7zXAhK3h85G7RkBJsuZ
1128.95 s
[pandoc-lua-engine] depends hslua-module-path-1.1.1-IAgUxSqc4pZDHGn3yNAkwV
1128.95 s
[pandoc-lua-engine] depends hslua-module-system-1.1.3-29Tt1UxbHEv2JSKgrsV82X
1128.95 s
[pandoc-lua-engine] depends hslua-module-text-1.1.1-E0D9NifM42sFpWHXJFaqCg
1128.95 s
[pandoc-lua-engine] depends hslua-module-version-1.1.1-FyWN9p27qn56ooG8Zt42PN
1128.95 s
[pandoc-lua-engine] depends hslua-module-zip-1.1.4-DkUgaAIlv8MDh7tn9CIUZ3
1128.95 s
[pandoc-lua-engine] depends hslua-repl-0.1.2-4LecQgluZRM5h2R4OZQvKE
1128.95 s
[pandoc-lua-engine] depends lpeg-1.1.0-wPlPBI6E32Bs1DZfZyhVf
1128.95 s
[pandoc-lua-engine] depends mtl-2.3.1-0163
1128.95 s
[pandoc-lua-engine] depends pandoc-3.7.0.2-Bn1GI6jrbMY2zU1Kbgbk8q
1128.95 s
[vector] mut_foldM: OK
1128.95 s
[vector] +++ OK, passed 100 tests.
1128.95 s
[vector] mut_foldM': OK
1128.95 s
[vector] +++ OK, passed 100 tests.
1128.95 s
[vector] mut_foldrM: OK
1128.95 s
[vector] +++ OK, passed 100 tests.
1128.95 s
[vector] mut_foldrM': OK
1128.95 s
[vector] +++ OK, passed 100 tests.
1128.96 s
[vector] mut_ifoldM: OK
1128.96 s
[vector] +++ OK, passed 100 tests.
1128.96 s
[vector] mut_ifoldM': OK
1128.96 s
[vector] +++ OK, passed 100 tests.
1128.96 s
[vector] mut_ifoldrM: OK
1128.96 s
[vector] +++ OK, passed 100 tests.
1128.96 s
[vector] mut_ifoldrM': OK
1128.96 s
[vector] +++ OK, passed 100 tests.
1128.96 s
[vector] compare: OK
1128.96 s
[vector] +++ OK, passed 100 tests.
1128.96 s
[vector] maximum: OK
1128.96 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1128.96 s
[vector] minimum: OK
1128.96 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1128.96 s
[vector] minIndex: OK
1128.96 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1128.96 s
[vector] maxIndex: OK
1128.96 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1128.96 s
[vector] maximumBy: OK
1128.96 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1128.96 s
[vector] minimumBy: OK
1128.96 s
[vector] +++ OK, passed 100 tests; 25 discarded.
1128.96 s
[vector] maximumOn: OK
1128.96 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1128.96 s
[vector] minimumOn: OK
1128.96 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1128.96 s
[vector] maxIndexBy: OK
1128.96 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1128.96 s
[vector] minIndexBy: OK
1128.96 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1128.97 s
[vector] ListFirstMaxIndexWins: OK
1128.97 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1128.97 s
[vector] FalseListFirstMaxIndexWins: OK
1128.97 s
[vector] +++ OK, failed as expected. (after 1 test):
1128.97 s
[vector] Exception:
1128.97 s
[vector] Prelude.foldr1: empty list
1128.97 s
[vector] CallStack (from HasCallStack):
1128.97 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1128.97 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1128.97 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1128.97 s
[vector] []
1128.97 s
[vector] mempty: OK
1128.97 s
[vector] +++ OK, passed 100 tests.
1128.98 s
[vector] mappend: OK
1128.98 s
[vector] +++ OK, passed 100 tests.
1128.98 s
[vector] mconcat: OK (0.01s)
1128.98 s
[vector] +++ OK, passed 100 tests.
1128.98 s
[vector] glength: OK
1128.98 s
[vector] +++ OK, passed 100 tests.
1128.98 s
[vector] sum: OK
1128.98 s
[vector] +++ OK, passed 100 tests.
1128.98 s
[vector] product: OK
1128.98 s
[vector] +++ OK, passed 100 tests.
1128.98 s
[vector] enumFromN: OK
1128.98 s
[vector] +++ OK, passed 100 tests.
1128.99 s
[vector] enumFromThenN: OK
1128.99 s
[vector] +++ OK, passed 100 tests.
1128.99 s
[vector] enumFromTo: OK
1128.99 s
[vector] +++ OK, passed 100 tests.
1128.99 s
[vector] enumFromThenTo: OK
1128.99 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1128.99 s
[vector] Data.Vector.Storable.Vector (Double)
1128.99 s
[vector] fromList.toList == id: OK
1128.99 s
[vector] +++ OK, passed 100 tests.
1128.99 s
[vector] toList.fromList == id: OK
1128.99 s
[vector] +++ OK, passed 100 tests.
1128.99 s
[vector] unstream.stream == id: OK
1128.99 s
[vector] +++ OK, passed 100 tests.
1128.99 s
[vector] stream.unstream == id: OK
1128.99 s
[vector] +++ OK, passed 100 tests.
1128.99 s
[vector] eq: OK
1128.99 s
[vector] +++ OK, passed 100 tests.
1128.99 s
[vector] length: OK
1128.99 s
[vector] +++ OK, passed 100 tests.
1128.99 s
[vector] null: OK
1128.99 s
[vector] +++ OK, passed 100 tests.
1128.99 s
[vector] index: OK
1128.99 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1128.99 s
[vector] safeIndex: OK
1128.99 s
[vector] +++ OK, passed 100 tests.
1128.99 s
[vector] head: OK
1128.99 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1128.99 s
[vector] last: OK
1129.00 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1129.00 s
[vector] unsafeIndex: OK
1129.00 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1129.00 s
[vector] unsafeHead: OK
1129.00 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1129.00 s
[vector] unsafeLast: OK
1129.00 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1129.00 s
[vector] slice: OK
1129.00 s
[vector] +++ OK, passed 100 tests.
1129.00 s
[vector] init: OK
1129.00 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1129.00 s
[vector] tail: OK
1129.00 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1129.00 s
[vector] take: OK
1129.00 s
[vector] +++ OK, passed 100 tests.
1129.00 s
[vector] drop: OK
1129.00 s
[vector] +++ OK, passed 100 tests.
1129.00 s
[vector] splitAt: OK
1129.00 s
[vector] +++ OK, passed 100 tests.
1129.00 s
[vector] empty: OK
1129.00 s
[vector] +++ OK, passed 100 tests.
1129.00 s
[vector] singleton: OK
1129.00 s
[vector] +++ OK, passed 100 tests.
1129.00 s
[vector] replicate: OK
1129.01 s
[vector] +++ OK, passed 100 tests.
1129.01 s
[vector] generate: OK
1129.02 s
[vector] +++ OK, passed 100 tests.
1129.02 s
[vector] iterateN: OK
1129.02 s
[vector] +++ OK, passed 100 tests.
1129.02 s
[pandoc-lua-engine] depends pandoc-lua-marshal-0.3.1-Dj373jh12pPEFkVyt3xyk0
1129.02 s
[pandoc-lua-engine] depends pandoc-types-1.23.1-6b23qRFL47vHhjXYPEkRt8
1129.02 s
[pandoc-lua-engine] depends parsec-3.1.18.0-bc09
1129.02 s
[pandoc-lua-engine] depends text-2.1.3-e138
1129.02 s
[pandoc-lua-engine] definite pandoc-lua-engine-0.4.3-GFTUE2cThrfAY9HQNTR8hv-test-pandoc-lua-engine
1129.02 s
[pandoc-lua-engine] depends base-4.20.2.0-acb8
1129.02 s
[pandoc-lua-engine] depends bytestring-0.12.2.0-04d5
1129.02 s
[pandoc-lua-engine] depends data-default-0.8.0.1-D96698ID2QCBmiljjCEkHD
1129.02 s
[pandoc-lua-engine] depends directory-1.3.8.5-e377
1129.02 s
[pandoc-lua-engine] depends exceptions-0.10.9-0130
1129.02 s
[pandoc-lua-engine] depends filepath-1.5.4.0-c4eb
1129.02 s
[pandoc-lua-engine] depends hslua-2.3.1-K5JjE6c2N7Y8HzEIAtnAnI
1129.02 s
[pandoc-lua-engine] depends pandoc-3.7.0.2-Bn1GI6jrbMY2zU1Kbgbk8q
1129.02 s
[pandoc-lua-engine] depends pandoc-lua-engine-0.4.3-K29XjFgYv9PKG3hN7s3H98
1129.02 s
[pandoc-lua-engine] depends pandoc-types-1.23.1-6b23qRFL47vHhjXYPEkRt8
1129.02 s
[pandoc-lua-engine] depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
1129.02 s
[pandoc-lua-engine] depends tasty-golden-2.3.5-ImVFdafZxiKCbwMSngPa79
1129.02 s
[pandoc-lua-engine] depends tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
1129.02 s
[pandoc-lua-engine] depends tasty-lua-1.1.2-HIl06gBFQBCL7HlR8CA6f8
1129.02 s
[pandoc-lua-engine] depends text-2.1.3-e138
1129.02 s
[pandoc-lua-engine] Using Cabal-3.12.1.0 compiled by ghc-9.10
1129.02 s
[pandoc-lua-engine] Using compiler: ghc-9.10.3
1129.02 s
[pandoc-lua-engine] Using install prefix:
1129.02 s
[pandoc-lua-engine] /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3
1129.02 s
[pandoc-lua-engine] Executables installed in:
1129.02 s
[pandoc-lua-engine] /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3/bin
1129.02 s
[pandoc-lua-engine] Libraries installed in:
1129.02 s
[pandoc-lua-engine] /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/pandoc-lua-engine-0.4.3-K29XjFgYv9PKG3hN7s3H98
1129.02 s
[pandoc-lua-engine] Dynamic Libraries installed in:
1129.02 s
[pandoc-lua-engine] /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
1129.02 s
[pandoc-lua-engine] Private executables installed in:
1129.02 s
[pandoc-lua-engine] /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3/libexec/x86_64-linux-ghc-9.10.3-5702/pandoc-lua-engine-0.4.3
1129.02 s
[pandoc-lua-engine] Data files installed in:
1129.02 s
[pandoc-lua-engine] /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3/share/x86_64-linux-ghc-9.10.3-5702/pandoc-lua-engine-0.4.3
1129.02 s
[pandoc-lua-engine] Documentation installed in:
1129.02 s
[pandoc-lua-engine] /nix/store/afm4wyap4sbadgn4yb21k7aszlkwhgrc-pandoc-lua-engine-0.4.3-doc/share/doc/pandoc-lua-engine-0.4.3
1129.02 s
[pandoc-lua-engine] Configuration files installed in:
1129.02 s
[pandoc-lua-engine] /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3/etc
1129.02 s
[pandoc-lua-engine] No alex found
1129.02 s
[pandoc-lua-engine] Using ar found on system at:
1129.02 s
[pandoc-lua-engine] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
1129.02 s
[pandoc-lua-engine] No c2hs found
1129.02 s
[pandoc-lua-engine] No cpphs found
1129.02 s
[pandoc-lua-engine] No doctest found
1129.02 s
[pandoc-lua-engine] Using gcc version 14.3.0 given by user at:
1129.02 s
[pandoc-lua-engine] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
1129.02 s
[pandoc-lua-engine] Using ghc version 9.10.3 found on system at:
1129.02 s
[pandoc-lua-engine] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
1129.02 s
[pandoc-lua-engine] Using ghc-pkg version 9.10.3 found on system at:
1129.02 s
[pandoc-lua-engine] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
1129.02 s
[pandoc-lua-engine] No ghcjs found
1129.02 s
[pandoc-lua-engine] No ghcjs-pkg found
1129.02 s
[pandoc-lua-engine] No greencard found
1129.02 s
[pandoc-lua-engine] Using haddock version 2.31.1 found on system at:
1129.02 s
[pandoc-lua-engine] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
1129.02 s
[pandoc-lua-engine] No happy found
1129.02 s
[pandoc-lua-engine] Using haskell-suite found on system at: haskell-suite-dummy-location
1129.02 s
[pandoc-lua-engine] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1129.02 s
[pandoc-lua-engine] No hmake found
1129.02 s
[pandoc-lua-engine] Using hpc version 0.69 found on system at:
1129.02 s
[pandoc-lua-engine] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
1129.02 s
[pandoc-lua-engine] Using hsc2hs version 0.68.10 found on system at:
1129.02 s
[pandoc-lua-engine] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
1129.02 s
[pandoc-lua-engine] Using hscolour version 1.25 found on system at:
1129.02 s
[pandoc-lua-engine] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
1129.02 s
[pandoc-lua-engine] No jhc found
1129.02 s
[pandoc-lua-engine] Using ld found on system at:
1129.02 s
[pandoc-lua-engine] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
1129.02 s
[pandoc-lua-engine] No pkg-config found
1129.02 s
[pandoc-lua-engine] Using runghc version 9.10.3 found on system at:
1129.02 s
[pandoc-lua-engine] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
1129.02 s
[pandoc-lua-engine] Using strip version 2.44 found on system at:
1129.02 s
[pandoc-lua-engine] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
1129.02 s
[pandoc-lua-engine] Using tar found on system at:
1129.02 s
[pandoc-lua-engine] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
1129.02 s
[pandoc-lua-engine] No uhc found
1129.04 s
[vector] iterateNM: OK (0.01s)
1129.04 s
[vector] +++ OK, passed 100 tests.
1129.05 s
[vector] generateM: OK (0.02s)
1129.05 s
[vector] +++ OK, passed 100 tests.
1129.05 s
[vector] replicateM: OK
1129.05 s
[vector] +++ OK, passed 100 tests.
1129.05 s
[vector] create: OK
1129.06 s
[vector] +++ OK, passed 100 tests.
1129.06 s
[vector] createT: OK
1129.06 s
[vector] +++ OK, passed 100 tests.
1129.06 s
[vector] unfoldr: OK
1129.06 s
[vector] +++ OK, passed 100 tests.
1129.06 s
[vector] unfoldrN: OK
1129.06 s
[vector] +++ OK, passed 100 tests.
1129.06 s
[vector] unfoldrExactN: OK
1129.06 s
[vector] +++ OK, passed 100 tests.
1129.06 s
[vector] unfoldrM: OK
1129.06 s
[vector] +++ OK, passed 100 tests.
1129.08 s
[vector] unfoldrNM: OK
1129.08 s
[vector] +++ OK, passed 100 tests.
1129.10 s
[vector] unfoldrExactNM: OK (0.03s)
1129.10 s
[vector] +++ OK, passed 100 tests.
1129.12 s
[vector] constructN: OK (0.02s)
1129.12 s
[vector] +++ OK, passed 100 tests.
1129.12 s
[vector] constructrN: OK (0.02s)
1129.12 s
[vector] +++ OK, passed 100 tests.
1129.12 s
[vector] cons: OK
1129.12 s
[vector] +++ OK, passed 100 tests.
1129.12 s
[vector] snoc: OK
1129.12 s
[vector] +++ OK, passed 100 tests.
1129.13 s
[vector] append: OK
1129.13 s
[vector] +++ OK, passed 100 tests.
1129.15 s
[vector] concat: OK (0.03s)
1129.15 s
[vector] +++ OK, passed 100 tests.
1129.15 s
[vector] force: OK
1129.15 s
[vector] +++ OK, passed 100 tests.
1129.16 s
[vector] upd: OK
1129.17 s
[vector] +++ OK, passed 100 tests.
1129.17 s
[vector] accum: OK (0.02s)
1129.17 s
[vector] +++ OK, passed 100 tests.
1129.17 s
[vector] reverse: OK
1129.17 s
[vector] +++ OK, passed 100 tests.
1129.18 s
[vector] backpermute: OK
1129.18 s
[vector] +++ OK, passed 100 tests.
1129.18 s
[vector] map: OK
1129.18 s
[vector] +++ OK, passed 100 tests.
1129.20 s
[vector] imap: OK
1129.21 s
[vector] +++ OK, passed 100 tests.
1129.22 s
[vector] concatMap: OK
1129.22 s
[vector] +++ OK, passed 100 tests.
1129.22 s
[vector] mapM: OK
1129.22 s
[vector] +++ OK, passed 100 tests.
1129.25 s
[pandoc-server] Dependency aeson >=2.0 && <2.3: using aeson-2.2.3.0
1129.25 s
[pandoc-server] Dependency base >=4.12 && <5: using base-4.20.2.0
1129.25 s
[pandoc-server] Dependency base64-bytestring >=0.1 && <1.3: using base64-bytestring-1.2.1.0
1129.25 s
[pandoc-server] Dependency bytestring >=0.9 && <0.13: using bytestring-0.12.2.0
1129.25 s
[pandoc-server] Dependency containers >=0.6.0.1 && <0.9: using containers-0.7
1129.25 s
[pandoc-server] Dependency data-default >=0.4 && <0.9: using data-default-0.8.0.1
1129.25 s
[pandoc-server] Dependency doctemplates >=0.11 && <0.12: using doctemplates-0.11.0.1
1129.25 s
[pandoc-server] Dependency pandoc >=3.5 && <3.8: using pandoc-3.7.0.2
1129.25 s
[pandoc-server] Dependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
1129.25 s
[pandoc-server] Dependency servant-server >=0.19 && <0.21: using servant-server-0.20.3.0
1129.25 s
[pandoc-server] Dependency skylighting >=0.13 && <0.15: using skylighting-0.14.7
1129.25 s
[pandoc-server] Dependency text >=1.1.1.0 && <2.2: using text-2.1.3
1129.25 s
[pandoc-server] Dependency unicode-collation >=0.1.1 && <0.2: using unicode-collation-0.1.3.6
1129.25 s
[pandoc-server] Dependency wai >=3.2 && <3.3: using wai-3.2.4
1129.25 s
[pandoc-server] Dependency wai-cors >=0.2.7 && <0.3: using wai-cors-0.2.7
1129.25 s
[pandoc-server] Source component graph: component lib
1129.25 s
[pandoc-server] Configured component graph:
1129.25 s
[pandoc-server] component pandoc-server-0.1.0.11-2p8ECUQZARt9psWxK5ycoq
1129.25 s
[pandoc-server] include aeson-2.2.3.0-ESmD3GqN1sq7uUIfk5Xldf
1129.25 s
[pandoc-server] include base-4.20.2.0-acb8
1129.25 s
[pandoc-server] include base64-bytestring-1.2.1.0-E5ZfzePNySX5CsTeWj14Td
1129.25 s
[pandoc-server] include bytestring-0.12.2.0-04d5
1129.25 s
[pandoc-server] include containers-0.7-a3f6
1129.25 s
[pandoc-server] include data-default-0.8.0.1-D96698ID2QCBmiljjCEkHD
1129.25 s
[pandoc-server] include doctemplates-0.11.0.1-2nIsdmsSzGZGCmInluLEdq
1129.25 s
[pandoc-server] include pandoc-3.7.0.2-Bn1GI6jrbMY2zU1Kbgbk8q
1129.25 s
[pandoc-server] include pandoc-types-1.23.1-6b23qRFL47vHhjXYPEkRt8
1129.25 s
[pandoc-server] include servant-server-0.20.3.0-IdiJIYs0tbwJrOGDFEDPbL
1129.25 s
[pandoc-server] include skylighting-0.14.7-6PsYF2CGn49DOgxUNP80FT
1129.25 s
[pandoc-server] include text-2.1.3-e138
1129.25 s
[pandoc-server] include unicode-collation-0.1.3.6-4OUa81BJpQbALGYESd1KVs
1129.25 s
[pandoc-server] include wai-3.2.4-Do1EstC38Y52Aaiy4h448u
1129.25 s
[pandoc-server] include wai-cors-0.2.7-EGkQ4Ro3X0X3pFUFHIHBNy
1129.25 s
[pandoc-server] Linked component graph:
1129.25 s
[pandoc-server] unit pandoc-server-0.1.0.11-2p8ECUQZARt9psWxK5ycoq
1129.25 s
[pandoc-server] include aeson-2.2.3.0-ESmD3GqN1sq7uUIfk5Xldf
1129.25 s
[pandoc-server] include base-4.20.2.0-acb8
1129.25 s
[pandoc-server] include base64-bytestring-1.2.1.0-E5ZfzePNySX5CsTeWj14Td
1129.25 s
[pandoc-server] include bytestring-0.12.2.0-04d5
1129.25 s
[pandoc-server] include containers-0.7-a3f6
1129.25 s
[pandoc-server] include data-default-0.8.0.1-D96698ID2QCBmiljjCEkHD
1129.25 s
[pandoc-server] include doctemplates-0.11.0.1-2nIsdmsSzGZGCmInluLEdq
1129.25 s
[pandoc-server] include pandoc-3.7.0.2-Bn1GI6jrbMY2zU1Kbgbk8q
1129.25 s
[pandoc-server] include pandoc-types-1.23.1-6b23qRFL47vHhjXYPEkRt8
1129.25 s
[pandoc-server] include servant-server-0.20.3.0-IdiJIYs0tbwJrOGDFEDPbL
1129.25 s
[pandoc-server] include skylighting-0.14.7-6PsYF2CGn49DOgxUNP80FT
1129.25 s
[pandoc-server] include text-2.1.3-e138
1129.25 s
[pandoc-server] include unicode-collation-0.1.3.6-4OUa81BJpQbALGYESd1KVs
1129.25 s
[pandoc-server] include wai-3.2.4-Do1EstC38Y52Aaiy4h448u
1129.25 s
[pandoc-server] include wai-cors-0.2.7-EGkQ4Ro3X0X3pFUFHIHBNy
1129.25 s
[pandoc-server] Text.Pandoc.Server=pandoc-server-0.1.0.11-2p8ECUQZARt9psWxK5ycoq:Text.Pandoc.Server
1129.25 s
[pandoc-server] Ready component graph:
1129.25 s
[pandoc-server] definite pandoc-server-0.1.0.11-2p8ECUQZARt9psWxK5ycoq
1129.25 s
[pandoc-server] depends aeson-2.2.3.0-ESmD3GqN1sq7uUIfk5Xldf
1129.25 s
[pandoc-server] depends base-4.20.2.0-acb8
1129.25 s
[pandoc-server] depends base64-bytestring-1.2.1.0-E5ZfzePNySX5CsTeWj14Td
1129.25 s
[pandoc-server] depends bytestring-0.12.2.0-04d5
1129.26 s
[pandoc-server] depends containers-0.7-a3f6
1129.26 s
[pandoc-server] depends data-default-0.8.0.1-D96698ID2QCBmiljjCEkHD
1129.26 s
[pandoc-server] depends doctemplates-0.11.0.1-2nIsdmsSzGZGCmInluLEdq
1129.26 s
[pandoc-server] depends pandoc-3.7.0.2-Bn1GI6jrbMY2zU1Kbgbk8q
1129.26 s
[pandoc-server] depends pandoc-types-1.23.1-6b23qRFL47vHhjXYPEkRt8
1129.26 s
[pandoc-server] depends servant-server-0.20.3.0-IdiJIYs0tbwJrOGDFEDPbL
1129.26 s
[pandoc-server] depends skylighting-0.14.7-6PsYF2CGn49DOgxUNP80FT
1129.26 s
[pandoc-server] depends text-2.1.3-e138
1129.26 s
[pandoc-server] depends unicode-collation-0.1.3.6-4OUa81BJpQbALGYESd1KVs
1129.26 s
[pandoc-server] depends wai-3.2.4-Do1EstC38Y52Aaiy4h448u
1129.26 s
[pandoc-server] depends wai-cors-0.2.7-EGkQ4Ro3X0X3pFUFHIHBNy
1129.26 s
[pandoc-server] Using Cabal-3.12.1.0 compiled by ghc-9.10
1129.26 s
[pandoc-server] Using compiler: ghc-9.10.3
1129.26 s
[pandoc-server] Using install prefix:
1129.26 s
[pandoc-server] /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11
1129.26 s
[pandoc-server] Executables installed in:
1129.26 s
[pandoc-server] /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11/bin
1129.26 s
[pandoc-server] Libraries installed in:
1129.26 s
[pandoc-server] /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/pandoc-server-0.1.0.11-2p8ECUQZARt9psWxK5ycoq
1129.26 s
[pandoc-server] Dynamic Libraries installed in:
1129.26 s
[pandoc-server] /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
1129.26 s
[pandoc-server] Private executables installed in:
1129.26 s
[pandoc-server] /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11/libexec/x86_64-linux-ghc-9.10.3-5702/pandoc-server-0.1.0.11
1129.26 s
[pandoc-server] Data files installed in:
1129.26 s
[pandoc-server] /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11/share/x86_64-linux-ghc-9.10.3-5702/pandoc-server-0.1.0.11
1129.26 s
[pandoc-server] Documentation installed in:
1129.26 s
[pandoc-server] /nix/store/3j1008pz7rfr2k0141d78adq5awkm1r7-pandoc-server-0.1.0.11-doc/share/doc/pandoc-server-0.1.0.11
1129.26 s
[pandoc-server] Configuration files installed in:
1129.26 s
[pandoc-server] /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11/etc
1129.26 s
[pandoc-server] No alex found
1129.26 s
[pandoc-server] Using ar found on system at:
1129.26 s
[pandoc-server] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
1129.26 s
[pandoc-server] No c2hs found
1129.26 s
[pandoc-server] No cpphs found
1129.26 s
[pandoc-server] No doctest found
1129.26 s
[pandoc-server] Using gcc version 14.3.0 given by user at:
1129.26 s
[pandoc-server] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
1129.26 s
[pandoc-server] Using ghc version 9.10.3 found on system at:
1129.26 s
[pandoc-server] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
1129.26 s
[pandoc-server] Using ghc-pkg version 9.10.3 found on system at:
1129.26 s
[pandoc-server] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
1129.26 s
[pandoc-server] No ghcjs found
1129.26 s
[pandoc-server] No ghcjs-pkg found
1129.26 s
[pandoc-server] No greencard found
1129.26 s
[pandoc-server] Using haddock version 2.31.1 found on system at:
1129.26 s
[pandoc-server] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
1129.26 s
[pandoc-server] No happy found
1129.26 s
[pandoc-server] Using haskell-suite found on system at: haskell-suite-dummy-location
1129.26 s
[pandoc-server] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1129.26 s
[pandoc-server] No hmake found
1129.26 s
[pandoc-server] Using hpc version 0.69 found on system at:
1129.26 s
[pandoc-server] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
1129.26 s
[pandoc-server] Using hsc2hs version 0.68.10 found on system at:
1129.26 s
[pandoc-server] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
1129.26 s
[pandoc-server] Using hscolour version 1.25 found on system at:
1129.26 s
[pandoc-server] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
1129.26 s
[pandoc-server] No jhc found
1129.26 s
[pandoc-server] Using ld found on system at:
1129.26 s
[pandoc-server] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
1129.26 s
[pandoc-server] No pkg-config found
1129.26 s
[pandoc-server] Using runghc version 9.10.3 found on system at:
1129.26 s
[pandoc-server] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
1129.26 s
[pandoc-server] Using strip version 2.44 found on system at:
1129.26 s
[pandoc-server] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
1129.26 s
[pandoc-server] Using tar found on system at:
1129.26 s
[pandoc-server] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
1129.26 s
[pandoc-server] No uhc found
1129.26 s
[vector] mapM_: OK (0.04s)
1129.26 s
[vector] +++ OK, passed 100 tests.
1129.26 s
[vector] forM: OK
1129.26 s
[vector] +++ OK, passed 100 tests.
1129.27 s
[pandoc-lua-engine] Phase: buildPhase
1129.31 s
[vector] forM_: OK (0.04s)
1129.32 s
[vector] +++ OK, passed 100 tests.
1129.32 s
[vector] imapM: OK
1129.32 s
[vector] +++ OK, passed 100 tests.
1129.36 s
[vector] imapM_: OK (0.04s)
1129.36 s
[vector] +++ OK, passed 100 tests.
1129.37 s
[vector] zipWith: OK (0.02s)
1129.37 s
[vector] +++ OK, passed 100 tests.
1129.39 s
[vector] zipWith3: OK
1129.40 s
[vector] +++ OK, passed 100 tests.
1129.40 s
[vector] izipWith: OK
1129.40 s
[vector] +++ OK, passed 100 tests.
1129.40 s
[pandoc-lua-engine] Preprocessing library for pandoc-lua-engine-0.4.3...
1129.41 s
[pandoc-lua-engine] Building library for pandoc-lua-engine-0.4.3...
1129.41 s
[vector] izipWith3: OK (0.01s)
1129.42 s
[vector] +++ OK, passed 100 tests.
1129.42 s
[vector] izipWithM: OK
1129.42 s
[vector] +++ OK, passed 100 tests.
1129.46 s
[vector] izipWithM_: OK (0.03s)
1129.46 s
[vector] +++ OK, passed 100 tests.
1129.48 s
[vector] zipWithM: OK (0.02s)
1129.48 s
[vector] +++ OK, passed 100 tests.
1129.50 s
[vector] zipWithM_: OK (0.03s)
1129.50 s
[vector] +++ OK, passed 100 tests.
1129.51 s
[vector] filter: OK
1129.51 s
[vector] +++ OK, passed 100 tests.
1129.51 s
[vector] ifilter: OK
1129.51 s
[vector] +++ OK, passed 100 tests.
1129.58 s
[vector] filterM: OK (0.05s)
1129.58 s
[vector] +++ OK, passed 100 tests.
1129.58 s
[vector] uniq: OK (0.01s)
1129.58 s
[vector] +++ OK, passed 100 tests.
1129.60 s
[vector] mapMaybe: OK (0.01s)
1129.60 s
[vector] +++ OK, passed 100 tests.
1129.60 s
[vector] imapMaybe: OK (0.02s)
1129.60 s
[vector] +++ OK, passed 100 tests.
1129.62 s
[vector] takeWhile: OK
1129.62 s
[vector] +++ OK, passed 100 tests.
1129.62 s
[vector] dropWhile: OK
1129.62 s
[vector] +++ OK, passed 100 tests.
1129.62 s
[vector] partition: OK
1129.62 s
[vector] +++ OK, passed 100 tests.
1129.62 s
[vector] partitionWith: OK
1129.62 s
[vector] +++ OK, passed 100 tests.
1129.62 s
[vector] span: OK
1129.62 s
[pandoc-server] Phase: buildPhase
1129.62 s
[vector] +++ OK, passed 100 tests.
1129.62 s
[vector] break: OK
1129.62 s
[vector] +++ OK, passed 100 tests.
1129.62 s
[vector] spanR: OK
1129.63 s
[vector] +++ OK, passed 100 tests.
1129.63 s
[vector] breakR: OK
1129.63 s
[vector] +++ OK, passed 100 tests.
1129.63 s
[vector] groupBy: OK
1129.63 s
[vector] +++ OK, passed 100 tests.
1129.63 s
[vector] elem: OK
1129.63 s
[vector] +++ OK, passed 100 tests.
1129.64 s
[vector] notElem: OK
1129.64 s
[vector] +++ OK, passed 100 tests.
1129.64 s
[vector] find: OK
1129.64 s
[vector] +++ OK, passed 100 tests.
1129.64 s
[vector] findIndex: OK
1129.66 s
[vector] +++ OK, passed 100 tests.
1129.66 s
[vector] findIndexR: OK
1129.67 s
[vector] +++ OK, passed 100 tests.
1129.68 s
[vector] findIndices: OK
1129.68 s
[vector] +++ OK, passed 100 tests.
1129.70 s
[vector] elemIndex: OK
1129.70 s
[vector] +++ OK, passed 100 tests.
1129.70 s
[vector] elemIndices: OK
1129.70 s
[vector] +++ OK, passed 100 tests.
1129.72 s
[vector] foldl: OK (0.01s)
1129.72 s
[vector] +++ OK, passed 100 tests.
1129.72 s
[vector] foldl1: OK (0.01s)
1129.72 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1129.72 s
[vector] foldl': OK (0.01s)
1129.72 s
[vector] +++ OK, passed 100 tests.
1129.72 s
[vector] foldl1': OK (0.01s)
1129.72 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1129.72 s
[vector] foldr: OK (0.01s)
1129.72 s
[vector] +++ OK, passed 100 tests.
1129.72 s
[pandoc-lua-engine] [ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
1129.74 s
[vector] foldr1: OK (0.02s)
1129.74 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1129.75 s
[pandoc-server] Preprocessing library for pandoc-server-0.1.0.11...
1129.75 s
[pandoc-server] Building library for pandoc-server-0.1.0.11...
1129.76 s
[vector] foldr': OK (0.03s)
1129.76 s
[vector] +++ OK, passed 100 tests.
1129.78 s
[vector] foldr1': OK (0.02s)
1129.78 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1129.80 s
[vector] ifoldl: OK (0.01s)
1129.80 s
[vector] +++ OK, passed 100 tests.
1129.81 s
[vector] ifoldl': OK (0.02s)
1129.81 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] ifoldr: OK (0.02s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] ifoldr': OK (0.02s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] ifoldM: OK (0.02s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] ifoldM': OK (0.01s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[pandoc-server] [1 of 1] Compiling Text.Pandoc.Server
1130.42 s
[vector] ifoldM_: OK (0.01s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] ifoldM'_: OK (0.05s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] all: OK
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] any: OK
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] prescanl: OK (0.01s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] prescanl': OK (0.02s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] postscanl: OK (0.02s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] postscanl': OK (0.01s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] scanl: OK (0.01s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] scanl': OK (0.02s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] scanl1: OK (0.01s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] scanl1': OK (0.03s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] iscanl: OK (0.01s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] iscanl': OK
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] prescanr: OK (0.02s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] prescanr': OK (0.02s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] postscanr: OK (0.02s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] postscanr': OK (0.02s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] scanr: OK (0.02s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] scanr': OK (0.02s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.42 s
[vector] scanr1: OK (0.03s)
1130.42 s
[vector] +++ OK, passed 100 tests.
1130.43 s
[vector] scanr1': OK (0.03s)
1130.43 s
[vector] +++ OK, passed 100 tests.
1130.43 s
[vector] iscanr: OK (0.03s)
1130.43 s
[vector] +++ OK, passed 100 tests.
1130.43 s
[vector] iscanr': OK (0.02s)
1130.43 s
[vector] +++ OK, passed 100 tests.
1130.43 s
[vector] mut_read: OK
1130.43 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1130.43 s
[vector] mut_write: OK
1130.43 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1130.43 s
[vector] mut_modify: OK
1130.43 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1130.43 s
[vector] mut_generate: OK
1130.43 s
[vector] +++ OK, passed 100 tests.
1130.43 s
[vector] mut_generateM: OK (0.02s)
1130.43 s
[vector] +++ OK, passed 100 tests.
1130.43 s
[vector] mut_mapM_: OK (0.04s)
1130.43 s
[vector] +++ OK, passed 100 tests.
1130.47 s
[vector] mut_imapM_: OK (0.06s)
1130.47 s
[vector] +++ OK, passed 100 tests.
1130.54 s
[vector] mut_forM_: OK (0.06s)
1130.54 s
[vector] +++ OK, passed 100 tests.
1130.62 s
[vector] mut_iforM_: OK (0.07s)
1130.62 s
[vector] +++ OK, passed 100 tests.
1130.63 s
[vector] mut_foldr: OK (0.02s)
1130.63 s
[vector] +++ OK, passed 100 tests.
1130.65 s
[vector] mut_foldr': OK (0.02s)
1130.65 s
[vector] +++ OK, passed 100 tests.
1130.66 s
[vector] mut_foldl: OK (0.02s)
1130.66 s
[vector] +++ OK, passed 100 tests.
1130.68 s
[vector] mut_foldl': OK (0.02s)
1130.68 s
[vector] +++ OK, passed 100 tests.
1130.72 s
[vector] mut_ifoldr: OK (0.02s)
1130.72 s
[vector] +++ OK, passed 100 tests.
1130.74 s
[vector] mut_ifoldr': OK (0.03s)
1130.74 s
[vector] +++ OK, passed 100 tests.
1130.74 s
[vector] mut_ifoldl: OK (0.01s)
1130.74 s
[vector] +++ OK, passed 100 tests.
1130.76 s
[vector] mut_ifoldl': OK (0.01s)
1130.76 s
[vector] +++ OK, passed 100 tests.
1130.77 s
[vector] mut_foldM: OK (0.01s)
1130.77 s
[vector] +++ OK, passed 100 tests.
1130.78 s
[vector] mut_foldM': OK (0.01s)
1130.78 s
[vector] +++ OK, passed 100 tests.
1130.80 s
[vector] mut_foldrM: OK (0.01s)
1130.80 s
[vector] +++ OK, passed 100 tests.
1130.80 s
[vector] mut_foldrM': OK (0.01s)
1130.80 s
[vector] +++ OK, passed 100 tests.
1130.82 s
[vector] mut_ifoldM: OK (0.01s)
1130.82 s
[vector] +++ OK, passed 100 tests.
1130.84 s
[vector] mut_ifoldM': OK (0.01s)
1130.84 s
[vector] +++ OK, passed 100 tests.
1130.84 s
[vector] mut_ifoldrM: OK (0.01s)
1130.84 s
[vector] +++ OK, passed 100 tests.
1130.85 s
[vector] mut_ifoldrM': OK (0.01s)
1130.85 s
[vector] +++ OK, passed 100 tests.
1130.85 s
[vector] compare: OK
1130.85 s
[vector] +++ OK, passed 100 tests.
1130.85 s
[vector] maximum: OK
1130.85 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1130.86 s
[vector] minimum: OK
1130.86 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1130.86 s
[vector] minIndex: OK
1130.86 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1130.86 s
[vector] maxIndex: OK
1130.86 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1130.86 s
[vector] maximumBy: OK
1130.86 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1130.86 s
[vector] minimumBy: OK
1130.86 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1130.86 s
[vector] maximumOn: OK
1130.86 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1130.86 s
[vector] minimumOn: OK
1130.87 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1130.87 s
[vector] maxIndexBy: OK
1130.87 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1130.87 s
[vector] minIndexBy: OK
1130.87 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1130.87 s
[vector] ListFirstMaxIndexWins: OK
1130.87 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1130.87 s
[vector] FalseListFirstMaxIndexWins: OK
1130.87 s
[vector] +++ OK, failed as expected. (after 1 test):
1130.87 s
[vector] Exception:
1130.87 s
[vector] Prelude.foldr1: empty list
1130.87 s
[vector] CallStack (from HasCallStack):
1130.87 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1130.87 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1130.87 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1130.87 s
[vector] []
1130.88 s
[vector] mempty: OK
1130.88 s
[vector] +++ OK, passed 100 tests.
1130.88 s
[vector] mappend: OK
1130.88 s
[vector] +++ OK, passed 100 tests.
1130.93 s
[vector] mconcat: OK (0.04s)
1130.93 s
[vector] +++ OK, passed 100 tests.
1130.93 s
[vector] glength: OK
1130.93 s
[vector] +++ OK, passed 100 tests.
1130.93 s
[vector] sum: OK
1130.93 s
[vector] +++ OK, passed 100 tests.
1130.93 s
[vector] product: OK
1130.93 s
[vector] +++ OK, passed 100 tests.
1130.93 s
[vector] enumFromN: OK
1130.93 s
[vector] +++ OK, passed 100 tests.
1130.93 s
[vector] enumFromThenN: OK
1130.93 s
[vector] +++ OK, passed 100 tests.
1130.93 s
[vector] enumFromTo: OK
1130.93 s
[vector] +++ OK, passed 100 tests.
1130.93 s
[vector] enumFromThenTo: OK
1130.93 s
[vector] +++ OK, passed 100 tests.
1130.93 s
[vector] unstream
1130.94 s
[vector] unstream == vunstream (exact): OK
1130.94 s
[vector] +++ OK, passed 100 tests.
1130.94 s
[vector] unstream == vunstream (unknown): OK
1130.94 s
[vector] +++ OK, passed 100 tests.
1130.94 s
[vector] unstreamR ~= vunstream (exact): OK
1130.94 s
[vector] +++ OK, passed 100 tests.
1130.94 s
[vector] unstreamR ~= vunstream (unknown): OK
1130.94 s
[vector] +++ OK, passed 100 tests.
1130.94 s
[vector] Tests.Vector.Strict
1130.94 s
[vector] Bool
1130.94 s
[vector] fromList.toList == id: OK
1130.94 s
[vector] +++ OK, passed 100 tests.
1130.94 s
[vector] toList.fromList == id: OK
1130.94 s
[vector] +++ OK, passed 100 tests.
1130.94 s
[vector] unstream.stream == id: OK
1130.94 s
[vector] +++ OK, passed 100 tests.
1130.94 s
[vector] stream.unstream == id: OK
1130.94 s
[vector] +++ OK, passed 100 tests.
1130.94 s
[vector] eq: OK
1130.94 s
[vector] +++ OK, passed 100 tests.
1130.94 s
[vector] length: OK
1130.94 s
[vector] +++ OK, passed 100 tests.
1130.94 s
[vector] null: OK
1130.94 s
[vector] +++ OK, passed 100 tests.
1130.94 s
[vector] index: OK
1130.94 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1130.95 s
[vector] safeIndex: OK
1130.95 s
[vector] +++ OK, passed 100 tests.
1130.95 s
[vector] head: OK
1130.95 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1130.95 s
[vector] last: OK
1130.95 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1130.95 s
[vector] unsafeIndex: OK
1130.95 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1130.95 s
[vector] unsafeHead: OK
1130.95 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1130.95 s
[vector] unsafeLast: OK
1130.95 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1130.95 s
[vector] slice: OK
1130.95 s
[vector] +++ OK, passed 100 tests.
1130.95 s
[vector] init: OK
1130.95 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1130.95 s
[vector] tail: OK
1130.95 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1130.95 s
[vector] take: OK
1130.95 s
[vector] +++ OK, passed 100 tests.
1130.95 s
[vector] drop: OK
1130.95 s
[vector] +++ OK, passed 100 tests.
1130.95 s
[vector] splitAt: OK
1130.95 s
[vector] +++ OK, passed 100 tests.
1130.95 s
[vector] empty: OK
1130.95 s
[vector] +++ OK, passed 100 tests.
1130.95 s
[vector] singleton: OK
1130.95 s
[vector] +++ OK, passed 100 tests.
1130.95 s
[vector] replicate: OK
1130.95 s
[vector] +++ OK, passed 100 tests.
1130.96 s
[vector] generate: OK
1130.96 s
[vector] +++ OK, passed 100 tests.
1130.97 s
[vector] iterateN: OK
1130.97 s
[vector] +++ OK, passed 100 tests.
1130.98 s
[vector] iterateNM: OK (0.02s)
1130.98 s
[vector] +++ OK, passed 100 tests.
1131.02 s
[vector] generateM: OK (0.02s)
1131.02 s
[vector] +++ OK, passed 100 tests.
1131.02 s
[vector] replicateM: OK (0.02s)
1131.02 s
[vector] +++ OK, passed 100 tests.
1131.03 s
[vector] create: OK
1131.03 s
[vector] +++ OK, passed 100 tests.
1131.03 s
[vector] createT: OK
1131.03 s
[vector] +++ OK, passed 100 tests.
1131.04 s
[pandoc-lua-engine] [ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
1131.04 s
[pandoc-lua-engine] [ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
1131.04 s
[pandoc-lua-engine] [ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
1131.04 s
[pandoc-lua-engine] [ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
1131.04 s
[pandoc-lua-engine] [ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
1131.04 s
[pandoc-lua-engine] [ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
1131.04 s
[pandoc-lua-engine] [ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
1131.04 s
[pandoc-lua-engine] [ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
1131.04 s
[pandoc-lua-engine] [10 of 39] Compiling Text.Pandoc.Lua.PandocLua
1131.04 s
[vector] unfoldr: OK
1131.04 s
[vector] +++ OK, passed 100 tests.
1131.04 s
[vector] unfoldrN: OK
1131.04 s
[vector] +++ OK, passed 100 tests.
1131.04 s
[vector] unfoldrExactN: OK
1131.05 s
[vector] +++ OK, passed 100 tests.
1131.05 s
[vector] unfoldrM: OK
1131.05 s
[vector] +++ OK, passed 100 tests.
1131.05 s
[vector] unfoldrNM: OK
1131.05 s
[vector] +++ OK, passed 100 tests.
1131.07 s
[vector] unfoldrExactNM: OK (0.01s)
1131.07 s
[vector] +++ OK, passed 100 tests.
1131.07 s
[vector] constructN: OK
1131.07 s
[vector] +++ OK, passed 100 tests.
1131.08 s
[vector] constructrN: OK
1131.08 s
[vector] +++ OK, passed 100 tests.
1131.08 s
[vector] cons: OK
1131.08 s
[vector] +++ OK, passed 100 tests.
1131.08 s
[vector] snoc: OK
1131.08 s
[vector] +++ OK, passed 100 tests.
1131.10 s
[vector] append: OK
1131.10 s
[vector] +++ OK, passed 100 tests.
1131.10 s
[vector] concat: OK (0.02s)
1131.10 s
[vector] +++ OK, passed 100 tests.
1131.10 s
[vector] force: OK
1131.10 s
[vector] +++ OK, passed 100 tests.
1131.10 s
[vector] upd: OK
1131.10 s
[vector] +++ OK, passed 100 tests.
1131.10 s
[vector] accum: OK
1131.10 s
[vector] +++ OK, passed 100 tests.
1131.11 s
[vector] reverse: OK
1131.11 s
[vector] +++ OK, passed 100 tests.
1131.11 s
[vector] backpermute: OK
1131.11 s
[vector] +++ OK, passed 100 tests.
1131.11 s
[vector] map: OK
1131.11 s
[vector] +++ OK, passed 100 tests.
1131.11 s
[vector] imap: OK
1131.11 s
[vector] +++ OK, passed 100 tests.
1131.11 s
[vector] concatMap: OK
1131.11 s
[vector] +++ OK, passed 100 tests.
1131.11 s
[vector] mapM: OK
1131.11 s
[vector] +++ OK, passed 100 tests.
1131.12 s
[vector] mapM_: OK
1131.12 s
[vector] +++ OK, passed 100 tests.
1131.13 s
[vector] forM: OK
1131.13 s
[vector] +++ OK, passed 100 tests.
1131.13 s
[vector] forM_: OK (0.01s)
1131.13 s
[vector] +++ OK, passed 100 tests.
1131.13 s
[vector] imapM: OK
1131.13 s
[vector] +++ OK, passed 100 tests.
1131.14 s
[vector] imapM_: OK
1131.14 s
[vector] +++ OK, passed 100 tests.
1131.15 s
[vector] zipWith: OK
1131.15 s
[vector] +++ OK, passed 100 tests.
1131.15 s
[vector] zipWith3: OK
1131.15 s
[vector] +++ OK, passed 100 tests.
1131.16 s
[vector] izipWith: OK
1131.16 s
[vector] +++ OK, passed 100 tests.
1131.16 s
[vector] izipWith3: OK
1131.16 s
[vector] +++ OK, passed 100 tests.
1131.16 s
[vector] izipWithM: OK
1131.16 s
[vector] +++ OK, passed 100 tests.
1131.17 s
[vector] izipWithM_: OK (0.02s)
1131.17 s
[vector] +++ OK, passed 100 tests.
1131.17 s
[vector] zipWithM: OK
1131.18 s
[vector] +++ OK, passed 100 tests.
1131.18 s
[vector] zipWithM_: OK
1131.18 s
[vector] +++ OK, passed 100 tests.
1131.18 s
[vector] filter: OK
1131.18 s
[vector] +++ OK, passed 100 tests.
1131.20 s
[vector] ifilter: OK
1131.20 s
[vector] +++ OK, passed 100 tests.
1131.20 s
[vector] filterM: OK (0.02s)
1131.20 s
[vector] +++ OK, passed 100 tests.
1131.20 s
[vector] uniq: OK
1131.20 s
[vector] +++ OK, passed 100 tests.
1131.20 s
[vector] mapMaybe: OK
1131.20 s
[vector] +++ OK, passed 100 tests.
1131.20 s
[vector] imapMaybe: OK
1131.20 s
[vector] +++ OK, passed 100 tests.
1131.20 s
[vector] takeWhile: OK
1131.20 s
[vector] +++ OK, passed 100 tests.
1131.20 s
[vector] dropWhile: OK
1131.20 s
[vector] +++ OK, passed 100 tests.
1131.21 s
[vector] partition: OK
1131.21 s
[vector] +++ OK, passed 100 tests.
1131.21 s
[vector] partitionWith: OK
1131.21 s
[vector] +++ OK, passed 100 tests.
1131.21 s
[vector] span: OK
1131.21 s
[vector] +++ OK, passed 100 tests.
1131.21 s
[vector] break: OK
1131.21 s
[vector] +++ OK, passed 100 tests.
1131.21 s
[vector] spanR: OK
1131.21 s
[vector] +++ OK, passed 100 tests.
1131.21 s
[vector] breakR: OK
1131.21 s
[vector] +++ OK, passed 100 tests.
1131.21 s
[vector] groupBy: OK
1131.21 s
[vector] +++ OK, passed 100 tests.
1131.21 s
[vector] elem: OK
1131.21 s
[vector] +++ OK, passed 100 tests.
1131.21 s
[vector] notElem: OK
1131.21 s
[vector] +++ OK, passed 100 tests.
1131.21 s
[vector] find: OK
1131.21 s
[vector] +++ OK, passed 100 tests.
1131.21 s
[vector] findIndex: OK
1131.21 s
[vector] +++ OK, passed 100 tests.
1131.22 s
[vector] findIndexR: OK
1131.22 s
[vector] +++ OK, passed 100 tests.
1131.22 s
[vector] findIndices: OK
1131.22 s
[vector] +++ OK, passed 100 tests.
1131.22 s
[vector] elemIndex: OK
1131.22 s
[vector] +++ OK, passed 100 tests.
1131.22 s
[vector] elemIndices: OK
1131.22 s
[vector] +++ OK, passed 100 tests.
1131.22 s
[vector] foldl: OK
1131.22 s
[vector] +++ OK, passed 100 tests.
1131.22 s
[vector] foldl1: OK
1131.22 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1131.22 s
[vector] foldl': OK
1131.22 s
[vector] +++ OK, passed 100 tests.
1131.22 s
[vector] foldl1': OK
1131.22 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1131.22 s
[vector] foldr: OK
1131.22 s
[vector] +++ OK, passed 100 tests.
1131.22 s
[vector] foldr1: OK
1131.22 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1131.22 s
[vector] foldr': OK
1131.22 s
[vector] +++ OK, passed 100 tests.
1131.23 s
[vector] foldr1': OK
1131.23 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1131.23 s
[vector] ifoldl: OK
1131.23 s
[vector] +++ OK, passed 100 tests.
1131.24 s
[vector] ifoldl': OK
1131.24 s
[vector] +++ OK, passed 100 tests.
1131.24 s
[vector] ifoldr: OK
1131.24 s
[vector] +++ OK, passed 100 tests.
1131.25 s
[vector] ifoldr': OK
1131.25 s
[vector] +++ OK, passed 100 tests.
1131.25 s
[vector] ifoldM: OK
1131.25 s
[vector] +++ OK, passed 100 tests.
1131.25 s
[vector] ifoldM': OK
1131.25 s
[vector] +++ OK, passed 100 tests.
1131.25 s
[vector] ifoldM_: OK
1131.25 s
[vector] +++ OK, passed 100 tests.
1131.25 s
[vector] ifoldM'_: OK
1131.25 s
[vector] +++ OK, passed 100 tests.
1131.25 s
[vector] all: OK
1131.25 s
[vector] +++ OK, passed 100 tests.
1131.25 s
[vector] any: OK
1131.25 s
[vector] +++ OK, passed 100 tests.
1131.25 s
[vector] prescanl: OK
1131.25 s
[vector] +++ OK, passed 100 tests.
1131.26 s
[vector] prescanl': OK
1131.26 s
[vector] +++ OK, passed 100 tests.
1131.26 s
[pandoc-lua-engine] [11 of 39] Compiling Text.Pandoc.Lua.Module.Types
1131.26 s
[vector] postscanl: OK
1131.26 s
[vector] +++ OK, passed 100 tests.
1131.26 s
[vector] postscanl': OK
1131.27 s
[vector] +++ OK, passed 100 tests.
1131.27 s
[vector] scanl: OK
1131.27 s
[vector] +++ OK, passed 100 tests.
1131.27 s
[vector] scanl': OK
1131.27 s
[vector] +++ OK, passed 100 tests.
1131.27 s
[vector] scanl1: OK
1131.27 s
[vector] +++ OK, passed 100 tests.
1131.27 s
[vector] scanl1': OK
1131.28 s
[vector] +++ OK, passed 100 tests.
1131.28 s
[vector] iscanl: OK
1131.28 s
[vector] +++ OK, passed 100 tests.
1131.29 s
[vector] iscanl': OK
1131.29 s
[vector] +++ OK, passed 100 tests.
1131.29 s
[vector] prescanr: OK
1131.29 s
[vector] +++ OK, passed 100 tests.
1131.29 s
[vector] prescanr': OK
1131.29 s
[vector] +++ OK, passed 100 tests.
1131.30 s
[vector] postscanr: OK
1131.30 s
[vector] +++ OK, passed 100 tests.
1131.30 s
[vector] postscanr': OK
1131.30 s
[vector] +++ OK, passed 100 tests.
1131.30 s
[vector] scanr: OK
1131.31 s
[vector] +++ OK, passed 100 tests.
1131.31 s
[vector] scanr': OK
1131.31 s
[vector] +++ OK, passed 100 tests.
1131.31 s
[vector] scanr1: OK
1131.31 s
[vector] +++ OK, passed 100 tests.
1131.31 s
[vector] scanr1': OK
1131.31 s
[vector] +++ OK, passed 100 tests.
1131.32 s
[vector] iscanr: OK
1131.32 s
[vector] +++ OK, passed 100 tests.
1131.32 s
[vector] iscanr': OK
1131.32 s
[vector] +++ OK, passed 100 tests.
1131.32 s
[vector] mut_read: OK
1131.32 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1131.33 s
[vector] mut_write: OK
1131.33 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1131.33 s
[vector] mut_modify: OK
1131.33 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1131.34 s
[vector] mut_generate: OK
1131.34 s
[vector] +++ OK, passed 100 tests.
1131.34 s
[vector] mut_generateM: OK
1131.34 s
[vector] +++ OK, passed 100 tests.
1131.34 s
[vector] mut_mapM_: OK
1131.34 s
[vector] +++ OK, passed 100 tests.
1131.37 s
[vector] mut_imapM_: OK
1131.37 s
[vector] +++ OK, passed 100 tests.
1131.38 s
[vector] mut_forM_: OK (0.01s)
1131.38 s
[vector] +++ OK, passed 100 tests.
1131.40 s
[vector] mut_iforM_: OK (0.02s)
1131.40 s
[vector] +++ OK, passed 100 tests.
1131.40 s
[vector] mut_foldr: OK
1131.40 s
[vector] +++ OK, passed 100 tests.
1131.40 s
[vector] mut_foldr': OK
1131.40 s
[vector] +++ OK, passed 100 tests.
1131.41 s
[vector] mut_foldl: OK
1131.41 s
[vector] +++ OK, passed 100 tests.
1131.42 s
[vector] mut_foldl': OK
1131.42 s
[vector] +++ OK, passed 100 tests.
1131.42 s
[vector] mut_ifoldr: OK
1131.42 s
[vector] +++ OK, passed 100 tests.
1131.42 s
[vector] mut_ifoldr': OK
1131.42 s
[vector] +++ OK, passed 100 tests.
1131.42 s
[pandoc-lua-engine] [12 of 39] Compiling Text.Pandoc.Lua.Module.Text
1131.42 s
[vector] mut_ifoldl: OK
1131.42 s
[vector] +++ OK, passed 100 tests.
1131.43 s
[pandoc-lua-engine] [13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
1131.43 s
[vector] mut_ifoldl': OK
1131.43 s
[vector] +++ OK, passed 100 tests.
1131.43 s
[vector] mut_foldM: OK
1131.43 s
[vector] +++ OK, passed 100 tests.
1131.43 s
[vector] mut_foldM': OK
1131.43 s
[vector] +++ OK, passed 100 tests.
1131.43 s
[vector] mut_foldrM: OK
1131.44 s
[vector] +++ OK, passed 100 tests.
1131.45 s
[vector] mut_foldrM': OK
1131.45 s
[vector] +++ OK, passed 100 tests.
1131.45 s
[vector] mut_ifoldM: OK
1131.45 s
[vector] +++ OK, passed 100 tests.
1131.45 s
[vector] mut_ifoldM': OK
1131.45 s
[vector] +++ OK, passed 100 tests.
1131.46 s
[vector] mut_ifoldrM: OK
1131.46 s
[vector] +++ OK, passed 100 tests.
1131.46 s
[vector] mut_ifoldrM': OK
1131.46 s
[vector] +++ OK, passed 100 tests.
1131.46 s
[vector] compare: OK
1131.46 s
[vector] +++ OK, passed 100 tests.
1131.46 s
[vector] maximum: OK
1131.46 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1131.46 s
[vector] minimum: OK
1131.46 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1131.46 s
[vector] minIndex: OK
1131.46 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1131.46 s
[vector] maxIndex: OK
1131.46 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1131.46 s
[vector] maximumBy: OK
1131.46 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1131.46 s
[vector] minimumBy: OK
1131.46 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1131.46 s
[vector] maximumOn: OK
1131.46 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1131.46 s
[vector] minimumOn: OK
1131.47 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1131.47 s
[vector] maxIndexBy: OK
1131.47 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1131.47 s
[vector] minIndexBy: OK
1131.47 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1131.47 s
[vector] ListFirstMaxIndexWins: OK
1131.47 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1131.47 s
[vector] FalseListFirstMaxIndexWins: OK
1131.47 s
[vector] +++ OK, failed as expected. (after 1 test):
1131.47 s
[vector] Exception:
1131.47 s
[vector] Prelude.foldr1: empty list
1131.47 s
[vector] CallStack (from HasCallStack):
1131.47 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1131.47 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1131.47 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1131.47 s
[vector] []
1131.47 s
[vector] zip: OK
1131.47 s
[vector] +++ OK, passed 100 tests.
1131.47 s
[vector] zip3: OK
1131.49 s
[vector] +++ OK, passed 100 tests.
1131.49 s
[vector] unzip: OK
1131.49 s
[vector] +++ OK, passed 100 tests.
1131.49 s
[vector] unzip3: OK
1131.49 s
[vector] +++ OK, passed 100 tests.
1131.49 s
[vector] indexed: OK
1131.49 s
[vector] +++ OK, passed 100 tests.
1131.50 s
[vector] update: OK
1131.50 s
[vector] +++ OK, passed 100 tests.
1131.51 s
[vector] concat: OK (0.02s)
1131.51 s
[vector] +++ OK, passed 100 tests.
1131.51 s
[vector] mempty: OK
1131.51 s
[vector] +++ OK, passed 100 tests.
1131.51 s
[vector] mappend: OK
1131.52 s
[vector] +++ OK, passed 100 tests.
1131.53 s
[vector] mconcat: OK (0.02s)
1131.53 s
[vector] +++ OK, passed 100 tests.
1131.53 s
[vector] fmap: OK
1131.53 s
[vector] +++ OK, passed 100 tests.
1131.54 s
[vector] return: OK
1131.54 s
[vector] +++ OK, passed 100 tests.
1131.55 s
[vector] bind: OK (0.02s)
1131.55 s
[vector] +++ OK, passed 100 tests.
1131.55 s
[vector] mzip: OK
1131.55 s
[vector] +++ OK, passed 100 tests.
1131.56 s
[vector] munzip: OK
1131.56 s
[vector] +++ OK, passed 100 tests.
1131.56 s
[vector] applicative_pure: OK
1131.56 s
[vector] +++ OK, passed 100 tests.
1131.58 s
[vector] applicative_appl: OK (0.02s)
1131.58 s
[vector] +++ OK, passed 100 tests.
1131.58 s
[vector] alternative_empty: OK
1131.58 s
[vector] +++ OK, passed 100 tests.
1131.60 s
[vector] alternative_or: OK
1131.60 s
[vector] +++ OK, passed 100 tests.
1131.63 s
[vector] sequence: OK (0.04s)
1131.63 s
[vector] +++ OK, passed 100 tests.
1131.64 s
[vector] sequence_: OK
1131.64 s
[vector] +++ OK, passed 100 tests.
1131.64 s
[vector] glength: OK
1131.64 s
[vector] +++ OK, passed 100 tests.
1131.65 s
[vector] and: OK
1131.65 s
[vector] +++ OK, passed 100 tests.
1131.65 s
[vector] or: OK
1131.65 s
[vector] +++ OK, passed 100 tests.
1131.65 s
[vector] Int
1131.66 s
[vector] fromList.toList == id: OK
1131.66 s
[vector] +++ OK, passed 100 tests.
1131.66 s
[vector] toList.fromList == id: OK
1131.66 s
[vector] +++ OK, passed 100 tests.
1131.66 s
[vector] unstream.stream == id: OK
1131.66 s
[vector] +++ OK, passed 100 tests.
1131.67 s
[vector] stream.unstream == id: OK
1131.67 s
[vector] +++ OK, passed 100 tests.
1131.67 s
[vector] eq: OK
1131.67 s
[vector] +++ OK, passed 100 tests.
1131.67 s
[vector] length: OK
1131.67 s
[vector] +++ OK, passed 100 tests.
1131.67 s
[vector] null: OK
1131.67 s
[vector] +++ OK, passed 100 tests.
1131.67 s
[vector] index: OK
1131.67 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1131.67 s
[vector] safeIndex: OK
1131.67 s
[vector] +++ OK, passed 100 tests.
1131.67 s
[vector] head: OK
1131.67 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1131.67 s
[vector] last: OK
1131.67 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1131.67 s
[vector] unsafeIndex: OK
1131.67 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1131.67 s
[vector] unsafeHead: OK
1131.67 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1131.67 s
[vector] unsafeLast: OK
1131.67 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1131.67 s
[vector] slice: OK
1131.67 s
[vector] +++ OK, passed 100 tests.
1131.67 s
[vector] init: OK
1131.67 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1131.68 s
[vector] tail: OK
1131.68 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1131.68 s
[vector] take: OK
1131.68 s
[vector] +++ OK, passed 100 tests.
1131.68 s
[vector] drop: OK
1131.68 s
[vector] +++ OK, passed 100 tests.
1131.68 s
[vector] splitAt: OK
1131.68 s
[vector] +++ OK, passed 100 tests.
1131.68 s
[vector] empty: OK
1131.68 s
[vector] +++ OK, passed 100 tests.
1131.68 s
[vector] singleton: OK
1131.68 s
[vector] +++ OK, passed 100 tests.
1131.68 s
[vector] replicate: OK
1131.68 s
[vector] +++ OK, passed 100 tests.
1131.68 s
[vector] generate: OK
1131.68 s
[vector] +++ OK, passed 100 tests.
1131.70 s
[vector] iterateN: OK
1131.70 s
[vector] +++ OK, passed 100 tests.
1131.72 s
[vector] iterateNM: OK (0.02s)
1131.72 s
[vector] +++ OK, passed 100 tests.
1131.74 s
[vector] generateM: OK (0.02s)
1131.74 s
[vector] +++ OK, passed 100 tests.
1131.75 s
[vector] replicateM: OK (0.03s)
1131.75 s
[vector] +++ OK, passed 100 tests.
1131.75 s
[vector] create: OK
1131.75 s
[vector] +++ OK, passed 100 tests.
1131.75 s
[vector] createT: OK
1131.75 s
[vector] +++ OK, passed 100 tests.
1131.75 s
[vector] unfoldr: OK
1131.75 s
[vector] +++ OK, passed 100 tests.
1131.75 s
[vector] unfoldrN: OK
1131.75 s
[vector] +++ OK, passed 100 tests.
1131.75 s
[vector] unfoldrExactN: OK
1131.76 s
[vector] +++ OK, passed 100 tests.
1131.76 s
[vector] unfoldrM: OK
1131.76 s
[vector] +++ OK, passed 100 tests.
1131.78 s
[vector] unfoldrNM: OK
1131.78 s
[vector] +++ OK, passed 100 tests.
1131.79 s
[vector] unfoldrExactNM: OK (0.02s)
1131.79 s
[vector] +++ OK, passed 100 tests.
1131.79 s
[vector] constructN: OK
1131.79 s
[vector] +++ OK, passed 100 tests.
1131.79 s
[vector] constructrN: OK
1131.79 s
[vector] +++ OK, passed 100 tests.
1131.79 s
[vector] cons: OK
1131.80 s
[vector] +++ OK, passed 100 tests.
1131.80 s
[vector] snoc: OK
1131.80 s
[vector] +++ OK, passed 100 tests.
1131.80 s
[vector] append: OK
1131.82 s
[vector] +++ OK, passed 100 tests.
1131.82 s
[vector] concat: OK (0.02s)
1131.82 s
[vector] +++ OK, passed 100 tests.
1131.82 s
[vector] force: OK
1131.82 s
[vector] +++ OK, passed 100 tests.
1131.82 s
[vector] upd: OK
1131.82 s
[vector] +++ OK, passed 100 tests.
1131.82 s
[vector] accum: OK
1131.83 s
[vector] +++ OK, passed 100 tests.
1131.83 s
[vector] reverse: OK
1131.83 s
[vector] +++ OK, passed 100 tests.
1131.83 s
[vector] backpermute: OK
1131.83 s
[vector] +++ OK, passed 100 tests.
1131.83 s
[vector] map: OK
1131.83 s
[vector] +++ OK, passed 100 tests.
1131.84 s
[vector] imap: OK
1131.84 s
[vector] +++ OK, passed 100 tests.
1131.84 s
[vector] concatMap: OK
1131.84 s
[vector] +++ OK, passed 100 tests.
1131.86 s
[vector] mapM: OK
1131.86 s
[vector] +++ OK, passed 100 tests.
1131.86 s
[vector] mapM_: OK (0.02s)
1131.88 s
[vector] +++ OK, passed 100 tests.
1131.88 s
[vector] forM: OK
1131.88 s
[vector] +++ OK, passed 100 tests.
1131.89 s
[vector] forM_: OK (0.02s)
1131.90 s
[vector] +++ OK, passed 100 tests.
1131.90 s
[vector] imapM: OK
1131.90 s
[vector] +++ OK, passed 100 tests.
1131.92 s
[vector] imapM_: OK (0.02s)
1131.92 s
[vector] +++ OK, passed 100 tests.
1131.93 s
[vector] zipWith: OK
1131.93 s
[vector] +++ OK, passed 100 tests.
1131.93 s
[vector] zipWith3: OK
1131.94 s
[vector] +++ OK, passed 100 tests.
1131.94 s
[vector] izipWith: OK
1131.94 s
[vector] +++ OK, passed 100 tests.
1131.95 s
[vector] izipWith3: OK
1131.95 s
[vector] +++ OK, passed 100 tests.
1131.96 s
[vector] izipWithM: OK
1131.96 s
[vector] +++ OK, passed 100 tests.
1131.99 s
[vector] izipWithM_: OK (0.03s)
1131.99 s
[vector] +++ OK, passed 100 tests.
1132.02 s
[vector] zipWithM: OK (0.01s)
1132.02 s
[vector] +++ OK, passed 100 tests.
1132.03 s
[vector] zipWithM_: OK (0.03s)
1132.03 s
[vector] +++ OK, passed 100 tests.
1132.04 s
[vector] filter: OK
1132.04 s
[vector] +++ OK, passed 100 tests.
1132.06 s
[vector] ifilter: OK
1132.06 s
[vector] +++ OK, passed 100 tests.
1132.09 s
[vector] filterM: OK (0.04s)
1132.09 s
[vector] +++ OK, passed 100 tests.
1132.10 s
[vector] uniq: OK
1132.10 s
[vector] +++ OK, passed 100 tests.
1132.10 s
[vector] mapMaybe: OK
1132.10 s
[vector] +++ OK, passed 100 tests.
1132.10 s
[vector] imapMaybe: OK
1132.10 s
[vector] +++ OK, passed 100 tests.
1132.10 s
[vector] takeWhile: OK
1132.10 s
[vector] +++ OK, passed 100 tests.
1132.10 s
[vector] dropWhile: OK
1132.11 s
[vector] +++ OK, passed 100 tests.
1132.11 s
[vector] partition: OK
1132.11 s
[vector] +++ OK, passed 100 tests.
1132.11 s
[vector] partitionWith: OK
1132.11 s
[vector] +++ OK, passed 100 tests.
1132.11 s
[vector] span: OK
1132.12 s
[vector] +++ OK, passed 100 tests.
1132.12 s
[vector] break: OK
1132.12 s
[vector] +++ OK, passed 100 tests.
1132.12 s
[vector] spanR: OK
1132.13 s
[vector] +++ OK, passed 100 tests.
1132.13 s
[vector] breakR: OK
1132.14 s
[vector] +++ OK, passed 100 tests.
1132.14 s
[vector] groupBy: OK
1132.14 s
[vector] +++ OK, passed 100 tests.
1132.14 s
[vector] elem: OK
1132.14 s
[vector] +++ OK, passed 100 tests.
1132.14 s
[vector] notElem: OK
1132.14 s
[vector] +++ OK, passed 100 tests.
1132.14 s
[vector] find: OK
1132.14 s
[vector] +++ OK, passed 100 tests.
1132.14 s
[vector] findIndex: OK
1132.14 s
[vector] +++ OK, passed 100 tests.
1132.14 s
[vector] findIndexR: OK
1132.14 s
[vector] +++ OK, passed 100 tests.
1132.14 s
[vector] findIndices: OK
1132.14 s
[vector] +++ OK, passed 100 tests.
1132.14 s
[vector] elemIndex: OK
1132.15 s
[vector] +++ OK, passed 100 tests.
1132.15 s
[vector] elemIndices: OK
1132.15 s
[vector] +++ OK, passed 100 tests.
1132.15 s
[vector] foldl: OK
1132.16 s
[vector] +++ OK, passed 100 tests.
1132.16 s
[vector] foldl1: OK
1132.16 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1132.16 s
[vector] foldl': OK
1132.16 s
[vector] +++ OK, passed 100 tests.
1132.16 s
[vector] foldl1': OK
1132.17 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1132.17 s
[vector] foldr: OK
1132.17 s
[vector] +++ OK, passed 100 tests.
1132.17 s
[vector] foldr1: OK
1132.17 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1132.18 s
[vector] foldr': OK
1132.18 s
[vector] +++ OK, passed 100 tests.
1132.18 s
[vector] foldr1': OK
1132.19 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1132.19 s
[vector] ifoldl: OK
1132.19 s
[vector] +++ OK, passed 100 tests.
1132.20 s
[vector] ifoldl': OK
1132.20 s
[vector] +++ OK, passed 100 tests.
1132.21 s
[vector] ifoldr: OK
1132.21 s
[vector] +++ OK, passed 100 tests.
1132.22 s
[vector] ifoldr': OK
1132.22 s
[vector] +++ OK, passed 100 tests.
1132.22 s
[vector] ifoldM: OK
1132.22 s
[vector] +++ OK, passed 100 tests.
1132.22 s
[vector] ifoldM': OK
1132.22 s
[vector] +++ OK, passed 100 tests.
1132.24 s
[vector] ifoldM_: OK (0.02s)
1132.24 s
[vector] +++ OK, passed 100 tests.
1132.25 s
[vector] ifoldM'_: OK (0.02s)
1132.25 s
[vector] +++ OK, passed 100 tests.
1132.25 s
[vector] all: OK
1132.26 s
[vector] +++ OK, passed 100 tests.
1132.27 s
[vector] any: OK
1132.27 s
[vector] +++ OK, passed 100 tests.
1132.27 s
[vector] prescanl: OK
1132.28 s
[vector] +++ OK, passed 100 tests.
1132.28 s
[vector] prescanl': OK
1132.28 s
[vector] +++ OK, passed 100 tests.
1132.28 s
[vector] postscanl: OK
1132.28 s
[vector] +++ OK, passed 100 tests.
1132.28 s
[vector] postscanl': OK
1132.28 s
[vector] +++ OK, passed 100 tests.
1132.28 s
[vector] scanl: OK
1132.28 s
[vector] +++ OK, passed 100 tests.
1132.29 s
[vector] scanl': OK
1132.29 s
[vector] +++ OK, passed 100 tests.
1132.29 s
[vector] scanl1: OK
1132.30 s
[vector] +++ OK, passed 100 tests.
1132.30 s
[vector] scanl1': OK
1132.30 s
[vector] +++ OK, passed 100 tests.
1132.31 s
[vector] iscanl: OK
1132.31 s
[vector] +++ OK, passed 100 tests.
1132.31 s
[vector] iscanl': OK
1132.31 s
[vector] +++ OK, passed 100 tests.
1132.31 s
[vector] prescanr: OK
1132.32 s
[vector] +++ OK, passed 100 tests.
1132.32 s
[vector] prescanr': OK
1132.32 s
[vector] +++ OK, passed 100 tests.
1132.32 s
[vector] postscanr: OK
1132.33 s
[vector] +++ OK, passed 100 tests.
1132.33 s
[vector] postscanr': OK
1132.34 s
[vector] +++ OK, passed 100 tests.
1132.34 s
[vector] scanr: OK
1132.34 s
[vector] +++ OK, passed 100 tests.
1132.35 s
[vector] scanr': OK (0.01s)
1132.35 s
[vector] +++ OK, passed 100 tests.
1132.36 s
[vector] scanr1: OK
1132.36 s
[vector] +++ OK, passed 100 tests.
1132.36 s
[vector] scanr1': OK
1132.36 s
[vector] +++ OK, passed 100 tests.
1132.36 s
[vector] iscanr: OK
1132.36 s
[vector] +++ OK, passed 100 tests.
1132.37 s
[vector] iscanr': OK
1132.37 s
[vector] +++ OK, passed 100 tests.
1132.37 s
[vector] mut_read: OK
1132.37 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1132.37 s
[vector] mut_write: OK
1132.37 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1132.37 s
[vector] mut_modify: OK
1132.37 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1132.38 s
[vector] mut_generate: OK
1132.38 s
[vector] +++ OK, passed 100 tests.
1132.40 s
[vector] mut_generateM: OK (0.01s)
1132.40 s
[vector] +++ OK, passed 100 tests.
1132.42 s
[vector] mut_mapM_: OK (0.02s)
1132.42 s
[vector] +++ OK, passed 100 tests.
1132.44 s
[vector] mut_imapM_: OK (0.03s)
1132.44 s
[vector] +++ OK, passed 100 tests.
1132.46 s
[vector] mut_forM_: OK (0.01s)
1132.46 s
[vector] +++ OK, passed 100 tests.
1132.47 s
[vector] mut_iforM_: OK (0.01s)
1132.47 s
[vector] +++ OK, passed 100 tests.
1132.47 s
[vector] mut_foldr: OK
1132.47 s
[vector] +++ OK, passed 100 tests.
1132.47 s
[vector] mut_foldr': OK
1132.47 s
[vector] +++ OK, passed 100 tests.
1132.47 s
[vector] mut_foldl: OK
1132.47 s
[vector] +++ OK, passed 100 tests.
1132.47 s
[vector] mut_foldl': OK
1132.47 s
[vector] +++ OK, passed 100 tests.
1132.47 s
[vector] mut_ifoldr: OK
1132.48 s
[vector] +++ OK, passed 100 tests.
1132.48 s
[vector] mut_ifoldr': OK
1132.48 s
[vector] +++ OK, passed 100 tests.
1132.48 s
[vector] mut_ifoldl: OK
1132.48 s
[vector] +++ OK, passed 100 tests.
1132.48 s
[vector] mut_ifoldl': OK
1132.48 s
[vector] +++ OK, passed 100 tests.
1132.48 s
[vector] mut_foldM: OK
1132.48 s
[pandoc-lua-engine] [14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
1132.48 s
[pandoc-lua-engine] [15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
1132.48 s
[pandoc-lua-engine] [16 of 39] Compiling Text.Pandoc.Lua.Module.Template
1132.49 s
[vector] +++ OK, passed 100 tests.
1132.49 s
[vector] mut_foldM': OK
1132.49 s
[vector] +++ OK, passed 100 tests.
1132.49 s
[vector] mut_foldrM: OK
1132.49 s
[vector] +++ OK, passed 100 tests.
1132.49 s
[vector] mut_foldrM': OK
1132.49 s
[vector] +++ OK, passed 100 tests.
1132.49 s
[vector] mut_ifoldM: OK
1132.49 s
[vector] +++ OK, passed 100 tests.
1132.50 s
[vector] mut_ifoldM': OK
1132.50 s
[vector] +++ OK, passed 100 tests.
1132.50 s
[vector] mut_ifoldrM: OK
1132.50 s
[vector] +++ OK, passed 100 tests.
1132.50 s
[vector] mut_ifoldrM': OK
1132.50 s
[vector] +++ OK, passed 100 tests.
1132.50 s
[vector] compare: OK
1132.50 s
[vector] +++ OK, passed 100 tests.
1132.50 s
[vector] maximum: OK
1132.50 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1132.50 s
[vector] minimum: OK
1132.50 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1132.50 s
[vector] minIndex: OK
1132.50 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1132.50 s
[vector] maxIndex: OK
1132.50 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1132.50 s
[vector] maximumBy: OK
1132.50 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1132.50 s
[vector] minimumBy: OK
1132.50 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1132.51 s
[vector] maximumOn: OK
1132.51 s
[vector] +++ OK, passed 100 tests; 10 discarded.
1132.51 s
[vector] minimumOn: OK
1132.51 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1132.51 s
[vector] maxIndexBy: OK
1132.51 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1132.51 s
[vector] minIndexBy: OK
1132.51 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1132.51 s
[vector] ListFirstMaxIndexWins: OK
1132.51 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1132.51 s
[vector] FalseListFirstMaxIndexWins: OK
1132.51 s
[vector] +++ OK, failed as expected. (after 1 test):
1132.51 s
[vector] Exception:
1132.51 s
[vector] Prelude.foldr1: empty list
1132.51 s
[vector] CallStack (from HasCallStack):
1132.51 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1132.51 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1132.51 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1132.51 s
[vector] []
1132.51 s
[vector] zip: OK
1132.51 s
[vector] +++ OK, passed 100 tests.
1132.51 s
[vector] zip3: OK
1132.51 s
[vector] +++ OK, passed 100 tests.
1132.51 s
[vector] unzip: OK
1132.51 s
[vector] +++ OK, passed 100 tests.
1132.51 s
[vector] unzip3: OK
1132.51 s
[vector] +++ OK, passed 100 tests.
1132.51 s
[vector] indexed: OK
1132.51 s
[vector] +++ OK, passed 100 tests.
1132.52 s
[vector] update: OK
1132.52 s
[vector] +++ OK, passed 100 tests.
1132.52 s
[vector] concat: OK
1132.52 s
[vector] +++ OK, passed 100 tests.
1132.52 s
[vector] mempty: OK
1132.52 s
[vector] +++ OK, passed 100 tests.
1132.52 s
[vector] mappend: OK
1132.53 s
[vector] +++ OK, passed 100 tests.
1132.53 s
[vector] mconcat: OK
1132.53 s
[vector] +++ OK, passed 100 tests.
1132.53 s
[vector] fmap: OK
1132.53 s
[vector] +++ OK, passed 100 tests.
1132.54 s
[vector] return: OK
1132.54 s
[vector] +++ OK, passed 100 tests.
1132.55 s
[vector] bind: OK (0.02s)
1132.55 s
[vector] +++ OK, passed 100 tests.
1132.55 s
[vector] mzip: OK
1132.55 s
[vector] +++ OK, passed 100 tests.
1132.56 s
[vector] munzip: OK
1132.56 s
[vector] +++ OK, passed 100 tests.
1132.56 s
[vector] applicative_pure: OK
1132.56 s
[vector] +++ OK, passed 100 tests.
1132.61 s
[vector] applicative_appl: OK (0.05s)
1132.61 s
[vector] +++ OK, passed 100 tests.
1132.61 s
[vector] alternative_empty: OK
1132.61 s
[vector] +++ OK, passed 100 tests.
1132.62 s
[vector] alternative_or: OK
1132.62 s
[vector] +++ OK, passed 100 tests.
1132.65 s
[vector] sequence: OK (0.03s)
1132.65 s
[vector] +++ OK, passed 100 tests.
1132.66 s
[vector] sequence_: OK (0.01s)
1132.66 s
[vector] +++ OK, passed 100 tests.
1132.66 s
[vector] glength: OK
1132.66 s
[vector] +++ OK, passed 100 tests.
1132.66 s
[vector] sum: OK
1132.66 s
[vector] +++ OK, passed 100 tests.
1132.66 s
[vector] product: OK
1132.66 s
[vector] +++ OK, passed 100 tests.
1132.66 s
[vector] enumFromN: OK
1132.66 s
[vector] +++ OK, passed 100 tests.
1132.66 s
[vector] enumFromThenN: OK
1132.66 s
[vector] +++ OK, passed 100 tests.
1132.66 s
[vector] enumFromTo: OK
1132.67 s
[vector] +++ OK, passed 100 tests.
1132.67 s
[vector] enumFromThenTo: OK
1132.67 s
[vector] +++ OK, passed 100 tests; 10 discarded.
1132.67 s
[vector] unstream
1132.67 s
[vector] unstream == vunstream (exact): OK
1132.67 s
[vector] +++ OK, passed 100 tests.
1132.67 s
[vector] unstream == vunstream (unknown): OK
1132.67 s
[vector] +++ OK, passed 100 tests.
1132.67 s
[vector] unstreamR ~= vunstream (exact): OK
1132.67 s
[vector] +++ OK, passed 100 tests.
1132.67 s
[vector] unstreamR ~= vunstream (unknown): OK
1132.67 s
[vector] +++ OK, passed 100 tests.
1132.67 s
[vector] Tests.Vector.Unboxed
1132.67 s
[vector] ()
1132.67 s
[vector] fromList.toList == id: OK
1132.68 s
[vector] +++ OK, passed 100 tests.
1132.68 s
[vector] toList.fromList == id: OK
1132.68 s
[vector] +++ OK, passed 100 tests.
1132.68 s
[vector] unstream.stream == id: OK
1132.68 s
[vector] +++ OK, passed 100 tests.
1132.68 s
[vector] stream.unstream == id: OK
1132.68 s
[vector] +++ OK, passed 100 tests.
1132.68 s
[vector] eq: OK
1132.68 s
[vector] +++ OK, passed 100 tests.
1132.68 s
[vector] length: OK
1132.68 s
[vector] +++ OK, passed 100 tests.
1132.68 s
[vector] null: OK
1132.68 s
[vector] +++ OK, passed 100 tests.
1132.68 s
[vector] index: OK
1132.68 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1132.69 s
[vector] safeIndex: OK
1132.69 s
[vector] +++ OK, passed 100 tests.
1132.69 s
[vector] head: OK
1132.69 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1132.69 s
[vector] last: OK
1132.69 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1132.69 s
[vector] unsafeIndex: OK
1132.69 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1132.69 s
[vector] unsafeHead: OK
1132.69 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1132.69 s
[vector] unsafeLast: OK
1132.69 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1132.69 s
[vector] slice: OK
1132.69 s
[vector] +++ OK, passed 100 tests.
1132.69 s
[vector] init: OK
1132.69 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1132.69 s
[vector] tail: OK
1132.69 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1132.69 s
[vector] take: OK
1132.70 s
[vector] +++ OK, passed 100 tests.
1132.70 s
[vector] drop: OK
1132.70 s
[vector] +++ OK, passed 100 tests.
1132.70 s
[vector] splitAt: OK
1132.70 s
[vector] +++ OK, passed 100 tests.
1132.70 s
[vector] empty: OK
1132.70 s
[vector] +++ OK, passed 100 tests.
1132.70 s
[vector] singleton: OK
1132.70 s
[vector] +++ OK, passed 100 tests.
1132.70 s
[vector] replicate: OK
1132.70 s
[vector] +++ OK, passed 100 tests.
1132.70 s
[vector] generate: OK
1132.70 s
[vector] +++ OK, passed 100 tests.
1132.73 s
[vector] iterateN: OK
1132.73 s
[vector] +++ OK, passed 100 tests.
1132.76 s
[vector] iterateNM: OK (0.04s)
1132.76 s
[vector] +++ OK, passed 100 tests.
1132.82 s
[vector] generateM: OK (0.06s)
1132.82 s
[vector] +++ OK, passed 100 tests.
1132.82 s
[vector] replicateM: OK (0.01s)
1132.82 s
[vector] +++ OK, passed 100 tests.
1132.82 s
[vector] create: OK
1132.82 s
[vector] +++ OK, passed 100 tests.
1132.82 s
[vector] createT: OK
1132.82 s
[vector] +++ OK, passed 100 tests.
1132.82 s
[vector] unfoldr: OK
1132.82 s
[vector] +++ OK, passed 100 tests.
1132.83 s
[vector] unfoldrN: OK
1132.83 s
[vector] +++ OK, passed 100 tests.
1132.83 s
[vector] unfoldrExactN: OK
1132.83 s
[vector] +++ OK, passed 100 tests.
1132.83 s
[vector] unfoldrM: OK
1132.83 s
[vector] +++ OK, passed 100 tests.
1132.83 s
[vector] unfoldrNM: OK
1132.84 s
[vector] +++ OK, passed 100 tests.
1132.85 s
[vector] unfoldrExactNM: OK (0.02s)
1132.85 s
[vector] +++ OK, passed 100 tests.
1132.85 s
[vector] constructN: OK
1132.85 s
[vector] +++ OK, passed 100 tests.
1132.86 s
[vector] constructrN: OK
1132.86 s
[vector] +++ OK, passed 100 tests.
1132.86 s
[vector] cons: OK
1132.86 s
[vector] +++ OK, passed 100 tests.
1132.86 s
[vector] snoc: OK
1132.86 s
[vector] +++ OK, passed 100 tests.
1132.86 s
[vector] append: OK
1132.86 s
[pandoc-lua-engine] [17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
1132.86 s
[pandoc-lua-engine] [18 of 39] Compiling Text.Pandoc.Lua.Module.Format
1132.86 s
[pandoc-lua-engine] [19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
1132.87 s
[vector] +++ OK, passed 100 tests.
1132.88 s
[vector] concat: OK (0.02s)
1132.88 s
[vector] +++ OK, passed 100 tests.
1132.88 s
[vector] force: OK
1132.88 s
[vector] +++ OK, passed 100 tests.
1132.88 s
[vector] upd: OK
1132.88 s
[vector] +++ OK, passed 100 tests.
1132.88 s
[vector] accum: OK
1132.89 s
[vector] +++ OK, passed 100 tests.
1132.89 s
[vector] reverse: OK
1132.89 s
[vector] +++ OK, passed 100 tests.
1132.89 s
[vector] backpermute: OK
1132.89 s
[vector] +++ OK, passed 100 tests.
1132.89 s
[vector] map: OK
1132.89 s
[vector] +++ OK, passed 100 tests.
1132.89 s
[vector] imap: OK
1132.89 s
[vector] +++ OK, passed 100 tests.
1132.90 s
[vector] concatMap: OK
1132.90 s
[vector] +++ OK, passed 100 tests.
1132.90 s
[vector] mapM: OK
1132.90 s
[vector] +++ OK, passed 100 tests.
1132.91 s
[vector] mapM_: OK (0.01s)
1132.91 s
[vector] +++ OK, passed 100 tests.
1132.91 s
[vector] forM: OK
1132.91 s
[vector] +++ OK, passed 100 tests.
1132.92 s
[vector] forM_: OK (0.01s)
1132.93 s
[vector] +++ OK, passed 100 tests.
1132.93 s
[vector] imapM: OK
1132.93 s
[vector] +++ OK, passed 100 tests.
1132.93 s
[vector] imapM_: OK (0.01s)
1132.93 s
[vector] +++ OK, passed 100 tests.
1132.94 s
[vector] zipWith: OK
1132.94 s
[vector] +++ OK, passed 100 tests.
1132.94 s
[vector] zipWith3: OK
1132.94 s
[vector] +++ OK, passed 100 tests.
1132.94 s
[vector] izipWith: OK
1132.94 s
[vector] +++ OK, passed 100 tests.
1132.94 s
[vector] izipWith3: OK
1132.94 s
[vector] +++ OK, passed 100 tests.
1132.94 s
[vector] izipWithM: OK
1132.95 s
[vector] +++ OK, passed 100 tests.
1132.95 s
[vector] izipWithM_: OK
1132.95 s
[vector] +++ OK, passed 100 tests.
1132.95 s
[vector] zipWithM: OK
1132.96 s
[vector] +++ OK, passed 100 tests.
1132.96 s
[vector] zipWithM_: OK
1132.96 s
[vector] +++ OK, passed 100 tests.
1132.96 s
[vector] filter: OK
1132.96 s
[vector] +++ OK, passed 100 tests.
1132.96 s
[vector] ifilter: OK
1132.98 s
[vector] +++ OK, passed 100 tests.
1133.00 s
[vector] filterM: OK (0.04s)
1133.00 s
[vector] +++ OK, passed 100 tests.
1133.00 s
[vector] uniq: OK
1133.01 s
[vector] +++ OK, passed 100 tests.
1133.01 s
[vector] mapMaybe: OK
1133.01 s
[vector] +++ OK, passed 100 tests.
1133.01 s
[vector] imapMaybe: OK
1133.01 s
[vector] +++ OK, passed 100 tests.
1133.01 s
[vector] takeWhile: OK
1133.01 s
[vector] +++ OK, passed 100 tests.
1133.01 s
[vector] dropWhile: OK
1133.01 s
[vector] +++ OK, passed 100 tests.
1133.01 s
[vector] partition: OK
1133.01 s
[vector] +++ OK, passed 100 tests.
1133.01 s
[vector] partitionWith: OK
1133.01 s
[vector] +++ OK, passed 100 tests.
1133.02 s
[vector] span: OK
1133.02 s
[vector] +++ OK, passed 100 tests.
1133.02 s
[vector] break: OK
1133.03 s
[vector] +++ OK, passed 100 tests.
1133.03 s
[vector] spanR: OK
1133.03 s
[vector] +++ OK, passed 100 tests.
1133.03 s
[vector] breakR: OK
1133.03 s
[vector] +++ OK, passed 100 tests.
1133.03 s
[vector] groupBy: OK
1133.03 s
[vector] +++ OK, passed 100 tests.
1133.03 s
[vector] elem: OK
1133.04 s
[vector] +++ OK, passed 100 tests.
1133.04 s
[vector] notElem: OK
1133.04 s
[vector] +++ OK, passed 100 tests.
1133.04 s
[vector] find: OK
1133.04 s
[vector] +++ OK, passed 100 tests.
1133.04 s
[vector] findIndex: OK
1133.04 s
[vector] +++ OK, passed 100 tests.
1133.04 s
[vector] findIndexR: OK
1133.04 s
[vector] +++ OK, passed 100 tests.
1133.04 s
[vector] findIndices: OK
1133.04 s
[vector] +++ OK, passed 100 tests.
1133.04 s
[vector] elemIndex: OK
1133.04 s
[vector] +++ OK, passed 100 tests.
1133.04 s
[vector] elemIndices: OK
1133.04 s
[vector] +++ OK, passed 100 tests.
1133.04 s
[vector] foldl: OK
1133.04 s
[vector] +++ OK, passed 100 tests.
1133.04 s
[vector] foldl1: OK
1133.04 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1133.05 s
[vector] foldl': OK
1133.05 s
[vector] +++ OK, passed 100 tests.
1133.05 s
[vector] foldl1': OK
1133.05 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1133.05 s
[vector] foldr: OK
1133.05 s
[vector] +++ OK, passed 100 tests.
1133.05 s
[vector] foldr1: OK
1133.05 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1133.05 s
[vector] foldr': OK
1133.05 s
[vector] +++ OK, passed 100 tests.
1133.05 s
[vector] foldr1': OK
1133.05 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1133.05 s
[vector] ifoldl: OK
1133.05 s
[vector] +++ OK, passed 100 tests.
1133.05 s
[vector] ifoldl': OK
1133.05 s
[vector] +++ OK, passed 100 tests.
1133.05 s
[vector] ifoldr: OK
1133.05 s
[vector] +++ OK, passed 100 tests.
1133.05 s
[vector] ifoldr': OK
1133.05 s
[vector] +++ OK, passed 100 tests.
1133.05 s
[vector] ifoldM: OK
1133.05 s
[vector] +++ OK, passed 100 tests.
1133.06 s
[vector] ifoldM': OK
1133.06 s
[vector] +++ OK, passed 100 tests.
1133.08 s
[vector] ifoldM_: OK (0.01s)
1133.08 s
[vector] +++ OK, passed 100 tests.
1133.08 s
[vector] ifoldM'_: OK (0.01s)
1133.08 s
[vector] +++ OK, passed 100 tests.
1133.08 s
[vector] all: OK
1133.08 s
[vector] +++ OK, passed 100 tests.
1133.08 s
[vector] any: OK
1133.08 s
[vector] +++ OK, passed 100 tests.
1133.08 s
[vector] prescanl: OK
1133.08 s
[vector] +++ OK, passed 100 tests.
1133.08 s
[vector] prescanl': OK
1133.09 s
[vector] +++ OK, passed 100 tests.
1133.09 s
[vector] postscanl: OK
1133.09 s
[vector] +++ OK, passed 100 tests.
1133.09 s
[vector] postscanl': OK
1133.10 s
[vector] +++ OK, passed 100 tests.
1133.11 s
[vector] scanl: OK
1133.11 s
[vector] +++ OK, passed 100 tests.
1133.11 s
[vector] scanl': OK
1133.11 s
[vector] +++ OK, passed 100 tests.
1133.11 s
[vector] scanl1: OK
1133.12 s
[vector] +++ OK, passed 100 tests.
1133.12 s
[vector] scanl1': OK
1133.12 s
[vector] +++ OK, passed 100 tests.
1133.13 s
[vector] iscanl: OK
1133.13 s
[vector] +++ OK, passed 100 tests.
1133.13 s
[vector] iscanl': OK
1133.13 s
[vector] +++ OK, passed 100 tests.
1133.14 s
[vector] prescanr: OK
1133.14 s
[vector] +++ OK, passed 100 tests.
1133.14 s
[vector] prescanr': OK
1133.14 s
[vector] +++ OK, passed 100 tests.
1133.14 s
[vector] postscanr: OK
1133.15 s
[vector] +++ OK, passed 100 tests.
1133.15 s
[vector] postscanr': OK
1133.15 s
[vector] +++ OK, passed 100 tests.
1133.15 s
[vector] scanr: OK
1133.15 s
[vector] +++ OK, passed 100 tests.
1133.15 s
[vector] scanr': OK
1133.15 s
[vector] +++ OK, passed 100 tests.
1133.15 s
[vector] scanr1: OK
1133.16 s
[vector] +++ OK, passed 100 tests.
1133.16 s
[vector] scanr1': OK
1133.16 s
[vector] +++ OK, passed 100 tests.
1133.16 s
[vector] iscanr: OK
1133.16 s
[vector] +++ OK, passed 100 tests.
1133.16 s
[vector] iscanr': OK
1133.16 s
[vector] +++ OK, passed 100 tests.
1133.16 s
[vector] mut_read: OK
1133.16 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1133.16 s
[vector] mut_write: OK
1133.16 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1133.16 s
[vector] mut_modify: OK
1133.16 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1133.17 s
[vector] mut_generate: OK
1133.17 s
[vector] +++ OK, passed 100 tests.
1133.18 s
[vector] mut_generateM: OK
1133.18 s
[vector] +++ OK, passed 100 tests.
1133.18 s
[vector] mut_mapM_: OK
1133.18 s
[vector] +++ OK, passed 100 tests.
1133.20 s
[vector] mut_imapM_: OK
1133.20 s
[vector] +++ OK, passed 100 tests.
1133.21 s
[vector] mut_forM_: OK (0.01s)
1133.21 s
[vector] +++ OK, passed 100 tests.
1133.22 s
[vector] mut_iforM_: OK
1133.22 s
[vector] +++ OK, passed 100 tests.
1133.22 s
[vector] mut_foldr: OK
1133.22 s
[vector] +++ OK, passed 100 tests.
1133.23 s
[vector] mut_foldr': OK
1133.23 s
[vector] +++ OK, passed 100 tests.
1133.23 s
[vector] mut_foldl: OK
1133.23 s
[vector] +++ OK, passed 100 tests.
1133.23 s
[vector] mut_foldl': OK
1133.23 s
[vector] +++ OK, passed 100 tests.
1133.23 s
[vector] mut_ifoldr: OK
1133.23 s
[vector] +++ OK, passed 100 tests.
1133.24 s
[vector] mut_ifoldr': OK
1133.24 s
[vector] +++ OK, passed 100 tests.
1133.24 s
[vector] mut_ifoldl: OK
1133.24 s
[vector] +++ OK, passed 100 tests.
1133.24 s
[vector] mut_ifoldl': OK
1133.24 s
[vector] +++ OK, passed 100 tests.
1133.24 s
[vector] mut_foldM: OK
1133.24 s
[vector] +++ OK, passed 100 tests.
1133.24 s
[vector] mut_foldM': OK
1133.24 s
[vector] +++ OK, passed 100 tests.
1133.24 s
[vector] mut_foldrM: OK
1133.25 s
[vector] +++ OK, passed 100 tests.
1133.25 s
[vector] mut_foldrM': OK
1133.25 s
[vector] +++ OK, passed 100 tests.
1133.25 s
[vector] mut_ifoldM: OK
1133.25 s
[vector] +++ OK, passed 100 tests.
1133.25 s
[vector] mut_ifoldM': OK
1133.25 s
[vector] +++ OK, passed 100 tests.
1133.25 s
[vector] mut_ifoldrM: OK
1133.25 s
[vector] +++ OK, passed 100 tests.
1133.26 s
[vector] mut_ifoldrM': OK
1133.26 s
[vector] +++ OK, passed 100 tests.
1133.26 s
[vector] compare: OK
1133.26 s
[vector] +++ OK, passed 100 tests.
1133.26 s
[vector] maximum: OK
1133.26 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1133.26 s
[vector] minimum: OK
1133.26 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1133.26 s
[vector] minIndex: OK
1133.26 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1133.26 s
[vector] maxIndex: OK
1133.26 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1133.26 s
[vector] maximumBy: OK
1133.26 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1133.26 s
[vector] minimumBy: OK
1133.26 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1133.26 s
[vector] maximumOn: OK
1133.26 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1133.26 s
[vector] minimumOn: OK
1133.26 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1133.26 s
[vector] maxIndexBy: OK
1133.26 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1133.26 s
[vector] minIndexBy: OK
1133.27 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1133.27 s
[vector] ListFirstMaxIndexWins: OK
1133.27 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1133.27 s
[vector] FalseListFirstMaxIndexWins: OK
1133.27 s
[vector] +++ OK, failed as expected. (after 1 test):
1133.27 s
[vector] Exception:
1133.27 s
[vector] Prelude.foldr1: empty list
1133.27 s
[vector] CallStack (from HasCallStack):
1133.27 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1133.27 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1133.27 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1133.27 s
[vector] []
1133.27 s
[vector] zip: OK
1133.27 s
[vector] +++ OK, passed 100 tests.
1133.27 s
[vector] zip3: OK
1133.27 s
[vector] +++ OK, passed 100 tests.
1133.27 s
[vector] unzip: OK
1133.27 s
[vector] +++ OK, passed 100 tests.
1133.27 s
[vector] unzip3: OK
1133.27 s
[vector] +++ OK, passed 100 tests.
1133.28 s
[vector] indexed: OK
1133.28 s
[vector] +++ OK, passed 100 tests.
1133.28 s
[vector] update: OK
1133.28 s
[vector] +++ OK, passed 100 tests.
1133.28 s
[vector] mempty: OK
1133.28 s
[vector] +++ OK, passed 100 tests.
1133.29 s
[vector] mappend: OK
1133.29 s
[vector] +++ OK, passed 100 tests.
1133.30 s
[vector] mconcat: OK (0.01s)
1133.30 s
[vector] +++ OK, passed 100 tests.
1133.30 s
[vector] glength: OK
1133.30 s
[vector] +++ OK, passed 100 tests.
1133.30 s
[vector] (Bool)
1133.30 s
[vector] fromList.toList == id: OK
1133.30 s
[vector] +++ OK, passed 100 tests.
1133.30 s
[vector] toList.fromList == id: OK
1133.30 s
[vector] +++ OK, passed 100 tests.
1133.30 s
[vector] unstream.stream == id: OK
1133.30 s
[vector] +++ OK, passed 100 tests.
1133.30 s
[vector] stream.unstream == id: OK
1133.30 s
[vector] +++ OK, passed 100 tests.
1133.30 s
[vector] eq: OK
1133.30 s
[vector] +++ OK, passed 100 tests.
1133.30 s
[vector] length: OK
1133.30 s
[vector] +++ OK, passed 100 tests.
1133.30 s
[vector] null: OK
1133.30 s
[vector] +++ OK, passed 100 tests.
1133.30 s
[vector] index: OK
1133.30 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1133.30 s
[vector] safeIndex: OK
1133.30 s
[vector] +++ OK, passed 100 tests.
1133.30 s
[vector] head: OK
1133.30 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1133.30 s
[vector] last: OK
1133.30 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1133.30 s
[vector] unsafeIndex: OK
1133.30 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1133.30 s
[vector] unsafeHead: OK
1133.30 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1133.30 s
[vector] unsafeLast: OK
1133.30 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1133.30 s
[vector] slice: OK
1133.31 s
[vector] +++ OK, passed 100 tests.
1133.31 s
[vector] init: OK
1133.31 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1133.31 s
[vector] tail: OK
1133.31 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1133.31 s
[vector] take: OK
1133.31 s
[vector] +++ OK, passed 100 tests.
1133.31 s
[vector] drop: OK
1133.31 s
[vector] +++ OK, passed 100 tests.
1133.31 s
[vector] splitAt: OK
1133.31 s
[vector] +++ OK, passed 100 tests.
1133.31 s
[vector] empty: OK
1133.31 s
[vector] +++ OK, passed 100 tests.
1133.31 s
[vector] singleton: OK
1133.31 s
[vector] +++ OK, passed 100 tests.
1133.31 s
[vector] replicate: OK
1133.31 s
[vector] +++ OK, passed 100 tests.
1133.31 s
[vector] generate: OK
1133.31 s
[vector] +++ OK, passed 100 tests.
1133.31 s
[vector] iterateN: OK
1133.32 s
[vector] +++ OK, passed 100 tests.
1133.38 s
[vector] iterateNM: OK (0.06s)
1133.38 s
[vector] +++ OK, passed 100 tests.
1133.42 s
[vector] generateM: OK (0.03s)
1133.42 s
[vector] +++ OK, passed 100 tests.
1133.42 s
[vector] replicateM: OK
1133.42 s
[vector] +++ OK, passed 100 tests.
1133.42 s
[vector] create: OK
1133.42 s
[vector] +++ OK, passed 100 tests.
1133.42 s
[vector] createT: OK
1133.42 s
[vector] +++ OK, passed 100 tests.
1133.42 s
[vector] unfoldr: OK
1133.42 s
[vector] +++ OK, passed 100 tests.
1133.42 s
[vector] unfoldrN: OK
1133.42 s
[vector] +++ OK, passed 100 tests.
1133.42 s
[vector] unfoldrExactN: OK
1133.43 s
[vector] +++ OK, passed 100 tests.
1133.43 s
[vector] unfoldrM: OK
1133.44 s
[vector] +++ OK, passed 100 tests.
1133.44 s
[vector] unfoldrNM: OK
1133.44 s
[vector] +++ OK, passed 100 tests.
1133.46 s
[vector] unfoldrExactNM: OK (0.02s)
1133.46 s
[vector] +++ OK, passed 100 tests.
1133.49 s
[vector] constructN: OK
1133.49 s
[vector] +++ OK, passed 100 tests.
1133.49 s
[vector] constructrN: OK
1133.49 s
[vector] +++ OK, passed 100 tests.
1133.49 s
[vector] cons: OK
1133.49 s
[vector] +++ OK, passed 100 tests.
1133.49 s
[vector] snoc: OK
1133.50 s
[vector] +++ OK, passed 100 tests.
1133.51 s
[vector] append: OK
1133.51 s
[vector] +++ OK, passed 100 tests.
1133.51 s
[vector] concat: OK (0.01s)
1133.51 s
[vector] +++ OK, passed 100 tests.
1133.51 s
[vector] force: OK
1133.51 s
[vector] +++ OK, passed 100 tests.
1133.51 s
[vector] upd: OK
1133.52 s
[vector] +++ OK, passed 100 tests.
1133.52 s
[vector] accum: OK
1133.52 s
[vector] +++ OK, passed 100 tests.
1133.52 s
[vector] reverse: OK
1133.52 s
[vector] +++ OK, passed 100 tests.
1133.52 s
[vector] backpermute: OK
1133.52 s
[vector] +++ OK, passed 100 tests.
1133.52 s
[vector] map: OK
1133.53 s
[vector] +++ OK, passed 100 tests.
1133.53 s
[vector] imap: OK
1133.53 s
[vector] +++ OK, passed 100 tests.
1133.53 s
[vector] concatMap: OK
1133.53 s
[vector] +++ OK, passed 100 tests.
1133.53 s
[vector] mapM: OK
1133.55 s
[vector] +++ OK, passed 100 tests.
1133.56 s
[vector] mapM_: OK (0.02s)
1133.56 s
[vector] +++ OK, passed 100 tests.
1133.56 s
[vector] forM: OK
1133.56 s
[vector] +++ OK, passed 100 tests.
1133.57 s
[vector] forM_: OK (0.01s)
1133.57 s
[vector] +++ OK, passed 100 tests.
1133.57 s
[vector] imapM: OK
1133.57 s
[vector] +++ OK, passed 100 tests.
1133.60 s
[vector] imapM_: OK (0.02s)
1133.60 s
[vector] +++ OK, passed 100 tests.
1133.60 s
[vector] zipWith: OK
1133.60 s
[vector] +++ OK, passed 100 tests.
1133.60 s
[vector] zipWith3: OK
1133.61 s
[vector] +++ OK, passed 100 tests.
1133.61 s
[vector] izipWith: OK
1133.61 s
[vector] +++ OK, passed 100 tests.
1133.61 s
[vector] izipWith3: OK
1133.61 s
[vector] +++ OK, passed 100 tests.
1133.62 s
[vector] izipWithM: OK
1133.62 s
[vector] +++ OK, passed 100 tests.
1133.63 s
[vector] izipWithM_: OK (0.01s)
1133.63 s
[vector] +++ OK, passed 100 tests.
1133.63 s
[vector] zipWithM: OK
1133.64 s
[vector] +++ OK, passed 100 tests.
1133.64 s
[vector] zipWithM_: OK
1133.64 s
[vector] +++ OK, passed 100 tests.
1133.64 s
[vector] filter: OK
1133.64 s
[vector] +++ OK, passed 100 tests.
1133.66 s
[vector] ifilter: OK
1133.66 s
[pandoc-lua-engine] [20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
1133.66 s
[vector] +++ OK, passed 100 tests.
1133.66 s
[vector] filterM: OK (0.01s)
1133.66 s
[vector] +++ OK, passed 100 tests.
1133.66 s
[vector] uniq: OK
1133.66 s
[vector] +++ OK, passed 100 tests.
1133.67 s
[vector] mapMaybe: OK
1133.68 s
[vector] +++ OK, passed 100 tests.
1133.68 s
[vector] imapMaybe: OK
1133.68 s
[vector] +++ OK, passed 100 tests.
1133.68 s
[vector] takeWhile: OK
1133.68 s
[vector] +++ OK, passed 100 tests.
1133.68 s
[vector] dropWhile: OK
1133.68 s
[vector] +++ OK, passed 100 tests.
1133.68 s
[vector] partition: OK
1133.69 s
[vector] +++ OK, passed 100 tests.
1133.69 s
[vector] partitionWith: OK
1133.69 s
[vector] +++ OK, passed 100 tests.
1133.69 s
[vector] span: OK
1133.69 s
[vector] +++ OK, passed 100 tests.
1133.69 s
[vector] break: OK
1133.69 s
[vector] +++ OK, passed 100 tests.
1133.70 s
[vector] spanR: OK
1133.70 s
[vector] +++ OK, passed 100 tests.
1133.70 s
[vector] breakR: OK
1133.70 s
[vector] +++ OK, passed 100 tests.
1133.70 s
[vector] groupBy: OK
1133.70 s
[vector] +++ OK, passed 100 tests.
1133.70 s
[vector] elem: OK
1133.70 s
[vector] +++ OK, passed 100 tests.
1133.70 s
[vector] notElem: OK
1133.70 s
[vector] +++ OK, passed 100 tests.
1133.71 s
[vector] find: OK
1133.71 s
[vector] +++ OK, passed 100 tests.
1133.71 s
[vector] findIndex: OK
1133.71 s
[vector] +++ OK, passed 100 tests.
1133.71 s
[vector] findIndexR: OK
1133.71 s
[vector] +++ OK, passed 100 tests.
1133.71 s
[vector] findIndices: OK
1133.71 s
[vector] +++ OK, passed 100 tests.
1133.71 s
[vector] elemIndex: OK
1133.71 s
[vector] +++ OK, passed 100 tests.
1133.71 s
[vector] elemIndices: OK
1133.71 s
[vector] +++ OK, passed 100 tests.
1133.71 s
[vector] foldl: OK
1133.72 s
[vector] +++ OK, passed 100 tests.
1133.72 s
[vector] foldl1: OK
1133.72 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1133.72 s
[vector] foldl': OK
1133.72 s
[vector] +++ OK, passed 100 tests.
1133.72 s
[vector] foldl1': OK
1133.72 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1133.72 s
[vector] foldr: OK
1133.72 s
[vector] +++ OK, passed 100 tests.
1133.72 s
[vector] foldr1: OK
1133.72 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1133.72 s
[vector] foldr': OK
1133.73 s
[vector] +++ OK, passed 100 tests.
1133.73 s
[vector] foldr1': OK
1133.73 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1133.73 s
[vector] ifoldl: OK
1133.73 s
[vector] +++ OK, passed 100 tests.
1133.73 s
[vector] ifoldl': OK
1133.73 s
[vector] +++ OK, passed 100 tests.
1133.73 s
[vector] ifoldr: OK
1133.73 s
[vector] +++ OK, passed 100 tests.
1133.73 s
[vector] ifoldr': OK
1133.73 s
[vector] +++ OK, passed 100 tests.
1133.73 s
[vector] ifoldM: OK
1133.73 s
[vector] +++ OK, passed 100 tests.
1133.74 s
[vector] ifoldM': OK
1133.74 s
[vector] +++ OK, passed 100 tests.
1133.74 s
[vector] ifoldM_: OK
1133.75 s
[vector] +++ OK, passed 100 tests.
1133.75 s
[vector] ifoldM'_: OK
1133.75 s
[vector] +++ OK, passed 100 tests.
1133.76 s
[vector] all: OK
1133.76 s
[vector] +++ OK, passed 100 tests.
1133.76 s
[vector] any: OK
1133.76 s
[vector] +++ OK, passed 100 tests.
1133.76 s
[vector] prescanl: OK
1133.76 s
[vector] +++ OK, passed 100 tests.
1133.76 s
[vector] prescanl': OK
1133.76 s
[vector] +++ OK, passed 100 tests.
1133.76 s
[vector] postscanl: OK
1133.76 s
[vector] +++ OK, passed 100 tests.
1133.76 s
[vector] postscanl': OK
1133.76 s
[vector] +++ OK, passed 100 tests.
1133.76 s
[vector] scanl: OK
1133.76 s
[vector] +++ OK, passed 100 tests.
1133.76 s
[vector] scanl': OK
1133.76 s
[vector] +++ OK, passed 100 tests.
1133.76 s
[vector] scanl1: OK
1133.77 s
[vector] +++ OK, passed 100 tests.
1133.77 s
[vector] scanl1': OK
1133.77 s
[vector] +++ OK, passed 100 tests.
1133.77 s
[vector] iscanl: OK
1133.77 s
[vector] +++ OK, passed 100 tests.
1133.77 s
[vector] iscanl': OK
1133.77 s
[vector] +++ OK, passed 100 tests.
1133.77 s
[vector] prescanr: OK
1133.77 s
[vector] +++ OK, passed 100 tests.
1133.77 s
[vector] prescanr': OK
1133.77 s
[vector] +++ OK, passed 100 tests.
1133.77 s
[vector] postscanr: OK
1133.77 s
[vector] +++ OK, passed 100 tests.
1133.78 s
[vector] postscanr': OK
1133.78 s
[vector] +++ OK, passed 100 tests.
1133.78 s
[vector] scanr: OK
1133.78 s
[vector] +++ OK, passed 100 tests.
1133.78 s
[vector] scanr': OK
1133.79 s
[vector] +++ OK, passed 100 tests.
1133.79 s
[vector] scanr1: OK
1133.79 s
[vector] +++ OK, passed 100 tests.
1133.79 s
[vector] scanr1': OK
1133.79 s
[vector] +++ OK, passed 100 tests.
1133.79 s
[vector] iscanr: OK
1133.79 s
[vector] +++ OK, passed 100 tests.
1133.79 s
[vector] iscanr': OK
1133.79 s
[vector] +++ OK, passed 100 tests.
1133.79 s
[vector] mut_read: OK
1133.79 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1133.79 s
[vector] mut_write: OK
1133.79 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1133.79 s
[vector] mut_modify: OK
1133.79 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1133.79 s
[vector] mut_generate: OK
1133.80 s
[vector] +++ OK, passed 100 tests.
1133.80 s
[vector] mut_generateM: OK
1133.80 s
[vector] +++ OK, passed 100 tests.
1133.84 s
[vector] mut_mapM_: OK (0.04s)
1133.84 s
[vector] +++ OK, passed 100 tests.
1133.86 s
[vector] mut_imapM_: OK (0.03s)
1133.86 s
[vector] +++ OK, passed 100 tests.
1133.87 s
[vector] mut_forM_: OK
1133.88 s
[vector] +++ OK, passed 100 tests.
1133.89 s
[vector] mut_iforM_: OK (0.01s)
1133.89 s
[vector] +++ OK, passed 100 tests.
1133.89 s
[vector] mut_foldr: OK
1133.89 s
[vector] +++ OK, passed 100 tests.
1133.89 s
[vector] mut_foldr': OK
1133.89 s
[vector] +++ OK, passed 100 tests.
1133.89 s
[vector] mut_foldl: OK
1133.89 s
[vector] +++ OK, passed 100 tests.
1133.90 s
[vector] mut_foldl': OK
1133.90 s
[vector] +++ OK, passed 100 tests.
1133.90 s
[vector] mut_ifoldr: OK
1133.90 s
[vector] +++ OK, passed 100 tests.
1133.90 s
[vector] mut_ifoldr': OK
1133.91 s
[vector] +++ OK, passed 100 tests.
1133.91 s
[vector] mut_ifoldl: OK
1133.91 s
[vector] +++ OK, passed 100 tests.
1133.92 s
[vector] mut_ifoldl': OK
1133.92 s
[vector] +++ OK, passed 100 tests.
1133.92 s
[vector] mut_foldM: OK
1133.93 s
[vector] +++ OK, passed 100 tests.
1133.93 s
[vector] mut_foldM': OK
1133.93 s
[vector] +++ OK, passed 100 tests.
1133.94 s
[vector] mut_foldrM: OK
1133.94 s
[vector] +++ OK, passed 100 tests.
1133.94 s
[vector] mut_foldrM': OK
1133.94 s
[vector] +++ OK, passed 100 tests.
1133.94 s
[vector] mut_ifoldM: OK
1133.94 s
[vector] +++ OK, passed 100 tests.
1133.95 s
[vector] mut_ifoldM': OK
1133.95 s
[vector] +++ OK, passed 100 tests.
1133.95 s
[vector] mut_ifoldrM: OK
1133.95 s
[vector] +++ OK, passed 100 tests.
1133.95 s
[vector] mut_ifoldrM': OK
1133.96 s
[vector] +++ OK, passed 100 tests.
1133.96 s
[vector] compare: OK
1133.96 s
[vector] +++ OK, passed 100 tests.
1133.96 s
[vector] maximum: OK
1133.96 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1133.96 s
[vector] minimum: OK
1133.96 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1133.96 s
[vector] minIndex: OK
1133.96 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1133.96 s
[vector] maxIndex: OK
1133.96 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1133.96 s
[vector] maximumBy: OK
1133.96 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1133.96 s
[vector] minimumBy: OK
1133.96 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1133.96 s
[vector] maximumOn: OK
1133.96 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1133.96 s
[vector] minimumOn: OK
1133.96 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1133.96 s
[vector] maxIndexBy: OK
1133.96 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1133.96 s
[vector] minIndexBy: OK
1133.97 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1133.97 s
[vector] ListFirstMaxIndexWins: OK
1133.97 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1133.97 s
[vector] FalseListFirstMaxIndexWins: OK
1133.97 s
[vector] +++ OK, failed as expected. (after 1 test):
1133.97 s
[vector] Exception:
1133.97 s
[vector] Prelude.foldr1: empty list
1133.97 s
[vector] CallStack (from HasCallStack):
1133.97 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1133.97 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1133.97 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1133.97 s
[vector] []
1133.97 s
[vector] zip: OK
1133.97 s
[vector] +++ OK, passed 100 tests.
1133.97 s
[vector] zip3: OK
1133.97 s
[vector] +++ OK, passed 100 tests.
1133.97 s
[vector] unzip: OK
1133.97 s
[vector] +++ OK, passed 100 tests.
1133.97 s
[vector] unzip3: OK
1133.97 s
[vector] +++ OK, passed 100 tests.
1133.97 s
[vector] indexed: OK
1133.97 s
[vector] +++ OK, passed 100 tests.
1133.97 s
[vector] update: OK
1133.98 s
[vector] +++ OK, passed 100 tests.
1133.98 s
[vector] mempty: OK
1133.98 s
[vector] +++ OK, passed 100 tests.
1133.98 s
[vector] mappend: OK
1133.98 s
[vector] +++ OK, passed 100 tests.
1134.00 s
[vector] mconcat: OK (0.02s)
1134.00 s
[vector] +++ OK, passed 100 tests.
1134.00 s
[vector] glength: OK
1134.00 s
[vector] +++ OK, passed 100 tests.
1134.00 s
[vector] and: OK
1134.00 s
[vector] +++ OK, passed 100 tests.
1134.00 s
[vector] or: OK
1134.00 s
[vector] +++ OK, passed 100 tests.
1134.00 s
[vector] (Int)
1134.00 s
[vector] fromList.toList == id: OK
1134.00 s
[vector] +++ OK, passed 100 tests.
1134.01 s
[vector] toList.fromList == id: OK
1134.01 s
[vector] +++ OK, passed 100 tests.
1134.01 s
[vector] unstream.stream == id: OK
1134.01 s
[vector] +++ OK, passed 100 tests.
1134.01 s
[vector] stream.unstream == id: OK
1134.01 s
[vector] +++ OK, passed 100 tests.
1134.01 s
[vector] eq: OK
1134.01 s
[vector] +++ OK, passed 100 tests.
1134.01 s
[vector] length: OK
1134.01 s
[vector] +++ OK, passed 100 tests.
1134.01 s
[vector] null: OK
1134.01 s
[vector] +++ OK, passed 100 tests.
1134.01 s
[vector] index: OK
1134.01 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1134.01 s
[vector] safeIndex: OK
1134.01 s
[vector] +++ OK, passed 100 tests.
1134.01 s
[vector] head: OK
1134.01 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1134.01 s
[vector] last: OK
1134.01 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1134.01 s
[vector] unsafeIndex: OK
1134.01 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1134.01 s
[vector] unsafeHead: OK
1134.01 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1134.01 s
[vector] unsafeLast: OK
1134.01 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1134.01 s
[vector] slice: OK
1134.02 s
[vector] +++ OK, passed 100 tests.
1134.02 s
[vector] init: OK
1134.02 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1134.02 s
[vector] tail: OK
1134.02 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1134.02 s
[vector] take: OK
1134.02 s
[vector] +++ OK, passed 100 tests.
1134.02 s
[vector] drop: OK
1134.02 s
[vector] +++ OK, passed 100 tests.
1134.02 s
[vector] splitAt: OK
1134.02 s
[vector] +++ OK, passed 100 tests.
1134.03 s
[vector] empty: OK
1134.03 s
[vector] +++ OK, passed 100 tests.
1134.03 s
[vector] singleton: OK
1134.03 s
[vector] +++ OK, passed 100 tests.
1134.03 s
[vector] replicate: OK
1134.03 s
[vector] +++ OK, passed 100 tests.
1134.03 s
[vector] generate: OK
1134.03 s
[vector] +++ OK, passed 100 tests.
1134.04 s
[vector] iterateN: OK
1134.04 s
[vector] +++ OK, passed 100 tests.
1134.06 s
[vector] iterateNM: OK (0.02s)
1134.06 s
[vector] +++ OK, passed 100 tests.
1134.08 s
[vector] generateM: OK (0.01s)
1134.08 s
[vector] +++ OK, passed 100 tests.
1134.08 s
[vector] replicateM: OK (0.01s)
1134.08 s
[vector] +++ OK, passed 100 tests.
1134.08 s
[vector] create: OK
1134.08 s
[vector] +++ OK, passed 100 tests.
1134.08 s
[vector] createT: OK
1134.08 s
[vector] +++ OK, passed 100 tests.
1134.08 s
[vector] unfoldr: OK
1134.08 s
[vector] +++ OK, passed 100 tests.
1134.08 s
[vector] unfoldrN: OK
1134.08 s
[vector] +++ OK, passed 100 tests.
1134.09 s
[vector] unfoldrExactN: OK
1134.09 s
[vector] +++ OK, passed 100 tests.
1134.09 s
[vector] unfoldrM: OK
1134.09 s
[vector] +++ OK, passed 100 tests.
1134.11 s
[vector] unfoldrNM: OK
1134.12 s
[vector] +++ OK, passed 100 tests.
1134.15 s
[vector] unfoldrExactNM: OK (0.05s)
1134.15 s
[vector] +++ OK, passed 100 tests.
1134.15 s
[vector] constructN: OK
1134.15 s
[vector] +++ OK, passed 100 tests.
1134.15 s
[vector] constructrN: OK
1134.15 s
[vector] +++ OK, passed 100 tests.
1134.15 s
[vector] cons: OK
1134.15 s
[vector] +++ OK, passed 100 tests.
1134.16 s
[vector] snoc: OK
1134.16 s
[vector] +++ OK, passed 100 tests.
1134.16 s
[vector] append: OK
1134.16 s
[vector] +++ OK, passed 100 tests.
1134.18 s
[vector] concat: OK (0.02s)
1134.18 s
[vector] +++ OK, passed 100 tests.
1134.18 s
[vector] force: OK
1134.18 s
[vector] +++ OK, passed 100 tests.
1134.19 s
[vector] upd: OK
1134.19 s
[vector] +++ OK, passed 100 tests.
1134.19 s
[vector] accum: OK
1134.19 s
[vector] +++ OK, passed 100 tests.
1134.19 s
[vector] reverse: OK
1134.19 s
[vector] +++ OK, passed 100 tests.
1134.19 s
[vector] backpermute: OK
1134.19 s
[vector] +++ OK, passed 100 tests.
1134.20 s
[vector] map: OK
1134.20 s
[vector] +++ OK, passed 100 tests.
1134.20 s
[vector] imap: OK
1134.20 s
[vector] +++ OK, passed 100 tests.
1134.20 s
[vector] concatMap: OK
1134.20 s
[vector] +++ OK, passed 100 tests.
1134.21 s
[vector] mapM: OK
1134.22 s
[vector] +++ OK, passed 100 tests.
1134.22 s
[vector] mapM_: OK (0.01s)
1134.22 s
[vector] +++ OK, passed 100 tests.
1134.22 s
[vector] forM: OK
1134.22 s
[vector] +++ OK, passed 100 tests.
1134.24 s
[vector] forM_: OK (0.02s)
1134.24 s
[vector] +++ OK, passed 100 tests.
1134.24 s
[vector] imapM: OK
1134.24 s
[vector] +++ OK, passed 100 tests.
1134.26 s
[vector] imapM_: OK (0.02s)
1134.26 s
[vector] +++ OK, passed 100 tests.
1134.26 s
[vector] zipWith: OK
1134.27 s
[vector] +++ OK, passed 100 tests.
1134.28 s
[vector] zipWith3: OK
1134.28 s
[vector] +++ OK, passed 100 tests.
1134.28 s
[vector] izipWith: OK
1134.28 s
[vector] +++ OK, passed 100 tests.
1134.29 s
[vector] izipWith3: OK
1134.29 s
[vector] +++ OK, passed 100 tests.
1134.30 s
[vector] izipWithM: OK
1134.30 s
[vector] +++ OK, passed 100 tests.
1134.30 s
[vector] izipWithM_: OK (0.01s)
1134.32 s
[vector] +++ OK, passed 100 tests.
1134.32 s
[vector] zipWithM: OK
1134.32 s
[vector] +++ OK, passed 100 tests.
1134.32 s
[vector] zipWithM_: OK (0.02s)
1134.32 s
[vector] +++ OK, passed 100 tests.
1134.33 s
[vector] filter: OK
1134.34 s
[vector] +++ OK, passed 100 tests.
1134.34 s
[vector] ifilter: OK
1134.34 s
[vector] +++ OK, passed 100 tests.
1134.37 s
[vector] filterM: OK (0.04s)
1134.37 s
[vector] +++ OK, passed 100 tests.
1134.38 s
[vector] uniq: OK
1134.38 s
[vector] +++ OK, passed 100 tests.
1134.38 s
[vector] mapMaybe: OK
1134.38 s
[vector] +++ OK, passed 100 tests.
1134.38 s
[vector] imapMaybe: OK
1134.39 s
[vector] +++ OK, passed 100 tests.
1134.39 s
[vector] takeWhile: OK
1134.39 s
[vector] +++ OK, passed 100 tests.
1134.40 s
[vector] dropWhile: OK
1134.40 s
[vector] +++ OK, passed 100 tests.
1134.40 s
[vector] partition: OK
1134.40 s
[vector] +++ OK, passed 100 tests.
1134.40 s
[vector] partitionWith: OK
1134.40 s
[vector] +++ OK, passed 100 tests.
1134.40 s
[vector] span: OK
1134.40 s
[vector] +++ OK, passed 100 tests.
1134.40 s
[vector] break: OK
1134.40 s
[vector] +++ OK, passed 100 tests.
1134.40 s
[vector] spanR: OK
1134.41 s
[vector] +++ OK, passed 100 tests.
1134.41 s
[vector] breakR: OK
1134.41 s
[vector] +++ OK, passed 100 tests.
1134.41 s
[vector] groupBy: OK
1134.42 s
[vector] +++ OK, passed 100 tests.
1134.42 s
[vector] elem: OK
1134.42 s
[vector] +++ OK, passed 100 tests.
1134.42 s
[vector] notElem: OK
1134.42 s
[vector] +++ OK, passed 100 tests.
1134.42 s
[vector] find: OK
1134.42 s
[vector] +++ OK, passed 100 tests.
1134.42 s
[vector] findIndex: OK
1134.42 s
[vector] +++ OK, passed 100 tests.
1134.42 s
[vector] findIndexR: OK
1134.42 s
[vector] +++ OK, passed 100 tests.
1134.42 s
[vector] findIndices: OK
1134.42 s
[vector] +++ OK, passed 100 tests.
1134.43 s
[vector] elemIndex: OK
1134.43 s
[vector] +++ OK, passed 100 tests.
1134.43 s
[vector] elemIndices: OK
1134.43 s
[vector] +++ OK, passed 100 tests.
1134.43 s
[vector] foldl: OK
1134.43 s
[vector] +++ OK, passed 100 tests.
1134.44 s
[vector] foldl1: OK
1134.44 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1134.44 s
[vector] foldl': OK
1134.45 s
[vector] +++ OK, passed 100 tests.
1134.45 s
[vector] foldl1': OK
1134.45 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1134.45 s
[vector] foldr: OK
1134.46 s
[vector] +++ OK, passed 100 tests.
1134.46 s
[vector] foldr1: OK
1134.46 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1134.46 s
[vector] foldr': OK
1134.46 s
[vector] +++ OK, passed 100 tests.
1134.46 s
[vector] foldr1': OK
1134.46 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1134.46 s
[vector] ifoldl: OK
1134.46 s
[vector] +++ OK, passed 100 tests.
1134.47 s
[vector] ifoldl': OK
1134.47 s
[vector] +++ OK, passed 100 tests.
1134.48 s
[vector] ifoldr: OK
1134.48 s
[vector] +++ OK, passed 100 tests.
1134.48 s
[vector] ifoldr': OK
1134.48 s
[vector] +++ OK, passed 100 tests.
1134.48 s
[vector] ifoldM: OK
1134.48 s
[vector] +++ OK, passed 100 tests.
1134.48 s
[vector] ifoldM': OK
1134.48 s
[vector] +++ OK, passed 100 tests.
1134.50 s
[vector] ifoldM_: OK (0.02s)
1134.50 s
[vector] +++ OK, passed 100 tests.
1134.51 s
[vector] ifoldM'_: OK (0.02s)
1134.51 s
[vector] +++ OK, passed 100 tests.
1134.51 s
[vector] all: OK
1134.51 s
[vector] +++ OK, passed 100 tests.
1134.51 s
[vector] any: OK
1134.51 s
[vector] +++ OK, passed 100 tests.
1134.51 s
[vector] prescanl: OK
1134.51 s
[vector] +++ OK, passed 100 tests.
1134.51 s
[vector] prescanl': OK
1134.51 s
[vector] +++ OK, passed 100 tests.
1134.52 s
[vector] postscanl: OK
1134.52 s
[vector] +++ OK, passed 100 tests.
1134.52 s
[vector] postscanl': OK
1134.52 s
[vector] +++ OK, passed 100 tests.
1134.52 s
[vector] scanl: OK
1134.52 s
[vector] +++ OK, passed 100 tests.
1134.53 s
[vector] scanl': OK
1134.53 s
[vector] +++ OK, passed 100 tests.
1134.54 s
[vector] scanl1: OK
1134.54 s
[vector] +++ OK, passed 100 tests.
1134.54 s
[vector] scanl1': OK
1134.55 s
[vector] +++ OK, passed 100 tests.
1134.55 s
[vector] iscanl: OK
1134.55 s
[vector] +++ OK, passed 100 tests.
1134.55 s
[vector] iscanl': OK
1134.55 s
[vector] +++ OK, passed 100 tests.
1134.55 s
[vector] prescanr: OK
1134.55 s
[vector] +++ OK, passed 100 tests.
1134.55 s
[vector] prescanr': OK
1134.55 s
[vector] +++ OK, passed 100 tests.
1134.56 s
[vector] postscanr: OK
1134.56 s
[vector] +++ OK, passed 100 tests.
1134.56 s
[vector] postscanr': OK
1134.57 s
[vector] +++ OK, passed 100 tests.
1134.57 s
[vector] scanr: OK
1134.58 s
[vector] +++ OK, passed 100 tests.
1134.58 s
[vector] scanr': OK
1134.58 s
[vector] +++ OK, passed 100 tests.
1134.60 s
[vector] scanr1: OK
1134.60 s
[vector] +++ OK, passed 100 tests.
1134.60 s
[vector] scanr1': OK
1134.60 s
[vector] +++ OK, passed 100 tests.
1134.61 s
[vector] iscanr: OK
1134.61 s
[vector] +++ OK, passed 100 tests.
1134.61 s
[vector] iscanr': OK
1134.61 s
[vector] +++ OK, passed 100 tests.
1134.61 s
[vector] mut_read: OK
1134.61 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1134.61 s
[vector] mut_write: OK
1134.61 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1134.61 s
[vector] mut_modify: OK
1134.61 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1134.62 s
[vector] mut_generate: OK
1134.62 s
[vector] +++ OK, passed 100 tests.
1134.62 s
[vector] mut_generateM: OK
1134.62 s
[vector] +++ OK, passed 100 tests.
1134.64 s
[vector] mut_mapM_: OK
1134.65 s
[vector] +++ OK, passed 100 tests.
1134.66 s
[vector] mut_imapM_: OK (0.01s)
1134.66 s
[vector] +++ OK, passed 100 tests.
1134.68 s
[vector] mut_forM_: OK (0.01s)
1134.68 s
[vector] +++ OK, passed 100 tests.
1134.68 s
[vector] mut_iforM_: OK (0.02s)
1134.68 s
[vector] +++ OK, passed 100 tests.
1134.68 s
[vector] mut_foldr: OK
1134.68 s
[vector] +++ OK, passed 100 tests.
1134.69 s
[vector] mut_foldr': OK
1134.69 s
[vector] +++ OK, passed 100 tests.
1134.69 s
[vector] mut_foldl: OK
1134.69 s
[vector] +++ OK, passed 100 tests.
1134.69 s
[vector] mut_foldl': OK
1134.69 s
[vector] +++ OK, passed 100 tests.
1134.70 s
[vector] mut_ifoldr: OK
1134.70 s
[vector] +++ OK, passed 100 tests.
1134.70 s
[vector] mut_ifoldr': OK
1134.70 s
[vector] +++ OK, passed 100 tests.
1134.71 s
[vector] mut_ifoldl: OK
1134.71 s
[vector] +++ OK, passed 100 tests.
1134.71 s
[vector] mut_ifoldl': OK
1134.71 s
[vector] +++ OK, passed 100 tests.
1134.71 s
[vector] mut_foldM: OK
1134.71 s
[vector] +++ OK, passed 100 tests.
1134.72 s
[vector] mut_foldM': OK
1134.72 s
[vector] +++ OK, passed 100 tests.
1134.72 s
[vector] mut_foldrM: OK
1134.72 s
[vector] +++ OK, passed 100 tests.
1134.72 s
[vector] mut_foldrM': OK
1134.72 s
[vector] +++ OK, passed 100 tests.
1134.72 s
[vector] mut_ifoldM: OK
1134.72 s
[vector] +++ OK, passed 100 tests.
1134.72 s
[vector] mut_ifoldM': OK
1134.72 s
[vector] +++ OK, passed 100 tests.
1134.73 s
[vector] mut_ifoldrM: OK
1134.73 s
[vector] +++ OK, passed 100 tests.
1134.73 s
[vector] mut_ifoldrM': OK
1134.73 s
[vector] +++ OK, passed 100 tests.
1134.73 s
[vector] compare: OK
1134.73 s
[vector] +++ OK, passed 100 tests.
1134.73 s
[vector] maximum: OK
1134.73 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1134.73 s
[vector] minimum: OK
1134.73 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1134.73 s
[vector] minIndex: OK
1134.73 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1134.73 s
[vector] maxIndex: OK
1134.73 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1134.73 s
[vector] maximumBy: OK
1134.73 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1134.73 s
[vector] minimumBy: OK
1134.73 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1134.73 s
[vector] maximumOn: OK
1134.73 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1134.74 s
[vector] minimumOn: OK
1134.74 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1134.74 s
[vector] maxIndexBy: OK
1134.74 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1134.74 s
[vector] minIndexBy: OK
1134.74 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1134.74 s
[vector] ListFirstMaxIndexWins: OK
1134.74 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1134.74 s
[vector] FalseListFirstMaxIndexWins: OK
1134.74 s
[vector] +++ OK, failed as expected. (after 1 test):
1134.74 s
[vector] Exception:
1134.74 s
[vector] Prelude.foldr1: empty list
1134.74 s
[vector] CallStack (from HasCallStack):
1134.74 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1134.74 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1134.74 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1134.74 s
[vector] []
1134.74 s
[vector] zip: OK
1134.74 s
[vector] +++ OK, passed 100 tests.
1134.74 s
[vector] zip3: OK
1134.74 s
[vector] +++ OK, passed 100 tests.
1134.74 s
[vector] unzip: OK
1134.74 s
[vector] +++ OK, passed 100 tests.
1134.74 s
[vector] unzip3: OK
1134.74 s
[vector] +++ OK, passed 100 tests.
1134.74 s
[vector] indexed: OK
1134.74 s
[vector] +++ OK, passed 100 tests.
1134.74 s
[vector] update: OK
1134.74 s
[vector] +++ OK, passed 100 tests.
1134.74 s
[vector] mempty: OK
1134.74 s
[vector] +++ OK, passed 100 tests.
1134.74 s
[vector] mappend: OK
1134.74 s
[vector] +++ OK, passed 100 tests.
1134.76 s
[vector] mconcat: OK
1134.76 s
[vector] +++ OK, passed 100 tests.
1134.76 s
[vector] glength: OK
1134.76 s
[vector] +++ OK, passed 100 tests.
1134.76 s
[vector] sum: OK
1134.76 s
[vector] +++ OK, passed 100 tests.
1134.76 s
[vector] product: OK
1134.76 s
[vector] +++ OK, passed 100 tests.
1134.76 s
[vector] enumFromN: OK
1134.76 s
[vector] +++ OK, passed 100 tests.
1134.76 s
[vector] enumFromThenN: OK
1134.77 s
[vector] +++ OK, passed 100 tests.
1134.77 s
[vector] enumFromTo: OK
1134.77 s
[vector] +++ OK, passed 100 tests.
1134.77 s
[vector] enumFromThenTo: OK
1134.77 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1134.77 s
[vector] (Float)
1134.77 s
[vector] fromList.toList == id: OK
1134.77 s
[vector] +++ OK, passed 100 tests.
1134.77 s
[vector] toList.fromList == id: OK
1134.77 s
[vector] +++ OK, passed 100 tests.
1134.77 s
[vector] unstream.stream == id: OK
1134.77 s
[vector] +++ OK, passed 100 tests.
1134.77 s
[vector] stream.unstream == id: OK
1134.77 s
[vector] +++ OK, passed 100 tests.
1134.78 s
[vector] eq: OK
1134.78 s
[vector] +++ OK, passed 100 tests.
1134.78 s
[vector] length: OK
1134.78 s
[vector] +++ OK, passed 100 tests.
1134.79 s
[vector] null: OK
1134.79 s
[vector] +++ OK, passed 100 tests.
1134.79 s
[vector] index: OK
1134.79 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1134.79 s
[vector] safeIndex: OK
1134.79 s
[vector] +++ OK, passed 100 tests.
1134.80 s
[vector] head: OK
1134.80 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1134.80 s
[vector] last: OK
1134.81 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1134.81 s
[vector] unsafeIndex: OK
1134.81 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1134.81 s
[vector] unsafeHead: OK
1134.81 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1134.81 s
[vector] unsafeLast: OK
1134.82 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1134.82 s
[vector] slice: OK
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] init: OK
1134.99 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1134.99 s
[vector] tail: OK
1134.99 s
[vector] +++ OK, passed 100 tests; 25 discarded.
1134.99 s
[vector] take: OK
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] drop: OK
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] splitAt: OK
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] empty: OK
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] singleton: OK
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] replicate: OK
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] generate: OK
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] iterateN: OK
1134.99 s
[pandoc-lua-engine] [21 of 39] Compiling Text.Pandoc.Lua.Module.Image
1134.99 s
[pandoc-lua-engine] [22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
1134.99 s
[pandoc-lua-engine] [23 of 39] Compiling Text.Pandoc.Lua.Orphans
1134.99 s
[pandoc-lua-engine] [24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
1134.99 s
[pandoc-lua-engine] [25 of 39] Compiling Text.Pandoc.Lua.Global
1134.99 s
[pandoc-lua-engine] [26 of 39] Compiling Text.Pandoc.Lua.Filter
1134.99 s
[pandoc-lua-engine] [27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
1134.99 s
[pandoc-lua-engine] [28 of 39] Compiling Text.Pandoc.Lua.SourcePos
1134.99 s
[pandoc-lua-engine] [29 of 39] Compiling Text.Pandoc.Lua.Module.Log
1134.99 s
[pandoc-lua-engine] [30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
1134.99 s
[pandoc-lua-engine] [31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] iterateNM: OK (0.02s)
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] generateM: OK (0.03s)
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] replicateM: OK (0.03s)
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] create: OK
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] createT: OK
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] unfoldr: OK
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] unfoldrN: OK
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] unfoldrExactN: OK
1134.99 s
[vector] +++ OK, passed 100 tests.
1134.99 s
[vector] unfoldrM: OK
1135.00 s
[vector] +++ OK, passed 100 tests.
1135.00 s
[vector] unfoldrNM: OK
1135.00 s
[vector] +++ OK, passed 100 tests.
1135.00 s
[vector] unfoldrExactNM: OK (0.03s)
1135.00 s
[vector] +++ OK, passed 100 tests.
1135.00 s
[vector] constructN: OK
1135.00 s
[vector] +++ OK, passed 100 tests.
1135.00 s
[vector] constructrN: OK
1135.00 s
[vector] +++ OK, passed 100 tests.
1135.00 s
[vector] cons: OK
1135.00 s
[vector] +++ OK, passed 100 tests.
1135.00 s
[vector] snoc: OK
1135.00 s
[vector] +++ OK, passed 100 tests.
1135.00 s
[vector] append: OK
1135.00 s
[vector] +++ OK, passed 100 tests.
1135.00 s
[vector] concat: OK (0.02s)
1135.00 s
[vector] +++ OK, passed 100 tests.
1135.00 s
[vector] force: OK
1135.00 s
[vector] +++ OK, passed 100 tests.
1135.00 s
[vector] upd: OK
1135.00 s
[vector] +++ OK, passed 100 tests.
1135.01 s
[vector] accum: OK
1135.01 s
[vector] +++ OK, passed 100 tests.
1135.01 s
[vector] reverse: OK
1135.01 s
[vector] +++ OK, passed 100 tests.
1135.01 s
[vector] backpermute: OK
1135.02 s
[vector] +++ OK, passed 100 tests.
1135.02 s
[vector] map: OK
1135.02 s
[vector] +++ OK, passed 100 tests.
1135.04 s
[vector] imap: OK (0.01s)
1135.04 s
[vector] +++ OK, passed 100 tests.
1135.05 s
[vector] concatMap: OK (0.01s)
1135.06 s
[vector] +++ OK, passed 100 tests.
1135.06 s
[vector] mapM: OK (0.01s)
1135.06 s
[vector] +++ OK, passed 100 tests.
1135.09 s
[vector] mapM_: OK (0.03s)
1135.10 s
[vector] +++ OK, passed 100 tests.
1135.10 s
[vector] forM: OK
1135.10 s
[vector] +++ OK, passed 100 tests.
1135.13 s
[vector] forM_: OK (0.03s)
1135.14 s
[vector] +++ OK, passed 100 tests.
1135.14 s
[vector] imapM: OK
1135.14 s
[vector] +++ OK, passed 100 tests.
1135.17 s
[vector] imapM_: OK (0.03s)
1135.17 s
[vector] +++ OK, passed 100 tests.
1135.18 s
[vector] zipWith: OK
1135.18 s
[vector] +++ OK, passed 100 tests.
1135.18 s
[vector] zipWith3: OK
1135.18 s
[vector] +++ OK, passed 100 tests.
1135.20 s
[pandoc-server] [1 of 1] Compiling Text.Pandoc.Server
1135.20 s
[vector] izipWith: OK (0.01s)
1135.20 s
[vector] +++ OK, passed 100 tests.
1135.21 s
[vector] izipWith3: OK (0.01s)
1135.22 s
[vector] +++ OK, passed 100 tests.
1135.22 s
[vector] izipWithM: OK
1135.22 s
[vector] +++ OK, passed 100 tests.
1135.24 s
[vector] izipWithM_: OK (0.03s)
1135.24 s
[vector] +++ OK, passed 100 tests.
1135.26 s
[vector] zipWithM: OK
1135.26 s
[vector] +++ OK, passed 100 tests.
1135.29 s
[vector] zipWithM_: OK (0.03s)
1135.29 s
[vector] +++ OK, passed 100 tests.
1135.29 s
[vector] filter: OK
1135.29 s
[vector] +++ OK, passed 100 tests.
1135.29 s
[vector] ifilter: OK
1135.30 s
[vector] +++ OK, passed 100 tests.
1135.34 s
[vector] filterM: OK (0.05s)
1135.34 s
[vector] +++ OK, passed 100 tests.
1135.34 s
[vector] uniq: OK
1135.34 s
[vector] +++ OK, passed 100 tests.
1135.35 s
[vector] mapMaybe: OK
1135.36 s
[vector] +++ OK, passed 100 tests.
1135.37 s
[vector] imapMaybe: OK (0.01s)
1135.37 s
[vector] +++ OK, passed 100 tests.
1135.37 s
[vector] takeWhile: OK
1135.37 s
[vector] +++ OK, passed 100 tests.
1135.38 s
[vector] dropWhile: OK
1135.38 s
[vector] +++ OK, passed 100 tests.
1135.39 s
[vector] partition: OK
1135.39 s
[vector] +++ OK, passed 100 tests.
1135.39 s
[vector] partitionWith: OK
1135.39 s
[vector] +++ OK, passed 100 tests.
1135.39 s
[vector] span: OK
1135.39 s
[vector] +++ OK, passed 100 tests.
1135.39 s
[vector] break: OK
1135.40 s
[vector] +++ OK, passed 100 tests.
1135.40 s
[vector] spanR: OK
1135.40 s
[vector] +++ OK, passed 100 tests.
1135.40 s
[vector] breakR: OK
1135.40 s
[vector] +++ OK, passed 100 tests.
1135.40 s
[vector] groupBy: OK
1135.40 s
[vector] +++ OK, passed 100 tests.
1135.41 s
[vector] elem: OK
1135.41 s
[vector] +++ OK, passed 100 tests.
1135.41 s
[vector] notElem: OK
1135.41 s
[vector] +++ OK, passed 100 tests.
1135.41 s
[vector] find: OK
1135.41 s
[vector] +++ OK, passed 100 tests.
1135.41 s
[vector] findIndex: OK
1135.41 s
[vector] +++ OK, passed 100 tests.
1135.41 s
[vector] findIndexR: OK
1135.41 s
[vector] +++ OK, passed 100 tests.
1135.41 s
[vector] findIndices: OK
1135.41 s
[vector] +++ OK, passed 100 tests.
1135.41 s
[vector] elemIndex: OK
1135.41 s
[vector] +++ OK, passed 100 tests.
1135.41 s
[vector] elemIndices: OK
1135.41 s
[vector] +++ OK, passed 100 tests.
1135.42 s
[vector] foldl: OK
1135.43 s
[vector] +++ OK, passed 100 tests.
1135.44 s
[vector] foldl1: OK
1135.44 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1135.44 s
[vector] foldl': OK
1135.44 s
[vector] +++ OK, passed 100 tests.
1135.46 s
[vector] foldl1': OK (0.02s)
1135.46 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1135.46 s
[vector] foldr: OK
1135.47 s
[vector] +++ OK, passed 100 tests.
1135.48 s
[vector] foldr1: OK
1135.48 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1135.48 s
[vector] foldr': OK
1135.48 s
[vector] +++ OK, passed 100 tests.
1135.49 s
[vector] foldr1': OK
1135.49 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1135.50 s
[vector] ifoldl: OK
1135.50 s
[vector] +++ OK, passed 100 tests.
1135.51 s
[vector] ifoldl': OK
1135.52 s
[vector] +++ OK, passed 100 tests.
1135.52 s
[vector] ifoldr: OK
1135.52 s
[vector] +++ OK, passed 100 tests.
1135.53 s
[vector] ifoldr': OK (0.01s)
1135.53 s
[vector] +++ OK, passed 100 tests.
1135.54 s
[vector] ifoldM: OK (0.01s)
1135.54 s
[vector] +++ OK, passed 100 tests.
1135.54 s
[vector] ifoldM': OK
1135.54 s
[vector] +++ OK, passed 100 tests.
1135.58 s
[vector] ifoldM_: OK (0.02s)
1135.58 s
[vector] +++ OK, passed 100 tests.
1135.61 s
[vector] ifoldM'_: OK (0.03s)
1135.61 s
[vector] +++ OK, passed 100 tests.
1135.61 s
[vector] all: OK
1135.61 s
[vector] +++ OK, passed 100 tests.
1135.62 s
[vector] any: OK
1135.62 s
[vector] +++ OK, passed 100 tests.
1135.63 s
[vector] prescanl: OK (0.01s)
1135.64 s
[vector] +++ OK, passed 100 tests.
1135.64 s
[vector] prescanl': OK (0.01s)
1135.64 s
[vector] +++ OK, passed 100 tests.
1135.64 s
[vector] postscanl: OK
1135.65 s
[vector] +++ OK, passed 100 tests.
1135.65 s
[vector] postscanl': OK
1135.66 s
[vector] +++ OK, passed 100 tests.
1135.67 s
[vector] scanl: OK
1135.67 s
[vector] +++ OK, passed 100 tests.
1135.67 s
[vector] scanl': OK
1135.67 s
[vector] +++ OK, passed 100 tests.
1135.67 s
[vector] scanl1: OK
1135.68 s
[vector] +++ OK, passed 100 tests.
1135.70 s
[vector] scanl1': OK (0.01s)
1135.70 s
[vector] +++ OK, passed 100 tests.
1135.71 s
[vector] iscanl: OK (0.01s)
1135.71 s
[vector] +++ OK, passed 100 tests.
1135.71 s
[vector] iscanl': OK
1135.71 s
[vector] +++ OK, passed 100 tests.
1135.71 s
[vector] prescanr: OK
1135.71 s
[vector] +++ OK, passed 100 tests.
1135.74 s
[vector] prescanr': OK (0.01s)
1135.74 s
[vector] +++ OK, passed 100 tests.
1135.75 s
[vector] postscanr: OK (0.01s)
1135.75 s
[vector] +++ OK, passed 100 tests.
1135.76 s
[vector] postscanr': OK (0.01s)
1135.76 s
[vector] +++ OK, passed 100 tests.
1135.77 s
[vector] scanr: OK (0.01s)
1135.77 s
[vector] +++ OK, passed 100 tests.
1135.77 s
[vector] scanr': OK
1135.78 s
[vector] +++ OK, passed 100 tests.
1135.79 s
[vector] scanr1: OK
1135.79 s
[vector] +++ OK, passed 100 tests.
1135.80 s
[vector] scanr1': OK
1135.80 s
[vector] +++ OK, passed 100 tests.
1135.81 s
[vector] iscanr: OK
1135.81 s
[vector] +++ OK, passed 100 tests.
1135.81 s
[vector] iscanr': OK
1135.81 s
[vector] +++ OK, passed 100 tests.
1135.81 s
[vector] mut_read: OK
1135.81 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1135.81 s
[vector] mut_write: OK
1135.81 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1135.81 s
[vector] mut_modify: OK
1135.82 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1135.82 s
[vector] mut_generate: OK
1135.82 s
[vector] +++ OK, passed 100 tests.
1135.84 s
[vector] mut_generateM: OK (0.01s)
1135.84 s
[vector] +++ OK, passed 100 tests.
1135.88 s
[vector] mut_mapM_: OK (0.03s)
1135.88 s
[vector] +++ OK, passed 100 tests.
1135.90 s
[vector] mut_imapM_: OK (0.03s)
1135.90 s
[vector] +++ OK, passed 100 tests.
1135.94 s
[vector] mut_forM_: OK (0.03s)
1135.94 s
[vector] +++ OK, passed 100 tests.
1135.96 s
[vector] mut_iforM_: OK (0.03s)
1135.97 s
[vector] +++ OK, passed 100 tests.
1135.97 s
[vector] mut_foldr: OK
1135.97 s
[vector] +++ OK, passed 100 tests.
1135.98 s
[vector] mut_foldr': OK
1135.98 s
[vector] +++ OK, passed 100 tests.
1135.99 s
[vector] mut_foldl: OK
1135.99 s
[vector] +++ OK, passed 100 tests.
1136.00 s
[vector] mut_foldl': OK (0.01s)
1136.00 s
[vector] +++ OK, passed 100 tests.
1136.01 s
[vector] mut_ifoldr: OK (0.01s)
1136.01 s
[vector] +++ OK, passed 100 tests.
1136.02 s
[vector] mut_ifoldr': OK
1136.02 s
[vector] +++ OK, passed 100 tests.
1136.02 s
[vector] mut_ifoldl: OK
1136.02 s
[vector] +++ OK, passed 100 tests.
1136.03 s
[vector] mut_ifoldl': OK
1136.04 s
[vector] +++ OK, passed 100 tests.
1136.04 s
[vector] mut_foldM: OK
1136.04 s
[vector] +++ OK, passed 100 tests.
1136.05 s
[vector] mut_foldM': OK
1136.05 s
[vector] +++ OK, passed 100 tests.
1136.05 s
[vector] mut_foldrM: OK
1136.06 s
[vector] +++ OK, passed 100 tests.
1136.07 s
[vector] mut_foldrM': OK
1136.07 s
[vector] +++ OK, passed 100 tests.
1136.08 s
[vector] mut_ifoldM: OK (0.01s)
1136.08 s
[vector] +++ OK, passed 100 tests.
1136.10 s
[vector] mut_ifoldM': OK (0.02s)
1136.10 s
[vector] +++ OK, passed 100 tests.
1136.10 s
[vector] mut_ifoldrM: OK (0.01s)
1136.10 s
[vector] +++ OK, passed 100 tests.
1136.12 s
[vector] mut_ifoldrM': OK
1136.12 s
[vector] +++ OK, passed 100 tests.
1136.12 s
[vector] compare: OK
1136.12 s
[vector] +++ OK, passed 100 tests.
1136.12 s
[vector] maximum: OK
1136.12 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1136.12 s
[vector] minimum: OK
1136.12 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1136.12 s
[vector] minIndex: OK
1136.12 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1136.12 s
[vector] maxIndex: OK
1136.13 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1136.13 s
[vector] maximumBy: OK
1136.13 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1136.13 s
[vector] minimumBy: OK
1136.13 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1136.13 s
[vector] maximumOn: OK
1136.13 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1136.13 s
[vector] minimumOn: OK
1136.13 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1136.13 s
[vector] maxIndexBy: OK
1136.13 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1136.13 s
[vector] minIndexBy: OK
1136.13 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1136.13 s
[vector] ListFirstMaxIndexWins: OK
1136.13 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1136.14 s
[vector] FalseListFirstMaxIndexWins: OK
1136.14 s
[vector] +++ OK, failed as expected. (after 1 test):
1136.14 s
[vector] Exception:
1136.14 s
[vector] Prelude.foldr1: empty list
1136.14 s
[vector] CallStack (from HasCallStack):
1136.14 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1136.14 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1136.14 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1136.14 s
[vector] []
1136.14 s
[vector] zip: OK
1136.14 s
[vector] +++ OK, passed 100 tests.
1136.14 s
[vector] zip3: OK
1136.14 s
[vector] +++ OK, passed 100 tests.
1136.15 s
[vector] unzip: OK
1136.15 s
[vector] +++ OK, passed 100 tests.
1136.15 s
[vector] unzip3: OK
1136.15 s
[vector] +++ OK, passed 100 tests.
1136.15 s
[vector] indexed: OK
1136.15 s
[vector] +++ OK, passed 100 tests.
1136.15 s
[vector] update: OK
1136.15 s
[vector] +++ OK, passed 100 tests.
1136.16 s
[vector] mempty: OK
1136.16 s
[vector] +++ OK, passed 100 tests.
1136.16 s
[vector] mappend: OK
1136.16 s
[vector] +++ OK, passed 100 tests.
1136.17 s
[pandoc-lua-engine] [32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
1136.17 s
[pandoc-lua-engine] [33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
1136.17 s
[pandoc-lua-engine] [34 of 39] Compiling Text.Pandoc.Lua.Module
1136.17 s
[vector] mconcat: OK (0.02s)
1136.17 s
[vector] +++ OK, passed 100 tests.
1136.17 s
[vector] glength: OK
1136.17 s
[vector] +++ OK, passed 100 tests.
1136.17 s
[vector] sum: OK
1136.17 s
[vector] +++ OK, passed 100 tests.
1136.17 s
[vector] product: OK
1136.17 s
[vector] +++ OK, passed 100 tests.
1136.17 s
[vector] enumFromN: OK
1136.17 s
[vector] +++ OK, passed 100 tests.
1136.18 s
[vector] enumFromThenN: OK
1136.18 s
[vector] +++ OK, passed 100 tests.
1136.18 s
[vector] enumFromTo: OK
1136.18 s
[vector] +++ OK, passed 100 tests.
1136.18 s
[vector] enumFromThenTo: OK
1136.18 s
[vector] +++ OK, passed 100 tests; 1 discarded.
1136.18 s
[vector] (Double)
1136.18 s
[vector] fromList.toList == id: OK
1136.18 s
[vector] +++ OK, passed 100 tests.
1136.18 s
[vector] toList.fromList == id: OK
1136.18 s
[vector] +++ OK, passed 100 tests.
1136.18 s
[vector] unstream.stream == id: OK
1136.18 s
[vector] +++ OK, passed 100 tests.
1136.18 s
[vector] stream.unstream == id: OK
1136.18 s
[vector] +++ OK, passed 100 tests.
1136.18 s
[vector] eq: OK
1136.18 s
[vector] +++ OK, passed 100 tests.
1136.18 s
[vector] length: OK
1136.18 s
[vector] +++ OK, passed 100 tests.
1136.18 s
[vector] null: OK
1136.18 s
[vector] +++ OK, passed 100 tests.
1136.18 s
[vector] index: OK
1136.18 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1136.18 s
[vector] safeIndex: OK
1136.18 s
[vector] +++ OK, passed 100 tests.
1136.18 s
[vector] head: OK
1136.18 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1136.18 s
[vector] last: OK
1136.19 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1136.19 s
[vector] unsafeIndex: OK
1136.19 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1136.19 s
[vector] unsafeHead: OK
1136.19 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1136.19 s
[vector] unsafeLast: OK
1136.19 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1136.19 s
[vector] slice: OK
1136.19 s
[vector] +++ OK, passed 100 tests.
1136.19 s
[vector] init: OK
1136.19 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1136.19 s
[vector] tail: OK
1136.19 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1136.19 s
[vector] take: OK
1136.19 s
[vector] +++ OK, passed 100 tests.
1136.19 s
[vector] drop: OK
1136.19 s
[vector] +++ OK, passed 100 tests.
1136.19 s
[vector] splitAt: OK
1136.19 s
[vector] +++ OK, passed 100 tests.
1136.19 s
[vector] empty: OK
1136.19 s
[vector] +++ OK, passed 100 tests.
1136.19 s
[vector] singleton: OK
1136.19 s
[vector] +++ OK, passed 100 tests.
1136.19 s
[vector] replicate: OK
1136.19 s
[vector] +++ OK, passed 100 tests.
1136.19 s
[vector] generate: OK
1136.19 s
[vector] +++ OK, passed 100 tests.
1136.20 s
[vector] iterateN: OK
1136.20 s
[vector] +++ OK, passed 100 tests.
1136.24 s
[vector] iterateNM: OK (0.02s)
1136.25 s
[vector] +++ OK, passed 100 tests.
1136.26 s
[vector] generateM: OK (0.04s)
1136.26 s
[vector] +++ OK, passed 100 tests.
1136.26 s
[vector] replicateM: OK
1136.26 s
[vector] +++ OK, passed 100 tests.
1136.26 s
[vector] create: OK
1136.26 s
[vector] +++ OK, passed 100 tests.
1136.26 s
[vector] createT: OK
1136.26 s
[vector] +++ OK, passed 100 tests.
1136.26 s
[vector] unfoldr: OK
1136.26 s
[vector] +++ OK, passed 100 tests.
1136.26 s
[vector] unfoldrN: OK
1136.27 s
[vector] +++ OK, passed 100 tests.
1136.27 s
[vector] unfoldrExactN: OK
1136.27 s
[vector] +++ OK, passed 100 tests.
1136.27 s
[vector] unfoldrM: OK
1136.27 s
[vector] +++ OK, passed 100 tests.
1136.28 s
[vector] unfoldrNM: OK
1136.28 s
[vector] +++ OK, passed 100 tests.
1136.30 s
[vector] unfoldrExactNM: OK (0.02s)
1136.30 s
[vector] +++ OK, passed 100 tests.
1136.32 s
[vector] constructN: OK (0.01s)
1136.32 s
[vector] +++ OK, passed 100 tests.
1136.33 s
[vector] constructrN: OK (0.02s)
1136.33 s
[vector] +++ OK, passed 100 tests.
1136.33 s
[vector] cons: OK
1136.33 s
[vector] +++ OK, passed 100 tests.
1136.33 s
[vector] snoc: OK
1136.33 s
[vector] +++ OK, passed 100 tests.
1136.33 s
[vector] append: OK
1136.34 s
[vector] +++ OK, passed 100 tests.
1136.37 s
[vector] concat: OK (0.03s)
1136.37 s
[vector] +++ OK, passed 100 tests.
1136.37 s
[vector] force: OK
1136.37 s
[vector] +++ OK, passed 100 tests.
1136.38 s
[vector] upd: OK
1136.38 s
[vector] +++ OK, passed 100 tests.
1136.39 s
[vector] accum: OK (0.02s)
1136.39 s
[vector] +++ OK, passed 100 tests.
1136.39 s
[vector] reverse: OK
1136.39 s
[vector] +++ OK, passed 100 tests.
1136.39 s
[vector] backpermute: OK
1136.40 s
[vector] +++ OK, passed 100 tests.
1136.41 s
[vector] map: OK
1136.42 s
[vector] +++ OK, passed 100 tests.
1136.42 s
[vector] imap: OK
1136.42 s
[vector] +++ OK, passed 100 tests.
1136.43 s
[vector] concatMap: OK
1136.44 s
[vector] +++ OK, passed 100 tests.
1136.44 s
[vector] mapM: OK
1136.44 s
[vector] +++ OK, passed 100 tests.
1136.47 s
[vector] mapM_: OK (0.04s)
1136.48 s
[vector] +++ OK, passed 100 tests.
1136.48 s
[vector] forM: OK
1136.48 s
[vector] +++ OK, passed 100 tests.
1136.50 s
[pandoc-lua-engine] [35 of 39] Compiling Text.Pandoc.Lua.Init
1136.51 s
[vector] forM_: OK (0.03s)
1136.52 s
[vector] +++ OK, passed 100 tests.
1136.52 s
[vector] imapM: OK
1136.52 s
[vector] +++ OK, passed 100 tests.
1136.55 s
[vector] imapM_: OK (0.03s)
1136.56 s
[vector] +++ OK, passed 100 tests.
1136.56 s
[vector] zipWith: OK (0.01s)
1136.56 s
[vector] +++ OK, passed 100 tests.
1136.57 s
[pandoc-lua-engine] [36 of 39] Compiling Text.Pandoc.Lua.Run
1136.58 s
[vector] zipWith3: OK (0.02s)
1136.58 s
[vector] +++ OK, passed 100 tests.
1136.60 s
[vector] izipWith: OK (0.01s)
1136.60 s
[vector] +++ OK, passed 100 tests.
1136.60 s
[vector] izipWith3: OK (0.01s)
1136.60 s
[vector] +++ OK, passed 100 tests.
1136.62 s
[vector] izipWithM: OK (0.01s)
1136.62 s
[vector] +++ OK, passed 100 tests.
1136.65 s
[vector] izipWithM_: OK (0.04s)
1136.65 s
[vector] +++ OK, passed 100 tests.
1136.65 s
[vector] zipWithM: OK
1136.65 s
[vector] +++ OK, passed 100 tests.
1136.66 s
[pandoc-lua-engine] [37 of 39] Compiling Text.Pandoc.Lua.Custom
1136.68 s
[vector] zipWithM_: OK (0.03s)
1136.68 s
[vector] +++ OK, passed 100 tests.
1136.69 s
[vector] filter: OK
1136.69 s
[vector] +++ OK, passed 100 tests.
1136.72 s
[vector] ifilter: OK
1136.72 s
[vector] +++ OK, passed 100 tests.
1136.73 s
[vector] filterM: OK (0.04s)
1136.73 s
[vector] +++ OK, passed 100 tests.
1136.73 s
[vector] uniq: OK
1136.73 s
[vector] +++ OK, passed 100 tests.
1136.74 s
[vector] mapMaybe: OK
1136.74 s
[vector] +++ OK, passed 100 tests.
1136.76 s
[vector] imapMaybe: OK
1136.76 s
[vector] +++ OK, passed 100 tests.
1136.76 s
[vector] takeWhile: OK
1136.76 s
[vector] +++ OK, passed 100 tests.
1136.78 s
[vector] dropWhile: OK
1136.78 s
[vector] +++ OK, passed 100 tests.
1136.79 s
[vector] partition: OK
1136.79 s
[vector] +++ OK, passed 100 tests.
1136.79 s
[vector] partitionWith: OK (0.01s)
1136.80 s
[vector] +++ OK, passed 100 tests.
1136.80 s
[vector] span: OK
1136.80 s
[vector] +++ OK, passed 100 tests.
1136.80 s
[vector] break: OK
1136.80 s
[vector] +++ OK, passed 100 tests.
1136.81 s
[vector] spanR: OK
1136.81 s
[vector] +++ OK, passed 100 tests.
1136.81 s
[vector] breakR: OK
1136.81 s
[vector] +++ OK, passed 100 tests.
1136.83 s
[vector] groupBy: OK (0.02s)
1136.83 s
[vector] +++ OK, passed 100 tests.
1136.83 s
[vector] elem: OK
1136.84 s
[vector] +++ OK, passed 100 tests.
1136.84 s
[vector] notElem: OK
1136.84 s
[vector] +++ OK, passed 100 tests.
1136.84 s
[vector] find: OK
1136.84 s
[vector] +++ OK, passed 100 tests.
1136.84 s
[vector] findIndex: OK
1136.84 s
[vector] +++ OK, passed 100 tests.
1136.84 s
[vector] findIndexR: OK
1136.85 s
[vector] +++ OK, passed 100 tests.
1136.85 s
[vector] findIndices: OK
1136.85 s
[vector] +++ OK, passed 100 tests.
1136.85 s
[vector] elemIndex: OK
1136.85 s
[vector] +++ OK, passed 100 tests.
1136.86 s
[vector] elemIndices: OK
1136.86 s
[vector] +++ OK, passed 100 tests.
1136.87 s
[vector] foldl: OK (0.02s)
1136.87 s
[vector] +++ OK, passed 100 tests.
1136.90 s
[vector] foldl1: OK (0.01s)
1136.90 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1136.92 s
[vector] foldl': OK (0.02s)
1136.92 s
[vector] +++ OK, passed 100 tests.
1136.92 s
[vector] foldl1': OK (0.02s)
1136.92 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1136.94 s
[vector] foldr: OK (0.02s)
1136.94 s
[vector] +++ OK, passed 100 tests.
1136.96 s
[vector] foldr1: OK (0.01s)
1136.96 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1136.98 s
[vector] foldr': OK (0.02s)
1136.98 s
[vector] +++ OK, passed 100 tests.
1137.00 s
[vector] foldr1': OK (0.02s)
1137.00 s
[pandoc-lua-engine] [38 of 39] Compiling Text.Pandoc.Lua.Engine
1137.00 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1137.00 s
[vector] ifoldl: OK (0.02s)
1137.00 s
[vector] +++ OK, passed 100 tests.
1137.03 s
[vector] ifoldl': OK
1137.04 s
[vector] +++ OK, passed 100 tests.
1137.04 s
[vector] ifoldr: OK (0.01s)
1137.04 s
[vector] +++ OK, passed 100 tests.
1137.06 s
[vector] ifoldr': OK (0.02s)
1137.06 s
[vector] +++ OK, passed 100 tests.
1137.08 s
[vector] ifoldM: OK (0.02s)
1137.08 s
[vector] +++ OK, passed 100 tests.
1137.09 s
[pandoc-lua-engine] [39 of 39] Compiling Text.Pandoc.Lua
1137.10 s
[vector] ifoldM': OK (0.01s)
1137.10 s
[vector] +++ OK, passed 100 tests.
1137.14 s
[vector] ifoldM_: OK (0.04s)
1137.14 s
[vector] +++ OK, passed 100 tests.
1137.15 s
[vector] ifoldM'_: OK (0.04s)
1137.15 s
[vector] +++ OK, passed 100 tests.
1137.15 s
[vector] all: OK
1137.15 s
[vector] +++ OK, passed 100 tests.
1137.16 s
[vector] any: OK
1137.16 s
[vector] +++ OK, passed 100 tests.
1137.18 s
[vector] prescanl: OK (0.01s)
1137.18 s
[vector] +++ OK, passed 100 tests.
1137.20 s
[vector] prescanl': OK (0.02s)
1137.20 s
[vector] +++ OK, passed 100 tests.
1137.22 s
[vector] postscanl: OK (0.02s)
1137.22 s
[vector] +++ OK, passed 100 tests.
1137.24 s
[vector] postscanl': OK (0.01s)
1137.24 s
[vector] +++ OK, passed 100 tests.
1137.25 s
[vector] scanl: OK (0.01s)
1137.26 s
[vector] +++ OK, passed 100 tests.
1137.26 s
[vector] scanl': OK (0.01s)
1137.26 s
[vector] +++ OK, passed 100 tests.
1137.28 s
[vector] scanl1: OK (0.01s)
1137.28 s
[vector] +++ OK, passed 100 tests.
1137.29 s
[vector] scanl1': OK (0.01s)
1137.29 s
[vector] +++ OK, passed 100 tests.
1137.30 s
[vector] iscanl: OK (0.01s)
1137.30 s
[vector] +++ OK, passed 100 tests.
1137.32 s
[vector] iscanl': OK (0.01s)
1137.32 s
[vector] +++ OK, passed 100 tests.
1137.32 s
[vector] prescanr: OK (0.01s)
1137.32 s
[vector] +++ OK, passed 100 tests.
1137.33 s
[vector] prescanr': OK
1137.34 s
[vector] +++ OK, passed 100 tests.
1137.36 s
[vector] postscanr: OK (0.01s)
1137.36 s
[vector] +++ OK, passed 100 tests.
1137.37 s
[vector] postscanr': OK (0.01s)
1137.38 s
[vector] +++ OK, passed 100 tests.
1137.38 s
[vector] scanr: OK (0.01s)
1137.38 s
[vector] +++ OK, passed 100 tests.
1137.40 s
[vector] scanr': OK (0.01s)
1137.40 s
[vector] +++ OK, passed 100 tests.
1137.41 s
[vector] scanr1: OK (0.01s)
1137.42 s
[vector] +++ OK, passed 100 tests.
1137.42 s
[vector] scanr1': OK (0.01s)
1137.42 s
[vector] +++ OK, passed 100 tests.
1137.44 s
[vector] iscanr: OK (0.01s)
1137.44 s
[vector] +++ OK, passed 100 tests.
1137.44 s
[vector] iscanr': OK (0.01s)
1137.44 s
[vector] +++ OK, passed 100 tests.
1137.44 s
[vector] mut_read: OK
1137.44 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1137.44 s
[vector] mut_write: OK
1137.44 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1137.44 s
[vector] mut_modify: OK
1137.44 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1137.46 s
[vector] mut_generate: OK
1137.46 s
[vector] +++ OK, passed 100 tests.
1137.46 s
[vector] mut_generateM: OK (0.02s)
1137.46 s
[vector] +++ OK, passed 100 tests.
1137.52 s
[vector] mut_mapM_: OK (0.02s)
1137.52 s
[vector] +++ OK, passed 100 tests.
1137.54 s
[vector] mut_imapM_: OK (0.03s)
1137.54 s
[vector] +++ OK, passed 100 tests.
1137.58 s
[vector] mut_forM_: OK (0.03s)
1137.58 s
[vector] +++ OK, passed 100 tests.
1137.60 s
[vector] mut_iforM_: OK (0.03s)
1137.60 s
[vector] +++ OK, passed 100 tests.
1137.61 s
[vector] mut_foldr: OK (0.01s)
1137.62 s
[vector] +++ OK, passed 100 tests.
1137.62 s
[vector] mut_foldr': OK (0.01s)
1137.62 s
[vector] +++ OK, passed 100 tests.
1137.63 s
[vector] mut_foldl: OK (0.01s)
1137.63 s
[vector] +++ OK, passed 100 tests.
1137.64 s
[pandoc-lua-engine] [ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
1137.65 s
[vector] mut_foldl': OK (0.01s)
1137.66 s
[vector] +++ OK, passed 100 tests.
1137.66 s
[vector] mut_ifoldr: OK (0.01s)
1137.66 s
[vector] +++ OK, passed 100 tests.
1137.67 s
[vector] mut_ifoldr': OK (0.01s)
1137.68 s
[vector] +++ OK, passed 100 tests.
1137.68 s
[vector] mut_ifoldl: OK (0.01s)
1137.68 s
[vector] +++ OK, passed 100 tests.
1137.70 s
[vector] mut_ifoldl': OK (0.01s)
1137.70 s
[vector] +++ OK, passed 100 tests.
1137.72 s
[vector] mut_foldM: OK (0.02s)
1137.72 s
[vector] +++ OK, passed 100 tests.
1137.74 s
[vector] mut_foldM': OK (0.01s)
1137.74 s
[vector] +++ OK, passed 100 tests.
1137.76 s
[vector] mut_foldrM: OK (0.03s)
1137.76 s
[vector] +++ OK, passed 100 tests.
1137.78 s
[vector] mut_foldrM': OK (0.03s)
1137.78 s
[vector] +++ OK, passed 100 tests.
1137.79 s
[vector] mut_ifoldM: OK (0.02s)
1137.79 s
[vector] +++ OK, passed 100 tests.
1137.84 s
[vector] mut_ifoldM': OK (0.03s)
1137.84 s
[vector] +++ OK, passed 100 tests.
1137.86 s
[vector] mut_ifoldrM: OK (0.02s)
1137.86 s
[vector] +++ OK, passed 100 tests.
1137.86 s
[vector] mut_ifoldrM': OK (0.01s)
1137.86 s
[vector] +++ OK, passed 100 tests.
1137.86 s
[vector] compare: OK
1137.86 s
[vector] +++ OK, passed 100 tests.
1137.87 s
[vector] maximum: OK
1137.87 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1137.87 s
[vector] minimum: OK
1137.87 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1137.87 s
[vector] minIndex: OK
1137.87 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1137.87 s
[vector] maxIndex: OK
1137.87 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1137.87 s
[vector] maximumBy: OK
1137.87 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1137.87 s
[vector] minimumBy: OK
1137.87 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1137.87 s
[vector] maximumOn: OK
1137.87 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1137.87 s
[vector] minimumOn: OK
1137.87 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1137.87 s
[vector] maxIndexBy: OK
1137.87 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1137.87 s
[vector] minIndexBy: OK
1137.87 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1137.87 s
[vector] ListFirstMaxIndexWins: OK
1137.87 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1137.88 s
[vector] FalseListFirstMaxIndexWins: OK
1137.88 s
[vector] +++ OK, failed as expected. (after 1 test):
1137.88 s
[vector] Exception:
1137.88 s
[vector] Prelude.foldr1: empty list
1137.88 s
[vector] CallStack (from HasCallStack):
1137.88 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1137.88 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1137.88 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1137.89 s
[vector] []
1137.89 s
[vector] zip: OK
1137.89 s
[vector] +++ OK, passed 100 tests.
1137.89 s
[vector] zip3: OK
1137.89 s
[vector] +++ OK, passed 100 tests.
1137.89 s
[vector] unzip: OK
1137.89 s
[vector] +++ OK, passed 100 tests.
1137.89 s
[vector] unzip3: OK
1137.89 s
[vector] +++ OK, passed 100 tests.
1137.89 s
[vector] indexed: OK
1137.89 s
[vector] +++ OK, passed 100 tests.
1137.89 s
[vector] update: OK
1137.89 s
[vector] +++ OK, passed 100 tests.
1137.89 s
[vector] mempty: OK
1137.89 s
[vector] +++ OK, passed 100 tests.
1137.90 s
[vector] mappend: OK
1137.90 s
[vector] +++ OK, passed 100 tests.
1137.93 s
[vector] mconcat: OK (0.03s)
1137.93 s
[vector] +++ OK, passed 100 tests.
1137.93 s
[vector] glength: OK (0.01s)
1137.93 s
[vector] +++ OK, passed 100 tests.
1137.93 s
[vector] sum: OK
1137.93 s
[vector] +++ OK, passed 100 tests.
1137.93 s
[vector] product: OK
1137.93 s
[vector] +++ OK, passed 100 tests.
1137.94 s
[vector] enumFromN: OK
1137.94 s
[vector] +++ OK, passed 100 tests.
1137.94 s
[vector] enumFromThenN: OK
1137.94 s
[vector] +++ OK, passed 100 tests.
1137.94 s
[vector] enumFromTo: OK
1137.94 s
[vector] +++ OK, passed 100 tests.
1137.94 s
[vector] enumFromThenTo: OK
1137.94 s
[vector] +++ OK, passed 100 tests; 4 discarded.
1137.94 s
[vector] (Int,Bool)
1137.94 s
[vector] fromList.toList == id: OK
1137.94 s
[vector] +++ OK, passed 100 tests.
1137.94 s
[vector] toList.fromList == id: OK
1137.94 s
[vector] +++ OK, passed 100 tests.
1137.94 s
[vector] unstream.stream == id: OK
1137.94 s
[vector] +++ OK, passed 100 tests.
1137.95 s
[vector] stream.unstream == id: OK
1137.95 s
[vector] +++ OK, passed 100 tests.
1137.95 s
[vector] eq: OK
1137.95 s
[vector] +++ OK, passed 100 tests.
1137.95 s
[vector] length: OK
1137.95 s
[vector] +++ OK, passed 100 tests.
1137.95 s
[vector] null: OK
1137.95 s
[vector] +++ OK, passed 100 tests.
1137.96 s
[vector] index: OK
1137.96 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1137.96 s
[vector] safeIndex: OK
1137.96 s
[vector] +++ OK, passed 100 tests.
1137.96 s
[vector] head: OK
1137.96 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1137.96 s
[vector] last: OK
1137.96 s
[vector] +++ OK, passed 100 tests; 22 discarded.
1137.96 s
[vector] unsafeIndex: OK
1137.96 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1137.97 s
[vector] unsafeHead: OK
1137.97 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1137.97 s
[vector] unsafeLast: OK
1137.97 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1137.97 s
[vector] slice: OK
1137.97 s
[vector] +++ OK, passed 100 tests.
1137.97 s
[vector] init: OK
1137.97 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1137.97 s
[vector] tail: OK
1137.97 s
[vector] +++ OK, passed 100 tests; 12 discarded.
1137.97 s
[vector] take: OK
1137.97 s
[vector] +++ OK, passed 100 tests.
1137.98 s
[vector] drop: OK
1137.98 s
[vector] +++ OK, passed 100 tests.
1137.98 s
[vector] splitAt: OK
1137.98 s
[vector] +++ OK, passed 100 tests.
1137.98 s
[vector] empty: OK
1137.98 s
[vector] +++ OK, passed 100 tests.
1137.98 s
[vector] singleton: OK
1137.98 s
[vector] +++ OK, passed 100 tests.
1137.98 s
[vector] replicate: OK
1137.98 s
[vector] +++ OK, passed 100 tests.
1137.98 s
[vector] generate: OK
1137.98 s
[vector] +++ OK, passed 100 tests.
1138.00 s
[vector] iterateN: OK
1138.00 s
[vector] +++ OK, passed 100 tests.
1138.00 s
[vector] iterateNM: OK (0.02s)
1138.00 s
[vector] +++ OK, passed 100 tests.
1138.04 s
[vector] generateM: OK (0.03s)
1138.04 s
[vector] +++ OK, passed 100 tests.
1138.04 s
[vector] replicateM: OK
1138.04 s
[vector] +++ OK, passed 100 tests.
1138.04 s
[vector] create: OK
1138.04 s
[vector] +++ OK, passed 100 tests.
1138.04 s
[vector] createT: OK
1138.04 s
[vector] +++ OK, passed 100 tests.
1138.04 s
[vector] unfoldr: OK
1138.04 s
[vector] +++ OK, passed 100 tests.
1138.04 s
[vector] unfoldrN: OK
1138.04 s
[vector] +++ OK, passed 100 tests.
1138.04 s
[vector] unfoldrExactN: OK
1138.04 s
[vector] +++ OK, passed 100 tests.
1138.04 s
[vector] unfoldrM: OK
1138.04 s
[vector] +++ OK, passed 100 tests.
1138.04 s
[vector] unfoldrNM: OK
1138.06 s
[vector] +++ OK, passed 100 tests.
1138.07 s
[vector] unfoldrExactNM: OK (0.02s)
1138.07 s
[vector] +++ OK, passed 100 tests.
1138.08 s
[vector] constructN: OK
1138.08 s
[vector] +++ OK, passed 100 tests.
1138.08 s
[vector] constructrN: OK
1138.08 s
[vector] +++ OK, passed 100 tests.
1138.08 s
[vector] cons: OK
1138.08 s
[vector] +++ OK, passed 100 tests.
1138.08 s
[vector] snoc: OK
1138.10 s
[vector] +++ OK, passed 100 tests.
1138.10 s
[vector] append: OK
1138.10 s
[vector] +++ OK, passed 100 tests.
1138.14 s
[vector] concat: OK (0.05s)
1138.14 s
[vector] +++ OK, passed 100 tests.
1138.14 s
[vector] force: OK
1138.14 s
[vector] +++ OK, passed 100 tests.
1138.14 s
[vector] upd: OK
1138.15 s
[vector] +++ OK, passed 100 tests.
1138.15 s
[vector] accum: OK
1138.15 s
[vector] +++ OK, passed 100 tests.
1138.16 s
[vector] reverse: OK
1138.16 s
[vector] +++ OK, passed 100 tests.
1138.16 s
[vector] backpermute: OK
1138.18 s
[vector] +++ OK, passed 100 tests.
1138.19 s
[vector] map: OK (0.03s)
1138.19 s
[vector] +++ OK, passed 100 tests.
1138.20 s
[vector] imap: OK
1138.20 s
[vector] +++ OK, passed 100 tests.
1138.21 s
[vector] concatMap: OK
1138.21 s
[vector] +++ OK, passed 100 tests.
1138.21 s
[vector] mapM: OK
1138.21 s
[vector] +++ OK, passed 100 tests.
1138.24 s
[vector] mapM_: OK (0.03s)
1138.24 s
[vector] +++ OK, passed 100 tests.
1138.26 s
[vector] forM: OK
1138.26 s
[vector] +++ OK, passed 100 tests.
1138.29 s
[vector] forM_: OK (0.04s)
1138.29 s
[vector] +++ OK, passed 100 tests.
1138.29 s
[vector] imapM: OK
1138.30 s
[vector] +++ OK, passed 100 tests.
1138.33 s
[vector] imapM_: OK (0.04s)
1138.33 s
[vector] +++ OK, passed 100 tests.
1138.34 s
[vector] zipWith: OK
1138.34 s
[vector] +++ OK, passed 100 tests.
1138.34 s
[vector] zipWith3: OK
1138.34 s
[vector] +++ OK, passed 100 tests.
1138.35 s
[vector] izipWith: OK
1138.35 s
[vector] +++ OK, passed 100 tests.
1138.35 s
[vector] izipWith3: OK
1138.36 s
[vector] +++ OK, passed 100 tests.
1138.38 s
[vector] izipWithM: OK
1138.38 s
[vector] +++ OK, passed 100 tests.
1138.39 s
[vector] izipWithM_: OK (0.03s)
1138.39 s
[vector] +++ OK, passed 100 tests.
1138.39 s
[vector] zipWithM: OK
1138.39 s
[vector] +++ OK, passed 100 tests.
1138.41 s
[vector] zipWithM_: OK (0.01s)
1138.41 s
[vector] +++ OK, passed 100 tests.
1138.42 s
[vector] filter: OK
1138.42 s
[vector] +++ OK, passed 100 tests.
1138.44 s
[vector] ifilter: OK
1138.44 s
[vector] +++ OK, passed 100 tests.
1138.46 s
[vector] filterM: OK (0.05s)
1138.47 s
[vector] +++ OK, passed 100 tests.
1138.47 s
[vector] uniq: OK
1138.47 s
[vector] +++ OK, passed 100 tests.
1138.47 s
[vector] mapMaybe: OK
1138.47 s
[vector] +++ OK, passed 100 tests.
1138.47 s
[vector] imapMaybe: OK
1138.47 s
[vector] +++ OK, passed 100 tests.
1138.47 s
[vector] takeWhile: OK
1138.48 s
[vector] +++ OK, passed 100 tests.
1138.48 s
[vector] dropWhile: OK
1138.48 s
[vector] +++ OK, passed 100 tests.
1138.48 s
[vector] partition: OK
1138.48 s
[vector] +++ OK, passed 100 tests.
1138.48 s
[vector] partitionWith: OK
1138.48 s
[vector] +++ OK, passed 100 tests.
1138.48 s
[vector] span: OK
1138.48 s
[vector] +++ OK, passed 100 tests.
1138.48 s
[vector] break: OK
1138.48 s
[vector] +++ OK, passed 100 tests.
1138.49 s
[vector] spanR: OK
1138.49 s
[vector] +++ OK, passed 100 tests.
1138.49 s
[vector] breakR: OK
1138.49 s
[vector] +++ OK, passed 100 tests.
1138.49 s
[vector] groupBy: OK
1138.49 s
[vector] +++ OK, passed 100 tests.
1138.49 s
[vector] elem: OK
1138.49 s
[vector] +++ OK, passed 100 tests.
1138.50 s
[vector] notElem: OK
1138.50 s
[vector] +++ OK, passed 100 tests.
1138.50 s
[vector] find: OK
1138.50 s
[vector] +++ OK, passed 100 tests.
1138.51 s
[vector] findIndex: OK
1138.51 s
[vector] +++ OK, passed 100 tests.
1138.51 s
[vector] findIndexR: OK
1138.51 s
[vector] +++ OK, passed 100 tests.
1138.51 s
[vector] findIndices: OK
1138.51 s
[vector] +++ OK, passed 100 tests.
1138.52 s
[vector] elemIndex: OK
1138.52 s
[vector] +++ OK, passed 100 tests.
1138.52 s
[vector] elemIndices: OK
1138.52 s
[vector] +++ OK, passed 100 tests.
1138.52 s
[vector] foldl: OK
1138.52 s
[vector] +++ OK, passed 100 tests.
1138.53 s
[vector] foldl1: OK
1138.53 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1138.54 s
[vector] foldl': OK
1138.54 s
[vector] +++ OK, passed 100 tests.
1138.54 s
[vector] foldl1': OK
1138.54 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1138.54 s
[vector] foldr: OK
1138.54 s
[vector] +++ OK, passed 100 tests.
1138.54 s
[vector] foldr1: OK
1138.54 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1138.54 s
[vector] foldr': OK
1138.54 s
[vector] +++ OK, passed 100 tests.
1138.55 s
[vector] foldr1': OK
1138.55 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1138.55 s
[vector] ifoldl: OK
1138.55 s
[vector] +++ OK, passed 100 tests.
1138.56 s
[vector] ifoldl': OK
1138.56 s
[vector] +++ OK, passed 100 tests.
1138.56 s
[vector] ifoldr: OK
1138.56 s
[vector] +++ OK, passed 100 tests.
1138.57 s
[vector] ifoldr': OK
1138.57 s
[vector] +++ OK, passed 100 tests.
1138.57 s
[vector] ifoldM: OK
1138.57 s
[vector] +++ OK, passed 100 tests.
1138.57 s
[vector] ifoldM': OK
1138.57 s
[vector] +++ OK, passed 100 tests.
1138.57 s
[pandoc-lua-engine] [ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
1138.57 s
[pandoc-lua-engine] [ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
1138.57 s
[pandoc-lua-engine] [ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
1138.57 s
[pandoc-lua-engine] [ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
1138.60 s
[vector] ifoldM_: OK (0.02s)
1138.60 s
[vector] +++ OK, passed 100 tests.
1138.61 s
[vector] ifoldM'_: OK (0.02s)
1138.61 s
[vector] +++ OK, passed 100 tests.
1138.61 s
[vector] all: OK
1138.61 s
[vector] +++ OK, passed 100 tests.
1138.62 s
[vector] any: OK
1138.62 s
[vector] +++ OK, passed 100 tests.
1138.62 s
[vector] prescanl: OK
1138.62 s
[vector] +++ OK, passed 100 tests.
1138.62 s
[vector] prescanl': OK
1138.62 s
[vector] +++ OK, passed 100 tests.
1138.63 s
[vector] postscanl: OK
1138.63 s
[vector] +++ OK, passed 100 tests.
1138.63 s
[pandoc-lua-engine] [ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
1138.63 s
[pandoc-lua-engine] [ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
1138.63 s
[pandoc-lua-engine] [ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
1138.63 s
[pandoc-lua-engine] [ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
1138.63 s
[pandoc-lua-engine] [10 of 39] Compiling Text.Pandoc.Lua.PandocLua
1138.63 s
[vector] postscanl': OK
1138.63 s
[vector] +++ OK, passed 100 tests.
1138.64 s
[vector] scanl: OK
1138.64 s
[vector] +++ OK, passed 100 tests.
1138.64 s
[vector] scanl': OK
1138.64 s
[vector] +++ OK, passed 100 tests.
1138.65 s
[vector] scanl1: OK
1138.65 s
[vector] +++ OK, passed 100 tests.
1138.65 s
[vector] scanl1': OK
1138.66 s
[vector] +++ OK, passed 100 tests.
1138.66 s
[vector] iscanl: OK
1138.66 s
[vector] +++ OK, passed 100 tests.
1138.67 s
[vector] iscanl': OK
1138.67 s
[vector] +++ OK, passed 100 tests.
1138.67 s
[vector] prescanr: OK
1138.68 s
[vector] +++ OK, passed 100 tests.
1138.68 s
[vector] prescanr': OK
1138.68 s
[vector] +++ OK, passed 100 tests.
1138.68 s
[vector] postscanr: OK
1138.68 s
[vector] +++ OK, passed 100 tests.
1138.68 s
[vector] postscanr': OK
1138.68 s
[vector] +++ OK, passed 100 tests.
1138.68 s
[vector] scanr: OK
1138.68 s
[vector] +++ OK, passed 100 tests.
1138.69 s
[vector] scanr': OK
1138.69 s
[vector] +++ OK, passed 100 tests.
1138.70 s
[vector] scanr1: OK
1138.70 s
[vector] +++ OK, passed 100 tests.
1138.70 s
[vector] scanr1': OK
1138.70 s
[vector] +++ OK, passed 100 tests.
1138.70 s
[vector] iscanr: OK
1138.70 s
[vector] +++ OK, passed 100 tests.
1138.70 s
[vector] iscanr': OK
1138.70 s
[vector] +++ OK, passed 100 tests.
1138.71 s
[vector] mut_read: OK
1138.71 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1138.71 s
[vector] mut_write: OK
1138.71 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1138.71 s
[vector] mut_modify: OK
1138.71 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1138.72 s
[vector] mut_generate: OK
1138.72 s
[vector] +++ OK, passed 100 tests.
1138.74 s
[vector] mut_generateM: OK (0.01s)
1138.74 s
[vector] +++ OK, passed 100 tests.
1138.76 s
[vector] mut_mapM_: OK (0.02s)
1138.76 s
[vector] +++ OK, passed 100 tests.
1138.78 s
[vector] mut_imapM_: OK (0.03s)
1138.78 s
[vector] +++ OK, passed 100 tests.
1138.82 s
[vector] mut_forM_: OK (0.03s)
1138.82 s
[vector] +++ OK, passed 100 tests.
1138.83 s
[vector] mut_iforM_: OK (0.02s)
1138.83 s
[vector] +++ OK, passed 100 tests.
1138.83 s
[vector] mut_foldr: OK
1138.83 s
[vector] +++ OK, passed 100 tests.
1138.83 s
[vector] mut_foldr': OK
1138.83 s
[vector] +++ OK, passed 100 tests.
1138.84 s
[vector] mut_foldl: OK
1138.84 s
[vector] +++ OK, passed 100 tests.
1138.84 s
[vector] mut_foldl': OK
1138.84 s
[vector] +++ OK, passed 100 tests.
1138.85 s
[vector] mut_ifoldr: OK
1138.85 s
[vector] +++ OK, passed 100 tests.
1138.86 s
[vector] mut_ifoldr': OK
1138.86 s
[vector] +++ OK, passed 100 tests.
1138.86 s
[vector] mut_ifoldl: OK
1138.86 s
[vector] +++ OK, passed 100 tests.
1138.86 s
[vector] mut_ifoldl': OK
1138.86 s
[vector] +++ OK, passed 100 tests.
1138.86 s
[vector] mut_foldM: OK
1138.87 s
[vector] +++ OK, passed 100 tests.
1138.87 s
[vector] mut_foldM': OK
1138.87 s
[vector] +++ OK, passed 100 tests.
1138.88 s
[vector] mut_foldrM: OK
1138.88 s
[vector] +++ OK, passed 100 tests.
1138.88 s
[vector] mut_foldrM': OK
1138.88 s
[vector] +++ OK, passed 100 tests.
1138.88 s
[vector] mut_ifoldM: OK
1138.88 s
[vector] +++ OK, passed 100 tests.
1138.89 s
[vector] mut_ifoldM': OK
1138.89 s
[vector] +++ OK, passed 100 tests.
1138.89 s
[vector] mut_ifoldrM: OK
1138.89 s
[vector] +++ OK, passed 100 tests.
1138.89 s
[vector] mut_ifoldrM': OK
1138.89 s
[vector] +++ OK, passed 100 tests.
1138.90 s
[vector] compare: OK
1138.90 s
[vector] +++ OK, passed 100 tests.
1138.90 s
[vector] maximum: OK
1138.90 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1138.90 s
[vector] minimum: OK
1138.90 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1138.90 s
[vector] minIndex: OK
1138.90 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1138.90 s
[vector] maxIndex: OK
1138.90 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1138.90 s
[vector] maximumBy: OK
1138.90 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1138.90 s
[vector] minimumBy: OK
1138.90 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1138.90 s
[vector] maximumOn: OK
1138.90 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1138.90 s
[vector] minimumOn: OK
1138.90 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1138.90 s
[vector] maxIndexBy: OK
1138.90 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1138.91 s
[vector] minIndexBy: OK
1138.91 s
[vector] +++ OK, passed 100 tests; 21 discarded.
1138.91 s
[vector] ListFirstMaxIndexWins: OK
1138.91 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1138.91 s
[vector] FalseListFirstMaxIndexWins: OK
1138.91 s
[vector] +++ OK, failed as expected. (after 1 test):
1138.91 s
[vector] Exception:
1138.91 s
[vector] Prelude.foldr1: empty list
1138.91 s
[vector] CallStack (from HasCallStack):
1138.91 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1138.91 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1138.91 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1138.91 s
[vector] []
1138.91 s
[vector] zip: OK
1138.91 s
[vector] +++ OK, passed 100 tests.
1138.92 s
[vector] zip3: OK
1138.92 s
[vector] +++ OK, passed 100 tests.
1138.92 s
[vector] unzip: OK
1138.92 s
[vector] +++ OK, passed 100 tests.
1138.93 s
[vector] unzip3: OK
1138.93 s
[vector] +++ OK, passed 100 tests.
1138.93 s
[vector] indexed: OK
1138.93 s
[vector] +++ OK, passed 100 tests.
1138.93 s
[vector] update: OK
1138.93 s
[vector] +++ OK, passed 100 tests.
1138.93 s
[vector] mempty: OK
1138.94 s
[vector] +++ OK, passed 100 tests.
1138.94 s
[vector] mappend: OK
1138.94 s
[vector] +++ OK, passed 100 tests.
1138.97 s
[vector] mconcat: OK (0.03s)
1138.97 s
[vector] +++ OK, passed 100 tests.
1138.97 s
[vector] glength: OK
1138.97 s
[vector] +++ OK, passed 100 tests.
1138.97 s
[vector] (Int,Bool,Int)
1138.97 s
[vector] fromList.toList == id: OK
1138.97 s
[vector] +++ OK, passed 100 tests.
1138.97 s
[vector] toList.fromList == id: OK
1138.97 s
[vector] +++ OK, passed 100 tests.
1138.97 s
[vector] unstream.stream == id: OK
1138.97 s
[vector] +++ OK, passed 100 tests.
1138.97 s
[vector] stream.unstream == id: OK
1138.97 s
[vector] +++ OK, passed 100 tests.
1138.98 s
[vector] eq: OK
1138.98 s
[vector] +++ OK, passed 100 tests.
1138.98 s
[vector] length: OK
1138.98 s
[vector] +++ OK, passed 100 tests.
1138.98 s
[vector] null: OK
1138.98 s
[vector] +++ OK, passed 100 tests.
1138.98 s
[vector] index: OK
1138.98 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1138.98 s
[vector] safeIndex: OK
1138.98 s
[vector] +++ OK, passed 100 tests.
1138.98 s
[vector] head: OK
1138.98 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1138.98 s
[vector] last: OK
1138.98 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1138.99 s
[vector] unsafeIndex: OK
1138.99 s
[vector] +++ OK, passed 100 tests; 24 discarded.
1138.99 s
[vector] unsafeHead: OK
1138.99 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1138.99 s
[vector] unsafeLast: OK
1138.99 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1138.99 s
[vector] slice: OK
1138.99 s
[vector] +++ OK, passed 100 tests.
1138.99 s
[vector] init: OK
1138.99 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1138.99 s
[vector] tail: OK
1138.99 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1139.00 s
[vector] take: OK
1139.00 s
[vector] +++ OK, passed 100 tests.
1139.00 s
[vector] drop: OK
1139.00 s
[vector] +++ OK, passed 100 tests.
1139.00 s
[vector] splitAt: OK
1139.00 s
[vector] +++ OK, passed 100 tests.
1139.00 s
[vector] empty: OK
1139.00 s
[vector] +++ OK, passed 100 tests.
1139.00 s
[vector] singleton: OK
1139.00 s
[vector] +++ OK, passed 100 tests.
1139.00 s
[vector] replicate: OK
1139.00 s
[vector] +++ OK, passed 100 tests.
1139.00 s
[vector] generate: OK
1139.01 s
[vector] +++ OK, passed 100 tests.
1139.02 s
[vector] iterateN: OK
1139.02 s
[vector] +++ OK, passed 100 tests.
1139.02 s
[vector] iterateNM: OK (0.01s)
1139.02 s
[vector] +++ OK, passed 100 tests.
1139.04 s
[pandoc-lua-engine] [11 of 39] Compiling Text.Pandoc.Lua.Module.Types
1139.07 s
[vector] generateM: OK (0.05s)
1139.07 s
[vector] +++ OK, passed 100 tests.
1139.07 s
[vector] replicateM: OK
1139.07 s
[vector] +++ OK, passed 100 tests.
1139.08 s
[vector] create: OK
1139.08 s
[vector] +++ OK, passed 100 tests.
1139.08 s
[vector] createT: OK
1139.08 s
[vector] +++ OK, passed 100 tests.
1139.08 s
[vector] unfoldr: OK
1139.08 s
[vector] +++ OK, passed 100 tests.
1139.08 s
[vector] unfoldrN: OK
1139.08 s
[vector] +++ OK, passed 100 tests.
1139.08 s
[vector] unfoldrExactN: OK
1139.08 s
[vector] +++ OK, passed 100 tests.
1139.08 s
[vector] unfoldrM: OK
1139.08 s
[vector] +++ OK, passed 100 tests.
1139.08 s
[vector] unfoldrNM: OK
1139.08 s
[vector] +++ OK, passed 100 tests.
1139.11 s
[vector] unfoldrExactNM: OK (0.01s)
1139.11 s
[vector] +++ OK, passed 100 tests.
1139.12 s
[vector] constructN: OK
1139.12 s
[vector] +++ OK, passed 100 tests.
1139.12 s
[vector] constructrN: OK
1139.12 s
[vector] +++ OK, passed 100 tests.
1139.12 s
[vector] cons: OK
1139.12 s
[vector] +++ OK, passed 100 tests.
1139.12 s
[vector] snoc: OK
1139.13 s
[vector] +++ OK, passed 100 tests.
1139.14 s
[vector] append: OK
1139.14 s
[vector] +++ OK, passed 100 tests.
1139.18 s
[vector] concat: OK (0.06s)
1139.18 s
[vector] +++ OK, passed 100 tests.
1139.19 s
[vector] force: OK
1139.19 s
[vector] +++ OK, passed 100 tests.
1139.20 s
[vector] upd: OK
1139.20 s
[vector] +++ OK, passed 100 tests.
1139.20 s
[vector] accum: OK (0.01s)
1139.20 s
[vector] +++ OK, passed 100 tests.
1139.21 s
[vector] reverse: OK
1139.21 s
[vector] +++ OK, passed 100 tests.
1139.22 s
[vector] backpermute: OK
1139.22 s
[vector] +++ OK, passed 100 tests.
1139.23 s
[vector] map: OK (0.01s)
1139.24 s
[vector] +++ OK, passed 100 tests.
1139.24 s
[vector] imap: OK
1139.24 s
[vector] +++ OK, passed 100 tests.
1139.24 s
[vector] concatMap: OK
1139.24 s
[vector] +++ OK, passed 100 tests.
1139.26 s
[vector] mapM: OK
1139.26 s
[vector] +++ OK, passed 100 tests.
1139.29 s
[vector] mapM_: OK (0.04s)
1139.29 s
[vector] +++ OK, passed 100 tests.
1139.30 s
[vector] forM: OK
1139.30 s
[vector] +++ OK, passed 100 tests.
1139.30 s
[pandoc-lua-engine] [12 of 39] Compiling Text.Pandoc.Lua.Module.Text
1139.30 s
[pandoc-lua-engine] [13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
1139.34 s
[vector] forM_: OK (0.04s)
1139.34 s
[vector] +++ OK, passed 100 tests.
1139.36 s
[vector] imapM: OK
1139.36 s
[vector] +++ OK, passed 100 tests.
1139.40 s
[vector] imapM_: OK (0.05s)
1139.40 s
[vector] +++ OK, passed 100 tests.
1139.41 s
[vector] zipWith: OK
1139.41 s
[vector] +++ OK, passed 100 tests.
1139.43 s
[vector] zipWith3: OK
1139.44 s
[vector] +++ OK, passed 100 tests.
1139.44 s
[vector] izipWith: OK
1139.44 s
[vector] +++ OK, passed 100 tests.
1139.45 s
[vector] izipWith3: OK (0.02s)
1139.45 s
[vector] +++ OK, passed 100 tests.
1139.45 s
[vector] izipWithM: OK
1139.45 s
[vector] +++ OK, passed 100 tests.
1139.48 s
[vector] izipWithM_: OK (0.02s)
1139.48 s
[vector] +++ OK, passed 100 tests.
1139.48 s
[vector] zipWithM: OK
1139.48 s
[vector] +++ OK, passed 100 tests.
1139.51 s
[vector] zipWithM_: OK (0.03s)
1139.51 s
[vector] +++ OK, passed 100 tests.
1139.52 s
[vector] filter: OK
1139.52 s
[vector] +++ OK, passed 100 tests.
1139.54 s
[vector] ifilter: OK
1139.54 s
[vector] +++ OK, passed 100 tests.
1139.59 s
[vector] filterM: OK (0.07s)
1139.59 s
[vector] +++ OK, passed 100 tests.
1139.62 s
[vector] uniq: OK
1139.62 s
[vector] +++ OK, passed 100 tests.
1139.62 s
[vector] mapMaybe: OK (0.02s)
1139.62 s
[vector] +++ OK, passed 100 tests.
1139.63 s
[vector] imapMaybe: OK (0.01s)
1139.63 s
[vector] +++ OK, passed 100 tests.
1139.63 s
[vector] takeWhile: OK
1139.63 s
[vector] +++ OK, passed 100 tests.
1139.63 s
[vector] dropWhile: OK
1139.64 s
[vector] +++ OK, passed 100 tests.
1139.65 s
[vector] partition: OK
1139.66 s
[vector] +++ OK, passed 100 tests.
1139.66 s
[vector] partitionWith: OK
1139.66 s
[vector] +++ OK, passed 100 tests.
1139.66 s
[vector] span: OK
1139.66 s
[vector] +++ OK, passed 100 tests.
1139.67 s
[vector] break: OK
1139.67 s
[vector] +++ OK, passed 100 tests.
1139.67 s
[vector] spanR: OK
1139.67 s
[vector] +++ OK, passed 100 tests.
1139.68 s
[vector] breakR: OK
1139.68 s
[vector] +++ OK, passed 100 tests.
1139.68 s
[vector] groupBy: OK (0.01s)
1139.68 s
[vector] +++ OK, passed 100 tests.
1139.69 s
[vector] elem: OK
1139.69 s
[vector] +++ OK, passed 100 tests.
1139.69 s
[vector] notElem: OK
1139.69 s
[vector] +++ OK, passed 100 tests.
1139.69 s
[vector] find: OK
1139.69 s
[vector] +++ OK, passed 100 tests.
1139.69 s
[vector] findIndex: OK
1139.69 s
[vector] +++ OK, passed 100 tests.
1139.70 s
[vector] findIndexR: OK
1139.70 s
[vector] +++ OK, passed 100 tests.
1139.70 s
[vector] findIndices: OK
1139.70 s
[vector] +++ OK, passed 100 tests.
1139.70 s
[vector] elemIndex: OK
1139.70 s
[vector] +++ OK, passed 100 tests.
1139.70 s
[vector] elemIndices: OK
1139.71 s
[vector] +++ OK, passed 100 tests.
1139.72 s
[vector] foldl: OK (0.01s)
1139.72 s
[vector] +++ OK, passed 100 tests.
1139.72 s
[vector] foldl1: OK
1139.72 s
[vector] +++ OK, passed 100 tests; 18 discarded.
1139.73 s
[vector] foldl': OK
1139.74 s
[vector] +++ OK, passed 100 tests.
1139.74 s
[vector] foldl1': OK
1139.74 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1139.74 s
[vector] foldr: OK
1139.74 s
[vector] +++ OK, passed 100 tests.
1139.74 s
[vector] foldr1: OK
1139.75 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1139.76 s
[vector] foldr': OK
1139.76 s
[vector] +++ OK, passed 100 tests.
1139.76 s
[vector] foldr1': OK
1139.76 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1139.76 s
[vector] ifoldl: OK
1139.76 s
[vector] +++ OK, passed 100 tests.
1139.77 s
[vector] ifoldl': OK
1139.77 s
[vector] +++ OK, passed 100 tests.
1139.77 s
[vector] ifoldr: OK
1139.77 s
[vector] +++ OK, passed 100 tests.
1139.78 s
[vector] ifoldr': OK
1139.78 s
[vector] +++ OK, passed 100 tests.
1139.79 s
[vector] ifoldM: OK
1139.79 s
[vector] +++ OK, passed 100 tests.
1139.79 s
[vector] ifoldM': OK
1139.79 s
[vector] +++ OK, passed 100 tests.
1139.84 s
[vector] ifoldM_: OK (0.04s)
1139.94 s
[vector] +++ OK, passed 100 tests.
1139.94 s
[vector] ifoldM'_: OK (0.04s)
1139.94 s
[vector] +++ OK, passed 100 tests.
1139.94 s
[vector] all: OK
1139.94 s
[vector] +++ OK, passed 100 tests.
1139.94 s
[vector] any: OK
1139.94 s
[vector] +++ OK, passed 100 tests.
1139.94 s
[vector] prescanl: OK (0.01s)
1139.94 s
[vector] +++ OK, passed 100 tests.
1139.94 s
[vector] prescanl': OK (0.02s)
1139.94 s
[vector] +++ OK, passed 100 tests.
1139.94 s
[vector] postscanl: OK (0.01s)
1139.94 s
[vector] +++ OK, passed 100 tests.
1139.94 s
[vector] postscanl': OK (0.01s)
1139.94 s
[vector] +++ OK, passed 100 tests.
1139.95 s
[vector] scanl: OK
1139.95 s
[vector] +++ OK, passed 100 tests.
1139.95 s
[vector] scanl': OK
1139.95 s
[vector] +++ OK, passed 100 tests.
1139.95 s
[vector] scanl1: OK
1139.96 s
[vector] +++ OK, passed 100 tests.
1139.97 s
[vector] scanl1': OK
1139.98 s
[vector] +++ OK, passed 100 tests.
1139.98 s
[vector] iscanl: OK
1139.98 s
[vector] +++ OK, passed 100 tests.
1139.99 s
[vector] iscanl': OK
1139.99 s
[vector] +++ OK, passed 100 tests.
1139.99 s
[pandoc-lua-engine] [14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
1139.99 s
[pandoc-lua-engine] [15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
1139.99 s
[pandoc-lua-engine] [16 of 39] Compiling Text.Pandoc.Lua.Module.Template
1140.00 s
[vector] prescanr: OK
1140.00 s
[vector] +++ OK, passed 100 tests.
1140.00 s
[vector] prescanr': OK
1140.00 s
[vector] +++ OK, passed 100 tests.
1140.00 s
[vector] postscanr: OK
1140.00 s
[vector] +++ OK, passed 100 tests.
1140.00 s
[vector] postscanr': OK
1140.00 s
[vector] +++ OK, passed 100 tests.
1140.02 s
[vector] scanr: OK
1140.02 s
[vector] +++ OK, passed 100 tests.
1140.02 s
[vector] scanr': OK
1140.02 s
[vector] +++ OK, passed 100 tests.
1140.02 s
[vector] scanr1: OK
1140.02 s
[vector] +++ OK, passed 100 tests.
1140.04 s
[vector] scanr1': OK
1140.04 s
[vector] +++ OK, passed 100 tests.
1140.05 s
[vector] iscanr: OK
1140.05 s
[vector] +++ OK, passed 100 tests.
1140.05 s
[vector] iscanr': OK
1140.05 s
[vector] +++ OK, passed 100 tests.
1140.05 s
[vector] mut_read: OK
1140.05 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1140.06 s
[vector] mut_write: OK
1140.06 s
[vector] +++ OK, passed 100 tests; 15 discarded.
1140.06 s
[vector] mut_modify: OK
1140.06 s
[vector] +++ OK, passed 100 tests; 11 discarded.
1140.06 s
[vector] mut_generate: OK
1140.06 s
[vector] +++ OK, passed 100 tests.
1140.07 s
[vector] mut_generateM: OK (0.02s)
1140.07 s
[vector] +++ OK, passed 100 tests.
1140.14 s
[vector] mut_mapM_: OK (0.05s)
1140.14 s
[vector] +++ OK, passed 100 tests.
1140.18 s
[vector] mut_imapM_: OK (0.04s)
1140.18 s
[vector] +++ OK, passed 100 tests.
1140.20 s
[vector] mut_forM_: OK (0.03s)
1140.20 s
[vector] +++ OK, passed 100 tests.
1140.23 s
[vector] mut_iforM_: OK (0.03s)
1140.23 s
[vector] +++ OK, passed 100 tests.
1140.24 s
[vector] mut_foldr: OK
1140.24 s
[vector] +++ OK, passed 100 tests.
1140.24 s
[vector] mut_foldr': OK
1140.25 s
[vector] +++ OK, passed 100 tests.
1140.25 s
[pandoc-lua-engine] [17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
1140.25 s
[pandoc-lua-engine] [18 of 39] Compiling Text.Pandoc.Lua.Module.Format
1140.25 s
[pandoc-lua-engine] [19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
1140.25 s
[vector] mut_foldl: OK
1140.26 s
[vector] +++ OK, passed 100 tests.
1140.26 s
[vector] mut_foldl': OK
1140.26 s
[vector] +++ OK, passed 100 tests.
1140.26 s
[vector] mut_ifoldr: OK
1140.26 s
[vector] +++ OK, passed 100 tests.
1140.27 s
[vector] mut_ifoldr': OK
1140.27 s
[vector] +++ OK, passed 100 tests.
1140.27 s
[vector] mut_ifoldl: OK
1140.27 s
[vector] +++ OK, passed 100 tests.
1140.28 s
[vector] mut_ifoldl': OK
1140.28 s
[vector] +++ OK, passed 100 tests.
1140.28 s
[vector] mut_foldM: OK
1140.29 s
[vector] +++ OK, passed 100 tests.
1140.30 s
[vector] mut_foldM': OK
1140.30 s
[vector] +++ OK, passed 100 tests.
1140.30 s
[vector] mut_foldrM: OK
1140.30 s
[vector] +++ OK, passed 100 tests.
1140.30 s
[vector] mut_foldrM': OK
1140.30 s
[vector] +++ OK, passed 100 tests.
1140.31 s
[vector] mut_ifoldM: OK
1140.31 s
[vector] +++ OK, passed 100 tests.
1140.32 s
[vector] mut_ifoldM': OK
1140.32 s
[vector] +++ OK, passed 100 tests.
1140.32 s
[vector] mut_ifoldrM: OK
1140.32 s
[vector] +++ OK, passed 100 tests.
1140.33 s
[vector] mut_ifoldrM': OK
1140.33 s
[vector] +++ OK, passed 100 tests.
1140.33 s
[vector] compare: OK
1140.33 s
[vector] +++ OK, passed 100 tests.
1140.33 s
[vector] maximum: OK
1140.33 s
[vector] +++ OK, passed 100 tests; 23 discarded.
1140.33 s
[vector] minimum: OK
1140.33 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1140.33 s
[vector] minIndex: OK
1140.33 s
[vector] +++ OK, passed 100 tests; 20 discarded.
1140.33 s
[vector] maxIndex: OK
1140.33 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1140.33 s
[vector] maximumBy: OK
1140.33 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1140.33 s
[vector] minimumBy: OK
1140.33 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1140.33 s
[vector] maximumOn: OK
1140.33 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1140.33 s
[vector] minimumOn: OK
1140.33 s
[vector] +++ OK, passed 100 tests; 19 discarded.
1140.33 s
[vector] maxIndexBy: OK
1140.33 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1140.33 s
[vector] minIndexBy: OK
1140.33 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1140.33 s
[vector] ListFirstMaxIndexWins: OK
1140.33 s
[vector] +++ OK, passed 100 tests; 13 discarded.
1140.34 s
[vector] FalseListFirstMaxIndexWins: OK
1140.34 s
[vector] +++ OK, failed as expected. (after 1 test):
1140.34 s
[vector] Exception:
1140.34 s
[vector] Prelude.foldr1: empty list
1140.34 s
[vector] CallStack (from HasCallStack):
1140.34 s
[vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
1140.34 s
[vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
1140.34 s
[vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
1140.34 s
[vector] []
1140.34 s
[vector] zip: OK
1140.34 s
[vector] +++ OK, passed 100 tests.
1140.35 s
[vector] zip3: OK
1140.35 s
[vector] +++ OK, passed 100 tests.
1140.35 s
[vector] unzip: OK
1140.35 s
[vector] +++ OK, passed 100 tests.
1140.35 s
[vector] unzip3: OK
1140.35 s
[vector] +++ OK, passed 100 tests.
1140.36 s
[vector] indexed: OK
1140.36 s
[vector] +++ OK, passed 100 tests.
1140.36 s
[vector] update: OK
1140.36 s
[vector] +++ OK, passed 100 tests.
1140.36 s
[vector] mempty: OK
1140.36 s
[vector] +++ OK, passed 100 tests.
1140.36 s
[vector] mappend: OK
1140.38 s
[vector] +++ OK, passed 100 tests.
1140.42 s
[vector] mconcat: OK (0.05s)
1140.42 s
[vector] +++ OK, passed 100 tests.
1140.42 s
[vector] glength: OK
1140.42 s
[vector] +++ OK, passed 100 tests.
1140.42 s
[vector] unstream
1140.42 s
[vector] unstream == vunstream (exact): OK
1140.42 s
[vector] +++ OK, passed 100 tests.
1140.42 s
[vector] unstream == vunstream (unknown): OK
1140.42 s
[vector] +++ OK, passed 100 tests.
1140.42 s
[vector] unstreamR ~= vunstream (exact): OK
1140.42 s
[vector] +++ OK, passed 100 tests.
1140.42 s
[vector] unstreamR ~= vunstream (unknown): OK
1140.42 s
[vector] +++ OK, passed 100 tests.
1140.42 s
[vector] Data.Vector.Storable.Vector Alignment
1140.42 s
[vector] Aligned Double: OK
1140.42 s
[vector] Aligned Int: OK
1140.42 s
[vector] Regression tests
1140.42 s
[vector] enumFromTo crash #188
1140.42 s
[vector] Word8: OK
1140.42 s
[vector] Word16: OK
1140.42 s
[vector] Word32: OK
1140.42 s
[vector] Word64: OK
1140.42 s
[vector] Word: OK
1140.42 s
[vector] Int8: OK
1140.42 s
[vector] Int16: OK
1140.42 s
[vector] Int32: OK
1140.42 s
[vector] Int64: OK
1140.42 s
[vector] Int: OK
1140.42 s
[vector] Char: OK
1140.42 s
[vector] Negative tests
1140.42 s
[vector] slice out of bounds #257
1140.42 s
[vector] Boxed
1140.42 s
[vector] Negative ix: OK
1140.42 s
[vector] Negative size: OK
1140.42 s
[vector] Negative ix and size: OK
1140.42 s
[vector] Too large ix: OK
1140.42 s
[vector] Too large size: OK
1140.42 s
[vector] Too large ix and size: OK
1140.42 s
[vector] Overflow: OK
1140.42 s
[vector] OutOfMemory: OK
1140.42 s
[vector] Primitive
1140.42 s
[vector] Negative ix: OK
1140.42 s
[vector] Negative size: OK
1140.42 s
[vector] Negative ix and size: OK
1140.42 s
[vector] Too large ix: OK
1140.42 s
[vector] Too large size: OK
1140.42 s
[vector] Too large ix and size: OK
1140.42 s
[vector] Overflow: OK
1140.42 s
[vector] OutOfMemory: OK
1140.42 s
[vector] Storable
1140.42 s
[vector] Negative ix: OK
1140.42 s
[vector] Negative size: OK
1140.42 s
[vector] Negative ix and size: OK
1140.42 s
[vector] Too large ix: OK
1140.42 s
[vector] Too large size: OK
1140.42 s
[vector] Too large ix and size: OK
1140.42 s
[vector] Overflow: OK
1140.42 s
[vector] OutOfMemory: OK
1140.42 s
[vector] Unboxed
1140.42 s
[vector] Negative ix: OK
1140.42 s
[vector] Negative size: OK
1140.42 s
[vector] Negative ix and size: OK
1140.42 s
[vector] Too large ix: OK
1140.42 s
[vector] Too large size: OK
1140.42 s
[vector] Too large ix and size: OK
1140.42 s
[vector] Overflow: OK
1140.42 s
[vector] OutOfMemory: OK
1140.42 s
[vector] take #282
1140.42 s
[vector] Boxed: OK
1140.42 s
[vector] Primitive: OK
1140.42 s
[vector] Storable: OK
1140.42 s
[vector] Unboxed: OK
1140.42 s
[vector] Data.Vector
1140.42 s
[vector] MonadFix: OK
1140.42 s
[vector] toFromArray: OK
1140.42 s
[vector] toFromArraySlice: OK
1140.42 s
[vector] toFromArraySliceUnsafe: OK
1140.42 s
[vector] toFromMutableArray: OK
1140.42 s
[vector] Data.Vector.Mutable (Move): OK
1140.42 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1140.43 s
[vector] Data.Vector.Primitive.Mutable (Move): OK
1140.43 s
[vector] +++ OK, passed 100 tests; 17 discarded.
1140.44 s
[vector] Data.Vector.Unboxed.Mutable (Move): OK (0.01s)
1140.44 s
[vector] +++ OK, passed 100 tests; 16 discarded.
1140.44 s
[vector] Data.Vector.Storable.Mutable (Move): OK
1140.44 s
[vector] +++ OK, passed 100 tests; 14 discarded.
1140.44 s
[vector] Data.Vector.Generic.Mutable (nextPermutation): OK
1140.45 s
[vector] +++ OK, passed 100 tests.
1140.45 s
[vector] Data.Vector.Generic.Mutable (prevPermutation): OK
1140.45 s
[vector] +++ OK, passed 100 tests.
1140.45 s
[vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
1140.45 s
[vector] +++ OK, passed 100 tests.
1140.45 s
[vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
1140.45 s
[vector] +++ OK, passed 100 tests.
1140.45 s
[vector]
1140.45 s
[vector] All 2808 tests passed (15.09s)
1140.45 s
[vector] Test suite vector-tests-O2: PASS
1140.45 s
[vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
1140.45 s
[vector] 2 of 2 test suites (2 of 2 test cases) passed.
1140.46 s
[vector] checkPhase completed in 2 minutes 14 seconds
1140.46 s
[vector] Phase: haddockPhase
1140.47 s
[vector] Phase: installPhase
1140.55 s
[vector] Installing library in /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
1141.00 s
[pandoc-lua-engine] [20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
1141.44 s
[vector] Installing internal library benchmarks-O2 in /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2
1141.80 s
[vector] Phase: fixupPhase
1141.83 s
[vector] shrinking RPATHs of ELF executables and libraries in /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0
1141.86 s
[vector] shrinking /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSvector-0.13.2.0-91VeWMtvsgACG7wykjdBs-ghc9.8.4.so
1141.93 s
[vector] shrinking /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSvector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2-ghc9.8.4.so
1141.93 s
[pandoc-lua-engine] [21 of 39] Compiling Text.Pandoc.Lua.Module.Image
1141.93 s
[pandoc-lua-engine] [22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
1141.93 s
[pandoc-lua-engine] [23 of 39] Compiling Text.Pandoc.Lua.Orphans
1141.93 s
[pandoc-lua-engine] [24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
1141.93 s
[pandoc-lua-engine] [25 of 39] Compiling Text.Pandoc.Lua.Global
1141.93 s
[pandoc-lua-engine] [26 of 39] Compiling Text.Pandoc.Lua.Filter
1141.93 s
[pandoc-lua-engine] [27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
1141.93 s
[pandoc-lua-engine] [28 of 39] Compiling Text.Pandoc.Lua.SourcePos
1141.93 s
[pandoc-lua-engine] [29 of 39] Compiling Text.Pandoc.Lua.Module.Log
1141.93 s
[pandoc-lua-engine] [30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
1141.93 s
[pandoc-lua-engine] [31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
1141.94 s
[vector] checking for references to /build/ in /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0...
1142.00 s
[vector] patching script interpreter paths in /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0
1142.01 s
[vector] stripping (with command strip and flags -S -p) in /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/lib
1142.94 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0
1143.50 s
[post-build-hook] Pushing 1 paths (97 are already present) using zstd to cache sellout ⏳
1143.50 s
[post-build-hook]
1143.86 s
[post-build-hook] Pushing /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0 (57.06 MiB)
1145.85 s
[post-build-hook]
1145.85 s
[post-build-hook] All done.
1145.88 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0
1145.93 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1145.95 s
[post-build-hook] copying 1 paths...
1145.95 s
[post-build-hook] copying path '/nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
1162.80 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1162.99 s
[post-build-hook] copying 4 paths...
1163.00 s
[post-build-hook] copying path '/nix/store/n2cbd4lsyrwj7qssi6jfnabwy3qy5ana-inspection-testing-0.6.2.drv' to 'https://cache.nix-ci.com'...
1163.00 s
[post-build-hook] copying path '/nix/store/ni9fzsm6pzxihz508qalbk4w9ypb893w-vector-stream-0.1.0.1.drv' to 'https://cache.nix-ci.com'...
1163.14 s
[post-build-hook] copying path '/nix/store/327glsmw6jyj7vgl6p2zy36jbpcl4fnb-tasty-inspection-testing-0.2.1.drv' to 'https://cache.nix-ci.com'...
1163.27 s
[post-build-hook] copying path '/nix/store/3i2mbwx02xyqz18n75bfjn208j99fi86-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
1163.43 s
Progress: 35 of 50 built (2 building), 786 of 786 downloaded from cache
1163.52 s
Building nothunks
1163.52 s
[pandoc-lua-engine] [32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
1163.52 s
[pandoc-lua-engine] [33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
1163.52 s
[pandoc-lua-engine] [34 of 39] Compiling Text.Pandoc.Lua.Module
1163.52 s
[pandoc-lua-engine] [35 of 39] Compiling Text.Pandoc.Lua.Init
1163.52 s
[pandoc-lua-engine] [36 of 39] Compiling Text.Pandoc.Lua.Run
1163.52 s
[pandoc-lua-engine] [37 of 39] Compiling Text.Pandoc.Lua.Custom
1163.52 s
[pandoc-lua-engine] [38 of 39] Compiling Text.Pandoc.Lua.Engine
1163.52 s
[pandoc-lua-engine] [39 of 39] Compiling Text.Pandoc.Lua
1163.52 s
[pandoc-lua-engine] Preprocessing test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
1163.52 s
[pandoc-lua-engine] Building test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
1163.52 s
[pandoc-lua-engine] [1 of 5] Compiling Tests.Lua
1163.52 s
[pandoc-lua-engine] [2 of 5] Compiling Tests.Lua.Module
1163.52 s
[pandoc-lua-engine] [3 of 5] Compiling Tests.Lua.Reader
1163.52 s
[pandoc-lua-engine] [4 of 5] Compiling Tests.Lua.Writer
1163.52 s
[pandoc-lua-engine] [5 of 5] Compiling Main
1163.52 s
[pandoc-lua-engine] [6 of 6] Linking dist/build/test-pandoc-lua-engine/test-pandoc-lua-engine
1163.52 s
[pandoc-server] Phase: checkPhase
1163.52 s
[pandoc-server] Package has no test suites.
1163.52 s
[pandoc-server] Phase: haddockPhase
1163.52 s
[pandoc-server] Preprocessing library for pandoc-server-0.1.0.11...
1163.52 s
[pandoc-server] Running Haddock on library for pandoc-server-0.1.0.11...
1163.52 s
[pandoc-server] Warning: The documentation for the following packages are not installed. No
1163.52 s
[pandoc-server] links will be generated to these packages: attoparsec-0.14.4,
1163.52 s
[pandoc-server] attoparsec-0.14.4, libyaml-clib-0.2.5, pandoc-3.7.0.2, pandoc-3.7.0.2,
1163.52 s
[pandoc-server] vector-0.13.2.0
1163.52 s
[pandoc-server] [1 of 1] Compiling Text.Pandoc.Server
1163.52 s
[pandoc-server] Haddock coverage:
1163.52 s
[pandoc-server] 0% ( 0 / 7) in 'Text.Pandoc.Server'
1163.52 s
[pandoc-server] Missing documentation for:
1163.52 s
[pandoc-server] Module header
1163.52 s
[pandoc-server] app (src/Text/Pandoc/Server.hs:200)
1163.52 s
[pandoc-server] API (src/Text/Pandoc/Server.hs:186)
1163.52 s
[pandoc-server] ServerOpts (src/Text/Pandoc/Server.hs:55)
1163.52 s
[pandoc-server] Params (src/Text/Pandoc/Server.hs:125)
1163.52 s
[pandoc-server] Blob (src/Text/Pandoc/Server.hs:112)
1163.52 s
[pandoc-server] parseServerOptsFromArgs (src/Text/Pandoc/Server.hs:99)
1163.52 s
[pandoc-server] Warning: Text.Pandoc.Server: could not find link destinations for:
1163.52 s
[pandoc-server] - Text.Pandoc.App.Opt.Opt
1163.52 s
[pandoc-server] - Text.Pandoc.Server.Output
1163.52 s
[pandoc-server] Documentation created: dist/doc/html/pandoc-server/,
1163.52 s
[pandoc-server] dist/doc/html/pandoc-server/pandoc-server.txt
1163.52 s
[pandoc-server] Phase: installPhase
1163.52 s
[pandoc-server] Installing library in /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/pandoc-server-0.1.0.11-2p8ECUQZARt9psWxK5ycoq
1163.52 s
[pandoc-server] Phase: fixupPhase
1163.52 s
[pandoc-server] shrinking RPATHs of ELF executables and libraries in /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11
1163.52 s
[pandoc-server] shrinking /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSpandoc-server-0.1.0.11-2p8ECUQZARt9psWxK5ycoq-ghc9.10.3.so
1163.52 s
[pandoc-server] checking for references to /build/ in /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11...
1163.52 s
[pandoc-server] patching script interpreter paths in /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11
1163.52 s
[pandoc-server] stripping (with command strip and flags -S -p) in /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11/lib
1163.52 s
[pandoc-server] shrinking RPATHs of ELF executables and libraries in /nix/store/3j1008pz7rfr2k0141d78adq5awkm1r7-pandoc-server-0.1.0.11-doc
1163.52 s
[pandoc-server] checking for references to /build/ in /nix/store/3j1008pz7rfr2k0141d78adq5awkm1r7-pandoc-server-0.1.0.11-doc...
1163.52 s
[pandoc-server] patching script interpreter paths in /nix/store/3j1008pz7rfr2k0141d78adq5awkm1r7-pandoc-server-0.1.0.11-doc
1163.73 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/3j1008pz7rfr2k0141d78adq5awkm1r7-pandoc-server-0.1.0.11-doc /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11
1164.26 s
[post-build-hook] Pushing 2 paths (469 are already present) using zstd to cache sellout ⏳
1164.26 s
[post-build-hook]
1164.68 s
[post-build-hook] Pushing /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11 (2.86 MiB)
1164.69 s
[post-build-hook] Pushing /nix/store/3j1008pz7rfr2k0141d78adq5awkm1r7-pandoc-server-0.1.0.11-doc (444.75 KiB)
1165.71 s
[post-build-hook]
1165.71 s
[post-build-hook] All done.
1165.72 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/3j1008pz7rfr2k0141d78adq5awkm1r7-pandoc-server-0.1.0.11-doc /nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11
1165.76 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1165.92 s
[post-build-hook] copying 2 paths...
1165.92 s
[post-build-hook] copying path '/nix/store/3j1008pz7rfr2k0141d78adq5awkm1r7-pandoc-server-0.1.0.11-doc' to 'https://cache.nix-ci.com'...
1166.15 s
[post-build-hook] copying path '/nix/store/nv0pp69g48m74j1jkpjgffvjdqnsgp8v-pandoc-server-0.1.0.11' to 'https://cache.nix-ci.com'...
1166.94 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1167.13 s
[post-build-hook] copying 1 paths...
1167.13 s
[post-build-hook] copying path '/nix/store/d0qkrjn8zj2lg5ybzyrb8xrby2c4asc0-pandoc-server-0.1.0.11.drv' to 'https://cache.nix-ci.com'...
1167.27 s
Progress: 36 of 50 built (2 building), 786 of 786 downloaded from cache
1167.27 s
[nothunks] Phase: setupCompilerEnvironmentPhase
1167.27 s
[nothunks] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
1167.27 s
[nothunks] Phase: unpackPhase
1167.27 s
[nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
1167.27 s
[nothunks] source root is nothunks-0.3.1
1167.27 s
[nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
1167.27 s
[nothunks] Phase: patchPhase
1167.27 s
[nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
1167.27 s
[nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
1167.27 s
[nothunks] Phase: compileBuildDriverPhase
1167.27 s
[nothunks] setupCompileFlags: -package-db=/build/tmp.wUNM8EYF8n/setup-package.conf.d -threaded
1167.27 s
[nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.wUNM8EYF8n/Main.o )
1167.27 s
[nothunks] [2 of 2] Linking Setup
1167.27 s
[nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
1167.27 s
[nothunks] Phase: configurePhase
1167.27 s
[nothunks] configureFlags: --verbose --prefix=/nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.wUNM8EYF8n/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
1167.27 s
[nothunks] Using Parsec parser
1167.27 s
[nothunks] Configuring nothunks-0.3.1...
1167.27 s
[nothunks] Flags chosen: bytestring=True, text=True, vector=True
1167.27 s
[nothunks] Dependency base: using base-4.19.2.0
1167.27 s
[nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.1.0
1167.27 s
[nothunks] Dependency containers: using containers-0.6.8
1167.27 s
[nothunks] Dependency ghc-heap: using ghc-heap-9.8.4
1167.27 s
[nothunks] Dependency stm: using stm-2.5.3.1
1167.27 s
[nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.1
1167.27 s
[nothunks] Dependency time: using time-1.12.2
1167.27 s
[nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
1167.27 s
[nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
1167.27 s
[nothunks] Dependency base: using base-4.19.2.0
1167.27 s
[nothunks] Dependency containers: using containers-0.6.8
1167.27 s
[nothunks] Dependency ghc-prim: using ghc-prim-0.11.0
1167.27 s
[nothunks] Dependency hedgehog: using hedgehog-1.5
1167.27 s
[nothunks] Dependency nothunks: using nothunks-0.3.1
1167.27 s
[nothunks] Dependency random: using random-1.2.1.3
1167.27 s
[nothunks] Dependency stm: using stm-2.5.3.1
1167.27 s
[nothunks] Dependency tasty: using tasty-1.5.3
1167.27 s
[nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
1167.27 s
[nothunks] Source component graph:
1167.27 s
[nothunks] component lib
1167.27 s
[nothunks] component test:nothunks-test dependency lib
1167.27 s
[nothunks] Configured component graph:
1167.27 s
[nothunks] component nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
1167.27 s
[nothunks] include base-4.19.2.0-a4d2
1167.27 s
[nothunks] include bytestring-0.12.1.0-2e42
1167.27 s
[nothunks] include containers-0.6.8-1373
1167.27 s
[nothunks] include ghc-heap-9.8.4-be73
1167.27 s
[nothunks] include stm-2.5.3.1-cf40
1167.27 s
[nothunks] include text-2.1.1-dac7
1167.27 s
[nothunks] include time-1.12.2-84c3
1167.27 s
[nothunks] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
1167.27 s
[nothunks] include wherefrom-compat-0.1.1.1-KT44rjpMLEj5X9zrMJkRBr
1167.27 s
[nothunks] component nothunks-0.3.1-CxzC0Tp1uXIAiLM3u0LBsh-nothunks-test
1167.27 s
[nothunks] include base-4.19.2.0-a4d2
1167.27 s
[nothunks] include containers-0.6.8-1373
1167.27 s
[nothunks] include ghc-prim-0.11.0-c959
1167.27 s
[pandoc-lua-engine] buildPhase completed in 35 seconds
1167.27 s
[pandoc-lua-engine] Phase: checkPhase
1167.27 s
[pandoc-lua-engine] Running 1 test suites...
1167.27 s
[pandoc-lua-engine] Test suite test-pandoc-lua-engine: RUNNING...
1167.27 s
[pandoc-lua-engine] pandoc Lua engine
1167.27 s
[pandoc-lua-engine] Lua filters
1167.27 s
[pandoc-lua-engine] macro expansion via filter: OK
1167.27 s
[pandoc-lua-engine] convert all plains to paras: OK
1167.27 s
[pandoc-lua-engine] convert display math to inline math: OK (0.02s)
1167.27 s
[pandoc-lua-engine] make hello world document: OK
1167.27 s
[pandoc-lua-engine] implicit doc filter: OK
1167.27 s
[pandoc-lua-engine] parse raw markdown blocks: OK
1167.27 s
[pandoc-lua-engine] allow shorthand functions for quote types: OK
1167.27 s
[pandoc-lua-engine] Count inlines via metatable catch-all: OK
1167.27 s
[pandoc-lua-engine] Count blocks via Block-specific catch-all: OK
1167.27 s
[pandoc-lua-engine] Smart constructors: OK
1167.27 s
[pandoc-lua-engine] Convert header upper case: OK
1167.27 s
[pandoc-lua-engine] Attribute lists are convenient to use: OK
1167.27 s
[pandoc-lua-engine] Filter list of inlines: OK
1167.27 s
[pandoc-lua-engine] Filter list of blocks: OK
1167.27 s
[pandoc-lua-engine] Filter Meta: OK
1167.27 s
[pandoc-lua-engine] Script filename is set: OK
1167.27 s
[pandoc-lua-engine] Pandoc version is set: OK
1167.27 s
[pandoc-lua-engine] Pandoc types version is set: OK
1167.27 s
[pandoc-lua-engine] require file: OK
1167.27 s
[pandoc-lua-engine] Allow singleton inline in constructors: OK
1167.27 s
[pandoc-lua-engine] Elements with Attr have `attr` accessor: OK
1167.27 s
[pandoc-lua-engine] module `pandoc.system` is present: OK
1167.27 s
[pandoc-lua-engine] global modules
1167.27 s
[pandoc-lua-engine] module 'lpeg' is loaded into a global: OK
1167.27 s
[pandoc-lua-engine] module 're' is loaded into a global: OK
1167.27 s
[pandoc-lua-engine] module 'lpeg' is available via `require`: OK
1167.27 s
[pandoc-lua-engine] module 're' is available via `require`: OK
1167.27 s
[pandoc-lua-engine] informative error messages: OK
1167.27 s
[pandoc-lua-engine] Lua modules
1167.27 s
[pandoc-lua-engine] pandoc: OK (0.01s)
1167.27 s
[pandoc-lua-engine] +++ Success: 79 Lua tests passed
1167.27 s
[pandoc-lua-engine] pandoc.List: OK
1167.27 s
[pandoc-lua-engine] +++ Success: 22 Lua tests passed
1167.27 s
[pandoc-lua-engine] pandoc.format: OK
1167.27 s
[pandoc-lua-engine] +++ Success: 3 Lua tests passed
1167.27 s
[pandoc-lua-engine] pandoc.image: OK
1167.27 s
[pandoc-lua-engine] +++ Success: 6 Lua tests passed
1167.27 s
[pandoc-lua-engine] pandoc.json: OK
1167.27 s
[pandoc-lua-engine] +++ Success: 21 Lua tests passed
1167.27 s
[pandoc-lua-engine] pandoc.log: OK
1167.27 s
[pandoc-lua-engine] +++ Success: 8 Lua tests passed
1167.27 s
[pandoc-lua-engine] pandoc.mediabag: OK
1167.27 s
[pandoc-lua-engine] +++ Success: 9 Lua tests passed
1167.27 s
[pandoc-lua-engine] pandoc.path: OK
1167.27 s
[pandoc-lua-engine] +++ Success: 5 Lua tests passed
1167.27 s
[pandoc-lua-engine] pandoc.structure: OK
1167.27 s
[pandoc-lua-engine] +++ Success: 11 Lua tests passed
1167.27 s
[pandoc-lua-engine] pandoc.template: OK (0.02s)
1167.27 s
[pandoc-lua-engine] +++ Success: 16 Lua tests passed
1167.27 s
[pandoc-lua-engine] pandoc.text: OK
1167.27 s
[pandoc-lua-engine] +++ Success: 9 Lua tests passed
1167.27 s
[pandoc-lua-engine] pandoc.types: OK
1167.27 s
[pandoc-lua-engine] +++ Success: 13 Lua tests passed
1167.27 s
[pandoc-lua-engine] pandoc.utils: OK
1167.27 s
[pandoc-lua-engine] +++ Success: 45 Lua tests passed
1167.27 s
[pandoc-lua-engine] globals: OK (0.02s)
1167.27 s
[pandoc-lua-engine] +++ Success: 42 Lua tests passed
1167.27 s
[pandoc-lua-engine] Custom writers
1167.27 s
[pandoc-lua-engine] default testsuite: OK (0.07s)
1167.27 s
[pandoc-lua-engine] tables testsuite: OK (0.03s)
1167.27 s
[pandoc-lua-engine] bytestring writer: OK
1167.27 s
[pandoc-lua-engine] template: OK
1167.27 s
[pandoc-lua-engine] preset extensions: OK
1167.27 s
[pandoc-lua-engine] modified extensions: OK
1167.27 s
[pandoc-lua-engine] Custom readers
1167.27 s
[pandoc-lua-engine] read binary to code block: OK
1167.27 s
[pandoc-lua-engine]
1167.27 s
[pandoc-lua-engine] All 48 tests passed (0.29s)
1167.27 s
[pandoc-lua-engine] Test suite test-pandoc-lua-engine: PASS
1167.27 s
[pandoc-lua-engine] Test suite logged to:
1167.27 s
[pandoc-lua-engine] dist/test/pandoc-lua-engine-0.4.3-test-pandoc-lua-engine.log
1167.27 s
[pandoc-lua-engine] 1 of 1 test suites (1 of 1 test cases) passed.
1167.27 s
[pandoc-lua-engine] Phase: haddockPhase
1167.27 s
[pandoc-lua-engine] Preprocessing library for pandoc-lua-engine-0.4.3...
1167.27 s
[pandoc-lua-engine] Running Haddock on library for pandoc-lua-engine-0.4.3...
1167.28 s
[pandoc-lua-engine] Warning: The documentation for the following packages are not installed. No
1167.28 s
[pandoc-lua-engine] links will be generated to these packages: attoparsec-0.14.4,
1167.28 s
[pandoc-lua-engine] attoparsec-0.14.4, libyaml-clib-0.2.5, pandoc-3.7.0.2, pandoc-3.7.0.2,
1167.28 s
[pandoc-lua-engine] vector-0.13.2.0
1167.28 s
[pandoc-lua-engine] [ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
1167.28 s
[pandoc-lua-engine] [ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
1167.28 s
[nothunks] include hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
1167.28 s
[nothunks] include nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
1167.28 s
[nothunks] include random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
1167.28 s
[nothunks] include stm-2.5.3.1-cf40
1167.28 s
[nothunks] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
1167.28 s
[nothunks] include tasty-hedgehog-1.4.0.2-14erXFMVRESHTcD2MA1X1Y
1167.28 s
[nothunks] Linked component graph:
1167.28 s
[nothunks] unit nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
1167.28 s
[nothunks] include base-4.19.2.0-a4d2
1167.28 s
[nothunks] include bytestring-0.12.1.0-2e42
1167.28 s
[nothunks] include containers-0.6.8-1373
1167.28 s
[nothunks] include ghc-heap-9.8.4-be73
1167.28 s
[nothunks] include stm-2.5.3.1-cf40
1167.28 s
[nothunks] include text-2.1.1-dac7
1167.28 s
[nothunks] include time-1.12.2-84c3
1167.28 s
[nothunks] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
1167.28 s
[nothunks] include wherefrom-compat-0.1.1.1-KT44rjpMLEj5X9zrMJkRBr
1167.28 s
[nothunks] NoThunks.Class=nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1:NoThunks.Class
1167.28 s
[nothunks] unit nothunks-0.3.1-CxzC0Tp1uXIAiLM3u0LBsh-nothunks-test
1167.28 s
[nothunks] include base-4.19.2.0-a4d2
1167.28 s
[nothunks] include containers-0.6.8-1373
1167.28 s
[nothunks] include ghc-prim-0.11.0-c959
1167.28 s
[nothunks] include hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
1167.28 s
[nothunks] include nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
1167.28 s
[nothunks] include random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
1167.28 s
[nothunks] include stm-2.5.3.1-cf40
1167.28 s
[nothunks] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
1167.28 s
[nothunks] include tasty-hedgehog-1.4.0.2-14erXFMVRESHTcD2MA1X1Y
1167.28 s
[nothunks] Ready component graph:
1167.28 s
[nothunks] definite nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
1167.28 s
[nothunks] depends base-4.19.2.0-a4d2
1167.28 s
[nothunks] depends bytestring-0.12.1.0-2e42
1167.28 s
[nothunks] depends containers-0.6.8-1373
1167.28 s
[nothunks] depends ghc-heap-9.8.4-be73
1167.28 s
[nothunks] depends stm-2.5.3.1-cf40
1167.28 s
[nothunks] depends text-2.1.1-dac7
1167.28 s
[nothunks] depends time-1.12.2-84c3
1167.28 s
[nothunks] depends vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
1167.28 s
[nothunks] depends wherefrom-compat-0.1.1.1-KT44rjpMLEj5X9zrMJkRBr
1167.28 s
[nothunks] definite nothunks-0.3.1-CxzC0Tp1uXIAiLM3u0LBsh-nothunks-test
1167.28 s
[nothunks] depends base-4.19.2.0-a4d2
1167.28 s
[nothunks] depends containers-0.6.8-1373
1167.28 s
[nothunks] depends ghc-prim-0.11.0-c959
1167.28 s
[nothunks] depends hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
1167.28 s
[nothunks] depends nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
1167.28 s
[nothunks] depends random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
1167.28 s
[nothunks] depends stm-2.5.3.1-cf40
1167.28 s
[nothunks] depends tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
1167.28 s
[nothunks] depends tasty-hedgehog-1.4.0.2-14erXFMVRESHTcD2MA1X1Y
1167.28 s
[nothunks] Using Cabal-3.10.3.0 compiled by ghc-9.8
1167.28 s
[nothunks] Using compiler: ghc-9.8.4
1167.28 s
[nothunks] Using install prefix:
1167.28 s
[nothunks] /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1
1167.28 s
[nothunks] Executables installed in:
1167.28 s
[nothunks] /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/bin
1167.28 s
[nothunks] Libraries installed in:
1167.28 s
[nothunks] /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
1167.28 s
[nothunks] Dynamic Libraries installed in:
1167.28 s
[nothunks] /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
1167.28 s
[nothunks] Private executables installed in:
1167.28 s
[nothunks] /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.8.4/nothunks-0.3.1
1167.28 s
[nothunks] Data files installed in:
1167.28 s
[nothunks] /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/share/x86_64-linux-ghc-9.8.4/nothunks-0.3.1
1167.28 s
[nothunks] Documentation installed in:
1167.28 s
[nothunks] /nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
1167.28 s
[nothunks] Configuration files installed in:
1167.28 s
[nothunks] /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/etc
1167.28 s
[nothunks] No alex found
1167.28 s
[nothunks] Using ar found on system at:
1167.28 s
[nothunks] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
1167.28 s
[nothunks] No c2hs found
1167.28 s
[nothunks] No cpphs found
1167.28 s
[nothunks] No doctest found
1167.28 s
[nothunks] Using gcc version 14.3.0 given by user at:
1167.28 s
[nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
1167.28 s
[nothunks] Using ghc version 9.8.4 found on system at:
1167.28 s
[nothunks] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
1167.28 s
[nothunks] Using ghc-pkg version 9.8.4 found on system at:
1167.28 s
[nothunks] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
1167.28 s
[nothunks] No ghcjs found
1167.28 s
[nothunks] No ghcjs-pkg found
1167.28 s
[nothunks] No greencard found
1167.28 s
[nothunks] Using haddock version 2.30.0 found on system at:
1167.28 s
[nothunks] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
1167.28 s
[nothunks] No happy found
1167.28 s
[nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
1167.28 s
[nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1167.28 s
[nothunks] No hmake found
1167.28 s
[pandoc-lua-engine] [ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
1167.28 s
[pandoc-lua-engine] [ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
1167.28 s
[pandoc-lua-engine] [ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
1167.28 s
[pandoc-lua-engine] [ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
1167.28 s
[pandoc-lua-engine] [ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
1167.28 s
[pandoc-lua-engine] [ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
1167.28 s
[pandoc-lua-engine] [ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
1167.28 s
[pandoc-lua-engine] [10 of 39] Compiling Text.Pandoc.Lua.PandocLua
1167.28 s
[pandoc-lua-engine] [11 of 39] Compiling Text.Pandoc.Lua.Module.Types
1167.28 s
[pandoc-lua-engine] [12 of 39] Compiling Text.Pandoc.Lua.Module.Text
1167.28 s
[pandoc-lua-engine] [13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
1167.28 s
[pandoc-lua-engine] [14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
1167.28 s
[pandoc-lua-engine] [15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
1167.28 s
[pandoc-lua-engine] [16 of 39] Compiling Text.Pandoc.Lua.Module.Template
1167.28 s
[pandoc-lua-engine] [17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
1167.28 s
[pandoc-lua-engine] [18 of 39] Compiling Text.Pandoc.Lua.Module.Format
1167.28 s
[pandoc-lua-engine] [19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
1167.28 s
[pandoc-lua-engine] [20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
1167.28 s
[pandoc-lua-engine] [21 of 39] Compiling Text.Pandoc.Lua.Module.Image
1167.28 s
[pandoc-lua-engine] [22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
1167.28 s
[pandoc-lua-engine] [23 of 39] Compiling Text.Pandoc.Lua.Orphans
1167.28 s
[pandoc-lua-engine] [24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
1167.28 s
[pandoc-lua-engine] [25 of 39] Compiling Text.Pandoc.Lua.Global
1167.28 s
[pandoc-lua-engine] [26 of 39] Compiling Text.Pandoc.Lua.Filter
1167.28 s
[pandoc-lua-engine] [27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
1167.28 s
[pandoc-lua-engine] [28 of 39] Compiling Text.Pandoc.Lua.SourcePos
1167.28 s
[pandoc-lua-engine] [29 of 39] Compiling Text.Pandoc.Lua.Module.Log
1167.28 s
[pandoc-lua-engine] [30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
1167.28 s
[pandoc-lua-engine] [31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
1167.28 s
[nothunks] Using hpc version 0.69 found on system at:
1167.28 s
[nothunks] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
1167.28 s
[nothunks] Using hsc2hs version 0.68.10 found on system at:
1167.28 s
[nothunks] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
1167.28 s
[nothunks] Using hscolour version 1.25 found on system at:
1167.28 s
[nothunks] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
1167.28 s
[nothunks] No jhc found
1167.28 s
[nothunks] Using ld found on system at:
1167.28 s
[nothunks] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
1167.28 s
[nothunks] No pkg-config found
1167.28 s
[nothunks] Using runghc version 9.8.4 found on system at:
1167.28 s
[nothunks] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
1167.28 s
[nothunks] Using strip version 2.44 found on system at:
1167.28 s
[nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
1167.28 s
[nothunks] Using tar found on system at:
1167.28 s
[nothunks] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
1167.28 s
[nothunks] No uhc found
1167.28 s
[nothunks] Phase: buildPhase
1167.28 s
[nothunks] Preprocessing library for nothunks-0.3.1..
1167.28 s
[nothunks] Building library for nothunks-0.3.1..
1167.28 s
[nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
1167.37 s
[pandoc-lua-engine] [32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
1167.44 s
[pandoc-lua-engine] [33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
1167.45 s
[pandoc-lua-engine] [34 of 39] Compiling Text.Pandoc.Lua.Module
1167.48 s
[pandoc-lua-engine] [35 of 39] Compiling Text.Pandoc.Lua.Init
1167.49 s
[pandoc-lua-engine] [36 of 39] Compiling Text.Pandoc.Lua.Run
1167.50 s
[pandoc-lua-engine] [37 of 39] Compiling Text.Pandoc.Lua.Custom
1167.53 s
[pandoc-lua-engine] [38 of 39] Compiling Text.Pandoc.Lua.Engine
1167.54 s
[pandoc-lua-engine] [39 of 39] Compiling Text.Pandoc.Lua
1167.54 s
[pandoc-lua-engine] Haddock coverage:
1167.54 s
[pandoc-lua-engine] Warning: 'Chunk' is ambiguous. It is defined
1167.54 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
1167.54 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
1167.54 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1167.54 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1167.54 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Chunks’
1167.54 s
[pandoc-lua-engine] Warning: 'ChunkedDoc' is ambiguous. It is defined
1167.54 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
1167.54 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
1167.54 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1167.54 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1167.54 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Chunks’
1167.55 s
[pandoc-lua-engine] Warning: 'Reference' is ambiguous. It is defined
1167.55 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1167.55 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1167.55 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1167.55 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1167.55 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
1167.55 s
[pandoc-lua-engine] Warning: 'ItemId' is ambiguous. It is defined
1167.55 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1167.55 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1167.55 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1167.55 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1167.55 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
1167.55 s
[pandoc-lua-engine] Warning: 'Name' is ambiguous. It is defined
1167.55 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1167.55 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1167.55 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1167.55 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1167.55 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
1167.55 s
[pandoc-lua-engine] Warning: 'Date' is ambiguous. It is defined
1167.55 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1167.55 s
[pandoc-lua-engine] * in ‘Citeproc.Types’
1167.55 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1167.55 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1167.55 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
1167.55 s
[pandoc-lua-engine] Warning: 'Sources' is ambiguous. It is defined
1167.55 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Sources’
1167.55 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Sources’
1167.55 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1167.55 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1167.55 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Sources’
1167.55 s
[pandoc-lua-engine] Warning: 'Lua' is ambiguous. It is defined
1167.55 s
[pandoc-lua-engine] * in ‘HsLua.Core.Error’
1167.55 s
[pandoc-lua-engine] * in ‘HsLua.Core.Types’
1167.55 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1167.55 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1167.55 s
[pandoc-lua-engine] Defaulting to the one defined in ‘HsLua.Core.Error’
1167.55 s
[pandoc-lua-engine] Warning: 'PandocLua' is ambiguous. It is defined
1167.55 s
[pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:23
1167.55 s
[pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:1
1167.55 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1167.55 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1167.55 s
[pandoc-lua-engine] Defaulting to the one defined at src/Text/Pandoc/Lua/PandocLua.hs:36:1
1167.55 s
[pandoc-lua-engine] Warning: 'ExtensionConfig' is out of scope.
1167.55 s
[pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
1167.55 s
[pandoc-lua-engine] Warning: 'ExtensionsConfig' is ambiguous. It is defined
1167.55 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Format’
1167.55 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Format’
1167.55 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1167.55 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1167.55 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Format’
1167.55 s
[pandoc-lua-engine] Warning: 'enable' is out of scope.
1167.55 s
[pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
1167.55 s
[pandoc-lua-engine] Warning: 'disable' is out of scope.
1167.55 s
[pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
1167.55 s
[pandoc-lua-engine] Warning: 'WriterOptions' is ambiguous. It is defined
1167.55 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Options’
1167.55 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Options’
1167.55 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1167.55 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1167.55 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Options’
1167.55 s
[pandoc-lua-engine] Warning: 'Pandoc' is ambiguous. It is defined
1167.55 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Definition’
1167.55 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Definition’
1167.55 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1167.55 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1167.55 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Definition’
1167.55 s
[pandoc-lua-engine] Warning: 'Chunk' is out of scope.
1167.55 s
[pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
1167.55 s
[pandoc-lua-engine] Warning: 'ReaderOptions' is ambiguous. It is defined
1167.55 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Options’
1167.55 s
[pandoc-lua-engine] * in ‘Text.Pandoc.Options’
1167.55 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1167.55 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1167.55 s
[pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Options’
1167.56 s
[pandoc-lua-engine] Warning: 'read' is out of scope.
1167.56 s
[pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
1167.56 s
[pandoc-lua-engine] Warning: 'PandocLua' is ambiguous. It is defined
1167.56 s
[pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:23
1167.56 s
[pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:1
1167.56 s
[pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
1167.56 s
[pandoc-lua-engine] by specifying the type/value namespace explicitly.
1167.56 s
[pandoc-lua-engine] Defaulting to the one defined at src/Text/Pandoc/Lua/PandocLua.hs:36:1
1167.56 s
[pandoc-lua-engine] 100% ( 11 / 11) in 'Text.Pandoc.Lua'
1168.51 s
[nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
1168.58 s
[pandoc-lua-engine] Warning: Text.Pandoc.Lua: could not find link destinations for:
1168.58 s
[pandoc-lua-engine] - Text.Pandoc.Options.WriterOptions
1168.58 s
[pandoc-lua-engine] - Text.Pandoc.Error.PandocError
1168.58 s
[pandoc-lua-engine] - Text.Pandoc.Options.ReaderOptions
1168.58 s
[pandoc-lua-engine] - Text.Pandoc.Class.CommonState.CommonState
1168.58 s
[pandoc-lua-engine] - Text.Pandoc.Class.PandocMonad.PandocMonad
1168.58 s
[pandoc-lua-engine] - Text.Pandoc.Scripting.ScriptingEngine
1168.58 s
[pandoc-lua-engine] - Text.Pandoc.Filter.Environment.Environment
1168.58 s
[pandoc-lua-engine] - Text.Pandoc.Scripting.CustomComponents
1171.79 s
[nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
1171.79 s
[nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1..
1171.90 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 )
1174.23 s
[nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
1174.55 s
[nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
1175.54 s
[nothunks] Phase: checkPhase
1175.58 s
[nothunks] Running 1 test suites...
1175.58 s
[nothunks] Test suite nothunks-test: RUNNING...
1175.59 s
[nothunks] Tests
1175.59 s
[nothunks] NoThunks.Class
1175.59 s
[nothunks] Sanity
1175.59 s
[nothunks] IntNotNF: OK
1175.59 s
[nothunks] ✓ <interactive> passed 1 test.
1175.59 s
[nothunks] IntIsNF: OK
1175.59 s
[nothunks] ✓ <interactive> passed 1 test.
1175.59 s
[nothunks] Pair: OK
1175.59 s
[nothunks] ✓ <interactive> passed 1 test.
1175.59 s
[nothunks] Sum: OK
1175.59 s
[nothunks] ✓ <interactive> passed 1 test.
1175.59 s
[nothunks] Fn: OK
1175.59 s
[nothunks] ✓ <interactive> passed 1 test.
1175.59 s
[nothunks] IO: OK
1175.60 s
[nothunks] ✓ <interactive> passed 1 test.
1175.60 s
[nothunks] InspectHeap
1175.62 s
[nothunks] Int: OK (0.02s)
1175.62 s
[nothunks] ✓ <interactive> passed 1000 tests.
1175.62 s
[nothunks] Just ["Int"] 53% ██████████▌·········
1175.62 s
[nothunks] Nothing 47% █████████▍··········
1175.64 s
[nothunks] IntInt: OK (0.02s)
1175.64 s
[nothunks] ✓ <interactive> passed 1000 tests.
1175.64 s
[nothunks] Just ["Int","Tuple2"] 38% ███████▋············
1175.64 s
[nothunks] Just ["Tuple2"] 50% ██████████··········
1175.64 s
[nothunks] Nothing 12% ██▎·················
1175.66 s
[nothunks] SumInt: OK (0.02s)
1175.66 s
[nothunks] ✓ <interactive> passed 1000 tests.
1175.66 s
[nothunks] Just ["Either"] 35% ██████▉·············
1175.66 s
[nothunks] Just ["Int","Either"] 33% ██████▋·············
1175.66 s
[nothunks] Nothing 32% ██████▍·············
1175.68 s
[nothunks] ListInt: OK (0.03s)
1175.68 s
[nothunks] ✓ <interactive> passed 1000 tests.
1175.68 s
[nothunks] Just ["Int","List"] 23% ████▌···············
1175.68 s
[nothunks] Just ["List"] 44% ████████▊···········
1175.68 s
[nothunks] Nothing 33% ██████▋·············
1175.71 s
[nothunks] IntListInt: OK (0.03s)
1175.71 s
[nothunks] ✓ <interactive> passed 1000 tests.
1175.71 s
[nothunks] Just ["Int","List","Tuple2"] 6% █▏··················
1175.71 s
[nothunks] Just ["Int","Tuple2"] 23% ████▌···············
1175.71 s
[nothunks] Just ["List","Tuple2"] 11% ██▏·················
1175.71 s
[nothunks] Just ["Tuple2"] 52% ██████████▎·········
1175.71 s
[nothunks] Nothing 8% █▋··················
1175.73 s
[nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
1175.73 s
[nothunks] after 16 tests and 2 shrinks.
1175.73 s
[nothunks] shrink path: 16:b2
1175.73 s
[nothunks] Just ["Int","Seq"] 38% ███████▌············
1175.73 s
[nothunks] Nothing 56% ███████████▏········
1175.73 s
[nothunks]
1175.73 s
[nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
1175.73 s
[nothunks] 166 ┃ testWithModel :: forall a. FromModel a
1175.73 s
[nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
1175.73 s
[nothunks] 168 ┃ -> Proxy a
1175.73 s
[nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
1175.73 s
[nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
1175.73 s
[nothunks] 171 ┃ -- context we will get from the model will be too detailed.
1175.73 s
[nothunks] 172 ┃ -> Property
1175.73 s
[nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
1175.73 s
[nothunks] 174 ┃ m :: Model a <- forAll genModel
1175.73 s
[nothunks] ┃ │ Wrap
1175.73 s
[nothunks] ┃ │ { unwrap =
1175.73 s
[nothunks] ┃ │ SeqEnqueue
1175.73 s
[nothunks] ┃ │ (IntValue 0)
1175.73 s
[nothunks] ┃ │ (SeqEnqueue
1175.73 s
[nothunks] ┃ │ (IntValue 0)
1175.73 s
[nothunks] ┃ │ (SeqEnqueue
1175.73 s
[nothunks] ┃ │ (IntValue 0)
1175.73 s
[nothunks] ┃ │ (SeqEnqueue
1175.73 s
[nothunks] ┃ │ (IntValue 0)
1175.73 s
[nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
1175.73 s
[nothunks] ┃ │ }
1175.73 s
[nothunks] 175 ┃ collect $ modelUnexpected [] m
1175.73 s
[nothunks] 176 ┃ fromModel m $ \a -> do
1175.73 s
[nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
1175.73 s
[nothunks] ┃ │ IsNF
1175.73 s
[nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
1175.73 s
[nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
1175.73 s
[nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1175.73 s
[nothunks] ┃ │ ━━━ Failed (- lhs ) (+ rhs ) ━━━
1175.73 s
[nothunks] ┃ │ - Just
1175.73 s
[nothunks] ┃ │ - ThunkInfo
1175.73 s
[nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
1175.73 s
[nothunks] ┃ │ + Nothing
1175.73 s
[nothunks]
1175.73 s
[nothunks] This failure can be reproduced by running:
1175.73 s
[nothunks] > recheckAt (Seed 7002334859833706703 6929126030832517607) "16:b2" EXPECTED FAILURE
1175.73 s
[nothunks]
1175.74 s
[nothunks] OK (0.02s)
1175.74 s
[nothunks] ✓ <interactive> passed 1 test.
1175.74 s
[nothunks] Model
1175.76 s
[nothunks] Int: OK (0.02s)
1175.76 s
[nothunks] ✓ <interactive> passed 1000 tests.
1175.76 s
[nothunks] Just ["Int"] 50% █████████▉··········
1175.76 s
[nothunks] Nothing 50% ██████████··········
1175.78 s
[nothunks] IntInt: OK (0.02s)
1175.78 s
[nothunks] ✓ <interactive> passed 1000 tests.
1175.78 s
[nothunks] Just ["Int","Tuple2"] 38% ███████▌············
1175.78 s
[nothunks] Just ["Tuple2"] 50% ██████████··········
1175.78 s
[nothunks] Nothing 12% ██▎·················
1175.80 s
[nothunks] SumInt: OK (0.02s)
1175.80 s
[nothunks] ✓ <interactive> passed 1000 tests.
1175.80 s
[nothunks] Just ["Either"] 32% ██████▍·············
1175.80 s
[nothunks] Just ["Int","Either"] 34% ██████▉·············
1175.80 s
[nothunks] Nothing 33% ██████▋·············
1175.82 s
[nothunks] ListInt: OK (0.02s)
1175.82 s
[nothunks] ✓ <interactive> passed 1000 tests.
1175.82 s
[nothunks] Just ["Int","List"] 24% ████▊···············
1175.82 s
[nothunks] Just ["List"] 44% ████████▋···········
1175.82 s
[nothunks] Nothing 33% ██████▌·············
1175.86 s
[nothunks] IntListInt: OK (0.03s)
1175.86 s
[nothunks] ✓ <interactive> passed 1000 tests.
1175.86 s
[nothunks] Just ["Int","List","Tuple2"] 5% ▉···················
1175.86 s
[nothunks] Just ["Int","Tuple2"] 26% █████▏··············
1175.86 s
[nothunks] Just ["List","Tuple2"] 12% ██▎·················
1175.86 s
[nothunks] Just ["Tuple2"] 49% █████████▊··········
1175.86 s
[nothunks] Nothing 8% █▋··················
1175.94 s
[nothunks] SeqInt: OK (0.09s)
1175.94 s
[nothunks] ✓ <interactive> passed 1000 tests.
1175.94 s
[nothunks] Just ["Int","Seq"] 44% ████████▉···········
1175.94 s
[nothunks] Nothing 56% ███████████·········
1175.96 s
[nothunks] AllowThunksIn: OK (0.03s)
1175.96 s
[nothunks] ✓ <interactive> passed 1000 tests.
1175.96 s
[nothunks] Just ["Int","field2","Record"] 27% █████▍··············
1175.96 s
[nothunks] Just ["Record"] 50% ██████████··········
1175.96 s
[nothunks] Nothing 22% ████▍···············
1175.97 s
[nothunks] Fn: OK
1175.97 s
[nothunks] ✓ <interactive> passed 1000 tests.
1175.97 s
[nothunks] Just ["->"] 25% █████···············
1175.97 s
[nothunks] Nothing 75% ███████████████·····
1176.00 s
[nothunks] IO: OK
1176.00 s
[nothunks] ✓ <interactive> passed 1000 tests.
1176.00 s
[nothunks] Just ["IO"] 25% ████▉···············
1176.00 s
[nothunks] Nothing 75% ███████████████·····
1176.01 s
[nothunks] ThunkFreeFn: OK (0.01s)
1176.01 s
[nothunks] ✓ <interactive> passed 1000 tests.
1176.01 s
[nothunks] Just ["->"] 25% ████▉···············
1176.01 s
[nothunks] Just ["...","->"] 37% ███████▍············
1176.01 s
[nothunks] Nothing 38% ███████▌············
1176.01 s
[nothunks] ThunkFreeIO: OK (0.02s)
1176.01 s
[nothunks] ✓ <interactive> passed 1000 tests.
1176.01 s
[nothunks] Just ["...","IO"] 38% ███████▌············
1176.01 s
[nothunks] Just ["IO"] 26% █████···············
1176.01 s
[nothunks] Nothing 37% ███████▍············
1176.01 s
[nothunks] MutableVars
1176.01 s
[nothunks] IORef
1176.01 s
[nothunks] NotNF: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NF: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NotNFPure: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NFPure: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NotNFAtomically: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NFAtomically: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] MVar
1176.01 s
[nothunks] NotNF: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NF: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NotNFPure: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NFPure: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NotNFAtomically: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NFAtomically: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] TVar
1176.01 s
[nothunks] NotNF: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NF: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NotNFPure: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NFPure: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NotNFAtomically: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks] NFAtomically: OK
1176.01 s
[nothunks] ✓ <interactive> passed 1 test.
1176.01 s
[nothunks]
1176.01 s
[nothunks] All 41 tests passed (0.43s)
1176.02 s
[nothunks] Test suite nothunks-test: PASS
1176.02 s
[nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
1176.02 s
[nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
1176.03 s
[nothunks] Phase: haddockPhase
1176.25 s
[nothunks] Preprocessing library for nothunks-0.3.1..
1176.25 s
[nothunks] Running Haddock on library for nothunks-0.3.1..
1176.25 s
[nothunks] Warning: The documentation for the following packages are not installed. No
1176.25 s
[nothunks] links will be generated to these packages: vector-0.13.2.0
1176.31 s
[nothunks] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1176.49 s
[nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
1177.15 s
[nothunks] Haddock coverage:
1177.15 s
[nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
1177.15 s
[nothunks] * at src/NoThunks/Class.hs:334:48
1177.15 s
[nothunks] * at src/NoThunks/Class.hs:334:1
1177.15 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
1177.15 s
[nothunks] by specifying the type/value namespace explicitly.
1177.15 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
1177.15 s
[nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
1177.15 s
[nothunks] * at src/NoThunks/Class.hs:353:25
1177.15 s
[nothunks] * at src/NoThunks/Class.hs:353:1
1177.15 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
1177.15 s
[nothunks] by specifying the type/value namespace explicitly.
1177.15 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
1177.15 s
[nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
1177.15 s
[nothunks] * at src/NoThunks/Class.hs:358:47
1177.15 s
[nothunks] * at src/NoThunks/Class.hs:358:1
1177.15 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
1177.15 s
[nothunks] by specifying the type/value namespace explicitly.
1177.15 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
1177.15 s
[nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
1177.15 s
[nothunks] * at src/NoThunks/Class.hs:308:27
1177.15 s
[nothunks] * at src/NoThunks/Class.hs:308:1
1177.15 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
1177.15 s
[nothunks] by specifying the type/value namespace explicitly.
1177.15 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
1177.16 s
[nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
1177.16 s
[nothunks] * at src/NoThunks/Class.hs:230:18
1177.16 s
[nothunks] * at src/NoThunks/Class.hs:230:1
1177.16 s
[nothunks] You may be able to disambiguate the identifier by qualifying it or
1177.16 s
[nothunks] by specifying the type/value namespace explicitly.
1177.16 s
[nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
1177.16 s
[nothunks] Warning: 'GHC' is out of scope.
1177.16 s
[nothunks] If you qualify the identifier, haddock can try to link it anyway.
1177.16 s
[nothunks] Warning: 'a' is out of scope.
1177.16 s
[nothunks] If you qualify the identifier, haddock can try to link it anyway.
1177.16 s
[nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
1177.16 s
[nothunks] Missing documentation for:
1177.16 s
[nothunks] Module header
1177.84 s
[nothunks] Warning: NoThunks.Class: could not find link destinations for:
1177.84 s
[nothunks] - Data.Vector.Vector
1177.84 s
[nothunks] - Data.Vector.Unboxed.Base.Vector
1177.84 s
[nothunks] - NoThunks.Class.HasFields
1177.84 s
[nothunks] - NoThunks.Class.Elem
1177.84 s
[nothunks] - NoThunks.Class.GShowTypeOf
1177.84 s
[nothunks] - NoThunks.Class.GWRecordField
1177.84 s
[nothunks] - NoThunks.Class.checkContainsThunks
1178.79 s
[pandoc-lua-engine] Documentation created: dist/doc/html/pandoc-lua-engine/,
1178.79 s
[pandoc-lua-engine] dist/doc/html/pandoc-lua-engine/pandoc-lua-engine.txt
1178.88 s
[pandoc-lua-engine] Preprocessing test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
1178.91 s
[pandoc-lua-engine] Phase: installPhase
1179.19 s
[pandoc-lua-engine] Installing library in /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/pandoc-lua-engine-0.4.3-K29XjFgYv9PKG3hN7s3H98
1180.24 s
[pandoc-lua-engine] Phase: fixupPhase
1180.26 s
[pandoc-lua-engine] shrinking RPATHs of ELF executables and libraries in /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3
1180.28 s
[pandoc-lua-engine] shrinking /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSpandoc-lua-engine-0.4.3-K29XjFgYv9PKG3hN7s3H98-ghc9.10.3.so
1180.39 s
[pandoc-lua-engine] checking for references to /build/ in /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3...
1180.44 s
[pandoc-lua-engine] patching script interpreter paths in /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3
1180.45 s
[pandoc-lua-engine] stripping (with command strip and flags -S -p) in /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3/lib
1180.82 s
[pandoc-lua-engine] shrinking RPATHs of ELF executables and libraries in /nix/store/afm4wyap4sbadgn4yb21k7aszlkwhgrc-pandoc-lua-engine-0.4.3-doc
1180.84 s
[pandoc-lua-engine] checking for references to /build/ in /nix/store/afm4wyap4sbadgn4yb21k7aszlkwhgrc-pandoc-lua-engine-0.4.3-doc...
1180.86 s
[pandoc-lua-engine] patching script interpreter paths in /nix/store/afm4wyap4sbadgn4yb21k7aszlkwhgrc-pandoc-lua-engine-0.4.3-doc
1181.21 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/afm4wyap4sbadgn4yb21k7aszlkwhgrc-pandoc-lua-engine-0.4.3-doc /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3
1181.92 s
[post-build-hook] Pushing 2 paths (431 are already present) using zstd to cache sellout ⏳
1181.92 s
[post-build-hook]
1182.29 s
[post-build-hook] Pushing /nix/store/afm4wyap4sbadgn4yb21k7aszlkwhgrc-pandoc-lua-engine-0.4.3-doc (2.68 MiB)
1182.43 s
[post-build-hook] Pushing /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3 (25.42 MiB)
1183.82 s
[post-build-hook]
1183.82 s
[post-build-hook] All done.
1183.87 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/afm4wyap4sbadgn4yb21k7aszlkwhgrc-pandoc-lua-engine-0.4.3-doc /nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3
1183.94 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1184.53 s
[post-build-hook] copying 2 paths...
1184.53 s
[post-build-hook] copying path '/nix/store/afm4wyap4sbadgn4yb21k7aszlkwhgrc-pandoc-lua-engine-0.4.3-doc' to 'https://cache.nix-ci.com'...
1185.18 s
[post-build-hook] copying path '/nix/store/xsymbzkl5mj89m7415xpjfrmfvrgvjxa-pandoc-lua-engine-0.4.3' to 'https://cache.nix-ci.com'...
1191.64 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1191.85 s
[post-build-hook] copying 1 paths...
1191.85 s
[post-build-hook] copying path '/nix/store/a4qjzarxyygb1lcvmpjl75nhikxsbjap-pandoc-lua-engine-0.4.3.drv' to 'https://cache.nix-ci.com'...
1192.01 s
Progress: 37 of 50 built (1 building), 786 of 786 downloaded from cache
1192.11 s
Building pandoc-cli
1192.11 s
[nothunks] Documentation created: dist/doc/html/nothunks/,
1192.11 s
[nothunks] dist/doc/html/nothunks/nothunks.txt
1192.11 s
[nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
1192.11 s
[nothunks] Phase: installPhase
1192.11 s
[nothunks] Installing library in /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
1192.11 s
[nothunks] Phase: fixupPhase
1192.11 s
[nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1
1192.11 s
[nothunks] shrinking /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSnothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1-ghc9.8.4.so
1192.11 s
[nothunks] checking for references to /build/ in /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1...
1192.11 s
[nothunks] patching script interpreter paths in /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1
1192.11 s
[nothunks] stripping (with command strip and flags -S -p) in /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/lib
1192.11 s
[nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc
1192.11 s
[nothunks] checking for references to /build/ in /nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc...
1192.11 s
[nothunks] patching script interpreter paths in /nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc
1192.20 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1
1192.73 s
[post-build-hook] Pushing 2 paths (100 are already present) using zstd to cache sellout ⏳
1192.73 s
[post-build-hook]
1193.08 s
[post-build-hook] Pushing /nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc (842.02 KiB)
1193.13 s
[post-build-hook] Pushing /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1 (2.70 MiB)
1194.80 s
[post-build-hook]
1194.80 s
[post-build-hook] All done.
1194.81 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1
1194.86 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1195.02 s
[post-build-hook] copying 2 paths...
1195.02 s
[post-build-hook] copying path '/nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc' to 'https://cache.nix-ci.com'...
1195.33 s
[post-build-hook] copying path '/nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
1196.52 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1196.78 s
[post-build-hook] copying 3 paths...
1196.80 s
[post-build-hook] copying path '/nix/store/rw9mpwbnj9cy0fs4xg4mfqap7v9apk71-wherefrom-compat-0.1.1.1.drv' to 'https://cache.nix-ci.com'...
1196.80 s
[post-build-hook] copying path '/nix/store/28jrd7wz1giqc795k16pwqw0lr5cvswf-tasty-hedgehog-1.4.0.2.drv' to 'https://cache.nix-ci.com'...
1196.93 s
[post-build-hook] copying path '/nix/store/zcc3aj43qy7j6ghfya0bli2xsrc7jnj4-nothunks-0.3.1.drv' to 'https://cache.nix-ci.com'...
1197.10 s
Progress: 38 of 50 built (1 building), 786 of 786 downloaded from cache
1197.17 s
Building unordered-containers
1197.17 s
[pandoc-cli] Phase: setupCompilerEnvironmentPhase
1197.17 s
[pandoc-cli] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
1197.17 s
[pandoc-cli] Phase: unpackPhase
1197.17 s
[pandoc-cli] unpacking source archive /nix/store/l1s1s9sdrxfqabvc0hl1i6jbdyzaj2ci-pandoc-cli-3.7.0.2.tar.gz
1197.17 s
[pandoc-cli] source root is pandoc-cli-3.7.0.2
1197.17 s
[pandoc-cli] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-cli-3.7.0.2/src/pandoc.hs"
1197.17 s
[pandoc-cli] Phase: patchPhase
1197.17 s
[pandoc-cli] Phase: compileBuildDriverPhase
1197.17 s
[pandoc-cli] setupCompileFlags: -package-db=/build/tmp.n1GBwjX9NG/setup-package.conf.d -threaded
1197.17 s
[pandoc-cli] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.n1GBwjX9NG/Main.o )
1197.17 s
[pandoc-cli] [2 of 2] Linking Setup
1197.17 s
[pandoc-cli] Phase: updateAutotoolsGnuConfigScriptsPhase
1197.17 s
[pandoc-cli] Phase: configurePhase
1197.17 s
[pandoc-cli] configureFlags: --verbose --prefix=/nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.n1GBwjX9NG/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
1197.17 s
[pandoc-cli] Using Parsec parser
1197.17 s
[pandoc-cli] Configuring pandoc-cli-3.7.0.2...
1197.17 s
[pandoc-cli] Flags chosen: lua=True, nightly=False, server=True
1197.17 s
[pandoc-cli] Dependency base >=4.12 && <5: using base-4.20.2.0
1197.17 s
[pandoc-cli] Dependency hslua-cli >=1.4.1 && <1.5: using hslua-cli-1.4.3
1197.17 s
[pandoc-cli] Dependency pandoc ==3.7.0.2: using pandoc-3.7.0.2
1197.17 s
[pandoc-cli] Dependency pandoc-lua-engine >=0.4.3 && <0.5: using pandoc-lua-engine-0.4.3
1197.17 s
[pandoc-cli] Dependency pandoc-server >=0.1.0.9 && <0.2: using pandoc-server-0.1.0.11
1197.17 s
[pandoc-cli] Dependency safe: using safe-0.3.21
1197.17 s
[pandoc-cli] Dependency temporary >=1.1 && <1.4: using temporary-1.3
1197.17 s
[pandoc-cli] Dependency text: using text-2.1.3
1197.17 s
[pandoc-cli] Dependency wai-extra >=3.0.24: using wai-extra-3.1.18
1197.17 s
[pandoc-cli] Dependency warp: using warp-3.4.9
1197.17 s
[pandoc-cli] Source component graph: component exe:pandoc
1197.17 s
[pandoc-cli] Configured component graph:
1197.17 s
[pandoc-cli] component pandoc-cli-3.7.0.2-GQYyxtqEbS2AsesU73JW3X-pandoc
1197.17 s
[pandoc-cli] include base-4.20.2.0-acb8
1197.17 s
[pandoc-cli] include hslua-cli-1.4.3-ACCCBwRtVs553oZVrCff6R
1197.17 s
[pandoc-cli] include pandoc-3.7.0.2-Bn1GI6jrbMY2zU1Kbgbk8q
1197.17 s
[pandoc-cli] include pandoc-lua-engine-0.4.3-K29XjFgYv9PKG3hN7s3H98
1197.17 s
[pandoc-cli] include pandoc-server-0.1.0.11-2p8ECUQZARt9psWxK5ycoq
1197.17 s
[pandoc-cli] include safe-0.3.21-Elq3JZGcw0hJOWwfsj8G99
1197.17 s
[pandoc-cli] include temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
1197.17 s
[pandoc-cli] include text-2.1.3-e138
1197.17 s
[pandoc-cli] include wai-extra-3.1.18-45rqyGWr75p3CvzQlOJ5lM
1197.17 s
[pandoc-cli] include warp-3.4.9-IayhpOyoI2X29pjdF6hCyz
1197.17 s
[pandoc-cli] Linked component graph:
1197.17 s
[pandoc-cli] unit pandoc-cli-3.7.0.2-GQYyxtqEbS2AsesU73JW3X-pandoc
1197.17 s
[pandoc-cli] include base-4.20.2.0-acb8
1197.17 s
[pandoc-cli] include hslua-cli-1.4.3-ACCCBwRtVs553oZVrCff6R
1197.17 s
[pandoc-cli] include pandoc-3.7.0.2-Bn1GI6jrbMY2zU1Kbgbk8q
1197.17 s
[pandoc-cli] include pandoc-lua-engine-0.4.3-K29XjFgYv9PKG3hN7s3H98
1197.17 s
[pandoc-cli] include pandoc-server-0.1.0.11-2p8ECUQZARt9psWxK5ycoq
1197.17 s
[pandoc-cli] include safe-0.3.21-Elq3JZGcw0hJOWwfsj8G99
1197.17 s
[pandoc-cli] include temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
1197.17 s
[pandoc-cli] include text-2.1.3-e138
1197.17 s
[pandoc-cli] include wai-extra-3.1.18-45rqyGWr75p3CvzQlOJ5lM
1197.17 s
[pandoc-cli] include warp-3.4.9-IayhpOyoI2X29pjdF6hCyz
1197.17 s
[pandoc-cli] Ready component graph:
1197.17 s
[pandoc-cli] definite pandoc-cli-3.7.0.2-GQYyxtqEbS2AsesU73JW3X-pandoc
1197.17 s
[pandoc-cli] depends base-4.20.2.0-acb8
1197.17 s
[pandoc-cli] depends hslua-cli-1.4.3-ACCCBwRtVs553oZVrCff6R
1197.17 s
[pandoc-cli] depends pandoc-3.7.0.2-Bn1GI6jrbMY2zU1Kbgbk8q
1197.17 s
[pandoc-cli] depends pandoc-lua-engine-0.4.3-K29XjFgYv9PKG3hN7s3H98
1197.17 s
[pandoc-cli] depends pandoc-server-0.1.0.11-2p8ECUQZARt9psWxK5ycoq
1197.17 s
[pandoc-cli] depends safe-0.3.21-Elq3JZGcw0hJOWwfsj8G99
1197.17 s
[pandoc-cli] depends temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
1197.17 s
[pandoc-cli] depends text-2.1.3-e138
1197.17 s
[pandoc-cli] depends wai-extra-3.1.18-45rqyGWr75p3CvzQlOJ5lM
1197.17 s
[pandoc-cli] depends warp-3.4.9-IayhpOyoI2X29pjdF6hCyz
1197.17 s
[pandoc-cli] Using Cabal-3.12.1.0 compiled by ghc-9.10
1197.17 s
[pandoc-cli] Using compiler: ghc-9.10.3
1197.17 s
[pandoc-cli] Using install prefix:
1197.17 s
[pandoc-cli] /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2
1197.17 s
[pandoc-cli] Executables installed in:
1197.17 s
[pandoc-cli] /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2/bin
1197.17 s
[pandoc-cli] Libraries installed in:
1197.17 s
[pandoc-cli] /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/pandoc-cli-3.7.0.2
1197.17 s
[pandoc-cli] Dynamic Libraries installed in:
1197.17 s
[pandoc-cli] /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
1197.17 s
[pandoc-cli] Private executables installed in:
1197.17 s
[pandoc-cli] /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2/libexec/x86_64-linux-ghc-9.10.3-5702/pandoc-cli-3.7.0.2
1197.17 s
[pandoc-cli] Data files installed in:
1197.17 s
[pandoc-cli] /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2/share/x86_64-linux-ghc-9.10.3-5702/pandoc-cli-3.7.0.2
1197.17 s
[pandoc-cli] Documentation installed in:
1197.17 s
[pandoc-cli] /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2/share/doc/x86_64-linux-ghc-9.10.3-5702/pandoc-cli-3.7.0.2
1197.17 s
[pandoc-cli] Configuration files installed in:
1197.17 s
[pandoc-cli] /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2/etc
1197.17 s
[pandoc-cli] No alex found
1197.17 s
[pandoc-cli] Using ar found on system at:
1197.17 s
[pandoc-cli] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
1197.17 s
[pandoc-cli] No c2hs found
1197.17 s
[pandoc-cli] No cpphs found
1197.17 s
[pandoc-cli] No doctest found
1197.17 s
[pandoc-cli] Using gcc version 14.3.0 given by user at:
1197.17 s
[pandoc-cli] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
1197.17 s
[pandoc-cli] Using ghc version 9.10.3 found on system at:
1197.17 s
[pandoc-cli] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
1197.17 s
[pandoc-cli] Using ghc-pkg version 9.10.3 found on system at:
1197.17 s
[pandoc-cli] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
1197.17 s
[pandoc-cli] No ghcjs found
1197.17 s
[pandoc-cli] No ghcjs-pkg found
1197.17 s
[pandoc-cli] No greencard found
1197.17 s
[pandoc-cli] Using haddock version 2.31.1 found on system at:
1197.17 s
[pandoc-cli] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
1197.17 s
[pandoc-cli] No happy found
1197.17 s
[pandoc-cli] Using haskell-suite found on system at: haskell-suite-dummy-location
1197.17 s
[pandoc-cli] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1197.17 s
[pandoc-cli] No hmake found
1197.17 s
[pandoc-cli] Using hpc version 0.69 found on system at:
1197.17 s
[pandoc-cli] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
1197.17 s
[pandoc-cli] Using hsc2hs version 0.68.10 found on system at:
1197.17 s
[pandoc-cli] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
1197.17 s
[pandoc-cli] No hscolour found
1197.17 s
[pandoc-cli] No jhc found
1197.17 s
[pandoc-cli] Using ld found on system at:
1197.17 s
[pandoc-cli] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
1197.17 s
[pandoc-cli] No pkg-config found
1197.17 s
[pandoc-cli] Using runghc version 9.10.3 found on system at:
1197.17 s
[pandoc-cli] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
1197.17 s
[pandoc-cli] Using strip version 2.44 found on system at:
1197.17 s
[pandoc-cli] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
1197.17 s
[pandoc-cli] Using tar found on system at:
1197.17 s
[pandoc-cli] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
1197.17 s
[pandoc-cli] No uhc found
1197.17 s
[pandoc-cli] Phase: buildPhase
1197.17 s
[pandoc-cli] Preprocessing executable 'pandoc' for pandoc-cli-3.7.0.2...
1197.17 s
[pandoc-cli] Building executable 'pandoc' for pandoc-cli-3.7.0.2...
1197.17 s
[pandoc-cli] [1 of 3] Compiling PandocCLI.Lua
1197.17 s
[pandoc-cli] [2 of 3] Compiling PandocCLI.Server
1197.17 s
[pandoc-cli] [3 of 3] Compiling Main
1197.30 s
[unordered-containers] Phase: setupCompilerEnvironmentPhase
1197.31 s
[unordered-containers] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
1197.36 s
[pandoc-cli] [4 of 4] Linking dist/build/pandoc/pandoc
1197.50 s
[unordered-containers] Phase: unpackPhase
1197.50 s
[unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
1197.51 s
[unordered-containers] source root is unordered-containers-0.2.20.1
1197.52 s
[unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
1197.52 s
[unordered-containers] Phase: patchPhase
1197.53 s
[unordered-containers] Phase: compileBuildDriverPhase
1197.53 s
[unordered-containers] setupCompileFlags: -package-db=/build/tmp.ehi64fOScO/setup-package.conf.d -threaded
1197.57 s
[unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.ehi64fOScO/Main.o )
1197.64 s
[unordered-containers] [2 of 2] Linking Setup
1198.94 s
[unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
1198.95 s
[unordered-containers] Phase: configurePhase
1198.96 s
[unordered-containers] configureFlags: --verbose --prefix=/nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.ehi64fOScO/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
1198.97 s
[unordered-containers] Using Parsec parser
1198.97 s
[unordered-containers] Configuring unordered-containers-0.2.20.1...
1199.30 s
[unordered-containers] Flags chosen: debug=False
1199.30 s
[unordered-containers] Dependency base >=4.10 && <5: using base-4.19.2.0
1199.30 s
[unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.1.0
1199.30 s
[unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
1199.30 s
[unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.21.0.0
1199.30 s
[unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
1199.30 s
[unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
1199.30 s
[unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
1199.30 s
[unordered-containers] Dependency base: using base-4.19.2.0
1199.30 s
[unordered-containers] Dependency containers >=0.5.8: using containers-0.6.8
1199.30 s
[unordered-containers] Dependency hashable: using hashable-1.5.0.0
1199.30 s
[unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
1199.30 s
[unordered-containers] Dependency random: using random-1.2.1.3
1199.30 s
[unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
1199.30 s
[unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
1199.30 s
[unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
1199.30 s
[unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
1199.55 s
[unordered-containers] Source component graph:
1199.55 s
[unordered-containers] component lib
1199.55 s
[unordered-containers] component test:unordered-containers-tests dependency lib
1199.55 s
[unordered-containers] Configured component graph:
1199.55 s
[unordered-containers] component unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
1199.55 s
[unordered-containers] include base-4.19.2.0-a4d2
1199.55 s
[unordered-containers] include deepseq-1.5.1.0-2184
1199.55 s
[unordered-containers] include hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
1199.55 s
[unordered-containers] include template-haskell-2.21.0.0-cf26
1199.55 s
[unordered-containers] component unordered-containers-0.2.20.1-HM98DEfccw0CwjXoFVJeUj-unordered-containers-tests
1199.55 s
[unordered-containers] include ChasingBottoms-1.3.1.17-Ah3Z9oBVFKW5JdxqlMZrV4
1199.55 s
[unordered-containers] include HUnit-1.6.2.0-3JXxihbFbfoB9MlN5UzWLe
1199.55 s
[unordered-containers] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1199.55 s
[unordered-containers] include base-4.19.2.0-a4d2
1199.55 s
[unordered-containers] include containers-0.6.8-1373
1199.55 s
[unordered-containers] include hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
1199.55 s
[unordered-containers] include nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
1199.55 s
[unordered-containers] include random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
1199.55 s
[unordered-containers] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
1199.55 s
[unordered-containers] include tasty-hunit-0.10.2-JS3cbCHWyhEKpg2zmj91qe
1199.55 s
[unordered-containers] include tasty-quickcheck-0.11.1-DHhHz1LjT4W7Z49DpnNAd3
1199.55 s
[unordered-containers] include unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
1199.55 s
[unordered-containers] Linked component graph:
1199.55 s
[unordered-containers] unit unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
1199.55 s
[unordered-containers] include base-4.19.2.0-a4d2
1199.55 s
[unordered-containers] include deepseq-1.5.1.0-2184
1199.55 s
[unordered-containers] include hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
1199.55 s
[unordered-containers] include template-haskell-2.21.0.0-cf26
1199.55 s
[unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashSet.Internal
1199.55 s
[unordered-containers] unit unordered-containers-0.2.20.1-HM98DEfccw0CwjXoFVJeUj-unordered-containers-tests
1199.55 s
[unordered-containers] include ChasingBottoms-1.3.1.17-Ah3Z9oBVFKW5JdxqlMZrV4
1199.55 s
[unordered-containers] include HUnit-1.6.2.0-3JXxihbFbfoB9MlN5UzWLe
1199.55 s
[unordered-containers] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1199.55 s
[unordered-containers] include base-4.19.2.0-a4d2
1199.55 s
[unordered-containers] include containers-0.6.8-1373
1199.55 s
[unordered-containers] include hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
1199.55 s
[unordered-containers] include nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
1199.55 s
[unordered-containers] include random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
1199.55 s
[unordered-containers] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
1199.55 s
[unordered-containers] include tasty-hunit-0.10.2-JS3cbCHWyhEKpg2zmj91qe
1199.55 s
[unordered-containers] include tasty-quickcheck-0.11.1-DHhHz1LjT4W7Z49DpnNAd3
1199.55 s
[unordered-containers] include unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
1199.55 s
[unordered-containers] Ready component graph:
1199.55 s
[unordered-containers] definite unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
1199.55 s
[unordered-containers] depends base-4.19.2.0-a4d2
1199.55 s
[unordered-containers] depends deepseq-1.5.1.0-2184
1199.55 s
[unordered-containers] depends hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
1199.55 s
[unordered-containers] depends template-haskell-2.21.0.0-cf26
1199.55 s
[unordered-containers] definite unordered-containers-0.2.20.1-HM98DEfccw0CwjXoFVJeUj-unordered-containers-tests
1199.55 s
[unordered-containers] depends ChasingBottoms-1.3.1.17-Ah3Z9oBVFKW5JdxqlMZrV4
1199.55 s
[unordered-containers] depends HUnit-1.6.2.0-3JXxihbFbfoB9MlN5UzWLe
1199.55 s
[unordered-containers] depends QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1199.55 s
[unordered-containers] depends base-4.19.2.0-a4d2
1199.55 s
[unordered-containers] depends containers-0.6.8-1373
1199.55 s
[unordered-containers] depends hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
1199.55 s
[unordered-containers] depends nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
1199.55 s
[unordered-containers] depends random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
1199.55 s
[unordered-containers] depends tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
1199.55 s
[unordered-containers] depends tasty-hunit-0.10.2-JS3cbCHWyhEKpg2zmj91qe
1199.55 s
[unordered-containers] depends tasty-quickcheck-0.11.1-DHhHz1LjT4W7Z49DpnNAd3
1199.55 s
[unordered-containers] depends unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
1199.55 s
[unordered-containers] Using Cabal-3.10.3.0 compiled by ghc-9.8
1199.55 s
[unordered-containers] Using compiler: ghc-9.8.4
1199.55 s
[unordered-containers] Using install prefix:
1199.55 s
[unordered-containers] /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1
1199.55 s
[unordered-containers] Executables installed in:
1199.55 s
[unordered-containers] /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/bin
1199.55 s
[unordered-containers] Libraries installed in:
1199.55 s
[unordered-containers] /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-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-Cbq0HfNXyUe8yCdjkMHJvy
1199.55 s
[unordered-containers] Dynamic Libraries installed in:
1199.55 s
[unordered-containers] /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
1199.55 s
[unordered-containers] Private executables installed in:
1199.55 s
[unordered-containers] /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1
1199.55 s
[unordered-containers] Data files installed in:
1199.55 s
[unordered-containers] /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1
1199.55 s
[unordered-containers] Documentation installed in:
1199.55 s
[unordered-containers] /nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
1199.55 s
[unordered-containers] Configuration files installed in:
1199.55 s
[unordered-containers] /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/etc
1199.55 s
[unordered-containers] No alex found
1199.55 s
[unordered-containers] Using ar found on system at:
1199.55 s
[unordered-containers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
1199.55 s
[unordered-containers] No c2hs found
1199.55 s
[unordered-containers] No cpphs found
1199.55 s
[unordered-containers] No doctest found
1199.55 s
[unordered-containers] Using gcc version 14.3.0 given by user at:
1199.55 s
[unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
1199.55 s
[unordered-containers] Using ghc version 9.8.4 found on system at:
1199.55 s
[unordered-containers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
1199.55 s
[unordered-containers] Using ghc-pkg version 9.8.4 found on system at:
1199.55 s
[unordered-containers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
1199.55 s
[unordered-containers] No ghcjs found
1199.55 s
[unordered-containers] No ghcjs-pkg found
1199.55 s
[unordered-containers] No greencard found
1199.55 s
[unordered-containers] Using haddock version 2.30.0 found on system at:
1199.55 s
[unordered-containers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
1199.55 s
[unordered-containers] No happy found
1199.55 s
[unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
1199.55 s
[unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1199.55 s
[unordered-containers] No hmake found
1199.55 s
[unordered-containers] Using hpc version 0.69 found on system at:
1199.55 s
[unordered-containers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
1199.55 s
[unordered-containers] Using hsc2hs version 0.68.10 found on system at:
1199.55 s
[unordered-containers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
1199.55 s
[unordered-containers] Using hscolour version 1.25 found on system at:
1199.55 s
[unordered-containers] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
1199.55 s
[unordered-containers] No jhc found
1199.55 s
[unordered-containers] Using ld found on system at:
1199.55 s
[unordered-containers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
1199.55 s
[unordered-containers] No pkg-config found
1199.55 s
[unordered-containers] Using runghc version 9.8.4 found on system at:
1199.55 s
[unordered-containers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
1199.55 s
[unordered-containers] Using strip version 2.44 found on system at:
1199.55 s
[unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
1199.55 s
[unordered-containers] Using tar found on system at:
1199.55 s
[unordered-containers] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
1199.55 s
[unordered-containers] No uhc found
1199.68 s
[unordered-containers] Phase: buildPhase
1199.73 s
[unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
1199.74 s
[unordered-containers] Building library for unordered-containers-0.2.20.1..
1199.82 s
[unordered-containers]
1199.82 s
[unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning : [ GHC-53692 ] [ -Wdeprecated-flags ]
1199.82 s
[unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
1199.82 s
[unordered-containers] |
1199.82 s
[unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
1199.82 s
[unordered-containers] | ^^^^^^^^^^
1200.04 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 )
1200.19 s
[unordered-containers]
1200.19 s
[unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning : [ GHC-66111 ] [ -Wunused-imports ]
1200.19 s
[unordered-containers] The import of ‘Control.Applicative’ is redundant
1200.19 s
[unordered-containers] except perhaps to import instances from ‘Control.Applicative’
1200.19 s
[unordered-containers] To import instances alone, use: import Control.Applicative()
1200.19 s
[unordered-containers] |
1200.19 s
[unordered-containers] 83 | import Control.Applicative (liftA2)
1200.19 s
[unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1200.80 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 )
1200.80 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 )
1206.13 s
[pandoc-cli] Phase: checkPhase
1206.23 s
[pandoc-cli] Package has no test suites.
1206.24 s
[pandoc-cli] Phase: haddockPhase
1206.27 s
[pandoc-cli] Phase: installPhase
1206.47 s
[pandoc-cli] Installing executable pandoc in /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2/bin
1206.47 s
[pandoc-cli] Warning: The directory
1206.47 s
[pandoc-cli] /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2/bin is not in
1206.47 s
[pandoc-cli] the system search path.
1207.73 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 )
1208.03 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 )
1209.86 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 )
1209.86 s
[unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
1209.86 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 )
1209.94 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 )
1210.53 s
[unordered-containers]
1210.53 s
[unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning : [ GHC-53692 ] [ -Wdeprecated-flags ]
1210.53 s
[unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
1210.53 s
[unordered-containers] |
1210.53 s
[unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
1210.53 s
[unordered-containers] | ^^^^^^^^^^
1210.84 s
[unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
1210.97 s
[unordered-containers]
1210.97 s
[unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning : [ GHC-66111 ] [ -Wunused-imports ]
1210.97 s
[unordered-containers] The import of ‘Control.Applicative’ is redundant
1210.97 s
[unordered-containers] except perhaps to import instances from ‘Control.Applicative’
1210.97 s
[unordered-containers] To import instances alone, use: import Control.Applicative()
1210.97 s
[unordered-containers] |
1210.97 s
[unordered-containers] 83 | import Control.Applicative (liftA2)
1210.97 s
[unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1211.44 s
[pandoc-cli] Phase: fixupPhase
1211.45 s
[pandoc-cli] shrinking RPATHs of ELF executables and libraries in /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2
1211.47 s
[pandoc-cli] shrinking /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2/bin/pandoc
1211.81 s
[unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
1211.81 s
[unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
1212.06 s
[pandoc-cli] checking for references to /build/ in /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2...
1212.29 s
[pandoc-cli] gzipping man pages under /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2/share/man/
1212.31 s
[pandoc-cli] patching script interpreter paths in /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2
1212.31 s
[pandoc-cli] stripping (with command strip and flags -S -p) in /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2/bin
1213.45 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2
1224.72 s
[post-build-hook] Pushing 1 paths (30 are already present) using zstd to cache sellout ⏳
1224.72 s
[post-build-hook]
1229.67 s
[post-build-hook] Pushing /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2 (207.77 MiB)
1241.45 s
[post-build-hook]
1241.45 s
[post-build-hook] All done.
1241.47 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2
1241.52 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1241.53 s
[post-build-hook] copying 1 paths...
1241.53 s
[post-build-hook] copying path '/nix/store/kw3za95f7hqf85j27w1v594aiqjy6vw0-pandoc-cli-3.7.0.2' to 'https://cache.nix-ci.com'...
1304.61 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1304.81 s
[post-build-hook] copying 1 paths...
1304.81 s
[post-build-hook] copying path '/nix/store/cckp3sl7fjih6387ganwcrjnq7vqjm1v-pandoc-cli-3.7.0.2.drv' to 'https://cache.nix-ci.com'...
1304.97 s
Progress: 39 of 50 built (1 building), 786 of 786 downloaded from cache
1305.02 s
Building shellcheck
1305.02 s
[unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
1305.02 s
[unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
1305.02 s
[unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
1305.02 s
[unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
1305.02 s
[unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
1305.02 s
[unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
1305.02 s
[unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
1305.02 s
[unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
1305.02 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 )
1305.02 s
[unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
1305.02 s
[unordered-containers]
1305.02 s
[unordered-containers] tests/Regressions.hs:93:16: warning : [ GHC-63394 ] [ -Wx-partial ]
1305.02 s
[unordered-containers] In the use of ‘head’
1305.02 s
[unordered-containers] (imported from Prelude, but defined in GHC.List):
1305.02 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."
1305.02 s
[unordered-containers] |
1305.02 s
[unordered-containers] 93 | k = head keys
1305.02 s
[unordered-containers] | ^^^^
1305.02 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 )
1305.02 s
[unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
1305.02 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 )
1305.02 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 )
1305.02 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 )
1305.02 s
[unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
1305.02 s
[unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
1305.02 s
[unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
1305.02 s
[unordered-containers] buildPhase completed in 35 seconds
1305.02 s
[unordered-containers] Phase: checkPhase
1305.02 s
[unordered-containers] Running 1 test suites...
1305.02 s
[unordered-containers] Test suite unordered-containers-tests: RUNNING...
1305.02 s
[unordered-containers] All
1305.02 s
[unordered-containers] Properties
1305.02 s
[unordered-containers] Data.HashMap.Lazy
1305.02 s
[unordered-containers] instances
1305.02 s
[unordered-containers] Eq
1305.02 s
[unordered-containers] ==: OK (0.01s)
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] /=: OK (0.01s)
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] Ord
1305.02 s
[unordered-containers] compare reflexive: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] compare transitive: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] compare antisymmetric: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] Ord => Eq: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] Read/Show: OK (0.07s)
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] Functor: OK (0.02s)
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] Foldable: OK (0.01s)
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] Bifoldable
1305.02 s
[unordered-containers] bifoldMap: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] bifoldr: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] bifoldl: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] Hashable: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] empty
1305.02 s
[unordered-containers] valid: OK
1305.02 s
[unordered-containers] +++ OK, passed 1 test.
1305.02 s
[unordered-containers] singleton
1305.02 s
[unordered-containers] valid: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] size: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] member: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] lookup: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] !?: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] insert
1305.02 s
[unordered-containers] model: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] valid: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] insertWith
1305.02 s
[unordered-containers] insertWith: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] valid: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] delete
1305.02 s
[unordered-containers] model: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] valid: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] adjust
1305.02 s
[unordered-containers] model: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] valid: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] update
1305.02 s
[unordered-containers] model: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] valid: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] alter
1305.02 s
[unordered-containers] model: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] valid: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] alterF
1305.02 s
[unordered-containers] model
1305.02 s
[unordered-containers] []: OK (0.02s)
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] adjust: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] insert: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] insertWith: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] delete: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] lookup: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] valid: OK (0.01s)
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] isSubmapOf
1305.02 s
[unordered-containers] model: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] m ⊆ m: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] m1 ⊆ m1 ∪ m2: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] m1\m2 ⊆ m1: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.01s)
1305.02 s
[unordered-containers] +++ OK, passed 100 tests; 156 discarded.
1305.02 s
[unordered-containers] delete k m ⊆ m: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests; 20 discarded.
1305.02 s
[unordered-containers] m ⊈ delete k m : OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests; 14 discarded.
1305.02 s
[unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests; 7 discarded.
1305.02 s
[unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests; 14 discarded.
1305.02 s
[unordered-containers] union
1305.02 s
[unordered-containers] model: OK (0.01s)
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] valid: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] unionWith
1305.02 s
[unordered-containers] model: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] valid: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] unionWithKey
1305.02 s
[unordered-containers] model: OK (0.02s)
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] valid: OK
1305.02 s
[unordered-containers] +++ OK, passed 100 tests.
1305.02 s
[unordered-containers] unions
1305.03 s
[unordered-containers] model: OK (0.40s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.23s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] difference
1305.03 s
[unordered-containers] model: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] differenceWith
1305.03 s
[unordered-containers] model: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] intersection
1305.03 s
[unordered-containers] model: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] intersectionWith
1305.03 s
[unordered-containers] model: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] intersectionWithKey
1305.03 s
[unordered-containers] model: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] compose
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] map
1305.03 s
[unordered-containers] model: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] traverseWithKey
1305.03 s
[unordered-containers] model: OK (0.04s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] mapKeys
1305.03 s
[unordered-containers] model: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.14s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldr: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldl: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldrWithKey: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldlWithKey: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldrWithKey': OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldlWithKey': OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldl': OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldr': OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldMapWithKey: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] filter
1305.03 s
[unordered-containers] model: OK (0.03s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] filterWithKey
1305.03 s
[unordered-containers] model: OK (0.43s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.21s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] mapMaybe
1305.03 s
[unordered-containers] model: OK (0.04s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] mapMaybeWithKey
1305.03 s
[unordered-containers] model: OK (0.39s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.18s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] elems: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] keys: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] fromList
1305.03 s
[unordered-containers] model: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] fromListWith
1305.03 s
[unordered-containers] model: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] fromListWithKey
1305.03 s
[unordered-containers] model: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] toList: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Data.HashMap.Strict
1305.03 s
[unordered-containers] instances
1305.03 s
[unordered-containers] Eq
1305.03 s
[unordered-containers] ==: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] /=: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Ord
1305.03 s
[unordered-containers] compare reflexive: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] compare transitive: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] compare antisymmetric: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Ord => Eq: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Read/Show: OK (0.15s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Functor: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Foldable: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Bifoldable
1305.03 s
[unordered-containers] bifoldMap: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] bifoldr: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] bifoldl: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Hashable: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] empty
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 1 test.
1305.03 s
[unordered-containers] singleton
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] size: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] member: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] lookup: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] !?: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] insert
1305.03 s
[unordered-containers] model: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] insertWith
1305.03 s
[unordered-containers] insertWith: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] delete
1305.03 s
[unordered-containers] model: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] adjust
1305.03 s
[unordered-containers] model: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] update
1305.03 s
[unordered-containers] model: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] alter
1305.03 s
[unordered-containers] model: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] alterF
1305.03 s
[unordered-containers] model
1305.03 s
[unordered-containers] []: OK (0.08s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] adjust: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] insert: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] insertWith: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] delete: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] lookup: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.03s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] isSubmapOf
1305.03 s
[unordered-containers] model: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] m ⊆ m: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] m1\m2 ⊆ m1: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.03s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests; 181 discarded.
1305.03 s
[unordered-containers] delete k m ⊆ m: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests; 18 discarded.
1305.03 s
[unordered-containers] m ⊈ delete k m : OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests; 16 discarded.
1305.03 s
[unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests; 7 discarded.
1305.03 s
[unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests; 16 discarded.
1305.03 s
[unordered-containers] union
1305.03 s
[unordered-containers] model: OK (0.03s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] unionWith
1305.03 s
[unordered-containers] model: OK (0.03s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] unionWithKey
1305.03 s
[unordered-containers] model: OK (0.05s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.03s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] unions
1305.03 s
[unordered-containers] model: OK (0.40s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.29s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] difference
1305.03 s
[unordered-containers] model: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] differenceWith
1305.03 s
[unordered-containers] model: OK (0.03s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.03s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] intersection
1305.03 s
[unordered-containers] model: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] intersectionWith
1305.03 s
[unordered-containers] model: OK (0.04s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.03s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] intersectionWithKey
1305.03 s
[unordered-containers] model: OK (0.05s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.03s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] compose
1305.03 s
[unordered-containers] valid: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] map
1305.03 s
[unordered-containers] model: OK (0.03s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] traverseWithKey
1305.03 s
[unordered-containers] model: OK (0.11s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] mapKeys
1305.03 s
[unordered-containers] model: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.13s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldr: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldl: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldrWithKey: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldlWithKey: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldrWithKey': OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldlWithKey': OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldl': OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldr': OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldMapWithKey: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] filter
1305.03 s
[unordered-containers] model: OK (0.03s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] filterWithKey
1305.03 s
[unordered-containers] model: OK (0.33s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.21s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] mapMaybe
1305.03 s
[unordered-containers] model: OK (0.03s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] mapMaybeWithKey
1305.03 s
[unordered-containers] model: OK (0.34s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.23s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] elems: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] keys: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] fromList
1305.03 s
[unordered-containers] model: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] fromListWith
1305.03 s
[unordered-containers] model: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] fromListWithKey
1305.03 s
[unordered-containers] model: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] valid: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] toList: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Data.HashSet
1305.03 s
[unordered-containers] instances
1305.03 s
[unordered-containers] Eq
1305.03 s
[unordered-containers] ==: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] == permutations: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] /=: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Ord
1305.03 s
[unordered-containers] compare reflexive: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] compare transitive: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] compare antisymmetric: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Ord => Eq: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Read/Show: OK (0.13s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Foldable: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Hashable: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] size: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] member: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] insert: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] delete: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] union: OK (0.02s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] map: OK (0.21s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldr: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] foldl': OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] filter: OK (0.23s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] toList: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Data.HashMap.Internal.List
1305.03 s
[unordered-containers] isPermutationBy: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] isPermutationBy of different length: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests; 11 discarded.
1305.03 s
[unordered-containers] pUnorderedCompare: OK (0.04s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] modelUnorderedCompare
1305.03 s
[unordered-containers] reflexive: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] anti-symmetric: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] transitive: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] Regression tests
1305.03 s
[unordered-containers] issue32: OK
1305.03 s
[unordered-containers] issue39a: OK
1305.03 s
[unordered-containers] issue39b: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] issue254 lazy: OK
1305.03 s
[unordered-containers] issue254 strict: OK
1305.03 s
[unordered-containers] issue379
1305.03 s
[unordered-containers] Lazy.unionWith: OK
1305.03 s
[unordered-containers] union: OK
1305.03 s
[unordered-containers] Strict.unionWith: OK
1305.03 s
[unordered-containers] Strict.unionWithKey: OK
1305.03 s
[unordered-containers] issue381
1305.03 s
[unordered-containers] mapMaybe: OK
1305.03 s
[unordered-containers] mapMaybeWithKey: OK
1305.03 s
[unordered-containers] issue382: OK
1305.03 s
[unordered-containers] issue383: OK
1305.03 s
[unordered-containers] issue420: OK
1305.03 s
[unordered-containers] issue491
1305.03 s
[unordered-containers] 1: OK
1305.03 s
[unordered-containers] 2: OK
1305.03 s
[unordered-containers] 3: OK
1305.03 s
[unordered-containers] Strictness
1305.03 s
[unordered-containers] HashMap.Strict
1305.03 s
[unordered-containers] singleton is key-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] singleton is value-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] member is key-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] lookup is key-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] lookupDefault is key-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] findWithDefault is key-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] ! is key-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] delete is key-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] adjust is key-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] adjust is value-strict: OK (0.01s)
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] insert is key-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] insert is value-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] insertWith is key-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] insertWith is value-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] fromList is key-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] fromList is value-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] fromListWith is key-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers] fromListWith is value-strict: OK
1305.03 s
[unordered-containers] +++ OK, passed 100 tests.
1305.03 s
[unordered-containers]
1305.03 s
[unordered-containers] All 257 tests passed (0.59s)
1305.03 s
[unordered-containers] Test suite unordered-containers-tests: PASS
1305.03 s
[unordered-containers] Test suite logged to:
1305.03 s
[unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
1305.03 s
[unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
1305.03 s
[unordered-containers] checkPhase completed in 1 minutes 11 seconds
1305.03 s
[unordered-containers] Phase: haddockPhase
1305.07 s
[shellcheck] Phase: unpackPhase
1305.08 s
[shellcheck] unpacking source archive /nix/store/0y569php6xr1v629bbggizl1ba1mrf5b-ShellCheck-0.11.0.tar.gz
1305.09 s
[shellcheck] source root is ShellCheck-0.11.0
1305.09 s
[shellcheck] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "ShellCheck-0.11.0/test/shellcheck.hs"
1305.10 s
[shellcheck] Phase: patchPhase
1305.10 s
[shellcheck] Phase: updateAutotoolsGnuConfigScriptsPhase
1305.11 s
[shellcheck] Phase: configurePhase
1305.12 s
[shellcheck] no configure script, doing nothing
1305.13 s
[shellcheck] Phase: buildPhase
1305.16 s
[unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
1305.16 s
[unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1..
1305.19 s
[shellcheck] Phase: installPhase
1305.20 s
[unordered-containers] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1305.21 s
[shellcheck] Phase: fixupPhase
1305.23 s
[shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/q46qczdsfm7pa4149jgb7v6xa9zljk5p-shellcheck-0.11.0-bin
1305.23 s
[shellcheck] shrinking /nix/store/q46qczdsfm7pa4149jgb7v6xa9zljk5p-shellcheck-0.11.0-bin/bin/shellcheck
1305.24 s
[shellcheck] checking for references to /build/ in /nix/store/q46qczdsfm7pa4149jgb7v6xa9zljk5p-shellcheck-0.11.0-bin...
1305.26 s
[shellcheck] patching script interpreter paths in /nix/store/q46qczdsfm7pa4149jgb7v6xa9zljk5p-shellcheck-0.11.0-bin
1305.27 s
[shellcheck] stripping (with command strip and flags -S -p) in /nix/store/q46qczdsfm7pa4149jgb7v6xa9zljk5p-shellcheck-0.11.0-bin/bin
1305.31 s
[shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/v93xmg5bvf5sj2p5d3fc0pibj69j18d4-shellcheck-0.11.0-man
1305.31 s
[shellcheck] checking for references to /build/ in /nix/store/v93xmg5bvf5sj2p5d3fc0pibj69j18d4-shellcheck-0.11.0-man...
1305.32 s
[shellcheck] gzipping man pages under /nix/store/v93xmg5bvf5sj2p5d3fc0pibj69j18d4-shellcheck-0.11.0-man/share/man/
1305.33 s
[shellcheck] patching script interpreter paths in /nix/store/v93xmg5bvf5sj2p5d3fc0pibj69j18d4-shellcheck-0.11.0-man
1305.34 s
[shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/0f9vs0llmqh8yip6v421kjy9ldkdn2pq-shellcheck-0.11.0-doc
1305.34 s
[shellcheck] checking for references to /build/ in /nix/store/0f9vs0llmqh8yip6v421kjy9ldkdn2pq-shellcheck-0.11.0-doc...
1305.35 s
[shellcheck] patching script interpreter paths in /nix/store/0f9vs0llmqh8yip6v421kjy9ldkdn2pq-shellcheck-0.11.0-doc
1305.35 s
[shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/hcc1a75b03pjsf9jjyd3zfk3ncrkpbsx-shellcheck-0.11.0
1305.36 s
[shellcheck] checking for references to /build/ in /nix/store/hcc1a75b03pjsf9jjyd3zfk3ncrkpbsx-shellcheck-0.11.0...
1305.36 s
[shellcheck] patching script interpreter paths in /nix/store/hcc1a75b03pjsf9jjyd3zfk3ncrkpbsx-shellcheck-0.11.0
1305.39 s
[unordered-containers]
1305.39 s
[unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning : [ GHC-53692 ] [ -Wdeprecated-flags ]
1305.39 s
[unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
1305.39 s
[unordered-containers] |
1305.39 s
[unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
1305.39 s
[unordered-containers] | ^^^^^^^^^^
1305.45 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/0f9vs0llmqh8yip6v421kjy9ldkdn2pq-shellcheck-0.11.0-doc /nix/store/hcc1a75b03pjsf9jjyd3zfk3ncrkpbsx-shellcheck-0.11.0 /nix/store/q46qczdsfm7pa4149jgb7v6xa9zljk5p-shellcheck-0.11.0-bin /nix/store/v93xmg5bvf5sj2p5d3fc0pibj69j18d4-shellcheck-0.11.0-man
1306.77 s
[post-build-hook] Pushing 4 paths (26 are already present) using zstd to cache sellout ⏳
1306.77 s
[post-build-hook]
1307.21 s
[post-build-hook] Pushing /nix/store/0f9vs0llmqh8yip6v421kjy9ldkdn2pq-shellcheck-0.11.0-doc (21.28 KiB)
1307.21 s
[post-build-hook] Pushing /nix/store/hcc1a75b03pjsf9jjyd3zfk3ncrkpbsx-shellcheck-0.11.0 (544.00 B)
1307.21 s
[post-build-hook] Pushing /nix/store/q46qczdsfm7pa4149jgb7v6xa9zljk5p-shellcheck-0.11.0-bin (7.53 MiB)
1307.21 s
[post-build-hook] Pushing /nix/store/v93xmg5bvf5sj2p5d3fc0pibj69j18d4-shellcheck-0.11.0-man (6.52 KiB)
1309.00 s
[post-build-hook]
1309.00 s
[post-build-hook] All done.
1309.01 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/0f9vs0llmqh8yip6v421kjy9ldkdn2pq-shellcheck-0.11.0-doc /nix/store/hcc1a75b03pjsf9jjyd3zfk3ncrkpbsx-shellcheck-0.11.0 /nix/store/q46qczdsfm7pa4149jgb7v6xa9zljk5p-shellcheck-0.11.0-bin /nix/store/v93xmg5bvf5sj2p5d3fc0pibj69j18d4-shellcheck-0.11.0-man
1309.05 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1309.23 s
[post-build-hook] copying 4 paths...
1309.23 s
[post-build-hook] copying path '/nix/store/v93xmg5bvf5sj2p5d3fc0pibj69j18d4-shellcheck-0.11.0-man' to 'https://cache.nix-ci.com'...
1309.23 s
[post-build-hook] copying path '/nix/store/0f9vs0llmqh8yip6v421kjy9ldkdn2pq-shellcheck-0.11.0-doc' to 'https://cache.nix-ci.com'...
1309.23 s
[post-build-hook] copying path '/nix/store/q46qczdsfm7pa4149jgb7v6xa9zljk5p-shellcheck-0.11.0-bin' to 'https://cache.nix-ci.com'...
1311.27 s
[post-build-hook] copying path '/nix/store/hcc1a75b03pjsf9jjyd3zfk3ncrkpbsx-shellcheck-0.11.0' to 'https://cache.nix-ci.com'...
1311.43 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1311.66 s
[post-build-hook] copying 1 paths...
1311.66 s
[post-build-hook] copying path '/nix/store/1przb0kvhvp4r5zwjyrn70x5xyhcaswd-shellcheck-0.11.0.drv' to 'https://cache.nix-ci.com'...
1311.80 s
Progress: 40 of 50 built (1 building), 786 of 786 downloaded from cache
1311.85 s
Building bash-language-server
1311.85 s
[unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
1311.85 s
[unordered-containers]
1311.85 s
[unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning : [ GHC-66111 ] [ -Wunused-imports ]
1311.85 s
[unordered-containers] The import of ‘Control.Applicative’ is redundant
1311.85 s
[unordered-containers] except perhaps to import instances from ‘Control.Applicative’
1311.85 s
[unordered-containers] To import instances alone, use: import Control.Applicative()
1311.85 s
[unordered-containers] |
1311.85 s
[unordered-containers] 83 | import Control.Applicative (liftA2)
1311.85 s
[unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1311.85 s
[unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
1311.85 s
[unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
1311.85 s
[unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
1311.85 s
[unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
1311.85 s
[unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
1311.85 s
[unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
1311.85 s
[unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
1311.85 s
[unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
1311.85 s
[unordered-containers] Haddock coverage:
1311.85 s
[unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
1311.85 s
[unordered-containers] Missing documentation for:
1311.85 s
[unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
1311.85 s
[unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
1311.85 s
[unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
1311.85 s
[unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
1311.85 s
[unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
1311.85 s
[unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
1311.85 s
[unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
1311.85 s
[unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
1311.85 s
[unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
1311.85 s
[unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
1311.85 s
[unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
1311.85 s
[unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
1311.85 s
[unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
1311.85 s
[unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
1311.85 s
[unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
1311.85 s
[unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
1311.85 s
[unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
1311.85 s
[unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
1311.85 s
[unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
1311.85 s
[unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
1311.85 s
[unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
1311.85 s
[unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
1311.85 s
[unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
1311.85 s
[unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
1311.85 s
[unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
1311.85 s
[unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
1311.85 s
[unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
1311.85 s
[unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
1311.85 s
[unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
1311.85 s
[unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
1311.85 s
[unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
1311.85 s
[unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
1311.85 s
[unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
1311.85 s
[unordered-containers] Missing documentation for:
1311.85 s
[unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
1311.85 s
[unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
1311.85 s
[unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
1311.85 s
[unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
1311.85 s
[unordered-containers] * at Data/HashMap/Internal.hs:227:7
1311.85 s
[unordered-containers] * at Data/HashMap/Internal.hs:187:1
1311.85 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1311.85 s
[unordered-containers] by specifying the type/value namespace explicitly.
1311.85 s
[unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
1311.85 s
[unordered-containers] Warning: 'at' is out of scope.
1311.85 s
[unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
1311.85 s
[unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
1311.85 s
[unordered-containers] Missing documentation for:
1311.85 s
[unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
1311.85 s
[unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1859)
1311.85 s
[unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
1311.85 s
[unordered-containers] equalKeys (Data/HashMap/Internal.hs:513)
1311.85 s
[unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:497)
1311.85 s
[unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:680)
1311.85 s
[unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
1311.85 s
[unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:662)
1311.85 s
[unordered-containers] insert' (Data/HashMap/Internal.hs:808)
1311.85 s
[unordered-containers] delete' (Data/HashMap/Internal.hs:1126)
1311.85 s
[unordered-containers] insertNewKey (Data/HashMap/Internal.hs:850)
1311.85 s
[unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:885)
1311.85 s
[unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
1311.85 s
[unordered-containers] Missing documentation for:
1311.85 s
[unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
1311.85 s
[unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
1311.85 s
[unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
1311.85 s
[unordered-containers] Warning: 'lookup' is out of scope.
1311.85 s
[unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
1311.85 s
[unordered-containers] Warning: 'at' is out of scope.
1311.85 s
[unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
1311.85 s
[unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
1311.85 s
[unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
1311.85 s
[unordered-containers] * at Data/HashSet/Internal.hs:112:21
1311.85 s
[unordered-containers] * at Data/HashSet/Internal.hs:112:1
1311.85 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1311.85 s
[unordered-containers] by specifying the type/value namespace explicitly.
1311.85 s
[unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
1311.85 s
[unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
1311.85 s
[unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
1311.85 s
[unordered-containers] * at Data/HashSet/Internal.hs:112:21
1311.85 s
[unordered-containers] * at Data/HashSet/Internal.hs:112:1
1311.85 s
[unordered-containers] You may be able to disambiguate the identifier by qualifying it or
1311.85 s
[unordered-containers] by specifying the type/value namespace explicitly.
1311.85 s
[unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
1311.85 s
[unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
1311.85 s
[unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
1311.85 s
[unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
1311.85 s
[unordered-containers] Warning: Data.HashMap.Internal: could not find link destinations for:
1311.85 s
[unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
1311.85 s
[unordered-containers] Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
1311.85 s
[unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
1311.85 s
[unordered-containers] Warning: Data.HashSet.Internal: could not find link destinations for:
1311.85 s
[unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
1311.85 s
[unordered-containers] Warning: Data.HashSet: could not find link destinations for:
1311.85 s
[unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
1311.85 s
[unordered-containers] Warning: Data.HashMap.Strict: could not find link destinations for:
1311.85 s
[unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
1311.85 s
[unordered-containers] Warning: Data.HashMap.Lazy: could not find link destinations for:
1311.85 s
[unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
1311.85 s
[unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
1311.85 s
[unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
1311.85 s
[unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
1311.85 s
[unordered-containers] Phase: installPhase
1311.85 s
[unordered-containers] Installing library in /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-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-Cbq0HfNXyUe8yCdjkMHJvy
1311.85 s
[unordered-containers] Phase: fixupPhase
1311.85 s
[unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1
1311.85 s
[unordered-containers] shrinking /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-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-Cbq0HfNXyUe8yCdjkMHJvy-ghc9.8.4.so
1311.85 s
[unordered-containers] checking for references to /build/ in /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1...
1311.85 s
[unordered-containers] patching script interpreter paths in /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1
1311.85 s
[unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/lib
1311.85 s
[unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc
1311.85 s
[unordered-containers] checking for references to /build/ in /nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc...
1311.85 s
[unordered-containers] patching script interpreter paths in /nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc
1311.94 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1 /nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc
1312.36 s
[post-build-hook] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
1312.36 s
[post-build-hook]
1312.73 s
[post-build-hook] Pushing /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1 (9.29 MiB)
1312.77 s
[post-build-hook] Pushing /nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc (4.50 MiB)
1313.78 s
[post-build-hook]
1313.78 s
[post-build-hook] All done.
1313.80 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1 /nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc
1313.84 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1313.99 s
[post-build-hook] copying 2 paths...
1313.99 s
[post-build-hook] copying path '/nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc' to 'https://cache.nix-ci.com'...
1314.70 s
[post-build-hook] copying path '/nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
1316.92 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1317.15 s
[post-build-hook] copying 2 paths...
1317.16 s
[post-build-hook] copying path '/nix/store/5zpz4mv2cp19gz526a1gannnldyhx3x0-ChasingBottoms-1.3.1.17.drv' to 'https://cache.nix-ci.com'...
1317.28 s
[post-build-hook] copying path '/nix/store/lkrfrhmaphylcydrqkb6jshgwv4hfk3n-unordered-containers-0.2.20.1.drv' to 'https://cache.nix-ci.com'...
1317.42 s
Progress: 41 of 50 built (1 building), 786 of 786 downloaded from cache
1317.48 s
Building quickcheck-instances
1317.48 s
[bash-language-server] Using versionCheckHook
1317.48 s
[bash-language-server] Phase: unpackPhase
1317.48 s
[bash-language-server] unpacking source archive /nix/store/lxydhrakpk9ccbjzavdgm3f3imkypnw2-source
1317.48 s
[bash-language-server] source root is source
1317.48 s
[bash-language-server] Phase: patchPhase
1317.48 s
[bash-language-server] Phase: updateAutotoolsGnuConfigScriptsPhase
1317.48 s
[bash-language-server] Phase: configurePhase
1317.48 s
[bash-language-server] no configure script, doing nothing
1317.48 s
[bash-language-server] Executing pnpmConfigHook
1317.48 s
[bash-language-server] Found 'pnpm' with version '10.28.0'
1317.48 s
[bash-language-server] Using fetcherVersion: 3
1317.48 s
[bash-language-server] Configuring pnpm store
1317.48 s
[bash-language-server] /build /build/source
1317.48 s
[bash-language-server] /build/source
1317.48 s
[bash-language-server] Installing dependencies
1317.48 s
[bash-language-server] Lockfile is up to date, resolution step is skipped
1317.48 s
[bash-language-server] Progress: resolved 1 , reused 0 , downloaded 0 , added 0
1317.48 s
[bash-language-server] . | +416
1317.48 s
[bash-language-server] Progress: resolved 1 , reused 0 , downloaded 0 , added 0
1317.48 s
[bash-language-server] Progress: resolved 416 , reused 253 , downloaded 0 , added 0
1317.48 s
[bash-language-server] Progress: resolved 416 , reused 416 , downloaded 0 , added 260
1317.48 s
[bash-language-server] Progress: resolved 416 , reused 416 , downloaded 0 , added 416 , done
1317.48 s
[bash-language-server] Done in 1.1s using pnpm v10.28.0
1317.48 s
[bash-language-server] Patching scripts
1317.48 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
1317.48 s
[bash-language-server] node_modules/.bin/jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 s
[bash-language-server] node_modules/.bin/ts-jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 s
[bash-language-server] node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 s
[bash-language-server] node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 s
[bash-language-server] node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 s
[bash-language-server] node_modules/.bin/installServerIntoExtension: interpreter directive changed from "#!/bin/sh" to "/nix/store/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 s
[bash-language-server] node_modules/.bin/eslint-config-prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 s
[bash-language-server] node_modules/.bin/prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.48 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.49 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.50 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.51 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.53 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.54 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.56 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.57 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.58 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.59 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.60 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.61 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.62 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/bash"
1317.62 s
[quickcheck-instances] Phase: setupCompilerEnvironmentPhase
1317.63 s
[quickcheck-instances] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
1317.63 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.64 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.65 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.66 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.67 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.68 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/bash"
1317.69 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.70 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.71 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.72 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.73 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.74 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.74 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.75 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.76 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.78 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.79 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.80 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.81 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.81 s
[quickcheck-instances] Phase: unpackPhase
1317.81 s
[quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
1317.82 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.82 s
[quickcheck-instances] source root is quickcheck-instances-0.3.33
1317.83 s
[quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
1317.83 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.83 s
[quickcheck-instances] Phase: patchPhase
1317.83 s
[quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
1317.84 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.84 s
[quickcheck-instances] Phase: compileBuildDriverPhase
1317.84 s
[quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.d3te43lQg6/setup-package.conf.d -threaded
1317.84 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.86 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.87 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/31sh8fzcbg4sjahp3zj002j0ca8sfvvr-nodejs-22.22.0/bin/node"
1317.88 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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1317.88 s
[quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.d3te43lQg6/Main.o )
1317.88 s
[bash-language-server] Finished pnpmConfigHook
1317.89 s
[bash-language-server] Phase: buildPhase
1317.94 s
[quickcheck-instances] [2 of 2] Linking Setup
1318.14 s
[bash-language-server]
1318.14 s
[bash-language-server] > @ compile /build/source
1318.14 s
[bash-language-server] > tsc -b server
1318.14 s
[bash-language-server]
1319.17 s
[quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
1319.18 s
[quickcheck-instances] Phase: configurePhase
1319.18 s
[quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.d3te43lQg6/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
1319.19 s
[quickcheck-instances] Using Parsec parser
1319.19 s
[quickcheck-instances] Configuring quickcheck-instances-0.3.33...
1319.51 s
[quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
1319.51 s
[quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
1319.51 s
[quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
1319.51 s
[quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.19.2.0
1319.51 s
[quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.1.0
1319.51 s
[quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
1319.51 s
[quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.8
1319.51 s
[quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
1319.51 s
[quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
1319.51 s
[quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
1319.51 s
[quickcheck-instances] integer-logarithms-1.0.4
1319.51 s
[quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
1319.51 s
[quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
1319.51 s
[quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
1319.51 s
[quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
1319.51 s
[quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
1319.51 s
[quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
1319.51 s
[quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.1
1319.51 s
[quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
1319.51 s
[quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
1319.51 s
[quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
1319.51 s
[quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.0
1319.51 s
[quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
1319.51 s
[quickcheck-instances] unordered-containers-0.2.20.1
1319.51 s
[quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
1319.51 s
[quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
1319.51 s
[quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
1319.51 s
[quickcheck-instances] Dependency base: using base-4.19.2.0
1319.51 s
[quickcheck-instances] Dependency containers: using containers-0.6.8
1319.51 s
[quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
1319.51 s
[quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
1319.51 s
[quickcheck-instances] Dependency tagged: using tagged-0.8.9
1319.51 s
[quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
1319.73 s
[quickcheck-instances] Source component graph:
1319.73 s
[quickcheck-instances] component lib
1319.73 s
[quickcheck-instances] component test:self-test dependency lib
1319.73 s
[quickcheck-instances] Configured component graph:
1319.73 s
[quickcheck-instances] component quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
1319.73 s
[quickcheck-instances] include OneTuple-0.4.2-2twkKhRPLeXLIafa3e1gFR
1319.73 s
[quickcheck-instances] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1319.73 s
[quickcheck-instances] include array-0.5.8.0-34d4
1319.73 s
[quickcheck-instances] include base-4.19.2.0-a4d2
1319.73 s
[quickcheck-instances] include bytestring-0.12.1.0-2e42
1319.73 s
[quickcheck-instances] include case-insensitive-1.2.1.0-1eJ8GCD3Bf2Fit5GdtX14I
1319.73 s
[quickcheck-instances] include containers-0.6.8-1373
1319.73 s
[quickcheck-instances] include data-fix-0.3.4-69wx8VhswtfHtDDV24Bd60
1319.73 s
[quickcheck-instances] include hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
1319.73 s
[quickcheck-instances] include integer-logarithms-1.0.4-9xTIq7fiLFg4wArpIOSvx4
1319.73 s
[quickcheck-instances] include old-time-1.1.0.4-2I5C0NkCOQM5Eg7JcM2HwM
1319.73 s
[quickcheck-instances] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
1319.73 s
[quickcheck-instances] include scientific-0.3.8.0-2VxeuGyRd827ZcY3deHC9I
1319.73 s
[quickcheck-instances] include splitmix-0.1.3.1-3qTd6of2FRwGkDAmkUYKCO
1319.73 s
[quickcheck-instances] include strict-0.5.1-EvRK1i421VG1dCQdyRtK1b
1319.73 s
[quickcheck-instances] include tagged-0.8.9-3CU7GBcvQ475FDP8UXqJzJ
1319.73 s
[quickcheck-instances] include text-2.1.1-dac7
1319.73 s
[quickcheck-instances] include text-short-0.1.6-Hpxa9sY8XXJEhLyzFuNDST
1319.73 s
[quickcheck-instances] include these-1.2.1-4HbU8b9AhfHKNakGjWTrg
1319.73 s
[quickcheck-instances] include time-compat-1.9.8-7CgQitk7nY9AfgzuKgTRG4
1319.73 s
[quickcheck-instances] include transformers-0.6.1.0-8f1d
1319.73 s
[quickcheck-instances] include unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
1319.73 s
[quickcheck-instances] include uuid-types-1.0.6-LUA0XHLHpgx6PTF6BwbZ8J
1319.73 s
[quickcheck-instances] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
1319.73 s
[quickcheck-instances] component quickcheck-instances-0.3.33-D0NKyMnU9okDoY0YriyBxJ-self-test
1319.73 s
[quickcheck-instances] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1319.73 s
[quickcheck-instances] include base-4.19.2.0-a4d2
1319.73 s
[quickcheck-instances] include containers-0.6.8-1373
1319.73 s
[quickcheck-instances] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
1319.73 s
[quickcheck-instances] include quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
1319.73 s
[quickcheck-instances] include tagged-0.8.9-3CU7GBcvQ475FDP8UXqJzJ
1319.73 s
[quickcheck-instances] include uuid-types-1.0.6-LUA0XHLHpgx6PTF6BwbZ8J
1319.73 s
[quickcheck-instances] Linked component graph:
1319.73 s
[quickcheck-instances] unit quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
1319.73 s
[quickcheck-instances] include OneTuple-0.4.2-2twkKhRPLeXLIafa3e1gFR
1319.73 s
[quickcheck-instances] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1319.73 s
[quickcheck-instances] include array-0.5.8.0-34d4
1319.73 s
[quickcheck-instances] include base-4.19.2.0-a4d2
1319.73 s
[quickcheck-instances] include bytestring-0.12.1.0-2e42
1319.73 s
[quickcheck-instances] include case-insensitive-1.2.1.0-1eJ8GCD3Bf2Fit5GdtX14I
1319.73 s
[quickcheck-instances] include containers-0.6.8-1373
1319.73 s
[quickcheck-instances] include data-fix-0.3.4-69wx8VhswtfHtDDV24Bd60
1319.73 s
[quickcheck-instances] include hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
1319.73 s
[quickcheck-instances] include integer-logarithms-1.0.4-9xTIq7fiLFg4wArpIOSvx4
1319.73 s
[quickcheck-instances] include old-time-1.1.0.4-2I5C0NkCOQM5Eg7JcM2HwM
1319.73 s
[quickcheck-instances] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
1319.73 s
[quickcheck-instances] include scientific-0.3.8.0-2VxeuGyRd827ZcY3deHC9I
1319.73 s
[quickcheck-instances] include splitmix-0.1.3.1-3qTd6of2FRwGkDAmkUYKCO
1319.73 s
[quickcheck-instances] include strict-0.5.1-EvRK1i421VG1dCQdyRtK1b
1319.73 s
[quickcheck-instances] include tagged-0.8.9-3CU7GBcvQ475FDP8UXqJzJ
1319.73 s
[quickcheck-instances] include text-2.1.1-dac7
1319.73 s
[quickcheck-instances] include text-short-0.1.6-Hpxa9sY8XXJEhLyzFuNDST
1319.73 s
[quickcheck-instances] include these-1.2.1-4HbU8b9AhfHKNakGjWTrg
1319.73 s
[quickcheck-instances] include time-compat-1.9.8-7CgQitk7nY9AfgzuKgTRG4
1319.73 s
[quickcheck-instances] include transformers-0.6.1.0-8f1d
1319.73 s
[quickcheck-instances] include unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
1319.73 s
[quickcheck-instances] include uuid-types-1.0.6-LUA0XHLHpgx6PTF6BwbZ8J
1319.73 s
[quickcheck-instances] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
1319.73 s
[quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Void
1319.73 s
[quickcheck-instances] unit quickcheck-instances-0.3.33-D0NKyMnU9okDoY0YriyBxJ-self-test
1319.73 s
[quickcheck-instances] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1319.73 s
[quickcheck-instances] include base-4.19.2.0-a4d2
1319.73 s
[quickcheck-instances] include containers-0.6.8-1373
1319.73 s
[quickcheck-instances] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
1319.73 s
[quickcheck-instances] include quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
1319.73 s
[quickcheck-instances] include tagged-0.8.9-3CU7GBcvQ475FDP8UXqJzJ
1319.73 s
[quickcheck-instances] include uuid-types-1.0.6-LUA0XHLHpgx6PTF6BwbZ8J
1319.73 s
[quickcheck-instances] Ready component graph:
1319.73 s
[quickcheck-instances] definite quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
1319.73 s
[quickcheck-instances] depends OneTuple-0.4.2-2twkKhRPLeXLIafa3e1gFR
1319.73 s
[quickcheck-instances] depends QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1319.73 s
[quickcheck-instances] depends array-0.5.8.0-34d4
1319.73 s
[quickcheck-instances] depends base-4.19.2.0-a4d2
1319.73 s
[quickcheck-instances] depends bytestring-0.12.1.0-2e42
1319.73 s
[quickcheck-instances] depends case-insensitive-1.2.1.0-1eJ8GCD3Bf2Fit5GdtX14I
1319.73 s
[quickcheck-instances] depends containers-0.6.8-1373
1319.73 s
[quickcheck-instances] depends data-fix-0.3.4-69wx8VhswtfHtDDV24Bd60
1319.73 s
[quickcheck-instances] depends hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
1319.73 s
[quickcheck-instances] depends integer-logarithms-1.0.4-9xTIq7fiLFg4wArpIOSvx4
1319.73 s
[quickcheck-instances] depends old-time-1.1.0.4-2I5C0NkCOQM5Eg7JcM2HwM
1319.73 s
[quickcheck-instances] depends primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
1319.73 s
[quickcheck-instances] depends scientific-0.3.8.0-2VxeuGyRd827ZcY3deHC9I
1319.73 s
[quickcheck-instances] depends splitmix-0.1.3.1-3qTd6of2FRwGkDAmkUYKCO
1319.73 s
[quickcheck-instances] depends strict-0.5.1-EvRK1i421VG1dCQdyRtK1b
1319.73 s
[quickcheck-instances] depends tagged-0.8.9-3CU7GBcvQ475FDP8UXqJzJ
1319.73 s
[quickcheck-instances] depends text-2.1.1-dac7
1319.73 s
[quickcheck-instances] depends text-short-0.1.6-Hpxa9sY8XXJEhLyzFuNDST
1319.73 s
[quickcheck-instances] depends these-1.2.1-4HbU8b9AhfHKNakGjWTrg
1319.73 s
[quickcheck-instances] depends time-compat-1.9.8-7CgQitk7nY9AfgzuKgTRG4
1319.73 s
[quickcheck-instances] depends transformers-0.6.1.0-8f1d
1319.73 s
[quickcheck-instances] depends unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
1319.73 s
[quickcheck-instances] depends uuid-types-1.0.6-LUA0XHLHpgx6PTF6BwbZ8J
1319.73 s
[quickcheck-instances] depends vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
1319.73 s
[quickcheck-instances] definite quickcheck-instances-0.3.33-D0NKyMnU9okDoY0YriyBxJ-self-test
1319.73 s
[quickcheck-instances] depends QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1319.73 s
[quickcheck-instances] depends base-4.19.2.0-a4d2
1319.73 s
[quickcheck-instances] depends containers-0.6.8-1373
1319.74 s
[quickcheck-instances] depends primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
1319.74 s
[quickcheck-instances] depends quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
1319.74 s
[quickcheck-instances] depends tagged-0.8.9-3CU7GBcvQ475FDP8UXqJzJ
1319.74 s
[quickcheck-instances] depends uuid-types-1.0.6-LUA0XHLHpgx6PTF6BwbZ8J
1319.74 s
[quickcheck-instances] Using Cabal-3.10.3.0 compiled by ghc-9.8
1319.74 s
[quickcheck-instances] Using compiler: ghc-9.8.4
1319.74 s
[quickcheck-instances] Using install prefix:
1319.74 s
[quickcheck-instances] /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33
1319.74 s
[quickcheck-instances] Executables installed in:
1319.74 s
[quickcheck-instances] /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/bin
1319.74 s
[quickcheck-instances] Libraries installed in:
1319.74 s
[quickcheck-instances] /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
1319.74 s
[quickcheck-instances] Dynamic Libraries installed in:
1319.74 s
[quickcheck-instances] /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
1319.74 s
[quickcheck-instances] Private executables installed in:
1319.74 s
[quickcheck-instances] /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33
1319.74 s
[quickcheck-instances] Data files installed in:
1319.74 s
[quickcheck-instances] /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33
1319.74 s
[quickcheck-instances] Documentation installed in:
1319.74 s
[quickcheck-instances] /nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
1319.74 s
[quickcheck-instances] Configuration files installed in:
1319.74 s
[quickcheck-instances] /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/etc
1319.74 s
[quickcheck-instances] No alex found
1319.74 s
[quickcheck-instances] Using ar found on system at:
1319.74 s
[quickcheck-instances] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
1319.74 s
[quickcheck-instances] No c2hs found
1319.74 s
[quickcheck-instances] No cpphs found
1319.74 s
[quickcheck-instances] No doctest found
1319.74 s
[quickcheck-instances] Using gcc version 14.3.0 given by user at:
1319.74 s
[quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
1319.74 s
[quickcheck-instances] Using ghc version 9.8.4 found on system at:
1319.74 s
[quickcheck-instances] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
1319.74 s
[quickcheck-instances] Using ghc-pkg version 9.8.4 found on system at:
1319.74 s
[quickcheck-instances] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
1319.74 s
[quickcheck-instances] No ghcjs found
1319.74 s
[quickcheck-instances] No ghcjs-pkg found
1319.74 s
[quickcheck-instances] No greencard found
1319.74 s
[quickcheck-instances] Using haddock version 2.30.0 found on system at:
1319.74 s
[quickcheck-instances] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
1319.74 s
[quickcheck-instances] No happy found
1319.74 s
[quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
1319.74 s
[quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1319.74 s
[quickcheck-instances] No hmake found
1319.74 s
[quickcheck-instances] Using hpc version 0.69 found on system at:
1319.74 s
[quickcheck-instances] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
1319.74 s
[quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
1319.74 s
[quickcheck-instances] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
1319.74 s
[quickcheck-instances] Using hscolour version 1.25 found on system at:
1319.74 s
[quickcheck-instances] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
1319.74 s
[quickcheck-instances] No jhc found
1319.74 s
[quickcheck-instances] Using ld found on system at:
1319.74 s
[quickcheck-instances] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
1319.74 s
[quickcheck-instances] No pkg-config found
1319.74 s
[quickcheck-instances] Using runghc version 9.8.4 found on system at:
1319.74 s
[quickcheck-instances] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
1319.74 s
[quickcheck-instances] Using strip version 2.44 found on system at:
1319.74 s
[quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
1319.74 s
[quickcheck-instances] Using tar found on system at:
1319.74 s
[quickcheck-instances] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
1319.74 s
[quickcheck-instances] No uhc found
1319.78 s
[bash-language-server] Phase: installPhase
1319.86 s
[quickcheck-instances] Phase: buildPhase
1319.91 s
[quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
1319.93 s
[quickcheck-instances] Building library for quickcheck-instances-0.3.33..
1320.03 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 )
1320.08 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 )
1320.09 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 )
1320.12 s
[bash-language-server] Lockfile is up to date, resolution step is skipped
1320.15 s
[bash-language-server] Already up to date
1320.38 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 )
1320.38 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 )
1320.47 s
[bash-language-server]
1320.47 s
[bash-language-server] devDependencies:
1320.47 s
[bash-language-server] - @types/jest 29.5.14
1320.47 s
[bash-language-server] - @types/node 18.19.86
1320.47 s
[bash-language-server] - @typescript-eslint/eslint-plugin 7.18.0
1320.47 s
[bash-language-server] - @typescript-eslint/parser 7.18.0
1320.47 s
[bash-language-server] - cross-spawn 7.0.6
1320.47 s
[bash-language-server] - eslint 8.57.1
1320.47 s
[bash-language-server] - eslint-config-prettier 9.1.0
1320.47 s
[bash-language-server] - eslint-plugin-jest 28.11.0
1320.47 s
[bash-language-server] - eslint-plugin-prettier 4.2.1
1320.47 s
[bash-language-server] - eslint-plugin-simple-import-sort 12.1.1
1320.47 s
[bash-language-server] - eslint-plugin-sort-class-members 1.21.0
1320.47 s
[bash-language-server] - jest 29.7.0
1320.47 s
[bash-language-server] - prettier 2.8.8
1320.47 s
[bash-language-server] - ts-jest 29.3.2
1320.47 s
[bash-language-server] - typescript 5.6.3
1320.47 s
[bash-language-server] - vscode-languageserver 8.0.2
1320.47 s
[bash-language-server] - vscode-languageserver-textdocument 1.0.12
1320.47 s
[bash-language-server]
1320.56 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 )
1320.56 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 )
1320.56 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 )
1320.56 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 )
1320.59 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 )
1320.59 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 )
1320.59 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 )
1320.59 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 )
1320.59 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 )
1320.59 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 )
1320.69 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 )
1320.69 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 )
1320.69 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 )
1320.69 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 )
1320.70 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 )
1320.71 s
[bash-language-server] Phase: fixupPhase
1320.73 s
[bash-language-server] shrinking RPATHs of ELF executables and libraries in /nix/store/fcs2clcrs5mnyacfz6zw1npry66gqw0r-bash-language-server-5.6.0
1320.84 s
[bash-language-server] shrinking /nix/store/fcs2clcrs5mnyacfz6zw1npry66gqw0r-bash-language-server-5.6.0/bin/bash-language-server
1320.85 s
[bash-language-server] checking for references to /build/ in /nix/store/fcs2clcrs5mnyacfz6zw1npry66gqw0r-bash-language-server-5.6.0...
1321.00 s
[bash-language-server] patching script interpreter paths in /nix/store/fcs2clcrs5mnyacfz6zw1npry66gqw0r-bash-language-server-5.6.0
1321.01 s
[bash-language-server] /nix/store/fcs2clcrs5mnyacfz6zw1npry66gqw0r-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/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/bash"
1321.02 s
[bash-language-server] /nix/store/fcs2clcrs5mnyacfz6zw1npry66gqw0r-bash-language-server-5.6.0/lib/bash-language-server/server/node_modules/.bin/editorconfig: interpreter directive changed from "#!/bin/sh" to "/nix/store/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1321.03 s
[bash-language-server] /nix/store/fcs2clcrs5mnyacfz6zw1npry66gqw0r-bash-language-server-5.6.0/lib/bash-language-server/server/node_modules/.bin/installServerIntoExtension: interpreter directive changed from "#!/bin/sh" to "/nix/store/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
1321.07 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 )
1321.07 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 )
1321.07 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 )
1321.07 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 )
1321.07 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 )
1321.07 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 )
1321.36 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 )
1321.36 s
[bash-language-server] Phase: installCheckPhase
1321.37 s
[bash-language-server] Executing versionCheckPhase
1321.51 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 )
1321.55 s
[bash-language-server] Did not find version 5.6.0 in the output of the command /nix/store/fcs2clcrs5mnyacfz6zw1npry66gqw0r-bash-language-server-5.6.0/bin/bash-language-server --help
1321.55 s
[bash-language-server] Usage:
1321.55 s
[bash-language-server] bash-language-server start Start listening on stdin/stdout
1321.55 s
[bash-language-server] bash-language-server -h, --help Display this help and exit
1321.55 s
[bash-language-server] bash-language-server -v, --version Print the version and exit
1321.55 s
[bash-language-server]
1321.55 s
[bash-language-server] Environment variables:
1321.55 s
[bash-language-server] BASH_IDE_LOG_LEVEL Set the log level (default: info)
1321.55 s
[bash-language-server]
1321.55 s
[bash-language-server] Further documentation: https://github.com/bash-lsp/bash-language-server
1321.74 s
[bash-language-server] Successfully managed to find version 5.6.0 in the output of the command /nix/store/fcs2clcrs5mnyacfz6zw1npry66gqw0r-bash-language-server-5.6.0/bin/bash-language-server --version
1321.74 s
[bash-language-server] 5.6.0
1321.74 s
[bash-language-server] Finished versionCheckPhase
1321.74 s
[bash-language-server] no Makefile or custom installCheckPhase, doing nothing
1322.19 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/fcs2clcrs5mnyacfz6zw1npry66gqw0r-bash-language-server-5.6.0
1322.59 s
[post-build-hook] Pushing 1 paths (46 are already present) using zstd to cache sellout ⏳
1322.63 s
[post-build-hook]
1322.95 s
[post-build-hook] Pushing /nix/store/fcs2clcrs5mnyacfz6zw1npry66gqw0r-bash-language-server-5.6.0 (5.88 MiB)
1324.18 s
[post-build-hook]
1324.18 s
[post-build-hook] All done.
1324.20 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/fcs2clcrs5mnyacfz6zw1npry66gqw0r-bash-language-server-5.6.0
1324.25 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1324.26 s
[post-build-hook] copying 1 paths...
1324.26 s
[post-build-hook] copying path '/nix/store/fcs2clcrs5mnyacfz6zw1npry66gqw0r-bash-language-server-5.6.0' to 'https://cache.nix-ci.com'...
1325.90 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1326.11 s
[post-build-hook] copying 1 paths...
1326.11 s
[post-build-hook] copying path '/nix/store/8gqj71k16b8r0wn6a1g1rlg8hj4kij65-bash-language-server-5.6.0.drv' to 'https://cache.nix-ci.com'...
1326.25 s
Progress: 42 of 50 built (1 building), 786 of 786 downloaded from cache
1326.32 s
Building project-manager-path-for-duoids
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 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 )
1326.32 s
[quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
1326.32 s
[quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
1326.32 s
[quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33..
1326.32 s
[quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
1326.32 s
[quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
1326.32 s
[quickcheck-instances] Phase: checkPhase
1326.32 s
[quickcheck-instances] Running 1 test suites...
1326.32 s
[quickcheck-instances] Test suite self-test: RUNNING...
1326.32 s
[quickcheck-instances] +++ OK, passed 100 tests.
1326.32 s
[quickcheck-instances] +++ OK, passed 100 tests.
1326.32 s
[quickcheck-instances] +++ OK, passed 100 tests.
1326.32 s
[quickcheck-instances] +++ OK, passed 100 tests.
1326.32 s
[quickcheck-instances] +++ OK, passed 100 tests.
1326.32 s
[quickcheck-instances] Test suite self-test: PASS
1326.32 s
[quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
1326.32 s
[quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
1326.32 s
[quickcheck-instances] Phase: haddockPhase
1326.32 s
[quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
1326.32 s
[quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33..
1326.32 s
[quickcheck-instances] Warning: The documentation for the following packages are not installed. No
1326.32 s
[quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
1326.32 s
[quickcheck-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1326.32 s
[quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
1326.32 s
[quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
1326.32 s
[quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
1326.32 s
[quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
1326.32 s
[quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
1326.32 s
[quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
1326.32 s
[quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
1326.32 s
[quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
1326.32 s
[quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
1326.32 s
[quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
1326.32 s
[quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
1326.32 s
[quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
1326.32 s
[quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
1326.38 s
[quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
1326.39 s
[quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
1326.43 s
[project-manager-path-for-duoids] created 346 symlinks in user environment
1326.43 s
[quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
1326.49 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/2l7xv6cqmw4pv1vy3g9ga9p126yja5cj-project-manager-path-for-duoids
1326.96 s
[post-build-hook] Pushing 1 paths (220 are already present) using zstd to cache sellout ⏳
1326.96 s
[post-build-hook]
1327.35 s
[post-build-hook] Pushing /nix/store/2l7xv6cqmw4pv1vy3g9ga9p126yja5cj-project-manager-path-for-duoids (96.70 KiB)
1328.27 s
[post-build-hook]
1328.27 s
[post-build-hook] All done.
1328.28 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/2l7xv6cqmw4pv1vy3g9ga9p126yja5cj-project-manager-path-for-duoids
1328.33 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1328.77 s
[post-build-hook] copying 1 paths...
1328.77 s
[post-build-hook] copying path '/nix/store/2l7xv6cqmw4pv1vy3g9ga9p126yja5cj-project-manager-path-for-duoids' to 'https://cache.nix-ci.com'...
1328.96 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1329.28 s
[post-build-hook] copying 1 paths...
1329.28 s
[post-build-hook] copying path '/nix/store/vcqadi8v7fmb18gvvckmb9x2qll33sgb-project-manager-path-for-duoids.drv' to 'https://cache.nix-ci.com'...
1329.47 s
Progress: 43 of 50 built (1 building), 786 of 786 downloaded from cache
1329.47 s
[quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
1329.47 s
[quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
1329.47 s
[quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
1329.47 s
[quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
1329.47 s
[quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
1329.47 s
[quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
1329.47 s
[quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
1329.47 s
[quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
1329.47 s
[quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
1329.47 s
[quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
1329.47 s
[quickcheck-instances] Haddock coverage:
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
1329.47 s
[quickcheck-instances] Missing documentation for:
1329.47 s
[quickcheck-instances] Module header
1329.47 s
[quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
1329.47 s
[quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
1329.47 s
[quickcheck-instances] - Data.Vector.Vector
1329.47 s
[quickcheck-instances] - Data.Vector.Primitive.Vector
1329.47 s
[quickcheck-instances] - Data.Vector.Storable.Vector
1329.47 s
[quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
1329.47 s
[quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
1329.47 s
[quickcheck-instances] - Data.Vector.Strict.Vector
1330.50 s
[quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
1330.50 s
[quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
1330.55 s
[quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
1330.56 s
[quickcheck-instances] Phase: installPhase
1330.61 s
[quickcheck-instances] Installing library in /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
1331.02 s
[quickcheck-instances] Phase: fixupPhase
1331.03 s
[quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33
1331.04 s
[quickcheck-instances] shrinking /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSquickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5-ghc9.8.4.so
1331.06 s
[quickcheck-instances] checking for references to /build/ in /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33...
1331.09 s
[quickcheck-instances] patching script interpreter paths in /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33
1331.10 s
[quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/lib
1331.21 s
[quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc
1331.22 s
[quickcheck-instances] checking for references to /build/ in /nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc...
1331.25 s
[quickcheck-instances] patching script interpreter paths in /nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc
1331.37 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33
1331.84 s
[post-build-hook] Pushing 2 paths (134 are already present) using zstd to cache sellout ⏳
1331.84 s
[post-build-hook]
1332.23 s
[post-build-hook] Pushing /nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc (1.50 MiB)
1332.32 s
[post-build-hook] Pushing /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33 (5.50 MiB)
1333.33 s
[post-build-hook]
1333.35 s
[post-build-hook] All done.
1333.35 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33
1333.39 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1333.54 s
[post-build-hook] copying 2 paths...
1333.54 s
[post-build-hook] copying path '/nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc' to 'https://cache.nix-ci.com'...
1333.82 s
[post-build-hook] copying path '/nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
1335.08 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1335.32 s
[post-build-hook] copying 16 paths...
1335.32 s
[post-build-hook] copying path '/nix/store/pp8bwxmd73x8v4wfyqn2sg0wg7813x52-assoc-1.1.1.drv' to 'https://cache.nix-ci.com'...
1335.32 s
[post-build-hook] copying path '/nix/store/diapcir670rmbar24s40v7a91358wnql-OneTuple-0.4.2.drv' to 'https://cache.nix-ci.com'...
1335.32 s
[post-build-hook] copying path '/nix/store/5m7qv9jircvwsmk93x9qq6767n6prcw8-case-insensitive-1.2.1.0.drv' to 'https://cache.nix-ci.com'...
1335.32 s
[post-build-hook] copying path '/nix/store/v4fw24gfchzcifgrpmdkncdlks885x9i-old-time-1.1.0.4.drv' to 'https://cache.nix-ci.com'...
1335.32 s
[post-build-hook] copying path '/nix/store/8770xhmk1rrdfg9vdasky682lf52hx4g-time-compat-1.9.8.drv' to 'https://cache.nix-ci.com'...
1335.32 s
[post-build-hook] copying path '/nix/store/bjzjp7mz4cq49ynfhah62qs6csmffi39-text-short-0.1.6.drv' to 'https://cache.nix-ci.com'...
1335.32 s
[post-build-hook] copying path '/nix/store/mavhx15d1aqcxxdki4hlddrnmzrpw00z-logict-0.8.2.0.drv' to 'https://cache.nix-ci.com'...
1335.32 s
[post-build-hook] copying path '/nix/store/4zhz1jqnhv6sahv23xxxx6pdkhfa1j6n-uuid-types-1.0.6.drv' to 'https://cache.nix-ci.com'...
1335.33 s
[post-build-hook] copying path '/nix/store/yrz0jw82370ps1iq8n791pbljmwb9rri-data-fix-0.3.4.drv' to 'https://cache.nix-ci.com'...
1335.49 s
[post-build-hook] copying path '/nix/store/9kgc7y2lwi4vwkzcf1lkqr4rp71853g0-smallcheck-1.2.1.1.drv' to 'https://cache.nix-ci.com'...
1335.50 s
[post-build-hook] copying path '/nix/store/sr1zs3k79ikqcq16pg6946cn5j05jnvs-these-1.2.1.drv' to 'https://cache.nix-ci.com'...
1335.65 s
[post-build-hook] copying path '/nix/store/jxi2vyh18jldylkhxms4xizg060a5s13-tasty-smallcheck-0.8.2.drv' to 'https://cache.nix-ci.com'...
1335.66 s
[post-build-hook] copying path '/nix/store/5qin8j8jf7n1j3vmsb6hk19dy9zk78wz-strict-0.5.1.drv' to 'https://cache.nix-ci.com'...
1335.77 s
[post-build-hook] copying path '/nix/store/c6k560n7f6xd3nz6rwf73831s0mrfc2n-integer-logarithms-1.0.4.drv' to 'https://cache.nix-ci.com'...
1335.89 s
[post-build-hook] copying path '/nix/store/4izmd8akz2m7wmsyc91hifqp35yy7jly-scientific-0.3.8.0.drv' to 'https://cache.nix-ci.com'...
1336.01 s
[post-build-hook] copying path '/nix/store/ryqw45m33hf297ini26lyx11s0c362y7-quickcheck-instances-0.3.33.drv' to 'https://cache.nix-ci.com'...
1336.15 s
Progress: 44 of 50 built, 786 of 786 downloaded from cache
1336.21 s
Building extra
1336.35 s
[extra] Phase: setupCompilerEnvironmentPhase
1336.35 s
[extra] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
1336.53 s
[extra] Phase: unpackPhase
1336.54 s
[extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
1336.55 s
[extra] source root is extra-1.8.1
1336.55 s
[extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
1336.56 s
[extra] Phase: patchPhase
1336.56 s
[extra] Phase: compileBuildDriverPhase
1336.57 s
[extra] setupCompileFlags: -package-db=/build/tmp.K0TmFgoFDV/setup-package.conf.d -threaded
1336.60 s
[extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.K0TmFgoFDV/Main.o )
1336.65 s
[extra] [2 of 2] Linking Setup
1337.80 s
[extra] Phase: updateAutotoolsGnuConfigScriptsPhase
1337.81 s
[extra] Phase: configurePhase
1337.82 s
[extra] configureFlags: --verbose --prefix=/nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.K0TmFgoFDV/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
1337.82 s
[extra] Using Parsec parser
1337.82 s
[extra] Configuring extra-1.8.1...
1338.09 s
[extra] Dependency base >=4.9 && <5: using base-4.19.2.0
1338.09 s
[extra] Dependency clock >=0.7: using clock-0.8.4
1338.09 s
[extra] Dependency directory: using directory-1.3.8.5
1338.09 s
[extra] Dependency filepath: using filepath-1.4.301.0
1338.09 s
[extra] Dependency process: using process-1.6.25.0
1338.09 s
[extra] Dependency time: using time-1.12.2
1338.09 s
[extra] Dependency unix: using unix-2.8.6.0
1338.09 s
[extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
1338.09 s
[extra] Dependency base >=4 && <5: using base-4.19.2.0
1338.09 s
[extra] Dependency directory: using directory-1.3.8.5
1338.09 s
[extra] Dependency extra: using extra-1.8.1
1338.09 s
[extra] Dependency filepath: using filepath-1.4.301.0
1338.09 s
[extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
1338.09 s
[extra] Dependency unix: using unix-2.8.6.0
1338.30 s
[extra] Source component graph:
1338.30 s
[extra] component lib
1338.30 s
[extra] component test:extra-test dependency lib
1338.30 s
[extra] Configured component graph:
1338.30 s
[extra] component extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
1338.30 s
[extra] include base-4.19.2.0-a4d2
1338.30 s
[extra] include clock-0.8.4-CxAW1ib2HH22y55Hvl745i
1338.30 s
[extra] include directory-1.3.8.5-fa66
1338.30 s
[extra] include filepath-1.4.301.0-5f33
1338.30 s
[extra] include process-1.6.25.0-8170
1338.30 s
[extra] include time-1.12.2-84c3
1338.30 s
[extra] include unix-2.8.6.0-c2f8
1338.30 s
[extra] component extra-1.8.1-BvqFbED1W6q2244RvTLt4F-extra-test
1338.30 s
[extra] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1338.30 s
[extra] include base-4.19.2.0-a4d2
1338.30 s
[extra] include directory-1.3.8.5-fa66
1338.30 s
[extra] include extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
1338.30 s
[extra] include filepath-1.4.301.0-5f33
1338.30 s
[extra] include quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
1338.30 s
[extra] include unix-2.8.6.0-c2f8
1338.30 s
[extra] Linked component graph:
1338.30 s
[extra] unit extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
1338.30 s
[extra] include base-4.19.2.0-a4d2
1338.30 s
[extra] include clock-0.8.4-CxAW1ib2HH22y55Hvl745i
1338.30 s
[extra] include directory-1.3.8.5-fa66
1338.30 s
[extra] include filepath-1.4.301.0-5f33
1338.30 s
[extra] include process-1.6.25.0-8170
1338.30 s
[extra] include time-1.12.2-84c3
1338.30 s
[extra] include unix-2.8.6.0-c2f8
1338.30 s
[extra] Control.Concurrent.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.Version.Extra,Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Extra,Numeric.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Numeric.Extra,System.Directory.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:System.Environment.Extra,System.IO.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:System.IO.Extra,System.Info.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:System.Info.Extra,System.Process.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:System.Process.Extra,System.Time.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:System.Time.Extra,Text.Read.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Text.Read.Extra
1338.30 s
[extra] unit extra-1.8.1-BvqFbED1W6q2244RvTLt4F-extra-test
1338.30 s
[extra] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1338.30 s
[extra] include base-4.19.2.0-a4d2
1338.30 s
[extra] include directory-1.3.8.5-fa66
1338.30 s
[extra] include extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
1338.30 s
[extra] include filepath-1.4.301.0-5f33
1338.30 s
[extra] include quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
1338.30 s
[extra] include unix-2.8.6.0-c2f8
1338.30 s
[extra] Ready component graph:
1338.30 s
[extra] definite extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
1338.30 s
[extra] depends base-4.19.2.0-a4d2
1338.30 s
[extra] depends clock-0.8.4-CxAW1ib2HH22y55Hvl745i
1338.30 s
[extra] depends directory-1.3.8.5-fa66
1338.30 s
[extra] depends filepath-1.4.301.0-5f33
1338.30 s
[extra] depends process-1.6.25.0-8170
1338.30 s
[extra] depends time-1.12.2-84c3
1338.30 s
[extra] depends unix-2.8.6.0-c2f8
1338.30 s
[extra] definite extra-1.8.1-BvqFbED1W6q2244RvTLt4F-extra-test
1338.30 s
[extra] depends QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1338.30 s
[extra] depends base-4.19.2.0-a4d2
1338.30 s
[extra] depends directory-1.3.8.5-fa66
1338.30 s
[extra] depends extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
1338.30 s
[extra] depends filepath-1.4.301.0-5f33
1338.30 s
[extra] depends quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
1338.30 s
[extra] depends unix-2.8.6.0-c2f8
1338.30 s
[extra] Using Cabal-3.10.3.0 compiled by ghc-9.8
1338.30 s
[extra] Using compiler: ghc-9.8.4
1338.30 s
[extra] Using install prefix: /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1
1338.30 s
[extra] Executables installed in:
1338.30 s
[extra] /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/bin
1338.30 s
[extra] Libraries installed in:
1338.30 s
[extra] /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
1338.30 s
[extra] Dynamic Libraries installed in:
1338.30 s
[extra] /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
1338.30 s
[extra] Private executables installed in:
1338.30 s
[extra] /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/libexec/x86_64-linux-ghc-9.8.4/extra-1.8.1
1338.30 s
[extra] Data files installed in:
1338.30 s
[extra] /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/share/x86_64-linux-ghc-9.8.4/extra-1.8.1
1338.30 s
[extra] Documentation installed in:
1338.30 s
[extra] /nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc/share/doc/extra-1.8.1
1338.30 s
[extra] Configuration files installed in:
1338.30 s
[extra] /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/etc
1338.30 s
[extra] No alex found
1338.30 s
[extra] Using ar found on system at:
1338.30 s
[extra] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
1338.30 s
[extra] No c2hs found
1338.30 s
[extra] No cpphs found
1338.30 s
[extra] No doctest found
1338.30 s
[extra] Using gcc version 14.3.0 given by user at:
1338.30 s
[extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
1338.30 s
[extra] Using ghc version 9.8.4 found on system at:
1338.30 s
[extra] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
1338.30 s
[extra] Using ghc-pkg version 9.8.4 found on system at:
1338.30 s
[extra] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
1338.30 s
[extra] No ghcjs found
1338.30 s
[extra] No ghcjs-pkg found
1338.30 s
[extra] No greencard found
1338.30 s
[extra] Using haddock version 2.30.0 found on system at:
1338.30 s
[extra] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
1338.30 s
[extra] No happy found
1338.30 s
[extra] Using haskell-suite found on system at: haskell-suite-dummy-location
1338.30 s
[extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1338.30 s
[extra] No hmake found
1338.30 s
[extra] Using hpc version 0.69 found on system at:
1338.30 s
[extra] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
1338.30 s
[extra] Using hsc2hs version 0.68.10 found on system at:
1338.30 s
[extra] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
1338.30 s
[extra] Using hscolour version 1.25 found on system at:
1338.30 s
[extra] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
1338.30 s
[extra] No jhc found
1338.30 s
[extra] Using ld found on system at:
1338.30 s
[extra] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
1338.30 s
[extra] No pkg-config found
1338.30 s
[extra] Using runghc version 9.8.4 found on system at:
1338.30 s
[extra] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
1338.30 s
[extra] Using strip version 2.44 found on system at:
1338.30 s
[extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
1338.30 s
[extra] Using tar found on system at:
1338.30 s
[extra] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
1338.30 s
[extra] No uhc found
1338.41 s
[extra] Phase: buildPhase
1338.45 s
[extra] Preprocessing library for extra-1.8.1..
1338.46 s
[extra] Building library for extra-1.8.1..
1338.69 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 )
1338.77 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 )
1338.77 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 )
1338.78 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 )
1338.78 s
[extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
1338.78 s
[extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
1338.78 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 )
1339.69 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 )
1339.74 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 )
1339.83 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 )
1339.83 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 )
1339.83 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 )
1339.98 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 )
1340.04 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 )
1340.21 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 )
1340.21 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 )
1340.21 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 )
1340.39 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 )
1340.39 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 )
1340.43 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 )
1340.43 s
[extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
1340.48 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 )
1340.85 s
[extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
1341.01 s
[extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
1341.01 s
[extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
1341.03 s
[extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
1341.04 s
[extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
1341.04 s
[extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
1341.04 s
[extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
1341.99 s
[extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
1342.12 s
[extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
1342.21 s
[extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
1342.21 s
[extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
1342.21 s
[extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
1342.46 s
[extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
1342.60 s
[extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
1342.78 s
[extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
1342.78 s
[extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
1342.78 s
[extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
1343.02 s
[extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
1343.02 s
[extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
1343.15 s
[extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
1343.15 s
[extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
1343.28 s
[extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
1344.43 s
[extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
1344.43 s
[extra] Building test suite 'extra-test' for extra-1.8.1..
1344.49 s
[extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
1344.81 s
[extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
1346.56 s
[extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
1346.56 s
[extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
1346.83 s
[extra] [5 of 5] Linking dist/build/extra-test/extra-test
1347.49 s
[extra] Phase: checkPhase
1347.52 s
[extra] Running 1 test suites...
1347.52 s
[extra] Test suite extra-test: RUNNING...
1347.52 s
[extra] withTempFile
1347.52 s
[extra] +++ OK, passed 100 tests.
1347.52 s
[extra] captureOutput
1347.52 s
[extra] +++ OK, passed 100 tests.
1347.52 s
[extra] \(x :: IO Int) -> void (once x) == pure ()
1347.55 s
[extra] +++ OK, passed 100 tests.
1347.55 s
[extra] \(x :: IO Int) -> join (once x) == x
1347.58 s
[extra] +++ OK, passed 100 tests.
1347.58 s
[extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
1347.62 s
[extra] +++ OK, passed 100 tests.
1347.62 s
[extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
1347.65 s
[extra] +++ OK, passed 100 tests.
1347.65 s
[extra] \(x :: IO Int) -> join (onceFork x) == x
1347.67 s
[extra] +++ OK, passed 100 tests.
1347.67 s
[extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
1347.70 s
[extra] +++ OK, passed 100 tests.
1347.70 s
[extra] stringException "test" == pure "test"
1347.70 s
[extra] +++ OK, passed 100 tests.
1347.70 s
[extra] stringException ("test" ++ undefined) == pure "test<Exception>"
1347.70 s
[extra] +++ OK, passed 100 tests.
1347.70 s
[extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
1347.70 s
[extra] +++ OK, passed 100 tests.
1347.70 s
[extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
1347.70 s
[extra] +++ OK, passed 100 tests.
1347.70 s
[extra] ignore (print 1) == print 1
1347.70 s
[extra] +++ OK, passed 100 tests.
1347.70 s
[extra] ignore (fail "die") == pure ()
1347.70 s
[extra] +++ OK, passed 100 tests.
1347.70 s
[extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
1347.70 s
[extra] +++ OK, passed 100 tests.
1347.70 s
[extra] seq (errorIO "foo") (print 1) == print 1
1347.70 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] seq (assertIO False) (print 1) == print 1
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] retry 1 (print "x") == print "x"
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] retry 3 (fail "die") == fail "die"
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] whenJust Nothing print == pure ()
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] whenJust (Just 1) print == print 1
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] pureIf @Maybe True 5 == Just 5
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] pureIf @Maybe False 5 == Nothing
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] pureIf @[] True 5 == [5]
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] pureIf @[] False 5 == []
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] whenMaybe True (print 1) == fmap Just (print 1)
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] whenMaybe False (print 1) == pure Nothing
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] \(x :: Maybe ()) -> unit x == x
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] guarded even 2 == [2]
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] guarded odd 2 == Nothing
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] guarded (not.null) "My Name" == Just "My Name"
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] guardedA (return . even) 42 == Just [42]
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] guardedA (return . odd) 42 == Just []
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] fold1M (\x y -> Just x) [] == undefined
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] partitionM (const Nothing) [1,2,3] == Nothing
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] Just True ||^ undefined == Just True
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] Just False ||^ Just True == Just True
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] Just False ||^ Just False == Just False
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] Just False &&^ undefined == Just False
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] Just True &&^ Just True == Just True
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] Just True &&^ Just False == Just False
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] anyM Just [False,True ,undefined] == Just True
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] anyM Just [False,False,undefined] == undefined
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] allM Just [True,False,undefined] == Just False
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] allM Just [True,True ,undefined] == undefined
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] orM [Just False,Just True ,undefined] == Just True
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] orM [Just False,Just False,undefined] == undefined
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] \xs -> Just (or xs) == orM (map Just xs)
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] andM [Just True,Just False,undefined] == Just False
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] andM [Just True,Just True ,undefined] == undefined
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] \xs -> Just (and xs) == andM (map Just xs)
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] findM (Just . isUpper) "teST" == Just (Just 'S')
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] findM (Just . isUpper) "test" == Just Nothing
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
1347.71 s
[extra] +++ OK, passed 100 tests.
1347.71 s
[extra] fromLeft 1 (Left 3) == 3
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] fromLeft 1 (Right "foo") == 1
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] fromRight 1 (Right 3) == 3
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] fromRight 1 (Left "foo") == 1
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] \x -> fromLeft' (Left x) == x
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] \x -> fromLeft' (Right x) == undefined
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] \x -> fromRight' (Right x) == x
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] \x -> fromRight' (Left x) == undefined
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] \x -> fromEither (Left x ) == x
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] \x -> fromEither (Right x) == x
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] \a b -> maybeToEither a (Just b) == Right b
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] \a -> maybeToEither a Nothing == Left a
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] \x -> eitherToMaybe (Left x) == Nothing
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] \x -> eitherToMaybe (Right x) == Just x
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] mapLeft show (Left 1) == Left "1"
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] mapLeft show (Right True) == Right True
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] mapRight show (Left 1) == Left 1
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] mapRight show (Right True) == Right "True"
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
1347.72 s
[extra] +++ OK, passed 100 tests.
1347.72 s
[extra] \xs -> repeatedly word1 (trim xs) == words xs
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \xs -> repeatedly line1 xs == lines xs
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] disjoint [1,2,3] [4,5] == True
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] disjoint [1,2,3] [4,1] == False
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] disjointOrd [1,2,3] [4,5] == True
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] disjointOrd [1,2,3] [4,1] == False
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] anySame [1,1,2] == True
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] anySame [1,2,3] == False
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] anySame (1:2:1:undefined) == True
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] anySame [] == False
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \xs -> anySame xs == (length (nub xs) < length xs)
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] allSame [1,1,2] == False
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] allSame [1,1,1] == True
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] allSame [1] == True
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] allSame [] == True
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] allSame (1:1:2:undefined) == False
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \xs -> allSame xs == (length (nub xs) <= 1)
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] headDef 1 [] == 1
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] headDef 1 [2,3,4] == 2
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] lastDef 1 [] == 1
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] lastDef 1 [2,3,4] == 4
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \x xs -> lastDef x xs == last (x:xs)
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] [2,3,4] !? 1 == Just 3
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] [2,3,4] !? (-1) == Nothing
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] [] !? 0 == Nothing
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] notNull [] == False
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] notNull [1] == True
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \xs -> notNull xs == not (null xs)
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] list 1 (\v _ -> v - 2) [] == 1
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] unsnoc "test" == Just ("tes",'t')
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] unsnoc "" == Nothing
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] cons 't' "est" == "test"
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \x xs -> uncons (cons x xs) == Just (x,xs)
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] snoc "tes" 't' == "test"
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] enumerate == [False, True]
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] takeEnd 3 "hello" == "llo"
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] takeEnd 5 "bye" == "bye"
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] takeEnd (-1) "bye" == ""
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \i xs -> takeEnd i xs `isSuffixOf` xs
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] dropEnd 3 "hello" == "he"
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] dropEnd 5 "bye" == ""
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] dropEnd (-1) "bye" == "bye"
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \i xs -> dropEnd i xs `isPrefixOf` xs
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
1347.73 s
[extra] +++ OK, passed 100 tests.
1347.73 s
[extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] splitAtEnd 3 "hello" == ("he","llo")
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] splitAtEnd 3 "he" == ("", "he")
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] \i xs -> uncurry (++) (splitAt i xs) == xs
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] \i xs -> zip [i..] xs == zipFrom i xs
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] zipFrom False [1..3] == [(False,1),(True, 2)]
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] takeWhileEnd even [2,3,4,6] == [4,6]
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] trim " hello " == "hello"
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] trimStart " hello " == "hello "
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] trimEnd " hello " == " hello"
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] \s -> trim s == trimEnd (trimStart s)
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] lower "This is A TEST" == "this is a test"
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] lower "" == ""
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] upper "This is A TEST" == "THIS IS A TEST"
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] upper "" == ""
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] word1 "" == ("", "")
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] word1 "keyword rest of string" == ("keyword","rest of string")
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] \s -> fst (word1 s) == concat (take 1 $ words s)
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] \s -> words (snd $ word1 s) == drop 1 (words s)
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] line1 "" == ("", "")
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] line1 "test" == ("test","")
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] line1 "test\n" == ("test","")
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] line1 "test\nrest" == ("test","rest")
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] escapeHTML "this is a test" == "this is a test"
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] escapeHTML "<b>\"g&t\"</n>" == "<b>"g&t"</n>"
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] escapeHTML "t'was another test" == "t'was another test"
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] \xs -> unescapeHTML (escapeHTML xs) == xs
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] escapeJSON "this is a test" == "this is a test"
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] \xs -> unescapeJSON (escapeJSON xs) == xs
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] maximumOn id [] == undefined
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] maximumOn length ["test","extra","a"] == "extra"
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] minimumOn id [] == undefined
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] minimumOn length ["test","extra","a"] == "a"
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.74 s
[extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
1347.74 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] sum' [1, 2, 3] == 6
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] sumOn' read ["1", "2", "3"] == 6
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] product' [1, 2, 4] == 8
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] productOn' read ["1", "2", "4"] == 8
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] merge "ace" "bd" == "abcde"
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] replace "el" "e" "Hello" == "Helo"
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] replace "" "x" "Hello" == "xHxexlxlxox"
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] replace "" "x" "" == "x"
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] \xs ys -> replace xs xs ys == ys
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] breakEnd isLower "youRE" == ("you","RE")
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] breakEnd isLower "youre" == ("youre","")
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] breakEnd isLower "YOURE" == ("","YOURE")
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] spanEnd isUpper "youRE" == ("you","RE")
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.75 s
[extra] \s -> wordsBy isSpace s == words s
1347.75 s
[extra] +++ OK, passed 100 tests.
1347.76 s
[extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
1347.76 s
[extra] +++ OK, passed 100 tests.
1347.76 s
[extra] \s -> linesBy (== '\n') s == lines s
1347.76 s
[extra] +++ OK, passed 100 tests.
1347.76 s
[extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
1347.76 s
[extra] +++ OK, passed 100 tests.
1347.76 s
[extra] firstJust id [Nothing,Just 3] == Just 3
1347.76 s
[extra] +++ OK, passed 100 tests.
1347.76 s
[extra] firstJust id [Nothing,Nothing] == Nothing
1347.76 s
[extra] +++ OK, passed 100 tests.
1347.76 s
[extra] drop1 "" == ""
1347.76 s
[extra] +++ OK, passed 100 tests.
1347.76 s
[extra] drop1 "test" == "est"
1347.76 s
[extra] +++ OK, passed 100 tests.
1347.76 s
[extra] \xs -> drop 1 xs == drop1 xs
1347.76 s
[extra] +++ OK, passed 100 tests.
1347.76 s
[extra] dropEnd1 "" == ""
1347.76 s
[extra] +++ OK, passed 100 tests.
1347.76 s
[extra] dropEnd1 "test" == "tes"
1347.76 s
[extra] +++ OK, passed 100 tests.
1347.76 s
[extra] \xs -> dropEnd 1 xs == dropEnd1 xs
1347.76 s
[extra] +++ OK, passed 100 tests.
1347.76 s
[extra] mconcatMap Sum [1,2,3] == Sum 6
1347.76 s
[extra] +++ OK, passed 100 tests.
1347.76 s
[extra] \f xs -> mconcatMap f xs == concatMap f xs
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] breakOn "::" "a::b::c" == ("a", "::b::c")
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] breakOn "/" "foobar" == ("foobar", "")
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] splitOn "x" "x" == ["",""]
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] splitOn "x" "" == [""]
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
1347.77 s
[extra] +++ OK, passed 100 tests; 19 discarded.
1347.77 s
[extra] \c x -> splitOn [c] x == split (==c) x
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] split (== 'a') "" == [""]
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] split (== ',') "my,list,here" == ["my","list","here"]
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] dropWhileEnd isSpace "ab cde " == "ab cde"
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] last (dropWhileEnd even [undefined,3]) == undefined
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] last (dropWhileEnd' even [undefined,3]) == 3
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] head (dropWhileEnd even (3:undefined)) == 3
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] head (dropWhileEnd' even (3:undefined)) == undefined
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] dropPrefix "Mr. " "Mr. Men" == "Men"
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] dropSuffix "!" "Hello World!" == "Hello World"
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] dropSuffix "!" "Hello World!!" == "Hello World!"
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] dropSuffix "!" "Hello World." == "Hello World."
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] stripSuffix "bar" "foobar" == Just "foo"
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] stripSuffix "" "baz" == Just "baz"
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] stripSuffix "foo" "quux" == Nothing
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] stripInfix "/" "foobar" == Nothing
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] chunksOf 3 "my test" == ["my ","tes","t"]
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] chunksOf 3 "mytest" == ["myt","est"]
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] chunksOf 8 "" == []
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] chunksOf 0 "test" == undefined
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] nubSort "this is a test" == " aehist"
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] \xs -> nubSort xs == nub (sort xs)
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] nubOrd "this is a test" == "this ae"
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] \xs -> nubOrd xs == nub xs
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.77 s
[extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
1347.77 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] comparingLength [1,2,3] [False] == GT
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] comparingLength [1,2] "ab" == EQ
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] comparingLength [1,2] (1:2:3:undefined) == LT
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] comparingLength (1:2:3:undefined) [1,2] == GT
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] mwhen True "test" == "test"
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] mwhen False "test" == ""
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] first succ (1,"test") == (2,"test")
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] second reverse (1,"test") == (1,"tset")
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] (succ *** reverse) (1,"test") == (2,"tset")
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] (succ &&& pred) 1 == (2,0)
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] dupe 12 == (12, 12)
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] both succ (1,2) == (2,3)
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] first3 succ (1,1,1) == (2,1,1)
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] second3 succ (1,1,1) == (1,2,1)
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] third3 succ (1,1,1) == (1,1,2)
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] \x -> readVersion (showVersion x) == x
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] readVersion "hello" == undefined
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] showDP 4 pi == "3.1416"
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] showDP 0 pi == "3"
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] showDP 2 3 == "3.00"
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] isWindows == (os == "mingw32")
1347.78 s
[extra] +++ OK, passed 100 tests.
1347.78 s
[extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
1347.80 s
[extra] +++ OK, passed 100 tests.
1347.80 s
[extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
1347.81 s
[extra] +++ OK, passed 100 tests.
1347.81 s
[extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
1347.83 s
[extra] +++ OK, passed 100 tests.
1347.83 s
[extra] captureOutput (print 1) == pure ("1\n",())
1347.83 s
[extra] +++ OK, passed 100 tests.
1347.83 s
[extra] withTempFile doesFileExist == pure True
1347.83 s
[extra] +++ OK, passed 100 tests.
1347.83 s
[extra] (doesFileExist =<< withTempFile pure) == pure False
1347.83 s
[extra] +++ OK, passed 100 tests.
1347.83 s
[extra] withTempFile readFile' == pure ""
1347.83 s
[extra] +++ OK, passed 100 tests.
1347.83 s
[extra] withTempDir doesDirectoryExist == pure True
1347.83 s
[extra] +++ OK, passed 100 tests.
1347.83 s
[extra] (doesDirectoryExist =<< withTempDir pure) == pure False
1347.83 s
[extra] +++ OK, passed 100 tests.
1347.83 s
[extra] withTempDir listFiles == pure []
1347.83 s
[extra] +++ OK, passed 100 tests.
1347.83 s
[extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
1347.83 s
[extra] +++ OK, passed 100 tests.
1347.83 s
[extra] fileEq "does_not_exist" "does_not_exist" == undefined
1347.83 s
[extra] +++ OK, passed 100 tests.
1347.83 s
[extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
1347.83 s
[extra] +++ OK, passed 100 tests.
1347.83 s
[extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
1347.83 s
[extra] +++ OK, passed 100 tests.
1347.83 s
[extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
1347.83 s
[extra] +++ OK, passed 100 tests.
1347.83 s
[extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
1347.83 s
[extra] +++ OK, passed 100 tests.
1347.83 s
[extra] fmap (round . fst) (duration $ sleep 1) == pure 1
1348.84 s
[extra] +++ OK, passed 100 tests.
1348.84 s
[extra] timeout (-3) (print 1) == pure Nothing
1348.84 s
[extra] +++ OK, passed 100 tests.
1348.84 s
[extra] timeout 0.1 (print 1) == fmap Just (print 1)
1348.84 s
[extra] +++ OK, passed 100 tests.
1348.84 s
[extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
1348.94 s
[extra] 0.100239378
1348.94 s
[extra] +++ OK, passed 100 tests.
1348.94 s
[extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
1349.04 s
[extra] +++ OK, passed 100 tests.
1349.04 s
[extra] showDuration 3.435 == "3.44s"
1349.04 s
[extra] +++ OK, passed 100 tests.
1349.04 s
[extra] showDuration 623.8 == "10m24s"
1349.04 s
[extra] +++ OK, passed 100 tests.
1349.04 s
[extra] showDuration 62003.8 == "17h13m"
1349.04 s
[extra] +++ OK, passed 100 tests.
1349.04 s
[extra] showDuration 1e8 == "27777h47m"
1349.04 s
[extra] +++ OK, passed 100 tests.
1349.04 s
[extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
1349.04 s
[extra] +++ OK, passed 100 tests.
1349.04 s
[extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
1350.04 s
[extra] +++ OK, passed 100 tests.
1350.04 s
[extra] Extra export
1350.04 s
[extra] +++ OK, passed 100 tests.
1350.04 s
[extra] withTempFile
1350.05 s
[extra] ....done
1350.13 s
[extra] withTempDir
1350.13 s
[extra] ....done
1350.13 s
[extra] retry
1350.13 s
[extra] +++ OK, passed 100 tests.
1350.13 s
[extra] barrier
1350.13 s
[extra] Success (325 tests)
1350.13 s
[extra] Test suite extra-test: PASS
1350.13 s
[extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
1350.13 s
[extra] 1 of 1 test suites (1 of 1 test cases) passed.
1350.13 s
[extra] Phase: haddockPhase
1350.19 s
[extra] Preprocessing library for extra-1.8.1..
1350.20 s
[extra] Running Haddock on library for extra-1.8.1..
1350.23 s
[extra] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1350.49 s
[extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
1350.51 s
[extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
1350.51 s
[extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
1350.52 s
[extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
1350.53 s
[extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing )
1350.54 s
[extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
1350.54 s
[extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
1350.75 s
[extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
1350.75 s
[extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
1350.77 s
[extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
1350.77 s
[extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
1350.79 s
[extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
1350.83 s
[extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
1350.84 s
[extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
1350.86 s
[extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
1350.88 s
[extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
1350.88 s
[extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
1350.98 s
[extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
1350.98 s
[extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
1351.00 s
[extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
1351.02 s
[extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing )
1351.07 s
[extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
1351.08 s
[extra] Haddock coverage:
1351.08 s
[extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
1351.08 s
[extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
1351.08 s
[extra] Warning: 'Arrow' is out of scope.
1351.08 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
1351.08 s
[extra] 100% ( 28 / 28) in 'Data.Tuple.Extra'
1351.08 s
[extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
1351.08 s
[extra] 100% ( 7 / 7) in 'Numeric.Extra'
1351.08 s
[extra] Warning: '(:)' is out of scope.
1351.08 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
1351.08 s
[extra] Warning: 'unzip' is ambiguous. It is defined
1351.08 s
[extra] * in ‘Data.Functor’
1351.08 s
[extra] * in ‘GHC.List’
1351.08 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1351.08 s
[extra] by specifying the type/value namespace explicitly.
1351.08 s
[extra] Defaulting to the one defined in ‘GHC.List’
1351.09 s
[extra] Warning: 'firstJustM' is out of scope.
1351.09 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
1351.09 s
[extra] 100% ( 85 / 85) in 'Data.List.Extra'
1351.09 s
[extra] Warning: 'Version' is ambiguous. It is defined
1351.09 s
[extra] * in ‘Data.Version’
1351.09 s
[extra] * in ‘Data.Version’
1351.09 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1351.09 s
[extra] by specifying the type/value namespace explicitly.
1351.09 s
[extra] Defaulting to the one defined in ‘Data.Version’
1351.09 s
[extra] 100% ( 3 / 3) in 'Data.Version.Extra'
1351.09 s
[extra] Warning: 'length' is ambiguous. It is defined
1351.09 s
[extra] * in ‘Data.Foldable’
1351.09 s
[extra] * in ‘Data.List.NonEmpty’
1351.09 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1351.10 s
[extra] by specifying the type/value namespace explicitly.
1351.10 s
[extra] Defaulting to the one defined in ‘Data.List.NonEmpty’
1351.10 s
[extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
1351.10 s
[extra] Warning: 'fromJust' is out of scope.
1351.10 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
1351.10 s
[extra] 100% ( 11 / 11) in 'Data.Either.Extra'
1351.10 s
[extra] Warning: 'ErrorCall' is ambiguous. It is defined
1351.10 s
[extra] * in ‘GHC.Exception’
1351.10 s
[extra] * in ‘GHC.Exception’
1351.10 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1351.10 s
[extra] by specifying the type/value namespace explicitly.
1351.10 s
[extra] Defaulting to the one defined in ‘GHC.Exception’
1351.10 s
[extra] Warning: 'AssertionFailed' is ambiguous. It is defined
1351.10 s
[extra] * in ‘GHC.IO.Exception’
1351.10 s
[extra] * in ‘GHC.IO.Exception’
1351.10 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1351.10 s
[extra] by specifying the type/value namespace explicitly.
1351.10 s
[extra] Defaulting to the one defined in ‘GHC.IO.Exception’
1351.10 s
[extra] Warning: 'SomeException' is ambiguous. It is defined
1351.10 s
[extra] * in ‘GHC.Exception.Type’
1351.10 s
[extra] * in ‘GHC.Exception.Type’
1351.10 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1351.10 s
[extra] by specifying the type/value namespace explicitly.
1351.10 s
[extra] Defaulting to the one defined in ‘GHC.Exception.Type’
1351.10 s
[extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
1351.10 s
[extra] Warning: 'partition' is out of scope.
1351.10 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
1351.10 s
[extra] Warning: 'mconcatMap' is out of scope.
1351.10 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
1351.10 s
[extra] Warning: 'find' is out of scope.
1351.10 s
[extra] If you qualify the identifier, haddock can try to link it anyway.
1351.10 s
[extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
1351.11 s
[extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
1351.11 s
[extra] Missing documentation for:
1351.11 s
[extra] Module header
1351.11 s
[extra] Warning: 'Lock' is ambiguous. It is defined
1351.11 s
[extra] * at src/Control/Concurrent/Extra.hs:106:16
1351.11 s
[extra] * at src/Control/Concurrent/Extra.hs:106:1
1351.11 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1351.11 s
[extra] by specifying the type/value namespace explicitly.
1351.11 s
[extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
1351.11 s
[extra] Warning: 'Var' is ambiguous. It is defined
1351.11 s
[extra] * at src/Control/Concurrent/Extra.hs:146:17
1351.11 s
[extra] * at src/Control/Concurrent/Extra.hs:146:1
1351.11 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1351.11 s
[extra] by specifying the type/value namespace explicitly.
1351.11 s
[extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
1351.11 s
[extra] Warning: 'Barrier' is ambiguous. It is defined
1351.11 s
[extra] * at src/Control/Concurrent/Extra.hs:210:21
1351.11 s
[extra] * at src/Control/Concurrent/Extra.hs:210:1
1351.11 s
[extra] You may be able to disambiguate the identifier by qualifying it or
1351.11 s
[extra] by specifying the type/value namespace explicitly.
1351.11 s
[extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
1351.11 s
[extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
1351.11 s
[extra] 100% ( 8 / 8) in 'System.Directory.Extra'
1351.11 s
[extra] 100% ( 2 / 2) in 'System.Environment.Extra'
1351.11 s
[extra] 100% ( 26 / 26) in 'System.IO.Extra'
1351.11 s
[extra] 100% ( 4 / 4) in 'System.Info.Extra'
1351.11 s
[extra] 100% ( 5 / 5) in 'System.Process.Extra'
1351.12 s
[extra] 100% ( 8 / 8) in 'System.Time.Extra'
1351.12 s
[extra] 100% (270 /270) in 'Extra'
1351.12 s
[extra] 100% ( 2 / 2) in 'Text.Read.Extra'
1351.37 s
[extra] Warning: Data.Tuple.Extra: could not find link destinations for:
1351.37 s
[extra] - GHC.Generics.Rep1_Solo
1351.37 s
[extra] - GHC.Generics.Rep_Solo
1353.92 s
[extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
1353.97 s
[extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
1353.98 s
[extra] Phase: installPhase
1354.03 s
[extra] Installing library in /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
1354.43 s
[extra] Phase: fixupPhase
1354.45 s
[extra] shrinking RPATHs of ELF executables and libraries in /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1
1354.46 s
[extra] shrinking /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSextra-1.8.1-CYkQRzu1AaDDqBLND76rc2-ghc9.8.4.so
1354.47 s
[extra] checking for references to /build/ in /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1...
1354.50 s
[extra] patching script interpreter paths in /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1
1354.51 s
[extra] stripping (with command strip and flags -S -p) in /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/lib
1354.61 s
[extra] shrinking RPATHs of ELF executables and libraries in /nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc
1354.63 s
[extra] checking for references to /build/ in /nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc...
1354.66 s
[extra] patching script interpreter paths in /nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc
1354.79 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1 /nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc
1355.22 s
[post-build-hook] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
1355.22 s
[post-build-hook]
1355.60 s
[post-build-hook] Pushing /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1 (4.13 MiB)
1355.63 s
[post-build-hook] Pushing /nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc (3.12 MiB)
1356.82 s
[post-build-hook]
1356.82 s
[post-build-hook] All done.
1356.83 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1 /nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc
1356.87 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1357.01 s
[post-build-hook] copying 2 paths...
1357.01 s
[post-build-hook] copying path '/nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc' to 'https://cache.nix-ci.com'...
1357.59 s
[post-build-hook] copying path '/nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1' to 'https://cache.nix-ci.com'...
1358.77 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1358.98 s
[post-build-hook] copying 2 paths...
1358.98 s
[post-build-hook] copying path '/nix/store/w8xx9khppgifzcvsmsdm137whj73mjz9-clock-0.8.4.drv' to 'https://cache.nix-ci.com'...
1359.11 s
[post-build-hook] copying path '/nix/store/42688gka76n00qgv6x7943jvk7v8sadx-extra-1.8.1.drv' to 'https://cache.nix-ci.com'...
1359.64 s
Progress: 45 of 50 built, 786 of 786 downloaded from cache
1359.77 s
Building algebraic-graphs
1359.86 s
[algebraic-graphs] Phase: setupCompilerEnvironmentPhase
1359.88 s
[algebraic-graphs] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
1360.01 s
[algebraic-graphs] Phase: unpackPhase
1360.01 s
[algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
1360.02 s
[algebraic-graphs] source root is algebraic-graphs-0.7
1360.03 s
[algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
1360.03 s
[algebraic-graphs] Phase: patchPhase
1360.04 s
[algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
1360.04 s
[algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
1360.04 s
[algebraic-graphs] patching file algebraic-graphs.cabal
1360.05 s
[algebraic-graphs] Phase: compileBuildDriverPhase
1360.05 s
[algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.kqVdCB4fG7/setup-package.conf.d -threaded
1360.09 s
[algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.kqVdCB4fG7/Main.o )
1360.16 s
[algebraic-graphs] [2 of 2] Linking Setup
1361.45 s
[algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
1361.47 s
[algebraic-graphs] Phase: configurePhase
1361.47 s
[algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.kqVdCB4fG7/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/lib
1361.49 s
[algebraic-graphs] Using Parsec parser
1361.49 s
[algebraic-graphs] Configuring algebraic-graphs-0.7...
1361.75 s
[algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
1361.75 s
[algebraic-graphs] Dependency base >=4.11 && <5: using base-4.19.2.0
1361.75 s
[algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
1361.75 s
[algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
1361.75 s
[algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
1361.75 s
[algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
1361.75 s
[algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
1361.75 s
[algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
1361.75 s
[algebraic-graphs] Dependency base >=4.11 && <5: using base-4.19.2.0
1361.75 s
[algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
1361.75 s
[algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
1361.75 s
[algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
1361.75 s
[algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
1361.75 s
[algebraic-graphs] inspection-testing-0.6.2
1361.75 s
[algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
1361.96 s
[algebraic-graphs] Source component graph:
1361.96 s
[algebraic-graphs] component lib
1361.96 s
[algebraic-graphs] component test:main dependency lib
1361.96 s
[algebraic-graphs] Configured component graph:
1361.96 s
[algebraic-graphs] component algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
1361.96 s
[algebraic-graphs] include array-0.5.8.0-34d4
1361.96 s
[algebraic-graphs] include base-4.19.2.0-a4d2
1361.96 s
[algebraic-graphs] include containers-0.6.8-1373
1361.96 s
[algebraic-graphs] include deepseq-1.5.1.0-2184
1361.96 s
[algebraic-graphs] include transformers-0.6.1.0-8f1d
1361.96 s
[algebraic-graphs] component algebraic-graphs-0.7-HvC9ceAArYk6dSETtUgAEo-main
1361.96 s
[algebraic-graphs] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1361.96 s
[algebraic-graphs] include algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
1361.96 s
[algebraic-graphs] include array-0.5.8.0-34d4
1361.96 s
[algebraic-graphs] include base-4.19.2.0-a4d2
1361.96 s
[algebraic-graphs] include containers-0.6.8-1373
1361.96 s
[algebraic-graphs] include deepseq-1.5.1.0-2184
1361.96 s
[algebraic-graphs] include extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
1361.96 s
[algebraic-graphs] include inspection-testing-0.6.2-8SAwNUls9Z1FYZ1VNS58RS
1361.96 s
[algebraic-graphs] include transformers-0.6.1.0-8f1d
1361.96 s
[algebraic-graphs] Linked component graph:
1361.96 s
[algebraic-graphs] unit algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
1361.96 s
[algebraic-graphs] include array-0.5.8.0-34d4
1361.96 s
[algebraic-graphs] include base-4.19.2.0-a4d2
1361.96 s
[algebraic-graphs] include containers-0.6.8-1373
1361.96 s
[algebraic-graphs] include deepseq-1.5.1.0-2184
1361.96 s
[algebraic-graphs] include transformers-0.6.1.0-8f1d
1361.96 s
[algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Data.Graph.Typed
1361.96 s
[algebraic-graphs] unit algebraic-graphs-0.7-HvC9ceAArYk6dSETtUgAEo-main
1361.96 s
[algebraic-graphs] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1361.96 s
[algebraic-graphs] include algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
1361.96 s
[algebraic-graphs] include array-0.5.8.0-34d4
1361.96 s
[algebraic-graphs] include base-4.19.2.0-a4d2
1361.96 s
[algebraic-graphs] include containers-0.6.8-1373
1361.96 s
[algebraic-graphs] include deepseq-1.5.1.0-2184
1361.96 s
[algebraic-graphs] include extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
1361.96 s
[algebraic-graphs] include inspection-testing-0.6.2-8SAwNUls9Z1FYZ1VNS58RS
1361.96 s
[algebraic-graphs] include transformers-0.6.1.0-8f1d
1361.96 s
[algebraic-graphs] Ready component graph:
1361.96 s
[algebraic-graphs] definite algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
1361.96 s
[algebraic-graphs] depends array-0.5.8.0-34d4
1361.96 s
[algebraic-graphs] depends base-4.19.2.0-a4d2
1361.96 s
[algebraic-graphs] depends containers-0.6.8-1373
1361.96 s
[algebraic-graphs] depends deepseq-1.5.1.0-2184
1361.96 s
[algebraic-graphs] depends transformers-0.6.1.0-8f1d
1361.96 s
[algebraic-graphs] definite algebraic-graphs-0.7-HvC9ceAArYk6dSETtUgAEo-main
1361.96 s
[algebraic-graphs] depends QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
1361.96 s
[algebraic-graphs] depends algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
1361.96 s
[algebraic-graphs] depends array-0.5.8.0-34d4
1361.96 s
[algebraic-graphs] depends base-4.19.2.0-a4d2
1361.96 s
[algebraic-graphs] depends containers-0.6.8-1373
1361.96 s
[algebraic-graphs] depends deepseq-1.5.1.0-2184
1361.96 s
[algebraic-graphs] depends extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
1361.96 s
[algebraic-graphs] depends inspection-testing-0.6.2-8SAwNUls9Z1FYZ1VNS58RS
1361.96 s
[algebraic-graphs] depends transformers-0.6.1.0-8f1d
1361.96 s
[algebraic-graphs] Using Cabal-3.10.3.0 compiled by ghc-9.8
1361.96 s
[algebraic-graphs] Using compiler: ghc-9.8.4
1361.96 s
[algebraic-graphs] Using install prefix:
1361.96 s
[algebraic-graphs] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7
1361.96 s
[algebraic-graphs] Executables installed in:
1361.96 s
[algebraic-graphs] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/bin
1361.96 s
[algebraic-graphs] Libraries installed in:
1361.96 s
[algebraic-graphs] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
1361.96 s
[algebraic-graphs] Dynamic Libraries installed in:
1361.96 s
[algebraic-graphs] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
1361.96 s
[algebraic-graphs] Private executables installed in:
1361.96 s
[algebraic-graphs] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7
1361.96 s
[algebraic-graphs] Data files installed in:
1361.96 s
[algebraic-graphs] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7
1361.96 s
[algebraic-graphs] Documentation installed in:
1361.96 s
[algebraic-graphs] /nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
1361.96 s
[algebraic-graphs] Configuration files installed in:
1361.96 s
[algebraic-graphs] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/etc
1361.96 s
[algebraic-graphs] No alex found
1361.96 s
[algebraic-graphs] Using ar found on system at:
1361.96 s
[algebraic-graphs] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
1361.96 s
[algebraic-graphs] No c2hs found
1361.96 s
[algebraic-graphs] No cpphs found
1361.96 s
[algebraic-graphs] No doctest found
1361.96 s
[algebraic-graphs] Using gcc version 14.3.0 given by user at:
1361.96 s
[algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
1361.96 s
[algebraic-graphs] Using ghc version 9.8.4 found on system at:
1361.96 s
[algebraic-graphs] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
1361.96 s
[algebraic-graphs] Using ghc-pkg version 9.8.4 found on system at:
1361.96 s
[algebraic-graphs] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
1361.96 s
[algebraic-graphs] No ghcjs found
1361.96 s
[algebraic-graphs] No ghcjs-pkg found
1361.96 s
[algebraic-graphs] No greencard found
1361.97 s
[algebraic-graphs] Using haddock version 2.30.0 found on system at:
1361.97 s
[algebraic-graphs] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
1361.97 s
[algebraic-graphs] No happy found
1361.97 s
[algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
1361.97 s
[algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
1361.97 s
[algebraic-graphs] No hmake found
1361.97 s
[algebraic-graphs] Using hpc version 0.69 found on system at:
1361.97 s
[algebraic-graphs] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
1361.97 s
[algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
1361.97 s
[algebraic-graphs] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
1361.97 s
[algebraic-graphs] Using hscolour version 1.25 found on system at:
1361.97 s
[algebraic-graphs] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
1361.97 s
[algebraic-graphs] No jhc found
1361.97 s
[algebraic-graphs] Using ld found on system at:
1361.97 s
[algebraic-graphs] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
1361.97 s
[algebraic-graphs] No pkg-config found
1361.97 s
[algebraic-graphs] Using runghc version 9.8.4 found on system at:
1361.97 s
[algebraic-graphs] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
1361.97 s
[algebraic-graphs] Using strip version 2.44 found on system at:
1361.97 s
[algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
1361.97 s
[algebraic-graphs] Using tar found on system at:
1361.97 s
[algebraic-graphs] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
1361.97 s
[algebraic-graphs] No uhc found
1362.10 s
[algebraic-graphs] Phase: buildPhase
1362.14 s
[algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
1362.14 s
[algebraic-graphs] Building library for algebraic-graphs-0.7..
1362.24 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 )
1363.15 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 )
1363.76 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 )
1364.07 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 )
1364.07 s
[algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
1365.14 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 )
1365.39 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 )
1365.81 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 )
1366.44 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 )
1366.44 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 )
1366.45 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 )
1366.45 s
[algebraic-graphs]
1366.45 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning : [ GHC-63394 ] [ -Wx-partial ]
1366.45 s
[algebraic-graphs] In the use of ‘head’
1366.45 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1366.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."
1366.45 s
[algebraic-graphs] |
1366.45 s
[algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
1366.45 s
[algebraic-graphs] | ^^^^
1366.45 s
[algebraic-graphs]
1366.45 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1366.45 s
[algebraic-graphs] In the use of ‘tail’
1366.45 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1366.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."
1366.45 s
[algebraic-graphs] |
1366.45 s
[algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
1366.45 s
[algebraic-graphs] | ^^^^
1366.45 s
[algebraic-graphs]
1366.45 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning : [ GHC-63394 ] [ -Wx-partial ]
1366.45 s
[algebraic-graphs] In the use of ‘head’
1366.45 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1366.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."
1366.45 s
[algebraic-graphs] |
1366.45 s
[algebraic-graphs] 395 | p_v = fst $ head bnd
1366.45 s
[algebraic-graphs] | ^^^^
1366.45 s
[algebraic-graphs]
1366.45 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1366.45 s
[algebraic-graphs] In the use of ‘tail’
1366.45 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1366.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."
1366.45 s
[algebraic-graphs] |
1366.45 s
[algebraic-graphs] 397 | bnd' = tail bnd
1366.45 s
[algebraic-graphs] | ^^^^
1366.45 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 )
1366.45 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 )
1366.45 s
[algebraic-graphs]
1366.45 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1366.45 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1366.45 s
[algebraic-graphs] will become an error in a future GHC release.
1366.45 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1366.45 s
[algebraic-graphs] |
1366.45 s
[algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
1366.45 s
[algebraic-graphs] | ^
1366.45 s
[algebraic-graphs]
1366.45 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1366.45 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1366.45 s
[algebraic-graphs] will become an error in a future GHC release.
1366.45 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1366.45 s
[algebraic-graphs] |
1366.45 s
[algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1366.45 s
[algebraic-graphs] | ^
1366.45 s
[algebraic-graphs]
1366.45 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1366.45 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1366.45 s
[algebraic-graphs] will become an error in a future GHC release.
1366.45 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1366.45 s
[algebraic-graphs] |
1366.45 s
[algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1366.45 s
[algebraic-graphs] | ^
1366.45 s
[algebraic-graphs]
1366.45 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1366.45 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1366.45 s
[algebraic-graphs] will become an error in a future GHC release.
1366.45 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1366.45 s
[algebraic-graphs] |
1366.45 s
[algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1366.45 s
[algebraic-graphs] | ^
1366.45 s
[algebraic-graphs]
1366.45 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1366.45 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1366.45 s
[algebraic-graphs] will become an error in a future GHC release.
1366.45 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1366.45 s
[algebraic-graphs] |
1366.45 s
[algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1366.45 s
[algebraic-graphs] | ^
1366.45 s
[algebraic-graphs]
1366.45 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1366.45 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1366.45 s
[algebraic-graphs] will become an error in a future GHC release.
1366.45 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1366.45 s
[algebraic-graphs] |
1366.45 s
[algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1366.45 s
[algebraic-graphs] | ^
1366.45 s
[algebraic-graphs]
1366.45 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1366.45 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1366.45 s
[algebraic-graphs] will become an error in a future GHC release.
1366.45 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1366.45 s
[algebraic-graphs] |
1366.45 s
[algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1366.45 s
[algebraic-graphs] | ^
1366.45 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 )
1366.67 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 )
1367.00 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 )
1367.00 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 )
1367.00 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 )
1367.52 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 )
1367.86 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 )
1367.97 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 )
1367.97 s
[algebraic-graphs]
1367.97 s
[algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1367.97 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1367.97 s
[algebraic-graphs] will become an error in a future GHC release.
1367.97 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1367.97 s
[algebraic-graphs] |
1367.97 s
[algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
1367.97 s
[algebraic-graphs] | ^
1367.97 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 )
1367.97 s
[algebraic-graphs]
1367.97 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1367.97 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1367.97 s
[algebraic-graphs] will become an error in a future GHC release.
1367.97 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1367.97 s
[algebraic-graphs] |
1367.97 s
[algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
1367.97 s
[algebraic-graphs] | ^
1367.97 s
[algebraic-graphs]
1367.97 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1367.97 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1367.97 s
[algebraic-graphs] will become an error in a future GHC release.
1367.97 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1367.97 s
[algebraic-graphs] |
1367.97 s
[algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
1367.97 s
[algebraic-graphs] | ^
1367.97 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 )
1367.97 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 )
1367.97 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 )
1368.02 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 )
1368.02 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 )
1368.02 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 )
1368.05 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 )
1368.34 s
[algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
1369.40 s
[algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
1369.98 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 )
1370.34 s
[algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
1370.34 s
[algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
1371.42 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 )
1371.72 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 )
1372.11 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 )
1372.79 s
[algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
1372.79 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 )
1372.79 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 )
1372.79 s
[algebraic-graphs]
1372.79 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning : [ GHC-63394 ] [ -Wx-partial ]
1372.79 s
[algebraic-graphs] In the use of ‘head’
1372.79 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1372.79 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."
1372.79 s
[algebraic-graphs] |
1372.79 s
[algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
1372.79 s
[algebraic-graphs] | ^^^^
1372.79 s
[algebraic-graphs]
1372.79 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1372.79 s
[algebraic-graphs] In the use of ‘tail’
1372.79 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1372.79 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."
1372.79 s
[algebraic-graphs] |
1372.79 s
[algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
1372.79 s
[algebraic-graphs] | ^^^^
1372.79 s
[algebraic-graphs]
1372.79 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning : [ GHC-63394 ] [ -Wx-partial ]
1372.79 s
[algebraic-graphs] In the use of ‘head’
1372.79 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1372.79 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."
1372.79 s
[algebraic-graphs] |
1372.79 s
[algebraic-graphs] 395 | p_v = fst $ head bnd
1372.79 s
[algebraic-graphs] | ^^^^
1372.79 s
[algebraic-graphs]
1372.79 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1372.79 s
[algebraic-graphs] In the use of ‘tail’
1372.79 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1372.79 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."
1372.79 s
[algebraic-graphs] |
1372.79 s
[algebraic-graphs] 397 | bnd' = tail bnd
1372.79 s
[algebraic-graphs] | ^^^^
1372.79 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 )
1372.79 s
[algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
1372.79 s
[algebraic-graphs]
1372.79 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1372.79 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1372.79 s
[algebraic-graphs] will become an error in a future GHC release.
1372.79 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1372.79 s
[algebraic-graphs] |
1372.79 s
[algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
1372.79 s
[algebraic-graphs] | ^
1372.79 s
[algebraic-graphs]
1372.79 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1372.79 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1372.79 s
[algebraic-graphs] will become an error in a future GHC release.
1372.79 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1372.79 s
[algebraic-graphs] |
1372.79 s
[algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1372.79 s
[algebraic-graphs] | ^
1372.79 s
[algebraic-graphs]
1372.79 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1372.79 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1372.79 s
[algebraic-graphs] will become an error in a future GHC release.
1372.79 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1372.79 s
[algebraic-graphs] |
1372.79 s
[algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1372.79 s
[algebraic-graphs] | ^
1372.79 s
[algebraic-graphs]
1372.79 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1372.79 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1372.79 s
[algebraic-graphs] will become an error in a future GHC release.
1372.79 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1372.79 s
[algebraic-graphs] |
1372.79 s
[algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1372.79 s
[algebraic-graphs] | ^
1372.79 s
[algebraic-graphs]
1372.79 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1372.79 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1372.79 s
[algebraic-graphs] will become an error in a future GHC release.
1372.79 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1372.79 s
[algebraic-graphs] |
1372.79 s
[algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1372.79 s
[algebraic-graphs] | ^
1372.79 s
[algebraic-graphs]
1372.79 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1372.79 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1372.79 s
[algebraic-graphs] will become an error in a future GHC release.
1372.79 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1372.79 s
[algebraic-graphs] |
1372.79 s
[algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1372.79 s
[algebraic-graphs] | ^
1372.79 s
[algebraic-graphs]
1372.79 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1372.79 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1372.79 s
[algebraic-graphs] will become an error in a future GHC release.
1372.79 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1372.79 s
[algebraic-graphs] |
1372.79 s
[algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1372.79 s
[algebraic-graphs] | ^
1372.79 s
[algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
1372.95 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 )
1373.33 s
[algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
1373.33 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 )
1373.33 s
[algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
1373.81 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 )
1374.03 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 )
1374.17 s
[algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
1374.17 s
[algebraic-graphs]
1374.17 s
[algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1374.17 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1374.17 s
[algebraic-graphs] will become an error in a future GHC release.
1374.17 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1374.17 s
[algebraic-graphs] |
1374.17 s
[algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
1374.17 s
[algebraic-graphs] | ^
1374.17 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 )
1374.17 s
[algebraic-graphs]
1374.17 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1374.17 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1374.17 s
[algebraic-graphs] will become an error in a future GHC release.
1374.17 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1374.17 s
[algebraic-graphs] |
1374.17 s
[algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
1374.17 s
[algebraic-graphs] | ^
1374.17 s
[algebraic-graphs]
1374.17 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1374.17 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1374.17 s
[algebraic-graphs] will become an error in a future GHC release.
1374.17 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1374.17 s
[algebraic-graphs] |
1374.17 s
[algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
1374.17 s
[algebraic-graphs] | ^
1374.17 s
[algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
1374.17 s
[algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
1374.17 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 )
1374.24 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 )
1374.24 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 )
1374.24 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 )
1374.27 s
[algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
1375.49 s
[algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
1375.49 s
[algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7..
1375.62 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 )
1376.61 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 )
1378.76 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 )
1378.79 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 )
1378.79 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 )
1380.43 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 )
1380.43 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 )
1380.43 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 )
1383.67 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 )
1383.81 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 )
1383.82 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 )
1384.72 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 )
1384.72 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 )
1384.72 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 )
1385.30 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 )
1385.30 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 )
1385.30 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 )
1385.30 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 )
1385.30 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 )
1385.30 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 )
1385.30 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
1385.30 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
1385.30 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
1385.30 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
1385.30 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
1385.30 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
1385.30 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
1385.30 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
1385.30 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
1385.30 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
1385.30 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
1385.31 s
[algebraic-graphs] inspection testing successful
1385.31 s
[algebraic-graphs] expected successes: 58
1385.31 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 )
1385.31 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 )
1385.31 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 )
1385.95 s
[algebraic-graphs] [24 of 24] Linking dist/build/main/main
1386.74 s
[algebraic-graphs] Phase: checkPhase
1386.76 s
[algebraic-graphs] Running 1 test suites...
1386.76 s
[algebraic-graphs] Test suite main: RUNNING...
1392.97 s
[algebraic-graphs]
1392.97 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
1392.98 s
[algebraic-graphs] OK: show empty == "empty"
1392.98 s
[algebraic-graphs] OK: show (shrink 1) == "vertex 1"
1392.98 s
[algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
1392.98 s
[algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
1392.98 s
[algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
1392.98 s
[algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
1392.98 s
[algebraic-graphs] OK: fromAcyclic empty == empty
1392.98 s
[algebraic-graphs] OK: fromAcyclic . vertex == vertex
1392.98 s
[algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
1392.98 s
[algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
1392.98 s
[algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
1392.98 s
[algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
1392.98 s
[algebraic-graphs] OK: isEmpty empty == True
1392.98 s
[algebraic-graphs] OK: hasVertex x empty == False
1392.98 s
[algebraic-graphs] OK: vertexCount empty == 0
1392.98 s
[algebraic-graphs] OK: edgeCount empty == 0
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
1392.98 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1392.98 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1392.98 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1392.98 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
1392.98 s
[algebraic-graphs] OK: vertices [] == empty
1392.98 s
[algebraic-graphs] OK: vertices [x] == vertex x
1392.98 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1392.98 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1392.98 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
1392.98 s
[algebraic-graphs] OK: vertexSet (union x y) == <correct result>
1392.98 s
[algebraic-graphs] OK: edgeSet (union x y) == <correct result>
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
1392.98 s
[algebraic-graphs] OK: vertexSet (join x y) == <correct result>
1392.98 s
[algebraic-graphs] OK: edgeSet (join x y) == <correct result>
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
1392.98 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1392.98 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1392.98 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1392.98 s
[algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
1392.98 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
1392.98 s
[algebraic-graphs] OK: isEmpty empty == True
1392.98 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1392.98 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1392.98 s
[algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
1392.98 s
[algebraic-graphs] OK: hasVertex x empty == False
1392.98 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1392.98 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
1392.98 s
[algebraic-graphs] OK: hasEdge x y empty == False
1392.98 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1392.98 s
[algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
1392.98 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1392.98 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
1392.98 s
[algebraic-graphs] OK: vertexCount empty == 0
1392.98 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1392.98 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1392.98 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
1392.98 s
[algebraic-graphs] OK: edgeCount empty == 0
1392.98 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1392.98 s
[algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
1392.98 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
1392.98 s
[algebraic-graphs] OK: vertexList empty == []
1392.98 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1392.98 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
1392.98 s
[algebraic-graphs] OK: edgeList empty == []
1392.98 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1392.98 s
[algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
1392.98 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
1392.98 s
[algebraic-graphs] OK: adjacencyList empty == []
1392.98 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1392.98 s
[algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
1392.98 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1392.98 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1392.98 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
1392.98 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1392.98 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1392.98 s
[algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
1392.98 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1392.98 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1392.98 s
[algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
1392.98 s
[algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
1392.98 s
[algebraic-graphs] OK: Set.member x . preSet x == const False
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
1392.98 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1392.98 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1392.98 s
[algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
1392.98 s
[algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
1392.98 s
[algebraic-graphs] OK: Set.member x . postSet x == const False
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
1392.98 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1392.98 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1392.98 s
[algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
1392.98 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
1392.98 s
[algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
1392.98 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1392.98 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1392.98 s
[algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
1392.98 s
[algebraic-graphs] OK: transpose empty == empty
1392.98 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1392.98 s
[algebraic-graphs] OK: transpose . transpose == id
1392.98 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
1392.98 s
[algebraic-graphs] OK: induce (const True ) x == x
1392.98 s
[algebraic-graphs] OK: induce (const False) x == empty
1392.98 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1392.98 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1392.98 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
1392.98 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1392.98 s
[algebraic-graphs] OK: induceJust . vertex . Just == vertex
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
1392.98 s
[algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] OK: box x y ~~ box y x
1392.98 s
[algebraic-graphs] OK: box x (vertex ()) ~~ x
1392.98 s
[algebraic-graphs] OK: box x empty ~~ empty
1392.98 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1392.98 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1392.98 s
[algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
1392.98 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
1392.98 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1392.98 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1392.98 s
[algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
1392.98 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
1392.98 s
[algebraic-graphs] OK: topSort empty == []
1392.98 s
[algebraic-graphs] OK: topSort (vertex x) == [x]
1392.98 s
[algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
1392.98 s
[algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
1392.98 s
[algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
1392.98 s
[algebraic-graphs] OK: scc empty == empty
1392.98 s
[algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
1392.98 s
[algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
1392.98 s
[algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
1392.98 s
[algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
1392.98 s
[algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
1392.98 s
[algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
1392.98 s
[algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
1392.98 s
[algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
1392.98 s
[algebraic-graphs]
1392.98 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
1392.98 s
[algebraic-graphs] OK: toAcyclicOrd empty == empty
1392.98 s
[algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
1392.98 s
[algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
1392.98 s
[algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
1392.98 s
[algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
1392.98 s
[algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
1396.10 s
[algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
1396.10 s
[algebraic-graphs] OK: shrink . AM.vertex == vertex
1396.10 s
[algebraic-graphs] OK: shrink . AM.vertices == vertices
1396.10 s
[algebraic-graphs] OK: shrink . fromAcyclic == id
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
1396.10 s
[algebraic-graphs] OK: Arbitrary
1396.10 s
[algebraic-graphs] OK: empty
1396.10 s
[algebraic-graphs] OK: vertex
1396.10 s
[algebraic-graphs] OK: vertices
1396.10 s
[algebraic-graphs] OK: union
1396.10 s
[algebraic-graphs] OK: join
1396.10 s
[algebraic-graphs] OK: transpose
1396.10 s
[algebraic-graphs] OK: box
1396.10 s
[algebraic-graphs] OK: transitiveClosure
1396.10 s
[algebraic-graphs] OK: scc
1396.10 s
[algebraic-graphs] OK: toAcyclic
1396.10 s
[algebraic-graphs] OK: toAcyclicOrd
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap ============
1396.10 s
[algebraic-graphs] OK: Axioms of graphs
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
1396.10 s
[algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.consistent ============
1396.10 s
[algebraic-graphs] OK: Consistency of the Arbitrary instance
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] OK: consistent empty == True
1396.10 s
[algebraic-graphs] OK: consistent (vertex x) == True
1396.10 s
[algebraic-graphs] OK: consistent (overlay x y) == True
1396.10 s
[algebraic-graphs] OK: consistent (connect x y) == True
1396.10 s
[algebraic-graphs] OK: consistent (edge x y) == True
1396.10 s
[algebraic-graphs] OK: consistent (edges xs) == True
1396.10 s
[algebraic-graphs] OK: consistent (stars xs) == True
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.Show ============
1396.10 s
[algebraic-graphs] OK: show (empty ) == "empty"
1396.10 s
[algebraic-graphs] OK: show (1 ) == "vertex 1"
1396.10 s
[algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
1396.10 s
[algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
1396.10 s
[algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
1396.10 s
[algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
1396.10 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
1396.10 s
[algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
1396.10 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
1396.10 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.Ord ============
1396.10 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1396.10 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1396.10 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1396.10 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1396.10 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1396.10 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1396.10 s
[algebraic-graphs] OK: x <= x + y
1396.10 s
[algebraic-graphs] OK: x + y <= x * y
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.empty ============
1396.10 s
[algebraic-graphs] OK: isEmpty empty == True
1396.10 s
[algebraic-graphs] OK: hasVertex x empty == False
1396.10 s
[algebraic-graphs] OK: vertexCount empty == 0
1396.10 s
[algebraic-graphs] OK: edgeCount empty == 0
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.vertex ============
1396.10 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1396.10 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1396.10 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1396.10 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.edge ============
1396.10 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1396.10 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1396.10 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1396.10 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1396.10 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.overlay ============
1396.10 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1396.10 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1396.10 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1396.10 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1396.10 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1396.10 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1396.10 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1396.10 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.connect ============
1396.10 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1396.10 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1396.10 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1396.10 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1396.10 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1396.10 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1396.10 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1396.10 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1396.10 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1396.10 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.vertices ============
1396.10 s
[algebraic-graphs] OK: vertices [] == empty
1396.10 s
[algebraic-graphs] OK: vertices [x] == vertex x
1396.10 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1396.10 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1396.10 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1396.10 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.edges ============
1396.10 s
[algebraic-graphs] OK: edges [] == empty
1396.10 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1396.10 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1396.10 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.overlays ============
1396.10 s
[algebraic-graphs] OK: overlays [] == empty
1396.10 s
[algebraic-graphs] OK: overlays [x] == x
1396.10 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1396.10 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1396.10 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.connects ============
1396.10 s
[algebraic-graphs] OK: connects [] == empty
1396.10 s
[algebraic-graphs] OK: connects [x] == x
1396.10 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1396.10 s
[algebraic-graphs] OK: connects == foldr connect empty
1396.10 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
1396.10 s
[algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
1396.10 s
[algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
1396.10 s
[algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
1396.10 s
[algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
1396.10 s
[algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
1396.10 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1396.10 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1396.10 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1396.10 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1396.10 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1396.10 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1396.10 s
[algebraic-graphs]
1396.10 s
[algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
1396.10 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1396.10 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1396.10 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1396.10 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1396.10 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1396.10 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1396.10 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1396.10 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1396.10 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1396.10 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1396.10 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1396.10 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1396.10 s
[algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
1396.10 s
[algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
1396.10 s
[algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
1396.10 s
[algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
1396.10 s
[algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
1396.10 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1396.10 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1396.10 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1396.10 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1396.10 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1396.10 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1396.10 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1396.10 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1396.10 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1396.10 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1396.10 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1396.10 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1396.10 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1396.10 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1396.10 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1396.10 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1396.10 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1396.85 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.foldg ============
1396.85 s
[algebraic-graphs] OK: foldg empty vertex overlay connect == id
1396.85 s
[algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
1396.85 s
[algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
1396.85 s
[algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
1396.85 s
[algebraic-graphs] OK: isEmpty empty == True
1396.85 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1396.85 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1396.85 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1396.85 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
1396.85 s
[algebraic-graphs] OK: hasVertex x empty == False
1396.85 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1396.85 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
1396.85 s
[algebraic-graphs] OK: hasEdge x y empty == False
1396.85 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1396.85 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1396.85 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1396.85 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
1396.85 s
[algebraic-graphs] OK: vertexCount empty == 0
1396.85 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1396.85 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1396.85 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
1396.85 s
[algebraic-graphs] OK: edgeCount empty == 0
1396.85 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1396.85 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1396.85 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
1396.85 s
[algebraic-graphs] OK: vertexList empty == []
1396.85 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1396.85 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
1396.85 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1396.85 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1396.85 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
1396.85 s
[algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
1396.85 s
[algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
1396.85 s
[algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
1396.85 s
[algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
1396.85 s
[algebraic-graphs] OK: edgeList empty == []
1396.85 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1396.85 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1396.85 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1396.85 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
1396.85 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1396.85 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1396.85 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1396.85 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
1396.85 s
[algebraic-graphs] OK: adjacencyList empty == []
1396.85 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1396.85 s
[algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
1396.85 s
[algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.preSet ============
1396.85 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1396.85 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1396.85 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1396.85 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
1396.85 s
[algebraic-graphs] OK: preIntSet x empty == IntSet.empty
1396.85 s
[algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
1396.85 s
[algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
1396.85 s
[algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.postSet ============
1396.85 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1396.85 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1396.85 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1396.85 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
1396.85 s
[algebraic-graphs] OK: postIntSet x empty == IntSet.empty
1396.85 s
[algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
1396.85 s
[algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
1396.85 s
[algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.path ============
1396.85 s
[algebraic-graphs] OK: path [] == empty
1396.85 s
[algebraic-graphs] OK: path [x] == vertex x
1396.85 s
[algebraic-graphs] OK: path [x,y] == edge x y
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.circuit ============
1396.85 s
[algebraic-graphs] OK: circuit [] == empty
1396.85 s
[algebraic-graphs] OK: circuit [x] == edge x x
1396.85 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.clique ============
1396.85 s
[algebraic-graphs] OK: clique [] == empty
1396.85 s
[algebraic-graphs] OK: clique [x] == vertex x
1396.85 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1396.85 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1396.85 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.biclique ============
1396.85 s
[algebraic-graphs] OK: biclique [] [] == empty
1396.85 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1396.85 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1396.85 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1396.85 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.star ============
1396.85 s
[algebraic-graphs] OK: star x [] == vertex x
1396.85 s
[algebraic-graphs] OK: star x [y] == edge x y
1396.85 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1396.85 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.stars ============
1396.85 s
[algebraic-graphs] OK: stars [] == empty
1396.85 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1396.85 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1396.85 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1396.85 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1396.85 s
[algebraic-graphs] OK: stars . adjacencyList == id
1396.85 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.tree ============
1396.85 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1396.85 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1396.85 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1396.85 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.forest ============
1396.85 s
[algebraic-graphs] OK: forest [] == empty
1396.85 s
[algebraic-graphs] OK: forest [x] == tree x
1396.85 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1396.85 s
[algebraic-graphs] OK: forest == overlays . map tree
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
1396.85 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1396.85 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1396.85 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1396.85 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1396.85 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
1396.85 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1396.85 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1396.85 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1396.85 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1396.85 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
1396.85 s
[algebraic-graphs] OK: replaceVertex x x == id
1396.85 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1396.85 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
1396.85 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1396.85 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1396.85 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1396.85 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.transpose ============
1396.85 s
[algebraic-graphs] OK: transpose empty == empty
1396.85 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1396.85 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1396.85 s
[algebraic-graphs] OK: transpose . transpose == id
1396.85 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.gmap ============
1396.85 s
[algebraic-graphs] OK: gmap f empty == empty
1396.85 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1396.85 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1396.85 s
[algebraic-graphs] OK: gmap id == id
1396.85 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.induce ============
1396.85 s
[algebraic-graphs] OK: induce (const True ) x == x
1396.85 s
[algebraic-graphs] OK: induce (const False) x == empty
1396.85 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1396.85 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1396.85 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1396.85 s
[algebraic-graphs]
1396.85 s
[algebraic-graphs] ============ AdjacencyIntMap.compose ============
1396.85 s
[algebraic-graphs] OK: compose empty x == empty
1396.85 s
[algebraic-graphs] OK: compose x empty == empty
1396.85 s
[algebraic-graphs] OK: compose (vertex x) y == empty
1396.85 s
[algebraic-graphs] OK: compose x (vertex y) == empty
1396.85 s
[algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
1396.85 s
[algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
1397.07 s
[algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
1397.07 s
[algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
1397.07 s
[algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
1397.07 s
[algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] ============ AdjacencyIntMap.closure ============
1397.07 s
[algebraic-graphs] OK: closure empty == empty
1397.07 s
[algebraic-graphs] OK: closure (vertex x) == edge x x
1397.07 s
[algebraic-graphs] OK: closure (edge x x) == edge x x
1397.07 s
[algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
1397.07 s
[algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
1397.07 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1397.07 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1397.07 s
[algebraic-graphs] OK: closure . closure == closure
1397.07 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
1397.07 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1397.07 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
1397.07 s
[algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
1397.07 s
[algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
1397.07 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
1397.07 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1397.07 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1397.07 s
[algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
1397.07 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1397.07 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
1397.07 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1397.07 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1397.07 s
[algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
1397.07 s
[algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
1397.07 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
1397.07 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
1397.07 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
1397.07 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
1397.07 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
1397.07 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
1397.07 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
1397.07 s
[algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
1397.07 s
[algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
1397.07 s
[algebraic-graphs] OK: bfsForest x [] == []
1397.07 s
[algebraic-graphs] OK: bfsForest empty vs == []
1397.07 s
[algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
1397.07 s
[algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] ============ AdjacencyIntMap.bfs ============
1397.07 s
[algebraic-graphs] OK: bfs (edge 1 2) [0] == []
1397.07 s
[algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
1397.07 s
[algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
1397.07 s
[algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
1397.07 s
[algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
1397.07 s
[algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
1397.07 s
[algebraic-graphs] OK: bfs empty vs == []
1397.07 s
[algebraic-graphs] OK: bfs x [] == []
1397.07 s
[algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
1397.07 s
[algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
1397.07 s
[algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
1397.07 s
[algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
1397.07 s
[algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
1397.07 s
[algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
1397.07 s
[algebraic-graphs] OK: forest $ dfsForest empty == empty
1397.07 s
[algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
1397.07 s
[algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
1397.07 s
[algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
1397.07 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
1397.07 s
[algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
1397.07 s
[algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
1397.07 s
[algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
1397.07 s
[algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
1397.07 s
[algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
1397.07 s
[algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
1397.07 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
1397.07 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
1397.07 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
1397.07 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
1397.07 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
1397.07 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
1397.07 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
1397.07 s
[algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
1397.07 s
[algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
1397.07 s
[algebraic-graphs] OK: dfsForestFrom x [] == []
1397.07 s
[algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
1397.07 s
[algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] ============ AdjacencyIntMap.dfs ============
1397.07 s
[algebraic-graphs] OK: dfs empty vs == []
1397.07 s
[algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
1397.07 s
[algebraic-graphs] OK: dfs (edge 1 2) [0] == []
1397.07 s
[algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
1397.07 s
[algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
1397.07 s
[algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
1397.07 s
[algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
1397.07 s
[algebraic-graphs] OK: dfs x [] == []
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
1397.07 s
[algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
1397.07 s
[algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] ============ AdjacencyIntMap.dfs ============
1397.07 s
[algebraic-graphs] OK: reachable empty x == []
1397.07 s
[algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
1397.07 s
[algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
1397.07 s
[algebraic-graphs] OK: reachable (edge 1 2) 0 == []
1397.07 s
[algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
1397.07 s
[algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
1397.07 s
[algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
1397.07 s
[algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
1397.07 s
[algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] ============ AdjacencyIntMap.topSort ============
1397.07 s
[algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
1397.07 s
[algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
1397.07 s
[algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
1397.07 s
[algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
1397.07 s
[algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
1397.07 s
[algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
1397.07 s
[algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
1397.07 s
[algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
1397.07 s
[algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
1397.07 s
[algebraic-graphs] OK: topSort . vertices == Right . nub . sort
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
1397.07 s
[algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
1397.07 s
[algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
1397.07 s
[algebraic-graphs] OK: isAcyclic . circuit == null
1397.07 s
[algebraic-graphs] OK: isAcyclic == isRight . topSort
1397.07 s
[algebraic-graphs]
1397.07 s
[algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
1397.07 s
[algebraic-graphs] OK: isDfsForestOf [] empty == True
1397.07 s
[algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
1397.07 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
1397.07 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
1397.07 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
1397.07 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
1397.07 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
1397.07 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
1397.07 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
1397.07 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
1397.07 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
1397.07 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
1397.07 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
1401.26 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
1401.26 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
1401.33 s
[algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
1401.33 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
1401.33 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
1401.33 s
[algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
1401.33 s
[algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
1401.33 s
[algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
1401.33 s
[algebraic-graphs] OK: isTopSortOf [] empty == True
1401.33 s
[algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
1401.33 s
[algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap ============
1401.33 s
[algebraic-graphs] OK: Axioms of graphs
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.consistent ============
1401.33 s
[algebraic-graphs] OK: Consistency of the Arbitrary instance
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] OK: consistent empty == True
1401.33 s
[algebraic-graphs] OK: consistent (vertex x) == True
1401.33 s
[algebraic-graphs] OK: consistent (overlay x y) == True
1401.33 s
[algebraic-graphs] OK: consistent (connect x y) == True
1401.33 s
[algebraic-graphs] OK: consistent (edge x y) == True
1401.33 s
[algebraic-graphs] OK: consistent (edges xs) == True
1401.33 s
[algebraic-graphs] OK: consistent (stars xs) == True
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.Show ============
1401.33 s
[algebraic-graphs] OK: show (empty ) == "empty"
1401.33 s
[algebraic-graphs] OK: show (1 ) == "vertex 1"
1401.33 s
[algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
1401.33 s
[algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
1401.33 s
[algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
1401.33 s
[algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
1401.33 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
1401.33 s
[algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
1401.33 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
1401.33 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.Ord ============
1401.33 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1401.33 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1401.33 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1401.33 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1401.33 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1401.33 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1401.33 s
[algebraic-graphs] OK: x <= x + y
1401.33 s
[algebraic-graphs] OK: x + y <= x * y
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.empty ============
1401.33 s
[algebraic-graphs] OK: isEmpty empty == True
1401.33 s
[algebraic-graphs] OK: hasVertex x empty == False
1401.33 s
[algebraic-graphs] OK: vertexCount empty == 0
1401.33 s
[algebraic-graphs] OK: edgeCount empty == 0
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.vertex ============
1401.33 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1401.33 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1401.33 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1401.33 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.edge ============
1401.33 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1401.33 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1401.33 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1401.33 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1401.33 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.overlay ============
1401.33 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1401.33 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1401.33 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1401.33 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1401.33 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1401.33 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1401.33 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1401.33 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.connect ============
1401.33 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1401.33 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1401.33 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1401.33 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1401.33 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1401.33 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1401.33 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1401.33 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1401.33 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1401.33 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.vertices ============
1401.33 s
[algebraic-graphs] OK: vertices [] == empty
1401.33 s
[algebraic-graphs] OK: vertices [x] == vertex x
1401.33 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1401.33 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1401.33 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1401.33 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.edges ============
1401.33 s
[algebraic-graphs] OK: edges [] == empty
1401.33 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1401.33 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1401.33 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.overlays ============
1401.33 s
[algebraic-graphs] OK: overlays [] == empty
1401.33 s
[algebraic-graphs] OK: overlays [x] == x
1401.33 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1401.33 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1401.33 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.connects ============
1401.33 s
[algebraic-graphs] OK: connects [] == empty
1401.33 s
[algebraic-graphs] OK: connects [x] == x
1401.33 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1401.33 s
[algebraic-graphs] OK: connects == foldr connect empty
1401.33 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
1401.33 s
[algebraic-graphs] OK: fromAdjacencySets [] == empty
1401.33 s
[algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
1401.33 s
[algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
1401.33 s
[algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
1401.33 s
[algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
1401.33 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1401.33 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1401.33 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1401.33 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1401.33 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1401.33 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1401.33 s
[algebraic-graphs]
1401.33 s
[algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
1401.33 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1401.33 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1401.33 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1401.33 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1401.33 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1401.33 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1401.33 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1401.33 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1401.33 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1401.33 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1401.33 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1401.33 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1401.33 s
[algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
1401.33 s
[algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
1401.33 s
[algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
1401.33 s
[algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
1401.33 s
[algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
1401.33 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1401.33 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1401.33 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1401.33 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1401.33 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1401.33 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1401.33 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1401.33 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1401.33 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1401.33 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1401.33 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1401.33 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1401.33 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1401.33 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1401.33 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1401.33 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1402.87 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1402.87 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1402.87 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.foldg ============
1402.88 s
[algebraic-graphs] OK: foldg empty vertex overlay connect == id
1402.88 s
[algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
1402.88 s
[algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
1402.88 s
[algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.isEmpty ============
1402.88 s
[algebraic-graphs] OK: isEmpty empty == True
1402.88 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1402.88 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1402.88 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1402.88 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.hasVertex ============
1402.88 s
[algebraic-graphs] OK: hasVertex x empty == False
1402.88 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1402.88 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.hasEdge ============
1402.88 s
[algebraic-graphs] OK: hasEdge x y empty == False
1402.88 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1402.88 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1402.88 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1402.88 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.vertexCount ============
1402.88 s
[algebraic-graphs] OK: vertexCount empty == 0
1402.88 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1402.88 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1402.88 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.edgeCount ============
1402.88 s
[algebraic-graphs] OK: edgeCount empty == 0
1402.88 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1402.88 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1402.88 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.vertexList ============
1402.88 s
[algebraic-graphs] OK: vertexList empty == []
1402.88 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1402.88 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.vertexSet ============
1402.88 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1402.88 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1402.88 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
1402.88 s
[algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
1402.88 s
[algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
1402.88 s
[algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
1402.88 s
[algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.edgeList ============
1402.88 s
[algebraic-graphs] OK: edgeList empty == []
1402.88 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1402.88 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1402.88 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1402.88 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.edgeSet ============
1402.88 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1402.88 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1402.88 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1402.88 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
1402.88 s
[algebraic-graphs] OK: adjacencyList empty == []
1402.88 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1402.88 s
[algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
1402.88 s
[algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.preSet ============
1402.88 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1402.88 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1402.88 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1402.88 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.preIntSet ============
1402.88 s
[algebraic-graphs] OK: preIntSet x empty == IntSet.empty
1402.88 s
[algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
1402.88 s
[algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
1402.88 s
[algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.postSet ============
1402.88 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1402.88 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1402.88 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1402.88 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.postIntSet ============
1402.88 s
[algebraic-graphs] OK: postIntSet x empty == IntSet.empty
1402.88 s
[algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
1402.88 s
[algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
1402.88 s
[algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.path ============
1402.88 s
[algebraic-graphs] OK: path [] == empty
1402.88 s
[algebraic-graphs] OK: path [x] == vertex x
1402.88 s
[algebraic-graphs] OK: path [x,y] == edge x y
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.circuit ============
1402.88 s
[algebraic-graphs] OK: circuit [] == empty
1402.88 s
[algebraic-graphs] OK: circuit [x] == edge x x
1402.88 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.clique ============
1402.88 s
[algebraic-graphs] OK: clique [] == empty
1402.88 s
[algebraic-graphs] OK: clique [x] == vertex x
1402.88 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1402.88 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1402.88 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.biclique ============
1402.88 s
[algebraic-graphs] OK: biclique [] [] == empty
1402.88 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1402.88 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1402.88 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1402.88 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.star ============
1402.88 s
[algebraic-graphs] OK: star x [] == vertex x
1402.88 s
[algebraic-graphs] OK: star x [y] == edge x y
1402.88 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1402.88 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.stars ============
1402.88 s
[algebraic-graphs] OK: stars [] == empty
1402.88 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1402.88 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1402.88 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1402.88 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1402.88 s
[algebraic-graphs] OK: stars . adjacencyList == id
1402.88 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.tree ============
1402.88 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1402.88 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1402.88 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1402.88 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.forest ============
1402.88 s
[algebraic-graphs] OK: forest [] == empty
1402.88 s
[algebraic-graphs] OK: forest [x] == tree x
1402.88 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1402.88 s
[algebraic-graphs] OK: forest == overlays . map tree
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.removeVertex ============
1402.88 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1402.88 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1402.88 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1402.88 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1402.88 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.removeEdge ============
1402.88 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1402.88 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1402.88 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1402.88 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1402.88 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
1402.88 s
[algebraic-graphs] OK: replaceVertex x x == id
1402.88 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1402.88 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
1402.88 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1402.88 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1402.88 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1402.88 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.transpose ============
1402.88 s
[algebraic-graphs] OK: transpose empty == empty
1402.88 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1402.88 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1402.88 s
[algebraic-graphs] OK: transpose . transpose == id
1402.88 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.gmap ============
1402.88 s
[algebraic-graphs] OK: gmap f empty == empty
1402.88 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1402.88 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1402.88 s
[algebraic-graphs] OK: gmap id == id
1402.88 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.induce ============
1402.88 s
[algebraic-graphs] OK: induce (const True ) x == x
1402.88 s
[algebraic-graphs] OK: induce (const False) x == empty
1402.88 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1402.88 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1402.88 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1402.88 s
[algebraic-graphs]
1402.88 s
[algebraic-graphs] ============ AdjacencyMap.compose ============
1402.88 s
[algebraic-graphs] OK: compose empty x == empty
1402.88 s
[algebraic-graphs] OK: compose x empty == empty
1402.88 s
[algebraic-graphs] OK: compose (vertex x) y == empty
1402.88 s
[algebraic-graphs] OK: compose x (vertex y) == empty
1402.88 s
[algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
1402.88 s
[algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
1404.76 s
[algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
1404.76 s
[algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
1404.76 s
[algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
1404.76 s
[algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] ============ AdjacencyMap.closure ============
1404.76 s
[algebraic-graphs] OK: closure empty == empty
1404.76 s
[algebraic-graphs] OK: closure (vertex x) == edge x x
1404.76 s
[algebraic-graphs] OK: closure (edge x x) == edge x x
1404.76 s
[algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
1404.76 s
[algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
1404.76 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1404.76 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1404.76 s
[algebraic-graphs] OK: closure . closure == closure
1404.76 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
1404.76 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1404.76 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
1404.76 s
[algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
1404.76 s
[algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
1404.76 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
1404.76 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1404.76 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1404.76 s
[algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
1404.76 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1404.76 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
1404.76 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1404.76 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1404.76 s
[algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
1404.76 s
[algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
1404.76 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] ============ AdjacencyMap.box ============
1404.76 s
[algebraic-graphs] OK: box x y ~~ box y x
1404.76 s
[algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
1404.76 s
[algebraic-graphs] OK: box x (vertex ()) ~~ x
1404.76 s
[algebraic-graphs] OK: box x empty ~~ empty
1404.76 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1404.76 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1404.76 s
[algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
1404.76 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] ============ AdjacencyMap.bfsForest ============
1404.76 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
1404.76 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
1404.76 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
1404.76 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
1404.76 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
1404.76 s
[algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
1404.76 s
[algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
1404.76 s
[algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
1404.76 s
[algebraic-graphs] OK: bfsForest x [] == []
1404.76 s
[algebraic-graphs] OK: bfsForest empty vs == []
1404.76 s
[algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
1404.76 s
[algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] ============ AdjacencyMap.bfs ============
1404.76 s
[algebraic-graphs] OK: bfs (edge 1 2) [0] == []
1404.76 s
[algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
1404.76 s
[algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
1404.76 s
[algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
1404.76 s
[algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
1404.76 s
[algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
1404.76 s
[algebraic-graphs] OK: bfs empty vs == []
1404.76 s
[algebraic-graphs] OK: bfs x [] == []
1404.76 s
[algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
1404.76 s
[algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
1404.76 s
[algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
1404.76 s
[algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
1404.76 s
[algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
1404.76 s
[algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] ============ AdjacencyMap.dfsForest ============
1404.76 s
[algebraic-graphs] OK: forest $ dfsForest empty == empty
1404.76 s
[algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
1404.76 s
[algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
1404.76 s
[algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
1404.76 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
1404.76 s
[algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
1404.76 s
[algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
1404.76 s
[algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
1404.76 s
[algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
1404.76 s
[algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
1404.76 s
[algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
1404.76 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
1404.76 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
1404.76 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
1404.76 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
1404.76 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
1404.76 s
[algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
1404.76 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
1404.76 s
[algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
1404.76 s
[algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
1404.76 s
[algebraic-graphs] OK: dfsForestFrom x [] == []
1404.76 s
[algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
1404.76 s
[algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] ============ AdjacencyMap.dfs ============
1404.76 s
[algebraic-graphs] OK: dfs empty vs == []
1404.76 s
[algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
1404.76 s
[algebraic-graphs] OK: dfs (edge 1 2) [0] == []
1404.76 s
[algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
1404.76 s
[algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
1404.76 s
[algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
1404.76 s
[algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
1404.76 s
[algebraic-graphs] OK: dfs x [] == []
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
1404.76 s
[algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
1404.76 s
[algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] ============ AdjacencyMap.dfs ============
1404.76 s
[algebraic-graphs] OK: reachable empty x == []
1404.76 s
[algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
1404.76 s
[algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
1404.76 s
[algebraic-graphs] OK: reachable (edge 1 2) 0 == []
1404.76 s
[algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
1404.76 s
[algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
1404.76 s
[algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
1404.76 s
[algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
1404.76 s
[algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] ============ AdjacencyMap.topSort ============
1404.76 s
[algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
1404.76 s
[algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
1404.76 s
[algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
1404.76 s
[algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
1404.76 s
[algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
1404.76 s
[algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
1404.76 s
[algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
1404.76 s
[algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
1404.76 s
[algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
1404.76 s
[algebraic-graphs] OK: topSort . vertices == Right . nub . sort
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
1404.76 s
[algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
1404.76 s
[algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
1404.76 s
[algebraic-graphs] OK: isAcyclic . circuit == null
1404.76 s
[algebraic-graphs] OK: isAcyclic == isRight . topSort
1404.76 s
[algebraic-graphs]
1404.76 s
[algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
1404.76 s
[algebraic-graphs] OK: isDfsForestOf [] empty == True
1404.76 s
[algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
1404.76 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
1404.76 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
1404.76 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
1404.76 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
1404.76 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
1409.85 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
1409.85 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
1409.86 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
1409.86 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
1409.86 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
1409.86 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
1409.86 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
1409.86 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
1409.86 s
[algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
1409.86 s
[algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
1409.86 s
[algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
1409.86 s
[algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
1409.86 s
[algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
1409.86 s
[algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
1409.86 s
[algebraic-graphs] OK: isTopSortOf [] empty == True
1409.86 s
[algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
1409.86 s
[algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] ============ AdjacencyMap.induceJust ============
1409.86 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1409.86 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1409.86 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1409.86 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] ============ AdjacencyMap.scc ============
1409.86 s
[algebraic-graphs] OK: scc empty == empty
1409.86 s
[algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
1409.86 s
[algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
1409.86 s
[algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
1409.86 s
[algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
1409.86 s
[algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
1409.86 s
[algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
1409.86 s
[algebraic-graphs] OK: isAcyclic . scc == const True
1409.86 s
[algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
1409.86 s
[algebraic-graphs] OK: scc g == KL.scc g
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
1409.86 s
[algebraic-graphs] OK: 0 == rightVertex 0
1409.86 s
[algebraic-graphs] OK: swap 1 == leftVertex 1
1409.86 s
[algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
1409.86 s
[algebraic-graphs] OK: swap 1 * 2 == edge 1 2
1409.86 s
[algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
1409.86 s
[algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
1409.86 s
[algebraic-graphs] OK: show empty == "empty"
1409.86 s
[algebraic-graphs] OK: show 1 == "rightVertex 1"
1409.86 s
[algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
1409.86 s
[algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
1409.86 s
[algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
1409.86 s
[algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
1409.86 s
[algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
1409.86 s
[algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
1409.86 s
[algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] OK: x + y == y + x
1409.86 s
[algebraic-graphs] OK: x + (y + z) == (x + y) + z
1409.86 s
[algebraic-graphs] OK: x * empty == x
1409.86 s
[algebraic-graphs] OK: empty * x == x
1409.86 s
[algebraic-graphs] OK: x * y == y * x
1409.86 s
[algebraic-graphs] OK: x * (y * z) == (x * y) * z
1409.86 s
[algebraic-graphs] OK: x * (y + z) == x * y + x * z
1409.86 s
[algebraic-graphs] OK: (x + y) * z == x * z + y * z
1409.86 s
[algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
1409.86 s
[algebraic-graphs] OK: x + empty == x
1409.86 s
[algebraic-graphs] OK: empty + x == x
1409.86 s
[algebraic-graphs] OK: x + x == x
1409.86 s
[algebraic-graphs] OK: x * y + x + y == x * y
1409.86 s
[algebraic-graphs] OK: x * x * x == x * x
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
1409.86 s
[algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
1409.86 s
[algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
1409.86 s
[algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
1409.86 s
[algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
1409.86 s
[algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
1409.86 s
[algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
1409.86 s
[algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
1409.86 s
[algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
1409.86 s
[algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
1409.86 s
[algebraic-graphs] OK: isEmpty empty == True
1409.86 s
[algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
1409.86 s
[algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
1409.86 s
[algebraic-graphs] OK: hasVertex x empty == False
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
1409.86 s
[algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
1409.86 s
[algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
1409.86 s
[algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
1409.86 s
[algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
1409.86 s
[algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
1409.86 s
[algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
1409.86 s
[algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
1409.86 s
[algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
1409.86 s
[algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
1409.86 s
[algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
1409.86 s
[algebraic-graphs] OK: vertex . Left == leftVertex
1409.86 s
[algebraic-graphs] OK: vertex . Right == rightVertex
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
1409.86 s
[algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
1409.86 s
[algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
1409.86 s
[algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
1409.86 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1409.86 s
[algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
1409.86 s
[algebraic-graphs]
1409.86 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
1409.87 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1409.87 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1409.87 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1409.87 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1409.87 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1409.87 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1409.87 s
[algebraic-graphs]
1409.87 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
1409.87 s
[algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
1409.87 s
[algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
1409.87 s
[algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
1409.87 s
[algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
1409.87 s
[algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
1409.87 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1409.87 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1409.87 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1409.87 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1409.87 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1409.87 s
[algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
1409.87 s
[algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
1409.87 s
[algebraic-graphs]
1409.87 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
1409.87 s
[algebraic-graphs] OK: vertices [] [] == empty
1409.87 s
[algebraic-graphs] OK: vertices [x] [] == leftVertex x
1409.87 s
[algebraic-graphs] OK: vertices [] [x] == rightVertex x
1409.87 s
[algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
1409.87 s
[algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
1409.87 s
[algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
1409.87 s
[algebraic-graphs]
1409.87 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
1409.87 s
[algebraic-graphs] OK: edges [] == empty
1409.87 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1409.87 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1409.87 s
[algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
1409.87 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1409.87 s
[algebraic-graphs]
1409.87 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
1409.87 s
[algebraic-graphs] OK: overlays [] == empty
1409.87 s
[algebraic-graphs] OK: overlays [x] == x
1409.87 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1409.87 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1409.87 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1409.87 s
[algebraic-graphs]
1409.87 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
1409.87 s
[algebraic-graphs] OK: connects [] == empty
1409.87 s
[algebraic-graphs] OK: connects [x] == x
1409.87 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1409.87 s
[algebraic-graphs] OK: connects == foldr connect empty
1409.87 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1409.87 s
[algebraic-graphs]
1409.87 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
1411.00 s
[algebraic-graphs] OK: swap empty == empty
1411.00 s
[algebraic-graphs] OK: swap . leftVertex == rightVertex
1411.00 s
[algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
1411.00 s
[algebraic-graphs] OK: swap (edge x y) == edge y x
1411.00 s
[algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
1411.00 s
[algebraic-graphs] OK: swap . swap == id
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
1411.00 s
[algebraic-graphs] OK: toBipartite empty == empty
1411.00 s
[algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
1411.00 s
[algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
1411.00 s
[algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
1411.00 s
[algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
1411.00 s
[algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
1411.00 s
[algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
1411.00 s
[algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
1411.00 s
[algebraic-graphs] OK: toBipartite . fromBipartite == id
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
1411.00 s
[algebraic-graphs] OK: toBipartiteWith f empty == empty
1411.00 s
[algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
1411.00 s
[algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
1411.00 s
[algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
1411.00 s
[algebraic-graphs] OK: toBipartiteWith id == toBipartite
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
1411.00 s
[algebraic-graphs] OK: fromBipartite empty == empty
1411.00 s
[algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
1411.00 s
[algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
1411.00 s
[algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
1411.00 s
[algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
1411.00 s
[algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
1411.00 s
[algebraic-graphs] OK: isEmpty empty == True
1411.00 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1411.00 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1411.00 s
[algebraic-graphs] OK: isEmpty == (==) empty
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
1411.00 s
[algebraic-graphs] OK: hasLeftVertex x empty == False
1411.00 s
[algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
1411.00 s
[algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
1411.00 s
[algebraic-graphs] OK: hasRightVertex x empty == False
1411.00 s
[algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
1411.00 s
[algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
1411.00 s
[algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
1411.00 s
[algebraic-graphs] OK: hasVertex . Right == hasRightVertex
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
1411.00 s
[algebraic-graphs] OK: hasEdge x y empty == False
1411.00 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1411.00 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1411.00 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
1411.00 s
[algebraic-graphs] OK: leftVertexCount empty == 0
1411.00 s
[algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
1411.00 s
[algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
1411.00 s
[algebraic-graphs] OK: leftVertexCount (edge x y) == 1
1411.00 s
[algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
1411.00 s
[algebraic-graphs] OK: rightVertexCount empty == 0
1411.00 s
[algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
1411.00 s
[algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
1411.00 s
[algebraic-graphs] OK: rightVertexCount (edge x y) == 1
1411.00 s
[algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
1411.00 s
[algebraic-graphs] OK: vertexCount empty == 0
1411.00 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1411.00 s
[algebraic-graphs] OK: vertexCount (edge x y) == 2
1411.00 s
[algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
1411.00 s
[algebraic-graphs] OK: edgeCount empty == 0
1411.00 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1411.00 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1411.00 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
1411.00 s
[algebraic-graphs] OK: leftVertexList empty == []
1411.00 s
[algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
1411.00 s
[algebraic-graphs] OK: leftVertexList (rightVertex x) == []
1411.00 s
[algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
1411.00 s
[algebraic-graphs] OK: rightVertexList empty == []
1411.00 s
[algebraic-graphs] OK: rightVertexList (leftVertex x) == []
1411.00 s
[algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
1411.00 s
[algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
1411.00 s
[algebraic-graphs] OK: vertexList empty == []
1411.00 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1411.00 s
[algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
1411.00 s
[algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
1411.00 s
[algebraic-graphs] OK: edgeList empty == []
1411.00 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1411.00 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1411.00 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
1411.00 s
[algebraic-graphs] OK: leftVertexSet empty == Set.empty
1411.00 s
[algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
1411.00 s
[algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
1411.00 s
[algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
1411.00 s
[algebraic-graphs] OK: rightVertexSet empty == Set.empty
1411.00 s
[algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
1411.00 s
[algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
1411.00 s
[algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
1411.00 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1411.00 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1411.00 s
[algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
1411.00 s
[algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
1411.00 s
[algebraic-graphs]
1411.00 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
1411.00 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1411.00 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1411.00 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1411.00 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1411.01 s
[algebraic-graphs]
1411.01 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
1411.01 s
[algebraic-graphs] OK: leftAdjacencyList empty == []
1411.01 s
[algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
1411.01 s
[algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
1411.01 s
[algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
1411.01 s
[algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
1411.01 s
[algebraic-graphs]
1411.01 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
1411.01 s
[algebraic-graphs] OK: rightAdjacencyList empty == []
1411.01 s
[algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
1411.01 s
[algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
1411.01 s
[algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
1411.01 s
[algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
1411.01 s
[algebraic-graphs]
1411.01 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
1411.01 s
[algebraic-graphs] OK: evenList [] == Nil
1411.01 s
[algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
1411.01 s
[algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
1411.01 s
[algebraic-graphs]
1411.01 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
1411.01 s
[algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
1411.01 s
[algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
1411.01 s
[algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
1411.01 s
[algebraic-graphs]
1411.01 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
1411.01 s
[algebraic-graphs] OK: path Nil == empty
1411.01 s
[algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
1411.01 s
[algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
1411.01 s
[algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
1411.01 s
[algebraic-graphs]
1411.01 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
1411.01 s
[algebraic-graphs] OK: circuit [] == empty
1411.01 s
[algebraic-graphs] OK: circuit [(x,y)] == edge x y
1411.01 s
[algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
1411.01 s
[algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
1411.01 s
[algebraic-graphs]
1411.01 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
1411.01 s
[algebraic-graphs] OK: biclique [] [] == empty
1411.01 s
[algebraic-graphs] OK: biclique xs [] == vertices xs []
1411.01 s
[algebraic-graphs] OK: biclique [] ys == vertices [] ys
1411.01 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
1411.01 s
[algebraic-graphs]
1411.01 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
1411.01 s
[algebraic-graphs] OK: star x [] == leftVertex x
1411.01 s
[algebraic-graphs] OK: star x [y] == edge x y
1411.01 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1411.01 s
[algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
1411.01 s
[algebraic-graphs]
1411.01 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
1411.01 s
[algebraic-graphs] OK: stars [] == empty
1411.01 s
[algebraic-graphs] OK: stars [(x, [])] == leftVertex x
1411.01 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1411.01 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1421.95 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1421.96 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1421.96 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1421.96 s
[algebraic-graphs]
1421.96 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
1421.96 s
[algebraic-graphs] OK: mesh xs [] == empty
1421.96 s
[algebraic-graphs] OK: mesh [] ys == empty
1421.96 s
[algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
1421.96 s
[algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
1421.96 s
[algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
1421.96 s
[algebraic-graphs]
1421.96 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
1421.96 s
[algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
1421.96 s
[algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
1421.96 s
[algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
1421.96 s
[algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
1421.96 s
[algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
1421.96 s
[algebraic-graphs]
1421.96 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
1421.96 s
[algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
1421.96 s
[algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
1421.96 s
[algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
1421.96 s
[algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
1421.96 s
[algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
1421.96 s
[algebraic-graphs]
1421.96 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
1421.96 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
1421.96 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1421.96 s
[algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
1421.96 s
[algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
1421.96 s
[algebraic-graphs]
1421.96 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
1421.96 s
[algebraic-graphs] OK: bimap f g empty == empty
1421.96 s
[algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
1421.96 s
[algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
1421.96 s
[algebraic-graphs] OK: bimap id id == id
1421.96 s
[algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
1421.96 s
[algebraic-graphs]
1421.96 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
1421.96 s
[algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
1421.96 s
[algebraic-graphs]
1421.96 s
[algebraic-graphs] OK: box x y ~~ box y x
1421.96 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1421.96 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1421.96 s
[algebraic-graphs] OK: box x (leftVertex ()) ~~ x
1421.96 s
[algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
1421.96 s
[algebraic-graphs] OK: box x empty ~~ empty
1421.96 s
[algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
1421.96 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1421.96 s
[algebraic-graphs]
1421.96 s
[algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
1421.96 s
[algebraic-graphs]
1421.96 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
1421.96 s
[algebraic-graphs] OK: consistent empty == True
1421.96 s
[algebraic-graphs] OK: consistent (vertex x) == True
1421.96 s
[algebraic-graphs] OK: consistent (edge x y) == True
1421.96 s
[algebraic-graphs] OK: consistent (edges x) == True
1421.96 s
[algebraic-graphs] OK: consistent (toBipartite x) == True
1421.96 s
[algebraic-graphs] OK: consistent (swap x) == True
1421.96 s
[algebraic-graphs] OK: consistent (circuit xs) == True
1421.96 s
[algebraic-graphs] OK: consistent (biclique xs ys) == True
1421.96 s
[algebraic-graphs]
1421.96 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
1421.96 s
[algebraic-graphs] OK: detectParts empty == Right empty
1421.96 s
[algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
1421.96 s
[algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
1421.96 s
[algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
1421.96 s
[algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
1421.96 s
[algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
1421.96 s
[algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
1421.96 s
[algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
1421.96 s
[algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
1421.96 s
[algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
1421.96 s
[algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
1421.96 s
[algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
1421.96 s
[algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
1421.96 s
[algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
1421.96 s
[algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
1421.96 s
[algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
1421.96 s
[algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
1421.96 s
[algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
1421.96 s
[algebraic-graphs]
1421.96 s
[algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
1421.97 s
[algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
1421.97 s
[algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
1421.97 s
[algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
1421.97 s
[algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
1421.97 s
[algebraic-graphs]
1421.97 s
[algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
1421.97 s
[algebraic-graphs] OK: show (matching []) == "matching []"
1421.97 s
[algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
1421.97 s
[algebraic-graphs]
1421.97 s
[algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
1421.97 s
[algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
1421.97 s
[algebraic-graphs]
1421.97 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
1421.97 s
[algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
1421.97 s
[algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
1421.97 s
[algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
1421.97 s
[algebraic-graphs]
1421.97 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
1421.97 s
[algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
1421.97 s
[algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
1421.97 s
[algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
1421.97 s
[algebraic-graphs]
1421.97 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
1421.97 s
[algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
1421.97 s
[algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
1421.97 s
[algebraic-graphs]
1421.97 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
1421.97 s
[algebraic-graphs] OK: isMatchingOf (matching []) x == True
1421.97 s
[algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
1421.97 s
[algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
1421.97 s
[algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
1421.97 s
[algebraic-graphs]
1421.97 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
1421.97 s
[algebraic-graphs] OK: matchingSize (matching []) == 0
1421.97 s
[algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
1421.97 s
[algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
1421.97 s
[algebraic-graphs] OK: matchingSize (matching xs) <= length xs
1421.97 s
[algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
1421.97 s
[algebraic-graphs]
1421.97 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
1421.97 s
[algebraic-graphs] OK: maxMatching empty == matching []
1421.97 s
[algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
1421.97 s
[algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
1421.97 s
[algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
1421.97 s
[algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
1421.97 s
[algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
1421.97 s
[algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
1421.97 s
[algebraic-graphs]
1421.97 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
1421.97 s
[algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
1421.97 s
[algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
1421.97 s
[algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
1421.97 s
[algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
1421.97 s
[algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
1421.97 s
[algebraic-graphs]
1421.97 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
1421.97 s
[algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
1423.97 s
[algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
1423.97 s
[algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
1423.97 s
[algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
1423.97 s
[algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
1423.97 s
[algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
1423.97 s
[algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
1423.97 s
[algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
1423.97 s
[algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
1423.97 s
[algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
1423.97 s
[algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
1423.97 s
[algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
1423.97 s
[algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
1423.97 s
[algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
1423.97 s
[algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
1423.97 s
[algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
1423.97 s
[algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
1423.97 s
[algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
1423.97 s
[algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
1423.97 s
[algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
1423.97 s
[algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
1423.97 s
[algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
1423.97 s
[algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
1423.97 s
[algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
1423.97 s
[algebraic-graphs] OK: consistentMatching (matching xs) == True
1423.97 s
[algebraic-graphs] OK: consistentMatching (maxMatching x) == True
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Export.Eq ============
1423.97 s
[algebraic-graphs] OK: mempty /= literal ""
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Export.Ord ============
1423.97 s
[algebraic-graphs] OK: mempty < literal ""
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Export.isEmpty ============
1423.97 s
[algebraic-graphs] OK: isEmpty mempty == True
1423.97 s
[algebraic-graphs] OK: isEmpty (literal "") == False
1423.97 s
[algebraic-graphs] OK: isEmpty x == (x == mempty)
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Export.literal ============
1423.97 s
[algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
1423.97 s
[algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
1423.97 s
[algebraic-graphs] OK: render . literal == id
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Export.render ============
1423.97 s
[algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
1423.97 s
[algebraic-graphs] OK: render mempty == mempty
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Export.<+> ============
1423.97 s
[algebraic-graphs] OK: x <+> mempty == x
1423.97 s
[algebraic-graphs] OK: mempty <+> x == x
1423.97 s
[algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
1423.97 s
[algebraic-graphs] OK: "name" <+> "surname" == "name surname"
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Export.brackets ============
1423.97 s
[algebraic-graphs] OK: brackets "i" == "[i]"
1423.97 s
[algebraic-graphs] OK: brackets mempty == "[]"
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Export.doubleQuotes ============
1423.97 s
[algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
1423.97 s
[algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Export.indent ============
1423.97 s
[algebraic-graphs] OK: indent 0 == id
1423.97 s
[algebraic-graphs] OK: indent 1 mempty == " "
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Export.unlines ============
1423.97 s
[algebraic-graphs] OK: unlines [] == mempty
1423.97 s
[algebraic-graphs] OK: unlines [mempty] == "\n"
1423.97 s
[algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Export.export ============
1423.97 s
[algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Export.Dot.export ============
1423.97 s
[algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] =========== Export.Dot.attributeQuoting ============
1423.97 s
[algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Export.Dot.exportAsIs ============
1423.97 s
[algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Export.Dot.exportViaShow ============
1423.97 s
[algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Graph ============
1423.97 s
[algebraic-graphs] OK: Axioms of graphs
1423.97 s
[algebraic-graphs] OK: Theorems of graphs
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Graph.Ord ============
1423.97 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1423.97 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1423.97 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1423.97 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1423.97 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1423.97 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1423.97 s
[algebraic-graphs] OK: x <= x + y
1423.97 s
[algebraic-graphs] OK: x + y <= x * y
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Graph.empty ============
1423.97 s
[algebraic-graphs] OK: isEmpty empty == True
1423.97 s
[algebraic-graphs] OK: hasVertex x empty == False
1423.97 s
[algebraic-graphs] OK: vertexCount empty == 0
1423.97 s
[algebraic-graphs] OK: edgeCount empty == 0
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Graph.vertex ============
1423.97 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1423.97 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1423.97 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1423.97 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Graph.edge ============
1423.97 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1423.97 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1423.97 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1423.97 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1423.97 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Graph.overlay ============
1423.97 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1423.97 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1423.97 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1423.97 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1423.97 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1423.97 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1423.97 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1423.97 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Graph.connect ============
1423.97 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1423.97 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1423.97 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1423.97 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1423.97 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1423.97 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1423.97 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1423.97 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1423.97 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1423.97 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Graph.vertices ============
1423.97 s
[algebraic-graphs] OK: vertices [] == empty
1423.97 s
[algebraic-graphs] OK: vertices [x] == vertex x
1423.97 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1423.97 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1423.97 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1423.97 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Graph.edges ============
1423.97 s
[algebraic-graphs] OK: edges [] == empty
1423.97 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1423.97 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1423.97 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Graph.overlays ============
1423.97 s
[algebraic-graphs] OK: overlays [] == empty
1423.97 s
[algebraic-graphs] OK: overlays [x] == x
1423.97 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1423.97 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1423.97 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Graph.connects ============
1423.97 s
[algebraic-graphs] OK: connects [] == empty
1423.97 s
[algebraic-graphs] OK: connects [x] == x
1423.97 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1423.97 s
[algebraic-graphs] OK: connects == foldr connect empty
1423.97 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Graph.isSubgraphOf ============
1423.97 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1423.97 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1423.97 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1423.97 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1423.97 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1423.97 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1423.97 s
[algebraic-graphs]
1423.97 s
[algebraic-graphs] ============ Graph.toGraph et al. ============
1423.97 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1423.97 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1423.97 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1423.97 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1423.97 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1423.97 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1423.97 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1423.97 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1423.97 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1424.64 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1424.64 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1424.64 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1424.64 s
[algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
1424.64 s
[algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
1424.64 s
[algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
1424.64 s
[algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
1424.64 s
[algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
1424.64 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1424.64 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1424.64 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1424.64 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1424.64 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1424.64 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1424.64 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1424.64 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1424.64 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1424.64 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1424.64 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1424.64 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1424.65 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1424.65 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1424.65 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1424.65 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1424.65 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1424.65 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.foldg ============
1424.65 s
[algebraic-graphs] OK: foldg empty vertex overlay connect == id
1424.65 s
[algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
1424.65 s
[algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
1424.65 s
[algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.isEmpty ============
1424.65 s
[algebraic-graphs] OK: isEmpty empty == True
1424.65 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1424.65 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1424.65 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1424.65 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.hasVertex ============
1424.65 s
[algebraic-graphs] OK: hasVertex x empty == False
1424.65 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1424.65 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.hasEdge ============
1424.65 s
[algebraic-graphs] OK: hasEdge x y empty == False
1424.65 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1424.65 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1424.65 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1424.65 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.vertexCount ============
1424.65 s
[algebraic-graphs] OK: vertexCount empty == 0
1424.65 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1424.65 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1424.65 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.edgeCount ============
1424.65 s
[algebraic-graphs] OK: edgeCount empty == 0
1424.65 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1424.65 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1424.65 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.vertexList ============
1424.65 s
[algebraic-graphs] OK: vertexList empty == []
1424.65 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1424.65 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.vertexSet ============
1424.65 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1424.65 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1424.65 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.vertexIntSet ============
1424.65 s
[algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
1424.65 s
[algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
1424.65 s
[algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
1424.65 s
[algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.edgeList ============
1424.65 s
[algebraic-graphs] OK: edgeList empty == []
1424.65 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1424.65 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1424.65 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1424.65 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.edgeSet ============
1424.65 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1424.65 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1424.65 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1424.65 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.adjacencyList ============
1424.65 s
[algebraic-graphs] OK: adjacencyList empty == []
1424.65 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1424.65 s
[algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
1424.65 s
[algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.preSet ============
1424.65 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1424.65 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1424.65 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1424.65 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.preIntSet ============
1424.65 s
[algebraic-graphs] OK: preIntSet x empty == IntSet.empty
1424.65 s
[algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
1424.65 s
[algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
1424.65 s
[algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.postSet ============
1424.65 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1424.65 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1424.65 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1424.65 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.postIntSet ============
1424.65 s
[algebraic-graphs] OK: postIntSet x empty == IntSet.empty
1424.65 s
[algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
1424.65 s
[algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
1424.65 s
[algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.size ============
1424.65 s
[algebraic-graphs] OK: size empty == 1
1424.65 s
[algebraic-graphs] OK: size (vertex x) == 1
1424.65 s
[algebraic-graphs] OK: size (overlay x y) == size x + size y
1424.65 s
[algebraic-graphs] OK: size (connect x y) == size x + size y
1424.65 s
[algebraic-graphs] OK: size x >= 1
1424.65 s
[algebraic-graphs] OK: size x >= vertexCount x
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.path ============
1424.65 s
[algebraic-graphs] OK: path [] == empty
1424.65 s
[algebraic-graphs] OK: path [x] == vertex x
1424.65 s
[algebraic-graphs] OK: path [x,y] == edge x y
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.circuit ============
1424.65 s
[algebraic-graphs] OK: circuit [] == empty
1424.65 s
[algebraic-graphs] OK: circuit [x] == edge x x
1424.65 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.clique ============
1424.65 s
[algebraic-graphs] OK: clique [] == empty
1424.65 s
[algebraic-graphs] OK: clique [x] == vertex x
1424.65 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1424.65 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1424.65 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.biclique ============
1424.65 s
[algebraic-graphs] OK: biclique [] [] == empty
1424.65 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1424.65 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1424.65 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1424.65 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.star ============
1424.65 s
[algebraic-graphs] OK: star x [] == vertex x
1424.65 s
[algebraic-graphs] OK: star x [y] == edge x y
1424.65 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1424.65 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.stars ============
1424.65 s
[algebraic-graphs] OK: stars [] == empty
1424.65 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1424.65 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1424.65 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1424.65 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1424.65 s
[algebraic-graphs] OK: stars . adjacencyList == id
1424.65 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.tree ============
1424.65 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1424.65 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1424.65 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1424.65 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.forest ============
1424.65 s
[algebraic-graphs] OK: forest [] == empty
1424.65 s
[algebraic-graphs] OK: forest [x] == tree x
1424.65 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1424.65 s
[algebraic-graphs] OK: forest == overlays . map tree
1424.65 s
[algebraic-graphs]
1424.65 s
[algebraic-graphs] ============ Graph.removeVertex ============
1427.71 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1427.71 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1427.71 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1427.76 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1427.76 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.removeEdge ============
1427.76 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1427.76 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1427.76 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1427.76 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1427.76 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1427.76 s
[algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.replaceVertex ============
1427.76 s
[algebraic-graphs] OK: replaceVertex x x == id
1427.76 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1427.76 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.mergeVertices ============
1427.76 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1427.76 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1427.76 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1427.76 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.transpose ============
1427.76 s
[algebraic-graphs] OK: transpose empty == empty
1427.76 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1427.76 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1427.76 s
[algebraic-graphs] OK: transpose . transpose == id
1427.76 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.gmap ============
1427.76 s
[algebraic-graphs] OK: gmap f empty == empty
1427.76 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1427.76 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1427.76 s
[algebraic-graphs] OK: gmap id == id
1427.76 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.induce ============
1427.76 s
[algebraic-graphs] OK: induce (const True ) x == x
1427.76 s
[algebraic-graphs] OK: induce (const False) x == empty
1427.76 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1427.76 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1427.76 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.induceJust ============
1427.76 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1427.76 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1427.76 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1427.76 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.compose ============
1427.76 s
[algebraic-graphs] OK: compose empty x == empty
1427.76 s
[algebraic-graphs] OK: compose x empty == empty
1427.76 s
[algebraic-graphs] OK: compose (vertex x) y == empty
1427.76 s
[algebraic-graphs] OK: compose x (vertex y) == empty
1427.76 s
[algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
1427.76 s
[algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
1427.76 s
[algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
1427.76 s
[algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
1427.76 s
[algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
1427.76 s
[algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
1427.76 s
[algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.(===) ============
1427.76 s
[algebraic-graphs] OK: x === x == True
1427.76 s
[algebraic-graphs] OK: x === x + empty == False
1427.76 s
[algebraic-graphs] OK: x + y === x + y == True
1427.76 s
[algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
1427.76 s
[algebraic-graphs] OK: x + y === x * y == False
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.mesh ============
1427.76 s
[algebraic-graphs] OK: mesh xs [] == empty
1427.76 s
[algebraic-graphs] OK: mesh [] ys == empty
1427.76 s
[algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
1427.76 s
[algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
1427.76 s
[algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
1427.76 s
[algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.torus ============
1427.76 s
[algebraic-graphs] OK: torus xs [] == empty
1427.76 s
[algebraic-graphs] OK: torus [] ys == empty
1427.76 s
[algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
1427.76 s
[algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
1427.76 s
[algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
1427.76 s
[algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.deBruijn ============
1427.76 s
[algebraic-graphs] OK: deBruijn 0 xs == edge [] []
1427.76 s
[algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
1427.76 s
[algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
1427.76 s
[algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
1427.76 s
[algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
1427.76 s
[algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
1427.76 s
[algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
1427.76 s
[algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.splitVertex ============
1427.76 s
[algebraic-graphs] OK: splitVertex x [] == removeVertex x
1427.76 s
[algebraic-graphs] OK: splitVertex x [x] == id
1427.76 s
[algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
1427.76 s
[algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.bind ============
1427.76 s
[algebraic-graphs] OK: bind empty f == empty
1427.76 s
[algebraic-graphs] OK: bind (vertex x) f == f x
1427.76 s
[algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
1427.76 s
[algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
1427.76 s
[algebraic-graphs] OK: bind x (const empty) == empty
1427.76 s
[algebraic-graphs] OK: bind x vertex == x
1427.76 s
[algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.simplify ============
1427.76 s
[algebraic-graphs] OK: simplify == id
1427.76 s
[algebraic-graphs] OK: size (simplify x) <= size x
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.box ============
1427.76 s
[algebraic-graphs] OK: box x y ~~ box y x
1427.76 s
[algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
1427.76 s
[algebraic-graphs] OK: box x (vertex ()) ~~ x
1427.76 s
[algebraic-graphs] OK: box x empty ~~ empty
1427.76 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1427.76 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1427.76 s
[algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
1427.76 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.sparsify ============
1427.76 s
[algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
1427.76 s
[algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
1427.76 s
[algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
1427.76 s
[algebraic-graphs] OK: size (sparsify x) <= 3 * size x
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.sparsifyKL ============
1427.76 s
[algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
1427.76 s
[algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
1427.76 s
[algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.context ============
1427.76 s
[algebraic-graphs] OK: context (const False) x == Nothing
1427.76 s
[algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
1427.76 s
[algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
1427.76 s
[algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
1427.76 s
[algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.buildg ============
1427.76 s
[algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
1427.76 s
[algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
1427.76 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
1427.76 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
1427.76 s
[algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
1427.76 s
[algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Internal.List ============
1427.76 s
[algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Graph.Label ============
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Any: instances ============
1427.76 s
[algebraic-graphs] OK: Semiring
1427.76 s
[algebraic-graphs] OK: StarSemiring
1427.76 s
[algebraic-graphs] OK: Dioid
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Distance Int: instances ============
1427.76 s
[algebraic-graphs] OK: Semiring
1427.76 s
[algebraic-graphs] OK: StarSemiring
1427.76 s
[algebraic-graphs] OK: Dioid
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Capacity Int: instances ============
1427.76 s
[algebraic-graphs] OK: Semiring
1427.76 s
[algebraic-graphs] OK: StarSemiring
1427.76 s
[algebraic-graphs] OK: Dioid
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Minimum (Path Int): instances ============
1427.76 s
[algebraic-graphs] OK: LeftNearRing
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ PowerSet (Path Int): instances ============
1427.76 s
[algebraic-graphs] OK: Semiring
1427.76 s
[algebraic-graphs] OK: Dioid
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Count Int: instances ============
1427.76 s
[algebraic-graphs] OK: Semiring
1427.76 s
[algebraic-graphs] OK: StarSemiring
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
1427.76 s
[algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
1427.76 s
[algebraic-graphs] OK: empty
1427.76 s
[algebraic-graphs] OK: vertex
1427.76 s
[algebraic-graphs] OK: edge
1427.76 s
[algebraic-graphs] OK: overlay
1427.76 s
[algebraic-graphs] OK: connect
1427.76 s
[algebraic-graphs] OK: vertices
1427.76 s
[algebraic-graphs] OK: edges
1427.76 s
[algebraic-graphs] OK: overlays
1427.76 s
[algebraic-graphs] OK: fromAdjacencyMaps
1427.76 s
[algebraic-graphs] OK: removeVertex
1427.76 s
[algebraic-graphs] OK: removeEdge
1427.76 s
[algebraic-graphs] OK: replaceVertex
1427.76 s
[algebraic-graphs] OK: replaceEdge
1427.76 s
[algebraic-graphs] OK: transpose
1427.76 s
[algebraic-graphs] OK: gmap
1427.76 s
[algebraic-graphs] OK: emap
1427.76 s
[algebraic-graphs] OK: induce
1427.76 s
[algebraic-graphs] OK: closure
1427.76 s
[algebraic-graphs] OK: reflexiveClosure
1427.76 s
[algebraic-graphs] OK: symmetricClosure
1427.76 s
[algebraic-graphs] OK: transitiveClosure
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
1427.76 s
[algebraic-graphs] OK: isEmpty empty == True
1427.76 s
[algebraic-graphs] OK: hasVertex x empty == False
1427.76 s
[algebraic-graphs] OK: vertexCount empty == 0
1427.76 s
[algebraic-graphs] OK: edgeCount empty == 0
1427.76 s
[algebraic-graphs]
1427.76 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
1427.76 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1427.76 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1427.76 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1427.76 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1427.76 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
1430.10 s
[algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
1430.10 s
[algebraic-graphs] OK: edge zero x y == vertices [x,y]
1430.10 s
[algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
1430.10 s
[algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
1430.10 s
[algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
1430.10 s
[algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
1430.10 s
[algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
1430.10 s
[algebraic-graphs] OK: x -<e>- y == edge e x y
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
1430.10 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1430.10 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1430.10 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1430.10 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1430.10 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1430.10 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1430.10 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1430.10 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
1430.10 s
[algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
1430.10 s
[algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
1430.10 s
[algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
1430.10 s
[algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
1430.10 s
[algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
1430.10 s
[algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
1430.10 s
[algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1430.10 s
[algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
1430.10 s
[algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
1430.10 s
[algebraic-graphs] OK: vertices [] == empty
1430.10 s
[algebraic-graphs] OK: vertices [x] == vertex x
1430.10 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1430.10 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1430.10 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1430.10 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
1430.10 s
[algebraic-graphs] OK: edges [] == empty
1430.10 s
[algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
1430.10 s
[algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
1430.10 s
[algebraic-graphs] OK: overlays [] == empty
1430.10 s
[algebraic-graphs] OK: overlays [x] == x
1430.10 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1430.10 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1430.10 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
1430.10 s
[algebraic-graphs] OK: fromAdjacencyMaps [] == empty
1430.10 s
[algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
1430.10 s
[algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
1430.10 s
[algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
1430.10 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1430.10 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1430.10 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
1430.10 s
[algebraic-graphs] OK: isEmpty empty == True
1430.10 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1430.10 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1430.10 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1430.10 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
1430.10 s
[algebraic-graphs] OK: hasVertex x empty == False
1430.10 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1430.10 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
1430.10 s
[algebraic-graphs] OK: hasEdge x y empty == False
1430.10 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1430.10 s
[algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
1430.10 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1430.10 s
[algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
1430.10 s
[algebraic-graphs] OK: edgeLabel x y empty == zero
1430.10 s
[algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
1430.10 s
[algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
1430.10 s
[algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
1430.10 s
[algebraic-graphs] OK: vertexCount empty == 0
1430.10 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1430.10 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1430.10 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
1430.10 s
[algebraic-graphs] OK: edgeCount empty == 0
1430.10 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1430.10 s
[algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
1430.10 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
1430.10 s
[algebraic-graphs] OK: vertexList empty == []
1430.10 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1430.10 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
1430.10 s
[algebraic-graphs] OK: edgeList empty == []
1430.10 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1430.10 s
[algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
1430.10 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1430.10 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1430.10 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
1430.10 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1430.10 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1430.10 s
[algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
1430.10 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1430.10 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1430.10 s
[algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
1430.10 s
[algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
1430.10 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1430.10 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1430.10 s
[algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
1430.10 s
[algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
1430.10 s
[algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
1430.10 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1430.10 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1430.10 s
[algebraic-graphs] OK: removeVertex x (edge e x x) == empty
1430.10 s
[algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
1430.10 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
1430.10 s
[algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
1430.10 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1430.10 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1430.10 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1430.10 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
1430.10 s
[algebraic-graphs] OK: replaceVertex x x == id
1430.10 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1430.10 s
[algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
1430.10 s
[algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
1430.10 s
[algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
1430.10 s
[algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
1430.10 s
[algebraic-graphs] OK: transpose empty == empty
1430.10 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1430.10 s
[algebraic-graphs] OK: transpose (edge e x y) == edge e y x
1430.10 s
[algebraic-graphs] OK: transpose . transpose == id
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
1430.10 s
[algebraic-graphs] OK: gmap f empty == empty
1430.10 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1430.10 s
[algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
1430.10 s
[algebraic-graphs] OK: gmap id == id
1430.10 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
1430.10 s
[algebraic-graphs] OK: emap h empty == empty
1430.10 s
[algebraic-graphs] OK: emap h (vertex x) == vertex x
1430.10 s
[algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
1430.10 s
[algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
1430.10 s
[algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
1430.10 s
[algebraic-graphs] OK: emap id == id
1430.10 s
[algebraic-graphs] OK: emap g . emap h == emap (g . h)
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
1430.10 s
[algebraic-graphs] OK: induce (const True ) x == x
1430.10 s
[algebraic-graphs] OK: induce (const False) x == empty
1430.10 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1430.10 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1430.10 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1430.10 s
[algebraic-graphs]
1430.10 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
1431.25 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1431.25 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1431.25 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1431.25 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
1431.25 s
[algebraic-graphs] OK: closure empty == empty
1431.25 s
[algebraic-graphs] OK: closure (vertex x) == edge one x x
1431.25 s
[algebraic-graphs] OK: closure (edge e x x) == edge one x x
1431.25 s
[algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
1431.25 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1431.25 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1431.25 s
[algebraic-graphs] OK: closure . closure == closure
1431.25 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
1431.25 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1431.25 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
1431.25 s
[algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
1431.25 s
[algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
1431.25 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
1431.25 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1431.25 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1431.25 s
[algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
1431.25 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1431.25 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
1431.25 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1431.25 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1431.25 s
[algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
1431.25 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.empty ============
1431.25 s
[algebraic-graphs] OK: isEmpty empty == True
1431.25 s
[algebraic-graphs] OK: hasVertex x empty == False
1431.25 s
[algebraic-graphs] OK: vertexCount empty == 0
1431.25 s
[algebraic-graphs] OK: edgeCount empty == 0
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.vertex ============
1431.25 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1431.25 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1431.25 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1431.25 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.edge ============
1431.25 s
[algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
1431.25 s
[algebraic-graphs] OK: edge zero x y == vertices [x,y]
1431.25 s
[algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
1431.25 s
[algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
1431.25 s
[algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
1431.25 s
[algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
1431.25 s
[algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
1431.25 s
[algebraic-graphs] OK: x -<e>- y == edge e x y
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.overlay ============
1431.25 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1431.25 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1431.25 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1431.25 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1431.25 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1431.25 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1431.25 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1431.25 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
1431.25 s
[algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
1431.25 s
[algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.connect ============
1431.25 s
[algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
1431.25 s
[algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
1431.25 s
[algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
1431.25 s
[algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
1431.25 s
[algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1431.25 s
[algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
1431.25 s
[algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.vertices ============
1431.25 s
[algebraic-graphs] OK: vertices [] == empty
1431.25 s
[algebraic-graphs] OK: vertices [x] == vertex x
1431.25 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1431.25 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1431.25 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1431.25 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.edges ============
1431.25 s
[algebraic-graphs] OK: edges [] == empty
1431.25 s
[algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
1431.25 s
[algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.overlays ============
1431.25 s
[algebraic-graphs] OK: overlays [] == empty
1431.25 s
[algebraic-graphs] OK: overlays [x] == x
1431.25 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1431.25 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1431.25 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.foldg ============
1431.25 s
[algebraic-graphs] OK: foldg empty vertex connect == id
1431.25 s
[algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
1431.25 s
[algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
1431.25 s
[algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
1431.25 s
[algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
1431.25 s
[algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.buildg ============
1431.25 s
[algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
1431.25 s
[algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
1431.25 s
[algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
1431.25 s
[algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
1431.25 s
[algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
1431.25 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1431.25 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1431.25 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.isEmpty ============
1431.25 s
[algebraic-graphs] OK: isEmpty empty == True
1431.25 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1431.25 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1431.25 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1431.25 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.size ============
1431.25 s
[algebraic-graphs] OK: size empty == 1
1431.25 s
[algebraic-graphs] OK: size (vertex x) == 1
1431.25 s
[algebraic-graphs] OK: size (overlay x y) == size x + size y
1431.25 s
[algebraic-graphs] OK: size (connect x y) == size x + size y
1431.25 s
[algebraic-graphs] OK: size x >= 1
1431.25 s
[algebraic-graphs] OK: size x >= vertexCount x
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.hasVertex ============
1431.25 s
[algebraic-graphs] OK: hasVertex x empty == False
1431.25 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1431.25 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.hasEdge ============
1431.25 s
[algebraic-graphs] OK: hasEdge x y empty == False
1431.25 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1431.25 s
[algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
1431.25 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1431.25 s
[algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
1431.25 s
[algebraic-graphs] OK: edgeLabel x y empty == zero
1431.25 s
[algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
1431.25 s
[algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
1431.25 s
[algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.vertexCount ============
1431.25 s
[algebraic-graphs] OK: vertexCount empty == 0
1431.25 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1431.25 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1431.25 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.edgeCount ============
1431.25 s
[algebraic-graphs] OK: edgeCount empty == 0
1431.25 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1431.25 s
[algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
1431.25 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.vertexList ============
1431.25 s
[algebraic-graphs] OK: vertexList empty == []
1431.25 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1431.25 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.edgeList ============
1431.25 s
[algebraic-graphs] OK: edgeList empty == []
1431.25 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1431.25 s
[algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.vertexSet ============
1431.25 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1431.25 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1431.25 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.edgeSet ============
1431.25 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1431.25 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1431.25 s
[algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
1431.25 s
[algebraic-graphs]
1431.25 s
[algebraic-graphs] ============ Labelled.Graph.preSet ============
1431.25 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1431.25 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1433.92 s
[algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
1433.97 s
[algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.postSet ============
1433.97 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1433.97 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1433.97 s
[algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
1433.97 s
[algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.removeVertex ============
1433.97 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1433.97 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1433.97 s
[algebraic-graphs] OK: removeVertex x (edge e x x) == empty
1433.97 s
[algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
1433.97 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.removeEdge ============
1433.97 s
[algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
1433.97 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1433.97 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1433.97 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1433.97 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
1433.97 s
[algebraic-graphs] OK: replaceVertex x x == id
1433.97 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1433.97 s
[algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
1433.97 s
[algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
1433.97 s
[algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
1433.97 s
[algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.transpose ============
1433.97 s
[algebraic-graphs] OK: transpose empty == empty
1433.97 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1433.97 s
[algebraic-graphs] OK: transpose (edge e x y) == edge e y x
1433.97 s
[algebraic-graphs] OK: transpose . transpose == id
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.fmap ============
1433.97 s
[algebraic-graphs] OK: fmap f empty == empty
1433.97 s
[algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
1433.97 s
[algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
1433.97 s
[algebraic-graphs] OK: fmap id == id
1433.97 s
[algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.emap ============
1433.97 s
[algebraic-graphs] OK: emap h empty == empty
1433.97 s
[algebraic-graphs] OK: emap h (vertex x) == vertex x
1433.97 s
[algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
1433.97 s
[algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
1433.97 s
[algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
1433.97 s
[algebraic-graphs] OK: emap id == id
1433.97 s
[algebraic-graphs] OK: emap g . emap h == emap (g . h)
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.induce ============
1433.97 s
[algebraic-graphs] OK: induce (const True ) x == x
1433.97 s
[algebraic-graphs] OK: induce (const False) x == empty
1433.97 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1433.97 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1433.97 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.induceJust ============
1433.97 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1433.97 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1433.97 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1433.97 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.closure ============
1433.97 s
[algebraic-graphs] OK: closure empty == empty
1433.97 s
[algebraic-graphs] OK: closure (vertex x) == edge one x x
1433.97 s
[algebraic-graphs] OK: closure (edge e x x) == edge one x x
1433.97 s
[algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
1433.97 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1433.97 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1433.97 s
[algebraic-graphs] OK: closure . closure == closure
1433.97 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
1433.97 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1433.97 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
1433.97 s
[algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
1433.97 s
[algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
1433.97 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
1433.97 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1433.97 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1433.97 s
[algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
1433.97 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1433.97 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
1433.97 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1433.97 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1433.97 s
[algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
1433.97 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Labelled.Graph.context ============
1433.97 s
[algebraic-graphs] OK: context (const False) x == Nothing
1433.97 s
[algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
1433.97 s
[algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
1433.97 s
[algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
1433.97 s
[algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
1433.97 s
[algebraic-graphs] OK: Axioms of non-empty graphs
1433.97 s
[algebraic-graphs] OK: Theorems of non-empty graphs
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
1433.97 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1433.97 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1433.97 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1433.97 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1433.97 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1433.97 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1433.97 s
[algebraic-graphs] OK: x <= x + y
1433.97 s
[algebraic-graphs] OK: x + y <= x * y
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
1433.97 s
[algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
1433.97 s
[algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
1433.97 s
[algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
1433.97 s
[algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
1433.97 s
[algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
1433.97 s
[algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
1433.97 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
1433.97 s
[algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
1433.97 s
[algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
1433.97 s
[algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
1433.97 s
[algebraic-graphs] OK: toNonEmpty empty == Nothing
1433.97 s
[algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
1433.97 s
[algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
1433.97 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1433.97 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1433.97 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
1433.97 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1433.97 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1433.97 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1433.97 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1433.97 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
1433.97 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1433.97 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1433.97 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1433.97 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1433.97 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1433.97 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1433.97 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
1433.97 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1433.97 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1433.97 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1433.97 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1433.97 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1433.97 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1433.97 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1433.97 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1433.97 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
1433.97 s
[algebraic-graphs] OK: vertices1 [x] == vertex x
1433.97 s
[algebraic-graphs] OK: hasVertex x . vertices1 == elem x
1433.97 s
[algebraic-graphs] OK: vertexCount . vertices1 == length . nub
1433.97 s
[algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
1433.97 s
[algebraic-graphs]
1433.97 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
1433.97 s
[algebraic-graphs] OK: edges1 [(x,y)] == edge x y
1433.97 s
[algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
1433.97 s
[algebraic-graphs] OK: edgeCount . edges1 == length . nub
1433.97 s
[algebraic-graphs]
1436.91 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
1436.91 s
[algebraic-graphs] OK: overlays1 [x] == x
1436.91 s
[algebraic-graphs] OK: overlays1 [x,y] == overlay x y
1436.91 s
[algebraic-graphs]
1436.91 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
1436.91 s
[algebraic-graphs] OK: connects1 [x] == x
1436.91 s
[algebraic-graphs] OK: connects1 [x,y] == connect x y
1436.91 s
[algebraic-graphs]
1436.91 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
1436.91 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1436.91 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1436.91 s
[algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
1436.91 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1436.91 s
[algebraic-graphs]
1436.91 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
1436.91 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1436.91 s
[algebraic-graphs]
1436.91 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
1436.91 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1436.91 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1436.91 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1436.91 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1436.91 s
[algebraic-graphs]
1436.91 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
1436.91 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1436.91 s
[algebraic-graphs] OK: vertexCount x >= 1
1436.91 s
[algebraic-graphs] OK: vertexCount == length . vertexList1
1436.91 s
[algebraic-graphs]
1436.91 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
1436.91 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1436.91 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1436.91 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1436.91 s
[algebraic-graphs]
1436.91 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
1436.91 s
[algebraic-graphs] OK: vertexList1 (vertex x) == [x]
1436.91 s
[algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
1436.91 s
[algebraic-graphs]
1436.91 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
1436.91 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1436.91 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1436.91 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1436.92 s
[algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
1436.92 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
1436.92 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1436.92 s
[algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
1436.92 s
[algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
1436.92 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1436.92 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1436.92 s
[algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
1436.92 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1436.92 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1436.92 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
1436.92 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1436.92 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1436.92 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
1436.92 s
[algebraic-graphs] OK: path1 [x] == vertex x
1436.92 s
[algebraic-graphs] OK: path1 [x,y] == edge x y
1436.92 s
[algebraic-graphs] OK: path1 . reverse == transpose . path1
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
1436.92 s
[algebraic-graphs] OK: circuit1 [x] == edge x x
1436.92 s
[algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
1436.92 s
[algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
1436.92 s
[algebraic-graphs] OK: clique1 [x] == vertex x
1436.92 s
[algebraic-graphs] OK: clique1 [x,y] == edge x y
1436.92 s
[algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
1436.92 s
[algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
1436.92 s
[algebraic-graphs] OK: clique1 . reverse == transpose . clique1
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
1436.92 s
[algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1436.92 s
[algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
1436.92 s
[algebraic-graphs] OK: star x [] == vertex x
1436.92 s
[algebraic-graphs] OK: star x [y] == edge x y
1436.92 s
[algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
1436.92 s
[algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
1436.92 s
[algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
1436.92 s
[algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
1436.92 s
[algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
1436.92 s
[algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
1436.92 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1436.92 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
1436.92 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1436.92 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
1436.92 s
[algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
1436.92 s
[algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
1436.92 s
[algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
1436.92 s
[algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
1436.92 s
[algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
1436.92 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
1436.92 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1436.92 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1436.92 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
1436.92 s
[algebraic-graphs] OK: replaceVertex x x == id
1436.92 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1436.92 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
1436.92 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1436.92 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1436.92 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1436.92 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
1436.92 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1436.92 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1436.92 s
[algebraic-graphs] OK: transpose . transpose == id
1436.92 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
1436.92 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1436.92 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1436.92 s
[algebraic-graphs] OK: gmap id == id
1436.92 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
1436.92 s
[algebraic-graphs] OK: induce1 (const True ) x == Just x
1436.92 s
[algebraic-graphs] OK: induce1 (const False) x == Nothing
1436.92 s
[algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
1436.92 s
[algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
1436.92 s
[algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
1436.92 s
[algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
1436.92 s
[algebraic-graphs] OK: induceJust1 . gmap Just == Just
1436.92 s
[algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
1436.92 s
[algebraic-graphs] OK: closure (vertex x) == edge x x
1436.92 s
[algebraic-graphs] OK: closure (edge x x) == edge x x
1436.92 s
[algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
1436.92 s
[algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
1436.92 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1436.92 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1436.92 s
[algebraic-graphs] OK: closure . closure == closure
1436.92 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
1436.92 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
1436.92 s
[algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
1436.92 s
[algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
1436.92 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
1436.92 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1436.92 s
[algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
1436.92 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1436.92 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
1436.92 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1436.92 s
[algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
1436.92 s
[algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
1436.92 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ NonEmpty.Graph.============
1436.92 s
[algebraic-graphs] OK: Axioms of non-empty graphs
1436.92 s
[algebraic-graphs] OK: Theorems of non-empty graphs
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
1436.92 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1436.92 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1436.92 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1436.92 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1436.92 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1436.92 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1436.92 s
[algebraic-graphs] OK: x <= x + y
1436.92 s
[algebraic-graphs] OK: x + y <= x * y
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
1436.92 s
[algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
1436.92 s
[algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
1436.92 s
[algebraic-graphs] OK: fmap id == id
1436.92 s
[algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
1436.92 s
[algebraic-graphs]
1436.92 s
[algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
1436.92 s
[algebraic-graphs] OK: (vertex x >>= f) == f x
1438.33 s
[algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
1438.33 s
[algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
1438.33 s
[algebraic-graphs] OK: (x >>= vertex) == x
1438.33 s
[algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
1438.33 s
[algebraic-graphs] OK: toNonEmpty empty == Nothing
1438.33 s
[algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.vertex ============
1438.33 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1438.33 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1438.33 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1438.33 s
[algebraic-graphs] OK: size (vertex x) == 1
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.edge ============
1438.33 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1438.33 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1438.33 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1438.33 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1438.33 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.overlay ============
1438.33 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1438.33 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1438.33 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1438.33 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1438.33 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1438.33 s
[algebraic-graphs] OK: size (overlay x y) == size x + size y
1438.33 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1438.33 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
1438.33 s
[algebraic-graphs] OK: overlay1 empty x == x
1438.33 s
[algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.connect ============
1438.33 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1438.33 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1438.33 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1438.33 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1438.33 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1438.33 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1438.33 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1438.33 s
[algebraic-graphs] OK: size (connect x y) == size x + size y
1438.33 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1438.33 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
1438.33 s
[algebraic-graphs] OK: vertices1 [x] == vertex x
1438.33 s
[algebraic-graphs] OK: hasVertex x . vertices1 == elem x
1438.33 s
[algebraic-graphs] OK: vertexCount . vertices1 == length . nub
1438.33 s
[algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
1438.33 s
[algebraic-graphs] OK: edges1 [(x,y)] == edge x y
1438.33 s
[algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
1438.33 s
[algebraic-graphs] OK: edgeCount . edges1 == length . nub
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
1438.33 s
[algebraic-graphs] OK: overlays1 [x] == x
1438.33 s
[algebraic-graphs] OK: overlays1 [x,y] == overlay x y
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
1438.33 s
[algebraic-graphs] OK: connects1 [x] == x
1438.33 s
[algebraic-graphs] OK: connects1 [x,y] == connect x y
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
1438.33 s
[algebraic-graphs] OK: foldg1 vertex overlay connect == id
1438.33 s
[algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
1438.33 s
[algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
1438.33 s
[algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
1438.33 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1438.33 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1438.33 s
[algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
1438.33 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.(===) ============
1438.33 s
[algebraic-graphs] OK: x === x == True
1438.33 s
[algebraic-graphs] OK: x + y === x + y == True
1438.33 s
[algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
1438.33 s
[algebraic-graphs] OK: x + y === x * y == False
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.size ============
1438.33 s
[algebraic-graphs] OK: size (vertex x) == 1
1438.33 s
[algebraic-graphs] OK: size (overlay x y) == size x + size y
1438.33 s
[algebraic-graphs] OK: size (connect x y) == size x + size y
1438.33 s
[algebraic-graphs] OK: size x >= 1
1438.33 s
[algebraic-graphs] OK: size x >= vertexCount x
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
1438.33 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
1438.33 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1438.33 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1438.33 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1438.33 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
1438.33 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1438.33 s
[algebraic-graphs] OK: vertexCount x >= 1
1438.33 s
[algebraic-graphs] OK: vertexCount == length . vertexList1
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
1438.33 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1438.33 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1438.33 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
1438.33 s
[algebraic-graphs] OK: vertexList1 (vertex x) == [x]
1438.33 s
[algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
1438.33 s
[algebraic-graphs]
1438.33 s
[algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
1438.33 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1438.34 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1438.34 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1438.34 s
[algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
1438.34 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
1438.34 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1438.34 s
[algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
1438.34 s
[algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
1438.34 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1438.34 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1438.34 s
[algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.path1 ============
1438.34 s
[algebraic-graphs] OK: path1 [x] == vertex x
1438.34 s
[algebraic-graphs] OK: path1 [x,y] == edge x y
1438.34 s
[algebraic-graphs] OK: path1 . reverse == transpose . path1
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
1438.34 s
[algebraic-graphs] OK: circuit1 [x] == edge x x
1438.34 s
[algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
1438.34 s
[algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
1438.34 s
[algebraic-graphs] OK: clique1 [x] == vertex x
1438.34 s
[algebraic-graphs] OK: clique1 [x,y] == edge x y
1438.34 s
[algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
1438.34 s
[algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
1438.34 s
[algebraic-graphs] OK: clique1 . reverse == transpose . clique1
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
1438.34 s
[algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1438.34 s
[algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.star ============
1438.34 s
[algebraic-graphs] OK: star x [] == vertex x
1438.34 s
[algebraic-graphs] OK: star x [y] == edge x y
1438.34 s
[algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
1438.34 s
[algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
1438.34 s
[algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
1438.34 s
[algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
1438.34 s
[algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
1438.34 s
[algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.tree ============
1438.34 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1438.34 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
1438.34 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1438.34 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
1438.34 s
[algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
1438.34 s
[algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
1438.34 s
[algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
1438.34 s
[algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
1438.34 s
[algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
1438.34 s
[algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
1438.34 s
[algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
1438.34 s
[algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
1438.34 s
[algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
1438.34 s
[algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
1438.34 s
[algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
1438.34 s
[algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
1438.34 s
[algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
1438.34 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
1438.34 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1438.34 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1438.34 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1438.34 s
[algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
1438.34 s
[algebraic-graphs] OK: replaceVertex x x == id
1438.34 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1438.34 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1438.34 s
[algebraic-graphs]
1438.34 s
[algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
1438.34 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1444.10 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1444.10 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1444.11 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
1444.11 s
[algebraic-graphs] OK: splitVertex1 x [x] == id
1444.11 s
[algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
1444.11 s
[algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ NonEmpty.Graph.transpose ============
1444.11 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1444.11 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1444.11 s
[algebraic-graphs] OK: transpose . transpose == id
1444.11 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1444.11 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
1444.11 s
[algebraic-graphs] OK: induce1 (const True ) x == Just x
1444.11 s
[algebraic-graphs] OK: induce1 (const False) x == Nothing
1444.11 s
[algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
1444.11 s
[algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
1444.11 s
[algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
1444.11 s
[algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
1444.11 s
[algebraic-graphs] OK: induceJust1 . fmap Just == Just
1444.11 s
[algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ NonEmpty.Graph.simplify ============
1444.11 s
[algebraic-graphs] OK: simplify == id
1444.11 s
[algebraic-graphs] OK: size (simplify x) <= size x
1444.11 s
[algebraic-graphs] OK: simplify 1 === 1
1444.11 s
[algebraic-graphs] OK: simplify (1 + 1) === 1
1444.11 s
[algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
1444.11 s
[algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
1444.11 s
[algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
1444.11 s
[algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
1444.11 s
[algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
1444.11 s
[algebraic-graphs] OK: size (sparsify x) <= 3 * size x
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
1444.11 s
[algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
1444.11 s
[algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
1444.11 s
[algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ NonEmpty.Graph.box ============
1444.11 s
[algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
1444.11 s
[algebraic-graphs] OK: box x y ~~ box y x
1444.11 s
[algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
1444.11 s
[algebraic-graphs] OK: box x (vertex ()) ~~ x
1444.11 s
[algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
1444.11 s
[algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
1444.11 s
[algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
1444.11 s
[algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ Relation ============
1444.11 s
[algebraic-graphs] OK: Axioms of graphs
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ Relation.consistent ============
1444.11 s
[algebraic-graphs] OK: Consistency of the Arbitrary instance
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] OK: consistent empty == True
1444.11 s
[algebraic-graphs] OK: consistent (vertex x) == True
1444.11 s
[algebraic-graphs] OK: consistent (overlay x y) == True
1444.11 s
[algebraic-graphs] OK: consistent (connect x y) == True
1444.11 s
[algebraic-graphs] OK: consistent (edge x y) == True
1444.11 s
[algebraic-graphs] OK: consistent (edges xs) == True
1444.11 s
[algebraic-graphs] OK: consistent (stars xs) == True
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ Relation.Show ============
1444.11 s
[algebraic-graphs] OK: show (empty ) == "empty"
1444.11 s
[algebraic-graphs] OK: show (1 ) == "vertex 1"
1444.11 s
[algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
1444.11 s
[algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
1444.11 s
[algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
1444.11 s
[algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
1444.11 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
1444.11 s
[algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
1444.11 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
1444.11 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ Relation.Ord ============
1444.11 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1444.11 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1444.11 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1444.11 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1444.11 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1444.11 s
[algebraic-graphs] OK: edge 1 2 < edge 1 3
1444.11 s
[algebraic-graphs] OK: x <= x + y
1444.11 s
[algebraic-graphs] OK: x + y <= x * y
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ Relation.empty ============
1444.11 s
[algebraic-graphs] OK: isEmpty empty == True
1444.11 s
[algebraic-graphs] OK: hasVertex x empty == False
1444.11 s
[algebraic-graphs] OK: vertexCount empty == 0
1444.11 s
[algebraic-graphs] OK: edgeCount empty == 0
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ Relation.vertex ============
1444.11 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1444.11 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1444.11 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1444.11 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ Relation.edge ============
1444.11 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1444.11 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1444.11 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1444.11 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1444.11 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1444.11 s
[algebraic-graphs]
1444.11 s
[algebraic-graphs] ============ Relation.overlay ============
1444.11 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1444.12 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1444.12 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1444.12 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1444.12 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1444.12 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1444.12 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1444.12 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1444.12 s
[algebraic-graphs]
1444.12 s
[algebraic-graphs] ============ Relation.connect ============
1444.12 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1444.12 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1444.12 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1444.12 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1444.12 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1444.12 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1444.12 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
1444.12 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1444.12 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1444.12 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1444.12 s
[algebraic-graphs]
1444.12 s
[algebraic-graphs] ============ Relation.vertices ============
1444.12 s
[algebraic-graphs] OK: vertices [] == empty
1444.12 s
[algebraic-graphs] OK: vertices [x] == vertex x
1444.12 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1444.12 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1444.12 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1444.12 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1444.12 s
[algebraic-graphs]
1444.12 s
[algebraic-graphs] ============ Relation.edges ============
1444.12 s
[algebraic-graphs] OK: edges [] == empty
1444.12 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1444.12 s
[algebraic-graphs] OK: edges == overlays . map (uncurry edge)
1444.12 s
[algebraic-graphs] OK: edgeCount . edges == length . nub
1444.12 s
[algebraic-graphs]
1444.12 s
[algebraic-graphs] ============ Relation.overlays ============
1444.12 s
[algebraic-graphs] OK: overlays [] == empty
1444.12 s
[algebraic-graphs] OK: overlays [x] == x
1444.12 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1444.12 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1444.12 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1444.12 s
[algebraic-graphs]
1444.12 s
[algebraic-graphs] ============ Relation.connects ============
1444.12 s
[algebraic-graphs] OK: connects [] == empty
1444.12 s
[algebraic-graphs] OK: connects [x] == x
1444.12 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1444.12 s
[algebraic-graphs] OK: connects == foldr connect empty
1444.12 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1444.12 s
[algebraic-graphs]
1444.12 s
[algebraic-graphs] ============ Relation.isSubgraphOf ============
1444.12 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1444.12 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1444.12 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1444.12 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1444.12 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1444.12 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1444.12 s
[algebraic-graphs]
1444.12 s
[algebraic-graphs] ============ Relation.toGraph et al. ============
1444.12 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1444.12 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1444.12 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1444.12 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1444.12 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1444.12 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1444.12 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1444.12 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1444.12 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1444.12 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1444.12 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1444.12 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1444.12 s
[algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
1444.12 s
[algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
1444.12 s
[algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
1444.12 s
[algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
1444.12 s
[algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
1447.13 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1447.13 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1447.13 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1447.13 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1447.13 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1447.13 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1447.13 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1447.13 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1447.13 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1447.13 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1447.13 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1447.13 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1447.13 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1447.13 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1447.13 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1447.13 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1447.13 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1447.13 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.foldg ============
1447.13 s
[algebraic-graphs] OK: foldg empty vertex overlay connect == id
1447.13 s
[algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
1447.13 s
[algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
1447.13 s
[algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.isEmpty ============
1447.13 s
[algebraic-graphs] OK: isEmpty empty == True
1447.13 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1447.13 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1447.13 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1447.13 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.hasVertex ============
1447.13 s
[algebraic-graphs] OK: hasVertex x empty == False
1447.13 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1447.13 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.hasEdge ============
1447.13 s
[algebraic-graphs] OK: hasEdge x y empty == False
1447.13 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1447.13 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1447.13 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1447.13 s
[algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.vertexCount ============
1447.13 s
[algebraic-graphs] OK: vertexCount empty == 0
1447.13 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1447.13 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1447.13 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.edgeCount ============
1447.13 s
[algebraic-graphs] OK: edgeCount empty == 0
1447.13 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1447.13 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1447.13 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.vertexList ============
1447.13 s
[algebraic-graphs] OK: vertexList empty == []
1447.13 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1447.13 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.vertexSet ============
1447.13 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1447.13 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1447.13 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.vertexIntSet ============
1447.13 s
[algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
1447.13 s
[algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
1447.13 s
[algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
1447.13 s
[algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.edgeList ============
1447.13 s
[algebraic-graphs] OK: edgeList empty == []
1447.13 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1447.13 s
[algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
1447.13 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
1447.13 s
[algebraic-graphs] OK: edgeList . edges == nub . sort
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.edgeSet ============
1447.13 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1447.13 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1447.13 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
1447.13 s
[algebraic-graphs] OK: edgeSet . edges == Set.fromList
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.adjacencyList ============
1447.13 s
[algebraic-graphs] OK: adjacencyList empty == []
1447.13 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1447.13 s
[algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
1447.13 s
[algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.preSet ============
1447.13 s
[algebraic-graphs] OK: preSet x empty == Set.empty
1447.13 s
[algebraic-graphs] OK: preSet x (vertex x) == Set.empty
1447.13 s
[algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
1447.13 s
[algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.preIntSet ============
1447.13 s
[algebraic-graphs] OK: preIntSet x empty == IntSet.empty
1447.13 s
[algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
1447.13 s
[algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
1447.13 s
[algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.postSet ============
1447.13 s
[algebraic-graphs] OK: postSet x empty == Set.empty
1447.13 s
[algebraic-graphs] OK: postSet x (vertex x) == Set.empty
1447.13 s
[algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
1447.13 s
[algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.postIntSet ============
1447.13 s
[algebraic-graphs] OK: postIntSet x empty == IntSet.empty
1447.13 s
[algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
1447.13 s
[algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
1447.13 s
[algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.path ============
1447.13 s
[algebraic-graphs] OK: path [] == empty
1447.13 s
[algebraic-graphs] OK: path [x] == vertex x
1447.13 s
[algebraic-graphs] OK: path [x,y] == edge x y
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.circuit ============
1447.13 s
[algebraic-graphs] OK: circuit [] == empty
1447.13 s
[algebraic-graphs] OK: circuit [x] == edge x x
1447.13 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.clique ============
1447.13 s
[algebraic-graphs] OK: clique [] == empty
1447.13 s
[algebraic-graphs] OK: clique [x] == vertex x
1447.13 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1447.13 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1447.13 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.biclique ============
1447.13 s
[algebraic-graphs] OK: biclique [] [] == empty
1447.13 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1447.13 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1447.13 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1447.13 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.star ============
1447.13 s
[algebraic-graphs] OK: star x [] == vertex x
1447.13 s
[algebraic-graphs] OK: star x [y] == edge x y
1447.13 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1447.13 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.stars ============
1447.13 s
[algebraic-graphs] OK: stars [] == empty
1447.13 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1447.13 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1447.13 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1447.13 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1447.13 s
[algebraic-graphs] OK: stars . adjacencyList == id
1447.13 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.tree ============
1447.13 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1447.13 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1447.13 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1447.13 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.forest ============
1447.13 s
[algebraic-graphs] OK: forest [] == empty
1447.13 s
[algebraic-graphs] OK: forest [x] == tree x
1447.13 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1447.13 s
[algebraic-graphs] OK: forest == overlays . map tree
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.removeVertex ============
1447.13 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1447.13 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1447.13 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1447.13 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1447.13 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.removeEdge ============
1447.13 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1447.13 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1447.13 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1447.13 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1447.13 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.replaceVertex ============
1447.13 s
[algebraic-graphs] OK: replaceVertex x x == id
1447.13 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1447.13 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1447.13 s
[algebraic-graphs]
1447.13 s
[algebraic-graphs] ============ Relation.mergeVertices ============
1447.13 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1466.34 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1466.34 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1466.36 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Relation.transpose ============
1466.36 s
[algebraic-graphs] OK: transpose empty == empty
1466.36 s
[algebraic-graphs] OK: transpose (vertex x) == vertex x
1466.36 s
[algebraic-graphs] OK: transpose (edge x y) == edge y x
1466.36 s
[algebraic-graphs] OK: transpose . transpose == id
1466.36 s
[algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Relation.gmap ============
1466.36 s
[algebraic-graphs] OK: gmap f empty == empty
1466.36 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1466.36 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1466.36 s
[algebraic-graphs] OK: gmap id == id
1466.36 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Relation.induce ============
1466.36 s
[algebraic-graphs] OK: induce (const True ) x == x
1466.36 s
[algebraic-graphs] OK: induce (const False) x == empty
1466.36 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1466.36 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1466.36 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Relation.compose ============
1466.36 s
[algebraic-graphs] OK: compose empty x == empty
1466.36 s
[algebraic-graphs] OK: compose x empty == empty
1466.36 s
[algebraic-graphs] OK: compose (vertex x) y == empty
1466.36 s
[algebraic-graphs] OK: compose x (vertex y) == empty
1466.36 s
[algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
1466.36 s
[algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
1466.36 s
[algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
1466.36 s
[algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
1466.36 s
[algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
1466.36 s
[algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Relation.closure ============
1466.36 s
[algebraic-graphs] OK: closure empty == empty
1466.36 s
[algebraic-graphs] OK: closure (vertex x) == edge x x
1466.36 s
[algebraic-graphs] OK: closure (edge x x) == edge x x
1466.36 s
[algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
1466.36 s
[algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
1466.36 s
[algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
1466.36 s
[algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
1466.36 s
[algebraic-graphs] OK: closure . closure == closure
1466.36 s
[algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Relation.reflexiveClosure ============
1466.36 s
[algebraic-graphs] OK: reflexiveClosure empty == empty
1466.36 s
[algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
1466.36 s
[algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
1466.36 s
[algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
1466.36 s
[algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Relation.symmetricClosure ============
1466.36 s
[algebraic-graphs] OK: symmetricClosure empty == empty
1466.36 s
[algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
1466.36 s
[algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
1466.36 s
[algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
1466.36 s
[algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Relation.transitiveClosure ============
1466.36 s
[algebraic-graphs] OK: transitiveClosure empty == empty
1466.36 s
[algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
1466.36 s
[algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
1466.36 s
[algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
1466.36 s
[algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Relation.induceJust ============
1466.36 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1466.36 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1466.36 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1466.36 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ ReflexiveRelation ============
1466.36 s
[algebraic-graphs] OK: Axioms of reflexive graphs
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ TransitiveRelation ============
1466.36 s
[algebraic-graphs] OK: Axioms of transitive graphs
1466.36 s
[algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ PreorderRelation ============
1466.36 s
[algebraic-graphs] OK: Axioms of preorder graphs
1466.36 s
[algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Symmetric.Relation ============
1466.36 s
[algebraic-graphs] OK: Axioms of undirected graphs
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Symmetric.Relation.consistent ============
1466.36 s
[algebraic-graphs] OK: Consistency of the Arbitrary instance
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] OK: consistent empty == True
1466.36 s
[algebraic-graphs] OK: consistent (vertex x) == True
1466.36 s
[algebraic-graphs] OK: consistent (overlay x y) == True
1466.36 s
[algebraic-graphs] OK: consistent (connect x y) == True
1466.36 s
[algebraic-graphs] OK: consistent (edge x y) == True
1466.36 s
[algebraic-graphs] OK: consistent (edges xs) == True
1466.36 s
[algebraic-graphs] OK: consistent (stars xs) == True
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Symmetric.Relation.Show ============
1466.36 s
[algebraic-graphs] OK: show (empty ) == "empty"
1466.36 s
[algebraic-graphs] OK: show (1 ) == "vertex 1"
1466.36 s
[algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
1466.36 s
[algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
1466.36 s
[algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
1466.36 s
[algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
1466.36 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
1466.36 s
[algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
1466.36 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
1466.36 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
1466.36 s
[algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
1466.36 s
[algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
1466.36 s
[algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
1466.36 s
[algebraic-graphs] OK: toSymmetric . fromSymmetric == id
1466.36 s
[algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
1466.36 s
[algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
1466.36 s
[algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
1466.36 s
[algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
1466.36 s
[algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
1466.36 s
[algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Symmetric.Relation.Ord ============
1466.36 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1466.36 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1466.36 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1466.36 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1466.36 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1466.36 s
[algebraic-graphs] OK: edge 2 1 < edge 1 3
1466.36 s
[algebraic-graphs] OK: edge 1 2 == edge 2 1
1466.36 s
[algebraic-graphs] OK: x <= x + y
1466.36 s
[algebraic-graphs] OK: x + y <= x * y
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Symmetric.Relation.empty ============
1466.36 s
[algebraic-graphs] OK: isEmpty empty == True
1466.36 s
[algebraic-graphs] OK: hasVertex x empty == False
1466.36 s
[algebraic-graphs] OK: vertexCount empty == 0
1466.36 s
[algebraic-graphs] OK: edgeCount empty == 0
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Symmetric.Relation.vertex ============
1466.36 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1466.36 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1466.36 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1466.36 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Symmetric.Relation.edge ============
1466.36 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1466.36 s
[algebraic-graphs] OK: edge x y == edge y x
1466.36 s
[algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
1466.36 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1466.36 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1466.36 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1466.36 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Symmetric.Relation.overlay ============
1466.36 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1466.36 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1466.36 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1466.36 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1466.36 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1466.36 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1466.36 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1466.36 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Symmetric.Relation.connect ============
1466.36 s
[algebraic-graphs] OK: connect x y == connect y x
1466.36 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1466.36 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1466.36 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1466.36 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1466.36 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1466.36 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1466.36 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
1466.36 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1466.36 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1466.36 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Symmetric.Relation.vertices ============
1466.36 s
[algebraic-graphs] OK: vertices [] == empty
1466.36 s
[algebraic-graphs] OK: vertices [x] == vertex x
1466.36 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1466.36 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1466.36 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1466.36 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Symmetric.Relation.edges ============
1466.36 s
[algebraic-graphs] OK: edges [] == empty
1466.36 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1466.36 s
[algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
1466.36 s
[algebraic-graphs]
1466.36 s
[algebraic-graphs] ============ Symmetric.Relation.overlays ============
1466.36 s
[algebraic-graphs] OK: overlays [] == empty
1477.33 s
[algebraic-graphs] OK: overlays [x] == x
1477.34 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1477.34 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1477.34 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.connects ============
1477.34 s
[algebraic-graphs] OK: connects [] == empty
1477.34 s
[algebraic-graphs] OK: connects [x] == x
1477.34 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1477.34 s
[algebraic-graphs] OK: connects == foldr connect empty
1477.34 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1477.34 s
[algebraic-graphs] OK: connects == connects . reverse
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
1477.34 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1477.34 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1477.34 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1477.34 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1477.34 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1477.34 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1477.34 s
[algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
1477.34 s
[algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
1477.34 s
[algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
1477.34 s
[algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
1477.34 s
[algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
1477.34 s
[algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
1477.34 s
[algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
1477.34 s
[algebraic-graphs] OK: vertexCount == Set.size . vertexSet
1477.34 s
[algebraic-graphs] OK: edgeCount == Set.size . edgeSet
1477.34 s
[algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
1477.34 s
[algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
1477.34 s
[algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
1477.34 s
[algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
1477.34 s
[algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
1477.34 s
[algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
1477.34 s
[algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
1477.34 s
[algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
1477.34 s
[algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
1477.34 s
[algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
1477.34 s
[algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
1477.34 s
[algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
1477.34 s
[algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
1477.34 s
[algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
1477.34 s
[algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
1477.34 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1477.34 s
[algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
1477.34 s
[algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
1477.34 s
[algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
1477.34 s
[algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
1477.34 s
[algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
1477.34 s
[algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
1477.34 s
[algebraic-graphs] OK: isEmpty empty == True
1477.34 s
[algebraic-graphs] OK: isEmpty (overlay empty empty) == True
1477.34 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1477.34 s
[algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
1477.34 s
[algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
1477.34 s
[algebraic-graphs] OK: hasVertex x empty == False
1477.34 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1477.34 s
[algebraic-graphs] OK: hasVertex x . removeVertex x == const False
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
1477.34 s
[algebraic-graphs] OK: hasEdge x y empty == False
1477.34 s
[algebraic-graphs] OK: hasEdge x y (vertex z) == False
1477.34 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1477.34 s
[algebraic-graphs] OK: hasEdge x y (edge y x) == True
1477.34 s
[algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
1477.34 s
[algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
1477.34 s
[algebraic-graphs] OK: vertexCount empty == 0
1477.34 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1477.34 s
[algebraic-graphs] OK: vertexCount == length . vertexList
1477.34 s
[algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
1477.34 s
[algebraic-graphs] OK: edgeCount empty == 0
1477.34 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1477.34 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1477.34 s
[algebraic-graphs] OK: edgeCount == length . edgeList
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.vertexList ============
1477.34 s
[algebraic-graphs] OK: vertexList empty == []
1477.34 s
[algebraic-graphs] OK: vertexList (vertex x) == [x]
1477.34 s
[algebraic-graphs] OK: vertexList . vertices == nub . sort
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
1477.34 s
[algebraic-graphs] OK: vertexSet empty == Set.empty
1477.34 s
[algebraic-graphs] OK: vertexSet . vertex == Set.singleton
1477.34 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
1477.34 s
[algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
1477.34 s
[algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
1477.34 s
[algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
1477.34 s
[algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.edgeList ============
1477.34 s
[algebraic-graphs] OK: edgeList empty == []
1477.34 s
[algebraic-graphs] OK: edgeList (vertex x) == []
1477.34 s
[algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
1477.34 s
[algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
1477.34 s
[algebraic-graphs] OK: edgeSet empty == Set.empty
1477.34 s
[algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
1477.34 s
[algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
1477.34 s
[algebraic-graphs] OK: adjacencyList empty == []
1477.34 s
[algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
1477.34 s
[algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
1477.34 s
[algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.neighbours ============
1477.34 s
[algebraic-graphs] OK: neighbours x empty == Set.empty
1477.34 s
[algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
1477.34 s
[algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
1477.34 s
[algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.path ============
1477.34 s
[algebraic-graphs] OK: path [] == empty
1477.34 s
[algebraic-graphs] OK: path [x] == vertex x
1477.34 s
[algebraic-graphs] OK: path [x,y] == edge x y
1477.34 s
[algebraic-graphs] OK: path == path . reverse
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.circuit ============
1477.34 s
[algebraic-graphs] OK: circuit [] == empty
1477.34 s
[algebraic-graphs] OK: circuit [x] == edge x x
1477.34 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1477.34 s
[algebraic-graphs] OK: circuit == circuit . reverse
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.clique ============
1477.34 s
[algebraic-graphs] OK: clique [] == empty
1477.34 s
[algebraic-graphs] OK: clique [x] == vertex x
1477.34 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1477.34 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1477.34 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1477.34 s
[algebraic-graphs] OK: clique == clique . reverse
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.biclique ============
1477.34 s
[algebraic-graphs] OK: biclique [] [] == empty
1477.34 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1477.34 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1477.34 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1477.34 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.star ============
1477.34 s
[algebraic-graphs] OK: star x [] == vertex x
1477.34 s
[algebraic-graphs] OK: star x [y] == edge x y
1477.34 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1477.34 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.stars ============
1477.34 s
[algebraic-graphs] OK: stars [] == empty
1477.34 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1477.34 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1477.34 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1477.34 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1477.34 s
[algebraic-graphs] OK: stars . adjacencyList == id
1477.34 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.tree ============
1477.34 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1477.34 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1477.34 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1477.34 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1477.34 s
[algebraic-graphs]
1477.34 s
[algebraic-graphs] ============ Symmetric.Relation.forest ============
1477.34 s
[algebraic-graphs] OK: forest [] == empty
1483.70 s
[algebraic-graphs] OK: forest [x] == tree x
1483.70 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1483.71 s
[algebraic-graphs] OK: forest == overlays . map tree
1483.71 s
[algebraic-graphs]
1483.71 s
[algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
1483.71 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1483.71 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1483.71 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1483.71 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1483.71 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1483.71 s
[algebraic-graphs]
1483.71 s
[algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
1483.71 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1483.71 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1483.71 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1483.71 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1483.71 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1483.71 s
[algebraic-graphs] OK: removeEdge x y == removeEdge y x
1483.71 s
[algebraic-graphs]
1483.71 s
[algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
1483.71 s
[algebraic-graphs] OK: replaceVertex x x == id
1483.71 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1483.71 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1483.71 s
[algebraic-graphs]
1483.71 s
[algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
1483.71 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1483.71 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1483.71 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1483.71 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1483.71 s
[algebraic-graphs]
1483.71 s
[algebraic-graphs] ============ Symmetric.Relation.gmap ============
1483.71 s
[algebraic-graphs] OK: gmap f empty == empty
1483.71 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1483.71 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1483.71 s
[algebraic-graphs] OK: gmap id == id
1483.71 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1483.71 s
[algebraic-graphs]
1483.71 s
[algebraic-graphs] ============ Symmetric.Relation.induce ============
1483.71 s
[algebraic-graphs] OK: induce (const True ) x == x
1483.71 s
[algebraic-graphs] OK: induce (const False) x == empty
1483.71 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1483.71 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1483.71 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1483.71 s
[algebraic-graphs]
1483.71 s
[algebraic-graphs] ============ Symmetric.Relation.induceJust ============
1483.71 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1483.71 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1483.71 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1483.71 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1483.71 s
[algebraic-graphs]
1483.71 s
[algebraic-graphs] ============ Example.Todo (Holiday) ============
1483.71 s
[algebraic-graphs] OK: A todo list is semantically Maybe [a]
1483.71 s
[algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
1483.71 s
[algebraic-graphs] OK: The connect operator (*) adds dependency between items
1483.71 s
[algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
1483.71 s
[algebraic-graphs] OK: Introduce item priority to schedule the todo list
1483.71 s
[algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Example.Todo (Commandline) ============
1483.72 s
[algebraic-graphs] OK: The pull connect operator maintains command line semantics
1483.72 s
[algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
1483.72 s
[algebraic-graphs] OK: The usual connect operator breaks semantics
1483.72 s
[algebraic-graphs] OK: Transform command lines by adding optimisation flag
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Typed ============
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Typed.fromAdjacencyMap ============
1483.72 s
[algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
1483.72 s
[algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
1483.72 s
[algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
1483.72 s
[algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
1483.72 s
[algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
1483.72 s
[algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
1483.72 s
[algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
1483.72 s
[algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Typed.dfsForest ============
1483.72 s
[algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
1483.72 s
[algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
1483.72 s
[algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
1483.72 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
1483.72 s
[algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
1483.72 s
[algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
1483.72 s
[algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Typed.dfsForestFrom ============
1483.72 s
[algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
1483.72 s
[algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
1483.72 s
[algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
1483.72 s
[algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
1483.72 s
[algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
1483.72 s
[algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
1483.72 s
[algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
1483.72 s
[algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
1483.72 s
[algebraic-graphs] OK: dfsForestFrom % x $ [] == []
1483.72 s
[algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Typed.dfs ============
1483.72 s
[algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
1483.72 s
[algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
1483.72 s
[algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
1483.72 s
[algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
1483.72 s
[algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
1483.72 s
[algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
1483.72 s
[algebraic-graphs] OK: dfs % x $ [] == []
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
1483.72 s
[algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Typed.topSort ============
1483.72 s
[algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
1483.72 s
[algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Graph.Undirected ============
1483.72 s
[algebraic-graphs] OK: Axioms of undirected graphs
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Graph.Undirected.Show ============
1483.72 s
[algebraic-graphs] OK: show (empty ) == "empty"
1483.72 s
[algebraic-graphs] OK: show (1 ) == "vertex 1"
1483.72 s
[algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
1483.72 s
[algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
1483.72 s
[algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
1483.72 s
[algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
1483.72 s
[algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
1483.72 s
[algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
1483.72 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
1483.72 s
[algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
1483.72 s
[algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
1483.72 s
[algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Graph.Undirected.toUndirected ============
1483.72 s
[algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
1483.72 s
[algebraic-graphs] OK: toUndirected . fromUndirected == id
1483.72 s
[algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
1483.72 s
[algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
1483.72 s
[algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
1483.72 s
[algebraic-graphs] OK: toUndirected . fromUndirected == id
1483.72 s
[algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
1483.72 s
[algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Graph.Undirected.complement ================
1483.72 s
[algebraic-graphs] OK: complement empty == empty
1483.72 s
[algebraic-graphs] OK: complement (vertex x) == vertex x
1483.72 s
[algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
1483.72 s
[algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
1483.72 s
[algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
1483.72 s
[algebraic-graphs] OK: complement . complement == id
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Graph.Undirected.Ord ============
1483.72 s
[algebraic-graphs] OK: vertex 1 < vertex 2
1483.72 s
[algebraic-graphs] OK: vertex 3 < edge 1 2
1483.72 s
[algebraic-graphs] OK: vertex 1 < edge 1 1
1483.72 s
[algebraic-graphs] OK: edge 1 1 < edge 1 2
1483.72 s
[algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
1483.72 s
[algebraic-graphs] OK: edge 2 1 < edge 1 3
1483.72 s
[algebraic-graphs] OK: edge 1 2 == edge 2 1
1483.72 s
[algebraic-graphs] OK: x <= x + y
1483.72 s
[algebraic-graphs] OK: x + y <= x * y
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Graph.Undirected.empty ============
1483.72 s
[algebraic-graphs] OK: isEmpty empty == True
1483.72 s
[algebraic-graphs] OK: hasVertex x empty == False
1483.72 s
[algebraic-graphs] OK: vertexCount empty == 0
1483.72 s
[algebraic-graphs] OK: edgeCount empty == 0
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Graph.Undirected.vertex ============
1483.72 s
[algebraic-graphs] OK: isEmpty (vertex x) == False
1483.72 s
[algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
1483.72 s
[algebraic-graphs] OK: vertexCount (vertex x) == 1
1483.72 s
[algebraic-graphs] OK: edgeCount (vertex x) == 0
1483.72 s
[algebraic-graphs]
1483.72 s
[algebraic-graphs] ============ Graph.Undirected.edge ============
1483.72 s
[algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
1483.72 s
[algebraic-graphs] OK: edge x y == edge y x
1491.52 s
[algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
1491.52 s
[algebraic-graphs] OK: hasEdge x y (edge x y) == True
1491.52 s
[algebraic-graphs] OK: edgeCount (edge x y) == 1
1491.53 s
[algebraic-graphs] OK: vertexCount (edge 1 1) == 1
1491.53 s
[algebraic-graphs] OK: vertexCount (edge 1 2) == 2
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.overlay ============
1491.53 s
[algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
1491.53 s
[algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
1491.53 s
[algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
1491.53 s
[algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
1491.53 s
[algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
1491.53 s
[algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
1491.53 s
[algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
1491.53 s
[algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.connect ============
1491.53 s
[algebraic-graphs] OK: connect x y == connect y x
1491.53 s
[algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
1491.53 s
[algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
1491.53 s
[algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
1491.53 s
[algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
1491.53 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
1491.53 s
[algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
1491.53 s
[algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
1491.53 s
[algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
1491.53 s
[algebraic-graphs] OK: vertexCount (connect 1 2) == 2
1491.53 s
[algebraic-graphs] OK: edgeCount (connect 1 2) == 1
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.vertices ============
1491.53 s
[algebraic-graphs] OK: vertices [] == empty
1491.53 s
[algebraic-graphs] OK: vertices [x] == vertex x
1491.53 s
[algebraic-graphs] OK: vertices == overlays . map vertex
1491.53 s
[algebraic-graphs] OK: hasVertex x . vertices == elem x
1491.53 s
[algebraic-graphs] OK: vertexCount . vertices == length . nub
1491.53 s
[algebraic-graphs] OK: vertexSet . vertices == Set.fromList
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.edges ============
1491.53 s
[algebraic-graphs] OK: edges [] == empty
1491.53 s
[algebraic-graphs] OK: edges [(x,y)] == edge x y
1491.53 s
[algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.overlays ============
1491.53 s
[algebraic-graphs] OK: overlays [] == empty
1491.53 s
[algebraic-graphs] OK: overlays [x] == x
1491.53 s
[algebraic-graphs] OK: overlays [x,y] == overlay x y
1491.53 s
[algebraic-graphs] OK: overlays == foldr overlay empty
1491.53 s
[algebraic-graphs] OK: isEmpty . overlays == all isEmpty
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.connects ============
1491.53 s
[algebraic-graphs] OK: connects [] == empty
1491.53 s
[algebraic-graphs] OK: connects [x] == x
1491.53 s
[algebraic-graphs] OK: connects [x,y] == connect x y
1491.53 s
[algebraic-graphs] OK: connects == foldr connect empty
1491.53 s
[algebraic-graphs] OK: isEmpty . connects == all isEmpty
1491.53 s
[algebraic-graphs] OK: connects == connects . reverse
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
1491.53 s
[algebraic-graphs] OK: isSubgraphOf empty x == True
1491.53 s
[algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
1491.53 s
[algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
1491.53 s
[algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
1491.53 s
[algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
1491.53 s
[algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
1491.53 s
[algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.path ============
1491.53 s
[algebraic-graphs] OK: path [] == empty
1491.53 s
[algebraic-graphs] OK: path [x] == vertex x
1491.53 s
[algebraic-graphs] OK: path [x,y] == edge x y
1491.53 s
[algebraic-graphs] OK: path == path . reverse
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.circuit ============
1491.53 s
[algebraic-graphs] OK: circuit [] == empty
1491.53 s
[algebraic-graphs] OK: circuit [x] == edge x x
1491.53 s
[algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
1491.53 s
[algebraic-graphs] OK: circuit == circuit . reverse
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.clique ============
1491.53 s
[algebraic-graphs] OK: clique [] == empty
1491.53 s
[algebraic-graphs] OK: clique [x] == vertex x
1491.53 s
[algebraic-graphs] OK: clique [x,y] == edge x y
1491.53 s
[algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
1491.53 s
[algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
1491.53 s
[algebraic-graphs] OK: clique == clique . reverse
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.biclique ============
1491.53 s
[algebraic-graphs] OK: biclique [] [] == empty
1491.53 s
[algebraic-graphs] OK: biclique [x] [] == vertex x
1491.53 s
[algebraic-graphs] OK: biclique [] [y] == vertex y
1491.53 s
[algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
1491.53 s
[algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.star ============
1491.53 s
[algebraic-graphs] OK: star x [] == vertex x
1491.53 s
[algebraic-graphs] OK: star x [y] == edge x y
1491.53 s
[algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
1491.53 s
[algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.stars ============
1491.53 s
[algebraic-graphs] OK: stars [] == empty
1491.53 s
[algebraic-graphs] OK: stars [(x, [])] == vertex x
1491.53 s
[algebraic-graphs] OK: stars [(x, [y])] == edge x y
1491.53 s
[algebraic-graphs] OK: stars [(x, ys)] == star x ys
1491.53 s
[algebraic-graphs] OK: stars == overlays . map (uncurry star)
1491.53 s
[algebraic-graphs] OK: stars . adjacencyList == id
1491.53 s
[algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.tree ============
1491.53 s
[algebraic-graphs] OK: tree (Node x []) == vertex x
1491.53 s
[algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
1491.53 s
[algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
1491.53 s
[algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.forest ============
1491.53 s
[algebraic-graphs] OK: forest [] == empty
1491.53 s
[algebraic-graphs] OK: forest [x] == tree x
1491.53 s
[algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
1491.53 s
[algebraic-graphs] OK: forest == overlays . map tree
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.removeVertex ============
1491.53 s
[algebraic-graphs] OK: removeVertex x (vertex x) == empty
1491.53 s
[algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
1491.53 s
[algebraic-graphs] OK: removeVertex x (edge x x) == empty
1491.53 s
[algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
1491.53 s
[algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.removeEdge ============
1491.53 s
[algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
1491.53 s
[algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
1491.53 s
[algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
1491.53 s
[algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
1491.53 s
[algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
1491.53 s
[algebraic-graphs] OK: removeEdge x y == removeEdge y x
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
1491.53 s
[algebraic-graphs] OK: replaceVertex x x == id
1491.53 s
[algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
1491.53 s
[algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
1491.53 s
[algebraic-graphs] OK: mergeVertices (const False) x == id
1491.53 s
[algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
1491.53 s
[algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
1491.53 s
[algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.gmap ============
1491.53 s
[algebraic-graphs] OK: gmap f empty == empty
1491.53 s
[algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
1491.53 s
[algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
1491.53 s
[algebraic-graphs] OK: gmap id == id
1491.53 s
[algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.induce ============
1491.53 s
[algebraic-graphs] OK: induce (const True ) x == x
1491.53 s
[algebraic-graphs] OK: induce (const False) x == empty
1491.53 s
[algebraic-graphs] OK: induce (/= x) == removeVertex x
1491.53 s
[algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
1491.53 s
[algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
1491.53 s
[algebraic-graphs]
1491.53 s
[algebraic-graphs] ============ Graph.Undirected.induceJust ============
1491.53 s
[algebraic-graphs] OK: induceJust (vertex Nothing) == empty
1491.54 s
[algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
1491.54 s
[algebraic-graphs] OK: induceJust . gmap Just == id
1491.54 s
[algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
1491.54 s
[algebraic-graphs] Test suite main: PASS
1491.54 s
[algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
1491.54 s
[algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
1491.54 s
[algebraic-graphs] checkPhase completed in 1 minutes 45 seconds
1491.54 s
[algebraic-graphs] Phase: haddockPhase
1491.63 s
[algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
1491.64 s
[algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
1491.67 s
[algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
1491.77 s
[algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
1492.02 s
[algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
1492.07 s
[algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
1492.10 s
[algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
1492.13 s
[algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
1492.31 s
[algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
1492.34 s
[algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
1492.47 s
[algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
1492.53 s
[algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
1492.77 s
[algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
1492.82 s
[algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
1492.89 s
[algebraic-graphs]
1492.89 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning : [ GHC-63394 ] [ -Wx-partial ]
1492.89 s
[algebraic-graphs] In the use of ‘head’
1492.89 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1492.89 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."
1492.89 s
[algebraic-graphs] |
1492.89 s
[algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
1492.89 s
[algebraic-graphs] | ^^^^
1492.89 s
[algebraic-graphs]
1492.89 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1492.89 s
[algebraic-graphs] In the use of ‘tail’
1492.89 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1492.89 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."
1492.89 s
[algebraic-graphs] |
1492.89 s
[algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
1492.89 s
[algebraic-graphs] | ^^^^
1492.89 s
[algebraic-graphs]
1492.90 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning : [ GHC-63394 ] [ -Wx-partial ]
1492.90 s
[algebraic-graphs] In the use of ‘head’
1492.90 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1492.90 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."
1492.90 s
[algebraic-graphs] |
1492.90 s
[algebraic-graphs] 395 | p_v = fst $ head bnd
1492.90 s
[algebraic-graphs] | ^^^^
1492.90 s
[algebraic-graphs]
1492.90 s
[algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning : [ GHC-63394 ] [ -Wx-partial ]
1492.90 s
[algebraic-graphs] In the use of ‘tail’
1492.90 s
[algebraic-graphs] (imported from Prelude, but defined in GHC.List):
1492.90 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."
1492.90 s
[algebraic-graphs] |
1492.90 s
[algebraic-graphs] 397 | bnd' = tail bnd
1492.90 s
[algebraic-graphs] | ^^^^
1492.90 s
[algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
1492.93 s
[algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
1493.04 s
[algebraic-graphs]
1493.04 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1493.04 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1493.04 s
[algebraic-graphs] will become an error in a future GHC release.
1493.04 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1493.04 s
[algebraic-graphs] |
1493.04 s
[algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
1493.04 s
[algebraic-graphs] | ^
1493.04 s
[algebraic-graphs]
1493.04 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1493.04 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1493.04 s
[algebraic-graphs] will become an error in a future GHC release.
1493.04 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1493.04 s
[algebraic-graphs] |
1493.04 s
[algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1493.04 s
[algebraic-graphs] | ^
1493.04 s
[algebraic-graphs]
1493.05 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1493.05 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1493.05 s
[algebraic-graphs] will become an error in a future GHC release.
1493.05 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1493.05 s
[algebraic-graphs] |
1493.05 s
[algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
1493.05 s
[algebraic-graphs] | ^
1493.05 s
[algebraic-graphs]
1493.05 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1493.05 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1493.05 s
[algebraic-graphs] will become an error in a future GHC release.
1493.05 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1493.05 s
[algebraic-graphs] |
1493.05 s
[algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1493.05 s
[algebraic-graphs] | ^
1493.05 s
[algebraic-graphs]
1493.05 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1493.05 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1493.05 s
[algebraic-graphs] will become an error in a future GHC release.
1493.05 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1493.05 s
[algebraic-graphs] |
1493.05 s
[algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
1493.05 s
[algebraic-graphs] | ^
1493.05 s
[algebraic-graphs]
1493.05 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1493.05 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1493.05 s
[algebraic-graphs] will become an error in a future GHC release.
1493.05 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1493.05 s
[algebraic-graphs] |
1493.05 s
[algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1493.05 s
[algebraic-graphs] | ^
1493.05 s
[algebraic-graphs]
1493.05 s
[algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1493.05 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1493.05 s
[algebraic-graphs] will become an error in a future GHC release.
1493.05 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1493.05 s
[algebraic-graphs] |
1493.05 s
[algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
1493.05 s
[algebraic-graphs] | ^
1493.06 s
[algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
1493.13 s
[algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
1493.17 s
[algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
1493.26 s
[algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
1493.38 s
[algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
1493.46 s
[algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
1493.47 s
[algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
1493.48 s
[algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
1493.53 s
[algebraic-graphs]
1493.53 s
[algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1493.53 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1493.53 s
[algebraic-graphs] will become an error in a future GHC release.
1493.53 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1493.53 s
[algebraic-graphs] |
1493.53 s
[algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
1493.53 s
[algebraic-graphs] | ^
1493.53 s
[algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
1493.55 s
[algebraic-graphs]
1493.55 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1493.55 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1493.55 s
[algebraic-graphs] will become an error in a future GHC release.
1493.55 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1493.55 s
[algebraic-graphs] |
1493.55 s
[algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
1493.55 s
[algebraic-graphs] | ^
1493.55 s
[algebraic-graphs]
1493.55 s
[algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning : [ GHC-58520 ] [ -Wtype-equality-requires-operators ]
1493.55 s
[algebraic-graphs] The use of ‘~’ without TypeOperators
1493.55 s
[algebraic-graphs] will become an error in a future GHC release.
1493.55 s
[algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
1493.55 s
[algebraic-graphs] |
1493.55 s
[algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
1493.55 s
[algebraic-graphs] | ^
1493.55 s
[algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
1493.60 s
[algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
1493.64 s
[algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
1493.64 s
[algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
1493.65 s
[algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
1493.66 s
[algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
1493.67 s
[algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
1493.69 s
[algebraic-graphs] Haddock coverage:
1493.69 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1493.69 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
1493.69 s
[algebraic-graphs] * in ‘Data.Map.Internal’
1493.69 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1493.69 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.69 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.69 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
1493.71 s
[algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
1493.71 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1493.71 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
1493.71 s
[algebraic-graphs] * in ‘Data.IntMap.Internal’
1493.71 s
[algebraic-graphs] * in ‘Data.IntSet.Internal’
1493.71 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.71 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.71 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
1493.72 s
[algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
1493.73 s
[algebraic-graphs] Warning: 'nub' is out of scope.
1493.73 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.73 s
[algebraic-graphs] Warning: 'sort' is out of scope.
1493.73 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.73 s
[algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
1493.73 s
[algebraic-graphs] Missing documentation for:
1493.73 s
[algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
1493.74 s
[algebraic-graphs] Warning: 'List' is ambiguous. It is defined
1493.74 s
[algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
1493.74 s
[algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
1493.74 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.74 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.74 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
1493.74 s
[algebraic-graphs] Warning: 'IsList' is out of scope.
1493.74 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.74 s
[algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
1493.74 s
[algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
1493.74 s
[algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
1493.74 s
[algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
1493.74 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.74 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.74 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
1493.75 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1493.75 s
[algebraic-graphs] * at src/Algebra/Graph.hs:316:1
1493.75 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1493.75 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.75 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.75 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
1493.76 s
[algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
1493.76 s
[algebraic-graphs] Warning: 'mplus' is out of scope.
1493.76 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.77 s
[algebraic-graphs] Warning: 'vertexCount' is out of scope.
1493.77 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.77 s
[algebraic-graphs] Warning: 'hasVertex' is out of scope.
1493.77 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.77 s
[algebraic-graphs] Warning: 'vertexSet' is out of scope.
1493.77 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.77 s
[algebraic-graphs] Warning: 'isEmpty' is out of scope.
1493.77 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.77 s
[algebraic-graphs] Warning: 'edgeList' is out of scope.
1493.77 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.77 s
[algebraic-graphs] Warning: 'adjacencyList' is out of scope.
1493.77 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.77 s
[algebraic-graphs] Warning: 'box' is out of scope.
1493.77 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.77 s
[algebraic-graphs] Warning: 'edgeCount' is out of scope.
1493.77 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.77 s
[algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
1493.78 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1493.78 s
[algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
1493.78 s
[algebraic-graphs] * in ‘Data.Map.Internal’
1493.78 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1493.78 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.78 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.78 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
1493.78 s
[algebraic-graphs] Warning: 'nub' is out of scope.
1493.78 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.79 s
[algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
1493.79 s
[algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
1493.79 s
[algebraic-graphs] * in ‘Data.Tuple’
1493.79 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.79 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.79 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
1493.79 s
[algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
1493.85 s
[algebraic-graphs] Warning: 'isRight' is out of scope.
1493.85 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.85 s
[algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
1493.85 s
[algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
1493.85 s
[algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
1493.85 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.85 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.85 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
1493.86 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1493.86 s
[algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
1493.86 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1493.86 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.86 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.86 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
1493.86 s
[algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
1493.86 s
[algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
1493.86 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
1493.86 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
1493.86 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.86 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.86 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
1493.86 s
[algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
1493.86 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
1493.86 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
1493.86 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.86 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.86 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
1493.86 s
[algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
1493.86 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
1493.86 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
1493.86 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.86 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.86 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
1493.86 s
[algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
1493.86 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
1493.86 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
1493.86 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.86 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.86 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
1493.86 s
[algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
1493.86 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
1493.86 s
[algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
1493.86 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.86 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.86 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
1493.86 s
[algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
1493.87 s
[algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
1493.87 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
1493.87 s
[algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
1493.87 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.87 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.87 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
1493.87 s
[algebraic-graphs] Warning: 'isEmpty' is out of scope.
1493.87 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.87 s
[algebraic-graphs] Warning: 'empty' is out of scope.
1493.87 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.87 s
[algebraic-graphs] Warning: 'vertexList' is out of scope.
1493.87 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.87 s
[algebraic-graphs] Warning: 'edges' is out of scope.
1493.87 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.87 s
[algebraic-graphs] Warning: 'adjacencyList' is out of scope.
1493.87 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.88 s
[algebraic-graphs] Warning: 'stars' is out of scope.
1493.88 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.88 s
[algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
1493.88 s
[algebraic-graphs] Warning: 'nub' is out of scope.
1493.88 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.88 s
[algebraic-graphs] Warning: 'sort' is out of scope.
1493.88 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.89 s
[algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
1493.89 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
1493.89 s
[algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
1493.89 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.89 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.89 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
1493.89 s
[algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
1493.89 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
1493.89 s
[algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
1493.89 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.89 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.89 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
1493.89 s
[algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
1493.89 s
[algebraic-graphs] Missing documentation for:
1493.89 s
[algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
1493.89 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1493.89 s
[algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
1493.89 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
1493.89 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.89 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.89 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
1493.89 s
[algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
1493.89 s
[algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
1493.89 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
1493.89 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.89 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.89 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
1493.89 s
[algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
1493.89 s
[algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
1493.89 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
1493.89 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.89 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.89 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
1493.89 s
[algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
1493.89 s
[algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
1493.89 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
1493.89 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.89 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.89 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
1493.90 s
[algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
1493.90 s
[algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
1493.90 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
1493.90 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.90 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.90 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
1493.90 s
[algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
1493.90 s
[algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
1493.90 s
[algebraic-graphs] * at src/Algebra/Graph.hs:482:1
1493.90 s
[algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
1493.90 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.90 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.90 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
1493.91 s
[algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
1493.91 s
[algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
1493.91 s
[algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
1493.91 s
[algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
1493.91 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.91 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.91 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
1493.91 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1493.91 s
[algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
1493.91 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1493.91 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.91 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.91 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
1493.92 s
[algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
1493.92 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.92 s
[algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
1493.93 s
[algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
1493.93 s
[algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
1493.93 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
1493.93 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.93 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.93 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
1493.93 s
[algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
1493.93 s
[algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
1493.93 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
1493.93 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.93 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.93 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
1493.93 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1493.93 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
1493.93 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1493.93 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.93 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.93 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
1493.94 s
[algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
1493.95 s
[algebraic-graphs] Warning: 'vertexList' is out of scope.
1493.95 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.96 s
[algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
1493.96 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1493.96 s
[algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
1493.96 s
[algebraic-graphs] * in ‘Data.Map.Internal’
1493.96 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.96 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.96 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
1493.96 s
[algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
1493.96 s
[algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
1493.96 s
[algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
1493.96 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.96 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.96 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
1493.97 s
[algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
1493.97 s
[algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
1493.97 s
[algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
1493.97 s
[algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
1493.97 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.97 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.97 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
1493.97 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1493.97 s
[algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
1493.97 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1493.97 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.97 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.97 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
1493.98 s
[algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
1493.98 s
[algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
1493.98 s
[algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
1493.98 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.98 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.98 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
1493.98 s
[algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
1493.98 s
[algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
1493.99 s
[algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
1493.99 s
[algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
1493.99 s
[algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
1493.99 s
[algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
1493.99 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.99 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.99 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
1493.99 s
[algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
1493.99 s
[algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
1493.99 s
[algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
1493.99 s
[algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
1493.99 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1493.99 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1493.99 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
1493.99 s
[algebraic-graphs] Warning: 'Graph' is out of scope.
1493.99 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1493.99 s
[algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
1494.00 s
[algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
1494.00 s
[algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
1494.00 s
[algebraic-graphs] * in ‘Data.Set.Internal’
1494.00 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1494.00 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1494.00 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
1494.01 s
[algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
1494.02 s
[algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
1494.02 s
[algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
1494.02 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
1494.02 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
1494.02 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1494.02 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1494.02 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
1494.02 s
[algebraic-graphs] Warning: 'Transitive' is out of scope.
1494.02 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1494.02 s
[algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
1494.02 s
[algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
1494.02 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
1494.02 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
1494.02 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1494.02 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1494.02 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
1494.02 s
[algebraic-graphs] Warning: 'Reflexive' is out of scope.
1494.02 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1494.02 s
[algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
1494.02 s
[algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
1494.02 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
1494.02 s
[algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
1494.02 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1494.02 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1494.02 s
[algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
1494.02 s
[algebraic-graphs] Warning: 'Preorder' is out of scope.
1494.02 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1494.02 s
[algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
1494.02 s
[algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
1494.02 s
[algebraic-graphs] Missing documentation for:
1494.02 s
[algebraic-graphs] Module header
1494.02 s
[algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
1494.02 s
[algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
1494.02 s
[algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
1494.02 s
[algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
1494.02 s
[algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
1494.02 s
[algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
1494.02 s
[algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
1494.02 s
[algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
1494.02 s
[algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
1494.02 s
[algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
1494.02 s
[algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
1494.02 s
[algebraic-graphs] by specifying the type/value namespace explicitly.
1494.02 s
[algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
1494.02 s
[algebraic-graphs] Warning: 'array' is out of scope.
1494.02 s
[algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
1494.02 s
[algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
1494.02 s
[algebraic-graphs] Missing documentation for:
1494.02 s
[algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
1494.31 s
[algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
1494.31 s
[algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
1494.31 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
1494.31 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
1494.31 s
[algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
1494.31 s
[algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
1494.31 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
1494.31 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
1494.31 s
[algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
1494.31 s
[algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
1494.32 s
[algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
1494.32 s
[algebraic-graphs] - Algebra.Graph.Rep_Graph
1494.32 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
1494.32 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
1494.33 s
[algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
1494.33 s
[algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
1494.33 s
[algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
1494.33 s
[algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
1494.33 s
[algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
1494.33 s
[algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
1494.33 s
[algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
1494.33 s
[algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
1494.33 s
[algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
1494.34 s
[algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
1494.34 s
[algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
1494.34 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
1494.34 s
[algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
1494.35 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
1494.35 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
1494.35 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
1494.35 s
[algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
1494.35 s
[algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
1494.35 s
[algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
1494.35 s
[algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
1494.35 s
[algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
1494.35 s
[algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
1494.35 s
[algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
1494.35 s
[algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
1494.35 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
1494.35 s
[algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
1494.35 s
[algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
1494.35 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
1494.36 s
[algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
1494.36 s
[algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
1494.36 s
[algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
1494.36 s
[algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
1494.36 s
[algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
1494.36 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
1494.37 s
[algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
1494.37 s
[algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
1494.37 s
[algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
1494.37 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
1494.37 s
[algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
1494.37 s
[algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
1494.37 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
1494.38 s
[algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
1494.38 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
1494.38 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
1494.38 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
1494.38 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
1494.38 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
1494.38 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
1494.38 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
1494.38 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
1494.38 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
1494.38 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
1494.38 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
1494.38 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
1494.38 s
[algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
1494.38 s
[algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
1494.38 s
[algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
1494.38 s
[algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
1494.38 s
[algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
1494.38 s
[algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
1494.38 s
[algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
1494.38 s
[algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
1494.38 s
[algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
1494.38 s
[algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
1494.38 s
[algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
1494.38 s
[algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
1494.38 s
[algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
1497.73 s
[algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
1497.81 s
[algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
1497.81 s
[algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
1497.81 s
[algebraic-graphs] Phase: installPhase
1497.85 s
[algebraic-graphs] Installing library in /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
1498.49 s
[algebraic-graphs] Phase: fixupPhase
1498.51 s
[algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7
1498.51 s
[algebraic-graphs] shrinking /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSalgebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy-ghc9.8.4.so
1498.53 s
[algebraic-graphs] checking for references to /build/ in /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7...
1498.56 s
[algebraic-graphs] patching script interpreter paths in /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7
1498.57 s
[algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/lib
1498.83 s
[algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc
1498.84 s
[algebraic-graphs] checking for references to /build/ in /nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc...
1498.87 s
[algebraic-graphs] patching script interpreter paths in /nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc
1499.03 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7
1507.99 s
[post-build-hook] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
1507.99 s
[post-build-hook]
1512.59 s
[post-build-hook] Pushing /nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc (10.45 MiB)
1512.67 s
[post-build-hook] Pushing /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7 (24.13 MiB)
1521.82 s
[post-build-hook]
1521.84 s
[post-build-hook] All done.
1521.84 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7
1521.88 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1521.89 s
[post-build-hook] copying 2 paths...
1521.89 s
[post-build-hook] copying path '/nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
1523.21 s
[post-build-hook] copying path '/nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
1527.97 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1528.20 s
[post-build-hook] copying 1 paths...
1528.20 s
[post-build-hook] copying path '/nix/store/wm6rixrf93nj2wray6pk5q4kaj3f18r4-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
1528.33 s
Progress: 46 of 50 built, 786 of 786 downloaded from cache
1528.38 s
Building ghc-9.8.4-with-packages
1528.44 s
[ghc-9.8.4-with-packages] /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/nix-support:
1528.44 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.44 s
[ghc-9.8.4-with-packages] /nix/store/kz6rjig02ilxg6pingy2i9bwc922mpj8-ghc-compat-plugin-0.1.0.1/nix-support:
1528.44 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.45 s
[ghc-9.8.4-with-packages] /nix/store/brj4qf8vdmj7spncza7z460973g4k8d1-hedgehog-1.5/nix-support:
1528.45 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.47 s
[ghc-9.8.4-with-packages] /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0/nix-support:
1528.47 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.48 s
[ghc-9.8.4-with-packages] /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12/nix-support:
1528.48 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.50 s
[ghc-9.8.4-with-packages] /nix/store/2h1nqkxls7wf3ziyxjjslcwdncqly0fd-temporary-1.3/nix-support:
1528.50 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.50 s
[ghc-9.8.4-with-packages] /nix/store/2h1nqkxls7wf3ziyxjjslcwdncqly0fd-temporary-1.3/nix-support:
1528.50 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.50 s
[ghc-9.8.4-with-packages] /nix/store/6iclwl0rlh1kk822k56r744jzjdl29yx-ansi-terminal-1.1.3/nix-support:
1528.50 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.50 s
[ghc-9.8.4-with-packages] /nix/store/6iclwl0rlh1kk822k56r744jzjdl29yx-ansi-terminal-1.1.3/nix-support:
1528.50 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.50 s
[ghc-9.8.4-with-packages] /nix/store/37ii3d70vq73cxiq03b88d3yrskjbnh0-async-2.2.5/nix-support:
1528.50 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.50 s
[ghc-9.8.4-with-packages] /nix/store/37ii3d70vq73cxiq03b88d3yrskjbnh0-async-2.2.5/nix-support:
1528.50 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.51 s
[ghc-9.8.4-with-packages] /nix/store/w4z3vda339lhgdlja4x3z8q1cp1l9mi1-barbies-2.1.1.0/nix-support:
1528.51 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.51 s
[ghc-9.8.4-with-packages] /nix/store/w4z3vda339lhgdlja4x3z8q1cp1l9mi1-barbies-2.1.1.0/nix-support:
1528.51 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.51 s
[ghc-9.8.4-with-packages] /nix/store/ih5q3f5hi5v38hrw0vk8hyzlp82c6m2b-concurrent-output-1.10.21/nix-support:
1528.51 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.51 s
[ghc-9.8.4-with-packages] /nix/store/ih5q3f5hi5v38hrw0vk8hyzlp82c6m2b-concurrent-output-1.10.21/nix-support:
1528.51 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.52 s
[ghc-9.8.4-with-packages] /nix/store/7dxnsc4zh61lfaq4yqkb14cs9j0il00v-lifted-async-0.10.2.7/nix-support:
1528.52 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.52 s
[ghc-9.8.4-with-packages] /nix/store/7dxnsc4zh61lfaq4yqkb14cs9j0il00v-lifted-async-0.10.2.7/nix-support:
1528.52 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.52 s
[ghc-9.8.4-with-packages] /nix/store/vr8f1x98zcmfm5iq6z43yykp2mavc3zn-mmorph-1.2.1/nix-support:
1528.52 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.52 s
[ghc-9.8.4-with-packages] /nix/store/vr8f1x98zcmfm5iq6z43yykp2mavc3zn-mmorph-1.2.1/nix-support:
1528.52 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.52 s
[ghc-9.8.4-with-packages] /nix/store/s1z0b4ripxaibcbjg8b0kq727agp4bf5-monad-control-1.0.3.1/nix-support:
1528.52 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.52 s
[ghc-9.8.4-with-packages] /nix/store/s1z0b4ripxaibcbjg8b0kq727agp4bf5-monad-control-1.0.3.1/nix-support:
1528.52 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.52 s
[ghc-9.8.4-with-packages] /nix/store/59j0bw5x2b4qr5g5qygfyd9ldc7winzy-pretty-show-1.10/nix-support:
1528.52 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.53 s
[ghc-9.8.4-with-packages] /nix/store/59j0bw5x2b4qr5g5qygfyd9ldc7winzy-pretty-show-1.10/nix-support:
1528.53 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.53 s
[ghc-9.8.4-with-packages] /nix/store/d05v3j9vbx9wmhyxvfqg38gi85gqw9qb-primitive-0.9.1.0/nix-support:
1528.53 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.53 s
[ghc-9.8.4-with-packages] /nix/store/d05v3j9vbx9wmhyxvfqg38gi85gqw9qb-primitive-0.9.1.0/nix-support:
1528.53 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.53 s
[ghc-9.8.4-with-packages] /nix/store/rb3x326m38l05vvxp1yvjgmf8bsxviw2-random-1.2.1.3/nix-support:
1528.53 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.53 s
[ghc-9.8.4-with-packages] /nix/store/rb3x326m38l05vvxp1yvjgmf8bsxviw2-random-1.2.1.3/nix-support:
1528.53 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.53 s
[ghc-9.8.4-with-packages] /nix/store/mrjrznagfjx3hfidymraaj2hcj9hdgg3-resourcet-1.3.0/nix-support:
1528.53 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.54 s
[ghc-9.8.4-with-packages] /nix/store/mrjrznagfjx3hfidymraaj2hcj9hdgg3-resourcet-1.3.0/nix-support:
1528.54 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.54 s
[ghc-9.8.4-with-packages] /nix/store/vb5xrkg5w86rs98l5zvj8pm2gq03989c-safe-exceptions-0.1.7.4/nix-support:
1528.54 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.54 s
[ghc-9.8.4-with-packages] /nix/store/vb5xrkg5w86rs98l5zvj8pm2gq03989c-safe-exceptions-0.1.7.4/nix-support:
1528.54 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.54 s
[ghc-9.8.4-with-packages] /nix/store/rjrip1qdcl1scs6b0hkcc4p9xy5ng4q7-transformers-base-0.4.6/nix-support:
1528.54 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.54 s
[ghc-9.8.4-with-packages] /nix/store/rjrip1qdcl1scs6b0hkcc4p9xy5ng4q7-transformers-base-0.4.6/nix-support:
1528.54 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.54 s
[ghc-9.8.4-with-packages] /nix/store/9aa9qaibricg5j6s9n99jpaq30xlqclb-wl-pprint-annotated-0.1.0.1/nix-support:
1528.54 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.54 s
[ghc-9.8.4-with-packages] /nix/store/9aa9qaibricg5j6s9n99jpaq30xlqclb-wl-pprint-annotated-0.1.0.1/nix-support:
1528.54 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.56 s
[ghc-9.8.4-with-packages] /nix/store/rhfkd4j7g7kf3gr8kyfxwbw7rq872ci5-Cabal-syntax-3.12.1.0/nix-support:
1528.56 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.57 s
[ghc-9.8.4-with-packages] /nix/store/rhfkd4j7g7kf3gr8kyfxwbw7rq872ci5-Cabal-syntax-3.12.1.0/nix-support:
1528.57 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.57 s
[ghc-9.8.4-with-packages] /nix/store/1nhn1pmdh6rynrwg64wa6jyg05r1w8i2-ansi-terminal-types-1.1.3/nix-support:
1528.57 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.57 s
[ghc-9.8.4-with-packages] /nix/store/1nhn1pmdh6rynrwg64wa6jyg05r1w8i2-ansi-terminal-types-1.1.3/nix-support:
1528.57 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.58 s
[ghc-9.8.4-with-packages] /nix/store/accjj1a7s58f9csn4533s5y10v7i5ayr-hashable-1.5.0.0/nix-support:
1528.58 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.58 s
[ghc-9.8.4-with-packages] /nix/store/accjj1a7s58f9csn4533s5y10v7i5ayr-hashable-1.5.0.0/nix-support:
1528.58 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.58 s
[ghc-9.8.4-with-packages] /nix/store/qxdzqhj867c1d36953knff37mw83ficf-distributive-0.6.2.1/nix-support:
1528.58 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.58 s
[ghc-9.8.4-with-packages] /nix/store/qxdzqhj867c1d36953knff37mw83ficf-distributive-0.6.2.1/nix-support:
1528.58 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.58 s
[ghc-9.8.4-with-packages] /nix/store/mirzq3yfg5wbl8wsna9b3qvxrp4nmb6z-constraints-0.14.2/nix-support:
1528.58 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.59 s
[ghc-9.8.4-with-packages] /nix/store/mirzq3yfg5wbl8wsna9b3qvxrp4nmb6z-constraints-0.14.2/nix-support:
1528.59 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.59 s
[ghc-9.8.4-with-packages] /nix/store/cr7zciv2q01j4xja03w3bjm4xr65rfv8-lifted-base-0.2.3.12/nix-support:
1528.59 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.59 s
[ghc-9.8.4-with-packages] /nix/store/cr7zciv2q01j4xja03w3bjm4xr65rfv8-lifted-base-0.2.3.12/nix-support:
1528.59 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.59 s
[ghc-9.8.4-with-packages] /nix/store/99zq1gil5hgnklr8zzijqnw501q4rw5s-transformers-compat-0.7.2/nix-support:
1528.59 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.59 s
[ghc-9.8.4-with-packages] /nix/store/99zq1gil5hgnklr8zzijqnw501q4rw5s-transformers-compat-0.7.2/nix-support:
1528.59 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.60 s
[ghc-9.8.4-with-packages] /nix/store/s8ar36hx1qjsj73pgvppnl6dqm18l69w-splitmix-0.1.3.1/nix-support:
1528.60 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.60 s
[ghc-9.8.4-with-packages] /nix/store/s8ar36hx1qjsj73pgvppnl6dqm18l69w-splitmix-0.1.3.1/nix-support:
1528.60 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.60 s
[ghc-9.8.4-with-packages] /nix/store/yvar5jgnrvkz1qa6vzv18830lpa2jwyl-unliftio-core-0.2.1.0/nix-support:
1528.60 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.60 s
[ghc-9.8.4-with-packages] /nix/store/yvar5jgnrvkz1qa6vzv18830lpa2jwyl-unliftio-core-0.2.1.0/nix-support:
1528.60 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.60 s
[ghc-9.8.4-with-packages] /nix/store/qlvsmyiaz3ib75d4q3wm7wnjwzb59dnh-base-orphans-0.9.3/nix-support:
1528.60 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.61 s
[ghc-9.8.4-with-packages] /nix/store/qlvsmyiaz3ib75d4q3wm7wnjwzb59dnh-base-orphans-0.9.3/nix-support:
1528.61 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.61 s
[ghc-9.8.4-with-packages] /nix/store/p7324fxikqvxaql2mrmhlz6cby1qc8lc-os-string-2.0.8/nix-support:
1528.61 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.61 s
[ghc-9.8.4-with-packages] /nix/store/p7324fxikqvxaql2mrmhlz6cby1qc8lc-os-string-2.0.8/nix-support:
1528.61 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.61 s
[ghc-9.8.4-with-packages] /nix/store/zpq343jdivqaml3qfsfz174hif76ndan-tagged-0.8.9/nix-support:
1528.61 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.61 s
[ghc-9.8.4-with-packages] /nix/store/zpq343jdivqaml3qfsfz174hif76ndan-tagged-0.8.9/nix-support:
1528.61 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.61 s
[ghc-9.8.4-with-packages] /nix/store/390smls5rl93m23ijffn4h64ak09s7gw-boring-0.2.2/nix-support:
1528.61 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1528.61 s
[ghc-9.8.4-with-packages] /nix/store/390smls5rl93m23ijffn4h64ak09s7gw-boring-0.2.2/nix-support:
1528.61 s
[ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support/propagated-build-inputs
1529.22 s
[ghc-9.8.4-with-packages] Warning: include-dirs: /nix/store/bcdxrpc50rddk37yg3x0xxzp3gzvfjdk-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-fa66/include doesn't exist or isn't a directory
1530.30 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/bcdxrpc50rddk37yg3x0xxzp3gzvfjdk-ghc-9.8.4-with-packages
1539.81 s
[post-build-hook] Pushing 1 paths (154 are already present) using zstd to cache sellout ⏳
1539.83 s
[post-build-hook]
1542.22 s
[post-build-hook] Pushing /nix/store/bcdxrpc50rddk37yg3x0xxzp3gzvfjdk-ghc-9.8.4-with-packages (4.98 MiB)
1544.65 s
[post-build-hook]
1544.65 s
[post-build-hook] All done.
1544.67 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/bcdxrpc50rddk37yg3x0xxzp3gzvfjdk-ghc-9.8.4-with-packages
1544.70 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1544.84 s
[post-build-hook] copying 1 paths...
1544.85 s
[post-build-hook] copying path '/nix/store/bcdxrpc50rddk37yg3x0xxzp3gzvfjdk-ghc-9.8.4-with-packages' to 'https://cache.nix-ci.com'...
1545.75 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1545.93 s
[post-build-hook] copying 1 paths...
1545.93 s
[post-build-hook] copying path '/nix/store/wa1x27izynfbf5fagzvwjxfm374zsm62-ghc-9.8.4-with-packages.drv' to 'https://cache.nix-ci.com'...
1546.08 s
Progress: 47 of 49 built, 786 of 786 downloaded from cache
1546.13 s
Building ghc-shell-for-packages
1546.24 s
[post-build-hook] Uploading to cachix cache "sellout": /nix/store/y8rwq5aaj58ja6ppjyxnkfsc08q4zl45-ghc-shell-for-packages-0
1546.74 s
[post-build-hook] Pushing 1 paths (337 are already present) using zstd to cache sellout ⏳
1546.74 s
[post-build-hook]
1547.22 s
[post-build-hook] Pushing /nix/store/y8rwq5aaj58ja6ppjyxnkfsc08q4zl45-ghc-shell-for-packages-0 (256.00 B)
1548.15 s
[post-build-hook]
1548.15 s
[post-build-hook] All done.
1548.17 s
[post-build-hook] Uploading to the NixCI cache: /nix/store/y8rwq5aaj58ja6ppjyxnkfsc08q4zl45-ghc-shell-for-packages-0
1548.21 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1548.23 s
[post-build-hook] copying 1 paths...
1548.23 s
[post-build-hook] copying path '/nix/store/y8rwq5aaj58ja6ppjyxnkfsc08q4zl45-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...
1548.41 s
[post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
1548.72 s
[post-build-hook] copying 1 paths...
1548.72 s
[post-build-hook] copying path '/nix/store/sdjcmc2y5wkrbyi7wq4i1gagwmvq5b7y-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...
1548.86 s
Progress: 48 of 49 built, 786 of 786 downloaded from cache