 lilleman
|
04ec3ca25e
|
Record the reading cost
|
2026-10-14 00:03:01 +02:00 |
|
|
lilleman
|
5e705d20d4
|
Fold unspellable-whitespace into unsupported-node-shape
|
2026-10-14 00:02:58 +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
|
341280d93c
|
Rescore: the paired ruling at 3ba3a82 against 7caa823 reads better
|
2026-10-13 20:10:29 +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
|
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
|
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
|
f7cbabdf38
|
Answer product-owner round 1: the changelog states the memory a character costs, not a heap that varies by machine, and what the reader returns now
|
2026-10-13 20:10:29 +02:00 |
|
|
lilleman
|
3be5265a61
|
Give the reader's length-refusal test a timeout past Bun's default
|
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
|
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
|
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
|
7a27f6b81c
|
Rescore: the paired ruling at 90de6cb reads better
|
2026-10-11 21:05:07 +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
|
edacef410f
|
Answer architecture round 2: the overflow messages sort, and a stack overflow stays a throw by its stated reason
|
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
|
4b3bce8d02
|
Record the reading cost of item 83
|
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
|
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 |
|
|
lilleman
|
837d01e8da
|
Answer prose round 1: item 103 names the fix both characters share and the changelog entry it joins, item 104 names the corpus file alone, and item 84 says what to revise
|
2026-10-11 16:09:32 +02:00 |
|
|
lilleman
|
c0714d5fb5
|
Plan 0.2.0's last items: pull items 52, 53, 83 and 84 in, and file item 103 to fold unspellable-whitespace and item 104 to make the README describe 0.2.0 alone
|
2026-10-11 16:09:32 +02:00 |
|
|
lilleman
|
4f00e60e6c
|
Rescore: the paired ruling at 27c8f9b reads worse on Locality, shipped under the maintainer's decision, and the scoring run holds at a 6.13 mean
|
2026-10-11 13:31:18 +02:00 |
|
|
lilleman
|
38a3d5f265
|
Record the maintainer's decision to ship items 85 and 86 under a fall, and file item 102 to place a refused task-list block without the replay
|
2026-10-11 13:31:18 +02:00 |
|
|
lilleman
|
1b39f17ac0
|
Answer prose round 1: the spec names each title and destination, the writing verdict is its own decision citing item 100, items 99 and 101 state what holds, and the migration and changelog rows say what they replace
|
2026-10-11 13:31:18 +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
|
7c42356a78
|
Answer architecture round 3: reduceMedia's link lookup shadows no name, and the comprehension history records the ruling and scoring run at be23835
|
2026-10-11 13:31:18 +02:00 |
|
|
lilleman
|
25def494b8
|
Answer architecture round 2: the portable writer's imports sort on their first binding
|
2026-10-11 13:31:18 +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
|
aa73e7d673
|
Spell the corpus's linked image as [](href)
|
2026-10-11 13:31:18 +02:00 |
|
|
lilleman
|
c91d84031b
|
Record the chunk's reading cost and refresh item 92's figures
|
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 |
|