⚡ Bolt: [performance improvement] Optimize Array.includes to Set.has in voter filtering

.jules/bolt.md

@@ -9,3 +9,8 @@
 
 **Learning:** Using `on:keyup` for search input debouncing triggers unnecessary API calls on navigation keys (arrows, home, end) and misses changes from paste/cut. Svelte's reactive statements `$: debounce(value)` provide a robust, declarative way to trigger debouncing only when the value actually changes.
 **Action:** Replace `on:keyup` handlers with reactive statements for input debouncing to improve performance and correctness.
+
+## 2024-11-20 - Set.prototype.has over Array.prototype.includes
+
+**Learning:** Using `Array.prototype.includes` inside `Array.prototype.filter` or loop iterations over large datasets creates an O(N*M) time complexity, potentially blocking the main thread significantly.
+**Action:** Always precompute a `Set` before loop operations and replace O(N) `Array.includes` with O(1) `Set.has` to keep time complexity to O(N+M).

src/routes/api/proposals/voters/add/+server.ts

@@ -23,7 +23,10 @@ export async function GET() {
 			?.setValue()
 			.values.map((voter) => voter.addressValue().value.toString('hex')) ?? [];
 
-	const newVoters = owners.filter((owner) => !voters.includes(owner)).slice(0, 50);
+	// Performance optimization: Precompute a Set for O(1) lookups instead of O(N) Array.prototype.includes
+	// This reduces time complexity from O(N*M) to O(N+M)
+	const votersSet = new Set(voters);
+	const newVoters = owners.filter((owner) => !votersSet.has(owner)).slice(0, 50);
 	if (newVoters.length === 0) return json({ newVoters }, { status: 200 });
 
 	const votingContract = await metaNamesSdk.contractRepository.getContract({

src/routes/api/proposals/voters/remove/+server.ts

@@ -25,7 +25,10 @@ export async function GET() {
 			?.setValue()
 			.values.map((voter) => voter.addressValue().value.toString('hex')) ?? [];
 
-	const votersToRemove = voters.filter((voter) => !owners.includes(voter)).slice(0, 50);
+	// Performance optimization: Precompute a Set for O(1) lookups instead of O(N) Array.prototype.includes
+	// This reduces time complexity from O(N*M) to O(N+M)
+	const ownersSet = new Set(owners);
+	const votersToRemove = voters.filter((voter) => !ownersSet.has(voter)).slice(0, 50);
 	if (votersToRemove.length === 0) return json({ newVoters: votersToRemove }, { status: 200 });
 
 	const votingContract = await metaNamesSdk.contractRepository.getContract({