lilleman
|
770cc3b938
|
Compare the package with the other ADF converters in the README
|
2026-10-14 20:15:39 +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
|
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
|
fb42c354a6
|
Answer CodeRabbit round 1: 0 🔴, 1 🟡; the guarantee names only the causes the lossless writer meets
|
2026-10-14 13:18:14 +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
|
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
|
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
|
8188bc5e16
|
Answer architecture round 2: 0 🔴, 1 🟡; the ClaimedPrefix comment sits on its type again, README names the marks 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
|
202841ed72
|
Answer CodeRabbit round 1: 0 🔴, 1 🟡; the error row's pipes escape inside the table
|
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
|
40afc48567
|
Answer product-owner round 2: 0 🔴, 1 🟡; the lossless narrowing names which rows a missing pipe refuses and which it ends
|
2026-10-14 01:17:39 +02:00 |
|
lilleman
|
85be3d5a36
|
Answer product-owner round 1: 0 🔴, 2 🟡; both readers' shared narrowing leads the guarantee, the error row's remedy names its reader
|
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
|
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
|
06df26727a
|
Fold unspellable-whitespace into unsupported-node-shape
|
2026-10-14 00:26:19 +02:00 |
|
lilleman
|
eff957fbbe
|
Answer CodeRabbit's review: 0 🔴, 1 🟡; only a catchable out-of-memory throw is engine-limit, and isolation from heap exhaustion takes a separate process, not a worker
|
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
|
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
|
e0d48b0e33
|
Answer product-owner round 2: one retry rule, any unsupported-node-shape at the empty path, in the paragraph and the error table, and the memory refusal says it ran the engine out of memory
|
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
|
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
|
142ed310c2
|
Answer stability round 2: the retry advice covers every call, readers included, and names JavaScriptCore as the one exception to determinism
|
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
|
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
|
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
|
5e05fa6f30
|
Answer stability round 2: the advice names the array limit, the guard's test names both, and the decision rewraps
|
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
|
0b3f6e8973
|
Answer product-owner round 2: the text row names strike and the hard break's sides
|
2026-10-11 19:04:56 +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
|
5fa53cb795
|
Answer stability round 1: tryImage drops an exit the comparison already takes, the README and changelog scope the linked image, and item 101 files the refusal naming its spelling
|
2026-10-11 13:31:18 +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
|
cc40fb95f2
|
Answer prose round 1: the README drops the parse-path sentence and the comments say what stands in and why
|
2026-10-11 12:13:51 +02:00 |
|
lilleman
|
be3ac4af22
|
Answer product-owner round 1: the README says a parse's path points into the document the call returns
|
2026-10-11 12:13:51 +02:00 |
|
lilleman
|
cea9137495
|
Answer prose round 1: the comments and test name say what ends a list, the README says because, the changelog leads with the rename and gives the definition's trigger, and items 56 and 98 state their claims plainly
|
2026-10-10 13:20:05 +02:00 |
|
lilleman
|
419bb10324
|
Answer product-owner round 1: the migration row names the trigger and how to keep one list, the changelog groups the list entries and labels its fixes, and the README's second group says it has other reasons
|
2026-10-10 13:20:05 +02:00 |
|
lilleman
|
7d00b11b2c
|
Answer architecture round 1: closeLeaf records the block definitions end beside the blocks it pushes, openedList's comment names the exception, the README drops its counts, the changelog puts other changes last, and item 98 files the blank-line re-scan
|
2026-10-10 13:20:05 +02:00 |
|