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

Commit Graph

  • bc92119a0a Record this chunk's reading-cost figure lilleman 2026-11-05 16:38:52 +01:00
  • 9976955de1 Remove item 72: the Gitea copy is a read-only mirror lilleman 2026-11-05 16:38:40 +01:00
  • 27e8f33f30 Update larvit/fejkdata Docker tag to v0.3.0 renovate[bot] 2026-11-05 11:43:27 +00:00
  • 676062fa50 Cite items 134 and 141 as the check reads them lilleman 2026-11-05 12:39:08 +01:00
  • a270b436fc Answer prose round 1: 0 🔴, 0 🟡 (0 misread); tighten the panel verdicts' wording lilleman 2026-11-05 12:36:24 +01:00
  • f54d0078be Record the reader panel's verdicts on the feature table's rows lilleman 2026-11-05 12:34:06 +01:00
  • 8e41c5a9b9 Record this chunk's reading-cost figure lilleman 2026-11-05 12:34:06 +01:00
  • 49689a751b Remove item 168 from the plan lilleman 2026-11-05 12:14:18 +01:00
  • 50ab899c76 Record the reading cost and reset its trend lilleman 2026-11-05 12:14:18 +01:00
  • 69669476a8 Split the markdown writer's tests into one file per concern lilleman 2026-11-05 12:14:18 +01:00
  • e5bf78d111 Name which attributes the feature page's readers lose, and restore the blockers of items 72 and 73 lilleman 2026-11-05 12:05:44 +01:00
  • 5d0cc0a4af Answer prose round 1: 1 🔴, 13 🟡 (1 misread); correct the migration recipe, tighten the specs and item 168's detail lilleman 2026-11-05 11:51:50 +01:00
  • 0d7a071f4e Answer product-owner round 1: 0 🔴, 4 🟡 (0 misread); keep unreleased calls out of the Breaking entries and sharpen the feature page's intro lilleman 2026-11-05 11:51:50 +01:00
  • d7c6a6b1f5 Answer stability round 1: 0 🔴, 10 🟡 (0 misread); pin section tags, cell values and refusal paths with tests, parametrize test loops, drop the markdown tryRule's dead clause lilleman 2026-11-05 11:51:50 +01:00
  • a0f4b45578 Write the bold-command fixture in canonical JSON lilleman 2026-11-05 11:16:43 +01:00
  • 1f86f24870 Publish what each call writes for chosen corpus examples, and fail the gate where the page is stale lilleman 2026-11-05 11:14:27 +01:00
  • f8157d3ad8 Write and read a table as its elements in the HTML dialect lilleman 2026-11-05 11:10:21 +01:00
  • d55a249ef3 Refuse the schema-forbidden shapes in the first step, carried or not lilleman 2026-11-05 11:02:45 +01:00
  • 24247eff85 Record that the same answer accepts credit by link lilleman 2026-11-05 10:29:25 +01:00
  • ab36e89b3b Record that the maintainer accepts the inferred licence lilleman 2026-11-05 10:22:19 +01:00
  • 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 lilleman 2026-11-05 00:17:32 +01:00
  • 8fee35a63b Answer security round 1: 0 🔴, 0 🟡 (0 misread); replace Forge keys and digits of any script, and fetch with the repo read-only lilleman 2026-11-04 23:31:59 +01:00
  • 99526aaa55 Keep each uuid's version and case when anonymizing the real-world corpus lilleman 2026-11-04 23:00:44 +01:00
  • 232e120666 State the fetch's cost as measured lilleman 2026-11-04 21:53:41 +01:00
  • 59954f93b3 Gather an anonymized corpus of real-world ADF documents with each one's source and licence lilleman 2026-11-04 21:50:40 +01:00
  • dbaa6823aa Answer prose round 1: 2 🔴, 2 🟡 (0 misread); say the breaking change is accepted and drop the confirm step lilleman 2026-11-04 21:07:32 +01:00
  • 8bc6546c78 Record that the schema checks change where they run, not what the library accepts lilleman 2026-11-04 21:05:39 +01:00
  • 7c0dec54cf Limit the identical-refusal claim to writers, say non-empty content, and warn of stored carries lilleman 2026-11-04 20:59:19 +01:00
  • 7a7b12b6a7 Answer prose round 1: 4 🔴, 6 🟡 (0 misread); state the shapes moved and what holds today, and drop the mark rule lilleman 2026-11-04 20:51:28 +01:00
  • 5af77d0a5e Record that the first step checks every schema rule, and plan moving the writers' schema refusals there lilleman 2026-11-04 20:47:10 +01:00
  • acc6df4e9f Record the comprehension check: paired ruling better against 30f45b7 lilleman 2026-11-04 20:35:10 +01:00
  • 3e01c4eccc Answer prose round 1: 2 🔴, 7 🟡 (0 misread); retitle the decision, state its rule, and fix the carry claims lilleman 2026-11-04 20:30:08 +01:00
  • 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 lilleman 2026-11-04 20:30:08 +01:00
  • deae360969 Answer stability round 1: 2 🔴, 1 🟡 (0 misread); refuse a link-marked card in the carry readers, and pin the order of two lilleman 2026-11-04 20:30:08 +01:00
  • 13f03a4281 Answer security round 1: 0 🔴, 1 🟡 (0 misread); build the refusal's path in linear time lilleman 2026-11-04 20:22:16 +01:00
  • 977729621c Keep the generated documents' cards free of a link mark lilleman 2026-11-04 20:17:40 +01:00
  • a27a4453c2 Refuse an inline card a link marks in every writer, before it writes lilleman 2026-11-04 20:16:16 +01:00
  • 30f45b75d8 Record the comprehension check: paired ruling same against 81d741d lilleman 2026-11-04 19:58:40 +01:00
  • a06d27d81a Give the card guard's real reason, the schema lilleman 2026-11-04 19:57:16 +01:00
  • f23a1bc3c8 Say why the card guard refuses, and keep the spec's carry causes under their lead-in lilleman 2026-11-04 19:55:21 +01:00
  • 5856b3c0d3 Say the card refusal holds only in a block written as an element lilleman 2026-11-04 19:52:37 +01:00
  • 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 lilleman 2026-11-04 19:42:55 +01:00
  • 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 lilleman 2026-11-04 19:42:42 +01:00
  • 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 lilleman 2026-11-04 19:42:42 +01:00
  • 64d4267218 Refuse an inline card a link marks in adfToHtml as unsupported-node-shape lilleman 2026-11-04 19:37:08 +01:00
  • 81d741d3b6 Record the comprehension check: paired ruling better against 13a2689 lilleman 2026-11-04 16:59:37 +01:00
  • 1b0eec19d1 Answer prose round 1: 0 🔴, 7 🟡 (0 misread); say a card shows its name, else its URL, and tighten the item 133 detail lilleman 2026-11-04 16:44:10 +01:00
  • 4dfea72c9c Answer product-owner round 1: 0 🔴, 1 🟡 (0 misread); describe a data card as adfToHtml writes it lilleman 2026-11-04 16:44:10 +01:00
  • a7671a234e Answer stability round 1: 0 🔴, 3 🟡 (0 misread); pin a card whose URL cannot be written and a non-string url or text lilleman 2026-11-04 16:44:10 +01:00
  • 4ede66577e Write mentions and inline cards holding data as HTML elements, not the carry lilleman 2026-11-04 16:22:57 +01:00
  • 13a2689b0d Record the comprehension check: paired ruling same against d5d594b lilleman 2026-11-04 14:11:10 +01:00
  • 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 lilleman 2026-11-04 13:51:05 +01:00
  • 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 lilleman 2026-11-04 13:45:29 +01:00
  • 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 lilleman 2026-11-04 13:45:29 +01:00
  • d67a935230 Record the reading cost of the chunk lilleman 2026-11-04 13:37:01 +01:00
  • 7c17447a87 Write emoji, status, date and URL card as HTML elements, not the carry lilleman 2026-11-04 13:36:50 +01:00
  • 7ca6114f5d Block item 73 by 163 and 165 lilleman 2026-11-04 13:37:16 +01:00
  • d5d594bbaa Record the comprehension check: paired ruling better against 0166a71 lilleman 2026-11-04 13:17:09 +01:00
  • 395874990c Ask once whether a line spans, keep base's fallback loop, and decide carries once per pass lilleman 2026-11-04 13:08:41 +01:00
  • 2cbef913d5 Record that the maintainer gave the next restructure to a subagent looking past the current design lilleman 2026-11-04 12:02:16 +01:00
  • 2e6751ef6e Record the comprehension check: paired ruling worse against 0166a71 lilleman 2026-11-03 23:54:30 +01:00
  • e5954e6fe4 Render the history's nested code span, and say the plan-item entry holds over a restructure lilleman 2026-11-03 23:50:38 +01:00
  • 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 lilleman 2026-11-03 23:36:47 +01:00
  • d15d063c43 Record the comprehension check: paired ruling worse against 0166a71 lilleman 2026-11-03 22:46:37 +01:00
  • 763d68ba03 Name edgeDepth's parameter apart from runsBeside lilleman 2026-11-03 22:37:43 +01:00
  • d76d4c9440 Span a run inside inlineRuns, with the reducer asking the same grouping lilleman 2026-11-03 22:34:53 +01:00
  • a8d9595a1f Record how item 91's spanning lands: one more case of insideRun lilleman 2026-11-03 22:13:59 +01:00
  • 1dcae6ca50 Keep a feature a worse ruling judges, restructuring only its code lilleman 2026-11-03 16:11:06 +01:00
  • d1334fc064 Record the comprehension check: paired ruling worse against 8bcf4a5, third ruling lilleman 2026-11-03 15:18:32 +01:00
  • 5ee168efff Restore inlineRuns and join spanned runs in their own units, the span choice in linePass lilleman 2026-11-03 15:16:28 +01:00
  • 6dbb1bd2a1 Take a paired ruling after each restructure of a chunk ruled worse lilleman 2026-11-03 14:55:06 +01:00
  • 635d0634e7 Record the comprehension check: paired ruling worse against 8bcf4a5, second ruling lilleman 2026-10-31 08:18:22 +01:00
  • d14f8da195 Record the maintainer's call: a chunk ruled worse that restructures its places takes a second paired ruling lilleman 2026-10-31 08:16:04 +01:00
  • e473fa92d0 Span a run inside inlineRuns, so runs group in one place lilleman 2026-10-31 04:32:55 +01:00
  • 433d9442d2 Record the comprehension check: paired ruling worse against 8bcf4a5 lilleman 2026-10-31 04:20:54 +01:00
  • bed322fbef Keep a node's empty marks array where a run would span it lilleman 2026-10-31 04:13:17 +01:00
  • 320e5debbf Close item 91 lilleman 2026-10-31 03:58:49 +01:00
  • b2b124277a Answer prose round 1: 0 🔴, 6 🟡 (0 misread); reword the spanning comments, spec and changelog entry lilleman 2026-10-31 03:56:44 +01:00
  • f77b9f91a1 Answer product-owner round 1: 0 🔴, 1 🟡 (0 misread); list pipe cells and directive content in the hardBreak row lilleman 2026-10-31 03:56:44 +01:00
  • 16690de96f Answer stability round 1: 1 🔴, 2 🟡 (0 misread); keep a portable line parted where spanning needs !adf:text, test the depth guard, drop a dead check lilleman 2026-10-31 03:56:44 +01:00
  • 6a8d487128 Spell an emphasis or link once across the nodes its mark skips, in both writers lilleman 2026-10-31 03:22:37 +01:00
  • 4c917f5e9d Update dependency oxlint to v1.91.0 renovate[bot] 2026-11-03 21:14:40 +00:00
  • 0166a71e81 Record the comprehension check: paired ruling better against 8bcf4a5 lilleman 2026-11-03 22:09:45 +01:00
  • 2e7f2a94e3 Put the first-run comment back above firstRunLine lilleman 2026-11-03 22:09:45 +01:00
  • 1409a1699a Answer prose round 1: 0 🔴, 2 🟡 (0 misread); say what insideRun's callers rely on, delete sharedRuns's comment, clear the termination comment lilleman 2026-11-03 21:54:29 +01:00
  • bcdf224e4c Answer stability round 1: 0 🔴, 6 🟡 (0 misread); restore inlineRuns's early exit, one mark equality, refuse a pass taking no mark, pin the carried range and the opening link's run lilleman 2026-11-03 21:54:29 +01:00
  • f912d81371 Record the reading cost and remove item 166 from the plan lilleman 2026-11-03 16:56:08 +01:00
  • 47503fe3c7 Group mark runs by one rule, insideRun, that both writers and the portable reducer ask lilleman 2026-11-03 16:55:24 +01:00
  • dcbad78213 Plan the mark-run refactor ahead of item 91, and record the corpus answers lilleman 2026-11-03 16:29:16 +01:00
  • 11c90949b0 Plan a real-world ADF corpus, a feature table built from it, and a reader panel judging the table lilleman 2026-11-03 16:10:55 +01:00
  • 8bcf4a5646 Record the comprehension check: paired ruling better against de0033c lilleman 2026-10-31 03:06:41 +01:00
  • c4cbebd0e1 Refuse a mark whose content is text and text breaks that the mark cannot hold lilleman 2026-10-31 03:02:29 +01:00
  • 6d09da68c7 Answer stability round 1: 0 🔴, 3 🟡 (0 misread); refuse a seeded carry on a portable line, say what undefined means lilleman 2026-10-31 02:50:23 +01:00
  • 97bd801c58 Answer prose round 1: 1 🔴, 6 🟡 (0 misread); reword the border entries, move the README row lilleman 2026-10-31 02:50:23 +01:00
  • 342dc1f610 Answer product-owner round 1: 0 🔴, 2 🟡 (0 misread); name the fix for border around text, and the migration row lilleman 2026-10-31 02:50:22 +01:00
  • 198a451b87 Record the reading cost of chunk 38e3041e8214 lilleman 2026-10-31 02:40:59 +01:00
  • d0867686d5 Build text holding no border mark in losslessMarkdownToAdf, and carry text holding one lilleman 2026-10-31 02:40:51 +01:00
  • de0033c083 Record the comprehension check: paired ruling better against e743868 lilleman 2026-10-31 02:31:08 +01:00
  • 73c262c5e8 Answer prose round 1: 0 🔴, 10 🟡 (0 misread); say the HTML is read as a browser spells it, wherever it said exactly lilleman 2026-10-31 02:13:10 +01:00
  • b9991fff59 Answer stability round 1: 0 🔴, 5 🟡 (0 misread); derive the entity tables from one map, drop a dead branch, pin two refusals' places lilleman 2026-10-31 02:13:10 +01:00