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

219 Commits

Author SHA1 Message Date
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 dee5f8093d Answer stability round 2: 1 🔴, 1 🟡 (0 misread); carry pairs spanning the same nodes together, file item 161 for em sharing a run with strong 2026-10-30 15:45:11 +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 f151ea5c09 Answer stability round 1: 1 🔴, 2 🟡 (0 misread); hold a pair whose opener may capture a held pair's delimiter, draw repeated units, pin the carry guards 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 dd4ff03909 Answer stability round 1: 1 🔴, 6 🟡 (0 misread); a carry refuses where the walk finds it, tests pin each batching guard, the changelog names the nested emphasis still quadratic, item 158 files it 2026-10-29 17:29:50 +01:00
lilleman 1ff3ad6e9b Answer principles round 1: 0 🔴, 2 🟡 (0 misread); writtenText alone tracks its prefixes, the walk's bound comment says what the check does now, markdown tested at the bound 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 10cb24e706 Spell nested lists and quotes in time linear in the markdown 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 2b5c0571fc Give the 33-million-character line test a timeout past Bun's 5 s default 2026-10-28 19:15:04 +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 6636f01497 Answer principles round 1: 0 🔴, 0 🟡 (0 misread); readAsWritten names the emphasis check, the bracket test names the bare case, noDefinitions sorts after linkInLink 2026-10-28 19:15:04 +01:00
lilleman 5ede92bf91 Answer architecture round 1: 0 🔴, 7 🟡 (0 misread); the read-back loop parts from the verdict, the reader takes the opening-link consult, the reading is absent on the parse path, a refused link escapes no backtick; root imports, highlight pairing and closeBracket filed as items 153 to 155 2026-10-28 19:15:04 +01:00
lilleman b0bf362ef9 Find code-span and link openers and unspellable mark runs by reading the escaped line back 2026-10-28 19:15:04 +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 e234905c27 Answer architecture round 1: 2 🔴, 6 🟡 (0 misread); one escaping path refusing null characters, block writers returning their pieces, the HTML writer split, shared entry checks, lint between formats 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 5de03a7b41 Answer stability round 1: 0 🔴, 4 🟡; pin a lossless cell's trailing and escaped pipe and the image title's escapes 2026-10-22 22:06:59 +02:00
lilleman 0841616352 Answer principles round 1: 0 🔴, 4 🟡; escape a title's backslash only where CommonMark reads an escape, check pipes in lossless syntax alone, split the title tests, state the portable escapes 2026-10-22 22:06:59 +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 d2531d059c Answer prose round 1: 0 🔴, 7 🟡; state the seam's comments and the decision exactly, and reflow 2026-10-22 21:38:41 +02:00
lilleman e1f37cde43 Answer principles round 1: 0 🔴, 7 🟡; mint task ids within the engine limits, fold == into inline-tokens.ts, keep one frame per quote level, pass the list's path once 2026-10-22 21:38:41 +02:00
lilleman 8f28d7bcc2 Answer architecture round 1: 0 🔴, 4 🟡; share the quoting, carry list facts on the spelled list, keep inExpand in the portable reader 2026-10-22 21:38:41 +02:00
lilleman 0c0a9e7835 Move the portable flavour's reading and writing into markdown/portable/ 2026-10-22 21:38:41 +02:00
lilleman b080410852 Give the directive grammar, flavours and reader failures one place each 2026-10-22 00:17:14 +02:00
lilleman db10287cae Append the reading-cost figure 2026-10-22 00:17:14 +02:00
lilleman a674df9b75 Answer principles round 1: 0 🔴, 1 🟡; scope the changelog to outside directives, and keep the backtick cursor inside a closure 2026-10-18 11:09:16 +02:00
lilleman e12249e593 Read and write unclosed backtick runs and HTML openers in time linear in the text 2026-10-18 11:09:16 +02:00
lilleman 7c69ce5d53 Name the withheld-mark seeding where a carry is decided, and say code text takes no other spelled mark but link 2026-10-14 21:10:41 +02:00
lilleman e56291eb90 Answer prose round 1: 0 🔴, 8 🟡; say which reader skips what, reorder the migration's keep-the-mark advice, file the decision title as a question 2026-10-14 21:10:41 +02:00
lilleman f32945350a Answer stability round 1: 0 🔴, 2 🟡; seed the withheld-mark carries once per line, pin the single highlight around a link 2026-10-14 21:10:41 +02:00
lilleman c9f9276df9 Answer architecture round 1: 1 🔴, 2 🟡; read a node's taken mark types once, let the highlight ask takesMark, correct the README's code-span bullet 2026-10-14 21:10:41 +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 6842f386ae Answer architecture round 1: 2 🔴, 4 🟡; refuse a link around only nodes that take none, mark the change breaking, file code-text marks 2026-10-14 15:08:46 +02:00
lilleman 1ae7ba6992 Give an inline node no mark Atlassian's schema withholds from it, in every reader 2026-10-14 15:08:46 +02:00
lilleman 168ca1cea2 Answer stability round 1: 0 🔴, 2 🟡; a mark's malformed attrs name their cause, the docs name a value of the wrong type as a fallback 2026-10-14 10:48:12 +02:00
lilleman c8ea357fa7 Answer architecture round 1: 2 🔴, 5 🟡; nesting counts the JSON fallback alone, one mark attrs read and spell, one mark table, a malformed mark is unsupported-node-shape, the old colwidth names the comma list, README and notes name the attrs fallback 2026-10-14 10:48:12 +02:00
lilleman e882b5de7a Spell colwidth as a comma list and a block's marks by name 2026-10-14 10:48:12 +02:00
lilleman 667360f6e6 Answer prose round 1: 0 🔴, 9 🟡; the retry paragraph, the guarantees, the changelog and the code-list entry each say one thing once, the engine-limit message names what it covers, the persona line excepts engine-limit by the maintainer's call, and the error row's split is filed as item 111 2026-10-13 20:10:29 +02:00
lilleman a0fdfe377e Answer architecture round 2: 1 🔴, 1 🟡; the CommonMark ask answers yes or no, the memo's callers name themselves, the bound's policy reads at its constant, Firefox's bare out-of-memory string is engine-limit, and the floor entry no longer points at item 110 2026-10-13 20:10:29 +02:00
lilleman 563133f3ee Answer architecture round 1: 2 🔴, 5 🟡; readableBlock alone fills and reads the spelling memo, the escaper's steps hand on what they claim rather than write a shared buffer, engine-limit names only the throws an engine returns, and the docs agree on it 2026-10-13 20:10:29 +02:00
lilleman e2b243c9b6 Answer stability round 1: the escape flags flow through return values, and V8's failed typed-array allocation is refused as its memory running short 2026-10-13 20:10:29 +02:00
lilleman 03b4ab2e44 Spell a line in memory linear in its length, so a paragraph up to V8's longest string converts within Node's default heap 2026-10-13 20:10:29 +02:00
lilleman 7bc69355c3 Answer prose round 1: the refusal messages name what passed the bound, the decisions read one idea a sentence, and the changelog gives the readers' fix its own bullet 2026-10-13 01:30:12 +02:00
lilleman 4657796d4d Answer stability round 1: the guard's comment holds at both its call sites, and a giving-way list's items keep the list's path 2026-10-13 01:30:12 +02:00