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

341 Commits

Author SHA1 Message Date
lilleman 24247eff85 Record that the same answer accepts credit by link 2026-11-05 10:40:48 +01:00
lilleman ab36e89b3b Record that the maintainer accepts the inferred licence 2026-11-05 10:40:48 +01:00
lilleman 1e3d6e5d65 Answer product-owner round 1: 1 🔴, 5 🟡 (0 misread); add the licence notice, link each document to its page, stop a failed fetch reaching the corpus, keep raw folders out of the repo 2026-11-05 10:40:48 +01:00
lilleman 8fee35a63b Answer security round 1: 0 🔴, 0 🟡 (0 misread); replace Forge keys and digits of any script, and fetch with the repo read-only 2026-11-05 10:40:48 +01:00
lilleman 99526aaa55 Keep each uuid's version and case when anonymizing the real-world corpus 2026-11-05 10:40:48 +01:00
lilleman 232e120666 State the fetch's cost as measured 2026-11-05 10:40:48 +01:00
lilleman 59954f93b3 Gather an anonymized corpus of real-world ADF documents with each one's source and licence 2026-11-05 10:40:48 +01:00
lilleman dbaa6823aa Answer prose round 1: 2 🔴, 2 🟡 (0 misread); say the breaking change is accepted and drop the confirm step 2026-11-04 21:20:24 +01:00
lilleman 8bc6546c78 Record that the schema checks change where they run, not what the library accepts 2026-11-04 21:20:24 +01:00
lilleman 7c0dec54cf Limit the identical-refusal claim to writers, say non-empty content, and warn of stored carries 2026-11-04 21:03:04 +01:00
lilleman 7a7b12b6a7 Answer prose round 1: 4 🔴, 6 🟡 (0 misread); state the shapes moved and what holds today, and drop the mark rule 2026-11-04 21:03:04 +01:00
lilleman 5af77d0a5e Record that the first step checks every schema rule, and plan moving the writers' schema refusals there 2026-11-04 21:03:04 +01:00
lilleman acc6df4e9f Record the comprehension check: paired ruling better against 30f45b7 2026-11-04 20:38:44 +01:00
lilleman 3e01c4eccc Answer prose round 1: 2 🔴, 7 🟡 (0 misread); retitle the decision, state its rule, and fix the carry claims 2026-11-04 20:38:44 +01:00
lilleman a27a4453c2 Refuse an inline card a link marks in every writer, before it writes 2026-11-04 20:38:44 +01:00
lilleman 30f45b75d8 Record the comprehension check: paired ruling same against 81d741d 2026-11-04 20:02:37 +01:00
lilleman b9fd34abfb Answer prose round 1: 1 🔴, 6 🟡 (0 misread); state the refusal beside the carry rule, date it, and fix the cause bullets and the message 2026-11-04 20:02:37 +01:00
lilleman 1f5c6567c2 Answer stability round 1: 0 🔴, 2 🟡 (0 misread); name the violation in the card refusal and record that htmlToAdf still reads a carried linked card 2026-11-04 20:02:37 +01:00
lilleman 64d4267218 Refuse an inline card a link marks in adfToHtml as unsupported-node-shape 2026-11-04 20:02:37 +01:00
lilleman 81d741d3b6 Record the comprehension check: paired ruling better against 13a2689 2026-11-04 17:21:54 +01:00
lilleman 1b0eec19d1 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 17:21:54 +01:00
lilleman 4ede66577e Write mentions and inline cards holding data as HTML elements, not the carry 2026-11-04 17:21:54 +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