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

603 Commits

Author SHA1 Message Date
lilleman dcfc4f5a8d Answer prose round 1: 0 🔴, 0 🟡 (0 misread); the describe comment names what the refusal is for 2026-11-14 11:20:45 +01:00
lilleman 8095a7668b Pin the spelling description's absent case 2026-11-14 11:20:45 +01:00
lilleman 5d41b4be26 Describe each CommonMark spelling beside the emitter's spelling it names 2026-11-14 11:20:45 +01:00
lilleman 1fd07949dd Answer prose round 1: 0 🔴, 1 🟡 (0 misread); the three copied helper comments deleted 2026-11-14 10:54:52 +01:00
lilleman 3b94524362 Answer stability round 1: 0 🔴, 5 🟡 (0 misread); each fact list now tells its refusal apart, the HTML table pins the rule and escape, the duplicate proxy check dropped 2026-11-14 10:54:52 +01:00
lilleman 31ac290a0b Assert the facts a refusal's message must carry, never its whole sentence 2026-11-14 10:54:52 +01:00
lilleman 843f5a0fc5 Drop the comment on unreadableNode that restates its name 2026-11-10 22:40:33 +01:00
lilleman 976bcc2a2c Answer stability round 1: 1 🔴, 4 🟡 (0 misread); one walker for both refusals, nodeRefusal split, two tests added, the decision and the changelog narrowed to what holds 2026-11-10 22:40:33 +01:00
lilleman 297ff0e7e3 Name the node's path and the fault when not-an-adf-document refuses a node inside the document 2026-11-10 22:40:33 +01:00
lilleman 2b6dc5dbb7 Answer stability round 1: 0 🔴, 2 🟡 (0 misread); import OutermostContent in the test and drop the two tests no bug fails on alone; the two surviving mutants sit past the portable flavour and the emitter's refusals, and commonmark/ stays out of the root's ban 2026-11-10 21:38:30 +01:00
lilleman 3479bcefca Answer prose round 1: 1 🔴, 5 🟡 (0 misread); fix the comment that claimed the only ask, cut three repeating comments, and name markdown/'s root in the decision and the lint message 2026-11-10 21:38:30 +01:00
lilleman bffeb1f7d6 Ask the writer about an opening link in parse/ alone, and ban the markdown root from importing emit/, parse/ and portable/ 2026-11-10 21:38:30 +01:00
lilleman 785388d426 Refuse a pipe table whose padding would add more cells than the table holds 2026-11-10 17:13:18 +01:00
lilleman 3b61501fe2 Answer stability round 1: 1 🔴, 3 🟡 (0 misread); drop the probe files, keep a one-cell delimiter unescaped, and fix the docs 2026-11-10 17:13:18 +01:00
lilleman db2c395d05 Read a GFM pipe table's short rows, rows without a pipe and one column in portableMarkdownToAdf 2026-11-10 17:13:18 +01:00
lilleman 896e67fdfd Answer prose round 1: 0 🔴, 2 🟡 (0 misread); say a note keeps only its link and reword the note comments 2026-11-09 09:35:04 +01:00
lilleman 2aa246898d Keep the link around a note in adfToPortableMarkdown, chosen in shown-text beside the image's 2026-11-09 09:35:04 +01:00
lilleman 2bf8e37283 Answer prose round 1: 0 🔴, 1 🟡 (0 misread); move the taskBlocks comment to the branch it governs 2026-11-09 08:42:21 +01:00
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 2b0e23f90e Answer stability round 2: 1 🔴, 0 🟡 (0 misread); key the cases by url too, so the data attribute is read 2026-11-09 08:17:53 +01:00
lilleman 04127727a8 Answer prose round 1: 1 🔴, 2 🟡 (0 misread); correct the decision, item 81 and a comment 2026-11-09 08:17:53 +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 d255b17d37 Answer stability round 1: 0 🔴, 7 🟡 (0 misread); drop adfDocumentFault, wrap readAdfDocument in the engine limits, pin the budget, key order and path, one test per case 2026-11-09 07:51:13 +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 673121ac8a Answer stability round 1: 0 🔴, 1 🟡 (0 misread); write a hostile fence whose info string holds a backtick with tildes 2026-11-09 00:49:24 +01:00
lilleman 6b33a2e299 Write the property's block carries as adf: fences, canonical and hostile 2026-11-09 00:49:24 +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 2017777596 Answer stability round 1: 0 🔴, 1 🟡 (0 misread); pin that a data fault wins over a repeated leading attribute, the sweep survivors stay with item 162 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