Optimize intersection function with Set for O(N+M) performance

google-labs-jules[bot] · jaruesink · google-labs-jules[bot] · commit 094d9f7a70fd · 2026-02-06T13:40:14.000Z
Co-authored-by: jaruesink &lt;4207065+jaruesink@users.noreply.github.com&gt;
diff --git a/packages/components/src/ui/data-table-filter/lib/array.ts b/packages/components/src/ui/data-table-filter/lib/array.ts
@@ -1,5 +1,6 @@
 export function intersection<T>(a: T[], b: T[]): T[] {
-  return a.filter((x) => b.includes(x));
+  const set = new Set(b);
+  return a.filter((x) => set.has(x));
 }
 
 /**

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,6 @@`
`1`	`1`	`export function intersection<T>(a: T[], b: T[]): T[] {`
`2`		`- return a.filter((x) => b.includes(x));`
	`2`	`+ const set = new Set(b);`
	`3`	`+ return a.filter((x) => set.has(x));`
`3`	`4`	`}`
`4`	`5`
`5`	`6`	`/**`