closes : OK
[2m[pandoc] [m followed by text: OK
[2m[pandoc] [m code
[2m[pandoc] [m inline code block: OK
[2m[pandoc] [m tt
[2m[pandoc] [m inline tt block: OK
[2m[pandoc] [m samp
[2m[pandoc] [m inline samp block: OK
[2m[pandoc] [m var
[2m[pandoc] [m inline var block: OK
[2m[pandoc] [m header
[2m[pandoc] [m is parsed as a div: OK
[2m[pandoc] [m code block
[2m[pandoc] [m attributes in pre > code element: OK
[2m[pandoc] [m attributes in pre take precedence: OK
[2m[pandoc] [m Round trip: OK (1.14s)
[2m[pandoc] [m +++ OK, passed 25 tests.
[2m[pandoc] [m JATS
[2m[pandoc] [m inline code
[2m[pandoc] [m basic: OK
[2m[pandoc] [m block code
[2m[pandoc] [m basic: OK
[2m[pandoc] [m lang: OK
[2m[pandoc] [m images
[2m[pandoc] [m basic: OK
[2m[pandoc] [m alt-text: OK
[2m[pandoc] [m bullet list: OK
[2m[pandoc] [m definition lists
[2m[pandoc] [m with internal link: OK
[2m[pandoc] [m math
[2m[pandoc] [m escape |: OK
[2m[pandoc] [m tex-math only: OK
[2m[pandoc] [m math ml only: OK
[2m[pandoc] [m headers
[2m[pandoc] [m unnumbered sub header: OK
[2m[pandoc] [m containing image: OK
[2m[pandoc] [m metadata
[2m[pandoc] [m abstract: OK
[2m[pandoc] [m Jira
[2m[pandoc] [m para
[2m[pandoc] [m Simple sentence: OK
[2m[pandoc] [m leading blank lines: OK
[2m[pandoc] [m header
[2m[pandoc] [m header: OK
[2m[pandoc] [m list
[2m[pandoc] [m simple list: OK
[2m[pandoc] [m list with minus as bullets: OK
[2m[pandoc] [m ordered list / enumeration: OK
[2m[pandoc] [m block quote
[2m[pandoc] [m simple block quote: OK
[2m[pandoc] [m block quote between paragraphs: OK
[2m[pandoc] [m table
[2m[pandoc] [m table without header: OK
[2m[pandoc] [m table with header: OK
[2m[pandoc] [m table with column header: OK
[2m[pandoc] [m table after paragraph: OK
[2m[pandoc] [m panel
[2m[pandoc] [m simple panel: OK
[2m[pandoc] [m inlines
[2m[pandoc] [m emphasis: OK
[2m[pandoc] [m deleted: OK
[2m[pandoc] [m monospaced: OK
[2m[pandoc] [m sub- and superscript: OK
[2m[pandoc] [m citation: OK
[2m[pandoc] [m color: OK
[2m[pandoc] [m hexcolor: OK
[2m[pandoc] [m linebreak: OK
[2m[pandoc] [m links
[2m[pandoc] [m external: OK
[2m[pandoc] [m URL in alias: OK
[2m[pandoc] [m email: OK
[2m[pandoc] [m email with description: OK
[2m[pandoc] [m attachment: OK
[2m[pandoc] [m attachment with description: OK
[2m[pandoc] [m user: OK
[2m[pandoc] [m user with description: OK
[2m[pandoc] [m 'smart' link: OK
[2m[pandoc] [m 'smart' card: OK
[2m[pandoc] [m image: OK
[2m[pandoc] [m thumbnail image: OK
[2m[pandoc] [m image with attributes: OK
[2m[pandoc] [m inserted text: OK
[2m[pandoc] [m HTML entity: OK
[2m[pandoc] [m non-strikeout dashes: OK
[2m[pandoc] [m Org
[2m[pandoc] [m Inlines
[2m[pandoc] [m Plain String: OK
[2m[pandoc] [m Emphasis: OK
[2m[pandoc] [m Strong: OK
[2m[pandoc] [m Strong Emphasis: OK
[2m[pandoc] [m Emphasized Strong preceded by space: OK
[2m[pandoc] [m Underline: OK
[2m[pandoc] [m Strikeout: OK
[2m[pandoc] [m Verbatim: OK
[2m[pandoc] [m Code: OK
[2m[pandoc] [m Math $..$: OK
[2m[pandoc] [m Math $$..$$: OK
[2m[pandoc] [m Math \[..\]: OK
[2m[pandoc] [m Math \(..\): OK
[2m[pandoc] [m Symbol: OK
[2m[pandoc] [m Superscript simple expression: OK
[2m[pandoc] [m Superscript multi char: OK
[2m[pandoc] [m Subscript simple expression: OK
[2m[pandoc] [m Subscript multi char: OK
[2m[pandoc] [m Linebreak: OK
[2m[pandoc] [m Inline note: OK
[2m[pandoc] [m By default, markup-chars not occurring on word break...: OK
[2m[pandoc] [m No empty markup: OK
[2m[pandoc] [m Adherence to Org's rules for markup borders: OK
[2m[pandoc] [m Quotes are allowed border chars: OK
[2m[pandoc] [m Spaces are forbidden border chars: OK
[2m[pandoc] [m Zero width spaces are forbidden border chars: OK
[2m[pandoc] [m Markup should work properly after a blank line: OK
[2m[pandoc] [m Inline math must stay within three lines: OK
[2m[pandoc] [m Single-character math: OK
[2m[pandoc] [m Markup may not span more than two lines: OK
[2m[pandoc] [m Sub- and superscript expressions: OK
[2m[pandoc] [m Verbatim text can contain equal signs (=): OK
[2m[pandoc] [m Images
[2m[pandoc] [m Image: OK
[2m[pandoc] [m Image with explicit file: prefix: OK
[2m[pandoc] [m Multiple images within a paragraph: OK
[2m[pandoc] [m Image with html attributes: OK
[2m[pandoc] [m HTML attributes can have trailing spaces: OK
[2m[pandoc] [m Uppercase extension: OK
[2m[pandoc] [m Explicit link: OK
[2m[pandoc] [m Self-link: OK
[2m[pandoc] [m Internal self-link (reference): OK
[2m[pandoc] [m Absolute file link: OK
[2m[pandoc] [m Link to file in parent directory: OK
[2m[pandoc] [m Empty link (for gitit interop): OK
[2m[pandoc] [m Image link: OK
[2m[pandoc] [m Image link with non-image target: OK
[2m[pandoc] [m Link to image: OK
[2m[pandoc] [m Plain link: OK
[2m[pandoc] [m Angle link: OK
[2m[pandoc] [m Absolute file link: OK
[2m[pandoc] [m File link: OK
[2m[pandoc] [m Anchor: OK
[2m[pandoc] [m Inline code block: OK
[2m[pandoc] [m Inline code block with arguments: OK
[2m[pandoc] [m Inline code block with a blank argument array: OK
[2m[pandoc] [m Inline code block with toggle: OK
[2m[pandoc] [m Inline LaTeX symbol: OK
[2m[pandoc] [m Inline LaTeX command: OK
[2m[pandoc] [m Inline LaTeX command with spaces: OK
[2m[pandoc] [m Inline math symbols: OK
[2m[pandoc] [m Inline LaTeX math command: OK
[2m[pandoc] [m Unknown inline LaTeX command: OK
[2m[pandoc] [m Export snippet: OK
[2m[pandoc] [m MathML symbol in LaTeX-style: OK
[2m[pandoc] [m MathML symbol in LaTeX-style, including braces: OK
[2m[pandoc] [m MathML copy sign: OK
[2m[pandoc] [m MathML symbols, space separated: OK
[2m[pandoc] [m Macro: OK
[2m[pandoc] [m Macro duplicating its argument: OK
[2m[pandoc] [m Macro called with too few arguments: OK
[2m[pandoc] [m Macro called with an escaped comma: OK
[2m[pandoc] [m Citations
[2m[pandoc] [m Org-cite citations
[2m[pandoc] [m Citation: OK
[2m[pandoc] [m Citation containing text: OK
[2m[pandoc] [m Author-in-text citation with locator and suffix: OK
[2m[pandoc] [m org-ref citations
[2m[pandoc] [m simple citation: OK
[2m[pandoc] [m simple citation with underscores: OK
[2m[pandoc] [m simple citation succeeded by comma: OK
[2m[pandoc] [m simple citation succeeded by dot: OK
[2m[pandoc] [m simple citation succeeded by colon: OK
[2m[pandoc] [m simple citep citation: OK
[2m[pandoc] [m multiple simple citations: OK
[2m[pandoc] [m multiple simple citations succeeded by comma: OK
[2m[pandoc] [m extended citation: OK
[2m[pandoc] [m LaTeX citation: OK
[2m[pandoc] [m Footnotes
[2m[pandoc] [m Footnote: OK
[2m[pandoc] [m Two footnotes: OK
[2m[pandoc] [m Emphasized text before footnote: OK
[2m[pandoc] [m Footnote that starts with emphasized text: OK
[2m[pandoc] [m Footnote followed by header: OK
[2m[pandoc] [m Footnote followed by two blank lines: OK
[2m[pandoc] [m Smart punctuation
[2m[pandoc] [m quote before ellipses: OK
[2m[pandoc] [m apostrophe before emph: OK
[2m[pandoc] [m apostrophe in French: OK
[2m[pandoc] [m Quotes cannot occur at the end of emphasized text: OK
[2m[pandoc] [m Dashes are allowed at the borders of emphasis': OK
[2m[pandoc] [m Single quotes can be followed by emphasized text: OK
[2m[pandoc] [m Double quotes can be followed by emphasized text: OK
[2m[pandoc] [m Basic Blocks
[2m[pandoc] [m Paragraph: OK
[2m[pandoc] [m Paragraph starting with an asterisk: OK
[2m[pandoc] [m Paragraph containing asterisk at beginning of line: OK
[2m[pandoc] [m Example block: OK
[2m[pandoc] [m Example block surrounded by text: OK
[2m[pandoc] [m Horizontal Rule: OK
[2m[pandoc] [m Not a Horizontal Rule: OK
[2m[pandoc] [m Comments
[2m[pandoc] [m Comment Block: OK
[2m[pandoc] [m Comment line: OK
[2m[pandoc] [m Empty comment line: OK
[2m[pandoc] [m Blocks and fragments
[2m[pandoc] [m HTML block: OK
[2m[pandoc] [m Quote block: OK
[2m[pandoc] [m Verse block: OK
[2m[pandoc] [m Verse block with blank lines: OK
[2m[pandoc] [m Verse block with varying indentation: OK
[2m[pandoc] [m Raw block LaTeX: OK
[2m[pandoc] [m Raw LaTeX line: OK
[2m[pandoc] [m Raw Beamer line: OK
[2m[pandoc] [m Raw HTML line: OK
[2m[pandoc] [m Export block HTML: OK
[2m[pandoc] [m LaTeX fragment: OK
[2m[pandoc] [m One-line LaTeX fragment: OK
[2m[pandoc] [m LaTeX fragment with more arguments: OK
[2m[pandoc] [m Convert blank lines in blocks to single newlines: OK
[2m[pandoc] [m Accept `attr_html` attributes for generic block: OK
[2m[pandoc] [m Headers
[2m[pandoc] [m First Level Header: OK
[2m[pandoc] [m Third Level Header: OK
[2m[pandoc] [m Compact Headers with Paragraph: OK
[2m[pandoc] [m Separated Headers with Paragraph: OK
[2m[pandoc] [m Headers not preceded by a blank line: OK
[2m[pandoc] [m Todo keywords
[2m[pandoc] [m Header with known todo keyword: OK
[2m[pandoc] [m Header marked as done: OK
[2m[pandoc] [m emphasis in first word: OK
[2m[pandoc] [m Header with unknown todo keyword: OK
[2m[pandoc] [m Custom todo keywords: OK
[2m[pandoc] [m Custom todo keywords with multiple done-states: OK
[2m[pandoc] [m Tagged headers: OK
[2m[pandoc] [m Untagged header containing colons: OK
[2m[pandoc] [m Untagged header time followed by colon: OK
[2m[pandoc] [m tag followed by text: OK
[2m[pandoc] [m Header starting with strokeout text: OK
[2m[pandoc] [m Comment Trees: OK
[2m[pandoc] [m Nothing but a COMMENT header: OK
[2m[pandoc] [m Tree with :noexport:: OK
[2m[pandoc] [m Subtree with :noexport:: OK
[2m[pandoc] [m Preferences are treated as header attributes: OK
[2m[pandoc] [m Headers marked with a unnumbered property get a clas...: OK
[2m[pandoc] [m planning information
[2m[pandoc] [m Planning info is not included in output: OK
[2m[pandoc] [m Properties after planning info are recognized: OK
[2m[pandoc] [m Planning info followed by test: OK
[2m[pandoc] [m third and forth level headers: OK
[2m[pandoc] [m Figures
[2m[pandoc] [m Figure: OK
[2m[pandoc] [m Figure with no name: OK
[2m[pandoc] [m Figure with `fig:` prefix in name: OK
[2m[pandoc] [m Figure with HTML attributes: OK
[2m[pandoc] [m LaTeX attributes are ignored: OK
[2m[pandoc] [m Labelled figure: OK
[2m[pandoc] [m Figure with empty caption: OK
[2m[pandoc] [m Lists
[2m[pandoc] [m Simple Bullet Lists: OK
[2m[pandoc] [m Simple Bullet List with Ignored Counter Cookie: OK
[2m[pandoc] [m Indented Bullet Lists: OK
[2m[pandoc] [m Unindented *: OK
[2m[pandoc] [m Multi-line Bullet Lists: OK
[2m[pandoc] [m Nested Bullet Lists: OK
[2m[pandoc] [m Bullet List with Decreasing Indent: OK
[2m[pandoc] [m Header follows Bullet List: OK
[2m[pandoc] [m Bullet List Unindented with trailing Header: OK
[2m[pandoc] [m Empty bullet points: OK
[2m[pandoc] [m Task list: OK
[2m[pandoc] [m Task List with Counter Cookies: OK
[2m[pandoc] [m Task with alphabetical markers and counter cookie: OK
[2m[pandoc] [m Simple Ordered List: OK
[2m[pandoc] [m Simple Ordered List with fancy lists extension: OK
[2m[pandoc] [m Simple Ordered List with lower alpha marker: OK
[2m[pandoc] [m Simple Ordered List with upper and lower alpha markers: OK
[2m[pandoc] [m Simple Ordered List with Counter Cookie: OK
[2m[pandoc] [m Simple Ordered List with Alphabetical Counter Cookie: OK
[2m[pandoc] [m Simple Ordered List with Ignored Counter Cookie: OK
[2m[pandoc] [m Simple Ordered List with Parens: OK
[2m[pandoc] [m Indented Ordered List: OK
[2m[pandoc] [m Empty ordered list item: OK
[2m[pandoc] [m Empty ordered list item with fancy lists extension: OK
[2m[pandoc] [m Empty ordered list item with counter cookie: OK
[2m[pandoc] [m Nested Ordered Lists: OK
[2m[pandoc] [m Ordered List in Bullet List: OK
[2m[pandoc] [m Bullet List in Ordered List: OK
[2m[pandoc] [m Definition List: OK
[2m[pandoc] [m Definition list with multi-word term: OK
[2m[pandoc] [m Compact definition list: OK
[2m[pandoc] [m Definition List With Trailing Header: OK
[2m[pandoc] [m Definition lists double-colon markers must be surrou...: OK
[2m[pandoc] [m Loose bullet list: OK
[2m[pandoc] [m Recognize preceding paragraphs in non-list contexts: OK
[2m[pandoc] [m Markup after header and list: OK
[2m[pandoc] [m CodeBlocks
[2m[pandoc] [m Source block: OK
[2m[pandoc] [m Source block with indented code: OK
[2m[pandoc] [m Source block with tab-indented code: OK
[2m[pandoc] [m Empty source block: OK
[2m[pandoc] [m Source block between paragraphs: OK
[2m[pandoc] [m Source block with babel arguments: OK
[2m[pandoc] [m Source block with results and :exports both: OK
[2m[pandoc] [m Source block with results and :exports code: OK
[2m[pandoc] [m Source block with results and :exports results: OK
[2m[pandoc] [m Source block with results and :exports none: OK
[2m[pandoc] [m Source block with toggling header arguments: OK
[2m[pandoc] [m Source block with line number switch: OK
[2m[pandoc] [m Source block with multi-word parameter values: OK
[2m[pandoc] [m Example block: OK
[2m[pandoc] [m Code block with caption: OK
[2m[pandoc] [m Non-letter chars in source block parameters: OK
[2m[pandoc] [m Tables
[2m[pandoc] [m Single cell table: OK
[2m[pandoc] [m Multi cell table: OK
[2m[pandoc] [m Multi line table: OK
[2m[pandoc] [m Empty table: OK
[2m[pandoc] [m Glider Table: OK
[2m[pandoc] [m Table between Paragraphs: OK
[2m[pandoc] [m Table with Header: OK
[2m[pandoc] [m Table with final hline: OK
[2m[pandoc] [m Table in a box: OK
[2m[pandoc] [m Table with empty cells: OK
[2m[pandoc] [m Table with empty rows: OK
[2m[pandoc] [m Table with alignment row: OK
[2m[pandoc] [m Pipe within text doesn't start a table: OK
[2m[pandoc] [m Missing pipe at end of row: OK
[2m[pandoc] [m Table with differing row lengths: OK
[2m[pandoc] [m Table with caption: OK
[2m[pandoc] [m named table: OK
[2m[pandoc] [m Meta Information
[2m[pandoc] [m Comments
[2m[pandoc] [m Comment: OK
[2m[pandoc] [m Hash not followed by space is text: OK
[2m[pandoc] [m Comment surrounded by Text: OK
[2m[pandoc] [m Export settings
[2m[pandoc] [m Title: OK
[2m[pandoc] [m Author
[2m[pandoc] [m sets 'author' field: OK
[2m[pandoc] [m Multiple author lines: OK
[2m[pandoc] [m Date: OK
[2m[pandoc] [m Description
[2m[pandoc] [m Single line: OK
[2m[pandoc] [m Multiline: OK
[2m[pandoc] [m Subtitle: OK
[2m[pandoc] [m Keywords: OK
[2m[pandoc] [m Institute: OK
[2m[pandoc] [m Document language: OK
[2m[pandoc] [m Todo sequences
[2m[pandoc] [m not included in document: OK
[2m[pandoc] [m can contain multiple pipe characters: OK
[2m[pandoc] [m LaTeX
[2m[pandoc] [m LATEX_HEADER: OK
[2m[pandoc] [m LATEX_HEADER_EXTRA: OK
[2m[pandoc] [m LaTeX_CLASS
[2m[pandoc] [m stored as documentclass: OK
[2m[pandoc] [m last definition takes precedence: OK
[2m[pandoc] [m LATEX_CLASS_OPTIONS as classoption: OK
[2m[pandoc] [m HTML
[2m[pandoc] [m HTML_HEAD values are added to header-includes: OK
[2m[pandoc] [m HTML_HEAD_EXTRA behaves like HTML_HEAD: OK
[2m[pandoc] [m Non-export keywords
[2m[pandoc] [m #+link
[2m[pandoc] [m Link abbreviation: OK
[2m[pandoc] [m Link abbreviation, defined after first use: OK
[2m[pandoc] [m Link abbreviation, URL encoded arguments: OK
[2m[pandoc] [m Link abbreviation, append arguments: OK
[2m[pandoc] [m emphasis config
[2m[pandoc] [m Changing pre chars for emphasis: OK
[2m[pandoc] [m Changing post chars for emphasis: OK
[2m[pandoc] [m setting an invalid value restores the default: OK
[2m[pandoc] [m Unknown keyword: OK
[2m[pandoc] [m Properties drawer: OK
[2m[pandoc] [m Logbook drawer: OK
[2m[pandoc] [m Drawer surrounded by text: OK
[2m[pandoc] [m Drawer markers must be the only text in the line: OK
[2m[pandoc] [m Drawers can be arbitrary: OK
[2m[pandoc] [m Anchor reference: OK
[2m[pandoc] [m Search links are read as emph: OK
[2m[pandoc] [m Link to nonexistent anchor: OK
[2m[pandoc] [m Directives
[2m[pandoc] [m export options
[2m[pandoc] [m disable simple sub/superscript syntax: OK
[2m[pandoc] [m directly select drawers to be exported: OK
[2m[pandoc] [m exclude drawers from being exported: OK
[2m[pandoc] [m don't include archive trees: OK
[2m[pandoc] [m include complete archive trees: OK
[2m[pandoc] [m include archive tree header only: OK
[2m[pandoc] [m limit headline depth: OK
[2m[pandoc] [m turn all headlines into lists: OK
[2m[pandoc] [m preserve linebreaks as hard breaks: OK
[2m[pandoc] [m disable author export: OK
[2m[pandoc] [m disable creator export: OK
[2m[pandoc] [m disable email export: OK
[2m[pandoc] [m disable MathML-like entities: OK
[2m[pandoc] [m Option f
[2m[pandoc] [m disable inline footnotes: OK
[2m[pandoc] [m disable reference footnotes: OK
[2m[pandoc] [m disable inclusion of todo keywords: OK
[2m[pandoc] [m remove tags from headlines: OK
[2m[pandoc] [m LaTeX
[2m[pandoc] [m Include LaTeX fragments
[2m[pandoc] [m Inline command: OK
[2m[pandoc] [m Alpha: OK
[2m[pandoc] [m equation environment: OK
[2m[pandoc] [m Ignore LaTeX fragments
[2m[pandoc] [m Inline command: OK
[2m[pandoc] [m MathML symbol (alpha): OK
[2m[pandoc] [m equation environment: OK
[2m[pandoc] [m Verbatim LaTeX
[2m[pandoc] [m Inline command: OK
[2m[pandoc] [m MathML symbol (alpha): OK
[2m[pandoc] [m equation environment: OK
[2m[pandoc] [m planning information
[2m[pandoc] [m include planning info after headlines: OK
[2m[pandoc] [m empty planning info is not included: OK
[2m[pandoc] [m Option |
[2m[pandoc] [m disable export of tables: OK
[2m[pandoc] [m unknown options
[2m[pandoc] [m unknown options are ignored: OK
[2m[pandoc] [m highlighting after unknown option: OK
[2m[pandoc] [m unknown option interleaved with known: OK
[2m[pandoc] [m Include
[2m[pandoc] [m file inclusion: OK
[2m[pandoc] [m Included file belongs to item: OK
[2m[pandoc] [m Default include preserves level: OK
[2m[pandoc] [m Minlevel shifts level leftward: OK
[2m[pandoc] [m Minlevel shifts level rightward: OK
[2m[pandoc] [m Include file as source code snippet: OK
[2m[pandoc] [m Include file as export snippet: OK
[2m[pandoc] [m include directive is limited to one line: OK
[2m[pandoc] [m RST
[2m[pandoc] [m line block with blank line: OK
[2m[pandoc] [m field list
[2m[pandoc] [m general: OK
[2m[pandoc] [m metadata: OK
[2m[pandoc] [m with inline markup: OK
[2m[pandoc] [m URLs with following punctuation: OK
[2m[pandoc] [m Reference names with special characters: OK
[2m[pandoc] [m Code directive with class and number-lines: OK
[2m[pandoc] [m Code directive with number-lines, no line specified: OK
[2m[pandoc] [m literal / line / code blocks
[2m[pandoc] [m indented literal block: OK
[2m[pandoc] [m line block with 3 lines: OK
[2m[pandoc] [m line blocks with blank lines: OK
[2m[pandoc] [m quoted literal block using >: OK
[2m[pandoc] [m quoted literal block using | (not a line block): OK
[2m[pandoc] [m class directive with single paragraph: OK
[2m[pandoc] [m class directive with two paragraphs: OK
[2m[pandoc] [m class directive around literal block: OK
[2m[pandoc] [m interpreted text roles
[2m[pandoc] [m literal role prefix: OK
[2m[pandoc] [m literal role postfix: OK
[2m[pandoc] [m literal text: OK
[2m[pandoc] [m code role: OK
[2m[pandoc] [m inherited code role: OK
[2m[pandoc] [m custom code role with language field: OK
[2m[pandoc] [m custom role with class field: OK
[2m[pandoc] [m custom role with class field containing multiple whi...: OK
[2m[pandoc] [m custom role with inherited class field: OK
[2m[pandoc] [m custom role with unspecified parent role: OK
[2m[pandoc] [m role with recursive inheritance: OK
[2m[pandoc] [m unknown role: OK
[2m[pandoc] [m footnotes
[2m[pandoc] [m remove space before note: OK
[2m[pandoc] [m inlines
[2m[pandoc] [m links can contain an URI without being parsed twice ...: OK
[2m[pandoc] [m inline markup cannot be nested: OK
[2m[pandoc] [m bare URI parsing disabled inside emphasis (#4561): OK
[2m[pandoc] [m include newlines: OK
[2m[pandoc] [m RTF
[2m[pandoc] [m footnote: OK (0.08s)
[2m[pandoc] [m accent: OK
[2m[pandoc] [m unicode: OK
[2m[pandoc] [m image: OK (0.01s)
[2m[pandoc] [m link: OK
[2m[pandoc] [m heading: OK (0.01s)
[2m[pandoc] [m formatting: OK
[2m[pandoc] [m list_simple: OK
[2m[pandoc] [m list_complex: OK (0.03s)
[2m[pandoc] [m bookmark: OK
[2m[pandoc] [m table_simple: OK
[2m[pandoc] [m table_error_codes: OK (0.01s)
[2m[pandoc] [m Docx
[2m[pandoc] [m document
[2m[pandoc] [m allow different document.xml file as defined in _rel...: OK
[2m[pandoc] [m inlines
[2m[pandoc] [m font formatting: OK
[2m[pandoc] [m font formatting with character styles: OK
[2m[pandoc] [m hyperlinks: OK
[2m[pandoc] [m hyperlinks in tag: OK
[2m[pandoc] [m nested fields with tag: OK
[2m[pandoc] [m empty fields with tag: OK
[2m[pandoc] [m pageref hyperlinks in tag: OK
[2m[pandoc] [m inline image: OK
[2m[pandoc] [m VML image: OK
[2m[pandoc] [m VML image as object: OK
[2m[pandoc] [m inline image in links: OK
[2m[pandoc] [m handling unicode input: OK
[2m[pandoc] [m literal tabs: OK
[2m[pandoc] [m special punctuation: OK
[2m[pandoc] [m normalizing inlines: OK
[2m[pandoc] [m normalizing inlines deep inside blocks: OK
[2m[pandoc] [m move trailing spaces outside of formatting: OK
[2m[pandoc] [m remove trailing spaces from last inline: OK
[2m[pandoc] [m inline code (with VerbatimChar style): OK
[2m[pandoc] [m inline code in subscript and superscript: OK
[2m[pandoc] [m inlines inside of Structured Document Tags: OK
[2m[pandoc] [m Structured Document Tags in footnotes: OK
[2m[pandoc] [m nested Structured Document Tags: OK
[2m[pandoc] [m nested Smart Tags: OK (0.01s)
[2m[pandoc] [m remove anchor spans with nothing pointing to them: OK
[2m[pandoc] [m collapse overlapping targets (anchor spans): OK
[2m[pandoc] [m anchor in header after anchor: OK
[2m[pandoc] [m text in shape format: OK
[2m[pandoc] [m blocks
[2m[pandoc] [m headers: OK
[2m[pandoc] [m headers already having auto identifiers: OK
[2m[pandoc] [m avoid zero-level headers: OK
[2m[pandoc] [m nested anchor spans in header: OK
[2m[pandoc] [m single numbered item not made into list: OK
[2m[pandoc] [m enumerated headers not made into numbered list: OK
[2m[pandoc] [m i18n blocks (headers and blockquotes): OK
[2m[pandoc] [m lists: OK
[2m[pandoc] [m compact lists: OK
[2m[pandoc] [m lists with level overrides: OK
[2m[pandoc] [m lists continuing after interruption: OK
[2m[pandoc] [m lists restarting after interruption: OK
[2m[pandoc] [m sublists reset numbering to 1: OK
[2m[pandoc] [m definition lists: OK
[2m[pandoc] [m task lists: OK
[2m[pandoc] [m custom defined lists in styles: OK
[2m[pandoc] [m user deletes bullet after list item (=> part of item...: OK
[2m[pandoc] [m user deletes bullet after par (=> new par): OK
[2m[pandoc] [m footnotes and endnotes: OK
[2m[pandoc] [m links in footnotes and endnotes: OK
[2m[pandoc] [m blockquotes (parsing indent as blockquote): OK
[2m[pandoc] [m blockquotes (parsing indent relative to the indent o...: OK
[2m[pandoc] [m hanging indents: OK
[2m[pandoc] [m tables: OK
[2m[pandoc] [m tables with lists in cells: OK
[2m[pandoc] [m a table with a header which contains rowspans greate...: OK (0.02s)
[2m[pandoc] [m tables with one row: OK
[2m[pandoc] [m tables with just one row, which is a header: OK
[2m[pandoc] [m tables with variable width: OK
[2m[pandoc] [m tables with captions which contain a Table field: OK
[2m[pandoc] [m tables with captions which don't contain a Table field: OK
[2m[pandoc] [m code block: OK
[2m[pandoc] [m combine adjacent code blocks: OK
[2m[pandoc] [m dropcap paragraphs: OK
[2m[pandoc] [m citations
[2m[pandoc] [m zotero with -citations: OK
[2m[pandoc] [m zotero with +citations: OK (0.02s)
[2m[pandoc] [m mendeley with -citations: OK
[2m[pandoc] [m mendeley with +citations: OK (0.02s)
[2m[pandoc] [m track changes
[2m[pandoc] [m insertion (default): OK
[2m[pandoc] [m insert insertion (accept): OK
[2m[pandoc] [m remove insertion (reject): OK
[2m[pandoc] [m deletion (default): OK
[2m[pandoc] [m remove deletion (accept): OK
[2m[pandoc] [m insert deletion (reject): OK
[2m[pandoc] [m keep insertion (all): OK
[2m[pandoc] [m keep deletion (all): OK
[2m[pandoc] [m move text (accept): OK
[2m[pandoc] [m move text (reject): OK
[2m[pandoc] [m move text (all): OK
[2m[pandoc] [m comments (accept -- no comments): OK
[2m[pandoc] [m comments (reject -- comments): OK
[2m[pandoc] [m comments (all comments): OK
[2m[pandoc] [m paragraph insertion/deletion (accept): OK
[2m[pandoc] [m paragraph insertion/deletion (reject): OK
[2m[pandoc] [m paragraph insertion/deletion (all): OK
[2m[pandoc] [m paragraph insertion/deletion (all): OK
[2m[pandoc] [m comment warnings (accept -- no warnings): OK
[2m[pandoc] [m comment warnings (reject -- no warnings): OK
[2m[pandoc] [m comment warnings (all): OK
[2m[pandoc] [m comments (with styles extension): OK
[2m[pandoc] [m media
[2m[pandoc] [m image extraction: OK
[2m[pandoc] [m custom styles
[2m[pandoc] [m custom styles (`+styles`) not enabled (default): OK
[2m[pandoc] [m custom styles (`+styles`) enabled: OK
[2m[pandoc] [m custom styles (`+styles`): Compact style is removed ...: OK
[2m[pandoc] [m metadata
[2m[pandoc] [m metadata fields: OK
[2m[pandoc] [m stop recording metadata with normal text: OK
[2m[pandoc] [m ODT
[2m[pandoc] [m blockquote2: OK
[2m[pandoc] [m bold: OK
[2m[pandoc] [m endnote: OK
[2m[pandoc] [m externalLink: OK
[2m[pandoc] [m footnote: OK
[2m[pandoc] [m formula: OK
[2m[pandoc] [m headers: OK
[2m[pandoc] [m italic: OK
[2m[pandoc] [m paragraph: OK
[2m[pandoc] [m strikeout: OK
[2m[pandoc] [m underlined: OK
[2m[pandoc] [m blockquote: OK
[2m[pandoc] [m image: OK
[2m[pandoc] [m imageIndex: OK
[2m[pandoc] [m imageWithCaption: OK
[2m[pandoc] [m inlinedCode: OK
[2m[pandoc] [m listContinueNumbering: OK
[2m[pandoc] [m listContinueNumbering2: OK
[2m[pandoc] [m orderedListMixed: OK
[2m[pandoc] [m orderedListRoman: OK
[2m[pandoc] [m orderedListSimple: OK
[2m[pandoc] [m orderedListHeader: OK
[2m[pandoc] [m referenceToChapter: OK
[2m[pandoc] [m referenceToListItem: OK
[2m[pandoc] [m referenceToText: OK
[2m[pandoc] [m simpleTable: OK
[2m[pandoc] [m simpleTableWithCaption: OK
[2m[pandoc] [m tab: OK
[2m[pandoc] [m textMixedStyles: OK
[2m[pandoc] [m tableWithContents: OK
[2m[pandoc] [m unicode: OK
[2m[pandoc] [m unorderedList: OK
[2m[pandoc] [m unorderedListHeader: OK
[2m[pandoc] [m Txt2Tags
[2m[pandoc] [m Inlines
[2m[pandoc] [m Plain String: OK
[2m[pandoc] [m Emphasis: OK
[2m[pandoc] [m Strong: OK
[2m[pandoc] [m Strong Emphasis: OK
[2m[pandoc] [m Strikeout: OK
[2m[pandoc] [m Verbatim: OK
[2m[pandoc] [m Symbol: OK
[2m[pandoc] [m No empty markup: OK
[2m[pandoc] [m Inline markup is greedy: OK
[2m[pandoc] [m Markup must be greedy: OK
[2m[pandoc] [m Inlines must be glued: OK
[2m[pandoc] [m Macros: Date: OK
[2m[pandoc] [m Macros: Mod Time: OK
[2m[pandoc] [m Macros: Infile: OK
[2m[pandoc] [m Macros: Outfile: OK
[2m[pandoc] [m Autolink: OK
[2m[pandoc] [m JPEG Image: OK
[2m[pandoc] [m PNG Image: OK
[2m[pandoc] [m Link: OK
[2m[pandoc] [m Image link: OK
[2m[pandoc] [m Invalid link: No trailing space: OK
[2m[pandoc] [m Basic Blocks
[2m[pandoc] [m Paragraph, lines grouped together: OK
[2m[pandoc] [m Paragraph, ignore leading and trailing spaces: OK
[2m[pandoc] [m Comment line in paragraph: OK
[2m[pandoc] [m Paragraph: OK
[2m[pandoc] [m First Level Header: OK
[2m[pandoc] [m Third Level Header: OK
[2m[pandoc] [m Header with label: OK
[2m[pandoc] [m Invalid header, mismatched delimiters: OK
[2m[pandoc] [m Invalid header, spaces in label: OK
[2m[pandoc] [m Invalid header, invalid label character: OK
[2m[pandoc] [m Headers not preceded by a blank line: OK
[2m[pandoc] [m Paragraph starting with an equals: OK
[2m[pandoc] [m Paragraph containing asterisk at beginning of line: OK
[2m[pandoc] [m Horizontal Rule: OK
[2m[pandoc] [m Comment Block: OK
[2m[pandoc] [m Lists
[2m[pandoc] [m Simple Bullet Lists: OK
[2m[pandoc] [m Indented Bullet Lists: OK
[2m[pandoc] [m Nested Bullet Lists: OK
[2m[pandoc] [m Simple Ordered List: OK
[2m[pandoc] [m Indented Ordered List: OK
[2m[pandoc] [m Nested Ordered Lists: OK
[2m[pandoc] [m Ordered List in Bullet List: OK
[2m[pandoc] [m Bullet List in Ordered List: OK
[2m[pandoc] [m Definition List: OK
[2m[pandoc] [m Loose bullet list: OK
[2m[pandoc] [m Tables
[2m[pandoc] [m Single cell table: OK
[2m[pandoc] [m Multi cell table: OK
[2m[pandoc] [m Multi line table: OK
[2m[pandoc] [m Empty table: OK
[2m[pandoc] [m Glider Table: OK
[2m[pandoc] [m Table with Header: OK
[2m[pandoc] [m Table alignment determined by spacing: OK
[2m[pandoc] [m Pipe within text doesn't start a table: OK
[2m[pandoc] [m Table with differing row lengths: OK
[2m[pandoc] [m Blocks and fragments
[2m[pandoc] [m Source block: OK
[2m[pandoc] [m tagged block: OK
[2m[pandoc] [m Quote block: OK
[2m[pandoc] [m EPUB
[2m[pandoc] [m EPUB Mediabag
[2m[pandoc] [m features bag: OK
[2m[pandoc] [m EPUB3 cover bag: OK (0.03s)
[2m[pandoc] [m EPUB3 no cover bag: OK
[2m[pandoc] [m EPUB2 picture bag: OK
[2m[pandoc] [m EPUB2 cover bag: OK
[2m[pandoc] [m EPUB2 no cover bag: OK
[2m[pandoc] [m Muse
[2m[pandoc] [m Inlines
[2m[pandoc] [m Plain String: OK
[2m[pandoc] [m Muse is not XML: OK
[2m[pandoc] [m Emphasis: OK
[2m[pandoc] [m Newline in the beginning of emphasis: OK
[2m[pandoc] [m Newline in the end of emphasis: OK
[2m[pandoc] [m Comma after closing *: OK
[2m[pandoc] [m Letter after closing *: OK
[2m[pandoc] [m Letter before opening *: OK
[2m[pandoc] [m Digit after closing *: OK
[2m[pandoc] [m Emphasis tag: OK
[2m[pandoc] [m Strong: OK
[2m[pandoc] [m Strong tag: OK
[2m[pandoc] [m Strong Emphasis: OK
[2m[pandoc] [m Strong inside emphasis: OK
[2m[pandoc] [m Emphasis inside strong: OK
[2m[pandoc] [m Opening asterisk can't be preceded by another one: OK
[2m[pandoc] [m Asterisk between words does not terminate emphasis: OK
[2m[pandoc] [m Two asterisks between words do not terminate emphasis: OK
[2m[pandoc] [m Three asterisks between words do not terminate empha...: OK
[2m[pandoc] [m Two asterisks between words do not terminate strong: OK
[2m[pandoc] [m Three asterisks between words do not terminate strong: OK
[2m[pandoc] [m Three asterisks between words do not terminate stron...: OK
[2m[pandoc] [m Six asterisks between words do not terminate strong ...: OK
[2m[pandoc] [m Underline: OK
[2m[pandoc] [m Superscript tag: OK
[2m[pandoc] [m Subscript tag: OK
[2m[pandoc] [m Strikeout tag: OK
[2m[pandoc] [m Opening inline tags: OK
[2m[pandoc] [m Closing inline tags: OK
[2m[pandoc] [m Tag soup: OK
[2m[pandoc] [m No multiparagraph inline tags: OK
[2m[pandoc] [m Linebreak: OK
[2m[pandoc] [m Trailing whitespace inside paragraph: OK
[2m[pandoc] [m Non-breaking space: OK
[2m[pandoc] [m Single ~: OK
[2m[pandoc] [m Code markup
[2m[pandoc] [m Code: OK
[2m[pandoc] [m Not code: OK
[2m[pandoc] [m Not code if closing = is detached: OK
[2m[pandoc] [m Not code if opening = is detached: OK
[2m[pandoc] [m Code if followed by comma: OK
[2m[pandoc] [m Not code if followed by digit: OK
[2m[pandoc] [m One character code: OK
[2m[pandoc] [m Code with equal sign: OK
[2m[pandoc] [m Three = characters is not a code: OK
[2m[pandoc] [m Multiline code markup: OK
[2m[pandoc] [m No multiparagraph code: OK
[2m[pandoc] [m Code at the beginning of paragraph but not first col...: OK
[2m[pandoc] [m Code tag: OK
[2m[pandoc] [m Math tag: OK
[2m[pandoc] [m Verbatim tag: OK
[2m[pandoc] [m Verbatim inside code: OK
[2m[pandoc] [m Verbatim tag after text: OK
[2m[pandoc] [m Verbatim tag escapes block level markup: OK
[2m[pandoc] [m Class tag: OK
[2m[pandoc] [m Class tag without name: OK
[2m[pandoc] [m RTL: OK
[2m[pandoc] [m LTR: OK
[2m[pandoc] [m Nested "" inside em tag: OK
[2m[pandoc] [m Links
[2m[pandoc] [m Link without description: OK
[2m[pandoc] [m Link with description: OK
[2m[pandoc] [m Link with empty description: OK
[2m[pandoc] [m Image: OK
[2m[pandoc] [m Closing bracket is not allowed in image filename: OK
[2m[pandoc] [m Image with description: OK
[2m[pandoc] [m Image with space in filename: OK
[2m[pandoc] [m Image with width: OK
[2m[pandoc] [m At least one space is required between image filenam...: OK
[2m[pandoc] [m Left-aligned image with width: OK
[2m[pandoc] [m Right-aligned image with width: OK
[2m[pandoc] [m Image link: OK
[2m[pandoc] [m Image link with description: OK
[2m[pandoc] [m No implicit links: OK
[2m[pandoc] [m Link with empty URL: OK
[2m[pandoc] [m No footnotes inside links: OK
[2m[pandoc] [m Image inside link: OK
[2m[pandoc] [m Link inside image description: OK
[2m[pandoc] [m Literal
[2m[pandoc] [m Inline literal: OK
[2m[pandoc] [m Single inline literal in paragraph: OK
[2m[pandoc] [m Blocks
[2m[pandoc] [m Block elements end paragraphs: OK
[2m[pandoc] [m Horizontal rule
[2m[pandoc] [m Less than 4 dashes is not a horizontal rule: OK
[2m[pandoc] [m 4 dashes is a horizontal rule: OK
[2m[pandoc] [m 5 dashes is a horizontal rule: OK
[2m[pandoc] [m 4 dashes with spaces is a horizontal rule: OK
[2m[pandoc] [m Page breaks
[2m[pandoc] [m Page break: OK
[2m[pandoc] [m Page break with trailing space: OK
[2m[pandoc] [m Paragraphs
[2m[pandoc] [m Simple paragraph: OK
[2m[pandoc] [m Indented paragraph: OK
[2m[pandoc] [m Indentation in the middle of paragraph: OK
[2m[pandoc] [m Quote: OK
[2m[pandoc] [m Indentation does not indicate quote inside quote tag: OK
[2m[pandoc] [m Multiline quote: OK
[2m[pandoc] [m Div
[2m[pandoc] [m Div without id: OK
[2m[pandoc] [m Div with id: OK
[2m[pandoc] [m Biblio: OK
[2m[pandoc] [m Play: OK
[2m[pandoc] [m Verse: OK
[2m[pandoc] [m Verse in list: OK
[2m[pandoc] [m Verse line starting with emphasis: OK
[2m[pandoc] [m Multiline verse in list: OK
[2m[pandoc] [m Paragraph after verse in list: OK
[2m[pandoc] [m Empty quote tag: OK
[2m[pandoc] [m Quote tag: OK
[2m[pandoc] [m Nested quote tag: OK
[2m[pandoc] [m Indented quote inside list: OK
[2m[pandoc] [m Verse tag: OK
[2m[pandoc] [m Verse tag with empty line inside: OK
[2m[pandoc] [m Verse tag with verbatim close tag inside: OK
[2m[pandoc] [m Example
[2m[pandoc] [m Braces on separate lines: OK
[2m[pandoc] [m Spaces after opening braces: OK
[2m[pandoc] [m One blank line in the beginning: OK
[2m[pandoc] [m One blank line in the end: OK
[2m[pandoc] [m Indented braces: OK
[2m[pandoc] [m Tabs: OK
[2m[pandoc] [m One line: OK
[2m[pandoc] [m Example tag
[2m[pandoc] [m Tags on separate lines: OK
[2m[pandoc] [m One line: OK
[2m[pandoc] [m One blank line in the beginning: OK
[2m[pandoc] [m One blank line in the end: OK
[2m[pandoc] [m Example inside list: OK
[2m[pandoc] [m Empty example inside list: OK
[2m[pandoc] [m Example inside list with empty lines: OK
[2m[pandoc] [m Indented example inside list: OK
[2m[pandoc] [m Example inside definition list: OK
[2m[pandoc] [m Example inside list definition with empty lines: OK
[2m[pandoc] [m Example inside note: OK
[2m[pandoc] [m Literal blocks
[2m[pandoc] [m Literal block: OK
[2m[pandoc] [m Center: OK
[2m[pandoc] [m Right: OK
[2m[pandoc] [m Comments
[2m[pandoc] [m Comment tag: OK
[2m[pandoc] [m Line comment: OK
[2m[pandoc] [m Empty comment: OK
[2m[pandoc] [m Text after empty comment: OK
[2m[pandoc] [m Not a comment (does not start with a semicolon): OK
[2m[pandoc] [m Not a comment (has no space after semicolon): OK
[2m[pandoc] [m Not a comment (semicolon not in the first column): OK
[2m[pandoc] [m Headers
[2m[pandoc] [m Part: OK
[2m[pandoc] [m Chapter: OK
[2m[pandoc] [m Section: OK
[2m[pandoc] [m Subsection: OK
[2m[pandoc] [m Subsubsection: OK
[2m[pandoc] [m Whitespace is required after *: OK
[2m[pandoc] [m No headers in footnotes: OK
[2m[pandoc] [m No headers in quotes: OK
[2m[pandoc] [m Headers consume anchors: OK
[2m[pandoc] [m Headers don't consume anchors separated with a blank...: OK
[2m[pandoc] [m Headers terminate paragraph: OK
[2m[pandoc] [m Headers terminate lists: OK
[2m[pandoc] [m Paragraphs terminate Emacs Muse headers: OK
[2m[pandoc] [m Paragraphs don't terminate Text::Amuse headers: OK
[2m[pandoc] [m Empty header: OK
[2m[pandoc] [m Auto identifiers: OK
[2m[pandoc] [m Directives
[2m[pandoc] [m Title: OK
[2m[pandoc] [m Disable tables: OK
[2m[pandoc] [m Multiple directives: OK
[2m[pandoc] [m Multiline directive: OK
[2m[pandoc] [m Amusewiki's #cover is translated to pandoc's #cover-...: OK
[2m[pandoc] [m Anchors
[2m[pandoc] [m Anchor: OK
[2m[pandoc] [m Anchor cannot start with a number: OK
[2m[pandoc] [m Not anchor if starts with a space: OK
[2m[pandoc] [m Anchor inside a paragraph: OK
[2m[pandoc] [m Anchor with "-": OK
[2m[pandoc] [m Footnotes
[2m[pandoc] [m Simple footnote: OK
[2m[pandoc] [m Simple secondary footnote: OK
[2m[pandoc] [m Missing footnote: OK
[2m[pandoc] [m Missing secondary note: OK
[2m[pandoc] [m Wrong note type: OK
[2m[pandoc] [m Recursive footnote: OK
[2m[pandoc] [m Nested footnotes: OK
[2m[pandoc] [m No zero footnotes: OK
[2m[pandoc] [m Footnotes can't start with zero: OK
[2m[pandoc] [m Multiparagraph footnotes
[2m[pandoc] [m Amusewiki multiparagraph footnotes: OK
[2m[pandoc] [m Note continuation with verse: OK
[2m[pandoc] [m Footnote ending in self-terminating element and foll...: OK
[2m[pandoc] [m Footnote starting with empty line: OK
[2m[pandoc] [m Indentation in footnote starting with empty line: OK
[2m[pandoc] [m Emacs multiparagraph footnotes: OK
[2m[pandoc] [m Tables
[2m[pandoc] [m Two cell table: OK
[2m[pandoc] [m Table with multiple words: OK
[2m[pandoc] [m Not a table: OK
[2m[pandoc] [m Not a table again: OK
[2m[pandoc] [m Two line table: OK
[2m[pandoc] [m Table with one header: OK
[2m[pandoc] [m Table with two headers: OK
[2m[pandoc] [m Header and footer reordering: OK
[2m[pandoc] [m Table with caption: OK
[2m[pandoc] [m Table caption with +: OK
[2m[pandoc] [m Caption without table: OK
[2m[pandoc] [m Table indented with space: OK
[2m[pandoc] [m Empty cells: OK
[2m[pandoc] [m Empty cell in the middle: OK
[2m[pandoc] [m Grid table: OK
[2m[pandoc] [m Grid table inside list: OK
[2m[pandoc] [m Grid table with two rows: OK
[2m[pandoc] [m Grid table inside grid table: OK
[2m[pandoc] [m Grid table with example: OK
[2m[pandoc] [m Lists
[2m[pandoc] [m Bullet list: OK
[2m[pandoc] [m Ordered list: OK
[2m[pandoc] [m Ordered list with implicit numbers: OK
[2m[pandoc] [m Ordered list with roman numerals: OK
[2m[pandoc] [m Bullet list with empty items: OK
[2m[pandoc] [m Ordered list with empty items: OK
[2m[pandoc] [m Bullet list with last item empty: OK
[2m[pandoc] [m Nested lists
[2m[pandoc] [m Nested bullet list: OK
[2m[pandoc] [m Nested ordered list: OK
[2m[pandoc] [m Mixed nested list: OK
[2m[pandoc] [m Text::Amuse includes only one space in list marker: OK
[2m[pandoc] [m List continuation: OK
[2m[pandoc] [m List continuation after nested list: OK
[2m[pandoc] [m Blank lines
[2m[pandoc] [m Blank lines between list items are not required: OK
[2m[pandoc] [m One blank line between list items is allowed: OK
[2m[pandoc] [m Two blank lines separate lists: OK
[2m[pandoc] [m No blank line after multiline first item: OK
[2m[pandoc] [m One blank line after multiline first item: OK
[2m[pandoc] [m Two blank lines after multiline first item: OK
[2m[pandoc] [m No blank line after list continuation: OK
[2m[pandoc] [m One blank line after list continuation: OK
[2m[pandoc] [m Two blank lines after list continuation: OK
[2m[pandoc] [m No blank line after blockquote: OK
[2m[pandoc] [m One blank line after blockquote: OK
[2m[pandoc] [m Two blank lines after blockquote: OK
[2m[pandoc] [m No blank line after verse: OK
[2m[pandoc] [m One blank line after verse: OK
[2m[pandoc] [m Two blank lines after verse: OK
[2m[pandoc] [m List ending in self-terminating element and followed...: OK
[2m[pandoc] [m Not a definition list: OK
[2m[pandoc] [m Emacs Muse definition list: OK
[2m[pandoc] [m Definition list: OK
[2m[pandoc] [m Definition list term cannot include newline: OK
[2m[pandoc] [m One-line definition list: OK
[2m[pandoc] [m Definition list term may include single colon: OK
[2m[pandoc] [m Definition list term with emphasis: OK
[2m[pandoc] [m Definition list term with :: inside code: OK
[2m[pandoc] [m Multi-line definition lists: OK
[2m[pandoc] [m Definition list with verse: OK
[2m[pandoc] [m Definition list with table: OK
[2m[pandoc] [m Definition list with table inside bullet list: OK
[2m[pandoc] [m Multi-line definition lists from Emacs Muse manual: OK
[2m[pandoc] [m Multi-line definition lists from Emacs Muse manual w...: OK
[2m[pandoc] [m One-line nested definition list: OK
[2m[pandoc] [m Nested definition list: OK
[2m[pandoc] [m Definition lists with multiple descriptions
[2m[pandoc] [m Correctly indented second description: OK
[2m[pandoc] [m Incorrectly indented second description: OK
[2m[pandoc] [m Two blank lines separate definition lists: OK
[2m[pandoc] [m No headers in list continuation: OK
[2m[pandoc] [m Bullet list inside a tag: OK
[2m[pandoc] [m Ordered list inside a tag: OK
[2m[pandoc] [m Do not consume whitespace while looking for end tag: OK
[2m[pandoc] [m Unclosed quote tag: OK
[2m[pandoc] [m Unclosed quote tag inside list: OK
[2m[pandoc] [m No indented closing tags: OK
[2m[pandoc] [m Creole
[2m[pandoc] [m Basic Text Formatting
[2m[pandoc] [m bold, single line, fully delimited: OK
[2m[pandoc] [m italics, single line, fully delimited: OK
[2m[pandoc] [m bold in italics, fully delimited: OK
[2m[pandoc] [m italics in bold, fully delimited: OK
[2m[pandoc] [m escape bold marker: OK
[2m[pandoc] [m escape italics marker: OK
[2m[pandoc] [m inline nowiki, simple: OK
[2m[pandoc] [m inline nowiki, curly braces inside: OK
[2m[pandoc] [m placeholder: OK
[2m[pandoc] [m placeholder escaped: OK
[2m[pandoc] [m Headers
[2m[pandoc] [m header level 1, no space, no trailing =: OK
[2m[pandoc] [m header level 1, leading space, trailing =: OK
[2m[pandoc] [m header level 2, no space, no trailing =: OK
[2m[pandoc] [m header level 2, leading space, no trailing =: OK
[2m[pandoc] [m header level 3, no space, no trailing =: OK
[2m[pandoc] [m header level 3, no space, > 3 trailing =: OK
[2m[pandoc] [m header level 4, no space, no trailing =: OK
[2m[pandoc] [m header level 4, no space, < 4 trailing =: OK
[2m[pandoc] [m header level 5, no space, no trailing =: OK
[2m[pandoc] [m header level 6, no space, no trailing =: OK
[2m[pandoc] [m Paragraphs
[2m[pandoc] [m paragraphs: multiple, one line: OK
[2m[pandoc] [m Lists
[2m[pandoc] [m unordered list, two entries, one separating space: OK
[2m[pandoc] [m unordered list, three entries, one separating space: OK
[2m[pandoc] [m para followed by, unordered list, two entries, one s...: OK
[2m[pandoc] [m nested unordered list, one separating space: OK
[2m[pandoc] [m nested many unordered lists, one separating space: OK
[2m[pandoc] [m nested unordered list, mixed separating space: OK
[2m[pandoc] [m nested unordered list, one separating space, trailin...: OK
[2m[pandoc] [m ordered list, two entries, one separating space: OK
[2m[pandoc] [m ordered list, three entries, one separating space: OK
[2m[pandoc] [m para followed by, ordered list, two entries, one sep...: OK
[2m[pandoc] [m nested ordered list, one separating space: OK
[2m[pandoc] [m nested ordered list, one separating space, trailing ...: OK
[2m[pandoc] [m nested many ordered lists, one separating space: OK
[2m[pandoc] [m nested ordered list, mixed separating space: OK
[2m[pandoc] [m mixed nested ordered and unordered lists, one separa...: OK
[2m[pandoc] [m NoWiki
[2m[pandoc] [m quoted block, simple: OK
[2m[pandoc] [m quoted block, curly bracket exception: OK
[2m[pandoc] [m forced line breaks: OK
[2m[pandoc] [m quoted block, after trailing white space: OK
[2m[pandoc] [m Images and Links
[2m[pandoc] [m image simple: OK
[2m[pandoc] [m image with alt text: OK
[2m[pandoc] [m auto link: OK
[2m[pandoc] [m escaped auto link: OK
[2m[pandoc] [m wiki link simple: OK
[2m[pandoc] [m wiki link with name: OK
[2m[pandoc] [m image link: OK
[2m[pandoc] [m Table
[2m[pandoc] [m Table with Header: OK
[2m[pandoc] [m Table without Header: OK
[2m[pandoc] [m Table without Header, no markers at line ends: OK
[2m[pandoc] [m Table with Header, with formatting: OK
[2m[pandoc] [m Man
[2m[pandoc] [m Macros
[2m[pandoc] [m Bold: OK
[2m[pandoc] [m Italic: OK
[2m[pandoc] [m BoldItalic: OK
[2m[pandoc] [m H1: OK
[2m[pandoc] [m H2: OK
[2m[pandoc] [m Macro args: OK
[2m[pandoc] [m Argument from next line: OK
[2m[pandoc] [m comment: OK
[2m[pandoc] [m link: OK
[2m[pandoc] [m Escapes
[2m[pandoc] [m fonts: OK
[2m[pandoc] [m nested fonts: OK
[2m[pandoc] [m nested fonts 2: OK
[2m[pandoc] [m skip: OK
[2m[pandoc] [m replace: OK
[2m[pandoc] [m replace2: OK
[2m[pandoc] [m comment with \": OK
[2m[pandoc] [m comment with \#: OK
[2m[pandoc] [m two letter escapes: OK
[2m[pandoc] [m bracketed escapes: OK
[2m[pandoc] [m unicode escapes: OK
[2m[pandoc] [m unicode escapes (combined): OK
[2m[pandoc] [m unknown escape (#5034): OK
[2m[pandoc] [m Lists
[2m[pandoc] [m bullet: OK
[2m[pandoc] [m ordered: OK
[2m[pandoc] [m upper: OK
[2m[pandoc] [m nested: OK
[2m[pandoc] [m change in list style: OK
[2m[pandoc] [m CodeBlocks
[2m[pandoc] [m cb1: OK
[2m[pandoc] [m Tables
[2m[pandoc] [m t1: OK
[2m[pandoc] [m longcell: OK
[2m[pandoc] [m Mdoc
[2m[pandoc] [m one-line enclosures
[2m[pandoc] [m Dq: OK
[2m[pandoc] [m Sq: OK
[2m[pandoc] [m empty: OK
[2m[pandoc] [m nested: OK
[2m[pandoc] [m nested with closing delimiters: OK
[2m[pandoc] [m nested multiline enclosure: OK
[2m[pandoc] [m with inlines: OK
[2m[pandoc] [m with text production: OK
[2m[pandoc] [m with Ns: OK
[2m[pandoc] [m ending with open delimiter: OK
[2m[pandoc] [m multiline enclosures
[2m[pandoc] [m nested multiline: OK
[2m[pandoc] [m nested on one line: OK
[2m[pandoc] [m with wacky delimiters: OK
[2m[pandoc] [m simple inlines
[2m[pandoc] [m Sy: OK
[2m[pandoc] [m Em: OK
[2m[pandoc] [m Ev: OK
[2m[pandoc] [m Ar: OK
[2m[pandoc] [m In: OK
[2m[pandoc] [m Mt: OK
[2m[pandoc] [m No: OK
[2m[pandoc] [m empty Pa with closing punctuation: OK
[2m[pandoc] [m delimiters: OK
[2m[pandoc] [m multiple: OK
[2m[pandoc] [m Fl
[2m[pandoc] [m simple: OK
[2m[pandoc] [m multiple: OK
[2m[pandoc] [m empty with following macro: OK
[2m[pandoc] [m enclosed with following macro: OK
[2m[pandoc] [m enclosed with following delimiters: OK
[2m[pandoc] [m following Ns: OK
[2m[pandoc] [m GNU: OK
[2m[pandoc] [m GNU escaped: OK
[2m[pandoc] [m GNU Fl Fl: OK
[2m[pandoc] [m punctuation: OK
[2m[pandoc] [m middle close paren: OK
[2m[pandoc] [m empty with close paren: OK
[2m[pandoc] [m empty with pipe: OK
[2m[pandoc] [m empty with parens: OK
[2m[pandoc] [m links
[2m[pandoc] [m basic: OK
[2m[pandoc] [m complicated: OK
[2m[pandoc] [m unnamed: OK
[2m[pandoc] [m Ns macro
[2m[pandoc] [m at the beginning of a macro line (mandoc delta): OK
[2m[pandoc] [m after a block closing macro: OK
[2m[pandoc] [m in the middle of a macro line: OK
[2m[pandoc] [m before closing punctuation: OK
[2m[pandoc] [m after closing punctuation: OK
[2m[pandoc] [m at the end of a macro line: OK
[2m[pandoc] [m at the end of a partial-implicit line: OK
[2m[pandoc] [m normal words: OK
[2m[pandoc] [m opening punctuation: OK
[2m[pandoc] [m closing punctuation: OK
[2m[pandoc] [m spacing mode
[2m[pandoc] [m all text: OK
[2m[pandoc] [m text around macro: OK
[2m[pandoc] [m mulitple macros: OK
[2m[pandoc] [m mulitple control lines: OK
[2m[pandoc] [m mixed control and text lines: OK
[2m[pandoc] [m delimiters: OK
[2m[pandoc] [m Ap macro
[2m[pandoc] [m in the middle of a macro line: OK
[2m[pandoc] [m with punctuation and called macro: OK
[2m[pandoc] [m Pf macro
[2m[pandoc] [m closing punctuation: OK
[2m[pandoc] [m double punctuation: OK
[2m[pandoc] [m opening punctuation: OK
[2m[pandoc] [m unparsed argument: OK
[2m[pandoc] [m text production
[2m[pandoc] [m early NetBSD versions: OK
[2m[pandoc] [m with Ns: OK
[2m[pandoc] [m with punctuation: OK
[2m[pandoc] [m with argument and punctuation: OK
[2m[pandoc] [m BSD alone: OK
[2m[pandoc] [m BSD with macro: OK
[2m[pandoc] [m BSD with version: OK
[2m[pandoc] [m BSD with variant: OK
[2m[pandoc] [m inline punctuation
[2m[pandoc] [m leading punctuation
[2m[pandoc] [m open paren: OK
[2m[pandoc] [m open square bracket: OK
[2m[pandoc] [m pipe: OK
[2m[pandoc] [m period: OK
[2m[pandoc] [m comma: OK
[2m[pandoc] [m semicolon: OK
[2m[pandoc] [m colon: OK
[2m[pandoc] [m question mark: OK
[2m[pandoc] [m exclamation: OK
[2m[pandoc] [m close paren: OK
[2m[pandoc] [m close square bracket: OK
[2m[pandoc] [m trailing punctuation
[2m[pandoc] [m open paren: OK
[2m[pandoc] [m open square bracket: OK
[2m[pandoc] [m pipe: OK
[2m[pandoc] [m period: OK
[2m[pandoc] [m comma: OK
[2m[pandoc] [m semicolon: OK
[2m[pandoc] [m colon: OK
[2m[pandoc] [m question mark: OK
[2m[pandoc] [m exclamation: OK
[2m[pandoc] [m close parens: OK
[2m[pandoc] [m close square bracket: OK
[2m[pandoc] [m middle punctuation
[2m[pandoc] [m open paren: OK
[2m[pandoc] [m open square bracket: OK
[2m[pandoc] [m pipe: OK
[2m[pandoc] [m period: OK
[2m[pandoc] [m comma: OK
[2m[pandoc] [m semicolon: OK
[2m[pandoc] [m colon: OK
[2m[pandoc] [m question mark: OK
[2m[pandoc] [m exclamation: OK
[2m[pandoc] [m close paren: OK
[2m[pandoc] [m close square bracket: OK
[2m[pandoc] [m FB2
[2m[pandoc] [m Emphasis: OK
[2m[pandoc] [m Titles: OK
[2m[pandoc] [m Epigraph: OK
[2m[pandoc] [m Poem: OK
[2m[pandoc] [m Meta: OK
[2m[pandoc] [m Notes: OK
[2m[pandoc] [m DokuWiki
[2m[pandoc] [m inlines
[2m[pandoc] [m Bold: OK
[2m[pandoc] [m Italic: OK
[2m[pandoc] [m Underlined: OK
[2m[pandoc] [m Monospaced: OK
[2m[pandoc] [m Monospaced with nowiki: OK
[2m[pandoc] [m Combined: OK
[2m[pandoc] [m Nowiki: OK
[2m[pandoc] [m Percent: OK
[2m[pandoc] [m Subscript: OK
[2m[pandoc] [m Superscript: OK
[2m[pandoc] [m Deleted: OK
[2m[pandoc] [m Inline code: OK
[2m[pandoc] [m Inline file: OK
[2m[pandoc] [m Inline HTML: OK
[2m[pandoc] [m Inline PHP: OK
[2m[pandoc] [m Linebreak: OK
[2m[pandoc] [m External links
[2m[pandoc] [m Autolink: OK
[2m[pandoc] [m Link without description: OK
[2m[pandoc] [m Link with description: OK
[2m[pandoc] [m Trim whitespace around link and description: OK
[2m[pandoc] [m Email address: OK
[2m[pandoc] [m Internal links
[2m[pandoc] [m Current namespace: OK
[2m[pandoc] [m Current namespace starting with dot: OK
[2m[pandoc] [m Current namespace starting with dot and colon: OK
[2m[pandoc] [m Root namespace: OK
[2m[pandoc] [m Parent namespace: OK
[2m[pandoc] [m Parent namespace with colon: OK
[2m[pandoc] [m Beneath the root namespace: OK
[2m[pandoc] [m Explicitly beneath the root namespace: OK
[2m[pandoc] [m Interwiki links
[2m[pandoc] [m Interwiki without description: OK
[2m[pandoc] [m Interwiki link with description: OK
[2m[pandoc] [m Footnote: OK
[2m[pandoc] [m Images
[2m[pandoc] [m Image: OK
[2m[pandoc] [m Image with caption: OK
[2m[pandoc] [m Image with } in caption: OK
[2m[pandoc] [m Wiki namespace starting with dot: OK
[2m[pandoc] [m Left aligned image: OK
[2m[pandoc] [m Right aligned image: OK
[2m[pandoc] [m Centered image: OK
[2m[pandoc] [m Image with width: OK
[2m[pandoc] [m Image with width and height: OK
[2m[pandoc] [m Linkonly: OK
[2m[pandoc] [m Ignore ~~NOTOC~~: OK
[2m[pandoc] [m Ignore ~~NOCACHE~~: OK
[2m[pandoc] [m Sectioning
[2m[pandoc] [m Headline level 1: OK
[2m[pandoc] [m Headline level 2: OK
[2m[pandoc] [m Headline level 3: OK
[2m[pandoc] [m Headline level 4: OK
[2m[pandoc] [m Headline level 5: OK
[2m[pandoc] [m Only two closing = are required: OK
[2m[pandoc] [m One closing = is not enough: OK
[2m[pandoc] [m One closing = is not enough: OK
[2m[pandoc] [m Horizontal line: OK
[2m[pandoc] [m Lists
[2m[pandoc] [m Unordered list: OK
[2m[pandoc] [m Ordered list: OK
[2m[pandoc] [m Multiline list items: OK
[2m[pandoc] [m Block HTML: OK
[2m[pandoc] [m Block PHP: OK
[2m[pandoc] [m Quote: OK
[2m[pandoc] [m Code block: OK
[2m[pandoc] [m Java code block: OK
[2m[pandoc] [m File with filename and no language: OK
[2m[pandoc] [m Table: OK
[2m[pandoc] [m Table with header: OK
[2m[pandoc] [m Table with alignment: OK
[2m[pandoc] [m Table with colspan: OK
[2m[pandoc] [m Indented code block: OK
[2m[pandoc] [m Pod
[2m[pandoc] [m inlines
[2m[pandoc] [m code with nested inlines: OK
[2m[pandoc] [m compact in compact: OK
[2m[pandoc] [m expanded in compact: OK
[2m[pandoc] [m compact in expanded: OK
[2m[pandoc] [m expanded in expanded: OK
[2m[pandoc] [m links
[2m[pandoc] [m compact
[2m[pandoc] [m URL: OK
[2m[pandoc] [m URL with link text: OK
[2m[pandoc] [m perl manual: OK
[2m[pandoc] [m manual with quoted section: OK
[2m[pandoc] [m manual with section and formatted link text: OK
[2m[pandoc] [m internal link: OK
[2m[pandoc] [m internal link with formatting: OK
[2m[pandoc] [m link with angle bracket: OK
[2m[pandoc] [m empty name: OK
[2m[pandoc] [m expanded
[2m[pandoc] [m URL: OK
[2m[pandoc] [m URL with link text: OK
[2m[pandoc] [m perl manual: OK
[2m[pandoc] [m manual with quoted section: OK
[2m[pandoc] [m manual with section and formatted link text: OK
[2m[pandoc] [m internal link: OK
[2m[pandoc] [m internal link with formatting: OK
[2m[pandoc] [m link with angle bracket: OK
[2m[pandoc] [m empty name: OK
[2m[pandoc] [m entities
[2m[pandoc] [m required
[2m[pandoc] [m quot: OK
[2m[pandoc] [m amp: OK
[2m[pandoc] [m apos: OK
[2m[pandoc] [m lt: OK
[2m[pandoc] [m gt: OK
[2m[pandoc] [m sol: OK
[2m[pandoc] [m verbar: OK
[2m[pandoc] [m lchevron: OK
[2m[pandoc] [m rchevron: OK
[2m[pandoc] [m numeric
[2m[pandoc] [m decimal: OK
[2m[pandoc] [m octal: OK
[2m[pandoc] [m hexadecimal: OK
[2m[pandoc] [m hexadecimal variant: OK
[2m[pandoc] [m actually decimal: OK
[2m[pandoc] [m bogus
[2m[pandoc] [m 0XA2: OK
[2m[pandoc] [m not a real entity: OK
[2m[pandoc] [m 162 1: OK
[2m[pandoc] [m 99 bottles of beer: OK
[2m[pandoc] [m 0xhh: OK
[2m[pandoc] [m 077x: OK
[2m[pandoc] [m 0x63 skidoo: OK
[2m[pandoc] [m
[2m[pandoc] [mAll 3625 tests passed (81.69s)
[2m[pandoc] [mTest suite test-pandoc: PASS
[2m[pandoc] [mTest suite logged to: dist/test/pandoc-3.7.0.2-test-pandoc.log
[2m[pandoc] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[pandoc] [mcheckPhase completed in 1 minutes 25 seconds
[2m[pandoc] [m[1;36mPhase: haddockPhase[m
[2m[pandoc] [m[1;36mPhase: installPhase[m
[2m[pandoc] [mInstalling internal library xml-light in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-3.7.0.2-KGPTJkDqL6PHRGo9hEntgT-xml-light
[2m[pandoc] [mInstalling library in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
[2m[vector] [m[22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
[2m[pandoc] [m[1;36mPhase: fixupPhase[m
[2m[pandoc] [mshrinking RPATHs of ELF executables and libraries in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2
[2m[pandoc] [mshrinking /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSpandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3-ghc9.10.3.so
[2m[pandoc] [mshrinking /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSpandoc-3.7.0.2-KGPTJkDqL6PHRGo9hEntgT-xml-light-ghc9.10.3.so
[2m[pandoc] [mchecking for references to /build/ in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2...
[2m[pandoc] [mpatching script interpreter paths in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2
[2m[pandoc] [mstripping (with command strip and flags -S -p) in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib
[2m[vector] [m[23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
[2m[vector] [mPreprocessing test suite 'vector-tests-O0' for vector-0.13.2.0..
[2m[vector] [mBuilding test suite 'vector-tests-O0' for vector-0.13.2.0..
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[pandoc] [mshrinking RPATHs of ELF executables and libraries in /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data
[2m[pandoc] [mchecking for references to /build/ in /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data...
[2m[vector] [m[ 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 )
[2m[vector] [m
[2m[vector] [m[;1mtests/Utilities.hs:244:17: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘tail’
[2m[vector] [m (imported from Prelude, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m244 |[0m[0m postscanl f z = [;1m[35mtail[0m[0m . scanl f z
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Utilities.hs:245:16: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘tail’
[2m[vector] [m (imported from Prelude, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m245 |[0m[0m prescanr f z = [;1m[35mtail[0m[0m . scanr f z
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m[ 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 )
[2m[pandoc] [mpatching script interpreter paths in /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:243:68: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘head’
[2m[vector] [m (imported from Data.List, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m243 |[0m[0m prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` [;1m[35mhead[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:256:76: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘head’
[2m[vector] [m (imported from Data.List, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m256 |[0m[0m prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` [;1m[35mhead[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:272:65: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘tail’
[2m[vector] [m (imported from Data.List, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m272 |[0m[0m prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` [;1m[35mtail[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:439:26: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘head’
[2m[vector] [m (imported from Data.List, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m439 |[0m[0m = V.uniq `eq` (map [;1m[35mhead[0m[0m . group)
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[pandoc:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2 /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data[m
[2m[pandoc:post-build] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[pandoc:post-build] [m[2mUploading to the NixCI cache: /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2 /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data[m
[2m[pandoc:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[pandoc:post-build] [m[2mcopying 1 paths...[m
[2m[pandoc:post-build] [m[2mcopying path '/nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2' to 'https://cache.nix-ci.com'...[m
[2m[pandoc:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[pandoc:post-build] [m[2mcopying 0 paths...[m
[2mProgress: 22 of 38 built (1 building), 559 of 559 downloaded from cache[m
[1;34mBuilding /nix/store/97khgz4lrmr215dy798mkwnwd89b9kzw-pandoc-lua-engine-0.4.3.drv[m
[1;34mBuilding /nix/store/s3jg3bgm7jkn4xv5miw4v3w05qrkza0r-pandoc-server-0.1.0.11.drv[m
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Bundle.hs:76:77: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘head’
[2m[vector] [m (imported from Prelude, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m76 |[0m[0m prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` [;1m[35mhead[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Bundle.hs:92:83: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘tail’
[2m[vector] [m (imported from Prelude, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m92 |[0m[0m prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` [;1m[35mtail[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m[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 )
[2m[vector] [m[13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
[2m[vector] [mPreprocessing test suite 'vector-tests-O2' for vector-0.13.2.0..
[2m[vector] [mBuilding test suite 'vector-tests-O2' for vector-0.13.2.0..
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m
[2m[vector] [m[;1mtests/Utilities.hs:244:17: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘tail’
[2m[vector] [m (imported from Prelude, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m244 |[0m[0m postscanl f z = [;1m[35mtail[0m[0m . scanl f z
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Utilities.hs:245:16: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘tail’
[2m[vector] [m (imported from Prelude, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m245 |[0m[0m prescanr f z = [;1m[35mtail[0m[0m . scanr f z
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m[ 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 )
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:243:68: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘head’
[2m[vector] [m (imported from Data.List, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m243 |[0m[0m prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` [;1m[35mhead[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:256:76: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘head’
[2m[vector] [m (imported from Data.List, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m256 |[0m[0m prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` [;1m[35mhead[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:272:65: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘tail’
[2m[vector] [m (imported from Data.List, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m272 |[0m[0m prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` [;1m[35mtail[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:439:26: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘head’
[2m[vector] [m (imported from Data.List, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m439 |[0m[0m = V.uniq `eq` (map [;1m[35mhead[0m[0m . group)
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Bundle.hs:76:77: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘head’
[2m[vector] [m (imported from Prelude, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m76 |[0m[0m prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` [;1m[35mhead[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Bundle.hs:92:83: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m In the use of ‘tail’
[2m[vector] [m (imported from Prelude, but defined in GHC.List):
[2m[vector] [m "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."[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m
[2m[vector] [m[;1m[34m92 |[0m[0m prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` [;1m[35mtail[0m[0m
[2m[vector] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[vector] [m[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 )
[2m[vector] [m[13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
[2m[vector] [mPreprocessing library 'benchmarks-O2' for vector-0.13.2.0..
[2m[vector] [mBuilding library 'benchmarks-O2' for vector-0.13.2.0..
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m[ 1 of 14] Compiling Bench.Vector.Algo.AwShCC ( benchlib/Bench/Vector/Algo/AwShCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.p_o )
[2m[vector] [m[ 2 of 14] Compiling Bench.Vector.Algo.FindIndexR ( benchlib/Bench/Vector/Algo/FindIndexR.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.p_o )
[2m[vector] [m[ 3 of 14] Compiling Bench.Vector.Algo.HybCC ( benchlib/Bench/Vector/Algo/HybCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.p_o )
[2m[vector] [m[ 4 of 14] Compiling Bench.Vector.Algo.Leaffix ( benchlib/Bench/Vector/Algo/Leaffix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.p_o )
[2m[vector] [m[ 5 of 14] Compiling Bench.Vector.Algo.ListRank ( benchlib/Bench/Vector/Algo/ListRank.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.p_o )
[2m[vector] [m[ 6 of 14] Compiling Bench.Vector.Algo.MutableSet ( benchlib/Bench/Vector/Algo/MutableSet.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.p_o )
[2m[vector] [m[ 7 of 14] Compiling Bench.Vector.Algo.NextPermutation ( benchlib/Bench/Vector/Algo/NextPermutation.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.p_o )
[2m[vector] [m[ 8 of 14] Compiling Bench.Vector.Algo.Quickhull ( benchlib/Bench/Vector/Algo/Quickhull.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.p_o )
[2m[vector] [m[ 9 of 14] Compiling Bench.Vector.Algo.Rootfix ( benchlib/Bench/Vector/Algo/Rootfix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.p_o )
[2m[vector] [m[10 of 14] Compiling Bench.Vector.Algo.Spectral ( benchlib/Bench/Vector/Algo/Spectral.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.p_o )
[2m[vector] [m[11 of 14] Compiling Bench.Vector.Algo.Tridiag ( benchlib/Bench/Vector/Algo/Tridiag.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.p_o )
[2m[vector] [m[12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
[2m[vector] [m[13 of 14] Compiling Bench.Vector.TestData.Graph ( benchlib/Bench/Vector/TestData/Graph.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.p_o )
[2m[vector] [m[14 of 14] Compiling Bench.Vector.TestData.ParenTree ( benchlib/Bench/Vector/TestData/ParenTree.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.p_o )
[2m[vector] [mPreprocessing test suite 'vector-inspection' for vector-0.13.2.0..
[2m[vector] [mBuilding test suite 'vector-inspection' for vector-0.13.2.0..
[2m[vector] [m[1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
[2m[vector] [m[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 )
[2m[vector] [m[3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
[2m[vector] [m[4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
[2m[vector] [m[5 of 5] Linking dist/build/vector-inspection/vector-inspection
[2m[vector] [mPreprocessing test suite 'vector-doctest' for vector-0.13.2.0..
[2m[vector] [mBuilding test suite 'vector-doctest' for vector-0.13.2.0..
[2m[vector] [m[1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
[2m[vector] [m[2 of 2] Linking dist/build/vector-doctest/vector-doctest
[2m[vector] [mbuildPhase completed in 4 minutes 4 seconds
[2m[vector] [m[1;36mPhase: checkPhase[m
[2m[vector] [mRunning 2 test suites...
[2m[vector] [mTest suite vector-tests-O0: RUNNING...
[2m[vector] [mtoplevel
[2m[vector] [m Data.Vector.Fusion.Bundle
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m extract: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m and: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Tests.Vector.Boxed
[2m[vector] [m Bool
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.09s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.07s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 25 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m fmap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m return: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m bind: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m munzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_pure: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_appl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m and: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Int
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m fmap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m return: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m bind: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m munzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_pure: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_appl: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m unstream
[2m[vector] [m unstream == vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream == vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Tests.Vector.Primitive
[2m[vector] [m Int
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m Double
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 24 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m foldr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m ifoldl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 24 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 3 discarded.
[2m[vector] [m unstream
[2m[vector] [m unstream == vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream == vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Tests.Vector.Storable
[2m[vector] [m Data.Vector.Storable.Vector (Int)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 10 discarded.
[2m[vector] [m Data.Vector.Storable.Vector (Double)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.08s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.07s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.06s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.07s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m foldl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m foldr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m foldr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m ifoldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream
[2m[vector] [m unstream == vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream == vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Tests.Vector.Strict
[2m[vector] [m Bool
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 25 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m fmap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m return: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m bind: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m munzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_pure: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_appl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m and: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Int
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 26 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m fmap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m return: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m bind: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m munzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_pure: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_appl: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m unstream
[2m[vector] [m unstream == vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream == vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Tests.Vector.Unboxed
[2m[vector] [m ()
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 24 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 26 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m (Bool)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 24 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m and: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m (Int)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m (Float)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 25 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 2 discarded.
[2m[vector] [m (Double)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.06s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m foldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m ifoldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.06s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 3 discarded.
[2m[vector] [m (Int,Bool)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 25 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m (Int,Bool,Int)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.06s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.06s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.06s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.06s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.06s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream
[2m[vector] [m unstream == vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream == vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Data.Vector.Storable.Vector Alignment
[2m[vector] [m Aligned Double: OK
[2m[vector] [m Aligned Int: OK
[2m[vector] [m Regression tests
[2m[vector] [m enumFromTo crash #188
[2m[vector] [m Word8: OK
[2m[vector] [m Word16: OK
[2m[vector] [m Word32: OK
[2m[vector] [m Word64: OK
[2m[vector] [m Word: OK
[2m[vector] [m Int8: OK
[2m[vector] [m Int16: OK
[2m[vector] [m Int32: OK
[2m[vector] [m Int64: OK
[2m[vector] [m Int: OK
[2m[vector] [m Char: OK
[2m[vector] [m Negative tests
[2m[vector] [m slice out of bounds #257
[2m[vector] [m Boxed
[2m[vector] [m Negative ix: OK
[2m[vector] [m Negative size: OK
[2m[vector] [m Negative ix and size: OK
[2m[vector] [m Too large ix: OK
[2m[vector] [m Too large size: OK
[2m[vector] [m Too large ix and size: OK
[2m[vector] [m Overflow: OK
[2m[vector] [m OutOfMemory: OK
[2m[vector] [m Primitive
[2m[vector] [m Negative ix: OK
[2m[vector] [m Negative size: OK
[2m[vector] [m Negative ix and size: OK
[2m[vector] [m Too large ix: OK
[2m[vector] [m Too large size: OK
[2m[vector] [m Too large ix and size: OK
[2m[vector] [m Overflow: OK
[2m[vector] [m OutOfMemory: OK
[2m[vector] [m Storable
[2m[vector] [m Negative ix: OK
[2m[vector] [m Negative size: OK
[2m[vector] [m Negative ix and size: OK
[2m[vector] [m Too large ix: OK
[2m[vector] [m Too large size: OK
[2m[vector] [m Too large ix and size: OK
[2m[vector] [m Overflow: OK
[2m[vector] [m OutOfMemory: OK
[2m[vector] [m Unboxed
[2m[vector] [m Negative ix: OK
[2m[vector] [m Negative size: OK
[2m[vector] [m Negative ix and size: OK
[2m[vector] [m Too large ix: OK
[2m[vector] [m Too large size: OK
[2m[vector] [m Too large ix and size: OK
[2m[vector] [m Overflow: OK
[2m[vector] [m OutOfMemory: OK
[2m[vector] [m take #282
[2m[vector] [m Boxed: OK
[2m[vector] [m Primitive: OK
[2m[vector] [m Storable: OK
[2m[vector] [m Unboxed: OK
[2m[vector] [m Data.Vector
[2m[vector] [m MonadFix: OK
[2m[vector] [m toFromArray: OK
[2m[vector] [m toFromArraySlice: OK
[2m[vector] [m toFromArraySliceUnsafe: OK
[2m[vector] [m toFromMutableArray: OK
[2m[vector] [m Data.Vector.Mutable (Move): OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m Data.Vector.Primitive.Mutable (Move): OK
[2m[vector] [m +++ OK, passed 100 tests; 24 discarded.
[2m[vector] [m Data.Vector.Unboxed.Mutable (Move): OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m Data.Vector.Storable.Mutable (Move): OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m Data.Vector.Generic.Mutable (nextPermutation): OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m
[2m[vector] [mAll 2808 tests passed (93.67s)
[2m[vector] [mTest suite vector-tests-O0: PASS
[2m[vector] [mTest suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
[2m[vector] [mTest suite vector-tests-O2: RUNNING...
[2m[vector] [mtoplevel
[2m[vector] [m Data.Vector.Fusion.Bundle
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m extract: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 34 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m and: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Tests.Vector.Boxed
[2m[vector] [m Bool
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.08s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[pandoc-lua-engine] [mBuild with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 26 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m fmap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m return: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m bind: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m munzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_pure: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_appl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-server] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[pandoc-server] [mBuild with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
[2m[vector] [m sequence: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m and: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Int
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[1;36mPhase: unpackPhase[m
[2m[vector] [m mut_forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [munpacking source archive /nix/store/zx6z7rsf1lwrwkbcq94jg1dgi1fp9jls-pandoc-lua-engine-0.4.3.tar.gz
[2m[pandoc-lua-engine] [msource root is pandoc-lua-engine-0.4.3
[2m[vector] [m mut_iforM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[pandoc-lua-engine] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-lua-engine-0.4.3/test/writer-template.out.txt"
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[pandoc-lua-engine] [m[1;36mPhase: patchPhase[m
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[pandoc-lua-engine] [mReplace Cabal file with edited version from mirror://hackage/pandoc-lua-engine-0.4.3/revision/2.cabal.
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[pandoc-lua-engine] [msetupCompileFlags: -package-db=/build/tmp.dXHKZTBIpZ/setup-package.conf.d -threaded
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m fmap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m return: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m bind: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m munzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_pure: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.dXHKZTBIpZ/Main.o )
[2m[vector] [m applicative_appl: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m unstream
[2m[vector] [m unstream == vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream == vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Tests.Vector.Primitive
[2m[vector] [m Int
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-server] [m[1;36mPhase: unpackPhase[m
[2m[pandoc-server] [munpacking source archive /nix/store/4kqsjsplqpsanrihsxp1wxshjqr4snkl-pandoc-server-0.1.0.11.tar.gz
[2m[vector] [m iterateNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[2 of 2] Linking Setup
[2m[pandoc-server] [msource root is pandoc-server-0.1.0.11
[2m[pandoc-server] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-server-0.1.0.11/src/Text/Pandoc/Server.hs"
[2m[pandoc-server] [m[1;36mPhase: patchPhase[m
[2m[vector] [m generateM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-server] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[vector] [m replicateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-server] [msetupCompileFlags: -package-db=/build/tmp.QfXhG0cDsW/setup-package.conf.d -threaded
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-server] [m[1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.QfXhG0cDsW/Main.o )
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-server] [m[2 of 2] Linking Setup
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 27 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m Double
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.07s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests; 24 discarded.
[2m[vector] [m foldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m ifoldl: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[vector] [m scanl1': OK (0.01s)
[2m[pandoc-lua-engine] [m[1;36mPhase: configurePhase[m
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [mconfigureFlags: --verbose --prefix=/nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc/share/doc/pandoc-lua-engine-0.4.3 --with-gcc=gcc --package-db=/build/tmp.dXHKZTBIpZ/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
[2m[pandoc-lua-engine] [mUsing Parsec parser
[2m[pandoc-lua-engine] [mConfiguring pandoc-lua-engine-0.4.3...
[2m[vector] [m iscanl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-server] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[pandoc-server] [m[1;36mPhase: configurePhase[m
[2m[vector] [m mut_mapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-server] [mconfigureFlags: --verbose --prefix=/nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc/share/doc/pandoc-server-0.1.0.11 --with-gcc=gcc --package-db=/build/tmp.QfXhG0cDsW/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
[2m[pandoc-server] [mUsing Parsec parser
[2m[pandoc-server] [mConfiguring pandoc-server-0.1.0.11...
[2m[vector] [m mut_imapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream
[2m[vector] [m unstream == vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream == vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Tests.Vector.Storable
[2m[vector] [m Data.Vector.Storable.Vector (Int)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 10 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [mDependency aeson: using aeson-2.2.3.0
[2m[pandoc-lua-engine] [mDependency base >=4.12 && <5: using base-4.20.2.0
[2m[pandoc-lua-engine] [mDependency bytestring >=0.9 && <0.13: using bytestring-0.12.2.0
[2m[pandoc-lua-engine] [mDependency citeproc >=0.8 && <0.10: using citeproc-0.9.0.1
[2m[pandoc-lua-engine] [mDependency containers >=0.6.0.1 && <0.9: using containers-0.7
[2m[pandoc-lua-engine] [mDependency crypton >=0.30 && <1.1: using crypton-1.0.4
[2m[pandoc-lua-engine] [mDependency data-default >=0.4 && <0.9: using data-default-0.8.0.1
[2m[pandoc-lua-engine] [mDependency doclayout >=0.5 && <0.6: using doclayout-0.5.0.1
[2m[pandoc-lua-engine] [mDependency doctemplates >=0.11 && <0.12: using doctemplates-0.11.0.1
[2m[pandoc-lua-engine] [mDependency exceptions >=0.8 && <0.11: using exceptions-0.10.9
[2m[pandoc-lua-engine] [mDependency hslua >=2.3 && <2.5: using hslua-2.3.1
[2m[pandoc-lua-engine] [mDependency hslua-module-doclayout >=1.2 && <1.3: using
[2m[pandoc-lua-engine] [mhslua-module-doclayout-1.2.0.1
[2m[pandoc-lua-engine] [mDependency hslua-module-path >=1.1 && <1.2: using hslua-module-path-1.1.1
[2m[pandoc-lua-engine] [mDependency hslua-module-system >=1.1 && <1.3: using hslua-module-system-1.1.3
[2m[pandoc-lua-engine] [mDependency hslua-module-text >=1.1 && <1.2: using hslua-module-text-1.1.1
[2m[pandoc-lua-engine] [mDependency hslua-module-version >=1.1 && <1.2: using
[2m[pandoc-lua-engine] [mhslua-module-version-1.1.1
[2m[pandoc-lua-engine] [mDependency hslua-module-zip >=1.1.3 && <1.2: using hslua-module-zip-1.1.4
[2m[pandoc-lua-engine] [mDependency hslua-repl >=0.1.1 && <0.2: using hslua-repl-0.1.2
[2m[pandoc-lua-engine] [mDependency lpeg >=1.1 && <1.2: using lpeg-1.1.0
[2m[pandoc-lua-engine] [mDependency mtl >=2.2 && <2.4: using mtl-2.3.1
[2m[pandoc-lua-engine] [mDependency pandoc >=3.7 && <3.8: using pandoc-3.7.0.2
[2m[pandoc-lua-engine] [mDependency pandoc-lua-marshal >=0.3 && <0.4: using pandoc-lua-marshal-0.3.1
[2m[pandoc-lua-engine] [mDependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
[2m[pandoc-lua-engine] [mDependency parsec >=3.1 && <3.2: using parsec-3.1.18.0
[2m[pandoc-lua-engine] [mDependency text >=1.1.1 && <2.2: using text-2.1.3
[2m[pandoc-lua-engine] [mDependency base >=4.12 && <5: using base-4.20.2.0
[2m[pandoc-lua-engine] [mDependency bytestring: using bytestring-0.12.2.0
[2m[pandoc-lua-engine] [mDependency data-default: using data-default-0.8.0.1
[2m[pandoc-lua-engine] [mDependency directory: using directory-1.3.8.5
[2m[pandoc-lua-engine] [mDependency exceptions >=0.8 && <0.11: using exceptions-0.10.9
[2m[pandoc-lua-engine] [mDependency filepath: using filepath-1.5.4.0
[2m[pandoc-lua-engine] [mDependency hslua >=2.3 && <2.5: using hslua-2.3.1
[2m[pandoc-lua-engine] [mDependency pandoc: using pandoc-3.7.0.2
[2m[pandoc-lua-engine] [mDependency pandoc-lua-engine: using pandoc-lua-engine-0.4.3
[2m[pandoc-lua-engine] [mDependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
[2m[pandoc-lua-engine] [mDependency tasty: using tasty-1.5.3
[2m[pandoc-lua-engine] [mDependency tasty-golden: using tasty-golden-2.3.5
[2m[pandoc-lua-engine] [mDependency tasty-hunit: using tasty-hunit-0.10.2
[2m[pandoc-lua-engine] [mDependency tasty-lua >=1.1 && <1.2: using tasty-lua-1.1.2
[2m[pandoc-lua-engine] [mDependency text >=1.1.1 && <2.2: using text-2.1.3
[2m[pandoc-lua-engine] [mSource component graph:
[2m[pandoc-lua-engine] [m component lib
[2m[pandoc-lua-engine] [m component test:test-pandoc-lua-engine dependency lib
[2m[pandoc-lua-engine] [mConfigured component graph:
[2m[pandoc-lua-engine] [m component pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
[2m[pandoc-lua-engine] [m include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
[2m[pandoc-lua-engine] [m include base-4.20.2.0-64da
[2m[pandoc-lua-engine] [m include bytestring-0.12.2.0-262e
[2m[pandoc-lua-engine] [m include citeproc-0.9.0.1-8eZIkwGUgwZIclKUEeSqkh
[2m[pandoc-lua-engine] [m include containers-0.7-504a
[2m[pandoc-lua-engine] [m include crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
[2m[pandoc-lua-engine] [m include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
[2m[pandoc-lua-engine] [m include doclayout-0.5.0.1-ETXOcBr0tml6gEsSGXL6oV
[2m[pandoc-lua-engine] [m include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
[2m[pandoc-lua-engine] [m include exceptions-0.10.9-1a12
[2m[pandoc-lua-engine] [m include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
[2m[pandoc-lua-engine] [m include hslua-module-doclayout-1.2.0.1-ErY6mbvHQgAEdxA7VP30qJ
[2m[pandoc-lua-engine] [m include hslua-module-path-1.1.1-u1nrCdvNoJBLk9wjMCk0d
[2m[pandoc-lua-engine] [m include hslua-module-system-1.1.3-C64Ey1CTges1ct5bp4x6FI
[2m[pandoc-lua-engine] [m include hslua-module-text-1.1.1-KHVA6Tk8C366LjT6lG2vsI
[2m[pandoc-lua-engine] [m include hslua-module-version-1.1.1-31iUzkcfJgL8o5QdosdhcV
[2m[pandoc-lua-engine] [m include hslua-module-zip-1.1.4-7o7wUu0Aa5uJq1MktjFd3a
[2m[pandoc-lua-engine] [m include hslua-repl-0.1.2-Juvw7nYrTHo9eZBtoxILD7
[2m[pandoc-lua-engine] [m include lpeg-1.1.0-84tlw7PTtFB7quUkAvIAre
[2m[pandoc-lua-engine] [m include mtl-2.3.1-b4af
[2m[pandoc-lua-engine] [m include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
[2m[pandoc-lua-engine] [m include pandoc-lua-marshal-0.3.1-CEai8TZ59D36cGPSocsWLC
[2m[pandoc-lua-engine] [m include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
[2m[pandoc-lua-engine] [m include parsec-3.1.18.0-b178
[2m[pandoc-lua-engine] [m include text-2.1.3-c691
[2m[pandoc-lua-engine] [m component pandoc-lua-engine-0.4.3-3LEmP89EEdjCRAN3LsL1y3-test-pandoc-lua-engine
[2m[pandoc-lua-engine] [m include base-4.20.2.0-64da
[2m[pandoc-lua-engine] [m include bytestring-0.12.2.0-262e
[2m[pandoc-lua-engine] [m include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
[2m[pandoc-lua-engine] [m include directory-1.3.8.5-c84a
[2m[pandoc-lua-engine] [m include exceptions-0.10.9-1a12
[2m[pandoc-lua-engine] [m include filepath-1.5.4.0-e600
[2m[pandoc-lua-engine] [m include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
[2m[pandoc-lua-engine] [m include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
[2m[pandoc-lua-engine] [m include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
[2m[pandoc-lua-engine] [m include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
[2m[pandoc-lua-engine] [m include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
[2m[pandoc-lua-engine] [m include tasty-golden-2.3.5-3QQ0reIfFJ36gfVIlepFcf
[2m[pandoc-lua-engine] [m include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
[2m[pandoc-lua-engine] [m include tasty-lua-1.1.2-1O8o765OPu9IHWrmpruNIo
[2m[pandoc-lua-engine] [m include text-2.1.3-c691
[2m[pandoc-lua-engine] [mLinked component graph:
[2m[pandoc-lua-engine] [m unit pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
[2m[pandoc-lua-engine] [m include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
[2m[pandoc-lua-engine] [m include base-4.20.2.0-64da
[2m[pandoc-lua-engine] [m include bytestring-0.12.2.0-262e
[2m[pandoc-lua-engine] [m include citeproc-0.9.0.1-8eZIkwGUgwZIclKUEeSqkh
[2m[pandoc-lua-engine] [m include containers-0.7-504a
[2m[pandoc-lua-engine] [m include crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
[2m[pandoc-lua-engine] [m include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
[2m[pandoc-lua-engine] [m include doclayout-0.5.0.1-ETXOcBr0tml6gEsSGXL6oV
[2m[pandoc-lua-engine] [m include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
[2m[pandoc-lua-engine] [m include exceptions-0.10.9-1a12
[2m[pandoc-lua-engine] [m include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
[2m[pandoc-lua-engine] [m include hslua-module-doclayout-1.2.0.1-ErY6mbvHQgAEdxA7VP30qJ
[2m[pandoc-lua-engine] [m include hslua-module-path-1.1.1-u1nrCdvNoJBLk9wjMCk0d
[2m[pandoc-lua-engine] [m include hslua-module-system-1.1.3-C64Ey1CTges1ct5bp4x6FI
[2m[pandoc-lua-engine] [m include hslua-module-text-1.1.1-KHVA6Tk8C366LjT6lG2vsI
[2m[pandoc-lua-engine] [m include hslua-module-version-1.1.1-31iUzkcfJgL8o5QdosdhcV
[2m[pandoc-lua-engine] [m include hslua-module-zip-1.1.4-7o7wUu0Aa5uJq1MktjFd3a
[2m[pandoc-lua-engine] [m include hslua-repl-0.1.2-Juvw7nYrTHo9eZBtoxILD7
[2m[pandoc-lua-engine] [m include lpeg-1.1.0-84tlw7PTtFB7quUkAvIAre
[2m[pandoc-lua-engine] [m include mtl-2.3.1-b4af
[2m[pandoc-lua-engine] [m include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
[2m[pandoc-lua-engine] [m include pandoc-lua-marshal-0.3.1-CEai8TZ59D36cGPSocsWLC
[2m[pandoc-lua-engine] [m include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
[2m[pandoc-lua-engine] [m include parsec-3.1.18.0-b178
[2m[pandoc-lua-engine] [m include text-2.1.3-c691
[2m[pandoc-lua-engine] [m Text.Pandoc.Lua=pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4:Text.Pandoc.Lua
[2m[pandoc-lua-engine] [m unit pandoc-lua-engine-0.4.3-3LEmP89EEdjCRAN3LsL1y3-test-pandoc-lua-engine
[2m[pandoc-lua-engine] [m include base-4.20.2.0-64da
[2m[pandoc-lua-engine] [m include bytestring-0.12.2.0-262e
[2m[pandoc-lua-engine] [m include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
[2m[pandoc-lua-engine] [m include directory-1.3.8.5-c84a
[2m[pandoc-lua-engine] [m include exceptions-0.10.9-1a12
[2m[pandoc-lua-engine] [m include filepath-1.5.4.0-e600
[2m[pandoc-lua-engine] [m include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
[2m[pandoc-lua-engine] [m include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
[2m[pandoc-lua-engine] [m include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
[2m[pandoc-lua-engine] [m include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
[2m[pandoc-lua-engine] [m include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
[2m[pandoc-lua-engine] [m include tasty-golden-2.3.5-3QQ0reIfFJ36gfVIlepFcf
[2m[pandoc-lua-engine] [m include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
[2m[pandoc-lua-engine] [m include tasty-lua-1.1.2-1O8o765OPu9IHWrmpruNIo
[2m[pandoc-lua-engine] [m include text-2.1.3-c691
[2m[pandoc-lua-engine] [mReady component graph:
[2m[pandoc-lua-engine] [m definite pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
[2m[pandoc-lua-engine] [m depends aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
[2m[pandoc-lua-engine] [m depends base-4.20.2.0-64da
[2m[pandoc-lua-engine] [m depends bytestring-0.12.2.0-262e
[2m[pandoc-lua-engine] [m depends citeproc-0.9.0.1-8eZIkwGUgwZIclKUEeSqkh
[2m[pandoc-lua-engine] [m depends containers-0.7-504a
[2m[pandoc-lua-engine] [m depends crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
[2m[pandoc-lua-engine] [m depends data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
[2m[pandoc-lua-engine] [m depends doclayout-0.5.0.1-ETXOcBr0tml6gEsSGXL6oV
[2m[pandoc-lua-engine] [m depends doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
[2m[pandoc-lua-engine] [m depends exceptions-0.10.9-1a12
[2m[pandoc-lua-engine] [m depends hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
[2m[pandoc-lua-engine] [m depends hslua-module-doclayout-1.2.0.1-ErY6mbvHQgAEdxA7VP30qJ
[2m[pandoc-lua-engine] [m depends hslua-module-path-1.1.1-u1nrCdvNoJBLk9wjMCk0d
[2m[pandoc-lua-engine] [m depends hslua-module-system-1.1.3-C64Ey1CTges1ct5bp4x6FI
[2m[pandoc-lua-engine] [m depends hslua-module-text-1.1.1-KHVA6Tk8C366LjT6lG2vsI
[2m[pandoc-lua-engine] [m depends hslua-module-version-1.1.1-31iUzkcfJgL8o5QdosdhcV
[2m[pandoc-lua-engine] [m depends hslua-module-zip-1.1.4-7o7wUu0Aa5uJq1MktjFd3a
[2m[pandoc-lua-engine] [m depends hslua-repl-0.1.2-Juvw7nYrTHo9eZBtoxILD7
[2m[pandoc-lua-engine] [m depends lpeg-1.1.0-84tlw7PTtFB7quUkAvIAre
[2m[pandoc-lua-engine] [m depends mtl-2.3.1-b4af
[2m[pandoc-lua-engine] [m depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
[2m[vector] [m mut_iforM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m Data.Vector.Storable.Vector (Double)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m depends pandoc-lua-marshal-0.3.1-CEai8TZ59D36cGPSocsWLC
[2m[pandoc-lua-engine] [m depends pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
[2m[pandoc-lua-engine] [m depends parsec-3.1.18.0-b178
[2m[pandoc-lua-engine] [m depends text-2.1.3-c691
[2m[pandoc-lua-engine] [m definite pandoc-lua-engine-0.4.3-3LEmP89EEdjCRAN3LsL1y3-test-pandoc-lua-engine
[2m[pandoc-lua-engine] [m depends base-4.20.2.0-64da
[2m[pandoc-lua-engine] [m depends bytestring-0.12.2.0-262e
[2m[pandoc-lua-engine] [m depends data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
[2m[pandoc-lua-engine] [m depends directory-1.3.8.5-c84a
[2m[pandoc-lua-engine] [m depends exceptions-0.10.9-1a12
[2m[pandoc-lua-engine] [m depends filepath-1.5.4.0-e600
[2m[pandoc-lua-engine] [m depends hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
[2m[pandoc-lua-engine] [m depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
[2m[pandoc-lua-engine] [m depends pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
[2m[pandoc-lua-engine] [m depends pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
[2m[pandoc-lua-engine] [m depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
[2m[pandoc-lua-engine] [m depends tasty-golden-2.3.5-3QQ0reIfFJ36gfVIlepFcf
[2m[pandoc-lua-engine] [m depends tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
[2m[pandoc-lua-engine] [m depends tasty-lua-1.1.2-1O8o765OPu9IHWrmpruNIo
[2m[pandoc-lua-engine] [m depends text-2.1.3-c691
[2m[pandoc-lua-engine] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[pandoc-lua-engine] [mUsing compiler: ghc-9.10.3
[2m[pandoc-lua-engine] [mUsing install prefix:
[2m[pandoc-lua-engine] [m/nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3
[2m[pandoc-lua-engine] [mExecutables installed in:
[2m[pandoc-lua-engine] [m/nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/bin
[2m[pandoc-lua-engine] [mLibraries installed in:
[2m[pandoc-lua-engine] [m/nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
[2m[pandoc-lua-engine] [mDynamic Libraries installed in:
[2m[pandoc-lua-engine] [m/nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
[2m[pandoc-lua-engine] [mPrivate executables installed in:
[2m[pandoc-lua-engine] [m/nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/libexec/x86_64-linux-ghc-9.10.3-05f6/pandoc-lua-engine-0.4.3
[2m[pandoc-lua-engine] [mData files installed in:
[2m[pandoc-lua-engine] [m/nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/share/x86_64-linux-ghc-9.10.3-05f6/pandoc-lua-engine-0.4.3
[2m[pandoc-lua-engine] [mDocumentation installed in:
[2m[pandoc-lua-engine] [m/nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc/share/doc/pandoc-lua-engine-0.4.3
[2m[pandoc-lua-engine] [mConfiguration files installed in:
[2m[pandoc-lua-engine] [m/nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/etc
[2m[pandoc-lua-engine] [mNo alex found
[2m[pandoc-lua-engine] [mUsing ar found on system at:
[2m[pandoc-lua-engine] [m/nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
[2m[pandoc-lua-engine] [mNo c2hs found
[2m[pandoc-lua-engine] [mNo cpphs found
[2m[pandoc-lua-engine] [mNo doctest found
[2m[pandoc-lua-engine] [mUsing gcc version 14.3.0 given by user at:
[2m[pandoc-lua-engine] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
[2m[pandoc-lua-engine] [mUsing ghc version 9.10.3 found on system at:
[2m[pandoc-lua-engine] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
[2m[pandoc-lua-engine] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[pandoc-lua-engine] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
[2m[pandoc-lua-engine] [mNo ghcjs found
[2m[pandoc-lua-engine] [mNo ghcjs-pkg found
[2m[pandoc-lua-engine] [mNo greencard found
[2m[pandoc-lua-engine] [mUsing haddock version 2.31.1 found on system at:
[2m[pandoc-lua-engine] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
[2m[pandoc-lua-engine] [mNo happy found
[2m[pandoc-lua-engine] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[pandoc-lua-engine] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[pandoc-lua-engine] [mNo hmake found
[2m[pandoc-lua-engine] [mUsing hpc version 0.69 found on system at:
[2m[pandoc-lua-engine] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[pandoc-lua-engine] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[pandoc-lua-engine] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[pandoc-lua-engine] [mUsing hscolour version 1.25 found on system at:
[2m[pandoc-lua-engine] [m/nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
[2m[pandoc-lua-engine] [mNo jhc found
[2m[pandoc-lua-engine] [mUsing ld found on system at:
[2m[pandoc-lua-engine] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
[2m[pandoc-lua-engine] [mNo pkg-config found
[2m[pandoc-lua-engine] [mUsing runghc version 9.10.3 found on system at:
[2m[pandoc-lua-engine] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
[2m[pandoc-lua-engine] [mUsing strip version 2.44 found on system at:
[2m[pandoc-lua-engine] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
[2m[pandoc-lua-engine] [mUsing tar found on system at:
[2m[pandoc-lua-engine] [m/nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
[2m[pandoc-lua-engine] [mNo uhc found
[2m[vector] [m iterateNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.05s)
[2m[pandoc-server] [mDependency aeson >=2.0 && <2.3: using aeson-2.2.3.0
[2m[pandoc-server] [mDependency base >=4.12 && <5: using base-4.20.2.0
[2m[pandoc-server] [mDependency base64-bytestring >=0.1 && <1.3: using base64-bytestring-1.2.1.0
[2m[pandoc-server] [mDependency bytestring >=0.9 && <0.13: using bytestring-0.12.2.0
[2m[pandoc-server] [mDependency containers >=0.6.0.1 && <0.9: using containers-0.7
[2m[pandoc-server] [mDependency data-default >=0.4 && <0.9: using data-default-0.8.0.1
[2m[pandoc-server] [mDependency doctemplates >=0.11 && <0.12: using doctemplates-0.11.0.1
[2m[pandoc-server] [mDependency pandoc >=3.5 && <3.8: using pandoc-3.7.0.2
[2m[pandoc-server] [mDependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
[2m[pandoc-server] [mDependency servant-server >=0.19 && <0.21: using servant-server-0.20.3.0
[2m[pandoc-server] [mDependency skylighting >=0.13 && <0.15: using skylighting-0.14.7
[2m[pandoc-server] [mDependency text >=1.1.1.0 && <2.2: using text-2.1.3
[2m[pandoc-server] [mDependency unicode-collation >=0.1.1 && <0.2: using unicode-collation-0.1.3.6
[2m[pandoc-server] [mDependency wai >=3.2 && <3.3: using wai-3.2.4
[2m[pandoc-server] [mDependency wai-cors >=0.2.7 && <0.3: using wai-cors-0.2.7
[2m[pandoc-server] [mSource component graph: component lib
[2m[pandoc-server] [mConfigured component graph:
[2m[pandoc-server] [m component pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
[2m[pandoc-server] [m include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
[2m[pandoc-server] [m include base-4.20.2.0-64da
[2m[pandoc-server] [m include base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
[2m[pandoc-server] [m include bytestring-0.12.2.0-262e
[2m[pandoc-server] [m include containers-0.7-504a
[2m[pandoc-server] [m include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
[2m[pandoc-server] [m include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
[2m[pandoc-server] [m include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
[2m[pandoc-server] [m include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
[2m[pandoc-server] [m include servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
[2m[pandoc-server] [m include skylighting-0.14.7-E1NlMTbMaxi21IaCy26ZSc
[2m[pandoc-server] [m include text-2.1.3-c691
[2m[pandoc-server] [m include unicode-collation-0.1.3.6-GNgjxqiCGZCDNShq4d28XS
[2m[pandoc-server] [m include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
[2m[pandoc-server] [m include wai-cors-0.2.7-LUOr3sfxSGX6rgruuv5vs2
[2m[pandoc-server] [mLinked component graph:
[2m[pandoc-server] [m unit pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
[2m[pandoc-server] [m include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
[2m[pandoc-server] [m include base-4.20.2.0-64da
[2m[pandoc-server] [m include base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
[2m[pandoc-server] [m include bytestring-0.12.2.0-262e
[2m[pandoc-server] [m include containers-0.7-504a
[2m[pandoc-server] [m include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
[2m[pandoc-server] [m include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
[2m[pandoc-server] [m include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
[2m[pandoc-server] [m include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
[2m[pandoc-server] [m include servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
[2m[pandoc-server] [m include skylighting-0.14.7-E1NlMTbMaxi21IaCy26ZSc
[2m[pandoc-server] [m include text-2.1.3-c691
[2m[pandoc-server] [m include unicode-collation-0.1.3.6-GNgjxqiCGZCDNShq4d28XS
[2m[pandoc-server] [m include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
[2m[pandoc-server] [m include wai-cors-0.2.7-LUOr3sfxSGX6rgruuv5vs2
[2m[pandoc-server] [m Text.Pandoc.Server=pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM:Text.Pandoc.Server
[2m[pandoc-server] [mReady component graph:
[2m[pandoc-server] [m definite pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
[2m[pandoc-server] [m depends aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
[2m[pandoc-server] [m depends base-4.20.2.0-64da
[2m[pandoc-server] [m depends base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
[2m[pandoc-server] [m depends bytestring-0.12.2.0-262e
[2m[pandoc-server] [m depends containers-0.7-504a
[2m[pandoc-server] [m depends data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
[2m[pandoc-server] [m depends doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
[2m[pandoc-server] [m depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
[2m[pandoc-server] [m depends pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
[2m[pandoc-server] [m depends servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
[2m[pandoc-server] [m depends skylighting-0.14.7-E1NlMTbMaxi21IaCy26ZSc
[2m[pandoc-server] [m depends text-2.1.3-c691
[2m[pandoc-server] [m depends unicode-collation-0.1.3.6-GNgjxqiCGZCDNShq4d28XS
[2m[pandoc-server] [m depends wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
[2m[pandoc-server] [m depends wai-cors-0.2.7-LUOr3sfxSGX6rgruuv5vs2
[2m[pandoc-server] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[pandoc-server] [mUsing compiler: ghc-9.10.3
[2m[pandoc-server] [mUsing install prefix:
[2m[pandoc-server] [m/nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
[2m[pandoc-server] [mExecutables installed in:
[2m[pandoc-server] [m/nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/bin
[2m[pandoc-server] [mLibraries installed in:
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-server] [m/nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
[2m[pandoc-server] [mDynamic Libraries installed in:
[2m[pandoc-server] [m/nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
[2m[pandoc-server] [mPrivate executables installed in:
[2m[pandoc-server] [m/nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/libexec/x86_64-linux-ghc-9.10.3-05f6/pandoc-server-0.1.0.11
[2m[pandoc-server] [mData files installed in:
[2m[pandoc-server] [m/nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/share/x86_64-linux-ghc-9.10.3-05f6/pandoc-server-0.1.0.11
[2m[pandoc-server] [mDocumentation installed in:
[2m[pandoc-server] [m/nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc/share/doc/pandoc-server-0.1.0.11
[2m[pandoc-server] [mConfiguration files installed in:
[2m[pandoc-server] [m/nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/etc
[2m[pandoc-server] [mNo alex found
[2m[pandoc-server] [mUsing ar found on system at:
[2m[pandoc-server] [m/nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
[2m[pandoc-server] [mNo c2hs found
[2m[pandoc-server] [mNo cpphs found
[2m[pandoc-server] [mNo doctest found
[2m[pandoc-server] [mUsing gcc version 14.3.0 given by user at:
[2m[pandoc-server] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
[2m[pandoc-server] [mUsing ghc version 9.10.3 found on system at:
[2m[pandoc-server] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
[2m[pandoc-server] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[pandoc-server] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
[2m[pandoc-server] [mNo ghcjs found
[2m[pandoc-server] [mNo ghcjs-pkg found
[2m[pandoc-server] [mNo greencard found
[2m[pandoc-server] [mUsing haddock version 2.31.1 found on system at:
[2m[pandoc-server] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
[2m[pandoc-server] [mNo happy found
[2m[pandoc-server] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[pandoc-server] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[pandoc-server] [mNo hmake found
[2m[pandoc-server] [mUsing hpc version 0.69 found on system at:
[2m[pandoc-server] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[pandoc-server] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[pandoc-server] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[pandoc-server] [mUsing hscolour version 1.25 found on system at:
[2m[pandoc-server] [m/nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
[2m[pandoc-server] [mNo jhc found
[2m[pandoc-server] [mUsing ld found on system at:
[2m[pandoc-server] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
[2m[pandoc-server] [mNo pkg-config found
[2m[pandoc-server] [mUsing runghc version 9.10.3 found on system at:
[2m[pandoc-server] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
[2m[pandoc-server] [mUsing strip version 2.44 found on system at:
[2m[pandoc-server] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
[2m[pandoc-server] [mUsing tar found on system at:
[2m[pandoc-server] [m/nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
[2m[pandoc-server] [mNo uhc found
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m foldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m ifoldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[1;36mPhase: buildPhase[m
[2m[vector] [m ifoldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [mPreprocessing library for pandoc-lua-engine-0.4.3...
[2m[vector] [m prescanl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [mBuilding library for pandoc-lua-engine-0.4.3...
[2m[vector] [m postscanl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-server] [m[1;36mPhase: buildPhase[m
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-server] [mPreprocessing library for pandoc-server-0.1.0.11...
[2m[pandoc-server] [mBuilding library for pandoc-server-0.1.0.11...
[2m[vector] [m mut_mapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
[2m[vector] [m mut_imapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-server] [m[1 of 1] Compiling Text.Pandoc.Server
[2m[vector] [m mut_forM_: OK (0.06s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.07s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 1 discarded.
[2m[vector] [m unstream
[2m[vector] [m unstream == vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream == vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Tests.Vector.Strict
[2m[vector] [m Bool
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 25 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m fmap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m return: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m bind: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m munzip: OK
[2m[pandoc-lua-engine] [m[ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
[2m[pandoc-lua-engine] [m[ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
[2m[pandoc-lua-engine] [m[ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
[2m[pandoc-lua-engine] [m[ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
[2m[pandoc-lua-engine] [m[ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
[2m[pandoc-lua-engine] [m[ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
[2m[pandoc-lua-engine] [m[ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
[2m[pandoc-lua-engine] [m[ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
[2m[pandoc-lua-engine] [m[10 of 39] Compiling Text.Pandoc.Lua.PandocLua
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_pure: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_appl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m and: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Int
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[pandoc-lua-engine] [m[11 of 39] Compiling Text.Pandoc.Lua.Module.Types
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[12 of 39] Compiling Text.Pandoc.Lua.Module.Text
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
[2m[vector] [m imapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 25 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m fmap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m return: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m bind: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m munzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_pure: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m applicative_appl: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m alternative_or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sequence_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m unstream
[2m[vector] [m unstream == vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream == vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Tests.Vector.Unboxed
[2m[vector] [m ()
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[pandoc-lua-engine] [m[14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
[2m[pandoc-lua-engine] [m[15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
[2m[pandoc-lua-engine] [m[16 of 39] Compiling Text.Pandoc.Lua.Module.Template
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m (Bool)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[pandoc-lua-engine] [m[17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
[2m[pandoc-lua-engine] [m[18 of 39] Compiling Text.Pandoc.Lua.Module.Format
[2m[pandoc-lua-engine] [m[19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 24 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m and: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m or: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m (Int)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
[2m[vector] [m ifoldM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 25 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 10 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m (Float)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldr: OK
[2m[pandoc-lua-engine] [m[21 of 39] Compiling Text.Pandoc.Lua.Module.Image
[2m[pandoc-lua-engine] [m[22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
[2m[pandoc-lua-engine] [m[23 of 39] Compiling Text.Pandoc.Lua.Orphans
[2m[pandoc-lua-engine] [m[24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
[2m[pandoc-lua-engine] [m[25 of 39] Compiling Text.Pandoc.Lua.Global
[2m[pandoc-lua-engine] [m[26 of 39] Compiling Text.Pandoc.Lua.Filter
[2m[pandoc-lua-engine] [m[27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
[2m[pandoc-lua-engine] [m[28 of 39] Compiling Text.Pandoc.Lua.SourcePos
[2m[pandoc-lua-engine] [m[29 of 39] Compiling Text.Pandoc.Lua.Module.Log
[2m[pandoc-lua-engine] [m[30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
[2m[pandoc-lua-engine] [m[31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests; 2 discarded.
[2m[vector] [m (Double)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[pandoc-server] [m[1 of 1] Compiling Text.Pandoc.Server
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m foldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m foldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m ifoldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
[2m[pandoc-lua-engine] [m[33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
[2m[pandoc-lua-engine] [m[34 of 39] Compiling Text.Pandoc.Lua.Module
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[pandoc-lua-engine] [m[35 of 39] Compiling Text.Pandoc.Lua.Init
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[36 of 39] Compiling Text.Pandoc.Lua.Run
[2m[vector] [m mut_imapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[37 of 39] Compiling Text.Pandoc.Lua.Custom
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m sum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m product: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m enumFromThenTo: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m (Int,Bool)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[38 of 39] Compiling Text.Pandoc.Lua.Engine
[2m[vector] [m generateM: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[39 of 39] Compiling Text.Pandoc.Lua
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.06s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldr: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m (Int,Bool,Int)
[2m[vector] [m fromList.toList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m toList.fromList == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream.stream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m stream.unstream == id: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m eq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m length: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m null: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m index: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m safeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m head: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m last: OK
[2m[vector] [m +++ OK, passed 100 tests; 25 discarded.
[2m[vector] [m unsafeIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m unsafeHead: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m unsafeLast: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m slice: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m init: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m tail: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m take: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m drop: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m splitAt: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m empty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m singleton: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iterateNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m replicateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m create: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m createT: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrNM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unfoldrExactNM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m constructrN: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m cons: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m snoc: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m append: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concat: OK (0.07s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m force: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m upd: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m accum: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m reverse: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m backpermute: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
[2m[vector] [m map: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imap: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m concatMap: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m forM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWith3: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWith3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m izipWithM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zipWithM_: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifilter: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m filterM: OK (0.09s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m uniq: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m imapMaybe: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m takeWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m dropWhile: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partition: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m partitionWith: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m span: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m break: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m spanR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m breakR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m groupBy: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m notElem: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m find: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndexR: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m findIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndex: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m elemIndices: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1: OK
[2m[vector] [m +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldl1': OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1: OK
[2m[vector] [m +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m foldr1': OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldl': OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM_: OK (0.08s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m ifoldM'_: OK (0.06s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m all: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m any: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanl1': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanl': OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m prescanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m postscanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m scanr1': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr: OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m iscanr': OK (0.01s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_read: OK
[2m[vector] [m +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m mut_write: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m mut_modify: OK
[2m[vector] [m +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m mut_generate: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_generateM: OK (0.02s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_mapM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_imapM_: OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_forM_: OK (0.05s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_iforM_: OK (0.04s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldr': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldl: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[pandoc-lua-engine] [m[ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
[2m[pandoc-lua-engine] [m[ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
[2m[pandoc-lua-engine] [m[ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
[2m[pandoc-lua-engine] [m[ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
[2m[pandoc-lua-engine] [m[ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
[2m[pandoc-lua-engine] [m[ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
[2m[pandoc-lua-engine] [m[ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
[2m[pandoc-lua-engine] [m[ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
[2m[pandoc-lua-engine] [m[10 of 39] Compiling Text.Pandoc.Lua.PandocLua
[2m[vector] [m mut_ifoldl': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_foldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mut_ifoldrM': OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m compare: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m maximum: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m minimum: OK
[2m[vector] [m +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m minIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m maxIndex: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maximumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m minimumBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m maximumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m minimumOn: OK
[2m[vector] [m +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m maxIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m minIndexBy: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m ListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m FalseListFirstMaxIndexWins: OK
[2m[vector] [m +++ OK, failed as expected. (after 1 test):
[2m[vector] [m Exception:
[2m[vector] [m Prelude.foldr1: empty list
[2m[vector] [m CallStack (from HasCallStack):
[2m[vector] [m error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
[2m[vector] [m errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
[2m[vector] [m foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m []
[2m[vector] [m zip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m zip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unzip3: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m indexed: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m update: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mempty: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mappend: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m mconcat: OK (0.06s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m glength: OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream
[2m[vector] [m unstream == vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstream == vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (exact): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m unstreamR ~= vunstream (unknown): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Data.Vector.Storable.Vector Alignment
[2m[vector] [m Aligned Double: OK
[2m[vector] [m Aligned Int: OK
[2m[vector] [m Regression tests
[2m[vector] [m enumFromTo crash #188
[2m[vector] [m Word8: OK
[2m[vector] [m Word16: OK
[2m[vector] [m Word32: OK
[2m[vector] [m Word64: OK
[2m[vector] [m Word: OK
[2m[vector] [m Int8: OK
[2m[vector] [m Int16: OK
[2m[vector] [m Int32: OK
[2m[vector] [m Int64: OK
[2m[vector] [m Int: OK
[2m[vector] [m Char: OK
[2m[vector] [m Negative tests
[2m[vector] [m slice out of bounds #257
[2m[vector] [m Boxed
[2m[vector] [m Negative ix: OK
[2m[vector] [m Negative size: OK
[2m[vector] [m Negative ix and size: OK
[2m[vector] [m Too large ix: OK
[2m[vector] [m Too large size: OK
[2m[vector] [m Too large ix and size: OK
[2m[vector] [m Overflow: OK
[2m[vector] [m OutOfMemory: OK
[2m[vector] [m Primitive
[2m[vector] [m Negative ix: OK
[2m[vector] [m Negative size: OK
[2m[vector] [m Negative ix and size: OK
[2m[vector] [m Too large ix: OK
[2m[vector] [m Too large size: OK
[2m[vector] [m Too large ix and size: OK
[2m[vector] [m Overflow: OK
[2m[vector] [m OutOfMemory: OK
[2m[vector] [m Storable
[2m[vector] [m Negative ix: OK
[2m[vector] [m Negative size: OK
[2m[vector] [m Negative ix and size: OK
[2m[vector] [m Too large ix: OK
[2m[vector] [m Too large size: OK
[2m[vector] [m Too large ix and size: OK
[2m[vector] [m Overflow: OK
[2m[vector] [m OutOfMemory: OK
[2m[vector] [m Unboxed
[2m[vector] [m Negative ix: OK
[2m[vector] [m Negative size: OK
[2m[vector] [m Negative ix and size: OK
[2m[vector] [m Too large ix: OK
[2m[vector] [m Too large size: OK
[2m[vector] [m Too large ix and size: OK
[2m[vector] [m Overflow: OK
[2m[vector] [m OutOfMemory: OK
[2m[vector] [m take #282
[2m[vector] [m Boxed: OK
[2m[vector] [m Primitive: OK
[2m[vector] [m Storable: OK
[2m[vector] [m Unboxed: OK
[2m[vector] [m Data.Vector
[2m[vector] [m MonadFix: OK
[2m[vector] [m toFromArray: OK
[2m[vector] [m toFromArraySlice: OK
[2m[vector] [m toFromArraySliceUnsafe: OK
[2m[vector] [m toFromMutableArray: OK
[2m[vector] [m Data.Vector.Mutable (Move): OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m Data.Vector.Primitive.Mutable (Move): OK
[2m[vector] [m +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m Data.Vector.Unboxed.Mutable (Move): OK
[2m[vector] [m +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m Data.Vector.Storable.Mutable (Move): OK
[2m[vector] [m +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m Data.Vector.Generic.Mutable (nextPermutation): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Data.Vector.Generic.Mutable (prevPermutation): OK (0.03s)
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
[2m[vector] [m +++ OK, passed 100 tests.
[2m[vector] [m
[2m[vector] [mAll 2808 tests passed (15.81s)
[2m[vector] [mTest suite vector-tests-O2: PASS
[2m[vector] [mTest suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
[2m[vector] [m2 of 2 test suites (2 of 2 test cases) passed.
[2m[vector] [mcheckPhase completed in 1 minutes 49 seconds
[2m[vector] [m[1;36mPhase: haddockPhase[m
[2m[vector] [m[1;36mPhase: installPhase[m
[2m[vector] [mInstalling library in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
[2m[pandoc-lua-engine] [m[11 of 39] Compiling Text.Pandoc.Lua.Module.Types
[2m[pandoc-lua-engine] [m[12 of 39] Compiling Text.Pandoc.Lua.Module.Text
[2m[pandoc-lua-engine] [m[13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
[2m[pandoc-lua-engine] [m[14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
[2m[pandoc-lua-engine] [m[15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
[2m[pandoc-lua-engine] [m[16 of 39] Compiling Text.Pandoc.Lua.Module.Template
[2m[vector] [mInstalling internal library benchmarks-O2 in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/vector-0.13.2.0-8ewGTjYPAbxD2TcU88MBz1-benchmarks-O2
[2m[pandoc-lua-engine] [m[17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
[2m[pandoc-lua-engine] [m[18 of 39] Compiling Text.Pandoc.Lua.Module.Format
[2m[pandoc-lua-engine] [m[19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
[2m[vector] [m[1;36mPhase: fixupPhase[m
[2m[vector] [mshrinking RPATHs of ELF executables and libraries in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0
[2m[vector] [mshrinking /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSvector-0.13.2.0-F7uk3pysgNW73MNfNvohpp-ghc9.8.4.so
[2m[vector] [mshrinking /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSvector-0.13.2.0-8ewGTjYPAbxD2TcU88MBz1-benchmarks-O2-ghc9.8.4.so
[2m[vector] [mchecking for references to /build/ in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0...
[2m[vector] [mpatching script interpreter paths in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0
[2m[vector] [mstripping (with command strip and flags -S -p) in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib
[2m[pandoc-lua-engine] [m[20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
[2m[vector:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0[m
[2m[vector:post-build] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[vector:post-build] [m[2mUploading to the NixCI cache: /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0[m
[2m[vector:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[vector:post-build] [m[2mcopying 1 paths...[m
[2m[vector:post-build] [m[2mcopying path '/nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0' to 'https://cache.nix-ci.com'...[m
[2m[vector:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[vector:post-build] [m[2mcopying 0 paths...[m
[2mProgress: 23 of 38 built (2 building), 559 of 559 downloaded from cache[m
[1;34mBuilding /nix/store/kpynsivk6619d2xvq96g6bqk5vmphbas-nothunks-0.3.1.drv[m
[2m[pandoc-lua-engine] [m[21 of 39] Compiling Text.Pandoc.Lua.Module.Image
[2m[pandoc-lua-engine] [m[22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
[2m[pandoc-lua-engine] [m[23 of 39] Compiling Text.Pandoc.Lua.Orphans
[2m[pandoc-lua-engine] [m[24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
[2m[pandoc-lua-engine] [m[25 of 39] Compiling Text.Pandoc.Lua.Global
[2m[pandoc-lua-engine] [m[26 of 39] Compiling Text.Pandoc.Lua.Filter
[2m[pandoc-lua-engine] [m[27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
[2m[pandoc-lua-engine] [m[28 of 39] Compiling Text.Pandoc.Lua.SourcePos
[2m[pandoc-lua-engine] [m[29 of 39] Compiling Text.Pandoc.Lua.Module.Log
[2m[pandoc-lua-engine] [m[30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
[2m[pandoc-lua-engine] [m[31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
[2m[pandoc-lua-engine] [m[32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
[2m[pandoc-lua-engine] [m[33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
[2m[pandoc-lua-engine] [m[34 of 39] Compiling Text.Pandoc.Lua.Module
[2m[pandoc-lua-engine] [m[35 of 39] Compiling Text.Pandoc.Lua.Init
[2m[pandoc-lua-engine] [m[36 of 39] Compiling Text.Pandoc.Lua.Run
[2m[pandoc-lua-engine] [m[37 of 39] Compiling Text.Pandoc.Lua.Custom
[2m[pandoc-lua-engine] [m[38 of 39] Compiling Text.Pandoc.Lua.Engine
[2m[pandoc-lua-engine] [m[39 of 39] Compiling Text.Pandoc.Lua
[2m[pandoc-lua-engine] [mPreprocessing test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
[2m[pandoc-lua-engine] [mBuilding test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
[2m[pandoc-lua-engine] [m[1 of 5] Compiling Tests.Lua
[2m[pandoc-lua-engine] [m[2 of 5] Compiling Tests.Lua.Module
[2m[pandoc-lua-engine] [m[3 of 5] Compiling Tests.Lua.Reader
[2m[pandoc-lua-engine] [m[4 of 5] Compiling Tests.Lua.Writer
[2m[pandoc-lua-engine] [m[5 of 5] Compiling Main
[2m[pandoc-lua-engine] [m[6 of 6] Linking dist/build/test-pandoc-lua-engine/test-pandoc-lua-engine
[2m[pandoc-server] [m[1;36mPhase: checkPhase[m
[2m[pandoc-server] [mPackage has no test suites.
[2m[pandoc-server] [m[1;36mPhase: haddockPhase[m
[2m[pandoc-server] [mPreprocessing library for pandoc-server-0.1.0.11...
[2m[pandoc-server] [mRunning Haddock on library for pandoc-server-0.1.0.11...
[2m[pandoc-server] [mWarning: The documentation for the following packages are not installed. No
[2m[pandoc-server] [mlinks will be generated to these packages: attoparsec-0.14.4,
[2m[pandoc-server] [mattoparsec-0.14.4, libyaml-clib-0.2.5, pandoc-3.7.0.2, pandoc-3.7.0.2,
[2m[pandoc-server] [mvector-0.13.2.0
[2m[pandoc-server] [m[1 of 1] Compiling Text.Pandoc.Server
[2m[pandoc-server] [mHaddock coverage:
[2m[pandoc-server] [m 0% ( 0 / 7) in 'Text.Pandoc.Server'
[2m[pandoc-server] [m Missing documentation for:
[2m[pandoc-server] [m Module header
[2m[pandoc-server] [m app (src/Text/Pandoc/Server.hs:200)
[2m[pandoc-server] [m API (src/Text/Pandoc/Server.hs:186)
[2m[pandoc-server] [m ServerOpts (src/Text/Pandoc/Server.hs:55)
[2m[pandoc-server] [m Params (src/Text/Pandoc/Server.hs:125)
[2m[pandoc-server] [m Blob (src/Text/Pandoc/Server.hs:112)
[2m[pandoc-server] [m parseServerOptsFromArgs (src/Text/Pandoc/Server.hs:99)
[2m[pandoc-server] [mWarning: Text.Pandoc.Server: could not find link destinations for:
[2m[pandoc-server] [m - Text.Pandoc.App.Opt.Opt
[2m[pandoc-server] [m - Text.Pandoc.Server.Output
[2m[nothunks] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[nothunks] [mBuild with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
[2m[nothunks] [m[1;36mPhase: unpackPhase[m
[2m[nothunks] [munpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
[2m[nothunks] [msource root is nothunks-0.3.1
[2m[nothunks] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
[2m[nothunks] [m[1;36mPhase: patchPhase[m
[2m[nothunks] [mReplace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
[2m[nothunks] [mRun jailbreak-cabal to lift version restrictions on build inputs.
[2m[nothunks] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[nothunks] [msetupCompileFlags: -package-db=/build/tmp.35XporISMq/setup-package.conf.d -threaded
[2m[nothunks] [m[1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.35XporISMq/Main.o )
[2m[nothunks] [m[2 of 2] Linking Setup
[2m[nothunks] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[nothunks] [m[1;36mPhase: configurePhase[m
[2m[nothunks] [mconfigureFlags: --verbose --prefix=/nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.35XporISMq/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
[2m[nothunks] [mUsing Parsec parser
[2m[nothunks] [mConfiguring nothunks-0.3.1...
[2m[nothunks] [mFlags chosen: bytestring=True, text=True, vector=True
[2m[nothunks] [mDependency base: using base-4.19.2.0
[2m[nothunks] [mDependency bytestring >=0.10 && <0.13: using bytestring-0.12.1.0
[2m[nothunks] [mDependency containers: using containers-0.6.8
[2m[nothunks] [mDependency ghc-heap: using ghc-heap-9.8.4
[2m[nothunks] [mDependency stm: using stm-2.5.3.1
[2m[nothunks] [mDependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.1
[2m[nothunks] [mDependency time: using time-1.12.2
[2m[nothunks] [mDependency vector >=0.12 && <0.14: using vector-0.13.2.0
[2m[nothunks] [mDependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
[2m[nothunks] [mDependency base: using base-4.19.2.0
[2m[nothunks] [mDependency containers: using containers-0.6.8
[2m[nothunks] [mDependency ghc-prim: using ghc-prim-0.11.0
[2m[nothunks] [mDependency hedgehog: using hedgehog-1.5
[2m[nothunks] [mDependency nothunks: using nothunks-0.3.1
[2m[nothunks] [mDependency random: using random-1.2.1.3
[2m[nothunks] [mDependency stm: using stm-2.5.3.1
[2m[nothunks] [mDependency tasty: using tasty-1.5.3
[2m[nothunks] [mDependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
[2m[nothunks] [mSource component graph:
[2m[nothunks] [m component lib
[2m[nothunks] [m component test:nothunks-test dependency lib
[2m[nothunks] [mConfigured component graph:
[2m[nothunks] [m component nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
[2m[nothunks] [m include base-4.19.2.0-8274
[2m[nothunks] [m include bytestring-0.12.1.0-b028
[2m[nothunks] [m include containers-0.6.8-15d9
[2m[nothunks] [m include ghc-heap-9.8.4-88b3
[2m[nothunks] [m include stm-2.5.3.1-4dae
[2m[nothunks] [m include text-2.1.1-5314
[2m[nothunks] [m include time-1.12.2-b11c
[2m[nothunks] [m include vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
[2m[nothunks] [m include wherefrom-compat-0.1.1.1-B8a6B2BvUCzGz8OFtoo8AO
[2m[nothunks] [m component nothunks-0.3.1-8INgIczvs3nGsVHBs6bUjZ-nothunks-test
[2m[nothunks] [m include base-4.19.2.0-8274
[2m[nothunks] [m include containers-0.6.8-15d9
[2m[nothunks] [m include ghc-prim-0.11.0-01ae
[2m[nothunks] [m include hedgehog-1.5-EdloAR8nvuADWiK72c4fzc
[2m[nothunks] [m include nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
[2m[nothunks] [m include random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
[2m[nothunks] [m include stm-2.5.3.1-4dae
[2m[nothunks] [m include tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
[2m[nothunks] [m include tasty-hedgehog-1.4.0.2-4SLwErL9Pq6G86T5KSGqTH
[2m[nothunks] [mLinked component graph:
[2m[nothunks] [m unit nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
[2m[nothunks] [m include base-4.19.2.0-8274
[2m[nothunks] [m include bytestring-0.12.1.0-b028
[2m[nothunks] [m include containers-0.6.8-15d9
[2m[nothunks] [m include ghc-heap-9.8.4-88b3
[2m[nothunks] [m include stm-2.5.3.1-4dae
[2m[nothunks] [m include text-2.1.1-5314
[2m[nothunks] [m include time-1.12.2-b11c
[2m[nothunks] [m include vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
[2m[nothunks] [m include wherefrom-compat-0.1.1.1-B8a6B2BvUCzGz8OFtoo8AO
[2m[nothunks] [m NoThunks.Class=nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So:NoThunks.Class
[2m[nothunks] [m unit nothunks-0.3.1-8INgIczvs3nGsVHBs6bUjZ-nothunks-test
[2m[nothunks] [m include base-4.19.2.0-8274
[2m[nothunks] [m include containers-0.6.8-15d9
[2m[nothunks] [m include ghc-prim-0.11.0-01ae
[2m[nothunks] [m include hedgehog-1.5-EdloAR8nvuADWiK72c4fzc
[2m[nothunks] [m include nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
[2m[nothunks] [m include random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
[2m[nothunks] [m include stm-2.5.3.1-4dae
[2m[nothunks] [m include tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
[2m[nothunks] [m include tasty-hedgehog-1.4.0.2-4SLwErL9Pq6G86T5KSGqTH
[2m[nothunks] [mReady component graph:
[2m[nothunks] [m definite nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
[2m[nothunks] [m depends base-4.19.2.0-8274
[2m[nothunks] [m depends bytestring-0.12.1.0-b028
[2m[nothunks] [m depends containers-0.6.8-15d9
[2m[nothunks] [m depends ghc-heap-9.8.4-88b3
[2m[nothunks] [m depends stm-2.5.3.1-4dae
[2m[nothunks] [m depends text-2.1.1-5314
[2m[nothunks] [m depends time-1.12.2-b11c
[2m[nothunks] [m depends vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
[2m[nothunks] [m depends wherefrom-compat-0.1.1.1-B8a6B2BvUCzGz8OFtoo8AO
[2m[nothunks] [m definite nothunks-0.3.1-8INgIczvs3nGsVHBs6bUjZ-nothunks-test
[2m[nothunks] [m depends base-4.19.2.0-8274
[2m[nothunks] [m depends containers-0.6.8-15d9
[2m[nothunks] [m depends ghc-prim-0.11.0-01ae
[2m[nothunks] [m depends hedgehog-1.5-EdloAR8nvuADWiK72c4fzc
[2m[nothunks] [m depends nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
[2m[nothunks] [m depends random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
[2m[nothunks] [m depends stm-2.5.3.1-4dae
[2m[nothunks] [m depends tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
[2m[nothunks] [m depends tasty-hedgehog-1.4.0.2-4SLwErL9Pq6G86T5KSGqTH
[2m[nothunks] [mUsing Cabal-3.10.3.0 compiled by ghc-9.8
[2m[nothunks] [mUsing compiler: ghc-9.8.4
[2m[nothunks] [mUsing install prefix:
[2m[nothunks] [m/nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1
[2m[nothunks] [mExecutables installed in:
[2m[nothunks] [m/nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/bin
[2m[nothunks] [mLibraries installed in:
[2m[nothunks] [m/nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
[2m[nothunks] [mDynamic Libraries installed in:
[2m[nothunks] [m/nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
[2m[nothunks] [mPrivate executables installed in:
[2m[nothunks] [m/nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.8.4/nothunks-0.3.1
[2m[nothunks] [mData files installed in:
[2m[nothunks] [m/nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/share/x86_64-linux-ghc-9.8.4/nothunks-0.3.1
[2m[nothunks] [mDocumentation installed in:
[2m[nothunks] [m/nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
[2m[nothunks] [mConfiguration files installed in:
[2m[nothunks] [m/nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/etc
[2m[nothunks] [mNo alex found
[2m[nothunks] [mUsing ar found on system at:
[2m[nothunks] [m/nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
[2m[nothunks] [mNo c2hs found
[2m[nothunks] [mNo cpphs found
[2m[nothunks] [mNo doctest found
[2m[nothunks] [mUsing gcc version 14.3.0 given by user at:
[2m[nothunks] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
[2m[nothunks] [mUsing ghc version 9.8.4 found on system at:
[2m[nothunks] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
[2m[nothunks] [mUsing ghc-pkg version 9.8.4 found on system at:
[2m[nothunks] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
[2m[nothunks] [mNo ghcjs found
[2m[nothunks] [mNo ghcjs-pkg found
[2m[nothunks] [mNo greencard found
[2m[nothunks] [mUsing haddock version 2.30.0 found on system at:
[2m[nothunks] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
[2m[nothunks] [mNo happy found
[2m[nothunks] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[nothunks] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[nothunks] [mNo hmake found
[2m[nothunks] [mUsing hpc version 0.69 found on system at:
[2m[nothunks] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
[2m[nothunks] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[nothunks] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
[2m[nothunks] [mUsing hscolour version 1.25 found on system at:
[2m[nothunks] [m/nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
[2m[nothunks] [mNo jhc found
[2m[nothunks] [mUsing ld found on system at:
[2m[nothunks] [m/nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
[2m[nothunks] [mNo pkg-config found
[2m[nothunks] [mUsing runghc version 9.8.4 found on system at:
[2m[nothunks] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
[2m[nothunks] [mUsing strip version 2.44 found on system at:
[2m[nothunks] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
[2m[nothunks] [mUsing tar found on system at:
[2m[nothunks] [m/nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
[2m[nothunks] [mNo uhc found
[2m[nothunks] [m[1;36mPhase: buildPhase[m
[2m[nothunks] [mPreprocessing library for nothunks-0.3.1..
[2m[nothunks] [mBuilding library for nothunks-0.3.1..
[2m[nothunks] [m[1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
[2m[pandoc-server] [mDocumentation created: dist/doc/html/pandoc-server/,
[2m[pandoc-server] [mdist/doc/html/pandoc-server/pandoc-server.txt
[2m[pandoc-server] [m[1;36mPhase: installPhase[m
[2m[pandoc-server] [mInstalling library in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
[2m[pandoc-server] [m[1;36mPhase: fixupPhase[m
[2m[pandoc-server] [mshrinking RPATHs of ELF executables and libraries in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
[2m[pandoc-server] [mshrinking /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSpandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM-ghc9.10.3.so
[2m[pandoc-server] [mchecking for references to /build/ in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11...
[2m[pandoc-server] [mpatching script interpreter paths in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
[2m[pandoc-server] [mstripping (with command strip and flags -S -p) in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib
[2m[pandoc-server] [mshrinking RPATHs of ELF executables and libraries in /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc
[2m[pandoc-server] [mchecking for references to /build/ in /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc...
[2m[pandoc-server] [mpatching script interpreter paths in /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc
[2m[pandoc-server:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11[m
[2m[pandoc-server:post-build] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[pandoc-server:post-build] [m[2mUploading to the NixCI cache: /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11[m
[2m[pandoc-server:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[pandoc-server:post-build] [m[2mcopying 1 paths...[m
[2m[pandoc-server:post-build] [m[2mcopying path '/nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11' to 'https://cache.nix-ci.com'...[m
[2m[pandoc-server:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[pandoc-server:post-build] [m[2mcopying 0 paths...[m
[2mProgress: 24 of 38 built (2 building), 559 of 559 downloaded from cache[m
[2m[nothunks] [m[1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
[2m[pandoc-lua-engine] [mbuildPhase completed in 47 seconds
[2m[pandoc-lua-engine] [m[1;36mPhase: checkPhase[m
[2m[pandoc-lua-engine] [mRunning 1 test suites...
[2m[pandoc-lua-engine] [mTest suite test-pandoc-lua-engine: RUNNING...
[2m[pandoc-lua-engine] [mpandoc Lua engine
[2m[pandoc-lua-engine] [m Lua filters
[2m[pandoc-lua-engine] [m macro expansion via filter: OK (0.01s)
[2m[pandoc-lua-engine] [m convert all plains to paras: OK
[2m[pandoc-lua-engine] [m convert display math to inline math: OK (0.03s)
[2m[pandoc-lua-engine] [m make hello world document: OK
[2m[pandoc-lua-engine] [m implicit doc filter: OK
[2m[pandoc-lua-engine] [m parse raw markdown blocks: OK
[2m[pandoc-lua-engine] [m allow shorthand functions for quote types: OK
[2m[pandoc-lua-engine] [m Count inlines via metatable catch-all: OK
[2m[pandoc-lua-engine] [m Count blocks via Block-specific catch-all: OK
[2m[pandoc-lua-engine] [m Smart constructors: OK
[2m[pandoc-lua-engine] [m Convert header upper case: OK
[2m[pandoc-lua-engine] [m Attribute lists are convenient to use: OK
[2m[pandoc-lua-engine] [m Filter list of inlines: OK
[2m[pandoc-lua-engine] [m Filter list of blocks: OK
[2m[pandoc-lua-engine] [m Filter Meta: OK
[2m[pandoc-lua-engine] [m Script filename is set: OK
[2m[pandoc-lua-engine] [m Pandoc version is set: OK
[2m[pandoc-lua-engine] [m Pandoc types version is set: OK
[2m[pandoc-lua-engine] [m require file: OK
[2m[pandoc-lua-engine] [m Allow singleton inline in constructors: OK
[2m[pandoc-lua-engine] [m Elements with Attr have `attr` accessor: OK
[2m[pandoc-lua-engine] [m module `pandoc.system` is present: OK
[2m[pandoc-lua-engine] [m global modules
[2m[pandoc-lua-engine] [m module 'lpeg' is loaded into a global: OK
[2m[pandoc-lua-engine] [m module 're' is loaded into a global: OK
[2m[pandoc-lua-engine] [m module 'lpeg' is available via `require`: OK
[2m[pandoc-lua-engine] [m module 're' is available via `require`: OK
[2m[pandoc-lua-engine] [m informative error messages: OK
[2m[pandoc-lua-engine] [m Lua modules
[2m[pandoc-lua-engine] [m pandoc: OK (0.02s)
[2m[pandoc-lua-engine] [m +++ Success: 79 Lua tests passed
[2m[pandoc-lua-engine] [m pandoc.List: OK
[2m[pandoc-lua-engine] [m +++ Success: 22 Lua tests passed
[2m[pandoc-lua-engine] [m pandoc.format: OK
[2m[pandoc-lua-engine] [m +++ Success: 3 Lua tests passed
[2m[pandoc-lua-engine] [m pandoc.image: OK
[2m[pandoc-lua-engine] [m +++ Success: 6 Lua tests passed
[2m[pandoc-lua-engine] [m pandoc.json: OK
[2m[pandoc-lua-engine] [m +++ Success: 21 Lua tests passed
[2m[pandoc-lua-engine] [m pandoc.log: OK
[2m[pandoc-lua-engine] [m +++ Success: 8 Lua tests passed
[2m[pandoc-lua-engine] [m pandoc.mediabag: OK
[2m[pandoc-lua-engine] [m +++ Success: 9 Lua tests passed
[2m[pandoc-lua-engine] [m pandoc.path: OK
[2m[pandoc-lua-engine] [m +++ Success: 5 Lua tests passed
[2m[pandoc-lua-engine] [m pandoc.structure: OK
[2m[pandoc-lua-engine] [m +++ Success: 11 Lua tests passed
[2m[pandoc-lua-engine] [m pandoc.template: OK (0.03s)
[2m[pandoc-lua-engine] [m +++ Success: 16 Lua tests passed
[2m[pandoc-lua-engine] [m pandoc.text: OK
[2m[pandoc-lua-engine] [m +++ Success: 9 Lua tests passed
[2m[pandoc-lua-engine] [m pandoc.types: OK
[2m[pandoc-lua-engine] [m +++ Success: 13 Lua tests passed
[2m[pandoc-lua-engine] [m pandoc.utils: OK
[2m[pandoc-lua-engine] [m +++ Success: 45 Lua tests passed
[2m[pandoc-lua-engine] [m globals: OK (0.02s)
[2m[pandoc-lua-engine] [m +++ Success: 42 Lua tests passed
[2m[pandoc-lua-engine] [m Custom writers
[2m[pandoc-lua-engine] [m default testsuite: OK (0.08s)
[2m[pandoc-lua-engine] [m tables testsuite: OK (0.04s)
[2m[pandoc-lua-engine] [m bytestring writer: OK
[2m[pandoc-lua-engine] [m template: OK
[2m[pandoc-lua-engine] [m preset extensions: OK
[2m[pandoc-lua-engine] [m modified extensions: OK
[2m[pandoc-lua-engine] [m Custom readers
[2m[pandoc-lua-engine] [m read binary to code block: OK
[2m[pandoc-lua-engine] [m
[2m[pandoc-lua-engine] [mAll 48 tests passed (0.37s)
[2m[pandoc-lua-engine] [mTest suite test-pandoc-lua-engine: PASS
[2m[pandoc-lua-engine] [mTest suite logged to:
[2m[pandoc-lua-engine] [mdist/test/pandoc-lua-engine-0.4.3-test-pandoc-lua-engine.log
[2m[pandoc-lua-engine] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[pandoc-lua-engine] [m[1;36mPhase: haddockPhase[m
[2m[pandoc-lua-engine] [mPreprocessing library for pandoc-lua-engine-0.4.3...
[2m[pandoc-lua-engine] [mRunning Haddock on library for pandoc-lua-engine-0.4.3...
[2m[pandoc-lua-engine] [mWarning: The documentation for the following packages are not installed. No
[2m[pandoc-lua-engine] [mlinks will be generated to these packages: attoparsec-0.14.4,
[2m[pandoc-lua-engine] [mattoparsec-0.14.4, libyaml-clib-0.2.5, pandoc-3.7.0.2, pandoc-3.7.0.2,
[2m[pandoc-lua-engine] [mvector-0.13.2.0
[2m[pandoc-lua-engine] [m[ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
[2m[pandoc-lua-engine] [m[ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
[2m[pandoc-lua-engine] [m[ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
[2m[pandoc-lua-engine] [m[ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
[2m[pandoc-lua-engine] [m[ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
[2m[pandoc-lua-engine] [m[ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
[2m[pandoc-lua-engine] [m[ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
[2m[pandoc-lua-engine] [m[ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
[2m[pandoc-lua-engine] [m[ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
[2m[pandoc-lua-engine] [m[10 of 39] Compiling Text.Pandoc.Lua.PandocLua
[2m[pandoc-lua-engine] [m[11 of 39] Compiling Text.Pandoc.Lua.Module.Types
[2m[pandoc-lua-engine] [m[12 of 39] Compiling Text.Pandoc.Lua.Module.Text
[2m[pandoc-lua-engine] [m[13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
[2m[pandoc-lua-engine] [m[14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
[2m[pandoc-lua-engine] [m[15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
[2m[pandoc-lua-engine] [m[16 of 39] Compiling Text.Pandoc.Lua.Module.Template
[2m[pandoc-lua-engine] [m[17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
[2m[pandoc-lua-engine] [m[18 of 39] Compiling Text.Pandoc.Lua.Module.Format
[2m[pandoc-lua-engine] [m[19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
[2m[pandoc-lua-engine] [m[20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
[2m[pandoc-lua-engine] [m[21 of 39] Compiling Text.Pandoc.Lua.Module.Image
[2m[pandoc-lua-engine] [m[22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
[2m[pandoc-lua-engine] [m[23 of 39] Compiling Text.Pandoc.Lua.Orphans
[2m[pandoc-lua-engine] [m[24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
[2m[pandoc-lua-engine] [m[25 of 39] Compiling Text.Pandoc.Lua.Global
[2m[pandoc-lua-engine] [m[26 of 39] Compiling Text.Pandoc.Lua.Filter
[2m[pandoc-lua-engine] [m[27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
[2m[pandoc-lua-engine] [m[28 of 39] Compiling Text.Pandoc.Lua.SourcePos
[2m[pandoc-lua-engine] [m[29 of 39] Compiling Text.Pandoc.Lua.Module.Log
[2m[pandoc-lua-engine] [m[30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
[2m[pandoc-lua-engine] [m[31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
[2m[pandoc-lua-engine] [m[32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
[2m[pandoc-lua-engine] [m[33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
[2m[pandoc-lua-engine] [m[34 of 39] Compiling Text.Pandoc.Lua.Module
[2m[pandoc-lua-engine] [m[35 of 39] Compiling Text.Pandoc.Lua.Init
[2m[pandoc-lua-engine] [m[36 of 39] Compiling Text.Pandoc.Lua.Run
[2m[pandoc-lua-engine] [m[37 of 39] Compiling Text.Pandoc.Lua.Custom
[2m[pandoc-lua-engine] [m[38 of 39] Compiling Text.Pandoc.Lua.Engine
[2m[pandoc-lua-engine] [m[39 of 39] Compiling Text.Pandoc.Lua
[2m[pandoc-lua-engine] [mHaddock coverage:
[2m[pandoc-lua-engine] [mWarning: 'Chunk' is ambiguous. It is defined
[2m[pandoc-lua-engine] [m * in ‘Text.Pandoc.Chunks’
[2m[pandoc-lua-engine] [m * in ‘Text.Pandoc.Chunks’
[2m[pandoc-lua-engine] [m You may be able to disambiguate the identifier by qualifying it or
[2m[pandoc-lua-engine] [m by specifying the type/value namespace explicitly.
[2m[pandoc-lua-engine] [m Defaulting to the one defined in ‘Text.Pandoc.Chunks’
[2m[pandoc-lua-engine] [mWarning: 'ChunkedDoc' is ambiguous. It is defined
[2m[pandoc-lua-engine] [m * in ‘Text.Pandoc.Chunks’
[2m[pandoc-lua-engine] [m * in ‘Text.Pandoc.Chunks’
[2m[pandoc-lua-engine] [m You may be able to disambiguate the identifier by qualifying it or
[2m[pandoc-lua-engine] [m by specifying the type/value namespace explicitly.
[2m[pandoc-lua-engine] [m Defaulting to the one defined in ‘Text.Pandoc.Chunks’
[2m[pandoc-lua-engine] [mWarning: 'Reference' is ambiguous. It is defined
[2m[pandoc-lua-engine] [m * in ‘Citeproc.Types’
[2m[pandoc-lua-engine] [m * in ‘Citeproc.Types’
[2m[pandoc-lua-engine] [m You may be able to disambiguate the identifier by qualifying it or
[2m[pandoc-lua-engine] [m by specifying the type/value namespace explicitly.
[2m[pandoc-lua-engine] [m Defaulting to the one defined in ‘Citeproc.Types’
[2m[pandoc-lua-engine] [mWarning: 'ItemId' is ambiguous. It is defined
[2m[pandoc-lua-engine] [m * in ‘Citeproc.Types’
[2m[pandoc-lua-engine] [m * in ‘Citeproc.Types’
[2m[pandoc-lua-engine] [m You may be able to disambiguate the identifier by qualifying it or
[2m[pandoc-lua-engine] [m by specifying the type/value namespace explicitly.
[2m[pandoc-lua-engine] [m Defaulting to the one defined in ‘Citeproc.Types’
[2m[pandoc-lua-engine] [mWarning: 'Name' is ambiguous. It is defined
[2m[pandoc-lua-engine] [m * in ‘Citeproc.Types’
[2m[pandoc-lua-engine] [m * in ‘Citeproc.Types’
[2m[pandoc-lua-engine] [m You may be able to disambiguate the identifier by qualifying it or
[2m[pandoc-lua-engine] [m by specifying the type/value namespace explicitly.
[2m[pandoc-lua-engine] [m Defaulting to the one defined in ‘Citeproc.Types’
[2m[pandoc-lua-engine] [mWarning: 'Date' is ambiguous. It is defined
[2m[pandoc-lua-engine] [m * in ‘Citeproc.Types’
[2m[pandoc-lua-engine] [m * in ‘Citeproc.Types’
[2m[pandoc-lua-engine] [m You may be able to disambiguate the identifier by qualifying it or
[2m[pandoc-lua-engine] [m by specifying the type/value namespace explicitly.
[2m[pandoc-lua-engine] [m Defaulting to the one defined in ‘Citeproc.Types’
[2m[pandoc-lua-engine] [mWarning: 'Sources' is ambiguous. It is defined
[2m[pandoc-lua-engine] [m * in ‘Text.Pandoc.Sources’
[2m[pandoc-lua-engine] [m * in ‘Text.Pandoc.Sources’
[2m[pandoc-lua-engine] [m You may be able to disambiguate the identifier by qualifying it or
[2m[pandoc-lua-engine] [m by specifying the type/value namespace explicitly.
[2m[pandoc-lua-engine] [m Defaulting to the one defined in ‘Text.Pandoc.Sources’
[2m[pandoc-lua-engine] [mWarning: 'Lua' is ambiguous. It is defined
[2m[pandoc-lua-engine] [m * in ‘HsLua.Core.Error’
[2m[pandoc-lua-engine] [m * in ‘HsLua.Core.Types’
[2m[pandoc-lua-engine] [m You may be able to disambiguate the identifier by qualifying it or
[2m[pandoc-lua-engine] [m by specifying the type/value namespace explicitly.
[2m[pandoc-lua-engine] [m Defaulting to the one defined in ‘HsLua.Core.Error’
[2m[pandoc-lua-engine] [mWarning: 'PandocLua' is ambiguous. It is defined
[2m[pandoc-lua-engine] [m * at src/Text/Pandoc/Lua/PandocLua.hs:36:23
[2m[pandoc-lua-engine] [m * at src/Text/Pandoc/Lua/PandocLua.hs:36:1
[2m[pandoc-lua-engine] [m You may be able to disambiguate the identifier by qualifying it or
[2m[pandoc-lua-engine] [m by specifying the type/value namespace explicitly.
[2m[pandoc-lua-engine] [m Defaulting to the one defined at src/Text/Pandoc/Lua/PandocLua.hs:36:1
[2m[pandoc-lua-engine] [mWarning: 'ExtensionConfig' is out of scope.
[2m[pandoc-lua-engine] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[pandoc-lua-engine] [mWarning: 'ExtensionsConfig' is ambiguous. It is defined
[2m[pandoc-lua-engine] [m * in ‘Text.Pandoc.Format’
[2m[pandoc-lua-engine] [m * in ‘Text.Pandoc.Format’
[2m[pandoc-lua-engine] [m You may be able to disambiguate the identifier by qualifying it or
[2m[pandoc-lua-engine] [m by specifying the type/value namespace explicitly.
[2m[pandoc-lua-engine] [m Defaulting to the one defined in ‘Text.Pandoc.Format’
[2m[pandoc-lua-engine] [mWarning: 'enable' is out of scope.
[2m[pandoc-lua-engine] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[pandoc-lua-engine] [mWarning: 'disable' is out of scope.
[2m[pandoc-lua-engine] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[pandoc-lua-engine] [mWarning: 'WriterOptions' is ambiguous. It is defined
[2m[pandoc-lua-engine] [m * in ‘Text.Pandoc.Options’
[2m[pandoc-lua-engine] [m * in ‘Text.Pandoc.Options’
[2m[pandoc-lua-engine] [m You may be able to disambiguate the identifier by qualifying it or
[2m[pandoc-lua-engine] [m by specifying the type/value namespace explicitly.
[2m[pandoc-lua-engine] [m Defaulting to the one defined in ‘Text.Pandoc.Options’
[2m[pandoc-lua-engine] [mWarning: 'Pandoc' is ambiguous. It is defined
[2m[pandoc-lua-engine] [m * in ‘Text.Pandoc.Definition’
[2m[pandoc-lua-engine] [m * in ‘Text.Pandoc.Definition’
[2m[pandoc-lua-engine] [m You may be able to disambiguate the identifier by qualifying it or
[2m[pandoc-lua-engine] [m by specifying the type/value namespace explicitly.
[2m[pandoc-lua-engine] [m Defaulting to the one defined in ‘Text.Pandoc.Definition’
[2m[pandoc-lua-engine] [mWarning: 'Chunk' is out of scope.
[2m[pandoc-lua-engine] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[pandoc-lua-engine] [mWarning: 'ReaderOptions' is ambiguous. It is defined
[2m[pandoc-lua-engine] [m * in ‘Text.Pandoc.Options’
[2m[pandoc-lua-engine] [m * in ‘Text.Pandoc.Options’
[2m[pandoc-lua-engine] [m You may be able to disambiguate the identifier by qualifying it or
[2m[pandoc-lua-engine] [m by specifying the type/value namespace explicitly.
[2m[pandoc-lua-engine] [m Defaulting to the one defined in ‘Text.Pandoc.Options’
[2m[pandoc-lua-engine] [mWarning: 'read' is out of scope.
[2m[pandoc-lua-engine] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[pandoc-lua-engine] [mWarning: 'PandocLua' is ambiguous. It is defined
[2m[pandoc-lua-engine] [m * at src/Text/Pandoc/Lua/PandocLua.hs:36:23
[2m[pandoc-lua-engine] [m * at src/Text/Pandoc/Lua/PandocLua.hs:36:1
[2m[pandoc-lua-engine] [m You may be able to disambiguate the identifier by qualifying it or
[2m[pandoc-lua-engine] [m by specifying the type/value namespace explicitly.
[2m[pandoc-lua-engine] [m Defaulting to the one defined at src/Text/Pandoc/Lua/PandocLua.hs:36:1
[2m[pandoc-lua-engine] [m 100% ( 11 / 11) in 'Text.Pandoc.Lua'
[2m[nothunks] [mPreprocessing test suite 'nothunks-test' for nothunks-0.3.1..
[2m[nothunks] [mBuilding test suite 'nothunks-test' for nothunks-0.3.1..
[2m[nothunks] [m[1 of 2] Compiling Test.NoThunks.Class ( test/Test/NoThunks/Class.hs, dist/build/nothunks-test/nothunks-test-tmp/Test/NoThunks/Class.o )
[2m[pandoc-lua-engine] [mWarning: Text.Pandoc.Lua: could not find link destinations for:
[2m[pandoc-lua-engine] [m - Text.Pandoc.Options.WriterOptions
[2m[pandoc-lua-engine] [m - Text.Pandoc.Error.PandocError
[2m[pandoc-lua-engine] [m - Text.Pandoc.Options.ReaderOptions
[2m[pandoc-lua-engine] [m - Text.Pandoc.Class.CommonState.CommonState
[2m[pandoc-lua-engine] [m - Text.Pandoc.Class.PandocMonad.PandocMonad
[2m[pandoc-lua-engine] [m - Text.Pandoc.Scripting.ScriptingEngine
[2m[pandoc-lua-engine] [m - Text.Pandoc.Filter.Environment.Environment
[2m[pandoc-lua-engine] [m - Text.Pandoc.Scripting.CustomComponents
[2m[nothunks] [m[2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
[2m[nothunks] [m[3 of 3] Linking dist/build/nothunks-test/nothunks-test
[2m[nothunks] [m[1;36mPhase: checkPhase[m
[2m[nothunks] [mRunning 1 test suites...
[2m[nothunks] [mTest suite nothunks-test: RUNNING...
[2m[nothunks] [mTests
[2m[nothunks] [m NoThunks.Class
[2m[nothunks] [m Sanity
[2m[nothunks] [m IntNotNF: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m IntIsNF: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m Pair: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m Sum: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m Fn: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m IO: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m InspectHeap
[2m[nothunks] [m Int: OK (0.02s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["Int"] 50% ██████████··········
[2m[nothunks] [m Nothing 50% █████████▉··········
[2m[nothunks] [m IntInt: OK (0.02s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["Int","Tuple2"] 35% ███████·············
[2m[nothunks] [m Just ["Tuple2"] 53% ██████████▌·········
[2m[nothunks] [m Nothing 12% ██▍·················
[2m[nothunks] [m SumInt: OK (0.02s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["Either"] 34% ██████▊·············
[2m[nothunks] [m Just ["Int","Either"] 35% ██████▉·············
[2m[nothunks] [m Nothing 31% ██████▎·············
[2m[nothunks] [m ListInt: OK (0.02s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["Int","List"] 22% ████▍···············
[2m[nothunks] [m Just ["List"] 44% ████████▉···········
[2m[nothunks] [m Nothing 33% ██████▌·············
[2m[nothunks] [m IntListInt: OK (0.03s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["Int","List","Tuple2"] 4% ▊···················
[2m[nothunks] [m Just ["Int","Tuple2"] 26% █████▏··············
[2m[nothunks] [m Just ["List","Tuple2"] 12% ██▎·················
[2m[nothunks] [m Just ["Tuple2"] 50% ██████████··········
[2m[nothunks] [m Nothing 8% █▋··················
[2m[nothunks] [m SeqInt: [91m✗[0m [91mEXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
[2m[nothunks] [m after 13 tests and 1 shrink.
[2m[nothunks] [m shrink path: 13:c[0m
[2m[nothunks] [m Just ["Int","Seq"][m [0m23%[m [0m████▌[91m[0m[90m···············[0m[m[0m
[2m[nothunks] [m Nothing [m [0m69%[m [0m█████████████▊[91m[0m[90m······[0m[m[0m
[2m[nothunks] [m
[2m[nothunks] [m [m┏━━[0m [mtest/Test/NoThunks/Class.hs[0m [m━━━[0m
[2m[nothunks] [m [m166[0m [m┃[0m [mtestWithModel :: forall a. FromModel a[0m
[2m[nothunks] [m [m167[0m [m┃[0m [m => (Maybe ThunkInfo -> Maybe [String] -> Bool)[0m
[2m[nothunks] [m [m168[0m [m┃[0m [m -> Proxy a[0m
[2m[nothunks] [m [m169[0m [m┃[0m [m -- ^ Compare @ThunkInfo@. When we use 'noThunks' this[0m
[2m[nothunks] [m [m170[0m [m┃[0m [m -- can just be @(==)@; however, when we use 'isNormalForm', the[0m
[2m[nothunks] [m [m171[0m [m┃[0m [m -- context we will get from the model will be too detailed.[0m
[2m[nothunks] [m [m172[0m [m┃[0m [m -> Property[0m
[2m[nothunks] [m [m173[0m [m┃[0m [mtestWithModel compareInfo _proxy = withTests 1000 $ property $ do[0m
[2m[nothunks] [m [35m174[0m [m┃[0m [m m :: Model a <- forAll genModel[0m
[2m[nothunks] [m [35m [0m [m┃[0m [35m│ [0m[35mWrap[0m
[2m[nothunks] [m [35m [0m [m┃[0m [35m│ [0m[35m { unwrap =[0m
[2m[nothunks] [m [35m [0m [m┃[0m [35m│ [0m[35m SeqEnqueue[0m
[2m[nothunks] [m [35m [0m [m┃[0m [35m│ [0m[35m (IntValue 0)[0m
[2m[nothunks] [m [35m [0m [m┃[0m [35m│ [0m[35m (SeqEnqueue[0m
[2m[nothunks] [m [35m [0m [m┃[0m [35m│ [0m[35m (IntValue 0)[0m
[2m[nothunks] [m [35m [0m [m┃[0m [35m│ [0m[35m (SeqEnqueue[0m
[2m[nothunks] [m [35m [0m [m┃[0m [35m│ [0m[35m (IntValue 0)[0m
[2m[nothunks] [m [35m [0m [m┃[0m [35m│ [0m[35m (SeqEnqueue[0m
[2m[nothunks] [m [35m [0m [m┃[0m [35m│ [0m[35m (IntValue 0)[0m
[2m[nothunks] [m [35m [0m [m┃[0m [35m│ [0m[35m (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))[0m
[2m[nothunks] [m [35m [0m [m┃[0m [35m│ [0m[35m }[0m
[2m[nothunks] [m [m175[0m [m┃[0m [m collect $ modelUnexpected [] m[0m
[2m[nothunks] [m [m176[0m [m┃[0m [m fromModel m $ \a -> do[0m
[2m[nothunks] [m [35m177[0m [m┃[0m [m annotate $ show $ modelIsNF [] m[0m
[2m[nothunks] [m [35m [0m [m┃[0m [35m│ [0m[35mIsNF[0m
[2m[nothunks] [m [m178[0m [m┃[0m [m isNF <- liftIO $ noThunks [] a[0m
[2m[nothunks] [m [91m179[0m [m┃[0m [91;1m Hedgehog.diff isNF compareInfo (modelUnexpected [] m)[0m
[2m[nothunks] [m [91m [0m [m┃[0m [91m^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m
[2m[nothunks] [m [91m [0m [m┃[0m [m│ [0m[m━━━ Failed ([0m[31m- lhs[0m[m) ([0m[32m+ rhs[0m[m) ━━━[0m
[2m[nothunks] [m [91m [0m [m┃[0m [m│ [0m[31m- Just[0m
[2m[nothunks] [m [91m [0m [m┃[0m [m│ [0m[31m- ThunkInfo[0m
[2m[nothunks] [m [91m [0m [m┃[0m [m│ [0m[31m- { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }[0m
[2m[nothunks] [m [91m [0m [m┃[0m [m│ [0m[32m+ Nothing[0m
[2m[nothunks] [m
[2m[nothunks] [m [mThis failure can be reproduced by running:[0m
[2m[nothunks] [m [m>[0m [mrecheckAt (Seed 7658446290982696329 9142656414718942013) "13:c" EXPECTED FAILURE[0m
[2m[nothunks] [m
[2m[nothunks] [mOK (0.02s)
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m Model
[2m[nothunks] [m Int: OK (0.02s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["Int"] 52% ██████████▎·········
[2m[nothunks] [m Nothing 48% █████████▋··········
[2m[nothunks] [m IntInt: OK (0.02s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["Int","Tuple2"] 38% ███████▌············
[2m[nothunks] [m Just ["Tuple2"] 50% █████████▉··········
[2m[nothunks] [m Nothing 12% ██▍·················
[2m[nothunks] [m SumInt: OK (0.02s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["Either"] 36% ███████▏············
[2m[nothunks] [m Just ["Int","Either"] 29% █████▊··············
[2m[nothunks] [m Nothing 35% ██████▉·············
[2m[nothunks] [m ListInt: OK (0.02s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["Int","List"] 20% ████················
[2m[nothunks] [m Just ["List"] 46% █████████▎··········
[2m[nothunks] [m Nothing 33% ██████▌·············
[2m[nothunks] [m IntListInt: OK (0.01s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["Int","List","Tuple2"] 6% █▏··················
[2m[nothunks] [m Just ["Int","Tuple2"] 25% █████···············
[2m[nothunks] [m Just ["List","Tuple2"] 11% ██▏·················
[2m[nothunks] [m Just ["Tuple2"] 50% █████████▉··········
[2m[nothunks] [m Nothing 8% █▋··················
[2m[nothunks] [m SeqInt: OK (0.09s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["Int","Seq"] 45% █████████···········
[2m[nothunks] [m Nothing 55% ██████████▉·········
[2m[nothunks] [m AllowThunksIn: OK (0.03s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["Int","field2","Record"] 26% █████···············
[2m[nothunks] [m Just ["Record"] 51% ██████████▏·········
[2m[nothunks] [m Nothing 24% ████▋···············
[2m[nothunks] [m Fn: OK (0.01s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["->"] 23% ████▌···············
[2m[nothunks] [m Nothing 77% ███████████████▍····
[2m[nothunks] [m IO: OK (0.01s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["IO"] 25% ████▉···············
[2m[nothunks] [m Nothing 75% ███████████████·····
[2m[nothunks] [m ThunkFreeFn: OK (0.01s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["->"] 25% █████···············
[2m[nothunks] [m Just ["...","->"] 38% ███████▌············
[2m[nothunks] [m Nothing 37% ███████▍············
[2m[nothunks] [m ThunkFreeIO: OK (0.01s)
[2m[nothunks] [m ✓ passed 1000 tests.
[2m[nothunks] [m Just ["...","IO"] 39% ███████▋············
[2m[nothunks] [m Just ["IO"] 25% ████▉···············
[2m[nothunks] [m Nothing 37% ███████▎············
[2m[nothunks] [m MutableVars
[2m[nothunks] [m IORef
[2m[nothunks] [m NotNF: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NF: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NotNFPure: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NFPure: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NotNFAtomically: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NFAtomically: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m MVar
[2m[nothunks] [m NotNF: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NF: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NotNFPure: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NFPure: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NotNFAtomically: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NFAtomically: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m TVar
[2m[nothunks] [m NotNF: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NF: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NotNFPure: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NFPure: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NotNFAtomically: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m NFAtomically: OK
[2m[nothunks] [m ✓ passed 1 test.
[2m[nothunks] [m
[2m[nothunks] [mAll 41 tests passed (0.41s)
[2m[nothunks] [mTest suite nothunks-test: PASS
[2m[nothunks] [mTest suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
[2m[nothunks] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[nothunks] [m[1;36mPhase: haddockPhase[m
[2m[nothunks] [mPreprocessing library for nothunks-0.3.1..
[2m[nothunks] [mRunning Haddock on library for nothunks-0.3.1..
[2m[nothunks] [mWarning: The documentation for the following packages are not installed. No
[2m[nothunks] [mlinks will be generated to these packages: vector-0.13.2.0
[2m[nothunks] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[nothunks] [m[1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
[2m[nothunks] [mHaddock coverage:
[2m[nothunks] [mWarning: 'AllowThunksIn' is ambiguous. It is defined
[2m[nothunks] [m * at src/NoThunks/Class.hs:334:48
[2m[nothunks] [m * at src/NoThunks/Class.hs:334:1
[2m[nothunks] [m You may be able to disambiguate the identifier by qualifying it or
[2m[nothunks] [m by specifying the type/value namespace explicitly.
[2m[nothunks] [m Defaulting to the one defined at src/NoThunks/Class.hs:334:1
[2m[nothunks] [mWarning: 'InspectHeap' is ambiguous. It is defined
[2m[nothunks] [m * at src/NoThunks/Class.hs:353:25
[2m[nothunks] [m * at src/NoThunks/Class.hs:353:1
[2m[nothunks] [m You may be able to disambiguate the identifier by qualifying it or
[2m[nothunks] [m by specifying the type/value namespace explicitly.
[2m[nothunks] [m Defaulting to the one defined at src/NoThunks/Class.hs:353:1
[2m[nothunks] [mWarning: 'InspectHeapNamed' is ambiguous. It is defined
[2m[nothunks] [m * at src/NoThunks/Class.hs:358:47
[2m[nothunks] [m * at src/NoThunks/Class.hs:358:1
[2m[nothunks] [m You may be able to disambiguate the identifier by qualifying it or
[2m[nothunks] [m by specifying the type/value namespace explicitly.
[2m[nothunks] [m Defaulting to the one defined at src/NoThunks/Class.hs:358:1
[2m[nothunks] [mWarning: 'OnlyCheckWhnf' is ambiguous. It is defined
[2m[nothunks] [m * at src/NoThunks/Class.hs:308:27
[2m[nothunks] [m * at src/NoThunks/Class.hs:308:1
[2m[nothunks] [m You may be able to disambiguate the identifier by qualifying it or
[2m[nothunks] [m by specifying the type/value namespace explicitly.
[2m[nothunks] [m Defaulting to the one defined at src/NoThunks/Class.hs:308:1
[2m[nothunks] [mWarning: 'ThunkInfo' is ambiguous. It is defined
[2m[nothunks] [m * at src/NoThunks/Class.hs:230:18
[2m[nothunks] [m * at src/NoThunks/Class.hs:230:1
[2m[nothunks] [m You may be able to disambiguate the identifier by qualifying it or
[2m[nothunks] [m by specifying the type/value namespace explicitly.
[2m[nothunks] [m Defaulting to the one defined at src/NoThunks/Class.hs:230:1
[2m[nothunks] [mWarning: 'GHC' is out of scope.
[2m[nothunks] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[nothunks] [mWarning: 'a' is out of scope.
[2m[nothunks] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[nothunks] [m 95% ( 20 / 21) in 'NoThunks.Class'
[2m[nothunks] [m Missing documentation for:
[2m[nothunks] [m Module header
[2m[nothunks] [mWarning: NoThunks.Class: could not find link destinations for:
[2m[nothunks] [m - Data.Vector.Vector
[2m[nothunks] [m - Data.Vector.Unboxed.Base.Vector
[2m[nothunks] [m - NoThunks.Class.HasFields
[2m[nothunks] [m - NoThunks.Class.Elem
[2m[nothunks] [m - NoThunks.Class.GShowTypeOf
[2m[nothunks] [m - NoThunks.Class.GWRecordField
[2m[nothunks] [m - NoThunks.Class.checkContainsThunks
[2m[nothunks] [mDocumentation created: dist/doc/html/nothunks/,
[2m[nothunks] [mdist/doc/html/nothunks/nothunks.txt
[2m[nothunks] [mPreprocessing test suite 'nothunks-test' for nothunks-0.3.1..
[2m[nothunks] [m[1;36mPhase: installPhase[m
[2m[nothunks] [mInstalling library in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
[2m[nothunks] [m[1;36mPhase: fixupPhase[m
[2m[nothunks] [mshrinking RPATHs of ELF executables and libraries in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1
[2m[nothunks] [mshrinking /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSnothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So-ghc9.8.4.so
[2m[nothunks] [mchecking for references to /build/ in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1...
[2m[nothunks] [mpatching script interpreter paths in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1
[2m[nothunks] [mstripping (with command strip and flags -S -p) in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib
[2m[nothunks] [mshrinking RPATHs of ELF executables and libraries in /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc
[2m[nothunks] [mchecking for references to /build/ in /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc...
[2m[nothunks] [mpatching script interpreter paths in /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc
[2m[nothunks:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1 /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc[m
[2m[nothunks:post-build] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[nothunks:post-build] [m[2mUploading to the NixCI cache: /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1 /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc[m
[2m[nothunks:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[nothunks:post-build] [m[2mcopying 1 paths...[m
[2m[nothunks:post-build] [m[2mcopying path '/nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1' to 'https://cache.nix-ci.com'...[m
[2m[nothunks:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[nothunks:post-build] [m[2mcopying 0 paths...[m
[2mProgress: 25 of 38 built (1 building), 559 of 559 downloaded from cache[m
[1;34mBuilding /nix/store/mr7yxhpx752pnr1i2yrqdpqk587ricjc-unordered-containers-0.2.20.1.drv[m
[2m[pandoc-lua-engine] [mDocumentation created: dist/doc/html/pandoc-lua-engine/,
[2m[pandoc-lua-engine] [mdist/doc/html/pandoc-lua-engine/pandoc-lua-engine.txt
[2m[pandoc-lua-engine] [mPreprocessing test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
[2m[pandoc-lua-engine] [m[1;36mPhase: installPhase[m
[2m[unordered-containers] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[unordered-containers] [mBuild with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
[2m[pandoc-lua-engine] [mInstalling library in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
[2m[unordered-containers] [m[1;36mPhase: unpackPhase[m
[2m[unordered-containers] [munpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
[2m[unordered-containers] [msource root is unordered-containers-0.2.20.1
[2m[unordered-containers] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
[2m[unordered-containers] [m[1;36mPhase: patchPhase[m
[2m[unordered-containers] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[unordered-containers] [msetupCompileFlags: -package-db=/build/tmp.F4TDaT7Clm/setup-package.conf.d -threaded
[2m[unordered-containers] [m[1 of 2] Compiling Main ( Setup.hs, /build/tmp.F4TDaT7Clm/Main.o )
[2m[unordered-containers] [m[2 of 2] Linking Setup
[2m[pandoc-lua-engine] [m[1;36mPhase: fixupPhase[m
[2m[pandoc-lua-engine] [mshrinking RPATHs of ELF executables and libraries in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3
[2m[pandoc-lua-engine] [mshrinking /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSpandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4-ghc9.10.3.so
[2m[pandoc-lua-engine] [mchecking for references to /build/ in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3...
[2m[pandoc-lua-engine] [mpatching script interpreter paths in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3
[2m[pandoc-lua-engine] [mstripping (with command strip and flags -S -p) in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib
[2m[pandoc-lua-engine] [mshrinking RPATHs of ELF executables and libraries in /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc
[2m[pandoc-lua-engine] [mchecking for references to /build/ in /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc...
[2m[pandoc-lua-engine] [mpatching script interpreter paths in /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc
[2m[pandoc-lua-engine:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3 /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc[m
[2m[pandoc-lua-engine:post-build] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[pandoc-lua-engine:post-build] [m[2mUploading to the NixCI cache: /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3 /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc[m
[2m[pandoc-lua-engine:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[pandoc-lua-engine:post-build] [m[2mcopying 1 paths...[m
[2m[pandoc-lua-engine:post-build] [m[2mcopying path '/nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3' to 'https://cache.nix-ci.com'...[m
[2m[pandoc-lua-engine:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[pandoc-lua-engine:post-build] [m[2mcopying 0 paths...[m
[2mProgress: 26 of 38 built (1 building), 559 of 559 downloaded from cache[m
[1;34mBuilding /nix/store/qmy7ps3m9d54gh5mmi24jf976jzhgy36-pandoc-cli-3.7.0.2.drv[m
[2m[unordered-containers] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[unordered-containers] [m[1;36mPhase: configurePhase[m
[2m[unordered-containers] [mconfigureFlags: --verbose --prefix=/nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.F4TDaT7Clm/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
[2m[unordered-containers] [mUsing Parsec parser
[2m[unordered-containers] [mConfiguring unordered-containers-0.2.20.1...
[2m[unordered-containers] [mFlags chosen: debug=False
[2m[unordered-containers] [mDependency base >=4.10 && <5: using base-4.19.2.0
[2m[unordered-containers] [mDependency deepseq >=1.4.3: using deepseq-1.5.1.0
[2m[unordered-containers] [mDependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
[2m[unordered-containers] [mDependency template-haskell <2.24: using template-haskell-2.21.0.0
[2m[unordered-containers] [mDependency ChasingBottoms: using ChasingBottoms-1.3.1.17
[2m[unordered-containers] [mDependency HUnit: using HUnit-1.6.2.0
[2m[unordered-containers] [mDependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
[2m[unordered-containers] [mDependency base: using base-4.19.2.0
[2m[unordered-containers] [mDependency containers >=0.5.8: using containers-0.6.8
[2m[unordered-containers] [mDependency hashable: using hashable-1.5.0.0
[2m[unordered-containers] [mDependency nothunks >=0.1.3: using nothunks-0.3.1
[2m[unordered-containers] [mDependency random: using random-1.2.1.3
[2m[unordered-containers] [mDependency tasty >=1.4.0.3: using tasty-1.5.3
[2m[unordered-containers] [mDependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
[2m[unordered-containers] [mDependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
[2m[unordered-containers] [mDependency unordered-containers: using unordered-containers-0.2.20.1
[2m[unordered-containers] [mSource component graph:
[2m[unordered-containers] [m component lib
[2m[unordered-containers] [m component test:unordered-containers-tests dependency lib
[2m[unordered-containers] [mConfigured component graph:
[2m[unordered-containers] [m component unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
[2m[unordered-containers] [m include base-4.19.2.0-8274
[2m[unordered-containers] [m include deepseq-1.5.1.0-c64e
[2m[unordered-containers] [m include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
[2m[unordered-containers] [m include template-haskell-2.21.0.0-cbc4
[2m[unordered-containers] [m component unordered-containers-0.2.20.1-8p5Y26GgM36CrnRklz7hG5-unordered-containers-tests
[2m[unordered-containers] [m include ChasingBottoms-1.3.1.17-EmoCAwMoPH0CCHL2NpXdat
[2m[unordered-containers] [m include HUnit-1.6.2.0-Db1bFs6D9VKLsZfaOMc6ct
[2m[unordered-containers] [m include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[unordered-containers] [m include base-4.19.2.0-8274
[2m[unordered-containers] [m include containers-0.6.8-15d9
[2m[unordered-containers] [m include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
[2m[unordered-containers] [m include nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
[2m[unordered-containers] [m include random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
[2m[unordered-containers] [m include tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
[2m[unordered-containers] [m include tasty-hunit-0.10.2-KzZfdY6N22V4CcWQecXPjL
[2m[unordered-containers] [m include tasty-quickcheck-0.11.1-2kmHUdfkSdKIEfY8qRwL5K
[2m[unordered-containers] [m include unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
[2m[unordered-containers] [mLinked component graph:
[2m[unordered-containers] [m unit unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
[2m[unordered-containers] [m include base-4.19.2.0-8274
[2m[unordered-containers] [m include deepseq-1.5.1.0-c64e
[2m[unordered-containers] [m include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
[2m[unordered-containers] [m include template-haskell-2.21.0.0-cbc4
[2m[unordered-containers] [m Data.HashMap.Internal=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashSet.Internal
[2m[unordered-containers] [m unit unordered-containers-0.2.20.1-8p5Y26GgM36CrnRklz7hG5-unordered-containers-tests
[2m[unordered-containers] [m include ChasingBottoms-1.3.1.17-EmoCAwMoPH0CCHL2NpXdat
[2m[unordered-containers] [m include HUnit-1.6.2.0-Db1bFs6D9VKLsZfaOMc6ct
[2m[unordered-containers] [m include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[unordered-containers] [m include base-4.19.2.0-8274
[2m[unordered-containers] [m include containers-0.6.8-15d9
[2m[unordered-containers] [m include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
[2m[unordered-containers] [m include nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
[2m[unordered-containers] [m include random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
[2m[unordered-containers] [m include tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
[2m[unordered-containers] [m include tasty-hunit-0.10.2-KzZfdY6N22V4CcWQecXPjL
[2m[unordered-containers] [m include tasty-quickcheck-0.11.1-2kmHUdfkSdKIEfY8qRwL5K
[2m[unordered-containers] [m include unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
[2m[unordered-containers] [mReady component graph:
[2m[unordered-containers] [m definite unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
[2m[unordered-containers] [m depends base-4.19.2.0-8274
[2m[unordered-containers] [m depends deepseq-1.5.1.0-c64e
[2m[unordered-containers] [m depends hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
[2m[unordered-containers] [m depends template-haskell-2.21.0.0-cbc4
[2m[unordered-containers] [m definite unordered-containers-0.2.20.1-8p5Y26GgM36CrnRklz7hG5-unordered-containers-tests
[2m[unordered-containers] [m depends ChasingBottoms-1.3.1.17-EmoCAwMoPH0CCHL2NpXdat
[2m[unordered-containers] [m depends HUnit-1.6.2.0-Db1bFs6D9VKLsZfaOMc6ct
[2m[unordered-containers] [m depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[unordered-containers] [m depends base-4.19.2.0-8274
[2m[unordered-containers] [m depends containers-0.6.8-15d9
[2m[unordered-containers] [m depends hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
[2m[unordered-containers] [m depends nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
[2m[unordered-containers] [m depends random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
[2m[unordered-containers] [m depends tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
[2m[unordered-containers] [m depends tasty-hunit-0.10.2-KzZfdY6N22V4CcWQecXPjL
[2m[unordered-containers] [m depends tasty-quickcheck-0.11.1-2kmHUdfkSdKIEfY8qRwL5K
[2m[unordered-containers] [m depends unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
[2m[unordered-containers] [mUsing Cabal-3.10.3.0 compiled by ghc-9.8
[2m[unordered-containers] [mUsing compiler: ghc-9.8.4
[2m[unordered-containers] [mUsing install prefix:
[2m[unordered-containers] [m/nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1
[2m[unordered-containers] [mExecutables installed in:
[2m[unordered-containers] [m/nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/bin
[2m[unordered-containers] [mLibraries installed in:
[2m[unordered-containers] [m/nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
[2m[unordered-containers] [mDynamic Libraries installed in:
[2m[unordered-containers] [m/nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
[2m[unordered-containers] [mPrivate executables installed in:
[2m[unordered-containers] [m/nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1
[2m[unordered-containers] [mData files installed in:
[2m[unordered-containers] [m/nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1
[2m[unordered-containers] [mDocumentation installed in:
[2m[unordered-containers] [m/nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
[2m[unordered-containers] [mConfiguration files installed in:
[2m[unordered-containers] [m/nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/etc
[2m[unordered-containers] [mNo alex found
[2m[unordered-containers] [mUsing ar found on system at:
[2m[unordered-containers] [m/nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
[2m[unordered-containers] [mNo c2hs found
[2m[unordered-containers] [mNo cpphs found
[2m[unordered-containers] [mNo doctest found
[2m[unordered-containers] [mUsing gcc version 14.3.0 given by user at:
[2m[unordered-containers] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
[2m[unordered-containers] [mUsing ghc version 9.8.4 found on system at:
[2m[unordered-containers] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
[2m[unordered-containers] [mUsing ghc-pkg version 9.8.4 found on system at:
[2m[unordered-containers] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
[2m[unordered-containers] [mNo ghcjs found
[2m[unordered-containers] [mNo ghcjs-pkg found
[2m[unordered-containers] [mNo greencard found
[2m[unordered-containers] [mUsing haddock version 2.30.0 found on system at:
[2m[unordered-containers] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
[2m[unordered-containers] [mNo happy found
[2m[unordered-containers] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[unordered-containers] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[unordered-containers] [mNo hmake found
[2m[unordered-containers] [mUsing hpc version 0.69 found on system at:
[2m[unordered-containers] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
[2m[unordered-containers] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[unordered-containers] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
[2m[unordered-containers] [mUsing hscolour version 1.25 found on system at:
[2m[unordered-containers] [m/nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
[2m[unordered-containers] [mNo jhc found
[2m[unordered-containers] [mUsing ld found on system at:
[2m[unordered-containers] [m/nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
[2m[unordered-containers] [mNo pkg-config found
[2m[unordered-containers] [mUsing runghc version 9.8.4 found on system at:
[2m[unordered-containers] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
[2m[unordered-containers] [mUsing strip version 2.44 found on system at:
[2m[unordered-containers] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
[2m[unordered-containers] [mUsing tar found on system at:
[2m[unordered-containers] [m/nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
[2m[unordered-containers] [mNo uhc found
[2m[unordered-containers] [m[1;36mPhase: buildPhase[m
[2m[unordered-containers] [mPreprocessing library for unordered-containers-0.2.20.1..
[2m[unordered-containers] [mBuilding library for unordered-containers-0.2.20.1..
[2m[unordered-containers] [m
[2m[unordered-containers] [m[;1mData/HashMap/Internal.hs:12:14-23: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-53692[0m[0m[;1m] [[;1m[35m-Wdeprecated-flags[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead[0m[0m
[2m[unordered-containers] [m[;1m[34m |[0m[0m
[2m[unordered-containers] [m[;1m[34m12 |[0m[0m {-# LANGUAGE [;1m[35mTypeInType[0m[0m #-}
[2m[unordered-containers] [m[;1m[34m |[0m[0m[;1m[35m ^^^^^^^^^^[0m[0m
[2m[unordered-containers] [m[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 )
[2m[unordered-containers] [m
[2m[unordered-containers] [m[;1mData/HashMap/Internal/Array.hs:83:1-35: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m The import of ‘Control.Applicative’ is redundant
[2m[unordered-containers] [m except perhaps to import instances from ‘Control.Applicative’
[2m[unordered-containers] [m To import instances alone, use: import Control.Applicative()[0m[0m
[2m[unordered-containers] [m[;1m[34m |[0m[0m
[2m[unordered-containers] [m[;1m[34m83 |[0m[0m [;1m[35mimport Control.Applicative (liftA2)[0m[0m
[2m[unordered-containers] [m[;1m[34m |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[unordered-containers] [m[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 )
[2m[unordered-containers] [m[3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.o, dist/build/Data/HashMap/Internal.dyn_o )
[2m[pandoc-cli] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[pandoc-cli] [mBuild with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
[2m[pandoc-cli] [m[1;36mPhase: unpackPhase[m
[2m[pandoc-cli] [munpacking source archive /nix/store/l1s1s9sdrxfqabvc0hl1i6jbdyzaj2ci-pandoc-cli-3.7.0.2.tar.gz
[2m[pandoc-cli] [msource root is pandoc-cli-3.7.0.2
[2m[pandoc-cli] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-cli-3.7.0.2/src/pandoc.hs"
[2m[pandoc-cli] [m[1;36mPhase: patchPhase[m
[2m[pandoc-cli] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[pandoc-cli] [msetupCompileFlags: -package-db=/build/tmp.wfHYidRJRl/setup-package.conf.d -threaded
[2m[pandoc-cli] [m[1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.wfHYidRJRl/Main.o )
[2m[pandoc-cli] [m[2 of 2] Linking Setup
[2m[unordered-containers] [m[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 )
[2m[unordered-containers] [m[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 )
[2m[pandoc-cli] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[pandoc-cli] [m[1;36mPhase: configurePhase[m
[2m[pandoc-cli] [mconfigureFlags: --verbose --prefix=/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.wfHYidRJRl/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --disable-library-profiling --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping -fembed_data_files --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
[2m[pandoc-cli] [mUsing Parsec parser
[2m[pandoc-cli] [mConfiguring pandoc-cli-3.7.0.2...
[2m[pandoc-cli] [mFlags chosen: lua=True, nightly=False, server=True
[2m[pandoc-cli] [mDependency base >=4.12 && <5: using base-4.20.2.0
[2m[pandoc-cli] [mDependency hslua-cli >=1.4.1 && <1.5: using hslua-cli-1.4.3
[2m[pandoc-cli] [mDependency pandoc ==3.7.0.2: using pandoc-3.7.0.2
[2m[pandoc-cli] [mDependency pandoc-lua-engine >=0.4.3 && <0.5: using pandoc-lua-engine-0.4.3
[2m[pandoc-cli] [mDependency pandoc-server >=0.1.0.9 && <0.2: using pandoc-server-0.1.0.11
[2m[pandoc-cli] [mDependency safe: using safe-0.3.21
[2m[pandoc-cli] [mDependency temporary >=1.1 && <1.4: using temporary-1.3
[2m[pandoc-cli] [mDependency text: using text-2.1.3
[2m[pandoc-cli] [mDependency wai-extra >=3.0.24: using wai-extra-3.1.18
[2m[pandoc-cli] [mDependency warp: using warp-3.4.9
[2m[pandoc-cli] [mSource component graph: component exe:pandoc
[2m[pandoc-cli] [mConfigured component graph:
[2m[pandoc-cli] [m component pandoc-cli-3.7.0.2-BdFEXtx4yoTCmeDPYT8eTr-pandoc
[2m[pandoc-cli] [m include base-4.20.2.0-64da
[2m[pandoc-cli] [m include hslua-cli-1.4.3-GEWVAFQbzS1ZD0qJxIIXy
[2m[pandoc-cli] [m include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
[2m[pandoc-cli] [m include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
[2m[pandoc-cli] [m include pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
[2m[pandoc-cli] [m include safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
[2m[pandoc-cli] [m include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
[2m[pandoc-cli] [m include text-2.1.3-c691
[2m[pandoc-cli] [m include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
[2m[pandoc-cli] [m include warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
[2m[pandoc-cli] [mLinked component graph:
[2m[pandoc-cli] [m unit pandoc-cli-3.7.0.2-BdFEXtx4yoTCmeDPYT8eTr-pandoc
[2m[pandoc-cli] [m include base-4.20.2.0-64da
[2m[pandoc-cli] [m include hslua-cli-1.4.3-GEWVAFQbzS1ZD0qJxIIXy
[2m[pandoc-cli] [m include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
[2m[pandoc-cli] [m include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
[2m[pandoc-cli] [m include pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
[2m[pandoc-cli] [m include safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
[2m[pandoc-cli] [m include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
[2m[pandoc-cli] [m include text-2.1.3-c691
[2m[pandoc-cli] [m include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
[2m[pandoc-cli] [m include warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
[2m[pandoc-cli] [mReady component graph:
[2m[pandoc-cli] [m definite pandoc-cli-3.7.0.2-BdFEXtx4yoTCmeDPYT8eTr-pandoc
[2m[pandoc-cli] [m depends base-4.20.2.0-64da
[2m[pandoc-cli] [m depends hslua-cli-1.4.3-GEWVAFQbzS1ZD0qJxIIXy
[2m[pandoc-cli] [m depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
[2m[pandoc-cli] [m depends pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
[2m[pandoc-cli] [m depends pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
[2m[pandoc-cli] [m depends safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
[2m[pandoc-cli] [m depends temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
[2m[pandoc-cli] [m depends text-2.1.3-c691
[2m[pandoc-cli] [m depends wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
[2m[pandoc-cli] [m depends warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
[2m[pandoc-cli] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[pandoc-cli] [mUsing compiler: ghc-9.10.3
[2m[pandoc-cli] [mUsing install prefix:
[2m[pandoc-cli] [m/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
[2m[pandoc-cli] [mExecutables installed in:
[2m[pandoc-cli] [m/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin
[2m[pandoc-cli] [mLibraries installed in:
[2m[pandoc-cli] [m/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-cli-3.7.0.2
[2m[pandoc-cli] [mDynamic Libraries installed in:
[2m[pandoc-cli] [m/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
[2m[pandoc-cli] [mPrivate executables installed in:
[2m[pandoc-cli] [m/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/libexec/x86_64-linux-ghc-9.10.3-05f6/pandoc-cli-3.7.0.2
[2m[pandoc-cli] [mData files installed in:
[2m[pandoc-cli] [m/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/share/x86_64-linux-ghc-9.10.3-05f6/pandoc-cli-3.7.0.2
[2m[pandoc-cli] [mDocumentation installed in:
[2m[pandoc-cli] [m/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/share/doc/x86_64-linux-ghc-9.10.3-05f6/pandoc-cli-3.7.0.2
[2m[pandoc-cli] [mConfiguration files installed in:
[2m[pandoc-cli] [m/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/etc
[2m[pandoc-cli] [mNo alex found
[2m[pandoc-cli] [mUsing ar found on system at:
[2m[pandoc-cli] [m/nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
[2m[pandoc-cli] [mNo c2hs found
[2m[pandoc-cli] [mNo cpphs found
[2m[pandoc-cli] [mNo doctest found
[2m[pandoc-cli] [mUsing gcc version 14.3.0 given by user at:
[2m[pandoc-cli] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
[2m[pandoc-cli] [mUsing ghc version 9.10.3 found on system at:
[2m[pandoc-cli] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
[2m[pandoc-cli] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[pandoc-cli] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
[2m[pandoc-cli] [mNo ghcjs found
[2m[pandoc-cli] [mNo ghcjs-pkg found
[2m[pandoc-cli] [mNo greencard found
[2m[pandoc-cli] [mUsing haddock version 2.31.1 found on system at:
[2m[unordered-containers] [m[6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.o, dist/build/Data/HashSet/Internal.dyn_o )
[2m[pandoc-cli] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
[2m[pandoc-cli] [mNo happy found
[2m[pandoc-cli] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[pandoc-cli] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[pandoc-cli] [mNo hmake found
[2m[pandoc-cli] [mUsing hpc version 0.69 found on system at:
[2m[pandoc-cli] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[pandoc-cli] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[pandoc-cli] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[pandoc-cli] [mNo hscolour found
[2m[pandoc-cli] [mNo jhc found
[2m[pandoc-cli] [mUsing ld found on system at:
[2m[pandoc-cli] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
[2m[pandoc-cli] [mNo pkg-config found
[2m[pandoc-cli] [mUsing runghc version 9.10.3 found on system at:
[2m[pandoc-cli] [m/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
[2m[pandoc-cli] [mUsing strip version 2.44 found on system at:
[2m[pandoc-cli] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
[2m[pandoc-cli] [mUsing tar found on system at:
[2m[pandoc-cli] [m/nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
[2m[pandoc-cli] [mNo uhc found
[2m[unordered-containers] [m[7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
[2m[unordered-containers] [m[8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.o, dist/build/Data/HashMap/Strict.dyn_o )
[2m[unordered-containers] [m[9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.o, dist/build/Data/HashMap/Lazy.dyn_o )
[2m[unordered-containers] [m
[2m[unordered-containers] [m[;1mData/HashMap/Internal.hs:12:14-23: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-53692[0m[0m[;1m] [[;1m[35m-Wdeprecated-flags[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead[0m[0m
[2m[unordered-containers] [m[;1m[34m |[0m[0m
[2m[unordered-containers] [m[;1m[34m12 |[0m[0m {-# LANGUAGE [;1m[35mTypeInType[0m[0m #-}
[2m[unordered-containers] [m[;1m[34m |[0m[0m[;1m[35m ^^^^^^^^^^[0m[0m
[2m[unordered-containers] [m[1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
[2m[unordered-containers] [m
[2m[unordered-containers] [m[;1mData/HashMap/Internal/Array.hs:83:1-35: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m The import of ‘Control.Applicative’ is redundant
[2m[unordered-containers] [m except perhaps to import instances from ‘Control.Applicative’
[2m[unordered-containers] [m To import instances alone, use: import Control.Applicative()[0m[0m
[2m[unordered-containers] [m[;1m[34m |[0m[0m
[2m[unordered-containers] [m[;1m[34m83 |[0m[0m [;1m[35mimport Control.Applicative (liftA2)[0m[0m
[2m[unordered-containers] [m[;1m[34m |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[pandoc-cli] [m[1;36mPhase: buildPhase[m
[2m[pandoc-cli] [mPreprocessing executable 'pandoc' for pandoc-cli-3.7.0.2...
[2m[pandoc-cli] [mBuilding executable 'pandoc' for pandoc-cli-3.7.0.2...
[2m[pandoc-cli] [m[1 of 3] Compiling PandocCLI.Lua
[2m[pandoc-cli] [m[2 of 3] Compiling PandocCLI.Server
[2m[pandoc-cli] [m[3 of 3] Compiling Main
[2m[unordered-containers] [m[2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
[2m[unordered-containers] [m[3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
[2m[pandoc-cli] [m[4 of 4] Linking dist/build/pandoc/pandoc
[2m[unordered-containers] [m[4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
[2m[unordered-containers] [m[5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
[2m[pandoc-cli] [m[1;36mPhase: checkPhase[m
[2m[pandoc-cli] [mPackage has no test suites.
[2m[pandoc-cli] [m[1;36mPhase: haddockPhase[m
[2m[pandoc-cli] [m[1;36mPhase: installPhase[m
[2m[pandoc-cli] [mInstalling executable pandoc in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin
[2m[pandoc-cli] [mWarning: The directory
[2m[pandoc-cli] [m/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin is not in
[2m[pandoc-cli] [mthe system search path.
[2m[unordered-containers] [m[6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
[2m[unordered-containers] [m[7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
[2m[unordered-containers] [m[8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
[2m[unordered-containers] [m[9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
[2m[unordered-containers] [mPreprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
[2m[unordered-containers] [mBuilding test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
[2m[unordered-containers] [m[1 of 9] Compiling Properties.List ( tests/Properties/List.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/List.o )
[2m[unordered-containers] [m[2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
[2m[unordered-containers] [m
[2m[unordered-containers] [m[;1mtests/Regressions.hs:93:16: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m In the use of ‘head’
[2m[unordered-containers] [m (imported from Prelude, but defined in GHC.List):
[2m[unordered-containers] [m "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."[0m[0m
[2m[unordered-containers] [m[;1m[34m |[0m[0m
[2m[unordered-containers] [m[;1m[34m93 |[0m[0m k = [;1m[35mhead[0m[0m keys
[2m[unordered-containers] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[pandoc-cli] [m[1;36mPhase: fixupPhase[m
[2m[pandoc-cli] [mshrinking RPATHs of ELF executables and libraries in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
[2m[pandoc-cli] [mshrinking /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin/pandoc
[2m[pandoc-cli] [mchecking for references to /build/ in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2...
[2m[pandoc-cli] [mgzipping man pages under /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/share/man/
[2m[pandoc-cli] [mpatching script interpreter paths in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
[2m[pandoc-cli] [mstripping (with command strip and flags -S -p) in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin
[2m[pandoc-cli:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2[m
[2m[pandoc-cli:post-build] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[pandoc-cli:post-build] [m[2mUploading to the NixCI cache: /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2[m
[2m[pandoc-cli:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[pandoc-cli:post-build] [m[2mcopying 1 paths...[m
[2m[pandoc-cli:post-build] [m[2mcopying path '/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2' to 'https://cache.nix-ci.com'...[m
[2m[pandoc-cli:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[pandoc-cli:post-build] [m[2mcopying 0 paths...[m
[2mProgress: 27 of 38 built (1 building), 559 of 559 downloaded from cache[m
[1;34mBuilding /nix/store/10xzxxdy2m2dv7z9mzid70kwihb0p0z3-shellcheck-0.11.0.drv[m
[2m[unordered-containers] [m[3 of 9] Compiling Util.Key ( tests/Util/Key.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Util/Key.o )
[2m[unordered-containers] [m[4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
[2m[unordered-containers] [m[5 of 9] Compiling Properties.HashSet ( tests/Properties/HashSet.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashSet.o )
[2m[unordered-containers] [m[6 of 9] Compiling Properties.HashMapStrict ( tests/Properties/HashMapStrict.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapStrict.o )
[2m[unordered-containers] [m[7 of 9] Compiling Properties.HashMapLazy ( tests/Properties/HashMapLazy.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapLazy.o )
[2m[unordered-containers] [m[8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
[2m[unordered-containers] [m[9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
[2m[unordered-containers] [m[10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
[2m[unordered-containers] [mbuildPhase completed in 40 seconds
[2m[unordered-containers] [m[1;36mPhase: checkPhase[m
[2m[unordered-containers] [mRunning 1 test suites...
[2m[unordered-containers] [mTest suite unordered-containers-tests: RUNNING...
[2m[unordered-containers] [mAll
[2m[unordered-containers] [m Properties
[2m[unordered-containers] [m Data.HashMap.Lazy
[2m[unordered-containers] [m instances
[2m[unordered-containers] [m Eq
[2m[unordered-containers] [m ==: OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m /=: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Ord
[2m[unordered-containers] [m compare reflexive: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m compare transitive: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m compare antisymmetric: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Ord => Eq: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Read/Show: OK (0.13s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Functor: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Foldable: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Bifoldable
[2m[unordered-containers] [m bifoldMap: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m bifoldr: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m bifoldl: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Hashable: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m empty
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 1 test.
[2m[unordered-containers] [m singleton
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m size: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m member: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m lookup: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m !?: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m insert
[2m[unordered-containers] [m model: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m insertWith
[2m[unordered-containers] [m insertWith: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m delete
[2m[unordered-containers] [m model: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m adjust
[2m[unordered-containers] [m model: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m update
[2m[unordered-containers] [m model: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m alter
[2m[unordered-containers] [m model: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m alterF
[2m[unordered-containers] [m model
[2m[unordered-containers] [m []: OK (0.07s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m adjust: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m insert: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m insertWith: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m delete: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m lookup: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m isSubmapOf
[2m[unordered-containers] [m model: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m m ⊆ m: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m m1 ⊆ m1 ∪ m2: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m m1\m2 ⊆ m1: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests; 217 discarded.
[2m[unordered-containers] [m delete k m ⊆ m: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests; 19 discarded.
[2m[unordered-containers] [m m ⊈ delete k m : OK
[2m[unordered-containers] [m +++ OK, passed 100 tests; 15 discarded.
[2m[unordered-containers] [m k ∉ m ⇒ m ⊆ insert k v m: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests; 12 discarded.
[2m[unordered-containers] [m k ∉ m ⇒ insert k v m ⊈ m: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests; 9 discarded.
[2m[unordered-containers] [m union
[2m[unordered-containers] [m model: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m unionWith
[2m[unordered-containers] [m model: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m unionWithKey
[2m[unordered-containers] [m model: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m unions
[2m[unordered-containers] [m model: OK (0.79s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.37s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m difference
[2m[unordered-containers] [m model: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m differenceWith
[2m[unordered-containers] [m model: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m intersection
[2m[unordered-containers] [m model: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m intersectionWith
[2m[unordered-containers] [m model: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m intersectionWithKey
[2m[unordered-containers] [m model: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m compose
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m map
[2m[unordered-containers] [m model: OK (0.06s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m traverseWithKey
[2m[unordered-containers] [m model: OK (0.16s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m mapKeys
[2m[unordered-containers] [m model: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.22s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldr: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldl: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldrWithKey: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldlWithKey: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldrWithKey': OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldlWithKey': OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldl': OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldr': OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldMapWithKey: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m filter
[2m[unordered-containers] [m model: OK (0.05s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m filterWithKey
[2m[unordered-containers] [m model: OK (1.09s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.40s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m mapMaybe
[2m[unordered-containers] [m model: OK (0.05s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.05s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m mapMaybeWithKey
[2m[unordered-containers] [m model: OK (1.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.48s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m elems: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m keys: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m fromList
[2m[unordered-containers] [m model: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m fromListWith
[2m[unordered-containers] [m model: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m fromListWithKey
[2m[unordered-containers] [m model: OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m toList: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Data.HashMap.Strict
[2m[unordered-containers] [m instances
[2m[unordered-containers] [m Eq
[2m[unordered-containers] [m ==: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m /=: OK (0.05s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Ord
[2m[unordered-containers] [m compare reflexive: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m compare transitive: OK (0.07s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m compare antisymmetric: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Ord => Eq: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Read/Show: OK (0.31s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Functor: OK (0.07s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Foldable: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Bifoldable
[2m[unordered-containers] [m bifoldMap: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m bifoldr: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m bifoldl: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Hashable: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m empty
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 1 test.
[2m[unordered-containers] [m singleton
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m size: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m member: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m lookup: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m !?: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m insert
[2m[unordered-containers] [m model: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m insertWith
[2m[unordered-containers] [m insertWith: OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m delete
[2m[unordered-containers] [m model: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m adjust
[2m[unordered-containers] [m model: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m update
[2m[unordered-containers] [m model: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m alter
[2m[unordered-containers] [m model: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m alterF
[2m[unordered-containers] [m model
[2m[unordered-containers] [m []: OK (0.13s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m adjust: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m insert: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m insertWith: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m delete: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m lookup: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.05s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m isSubmapOf
[2m[unordered-containers] [m model: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m m ⊆ m: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m m1 ⊆ m1 ∪ m2: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m m1\m2 ⊆ m1: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests; 166 discarded.
[2m[unordered-containers] [m delete k m ⊆ m: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests; 16 discarded.
[2m[unordered-containers] [m m ⊈ delete k m : OK
[2m[unordered-containers] [m +++ OK, passed 100 tests; 19 discarded.
[2m[unordered-containers] [m k ∉ m ⇒ m ⊆ insert k v m: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests; 4 discarded.
[2m[unordered-containers] [m k ∉ m ⇒ insert k v m ⊈ m: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests; 11 discarded.
[2m[unordered-containers] [m union
[2m[unordered-containers] [m model: OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m unionWith
[2m[unordered-containers] [m model: OK (0.06s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.05s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m unionWithKey
[2m[unordered-containers] [m model: OK (0.10s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.10s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m unions
[2m[unordered-containers] [m model: OK (0.89s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.64s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m difference
[2m[unordered-containers] [m model: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m differenceWith
[2m[unordered-containers] [m model: OK (0.09s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.08s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m intersection
[2m[unordered-containers] [m model: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m intersectionWith
[2m[unordered-containers] [m model: OK (0.07s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.05s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m intersectionWithKey
[2m[unordered-containers] [m model: OK (0.13s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.07s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m compose
[2m[unordered-containers] [m valid: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m map
[2m[unordered-containers] [m model: OK (0.15s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.05s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m traverseWithKey
[2m[unordered-containers] [m model: OK (0.67s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m mapKeys
[2m[unordered-containers] [m model: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.47s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldr: OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldl: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldrWithKey: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldlWithKey: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldrWithKey': OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldlWithKey': OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldl': OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldr': OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldMapWithKey: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m filter
[2m[unordered-containers] [m model: OK (0.10s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.06s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m filterWithKey
[2m[unordered-containers] [m model: OK (0.78s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.64s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m mapMaybe
[2m[unordered-containers] [m model: OK (0.08s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.07s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m mapMaybeWithKey
[2m[unordered-containers] [m model: OK (0.77s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.47s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m elems: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m keys: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m fromList
[2m[unordered-containers] [m model: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m fromListWith
[2m[unordered-containers] [m model: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.05s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m fromListWithKey
[2m[unordered-containers] [m model: OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m valid: OK (0.07s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m toList: OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Data.HashSet
[2m[unordered-containers] [m instances
[2m[unordered-containers] [m Eq
[2m[unordered-containers] [m ==: OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m == permutations: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m /=: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Ord
[2m[unordered-containers] [m compare reflexive: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m compare transitive: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m compare antisymmetric: OK (0.05s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Ord => Eq: OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Read/Show: OK (0.31s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Foldable: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Hashable: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m size: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m member: OK (0.01s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m insert: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m delete: OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m union: OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m map: OK (0.52s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldr: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m foldl': OK (0.04s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m filter: OK (0.45s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m toList: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Data.HashMap.Internal.List
[2m[unordered-containers] [m isPermutationBy: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m isPermutationBy of different length: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests; 18 discarded.
[2m[unordered-containers] [m pUnorderedCompare: OK (0.07s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m modelUnorderedCompare
[2m[unordered-containers] [m reflexive: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m anti-symmetric: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m transitive: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m Regression tests
[2m[unordered-containers] [m issue32: OK
[2m[unordered-containers] [m issue39a: OK
[2m[unordered-containers] [m issue39b: OK (0.03s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m issue254 lazy: OK
[2m[unordered-containers] [m issue254 strict: OK
[2m[unordered-containers] [m issue379
[2m[unordered-containers] [m Lazy.unionWith: OK
[2m[unordered-containers] [m union: OK
[2m[unordered-containers] [m Strict.unionWith: OK
[2m[unordered-containers] [m Strict.unionWithKey: OK
[2m[unordered-containers] [m issue381
[2m[unordered-containers] [m mapMaybe: OK
[2m[unordered-containers] [m mapMaybeWithKey: OK
[2m[unordered-containers] [m issue382: OK (0.01s)
[2m[unordered-containers] [m issue383: OK
[2m[unordered-containers] [m issue420: OK
[2m[unordered-containers] [m issue491
[2m[unordered-containers] [m 1: OK
[2m[unordered-containers] [m 2: OK
[2m[unordered-containers] [m 3: OK
[2m[unordered-containers] [m Strictness
[2m[unordered-containers] [m HashMap.Strict
[2m[unordered-containers] [m singleton is key-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m singleton is value-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m member is key-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m lookup is key-strict: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m lookupDefault is key-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m findWithDefault is key-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m ! is key-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m delete is key-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m adjust is key-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m adjust is value-strict: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m insert is key-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m insert is value-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m insertWith is key-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m insertWith is value-strict: OK (0.02s)
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m fromList is key-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m fromList is value-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m fromListWith is key-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m fromListWith is value-strict: OK
[2m[unordered-containers] [m +++ OK, passed 100 tests.
[2m[unordered-containers] [m
[2m[unordered-containers] [mAll 257 tests passed (1.27s)
[2m[unordered-containers] [mTest suite unordered-containers-tests: PASS
[2m[unordered-containers] [mTest suite logged to:
[2m[unordered-containers] [mdist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
[2m[unordered-containers] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[unordered-containers] [mcheckPhase completed in 1 minutes 12 seconds
[2m[unordered-containers] [m[1;36mPhase: haddockPhase[m
[2m[shellcheck] [m[1;36mPhase: unpackPhase[m
[2m[shellcheck] [munpacking source archive /nix/store/0y569php6xr1v629bbggizl1ba1mrf5b-ShellCheck-0.11.0.tar.gz
[2m[shellcheck] [msource root is ShellCheck-0.11.0
[2m[shellcheck] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "ShellCheck-0.11.0/test/shellcheck.hs"
[2m[shellcheck] [m[1;36mPhase: patchPhase[m
[2m[shellcheck] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[unordered-containers] [mPreprocessing library for unordered-containers-0.2.20.1..
[2m[unordered-containers] [mRunning Haddock on library for unordered-containers-0.2.20.1..
[2m[shellcheck] [m[1;36mPhase: configurePhase[m
[2m[shellcheck] [mno configure script, doing nothing
[2m[shellcheck] [m[1;36mPhase: buildPhase[m
[2m[unordered-containers] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[shellcheck] [m[1;36mPhase: installPhase[m
[2m[shellcheck] [m[1;36mPhase: fixupPhase[m
[2m[shellcheck] [mshrinking RPATHs of ELF executables and libraries in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin
[2m[shellcheck] [mshrinking /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin/bin/shellcheck
[2m[shellcheck] [mchecking for references to /build/ in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin...
[2m[shellcheck] [mpatching script interpreter paths in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin
[2m[shellcheck] [mstripping (with command strip and flags -S -p) in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin/bin
[2m[shellcheck] [mshrinking RPATHs of ELF executables and libraries in /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man
[2m[shellcheck] [mchecking for references to /build/ in /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man...
[2m[unordered-containers] [m
[2m[unordered-containers] [m[;1mData/HashMap/Internal.hs:12:14-23: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-53692[0m[0m[;1m] [[;1m[35m-Wdeprecated-flags[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead[0m[0m
[2m[unordered-containers] [m[;1m[34m |[0m[0m
[2m[unordered-containers] [m[;1m[34m12 |[0m[0m {-# LANGUAGE [;1m[35mTypeInType[0m[0m #-}
[2m[unordered-containers] [m[;1m[34m |[0m[0m[;1m[35m ^^^^^^^^^^[0m[0m
[2m[shellcheck] [mgzipping man pages under /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man/share/man/
[2m[shellcheck] [mpatching script interpreter paths in /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man
[2m[shellcheck] [mshrinking RPATHs of ELF executables and libraries in /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc
[2m[shellcheck] [mchecking for references to /build/ in /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc...
[2m[shellcheck] [mpatching script interpreter paths in /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc
[2m[shellcheck] [mshrinking RPATHs of ELF executables and libraries in /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0
[2m[shellcheck] [mchecking for references to /build/ in /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0...
[2m[shellcheck] [mpatching script interpreter paths in /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0
[2m[shellcheck:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0 /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man[m
[2m[shellcheck:post-build] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[shellcheck:post-build] [m[2mUploading to the NixCI cache: /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0 /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man[m
[2m[shellcheck:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[shellcheck:post-build] [m[2mcopying 1 paths...[m
[2m[shellcheck:post-build] [m[2mcopying path '/nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin' to 'https://cache.nix-ci.com'...[m
[2m[shellcheck:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[shellcheck:post-build] [m[2mcopying 0 paths...[m
[2mProgress: 28 of 38 built (1 building), 559 of 559 downloaded from cache[m
[1;34mBuilding /nix/store/na71b1qblfcv0x84nz68yybh61b6qjlv-bash-language-server-5.6.0.drv[m
[2m[unordered-containers] [m[1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
[2m[unordered-containers] [m
[2m[unordered-containers] [m[;1mData/HashMap/Internal/Array.hs:83:1-35: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m The import of ‘Control.Applicative’ is redundant
[2m[unordered-containers] [m except perhaps to import instances from ‘Control.Applicative’
[2m[unordered-containers] [m To import instances alone, use: import Control.Applicative()[0m[0m
[2m[unordered-containers] [m[;1m[34m |[0m[0m
[2m[unordered-containers] [m[;1m[34m83 |[0m[0m [;1m[35mimport Control.Applicative (liftA2)[0m[0m
[2m[unordered-containers] [m[;1m[34m |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[unordered-containers] [m[2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
[2m[unordered-containers] [m[3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
[2m[unordered-containers] [m[4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
[2m[unordered-containers] [m[5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
[2m[unordered-containers] [m[6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
[2m[unordered-containers] [m[7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
[2m[unordered-containers] [m[8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
[2m[unordered-containers] [m[9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
[2m[unordered-containers] [mHaddock coverage:
[2m[unordered-containers] [m 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
[2m[unordered-containers] [m Missing documentation for:
[2m[unordered-containers] [m Array (Data/HashMap/Internal/Array.hs:125)
[2m[unordered-containers] [m MArray (Data/HashMap/Internal/Array.hs:157)
[2m[unordered-containers] [m new_ (Data/HashMap/Internal/Array.hs:208)
[2m[unordered-containers] [m singleton (Data/HashMap/Internal/Array.hs:225)
[2m[unordered-containers] [m singletonM (Data/HashMap/Internal/Array.hs:229)
[2m[unordered-containers] [m snoc (Data/HashMap/Internal/Array.hs:233)
[2m[unordered-containers] [m pair (Data/HashMap/Internal/Array.hs:242)
[2m[unordered-containers] [m length (Data/HashMap/Internal/Array.hs:154)
[2m[unordered-containers] [m lengthM (Data/HashMap/Internal/Array.hs:162)
[2m[unordered-containers] [m read (Data/HashMap/Internal/Array.hs:249)
[2m[unordered-containers] [m write (Data/HashMap/Internal/Array.hs:255)
[2m[unordered-containers] [m index (Data/HashMap/Internal/Array.hs:262)
[2m[unordered-containers] [m indexM (Data/HashMap/Internal/Array.hs:274)
[2m[unordered-containers] [m index# (Data/HashMap/Internal/Array.hs:268)
[2m[unordered-containers] [m sameArray1 (Data/HashMap/Internal/Array.hs:140)
[2m[unordered-containers] [m unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
[2m[unordered-containers] [m unsafeThaw (Data/HashMap/Internal/Array.hs:286)
[2m[unordered-containers] [m unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
[2m[unordered-containers] [m run (Data/HashMap/Internal/Array.hs:292)
[2m[unordered-containers] [m cloneM (Data/HashMap/Internal/Array.hs:314)
[2m[unordered-containers] [m foldl (Data/HashMap/Internal/Array.hs:404)
[2m[unordered-containers] [m foldl' (Data/HashMap/Internal/Array.hs:375)
[2m[unordered-containers] [m foldr (Data/HashMap/Internal/Array.hs:394)
[2m[unordered-containers] [m foldr' (Data/HashMap/Internal/Array.hs:385)
[2m[unordered-containers] [m foldMap (Data/HashMap/Internal/Array.hs:417)
[2m[unordered-containers] [m thaw (Data/HashMap/Internal/Array.hs:436)
[2m[unordered-containers] [m map (Data/HashMap/Internal/Array.hs:461)
[2m[unordered-containers] [m traverse (Data/HashMap/Internal/Array.hs:537)
[2m[unordered-containers] [m traverse' (Data/HashMap/Internal/Array.hs:553)
[2m[unordered-containers] [m toList (Data/HashMap/Internal/Array.hs:529)
[2m[unordered-containers] [m fromList (Data/HashMap/Internal/Array.hs:494)
[2m[unordered-containers] [m fromList' (Data/HashMap/Internal/Array.hs:506)
[2m[unordered-containers] [m 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
[2m[unordered-containers] [m Missing documentation for:
[2m[unordered-containers] [m isPermutationBy (Data/HashMap/Internal/List.hs:40)
[2m[unordered-containers] [m deleteBy (Data/HashMap/Internal/List.hs:83)
[2m[unordered-containers] [m unorderedCompare (Data/HashMap/Internal/List.hs:68)
[2m[unordered-containers] [mWarning: 'Leaf' is ambiguous. It is defined
[2m[unordered-containers] [m * at Data/HashMap/Internal.hs:227:7
[2m[unordered-containers] [m * at Data/HashMap/Internal.hs:187:1
[2m[unordered-containers] [m You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
[2m[unordered-containers] [mWarning: 'at' is out of scope.
[2m[unordered-containers] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[unordered-containers] [m 88% ( 93 /105) in 'Data.HashMap.Internal'
[2m[unordered-containers] [m Missing documentation for:
[2m[unordered-containers] [m Leaf (Data/HashMap/Internal.hs:187)
[2m[unordered-containers] [m intersectionWithKey# (Data/HashMap/Internal.hs:1859)
[2m[unordered-containers] [m updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
[2m[unordered-containers] [m equalKeys (Data/HashMap/Internal.hs:513)
[2m[unordered-containers] [m equalKeys1 (Data/HashMap/Internal.hs:497)
[2m[unordered-containers] [m lookupRecordCollision (Data/HashMap/Internal.hs:680)
[2m[unordered-containers] [m LookupRes (Data/HashMap/Internal.hs:659)
[2m[unordered-containers] [m lookupResToMaybe (Data/HashMap/Internal.hs:662)
[2m[unordered-containers] [m insert' (Data/HashMap/Internal.hs:808)
[2m[unordered-containers] [m delete' (Data/HashMap/Internal.hs:1126)
[2m[unordered-containers] [m insertNewKey (Data/HashMap/Internal.hs:850)
[2m[unordered-containers] [m insertKeyExists (Data/HashMap/Internal.hs:885)
[2m[unordered-containers] [m 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
[2m[unordered-containers] [m Missing documentation for:
[2m[unordered-containers] [m valid (Data/HashMap/Internal/Debug.hs:98)
[2m[unordered-containers] [m Validity (Data/HashMap/Internal/Debug.hs:43)
[2m[unordered-containers] [m SubHashPath (Data/HashMap/Internal/Debug.hs:75)
[2m[unordered-containers] [mWarning: 'lookup' is out of scope.
[2m[unordered-containers] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[unordered-containers] [mWarning: 'at' is out of scope.
[2m[unordered-containers] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[unordered-containers] [m 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
[2m[unordered-containers] [mWarning: 'HashSet' is ambiguous. It is defined
[2m[unordered-containers] [m * at Data/HashSet/Internal.hs:112:21
[2m[unordered-containers] [m * at Data/HashSet/Internal.hs:112:1
[2m[unordered-containers] [m You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
[2m[unordered-containers] [m 100% ( 35 / 35) in 'Data.HashSet.Internal'
[2m[unordered-containers] [mWarning: 'HashSet' is ambiguous. It is defined
[2m[unordered-containers] [m * at Data/HashSet/Internal.hs:112:21
[2m[unordered-containers] [m * at Data/HashSet/Internal.hs:112:1
[2m[unordered-containers] [m You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
[2m[unordered-containers] [m 100% ( 32 / 32) in 'Data.HashSet'
[2m[unordered-containers] [m 100% ( 69 / 69) in 'Data.HashMap.Strict'
[2m[unordered-containers] [m 100% ( 69 / 69) in 'Data.HashMap.Lazy'
[2m[unordered-containers] [mWarning: Data.HashMap.Internal: could not find link destinations for:
[2m[unordered-containers] [m - Data.HashMap.Internal.D:R:ItemHashMap
[2m[unordered-containers] [mWarning: Data.HashMap.Internal.Strict: could not find link destinations for:
[2m[unordered-containers] [m - Data.HashMap.Internal.D:R:ItemHashMap
[2m[unordered-containers] [mWarning: Data.HashSet.Internal: could not find link destinations for:
[2m[unordered-containers] [m - Data.HashSet.Internal.D:R:ItemHashSet
[2m[unordered-containers] [mWarning: Data.HashSet: could not find link destinations for:
[2m[unordered-containers] [m - Data.HashSet.Internal.D:R:ItemHashSet
[2m[unordered-containers] [mWarning: Data.HashMap.Strict: could not find link destinations for:
[2m[unordered-containers] [m - Data.HashMap.Internal.D:R:ItemHashMap
[2m[unordered-containers] [mWarning: Data.HashMap.Lazy: could not find link destinations for:
[2m[unordered-containers] [m - Data.HashMap.Internal.D:R:ItemHashMap
[2m[bash-language-server] [mUsing versionCheckHook
[2m[bash-language-server] [m[1;36mPhase: unpackPhase[m
[2m[bash-language-server] [munpacking source archive /nix/store/lxydhrakpk9ccbjzavdgm3f3imkypnw2-source
[2m[bash-language-server] [msource root is source
[2m[bash-language-server] [m[1;36mPhase: patchPhase[m
[2m[bash-language-server] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[bash-language-server] [m[1;36mPhase: configurePhase[m
[2m[bash-language-server] [mno configure script, doing nothing
[2m[bash-language-server] [mExecuting pnpmConfigHook
[2m[bash-language-server] [mFound 'pnpm' with version '10.28.0'
[2m[bash-language-server] [mUsing fetcherVersion: 3
[2m[bash-language-server] [mConfiguring pnpm store
[2m[bash-language-server] [m/build /build/source
[2m[bash-language-server] [m/build/source
[2m[bash-language-server] [mInstalling dependencies
[2m[unordered-containers] [mDocumentation created: dist/doc/html/unordered-containers/,
[2m[unordered-containers] [mdist/doc/html/unordered-containers/unordered-containers.txt
[2m[unordered-containers] [mPreprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
[2m[unordered-containers] [m[1;36mPhase: installPhase[m
[2m[unordered-containers] [mInstalling library in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
[2m[bash-language-server] [mLockfile is up to date, resolution step is skipped
[2m[bash-language-server] [mProgress: resolved [96m1[39m, reused [96m0[39m, downloaded [96m0[39m, added [96m0[39m
[2m[bash-language-server] [m[1A. | [32m+416[39m [0K
[2m[bash-language-server] [mProgress: resolved [96m1[39m, reused [96m0[39m, downloaded [96m0[39m, added [96m0[39m
[2m[bash-language-server] [m[1AProgress: resolved [96m416[39m, reused [96m244[39m, downloaded [96m0[39m, added [96m0[39m
[2m[unordered-containers] [m[1;36mPhase: fixupPhase[m
[2m[unordered-containers] [mshrinking RPATHs of ELF executables and libraries in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1
[2m[unordered-containers] [mshrinking /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSunordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78-ghc9.8.4.so
[2m[unordered-containers] [mchecking for references to /build/ in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1...
[2m[unordered-containers] [mpatching script interpreter paths in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1
[2m[unordered-containers] [mstripping (with command strip and flags -S -p) in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib
[2m[bash-language-server] [m[1AProgress: resolved [96m416[39m, reused [96m416[39m, downloaded [96m0[39m, added [96m224[39m
[2m[unordered-containers] [mshrinking RPATHs of ELF executables and libraries in /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc
[2m[unordered-containers] [mchecking for references to /build/ in /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc...
[2m[unordered-containers] [mpatching script interpreter paths in /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc
[2m[unordered-containers:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1[m
[2m[unordered-containers:post-build] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[unordered-containers:post-build] [m[2mUploading to the NixCI cache: /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1[m
[2m[unordered-containers:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[unordered-containers:post-build] [m[2mcopying 1 paths...[m
[2m[unordered-containers:post-build] [m[2mcopying path '/nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...[m
[2m[unordered-containers:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[unordered-containers:post-build] [m[2mcopying 0 paths...[m
[2mProgress: 29 of 38 built (1 building), 559 of 559 downloaded from cache[m
[1;34mBuilding /nix/store/c1cwys0z767qcz2bh7ipnhm9pcrxdypk-quickcheck-instances-0.3.33.drv[m
[2m[bash-language-server] [m[1AProgress: resolved [96m416[39m, reused [96m416[39m, downloaded [96m0[39m, added [96m413[39m
[2m[bash-language-server] [m[1AProgress: resolved [96m416[39m, reused [96m416[39m, downloaded [96m0[39m, added [96m416[39m, done
[2m[bash-language-server] [mDone in 1.2s using pnpm v10.28.0
[2m[bash-language-server] [mPatching scripts
[2m[bash-language-server] [mpatching 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
[2m[bash-language-server] [mnode_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.bin/eslint-config-prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.bin/ts-jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.bin/installServerIntoExtension: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.bin/jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.bin/prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/eslint-config-prettier@9.1.0_eslint@8.57.1/node_modules/eslint-config-prettier/bin/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/eslint-config-prettier@9.1.0_eslint@8.57.1/node_modules/eslint-config-prettier/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/istanbul-lib-instrument@6.0.0/node_modules/istanbul-lib-instrument/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/istanbul-lib-instrument@6.0.0/node_modules/istanbul-lib-instrument/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/exit@0.1.2/node_modules/exit/test/fixtures/create-files.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/bash"
[2m[bash-language-server] [mnode_modules/.pnpm/@typescript-eslint+type-utils@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/type-utils/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@typescript-eslint+type-utils@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/type-utils/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@typescript-eslint+type-utils@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/type-utils/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/editorconfig@2.0.1/node_modules/editorconfig/bin/editorconfig: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/editorconfig@2.0.1/node_modules/editorconfig/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/esprima@4.0.1/node_modules/esprima/bin/esvalidate.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/esprima@4.0.1/node_modules/esprima/bin/esparse.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/import-local@3.1.0/node_modules/import-local/fixtures/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/ejs@3.1.10/node_modules/ejs/bin/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/ejs@3.1.10/node_modules/ejs/node_modules/.bin/jake: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/make-dir@3.1.0/node_modules/make-dir/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@typescript-eslint+utils@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/utils/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/flat-cache@3.0.4/node_modules/flat-cache/node_modules/.bin/rimraf: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@babel+parser@7.22.6/node_modules/@babel/parser/bin/babel-parser.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/eslint-plugin-jest@28.11.0_@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+p_bba564ecab3f9dda53acf7b3e4516a01/node_modules/eslint-plugin-jest/node_modules/.bin/jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/eslint-plugin-jest@28.11.0_@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+p_bba564ecab3f9dda53acf7b3e4516a01/node_modules/eslint-plugin-jest/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@eslint+eslintrc@2.1.4/node_modules/@eslint/eslintrc/node_modules/.bin/js-yaml: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/semver@6.3.1/node_modules/semver/bin/semver.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/browserslist@4.21.9/node_modules/browserslist/node_modules/.bin/update-browserslist-db: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/browserslist@4.21.9/node_modules/browserslist/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/resolve@1.22.2/node_modules/resolve/bin/resolve: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/@types+babel__template@7.4.1/node_modules/@types/babel__template/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@babel+helper-compilation-targets@7.22.6_@babel+core@7.22.6/node_modules/@babel/helper-compilation-targets/node_modules/.bin/browserslist: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@babel+helper-compilation-targets@7.22.6_@babel+core@7.22.6/node_modules/@babel/helper-compilation-targets/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@typescript-eslint+parser@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/parser/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@typescript-eslint+parser@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/parser/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@typescript-eslint+parser@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/parser/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/acorn-jsx@5.3.2_acorn@8.9.0/node_modules/acorn-jsx/node_modules/.bin/acorn: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/eslint@8.57.1/node_modules/eslint/bin/eslint.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/eslint@8.57.1/node_modules/eslint/node_modules/.bin/js-yaml: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@babel+template@7.22.5/node_modules/@babel/template/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/jest-snapshot@29.7.0/node_modules/jest-snapshot/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/espree@9.6.1/node_modules/espree/node_modules/.bin/acorn: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/istanbul-lib-instrument@5.2.1/node_modules/istanbul-lib-instrument/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/istanbul-lib-instrument@5.2.1/node_modules/istanbul-lib-instrument/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@babel+core@7.22.6/node_modules/@babel/core/node_modules/.bin/json5: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@babel+core@7.22.6/node_modules/@babel/core/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@babel+core@7.22.6/node_modules/@babel/core/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/json5@2.2.3/node_modules/json5/lib/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/@babel+generator@7.23.0/node_modules/@babel/generator/node_modules/.bin/jsesc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/jest-resolve@29.7.0/node_modules/jest-resolve/node_modules/.bin/resolve: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@types+babel__core@7.20.1/node_modules/@types/babel__core/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/update-browserslist-db@1.0.11_browserslist@4.21.9/node_modules/update-browserslist-db/node_modules/.bin/browserslist: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/update-browserslist-db@1.0.11_browserslist@4.21.9/node_modules/update-browserslist-db/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/typescript@5.6.3/node_modules/typescript/bin/tsc: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/typescript@5.6.3/node_modules/typescript/bin/tsserver: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/acorn@8.9.0/node_modules/acorn/bin/acorn: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/rimraf@3.0.2/node_modules/rimraf/bin.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/which@2.0.2/node_modules/which/bin/node-which: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/create-jest@29.7.0_@types+node@18.19.86/node_modules/create-jest/bin/create-jest.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/@babel+parser@7.23.0/node_modules/@babel/parser/bin/babel-parser.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/eslint-plugin-sort-class-members@1.21.0_eslint@8.57.1/node_modules/eslint-plugin-sort-class-members/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/cross-spawn@7.0.6/node_modules/cross-spawn/node_modules/.bin/node-which: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@typescript-eslint+typescript-estree@7.18.0_typescript@5.6.3/node_modules/@typescript-eslint/typescript-estree/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@typescript-eslint+typescript-estree@7.18.0_typescript@5.6.3/node_modules/@typescript-eslint/typescript-estree/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@typescript-eslint+typescript-estree@7.18.0_typescript@5.6.3/node_modules/@typescript-eslint/typescript-estree/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/jest@29.7.0_@types+node@18.19.86/node_modules/jest/bin/jest.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/jest@29.7.0_@types+node@18.19.86/node_modules/jest/node_modules/.bin/import-local-fixture: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/jest@29.7.0_@types+node@18.19.86/node_modules/jest/node_modules/.bin/jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/semver@7.7.1/node_modules/semver/bin/semver.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/eslint-plugin-simple-import-sort@12.1.1_eslint@8.57.1/node_modules/eslint-plugin-simple-import-sort/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/ts-api-utils@1.3.0_typescript@5.6.3/node_modules/ts-api-utils/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/ts-api-utils@1.3.0_typescript@5.6.3/node_modules/ts-api-utils/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/js-yaml@4.1.0/node_modules/js-yaml/bin/js-yaml.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/js-yaml@3.14.1/node_modules/js-yaml/bin/js-yaml.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/js-yaml@3.14.1/node_modules/js-yaml/node_modules/.bin/esparse: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/js-yaml@3.14.1/node_modules/js-yaml/node_modules/.bin/esvalidate: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@istanbuljs+load-nyc-config@1.1.0/node_modules/@istanbuljs/load-nyc-config/node_modules/.bin/js-yaml: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@babel+traverse@7.23.2/node_modules/@babel/traverse/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/prettier@2.8.8/node_modules/prettier/bin-prettier.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/@nicolo-ribaudo+semver-v6@6.3.3/node_modules/@nicolo-ribaudo/semver-v6/bin/semver.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+parser@7.18.0_eslint@8.57.1__e6014347be2ddc1aabad24015a3e65d1/node_modules/@typescript-eslint/eslint-plugin/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+parser@7.18.0_eslint@8.57.1__e6014347be2ddc1aabad24015a3e65d1/node_modules/@typescript-eslint/eslint-plugin/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+parser@7.18.0_eslint@8.57.1__e6014347be2ddc1aabad24015a3e65d1/node_modules/@typescript-eslint/eslint-plugin/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/eslint-plugin-prettier@4.2.1_eslint-config-prettier@9.1.0_eslint@8.57.1__eslint@8.57.1_prettier@2.8.8/node_modules/eslint-plugin-prettier/node_modules/.bin/eslint-config-prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/eslint-plugin-prettier@4.2.1_eslint-config-prettier@9.1.0_eslint@8.57.1__eslint@8.57.1_prettier@2.8.8/node_modules/eslint-plugin-prettier/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/eslint-plugin-prettier@4.2.1_eslint-config-prettier@9.1.0_eslint@8.57.1__eslint@8.57.1_prettier@2.8.8/node_modules/eslint-plugin-prettier/node_modules/.bin/prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@eslint-community+eslint-utils@4.4.0_eslint@8.57.1/node_modules/@eslint-community/eslint-utils/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/vscode-languageserver@8.0.2/node_modules/vscode-languageserver/bin/installServerIntoExtension: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/jest-cli@29.7.0_@types+node@18.19.86/node_modules/jest-cli/bin/jest.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[quickcheck-instances] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[bash-language-server] [mnode_modules/.pnpm/jest-cli@29.7.0_@types+node@18.19.86/node_modules/jest-cli/node_modules/.bin/import-local-fixture: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[quickcheck-instances] [mBuild with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
[2m[bash-language-server] [mnode_modules/.pnpm/jest-cli@29.7.0_@types+node@18.19.86/node_modules/jest-cli/node_modules/.bin/create-jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/json5: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/ejs: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/jsesc@2.5.2/node_modules/jsesc/bin/jsesc: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/jake@10.9.2/node_modules/jake/bin/bash_completion.sh: interpreter directive changed from "#!/bin/bash" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/bash"
[2m[bash-language-server] [mnode_modules/.pnpm/jake@10.9.2/node_modules/jake/bin/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
[2m[bash-language-server] [mnode_modules/.pnpm/@babel+generator@7.22.5/node_modules/@babel/generator/node_modules/.bin/jsesc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mnode_modules/.pnpm/@babel+template@7.22.15/node_modules/@babel/template/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [mFinished pnpmConfigHook
[2m[bash-language-server] [m[1;36mPhase: buildPhase[m
[2m[quickcheck-instances] [m[1;36mPhase: unpackPhase[m
[2m[quickcheck-instances] [munpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
[2m[quickcheck-instances] [msource root is quickcheck-instances-0.3.33
[2m[quickcheck-instances] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
[2m[quickcheck-instances] [m[1;36mPhase: patchPhase[m
[2m[quickcheck-instances] [mReplace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
[2m[quickcheck-instances] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[quickcheck-instances] [msetupCompileFlags: -package-db=/build/tmp.UzC5wXVn3L/setup-package.conf.d -threaded
[2m[quickcheck-instances] [m[1 of 2] Compiling Main ( Setup.hs, /build/tmp.UzC5wXVn3L/Main.o )
[2m[quickcheck-instances] [m[2 of 2] Linking Setup
[2m[bash-language-server] [m
[2m[bash-language-server] [m> @ compile /build/source
[2m[bash-language-server] [m> tsc -b server
[2m[bash-language-server] [m
[2m[quickcheck-instances] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[quickcheck-instances] [m[1;36mPhase: configurePhase[m
[2m[quickcheck-instances] [mconfigureFlags: --verbose --prefix=/nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.UzC5wXVn3L/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
[2m[quickcheck-instances] [mUsing Parsec parser
[2m[quickcheck-instances] [mConfiguring quickcheck-instances-0.3.33...
[2m[quickcheck-instances] [mDependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
[2m[quickcheck-instances] [mDependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
[2m[quickcheck-instances] [mDependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
[2m[quickcheck-instances] [mDependency base >=4.12.0.0 && <4.22: using base-4.19.2.0
[2m[quickcheck-instances] [mDependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.1.0
[2m[quickcheck-instances] [mDependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
[2m[quickcheck-instances] [mDependency containers >=0.6.0.1 && <0.8: using containers-0.6.8
[2m[quickcheck-instances] [mDependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
[2m[quickcheck-instances] [mDependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
[2m[quickcheck-instances] [mDependency integer-logarithms >=1.0.3.1 && <1.1: using
[2m[quickcheck-instances] [minteger-logarithms-1.0.4
[2m[quickcheck-instances] [mDependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
[2m[quickcheck-instances] [mDependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
[2m[quickcheck-instances] [mDependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
[2m[quickcheck-instances] [mDependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
[2m[quickcheck-instances] [mDependency strict >=0.5 && <0.6: using strict-0.5.1
[2m[quickcheck-instances] [mDependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
[2m[quickcheck-instances] [mDependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.1
[2m[quickcheck-instances] [mDependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
[2m[quickcheck-instances] [mDependency these >=1.2.1 && <1.3: using these-1.2.1
[2m[quickcheck-instances] [mDependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
[2m[quickcheck-instances] [mDependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.0
[2m[quickcheck-instances] [mDependency unordered-containers >=0.2.20 && <0.3: using
[2m[quickcheck-instances] [munordered-containers-0.2.20.1
[2m[quickcheck-instances] [mDependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
[2m[quickcheck-instances] [mDependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
[2m[quickcheck-instances] [mDependency QuickCheck: using QuickCheck-2.15.0.1
[2m[quickcheck-instances] [mDependency base: using base-4.19.2.0
[2m[quickcheck-instances] [mDependency containers: using containers-0.6.8
[2m[quickcheck-instances] [mDependency primitive: using primitive-0.9.1.0
[2m[quickcheck-instances] [mDependency quickcheck-instances: using quickcheck-instances-0.3.33
[2m[quickcheck-instances] [mDependency tagged: using tagged-0.8.9
[2m[quickcheck-instances] [mDependency uuid-types: using uuid-types-1.0.6
[2m[bash-language-server] [m[1;36mPhase: installPhase[m
[2m[quickcheck-instances] [mSource component graph:
[2m[quickcheck-instances] [m component lib
[2m[quickcheck-instances] [m component test:self-test dependency lib
[2m[quickcheck-instances] [mConfigured component graph:
[2m[quickcheck-instances] [m component quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
[2m[quickcheck-instances] [m include OneTuple-0.4.2-3dnbGs3iswl7RfPlzcJwqJ
[2m[quickcheck-instances] [m include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[quickcheck-instances] [m include array-0.5.8.0-cf4f
[2m[quickcheck-instances] [m include base-4.19.2.0-8274
[2m[quickcheck-instances] [m include bytestring-0.12.1.0-b028
[2m[quickcheck-instances] [m include case-insensitive-1.2.1.0-A80fjc7bt7F8zyu1Co3PYR
[2m[quickcheck-instances] [m include containers-0.6.8-15d9
[2m[quickcheck-instances] [m include data-fix-0.3.4-360QE3oeLg37mRDz4E1QQM
[2m[quickcheck-instances] [m include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
[2m[quickcheck-instances] [m include integer-logarithms-1.0.4-agSqjWr09W26NT8ma47bp
[2m[quickcheck-instances] [m include old-time-1.1.0.4-D73MxqqL3KfK08Nc3LLQEf
[2m[quickcheck-instances] [m include primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
[2m[quickcheck-instances] [m include scientific-0.3.8.0-GUBWFK4PPRa6pHV2jzXM87
[2m[quickcheck-instances] [m include splitmix-0.1.3.1-Ap5ujF9ygfC1hmiXTupD1c
[2m[quickcheck-instances] [m include strict-0.5.1-CPTwyWVhsgEFcK4y38LphJ
[2m[quickcheck-instances] [m include tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
[2m[quickcheck-instances] [m include text-2.1.1-5314
[2m[quickcheck-instances] [m include text-short-0.1.6-DjkPcCVpjvo6ni5Bq060rV
[2m[quickcheck-instances] [m include these-1.2.1-ARnkrz7xAAq8aGkU9KnuYZ
[2m[quickcheck-instances] [m include time-compat-1.9.8-9ETWUZXGnzD3oVa6CRabZ
[2m[quickcheck-instances] [m include transformers-0.6.1.0-388b
[2m[quickcheck-instances] [m include unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
[2m[quickcheck-instances] [m include uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
[2m[quickcheck-instances] [m include vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
[2m[quickcheck-instances] [m component quickcheck-instances-0.3.33-DxDfyIwBSY3GtIh6NSz4ux-self-test
[2m[quickcheck-instances] [m include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[quickcheck-instances] [m include base-4.19.2.0-8274
[2m[quickcheck-instances] [m include containers-0.6.8-15d9
[2m[quickcheck-instances] [m include primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
[2m[quickcheck-instances] [m include quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
[2m[quickcheck-instances] [m include tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
[2m[quickcheck-instances] [m include uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
[2m[quickcheck-instances] [mLinked component graph:
[2m[quickcheck-instances] [m unit quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
[2m[quickcheck-instances] [m include OneTuple-0.4.2-3dnbGs3iswl7RfPlzcJwqJ
[2m[quickcheck-instances] [m include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[quickcheck-instances] [m include array-0.5.8.0-cf4f
[2m[quickcheck-instances] [m include base-4.19.2.0-8274
[2m[quickcheck-instances] [m include bytestring-0.12.1.0-b028
[2m[quickcheck-instances] [m include case-insensitive-1.2.1.0-A80fjc7bt7F8zyu1Co3PYR
[2m[quickcheck-instances] [m include containers-0.6.8-15d9
[2m[quickcheck-instances] [m include data-fix-0.3.4-360QE3oeLg37mRDz4E1QQM
[2m[quickcheck-instances] [m include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
[2m[quickcheck-instances] [m include integer-logarithms-1.0.4-agSqjWr09W26NT8ma47bp
[2m[quickcheck-instances] [m include old-time-1.1.0.4-D73MxqqL3KfK08Nc3LLQEf
[2m[quickcheck-instances] [m include primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
[2m[quickcheck-instances] [m include scientific-0.3.8.0-GUBWFK4PPRa6pHV2jzXM87
[2m[quickcheck-instances] [m include splitmix-0.1.3.1-Ap5ujF9ygfC1hmiXTupD1c
[2m[quickcheck-instances] [m include strict-0.5.1-CPTwyWVhsgEFcK4y38LphJ
[2m[quickcheck-instances] [m include tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
[2m[quickcheck-instances] [m include text-2.1.1-5314
[2m[quickcheck-instances] [m include text-short-0.1.6-DjkPcCVpjvo6ni5Bq060rV
[2m[quickcheck-instances] [m include these-1.2.1-ARnkrz7xAAq8aGkU9KnuYZ
[2m[quickcheck-instances] [m include time-compat-1.9.8-9ETWUZXGnzD3oVa6CRabZ
[2m[quickcheck-instances] [m include transformers-0.6.1.0-388b
[2m[quickcheck-instances] [m include unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
[2m[quickcheck-instances] [m include uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
[2m[quickcheck-instances] [m include vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
[2m[quickcheck-instances] [m Test.QuickCheck.Instances=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Void
[2m[quickcheck-instances] [m unit quickcheck-instances-0.3.33-DxDfyIwBSY3GtIh6NSz4ux-self-test
[2m[quickcheck-instances] [m include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[quickcheck-instances] [m include base-4.19.2.0-8274
[2m[quickcheck-instances] [m include containers-0.6.8-15d9
[2m[quickcheck-instances] [m include primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
[2m[quickcheck-instances] [m include quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
[2m[quickcheck-instances] [m include tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
[2m[quickcheck-instances] [m include uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
[2m[quickcheck-instances] [mReady component graph:
[2m[quickcheck-instances] [m definite quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
[2m[quickcheck-instances] [m depends OneTuple-0.4.2-3dnbGs3iswl7RfPlzcJwqJ
[2m[quickcheck-instances] [m depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[quickcheck-instances] [m depends array-0.5.8.0-cf4f
[2m[quickcheck-instances] [m depends base-4.19.2.0-8274
[2m[quickcheck-instances] [m depends bytestring-0.12.1.0-b028
[2m[quickcheck-instances] [m depends case-insensitive-1.2.1.0-A80fjc7bt7F8zyu1Co3PYR
[2m[quickcheck-instances] [m depends containers-0.6.8-15d9
[2m[quickcheck-instances] [m depends data-fix-0.3.4-360QE3oeLg37mRDz4E1QQM
[2m[quickcheck-instances] [m depends hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
[2m[quickcheck-instances] [m depends integer-logarithms-1.0.4-agSqjWr09W26NT8ma47bp
[2m[quickcheck-instances] [m depends old-time-1.1.0.4-D73MxqqL3KfK08Nc3LLQEf
[2m[quickcheck-instances] [m depends primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
[2m[quickcheck-instances] [m depends scientific-0.3.8.0-GUBWFK4PPRa6pHV2jzXM87
[2m[quickcheck-instances] [m depends splitmix-0.1.3.1-Ap5ujF9ygfC1hmiXTupD1c
[2m[quickcheck-instances] [m depends strict-0.5.1-CPTwyWVhsgEFcK4y38LphJ
[2m[quickcheck-instances] [m depends tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
[2m[quickcheck-instances] [m depends text-2.1.1-5314
[2m[quickcheck-instances] [m depends text-short-0.1.6-DjkPcCVpjvo6ni5Bq060rV
[2m[quickcheck-instances] [m depends these-1.2.1-ARnkrz7xAAq8aGkU9KnuYZ
[2m[quickcheck-instances] [m depends time-compat-1.9.8-9ETWUZXGnzD3oVa6CRabZ
[2m[quickcheck-instances] [m depends transformers-0.6.1.0-388b
[2m[quickcheck-instances] [m depends unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
[2m[quickcheck-instances] [m depends uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
[2m[quickcheck-instances] [m depends vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
[2m[quickcheck-instances] [m definite quickcheck-instances-0.3.33-DxDfyIwBSY3GtIh6NSz4ux-self-test
[2m[quickcheck-instances] [m depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[quickcheck-instances] [m depends base-4.19.2.0-8274
[2m[quickcheck-instances] [m depends containers-0.6.8-15d9
[2m[quickcheck-instances] [m depends primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
[2m[quickcheck-instances] [m depends quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
[2m[quickcheck-instances] [m depends tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
[2m[quickcheck-instances] [m depends uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
[2m[quickcheck-instances] [mUsing Cabal-3.10.3.0 compiled by ghc-9.8
[2m[quickcheck-instances] [mUsing compiler: ghc-9.8.4
[2m[quickcheck-instances] [mUsing install prefix:
[2m[quickcheck-instances] [m/nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33
[2m[quickcheck-instances] [mExecutables installed in:
[2m[quickcheck-instances] [m/nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/bin
[2m[quickcheck-instances] [mLibraries installed in:
[2m[quickcheck-instances] [m/nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
[2m[quickcheck-instances] [mDynamic Libraries installed in:
[2m[quickcheck-instances] [m/nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
[2m[quickcheck-instances] [mPrivate executables installed in:
[2m[quickcheck-instances] [m/nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33
[2m[quickcheck-instances] [mData files installed in:
[2m[quickcheck-instances] [m/nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33
[2m[quickcheck-instances] [mDocumentation installed in:
[2m[quickcheck-instances] [m/nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
[2m[quickcheck-instances] [mConfiguration files installed in:
[2m[quickcheck-instances] [m/nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/etc
[2m[quickcheck-instances] [mNo alex found
[2m[quickcheck-instances] [mUsing ar found on system at:
[2m[quickcheck-instances] [m/nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
[2m[quickcheck-instances] [mNo c2hs found
[2m[quickcheck-instances] [mNo cpphs found
[2m[quickcheck-instances] [mNo doctest found
[2m[quickcheck-instances] [mUsing gcc version 14.3.0 given by user at:
[2m[quickcheck-instances] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
[2m[quickcheck-instances] [mUsing ghc version 9.8.4 found on system at:
[2m[quickcheck-instances] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
[2m[quickcheck-instances] [mUsing ghc-pkg version 9.8.4 found on system at:
[2m[quickcheck-instances] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
[2m[quickcheck-instances] [mNo ghcjs found
[2m[quickcheck-instances] [mNo ghcjs-pkg found
[2m[quickcheck-instances] [mNo greencard found
[2m[quickcheck-instances] [mUsing haddock version 2.30.0 found on system at:
[2m[quickcheck-instances] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
[2m[quickcheck-instances] [mNo happy found
[2m[quickcheck-instances] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[quickcheck-instances] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[quickcheck-instances] [mNo hmake found
[2m[quickcheck-instances] [mUsing hpc version 0.69 found on system at:
[2m[quickcheck-instances] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
[2m[quickcheck-instances] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[quickcheck-instances] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
[2m[quickcheck-instances] [mUsing hscolour version 1.25 found on system at:
[2m[quickcheck-instances] [m/nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
[2m[quickcheck-instances] [mNo jhc found
[2m[quickcheck-instances] [mUsing ld found on system at:
[2m[quickcheck-instances] [m/nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
[2m[quickcheck-instances] [mNo pkg-config found
[2m[quickcheck-instances] [mUsing runghc version 9.8.4 found on system at:
[2m[quickcheck-instances] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
[2m[quickcheck-instances] [mUsing strip version 2.44 found on system at:
[2m[quickcheck-instances] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
[2m[quickcheck-instances] [mUsing tar found on system at:
[2m[quickcheck-instances] [m/nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
[2m[quickcheck-instances] [mNo uhc found
[2m[bash-language-server] [mLockfile is up to date, resolution step is skipped
[2m[bash-language-server] [mAlready up to date
[2m[quickcheck-instances] [m[1;36mPhase: buildPhase[m
[2m[quickcheck-instances] [mPreprocessing library for quickcheck-instances-0.3.33..
[2m[quickcheck-instances] [mBuilding library for quickcheck-instances-0.3.33..
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[ 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 )
[2m[bash-language-server] [m
[2m[bash-language-server] [mdevDependencies:
[2m[bash-language-server] [m- @types/jest 29.5.14
[2m[bash-language-server] [m- @types/node 18.19.86
[2m[bash-language-server] [m- @typescript-eslint/eslint-plugin 7.18.0
[2m[bash-language-server] [m- @typescript-eslint/parser 7.18.0
[2m[bash-language-server] [m- cross-spawn 7.0.6
[2m[bash-language-server] [m- eslint 8.57.1
[2m[bash-language-server] [m- eslint-config-prettier 9.1.0
[2m[bash-language-server] [m- eslint-plugin-jest 28.11.0
[2m[bash-language-server] [m- eslint-plugin-prettier 4.2.1
[2m[bash-language-server] [m- eslint-plugin-simple-import-sort 12.1.1
[2m[bash-language-server] [m- eslint-plugin-sort-class-members 1.21.0
[2m[bash-language-server] [m- jest 29.7.0
[2m[bash-language-server] [m- prettier 2.8.8
[2m[bash-language-server] [m- ts-jest 29.3.2
[2m[bash-language-server] [m- typescript 5.6.3
[2m[bash-language-server] [m- vscode-languageserver 8.0.2
[2m[bash-language-server] [m- vscode-languageserver-textdocument 1.0.12
[2m[bash-language-server] [m
[2m[bash-language-server] [m[1;36mPhase: fixupPhase[m
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[ 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 )
[2m[bash-language-server] [mshrinking RPATHs of ELF executables and libraries in /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0
[2m[bash-language-server] [mshrinking /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/bin/bash-language-server
[2m[bash-language-server] [mchecking for references to /build/ in /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0...
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[bash-language-server] [mpatching script interpreter paths in /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0
[2m[bash-language-server] [m/nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/lib/bash-language-server/server/node_modules/.bin/installServerIntoExtension: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [m/nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/lib/bash-language-server/server/node_modules/.bin/editorconfig: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
[2m[bash-language-server] [m/nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/lib/bash-language-server/server/src/get-options.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/bash"
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[bash-language-server] [m[1;36mPhase: installCheckPhase[m
[2m[bash-language-server] [mExecuting versionCheckPhase
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[bash-language-server] [mDid not find version 5.6.0 in the output of the command /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/bin/bash-language-server --help
[2m[bash-language-server] [mUsage:
[2m[bash-language-server] [m bash-language-server start Start listening on stdin/stdout
[2m[bash-language-server] [m bash-language-server -h, --help Display this help and exit
[2m[bash-language-server] [m bash-language-server -v, --version Print the version and exit
[2m[bash-language-server] [m
[2m[bash-language-server] [mEnvironment variables:
[2m[bash-language-server] [m BASH_IDE_LOG_LEVEL Set the log level (default: info)
[2m[bash-language-server] [m
[2m[bash-language-server] [mFurther documentation: https://github.com/bash-lsp/bash-language-server
[2m[bash-language-server] [m(node:1257) [DEP0040] DeprecationWarning: The `punycode` module is deprecated. Please use a userland alternative instead.
[2m[bash-language-server] [m(Use `bash-language-server --trace-deprecation ...` to show where the warning was created)
[2m[bash-language-server] [mSuccessfully managed to find version 5.6.0 in the output of the command /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/bin/bash-language-server --version
[2m[bash-language-server] [m5.6.0
[2m[bash-language-server] [m(node:1268) [DEP0040] DeprecationWarning: The `punycode` module is deprecated. Please use a userland alternative instead.
[2m[bash-language-server] [m(Use `bash-language-server --trace-deprecation ...` to show where the warning was created)
[2m[bash-language-server] [mFinished versionCheckPhase
[2m[bash-language-server] [mno Makefile or custom installCheckPhase, doing nothing
[2m[bash-language-server:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0[m
[2m[bash-language-server:post-build] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[bash-language-server:post-build] [m[2mUploading to the NixCI cache: /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0[m
[2m[bash-language-server:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[bash-language-server:post-build] [m[2mcopying 1 paths...[m
[2m[bash-language-server:post-build] [m[2mcopying path '/nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0' to 'https://cache.nix-ci.com'...[m
[2m[bash-language-server:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[bash-language-server:post-build] [m[2mcopying 0 paths...[m
[2mProgress: 30 of 38 built (1 building), 559 of 559 downloaded from cache[m
[1;34mBuilding /nix/store/zyxicd0liv81yslrfa6dab201msi5mja-project-manager-path-for-duoids.drv[m
[2m[quickcheck-instances] [m[ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.p_o )
[2m[quickcheck-instances] [m[ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.p_o )
[2m[quickcheck-instances] [m[ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.p_o )
[2m[quickcheck-instances] [m[ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.p_o )
[2m[quickcheck-instances] [m[ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.p_o )
[2m[quickcheck-instances] [m[ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.p_o )
[2m[quickcheck-instances] [m[ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.p_o )
[2m[quickcheck-instances] [m[ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.p_o )
[2m[quickcheck-instances] [m[ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.p_o )
[2m[quickcheck-instances] [m[10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.p_o )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.p_o )
[2m[quickcheck-instances] [m[13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.p_o )
[2m[quickcheck-instances] [m[14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.p_o )
[2m[quickcheck-instances] [m[15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.p_o )
[2m[quickcheck-instances] [m[16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.p_o )
[2m[quickcheck-instances] [m[17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.p_o )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.p_o )
[2m[quickcheck-instances] [m[20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.p_o )
[2m[quickcheck-instances] [m[21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.p_o )
[2m[quickcheck-instances] [m[22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.p_o )
[2m[quickcheck-instances] [m[23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.p_o )
[2m[quickcheck-instances] [m[24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.p_o )
[2m[quickcheck-instances] [m[25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.p_o )
[2m[quickcheck-instances] [m[26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
[2m[project-manager-path-for-duoids] [mcreated 346 symlinks in user environment
[2m[project-manager-path-for-duoids:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/1drjlq9sq4ss40gjq9fdih54yrj55abx-project-manager-path-for-duoids[m
[2m[project-manager-path-for-duoids:post-build] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[project-manager-path-for-duoids:post-build] [m[2mUploading to the NixCI cache: /nix/store/1drjlq9sq4ss40gjq9fdih54yrj55abx-project-manager-path-for-duoids[m
[2m[project-manager-path-for-duoids:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[project-manager-path-for-duoids:post-build] [m[2mcopying 0 paths...[m
[2m[project-manager-path-for-duoids:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[project-manager-path-for-duoids:post-build] [m[2mcopying 0 paths...[m
[2mProgress: 31 of 38 built (1 building), 559 of 559 downloaded from cache[m
[2m[quickcheck-instances] [mPreprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
[2m[quickcheck-instances] [mBuilding test suite 'self-test' for quickcheck-instances-0.3.33..
[2m[quickcheck-instances] [m[1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
[2m[quickcheck-instances] [m[2 of 2] Linking dist/build/self-test/self-test
[2m[quickcheck-instances] [m[1;36mPhase: checkPhase[m
[2m[quickcheck-instances] [mRunning 1 test suites...
[2m[quickcheck-instances] [mTest suite self-test: RUNNING...
[2m[quickcheck-instances] [m+++ OK, passed 100 tests.
[2m[quickcheck-instances] [m+++ OK, passed 100 tests.
[2m[quickcheck-instances] [m+++ OK, passed 100 tests.
[2m[quickcheck-instances] [m+++ OK, passed 100 tests.
[2m[quickcheck-instances] [m+++ OK, passed 100 tests.
[2m[quickcheck-instances] [mTest suite self-test: PASS
[2m[quickcheck-instances] [mTest suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
[2m[quickcheck-instances] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[quickcheck-instances] [m[1;36mPhase: haddockPhase[m
[2m[quickcheck-instances] [mPreprocessing library for quickcheck-instances-0.3.33..
[2m[quickcheck-instances] [mRunning Haddock on library for quickcheck-instances-0.3.33..
[2m[quickcheck-instances] [mWarning: The documentation for the following packages are not installed. No
[2m[quickcheck-instances] [mlinks will be generated to these packages: vector-0.13.2.0
[2m[quickcheck-instances] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[quickcheck-instances] [m[ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
[2m[quickcheck-instances] [m[ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
[2m[quickcheck-instances] [m[ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
[2m[quickcheck-instances] [m[ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
[2m[quickcheck-instances] [m[ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
[2m[quickcheck-instances] [m[ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
[2m[quickcheck-instances] [m[ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
[2m[quickcheck-instances] [m[ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
[2m[quickcheck-instances] [m[ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
[2m[quickcheck-instances] [m[10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
[2m[quickcheck-instances] [m[11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
[2m[quickcheck-instances] [m[12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
[2m[quickcheck-instances] [m[13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
[2m[quickcheck-instances] [m[14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
[2m[quickcheck-instances] [m[15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
[2m[quickcheck-instances] [m[16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
[2m[quickcheck-instances] [m[17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
[2m[quickcheck-instances] [m[18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
[2m[quickcheck-instances] [m[19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
[2m[quickcheck-instances] [m[20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
[2m[quickcheck-instances] [m[21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
[2m[quickcheck-instances] [m[22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
[2m[quickcheck-instances] [m[23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
[2m[quickcheck-instances] [m[24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
[2m[quickcheck-instances] [m[25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
[2m[quickcheck-instances] [m[26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
[2m[quickcheck-instances] [mHaddock coverage:
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
[2m[quickcheck-instances] [m Missing documentation for:
[2m[quickcheck-instances] [m Module header
[2m[quickcheck-instances] [m 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
[2m[quickcheck-instances] [mWarning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
[2m[quickcheck-instances] [m - Data.Vector.Vector
[2m[quickcheck-instances] [m - Data.Vector.Primitive.Vector
[2m[quickcheck-instances] [m - Data.Vector.Storable.Vector
[2m[quickcheck-instances] [m - Data.Vector.Unboxed.Base.Unbox
[2m[quickcheck-instances] [m - Data.Vector.Unboxed.Base.Vector
[2m[quickcheck-instances] [m - Data.Vector.Strict.Vector
[2m[quickcheck-instances] [mDocumentation created: dist/doc/html/quickcheck-instances/,
[2m[quickcheck-instances] [mdist/doc/html/quickcheck-instances/quickcheck-instances.txt
[2m[quickcheck-instances] [mPreprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
[2m[quickcheck-instances] [m[1;36mPhase: installPhase[m
[2m[quickcheck-instances] [mInstalling library in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
[2m[quickcheck-instances] [m[1;36mPhase: fixupPhase[m
[2m[quickcheck-instances] [mshrinking RPATHs of ELF executables and libraries in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33
[2m[quickcheck-instances] [mshrinking /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSquickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW-ghc9.8.4.so
[2m[quickcheck-instances] [mchecking for references to /build/ in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33...
[2m[quickcheck-instances] [mpatching script interpreter paths in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33
[2m[quickcheck-instances] [mstripping (with command strip and flags -S -p) in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib
[2m[quickcheck-instances] [mshrinking RPATHs of ELF executables and libraries in /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc
[2m[quickcheck-instances] [mchecking for references to /build/ in /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc...
[2m[quickcheck-instances] [mpatching script interpreter paths in /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc
[2m[quickcheck-instances:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33[m
[2m[quickcheck-instances:post-build] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[quickcheck-instances:post-build] [m[2mUploading to the NixCI cache: /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33[m
[2m[quickcheck-instances:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[quickcheck-instances:post-build] [m[2mcopying 1 paths...[m
[2m[quickcheck-instances:post-build] [m[2mcopying path '/nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...[m
[2m[quickcheck-instances:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[quickcheck-instances:post-build] [m[2mcopying 0 paths...[m
[2mProgress: 32 of 38 built, 559 of 559 downloaded from cache[m
[1;34mBuilding /nix/store/d0g8hbwhcil6pvpxfxz1sgq1ah60i8mj-extra-1.8.1.drv[m
[2m[extra] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[extra] [mBuild with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
[2m[extra] [m[1;36mPhase: unpackPhase[m
[2m[extra] [munpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
[2m[extra] [msource root is extra-1.8.1
[2m[extra] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
[2m[extra] [m[1;36mPhase: patchPhase[m
[2m[extra] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[extra] [msetupCompileFlags: -package-db=/build/tmp.JkPI8tbbY1/setup-package.conf.d -threaded
[2m[extra] [m[1 of 2] Compiling Main ( Setup.hs, /build/tmp.JkPI8tbbY1/Main.o )
[2m[extra] [m[2 of 2] Linking Setup
[2m[extra] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[extra] [m[1;36mPhase: configurePhase[m
[2m[extra] [mconfigureFlags: --verbose --prefix=/nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.JkPI8tbbY1/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
[2m[extra] [mUsing Parsec parser
[2m[extra] [mConfiguring extra-1.8.1...
[2m[extra] [mDependency base >=4.9 && <5: using base-4.19.2.0
[2m[extra] [mDependency clock >=0.7: using clock-0.8.4
[2m[extra] [mDependency directory: using directory-1.3.8.5
[2m[extra] [mDependency filepath: using filepath-1.4.301.0
[2m[extra] [mDependency process: using process-1.6.25.0
[2m[extra] [mDependency time: using time-1.12.2
[2m[extra] [mDependency unix: using unix-2.8.6.0
[2m[extra] [mDependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
[2m[extra] [mDependency base >=4 && <5: using base-4.19.2.0
[2m[extra] [mDependency directory: using directory-1.3.8.5
[2m[extra] [mDependency extra: using extra-1.8.1
[2m[extra] [mDependency filepath: using filepath-1.4.301.0
[2m[extra] [mDependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
[2m[extra] [mDependency unix: using unix-2.8.6.0
[2m[extra] [mSource component graph:
[2m[extra] [m component lib
[2m[extra] [m component test:extra-test dependency lib
[2m[extra] [mConfigured component graph:
[2m[extra] [m component extra-1.8.1-EssMUQCsBco9gsyBCwwe73
[2m[extra] [m include base-4.19.2.0-8274
[2m[extra] [m include clock-0.8.4-29TfRxmWsjd5NvULEp3eBt
[2m[extra] [m include directory-1.3.8.5-d63d
[2m[extra] [m include filepath-1.4.301.0-9527
[2m[extra] [m include process-1.6.25.0-6fc5
[2m[extra] [m include time-1.12.2-b11c
[2m[extra] [m include unix-2.8.6.0-e528
[2m[extra] [m component extra-1.8.1-LV1wyo3vfOdDgOxdN7at1y-extra-test
[2m[extra] [m include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[extra] [m include base-4.19.2.0-8274
[2m[extra] [m include directory-1.3.8.5-d63d
[2m[extra] [m include extra-1.8.1-EssMUQCsBco9gsyBCwwe73
[2m[extra] [m include filepath-1.4.301.0-9527
[2m[extra] [m include quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
[2m[extra] [m include unix-2.8.6.0-e528
[2m[extra] [mLinked component graph:
[2m[extra] [m unit extra-1.8.1-EssMUQCsBco9gsyBCwwe73
[2m[extra] [m include base-4.19.2.0-8274
[2m[extra] [m include clock-0.8.4-29TfRxmWsjd5NvULEp3eBt
[2m[extra] [m include directory-1.3.8.5-d63d
[2m[extra] [m include filepath-1.4.301.0-9527
[2m[extra] [m include process-1.6.25.0-6fc5
[2m[extra] [m include time-1.12.2-b11c
[2m[extra] [m include unix-2.8.6.0-e528
[2m[extra] [m Control.Concurrent.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Version.Extra,Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Extra,Numeric.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Numeric.Extra,System.Directory.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Environment.Extra,System.IO.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.IO.Extra,System.Info.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Info.Extra,System.Process.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Process.Extra,System.Time.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Time.Extra,Text.Read.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Text.Read.Extra
[2m[extra] [m unit extra-1.8.1-LV1wyo3vfOdDgOxdN7at1y-extra-test
[2m[extra] [m include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[extra] [m include base-4.19.2.0-8274
[2m[extra] [m include directory-1.3.8.5-d63d
[2m[extra] [m include extra-1.8.1-EssMUQCsBco9gsyBCwwe73
[2m[extra] [m include filepath-1.4.301.0-9527
[2m[extra] [m include quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
[2m[extra] [m include unix-2.8.6.0-e528
[2m[extra] [mReady component graph:
[2m[extra] [m definite extra-1.8.1-EssMUQCsBco9gsyBCwwe73
[2m[extra] [m depends base-4.19.2.0-8274
[2m[extra] [m depends clock-0.8.4-29TfRxmWsjd5NvULEp3eBt
[2m[extra] [m depends directory-1.3.8.5-d63d
[2m[extra] [m depends filepath-1.4.301.0-9527
[2m[extra] [m depends process-1.6.25.0-6fc5
[2m[extra] [m depends time-1.12.2-b11c
[2m[extra] [m depends unix-2.8.6.0-e528
[2m[extra] [m definite extra-1.8.1-LV1wyo3vfOdDgOxdN7at1y-extra-test
[2m[extra] [m depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[extra] [m depends base-4.19.2.0-8274
[2m[extra] [m depends directory-1.3.8.5-d63d
[2m[extra] [m depends extra-1.8.1-EssMUQCsBco9gsyBCwwe73
[2m[extra] [m depends filepath-1.4.301.0-9527
[2m[extra] [m depends quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
[2m[extra] [m depends unix-2.8.6.0-e528
[2m[extra] [mUsing Cabal-3.10.3.0 compiled by ghc-9.8
[2m[extra] [mUsing compiler: ghc-9.8.4
[2m[extra] [mUsing install prefix: /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1
[2m[extra] [mExecutables installed in:
[2m[extra] [m/nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/bin
[2m[extra] [mLibraries installed in:
[2m[extra] [m/nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/extra-1.8.1-EssMUQCsBco9gsyBCwwe73
[2m[extra] [mDynamic Libraries installed in:
[2m[extra] [m/nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
[2m[extra] [mPrivate executables installed in:
[2m[extra] [m/nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/libexec/x86_64-linux-ghc-9.8.4/extra-1.8.1
[2m[extra] [mData files installed in:
[2m[extra] [m/nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/share/x86_64-linux-ghc-9.8.4/extra-1.8.1
[2m[extra] [mDocumentation installed in:
[2m[extra] [m/nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc/share/doc/extra-1.8.1
[2m[extra] [mConfiguration files installed in:
[2m[extra] [m/nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/etc
[2m[extra] [mNo alex found
[2m[extra] [mUsing ar found on system at:
[2m[extra] [m/nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
[2m[extra] [mNo c2hs found
[2m[extra] [mNo cpphs found
[2m[extra] [mNo doctest found
[2m[extra] [mUsing gcc version 14.3.0 given by user at:
[2m[extra] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
[2m[extra] [mUsing ghc version 9.8.4 found on system at:
[2m[extra] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
[2m[extra] [mUsing ghc-pkg version 9.8.4 found on system at:
[2m[extra] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
[2m[extra] [mNo ghcjs found
[2m[extra] [mNo ghcjs-pkg found
[2m[extra] [mNo greencard found
[2m[extra] [mUsing haddock version 2.30.0 found on system at:
[2m[extra] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
[2m[extra] [mNo happy found
[2m[extra] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[extra] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[extra] [mNo hmake found
[2m[extra] [mUsing hpc version 0.69 found on system at:
[2m[extra] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
[2m[extra] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[extra] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
[2m[extra] [mUsing hscolour version 1.25 found on system at:
[2m[extra] [m/nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
[2m[extra] [mNo jhc found
[2m[extra] [mUsing ld found on system at:
[2m[extra] [m/nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
[2m[extra] [mNo pkg-config found
[2m[extra] [mUsing runghc version 9.8.4 found on system at:
[2m[extra] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
[2m[extra] [mUsing strip version 2.44 found on system at:
[2m[extra] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
[2m[extra] [mUsing tar found on system at:
[2m[extra] [m/nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
[2m[extra] [mNo uhc found
[2m[extra] [m[1;36mPhase: buildPhase[m
[2m[extra] [mPreprocessing library for extra-1.8.1..
[2m[extra] [mBuilding library for extra-1.8.1..
[2m[extra] [m[ 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 )
[2m[extra] [m[ 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 )
[2m[extra] [m[ 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 )
[2m[extra] [m[ 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 )
[2m[extra] [m[ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
[2m[extra] [m[ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
[2m[extra] [m[ 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 )
[2m[extra] [m[ 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 )
[2m[extra] [m[ 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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
[2m[extra] [m[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 )
[2m[extra] [m[ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
[2m[extra] [m[ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
[2m[extra] [m[ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
[2m[extra] [m[ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
[2m[extra] [m[ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
[2m[extra] [m[ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
[2m[extra] [m[ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
[2m[extra] [m[ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
[2m[extra] [m[ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
[2m[extra] [m[10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
[2m[extra] [m[11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
[2m[extra] [m[12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
[2m[extra] [m[13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
[2m[extra] [m[14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
[2m[extra] [m[15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
[2m[extra] [m[16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
[2m[extra] [m[17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
[2m[extra] [m[18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
[2m[extra] [m[19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
[2m[extra] [m[20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
[2m[extra] [m[21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
[2m[extra] [m[22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
[2m[extra] [mPreprocessing test suite 'extra-test' for extra-1.8.1..
[2m[extra] [mBuilding test suite 'extra-test' for extra-1.8.1..
[2m[extra] [m[1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
[2m[extra] [m[2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
[2m[extra] [m[3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
[2m[extra] [m[4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
[2m[extra] [m[5 of 5] Linking dist/build/extra-test/extra-test
[2m[extra] [m[1;36mPhase: checkPhase[m
[2m[extra] [mRunning 1 test suites...
[2m[extra] [mTest suite extra-test: RUNNING...
[2m[extra] [mwithTempFile
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcaptureOutput
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(x :: IO Int) -> void (once x) == pure ()
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(x :: IO Int) -> join (once x) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(x :: IO Int) -> (do y <- once x; y; y) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(x :: IO Int) -> (do y <- once x; y ||| y) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(x :: IO Int) -> join (onceFork x) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(x :: IO Int) -> (do a <- onceFork x; a; a) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstringException "test" == pure "test"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstringException ("test" ++ undefined) == pure "test"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstringException ("test" ++ undefined ++ "hello") == pure "test"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstringException ['t','e','s','t',undefined] == pure "test"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mignore (print 1) == print 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mignore (fail "die") == pure ()
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcatch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mseq (errorIO "foo") (print 1) == print 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcatch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mseq (assertIO False) (print 1) == print 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mretry 1 (print "x") == print "x"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mretry 3 (fail "die") == fail "die"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwhenJust Nothing print == pure ()
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwhenJust (Just 1) print == print 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mpureIf @Maybe True 5 == Just 5
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mpureIf @Maybe False 5 == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mpureIf @[] True 5 == [5]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mpureIf @[] False 5 == []
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwhenMaybe True (print 1) == fmap Just (print 1)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwhenMaybe False (print 1) == pure Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(x :: Maybe ()) -> unit x == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mguarded even 2 == [2]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mguarded odd 2 == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mguarded (not.null) "My Name" == Just "My Name"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mguardedA (return . even) 42 == Just [42]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mguardedA (return . odd) 42 == Just []
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mguardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfold1M (\x y -> Just x) [] == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mpartitionM (Just . even) [1,2,3] == Just ([2], [1,3])
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mpartitionM (const Nothing) [1,2,3] == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mloop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mJust True ||^ undefined == Just True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mJust False ||^ Just True == Just True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mJust False ||^ Just False == Just False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mJust False &&^ undefined == Just False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mJust True &&^ Just True == Just True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mJust True &&^ Just False == Just False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [manyM Just [False,True ,undefined] == Just True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [manyM Just [False,False,undefined] == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mallM Just [True,False,undefined] == Just False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mallM Just [True,True ,undefined] == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [morM [Just False,Just True ,undefined] == Just True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [morM [Just False,Just False,undefined] == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> Just (or xs) == orM (map Just xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mandM [Just True,Just False,undefined] == Just False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mandM [Just True,Just True ,undefined] == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> Just (and xs) == andM (map Just xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfindM (Just . isUpper) "teST" == Just (Just 'S')
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfindM (Just . isUpper) "test" == Just Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfindM (Just . const True) ["x",undefined] == Just (Just "x")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfromLeft 1 (Left 3) == 3
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfromLeft 1 (Right "foo") == 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfromRight 1 (Right 3) == 3
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfromRight 1 (Left "foo") == 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> fromLeft' (Left x) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> fromLeft' (Right x) == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> fromRight' (Right x) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> fromRight' (Left x) == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> fromEither (Left x ) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> fromEither (Right x) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\a b -> maybeToEither a (Just b) == Right b
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\a -> maybeToEither a Nothing == Left a
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> eitherToMaybe (Left x) == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> eitherToMaybe (Right x) == Just x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmapLeft show (Left 1) == Left "1"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmapLeft show (Right True) == Right True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmapRight show (Left 1) == Left 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmapRight show (Right True) == Right "True"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> repeatedly word1 (trim xs) == words xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> repeatedly line1 xs == lines xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdisjoint [1,2,3] [4,5] == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdisjoint [1,2,3] [4,1] == False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdisjointOrd [1,2,3] [4,5] == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdisjointOrd [1,2,3] [4,1] == False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdisjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdisjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [manySame [1,1,2] == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [manySame [1,2,3] == False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [manySame (1:2:1:undefined) == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [manySame [] == False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> anySame xs == (length (nub xs) < length xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mallSame [1,1,2] == False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mallSame [1,1,1] == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mallSame [1] == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mallSame [] == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mallSame (1:1:2:undefined) == False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> allSame xs == (length (nub xs) <= 1)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mheadDef 1 [] == 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mheadDef 1 [2,3,4] == 2
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlastDef 1 [] == 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlastDef 1 [2,3,4] == 4
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x xs -> lastDef x xs == last (x:xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m[2,3,4] !? 1 == Just 3
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m[2,3,4] !? (-1) == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m[] !? 0 == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnotNull [] == False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnotNull [1] == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> notNull xs == not (null xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlist 1 (\v _ -> v - 2) [5,6,7] == 3
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlist 1 (\v _ -> v - 2) [] == 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [munsnoc "test" == Just ("tes",'t')
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [munsnoc "" == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcons 't' "est" == "test"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x xs -> uncons (cons x xs) == Just (x,xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msnoc "tes" 't' == "test"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs x -> unsnoc (snoc xs x) == Just (xs,x)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [menumerate == [False, True]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtakeEnd 3 "hello" == "llo"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtakeEnd 5 "bye" == "bye"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtakeEnd (-1) "bye" == ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\i xs -> takeEnd i xs `isSuffixOf` xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropEnd 3 "hello" == "he"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropEnd 5 "bye" == ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropEnd (-1) "bye" == "bye"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\i xs -> dropEnd i xs `isPrefixOf` xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplitAtEnd 3 "hello" == ("he","llo")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplitAtEnd 3 "he" == ("", "he")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\i xs -> uncurry (++) (splitAt i xs) == xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\i xs -> zip [i..] xs == zipFrom i xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mzipFrom False [1..3] == [(False,1),(True, 2)]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\i xs -> zipWithFrom (,) i xs == zipFrom i xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mconcatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mconcatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtakeWhileEnd even [2,3,4,6] == [4,6]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtrim " hello " == "hello"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtrimStart " hello " == "hello "
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtrimEnd " hello " == " hello"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\s -> trim s == trimEnd (trimStart s)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlower "This is A TEST" == "this is a test"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlower "" == ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mupper "This is A TEST" == "THIS IS A TEST"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mupper "" == ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mword1 "" == ("", "")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mword1 "keyword rest of string" == ("keyword","rest of string")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mword1 " keyword\n rest of string" == ("keyword","rest of string")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\s -> fst (word1 s) == concat (take 1 $ words s)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\s -> words (snd $ word1 s) == drop 1 (words s)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mline1 "" == ("", "")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mline1 "test" == ("test","")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mline1 "test\n" == ("test","")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mline1 "test\nrest" == ("test","rest")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mline1 "test\nrest\nmore" == ("test","rest\nmore")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mescapeHTML "this is a test" == "this is a test"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mescapeHTML "\"g&t\"" == "<b>"g&t"</n>"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mescapeHTML "t'was another test" == "t'was another test"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> unescapeHTML (escapeHTML xs) == xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mescapeJSON "this is a test" == "this is a test"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mescapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mescapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> unescapeJSON (escapeJSON xs) == xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mgroupOn abs [1,-1,2] == [[1,-1], [2]]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mgroupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmaximumOn id [] == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmaximumOn length ["test","extra","a"] == "extra"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mminimumOn id [] == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mminimumOn length ["test","extra","a"] == "a"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mgroupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> map fst (groupSort xs) == sort (nub (map fst xs))
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mgroupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mgroupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msum' [1, 2, 3] == 6
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msumOn' read ["1", "2", "3"] == 6
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mproduct' [1, 2, 4] == 8
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mproductOn' read ["1", "2", "4"] == 8
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmerge "ace" "bd" == "abcde"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mreplace "el" "_" "Hello Bella" == "H_lo B_la"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mreplace "el" "e" "Hello" == "Helo"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mreplace "" "x" "Hello" == "xHxexlxlxox"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mreplace "" "x" "" == "x"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs ys -> replace xs xs ys == ys
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mbreakEnd isLower "youRE" == ("you","RE")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mbreakEnd isLower "youre" == ("youre","")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mbreakEnd isLower "YOURE" == ("","YOURE")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\f xs -> breakEnd (not . f) xs == spanEnd f xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mspanEnd isUpper "youRE" == ("you","RE")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mspanEnd (not . isSpace) "x y z" == ("x y ","z")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\f xs -> uncurry (++) (spanEnd f xs) == xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\s -> wordsBy isSpace s == words s
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlinesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\s -> linesBy (== '\n') s == lines s
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlinesBy (== ';') "my;list;here;" == ["my","list","here"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfirstJust id [Nothing,Just 3] == Just 3
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfirstJust id [Nothing,Nothing] == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdrop1 "" == ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdrop1 "test" == "est"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> drop 1 xs == drop1 xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropEnd1 "" == ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropEnd1 "test" == "tes"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> dropEnd 1 xs == dropEnd1 xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmconcatMap Sum [1,2,3] == Sum 6
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\f xs -> mconcatMap f xs == concatMap f xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mbreakOn "::" "a::b::c" == ("a", "::b::c")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mbreakOn "/" "foobar" == ("foobar", "")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mbreakOnEnd "::" "a::b::c" == ("a::b::", "c")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplitOn "x" "x" == ["",""]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplitOn "x" "" == [""]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\s x -> s /= "" ==> intercalate s (splitOn s x) == x
[2m[extra] [m+++ OK, passed 100 tests; 21 discarded.
[2m[extra] [m\c x -> splitOn [c] x == split (==c) x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplit (== 'a') "aabbaca" == ["","","bb","c",""]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplit (== 'a') "" == [""]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplit (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplit (== ',') "my,list,here" == ["my","list","here"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropWhileEnd isSpace "ab cde " == "ab cde"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropWhileEnd' isSpace "ab cde " == "ab cde"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlast (dropWhileEnd even [undefined,3]) == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlast (dropWhileEnd' even [undefined,3]) == 3
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mhead (dropWhileEnd even (3:undefined)) == 3
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mhead (dropWhileEnd' even (3:undefined)) == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropPrefix "Mr. " "Mr. Men" == "Men"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropPrefix "Mr. " "Dr. Men" == "Dr. Men"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropSuffix "!" "Hello World!" == "Hello World"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropSuffix "!" "Hello World!!" == "Hello World!"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropSuffix "!" "Hello World." == "Hello World."
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstripSuffix "bar" "foobar" == Just "foo"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstripSuffix "" "baz" == Just "baz"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstripSuffix "foo" "quux" == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstripInfix "::" "a::b::c" == Just ("a", "b::c")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstripInfix "/" "foobar" == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mchunksOf 3 "my test" == ["my ","tes","t"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mchunksOf 3 "mytest" == ["myt","est"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mchunksOf 8 "" == []
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mchunksOf 0 "test" == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnubSort "this is a test" == " aehist"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> nubSort xs == nub (sort xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnubSortOn length ["a","test","of","this"] == ["a","of","test"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnubOrd "this is a test" == "this ae"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnubOrd (take 4 ("this" ++ undefined)) == "this"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> nubOrd xs == nub xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnubOrdOn length ["a","test","of","this"] == ["a","test","of"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mzipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mzipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mzipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcomparingLength [1,2,3] [False] == GT
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcomparingLength [1,2] "ab" == EQ
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcomparingLength [1,2] (1:2:3:undefined) == LT
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcomparingLength (1:2:3:undefined) [1,2] == GT
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmwhen True "test" == "test"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmwhen False "test" == ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfirst succ (1,"test") == (2,"test")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msecond reverse (1,"test") == (1,"tset")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfirstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msecondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m(succ *** reverse) (1,"test") == (2,"tset")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m(succ &&& pred) 1 == (2,0)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdupe 12 == (12, 12)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mboth succ (1,2) == (2,3)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfirst3 succ (1,1,1) == (2,1,1)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msecond3 succ (1,1,1) == (1,2,1)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mthird3 succ (1,1,1) == (1,1,2)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> readVersion (showVersion x) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mreadVersion "hello" == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mshowDP 4 pi == "3.1416"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mshowDP 0 pi == "3"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mshowDP 2 3 == "3.00"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempDir $ \dir -> do writeFile (dir "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempDir $ \dir -> do writeFile (dir "test.txt") ""; (== [dir "test.txt"]) <$> listContents dir
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlistTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlistTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlistTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlistTest listFilesRecursive ["bar.txt","zoo","foo" "baz.txt"] ["bar.txt","zoo","foo" "baz.txt"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlistTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" "baz.txt",".foo" "baz2.txt", "zoo"] ["bar.txt","zoo","foo" "baz.txt"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlistTest (listFilesInside $ const $ pure False) ["bar.txt"] []
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [misWindows == (os == "mingw32")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcaptureOutput (print 1) == pure ("1\n",())
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempFile doesFileExist == pure True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m(doesFileExist =<< withTempFile pure) == pure False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempFile readFile' == pure ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempDir doesDirectoryExist == pure True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m(doesDirectoryExist =<< withTempDir pure) == pure False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempDir listFiles == pure []
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfileEq "does_not_exist1" "does_not_exist2" == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfileEq "does_not_exist" "does_not_exist" == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfmap (round . fst) (duration $ sleep 1) == pure 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtimeout (-3) (print 1) == pure Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtimeout 0.1 (print 1) == fmap Just (print 1)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdo (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
[2m[extra] [m0.10036990300000001
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtimeout 0.1 (sleep 2 >> print 1) == pure Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mshowDuration 3.435 == "3.44s"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mshowDuration 623.8 == "10m24s"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mshowDuration 62003.8 == "17h13m"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mshowDuration 1e8 == "27777h47m"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdo f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdo (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mExtra export
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempFile
[2m[extra] [m....done
[2m[extra] [mwithTempDir
[2m[extra] [m....done
[2m[extra] [mretry
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mbarrier
[2m[extra] [mSuccess (325 tests)
[2m[extra] [mTest suite extra-test: PASS
[2m[extra] [mTest suite logged to: dist/test/extra-1.8.1-extra-test.log
[2m[extra] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[extra] [m[1;36mPhase: haddockPhase[m
[2m[extra] [mPreprocessing library for extra-1.8.1..
[2m[extra] [mRunning Haddock on library for extra-1.8.1..
[2m[extra] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[extra] [m[ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
[2m[extra] [m[ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
[2m[extra] [m[ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
[2m[extra] [m[ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
[2m[extra] [m[ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing )
[2m[extra] [m[ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
[2m[extra] [m[ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
[2m[extra] [m[ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
[2m[extra] [m[ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
[2m[extra] [m[10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
[2m[extra] [m[11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
[2m[extra] [m[12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
[2m[extra] [m[13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
[2m[extra] [m[14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
[2m[extra] [m[15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
[2m[extra] [m[16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
[2m[extra] [m[17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
[2m[extra] [m[18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
[2m[extra] [m[19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
[2m[extra] [m[20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
[2m[extra] [m[21 of 22] Compiling Extra ( src/Extra.hs, nothing )
[2m[extra] [m[22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
[2m[extra] [mHaddock coverage:
[2m[extra] [m 100% ( 6 / 6) in 'Data.IORef.Extra'
[2m[extra] [m 100% ( 4 / 4) in 'Data.Monoid.Extra'
[2m[extra] [mWarning: 'Arrow' is out of scope.
[2m[extra] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[extra] [m 100% ( 28 / 28) in 'Data.Tuple.Extra'
[2m[extra] [m 100% ( 2 / 2) in 'Data.Typeable.Extra'
[2m[extra] [m 100% ( 7 / 7) in 'Numeric.Extra'
[2m[extra] [mWarning: '(:)' is out of scope.
[2m[extra] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[extra] [mWarning: 'unzip' is ambiguous. It is defined
[2m[extra] [m * in ‘Data.Functor’
[2m[extra] [m * in ‘GHC.List’
[2m[extra] [m You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m by specifying the type/value namespace explicitly.
[2m[extra] [m Defaulting to the one defined in ‘GHC.List’
[2m[extra] [mWarning: 'firstJustM' is out of scope.
[2m[extra] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[extra] [m 100% ( 85 / 85) in 'Data.List.Extra'
[2m[extra] [mWarning: 'Version' is ambiguous. It is defined
[2m[extra] [m * in ‘Data.Version’
[2m[extra] [m * in ‘Data.Version’
[2m[extra] [m You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m by specifying the type/value namespace explicitly.
[2m[extra] [m Defaulting to the one defined in ‘Data.Version’
[2m[extra] [m 100% ( 3 / 3) in 'Data.Version.Extra'
[2m[extra] [mWarning: 'length' is ambiguous. It is defined
[2m[extra] [m * in ‘Data.Foldable’
[2m[extra] [m * in ‘Data.List.NonEmpty’
[2m[extra] [m You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m by specifying the type/value namespace explicitly.
[2m[extra] [m Defaulting to the one defined in ‘Data.List.NonEmpty’
[2m[extra] [m 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
[2m[extra] [mWarning: 'fromJust' is out of scope.
[2m[extra] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[extra] [m 100% ( 11 / 11) in 'Data.Either.Extra'
[2m[extra] [mWarning: 'ErrorCall' is ambiguous. It is defined
[2m[extra] [m * in ‘GHC.Exception’
[2m[extra] [m * in ‘GHC.Exception’
[2m[extra] [m You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m by specifying the type/value namespace explicitly.
[2m[extra] [m Defaulting to the one defined in ‘GHC.Exception’
[2m[extra] [mWarning: 'AssertionFailed' is ambiguous. It is defined
[2m[extra] [m * in ‘GHC.IO.Exception’
[2m[extra] [m * in ‘GHC.IO.Exception’
[2m[extra] [m You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m by specifying the type/value namespace explicitly.
[2m[extra] [m Defaulting to the one defined in ‘GHC.IO.Exception’
[2m[extra] [mWarning: 'SomeException' is ambiguous. It is defined
[2m[extra] [m * in ‘GHC.Exception.Type’
[2m[extra] [m * in ‘GHC.Exception.Type’
[2m[extra] [m You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m by specifying the type/value namespace explicitly.
[2m[extra] [m Defaulting to the one defined in ‘GHC.Exception.Type’
[2m[extra] [m 100% ( 21 / 21) in 'Control.Exception.Extra'
[2m[extra] [mWarning: 'partition' is out of scope.
[2m[extra] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[extra] [mWarning: 'mconcatMap' is out of scope.
[2m[extra] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[extra] [mWarning: 'find' is out of scope.
[2m[extra] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[extra] [m 100% ( 40 / 40) in 'Control.Monad.Extra'
[2m[extra] [m 92% ( 13 / 14) in 'Data.Foldable.Extra'
[2m[extra] [m Missing documentation for:
[2m[extra] [m Module header
[2m[extra] [mWarning: 'Lock' is ambiguous. It is defined
[2m[extra] [m * at src/Control/Concurrent/Extra.hs:106:16
[2m[extra] [m * at src/Control/Concurrent/Extra.hs:106:1
[2m[extra] [m You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m by specifying the type/value namespace explicitly.
[2m[extra] [m Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
[2m[extra] [mWarning: 'Var' is ambiguous. It is defined
[2m[extra] [m * at src/Control/Concurrent/Extra.hs:146:17
[2m[extra] [m * at src/Control/Concurrent/Extra.hs:146:1
[2m[extra] [m You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m by specifying the type/value namespace explicitly.
[2m[extra] [m Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
[2m[extra] [mWarning: 'Barrier' is ambiguous. It is defined
[2m[extra] [m * at src/Control/Concurrent/Extra.hs:210:21
[2m[extra] [m * at src/Control/Concurrent/Extra.hs:210:1
[2m[extra] [m You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m by specifying the type/value namespace explicitly.
[2m[extra] [m Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
[2m[extra] [m 100% ( 27 / 27) in 'Control.Concurrent.Extra'
[2m[extra] [m 100% ( 8 / 8) in 'System.Directory.Extra'
[2m[extra] [m 100% ( 2 / 2) in 'System.Environment.Extra'
[2m[extra] [m 100% ( 26 / 26) in 'System.IO.Extra'
[2m[extra] [m 100% ( 4 / 4) in 'System.Info.Extra'
[2m[extra] [m 100% ( 5 / 5) in 'System.Process.Extra'
[2m[extra] [m 100% ( 8 / 8) in 'System.Time.Extra'
[2m[extra] [m 100% (270 /270) in 'Extra'
[2m[extra] [m 100% ( 2 / 2) in 'Text.Read.Extra'
[2m[extra] [mWarning: Data.Tuple.Extra: could not find link destinations for:
[2m[extra] [m - GHC.Generics.Rep1_Solo
[2m[extra] [m - GHC.Generics.Rep_Solo
[2m[extra] [mDocumentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
[2m[extra] [mPreprocessing test suite 'extra-test' for extra-1.8.1..
[2m[extra] [m[1;36mPhase: installPhase[m
[2m[extra] [mInstalling library in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/extra-1.8.1-EssMUQCsBco9gsyBCwwe73
[2m[extra] [m[1;36mPhase: fixupPhase[m
[2m[extra] [mshrinking RPATHs of ELF executables and libraries in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1
[2m[extra] [mshrinking /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSextra-1.8.1-EssMUQCsBco9gsyBCwwe73-ghc9.8.4.so
[2m[extra] [mchecking for references to /build/ in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1...
[2m[extra] [mpatching script interpreter paths in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1
[2m[extra] [mstripping (with command strip and flags -S -p) in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib
[2m[extra] [mshrinking RPATHs of ELF executables and libraries in /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc
[2m[extra] [mchecking for references to /build/ in /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc...
[2m[extra] [mpatching script interpreter paths in /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc
[2m[extra:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1[m
[2m[extra:post-build] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[extra:post-build] [m[2mUploading to the NixCI cache: /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1[m
[2m[extra:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[extra:post-build] [m[2mcopying 1 paths...[m
[2m[extra:post-build] [m[2mcopying path '/nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1' to 'https://cache.nix-ci.com'...[m
[2m[extra:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[extra:post-build] [m[2mcopying 0 paths...[m
[2mProgress: 33 of 38 built, 559 of 559 downloaded from cache[m
[1;34mBuilding /nix/store/26c954c0i89di6h5jdfdb3jks1f0pfl8-algebraic-graphs-0.7.drv[m
[2m[algebraic-graphs] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[algebraic-graphs] [mBuild with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
[2m[algebraic-graphs] [m[1;36mPhase: unpackPhase[m
[2m[algebraic-graphs] [munpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
[2m[algebraic-graphs] [msource root is algebraic-graphs-0.7
[2m[algebraic-graphs] [msetting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
[2m[algebraic-graphs] [m[1;36mPhase: patchPhase[m
[2m[algebraic-graphs] [mReplace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
[2m[algebraic-graphs] [mapplying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
[2m[algebraic-graphs] [mpatching file algebraic-graphs.cabal
[2m[algebraic-graphs] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[algebraic-graphs] [msetupCompileFlags: -package-db=/build/tmp.6GvW7wedJ2/setup-package.conf.d -threaded
[2m[algebraic-graphs] [m[1 of 2] Compiling Main ( Setup.hs, /build/tmp.6GvW7wedJ2/Main.o )
[2m[algebraic-graphs] [m[2 of 2] Linking Setup
[2m[algebraic-graphs] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[algebraic-graphs] [m[1;36mPhase: configurePhase[m
[2m[algebraic-graphs] [mconfigureFlags: --verbose --prefix=/nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.6GvW7wedJ2/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/lib
[2m[algebraic-graphs] [mUsing Parsec parser
[2m[algebraic-graphs] [mConfiguring algebraic-graphs-0.7...
[2m[algebraic-graphs] [mDependency array >=0.4 && <0.6: using array-0.5.8.0
[2m[algebraic-graphs] [mDependency base >=4.11 && <5: using base-4.19.2.0
[2m[algebraic-graphs] [mDependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
[2m[algebraic-graphs] [mDependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
[2m[algebraic-graphs] [mDependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
[2m[algebraic-graphs] [mDependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
[2m[algebraic-graphs] [mDependency algebraic-graphs: using algebraic-graphs-0.7
[2m[algebraic-graphs] [mDependency array >=0.4 && <0.6: using array-0.5.8.0
[2m[algebraic-graphs] [mDependency base >=4.11 && <5: using base-4.19.2.0
[2m[algebraic-graphs] [mDependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
[2m[algebraic-graphs] [mDependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
[2m[algebraic-graphs] [mDependency extra >=1.4 && <2: using extra-1.8.1
[2m[algebraic-graphs] [mDependency inspection-testing >=0.4.2.2 && <0.7: using
[2m[algebraic-graphs] [minspection-testing-0.6.2
[2m[algebraic-graphs] [mDependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
[2m[algebraic-graphs] [mSource component graph:
[2m[algebraic-graphs] [m component lib
[2m[algebraic-graphs] [m component test:main dependency lib
[2m[algebraic-graphs] [mConfigured component graph:
[2m[algebraic-graphs] [m component algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
[2m[algebraic-graphs] [m include array-0.5.8.0-cf4f
[2m[algebraic-graphs] [m include base-4.19.2.0-8274
[2m[algebraic-graphs] [m include containers-0.6.8-15d9
[2m[algebraic-graphs] [m include deepseq-1.5.1.0-c64e
[2m[algebraic-graphs] [m include transformers-0.6.1.0-388b
[2m[algebraic-graphs] [m component algebraic-graphs-0.7-5jtLgVA0WOj7VL6Fsh7koE-main
[2m[algebraic-graphs] [m include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[algebraic-graphs] [m include algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
[2m[algebraic-graphs] [m include array-0.5.8.0-cf4f
[2m[algebraic-graphs] [m include base-4.19.2.0-8274
[2m[algebraic-graphs] [m include containers-0.6.8-15d9
[2m[algebraic-graphs] [m include deepseq-1.5.1.0-c64e
[2m[algebraic-graphs] [m include extra-1.8.1-EssMUQCsBco9gsyBCwwe73
[2m[algebraic-graphs] [m include inspection-testing-0.6.2-35R0qsmblLV9uU1qS0yYOA
[2m[algebraic-graphs] [m include transformers-0.6.1.0-388b
[2m[algebraic-graphs] [mLinked component graph:
[2m[algebraic-graphs] [m unit algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
[2m[algebraic-graphs] [m include array-0.5.8.0-cf4f
[2m[algebraic-graphs] [m include base-4.19.2.0-8274
[2m[algebraic-graphs] [m include containers-0.6.8-15d9
[2m[algebraic-graphs] [m include deepseq-1.5.1.0-c64e
[2m[algebraic-graphs] [m include transformers-0.6.1.0-388b
[2m[algebraic-graphs] [m Algebra.Graph=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Data.Graph.Typed
[2m[algebraic-graphs] [m unit algebraic-graphs-0.7-5jtLgVA0WOj7VL6Fsh7koE-main
[2m[algebraic-graphs] [m include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[algebraic-graphs] [m include algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
[2m[algebraic-graphs] [m include array-0.5.8.0-cf4f
[2m[algebraic-graphs] [m include base-4.19.2.0-8274
[2m[algebraic-graphs] [m include containers-0.6.8-15d9
[2m[algebraic-graphs] [m include deepseq-1.5.1.0-c64e
[2m[algebraic-graphs] [m include extra-1.8.1-EssMUQCsBco9gsyBCwwe73
[2m[algebraic-graphs] [m include inspection-testing-0.6.2-35R0qsmblLV9uU1qS0yYOA
[2m[algebraic-graphs] [m include transformers-0.6.1.0-388b
[2m[algebraic-graphs] [mReady component graph:
[2m[algebraic-graphs] [m definite algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
[2m[algebraic-graphs] [m depends array-0.5.8.0-cf4f
[2m[algebraic-graphs] [m depends base-4.19.2.0-8274
[2m[algebraic-graphs] [m depends containers-0.6.8-15d9
[2m[algebraic-graphs] [m depends deepseq-1.5.1.0-c64e
[2m[algebraic-graphs] [m depends transformers-0.6.1.0-388b
[2m[algebraic-graphs] [m definite algebraic-graphs-0.7-5jtLgVA0WOj7VL6Fsh7koE-main
[2m[algebraic-graphs] [m depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
[2m[algebraic-graphs] [m depends algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
[2m[algebraic-graphs] [m depends array-0.5.8.0-cf4f
[2m[algebraic-graphs] [m depends base-4.19.2.0-8274
[2m[algebraic-graphs] [m depends containers-0.6.8-15d9
[2m[algebraic-graphs] [m depends deepseq-1.5.1.0-c64e
[2m[algebraic-graphs] [m depends extra-1.8.1-EssMUQCsBco9gsyBCwwe73
[2m[algebraic-graphs] [m depends inspection-testing-0.6.2-35R0qsmblLV9uU1qS0yYOA
[2m[algebraic-graphs] [m depends transformers-0.6.1.0-388b
[2m[algebraic-graphs] [mUsing Cabal-3.10.3.0 compiled by ghc-9.8
[2m[algebraic-graphs] [mUsing compiler: ghc-9.8.4
[2m[algebraic-graphs] [mUsing install prefix:
[2m[algebraic-graphs] [m/nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7
[2m[algebraic-graphs] [mExecutables installed in:
[2m[algebraic-graphs] [m/nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/bin
[2m[algebraic-graphs] [mLibraries installed in:
[2m[algebraic-graphs] [m/nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
[2m[algebraic-graphs] [mDynamic Libraries installed in:
[2m[algebraic-graphs] [m/nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
[2m[algebraic-graphs] [mPrivate executables installed in:
[2m[algebraic-graphs] [m/nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7
[2m[algebraic-graphs] [mData files installed in:
[2m[algebraic-graphs] [m/nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7
[2m[algebraic-graphs] [mDocumentation installed in:
[2m[algebraic-graphs] [m/nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
[2m[algebraic-graphs] [mConfiguration files installed in:
[2m[algebraic-graphs] [m/nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/etc
[2m[algebraic-graphs] [mNo alex found
[2m[algebraic-graphs] [mUsing ar found on system at:
[2m[algebraic-graphs] [m/nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
[2m[algebraic-graphs] [mNo c2hs found
[2m[algebraic-graphs] [mNo cpphs found
[2m[algebraic-graphs] [mNo doctest found
[2m[algebraic-graphs] [mUsing gcc version 14.3.0 given by user at:
[2m[algebraic-graphs] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
[2m[algebraic-graphs] [mUsing ghc version 9.8.4 found on system at:
[2m[algebraic-graphs] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
[2m[algebraic-graphs] [mUsing ghc-pkg version 9.8.4 found on system at:
[2m[algebraic-graphs] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
[2m[algebraic-graphs] [mNo ghcjs found
[2m[algebraic-graphs] [mNo ghcjs-pkg found
[2m[algebraic-graphs] [mNo greencard found
[2m[algebraic-graphs] [mUsing haddock version 2.30.0 found on system at:
[2m[algebraic-graphs] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
[2m[algebraic-graphs] [mNo happy found
[2m[algebraic-graphs] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[algebraic-graphs] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[algebraic-graphs] [mNo hmake found
[2m[algebraic-graphs] [mUsing hpc version 0.69 found on system at:
[2m[algebraic-graphs] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
[2m[algebraic-graphs] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[algebraic-graphs] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
[2m[algebraic-graphs] [mUsing hscolour version 1.25 found on system at:
[2m[algebraic-graphs] [m/nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
[2m[algebraic-graphs] [mNo jhc found
[2m[algebraic-graphs] [mUsing ld found on system at:
[2m[algebraic-graphs] [m/nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
[2m[algebraic-graphs] [mNo pkg-config found
[2m[algebraic-graphs] [mUsing runghc version 9.8.4 found on system at:
[2m[algebraic-graphs] [m/nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
[2m[algebraic-graphs] [mUsing strip version 2.44 found on system at:
[2m[algebraic-graphs] [m/nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
[2m[algebraic-graphs] [mUsing tar found on system at:
[2m[algebraic-graphs] [m/nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
[2m[algebraic-graphs] [mNo uhc found
[2m[algebraic-graphs] [m[1;36mPhase: buildPhase[m
[2m[algebraic-graphs] [mPreprocessing library for algebraic-graphs-0.7..
[2m[algebraic-graphs] [mBuilding library for algebraic-graphs-0.7..
[2m[algebraic-graphs] [m[ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.o, dist/build/Algebra/Graph/AdjacencyMap.dyn_o )
[2m[algebraic-graphs] [m[ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.o, dist/build/Algebra/Graph/AdjacencyIntMap.dyn_o )
[2m[algebraic-graphs] [m[ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.dyn_o )
[2m[algebraic-graphs] [m[ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.o, dist/build/Algebra/Graph/Internal.dyn_o )
[2m[algebraic-graphs] [m[ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
[2m[algebraic-graphs] [m[ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.o, dist/build/Algebra/Graph/HigherKinded/Class.dyn_o )
[2m[algebraic-graphs] [m[ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.dyn_o )
[2m[algebraic-graphs] [m[ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.dyn_o )
[2m[algebraic-graphs] [m[ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.o, dist/build/Algebra/Graph/Label.dyn_o )
[2m[algebraic-graphs] [m[10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.o, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.dyn_o )
[2m[algebraic-graphs] [m[11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.dyn_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m In the use of ‘head’
[2m[algebraic-graphs] [m (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m "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."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m384 |[0m[0m exit v = do newComponent <- (v==).snd.[;1m[35mhead[0m[0m <$> gets boundaryStack
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m In the use of ‘tail’
[2m[algebraic-graphs] [m (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m "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."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m391 |[0m[0m pth' = [;1m[35mtail[0m[0m v_pth' -- Here we know that v_pth' starts with v
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m In the use of ‘head’
[2m[algebraic-graphs] [m (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m "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."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m395 |[0m[0m p_v = fst $ [;1m[35mhead[0m[0m bnd
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m In the use of ‘tail’
[2m[algebraic-graphs] [m (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m "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."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m397 |[0m[0m bnd' = [;1m[35mtail[0m[0m bnd
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[algebraic-graphs] [m[12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.o, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.dyn_o )
[2m[algebraic-graphs] [m[13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.o, dist/build/Algebra/Graph/ToGraph.dyn_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:171:32: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m171 |[0m[0m vertexIntSet :: ToVertex t [;1m[35m~[0m[0m Int => t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:197:29: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m197 |[0m[0m preIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:215:30: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m215 |[0m[0m postIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:303:37: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m303 |[0m[0m toAdjacencyIntMap :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:312:46: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m312 |[0m[0m toAdjacencyIntMapTranspose :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:452:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m452 |[0m[0m adjacencyIntMap :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:471:52: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m471 |[0m[0m adjacencyIntMapTranspose :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m[14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.o, dist/build/Algebra/Graph/Relation.dyn_o )
[2m[algebraic-graphs] [m[15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.o, dist/build/Algebra/Graph/Relation/Symmetric.dyn_o )
[2m[algebraic-graphs] [m[16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.o, dist/build/Algebra/Graph/NonEmpty.dyn_o )
[2m[algebraic-graphs] [m[17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.o, dist/build/Algebra/Graph/Labelled/AdjacencyMap.dyn_o )
[2m[algebraic-graphs] [m[18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.o, dist/build/Algebra/Graph/Labelled.dyn_o )
[2m[algebraic-graphs] [m[19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.o, dist/build/Algebra/Graph/Labelled/Example/Network.dyn_o )
[2m[algebraic-graphs] [m[20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.o, dist/build/Algebra/Graph/Labelled/Example/Automaton.dyn_o )
[2m[algebraic-graphs] [m[21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.o, dist/build/Algebra/Graph/Export.dyn_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export.hs:185:41: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m185 |[0m[0m export :: (Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m[22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.o, dist/build/Algebra/Graph/Export/Dot.dyn_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:121:63: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m121 |[0m[0m export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => Style a s -> g -> s
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:165:78: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m165 |[0m[0m exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g [;1m[35m~[0m[0m s) => g -> s
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m[23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.o, dist/build/Algebra/Graph/Undirected.dyn_o )
[2m[algebraic-graphs] [m[24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.o, dist/build/Algebra/Graph/Class.dyn_o )
[2m[algebraic-graphs] [m[25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.o, dist/build/Algebra/Graph/Relation/Transitive.dyn_o )
[2m[algebraic-graphs] [m[26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.o, dist/build/Algebra/Graph/Relation/Reflexive.dyn_o )
[2m[algebraic-graphs] [m[27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.o, dist/build/Algebra/Graph/Relation/Preorder.dyn_o )
[2m[algebraic-graphs] [m[28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.o, dist/build/Algebra/Graph/Example/Todo.dyn_o )
[2m[algebraic-graphs] [m[29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.o, dist/build/Data/Graph/Typed.dyn_o )
[2m[algebraic-graphs] [m[ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
[2m[algebraic-graphs] [m[ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.p_o )
[2m[algebraic-graphs] [m[ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
[2m[algebraic-graphs] [m[ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
[2m[algebraic-graphs] [m[ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.p_o )
[2m[algebraic-graphs] [m[ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.p_o )
[2m[algebraic-graphs] [m[ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
[2m[algebraic-graphs] [m[10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.p_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m In the use of ‘head’
[2m[algebraic-graphs] [m (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m "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."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m384 |[0m[0m exit v = do newComponent <- (v==).snd.[;1m[35mhead[0m[0m <$> gets boundaryStack
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m In the use of ‘tail’
[2m[algebraic-graphs] [m (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m "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."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m391 |[0m[0m pth' = [;1m[35mtail[0m[0m v_pth' -- Here we know that v_pth' starts with v
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m In the use of ‘head’
[2m[algebraic-graphs] [m (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m "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."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m395 |[0m[0m p_v = fst $ [;1m[35mhead[0m[0m bnd
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m In the use of ‘tail’
[2m[algebraic-graphs] [m (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m "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."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m397 |[0m[0m bnd' = [;1m[35mtail[0m[0m bnd
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[algebraic-graphs] [m[12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:171:32: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m171 |[0m[0m vertexIntSet :: ToVertex t [;1m[35m~[0m[0m Int => t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:197:29: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m197 |[0m[0m preIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:215:30: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m215 |[0m[0m postIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:303:37: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m303 |[0m[0m toAdjacencyIntMap :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:312:46: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m312 |[0m[0m toAdjacencyIntMapTranspose :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:452:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m452 |[0m[0m adjacencyIntMap :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:471:52: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m471 |[0m[0m adjacencyIntMapTranspose :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m[14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
[2m[algebraic-graphs] [m[15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.p_o )
[2m[algebraic-graphs] [m[16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
[2m[algebraic-graphs] [m[17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
[2m[algebraic-graphs] [m[19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.p_o )
[2m[algebraic-graphs] [m[20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.p_o )
[2m[algebraic-graphs] [m[21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export.hs:185:41: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m185 |[0m[0m export :: (Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m[22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.p_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:121:63: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m121 |[0m[0m export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => Style a s -> g -> s
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:165:78: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m165 |[0m[0m exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g [;1m[35m~[0m[0m s) => g -> s
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m[23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
[2m[algebraic-graphs] [m[24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
[2m[algebraic-graphs] [m[25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.p_o )
[2m[algebraic-graphs] [m[26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.p_o )
[2m[algebraic-graphs] [m[27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.p_o )
[2m[algebraic-graphs] [m[28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.p_o )
[2m[algebraic-graphs] [m[29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
[2m[algebraic-graphs] [mPreprocessing test suite 'main' for algebraic-graphs-0.7..
[2m[algebraic-graphs] [mBuilding test suite 'main' for algebraic-graphs-0.7..
[2m[algebraic-graphs] [m[ 1 of 23] Compiling Algebra.Graph.Test.Arbitrary ( test/Algebra/Graph/Test/Arbitrary.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.o, dist/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.dyn_o )
[2m[algebraic-graphs] [m[ 2 of 23] Compiling Algebra.Graph.Test.API ( test/Algebra/Graph/Test/API.hs, dist/build/main/main-tmp/Algebra/Graph/Test/API.o, dist/build/main/main-tmp/Algebra/Graph/Test/API.dyn_o )
[2m[algebraic-graphs] [m[ 3 of 23] Compiling Algebra.Graph.Test ( test/Algebra/Graph/Test.hs, dist/build/main/main-tmp/Algebra/Graph/Test.o, dist/build/main/main-tmp/Algebra/Graph/Test.dyn_o )
[2m[algebraic-graphs] [m[ 4 of 23] Compiling Algebra.Graph.Test.Acyclic.AdjacencyMap ( test/Algebra/Graph/Test/Acyclic/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.dyn_o )
[2m[algebraic-graphs] [m[ 5 of 23] Compiling Algebra.Graph.Test.Bipartite.AdjacencyMap ( test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.dyn_o )
[2m[algebraic-graphs] [m[ 6 of 23] Compiling Algebra.Graph.Test.Example.Todo ( test/Algebra/Graph/Test/Example/Todo.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.o, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.dyn_o )
[2m[algebraic-graphs] [m[ 7 of 23] Compiling Algebra.Graph.Test.Export ( test/Algebra/Graph/Test/Export.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Export.o, dist/build/main/main-tmp/Algebra/Graph/Test/Export.dyn_o )
[2m[algebraic-graphs] [m[ 8 of 23] Compiling Algebra.Graph.Test.Generic ( test/Algebra/Graph/Test/Generic.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Generic.o, dist/build/main/main-tmp/Algebra/Graph/Test/Generic.dyn_o )
[2m[algebraic-graphs] [m[ 9 of 23] Compiling Algebra.Graph.Test.AdjacencyMap ( test/Algebra/Graph/Test/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.dyn_o )
[2m[algebraic-graphs] [m[10 of 23] Compiling Algebra.Graph.Test.AdjacencyIntMap ( test/Algebra/Graph/Test/AdjacencyIntMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.dyn_o )
[2m[algebraic-graphs] [m[11 of 23] Compiling Algebra.Graph.Test.Graph ( test/Algebra/Graph/Test/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.dyn_o )
[2m[algebraic-graphs] [m[12 of 23] Compiling Algebra.Graph.Test.Internal ( test/Algebra/Graph/Test/Internal.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Internal.o, dist/build/main/main-tmp/Algebra/Graph/Test/Internal.dyn_o )
[2m[algebraic-graphs] [m[13 of 23] Compiling Algebra.Graph.Test.Label ( test/Algebra/Graph/Test/Label.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Label.o, dist/build/main/main-tmp/Algebra/Graph/Test/Label.dyn_o )
[2m[algebraic-graphs] [m[14 of 23] Compiling Algebra.Graph.Test.Labelled.AdjacencyMap ( test/Algebra/Graph/Test/Labelled/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.dyn_o )
[2m[algebraic-graphs] [m[15 of 23] Compiling Algebra.Graph.Test.Labelled.Graph ( test/Algebra/Graph/Test/Labelled/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.dyn_o )
[2m[algebraic-graphs] [m[16 of 23] Compiling Algebra.Graph.Test.NonEmpty.AdjacencyMap ( test/Algebra/Graph/Test/NonEmpty/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.dyn_o )
[2m[algebraic-graphs] [m[17 of 23] Compiling Algebra.Graph.Test.NonEmpty.Graph ( test/Algebra/Graph/Test/NonEmpty/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.dyn_o )
[2m[algebraic-graphs] [m[18 of 23] Compiling Algebra.Graph.Test.Relation ( test/Algebra/Graph/Test/Relation.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.dyn_o )
[2m[algebraic-graphs] [m[19 of 23] Compiling Algebra.Graph.Test.Relation.Symmetric ( test/Algebra/Graph/Test/Relation/Symmetric.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.dyn_o )
[2m[algebraic-graphs] [m[20 of 23] Compiling Algebra.Graph.Test.RewriteRules ( test/Algebra/Graph/Test/RewriteRules.hs, dist/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.o, dist/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.dyn_o )
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [minspection testing successful
[2m[algebraic-graphs] [m expected successes: 58
[2m[algebraic-graphs] [m[21 of 23] Compiling Algebra.Graph.Test.Undirected ( test/Algebra/Graph/Test/Undirected.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Undirected.o, dist/build/main/main-tmp/Algebra/Graph/Test/Undirected.dyn_o )
[2m[algebraic-graphs] [m[22 of 23] Compiling Data.Graph.Test.Typed ( test/Data/Graph/Test/Typed.hs, dist/build/main/main-tmp/Data/Graph/Test/Typed.o, dist/build/main/main-tmp/Data/Graph/Test/Typed.dyn_o )
[2m[algebraic-graphs] [m[23 of 23] Compiling Main ( test/Main.hs, dist/build/main/main-tmp/Main.o, dist/build/main/main-tmp/Main.dyn_o )
[2m[algebraic-graphs] [m[24 of 24] Linking dist/build/main/main
[2m[algebraic-graphs] [m[1;36mPhase: checkPhase[m
[2m[algebraic-graphs] [mRunning 1 test suites...
[2m[algebraic-graphs] [mTest suite main: RUNNING...
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.Show ============
[2m[algebraic-graphs] [mOK: show empty == "empty"
[2m[algebraic-graphs] [mOK: show (shrink 1) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (shrink $ 1 + 2) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
[2m[algebraic-graphs] [mOK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
[2m[algebraic-graphs] [mOK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.fromAcyclic ============
[2m[algebraic-graphs] [mOK: fromAcyclic empty == empty
[2m[algebraic-graphs] [mOK: fromAcyclic . vertex == vertex
[2m[algebraic-graphs] [mOK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
[2m[algebraic-graphs] [mOK: vertexCount . fromAcyclic == vertexCount
[2m[algebraic-graphs] [mOK: edgeCount . fromAcyclic == edgeCount
[2m[algebraic-graphs] [mOK: isAcyclic . fromAcyclic == const True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices [] == empty
[2m[algebraic-graphs] [mOK: vertices [x] == vertex x
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.union ============
[2m[algebraic-graphs] [mOK: vertexSet (union x y) ==
[2m[algebraic-graphs] [mOK: edgeSet (union x y) ==
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.join ============
[2m[algebraic-graphs] [mOK: vertexSet (join x y) ==
[2m[algebraic-graphs] [mOK: edgeSet (join x y) ==
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty x == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x) empty == False
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [mOK: isSubgraphOf x (transitiveClosure x) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z) == False
[2m[algebraic-graphs] [mOK: hasEdge 1 2 (shrink $ 1 * 2) == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount == length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (shrink $ 1 * 2) == 1
[2m[algebraic-graphs] [mOK: edgeCount == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x) == []
[2m[algebraic-graphs] [mOK: edgeList (shrink $ 2 * 1) == [(2,1)]
[2m[algebraic-graphs] [mOK: edgeList . transpose == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x) == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (shrink $ 1 * 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
[2m[algebraic-graphs] [mOK: Set.member x . preSet x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
[2m[algebraic-graphs] [mOK: postSet 2 (shrink $ 1 * 2) == Set.empty
[2m[algebraic-graphs] [mOK: Set.member x . postSet x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x == x
[2m[algebraic-graphs] [mOK: induce (const False) x == empty
[2m[algebraic-graphs] [mOK: induce (/= x) == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing) == empty
[2m[algebraic-graphs] [mOK: induceJust . vertex . Just == vertex
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.box ============
[2m[algebraic-graphs] [mOK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) ==
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: box x y ~~ box y x
[2m[algebraic-graphs] [mOK: box x (vertex ()) ~~ x
[2m[algebraic-graphs] [mOK: box x empty ~~ empty
[2m[algebraic-graphs] [mOK: box x (box y z) ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: transpose (box x y) == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: vertexCount (box x y) == vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.topSort ============
[2m[algebraic-graphs] [mOK: topSort empty == []
[2m[algebraic-graphs] [mOK: topSort (vertex x) == [x]
[2m[algebraic-graphs] [mOK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
[2m[algebraic-graphs] [mOK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
[2m[algebraic-graphs] [mOK: Right . topSort == AM.topSort . fromAcyclic
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.scc ============
[2m[algebraic-graphs] [mOK: scc empty == empty
[2m[algebraic-graphs] [mOK: scc (vertex x) == vertex (NonEmpty.vertex x)
[2m[algebraic-graphs] [mOK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
[2m[algebraic-graphs] [mOK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
[2m[algebraic-graphs] [mOK: edgeList $ scc (3 * 1 * 4 * 1 * 5) ==
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.toAcyclic ============
[2m[algebraic-graphs] [mOK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
[2m[algebraic-graphs] [mOK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
[2m[algebraic-graphs] [mOK: toAcyclic (circuit [1,2,3]) == Nothing
[2m[algebraic-graphs] [mOK: toAcyclic . fromAcyclic == Just
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.toAcyclicOrd ============
[2m[algebraic-graphs] [mOK: toAcyclicOrd empty == empty
[2m[algebraic-graphs] [mOK: toAcyclicOrd . vertex == vertex
[2m[algebraic-graphs] [mOK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
[2m[algebraic-graphs] [mOK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
[2m[algebraic-graphs] [mOK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
[2m[algebraic-graphs] [mOK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
[2m[algebraic-graphs] [mOK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.shrink ============
[2m[algebraic-graphs] [mOK: shrink . AM.vertex == vertex
[2m[algebraic-graphs] [mOK: shrink . AM.vertices == vertices
[2m[algebraic-graphs] [mOK: shrink . fromAcyclic == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.consistent ============
[2m[algebraic-graphs] [mOK: Arbitrary
[2m[algebraic-graphs] [mOK: empty
[2m[algebraic-graphs] [mOK: vertex
[2m[algebraic-graphs] [mOK: vertices
[2m[algebraic-graphs] [mOK: union
[2m[algebraic-graphs] [mOK: join
[2m[algebraic-graphs] [mOK: transpose
[2m[algebraic-graphs] [mOK: box
[2m[algebraic-graphs] [mOK: transitiveClosure
[2m[algebraic-graphs] [mOK: scc
[2m[algebraic-graphs] [mOK: toAcyclic
[2m[algebraic-graphs] [mOK: toAcyclicOrd
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap ============
[2m[algebraic-graphs] [mOK: Axioms of graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.fromAdjacencyMap ============
[2m[algebraic-graphs] [mOK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.consistent ============
[2m[algebraic-graphs] [mOK: Consistency of the Arbitrary instance
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: consistent empty == True
[2m[algebraic-graphs] [mOK: consistent (vertex x) == True
[2m[algebraic-graphs] [mOK: consistent (overlay x y) == True
[2m[algebraic-graphs] [mOK: consistent (connect x y) == True
[2m[algebraic-graphs] [mOK: consistent (edge x y) == True
[2m[algebraic-graphs] [mOK: consistent (edges xs) == True
[2m[algebraic-graphs] [mOK: consistent (stars xs) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.Show ============
[2m[algebraic-graphs] [mOK: show (empty ) == "empty"
[2m[algebraic-graphs] [mOK: show (1 ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2 ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2 ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1) ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 < vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 < edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 < edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 < edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 < edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 < edge 1 3
[2m[algebraic-graphs] [mOK: x <= x + y
[2m[algebraic-graphs] [mOK: x + y <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edge ============
[2m[algebraic-graphs] [mOK: edge x y == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty (overlay x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.connect ============
[2m[algebraic-graphs] [mOK: isEmpty (connect x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices [] == empty
[2m[algebraic-graphs] [mOK: vertices [x] == vertex x
[2m[algebraic-graphs] [mOK: vertices == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edges ============
[2m[algebraic-graphs] [mOK: edges [] == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)] == edge x y
[2m[algebraic-graphs] [mOK: edges == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.overlays ============
[2m[algebraic-graphs] [mOK: overlays [] == empty
[2m[algebraic-graphs] [mOK: overlays [x] == x
[2m[algebraic-graphs] [mOK: overlays [x,y] == overlay x y
[2m[algebraic-graphs] [mOK: overlays == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.connects ============
[2m[algebraic-graphs] [mOK: connects [] == empty
[2m[algebraic-graphs] [mOK: connects [x] == x
[2m[algebraic-graphs] [mOK: connects [x,y] == connect x y
[2m[algebraic-graphs] [mOK: connects == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.fromAdjacencyIntSets ============
[2m[algebraic-graphs] [mOK: fromAdjacencyIntSets [] == empty
[2m[algebraic-graphs] [mOK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
[2m[algebraic-graphs] [mOK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
[2m[algebraic-graphs] [mOK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
[2m[algebraic-graphs] [mOK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty x == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x) empty == False
[2m[algebraic-graphs] [mOK: isSubgraphOf x (overlay x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs) (circuit xs) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList == Set.toAscList . vertexSet
[2m[algebraic-graphs] [mOK: edgeList == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty vertex overlay connect == id
[2m[algebraic-graphs] [mOK: foldg empty vertex overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1 (const 1) (+) (+) == size
[2m[algebraic-graphs] [mOK: foldg True (const False) (&&) (&&) == isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty) == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z) == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount == length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x) == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y) == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x) == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.preIntSet ============
[2m[algebraic-graphs] [mOK: preIntSet x empty == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet 1 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet y (edge x y) == IntSet.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.postIntSet ============
[2m[algebraic-graphs] [mOK: postIntSet x empty == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet 2 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (edge x y) == IntSet.fromList [y]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.path ============
[2m[algebraic-graphs] [mOK: path [] == empty
[2m[algebraic-graphs] [mOK: path [x] == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.circuit ============
[2m[algebraic-graphs] [mOK: circuit [] == empty
[2m[algebraic-graphs] [mOK: circuit [x] == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.clique ============
[2m[algebraic-graphs] [mOK: clique [] == empty
[2m[algebraic-graphs] [mOK: clique [x] == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y] == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.biclique ============
[2m[algebraic-graphs] [mOK: biclique [] [] == empty
[2m[algebraic-graphs] [mOK: biclique [x] [] == vertex x
[2m[algebraic-graphs] [mOK: biclique [] [y] == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs ys == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.star ============
[2m[algebraic-graphs] [mOK: star x [] == vertex x
[2m[algebraic-graphs] [mOK: star x [y] == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.stars ============
[2m[algebraic-graphs] [mOK: stars [] == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])] == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])] == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)] == star x ys
[2m[algebraic-graphs] [mOK: stars == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x []) == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []]) == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.forest ============
[2m[algebraic-graphs] [mOK: forest [] == empty
[2m[algebraic-graphs] [mOK: forest [x] == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y) == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2) == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y) == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x == x
[2m[algebraic-graphs] [mOK: induce (const False) x == empty
[2m[algebraic-graphs] [mOK: induce (/= x) == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.compose ============
[2m[algebraic-graphs] [mOK: compose empty x == empty
[2m[algebraic-graphs] [mOK: compose x empty == empty
[2m[algebraic-graphs] [mOK: compose (vertex x) y == empty
[2m[algebraic-graphs] [mOK: compose x (vertex y) == empty
[2m[algebraic-graphs] [mOK: compose x (compose y z) == compose (compose x y) z
[2m[algebraic-graphs] [mOK: compose x (overlay y z) == overlay (compose x y) (compose x z)
[2m[algebraic-graphs] [mOK: compose (overlay x y) z == overlay (compose x z) (compose y z)
[2m[algebraic-graphs] [mOK: compose (edge x y) (edge y z) == edge x z
[2m[algebraic-graphs] [mOK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
[2m[algebraic-graphs] [mOK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.closure ============
[2m[algebraic-graphs] [mOK: closure empty == empty
[2m[algebraic-graphs] [mOK: closure (vertex x) == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x x) == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
[2m[algebraic-graphs] [mOK: closure == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y) == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x) == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x x) == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge x y) == edge x y
[2m[algebraic-graphs] [mOK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.bfsForest ============
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [0] == empty
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [2] == vertex 2
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 1) [1] == vertex 1
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ bfsForest x vs) x == True
[2m[algebraic-graphs] [mOK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
[2m[algebraic-graphs] [mOK: bfsForest x [] == []
[2m[algebraic-graphs] [mOK: bfsForest empty vs == []
[2m[algebraic-graphs] [mOK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] ==
[2m[algebraic-graphs] [mOK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.bfs ============
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [0] == []
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [1] == [[1], [2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [2] == [[2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [1,2] == [[1,2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [2,1] == [[2,1]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 1) [1] == [[1]]
[2m[algebraic-graphs] [mOK: bfs empty vs == []
[2m[algebraic-graphs] [mOK: bfs x [] == []
[2m[algebraic-graphs] [mOK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
[2m[algebraic-graphs] [mOK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
[2m[algebraic-graphs] [mOK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
[2m[algebraic-graphs] [mOK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
[2m[algebraic-graphs] [mOK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
[2m[algebraic-graphs] [mOK: map concat . transpose . map levels . bfsForest x == bfs x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.dfsForest ============
[2m[algebraic-graphs] [mOK: forest $ dfsForest empty == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 1 1) == vertex 1
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 1 2) == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 2 1) == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForest x) x == True
[2m[algebraic-graphs] [mOK: isDfsForestOf (dfsForest x) x == True
[2m[algebraic-graphs] [mOK: dfsForest . forest . dfsForest == dfsForest
[2m[algebraic-graphs] [mOK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
[2m[algebraic-graphs] [mOK: dfsForest $ 3 * (1 + 4) * (1 + 5) ==
[2m[algebraic-graphs] [mOK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.dfsForestFrom ============
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom empty vs == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [0] == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
[2m[algebraic-graphs] [mOK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
[2m[algebraic-graphs] [mOK: dfsForestFrom x (vertexList x) == dfsForest x
[2m[algebraic-graphs] [mOK: dfsForestFrom x [] == []
[2m[algebraic-graphs] [mOK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] ==
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.dfs ============
[2m[algebraic-graphs] [mOK: dfs empty vs == []
[2m[algebraic-graphs] [mOK: dfs (edge 1 1) [1] == [1]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [0] == []
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [1] == [1,2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [2] == [2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [1,2] == [1,2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [2,1] == [2,1]
[2m[algebraic-graphs] [mOK: dfs x [] == []
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- dfs x vs ] == True
[2m[algebraic-graphs] [mOK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
[2m[algebraic-graphs] [mOK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.dfs ============
[2m[algebraic-graphs] [mOK: reachable empty x == []
[2m[algebraic-graphs] [mOK: reachable (vertex 1) 1 == [1]
[2m[algebraic-graphs] [mOK: reachable (edge 1 1) 1 == [1]
[2m[algebraic-graphs] [mOK: reachable (edge 1 2) 0 == []
[2m[algebraic-graphs] [mOK: reachable (edge 1 2) 1 == [1,2]
[2m[algebraic-graphs] [mOK: reachable (edge 1 2) 2 == [2]
[2m[algebraic-graphs] [mOK: reachable (path [1..8] ) 4 == [4..8]
[2m[algebraic-graphs] [mOK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
[2m[algebraic-graphs] [mOK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- reachable x y ] == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.topSort ============
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
[2m[algebraic-graphs] [mOK: topSort (path [1..5]) == Right [1..5]
[2m[algebraic-graphs] [mOK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
[2m[algebraic-graphs] [mOK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
[2m[algebraic-graphs] [mOK: topSort (circuit [1..5]) == Left (3 :| [1,2])
[2m[algebraic-graphs] [mOK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
[2m[algebraic-graphs] [mOK: fmap (flip isTopSortOf x) (topSort x) /= Right False
[2m[algebraic-graphs] [mOK: topSort . vertices == Right . nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.testIsAcyclic ============
[2m[algebraic-graphs] [mOK: isAcyclic (1 * 2 + 3 * 1) == True
[2m[algebraic-graphs] [mOK: isAcyclic (1 * 2 + 2 * 1) == False
[2m[algebraic-graphs] [mOK: isAcyclic . circuit == null
[2m[algebraic-graphs] [mOK: isAcyclic == isRight . topSort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.isDfsForestOf ============
[2m[algebraic-graphs] [mOK: isDfsForestOf [] empty == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [] (vertex 1) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []] (vertex 1) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []] (vertex 2) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []] (edge 1 1) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []] (edge 1 2) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.isTopSortOf ============
[2m[algebraic-graphs] [mOK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
[2m[algebraic-graphs] [mOK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
[2m[algebraic-graphs] [mOK: isTopSortOf [] (1 * 2 + 3 * 1) == False
[2m[algebraic-graphs] [mOK: isTopSortOf [] empty == True
[2m[algebraic-graphs] [mOK: isTopSortOf [x] (vertex x) == True
[2m[algebraic-graphs] [mOK: isTopSortOf [x] (edge x x) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap ============
[2m[algebraic-graphs] [mOK: Axioms of graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.consistent ============
[2m[algebraic-graphs] [mOK: Consistency of the Arbitrary instance
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: consistent empty == True
[2m[algebraic-graphs] [mOK: consistent (vertex x) == True
[2m[algebraic-graphs] [mOK: consistent (overlay x y) == True
[2m[algebraic-graphs] [mOK: consistent (connect x y) == True
[2m[algebraic-graphs] [mOK: consistent (edge x y) == True
[2m[algebraic-graphs] [mOK: consistent (edges xs) == True
[2m[algebraic-graphs] [mOK: consistent (stars xs) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.Show ============
[2m[algebraic-graphs] [mOK: show (empty ) == "empty"
[2m[algebraic-graphs] [mOK: show (1 ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2 ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2 ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1) ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 < vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 < edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 < edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 < edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 < edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 < edge 1 3
[2m[algebraic-graphs] [mOK: x <= x + y
[2m[algebraic-graphs] [mOK: x + y <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edge ============
[2m[algebraic-graphs] [mOK: edge x y == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty (overlay x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.connect ============
[2m[algebraic-graphs] [mOK: isEmpty (connect x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices [] == empty
[2m[algebraic-graphs] [mOK: vertices [x] == vertex x
[2m[algebraic-graphs] [mOK: vertices == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edges ============
[2m[algebraic-graphs] [mOK: edges [] == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)] == edge x y
[2m[algebraic-graphs] [mOK: edges == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.overlays ============
[2m[algebraic-graphs] [mOK: overlays [] == empty
[2m[algebraic-graphs] [mOK: overlays [x] == x
[2m[algebraic-graphs] [mOK: overlays [x,y] == overlay x y
[2m[algebraic-graphs] [mOK: overlays == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.connects ============
[2m[algebraic-graphs] [mOK: connects [] == empty
[2m[algebraic-graphs] [mOK: connects [x] == x
[2m[algebraic-graphs] [mOK: connects [x,y] == connect x y
[2m[algebraic-graphs] [mOK: connects == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.fromAdjacencySets ============
[2m[algebraic-graphs] [mOK: fromAdjacencySets [] == empty
[2m[algebraic-graphs] [mOK: fromAdjacencySets [(x, Set.empty)] == vertex x
[2m[algebraic-graphs] [mOK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
[2m[algebraic-graphs] [mOK: fromAdjacencySets . map (fmap Set.fromList) == stars
[2m[algebraic-graphs] [mOK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty x == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x) empty == False
[2m[algebraic-graphs] [mOK: isSubgraphOf x (overlay x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs) (circuit xs) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList == Set.toAscList . vertexSet
[2m[algebraic-graphs] [mOK: edgeList == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty vertex overlay connect == id
[2m[algebraic-graphs] [mOK: foldg empty vertex overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1 (const 1) (+) (+) == size
[2m[algebraic-graphs] [mOK: foldg True (const False) (&&) (&&) == isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty) == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z) == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount == length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x) == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y) == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x) == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.preIntSet ============
[2m[algebraic-graphs] [mOK: preIntSet x empty == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet 1 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet y (edge x y) == IntSet.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.postIntSet ============
[2m[algebraic-graphs] [mOK: postIntSet x empty == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet 2 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (edge x y) == IntSet.fromList [y]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.path ============
[2m[algebraic-graphs] [mOK: path [] == empty
[2m[algebraic-graphs] [mOK: path [x] == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.circuit ============
[2m[algebraic-graphs] [mOK: circuit [] == empty
[2m[algebraic-graphs] [mOK: circuit [x] == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.clique ============
[2m[algebraic-graphs] [mOK: clique [] == empty
[2m[algebraic-graphs] [mOK: clique [x] == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y] == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.biclique ============
[2m[algebraic-graphs] [mOK: biclique [] [] == empty
[2m[algebraic-graphs] [mOK: biclique [x] [] == vertex x
[2m[algebraic-graphs] [mOK: biclique [] [y] == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs ys == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.star ============
[2m[algebraic-graphs] [mOK: star x [] == vertex x
[2m[algebraic-graphs] [mOK: star x [y] == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.stars ============
[2m[algebraic-graphs] [mOK: stars [] == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])] == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])] == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)] == star x ys
[2m[algebraic-graphs] [mOK: stars == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x []) == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []]) == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.forest ============
[2m[algebraic-graphs] [mOK: forest [] == empty
[2m[algebraic-graphs] [mOK: forest [x] == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y) == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2) == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y) == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x == x
[2m[algebraic-graphs] [mOK: induce (const False) x == empty
[2m[algebraic-graphs] [mOK: induce (/= x) == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.compose ============
[2m[algebraic-graphs] [mOK: compose empty x == empty
[2m[algebraic-graphs] [mOK: compose x empty == empty
[2m[algebraic-graphs] [mOK: compose (vertex x) y == empty
[2m[algebraic-graphs] [mOK: compose x (vertex y) == empty
[2m[algebraic-graphs] [mOK: compose x (compose y z) == compose (compose x y) z
[2m[algebraic-graphs] [mOK: compose x (overlay y z) == overlay (compose x y) (compose x z)
[2m[algebraic-graphs] [mOK: compose (overlay x y) z == overlay (compose x z) (compose y z)
[2m[algebraic-graphs] [mOK: compose (edge x y) (edge y z) == edge x z
[2m[algebraic-graphs] [mOK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
[2m[algebraic-graphs] [mOK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.closure ============
[2m[algebraic-graphs] [mOK: closure empty == empty
[2m[algebraic-graphs] [mOK: closure (vertex x) == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x x) == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
[2m[algebraic-graphs] [mOK: closure == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y) == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x) == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x x) == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge x y) == edge x y
[2m[algebraic-graphs] [mOK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.box ============
[2m[algebraic-graphs] [mOK: box x y ~~ box y x
[2m[algebraic-graphs] [mOK: box x (overlay y z) == overlay (box x y) (box x z)
[2m[algebraic-graphs] [mOK: box x (vertex ()) ~~ x
[2m[algebraic-graphs] [mOK: box x empty ~~ empty
[2m[algebraic-graphs] [mOK: box x (box y z) ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: transpose (box x y) == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: vertexCount (box x y) == vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.bfsForest ============
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [0] == empty
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [2] == vertex 2
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 1) [1] == vertex 1
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ bfsForest x vs) x == True
[2m[algebraic-graphs] [mOK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
[2m[algebraic-graphs] [mOK: bfsForest x [] == []
[2m[algebraic-graphs] [mOK: bfsForest empty vs == []
[2m[algebraic-graphs] [mOK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] ==
[2m[algebraic-graphs] [mOK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.bfs ============
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [0] == []
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [1] == [[1], [2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [2] == [[2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [1,2] == [[1,2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [2,1] == [[2,1]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 1) [1] == [[1]]
[2m[algebraic-graphs] [mOK: bfs empty vs == []
[2m[algebraic-graphs] [mOK: bfs x [] == []
[2m[algebraic-graphs] [mOK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
[2m[algebraic-graphs] [mOK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
[2m[algebraic-graphs] [mOK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
[2m[algebraic-graphs] [mOK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
[2m[algebraic-graphs] [mOK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
[2m[algebraic-graphs] [mOK: map concat . transpose . map levels . bfsForest x == bfs x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.dfsForest ============
[2m[algebraic-graphs] [mOK: forest $ dfsForest empty == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 1 1) == vertex 1
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 1 2) == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 2 1) == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForest x) x == True
[2m[algebraic-graphs] [mOK: isDfsForestOf (dfsForest x) x == True
[2m[algebraic-graphs] [mOK: dfsForest . forest . dfsForest == dfsForest
[2m[algebraic-graphs] [mOK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
[2m[algebraic-graphs] [mOK: dfsForest $ 3 * (1 + 4) * (1 + 5) ==
[2m[algebraic-graphs] [mOK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.dfsForestFrom ============
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom empty vs == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [0] == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
[2m[algebraic-graphs] [mOK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
[2m[algebraic-graphs] [mOK: dfsForestFrom x (vertexList x) == dfsForest x
[2m[algebraic-graphs] [mOK: dfsForestFrom x [] == []
[2m[algebraic-graphs] [mOK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] ==
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.dfs ============
[2m[algebraic-graphs] [mOK: dfs empty vs == []
[2m[algebraic-graphs] [mOK: dfs (edge 1 1) [1] == [1]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [0] == []
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [1] == [1,2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [2] == [2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [1,2] == [1,2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [2,1] == [2,1]
[2m[algebraic-graphs] [mOK: dfs x [] == []
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- dfs x vs ] == True
[2m[algebraic-graphs] [mOK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
[2m[algebraic-graphs] [mOK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.dfs ============
[2m[algebraic-graphs] [mOK: reachable empty x == []
[2m[algebraic-graphs] [mOK: reachable (vertex 1) 1 == [1]
[2m[algebraic-graphs] [mOK: reachable (edge 1 1) 1 == [1]
[2m[algebraic-graphs] [mOK: reachable (edge 1 2) 0 == []
[2m[algebraic-graphs] [mOK: reachable (edge 1 2) 1 == [1,2]
[2m[algebraic-graphs] [mOK: reachable (edge 1 2) 2 == [2]
[2m[algebraic-graphs] [mOK: reachable (path [1..8] ) 4 == [4..8]
[2m[algebraic-graphs] [mOK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
[2m[algebraic-graphs] [mOK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- reachable x y ] == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.topSort ============
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
[2m[algebraic-graphs] [mOK: topSort (path [1..5]) == Right [1..5]
[2m[algebraic-graphs] [mOK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
[2m[algebraic-graphs] [mOK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
[2m[algebraic-graphs] [mOK: topSort (circuit [1..5]) == Left (3 :| [1,2])
[2m[algebraic-graphs] [mOK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
[2m[algebraic-graphs] [mOK: fmap (flip isTopSortOf x) (topSort x) /= Right False
[2m[algebraic-graphs] [mOK: topSort . vertices == Right . nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.testIsAcyclic ============
[2m[algebraic-graphs] [mOK: isAcyclic (1 * 2 + 3 * 1) == True
[2m[algebraic-graphs] [mOK: isAcyclic (1 * 2 + 2 * 1) == False
[2m[algebraic-graphs] [mOK: isAcyclic . circuit == null
[2m[algebraic-graphs] [mOK: isAcyclic == isRight . topSort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.isDfsForestOf ============
[2m[algebraic-graphs] [mOK: isDfsForestOf [] empty == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [] (vertex 1) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []] (vertex 1) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []] (vertex 2) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []] (edge 1 1) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []] (edge 1 2) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.isTopSortOf ============
[2m[algebraic-graphs] [mOK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
[2m[algebraic-graphs] [mOK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
[2m[algebraic-graphs] [mOK: isTopSortOf [] (1 * 2 + 3 * 1) == False
[2m[algebraic-graphs] [mOK: isTopSortOf [] empty == True
[2m[algebraic-graphs] [mOK: isTopSortOf [x] (vertex x) == True
[2m[algebraic-graphs] [mOK: isTopSortOf [x] (edge x x) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing) == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing) == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.scc ============
[2m[algebraic-graphs] [mOK: scc empty == empty
[2m[algebraic-graphs] [mOK: scc (vertex x) == vertex (NonEmpty.vertex x)
[2m[algebraic-graphs] [mOK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
[2m[algebraic-graphs] [mOK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
[2m[algebraic-graphs] [mOK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
[2m[algebraic-graphs] [mOK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
[2m[algebraic-graphs] [mOK: scc (3 * 1 * 4 * 1 * 5) ==
[2m[algebraic-graphs] [mOK: isAcyclic . scc == const True
[2m[algebraic-graphs] [mOK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
[2m[algebraic-graphs] [mOK: scc g == KL.scc g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Num ============
[2m[algebraic-graphs] [mOK: 0 == rightVertex 0
[2m[algebraic-graphs] [mOK: swap 1 == leftVertex 1
[2m[algebraic-graphs] [mOK: swap 1 + 2 == vertices [1] [2]
[2m[algebraic-graphs] [mOK: swap 1 * 2 == edge 1 2
[2m[algebraic-graphs] [mOK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
[2m[algebraic-graphs] [mOK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Show ============
[2m[algebraic-graphs] [mOK: show empty == "empty"
[2m[algebraic-graphs] [mOK: show 1 == "rightVertex 1"
[2m[algebraic-graphs] [mOK: show (swap 2) == "leftVertex 2"
[2m[algebraic-graphs] [mOK: show 1 + 2 == "vertices [] [1,2]"
[2m[algebraic-graphs] [mOK: show (swap (1 + 2)) == "vertices [1,2] []"
[2m[algebraic-graphs] [mOK: show (swap 1 * 2) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
[2m[algebraic-graphs] [mOK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Eq ============
[2m[algebraic-graphs] [mOK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: x + y == y + x
[2m[algebraic-graphs] [mOK: x + (y + z) == (x + y) + z
[2m[algebraic-graphs] [mOK: x * empty == x
[2m[algebraic-graphs] [mOK: empty * x == x
[2m[algebraic-graphs] [mOK: x * y == y * x
[2m[algebraic-graphs] [mOK: x * (y * z) == (x * y) * z
[2m[algebraic-graphs] [mOK: x * (y + z) == x * y + x * z
[2m[algebraic-graphs] [mOK: (x + y) * z == x * z + y * z
[2m[algebraic-graphs] [mOK: x * y * z == x * y + x * z + y * z
[2m[algebraic-graphs] [mOK: x + empty == x
[2m[algebraic-graphs] [mOK: empty + x == x
[2m[algebraic-graphs] [mOK: x + x == x
[2m[algebraic-graphs] [mOK: x * y + x + y == x * y
[2m[algebraic-graphs] [mOK: x * x * x == x * x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
[2m[algebraic-graphs] [mOK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
[2m[algebraic-graphs] [mOK: leftAdjacencyMap empty == Map.empty
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (rightVertex x) == Map.empty
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
[2m[algebraic-graphs] [mOK: rightAdjacencyMap empty == Map.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (leftVertex x) == Map.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: leftAdjacencyMap empty == Map.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap empty == Map.empty
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftVertex ============
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (leftVertex x) == Map.empty
[2m[algebraic-graphs] [mOK: hasLeftVertex x (leftVertex y) == (x == y)
[2m[algebraic-graphs] [mOK: hasRightVertex x (leftVertex y) == False
[2m[algebraic-graphs] [mOK: hasEdge x y (leftVertex z) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightVertex ============
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (rightVertex x) == Map.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
[2m[algebraic-graphs] [mOK: hasLeftVertex x (rightVertex y) == False
[2m[algebraic-graphs] [mOK: hasRightVertex x (rightVertex y) == (x == y)
[2m[algebraic-graphs] [mOK: hasEdge x y (rightVertex z) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: vertex . Left == leftVertex
[2m[algebraic-graphs] [mOK: vertex . Right == rightVertex
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edge ============
[2m[algebraic-graphs] [mOK: edge x y == connect (leftVertex x) (rightVertex y)
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: hasEdge 1 2 (edge 2 1) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty (overlay x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.connect ============
[2m[algebraic-graphs] [mOK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
[2m[algebraic-graphs] [mOK: connect (leftVertex x) (rightVertex y) == edge x y
[2m[algebraic-graphs] [mOK: connect (rightVertex x) (leftVertex y) == edge y x
[2m[algebraic-graphs] [mOK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
[2m[algebraic-graphs] [mOK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
[2m[algebraic-graphs] [mOK: isEmpty (connect x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices [] [] == empty
[2m[algebraic-graphs] [mOK: vertices [x] [] == leftVertex x
[2m[algebraic-graphs] [mOK: vertices [] [x] == rightVertex x
[2m[algebraic-graphs] [mOK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
[2m[algebraic-graphs] [mOK: hasLeftVertex x (vertices xs ys) == elem x xs
[2m[algebraic-graphs] [mOK: hasRightVertex y (vertices xs ys) == elem y ys
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edges ============
[2m[algebraic-graphs] [mOK: edges [] == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)] == edge x y
[2m[algebraic-graphs] [mOK: edges == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: hasEdge x y . edges == elem (x,y)
[2m[algebraic-graphs] [mOK: edgeCount . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.overlays ============
[2m[algebraic-graphs] [mOK: overlays [] == empty
[2m[algebraic-graphs] [mOK: overlays [x] == x
[2m[algebraic-graphs] [mOK: overlays [x,y] == overlay x y
[2m[algebraic-graphs] [mOK: overlays == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.connects ============
[2m[algebraic-graphs] [mOK: connects [] == empty
[2m[algebraic-graphs] [mOK: connects [x] == x
[2m[algebraic-graphs] [mOK: connects [x,y] == connect x y
[2m[algebraic-graphs] [mOK: connects == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.swap ============
[2m[algebraic-graphs] [mOK: swap empty == empty
[2m[algebraic-graphs] [mOK: swap . leftVertex == rightVertex
[2m[algebraic-graphs] [mOK: swap (vertices xs ys) == vertices ys xs
[2m[algebraic-graphs] [mOK: swap (edge x y) == edge y x
[2m[algebraic-graphs] [mOK: swap . edges == edges . map Data.Tuple.swap
[2m[algebraic-graphs] [mOK: swap . swap == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.toBipartite ============
[2m[algebraic-graphs] [mOK: toBipartite empty == empty
[2m[algebraic-graphs] [mOK: toBipartite (vertex (Left x)) == leftVertex x
[2m[algebraic-graphs] [mOK: toBipartite (vertex (Right x)) == rightVertex x
[2m[algebraic-graphs] [mOK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
[2m[algebraic-graphs] [mOK: toBipartite (edge (Left x) (Right y)) == edge x y
[2m[algebraic-graphs] [mOK: toBipartite (edge (Right x) (Left y)) == edge y x
[2m[algebraic-graphs] [mOK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
[2m[algebraic-graphs] [mOK: toBipartite . clique == uncurry biclique . partitionEithers
[2m[algebraic-graphs] [mOK: toBipartite . fromBipartite == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.toBipartiteWith ============
[2m[algebraic-graphs] [mOK: toBipartiteWith f empty == empty
[2m[algebraic-graphs] [mOK: toBipartiteWith Left x == vertices (vertexList x) []
[2m[algebraic-graphs] [mOK: toBipartiteWith Right x == vertices [] (vertexList x)
[2m[algebraic-graphs] [mOK: toBipartiteWith f == toBipartite . gmap f
[2m[algebraic-graphs] [mOK: toBipartiteWith id == toBipartite
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.fromBipartite ============
[2m[algebraic-graphs] [mOK: fromBipartite empty == empty
[2m[algebraic-graphs] [mOK: fromBipartite (leftVertex x) == vertex (Left x)
[2m[algebraic-graphs] [mOK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.fromBipartiteWith ============
[2m[algebraic-graphs] [mOK: fromBipartiteWith Left Right == fromBipartite
[2m[algebraic-graphs] [mOK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
[2m[algebraic-graphs] [mOK: fromBipartiteWith id id . edges == symmetricClosure . edges
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty) == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: isEmpty == (==) empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.hasLeftVertex ============
[2m[algebraic-graphs] [mOK: hasLeftVertex x empty == False
[2m[algebraic-graphs] [mOK: hasLeftVertex x (leftVertex y) == (x == y)
[2m[algebraic-graphs] [mOK: hasLeftVertex x (rightVertex y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.hasRightVertex ============
[2m[algebraic-graphs] [mOK: hasRightVertex x empty == False
[2m[algebraic-graphs] [mOK: hasRightVertex x (leftVertex y) == False
[2m[algebraic-graphs] [mOK: hasRightVertex x (rightVertex y) == (x == y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex . Left == hasLeftVertex
[2m[algebraic-graphs] [mOK: hasVertex . Right == hasRightVertex
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z) == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: hasEdge x y == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftVertexCount ============
[2m[algebraic-graphs] [mOK: leftVertexCount empty == 0
[2m[algebraic-graphs] [mOK: leftVertexCount (leftVertex x) == 1
[2m[algebraic-graphs] [mOK: leftVertexCount (rightVertex x) == 0
[2m[algebraic-graphs] [mOK: leftVertexCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: leftVertexCount . edges == length . nub . map fst
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightVertexCount ============
[2m[algebraic-graphs] [mOK: rightVertexCount empty == 0
[2m[algebraic-graphs] [mOK: rightVertexCount (leftVertex x) == 0
[2m[algebraic-graphs] [mOK: rightVertexCount (rightVertex x) == 1
[2m[algebraic-graphs] [mOK: rightVertexCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: rightVertexCount . edges == length . nub . map snd
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge x y) == 2
[2m[algebraic-graphs] [mOK: vertexCount x == leftVertexCount x + rightVertexCount x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftVertexList ============
[2m[algebraic-graphs] [mOK: leftVertexList empty == []
[2m[algebraic-graphs] [mOK: leftVertexList (leftVertex x) == [x]
[2m[algebraic-graphs] [mOK: leftVertexList (rightVertex x) == []
[2m[algebraic-graphs] [mOK: leftVertexList . flip vertices [] == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightVertexList ============
[2m[algebraic-graphs] [mOK: rightVertexList empty == []
[2m[algebraic-graphs] [mOK: rightVertexList (leftVertex x) == []
[2m[algebraic-graphs] [mOK: rightVertexList (rightVertex x) == [x]
[2m[algebraic-graphs] [mOK: rightVertexList . vertices [] == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList (edge x y) == [Left x, Right y]
[2m[algebraic-graphs] [mOK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x) == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y) == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList . edges == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftVertexSet ============
[2m[algebraic-graphs] [mOK: leftVertexSet empty == Set.empty
[2m[algebraic-graphs] [mOK: leftVertexSet . leftVertex == Set.singleton
[2m[algebraic-graphs] [mOK: leftVertexSet . rightVertex == const Set.empty
[2m[algebraic-graphs] [mOK: leftVertexSet . flip vertices [] == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightVertexSet ============
[2m[algebraic-graphs] [mOK: rightVertexSet empty == Set.empty
[2m[algebraic-graphs] [mOK: rightVertexSet . leftVertex == const Set.empty
[2m[algebraic-graphs] [mOK: rightVertexSet . rightVertex == Set.singleton
[2m[algebraic-graphs] [mOK: rightVertexSet . vertices [] == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
[2m[algebraic-graphs] [mOK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftAdjacencyList ============
[2m[algebraic-graphs] [mOK: leftAdjacencyList empty == []
[2m[algebraic-graphs] [mOK: leftAdjacencyList (vertices [] xs) == []
[2m[algebraic-graphs] [mOK: leftAdjacencyList (vertices xs []) == []
[2m[algebraic-graphs] [mOK: leftAdjacencyList (edge x y) == [(x, [y])]
[2m[algebraic-graphs] [mOK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightAdjacencyList ============
[2m[algebraic-graphs] [mOK: rightAdjacencyList empty == []
[2m[algebraic-graphs] [mOK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
[2m[algebraic-graphs] [mOK: rightAdjacencyList (vertices xs []) == []
[2m[algebraic-graphs] [mOK: rightAdjacencyList (edge x y) == [(y, [x])]
[2m[algebraic-graphs] [mOK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.evenList ============
[2m[algebraic-graphs] [mOK: evenList [] == Nil
[2m[algebraic-graphs] [mOK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
[2m[algebraic-graphs] [mOK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.oddList ============
[2m[algebraic-graphs] [mOK: oddList 1 [] == Cons 1 Nil
[2m[algebraic-graphs] [mOK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
[2m[algebraic-graphs] [mOK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.path ============
[2m[algebraic-graphs] [mOK: path Nil == empty
[2m[algebraic-graphs] [mOK: path (Cons x Nil) == leftVertex x
[2m[algebraic-graphs] [mOK: path (Cons x (Cons y Nil)) == edge x y
[2m[algebraic-graphs] [mOK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.circuit ============
[2m[algebraic-graphs] [mOK: circuit [] == empty
[2m[algebraic-graphs] [mOK: circuit [(x,y)] == edge x y
[2m[algebraic-graphs] [mOK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
[2m[algebraic-graphs] [mOK: circuit . reverse == swap . circuit . map Data.Tuple.swap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.biclique ============
[2m[algebraic-graphs] [mOK: biclique [] [] == empty
[2m[algebraic-graphs] [mOK: biclique xs [] == vertices xs []
[2m[algebraic-graphs] [mOK: biclique [] ys == vertices [] ys
[2m[algebraic-graphs] [mOK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.star ============
[2m[algebraic-graphs] [mOK: star x [] == leftVertex x
[2m[algebraic-graphs] [mOK: star x [y] == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys == connect (leftVertex x) (vertices [] ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.stars ============
[2m[algebraic-graphs] [mOK: stars [] == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])] == leftVertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])] == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)] == star x ys
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: stars == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.mesh ============
[2m[algebraic-graphs] [mOK: mesh xs [] == empty
[2m[algebraic-graphs] [mOK: mesh [] ys == empty
[2m[algebraic-graphs] [mOK: mesh [x] [y] == leftVertex (x,y)
[2m[algebraic-graphs] [mOK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
[2m[algebraic-graphs] [mOK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.removeLeftVertex ============
[2m[algebraic-graphs] [mOK: removeLeftVertex x (leftVertex x) == empty
[2m[algebraic-graphs] [mOK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
[2m[algebraic-graphs] [mOK: removeLeftVertex x (rightVertex y) == rightVertex y
[2m[algebraic-graphs] [mOK: removeLeftVertex x (edge x y) == rightVertex y
[2m[algebraic-graphs] [mOK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.removeRightVertex ============
[2m[algebraic-graphs] [mOK: removeRightVertex x (rightVertex x) == empty
[2m[algebraic-graphs] [mOK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
[2m[algebraic-graphs] [mOK: removeRightVertex x (leftVertex y) == leftVertex y
[2m[algebraic-graphs] [mOK: removeRightVertex y (edge x y) == leftVertex x
[2m[algebraic-graphs] [mOK: removeRightVertex x . removeRightVertex x == removeRightVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y) == vertices [x] [y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
[2m[algebraic-graphs] [mOK: removeEdge x y . removeRightVertex y == removeRightVertex y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.bimap ============
[2m[algebraic-graphs] [mOK: bimap f g empty == empty
[2m[algebraic-graphs] [mOK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
[2m[algebraic-graphs] [mOK: bimap f g (edge x y) == edge (f x) (g y)
[2m[algebraic-graphs] [mOK: bimap id id == id
[2m[algebraic-graphs] [mOK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.box ============
[2m[algebraic-graphs] [mOK: box (path [0,1]) (path ['a','b']) ==
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: box x y ~~ box y x
[2m[algebraic-graphs] [mOK: box x (box y z) ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: box x (box y z) ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: box x (leftVertex ()) ~~ x
[2m[algebraic-graphs] [mOK: box x (rightVertex ()) ~~ swap x
[2m[algebraic-graphs] [mOK: box x empty ~~ empty
[2m[algebraic-graphs] [mOK: vertexCount (box x y) <= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: box == boxWith (,) (,) (,) (,)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.consistent ============
[2m[algebraic-graphs] [mOK: consistent empty == True
[2m[algebraic-graphs] [mOK: consistent (vertex x) == True
[2m[algebraic-graphs] [mOK: consistent (edge x y) == True
[2m[algebraic-graphs] [mOK: consistent (edges x) == True
[2m[algebraic-graphs] [mOK: consistent (toBipartite x) == True
[2m[algebraic-graphs] [mOK: consistent (swap x) == True
[2m[algebraic-graphs] [mOK: consistent (circuit xs) == True
[2m[algebraic-graphs] [mOK: consistent (biclique xs ys) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
[2m[algebraic-graphs] [mOK: detectParts empty == Right empty
[2m[algebraic-graphs] [mOK: detectParts (vertex 1) == Right (leftVertex 1)
[2m[algebraic-graphs] [mOK: detectParts (edge 1 1) == Left [1]
[2m[algebraic-graphs] [mOK: detectParts (edge 1 2) == Right (edge 1 2)
[2m[algebraic-graphs] [mOK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
[2m[algebraic-graphs] [mOK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
[2m[algebraic-graphs] [mOK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
[2m[algebraic-graphs] [mOK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
[2m[algebraic-graphs] [mOK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
[2m[algebraic-graphs] [mOK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
[2m[algebraic-graphs] [mOK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
[2m[algebraic-graphs] [mOK: detectParts (clique [1..10]) == Left [1, 2, 3]
[2m[algebraic-graphs] [mOK: detectParts (circuit [1..11]) == Left [1..11]
[2m[algebraic-graphs] [mOK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
[2m[algebraic-graphs] [mOK: detectParts (biclique [] xs) == Right (vertices xs [])
[2m[algebraic-graphs] [mOK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
[2m[algebraic-graphs] [mOK: isRight (detectParts (star x ys)) == not (elem x ys)
[2m[algebraic-graphs] [mOK: isRight (detectParts (fromBipartite (toBipartite x))) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
[2m[algebraic-graphs] [mOK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
[2m[algebraic-graphs] [mOK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
[2m[algebraic-graphs] [mOK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
[2m[algebraic-graphs] [mOK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
[2m[algebraic-graphs] [mOK: show (matching []) == "matching []"
[2m[algebraic-graphs] [mOK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
[2m[algebraic-graphs] [mOK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
[2m[algebraic-graphs] [mOK: pairOfLeft (matching []) == Map.empty
[2m[algebraic-graphs] [mOK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
[2m[algebraic-graphs] [mOK: Map.size . pairOfLeft == Map.size . pairOfRight
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
[2m[algebraic-graphs] [mOK: pairOfRight (matching []) == Map.empty
[2m[algebraic-graphs] [mOK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
[2m[algebraic-graphs] [mOK: Map.size . pairOfRight == Map.size . pairOfLeft
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.matching ============
[2m[algebraic-graphs] [mOK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
[2m[algebraic-graphs] [mOK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
[2m[algebraic-graphs] [mOK: isMatchingOf (matching []) x == True
[2m[algebraic-graphs] [mOK: isMatchingOf (matching xs) empty == null xs
[2m[algebraic-graphs] [mOK: isMatchingOf (matching [(x,y)]) (edge x y) == True
[2m[algebraic-graphs] [mOK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
[2m[algebraic-graphs] [mOK: matchingSize (matching []) == 0
[2m[algebraic-graphs] [mOK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
[2m[algebraic-graphs] [mOK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
[2m[algebraic-graphs] [mOK: matchingSize (matching xs) <= length xs
[2m[algebraic-graphs] [mOK: matchingSize x == Map.size . pairOfLeft
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
[2m[algebraic-graphs] [mOK: maxMatching empty == matching []
[2m[algebraic-graphs] [mOK: maxMatching (vertices xs ys) == matching []
[2m[algebraic-graphs] [mOK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
[2m[algebraic-graphs] [mOK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
[2m[algebraic-graphs] [mOK: matchingSize (maxMatching (star x (y:ys))) == 1
[2m[algebraic-graphs] [mOK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
[2m[algebraic-graphs] [mOK: isMatchingOf (maxMatching x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
[2m[algebraic-graphs] [mOK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
[2m[algebraic-graphs] [mOK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
[2m[algebraic-graphs] [mOK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
[2m[algebraic-graphs] [mOK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
[2m[algebraic-graphs] [mOK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
[2m[algebraic-graphs] [mOK: minVertexCover empty == (Set.empty, Set.empty)
[2m[algebraic-graphs] [mOK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
[2m[algebraic-graphs] [mOK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
[2m[algebraic-graphs] [mOK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
[2m[algebraic-graphs] [mOK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
[2m[algebraic-graphs] [mOK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
[2m[algebraic-graphs] [mOK: isVertexCoverOf (minVertexCover x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
[2m[algebraic-graphs] [mOK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
[2m[algebraic-graphs] [mOK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
[2m[algebraic-graphs] [mOK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
[2m[algebraic-graphs] [mOK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
[2m[algebraic-graphs] [mOK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
[2m[algebraic-graphs] [mOK: maxIndependentSet empty == (Set.empty, Set.empty)
[2m[algebraic-graphs] [mOK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
[2m[algebraic-graphs] [mOK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
[2m[algebraic-graphs] [mOK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
[2m[algebraic-graphs] [mOK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
[2m[algebraic-graphs] [mOK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
[2m[algebraic-graphs] [mOK: isIndependentSetOf (maxIndependentSet x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
[2m[algebraic-graphs] [mOK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
[2m[algebraic-graphs] [mOK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
[2m[algebraic-graphs] [mOK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
[2m[algebraic-graphs] [mOK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
[2m[algebraic-graphs] [mOK: isLeft (augmentingPath (maxMatching x) x) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
[2m[algebraic-graphs] [mOK: consistentMatching (matching xs) == True
[2m[algebraic-graphs] [mOK: consistentMatching (maxMatching x) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Eq ============
[2m[algebraic-graphs] [mOK: mempty /= literal ""
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Ord ============
[2m[algebraic-graphs] [mOK: mempty < literal ""
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty mempty == True
[2m[algebraic-graphs] [mOK: isEmpty (literal "") == False
[2m[algebraic-graphs] [mOK: isEmpty x == (x == mempty)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.literal ============
[2m[algebraic-graphs] [mOK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
[2m[algebraic-graphs] [mOK: literal "I am just a string literal" == "I am just a string literal"
[2m[algebraic-graphs] [mOK: render . literal == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.render ============
[2m[algebraic-graphs] [mOK: render (literal "al" <> literal "ga") == "alga"
[2m[algebraic-graphs] [mOK: render mempty == mempty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.<+> ============
[2m[algebraic-graphs] [mOK: x <+> mempty == x
[2m[algebraic-graphs] [mOK: mempty <+> x == x
[2m[algebraic-graphs] [mOK: x <+> (y <+> z) == (x <+> y) <+> z
[2m[algebraic-graphs] [mOK: "name" <+> "surname" == "name surname"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.brackets ============
[2m[algebraic-graphs] [mOK: brackets "i" == "[i]"
[2m[algebraic-graphs] [mOK: brackets mempty == "[]"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.doubleQuotes ============
[2m[algebraic-graphs] [mOK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
[2m[algebraic-graphs] [mOK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.indent ============
[2m[algebraic-graphs] [mOK: indent 0 == id
[2m[algebraic-graphs] [mOK: indent 1 mempty == " "
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.unlines ============
[2m[algebraic-graphs] [mOK: unlines [] == mempty
[2m[algebraic-graphs] [mOK: unlines [mempty] == "\n"
[2m[algebraic-graphs] [mOK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.export ============
[2m[algebraic-graphs] [mOK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Dot.export ============
[2m[algebraic-graphs] [mOK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m=========== Export.Dot.attributeQuoting ============
[2m[algebraic-graphs] [mOK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Dot.exportAsIs ============
[2m[algebraic-graphs] [mOK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Dot.exportViaShow ============
[2m[algebraic-graphs] [mOK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph ============
[2m[algebraic-graphs] [mOK: Axioms of graphs
[2m[algebraic-graphs] [mOK: Theorems of graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 < vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 < edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 < edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 < edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 < edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 < edge 1 3
[2m[algebraic-graphs] [mOK: x <= x + y
[2m[algebraic-graphs] [mOK: x + y <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.empty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edge ============
[2m[algebraic-graphs] [mOK: edge x y == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty (overlay x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.connect ============
[2m[algebraic-graphs] [mOK: isEmpty (connect x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertices ============
[2m[algebraic-graphs] [mOK: vertices [] == empty
[2m[algebraic-graphs] [mOK: vertices [x] == vertex x
[2m[algebraic-graphs] [mOK: vertices == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edges ============
[2m[algebraic-graphs] [mOK: edges [] == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)] == edge x y
[2m[algebraic-graphs] [mOK: edges == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.overlays ============
[2m[algebraic-graphs] [mOK: overlays [] == empty
[2m[algebraic-graphs] [mOK: overlays [x] == x
[2m[algebraic-graphs] [mOK: overlays [x,y] == overlay x y
[2m[algebraic-graphs] [mOK: overlays == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.connects ============
[2m[algebraic-graphs] [mOK: connects [] == empty
[2m[algebraic-graphs] [mOK: connects [x] == x
[2m[algebraic-graphs] [mOK: connects [x,y] == connect x y
[2m[algebraic-graphs] [mOK: connects == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty x == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x) empty == False
[2m[algebraic-graphs] [mOK: isSubgraphOf x (overlay x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs) (circuit xs) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList == Set.toAscList . vertexSet
[2m[algebraic-graphs] [mOK: edgeList == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty vertex overlay connect == id
[2m[algebraic-graphs] [mOK: foldg empty vertex overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1 (const 1) (+) (+) == size
[2m[algebraic-graphs] [mOK: foldg True (const False) (&&) (&&) == isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty) == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z) == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount == length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x) == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y) == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x) == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.preIntSet ============
[2m[algebraic-graphs] [mOK: preIntSet x empty == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet 1 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet y (edge x y) == IntSet.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.postIntSet ============
[2m[algebraic-graphs] [mOK: postIntSet x empty == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet 2 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (edge x y) == IntSet.fromList [y]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.size ============
[2m[algebraic-graphs] [mOK: size empty == 1
[2m[algebraic-graphs] [mOK: size (vertex x) == 1
[2m[algebraic-graphs] [mOK: size (overlay x y) == size x + size y
[2m[algebraic-graphs] [mOK: size (connect x y) == size x + size y
[2m[algebraic-graphs] [mOK: size x >= 1
[2m[algebraic-graphs] [mOK: size x >= vertexCount x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.path ============
[2m[algebraic-graphs] [mOK: path [] == empty
[2m[algebraic-graphs] [mOK: path [x] == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.circuit ============
[2m[algebraic-graphs] [mOK: circuit [] == empty
[2m[algebraic-graphs] [mOK: circuit [x] == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.clique ============
[2m[algebraic-graphs] [mOK: clique [] == empty
[2m[algebraic-graphs] [mOK: clique [x] == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y] == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.biclique ============
[2m[algebraic-graphs] [mOK: biclique [] [] == empty
[2m[algebraic-graphs] [mOK: biclique [x] [] == vertex x
[2m[algebraic-graphs] [mOK: biclique [] [y] == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs ys == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.star ============
[2m[algebraic-graphs] [mOK: star x [] == vertex x
[2m[algebraic-graphs] [mOK: star x [y] == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.stars ============
[2m[algebraic-graphs] [mOK: stars [] == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])] == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])] == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)] == star x ys
[2m[algebraic-graphs] [mOK: stars == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x []) == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []]) == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.forest ============
[2m[algebraic-graphs] [mOK: forest [] == empty
[2m[algebraic-graphs] [mOK: forest [x] == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y) == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [mOK: size (removeEdge x y z) <= 3 * size z
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2) == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y) == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x == x
[2m[algebraic-graphs] [mOK: induce (const False) x == empty
[2m[algebraic-graphs] [mOK: induce (/= x) == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing) == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing) == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.compose ============
[2m[algebraic-graphs] [mOK: compose empty x == empty
[2m[algebraic-graphs] [mOK: compose x empty == empty
[2m[algebraic-graphs] [mOK: compose (vertex x) y == empty
[2m[algebraic-graphs] [mOK: compose x (vertex y) == empty
[2m[algebraic-graphs] [mOK: compose x (compose y z) == compose (compose x y) z
[2m[algebraic-graphs] [mOK: compose x (overlay y z) == overlay (compose x y) (compose x z)
[2m[algebraic-graphs] [mOK: compose (overlay x y) z == overlay (compose x z) (compose y z)
[2m[algebraic-graphs] [mOK: compose (edge x y) (edge y z) == edge x z
[2m[algebraic-graphs] [mOK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
[2m[algebraic-graphs] [mOK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
[2m[algebraic-graphs] [mOK: size (compose x y) <= edgeCount x + edgeCount y + 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.(===) ============
[2m[algebraic-graphs] [mOK: x === x == True
[2m[algebraic-graphs] [mOK: x === x + empty == False
[2m[algebraic-graphs] [mOK: x + y === x + y == True
[2m[algebraic-graphs] [mOK: 1 + 2 === 2 + 1 == False
[2m[algebraic-graphs] [mOK: x + y === x * y == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.mesh ============
[2m[algebraic-graphs] [mOK: mesh xs [] == empty
[2m[algebraic-graphs] [mOK: mesh [] ys == empty
[2m[algebraic-graphs] [mOK: mesh [x] [y] == vertex (x, y)
[2m[algebraic-graphs] [mOK: mesh xs ys == box (path xs) (path ys)
[2m[algebraic-graphs] [mOK: mesh [1..3] "ab" ==
[2m[algebraic-graphs] [mOK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.torus ============
[2m[algebraic-graphs] [mOK: torus xs [] == empty
[2m[algebraic-graphs] [mOK: torus [] ys == empty
[2m[algebraic-graphs] [mOK: torus [x] [y] == edge (x,y) (x,y)
[2m[algebraic-graphs] [mOK: torus xs ys == box (circuit xs) (circuit ys)
[2m[algebraic-graphs] [mOK: torus [1,2] "ab" ==
[2m[algebraic-graphs] [mOK: size (torus xs ys) == max 1 (3 * length xs * length ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.deBruijn ============
[2m[algebraic-graphs] [mOK: deBruijn 0 xs == edge [] []
[2m[algebraic-graphs] [mOK: n > 0 ==> deBruijn n [] == empty
[2m[algebraic-graphs] [mOK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
[2m[algebraic-graphs] [mOK: deBruijn 2 "0" == edge "00" "00"
[2m[algebraic-graphs] [mOK: deBruijn 2 "01" ==
[2m[algebraic-graphs] [mOK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
[2m[algebraic-graphs] [mOK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
[2m[algebraic-graphs] [mOK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.splitVertex ============
[2m[algebraic-graphs] [mOK: splitVertex x [] == removeVertex x
[2m[algebraic-graphs] [mOK: splitVertex x [x] == id
[2m[algebraic-graphs] [mOK: splitVertex x [y] == replaceVertex x y
[2m[algebraic-graphs] [mOK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.bind ============
[2m[algebraic-graphs] [mOK: bind empty f == empty
[2m[algebraic-graphs] [mOK: bind (vertex x) f == f x
[2m[algebraic-graphs] [mOK: bind (edge x y) f == connect (f x) (f y)
[2m[algebraic-graphs] [mOK: bind (vertices xs) f == overlays (map f xs)
[2m[algebraic-graphs] [mOK: bind x (const empty) == empty
[2m[algebraic-graphs] [mOK: bind x vertex == x
[2m[algebraic-graphs] [mOK: bind (bind x f) g == bind x (\y -> bind (f y) g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.simplify ============
[2m[algebraic-graphs] [mOK: simplify == id
[2m[algebraic-graphs] [mOK: size (simplify x) <= size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.box ============
[2m[algebraic-graphs] [mOK: box x y ~~ box y x
[2m[algebraic-graphs] [mOK: box x (overlay y z) == overlay (box x y) (box x z)
[2m[algebraic-graphs] [mOK: box x (vertex ()) ~~ x
[2m[algebraic-graphs] [mOK: box x empty ~~ empty
[2m[algebraic-graphs] [mOK: box x (box y z) ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: transpose (box x y) == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: vertexCount (box x y) == vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.sparsify ============
[2m[algebraic-graphs] [mOK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
[2m[algebraic-graphs] [mOK: vertexCount (sparsify x) <= vertexCount x + size x + 1
[2m[algebraic-graphs] [mOK: edgeCount (sparsify x) <= 3 * size x
[2m[algebraic-graphs] [mOK: size (sparsify x) <= 3 * size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.sparsifyKL ============
[2m[algebraic-graphs] [mOK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
[2m[algebraic-graphs] [mOK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
[2m[algebraic-graphs] [mOK: length (edges $ sparsifyKL n x) <= 3 * size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.context ============
[2m[algebraic-graphs] [mOK: context (const False) x == Nothing
[2m[algebraic-graphs] [mOK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
[2m[algebraic-graphs] [mOK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
[2m[algebraic-graphs] [mOK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
[2m[algebraic-graphs] [mOK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.buildg ============
[2m[algebraic-graphs] [mOK: buildg (\e _ _ _ -> e) == empty
[2m[algebraic-graphs] [mOK: buildg (\_ v _ _ -> v x) == vertex x
[2m[algebraic-graphs] [mOK: buildg (\e v o c -> o (foldg e v o c x) (foldg e v o c y)) == overlay x y
[2m[algebraic-graphs] [mOK: buildg (\e v o c -> c (foldg e v o c x) (foldg e v o c y)) == connect x y
[2m[algebraic-graphs] [mOK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
[2m[algebraic-graphs] [mOK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Internal.List ============
[2m[algebraic-graphs] [mOK: pure 1 <> pure 4 == [1, 4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Label ============
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Any: instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: StarSemiring
[2m[algebraic-graphs] [mOK: Dioid
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Distance Int: instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: StarSemiring
[2m[algebraic-graphs] [mOK: Dioid
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Capacity Int: instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: StarSemiring
[2m[algebraic-graphs] [mOK: Dioid
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Minimum (Path Int): instances ============
[2m[algebraic-graphs] [mOK: LeftNearRing
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ PowerSet (Path Int): instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: Dioid
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Count Int: instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: StarSemiring
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.consistent ============
[2m[algebraic-graphs] [mOK: arbitraryLabelledAdjacencyMap
[2m[algebraic-graphs] [mOK: empty
[2m[algebraic-graphs] [mOK: vertex
[2m[algebraic-graphs] [mOK: edge
[2m[algebraic-graphs] [mOK: overlay
[2m[algebraic-graphs] [mOK: connect
[2m[algebraic-graphs] [mOK: vertices
[2m[algebraic-graphs] [mOK: edges
[2m[algebraic-graphs] [mOK: overlays
[2m[algebraic-graphs] [mOK: fromAdjacencyMaps
[2m[algebraic-graphs] [mOK: removeVertex
[2m[algebraic-graphs] [mOK: removeEdge
[2m[algebraic-graphs] [mOK: replaceVertex
[2m[algebraic-graphs] [mOK: replaceEdge
[2m[algebraic-graphs] [mOK: transpose
[2m[algebraic-graphs] [mOK: gmap
[2m[algebraic-graphs] [mOK: emap
[2m[algebraic-graphs] [mOK: induce
[2m[algebraic-graphs] [mOK: closure
[2m[algebraic-graphs] [mOK: reflexiveClosure
[2m[algebraic-graphs] [mOK: symmetricClosure
[2m[algebraic-graphs] [mOK: transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edge ============
[2m[algebraic-graphs] [mOK: edge e x y == connect e (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: edge zero x y == vertices [x,y]
[2m[algebraic-graphs] [mOK: hasEdge x y (edge e x y) == (e /= mempty)
[2m[algebraic-graphs] [mOK: edgeLabel x y (edge e x y) == e
[2m[algebraic-graphs] [mOK: edgeCount (edge e x y) == if e == mempty then 0 else 1
[2m[algebraic-graphs] [mOK: vertexCount (edge e 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge e 1 2) == 2
[2m[algebraic-graphs] [mOK: x -- y == edge e x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty (overlay x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
[2m[algebraic-graphs] [mOK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
[2m[algebraic-graphs] [mOK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.connect ============
[2m[algebraic-graphs] [mOK: isEmpty (connect e x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect e x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect e 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices [] == empty
[2m[algebraic-graphs] [mOK: vertices [x] == vertex x
[2m[algebraic-graphs] [mOK: vertices == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edges ============
[2m[algebraic-graphs] [mOK: edges [] == empty
[2m[algebraic-graphs] [mOK: edges [(e,x,y)] == edge e x y
[2m[algebraic-graphs] [mOK: edges == overlays . map (\(e, x, y) -> edge e x y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.overlays ============
[2m[algebraic-graphs] [mOK: overlays [] == empty
[2m[algebraic-graphs] [mOK: overlays [x] == x
[2m[algebraic-graphs] [mOK: overlays [x,y] == overlay x y
[2m[algebraic-graphs] [mOK: overlays == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
[2m[algebraic-graphs] [mOK: fromAdjacencyMaps [] == empty
[2m[algebraic-graphs] [mOK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
[2m[algebraic-graphs] [mOK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
[2m[algebraic-graphs] [mOK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty x == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x) empty == False
[2m[algebraic-graphs] [mOK: isSubgraphOf x y ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty) == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge e x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z) == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge e x y) == (e /= zero)
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edgeLabel ============
[2m[algebraic-graphs] [mOK: edgeLabel x y empty == zero
[2m[algebraic-graphs] [mOK: edgeLabel x y (vertex z) == zero
[2m[algebraic-graphs] [mOK: edgeLabel x y (edge e x y) == e
[2m[algebraic-graphs] [mOK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount == length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge e x y) == if e == zero then 0 else 1
[2m[algebraic-graphs] [mOK: edgeCount == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x) == []
[2m[algebraic-graphs] [mOK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge e 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge e 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.skeleton ============
[2m[algebraic-graphs] [mOK: hasEdge x y == hasEdge x y . skeleton
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge e x x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge e 1 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge e x y) == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y == gmap (\v -> if v == x then y else v)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.replaceEdge ============
[2m[algebraic-graphs] [mOK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
[2m[algebraic-graphs] [mOK: replaceEdge e x y (edge f x y) == edge e x y
[2m[algebraic-graphs] [mOK: edgeLabel x y (replaceEdge e x y z) == e
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge e x y) == edge e y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge e x y) == edge e (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.emap ============
[2m[algebraic-graphs] [mOK: emap h empty == empty
[2m[algebraic-graphs] [mOK: emap h (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: emap h (edge e x y) == edge (h e) x y
[2m[algebraic-graphs] [mOK: emap h (overlay x y) == overlay (emap h x) (emap h y)
[2m[algebraic-graphs] [mOK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
[2m[algebraic-graphs] [mOK: emap id == id
[2m[algebraic-graphs] [mOK: emap g . emap h == emap (g . h)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x == x
[2m[algebraic-graphs] [mOK: induce (const False) x == empty
[2m[algebraic-graphs] [mOK: induce (/= x) == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing) == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing) == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.closure ============
[2m[algebraic-graphs] [mOK: closure empty == empty
[2m[algebraic-graphs] [mOK: closure (vertex x) == edge one x x
[2m[algebraic-graphs] [mOK: closure (edge e x x) == edge one x x
[2m[algebraic-graphs] [mOK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
[2m[algebraic-graphs] [mOK: closure == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y) == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x) == edge one x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge e x x) == edge one x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge e x y) == edge e x y
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.empty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edge ============
[2m[algebraic-graphs] [mOK: edge e x y == connect e (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: edge zero x y == vertices [x,y]
[2m[algebraic-graphs] [mOK: hasEdge x y (edge e x y) == (e /= mempty)
[2m[algebraic-graphs] [mOK: edgeLabel x y (edge e x y) == e
[2m[algebraic-graphs] [mOK: edgeCount (edge e x y) == if e == mempty then 0 else 1
[2m[algebraic-graphs] [mOK: vertexCount (edge e 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge e 1 2) == 2
[2m[algebraic-graphs] [mOK: x -- y == edge e x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty (overlay x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
[2m[algebraic-graphs] [mOK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
[2m[algebraic-graphs] [mOK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.connect ============
[2m[algebraic-graphs] [mOK: isEmpty (connect e x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect e x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect e 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertices ============
[2m[algebraic-graphs] [mOK: vertices [] == empty
[2m[algebraic-graphs] [mOK: vertices [x] == vertex x
[2m[algebraic-graphs] [mOK: vertices == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edges ============
[2m[algebraic-graphs] [mOK: edges [] == empty
[2m[algebraic-graphs] [mOK: edges [(e,x,y)] == edge e x y
[2m[algebraic-graphs] [mOK: edges == overlays . map (\(e, x, y) -> edge e x y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.overlays ============
[2m[algebraic-graphs] [mOK: overlays [] == empty
[2m[algebraic-graphs] [mOK: overlays [x] == x
[2m[algebraic-graphs] [mOK: overlays [x,y] == overlay x y
[2m[algebraic-graphs] [mOK: overlays == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty vertex connect == id
[2m[algebraic-graphs] [mOK: foldg empty vertex (fmap flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1 (const 1) (const (+)) == size
[2m[algebraic-graphs] [mOK: foldg True (const False) (const (&&)) == isEmpty
[2m[algebraic-graphs] [mOK: foldg False (== x) (const (||)) == hasVertex x
[2m[algebraic-graphs] [mOK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.buildg ============
[2m[algebraic-graphs] [mOK: buildg (\e _ _ -> e) == empty
[2m[algebraic-graphs] [mOK: buildg (\_ v _ -> v x) == vertex x
[2m[algebraic-graphs] [mOK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
[2m[algebraic-graphs] [mOK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
[2m[algebraic-graphs] [mOK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty x == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x) empty == False
[2m[algebraic-graphs] [mOK: isSubgraphOf x y ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty) == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge e x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.size ============
[2m[algebraic-graphs] [mOK: size empty == 1
[2m[algebraic-graphs] [mOK: size (vertex x) == 1
[2m[algebraic-graphs] [mOK: size (overlay x y) == size x + size y
[2m[algebraic-graphs] [mOK: size (connect x y) == size x + size y
[2m[algebraic-graphs] [mOK: size x >= 1
[2m[algebraic-graphs] [mOK: size x >= vertexCount x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z) == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge e x y) == (e /= zero)
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edgeLabel ============
[2m[algebraic-graphs] [mOK: edgeLabel x y empty == zero
[2m[algebraic-graphs] [mOK: edgeLabel x y (vertex z) == zero
[2m[algebraic-graphs] [mOK: edgeLabel x y (edge e x y) == e
[2m[algebraic-graphs] [mOK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount == length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge e x y) == if e == zero then 0 else 1
[2m[algebraic-graphs] [mOK: edgeCount == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x) == []
[2m[algebraic-graphs] [mOK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge e 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge e 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge e x x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge e 1 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge e x y) == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y == fmap (\v -> if v == x then y else v)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.replaceEdge ============
[2m[algebraic-graphs] [mOK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
[2m[algebraic-graphs] [mOK: replaceEdge e x y (edge f x y) == edge e x y
[2m[algebraic-graphs] [mOK: edgeLabel x y (replaceEdge e x y z) == e
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge e x y) == edge e y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.fmap ============
[2m[algebraic-graphs] [mOK: fmap f empty == empty
[2m[algebraic-graphs] [mOK: fmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: fmap f (edge e x y) == edge e (f x) (f y)
[2m[algebraic-graphs] [mOK: fmap id == id
[2m[algebraic-graphs] [mOK: fmap f . fmap g == fmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.emap ============
[2m[algebraic-graphs] [mOK: emap h empty == empty
[2m[algebraic-graphs] [mOK: emap h (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: emap h (edge e x y) == edge (h e) x y
[2m[algebraic-graphs] [mOK: emap h (overlay x y) == overlay (emap h x) (emap h y)
[2m[algebraic-graphs] [mOK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
[2m[algebraic-graphs] [mOK: emap id == id
[2m[algebraic-graphs] [mOK: emap g . emap h == emap (g . h)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x == x
[2m[algebraic-graphs] [mOK: induce (const False) x == empty
[2m[algebraic-graphs] [mOK: induce (/= x) == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing) == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing) == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.closure ============
[2m[algebraic-graphs] [mOK: closure empty == empty
[2m[algebraic-graphs] [mOK: closure (vertex x) == edge one x x
[2m[algebraic-graphs] [mOK: closure (edge e x x) == edge one x x
[2m[algebraic-graphs] [mOK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
[2m[algebraic-graphs] [mOK: closure == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y) == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x) == edge one x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge e x x) == edge one x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge e x y) == edge e x y
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.context ============
[2m[algebraic-graphs] [mOK: context (const False) x == Nothing
[2m[algebraic-graphs] [mOK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
[2m[algebraic-graphs] [mOK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
[2m[algebraic-graphs] [mOK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
[2m[algebraic-graphs] [mOK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap ============
[2m[algebraic-graphs] [mOK: Axioms of non-empty graphs
[2m[algebraic-graphs] [mOK: Theorems of non-empty graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Ord (NonEmpty.AdjacencyMap a) ============
[2m[algebraic-graphs] [mOK: vertex 1 < vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 < edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 < edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 < edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 < edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 < edge 1 3
[2m[algebraic-graphs] [mOK: x <= x + y
[2m[algebraic-graphs] [mOK: x + y <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Show (NonEmpty.AdjacencyMap a) ============
[2m[algebraic-graphs] [mOK: show (1 :: AdjacencyMap Int) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
[2m[algebraic-graphs] [mOK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.toNonEmpty ============
[2m[algebraic-graphs] [mOK: toNonEmpty empty == Nothing
[2m[algebraic-graphs] [mOK: toNonEmpty . fromNonEmpty == Just
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.fromNonEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty . fromNonEmpty == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edge ============
[2m[algebraic-graphs] [mOK: edge x y == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.overlay ============
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.connect ============
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertices1 ============
[2m[algebraic-graphs] [mOK: vertices1 [x] == vertex x
[2m[algebraic-graphs] [mOK: hasVertex x . vertices1 == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices1 == length . nub
[2m[algebraic-graphs] [mOK: vertexSet . vertices1 == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edges1 ============
[2m[algebraic-graphs] [mOK: edges1 [(x,y)] == edge x y
[2m[algebraic-graphs] [mOK: edges1 == overlays1 . fmap (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges1 == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.overlays1 ============
[2m[algebraic-graphs] [mOK: overlays1 [x] == x
[2m[algebraic-graphs] [mOK: overlays1 [x,y] == overlay x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.connects1 ============
[2m[algebraic-graphs] [mOK: connects1 [x] == x
[2m[algebraic-graphs] [mOK: connects1 [x,y] == connect x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf x (overlay x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path1 xs) (circuit1 xs) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z) == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount x >= 1
[2m[algebraic-graphs] [mOK: vertexCount == length . vertexList1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertexList1 ============
[2m[algebraic-graphs] [mOK: vertexList1 (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList1 . vertices1 == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList (vertex x) == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y) == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges1 == nub . sort . toList
[2m[algebraic-graphs] [mOK: edgeList . transpose == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet . vertex == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices1 == Set.fromList . toList
[2m[algebraic-graphs] [mOK: vertexSet . clique1 == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges1 == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.path1 ============
[2m[algebraic-graphs] [mOK: path1 [x] == vertex x
[2m[algebraic-graphs] [mOK: path1 [x,y] == edge x y
[2m[algebraic-graphs] [mOK: path1 . reverse == transpose . path1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.circuit1 ============
[2m[algebraic-graphs] [mOK: circuit1 [x] == edge x x
[2m[algebraic-graphs] [mOK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: circuit1 . reverse == transpose . circuit1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.clique1 ============
[2m[algebraic-graphs] [mOK: clique1 [x] == vertex x
[2m[algebraic-graphs] [mOK: clique1 [x,y] == edge x y
[2m[algebraic-graphs] [mOK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
[2m[algebraic-graphs] [mOK: clique1 . reverse == transpose . clique1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.biclique1 ============
[2m[algebraic-graphs] [mOK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.star ============
[2m[algebraic-graphs] [mOK: star x [] == vertex x
[2m[algebraic-graphs] [mOK: star x [y] == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges1 [(x,y), (x,z)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.stars1 ============
[2m[algebraic-graphs] [mOK: stars1 [(x, [] )] == vertex x
[2m[algebraic-graphs] [mOK: stars1 [(x, [y])] == edge x y
[2m[algebraic-graphs] [mOK: stars1 [(x, ys )] == star x ys
[2m[algebraic-graphs] [mOK: stars1 == overlays1 . fmap (uncurry star)
[2m[algebraic-graphs] [mOK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x []) == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []]) == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.removeVertex1 ============
[2m[algebraic-graphs] [mOK: removeVertex1 x (vertex x) == Nothing
[2m[algebraic-graphs] [mOK: removeVertex1 1 (vertex 2) == Just (vertex 2)
[2m[algebraic-graphs] [mOK: removeVertex1 x (edge x x) == Nothing
[2m[algebraic-graphs] [mOK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
[2m[algebraic-graphs] [mOK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y) == vertices1 [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2) == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y) == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.gmap ============
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.induce1 ============
[2m[algebraic-graphs] [mOK: induce1 (const True ) x == Just x
[2m[algebraic-graphs] [mOK: induce1 (const False) x == Nothing
[2m[algebraic-graphs] [mOK: induce1 (/= x) == removeVertex1 x
[2m[algebraic-graphs] [mOK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.induceJust1 ============
[2m[algebraic-graphs] [mOK: induceJust1 (vertex Nothing) == Nothing
[2m[algebraic-graphs] [mOK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
[2m[algebraic-graphs] [mOK: induceJust1 . gmap Just == Just
[2m[algebraic-graphs] [mOK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.closure ============
[2m[algebraic-graphs] [mOK: closure (vertex x) == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x x) == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
[2m[algebraic-graphs] [mOK: closure == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y) == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x) == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x x) == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge x y) == edge x y
[2m[algebraic-graphs] [mOK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.============
[2m[algebraic-graphs] [mOK: Axioms of non-empty graphs
[2m[algebraic-graphs] [mOK: Theorems of non-empty graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Ord (NonEmpty.Graph a) ============
[2m[algebraic-graphs] [mOK: vertex 1 < vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 < edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 < edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 < edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 < edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 < edge 1 3
[2m[algebraic-graphs] [mOK: x <= x + y
[2m[algebraic-graphs] [mOK: x + y <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Functor (NonEmpty.Graph a) ============
[2m[algebraic-graphs] [mOK: fmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: fmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: fmap id == id
[2m[algebraic-graphs] [mOK: fmap f . fmap g == fmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Monad (NonEmpty.Graph a) ============
[2m[algebraic-graphs] [mOK: (vertex x >>= f) == f x
[2m[algebraic-graphs] [mOK: (edge x y >>= f) == connect (f x) (f y)
[2m[algebraic-graphs] [mOK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
[2m[algebraic-graphs] [mOK: (x >>= vertex) == x
[2m[algebraic-graphs] [mOK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.toNonEmpty ============
[2m[algebraic-graphs] [mOK: toNonEmpty empty == Nothing
[2m[algebraic-graphs] [mOK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertex ============
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: size (vertex x) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edge ============
[2m[algebraic-graphs] [mOK: edge x y == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.overlay ============
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: size (overlay x y) == size x + size y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.overlay1 ============
[2m[algebraic-graphs] [mOK: overlay1 empty x == x
[2m[algebraic-graphs] [mOK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.connect ============
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: size (connect x y) == size x + size y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertices1 ============
[2m[algebraic-graphs] [mOK: vertices1 [x] == vertex x
[2m[algebraic-graphs] [mOK: hasVertex x . vertices1 == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices1 == length . nub
[2m[algebraic-graphs] [mOK: vertexSet . vertices1 == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edges1 ============
[2m[algebraic-graphs] [mOK: edges1 [(x,y)] == edge x y
[2m[algebraic-graphs] [mOK: edges1 == overlays1 . fmap (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges1 == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.overlays1 ============
[2m[algebraic-graphs] [mOK: overlays1 [x] == x
[2m[algebraic-graphs] [mOK: overlays1 [x,y] == overlay x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.connects1 ============
[2m[algebraic-graphs] [mOK: connects1 [x] == x
[2m[algebraic-graphs] [mOK: connects1 [x,y] == connect x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.foldg1 ============
[2m[algebraic-graphs] [mOK: foldg1 vertex overlay connect == id
[2m[algebraic-graphs] [mOK: foldg1 vertex overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg1 (const 1) (+) (+) == size
[2m[algebraic-graphs] [mOK: foldg1 (== x) (||) (||) == hasVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf x (overlay x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path1 xs) (circuit1 xs) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.(===) ============
[2m[algebraic-graphs] [mOK: x === x == True
[2m[algebraic-graphs] [mOK: x + y === x + y == True
[2m[algebraic-graphs] [mOK: 1 + 2 === 2 + 1 == False
[2m[algebraic-graphs] [mOK: x + y === x * y == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.size ============
[2m[algebraic-graphs] [mOK: size (vertex x) == 1
[2m[algebraic-graphs] [mOK: size (overlay x y) == size x + size y
[2m[algebraic-graphs] [mOK: size (connect x y) == size x + size y
[2m[algebraic-graphs] [mOK: size x >= 1
[2m[algebraic-graphs] [mOK: size x >= vertexCount x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z) == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount x >= 1
[2m[algebraic-graphs] [mOK: vertexCount == length . vertexList1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertexList1 ============
[2m[algebraic-graphs] [mOK: vertexList1 (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList1 . vertices1 == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList (vertex x) == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y) == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges1 == nub . sort . toList
[2m[algebraic-graphs] [mOK: edgeList . transpose == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet . vertex == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices1 == Set.fromList . toList
[2m[algebraic-graphs] [mOK: vertexSet . clique1 == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges1 == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.path1 ============
[2m[algebraic-graphs] [mOK: path1 [x] == vertex x
[2m[algebraic-graphs] [mOK: path1 [x,y] == edge x y
[2m[algebraic-graphs] [mOK: path1 . reverse == transpose . path1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.circuit1 ============
[2m[algebraic-graphs] [mOK: circuit1 [x] == edge x x
[2m[algebraic-graphs] [mOK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: circuit1 . reverse == transpose . circuit1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.clique1 ============
[2m[algebraic-graphs] [mOK: clique1 [x] == vertex x
[2m[algebraic-graphs] [mOK: clique1 [x,y] == edge x y
[2m[algebraic-graphs] [mOK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
[2m[algebraic-graphs] [mOK: clique1 . reverse == transpose . clique1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.biclique1 ============
[2m[algebraic-graphs] [mOK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.star ============
[2m[algebraic-graphs] [mOK: star x [] == vertex x
[2m[algebraic-graphs] [mOK: star x [y] == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges1 [(x,y), (x,z)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.stars1 ============
[2m[algebraic-graphs] [mOK: stars1 [(x, [] )] == vertex x
[2m[algebraic-graphs] [mOK: stars1 [(x, [y])] == edge x y
[2m[algebraic-graphs] [mOK: stars1 [(x, ys )] == star x ys
[2m[algebraic-graphs] [mOK: stars1 == overlays1 . fmap (uncurry star)
[2m[algebraic-graphs] [mOK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x []) == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []]) == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.mesh1 ============
[2m[algebraic-graphs] [mOK: mesh1 [x] [y] == vertex (x, y)
[2m[algebraic-graphs] [mOK: mesh1 xs ys == box (path1 xs) (path1 ys)
[2m[algebraic-graphs] [mOK: mesh1 [1,2,3] ['a', 'b'] ==
[2m[algebraic-graphs] [mOK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.torus1 ============
[2m[algebraic-graphs] [mOK: torus1 [x] [y] == edge (x,y) (x,y)
[2m[algebraic-graphs] [mOK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
[2m[algebraic-graphs] [mOK: torus1 [1,2] ['a', 'b'] ==
[2m[algebraic-graphs] [mOK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.removeVertex1 ============
[2m[algebraic-graphs] [mOK: removeVertex1 x (vertex x) == Nothing
[2m[algebraic-graphs] [mOK: removeVertex1 1 (vertex 2) == Just (vertex 2)
[2m[algebraic-graphs] [mOK: removeVertex1 x (edge x x) == Nothing
[2m[algebraic-graphs] [mOK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
[2m[algebraic-graphs] [mOK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y) == vertices1 [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [mOK: size (removeEdge x y z) <= 3 * size z
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2) == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.splitVertex1 ============
[2m[algebraic-graphs] [mOK: splitVertex1 x [x] == id
[2m[algebraic-graphs] [mOK: splitVertex1 x [y] == replaceVertex x y
[2m[algebraic-graphs] [mOK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.transpose ============
[2m[algebraic-graphs] [mOK: transpose (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y) == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: transpose (box x y) == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: edgeList . transpose == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.induce1 ============
[2m[algebraic-graphs] [mOK: induce1 (const True ) x == Just x
[2m[algebraic-graphs] [mOK: induce1 (const False) x == Nothing
[2m[algebraic-graphs] [mOK: induce1 (/= x) == removeVertex1 x
[2m[algebraic-graphs] [mOK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.induceJust1 ============
[2m[algebraic-graphs] [mOK: induceJust1 (vertex Nothing) == Nothing
[2m[algebraic-graphs] [mOK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
[2m[algebraic-graphs] [mOK: induceJust1 . fmap Just == Just
[2m[algebraic-graphs] [mOK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.simplify ============
[2m[algebraic-graphs] [mOK: simplify == id
[2m[algebraic-graphs] [mOK: size (simplify x) <= size x
[2m[algebraic-graphs] [mOK: simplify 1 === 1
[2m[algebraic-graphs] [mOK: simplify (1 + 1) === 1
[2m[algebraic-graphs] [mOK: simplify (1 + 2 + 1) === 1 + 2
[2m[algebraic-graphs] [mOK: simplify (1 * 1 * 1) === 1 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.sparsify ============
[2m[algebraic-graphs] [mOK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
[2m[algebraic-graphs] [mOK: vertexCount (sparsify x) <= vertexCount x + size x + 1
[2m[algebraic-graphs] [mOK: edgeCount (sparsify x) <= 3 * size x
[2m[algebraic-graphs] [mOK: size (sparsify x) <= 3 * size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.sparsifyKL ============
[2m[algebraic-graphs] [mOK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
[2m[algebraic-graphs] [mOK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
[2m[algebraic-graphs] [mOK: length (edges $ sparsifyKL n x) <= 3 * size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.box ============
[2m[algebraic-graphs] [mOK: box (path1 [0,1]) (path1 ['a','b']) ==
[2m[algebraic-graphs] [mOK: box x y ~~ box y x
[2m[algebraic-graphs] [mOK: box x (overlay y z) == overlay (box x y) (box x z)
[2m[algebraic-graphs] [mOK: box x (vertex ()) ~~ x
[2m[algebraic-graphs] [mOK: box x (box y z) ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: transpose (box x y) == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: vertexCount (box x y) == vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation ============
[2m[algebraic-graphs] [mOK: Axioms of graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.consistent ============
[2m[algebraic-graphs] [mOK: Consistency of the Arbitrary instance
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: consistent empty == True
[2m[algebraic-graphs] [mOK: consistent (vertex x) == True
[2m[algebraic-graphs] [mOK: consistent (overlay x y) == True
[2m[algebraic-graphs] [mOK: consistent (connect x y) == True
[2m[algebraic-graphs] [mOK: consistent (edge x y) == True
[2m[algebraic-graphs] [mOK: consistent (edges xs) == True
[2m[algebraic-graphs] [mOK: consistent (stars xs) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.Show ============
[2m[algebraic-graphs] [mOK: show (empty ) == "empty"
[2m[algebraic-graphs] [mOK: show (1 ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2 ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2 ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1) ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 < vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 < edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 < edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 < edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 < edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 < edge 1 3
[2m[algebraic-graphs] [mOK: x <= x + y
[2m[algebraic-graphs] [mOK: x + y <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.empty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edge ============
[2m[algebraic-graphs] [mOK: edge x y == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty (overlay x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.connect ============
[2m[algebraic-graphs] [mOK: isEmpty (connect x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertices ============
[2m[algebraic-graphs] [mOK: vertices [] == empty
[2m[algebraic-graphs] [mOK: vertices [x] == vertex x
[2m[algebraic-graphs] [mOK: vertices == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edges ============
[2m[algebraic-graphs] [mOK: edges [] == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)] == edge x y
[2m[algebraic-graphs] [mOK: edges == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.overlays ============
[2m[algebraic-graphs] [mOK: overlays [] == empty
[2m[algebraic-graphs] [mOK: overlays [x] == x
[2m[algebraic-graphs] [mOK: overlays [x,y] == overlay x y
[2m[algebraic-graphs] [mOK: overlays == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.connects ============
[2m[algebraic-graphs] [mOK: connects [] == empty
[2m[algebraic-graphs] [mOK: connects [x] == x
[2m[algebraic-graphs] [mOK: connects [x,y] == connect x y
[2m[algebraic-graphs] [mOK: connects == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty x == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x) empty == False
[2m[algebraic-graphs] [mOK: isSubgraphOf x (overlay x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs) (circuit xs) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList == Set.toAscList . vertexSet
[2m[algebraic-graphs] [mOK: edgeList == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty vertex overlay connect == id
[2m[algebraic-graphs] [mOK: foldg empty vertex overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1 (const 1) (+) (+) == size
[2m[algebraic-graphs] [mOK: foldg True (const False) (&&) (&&) == isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty) == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z) == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount == length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x) == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y) == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x) == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.preIntSet ============
[2m[algebraic-graphs] [mOK: preIntSet x empty == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet 1 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet y (edge x y) == IntSet.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.postIntSet ============
[2m[algebraic-graphs] [mOK: postIntSet x empty == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet 2 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (edge x y) == IntSet.fromList [y]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.path ============
[2m[algebraic-graphs] [mOK: path [] == empty
[2m[algebraic-graphs] [mOK: path [x] == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.circuit ============
[2m[algebraic-graphs] [mOK: circuit [] == empty
[2m[algebraic-graphs] [mOK: circuit [x] == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.clique ============
[2m[algebraic-graphs] [mOK: clique [] == empty
[2m[algebraic-graphs] [mOK: clique [x] == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y] == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.biclique ============
[2m[algebraic-graphs] [mOK: biclique [] [] == empty
[2m[algebraic-graphs] [mOK: biclique [x] [] == vertex x
[2m[algebraic-graphs] [mOK: biclique [] [y] == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs ys == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.star ============
[2m[algebraic-graphs] [mOK: star x [] == vertex x
[2m[algebraic-graphs] [mOK: star x [y] == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.stars ============
[2m[algebraic-graphs] [mOK: stars [] == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])] == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])] == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)] == star x ys
[2m[algebraic-graphs] [mOK: stars == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x []) == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []]) == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.forest ============
[2m[algebraic-graphs] [mOK: forest [] == empty
[2m[algebraic-graphs] [mOK: forest [x] == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y) == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2) == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y) == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x == x
[2m[algebraic-graphs] [mOK: induce (const False) x == empty
[2m[algebraic-graphs] [mOK: induce (/= x) == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.compose ============
[2m[algebraic-graphs] [mOK: compose empty x == empty
[2m[algebraic-graphs] [mOK: compose x empty == empty
[2m[algebraic-graphs] [mOK: compose (vertex x) y == empty
[2m[algebraic-graphs] [mOK: compose x (vertex y) == empty
[2m[algebraic-graphs] [mOK: compose x (compose y z) == compose (compose x y) z
[2m[algebraic-graphs] [mOK: compose x (overlay y z) == overlay (compose x y) (compose x z)
[2m[algebraic-graphs] [mOK: compose (overlay x y) z == overlay (compose x z) (compose y z)
[2m[algebraic-graphs] [mOK: compose (edge x y) (edge y z) == edge x z
[2m[algebraic-graphs] [mOK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
[2m[algebraic-graphs] [mOK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.closure ============
[2m[algebraic-graphs] [mOK: closure empty == empty
[2m[algebraic-graphs] [mOK: closure (vertex x) == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x x) == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
[2m[algebraic-graphs] [mOK: closure == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y) == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x) == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x x) == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge x y) == edge x y
[2m[algebraic-graphs] [mOK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing) == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing) == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ ReflexiveRelation ============
[2m[algebraic-graphs] [mOK: Axioms of reflexive graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ TransitiveRelation ============
[2m[algebraic-graphs] [mOK: Axioms of transitive graphs
[2m[algebraic-graphs] [mOK: path xs == (clique xs :: TransitiveRelation Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ PreorderRelation ============
[2m[algebraic-graphs] [mOK: Axioms of preorder graphs
[2m[algebraic-graphs] [mOK: path xs == (clique xs :: PreorderRelation Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation ============
[2m[algebraic-graphs] [mOK: Axioms of undirected graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.consistent ============
[2m[algebraic-graphs] [mOK: Consistency of the Arbitrary instance
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: consistent empty == True
[2m[algebraic-graphs] [mOK: consistent (vertex x) == True
[2m[algebraic-graphs] [mOK: consistent (overlay x y) == True
[2m[algebraic-graphs] [mOK: consistent (connect x y) == True
[2m[algebraic-graphs] [mOK: consistent (edge x y) == True
[2m[algebraic-graphs] [mOK: consistent (edges xs) == True
[2m[algebraic-graphs] [mOK: consistent (stars xs) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.Show ============
[2m[algebraic-graphs] [mOK: show (empty ) == "empty"
[2m[algebraic-graphs] [mOK: show (1 ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2 ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2 ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1) ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (2 * 1 ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
[2m[algebraic-graphs] [mOK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.toSymmetric ============
[2m[algebraic-graphs] [mOK: toSymmetric (edge 1 2) == edge 1 2
[2m[algebraic-graphs] [mOK: toSymmetric . fromSymmetric == id
[2m[algebraic-graphs] [mOK: fromSymmetric . toSymmetric == symmetricClosure
[2m[algebraic-graphs] [mOK: vertexCount . toSymmetric == vertexCount
[2m[algebraic-graphs] [mOK: (*2) . edgeCount . toSymmetric >= edgeCount
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.fromSymmetric ============
[2m[algebraic-graphs] [mOK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
[2m[algebraic-graphs] [mOK: vertexCount . fromSymmetric == vertexCount
[2m[algebraic-graphs] [mOK: edgeCount . fromSymmetric <= (*2) . edgeCount
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 < vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 < edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 < edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 < edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 < edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 2 1 < edge 1 3
[2m[algebraic-graphs] [mOK: edge 1 2 == edge 2 1
[2m[algebraic-graphs] [mOK: x <= x + y
[2m[algebraic-graphs] [mOK: x + y <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.empty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edge ============
[2m[algebraic-graphs] [mOK: edge x y == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: edge x y == edge y x
[2m[algebraic-graphs] [mOK: edge x y == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty (overlay x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.connect ============
[2m[algebraic-graphs] [mOK: connect x y == connect y x
[2m[algebraic-graphs] [mOK: isEmpty (connect x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertices ============
[2m[algebraic-graphs] [mOK: vertices [] == empty
[2m[algebraic-graphs] [mOK: vertices [x] == vertex x
[2m[algebraic-graphs] [mOK: vertices == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edges ============
[2m[algebraic-graphs] [mOK: edges [] == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)] == edge x y
[2m[algebraic-graphs] [mOK: edges [(x,y), (y,x)] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.overlays ============
[2m[algebraic-graphs] [mOK: overlays [] == empty
[2m[algebraic-graphs] [mOK: overlays [x] == x
[2m[algebraic-graphs] [mOK: overlays [x,y] == overlay x y
[2m[algebraic-graphs] [mOK: overlays == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.connects ============
[2m[algebraic-graphs] [mOK: connects [] == empty
[2m[algebraic-graphs] [mOK: connects [x] == x
[2m[algebraic-graphs] [mOK: connects [x,y] == connect x y
[2m[algebraic-graphs] [mOK: connects == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [mOK: connects == connects . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty x == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x) empty == False
[2m[algebraic-graphs] [mOK: isSubgraphOf x (overlay x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs) (circuit xs) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y ==> x <= y
[2m[algebraic-graphs] [mOK: isSubgraphOf (edge x y) (edge y x) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList == Set.toAscList . vertexSet
[2m[algebraic-graphs] [mOK: edgeList == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty) == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z) == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: hasEdge x y (edge y x) == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y == elem (min x y, max x y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount == length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x) == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y) == [(min x y, max y x)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x) == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.neighbours ============
[2m[algebraic-graphs] [mOK: neighbours x empty == Set.empty
[2m[algebraic-graphs] [mOK: neighbours x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: neighbours x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: neighbours y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.path ============
[2m[algebraic-graphs] [mOK: path [] == empty
[2m[algebraic-graphs] [mOK: path [x] == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [mOK: path == path . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.circuit ============
[2m[algebraic-graphs] [mOK: circuit [] == empty
[2m[algebraic-graphs] [mOK: circuit [x] == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: circuit == circuit . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.clique ============
[2m[algebraic-graphs] [mOK: clique [] == empty
[2m[algebraic-graphs] [mOK: clique [x] == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y] == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [mOK: clique == clique . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.biclique ============
[2m[algebraic-graphs] [mOK: biclique [] [] == empty
[2m[algebraic-graphs] [mOK: biclique [x] [] == vertex x
[2m[algebraic-graphs] [mOK: biclique [] [y] == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs ys == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.star ============
[2m[algebraic-graphs] [mOK: star x [] == vertex x
[2m[algebraic-graphs] [mOK: star x [y] == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.stars ============
[2m[algebraic-graphs] [mOK: stars [] == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])] == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])] == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)] == star x ys
[2m[algebraic-graphs] [mOK: stars == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x []) == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []]) == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.forest ============
[2m[algebraic-graphs] [mOK: forest [] == empty
[2m[algebraic-graphs] [mOK: forest [x] == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y) == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge x y == removeEdge y x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2) == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x == x
[2m[algebraic-graphs] [mOK: induce (const False) x == empty
[2m[algebraic-graphs] [mOK: induce (/= x) == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing) == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing) == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Example.Todo (Holiday) ============
[2m[algebraic-graphs] [mOK: A todo list is semantically Maybe [a]
[2m[algebraic-graphs] [mOK: The overlay operator (+) adds non-dependent items to the todo list
[2m[algebraic-graphs] [mOK: The connect operator (*) adds dependency between items
[2m[algebraic-graphs] [mOK: Contradictory constraints make the todo list impossible to schedule
[2m[algebraic-graphs] [mOK: Introduce item priority to schedule the todo list
[2m[algebraic-graphs] [mOK: Custom connect operators pull/repel arguments during scheduling
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Example.Todo (Commandline) ============
[2m[algebraic-graphs] [mOK: The pull connect operator maintains command line semantics
[2m[algebraic-graphs] [mOK: Swapping flags are allowed by the commutative overlay opeartor
[2m[algebraic-graphs] [mOK: The usual connect operator breaks semantics
[2m[algebraic-graphs] [mOK: Transform command lines by adding optimisation flag
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed ============
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.fromAdjacencyMap ============
[2m[algebraic-graphs] [mOK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
[2m[algebraic-graphs] [mOK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
[2m[algebraic-graphs] [mOK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
[2m[algebraic-graphs] [mOK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.fromAdjacencyIntMap ============
[2m[algebraic-graphs] [mOK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
[2m[algebraic-graphs] [mOK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
[2m[algebraic-graphs] [mOK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
[2m[algebraic-graphs] [mOK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.dfsForest ============
[2m[algebraic-graphs] [mOK: forest (dfsForest % edge 1 1) == vertex 1
[2m[algebraic-graphs] [mOK: forest (dfsForest % edge 1 2) == edge 1 2
[2m[algebraic-graphs] [mOK: forest (dfsForest % edge 2 1) == vertices [1, 2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForest % x) x == True
[2m[algebraic-graphs] [mOK: dfsForest % forest (dfsForest % x) == dfsForest % x
[2m[algebraic-graphs] [mOK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
[2m[algebraic-graphs] [mOK: dfsForest % (3 * (1 + 4) * (1 + 5)) ==
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.dfsForestFrom ============
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
[2m[algebraic-graphs] [mOK: dfsForestFrom % x $ vertexList x == dfsForest % x
[2m[algebraic-graphs] [mOK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
[2m[algebraic-graphs] [mOK: dfsForestFrom % x $ [] == []
[2m[algebraic-graphs] [mOK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] ==
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.dfs ============
[2m[algebraic-graphs] [mOK: dfs % edge 1 1 $ [1] == [1]
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [0] == []
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [1] == [1,2]
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [2] == [2]
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [1,2] == [1,2]
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [2,1] == [2,1]
[2m[algebraic-graphs] [mOK: dfs % x $ [] == []
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.topSort ============
[2m[algebraic-graphs] [mOK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
[2m[algebraic-graphs] [mOK: topSort % (1 * 2 + 2 * 1) == [1,2]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected ============
[2m[algebraic-graphs] [mOK: Axioms of undirected graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.Show ============
[2m[algebraic-graphs] [mOK: show (empty ) == "empty"
[2m[algebraic-graphs] [mOK: show (1 ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2 ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2 ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1) ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (2 * 1 ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
[2m[algebraic-graphs] [mOK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.toUndirected ============
[2m[algebraic-graphs] [mOK: toUndirected (edge 1 2) == edge 1 2
[2m[algebraic-graphs] [mOK: toUndirected . fromUndirected == id
[2m[algebraic-graphs] [mOK: vertexCount . toUndirected == vertexCount
[2m[algebraic-graphs] [mOK: (*2) . edgeCount . toUndirected >= edgeCount
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.fromUndirected ============
[2m[algebraic-graphs] [mOK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
[2m[algebraic-graphs] [mOK: toUndirected . fromUndirected == id
[2m[algebraic-graphs] [mOK: vertexCount . fromUndirected == vertexCount
[2m[algebraic-graphs] [mOK: edgeCount . fromUndirected <= (*2) . edgeCount
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.complement ================
[2m[algebraic-graphs] [mOK: complement empty == empty
[2m[algebraic-graphs] [mOK: complement (vertex x) == vertex x
[2m[algebraic-graphs] [mOK: complement (edge 1 1) == edge 1 1
[2m[algebraic-graphs] [mOK: complement (edge 1 2) == vertices [1, 2]
[2m[algebraic-graphs] [mOK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
[2m[algebraic-graphs] [mOK: complement . complement == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 < vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 < edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 < edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 < edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 < edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 2 1 < edge 1 3
[2m[algebraic-graphs] [mOK: edge 1 2 == edge 2 1
[2m[algebraic-graphs] [mOK: x <= x + y
[2m[algebraic-graphs] [mOK: x + y <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.empty ============
[2m[algebraic-graphs] [mOK: isEmpty empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.edge ============
[2m[algebraic-graphs] [mOK: edge x y == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: edge x y == edge y x
[2m[algebraic-graphs] [mOK: edge x y == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty (overlay x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.connect ============
[2m[algebraic-graphs] [mOK: connect x y == connect y x
[2m[algebraic-graphs] [mOK: isEmpty (connect x y) == isEmpty x && isEmpty y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
[2m[algebraic-graphs] [mOK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.vertices ============
[2m[algebraic-graphs] [mOK: vertices [] == empty
[2m[algebraic-graphs] [mOK: vertices [x] == vertex x
[2m[algebraic-graphs] [mOK: vertices == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.edges ============
[2m[algebraic-graphs] [mOK: edges [] == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)] == edge x y
[2m[algebraic-graphs] [mOK: edges [(x,y), (y,x)] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.overlays ============
[2m[algebraic-graphs] [mOK: overlays [] == empty
[2m[algebraic-graphs] [mOK: overlays [x] == x
[2m[algebraic-graphs] [mOK: overlays [x,y] == overlay x y
[2m[algebraic-graphs] [mOK: overlays == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.connects ============
[2m[algebraic-graphs] [mOK: connects [] == empty
[2m[algebraic-graphs] [mOK: connects [x] == x
[2m[algebraic-graphs] [mOK: connects [x,y] == connect x y
[2m[algebraic-graphs] [mOK: connects == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [mOK: connects == connects . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty x == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x) empty == False
[2m[algebraic-graphs] [mOK: isSubgraphOf x (overlay x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs) (circuit xs) == True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y ==> x <= y
[2m[algebraic-graphs] [mOK: isSubgraphOf (edge x y) (edge y x) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.path ============
[2m[algebraic-graphs] [mOK: path [] == empty
[2m[algebraic-graphs] [mOK: path [x] == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [mOK: path == path . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.circuit ============
[2m[algebraic-graphs] [mOK: circuit [] == empty
[2m[algebraic-graphs] [mOK: circuit [x] == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: circuit == circuit . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.clique ============
[2m[algebraic-graphs] [mOK: clique [] == empty
[2m[algebraic-graphs] [mOK: clique [x] == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y] == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [mOK: clique == clique . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.biclique ============
[2m[algebraic-graphs] [mOK: biclique [] [] == empty
[2m[algebraic-graphs] [mOK: biclique [x] [] == vertex x
[2m[algebraic-graphs] [mOK: biclique [] [y] == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs ys == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.star ============
[2m[algebraic-graphs] [mOK: star x [] == vertex x
[2m[algebraic-graphs] [mOK: star x [y] == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.stars ============
[2m[algebraic-graphs] [mOK: stars [] == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])] == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])] == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)] == star x ys
[2m[algebraic-graphs] [mOK: stars == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x []) == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []]) == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.forest ============
[2m[algebraic-graphs] [mOK: forest [] == empty
[2m[algebraic-graphs] [mOK: forest [x] == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x) == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y) == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge x y == removeEdge y x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2) == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x == x
[2m[algebraic-graphs] [mOK: induce (const False) x == empty
[2m[algebraic-graphs] [mOK: induce (/= x) == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing) == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing) == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [mTest suite main: PASS
[2m[algebraic-graphs] [mTest suite logged to: dist/test/algebraic-graphs-0.7-main.log
[2m[algebraic-graphs] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[algebraic-graphs] [mcheckPhase completed in 1 minutes 48 seconds
[2m[algebraic-graphs] [m[1;36mPhase: haddockPhase[m
[2m[algebraic-graphs] [mPreprocessing library for algebraic-graphs-0.7..
[2m[algebraic-graphs] [mRunning Haddock on library for algebraic-graphs-0.7..
[2m[algebraic-graphs] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[algebraic-graphs] [m[ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
[2m[algebraic-graphs] [m[ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
[2m[algebraic-graphs] [m[ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
[2m[algebraic-graphs] [m[ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
[2m[algebraic-graphs] [m[ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
[2m[algebraic-graphs] [m[ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
[2m[algebraic-graphs] [m[ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
[2m[algebraic-graphs] [m[ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
[2m[algebraic-graphs] [m[ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
[2m[algebraic-graphs] [m[10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
[2m[algebraic-graphs] [m[11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m In the use of ‘head’
[2m[algebraic-graphs] [m (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m "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."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m384 |[0m[0m exit v = do newComponent <- (v==).snd.[;1m[35mhead[0m[0m <$> gets boundaryStack
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m In the use of ‘tail’
[2m[algebraic-graphs] [m (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m "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."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m391 |[0m[0m pth' = [;1m[35mtail[0m[0m v_pth' -- Here we know that v_pth' starts with v
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m In the use of ‘head’
[2m[algebraic-graphs] [m (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m "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."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m395 |[0m[0m p_v = fst $ [;1m[35mhead[0m[0m bnd
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m In the use of ‘tail’
[2m[algebraic-graphs] [m (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m "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."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m397 |[0m[0m bnd' = [;1m[35mtail[0m[0m bnd
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^^^^[0m[0m
[2m[algebraic-graphs] [m[12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
[2m[algebraic-graphs] [m[13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:171:32: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m171 |[0m[0m vertexIntSet :: ToVertex t [;1m[35m~[0m[0m Int => t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:197:29: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m197 |[0m[0m preIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:215:30: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m215 |[0m[0m postIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:303:37: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m303 |[0m[0m toAdjacencyIntMap :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:312:46: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m312 |[0m[0m toAdjacencyIntMapTranspose :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:452:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m452 |[0m[0m adjacencyIntMap :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:471:52: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m471 |[0m[0m adjacencyIntMapTranspose :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m[14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
[2m[algebraic-graphs] [m[15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
[2m[algebraic-graphs] [m[16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
[2m[algebraic-graphs] [m[17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
[2m[algebraic-graphs] [m[18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
[2m[algebraic-graphs] [m[19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
[2m[algebraic-graphs] [m[20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
[2m[algebraic-graphs] [m[21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export.hs:185:41: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m185 |[0m[0m export :: (Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m[22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:121:63: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m121 |[0m[0m export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => Style a s -> g -> s
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:165:78: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m will become an error in a future GHC release.
[2m[algebraic-graphs] [m Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m165 |[0m[0m exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g [;1m[35m~[0m[0m s) => g -> s
[2m[algebraic-graphs] [m[;1m[34m |[0m[0m[;1m[35m ^[0m[0m
[2m[algebraic-graphs] [m[23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
[2m[algebraic-graphs] [m[24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
[2m[algebraic-graphs] [m[25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
[2m[algebraic-graphs] [m[26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
[2m[algebraic-graphs] [m[27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
[2m[algebraic-graphs] [m[28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
[2m[algebraic-graphs] [m[29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
[2m[algebraic-graphs] [mHaddock coverage:
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
[2m[algebraic-graphs] [m * in ‘Data.IntMap.Internal’
[2m[algebraic-graphs] [m * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
[2m[algebraic-graphs] [m 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
[2m[algebraic-graphs] [mWarning: 'nub' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'sort' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
[2m[algebraic-graphs] [m Missing documentation for:
[2m[algebraic-graphs] [m Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
[2m[algebraic-graphs] [mWarning: 'List' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Internal.hs:50:18
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Internal.hs:50:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
[2m[algebraic-graphs] [mWarning: 'IsList' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 19 / 19) in 'Algebra.Graph.Internal'
[2m[algebraic-graphs] [mWarning: 'Context' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph.hs:1400:18
[2m[algebraic-graphs] [m * at src/Algebra/Graph.hs:1400:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph.hs:316:1
[2m[algebraic-graphs] [m * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph.hs:316:1
[2m[algebraic-graphs] [m 100% ( 61 / 61) in 'Algebra.Graph'
[2m[algebraic-graphs] [mWarning: 'mplus' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'vertexCount' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'hasVertex' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'vertexSet' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'isEmpty' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'edgeList' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'adjacencyList' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'box' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'edgeCount' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
[2m[algebraic-graphs] [m * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
[2m[algebraic-graphs] [mWarning: 'nub' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'swap' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
[2m[algebraic-graphs] [m * in ‘Data.Tuple’
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
[2m[algebraic-graphs] [m 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
[2m[algebraic-graphs] [mWarning: 'isRight' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'Matching' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
[2m[algebraic-graphs] [m * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
[2m[algebraic-graphs] [m 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
[2m[algebraic-graphs] [mWarning: 'Optimum' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Label.hs:442:20
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Label.hs:442:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
[2m[algebraic-graphs] [mWarning: 'Distance' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Label.hs:241:22
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Label.hs:241:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
[2m[algebraic-graphs] [mWarning: 'Minimum' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Label.hs:314:21
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Label.hs:314:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
[2m[algebraic-graphs] [mWarning: 'Capacity' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Label.hs:176:22
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Label.hs:176:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
[2m[algebraic-graphs] [mWarning: 'Count' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Label.hs:209:19
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Label.hs:209:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
[2m[algebraic-graphs] [m 100% ( 37 / 37) in 'Algebra.Graph.Label'
[2m[algebraic-graphs] [mWarning: 'AdjacencyMap' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/AdjacencyMap.hs:157:1
[2m[algebraic-graphs] [m * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
[2m[algebraic-graphs] [mWarning: 'isEmpty' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'empty' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'vertexList' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'edges' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'adjacencyList' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'stars' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
[2m[algebraic-graphs] [mWarning: 'nub' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'sort' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [m * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/AdjacencyMap.hs:252:1
[2m[algebraic-graphs] [m * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
[2m[algebraic-graphs] [m 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
[2m[algebraic-graphs] [m Missing documentation for:
[2m[algebraic-graphs] [m Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
[2m[algebraic-graphs] [m * at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
[2m[algebraic-graphs] [m * at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [mWarning: 'vertexCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
[2m[algebraic-graphs] [m * at src/Algebra/Graph/AdjacencyMap.hs:417:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
[2m[algebraic-graphs] [mWarning: 'edgeCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
[2m[algebraic-graphs] [m * at src/Algebra/Graph/AdjacencyMap.hs:429:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
[2m[algebraic-graphs] [mWarning: 'vertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
[2m[algebraic-graphs] [m * at src/Algebra/Graph/AdjacencyMap.hs:309:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
[2m[algebraic-graphs] [m 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
[2m[algebraic-graphs] [mWarning: 'foldg' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph.hs:482:1
[2m[algebraic-graphs] [m * at src/Algebra/Graph/ToGraph.hs:98:5
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
[2m[algebraic-graphs] [m 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
[2m[algebraic-graphs] [mWarning: 'Relation' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Relation.hs:157:19
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Relation.hs:157:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Relation.hs:243:1
[2m[algebraic-graphs] [m * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
[2m[algebraic-graphs] [mWarning: 'AdjacencyMap' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 56 / 56) in 'Algebra.Graph.Relation'
[2m[algebraic-graphs] [mWarning: 'vertexCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Relation.hs:423:1
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
[2m[algebraic-graphs] [mWarning: 'edgeCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Relation.hs:435:1
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
[2m[algebraic-graphs] [m * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
[2m[algebraic-graphs] [m 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
[2m[algebraic-graphs] [mWarning: 'vertexList' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
[2m[algebraic-graphs] [m * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
[2m[algebraic-graphs] [mWarning: 'hasEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/AdjacencyMap.hs:403:1
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
[2m[algebraic-graphs] [m 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
[2m[algebraic-graphs] [mWarning: 'Context' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Labelled.hs:675:20
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Labelled.hs:675:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Labelled.hs:191:1
[2m[algebraic-graphs] [m * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
[2m[algebraic-graphs] [mWarning: 'Focus' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Labelled.hs:642:18
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Labelled.hs:642:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
[2m[algebraic-graphs] [m 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
[2m[algebraic-graphs] [m 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
[2m[algebraic-graphs] [m 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
[2m[algebraic-graphs] [mWarning: 'Doc' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Export.hs:57:17
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Export.hs:57:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
[2m[algebraic-graphs] [m 100% ( 14 / 14) in 'Algebra.Graph.Export'
[2m[algebraic-graphs] [mWarning: 'Style' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Export/Dot.hs:49:18
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Export/Dot.hs:49:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
[2m[algebraic-graphs] [mWarning: 'Graph' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Undirected.hs:253:1
[2m[algebraic-graphs] [m * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
[2m[algebraic-graphs] [m 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
[2m[algebraic-graphs] [m 100% ( 27 / 27) in 'Algebra.Graph.Class'
[2m[algebraic-graphs] [mWarning: 'TransitiveRelation' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Relation/Transitive.hs:39:32
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Relation/Transitive.hs:39:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
[2m[algebraic-graphs] [mWarning: 'Transitive' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
[2m[algebraic-graphs] [mWarning: 'ReflexiveRelation' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
[2m[algebraic-graphs] [mWarning: 'Reflexive' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
[2m[algebraic-graphs] [mWarning: 'PreorderRelation' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Relation/Preorder.hs:44:30
[2m[algebraic-graphs] [m * at src/Algebra/Graph/Relation/Preorder.hs:44:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
[2m[algebraic-graphs] [mWarning: 'Preorder' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
[2m[algebraic-graphs] [m 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
[2m[algebraic-graphs] [m Missing documentation for:
[2m[algebraic-graphs] [m Module header
[2m[algebraic-graphs] [m Todo (src/Algebra/Graph/Example/Todo.hs:13)
[2m[algebraic-graphs] [m todo (src/Algebra/Graph/Example/Todo.hs:42)
[2m[algebraic-graphs] [m low (src/Algebra/Graph/Example/Todo.hs:23)
[2m[algebraic-graphs] [m high (src/Algebra/Graph/Example/Todo.hs:27)
[2m[algebraic-graphs] [m ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
[2m[algebraic-graphs] [m >*< (src/Algebra/Graph/Example/Todo.hs:39)
[2m[algebraic-graphs] [m priority (src/Algebra/Graph/Example/Todo.hs:31)
[2m[algebraic-graphs] [mWarning: 'GraphKL' is ambiguous. It is defined
[2m[algebraic-graphs] [m * at src/Data/Graph/Typed.hs:40:18
[2m[algebraic-graphs] [m * at src/Data/Graph/Typed.hs:40:1
[2m[algebraic-graphs] [m You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
[2m[algebraic-graphs] [mWarning: 'array' is out of scope.
[2m[algebraic-graphs] [m If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 90% ( 10 / 11) in 'Data.Graph.Typed'
[2m[algebraic-graphs] [m Missing documentation for:
[2m[algebraic-graphs] [m scc (src/Data/Graph/Typed.hs:192)
[2m[algebraic-graphs] [mWarning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
[2m[algebraic-graphs] [m - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
[2m[algebraic-graphs] [mWarning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
[2m[algebraic-graphs] [m - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Internal: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Internal.D:R:ItemList
[2m[algebraic-graphs] [mWarning: Algebra.Graph: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Rep_Graph
[2m[algebraic-graphs] [m - Algebra.Graph.ToGraph.D:R:ToVertexGraph
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexGraph1
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
[2m[algebraic-graphs] [m - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
[2m[algebraic-graphs] [m - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Label: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Label.D:R:ItemMinimum
[2m[algebraic-graphs] [m - Algebra.Graph.Label.D:R:ItemLabel
[2m[algebraic-graphs] [mWarning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
[2m[algebraic-graphs] [m - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
[2m[algebraic-graphs] [mWarning: Algebra.Graph.ToGraph: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
[2m[algebraic-graphs] [m - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
[2m[algebraic-graphs] [m - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
[2m[algebraic-graphs] [m - Algebra.Graph.ToGraph.D:R:ToVertexGraph
[2m[algebraic-graphs] [m - Algebra.Graph.Relation.D:R:ToVertexRelation
[2m[algebraic-graphs] [m - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
[2m[algebraic-graphs] [m - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
[2m[algebraic-graphs] [m - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
[2m[algebraic-graphs] [m - Algebra.Graph.Labelled.D:R:ToVertexGraph
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Relation: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Relation.D:R:ToVertexRelation
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexRelation0
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexRelation
[2m[algebraic-graphs] [mWarning: Algebra.Graph.NonEmpty: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
[2m[algebraic-graphs] [m - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexAdjacencyMap
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Labelled: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Labelled.D:R:ToVertexGraph
[2m[algebraic-graphs] [m - Algebra.Graph.Labelled.Rep_Graph
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexGraph
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Undirected: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Undirected.Rep_Graph
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexGraph0
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Class: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexTuple3
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexTuple2
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexFUN
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexMaybe
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexUnit
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexRelation
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexRelation0
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexAdjacencyMap
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexGraph
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexGraph0
[2m[algebraic-graphs] [m - Algebra.Graph.Class.D:R:VertexGraph1
[2m[algebraic-graphs] [m - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
[2m[algebraic-graphs] [m - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
[2m[algebraic-graphs] [m - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
[2m[algebraic-graphs] [m - Algebra.Graph.Example.Todo.D:R:VertexTodo
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Example.Todo: could not find link destinations for:
[2m[algebraic-graphs] [m - Algebra.Graph.Example.Todo.D:R:VertexTodo
[2m[algebraic-graphs] [mDocumentation created: dist/doc/html/algebraic-graphs/,
[2m[algebraic-graphs] [mdist/doc/html/algebraic-graphs/algebraic-graphs.txt
[2m[algebraic-graphs] [mPreprocessing test suite 'main' for algebraic-graphs-0.7..
[2m[algebraic-graphs] [m[1;36mPhase: installPhase[m
[2m[algebraic-graphs] [mInstalling library in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
[2m[algebraic-graphs] [m[1;36mPhase: fixupPhase[m
[2m[algebraic-graphs] [mshrinking RPATHs of ELF executables and libraries in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7
[2m[algebraic-graphs] [mshrinking /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSalgebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc-ghc9.8.4.so
[2m[algebraic-graphs] [mchecking for references to /build/ in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7...
[2m[algebraic-graphs] [mpatching script interpreter paths in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7
[2m[algebraic-graphs] [mstripping (with command strip and flags -S -p) in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib
[2m[algebraic-graphs] [mshrinking RPATHs of ELF executables and libraries in /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc
[2m[algebraic-graphs] [mchecking for references to /build/ in /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc...
[2m[algebraic-graphs] [mpatching script interpreter paths in /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc
[2m[algebraic-graphs:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7 /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc[m
[2m[algebraic-graphs:post-build] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[algebraic-graphs:post-build] [m[2mUploading to the NixCI cache: /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7 /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc[m
[2m[algebraic-graphs:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[algebraic-graphs:post-build] [m[2mcopying 2 paths...[m
[2m[algebraic-graphs:post-build] [m[2mcopying path '/nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...[m
[2m[algebraic-graphs:post-build] [m[2mcopying path '/nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...[m
[2m[algebraic-graphs:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[algebraic-graphs:post-build] [m[2mcopying 0 paths...[m
[2mProgress: 34 of 38 built, 559 of 559 downloaded from cache[m
[1;34mBuilding /nix/store/w9blpl2j2z1mg64k6daxymyd52b744r1-ghc-9.8.4-with-packages.drv[m
[2m[ghc-9.8.4-with-packages] [m/nix/store/2klaxh0nypzbiz11icjn7a3gr0w50dfp-doctest-0.24.2/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/wjan1s58nap9s2y9c6r89bgjgnncm53g-ghc-compat-plugin-0.1.0.1/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/yjaggp1g4sqis3107rgrlgkvfj8vlxpb-hedgehog-1.5/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/c23g9fxnkkkmdpb5395r4vf5migp8afg-Cabal-3.12.1.0/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/2y5q3na3kzygn18zww6mj42gavla7yl6-cabal-doctest-1.0.12/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/nvg0b7lllw0n51565aqx91sdpa62c52g-temporary-1.3/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/nvg0b7lllw0n51565aqx91sdpa62c52g-temporary-1.3/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/z47anpqicydbbjxi2xwvahq4m83j7zm0-ansi-terminal-1.1.3/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/z47anpqicydbbjxi2xwvahq4m83j7zm0-ansi-terminal-1.1.3/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/v1bbgll4iw7q1d2b3hkllfblph1gfkfi-async-2.2.5/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/v1bbgll4iw7q1d2b3hkllfblph1gfkfi-async-2.2.5/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/0ry8i8l979dmlrvb7zj8fgpgddzlcsgx-barbies-2.1.1.0/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/0ry8i8l979dmlrvb7zj8fgpgddzlcsgx-barbies-2.1.1.0/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/cmcnavxnxs21nl079ihfcz9r8bikc3si-concurrent-output-1.10.21/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/cmcnavxnxs21nl079ihfcz9r8bikc3si-concurrent-output-1.10.21/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/635raa5l4zzmrxz67jnyzn2ayf0wrn7q-lifted-async-0.10.2.7/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/635raa5l4zzmrxz67jnyzn2ayf0wrn7q-lifted-async-0.10.2.7/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/n5sx1iv4pjywxqyhb6644x8lz4i9lba5-mmorph-1.2.1/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/n5sx1iv4pjywxqyhb6644x8lz4i9lba5-mmorph-1.2.1/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/g1xwfxzw06xcwk0md2c3dsmbjh53pvfw-monad-control-1.0.3.1/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/g1xwfxzw06xcwk0md2c3dsmbjh53pvfw-monad-control-1.0.3.1/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/gjn5g66y2finjvl6qxpygkl4nikgy9sh-pretty-show-1.10/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/gjn5g66y2finjvl6qxpygkl4nikgy9sh-pretty-show-1.10/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/47s8r3aghzw86sw2w05qrmks9xfm9i9q-primitive-0.9.1.0/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/47s8r3aghzw86sw2w05qrmks9xfm9i9q-primitive-0.9.1.0/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/s79715agzkq8mhyr9fsm43h7z7ac2l04-random-1.2.1.3/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/s79715agzkq8mhyr9fsm43h7z7ac2l04-random-1.2.1.3/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/6wqs30zg2ypzn15z1acpafc8zwxkj6wb-resourcet-1.3.0/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/6wqs30zg2ypzn15z1acpafc8zwxkj6wb-resourcet-1.3.0/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/11g1dmdb7lifr29wl0i3h589jn673iy7-safe-exceptions-0.1.7.4/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/11g1dmdb7lifr29wl0i3h589jn673iy7-safe-exceptions-0.1.7.4/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/f29lcbw106v0cnnl6nz59mwznp2qs70z-transformers-base-0.4.6/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/f29lcbw106v0cnnl6nz59mwznp2qs70z-transformers-base-0.4.6/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/ni07y6jsg1apn0srs3jsy6vdbgr9winx-wl-pprint-annotated-0.1.0.1/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/ni07y6jsg1apn0srs3jsy6vdbgr9winx-wl-pprint-annotated-0.1.0.1/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/rfmdrav11ynn3sfmv1cci9rwnch8x7ip-Cabal-syntax-3.12.1.0/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/rfmdrav11ynn3sfmv1cci9rwnch8x7ip-Cabal-syntax-3.12.1.0/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/005hdm8qnhj4zl0q8788fllgfg6z3fjx-ansi-terminal-types-1.1.3/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/005hdm8qnhj4zl0q8788fllgfg6z3fjx-ansi-terminal-types-1.1.3/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/zvhln8s72qwgz4ckrzn2d8cip2j33g64-hashable-1.5.0.0/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/zvhln8s72qwgz4ckrzn2d8cip2j33g64-hashable-1.5.0.0/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/qhd0bphgldgkc8ir7ph2q4a66daa2kz5-distributive-0.6.2.1/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/qhd0bphgldgkc8ir7ph2q4a66daa2kz5-distributive-0.6.2.1/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/pcgwgbz3q9h42kdk0fzfcv894hi3jywp-constraints-0.14.2/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/pcgwgbz3q9h42kdk0fzfcv894hi3jywp-constraints-0.14.2/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/3m25xgvipja12agpxz4qz1m0fx80bh7d-lifted-base-0.2.3.12/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/3m25xgvipja12agpxz4qz1m0fx80bh7d-lifted-base-0.2.3.12/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/5rcyrxlp2jfnq536ly1kpk4agsijcxs3-transformers-compat-0.7.2/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/5rcyrxlp2jfnq536ly1kpk4agsijcxs3-transformers-compat-0.7.2/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/26jd7x2cwjr44xxw327qly5px101qvj7-splitmix-0.1.3.1/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/26jd7x2cwjr44xxw327qly5px101qvj7-splitmix-0.1.3.1/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/idxrblvqkyslgimxh040iyd3rn2jbm6f-unliftio-core-0.2.1.0/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/idxrblvqkyslgimxh040iyd3rn2jbm6f-unliftio-core-0.2.1.0/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/xv8k031kh4n0bpk2zy81a5gwvgkkbyjf-base-orphans-0.9.3/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/xv8k031kh4n0bpk2zy81a5gwvgkkbyjf-base-orphans-0.9.3/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/f2r5j3mrypcxprcl8sx1p1bn964pbih9-os-string-2.0.8/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/f2r5j3mrypcxprcl8sx1p1bn964pbih9-os-string-2.0.8/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/6q8zi610nrws76v0aamfj2xn4f8v6rab-tagged-0.8.9/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/6q8zi610nrws76v0aamfj2xn4f8v6rab-tagged-0.8.9/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/415gs6mywspvfwwbwry2pq01k6a9dghd-boring-0.2.2/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [m/nix/store/415gs6mywspvfwwbwry2pq01k6a9dghd-boring-0.2.2/nix-support:
[2m[ghc-9.8.4-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
[2m[ghc-9.8.4-with-packages] [mWarning: include-dirs: /nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages/lib/ghc-9.8.4/lib/../lib/x86_64-linux-ghc-9.8.4/directory-1.3.8.5-d63d/include doesn't exist or isn't a directory
[2m[ghc-9.8.4-with-packages:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages[m
[2m[ghc-9.8.4-with-packages:post-build] [m[2mPushing 1 paths (154 are already present) using zstd to cache sellout ⏳[m
[2m[ghc-9.8.4-with-packages:post-build] [m[2m[m
[2m[ghc-9.8.4-with-packages:post-build] [m[2mPushing /nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages (4.98 MiB)[m
[2m[ghc-9.8.4-with-packages:post-build] [m[2m[m
[2m[ghc-9.8.4-with-packages:post-build] [m[2mAll done.[m
[2m[ghc-9.8.4-with-packages:post-build] [m[2mUploading to the NixCI cache: /nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages[m
[2m[ghc-9.8.4-with-packages:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[ghc-9.8.4-with-packages:post-build] [m[2mcopying 1 paths...[m
[2m[ghc-9.8.4-with-packages:post-build] [m[2mcopying path '/nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages' to 'https://cache.nix-ci.com'...[m
[2m[ghc-9.8.4-with-packages:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[ghc-9.8.4-with-packages:post-build] [m[2mcopying 1 paths...[m
[2m[ghc-9.8.4-with-packages:post-build] [m[2mcopying path '/nix/store/w9blpl2j2z1mg64k6daxymyd52b744r1-ghc-9.8.4-with-packages.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 35 of 37 built, 559 of 559 downloaded from cache[m
[1;34mBuilding /nix/store/xqwrq2d439jy2k1r352psdr2bzjpyr2v-ghc-shell-for-packages-0.drv[m
[2m[ghc-shell-for-packages:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0[m
[2m[ghc-shell-for-packages:post-build] [m[2mPushing 1 paths (337 are already present) using zstd to cache sellout ⏳[m
[2m[ghc-shell-for-packages:post-build] [m[2m[m
[2m[ghc-shell-for-packages:post-build] [m[2mPushing /nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0 (256.00 B)[m
[2m[ghc-shell-for-packages:post-build] [m[2m[m
[2m[ghc-shell-for-packages:post-build] [m[2mAll done.[m
[2m[ghc-shell-for-packages:post-build] [m[2mUploading to the NixCI cache: /nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0[m
[2m[ghc-shell-for-packages:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[ghc-shell-for-packages:post-build] [m[2mcopying 1 paths...[m
[2m[ghc-shell-for-packages:post-build] [m[2mcopying path '/nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...[m
[2m[ghc-shell-for-packages:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[ghc-shell-for-packages:post-build] [m[2mcopying 1 paths...[m
[2m[ghc-shell-for-packages:post-build] [m[2mcopying path '/nix/store/xqwrq2d439jy2k1r352psdr2bzjpyr2v-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 36 of 37 built, 559 of 559 downloaded from cache[m
[2mProgress: 37 of 37 built, 559 of 559 downloaded from cache[m
/nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0
Build succeeded.[m