Incremental re-parse: O(damage) edits, a 9MB keystroke in ~0.05ms, proven ≡ fresh#38

Merged

johnsoncodehk merged 15 commits into

Jun 10, 2026

Commits on Jun 10, 2026

Incremental re-parse v1: parseEdited() with memo carry-over and arena reuse
johnsoncodehk
committed
Windowed re-lexing: lex O(damage) with depth-recorded restart/resync (M1)
johnsoncodehk
committed
Depth-tolerant relex restart: reconstruct the live paren stack at the anchor
johnsoncodehk
committed
Green tree (M3): relative coordinates on parent edges; re-base loops vanish
johnsoncodehk
committed
Old-tree adoption (M4): reuse via cursor descent; the memo carry is gone
johnsoncodehk
committed
Generation-stamped persistent memo: the per-edit array churn dies
johnsoncodehk
committed
Edit protocol: parseEdited(source, entry, edits) skips the char-diff scans
johnsoncodehk
committed
Run-adoption: rep loops bulk-adopt old sibling runs; session paren-stack cache
johnsoncodehk
committed
Node surgery + EOF-relative spans: a 9MB keystroke re-parse in ~0.05ms
johnsoncodehk
committed
Pure-container ancestors get the end-relative kid band too
johnsoncodehk
committed
Handle API: explicit tree handles over per-document state; strict-< restart anchor
johnsoncodehk
committed
edit() mutates the handle in place and returns nothing; reject-safe contract
johnsoncodehk
committed
Remove toObject from the engine: visit + tree accessors are the only surface
johnsoncodehk
committed
edit() has ONE usage: the edit ranges are required
johnsoncodehk
committed
edit() takes changes, the engine owns the text as pieces: end-to-end O(damage)
johnsoncodehk
committed