3
0
mirror of https://github.com/larvit/adf-codec.git synced 2026-11-18 22:25:44 +01:00
Commit Graph

10 Commits

Author SHA1 Message Date
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 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 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 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 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