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

1199 Commits

Author SHA1 Message Date
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 9460f18f6f Answer product-owner round 1: 0 🔴, 4 🟡 (0 misread); list the breaking change on its own, name what to build, and cover the readers 2026-11-04 20:38:44 +01:00
lilleman deae360969 Answer stability round 1: 2 🔴, 1 🟡 (0 misread); refuse a link-marked card in the carry readers, and pin the order of two 2026-11-04 20:38:44 +01:00
lilleman 13f03a4281 Answer security round 1: 0 🔴, 1 🟡 (0 misread); build the refusal's path in linear time 2026-11-04 20:38:44 +01:00
lilleman 977729621c Keep the generated documents' cards free of a link mark 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 a06d27d81a Give the card guard's real reason, the schema 2026-11-04 20:02:37 +01:00
lilleman f23a1bc3c8 Say why the card guard refuses, and keep the spec's carry causes under their lead-in 2026-11-04 20:02:37 +01:00
lilleman 5856b3c0d3 Say the card refusal holds only in a block written as an element 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 18c35e0f78 Answer product-owner round 1: 0 🔴, 1 🟡 (0 misread); tell a caller who only holds the ADF to keep it read-only, and give the real reason 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 4dfea72c9c Answer product-owner round 1: 0 🔴, 1 🟡 (0 misread); describe a data card as adfToHtml writes it 2026-11-04 17:21:54 +01:00
lilleman a7671a234e Answer stability round 1: 0 🔴, 3 🟡 (0 misread); pin a card whose URL cannot be written and a non-string url or text 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 ee41a9db70 Answer stability round 1: 0 🔴, 5 🟡 (0 misread); name the span classes in the carry refusal, call the shown-text attribute textAttribute, pin the content, whitespace and wrong-element cases 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 731b10fdea Answer product-owner round 1: 0 🔴, 3 🟡 (0 misread); name the fix each refusal needs, list the card's href as an unfiltered URL, carry dates outside years 1 to 9999 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 7ca6114f5d Block item 73 by 163 and 165 2026-11-04 13:41:26 +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 763d68ba03 Name edgeDepth's parameter apart from runsBeside 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 5ee168efff Restore inlineRuns and join spanned runs in their own units, the span choice in linePass 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