3
0
mirror of https://github.com/larvit/adf-codec.git synced 2026-11-12 19:58:28 +01:00
Commit Graph

36 Commits

Author SHA1 Message Date
lilleman 33e2a86a14 Record the comprehension check: paired ruling better against 2e06141 2026-10-22 21:38:41 +02:00
lilleman 2e0614101e Record the comprehension check: paired ruling better against 498e874 2026-10-14 22:49:13 +02:00
lilleman 498e874831 Record the comprehension check: ruling better, 3 of 4 seats 2026-10-14 21:10:41 +02:00
lilleman 696aca1c71 Record the comprehension check: ruling better, scoring run overall 5.88 2026-10-14 15:08:46 +02:00
lilleman 06739b40b7 Record the comprehension check: paired ruling worse against e193536, scoring run overall 5.88 2026-10-14 10:48:12 +02:00
lilleman e193536259 Record the comprehension check: paired ruling same against e0ead52 2026-10-14 01:17:39 +02:00
lilleman e0ead529bf Record the comprehension check: paired ruling same against 341280d 2026-10-14 00:26:19 +02:00
lilleman 341280d93c Rescore: the paired ruling at 3ba3a82 against 7caa823 reads better 2026-10-13 20:10:29 +02:00
lilleman d13a17565b Answer architecture round 3: 0 🔴, 0 🟡; an out-of-memory throw is engine-limit whatever the engine ran short of, the ruling reads same 2026-10-13 20:10:29 +02:00
lilleman a0fdfe377e Answer architecture round 2: 1 🔴, 1 🟡; the CommonMark ask answers yes or no, the memo's callers name themselves, the bound's policy reads at its constant, Firefox's bare out-of-memory string is engine-limit, and the floor entry no longer points at item 110 2026-10-13 20:10:29 +02:00
lilleman 563133f3ee Answer architecture round 1: 2 🔴, 5 🟡; readableBlock alone fills and reads the spelling memo, the escaper's steps hand on what they claim rather than write a shared buffer, engine-limit names only the throws an engine returns, and the docs agree on it 2026-10-13 20:10:29 +02:00
lilleman 7caa8237f0 Answer architecture round 6: each block is held to the bound as it is built, the reader's ask takes the engine guard, and the chunk ships under a worse comprehension ruling by the maintainer's call, with item 110 to fill the memo in one place 2026-10-13 01:30:12 +02:00
lilleman 6f518dab93 Answer architecture round 5: the builders keep main's spelling, each writer's result and the CommonMark ask's spelling are held to the bound once built, and the engines' own overflows refuse alike 2026-10-13 01:30:12 +02:00
lilleman a0bb09b80d Answer architecture round 4: the forecast and the indent leave, a writer refuses a document whose text alone passes the bound, and the joins are the one bound left 2026-10-13 01:30:12 +02:00
lilleman 7a27f6b81c Rescore: the paired ruling at 90de6cb reads better 2026-10-11 21:05:07 +02:00
lilleman edacef410f Answer architecture round 2: the overflow messages sort, and a stack overflow stays a throw by its stated reason 2026-10-11 21:05:07 +02:00
lilleman 4f00e60e6c Rescore: the paired ruling at 27c8f9b reads worse on Locality, shipped under the maintainer's decision, and the scoring run holds at a 6.13 mean 2026-10-11 13:31:18 +02:00
lilleman 7c42356a78 Answer architecture round 3: reduceMedia's link lookup shadows no name, and the comprehension history records the ruling and scoring run at be23835 2026-10-11 13:31:18 +02:00
lilleman fcc6640f6e Answer architecture round 2: a list definitions end joins a set of ended lists, which a named endList fills and openedList reads 2026-10-10 13:20:05 +02:00
lilleman c11aa917a5 Rescore: the paired ruling at 65d2a26 reads better 2026-10-09 19:17:20 +02:00
lilleman af9b0d082c Answer architecture round 2: the escape walk owns its escapes and names every token kind, a directive read takes the claimed prefix, the reader computes one end, imports sort, and item 96 covers unclosed backtick runs 2026-10-09 19:17:20 +02:00
lilleman a9fedb395b Rescore: the paired ruling at ca3d703 reads better 2026-10-09 15:39:13 +02:00
lilleman 49ec61709c Record the paired ruling: better 2026-10-09 15:39:13 +02:00
lilleman 875c0e5335 Rescore: the paired ruling at e487fa4 reads better 2026-10-09 14:37:06 +02:00
lilleman 3ad1bd504e Record the paired ruling: same 2026-10-09 14:37:06 +02:00
lilleman 310207fab5 Rescore: the paired ruling at 239218f reads the same 2026-10-09 12:21:18 +02:00
lilleman 7be5f70851 Rescore: the paired ruling at 37629e4 reads the same 2026-10-09 12:21:18 +02:00
lilleman 90de9ba7be Rescore: the paired ruling at f195ebd reads the same 2026-10-09 12:21:18 +02:00
lilleman b3f4d0f5c1 Rescore: the paired ruling at 45b5446 reads worse 2026-10-09 12:21:18 +02:00
lilleman e04f026676 Rescore: the paired ruling at 6f1a16b reads worse 2026-10-09 12:21:18 +02:00
lilleman 2ca5ac41e6 Answer architecture round 1: the node table says a hard break takes no marks, and a link text of hard breaks alone reads as its destination 2026-10-09 12:21:18 +02:00
lilleman 78655bcdc0 Rescore: the paired ruling at e7029c1 reads better 2026-10-09 10:49:08 +02:00
lilleman 38d2fa94e1 Rescore: the paired ruling at 1098b5e reads better 2026-10-09 10:49:08 +02:00
lilleman 029b835e22 Rescore: the paired ruling at c45320b reads better 2026-10-09 10:49:08 +02:00
lilleman 9a242c7206 Rescore: the paired ruling at 5fc877e reads better 2026-10-09 03:08:39 +02:00
lilleman 4d5f83459f Answer architecture round 1: the claims type pins what every writer spells, the HTML calls take flavour names, model-written GFM reads in portableMarkdownToAdf 2026-10-09 03:08:39 +02:00