Slice pending import encoding and reuse completed immutable plans

This commit is contained in:
2026-11-11 04:29:11 +08:00
parent 210bc14074
commit 5eabca5056
5 changed files with 48 additions and 5 deletions
+12 -1
View File
@@ -1005,7 +1005,8 @@ subtrees, first-time immutable normalization and individual scalar operations
remain synchronous. This is partial time slicing, not a strict whole-Root latency
bound. Grouped history entries now keep shape ownership for newly built changes and
operation-ID arrays, including undo/redo lifecycle remaps. Import runners keep it
for their own job envelopes, completed-key arrays and binding dictionaries; newly
for their own job envelopes, completed-key arrays, binding dictionaries and
pending locator tables; newly
allocated identity tables use the same private constructor. The engine's source
proof refresh preserves this envelope ownership. Arbitrary host checkpoint
replacements keep defensive capture. These constructors still freeze nested data
@@ -1125,3 +1126,13 @@ and is not a precise browser queue-time measurement. The final server document
must retain the original's later edits while the copy retains its earlier source
snapshot. Smaller scenarios retain the early burst because they can finish
before a later publication threshold is observed.
Pending import records remain bounded seekable locators, not decoded document
payloads. Runner-created locators, dependency arrays, parser appends and filtered
pending tables retain private shape ownership, so recovery encoding can slice
these waiting records even when endpoints have not arrived. Dependency admission,
capacity checks and durable send barriers are unchanged. The asynchronous encoder
also rechecks its immutable fact cache when assembling a prepared container:
when the same source occurs twice in one image, the second occurrence can reuse
the first completed encoding. Preparation still captures unsafe occurrences
independently; getters and mutable descendants never qualify for this reuse.