lilleman
|
4298de84e8
|
Keep both targets of a linked external image standing inline in adfToPortableMarkdown
|
2026-10-14 22:17:59 +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
|
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
|
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
|
1ab405fa74
|
Answer auto-reviewer round 1: the README says to retry the engine-limit refusal once on JavaScriptCore, and the merged-text test says why it stays cheap
|
2026-10-11 21:05:07 +02:00 |
|
lilleman
|
62d80a69b7
|
Answer prose round 1: the README says which refusal differs between engines, items 106 and 107 read one idea a sentence, and two test titles and a comment read on one pass
|
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
|
580bc862f2
|
Write an external image a link marks as [](href) in both writers
|
2026-10-11 13:31:18 +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
|
335c3fbc70
|
Answer stability round 3: the portable writer merges adjacent nested task lists after the split, so it never writes !adf:listBreak
|
2026-10-09 14:37:06 +02:00 |
|
lilleman
|
67bdc3ca44
|
Answer stability round 1: a task list nested beside a task item of paragraphs stays nested when written, the property checks every block task item holds paragraphs alone, item 49 names the checkbox loss it closes, and item 93 files the stale refusal path
|
2026-10-09 14:37:06 +02:00 |
|
lilleman
|
654a960888
|
Stand a block a task item cannot hold after its task list, in portableMarkdownToAdf and adfToPortableMarkdown
|
2026-10-09 14:37:06 +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
|
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
|
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 |
|