3
0
mirror of https://github.com/larvit/adf-codec.git synced 2026-11-12 19:58:28 +01:00
Commit Graph

321 Commits

Author SHA1 Message Date
lilleman 65f1c2aa85 Answer prose round 1: 0 🔴, 7 🟡 (0 misread); say a card shows its name, else its URL, and tighten the item 133 detail 2026-11-04 16:44:10 +01:00
lilleman d8488407aa Write mentions and inline cards holding data as HTML elements, not the carry 2026-11-04 16:22:57 +01:00
lilleman 13a2689b0d Record the comprehension check: paired ruling same against d5d594b 2026-11-04 14:19:19 +01:00
lilleman 20a5d4f0c6 Answer prose round 1: 0 🔴, 8 🟡 (0 misread); correct the panel count, say which node rides the carry, list the new nodes' data-* attributes 2026-11-04 14:19:19 +01:00
lilleman d67a935230 Record the reading cost of the chunk 2026-11-04 14:19:19 +01:00
lilleman 7c17447a87 Write emoji, status, date and URL card as HTML elements, not the carry 2026-11-04 14:19:19 +01:00
lilleman d5d594bbaa Record the comprehension check: paired ruling better against 0166a71 2026-11-04 13:23:04 +01:00
lilleman 395874990c Ask once whether a line spans, keep base's fallback loop, and decide carries once per pass 2026-11-04 13:23:04 +01:00
lilleman 2cbef913d5 Record that the maintainer gave the next restructure to a subagent looking past the current design 2026-11-04 13:23:04 +01:00
lilleman 2e6751ef6e Record the comprehension check: paired ruling worse against 0166a71 2026-11-04 13:23:04 +01:00
lilleman e5954e6fe4 Render the history's nested code span, and say the plan-item entry holds over a restructure 2026-11-04 13:23:04 +01:00
lilleman bab2ffcfb8 Group a line's runs in one home, part a line as its first fallback, and trim each portable line by its own runs 2026-11-04 13:23:04 +01:00
lilleman d15d063c43 Record the comprehension check: paired ruling worse against 0166a71 2026-11-04 13:23:04 +01:00
lilleman d76d4c9440 Span a run inside inlineRuns, with the reducer asking the same grouping 2026-11-04 13:23:04 +01:00
lilleman a8d9595a1f Record how item 91's spanning lands: one more case of insideRun 2026-11-04 13:23:04 +01:00
lilleman 1dcae6ca50 Keep a feature a worse ruling judges, restructuring only its code 2026-11-04 13:23:04 +01:00
lilleman d1334fc064 Record the comprehension check: paired ruling worse against 8bcf4a5, third ruling 2026-11-04 13:23:04 +01:00
lilleman 6dbb1bd2a1 Take a paired ruling after each restructure of a chunk ruled worse 2026-11-04 13:23:04 +01:00
lilleman 635d0634e7 Record the comprehension check: paired ruling worse against 8bcf4a5, second ruling 2026-11-04 13:23:04 +01:00
lilleman d14f8da195 Record the maintainer's call: a chunk ruled worse that restructures its places takes a second paired ruling 2026-11-04 13:23:04 +01:00
lilleman 433d9442d2 Record the comprehension check: paired ruling worse against 8bcf4a5 2026-11-04 13:23:04 +01:00
lilleman 0166a71e81 Record the comprehension check: paired ruling better against 8bcf4a5 2026-11-03 22:13:13 +01:00
lilleman f912d81371 Record the reading cost and remove item 166 from the plan 2026-11-03 22:13:13 +01:00
lilleman 8bcf4a5646 Record the comprehension check: paired ruling better against de0033c 2026-10-31 03:10:24 +01:00
lilleman 97bd801c58 Answer prose round 1: 1 🔴, 6 🟡 (0 misread); reword the border entries, move the README row 2026-10-31 03:10:24 +01:00
lilleman 198a451b87 Record the reading cost of chunk 38e3041e8214 2026-10-31 03:10:24 +01:00
lilleman d0867686d5 Build text holding no border mark in losslessMarkdownToAdf, and carry text holding one 2026-10-31 03:10:24 +01:00
lilleman de0033c083 Record the comprehension check: paired ruling better against e743868 2026-10-31 02:34:47 +01:00
lilleman 73c262c5e8 Answer prose round 1: 0 🔴, 10 🟡 (0 misread); say the HTML is read as a browser spells it, wherever it said exactly 2026-10-31 02:34:47 +01:00
lilleman f68e2365e9 Record the reading cost of item 150 2026-10-31 02:34:47 +01:00
lilleman 6cc59f8574 Read adfToHtml's HTML in htmlToAdf as a browser serializes it too 2026-10-31 02:34:47 +01:00
lilleman 085ad7f508 Answer prose round 1: 0 🔴, 7 🟡 (0 misread); state the sweep's rule as line equality with the reference, and reword its comments 2026-10-31 01:37:26 +01:00
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 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 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 8485ca0917 Record the reading cost of item 158's chunk 2026-10-30 15:45:11 +01:00
lilleman 41fd106826 Record the comprehension check: paired ruling worse against c7bbb04 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
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 4fb624abc0 Record the reading cost of the chunk before item 146 2026-10-28 21:37:34 +01:00
lilleman c7bbb04697 Record the comprehension check: paired ruling same against 0003675 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 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 75ddc2ee17 Record the reading cost of chunk 47b51be32176 2026-10-28 20:41:47 +01:00
lilleman 0003675af1 Record the comprehension check: paired ruling better against 1530666 2026-10-28 19:15:04 +01:00