3
0
mirror of https://github.com/larvit/adf-codec.git synced 2026-11-18 06:05:43 +01:00
Commit Graph

460 Commits

Author SHA1 Message Date
lilleman 38e7bcfaca Answer stability round 1: 0 🔴, 2 🟡 (0 misread); assert the reduced task list whole and list the README codes by one match 2026-11-09 08:42:21 +01:00
lilleman 32e295eff8 Delete the unreached task-marker paragraph in taskBlocks; check the README error tables against the codes 2026-11-09 08:42:21 +01:00
lilleman 87e5f0dca1 Answer stability round 1: 1 🔴, 2 🟡 (0 misread); read escaped keys through each reader, pin the longest name 2026-11-09 08:17:53 +01:00
lilleman f541918bcb Assert outcomes in the entity, JSON and error-code tests, so none reads source text 2026-11-09 08:17:53 +01:00
lilleman ca6016b4b6 Replace isAdfDocument with readAdfDocument, reading the input once into a plain copy 2026-11-09 07:51:13 +01:00
lilleman 9dfa14a095 Answer stability round 1: 0 🔴, 3 🟡 (0 misread); drop the repeating comment, name characterPast, settle two places in the PR summary 2026-11-09 07:06:15 +01:00
lilleman aa3ca490dc Pin runEdge's moves give-up with a hand-worked line, and drop item 176 2026-11-09 07:06:15 +01:00
lilleman 256f8f453f Answer stability round 1: 0 🔴, 2 🟡 (0 misread); drop tryTaskList's dead child paths and splitTaskList's dead check, and group children in place of a list node 2026-11-09 06:25:48 +01:00
lilleman 6b2693d385 Group a task list into typed task items in one place, refusing a list a non-task opens 2026-11-09 06:25:48 +01:00
lilleman 0011377833 Keep tryTaskList's item grouping, and record in item 175 what the ruling found 2026-11-09 05:49:30 +01:00
lilleman 091ee1e238 Answer stability round 1: 1 🔴, 0 🟡 (1 misread); keep the task list's headroom, and pin its refusal against a bullet chain's 2026-11-09 05:49:30 +01:00
lilleman fe7fabb7ab Answer prose round 1: 0 🔴, 3 🟡 (0 misread); reword the comment and item 175 2026-11-09 05:49:30 +01:00
lilleman 796f520990 Drop the unreachable task-list guards in tryTaskList 2026-11-09 05:49:30 +01:00
lilleman cb1a3da0c0 Answer prose round 1: 0 🔴, 2 🟡 (0 misread); name each case by its shape and the runs it takes 2026-11-09 05:04:28 +01:00
lilleman 78286b102e Answer stability round 1: 1 🔴, 0 🟡 (0 misread); register one test per case, and file the runEdge give-up 2026-11-09 05:04:28 +01:00
lilleman 3c8f5e8ef2 Pin each rule of the emphasis sweep with a hand-worked line 2026-11-09 05:04:28 +01:00
lilleman 602d06c6a5 Answer stability round 1: 0 🔴, 2 🟡 (0 misread); drop the false comment clause and the dead write of a literal bracket 2026-11-09 01:57:11 +01:00
lilleman 2efce5f91f Have closeBracket return what the bracket becomes and apply it to the scan in one caller 2026-11-09 01:57:11 +01:00
lilleman cd44ee9315 Answer prose round 1: 0 🔴, 2 🟡 (0 misread); cut two comments to the lines the code cannot show 2026-11-09 01:27:29 +01:00
lilleman ef6599e5b2 Pair highlights over the inline reader's pieces before building nodes 2026-11-09 01:27:29 +01:00
lilleman 59dc1fa7ea Test each callout nesting marker in a test of its own 2026-11-09 00:23:39 +01:00
lilleman 4b314725d8 Answer stability round 1: 0 🔴, 3 🟡 (0 misread); pin the stripped spaces after a marker, assert the writer's refusal, drop a code-derived expectation 2026-11-09 00:23:39 +01:00
lilleman d341da0a29 Pin the portable flavour's callout and task reading and writing with tests 2026-11-09 00:23:39 +01:00
lilleman 186050f906 Answer prose round 1: 0 🔴, 14 🟡 (0 misread); correct comments that misstated the code, fix item 174's figures and tagline, retitle item 173 2026-11-08 22:16:38 +01:00
lilleman 33811dd558 Answer principles round 1: 0 🔴, 3 🟡 (0 misread); row section field, one heading-level predicate, items 171-174 filed 2026-11-08 22:16:38 +01:00
lilleman e9de121425 Answer architecture round 1: 0 🔴, 11 🟡 (0 misread); one line policy, one reduction run, named sweep stages, spelling memo, block text, link options, HTML refusals 2026-11-08 22:16:38 +01:00
lilleman 69669476a8 Split the markdown writer's tests into one file per concern 2026-11-05 12:29:11 +01:00
lilleman 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 2026-11-05 12:09:36 +01:00
lilleman d55a249ef3 Refuse the schema-forbidden shapes in the first step, carried or not 2026-11-05 12:09:36 +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 a27a4453c2 Refuse an inline card a link marks in every writer, before it writes 2026-11-04 20:38:44 +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 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 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 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 e473fa92d0 Span a run inside inlineRuns, so runs group in one place 2026-11-04 13:23:04 +01:00
lilleman bed322fbef Keep a node's empty marks array where a run would span it 2026-11-04 13:23:04 +01:00
lilleman b2b124277a Answer prose round 1: 0 🔴, 6 🟡 (0 misread); reword the spanning comments, spec and changelog entry 2026-11-04 13:23:04 +01:00
lilleman 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 2026-11-04 13:23:04 +01:00
lilleman 6a8d487128 Spell an emphasis or link once across the nodes its mark skips, in both writers 2026-11-04 13:23:04 +01:00
lilleman 2e7f2a94e3 Put the first-run comment back above firstRunLine 2026-11-03 22:13:13 +01:00
lilleman 1409a1699a Answer prose round 1: 0 🔴, 2 🟡 (0 misread); say what insideRun's callers rely on, delete sharedRuns's comment, clear the termination comment 2026-11-03 22:13:13 +01:00
lilleman 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 2026-11-03 22:13:13 +01:00
lilleman 47503fe3c7 Group mark runs by one rule, insideRun, that both writers and the portable reducer ask 2026-11-03 22:13:13 +01:00
lilleman c4cbebd0e1 Refuse a mark whose content is text and text breaks that the mark cannot hold 2026-10-31 03:10:24 +01:00
lilleman 6d09da68c7 Answer stability round 1: 0 🔴, 3 🟡 (0 misread); refuse a seeded carry on a portable line, say what undefined means 2026-10-31 03:10:24 +01:00
lilleman 342dc1f610 Answer product-owner round 1: 0 🔴, 2 🟡 (0 misread); name the fix for border around text, and the migration row 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 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 2026-10-31 01:37:26 +01:00