3
0
mirror of https://github.com/larvit/adf-codec.git synced 2026-11-18 22:25:44 +01:00
Commit Graph

29 Commits

Author SHA1 Message Date
lilleman bcdf224e4c Answer stability round 1: 0 🔴, 6 🟡 (0 misread); restore inlineRuns's early exit, one mark equality, refuse a pass taking no mark, pin the carried range and the opening link's run 2026-11-03 22:13:13 +01:00
lilleman 47503fe3c7 Group mark runs by one rule, insideRun, that both writers and the portable reducer ask 2026-11-03 22:13:13 +01:00
lilleman 42fc6d97fb Move the emphasis sweep into unspellable-runs.ts with named standings, derive its rule in docs/decisions.md, and close item 160 2026-10-31 01:37:26 +01:00
lilleman d28bb4a13f Keep the one-fallback-per-pass loop in the properties, out of the writers' signatures 2026-10-31 01:37:26 +01:00
lilleman b0a94fb896 Answer stability round 1: 0 🔴, 4 🟡 (0 misread); cap the every mode alone, name the cap's steps, pin links and highlights at the cap 2026-10-30 21:14:32 +01:00
lilleman d0b2e22aa8 Write a line where em shares a delimiter run with strong in time linear in its mark runs 2026-10-30 21:14:32 +01:00
lilleman 4834e802d9 Answer prose round 1: 0 🔴, 7 🟡 (0 misread); reword the sweep's comments, the cost entry and item 160 2026-10-30 15:45:11 +01:00
lilleman 47b990feea Emit a line mixing em, strike and strong in time linear in its mark runs 2026-10-30 15:45:11 +01:00
lilleman ee95b3035f Answer prose round 1: 0 🔴, 7 🟡 (0 misread); the bound test's block count is 53, comments name their referents 2026-10-29 17:29:50 +01:00
lilleman 28ae354315 Answer architecture round 1: 0 🔴, 7 🟡 (0 misread); test BlockText's measures and the batching against one run per pass, one withinLongest, marker facts beside their readers 2026-10-29 17:29:50 +01:00
lilleman 1f8619e272 Emit a line in time linear in its mark runs 2026-10-29 17:29:50 +01:00
lilleman 2f9a1b3540 Answer stability round 2: 1 🔴, 0 🟡 (0 misread); a line gives up every highlight run whose own delimiters cannot flank in one pass, as shipped, so a line of them re-emits once, and the reader records no highlight pairs 2026-10-28 19:15:04 +01:00
lilleman b388b33d31 Answer stability round 1: 1 🔴, 4 🟡 (1 misread); a line gives up its first misread emphasis run, else its first misread highlight, as shipped, the run list narrows to one run, Scan holds SharedScan, the Piece arms are named, and textOpeners and guardLinkDefinition are pinned 2026-10-28 19:15:04 +01:00
lilleman e20a1c3a30 Answer architecture round 5: 0 🔴, 0 🟡 (0 misread); shownImage returns no textless state, item 143 and the card rule name their whole reach 2026-10-26 13:20:27 +01:00
lilleman 9ff53c1658 Answer architecture round 4: 0 🔴, 1 🟡 (0 misread); one image rule in shown-text for both writers, a link mark's href kept past a bad title, the card rule recorded 2026-10-26 13:20:27 +01:00
lilleman 7a38db2563 Answer principles round 1: 3 🔴, 8 🟡 (0 misread); attributes as data-*, carried content as paragraphs, links and notes, no character HTML cannot hold, mutants killed 2026-10-26 13:20:27 +01:00
lilleman 6fe36d5947 Ship adfToHtml: semantic HTML for the CommonMark blocks and marks, an adf-carry element for the rest 2026-10-26 13:20:27 +01:00
lilleman 78104b6746 Answer architecture round 1: 1 🔴, 2 🟡; keep the (image) trailer out of alt text, refuse a node slot holding an image inside a link 2026-10-23 10:45:33 +02:00
lilleman 2d7d8f8af6 Spell a portable link title holding a backslash, an entity reference or, in a table cell, a pipe 2026-10-22 22:06:59 +02:00
lilleman e680927e37 Answer prose round 1: 0 🔴, 3 🟡; disambiguate the README fallback, reword item 117's citation and item 118's tagline, record the writer panel 2026-10-14 22:49:13 +02:00
lilleman 928752a58d Answer architecture round 1: 1 🔴, 3 🟡; name the other-target link and no-alt case, pin both, file items 117 and 118 2026-10-14 22:49:13 +02:00
lilleman 3f3d0bdde7 Keep both targets of a linked external image standing inline in adfToPortableMarkdown 2026-10-14 22:49:13 +02:00
lilleman 278ebbbad5 Give code text no mark but code, link and annotation, in every reader 2026-10-14 21:10:41 +02:00
lilleman a0bb09b80d Answer architecture round 4: the forecast and the indent leave, a writer refuses a document whose text alone passes the bound, and the joins are the one bound left 2026-10-13 01:30:12 +02:00
lilleman 3414c8690a Answer architecture round 2: every builder joins its pieces through one bounded join, the readers take the engine guard, every refusal stands at the document's path, and a portable list's refusal names its own place 2026-10-13 01:30:12 +02:00
lilleman 2b5d22cbc6 Answer architecture round 1: every container joining several walks sums their projections before it joins, the portable reduction refuses a list whose spelling is refused, and heldTextLength moves beside textLength 2026-10-13 01:30:12 +02:00
lilleman e3aa790ec8 Refuse markdown past V8's longest string on every engine, before building it 2026-10-13 01:30:12 +02:00
lilleman 580bc862f2 Write an external image a link marks as [![alt](url)](href) in both writers 2026-10-11 13:31:18 +02:00
lilleman 23ec45febd Give each markdown input its own reader: commonMarkToAdf, losslessMarkdownToAdf and portableMarkdownToAdf, each claiming only its flavour 2026-10-09 03:08:39 +02:00