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 |
|
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
|
f8157d3ad8
|
Write and read a table as its elements in the HTML dialect
|
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
|
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
|
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
|
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
|
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 |
|