⚡ Bolt: Replace array allocations with direct Set insertions

[madara88645]

💡 What: Replaced .map().filter() array allocation chains with standard imperative for loops in utils/graphContext.js and utils/layout.js when constructing Sets from arrays of node IDs.
🎯 Why: In high-frequency operations or operations on large datasets, mapping and filtering arrays to populate a Set creates multiple intermediate arrays, leading to increased memory usage and triggering unnecessary garbage collection pauses.
📊 Impact: Eliminates O(N) intermediate array allocations during graph context and layout calculations, which improves performance on large graph data sets by directly adding elements to the Set.
🔬 Measurement: Verify tests run using pnpm test and run pnpm lint in explorer/. Inspect CPU profiles for reduced array allocations and garbage collection overhead during graph rendering and interactions.

---

PR created automatically by Jules for task 14866299277778367216 started by @madara88645

[google-labs-jules]

👋 Jules, reporting for duty! I'm here to lend a hand with this pull request.

When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down.

I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job!

For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with @jules. You can find this option in the Pull Request section of your global Jules UI settings. You can always switch back!

New to Jules? Learn more at jules.google/docs.

---

For security, I will only act on instructions from the user who triggered this task.

[vercel]

The latest updates on your projects. Learn more about Vercel for GitHub.

Project	Deployment	Actions	Updated (UTC)
vibegraph	Ready	Preview, Comment	Jun 29, 2026 11:07pm

[cursor]

PR Risk Assessment

Risk level: Very Low

Evidence (from diff only)

File	Change
explorer/src/utils/graphContext.js	Replaces .map().filter() chain with a for loop when building knownNodeIds Set
explorer/src/utils/layout.js	Replaces .map() with a for loop when building nodeIds Set
.jules/bolt.md	Learning-journal entry documenting the optimization

Assessment

• Scope: 3 files, ~21 lines added / 3 removed. Two frontend utility helpers; one internal learning journal.
• Behavior: Semantically equivalent — graphContext.js still skips falsy IDs (if (id) ≡ .filter(Boolean)); layout.js still collects all node IDs into a Set.
• Blast radius: Limited to graph layout and node-grounding helpers used by useGraphData, useNodeInteraction, and ChatDrawer. No API, auth, infra, or data-model changes.
• Complexity: Straightforward mechanical refactor; layout.js already has unit tests.
• Security / ops: No security-sensitive paths touched. No deployment or config changes.

Decision

Item	Result
Code review required?	No
Reviewers assigned	None (Very Low risk; 0 existing reviewers)
Approval	Approved

Very Low risk changes are safe to approve immediately per policy. No prior approval to revoke; no open automation threads.

---

Automated risk assessment by Cursor Automation

  

_{Sent by Cursor Automation: Assign PR reviewers}