perf: index core data structures and reclaim dynamic storage - #17
Open
Eric-Song-Nop wants to merge 48 commits into
Open
perf: index core data structures and reclaim dynamic storage#17Eric-Song-Nop wants to merge 48 commits into
Eric-Song-Nop wants to merge 48 commits into
Conversation
Eric-Song-Nop
marked this pull request as ready for review
September 10, 2026 19:38
This was referenced Sep 10, 2026
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Map/Set lookups copied and scanned whole record tables, and dynamic property, module and compiler operations repeatedly copied or searched entire layouts. This PR introduces indexed lookup, compact live storage and focused fast paths while preserving observable ordering, ownership, exceptions and QuickJS compatibility.
Stacked on #15 (
perf/batch-builtin-initialization); addresses #16. The implementation is split into small commits, with the completed plan and maintenance entry points in the completed plan and maintenance guide.Validation on final engine fingerprint
b61a54ac6ff4469d1223fba670782e8a49ac9a3b612a810037748ff70c46e568:docs/reports/data-structure-*-final.*.Tradeoffs remain explicit: collection ordering uses BTreeSet O(log n), with intermediate ordinary-operation regressions retained in its report; dictionary metadata has a space cost. Borrowed arguments measure essentially flat and do not introduce a frame pool. No local/TDZ/publication checks were removed. Both Oxide versions still time out at 90 seconds in the original combined adaptive V8 harness, so those runs supply no comparison score. Structural reclamation tests do not establish lower whole-application RSS.