 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 |
|
 renovate[bot]
|
429ec8ccb8
|
Update larvit/fejkdata Docker tag to v0.4.0
|
2026-11-10 14:40:12 +00:00 |
|
|
lilleman
|
1a875387ca
|
Answer prose round 1: 0 🔴, 3 🟡 (0 misread); title the decision for ADF converters and shorten the report's section
|
2026-11-09 11:05:06 +01:00 |
|
|
lilleman
|
93d506ddb7
|
Leave a converter that never touches ADF out of the comparison tables
|
2026-11-09 11:05:06 +01:00 |
|
|
lilleman
|
7684643e6b
|
Answer prose round 1: 0 🔴, 13 🟡 (0 misread); state the overlap and the table question plainly, and fix the report's citations
|
2026-11-09 09:59:59 +01:00 |
|
|
lilleman
|
927a245d5e
|
Report how kovetskiy/mark compares with this package
|
2026-11-09 09:59:59 +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
|
67e89da171
|
Read a container's limits on cgroup v1 hosts in the limit leg
|
2026-11-09 09:11:59 +01:00 |
|
|
lilleman
|
54e97e626b
|
Answer stability round 1: 0 🔴, 1 🟡 (0 misread); check every docker run in the gate and publish scripts names its limits
|
2026-11-09 09:11:59 +01:00 |
|
|
lilleman
|
384b118f3a
|
Give every gate and publish container a memory limit and an equal swap limit
|
2026-11-09 09:11:59 +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
|
4f23570555
|
Name the 10 million limit in the plain-copy entry's provenance line
|
2026-11-09 07:51:13 +01:00 |
|
|
lilleman
|
485780f084
|
Answer prose round 1: 0 🔴, 10 🟡 (0 misread); reword the comments, docs and item 80
|
2026-11-09 07:51:13 +01:00 |
|
|
lilleman
|
ebe4092292
|
Answer product-owner round 1: 0 🔴, 4 🟡 (0 misread); correct the README claims, name the getter remedy, record the name panel
|
2026-11-09 07:51:13 +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
|
899b854d53
|
Record the reading cost before item 45
|
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
|
41de529c83
|
Record the reading cost before 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
|
48ee494a69
|
Record the reading cost before item 175
|
2026-11-09 06:25:48 +01:00 |
|
|
lilleman
|
3b91eaeaa9
|
Record the comprehension check: paired ruling worse against 59453f6, then same after the restructure
|
2026-11-09 05:49:30 +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
|
3a4190d6b7
|
Reword item 175 to what its mutants showed
|
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
|
26c16850a8
|
Record the reading cost of chunk 9
|
2026-11-09 05:49:30 +01:00 |
|
|
lilleman
|
59453f62f5
|
Record the comprehension check: paired ruling better against 1939359
|
2026-11-09 05:04:28 +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
|
1939359cb8
|
Record the comprehension check: paired ruling better against 19c1a53
|
2026-11-09 01:57:11 +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
|
19c1a53dcc
|
Record the comprehension check: paired ruling better against 47b95fb
|
2026-11-09 01:27:29 +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
|
d6dd65b94f
|
Answer stability round 1: 0 🔴, 1 🟡 (0 misread); drop the renamed markPairings from item 56's detail
|
2026-11-09 01:27:29 +01:00 |
|
|
lilleman
|
f23aa91fc7
|
Record the reading cost of the last chunk
|
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 |
|