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

410 Commits

Author SHA1 Message Date
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 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 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 7cac2b4a9c Move item 91 into 0.3.0 2026-10-14 21:58:29 +02:00
lilleman ed8213f0f1 Move item 95 into 0.3.0 2026-10-14 21:52:09 +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 5886f76f96 Answer product-owner round 1: 0 🔴, 2 🟡; file the code-span rewrite under item 91, say what writing back and keeping a mark cost 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 3a27b0365d Wrap item 73's detail 2026-10-14 20:15:39 +02:00
lilleman faf43dcd3a Answer prose round 1: 0 🔴, 4 🟡; say what each package was given, drop our row's version, state the pin invariant 2026-10-14 20:15:39 +02:00
lilleman 63494c5657 Answer stability round 1: 0 🔴, 3 🟡; pin the comparison's dependency tree by date, print what reads back, let Renovate watch its image 2026-10-14 20:15:39 +02:00
lilleman 770cc3b938 Compare the package with the other ADF converters in the README 2026-10-14 20:15:39 +02:00
lilleman 1af791ab88 Keep items 71 and 73 in the next release, now 0.3.0 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 cb7482232b Answer architecture round 2: 0 🔴, 2 🟡; file item 114 under the next minor 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 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 dcbdf3683d Move the comparison table and the announcement into 0.2.1 2026-10-14 13:39:08 +02:00
lilleman 39a7f16b95 Answer prose round 1: 0 🔴, 6 🟡; list unsupported-node-shape causes as sub-items with their remedies 2026-10-14 13:18:14 +02:00
lilleman 3391154518 Name the CommonMark spelling a refused directive takes, split the unsupported-node-shape row by cause, and pass readAttributes its pair fault 2026-10-14 13:18:14 +02:00
lilleman 16cbcf0cc7 File item 113: name a malformed block mark's cause without editing another module's message 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 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 2cc6ea3f57 Answer architecture round 1: 0 🔴, 5 🟡; comments and docs name the narrowing, item 112 files GFM's ragged rows, a paragraph's lines carry their positions 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 06df26727a Fold unspellable-whitespace into unsupported-node-shape 2026-10-14 00:26:19 +02:00
lilleman 3f6ed8fb3a Score every plan item's C, how hard its change is to get right 2026-10-13 23:55:01 +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 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 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 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 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 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 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 fdf7f1c2b7 Answer architecture round 1: the guard refuses only the measured overflow errors, the README keeps such a document read-only, and items 106 and 107 take the heap and the carry's indentation 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 ab01c5f7ae Answer product-owner round 1: the README drops the roadmap, spells every lossless form, alternates list markers truly, checks results in its examples, and lists each call's refusals once; item 105 pins the portable writer's codes 2026-10-11 19:04:56 +02:00
lilleman 3b5fed9a2c Refit the README for search and a quick start, with a full reference below its contents 2026-10-11 19:04:56 +02:00
lilleman 23f0820b8c Answer auto-reviewer round 1: item 51 folds labels with Unicode's full case folding, which keeps ı apart from I 2026-10-11 16:09:32 +02:00