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

Answer architecture round 2: every builder joins its pieces through one bounded join, the readers take the engine guard, every refusal stands at the document's path, and a portable list's refusal names its own place

This commit is contained in:
2026-10-12 17:42:24 +02:00
parent 43c8d63860
commit 88c00d381d
25 changed files with 379 additions and 249 deletions
+1 -1
View File
@@ -86,7 +86,7 @@ export function textLength(node: AdfNode): number {
return node.text?.length ?? 0
}
// A line spells every character of its nodes' text at least once, so this much text cannot fit.
// The length of the text the nodes hold, the nodes below them included.
export function heldTextLength(nodes: readonly AdfNode[]): number {
let length = 0
const pending = [...nodes]