3
0
mirror of https://github.com/larvit/adf-codec.git synced 2026-11-12 11:48:29 +01:00

1318 Commits

Author SHA1 Message Date
lilleman 42fc6d97fb Move the emphasis sweep into unspellable-runs.ts with named standings, derive its rule in docs/decisions.md, and close item 160 2026-10-31 01:37:26 +01:00
lilleman 9bedc7bae4 Make every withheld carry through carriedRun, which checks it as it is made 2026-10-31 01:37:26 +01:00
lilleman 7941972471 Keep BlockText's measures as two named records, read its flags through two functions, and claim a marker through one guard 2026-10-31 01:37:26 +01:00
lilleman d28bb4a13f Keep the one-fallback-per-pass loop in the properties, out of the writers' signatures 2026-10-31 01:37:26 +01:00
lilleman 87e6f6102d Record the reading cost of the chunk before item 160, re-score item 160 at L 4 2026-10-31 01:37:26 +01:00
lilleman 6fd2e7ce07 Answer prose round 1: 0 🔴, 4 🟡 (0 misread); retitle and rewrite the cap's entry, measure the changelog against 0.2.0 2026-10-30 21:14:32 +01:00
lilleman 1f33007ae2 Answer product-owner round 1: 0 🔴, 1 🟡 (0 misread); state the 32-try rule in the README and the flavour spec 2026-10-30 21:14:32 +01:00
lilleman b0a94fb896 Answer stability round 1: 0 🔴, 4 🟡 (0 misread); cap the every mode alone, name the cap's steps, pin links and highlights at the cap 2026-10-30 21:14:32 +01:00
lilleman d0b2e22aa8 Write a line where em shares a delimiter run with strong in time linear in its mark runs 2026-10-30 21:14:32 +01:00
lilleman 01c8365f71 Record the maintainer's call: a chunk ruled worse merges where item 160 restores that code's reading 2026-10-30 15:45:11 +01:00
lilleman e743868f73 Record the comprehension check: paired ruling worse against 41fd106 2026-10-30 15:45:11 +01:00
lilleman dee5f8093d Answer stability round 2: 1 🔴, 1 🟡 (0 misread); carry pairs spanning the same nodes together, file item 161 for em sharing a run with strong 2026-10-30 15:45:11 +01:00
lilleman 4834e802d9 Answer prose round 1: 0 🔴, 7 🟡 (0 misread); reword the sweep's comments, the cost entry and item 160 2026-10-30 15:45:11 +01:00
lilleman f151ea5c09 Answer stability round 1: 1 🔴, 2 🟡 (0 misread); hold a pair whose opener may capture a held pair's delimiter, draw repeated units, pin the carry guards 2026-10-30 15:45:11 +01:00
lilleman 47b990feea Emit a line mixing em, strike and strong in time linear in its mark runs 2026-10-30 15:45:11 +01:00
lilleman c34168bbc6 Re-score item 158 at L 4: two components, a new pattern and a rewrite of a known defect 2026-10-30 15:45:11 +01:00
lilleman 8485ca0917 Record the reading cost of item 158's chunk 2026-10-30 15:45:11 +01:00
lilleman 8f1645500a File item 160: make the block-text tree and batched fallbacks read as easily as before 2026-10-29 17:29:50 +01:00
lilleman 41fd106826 Record the comprehension check: paired ruling worse against c7bbb04 2026-10-29 17:29:50 +01:00
lilleman fa2f32b309 Answer stability round 2: 1 🔴, 0 🟡 (0 misread); the changelog claims no bound for lines mixing em, strike and strong, and item 158 names them 2026-10-29 17:29:50 +01:00
lilleman ee95b3035f Answer prose round 1: 0 🔴, 7 🟡 (0 misread); the bound test's block count is 53, comments name their referents 2026-10-29 17:29:50 +01:00
lilleman bbd2ad9c74 Answer product-owner round 1: 0 🔴, 1 🟡 (0 misread); the nesting entry names the refusal it speeds up, and both entries speak of ADF 2026-10-29 17:29:50 +01:00
lilleman dd4ff03909 Answer stability round 1: 1 🔴, 6 🟡 (0 misread); a carry refuses where the walk finds it, tests pin each batching guard, the changelog names the nested emphasis still quadratic, item 158 files it 2026-10-29 17:29:50 +01:00
lilleman 1ff3ad6e9b Answer principles round 1: 0 🔴, 2 🟡 (0 misread); writtenText alone tracks its prefixes, the walk's bound comment says what the check does now, markdown tested at the bound 2026-10-29 17:29:50 +01:00
lilleman 28ae354315 Answer architecture round 1: 0 🔴, 7 🟡 (0 misread); test BlockText's measures and the batching against one run per pass, one withinLongest, marker facts beside their readers 2026-10-29 17:29:50 +01:00
lilleman 10cb24e706 Spell nested lists and quotes in time linear in the markdown 2026-10-29 17:29:50 +01:00
lilleman 1f8619e272 Emit a line in time linear in its mark runs 2026-10-29 17:29:50 +01:00
renovate[bot] 3f13738ae4 Update Node.js to v26.13.0 2026-10-29 05:58:06 +00:00
lilleman d2fb780cce Remove item 157 from the plan: the files are about 7% of a chunk's reading, so reset the reading-cost trend 2026-10-29 00:36:56 +01:00
lilleman 8fb60a0134 Record what item 157 measured: the three docs are about 7% of a chunk's reading 2026-10-29 00:36:56 +01:00
lilleman 55968bbd26 List the three converters that fail ordinary input, each with where it fails 2026-10-28 23:46:46 +01:00
lilleman bb89a1b516 Remove items 146 and 145 from the plan, file item 157 for the rising reading cost 2026-10-28 21:38:33 +01:00
lilleman d02077ae04 Answer prose round 2: 0 🔴, 2 🟡 (0 misread); the opening splits where it runs from who it is for, the changelog names both tables 2026-10-28 21:37:34 +01:00
lilleman 3616c78ea2 Answer product-owner round 2: 0 🔴, 1 🟡 (0 misread); the table keeps the maintainer's bar, reasonably complete and works, and names the three packages it leaves out 2026-10-28 21:37:34 +01:00
lilleman fa5c425a4b Answer prose, product-owner, stability and principles round 1-2: 1 🔴, 7 🟡; the HTML row names every element, the README records the searches, the second table sorts 2026-10-28 21:37:34 +01:00
lilleman 9192f97f99 Answer round 1: the bar says every package runs in Node whatever it gets wrong, the HTML row names the marks it writes, the table drops a fork, md-adf's warnings show 2026-10-28 21:37:34 +01:00
lilleman 30d6e5120a Record the npm searches behind the comparison table 2026-10-28 21:37:34 +01:00
lilleman de356d2caf Rewrap the comparison intro 2026-10-28 21:37:34 +01:00
lilleman 3014f302c1 Answer principles round 1: 0 🔴, 3 🟡 (0 misread); the README names the carry element and the bar, the table gains five npm converters, compare.mjs sorts 2026-10-28 21:37:34 +01:00
lilleman 11529ac165 Open the README with the call to take for each need, and widen the converter comparison 2026-10-28 21:37:34 +01:00
lilleman 4fb624abc0 Record the reading cost of the chunk before item 146 2026-10-28 21:37:34 +01:00
lilleman 33c05708b0 Remove item 152 from the plan 2026-10-28 20:41:47 +01:00
lilleman c7bbb04697 Record the comprehension check: paired ruling same against 0003675 2026-10-28 20:41:47 +01:00
lilleman 8e1b8e6f7b Say run.sh mutates only nodes wholly inside the changed lines 2026-10-28 20:41:47 +01:00
lilleman fac55a8a63 Answer product-owner round 1: 0 🔴, 1 🟡 (0 misread); the README names the memory a mutation run needs, and a RuntimeError lists its mutants and the likely cause 2026-10-28 20:41:47 +01:00
lilleman 141db21216 Answer principles round 1: 0 🔴, 2 🟡 (0 misread); run.sh reads the diff whatever the git config, item 58 ports it to Python, the worker count sits beside the memory, the README says what a run reports 2026-10-28 20:41:47 +01:00
lilleman 5aeb6b7190 Answer architecture round 1: 0 🔴, 2 🟡 (0 misread); a RuntimeError fails the run in a 6 GB container, Stryker bumps wait for a hand run, its package is a decision, item 76 names the test-file lists 2026-10-28 20:41:47 +01:00
lilleman 061ae81644 Mutation-test the source lines a chunk changes with mutation-tests/run.sh 2026-10-28 20:41:47 +01:00
lilleman 75ddc2ee17 Record the reading cost of chunk 47b51be32176 2026-10-28 20:41:47 +01:00
renovate[bot] 80b39dd122 Update dependency @types/node to v26.6.6 2026-10-28 19:09:29 +00:00