Closed
Conversation
- Cache min sizes when tree changes instead of recalculating on every pointer move (eliminates 4 recursive tree traversals per resize event) - Replace O(n) Array.find() rect lookup with O(1) Map lookup - Pre-compute and store these caches in buildRectMap() and buildMinSizeCache() which run once per structural change rather than 60-120 times/sec during drag This significantly reduces CPU overhead during panel resize operations.
Code reviewNo issues found. Checked for bugs and CLAUDE.md compliance. |
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
2 participants
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.
pointer move (eliminates 4 recursive tree traversals per resize event)
which run once per structural change rather than 60-120 times/sec during drag
This significantly reduces CPU overhead during panel resize operations.