3
0
mirror of https://github.com/larvit/adf-codec.git synced 2026-11-12 11:48:29 +01:00
Commit Graph

206 Commits

Author SHA1 Message Date
lilleman ddccd00243 Answer stability round 1: 0 🔴, 3 🟡; pin the blank line's spaces in an item's code block, drop the timing-only tests, and file tab-indented lines as item 120 2026-10-18 11:48:41 +02:00
lilleman d82b7abb3f Read deep list items' blank lines and a directive's unclosed backtick runs in time linear in the markdown 2026-10-18 11:48:41 +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 6bcb967e88 Answer auto-reviewer round 1: 0 🔴, 1 🟡; the refusal names a body row 2026-10-17 23:27:55 +02:00
lilleman 2c8ea5c30b Answer prose round 1: 0 🔴, 1 🟡; say the refusal costs Goal 4 too 2026-10-17 23:27:55 +02:00
lilleman 6ede19861d Rule Goal 7 over Goal 4 for the over-wide pipe-table row and close item 117 2026-10-17 23:27:55 +02:00
lilleman 2e0614101e Record the comprehension check: paired ruling better against 498e874 2026-10-14 22:49:13 +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 311fe491c7 Answer architecture round 2: 1 🔴, 0 🟡; cite item 117 in the GFM refusal entry, name the url fallback 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 d55f754e37 Record the reading cost and refresh item 92's figures 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 251c8193e6 Answer prose round 1: 0 🔴, 1 🟡; scope the hard-break exception to the CommonMark link, split the refusal sentence, say who kept the directive refusal 2026-10-14 22:09:42 +02:00
lilleman 492a7fa828 Retitle the mark-skipping decision to name the link and directive marks it refuses, and land item 73 last in 0.3.0 2026-10-14 22:09:42 +02:00
lilleman 498e874831 Record the comprehension check: ruling better, 3 of 4 seats 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 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 31f01f2fc0 Record the reading cost 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 fb0bc45060 Record the reading cost 2026-10-14 20:15:39 +02:00
lilleman 696aca1c71 Record the comprehension check: ruling better, scoring run overall 5.88 2026-10-14 15:08:46 +02:00
lilleman 6c389b9c83 Answer prose round 1: 0 🔴, 8 🟡; say which marks a node refuses, and name the fix in the directive mark refusal 2026-10-14 15:08:46 +02:00
lilleman bb3a128233 Answer product-owner round 1: 0 🔴, 1 🟡; name the refusal stored markdown meets, and make the next release 0.3.0 2026-10-14 15:08:46 +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 d31efaba16 Record the reading cost 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 ec2d6f7c30 Record the reading cost 2026-10-14 13:18:14 +02:00
lilleman 06739b40b7 Record the comprehension check: paired ruling worse against e193536, scoring run overall 5.88 2026-10-14 10:48:12 +02:00
lilleman aefcd4b9e3 Answer prose round 1: 0 🔴, 6 🟡; the changelog names what breaks, the fallback reads as untyped mark, attribute or value, the spec's value list and marks paragraph split, messages name the JSON array to write 2026-10-14 10:48:12 +02:00
lilleman 9e9d88a8e4 Record the reading cost 2026-10-14 10:48:12 +02:00
lilleman d5b9356a29 Record the marks and colwidth spellings in the spec, decisions, changelog and migration guide 2026-10-14 10:48:12 +02:00
lilleman 1c7518aea1 Answer prose round 1: 1 🔴, 4 🟡; the entry claims only the refusal, item 112 opens with its verb and cites Goal 4 alone 2026-10-14 07:52:41 +02:00
lilleman 8faaa35915 Decide that the portable reader refuses what GFM's reading would drop 2026-10-14 07:52:41 +02:00
lilleman e193536259 Record the comprehension check: paired ruling same against e0ead52 2026-10-14 01:17:39 +02:00
lilleman 5f1c64b371 Answer prose round 1: 0 🔴, 7 🟡; the guarantee splits per reader, the spec's portable sentence follows the named errors, item 112 names rows holding no pipe 2026-10-14 01:17:39 +02:00
lilleman c1055046bb Record the reading cost 2026-10-14 01:17:39 +02:00
lilleman ec9492635a Read GFM's pipe table without leading pipes and with alignment colons in portableMarkdownToAdf 2026-10-14 01:17:39 +02:00
lilleman e0ead529bf Record the comprehension check: paired ruling same against 341280d 2026-10-14 00:26:19 +02:00
lilleman 6152808194 Answer prose round 1: 0 🔴, 2 🟡; the slot's rule joins the node-tables bullet, the remedies offer the space alike, the message says lines 2026-10-14 00:26:19 +02:00
lilleman 5cd07cafec Answer architecture round 1: 0 🔴, 2 🟡; the slot's line ending is a value the slot does not take, and its message offers the space again 2026-10-14 00:26:19 +02:00
lilleman ed401ec7b6 Record the reading cost 2026-10-14 00:26:19 +02:00
lilleman 06df26727a Fold unspellable-whitespace into unsupported-node-shape 2026-10-14 00:26:19 +02:00
lilleman 341280d93c Rescore: the paired ruling at 3ba3a82 against 7caa823 reads better 2026-10-13 20:10:29 +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 d13a17565b Answer architecture round 3: 0 🔴, 0 🟡; an out-of-memory throw is engine-limit whatever the engine ran short of, the ruling reads same 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 d90898c6ec Return the new code engine-limit where the engine runs short of memory or passes its longest array, so unsupported-node-shape stays deterministic 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 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