fix: Math.min/max stack overflow in SQL executor, bigint precision in IN sets, empty partials guard

- SQL executor: replace Math.min/max spread with reduce (stack overflow on 65K+ values)
- decode.ts: keep bigint values as-is in IN/NOT_IN Set (was losing precision via Number())
- merge.ts: guard Math.max on empty partials array (returned -Infinity)
- vector-search docs: fix inaccurate claim about filter-before-search ordering

Author: teamchong

docs/src/content/docs/vector-search.mdx

@@ -83,4 +83,4 @@ const results = await qm
   .collect()
 ```
 
-Filters are applied before vector search — only matching rows are scanned for similarity.
+Vector search runs across all matching fragments. When combined with filters, both are applied during the scan phase — the query engine evaluates filter predicates and vector distances together to return filtered nearest neighbors.

src/decode.ts

@@ -480,12 +480,12 @@ export function matchesFilter(
     case "in": {
       if (!Array.isArray(t)) return false;
       const set = getInSet(t);
-      return set.has(typeof val === "bigint" ? Number(val) : val);
+      return set.has(val);
     }
     case "not_in": {
       if (!Array.isArray(t)) return false;
       const set = getInSet(t);
-      return !set.has(typeof val === "bigint" ? Number(val) : val);
+      return !set.has(val);
     }
     case "between": {
       if (!Array.isArray(t) || t.length !== 2) return false;
@@ -514,15 +514,12 @@ export function matchesFilter(
 }
 
 /** Cache IN/NOT_IN value sets — O(1) lookup instead of O(m) per row. */
-const inSetCache = new WeakMap<readonly (number | bigint | string)[], Set<number | string>>();
+const inSetCache = new WeakMap<readonly (number | bigint | string)[], Set<number | bigint | string>>();
 
-function getInSet(values: readonly (number | bigint | string)[]): Set<number | string> {
+function getInSet(values: readonly (number | bigint | string)[]): Set<number | bigint | string> {
   let cached = inSetCache.get(values);
   if (cached) return cached;
-  const set = new Set<number | string>();
-  for (const v of values) {
-    set.add(typeof v === "bigint" ? Number(v) : v);
-  }
+  const set = new Set<number | bigint | string>(values);
   inSetCache.set(values, set);
   return set;
 }

src/merge.ts

@@ -121,7 +121,7 @@ export function mergeQueryResults(
 ): QueryResult {
   const totalBytesRead = partials.reduce((s, p) => s + p.bytesRead, 0);
   const totalPagesSkipped = partials.reduce((s, p) => s + p.pagesSkipped, 0);
-  const maxDuration = Math.max(...partials.map((p) => p.durationMs));
+  const maxDuration = partials.length > 0 ? partials.reduce((m, p) => p.durationMs > m ? p.durationMs : m, 0) : 0;
   const columns =
     partials.length > 0 ? partials[0].columns : query.projections;
 

src/sql/executor.ts

@@ -202,8 +202,8 @@ function computeAgg(rows: Row[], agg: AggregateOp): number | bigint | string | b
   switch (agg.fn) {
     case "sum": return values.reduce((a, b) => a + b, 0);
     case "avg": return values.reduce((a, b) => a + b, 0) / values.length;
-    case "min": return Math.min(...values);
-    case "max": return Math.max(...values);
+    case "min": return values.reduce((a, b) => a < b ? a : b);
+    case "max": return values.reduce((a, b) => a > b ? a : b);
     case "stddev": {
       const mean = values.reduce((a, b) => a + b, 0) / values.length;
       const sq = values.reduce((a, b) => a + (b - mean) ** 2, 0) / values.length;