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

Commit Graph

  • f68e2365e9 Record the reading cost of item 150 lilleman 2026-10-31 01:48:10 +01:00
  • 6cc59f8574 Read adfToHtml's HTML in htmlToAdf as a browser serializes it too lilleman 2026-10-31 01:48:10 +01:00
  • 088494511d Answer stability round 1: 1 🔴, 3 🟡 (0 misread); start an empty line's walk at its innermost quote, pin two guards, file item 162 lilleman 2026-10-31 01:18:45 +01:00
  • 085ad7f508 Answer prose round 1: 0 🔴, 7 🟡 (0 misread); state the sweep's rule as line equality with the reference, and reword its comments lilleman 2026-10-31 01:18:45 +01:00
  • 42fc6d97fb Move the emphasis sweep into unspellable-runs.ts with named standings, derive its rule in docs/decisions.md, and close item 160 lilleman 2026-10-30 22:11:47 +01:00
  • 9bedc7bae4 Make every withheld carry through carriedRun, which checks it as it is made lilleman 2026-10-30 21:55:51 +01:00
  • 7941972471 Keep BlockText's measures as two named records, read its flags through two functions, and claim a marker through one guard lilleman 2026-10-30 21:53:59 +01:00
  • d28bb4a13f Keep the one-fallback-per-pass loop in the properties, out of the writers' signatures lilleman 2026-10-30 21:47:06 +01:00
  • 87e6f6102d Record the reading cost of the chunk before item 160, re-score item 160 at L 4 lilleman 2026-10-30 21:17:12 +01:00
  • 6fd2e7ce07 Answer prose round 1: 0 🔴, 4 🟡 (0 misread); retitle and rewrite the cap's entry, measure the changelog against 0.2.0 lilleman 2026-10-30 21:00:05 +01:00
  • 1f33007ae2 Answer product-owner round 1: 0 🔴, 1 🟡 (0 misread); state the 32-try rule in the README and the flavour spec lilleman 2026-10-30 21:00:05 +01:00
  • 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 lilleman 2026-10-30 21:00:05 +01:00
  • d0b2e22aa8 Write a line where em shares a delimiter run with strong in time linear in its mark runs lilleman 2026-10-30 20:39:09 +01:00
  • 01c8365f71 Record the maintainer's call: a chunk ruled worse merges where item 160 restores that code's reading lilleman 2026-10-30 15:41:31 +01:00
  • e743868f73 Record the comprehension check: paired ruling worse against 41fd106 lilleman 2026-10-30 12:10:45 +01:00
  • 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 lilleman 2026-10-30 11:45:10 +01:00
  • 4834e802d9 Answer prose round 1: 0 🔴, 7 🟡 (0 misread); reword the sweep's comments, the cost entry and item 160 lilleman 2026-10-30 01:37:27 +01:00
  • 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 lilleman 2026-10-30 01:37:16 +01:00
  • 47b990feea Emit a line mixing em, strike and strong in time linear in its mark runs lilleman 2026-10-29 23:57:32 +01:00
  • c34168bbc6 Re-score item 158 at L 4: two components, a new pattern and a rewrite of a known defect lilleman 2026-10-29 17:32:46 +01:00
  • 8485ca0917 Record the reading cost of item 158's chunk lilleman 2026-10-29 17:32:46 +01:00
  • 8f1645500a File item 160: make the block-text tree and batched fallbacks read as easily as before lilleman 2026-10-29 17:26:00 +01:00
  • 41fd106826 Record the comprehension check: paired ruling worse against c7bbb04 lilleman 2026-10-29 16:42:06 +01:00
  • 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 lilleman 2026-10-29 16:23:23 +01:00
  • ee95b3035f Answer prose round 1: 0 🔴, 7 🟡 (0 misread); the bound test's block count is 53, comments name their referents lilleman 2026-10-29 16:19:12 +01:00
  • 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 lilleman 2026-10-29 16:19:12 +01:00
  • 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 lilleman 2026-10-29 16:19:12 +01:00
  • 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 lilleman 2026-10-29 14:07:44 +01:00
  • 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 lilleman 2026-10-29 13:55:50 +01:00
  • 10cb24e706 Spell nested lists and quotes in time linear in the markdown lilleman 2026-10-29 13:30:05 +01:00
  • 1f8619e272 Emit a line in time linear in its mark runs lilleman 2026-10-29 13:05:36 +01:00
  • 3f13738ae4 Update Node.js to v26.13.0 renovate[bot] 2026-10-29 01:34:43 +00:00
  • d2fb780cce Remove item 157 from the plan: the files are about 7% of a chunk's reading, so reset the reading-cost trend lilleman 2026-10-29 00:28:30 +01:00
  • 8fb60a0134 Record what item 157 measured: the three docs are about 7% of a chunk's reading lilleman 2026-10-29 00:08:30 +01:00
  • 55968bbd26 List the three converters that fail ordinary input, each with where it fails lilleman 2026-10-28 23:43:15 +01:00
  • bb89a1b516 Remove items 146 and 145 from the plan, file item 157 for the rising reading cost lilleman 2026-10-28 21:38:33 +01:00
  • 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 lilleman 2026-10-28 21:17:58 +01:00
  • 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 lilleman 2026-10-28 21:17:22 +01:00
  • 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 lilleman 2026-10-28 21:16:10 +01:00
  • 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 lilleman 2026-10-28 21:15:43 +01:00
  • 30d6e5120a Record the npm searches behind the comparison table lilleman 2026-10-28 21:13:09 +01:00
  • de356d2caf Rewrap the comparison intro lilleman 2026-10-28 21:12:50 +01:00
  • 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 lilleman 2026-10-28 21:12:41 +01:00
  • 11529ac165 Open the README with the call to take for each need, and widen the converter comparison lilleman 2026-10-28 21:05:05 +01:00
  • 4fb624abc0 Record the reading cost of the chunk before item 146 lilleman 2026-10-28 21:05:05 +01:00
  • 33c05708b0 Remove item 152 from the plan lilleman 2026-10-28 20:38:09 +01:00
  • c7bbb04697 Record the comprehension check: paired ruling same against 0003675 lilleman 2026-10-28 20:34:24 +01:00
  • 8e1b8e6f7b Say run.sh mutates only nodes wholly inside the changed lines lilleman 2026-10-28 20:32:35 +01:00
  • 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 lilleman 2026-10-28 20:21:29 +01:00
  • 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 lilleman 2026-10-28 20:13:38 +01:00
  • 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 lilleman 2026-10-28 20:08:48 +01:00
  • 061ae81644 Mutation-test the source lines a chunk changes with mutation-tests/run.sh lilleman 2026-10-28 19:50:00 +01:00
  • 75ddc2ee17 Record the reading cost of chunk 47b51be32176 lilleman 2026-10-28 19:18:22 +01:00
  • 80b39dd122 Update dependency @types/node to v26.6.6 renovate[bot] 2026-10-28 18:57:54 +00:00
  • ea6231d4d1 Say markdown written by 0.2.0 reads the same in 0.3.0 lilleman 2026-10-28 19:08:15 +01:00
  • 0003675af1 Record the comprehension check: paired ruling better against 1530666 lilleman 2026-10-28 19:08:15 +01:00
  • 6d440e97e9 Record that a pass at its round cap whose findings are all fixed takes no further round lilleman 2026-10-28 19:05:10 +01:00
  • 2b5c0571fc Give the 33-million-character line test a timeout past Bun's 5 s default lilleman 2026-10-28 18:21:07 +01:00
  • ff44b6e195 Answer principles round 3: 0 🔴, 1 🟡 (0 misread); item 154 says what the pairing reads off the built nodes, and the fallback test spells its runs lilleman 2026-10-28 18:12:48 +01:00
  • 2f9a1b3540 Answer stability round 2: 1 🔴, 0 🟡 (0 misread); a line gives up every highlight run whose own delimiters cannot flank in one pass, as shipped, so a line of them re-emits once, and the reader records no highlight pairs lilleman 2026-10-28 18:10:03 +01:00
  • 5107c9506b Answer principles round 2: 0 🔴, 0 🟡 (0 misread); record takes the SharedScan it reads lilleman 2026-10-28 17:39:28 +01:00
  • 2b6d5f2def Answer prose round 1: 0 🔴, 7 🟡 (0 misread); the decision, spec, changelog and items 34, 91, 153 and 155 are rewritten, and readBack's, parseInlineContent's, readLineBack's, guardLinkDefinition's and InlineReading's comments say what the code cannot lilleman 2026-10-28 17:36:28 +01:00
  • ded38b95be Answer product-owner round 1: 0 🔴, 1 🟡 (0 misread); the changelog says which markdown reads the same in 0.3.0 lilleman 2026-10-28 17:36:28 +01:00
  • b388b33d31 Answer stability round 1: 1 🔴, 4 🟡 (1 misread); a line gives up its first misread emphasis run, else its first misread highlight, as shipped, the run list narrows to one run, Scan holds SharedScan, the Piece arms are named, and textOpeners and guardLinkDefinition are pinned lilleman 2026-10-28 17:36:28 +01:00
  • 6636f01497 Answer principles round 1: 0 🔴, 0 🟡 (0 misread); readAsWritten names the emphasis check, the bracket test names the bare case, noDefinitions sorts after linkInLink lilleman 2026-10-28 14:50:05 +01:00
  • 5ede92bf91 Answer architecture round 1: 0 🔴, 7 🟡 (0 misread); the read-back loop parts from the verdict, the reader takes the opening-link consult, the reading is absent on the parse path, a refused link escapes no backtick; root imports, highlight pairing and closeBracket filed as items 153 to 155 lilleman 2026-10-28 14:42:09 +01:00
  • b0bf362ef9 Find code-span and link openers and unspellable mark runs by reading the escaped line back lilleman 2026-10-28 19:11:23 +01:00
  • c295611a9b Add item 152 to the blockers of items 72 and 73, which wait for every other 0.3.0 item lilleman 2026-10-28 13:34:06 +01:00
  • 5150096536 File item 152: mutation-test a chunk's changed lines in 15 minutes or less lilleman 2026-10-28 13:25:22 +01:00
  • becd7d8d4e Answer prose round 1: 0 🔴, 3 🟡 (0 misread); the destinationEnds comment names a stop and the stack, the changelog entry says neither escaped nor closed, the test name says where the paren is open lilleman 2026-10-28 13:12:57 +01:00
  • fda02e9acb Answer principles round 1: 0 🔴, 2 🟡 (0 misread); the end of the text is destinationEnds' last stop, and a nested unclosed paren after a space is pinned lilleman 2026-10-28 13:08:01 +01:00
  • 6fe527c945 Read a link destination holding an unbalanced unescaped parenthesis as no destination lilleman 2026-10-28 13:04:54 +01:00
  • 744476658c Answer prose round 2: 0 🔴, 2 🟡 (0 misread); the memo comments say what they hold, the PR body names destinationEnds lilleman 2026-10-28 12:48:28 +01:00
  • 935012d475 Answer stability round 1: 1 🔴, 1 🟡 (0 misread); nested directive contents share their paragraph's memo, and a title after <destination> needs whitespace, pinned lilleman 2026-10-28 12:44:27 +01:00
  • 273c08ac08 Answer prose round 1: 0 🔴, 2 🟡 (0 misread); the memo's comments say what they guard, two test names say what they check, item 151 names the one walk lilleman 2026-10-28 12:09:38 +01:00
  • 167d59836c Answer principles round 1: 1 🔴, 0 🟡 (0 misread); readDestination reads through targetMemo, so one loop holds the destination grammar lilleman 2026-10-28 12:05:33 +01:00
  • fc7f7fb357 Read an inline link's target in time linear in the inline markdown lilleman 2026-10-28 12:00:46 +01:00
  • 1f1cd34a1d Record the yes to item 150: htmlToAdf also reads the dialect as a browser serializes it lilleman 2026-10-28 11:43:50 +01:00
  • 15306662d0 Record the comprehension check: paired ruling same against 240c39a lilleman 2026-10-28 11:33:41 +01:00
  • c85d23a9ba Answer principles round 4: 0 🔴, 1 🟡 (0 misread); an item's line names the missing </li> before the next item too lilleman 2026-10-28 09:51:59 +01:00
  • 12230b5e9c Answer prose round 1: 0 🔴, 8 🟡 (0 misread); refusals name the tag and what they found, the start-after-data-* message no longer false, README, spec and changelog reworded lilleman 2026-10-28 03:07:37 +01:00
  • 4fa16b62e5 Answer stability round 2: 0 🔴, 2 🟡 (0 misread); an item's line names an inline element only on a bare line short of a block, and two refusals pinned to the character they name lilleman 2026-10-28 02:06:22 +01:00
  • 37f9cfc433 Answer product-owner round 2: 0 🔴, 2 🟡 (0 misread); a code element, an item's line and a mark element's content refused through misread, naming what they found lilleman 2026-10-28 02:01:49 +01:00
  • 3366841adf Answer principles round 2: 0 🔴, 3 🟡 (0 misread); the document carry's two clauses pinned, one test per case, the escaped set spelled once in the entities map, UUID v7 ids, the document carry's tail from carryContent lilleman 2026-10-28 01:44:00 +01:00
  • 74add5c813 Answer architecture round 3: 0 🔴, 1 🟡 (0 misread); what a carry element shows recorded as part of the HTML contract, in the decision, at carryContent and in item 143 lilleman 2026-10-28 01:44:00 +01:00
  • 7d82cd38ea Answer product-owner round 1: 0 🔴, 3 🟡 (0 misread); refusals name and point at what they found, the docs list each code htmlToAdf refuses with, browser-serialized HTML filed as item 150 lilleman 2026-10-28 01:27:40 +01:00
  • 0cb80fd4fc Answer principles round 1: 1 🔴, 5 🟡 (0 misread); the document carry's line feeds checked, element spellings shared with the writer, carried JSON bounded by type, an edit to a carry refused, one test per case, a start tag read one attribute at a time lilleman 2026-10-28 01:27:40 +01:00
  • e39ca86d74 Answer architecture round 1: 2 🔴, 6 🟡 (0 misread); carried JSON read through adf/, one spelling home per element in html/, block readers in one table, the first paragraph's form shared, a lint boundary for html/parse, a strictness oracle lilleman 2026-10-26 22:46:02 +01:00
  • 51e37f68df Ship htmlToAdf: read back exactly the HTML adfToHtml writes, a carry element from its data-adf alone, any other HTML refused lilleman 2026-10-26 21:47:30 +01:00
  • 905b039866 Update Node.js to v26 renovate[bot] 2026-10-28 00:08:47 +00:00
  • 4b25f99cb8 Move item 72 into 0.3.0, item 73's thread on plain text to item 147, and item 73's posts open with the asker's problem lilleman 2026-10-28 01:05:01 +01:00
  • f87bf56274 Plan 0.3.0 around the announcement: its blockers and a README item in, plain text, wiki markup and foreign HTML filed for 0.4.0 lilleman 2026-10-28 00:59:59 +01:00
  • b6d0ff5dcb Widen item 145 to converters beyond npm, its bar and checks asked lilleman 2026-10-28 00:25:32 +01:00
  • 722cdf19a2 File item 145: list mdast-util-from-adf in the converter table lilleman 2026-10-28 00:22:05 +01:00
  • 23fd7ae9b9 Update dependency oxlint to v1.90.0 renovate[bot] 2026-10-27 06:13:39 +00:00
  • c47bea4102 Answer prose round 1: 0 🔴, 1 🟡 (0 misread); the decision's premise named, its claims split lilleman 2026-10-26 21:07:47 +01:00
  • f9e57d4c51 Settle that HTML writes a URL as the ADF holds it, a scheme filter left for a later security addition lilleman 2026-10-26 21:05:33 +01:00
  • 240c39a468 Record the comprehension check: paired ruling better against 61a5c07 lilleman 2026-10-26 13:16:52 +01:00
  • e20a1c3a30 Answer architecture round 5: 0 🔴, 0 🟡 (0 misread); shownImage returns no textless state, item 143 and the card rule name their whole reach lilleman 2026-10-26 12:58:17 +01:00
  • 9ff53c1658 Answer architecture round 4: 0 🔴, 1 🟡 (0 misread); one image rule in shown-text for both writers, a link mark's href kept past a bad title, the card rule recorded lilleman 2026-10-24 11:58:23 +02:00