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

Answer architecture round 2: a list definitions end joins a set of ended lists, which a named endList fills and openedList reads

This commit is contained in:
2026-10-10 11:17:59 +02:00
committed by Lillem4n
parent 7d00b11b2c
commit fcc6640f6e
3 changed files with 47 additions and 7 deletions
+1 -1
View File
@@ -355,7 +355,7 @@ quadratic in a run of blanks inside one leaf: a paragraph of `a`, 80 000 spaces,
Technical principle "One owner per value": the `Walk` record passes through twelve functions that
mutate it and return `void`; `walk.leaf` alone is written in seven places, and `openedList` reads
the `endedByDefinitions` that `closeLeaf` leaves. `ContainerStack` in the
the `endedLists` that `closeLeaf` fills. `ContainerStack` in the
same file shows the shape to follow. `inline-content.ts`'s `Scan` has the same shape: about fifteen
functions write `pending`, `pieces`, `deactivatedBefore` and `openingSpellableLink` and return
`void`, and `parseInlineContent` reads a flag `scanInline` leaves on it. The same shape recurs in