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

81 Commits

Author SHA1 Message Date
lilleman bc991d68ab Answer stability round 1: 1 🔴, 2 🟡 (0 misread); keep a portable line parted where spanning needs !adf:text, test the depth guard, drop a dead check 2026-11-04 13:08:55 +01:00
lilleman ea2e37d648 Spell an emphasis or link once across the nodes its mark skips, in both writers 2026-11-04 13:08:55 +01:00
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 d0867686d5 Build text holding no border mark in losslessMarkdownToAdf, and carry text holding one 2026-10-31 03:10:24 +01:00
lilleman 088494511d Answer stability round 1: 1 🔴, 3 🟡 (0 misread); start an empty line's walk at its innermost quote, pin two guards, file item 162 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 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 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 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 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 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 278ebbbad5 Give code text no mark but code, link and annotation, in every reader 2026-10-14 21:10:41 +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 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
lilleman 7caa8237f0 Answer architecture round 6: each block is held to the bound as it is built, the reader's ask takes the engine guard, and the chunk ships under a worse comprehension ruling by the maintainer's call, with item 110 to fill the memo in one place 2026-10-13 01:30:12 +02:00
lilleman 6f518dab93 Answer architecture round 5: the builders keep main's spelling, each writer's result and the CommonMark ask's spelling are held to the bound once built, and the engines' own overflows refuse alike 2026-10-13 01:30:12 +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 ae1a47f1bc Answer architecture round 3: the forecast never overcounts, the carry's JSON and the portable code block join through joinedWithin, and the list's choice of form stands in its own function 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 80b4e0a9b7 Answer stability round 1: the docs name V8's array limit in one text node, a test pins Invalid array length, and item 106 takes the readers' RangeError and JavaScriptCore's Out of memory 2026-10-11 21:05:07 +02:00
lilleman a9331b4125 Return a result where a conversion's text would pass the engine's longest string 2026-10-11 21:05:07 +02:00
lilleman 5f2c5083e9 Answer architecture round 1: the portable writer builds the linked image through externalMedia, the properties generate the image shapes, linkDefinition sits beside linkMark, the changelog drops a refusal no release met, and items 99 and 100 file the inline linked image and the caption reading 2026-10-11 13:31:18 +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 559ad4ec3c Answer architecture round 1: a * marker before a first line of * alone takes a backslash, the marker choice is a decision, the spec names which lists alternate, and the stale listBreak test goes 2026-10-09 15:39:13 +02:00
lilleman 40580e6948 Read a list whose bullet or ordered delimiter changes as two lists, and alternate the marker between adjacent lists in place of !adf:listBreak 2026-10-09 15:39:13 +02:00
lilleman ba21c7a462 Answer architecture round 4: the writers close a mark run at a hard break again, and item 91 plans the joined spelling 2026-10-09 12:21:18 +02:00
lilleman 77a6806160 Answer architecture round 3: one joinsBreaks flag in place of the parted set and its retry loops, a directive link spells its break, and takesMarks names the table's field 2026-10-09 12:21:18 +02:00
lilleman e4364b19d0 Answer prose round 1: plainer decision title and spec, the refusal the spec owes, and comments that say why 2026-10-09 12:21:18 +02:00
lilleman 486661311f Answer stability round 3: a link directive holding a joined hard break falls back to parting it 2026-10-09 12:21:18 +02:00
lilleman 1d05ee3df3 Answer stability round 2: a run that cannot be spelled parts at its hard breaks before the carry takes it, and the recipe bullet names the content it passes 2026-10-09 12:21:18 +02:00
lilleman 852d010ff7 Answer product-owner round 1: an emphasis or link run spans an unmarked hard break, the recipe drops a hard break's marks, and the refusal names hard breaks 2026-10-09 12:21:18 +02:00
lilleman 3ff5c95f4c Build a hardBreak carrying no marks where a mark spelling spans a line break, in every reader 2026-10-09 12:21: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