@rocicorp/zero 1.6.0-canary.12 → 1.6.0-canary.13

package/out/zqlite/src/sqlite-stat-fanout.js.map

@@ -1 +1 @@
-{"version":3,"file":"sqlite-stat-fanout.js","names":["#db","#defaultFanout","#cache","#stat4Stmt","#stat1Stmt","#indexStmt","#getFanoutFromStat4","#getFanoutFromStat1","#findIndexForColumns","#decodeSampleIsNull","#isPrefixMatch"],"sources":["../../../../zqlite/src/sqlite-stat-fanout.ts"],"sourcesContent":["import type {Database} from './db.ts';\n\n/**\n * Result of fanout calculation from SQLite statistics.\n */\nexport interface FanoutResult {\n  /**\n   * The fanout value (average rows per distinct value of the join column).\n   * For non-NULL joins, this represents how many child rows exist per parent key.\n   */\n  fanout: number;\n  confidence: 'high' | 'med' | 'none';\n\n  /**\n   * Source of the fanout calculation.\n   * - 'stat4': From sqlite_stat4 histogram (most accurate, excludes NULLs)\n   * - 'stat1': From sqlite_stat1 average (includes NULLs, may overestimate)\n   * - 'default': Fallback constant when statistics unavailable\n   */\n  source: 'stat4' | 'stat1' | 'default';\n}\n\n/**\n * Sample from sqlite_stat4 histogram.\n */\ninterface Stat4Sample {\n  /** \"N1 N2\" = rows equal to sample (N1=first col, N2=if composite) */\n  neq: string;\n  /** \"N1 N2\" = rows less than sample */\n  nlt: string;\n  /** \"N1 N2\" = distinct values less than sample */\n  ndlt: string;\n  /** The actual sample value (binary encoded) */\n  sample: Buffer;\n}\n\n/**\n * Computes join fanout factors from SQLite statistics tables.\n *\n * Fanout is the average number of child rows per distinct parent key value,\n * used to estimate join cardinality in query planning.\n *\n * ## Problem\n *\n * sqlite_stat1 includes NULL rows in its calculation, which can significantly\n * overestimate fanout for sparse foreign keys:\n *\n * ```\n * Example: 100 tasks, 20 with project_id, 80 with NULL\n * - stat1 reports: \"100 17\" → fanout = 17 (WRONG - includes NULLs)\n * - stat4 shows: NULL samples with fanout=80, non-NULL samples with fanout=4\n * - True fanout: 4 (CORRECT)\n * ```\n *\n * ## Solution\n *\n * This class uses sqlite_stat4 histogram to separate NULL and non-NULL samples,\n * providing accurate fanout for non-NULL joins.\n *\n * ## Usage\n *\n * ```typescript\n * const calculator = new SQLiteStatFanout(db);\n *\n * // Get fanout for posts.userId → users.id join\n * const result = calculator.getFanout('posts', 'userId');\n *\n * if (result.source === 'stat4') {\n *   // Accurate: excludes NULLs, samples actual distribution\n *   console.log(`Fanout: ${result.fanout} (from stat4)`);\n * } else if (result.source === 'stat1') {\n *   // Conservative: includes NULLs, may overestimate\n *   console.log(`Fanout: ${result.fanout} (from stat1, includes NULLs)`);\n * } else {\n *   // Fallback: no statistics available\n *   console.log(`Fanout: ${result.fanout} (default estimate)`);\n * }\n * ```\n *\n * ## Requirements\n *\n * - SQLite compiled with ENABLE_STAT4 (most builds include this)\n * - `ANALYZE` command run on the database\n * - Index exists on the join column\n *\n * @see https://sqlite.org/fileformat2.html#stat4tab\n * @see packages/zql/src/planner/SELECTIVITY_PLAN.md\n */\nexport class SQLiteStatFanout {\n  readonly #db: Database;\n  readonly #defaultFanout: number;\n\n  /**\n   * Cache of fanout results by table and columns.\n   * Key format: \"tableName:col1,col2,col3\" (sorted alphabetically)\n   */\n  readonly #cache = new Map<string, FanoutResult>();\n\n  /**\n   * Prepared statements for querying SQLite statistics tables.\n   * Prepared once in constructor for performance.\n   */\n  readonly #stat4Stmt: ReturnType<Database['prepare']>;\n  readonly #stat1Stmt: ReturnType<Database['prepare']>;\n  readonly #indexStmt: ReturnType<Database['prepare']>;\n\n  /**\n   * Creates a new fanout calculator.\n   *\n   * @param db Database instance\n   * @param defaultFanout Default fanout when statistics unavailable (default: 3)\n   *                      - 1: Conservative (assumes FK relationships)\n   *                      - 3: Moderate (recommended, safe middle ground)\n   *                      - 10: SQLite's default (optimistic)\n   */\n  constructor(db: Database, defaultFanout = 3) {\n    this.#db = db;\n    this.#defaultFanout = defaultFanout;\n\n    // Prepare SQL statements once for reuse across multiple getFanout() calls\n    this.#stat4Stmt = this.#db.prepare(`\n      SELECT neq, nlt, ndlt, sample\n      FROM sqlite_stat4\n      WHERE tbl = ? AND idx = ?\n      ORDER BY nlt\n    `);\n\n    this.#stat1Stmt = this.#db.prepare(`\n      SELECT stat\n      FROM sqlite_stat1\n      WHERE tbl = ? AND idx = ?\n    `);\n\n    this.#indexStmt = this.#db.prepare(`\n      SELECT il.name as index_name, ii.seqno, ii.name as column_name\n      FROM pragma_index_list(?) il\n      JOIN pragma_index_info(il.name) ii\n      ORDER BY il.seq, ii.seqno\n    `);\n  }\n\n  /**\n   * Gets the fanout factor for join column(s).\n   *\n   * Fanout = average number of child rows per distinct parent key value(s).\n   *\n   * ## Strategy\n   *\n   * 1. Try sqlite_stat4 (best): Histogram with separate NULL/non-NULL samples\n   * 2. Fallback to sqlite_stat1: Average across all rows (includes NULLs)\n   * 3. Fallback to default: When no statistics available\n   *\n   * ## Compound Indexes\n   *\n   * For multi-column joins, finds indexes where ALL columns appear as an\n   * exact prefix. Uses the appropriate depth in stat1/stat4.\n   *\n   * Example:\n   * - Columns: `['customerId', 'storeId']`\n   * - Matches index: `(customerId, storeId, date)` at depth 2\n   * - Uses stat1 parts[2] or stat4 neq[1] for accurate fanout\n   *\n   * ## Caching\n   *\n   * Results are cached per (table, columns) combination. Clear the cache if\n   * you run ANALYZE to update statistics.\n   *\n   * @param tableName Table containing the join column(s)\n   * @param columns Array of column names (one or more columns)\n   * @returns Fanout result with value and source\n   */\n  getFanout(tableName: string, columns: string[]): FanoutResult {\n    // Cache key uses sorted columns for consistency\n    const cacheKey = `${tableName}:${columns.toSorted().join(',')}`;\n    const cached = this.#cache.get(cacheKey);\n    if (cached) {\n      return cached;\n    }\n\n    // Strategy 1: Try stat4 first (most accurate)\n    // NOTE: columns are NOT sorted - preserves Object.keys() order from constraint\n    // Matching is order-independent (flexible), but we keep original order for consistency\n    const stat4Result = this.#getFanoutFromStat4(tableName, columns);\n    if (stat4Result) {\n      this.#cache.set(cacheKey, stat4Result);\n      return stat4Result;\n    }\n\n    // Strategy 2: Fallback to stat1 (includes NULLs)\n    const stat1Result = this.#getFanoutFromStat1(tableName, columns);\n    if (stat1Result) {\n      this.#cache.set(cacheKey, stat1Result);\n      return stat1Result;\n    }\n\n    // Strategy 3: Use default\n    const defaultResult: FanoutResult = {\n      fanout: this.#defaultFanout,\n      confidence: 'none',\n      source: 'default',\n    };\n    this.#cache.set(cacheKey, defaultResult);\n    return defaultResult;\n  }\n\n  /**\n   * Clears the fanout cache.\n   * Call this after running ANALYZE to pick up updated statistics.\n   */\n  clearCache(): void {\n    this.#cache.clear();\n  }\n\n  /**\n   * Gets fanout from sqlite_stat4 histogram.\n   *\n   * Queries stat4 samples, decodes to identify NULLs, and returns\n   * the median fanout of non-NULL samples.\n   *\n   * For compound indexes, uses the neq value at the appropriate depth.\n   *\n   * @param columns Array of column names to get fanout for\n   * @returns Fanout result or undefined if stat4 unavailable\n   */\n  #getFanoutFromStat4(\n    tableName: string,\n    columns: string[],\n  ): FanoutResult | undefined {\n    try {\n      // Find index containing the columns as a prefix\n      const indexInfo = this.#findIndexForColumns(tableName, columns);\n      if (!indexInfo) {\n        return undefined;\n      }\n\n      // Query stat4 samples for this index (using prepared statement)\n      const samples = this.#stat4Stmt.all(\n        tableName,\n        indexInfo.indexName,\n      ) as Stat4Sample[];\n\n      if (samples.length === 0) {\n        return undefined;\n      }\n\n      // Decode samples and separate NULL from non-NULL\n      // Use depth-1 for neq array index (depth is 1-based, array is 0-based)\n      const neqIndex = indexInfo.depth - 1;\n      const decodedSamples = samples.map(s => {\n        const neqParts = s.neq.split(' ');\n        return {\n          fanout: parseInt(neqParts[neqIndex] ?? neqParts[0], 10),\n          isNull: this.#decodeSampleIsNull(s.sample),\n        };\n      });\n\n      const nonNullSamples = decodedSamples.filter(s => !s.isNull);\n\n      if (nonNullSamples.length === 0) {\n        // All samples are NULL - return fanout of 0 since NULLs don't match in joins\n        return {\n          fanout: 0,\n          source: 'stat4',\n          confidence: 'high',\n        };\n      }\n\n      // Use median of non-NULL fanouts (more robust than average)\n      const fanouts = nonNullSamples.map(s => s.fanout).sort((a, b) => a - b);\n      const medianFanout =\n        fanouts.length % 2 === 0\n          ? Math.floor(\n              (fanouts[fanouts.length / 2 - 1] + fanouts[fanouts.length / 2]) /\n                2,\n            )\n          : fanouts[Math.floor(fanouts.length / 2)];\n\n      return {\n        fanout: medianFanout,\n        source: 'stat4',\n        confidence: 'high',\n      };\n    } catch {\n      // stat4 table may not exist or query may fail\n      return undefined;\n    }\n  }\n\n  /**\n   * Gets fanout from sqlite_stat1 average.\n   *\n   * Note: This includes NULL rows in the calculation and may overestimate\n   * fanout for sparse foreign keys.\n   *\n   * For compound indexes, uses the stat value at the appropriate depth.\n   *\n   * @param columns Array of column names to get fanout for\n   * @returns Fanout result or undefined if stat1 unavailable\n   */\n  #getFanoutFromStat1(\n    tableName: string,\n    columns: string[],\n  ): FanoutResult | undefined {\n    try {\n      // Find index containing the columns as a prefix\n      const indexInfo = this.#findIndexForColumns(tableName, columns);\n      if (!indexInfo) {\n        return undefined;\n      }\n\n      // Query stat1 for this index (using prepared statement)\n      const result = this.#stat1Stmt.get(tableName, indexInfo.indexName) as\n        | {stat: string}\n        | undefined;\n\n      if (!result) {\n        return undefined;\n      }\n\n      const parts = result.stat.split(' ');\n      // Check if we have enough parts for the requested depth\n      if (parts.length < indexInfo.depth + 1) {\n        return undefined;\n      }\n\n      const fanout = parseInt(parts[indexInfo.depth], 10);\n      if (isNaN(fanout)) {\n        return undefined;\n      }\n\n      return {\n        fanout,\n        source: 'stat1',\n        confidence: 'med',\n      };\n    } catch {\n      return undefined;\n    }\n  }\n\n  /**\n   * Finds an index that can be used to get statistics for column(s).\n   *\n   * Uses pragma_index_list and pragma_index_info to reliably get index\n   * column names, avoiding brittle SQL parsing. Includes all indices:\n   * user-created (CREATE INDEX), PRIMARY KEY, and UNIQUE constraints.\n   *\n   * Uses flexible matching: Finds indexes where ALL columns appear in the\n   * first N positions, regardless of order. This works because SQLite statistics\n   * at depth N represent the fanout for the combination of the first N columns,\n   * and combinations are order-independent.\n   *\n   * Example:\n   * - columns: ['customerId', 'storeId']\n   * - Matches: (customerId, storeId, date) at depth 2 ✅\n   * - Matches: (storeId, customerId, date) at depth 2 ✅ (flexible order)\n   * - Does NOT match: (date, customerId, storeId) ❌ (columns not in first 2 positions)\n   * - Does NOT match: (customerId, date, storeId) ❌ (storeId not in first 2 positions)\n   *\n   * @param columns Array of column names (order-independent for matching)\n   * @returns Index info with name and depth, or undefined if no match\n   */\n  #findIndexForColumns(\n    tableName: string,\n    columns: string[],\n  ): {indexName: string; depth: number} | undefined {\n    try {\n      // Query returns all columns for all indexes (including PK/UNIQUE) in order\n      const rows = this.#indexStmt.all(tableName) as {\n        index_name: string;\n        seqno: number;\n        column_name: string;\n      }[];\n\n      // Group by index name\n      const indexMap = new Map<string, string[]>();\n      for (const row of rows) {\n        const cols = indexMap.get(row.index_name) ?? [];\n        cols.push(row.column_name);\n        indexMap.set(row.index_name, cols);\n      }\n\n      // Check each index for prefix match\n      for (const [indexName, indexColumns] of indexMap) {\n        if (this.#isPrefixMatch(columns, indexColumns)) {\n          return {\n            indexName,\n            depth: columns.length,\n          };\n        }\n      }\n\n      return undefined;\n    } catch {\n      return undefined;\n    }\n  }\n\n  /**\n   * Checks if all queryColumns exist in the first N positions of indexColumns,\n   * regardless of order.\n   *\n   * This allows flexible matching: constraint {a, b} matches both index (a, b, c)\n   * and index (b, a, c) at depth 2, since both represent the fanout for the\n   * combination of columns a and b.\n   *\n   * Gaps are NOT allowed: constraint {a, c} does NOT match index (a, b, c)\n   * because no depth represents just (a, c) without b. Statistics are cumulative\n   * from position 0.\n   *\n   * @param queryColumns Columns we're looking for (from constraint)\n   * @param indexColumns Columns in the index (in order)\n   * @returns true if all queryColumns exist in indexColumns[0...queryColumns.length-1]\n   */\n  #isPrefixMatch(queryColumns: string[], indexColumns: string[]): boolean {\n    if (queryColumns.length > indexColumns.length) {\n      return false;\n    }\n\n    // Get the prefix of the index that we're checking against\n    const indexPrefix = indexColumns.slice(0, queryColumns.length);\n\n    // Normalize to lowercase for case-insensitive comparison\n    const indexPrefixLower = new Set(indexPrefix.map(col => col.toLowerCase()));\n    const queryColumnsLower = queryColumns.map(col => col.toLowerCase());\n\n    // Check if ALL query columns exist in the index prefix\n    return queryColumnsLower.every(queryCol => indexPrefixLower.has(queryCol));\n  }\n\n  /**\n   * Decodes a sqlite_stat4 sample value to check if it's NULL.\n   *\n   * SQLite record format (simplified):\n   * - Varint: header size\n   * - Serial types for each column (one byte each typically)\n   * - Actual data\n   *\n   * Serial type 0 = NULL\n   * Serial type 1 = 8-bit int\n   * Serial type 2 = 16-bit int\n   * Serial type 3 = 24-bit int\n   * etc.\n   *\n   * We only need to check the first column's serial type.\n   *\n   * @param sample Binary-encoded sample from stat4\n   * @returns true if the sample value is NULL\n   */\n  #decodeSampleIsNull(sample: Buffer): boolean {\n    if (sample.length === 0) {\n      return true;\n    }\n\n    // Read header size (varint - simplified: assume single byte)\n    const headerSize = sample[0];\n\n    if (headerSize === 0 || headerSize >= sample.length) {\n      return true;\n    }\n\n    // Read first serial type (at position 1)\n    const serialType = sample[1];\n\n    // Serial type 0 = NULL\n    return serialType === 0;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwFA,IAAa,mBAAb,MAA8B;CAC5B;CACA;;;;;CAMA,yBAAkB,IAAI,IAA0B;;;;;CAMhD;CACA;CACA;;;;;;;;;;CAWA,YAAY,IAAc,gBAAgB,GAAG;EAC3C,KAAKA,MAAM;EACX,KAAKC,iBAAiB;EAGtB,KAAKE,aAAa,KAAKH,IAAI,QAAQ;;;;;KAKlC;EAED,KAAKI,aAAa,KAAKJ,IAAI,QAAQ;;;;KAIlC;EAED,KAAKK,aAAa,KAAKL,IAAI,QAAQ;;;;;KAKlC;CACH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAgCA,UAAU,WAAmB,SAAiC;EAE5D,MAAM,WAAW,GAAG,UAAU,GAAG,QAAQ,SAAS,EAAE,KAAK,GAAG;EAC5D,MAAM,SAAS,KAAKE,OAAO,IAAI,QAAQ;EACvC,IAAI,QACF,OAAO;EAMT,MAAM,cAAc,KAAKI,oBAAoB,WAAW,OAAO;EAC/D,IAAI,aAAa;GACf,KAAKJ,OAAO,IAAI,UAAU,WAAW;GACrC,OAAO;EACT;EAGA,MAAM,cAAc,KAAKK,oBAAoB,WAAW,OAAO;EAC/D,IAAI,aAAa;GACf,KAAKL,OAAO,IAAI,UAAU,WAAW;GACrC,OAAO;EACT;EAGA,MAAM,gBAA8B;GAClC,QAAQ,KAAKD;GACb,YAAY;GACZ,QAAQ;EACV;EACA,KAAKC,OAAO,IAAI,UAAU,aAAa;EACvC,OAAO;CACT;;;;;CAMA,aAAmB;EACjB,KAAKA,OAAO,MAAM;CACpB;;;;;;;;;;;;CAaA,oBACE,WACA,SAC0B;EAC1B,IAAI;GAEF,MAAM,YAAY,KAAKM,qBAAqB,WAAW,OAAO;GAC9D,IAAI,CAAC,WACH;GAIF,MAAM,UAAU,KAAKL,WAAW,IAC9B,WACA,UAAU,SACZ;GAEA,IAAI,QAAQ,WAAW,GACrB;GAKF,MAAM,WAAW,UAAU,QAAQ;GASnC,MAAM,iBARiB,QAAQ,KAAI,MAAK;IACtC,MAAM,WAAW,EAAE,IAAI,MAAM,GAAG;IAChC,OAAO;KACL,QAAQ,SAAS,SAAS,aAAa,SAAS,IAAI,EAAE;KACtD,QAAQ,KAAKM,oBAAoB,EAAE,MAAM;IAC3C;GACF,CAEuB,EAAe,QAAO,MAAK,CAAC,EAAE,MAAM;GAE3D,IAAI,eAAe,WAAW,GAE5B,OAAO;IACL,QAAQ;IACR,QAAQ;IACR,YAAY;GACd;GAIF,MAAM,UAAU,eAAe,KAAI,MAAK,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;GAStE,OAAO;IACL,QARA,QAAQ,SAAS,MAAM,IACnB,KAAK,OACF,QAAQ,QAAQ,SAAS,IAAI,KAAK,QAAQ,QAAQ,SAAS,MAC1D,CACJ,IACA,QAAQ,KAAK,MAAM,QAAQ,SAAS,CAAC;IAIzC,QAAQ;IACR,YAAY;GACd;EACF,QAAQ;GAEN;EACF;CACF;;;;;;;;;;;;CAaA,oBACE,WACA,SAC0B;EAC1B,IAAI;GAEF,MAAM,YAAY,KAAKD,qBAAqB,WAAW,OAAO;GAC9D,IAAI,CAAC,WACH;GAIF,MAAM,SAAS,KAAKJ,WAAW,IAAI,WAAW,UAAU,SAAS;GAIjE,IAAI,CAAC,QACH;GAGF,MAAM,QAAQ,OAAO,KAAK,MAAM,GAAG;GAEnC,IAAI,MAAM,SAAS,UAAU,QAAQ,GACnC;GAGF,MAAM,SAAS,SAAS,MAAM,UAAU,QAAQ,EAAE;GAClD,IAAI,MAAM,MAAM,GACd;GAGF,OAAO;IACL;IACA,QAAQ;IACR,YAAY;GACd;EACF,QAAQ;GACN;EACF;CACF;;;;;;;;;;;;;;;;;;;;;;;CAwBA,qBACE,WACA,SACgD;EAChD,IAAI;GAEF,MAAM,OAAO,KAAKC,WAAW,IAAI,SAAS;GAO1C,MAAM,2BAAW,IAAI,IAAsB;GAC3C,KAAK,MAAM,OAAO,MAAM;IACtB,MAAM,OAAO,SAAS,IAAI,IAAI,UAAU,KAAK,CAAC;IAC9C,KAAK,KAAK,IAAI,WAAW;IACzB,SAAS,IAAI,IAAI,YAAY,IAAI;GACnC;GAGA,KAAK,MAAM,CAAC,WAAW,iBAAiB,UACtC,IAAI,KAAKK,eAAe,SAAS,YAAY,GAC3C,OAAO;IACL;IACA,OAAO,QAAQ;GACjB;GAIJ;EACF,QAAQ;GACN;EACF;CACF;;;;;;;;;;;;;;;;;CAkBA,eAAe,cAAwB,cAAiC;EACtE,IAAI,aAAa,SAAS,aAAa,QACrC,OAAO;EAIT,MAAM,cAAc,aAAa,MAAM,GAAG,aAAa,MAAM;EAG7D,MAAM,mBAAmB,IAAI,IAAI,YAAY,KAAI,QAAO,IAAI,YAAY,CAAC,CAAC;EAI1E,OAH0B,aAAa,KAAI,QAAO,IAAI,YAAY,CAG3D,EAAkB,OAAM,aAAY,iBAAiB,IAAI,QAAQ,CAAC;CAC3E;;;;;;;;;;;;;;;;;;;;CAqBA,oBAAoB,QAAyB;EAC3C,IAAI,OAAO,WAAW,GACpB,OAAO;EAIT,MAAM,aAAa,OAAO;EAE1B,IAAI,eAAe,KAAK,cAAc,OAAO,QAC3C,OAAO;EAOT,OAHmB,OAAO,OAGJ;CACxB;AACF"}
+{"version":3,"file":"sqlite-stat-fanout.js","names":["#db","#defaultFanout","#cache","#stat4Stmt","#stat1Stmt","#indexStmt","#getFanoutFromStat4","#getFanoutFromStat1","#findIndexForColumns","#decodeSampleIsNull","#isPrefixMatch"],"sources":["../../../../zqlite/src/sqlite-stat-fanout.ts"],"sourcesContent":["import type {Database} from './db.ts';\n\n/**\n * Result of fanout calculation from SQLite statistics.\n */\nexport interface FanoutResult {\n  /**\n   * The fanout value (average rows per distinct value of the join column).\n   * For non-NULL joins, this represents how many child rows exist per parent key.\n   */\n  fanout: number;\n  confidence: 'high' | 'med' | 'none';\n\n  /**\n   * Source of the fanout calculation.\n   * - 'stat4': From sqlite_stat4 histogram (most accurate, excludes NULLs)\n   * - 'stat1': From sqlite_stat1 average (includes NULLs, may overestimate)\n   * - 'default': Fallback constant when statistics unavailable\n   */\n  source: 'stat4' | 'stat1' | 'default';\n}\n\n/**\n * Sample from sqlite_stat4 histogram.\n */\ninterface Stat4Sample {\n  /** \"N1 N2\" = rows equal to sample (N1=first col, N2=if composite) */\n  neq: string;\n  /** \"N1 N2\" = rows less than sample */\n  nlt: string;\n  /** \"N1 N2\" = distinct values less than sample */\n  ndlt: string;\n  /** The actual sample value (binary encoded) */\n  sample: Buffer;\n}\n\n/**\n * Computes join fanout factors from SQLite statistics tables.\n *\n * Fanout is the average number of child rows per distinct parent key value,\n * used to estimate join cardinality in query planning.\n *\n * ## Problem\n *\n * sqlite_stat1 includes NULL rows in its calculation, which can significantly\n * overestimate fanout for sparse foreign keys:\n *\n * ```\n * Example: 100 tasks, 20 with project_id, 80 with NULL\n * - stat1 reports: \"100 17\" → fanout = 17 (WRONG - includes NULLs)\n * - stat4 shows: NULL samples with fanout=80, non-NULL samples with fanout=4\n * - True fanout: 4 (CORRECT)\n * ```\n *\n * ## Solution\n *\n * This class uses sqlite_stat4 histogram to separate NULL and non-NULL samples,\n * providing accurate fanout for non-NULL joins.\n *\n * ## Usage\n *\n * ```typescript\n * const calculator = new SQLiteStatFanout(db);\n *\n * // Get fanout for posts.userId → users.id join\n * const result = calculator.getFanout('posts', 'userId');\n *\n * if (result.source === 'stat4') {\n *   // Accurate: excludes NULLs, samples actual distribution\n *   console.log(`Fanout: ${result.fanout} (from stat4)`);\n * } else if (result.source === 'stat1') {\n *   // Conservative: includes NULLs, may overestimate\n *   console.log(`Fanout: ${result.fanout} (from stat1, includes NULLs)`);\n * } else {\n *   // Fallback: no statistics available\n *   console.log(`Fanout: ${result.fanout} (default estimate)`);\n * }\n * ```\n *\n * ## Requirements\n *\n * - SQLite compiled with ENABLE_STAT4 (most builds include this)\n * - `ANALYZE` command run on the database\n * - Index exists on the join column\n *\n * @see https://sqlite.org/fileformat2.html#stat4tab\n * @see packages/zql/src/planner/SELECTIVITY_PLAN.md\n */\nexport class SQLiteStatFanout {\n  readonly #db: Database;\n  readonly #defaultFanout: number;\n\n  /**\n   * Cache of fanout results by table and columns.\n   * Key format: \"tableName:col1,col2,col3\" (sorted alphabetically)\n   */\n  readonly #cache = new Map<string, FanoutResult>();\n\n  /**\n   * Prepared statements for querying SQLite statistics tables.\n   * Prepared once in constructor for performance.\n   */\n  readonly #stat4Stmt: ReturnType<Database['prepare']>;\n  readonly #stat1Stmt: ReturnType<Database['prepare']>;\n  readonly #indexStmt: ReturnType<Database['prepare']>;\n\n  /**\n   * Creates a new fanout calculator.\n   *\n   * @param db Database instance\n   * @param defaultFanout Default fanout when statistics unavailable (default: 3)\n   *                      - 1: Conservative (assumes FK relationships)\n   *                      - 3: Moderate (recommended, safe middle ground)\n   *                      - 10: SQLite's default (optimistic)\n   */\n  constructor(db: Database, defaultFanout = 3) {\n    this.#db = db;\n    this.#defaultFanout = defaultFanout;\n\n    // Prepare SQL statements once for reuse across multiple getFanout() calls\n    this.#stat4Stmt = this.#db.prepare(`\n      SELECT neq, nlt, ndlt, sample\n      FROM sqlite_stat4\n      WHERE tbl = ? AND idx = ?\n      ORDER BY nlt\n    `);\n\n    this.#stat1Stmt = this.#db.prepare(`\n      SELECT stat\n      FROM sqlite_stat1\n      WHERE tbl = ? AND idx = ?\n    `);\n\n    this.#indexStmt = this.#db.prepare(`\n      SELECT il.name as index_name, ii.seqno, ii.name as column_name\n      FROM pragma_index_list(?) il\n      JOIN pragma_index_info(il.name) ii\n      ORDER BY il.seq, ii.seqno\n    `);\n  }\n\n  /**\n   * Gets the fanout factor for join column(s).\n   *\n   * Fanout = average number of child rows per distinct parent key value(s).\n   *\n   * ## Strategy\n   *\n   * 1. Try sqlite_stat4 (best): Histogram with separate NULL/non-NULL samples\n   * 2. Fallback to sqlite_stat1: Average across all rows (includes NULLs)\n   * 3. Fallback to default: When no statistics available\n   *\n   * ## Compound Indexes\n   *\n   * For multi-column joins, finds indexes where ALL columns appear as an\n   * exact prefix. Uses the appropriate depth in stat1/stat4.\n   *\n   * Example:\n   * - Columns: `['customerId', 'storeId']`\n   * - Matches index: `(customerId, storeId, date)` at depth 2\n   * - Uses stat1 parts[2] or stat4 neq[1] for accurate fanout\n   *\n   * ## Caching\n   *\n   * Results are cached per (table, columns) combination. Clear the cache if\n   * you run ANALYZE to update statistics.\n   *\n   * @param tableName Table containing the join column(s)\n   * @param columns Array of column names (one or more columns)\n   * @returns Fanout result with value and source\n   */\n  getFanout(tableName: string, columns: string[]): FanoutResult {\n    // Cache key uses sorted columns for consistency\n    const cacheKey = `${tableName}:${columns.toSorted().join(',')}`;\n    const cached = this.#cache.get(cacheKey);\n    if (cached) {\n      return cached;\n    }\n\n    // Strategy 1: Try stat4 first (most accurate)\n    // NOTE: columns are NOT sorted - preserves Object.keys() order from constraint\n    // Matching is order-independent (flexible), but we keep original order for consistency\n    const stat4Result = this.#getFanoutFromStat4(tableName, columns);\n    if (stat4Result) {\n      this.#cache.set(cacheKey, stat4Result);\n      return stat4Result;\n    }\n\n    // Strategy 2: Fallback to stat1 (includes NULLs)\n    const stat1Result = this.#getFanoutFromStat1(tableName, columns);\n    if (stat1Result) {\n      this.#cache.set(cacheKey, stat1Result);\n      return stat1Result;\n    }\n\n    // Strategy 3: Use default\n    const defaultResult: FanoutResult = {\n      fanout: this.#defaultFanout,\n      confidence: 'none',\n      source: 'default',\n    };\n    this.#cache.set(cacheKey, defaultResult);\n    return defaultResult;\n  }\n\n  /**\n   * Clears the fanout cache.\n   * Call this after running ANALYZE to pick up updated statistics.\n   */\n  clearCache(): void {\n    this.#cache.clear();\n  }\n\n  /**\n   * Gets fanout from sqlite_stat4 histogram.\n   *\n   * Queries stat4 samples, decodes to identify NULLs, and returns\n   * the median fanout of non-NULL samples.\n   *\n   * For compound indexes, uses the neq value at the appropriate depth.\n   *\n   * @param columns Array of column names to get fanout for\n   * @returns Fanout result or undefined if stat4 unavailable\n   */\n  #getFanoutFromStat4(\n    tableName: string,\n    columns: string[],\n  ): FanoutResult | undefined {\n    try {\n      // Find index containing the columns as a prefix\n      const indexInfo = this.#findIndexForColumns(tableName, columns);\n      if (!indexInfo) {\n        return undefined;\n      }\n\n      // Query stat4 samples for this index (using prepared statement)\n      const samples = this.#stat4Stmt.all(\n        tableName,\n        indexInfo.indexName,\n      ) as Stat4Sample[];\n\n      if (samples.length === 0) {\n        return undefined;\n      }\n\n      // Decode samples and separate NULL from non-NULL\n      // Use depth-1 for neq array index (depth is 1-based, array is 0-based)\n      const neqIndex = indexInfo.depth - 1;\n      const decodedSamples = samples.map(s => {\n        const neqParts = s.neq.split(' ');\n        return {\n          fanout: parseInt(neqParts[neqIndex] ?? neqParts[0], 10),\n          isNull: this.#decodeSampleIsNull(s.sample),\n        };\n      });\n\n      const nonNullSamples = decodedSamples.filter(s => !s.isNull);\n\n      if (nonNullSamples.length === 0) {\n        // All samples are NULL - return fanout of 0 since NULLs don't match in joins\n        return {\n          fanout: 0,\n          source: 'stat4',\n          confidence: 'high',\n        };\n      }\n\n      // Use median of non-NULL fanouts (more robust than average)\n      const fanouts = nonNullSamples.map(s => s.fanout).sort((a, b) => a - b);\n      const medianFanout =\n        fanouts.length % 2 === 0\n          ? Math.floor(\n              (fanouts[fanouts.length / 2 - 1] + fanouts[fanouts.length / 2]) /\n                2,\n            )\n          : fanouts[Math.floor(fanouts.length / 2)];\n\n      return {\n        fanout: medianFanout,\n        source: 'stat4',\n        confidence: 'high',\n      };\n    } catch {\n      // stat4 table may not exist or query may fail\n      return undefined;\n    }\n  }\n\n  /**\n   * Gets fanout from sqlite_stat1 average.\n   *\n   * Note: This includes NULL rows in the calculation and may overestimate\n   * fanout for sparse foreign keys.\n   *\n   * For compound indexes, uses the stat value at the appropriate depth.\n   *\n   * @param columns Array of column names to get fanout for\n   * @returns Fanout result or undefined if stat1 unavailable\n   */\n  #getFanoutFromStat1(\n    tableName: string,\n    columns: string[],\n  ): FanoutResult | undefined {\n    try {\n      // Find index containing the columns as a prefix\n      const indexInfo = this.#findIndexForColumns(tableName, columns);\n      if (!indexInfo) {\n        return undefined;\n      }\n\n      // Query stat1 for this index (using prepared statement)\n      const result = this.#stat1Stmt.get(tableName, indexInfo.indexName) as\n        | {stat: string}\n        | undefined;\n\n      if (!result) {\n        return undefined;\n      }\n\n      const parts = result.stat.split(' ');\n      // Check if we have enough parts for the requested depth\n      if (parts.length < indexInfo.depth + 1) {\n        return undefined;\n      }\n\n      const fanout = parseInt(parts[indexInfo.depth], 10);\n      if (isNaN(fanout)) {\n        return undefined;\n      }\n\n      return {\n        fanout,\n        source: 'stat1',\n        confidence: 'med',\n      };\n    } catch {\n      return undefined;\n    }\n  }\n\n  /**\n   * Finds an index that can be used to get statistics for column(s).\n   *\n   * Uses pragma_index_list and pragma_index_info to reliably get index\n   * column names, avoiding brittle SQL parsing. Includes all indices:\n   * user-created (CREATE INDEX), PRIMARY KEY, and UNIQUE constraints.\n   *\n   * Uses flexible matching: Finds indexes where ALL columns appear in the\n   * first N positions, regardless of order. This works because SQLite statistics\n   * at depth N represent the fanout for the combination of the first N columns,\n   * and combinations are order-independent.\n   *\n   * Example:\n   * - columns: ['customerId', 'storeId']\n   * - Matches: (customerId, storeId, date) at depth 2 ✅\n   * - Matches: (storeId, customerId, date) at depth 2 ✅ (flexible order)\n   * - Does NOT match: (date, customerId, storeId) ❌ (columns not in first 2 positions)\n   * - Does NOT match: (customerId, date, storeId) ❌ (storeId not in first 2 positions)\n   *\n   * @param columns Array of column names (order-independent for matching)\n   * @returns Index info with name and depth, or undefined if no match\n   */\n  #findIndexForColumns(\n    tableName: string,\n    columns: string[],\n  ): {indexName: string; depth: number} | undefined {\n    try {\n      // Query returns all columns for all indexes (including PK/UNIQUE) in order\n      const rows = this.#indexStmt.all(tableName) as {\n        index_name: string;\n        seqno: number;\n        column_name: string;\n      }[];\n\n      // Group by index name\n      const indexMap = new Map<string, string[]>();\n      for (const row of rows) {\n        const cols = indexMap.get(row.index_name) ?? [];\n        cols.push(row.column_name);\n        indexMap.set(row.index_name, cols);\n      }\n\n      // Check each index for prefix match\n      for (const [indexName, indexColumns] of indexMap) {\n        if (this.#isPrefixMatch(columns, indexColumns)) {\n          return {\n            indexName,\n            depth: columns.length,\n          };\n        }\n      }\n\n      return undefined;\n    } catch {\n      return undefined;\n    }\n  }\n\n  /**\n   * Checks if all queryColumns exist in the first N positions of indexColumns,\n   * regardless of order.\n   *\n   * This allows flexible matching: constraint {a, b} matches both index (a, b, c)\n   * and index (b, a, c) at depth 2, since both represent the fanout for the\n   * combination of columns a and b.\n   *\n   * Gaps are NOT allowed: constraint {a, c} does NOT match index (a, b, c)\n   * because no depth represents just (a, c) without b. Statistics are cumulative\n   * from position 0.\n   *\n   * @param queryColumns Columns we're looking for (from constraint)\n   * @param indexColumns Columns in the index (in order)\n   * @returns true if all queryColumns exist in indexColumns[0...queryColumns.length-1]\n   */\n  #isPrefixMatch(queryColumns: string[], indexColumns: string[]): boolean {\n    if (queryColumns.length > indexColumns.length) {\n      return false;\n    }\n\n    // Get the prefix of the index that we're checking against\n    const indexPrefix = indexColumns.slice(0, queryColumns.length);\n\n    // Normalize to lowercase for case-insensitive comparison\n    const indexPrefixLower = new Set(indexPrefix.map(col => col.toLowerCase()));\n    const queryColumnsLower = queryColumns.map(col => col.toLowerCase());\n\n    // Check if ALL query columns exist in the index prefix\n    return queryColumnsLower.every(queryCol => indexPrefixLower.has(queryCol));\n  }\n\n  /**\n   * Decodes a sqlite_stat4 sample value to check if it's NULL.\n   *\n   * SQLite record format (simplified):\n   * - Varint: header size\n   * - Serial types for each column (one byte each typically)\n   * - Actual data\n   *\n   * Serial type 0 = NULL\n   * Serial type 1 = 8-bit int\n   * Serial type 2 = 16-bit int\n   * Serial type 3 = 24-bit int\n   * etc.\n   *\n   * We only need to check the first column's serial type.\n   *\n   * @param sample Binary-encoded sample from stat4\n   * @returns true if the sample value is NULL\n   */\n  #decodeSampleIsNull(sample: Buffer): boolean {\n    if (sample.length === 0) {\n      return true;\n    }\n\n    // Read header size (varint - simplified: assume single byte)\n    const headerSize = sample[0];\n\n    if (headerSize === 0 || headerSize >= sample.length) {\n      return true;\n    }\n\n    // Read first serial type (at position 1)\n    const serialType = sample[1];\n\n    // Serial type 0 = NULL\n    return serialType === 0;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwFA,IAAa,mBAAb,MAA8B;CAC5B;CACA;;;;;CAMA,yBAAkB,IAAI,KAA2B;;;;;CAMjD;CACA;CACA;;;;;;;;;;CAWA,YAAY,IAAc,gBAAgB,GAAG;AAC3C,QAAA,KAAW;AACX,QAAA,gBAAsB;AAGtB,QAAA,YAAkB,MAAA,GAAS,QAAQ;;;;;MAKjC;AAEF,QAAA,YAAkB,MAAA,GAAS,QAAQ;;;;MAIjC;AAEF,QAAA,YAAkB,MAAA,GAAS,QAAQ;;;;;MAKjC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAiCJ,UAAU,WAAmB,SAAiC;EAE5D,MAAM,WAAW,GAAG,UAAU,GAAG,QAAQ,UAAU,CAAC,KAAK,IAAI;EAC7D,MAAM,SAAS,MAAA,MAAY,IAAI,SAAS;AACxC,MAAI,OACF,QAAO;EAMT,MAAM,cAAc,MAAA,mBAAyB,WAAW,QAAQ;AAChE,MAAI,aAAa;AACf,SAAA,MAAY,IAAI,UAAU,YAAY;AACtC,UAAO;;EAIT,MAAM,cAAc,MAAA,mBAAyB,WAAW,QAAQ;AAChE,MAAI,aAAa;AACf,SAAA,MAAY,IAAI,UAAU,YAAY;AACtC,UAAO;;EAIT,MAAM,gBAA8B;GAClC,QAAQ,MAAA;GACR,YAAY;GACZ,QAAQ;GACT;AACD,QAAA,MAAY,IAAI,UAAU,cAAc;AACxC,SAAO;;;;;;CAOT,aAAmB;AACjB,QAAA,MAAY,OAAO;;;;;;;;;;;;;CAcrB,oBACE,WACA,SAC0B;AAC1B,MAAI;GAEF,MAAM,YAAY,MAAA,oBAA0B,WAAW,QAAQ;AAC/D,OAAI,CAAC,UACH;GAIF,MAAM,UAAU,MAAA,UAAgB,IAC9B,WACA,UAAU,UACX;AAED,OAAI,QAAQ,WAAW,EACrB;GAKF,MAAM,WAAW,UAAU,QAAQ;GASnC,MAAM,iBARiB,QAAQ,KAAI,MAAK;IACtC,MAAM,WAAW,EAAE,IAAI,MAAM,IAAI;AACjC,WAAO;KACL,QAAQ,SAAS,SAAS,aAAa,SAAS,IAAI,GAAG;KACvD,QAAQ,MAAA,mBAAyB,EAAE,OAAO;KAC3C;KACD,CAEoC,QAAO,MAAK,CAAC,EAAE,OAAO;AAE5D,OAAI,eAAe,WAAW,EAE5B,QAAO;IACL,QAAQ;IACR,QAAQ;IACR,YAAY;IACb;GAIH,MAAM,UAAU,eAAe,KAAI,MAAK,EAAE,OAAO,CAAC,MAAM,GAAG,MAAM,IAAI,EAAE;AASvE,UAAO;IACL,QARA,QAAQ,SAAS,MAAM,IACnB,KAAK,OACF,QAAQ,QAAQ,SAAS,IAAI,KAAK,QAAQ,QAAQ,SAAS,MAC1D,EACH,GACD,QAAQ,KAAK,MAAM,QAAQ,SAAS,EAAE;IAI1C,QAAQ;IACR,YAAY;IACb;UACK;AAEN;;;;;;;;;;;;;;CAeJ,oBACE,WACA,SAC0B;AAC1B,MAAI;GAEF,MAAM,YAAY,MAAA,oBAA0B,WAAW,QAAQ;AAC/D,OAAI,CAAC,UACH;GAIF,MAAM,SAAS,MAAA,UAAgB,IAAI,WAAW,UAAU,UAAU;AAIlE,OAAI,CAAC,OACH;GAGF,MAAM,QAAQ,OAAO,KAAK,MAAM,IAAI;AAEpC,OAAI,MAAM,SAAS,UAAU,QAAQ,EACnC;GAGF,MAAM,SAAS,SAAS,MAAM,UAAU,QAAQ,GAAG;AACnD,OAAI,MAAM,OAAO,CACf;AAGF,UAAO;IACL;IACA,QAAQ;IACR,YAAY;IACb;UACK;AACN;;;;;;;;;;;;;;;;;;;;;;;;;CA0BJ,qBACE,WACA,SACgD;AAChD,MAAI;GAEF,MAAM,OAAO,MAAA,UAAgB,IAAI,UAAU;GAO3C,MAAM,2BAAW,IAAI,KAAuB;AAC5C,QAAK,MAAM,OAAO,MAAM;IACtB,MAAM,OAAO,SAAS,IAAI,IAAI,WAAW,IAAI,EAAE;AAC/C,SAAK,KAAK,IAAI,YAAY;AAC1B,aAAS,IAAI,IAAI,YAAY,KAAK;;AAIpC,QAAK,MAAM,CAAC,WAAW,iBAAiB,SACtC,KAAI,MAAA,cAAoB,SAAS,aAAa,CAC5C,QAAO;IACL;IACA,OAAO,QAAQ;IAChB;AAIL;UACM;AACN;;;;;;;;;;;;;;;;;;;CAoBJ,eAAe,cAAwB,cAAiC;AACtE,MAAI,aAAa,SAAS,aAAa,OACrC,QAAO;EAIT,MAAM,cAAc,aAAa,MAAM,GAAG,aAAa,OAAO;EAG9D,MAAM,mBAAmB,IAAI,IAAI,YAAY,KAAI,QAAO,IAAI,aAAa,CAAC,CAAC;AAI3E,SAH0B,aAAa,KAAI,QAAO,IAAI,aAAa,CAAC,CAG3C,OAAM,aAAY,iBAAiB,IAAI,SAAS,CAAC;;;;;;;;;;;;;;;;;;;;;CAsB5E,oBAAoB,QAAyB;AAC3C,MAAI,OAAO,WAAW,EACpB,QAAO;EAIT,MAAM,aAAa,OAAO;AAE1B,MAAI,eAAe,KAAK,cAAc,OAAO,OAC3C,QAAO;AAOT,SAHmB,OAAO,OAGJ"}

package/out/zqlite/src/table-source.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"table-source.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/table-source.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAEjD,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,+BAA+B,CAAC;AAK7D,OAAO,KAAK,EAAC,SAAS,EAAE,QAAQ,EAAC,MAAM,gCAAgC,CAAC;AACxE,OAAO,KAAK,EAAC,GAAG,EAAQ,MAAM,iCAAiC,CAAC;AAChE,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,wCAAwC,CAAC;AACvE,OAAO,KAAK,EACV,WAAW,EACX,SAAS,EACV,MAAM,uCAAuC,CAAC;AAC/C,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,yCAAyC,CAAC;AAkB3E,OAAO,EACL,KAAK,MAAM,EACX,KAAK,YAAY,EACjB,KAAK,WAAW,EACjB,MAAM,6BAA6B,CAAC;AACrC,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,6BAA6B,CAAC;AAExD,OAAO,KAAK,EAAC,QAAQ,EAAY,MAAM,SAAS,CAAC;AAoBjD;;;;;;;;;;;;;GAaG;AACH,qBAAa,WAAY,YAAW,MAAM;;IAexC;;;;;OAKG;gBAED,UAAU,EAAE,UAAU,EACtB,SAAS,EAAE,SAAS,EACpB,EAAE,EAAE,QAAQ,EACZ,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACpC,UAAU,EAAE,UAAU,EACtB,WAAW,gBAAc;IAiB3B,IAAI,WAAW;;;;MAMd;IAED;;;OAGG;IACH,KAAK,CAAC,EAAE,EAAE,QAAQ;IA4FlB,OAAO,CACL,IAAI,EAAE,QAAQ,GAAG,SAAS,EAC1B,OAAO,CAAC,EAAE,SAAS,EACnB,aAAa,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAC3B,KAAK,CAAC,EAAE,aAAa;IA8CvB,WAAW,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG;IAiIzB,IAAI,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC;IAQ3C,OAAO,CAAC,MAAM,EAAE,YAAY;IAqG7B;;;;;;OAMG;IACH,MAAM,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS;CA+BrC;AA6BD,wBAAgB,aAAa,CAC3B,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,GAAG,EAAE,GAAG,EACR,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,GACvC,SAAS,OAAO,EAAE,CAEpB;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,SAAS,wCAa/C;AAED,wBAAgB,eAAe,CAC7B,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACvC,GAAG,EAAE,GAAG,EACR,SAAS,EAAE,MAAM,GAChB,GAAG,CAaL;AAwCD,qBAAa,qBAAsB,SAAQ,KAAK;CAAG"}
+{"version":3,"file":"table-source.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/table-source.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAEjD,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,+BAA+B,CAAC;AAK7D,OAAO,KAAK,EAAC,SAAS,EAAE,QAAQ,EAAC,MAAM,gCAAgC,CAAC;AACxE,OAAO,KAAK,EAAC,GAAG,EAAQ,MAAM,iCAAiC,CAAC;AAChE,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,wCAAwC,CAAC;AACvE,OAAO,KAAK,EACV,WAAW,EACX,SAAS,EACV,MAAM,uCAAuC,CAAC;AAC/C,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,yCAAyC,CAAC;AAkB3E,OAAO,EACL,KAAK,MAAM,EACX,KAAK,YAAY,EACjB,KAAK,WAAW,EACjB,MAAM,6BAA6B,CAAC;AACrC,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,6BAA6B,CAAC;AAExD,OAAO,KAAK,EAAC,QAAQ,EAAY,MAAM,SAAS,CAAC;AAoBjD;;;;;;;;;;;;;GAaG;AACH,qBAAa,WAAY,YAAW,MAAM;;IAgBxC;;;;;OAKG;gBAED,UAAU,EAAE,UAAU,EACtB,SAAS,EAAE,SAAS,EACpB,EAAE,EAAE,QAAQ,EACZ,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACpC,UAAU,EAAE,UAAU,EACtB,WAAW,gBAAc;IAuB3B,IAAI,WAAW;;;;MAMd;IAED;;;OAGG;IACH,KAAK,CAAC,EAAE,EAAE,QAAQ;IA6FlB,OAAO,CACL,IAAI,EAAE,QAAQ,GAAG,SAAS,EAC1B,OAAO,CAAC,EAAE,SAAS,EACnB,aAAa,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAC3B,KAAK,CAAC,EAAE,aAAa;IA8CvB,WAAW,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG;IAsHzB,IAAI,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC;IAQ3C,OAAO,CAAC,MAAM,EAAE,YAAY;IAqG7B;;;;;;OAMG;IACH,MAAM,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS;CA+BrC;AA6BD,wBAAgB,aAAa,CAC3B,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,GAAG,EAAE,GAAG,EACR,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,GACvC,SAAS,OAAO,EAAE,CAEpB;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,SAAS,wCAa/C;AAED,wBAAgB,eAAe,CAC7B,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACvC,GAAG,EAAE,GAAG,EACR,SAAS,EAAE,MAAM,GAChB,GAAG,CAaL;AAwCD,qBAAa,qBAAsB,SAAQ,KAAK;CAAG"}

package/out/zqlite/src/table-source.js

@@ -31,6 +31,7 @@ var TableSource = class {
 	#table;
 	#columns;
 	#uniqueIndexes;
+	#uniqueIndexColumns;
 	#primaryKey;
 	#logConfig;
 	#lc;
@@ -50,6 +51,7 @@ var TableSource = class {
 		this.#table = tableName;
 		this.#columns = columns;
 		this.#uniqueIndexes = getUniqueIndexes(db, tableName);
+		this.#uniqueIndexColumns = Array.from(this.#uniqueIndexes.values(), (set) => [...set].toSorted());
 		this.#primaryKey = primaryKey;
 		this.#stmts = this.#getStatementsFor(db);
 		this.#shouldYield = shouldYield;
@@ -91,6 +93,7 @@ var TableSource = class {
 			tableName: this.#table,
 			columns: this.#columns,
 			primaryKey: this.#primaryKey,
+			uniqueIndexes: this.#uniqueIndexColumns,
 			sort: unordered ? void 0 : connection.sort,
 			relationships: {},
 			isHidden: false,
@@ -152,16 +155,13 @@ var TableSource = class {
 			rowIterator.return?.();
 			if (debug) {
 				let totalNvisit = 0;
-				const planLines = [];
-				for (let i = 0;; i++) {
-					const nvisit = cachedStatement.statement.scanStatus(i, SQLite3Database.SQLITE_SCANSTAT_NVISIT, 1);
+				let i = 0;
+				while (true) {
+					const nvisit = cachedStatement.statement.scanStatus(i++, SQLite3Database.SQLITE_SCANSTAT_NVISIT, 1);
 					if (nvisit === void 0) break;
 					totalNvisit += Number(nvisit);
-					const explain = cachedStatement.statement.scanStatus(i, SQLite3Database.SQLITE_SCANSTAT_EXPLAIN, 1);
-					if (typeof explain === "string" && explain.length > 0) planLines.push(explain);
 				}
 				if (totalNvisit !== 0) debug.recordNVisit(this.#table, sqlAndBindings.text, totalNvisit);
-				if (planLines.length > 0) debug.recordExplain(this.#table, sqlAndBindings.text, planLines);
 				cachedStatement.statement.scanStatusReset();
 			}
 			this.#stmts.cache.return(cachedStatement);

package/out/zqlite/src/table-source.js.map

@@ -1 +1 @@
-{"version":3,"file":"table-source.js","names":["#dbCache","#connections","#table","#columns","#uniqueIndexes","#primaryKey","#logConfig","#lc","#shouldYield","#stmts","#getStatementsFor","#allColumns","#fetch","#getSchema","#requestToSQL","#mapFromSQLiteTypes","#overlay","#writeChange","#pushEpoch","#getRowStmtCache","#getRowStmt"],"sources":["../../../../zqlite/src/table-source.ts"],"sourcesContent":["import type {SQLQuery} from '@databases/sql';\nimport type {LogContext} from '@rocicorp/logger';\nimport SQLite3Database from '@rocicorp/zero-sqlite3';\nimport type {LogConfig} from '../../otel/src/log-options.ts';\nimport {timeSampled} from '../../otel/src/maybe-time.ts';\nimport {assert, unreachable} from '../../shared/src/asserts.ts';\nimport {must} from '../../shared/src/must.ts';\nimport type {Writable} from '../../shared/src/writable.ts';\nimport type {Condition, Ordering} from '../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../zero-protocol/src/data.ts';\nimport type {PrimaryKey} from '../../zero-protocol/src/primary-key.ts';\nimport type {\n  SchemaValue,\n  ValueType,\n} from '../../zero-schema/src/table-schema.ts';\nimport type {DebugDelegate} from '../../zql/src/builder/debug-delegate.ts';\nimport {\n  createPredicate,\n  transformFilters,\n} from '../../zql/src/builder/filter.ts';\nimport {ChangeType} from '../../zql/src/ivm/change-type.ts';\nimport {makeComparator, type Node} from '../../zql/src/ivm/data.ts';\nimport {\n  generateWithOverlay,\n  generateWithOverlayUnordered,\n  generateWithStart,\n  genPushAndWriteWithSplitEdit,\n  type Connection,\n  type Overlay,\n} from '../../zql/src/ivm/memory-source.ts';\nimport {type FetchRequest} from '../../zql/src/ivm/operator.ts';\nimport type {SourceSchema} from '../../zql/src/ivm/schema.ts';\nimport {SourceChangeIndex} from '../../zql/src/ivm/source-change-index.ts';\nimport {\n  type Source,\n  type SourceChange,\n  type SourceInput,\n} from '../../zql/src/ivm/source.ts';\nimport type {Stream} from '../../zql/src/ivm/stream.ts';\nimport {assertOrderingIncludesPK} from '../../zql/src/query/complete-ordering.ts';\nimport type {Database, Statement} from './db.ts';\nimport {compile, format, sql} from './internal/sql.ts';\nimport {StatementCache} from './internal/statement-cache.ts';\nimport {\n  buildSelectQuery,\n  toSQLiteType,\n  type NoSubqueryCondition,\n} from './query-builder.ts';\n\ntype Statements = {\n  readonly cache: StatementCache;\n  readonly insert: Statement;\n  readonly delete: Statement;\n  readonly update: Statement | undefined;\n  readonly checkExists: Statement;\n  readonly getExisting: Statement;\n};\n\nlet eventCount = 0;\n\n/**\n * A source that is backed by a SQLite table.\n *\n * Values are written to the backing table _after_ being vended by the source.\n *\n * This ordering of events is to ensure self joins function properly. That is,\n * we can't reveal a value to an output before it has been pushed to that output.\n *\n * The code is fairly straightforward except for:\n * 1. Dealing with a `fetch` that has a basis of `before`.\n * 2. Dealing with compound orders that have differing directions (a ASC, b DESC, c ASC)\n *\n * See comments in relevant functions for more details.\n */\nexport class TableSource implements Source {\n  readonly #dbCache = new WeakMap<Database, Statements>();\n  readonly #connections: Connection[] = [];\n  readonly #table: string;\n  readonly #columns: Record<string, SchemaValue>;\n  // Maps sorted columns JSON string (e.g. '[\"a\",\"b\"]) to Set of columns.\n  readonly #uniqueIndexes: Map<string, Set<string>>;\n  readonly #primaryKey: PrimaryKey;\n  readonly #logConfig: LogConfig;\n  readonly #lc: LogContext;\n  readonly #shouldYield: () => boolean;\n  #stmts: Statements;\n  #overlay?: Overlay | undefined;\n  #pushEpoch = 0;\n\n  /**\n   * @param shouldYield a function called after each row is read from the database,\n   * which should return true if the source should yield the special 'yield' value\n   * to yield control back to the caller at the end of the pipeline.  Can\n   * also throw an error to abort the pipeline processing.\n   */\n  constructor(\n    logContext: LogContext,\n    logConfig: LogConfig,\n    db: Database,\n    tableName: string,\n    columns: Record<string, SchemaValue>,\n    primaryKey: PrimaryKey,\n    shouldYield = () => false,\n  ) {\n    this.#lc = logContext;\n    this.#logConfig = logConfig;\n    this.#table = tableName;\n    this.#columns = columns;\n    this.#uniqueIndexes = getUniqueIndexes(db, tableName);\n    this.#primaryKey = primaryKey;\n    this.#stmts = this.#getStatementsFor(db);\n    this.#shouldYield = shouldYield;\n\n    assert(\n      this.#uniqueIndexes.has(JSON.stringify(primaryKey.toSorted())),\n      `primary key ${primaryKey} does not have a UNIQUE index`,\n    );\n  }\n\n  get tableSchema() {\n    return {\n      name: this.#table,\n      columns: this.#columns,\n      primaryKey: this.#primaryKey,\n    };\n  }\n\n  /**\n   * Sets the db (snapshot) to use, to facilitate the Snapshotter leapfrog\n   * algorithm for concurrent traversal of historic timelines.\n   */\n  setDB(db: Database) {\n    this.#stmts = this.#getStatementsFor(db);\n  }\n\n  #getStatementsFor(db: Database) {\n    const cached = this.#dbCache.get(db);\n    if (cached) {\n      return cached;\n    }\n\n    const stmts = {\n      cache: new StatementCache(db),\n      insert: db.prepare(\n        compile(\n          sql`INSERT INTO ${sql.ident(this.#table)} (${sql.join(\n            Object.keys(this.#columns).map(c => sql.ident(c)),\n            ', ',\n          )}) VALUES (${sql.__dangerous__rawValue(\n            Array.from({length: Object.keys(this.#columns).length})\n              .fill('?')\n              .join(','),\n          )})`,\n        ),\n      ),\n      delete: db.prepare(\n        compile(\n          sql`DELETE FROM ${sql.ident(this.#table)} WHERE ${sql.join(\n            this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n            ' AND ',\n          )}`,\n        ),\n      ),\n      // If all the columns are part of the primary key, we cannot use UPDATE.\n      update:\n        Object.keys(this.#columns).length > this.#primaryKey.length\n          ? db.prepare(\n              compile(\n                sql`UPDATE ${sql.ident(this.#table)} SET ${sql.join(\n                  nonPrimaryKeys(this.#columns, this.#primaryKey).map(\n                    c => sql`${sql.ident(c)}=?`,\n                  ),\n                  ',',\n                )} WHERE ${sql.join(\n                  this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n                  ' AND ',\n                )}`,\n              ),\n            )\n          : undefined,\n      checkExists: db.prepare(\n        compile(\n          sql`SELECT 1 AS \"exists\" FROM ${sql.ident(\n            this.#table,\n          )} WHERE ${sql.join(\n            this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n            ' AND ',\n          )} LIMIT 1`,\n        ),\n      ),\n      getExisting: db.prepare(\n        compile(\n          sql`SELECT * FROM ${sql.ident(this.#table)} WHERE ${sql.join(\n            this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n            ' AND ',\n          )}`,\n        ),\n      ),\n    };\n    this.#dbCache.set(db, stmts);\n    return stmts;\n  }\n\n  get #allColumns() {\n    return sql.join(\n      Object.keys(this.#columns).map(c => sql.ident(c)),\n      sql`,`,\n    );\n  }\n\n  #getSchema(connection: Connection, unordered: boolean): SourceSchema {\n    return {\n      tableName: this.#table,\n      columns: this.#columns,\n      primaryKey: this.#primaryKey,\n      sort: unordered ? undefined : connection.sort,\n      relationships: {},\n      isHidden: false,\n      system: 'client',\n      compareRows: connection.compareRows,\n    };\n  }\n\n  connect(\n    sort: Ordering | undefined,\n    filters?: Condition,\n    splitEditKeys?: Set<string>,\n    debug?: DebugDelegate,\n  ) {\n    const transformedFilters = transformFilters(filters);\n    const unordered = sort === undefined;\n    // PK comparator is used for source-level overlay matching (remove by PK\n    // equality) even when no ordering is requested.\n    const primaryKeySort: Ordering = this.#primaryKey.map(k => [k, 'asc']);\n\n    const input: SourceInput = {\n      getSchema: () => schema,\n      fetch: req => this.#fetch(req, connection),\n      setOutput: output => {\n        connection.output = output;\n      },\n      destroy: () => {\n        const idx = this.#connections.indexOf(connection);\n        assert(idx !== -1, 'Connection not found');\n        this.#connections.splice(idx, 1);\n      },\n      fullyAppliedFilters: !transformedFilters.conditionsRemoved,\n    };\n\n    const connection: Connection = {\n      input,\n      debug,\n      output: undefined,\n      sort,\n      splitEditKeys,\n      filters: transformedFilters.filters\n        ? {\n            condition: transformedFilters.filters,\n            predicate: createPredicate(transformedFilters.filters),\n          }\n        : undefined,\n      compareRows: sort ? makeComparator(sort) : makeComparator(primaryKeySort),\n      lastPushedEpoch: 0,\n    };\n    const schema = this.#getSchema(connection, unordered);\n    if (!unordered) {\n      assertOrderingIncludesPK(sort, this.#primaryKey);\n    }\n\n    this.#connections.push(connection);\n    return input;\n  }\n\n  toSQLiteRow(row: Row): Row {\n    return Object.fromEntries(\n      Object.entries(row).map(([key, value]) => [\n        key,\n        toSQLiteType(value, this.#columns[key].type),\n      ]),\n    ) as Row;\n  }\n\n  *#fetch(req: FetchRequest, connection: Connection): Stream<Node | 'yield'> {\n    const {sort, debug} = connection;\n\n    const query = this.#requestToSQL(req, connection.filters?.condition, sort);\n    const sqlAndBindings = format(query);\n\n    const cachedStatement = this.#stmts.cache.get(sqlAndBindings.text);\n    cachedStatement.statement.safeIntegers(true);\n    const rowIterator = cachedStatement.statement.iterate<Row>(\n      ...sqlAndBindings.values,\n    );\n    try {\n      debug?.initQuery(this.#table, sqlAndBindings.text);\n\n      if (sort) {\n        const comparator = makeComparator(sort, req.reverse);\n        yield* generateWithStart(\n          generateWithYields(\n            generateWithOverlay(\n              req.start?.row,\n              this.#mapFromSQLiteTypes(\n                this.#columns,\n                rowIterator,\n                sqlAndBindings.text,\n                debug,\n              ),\n              req.constraint,\n              this.#overlay,\n              connection.lastPushedEpoch,\n              comparator,\n              connection.filters?.predicate,\n              req.multiConstraints,\n            ),\n            this.#shouldYield,\n          ),\n          req.start,\n          comparator,\n        );\n      } else {\n        yield* generateWithYields(\n          generateWithOverlayUnordered(\n            this.#mapFromSQLiteTypes(\n              this.#columns,\n              rowIterator,\n              sqlAndBindings.text,\n              debug,\n            ),\n            req.constraint,\n            this.#overlay,\n            connection.lastPushedEpoch,\n            this.#primaryKey,\n            connection.filters?.predicate,\n            req.multiConstraints,\n          ),\n          this.#shouldYield,\n        );\n      }\n    } finally {\n      // Ensure the SQLite iterate() is closed.\n      rowIterator.return?.();\n      if (debug) {\n        let totalNvisit = 0;\n        const planLines: string[] = [];\n        for (let i = 0; ; i++) {\n          const nvisit = cachedStatement.statement.scanStatus(\n            i,\n            SQLite3Database.SQLITE_SCANSTAT_NVISIT,\n            1,\n          );\n          if (nvisit === undefined) {\n            break;\n          }\n          totalNvisit += Number(nvisit);\n          const explain = cachedStatement.statement.scanStatus(\n            i,\n            SQLite3Database.SQLITE_SCANSTAT_EXPLAIN,\n            1,\n          );\n          if (typeof explain === 'string' && explain.length > 0) {\n            planLines.push(explain);\n          }\n        }\n        if (totalNvisit !== 0) {\n          debug.recordNVisit(this.#table, sqlAndBindings.text, totalNvisit);\n        }\n        if (planLines.length > 0) {\n          debug.recordExplain(this.#table, sqlAndBindings.text, planLines);\n        }\n        cachedStatement.statement.scanStatusReset();\n      }\n      this.#stmts.cache.return(cachedStatement);\n    }\n  }\n\n  *#mapFromSQLiteTypes(\n    valueTypes: Record<string, SchemaValue>,\n    rowIterator: IterableIterator<Row>,\n    query: string,\n    debug: DebugDelegate | undefined,\n  ): IterableIterator<Row> {\n    let result;\n    do {\n      result = timeSampled(\n        this.#lc,\n        ++eventCount,\n        this.#logConfig.ivmSampling,\n        () => rowIterator.next(),\n        this.#logConfig.slowRowThreshold,\n        () =>\n          `table-source.next took too long for ${query}. Are you missing an index?`,\n      );\n      if (result.done) {\n        break;\n      }\n      const row = fromSQLiteTypes(valueTypes, result.value, this.#table);\n      debug?.rowVended(this.#table, query, row);\n      yield row;\n    } while (!result.done);\n  }\n\n  *push(change: SourceChange): Stream<'yield'> {\n    for (const result of this.genPush(change)) {\n      if (result === 'yield') {\n        yield result;\n      }\n    }\n  }\n\n  *genPush(change: SourceChange) {\n    const exists = (row: Row) =>\n      this.#stmts.checkExists.get<{exists: number} | undefined>(\n        ...toSQLiteTypes(this.#primaryKey, row, this.#columns),\n      )?.exists === 1;\n    const setOverlay = (o: Overlay | undefined) => (this.#overlay = o);\n    const writeChange = (c: SourceChange) => this.#writeChange(c);\n\n    yield* genPushAndWriteWithSplitEdit(\n      this.#connections,\n      change,\n      exists,\n      setOverlay,\n      writeChange,\n      () => ++this.#pushEpoch,\n    );\n  }\n\n  #writeChange(change: SourceChange) {\n    switch (change[SourceChangeIndex.TYPE]) {\n      case ChangeType.ADD:\n        this.#stmts.insert.run(\n          ...toSQLiteTypes(\n            // TODO(arv): Compute this once!\n            Object.keys(this.#columns),\n            change[SourceChangeIndex.ROW],\n            this.#columns,\n          ),\n        );\n        break;\n      case ChangeType.REMOVE:\n        this.#stmts.delete.run(\n          ...toSQLiteTypes(\n            this.#primaryKey,\n            change[SourceChangeIndex.ROW],\n            this.#columns,\n          ),\n        );\n        break;\n      case ChangeType.EDIT: {\n        // If the PK is the same, use UPDATE.\n        if (\n          canUseUpdate(\n            change[SourceChangeIndex.OLD_ROW],\n            change[SourceChangeIndex.ROW],\n            this.#columns,\n            this.#primaryKey,\n          )\n        ) {\n          const mergedRow = {\n            ...change[SourceChangeIndex.OLD_ROW],\n            ...change[SourceChangeIndex.ROW],\n          };\n          const params = [\n            ...nonPrimaryValues(this.#columns, this.#primaryKey, mergedRow),\n            ...toSQLiteTypes(this.#primaryKey, mergedRow, this.#columns),\n          ];\n          must(this.#stmts.update).run(params);\n        } else {\n          this.#stmts.delete.run(\n            ...toSQLiteTypes(\n              this.#primaryKey,\n              change[SourceChangeIndex.OLD_ROW],\n              this.#columns,\n            ),\n          );\n          this.#stmts.insert.run(\n            ...toSQLiteTypes(\n              Object.keys(this.#columns),\n              change[SourceChangeIndex.ROW],\n              this.#columns,\n            ),\n          );\n        }\n\n        break;\n      }\n      default:\n        unreachable(change);\n    }\n  }\n\n  #getRowStmtCache = new Map<string, string>();\n\n  #getRowStmt(keyCols: string[]): string {\n    const keyString = JSON.stringify(keyCols);\n    let stmt = this.#getRowStmtCache.get(keyString);\n    if (!stmt) {\n      stmt = compile(\n        sql`SELECT ${this.#allColumns} FROM ${sql.ident(\n          this.#table,\n        )} WHERE ${sql.join(\n          keyCols.map(k => sql`${sql.ident(k)}=?`),\n          sql` AND`,\n        )}`,\n      );\n      this.#getRowStmtCache.set(keyString, stmt);\n    }\n    return stmt;\n  }\n\n  /**\n   * Retrieves a row from the backing DB by a unique key, or `undefined` if such a\n   * row does not exist. This is not used in the IVM pipeline but is useful\n   * for retrieving data that is consistent with the state (and type\n   * semantics) of the pipeline. Note that this key may not necessarily correspond\n   * to the `primaryKey` with which this TableSource.\n   */\n  getRow(rowKey: Row): Row | undefined {\n    const keyCols = Object.keys(rowKey);\n\n    const stmt = this.#getRowStmt(keyCols);\n    const row = this.#stmts.cache.use(stmt, cached =>\n      cached.statement\n        .safeIntegers(true)\n        .get<Row>(...toSQLiteTypes(keyCols, rowKey, this.#columns)),\n    );\n    if (row) {\n      return fromSQLiteTypes(this.#columns, row, this.#table);\n    }\n    return row;\n  }\n\n  #requestToSQL(\n    request: FetchRequest,\n    filters: NoSubqueryCondition | undefined,\n    order: Ordering | undefined,\n  ): SQLQuery {\n    return buildSelectQuery(\n      this.#table,\n      this.#columns,\n      request.constraint,\n      filters,\n      order,\n      request.reverse,\n      request.start,\n      request.multiConstraints,\n    );\n  }\n}\n\nfunction getUniqueIndexes(\n  db: Database,\n  tableName: string,\n): Map<string, Set<string>> {\n  const sqlAndBindings = format(\n    sql`\n    SELECT idx.name, json_group_array(col.name) as columnsJSON\n      FROM sqlite_master as idx\n      JOIN pragma_index_list(idx.tbl_name) AS info ON info.name = idx.name\n      JOIN pragma_index_info(idx.name) as col\n      WHERE idx.tbl_name = ${tableName} AND\n            idx.type = 'index' AND \n            info.\"unique\" != 0\n      GROUP BY idx.name\n      ORDER BY idx.name`,\n  );\n  const stmt = db.prepare(sqlAndBindings.text);\n  const indexes = stmt.all<{columnsJSON: string}>(...sqlAndBindings.values);\n  return new Map(\n    indexes.map(({columnsJSON}) => {\n      const columns = JSON.parse(columnsJSON);\n      const set = new Set<string>(columns);\n      return [JSON.stringify(columns.sort()), set];\n    }),\n  );\n}\n\nexport function toSQLiteTypes(\n  columns: readonly string[],\n  row: Row,\n  columnTypes: Record<string, SchemaValue>,\n): readonly unknown[] {\n  return columns.map(col => toSQLiteType(row[col], columnTypes[col].type));\n}\n\nexport function toSQLiteTypeName(type: ValueType) {\n  switch (type) {\n    case 'boolean':\n      return 'INTEGER';\n    case 'number':\n      return 'REAL';\n    case 'string':\n      return 'TEXT';\n    case 'null':\n      return 'NULL';\n    case 'json':\n      return 'TEXT';\n  }\n}\n\nexport function fromSQLiteTypes(\n  valueTypes: Record<string, SchemaValue>,\n  row: Row,\n  tableName: string,\n): Row {\n  const newRow: Writable<Row> = {};\n  for (const key of Object.keys(row)) {\n    const valueType = valueTypes[key];\n    if (valueType === undefined) {\n      const columnList = Object.keys(valueTypes).sort().join(', ');\n      throw new Error(\n        `Invalid column \"${key}\" for table \"${tableName}\". Synced columns include ${columnList}`,\n      );\n    }\n    newRow[key] = fromSQLiteType(valueType.type, row[key], key, tableName);\n  }\n  return newRow;\n}\n\nfunction fromSQLiteType(\n  valueType: ValueType,\n  v: Value,\n  column: string,\n  tableName: string,\n): Value {\n  if (v === null) {\n    return null;\n  }\n  switch (valueType) {\n    case 'boolean':\n      return !!v;\n    case 'number':\n    case 'string':\n    case 'null':\n      if (typeof v === 'bigint') {\n        if (v > Number.MAX_SAFE_INTEGER || v < Number.MIN_SAFE_INTEGER) {\n          throw new UnsupportedValueError(\n            `value ${v} (in ${tableName}.${column}) is outside of supported bounds`,\n          );\n        }\n        return Number(v);\n      }\n      return v;\n    case 'json':\n      try {\n        return JSON.parse(v as string);\n      } catch (error) {\n        const errorMessage =\n          error instanceof Error ? error.message : String(error);\n        throw new UnsupportedValueError(\n          `Failed to parse JSON for ${tableName}.${column}: ${errorMessage}`,\n          {cause: error},\n        );\n      }\n  }\n}\n\nexport class UnsupportedValueError extends Error {}\n\nfunction canUseUpdate(\n  oldRow: Row,\n  row: Row,\n  columns: Record<string, SchemaValue>,\n  primaryKey: PrimaryKey,\n): boolean {\n  for (const pk of primaryKey) {\n    if (oldRow[pk] !== row[pk]) {\n      return false;\n    }\n  }\n  return Object.keys(columns).length > primaryKey.length;\n}\n\nfunction nonPrimaryValues(\n  columns: Record<string, SchemaValue>,\n  primaryKey: PrimaryKey,\n  row: Row,\n): Iterable<unknown> {\n  return nonPrimaryKeys(columns, primaryKey).map(c =>\n    toSQLiteType(row[c], columns[c].type),\n  );\n}\n\nfunction nonPrimaryKeys(\n  columns: Record<string, SchemaValue>,\n  primaryKey: PrimaryKey,\n) {\n  return Object.keys(columns).filter(c => !primaryKey.includes(c));\n}\n\nfunction* generateWithYields(stream: Stream<Node>, shouldYield: () => boolean) {\n  for (const n of stream) {\n    if (shouldYield()) {\n      yield 'yield';\n    }\n    yield n;\n  }\n}\n"],"mappings":";;;;;;;;;;;;AA0DA,IAAI,aAAa;;;;;;;;;;;;;;;AAgBjB,IAAa,cAAb,MAA2C;CACzC,2BAAoB,IAAI,QAA8B;CACtD,eAAsC,CAAC;CACvC;CACA;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,aAAa;;;;;;;CAQb,YACE,YACA,WACA,IACA,WACA,SACA,YACA,oBAAoB,OACpB;EACA,KAAKO,MAAM;EACX,KAAKD,aAAa;EAClB,KAAKJ,SAAS;EACd,KAAKC,WAAW;EAChB,KAAKC,iBAAiB,iBAAiB,IAAI,SAAS;EACpD,KAAKC,cAAc;EACnB,KAAKI,SAAS,KAAKC,kBAAkB,EAAE;EACvC,KAAKF,eAAe;EAEpB,OACE,KAAKJ,eAAe,IAAI,KAAK,UAAU,WAAW,SAAS,CAAC,CAAC,GAC7D,eAAe,WAAW,8BAC5B;CACF;CAEA,IAAI,cAAc;EAChB,OAAO;GACL,MAAM,KAAKF;GACX,SAAS,KAAKC;GACd,YAAY,KAAKE;EACnB;CACF;;;;;CAMA,MAAM,IAAc;EAClB,KAAKI,SAAS,KAAKC,kBAAkB,EAAE;CACzC;CAEA,kBAAkB,IAAc;EAC9B,MAAM,SAAS,KAAKV,SAAS,IAAI,EAAE;EACnC,IAAI,QACF,OAAO;EAGT,MAAM,QAAQ;GACZ,OAAO,IAAI,eAAe,EAAE;GAC5B,QAAQ,GAAG,QACT,QACE,GAAG,eAAe,IAAI,MAAM,KAAKE,MAAM,EAAE,IAAI,IAAI,KAC/C,OAAO,KAAK,KAAKC,QAAQ,EAAE,KAAI,MAAK,IAAI,MAAM,CAAC,CAAC,GAChD,IACF,EAAE,YAAY,IAAI,sBAChB,MAAM,KAAK,EAAC,QAAQ,OAAO,KAAK,KAAKA,QAAQ,EAAE,OAAM,CAAC,EACnD,KAAK,GAAG,EACR,KAAK,GAAG,CACb,EAAE,EACJ,CACF;GACA,QAAQ,GAAG,QACT,QACE,GAAG,eAAe,IAAI,MAAM,KAAKD,MAAM,EAAE,SAAS,IAAI,KACpD,KAAKG,YAAY,KAAI,MAAK,GAAG,GAAG,IAAI,MAAM,CAAC,EAAE,GAAG,GAChD,OACF,GACF,CACF;GAEA,QACE,OAAO,KAAK,KAAKF,QAAQ,EAAE,SAAS,KAAKE,YAAY,SACjD,GAAG,QACD,QACE,GAAG,UAAU,IAAI,MAAM,KAAKH,MAAM,EAAE,OAAO,IAAI,KAC7C,eAAe,KAAKC,UAAU,KAAKE,WAAW,EAAE,KAC9C,MAAK,GAAG,GAAG,IAAI,MAAM,CAAC,EAAE,GAC1B,GACA,GACF,EAAE,SAAS,IAAI,KACb,KAAKA,YAAY,KAAI,MAAK,GAAG,GAAG,IAAI,MAAM,CAAC,EAAE,GAAG,GAChD,OACF,GACF,CACF,IACA,KAAA;GACN,aAAa,GAAG,QACd,QACE,GAAG,6BAA6B,IAAI,MAClC,KAAKH,MACP,EAAE,SAAS,IAAI,KACb,KAAKG,YAAY,KAAI,MAAK,GAAG,GAAG,IAAI,MAAM,CAAC,EAAE,GAAG,GAChD,OACF,EAAE,SACJ,CACF;GACA,aAAa,GAAG,QACd,QACE,GAAG,iBAAiB,IAAI,MAAM,KAAKH,MAAM,EAAE,SAAS,IAAI,KACtD,KAAKG,YAAY,KAAI,MAAK,GAAG,GAAG,IAAI,MAAM,CAAC,EAAE,GAAG,GAChD,OACF,GACF,CACF;EACF;EACA,KAAKL,SAAS,IAAI,IAAI,KAAK;EAC3B,OAAO;CACT;CAEA,IAAIW,cAAc;EAChB,OAAO,IAAI,KACT,OAAO,KAAK,KAAKR,QAAQ,EAAE,KAAI,MAAK,IAAI,MAAM,CAAC,CAAC,GAChD,GAAG,GACL;CACF;CAEA,WAAW,YAAwB,WAAkC;EACnE,OAAO;GACL,WAAW,KAAKD;GAChB,SAAS,KAAKC;GACd,YAAY,KAAKE;GACjB,MAAM,YAAY,KAAA,IAAY,WAAW;GACzC,eAAe,CAAC;GAChB,UAAU;GACV,QAAQ;GACR,aAAa,WAAW;EAC1B;CACF;CAEA,QACE,MACA,SACA,eACA,OACA;EACA,MAAM,qBAAqB,iBAAiB,OAAO;EACnD,MAAM,YAAY,SAAS,KAAA;EAG3B,MAAM,iBAA2B,KAAKA,YAAY,KAAI,MAAK,CAAC,GAAG,KAAK,CAAC;EAErE,MAAM,QAAqB;GACzB,iBAAiB;GACjB,QAAO,QAAO,KAAKO,OAAO,KAAK,UAAU;GACzC,YAAW,WAAU;IACnB,WAAW,SAAS;GACtB;GACA,eAAe;IACb,MAAM,MAAM,KAAKX,aAAa,QAAQ,UAAU;IAChD,OAAO,QAAQ,IAAI,sBAAsB;IACzC,KAAKA,aAAa,OAAO,KAAK,CAAC;GACjC;GACA,qBAAqB,CAAC,mBAAmB;EAC3C;EAEA,MAAM,aAAyB;GAC7B;GACA;GACA,QAAQ,KAAA;GACR;GACA;GACA,SAAS,mBAAmB,UACxB;IACE,WAAW,mBAAmB;IAC9B,WAAW,gBAAgB,mBAAmB,OAAO;GACvD,IACA,KAAA;GACJ,aAAa,OAAO,eAAe,IAAI,IAAI,eAAe,cAAc;GACxE,iBAAiB;EACnB;EACA,MAAM,SAAS,KAAKY,WAAW,YAAY,SAAS;EACpD,IAAI,CAAC,WACH,yBAAyB,MAAM,KAAKR,WAAW;EAGjD,KAAKJ,aAAa,KAAK,UAAU;EACjC,OAAO;CACT;CAEA,YAAY,KAAe;EACzB,OAAO,OAAO,YACZ,OAAO,QAAQ,GAAG,EAAE,KAAK,CAAC,KAAK,WAAW,CACxC,KACA,aAAa,OAAO,KAAKE,SAAS,KAAK,IAAI,CAC7C,CAAC,CACH;CACF;CAEA,CAACS,OAAO,KAAmB,YAAgD;EACzE,MAAM,EAAC,MAAM,UAAS;EAGtB,MAAM,iBAAiB,OADT,KAAKE,cAAc,KAAK,WAAW,SAAS,WAAW,IACvC,CAAK;EAEnC,MAAM,kBAAkB,KAAKL,OAAO,MAAM,IAAI,eAAe,IAAI;EACjE,gBAAgB,UAAU,aAAa,IAAI;EAC3C,MAAM,cAAc,gBAAgB,UAAU,QAC5C,GAAG,eAAe,MACpB;EACA,IAAI;GACF,OAAO,UAAU,KAAKP,QAAQ,eAAe,IAAI;GAEjD,IAAI,MAAM;IACR,MAAM,aAAa,eAAe,MAAM,IAAI,OAAO;IACnD,OAAO,kBACL,mBACE,oBACE,IAAI,OAAO,KACX,KAAKa,oBACH,KAAKZ,UACL,aACA,eAAe,MACf,KACF,GACA,IAAI,YACJ,KAAKa,UACL,WAAW,iBACX,YACA,WAAW,SAAS,WACpB,IAAI,gBACN,GACA,KAAKR,YACP,GACA,IAAI,OACJ,UACF;GACF,OACE,OAAO,mBACL,6BACE,KAAKO,oBACH,KAAKZ,UACL,aACA,eAAe,MACf,KACF,GACA,IAAI,YACJ,KAAKa,UACL,WAAW,iBACX,KAAKX,aACL,WAAW,SAAS,WACpB,IAAI,gBACN,GACA,KAAKG,YACP;EAEJ,UAAU;GAER,YAAY,SAAS;GACrB,IAAI,OAAO;IACT,IAAI,cAAc;IAClB,MAAM,YAAsB,CAAC;IAC7B,KAAK,IAAI,IAAI,IAAK,KAAK;KACrB,MAAM,SAAS,gBAAgB,UAAU,WACvC,GACA,gBAAgB,wBAChB,CACF;KACA,IAAI,WAAW,KAAA,GACb;KAEF,eAAe,OAAO,MAAM;KAC5B,MAAM,UAAU,gBAAgB,UAAU,WACxC,GACA,gBAAgB,yBAChB,CACF;KACA,IAAI,OAAO,YAAY,YAAY,QAAQ,SAAS,GAClD,UAAU,KAAK,OAAO;IAE1B;IACA,IAAI,gBAAgB,GAClB,MAAM,aAAa,KAAKN,QAAQ,eAAe,MAAM,WAAW;IAElE,IAAI,UAAU,SAAS,GACrB,MAAM,cAAc,KAAKA,QAAQ,eAAe,MAAM,SAAS;IAEjE,gBAAgB,UAAU,gBAAgB;GAC5C;GACA,KAAKO,OAAO,MAAM,OAAO,eAAe;EAC1C;CACF;CAEA,CAACM,oBACC,YACA,aACA,OACA,OACuB;EACvB,IAAI;EACJ,GAAG;GACD,SAAS,YACP,KAAKR,KACL,EAAE,YACF,KAAKD,WAAW,mBACV,YAAY,KAAK,GACvB,KAAKA,WAAW,wBAEd,uCAAuC,MAAM,4BACjD;GACA,IAAI,OAAO,MACT;GAEF,MAAM,MAAM,gBAAgB,YAAY,OAAO,OAAO,KAAKJ,MAAM;GACjE,OAAO,UAAU,KAAKA,QAAQ,OAAO,GAAG;GACxC,MAAM;EACR,SAAS,CAAC,OAAO;CACnB;CAEA,CAAC,KAAK,QAAuC;EAC3C,KAAK,MAAM,UAAU,KAAK,QAAQ,MAAM,GACtC,IAAI,WAAW,SACb,MAAM;CAGZ;CAEA,CAAC,QAAQ,QAAsB;EAC7B,MAAM,UAAU,QACd,KAAKO,OAAO,YAAY,IACtB,GAAG,cAAc,KAAKJ,aAAa,KAAK,KAAKF,QAAQ,CACvD,GAAG,WAAW;EAChB,MAAM,cAAc,MAA4B,KAAKa,WAAW;EAChE,MAAM,eAAe,MAAoB,KAAKC,aAAa,CAAC;EAE5D,OAAO,6BACL,KAAKhB,cACL,QACA,QACA,YACA,mBACM,EAAE,KAAKiB,UACf;CACF;CAEA,aAAa,QAAsB;EACjC,QAAQ,OAAO,IAAf;GACE,KAAK;IACH,KAAKT,OAAO,OAAO,IACjB,GAAG,cAED,OAAO,KAAK,KAAKN,QAAQ,GACzB,OAAO,IACP,KAAKA,QACP,CACF;IACA;GACF,KAAK;IACH,KAAKM,OAAO,OAAO,IACjB,GAAG,cACD,KAAKJ,aACL,OAAO,IACP,KAAKF,QACP,CACF;IACA;GACF,KAAK;IAEH,IACE,aACE,OAAO,IACP,OAAO,IACP,KAAKA,UACL,KAAKE,WACP,GACA;KACA,MAAM,YAAY;MAChB,GAAG,OAAO;MACV,GAAG,OAAO;KACZ;KACA,MAAM,SAAS,CACb,GAAG,iBAAiB,KAAKF,UAAU,KAAKE,aAAa,SAAS,GAC9D,GAAG,cAAc,KAAKA,aAAa,WAAW,KAAKF,QAAQ,CAC7D;KACA,KAAK,KAAKM,OAAO,MAAM,EAAE,IAAI,MAAM;IACrC,OAAO;KACL,KAAKA,OAAO,OAAO,IACjB,GAAG,cACD,KAAKJ,aACL,OAAO,IACP,KAAKF,QACP,CACF;KACA,KAAKM,OAAO,OAAO,IACjB,GAAG,cACD,OAAO,KAAK,KAAKN,QAAQ,GACzB,OAAO,IACP,KAAKA,QACP,CACF;IACF;IAEA;GAEF,SACE,YAAY,MAAM;EACtB;CACF;CAEA,mCAAmB,IAAI,IAAoB;CAE3C,YAAY,SAA2B;EACrC,MAAM,YAAY,KAAK,UAAU,OAAO;EACxC,IAAI,OAAO,KAAKgB,iBAAiB,IAAI,SAAS;EAC9C,IAAI,CAAC,MAAM;GACT,OAAO,QACL,GAAG,UAAU,KAAKR,YAAY,QAAQ,IAAI,MACxC,KAAKT,MACP,EAAE,SAAS,IAAI,KACb,QAAQ,KAAI,MAAK,GAAG,GAAG,IAAI,MAAM,CAAC,EAAE,GAAG,GACvC,GAAG,MACL,GACF;GACA,KAAKiB,iBAAiB,IAAI,WAAW,IAAI;EAC3C;EACA,OAAO;CACT;;;;;;;;CASA,OAAO,QAA8B;EACnC,MAAM,UAAU,OAAO,KAAK,MAAM;EAElC,MAAM,OAAO,KAAKC,YAAY,OAAO;EACrC,MAAM,MAAM,KAAKX,OAAO,MAAM,IAAI,OAAM,WACtC,OAAO,UACJ,aAAa,IAAI,EACjB,IAAS,GAAG,cAAc,SAAS,QAAQ,KAAKN,QAAQ,CAAC,CAC9D;EACA,IAAI,KACF,OAAO,gBAAgB,KAAKA,UAAU,KAAK,KAAKD,MAAM;EAExD,OAAO;CACT;CAEA,cACE,SACA,SACA,OACU;EACV,OAAO,iBACL,KAAKA,QACL,KAAKC,UACL,QAAQ,YACR,SACA,OACA,QAAQ,SACR,QAAQ,OACR,QAAQ,gBACV;CACF;AACF;AAEA,SAAS,iBACP,IACA,WAC0B;CAC1B,MAAM,iBAAiB,OACrB,GAAG;;;;;6BAKsB,UAAU;;;;wBAKrC;CAEA,MAAM,UADO,GAAG,QAAQ,eAAe,IACvB,EAAK,IAA2B,GAAG,eAAe,MAAM;CACxE,OAAO,IAAI,IACT,QAAQ,KAAK,EAAC,kBAAiB;EAC7B,MAAM,UAAU,KAAK,MAAM,WAAW;EACtC,MAAM,MAAM,IAAI,IAAY,OAAO;EACnC,OAAO,CAAC,KAAK,UAAU,QAAQ,KAAK,CAAC,GAAG,GAAG;CAC7C,CAAC,CACH;AACF;AAEA,SAAgB,cACd,SACA,KACA,aACoB;CACpB,OAAO,QAAQ,KAAI,QAAO,aAAa,IAAI,MAAM,YAAY,KAAK,IAAI,CAAC;AACzE;AAiBA,SAAgB,gBACd,YACA,KACA,WACK;CACL,MAAM,SAAwB,CAAC;CAC/B,KAAK,MAAM,OAAO,OAAO,KAAK,GAAG,GAAG;EAClC,MAAM,YAAY,WAAW;EAC7B,IAAI,cAAc,KAAA,GAAW;GAC3B,MAAM,aAAa,OAAO,KAAK,UAAU,EAAE,KAAK,EAAE,KAAK,IAAI;GAC3D,MAAM,IAAI,MACR,mBAAmB,IAAI,eAAe,UAAU,4BAA4B,YAC9E;EACF;EACA,OAAO,OAAO,eAAe,UAAU,MAAM,IAAI,MAAM,KAAK,SAAS;CACvE;CACA,OAAO;AACT;AAEA,SAAS,eACP,WACA,GACA,QACA,WACO;CACP,IAAI,MAAM,MACR,OAAO;CAET,QAAQ,WAAR;EACE,KAAK,WACH,OAAO,CAAC,CAAC;EACX,KAAK;EACL,KAAK;EACL,KAAK;GACH,IAAI,OAAO,MAAM,UAAU;IACzB,IAAI,IAAI,OAAO,oBAAoB,IAAI,OAAO,kBAC5C,MAAM,IAAI,sBACR,SAAS,EAAE,OAAO,UAAU,GAAG,OAAO,iCACxC;IAEF,OAAO,OAAO,CAAC;GACjB;GACA,OAAO;EACT,KAAK,QACH,IAAI;GACF,OAAO,KAAK,MAAM,CAAW;EAC/B,SAAS,OAAO;GAGd,MAAM,IAAI,sBACR,4BAA4B,UAAU,GAAG,OAAO,IAFhD,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,KAGrD,EAAC,OAAO,MAAK,CACf;EACF;CACJ;AACF;AAEA,IAAa,wBAAb,cAA2C,MAAM,CAAC;AAElD,SAAS,aACP,QACA,KACA,SACA,YACS;CACT,KAAK,MAAM,MAAM,YACf,IAAI,OAAO,QAAQ,IAAI,KACrB,OAAO;CAGX,OAAO,OAAO,KAAK,OAAO,EAAE,SAAS,WAAW;AAClD;AAEA,SAAS,iBACP,SACA,YACA,KACmB;CACnB,OAAO,eAAe,SAAS,UAAU,EAAE,KAAI,MAC7C,aAAa,IAAI,IAAI,QAAQ,GAAG,IAAI,CACtC;AACF;AAEA,SAAS,eACP,SACA,YACA;CACA,OAAO,OAAO,KAAK,OAAO,EAAE,QAAO,MAAK,CAAC,WAAW,SAAS,CAAC,CAAC;AACjE;AAEA,UAAU,mBAAmB,QAAsB,aAA4B;CAC7E,KAAK,MAAM,KAAK,QAAQ;EACtB,IAAI,YAAY,GACd,MAAM;EAER,MAAM;CACR;AACF"}
+{"version":3,"file":"table-source.js","names":["#dbCache","#connections","#table","#columns","#uniqueIndexes","#uniqueIndexColumns","#primaryKey","#logConfig","#lc","#shouldYield","#stmts","#getStatementsFor","#allColumns","#fetch","#getSchema","#requestToSQL","#mapFromSQLiteTypes","#overlay","#writeChange","#pushEpoch","#getRowStmtCache","#getRowStmt"],"sources":["../../../../zqlite/src/table-source.ts"],"sourcesContent":["import type {SQLQuery} from '@databases/sql';\nimport type {LogContext} from '@rocicorp/logger';\nimport SQLite3Database from '@rocicorp/zero-sqlite3';\nimport type {LogConfig} from '../../otel/src/log-options.ts';\nimport {timeSampled} from '../../otel/src/maybe-time.ts';\nimport {assert, unreachable} from '../../shared/src/asserts.ts';\nimport {must} from '../../shared/src/must.ts';\nimport type {Writable} from '../../shared/src/writable.ts';\nimport type {Condition, Ordering} from '../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../zero-protocol/src/data.ts';\nimport type {PrimaryKey} from '../../zero-protocol/src/primary-key.ts';\nimport type {\n  SchemaValue,\n  ValueType,\n} from '../../zero-schema/src/table-schema.ts';\nimport type {DebugDelegate} from '../../zql/src/builder/debug-delegate.ts';\nimport {\n  createPredicate,\n  transformFilters,\n} from '../../zql/src/builder/filter.ts';\nimport {ChangeType} from '../../zql/src/ivm/change-type.ts';\nimport {makeComparator, type Node} from '../../zql/src/ivm/data.ts';\nimport {\n  generateWithOverlay,\n  generateWithOverlayUnordered,\n  generateWithStart,\n  genPushAndWriteWithSplitEdit,\n  type Connection,\n  type Overlay,\n} from '../../zql/src/ivm/memory-source.ts';\nimport {type FetchRequest} from '../../zql/src/ivm/operator.ts';\nimport type {SourceSchema} from '../../zql/src/ivm/schema.ts';\nimport {SourceChangeIndex} from '../../zql/src/ivm/source-change-index.ts';\nimport {\n  type Source,\n  type SourceChange,\n  type SourceInput,\n} from '../../zql/src/ivm/source.ts';\nimport type {Stream} from '../../zql/src/ivm/stream.ts';\nimport {assertOrderingIncludesPK} from '../../zql/src/query/complete-ordering.ts';\nimport type {Database, Statement} from './db.ts';\nimport {compile, format, sql} from './internal/sql.ts';\nimport {StatementCache} from './internal/statement-cache.ts';\nimport {\n  buildSelectQuery,\n  toSQLiteType,\n  type NoSubqueryCondition,\n} from './query-builder.ts';\n\ntype Statements = {\n  readonly cache: StatementCache;\n  readonly insert: Statement;\n  readonly delete: Statement;\n  readonly update: Statement | undefined;\n  readonly checkExists: Statement;\n  readonly getExisting: Statement;\n};\n\nlet eventCount = 0;\n\n/**\n * A source that is backed by a SQLite table.\n *\n * Values are written to the backing table _after_ being vended by the source.\n *\n * This ordering of events is to ensure self joins function properly. That is,\n * we can't reveal a value to an output before it has been pushed to that output.\n *\n * The code is fairly straightforward except for:\n * 1. Dealing with a `fetch` that has a basis of `before`.\n * 2. Dealing with compound orders that have differing directions (a ASC, b DESC, c ASC)\n *\n * See comments in relevant functions for more details.\n */\nexport class TableSource implements Source {\n  readonly #dbCache = new WeakMap<Database, Statements>();\n  readonly #connections: Connection[] = [];\n  readonly #table: string;\n  readonly #columns: Record<string, SchemaValue>;\n  // Maps sorted columns JSON string (e.g. '[\"a\",\"b\"]) to Set of columns.\n  readonly #uniqueIndexes: Map<string, Set<string>>;\n  readonly #uniqueIndexColumns: readonly PrimaryKey[];\n  readonly #primaryKey: PrimaryKey;\n  readonly #logConfig: LogConfig;\n  readonly #lc: LogContext;\n  readonly #shouldYield: () => boolean;\n  #stmts: Statements;\n  #overlay?: Overlay | undefined;\n  #pushEpoch = 0;\n\n  /**\n   * @param shouldYield a function called after each row is read from the database,\n   * which should return true if the source should yield the special 'yield' value\n   * to yield control back to the caller at the end of the pipeline.  Can\n   * also throw an error to abort the pipeline processing.\n   */\n  constructor(\n    logContext: LogContext,\n    logConfig: LogConfig,\n    db: Database,\n    tableName: string,\n    columns: Record<string, SchemaValue>,\n    primaryKey: PrimaryKey,\n    shouldYield = () => false,\n  ) {\n    this.#lc = logContext;\n    this.#logConfig = logConfig;\n    this.#table = tableName;\n    this.#columns = columns;\n    this.#uniqueIndexes = getUniqueIndexes(db, tableName);\n    // `keyMatchesPrimaryKey` requires the compared key to be pre-sorted and\n    // non-empty.  A unique index always has >= 1 column, hence the cast.\n    this.#uniqueIndexColumns = Array.from(\n      this.#uniqueIndexes.values(),\n      set => [...set].toSorted() as unknown as PrimaryKey,\n    );\n    this.#primaryKey = primaryKey;\n    this.#stmts = this.#getStatementsFor(db);\n    this.#shouldYield = shouldYield;\n\n    assert(\n      this.#uniqueIndexes.has(JSON.stringify(primaryKey.toSorted())),\n      `primary key ${primaryKey} does not have a UNIQUE index`,\n    );\n  }\n\n  get tableSchema() {\n    return {\n      name: this.#table,\n      columns: this.#columns,\n      primaryKey: this.#primaryKey,\n    };\n  }\n\n  /**\n   * Sets the db (snapshot) to use, to facilitate the Snapshotter leapfrog\n   * algorithm for concurrent traversal of historic timelines.\n   */\n  setDB(db: Database) {\n    this.#stmts = this.#getStatementsFor(db);\n  }\n\n  #getStatementsFor(db: Database) {\n    const cached = this.#dbCache.get(db);\n    if (cached) {\n      return cached;\n    }\n\n    const stmts = {\n      cache: new StatementCache(db),\n      insert: db.prepare(\n        compile(\n          sql`INSERT INTO ${sql.ident(this.#table)} (${sql.join(\n            Object.keys(this.#columns).map(c => sql.ident(c)),\n            ', ',\n          )}) VALUES (${sql.__dangerous__rawValue(\n            Array.from({length: Object.keys(this.#columns).length})\n              .fill('?')\n              .join(','),\n          )})`,\n        ),\n      ),\n      delete: db.prepare(\n        compile(\n          sql`DELETE FROM ${sql.ident(this.#table)} WHERE ${sql.join(\n            this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n            ' AND ',\n          )}`,\n        ),\n      ),\n      // If all the columns are part of the primary key, we cannot use UPDATE.\n      update:\n        Object.keys(this.#columns).length > this.#primaryKey.length\n          ? db.prepare(\n              compile(\n                sql`UPDATE ${sql.ident(this.#table)} SET ${sql.join(\n                  nonPrimaryKeys(this.#columns, this.#primaryKey).map(\n                    c => sql`${sql.ident(c)}=?`,\n                  ),\n                  ',',\n                )} WHERE ${sql.join(\n                  this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n                  ' AND ',\n                )}`,\n              ),\n            )\n          : undefined,\n      checkExists: db.prepare(\n        compile(\n          sql`SELECT 1 AS \"exists\" FROM ${sql.ident(\n            this.#table,\n          )} WHERE ${sql.join(\n            this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n            ' AND ',\n          )} LIMIT 1`,\n        ),\n      ),\n      getExisting: db.prepare(\n        compile(\n          sql`SELECT * FROM ${sql.ident(this.#table)} WHERE ${sql.join(\n            this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n            ' AND ',\n          )}`,\n        ),\n      ),\n    };\n    this.#dbCache.set(db, stmts);\n    return stmts;\n  }\n\n  get #allColumns() {\n    return sql.join(\n      Object.keys(this.#columns).map(c => sql.ident(c)),\n      sql`,`,\n    );\n  }\n\n  #getSchema(connection: Connection, unordered: boolean): SourceSchema {\n    return {\n      tableName: this.#table,\n      columns: this.#columns,\n      primaryKey: this.#primaryKey,\n      uniqueIndexes: this.#uniqueIndexColumns,\n      sort: unordered ? undefined : connection.sort,\n      relationships: {},\n      isHidden: false,\n      system: 'client',\n      compareRows: connection.compareRows,\n    };\n  }\n\n  connect(\n    sort: Ordering | undefined,\n    filters?: Condition,\n    splitEditKeys?: Set<string>,\n    debug?: DebugDelegate,\n  ) {\n    const transformedFilters = transformFilters(filters);\n    const unordered = sort === undefined;\n    // PK comparator is used for source-level overlay matching (remove by PK\n    // equality) even when no ordering is requested.\n    const primaryKeySort: Ordering = this.#primaryKey.map(k => [k, 'asc']);\n\n    const input: SourceInput = {\n      getSchema: () => schema,\n      fetch: req => this.#fetch(req, connection),\n      setOutput: output => {\n        connection.output = output;\n      },\n      destroy: () => {\n        const idx = this.#connections.indexOf(connection);\n        assert(idx !== -1, 'Connection not found');\n        this.#connections.splice(idx, 1);\n      },\n      fullyAppliedFilters: !transformedFilters.conditionsRemoved,\n    };\n\n    const connection: Connection = {\n      input,\n      debug,\n      output: undefined,\n      sort,\n      splitEditKeys,\n      filters: transformedFilters.filters\n        ? {\n            condition: transformedFilters.filters,\n            predicate: createPredicate(transformedFilters.filters),\n          }\n        : undefined,\n      compareRows: sort ? makeComparator(sort) : makeComparator(primaryKeySort),\n      lastPushedEpoch: 0,\n    };\n    const schema = this.#getSchema(connection, unordered);\n    if (!unordered) {\n      assertOrderingIncludesPK(sort, this.#primaryKey);\n    }\n\n    this.#connections.push(connection);\n    return input;\n  }\n\n  toSQLiteRow(row: Row): Row {\n    return Object.fromEntries(\n      Object.entries(row).map(([key, value]) => [\n        key,\n        toSQLiteType(value, this.#columns[key].type),\n      ]),\n    ) as Row;\n  }\n\n  *#fetch(req: FetchRequest, connection: Connection): Stream<Node | 'yield'> {\n    const {sort, debug} = connection;\n\n    const query = this.#requestToSQL(req, connection.filters?.condition, sort);\n    const sqlAndBindings = format(query);\n\n    const cachedStatement = this.#stmts.cache.get(sqlAndBindings.text);\n    cachedStatement.statement.safeIntegers(true);\n    const rowIterator = cachedStatement.statement.iterate<Row>(\n      ...sqlAndBindings.values,\n    );\n    try {\n      debug?.initQuery(this.#table, sqlAndBindings.text);\n\n      if (sort) {\n        const comparator = makeComparator(sort, req.reverse);\n        yield* generateWithStart(\n          generateWithYields(\n            generateWithOverlay(\n              req.start?.row,\n              this.#mapFromSQLiteTypes(\n                this.#columns,\n                rowIterator,\n                sqlAndBindings.text,\n                debug,\n              ),\n              req.constraint,\n              this.#overlay,\n              connection.lastPushedEpoch,\n              comparator,\n              connection.filters?.predicate,\n              req.multiConstraints,\n            ),\n            this.#shouldYield,\n          ),\n          req.start,\n          comparator,\n        );\n      } else {\n        yield* generateWithYields(\n          generateWithOverlayUnordered(\n            this.#mapFromSQLiteTypes(\n              this.#columns,\n              rowIterator,\n              sqlAndBindings.text,\n              debug,\n            ),\n            req.constraint,\n            this.#overlay,\n            connection.lastPushedEpoch,\n            this.#primaryKey,\n            connection.filters?.predicate,\n            req.multiConstraints,\n          ),\n          this.#shouldYield,\n        );\n      }\n    } finally {\n      // Ensure the SQLite iterate() is closed.\n      rowIterator.return?.();\n      if (debug) {\n        let totalNvisit = 0;\n        let i = 0;\n        while (true) {\n          const nvisit = cachedStatement.statement.scanStatus(\n            i++,\n            SQLite3Database.SQLITE_SCANSTAT_NVISIT,\n            1,\n          );\n          if (nvisit === undefined) {\n            break;\n          }\n          totalNvisit += Number(nvisit);\n        }\n        if (totalNvisit !== 0) {\n          debug.recordNVisit(this.#table, sqlAndBindings.text, totalNvisit);\n        }\n        cachedStatement.statement.scanStatusReset();\n      }\n      this.#stmts.cache.return(cachedStatement);\n    }\n  }\n\n  *#mapFromSQLiteTypes(\n    valueTypes: Record<string, SchemaValue>,\n    rowIterator: IterableIterator<Row>,\n    query: string,\n    debug: DebugDelegate | undefined,\n  ): IterableIterator<Row> {\n    let result;\n    do {\n      result = timeSampled(\n        this.#lc,\n        ++eventCount,\n        this.#logConfig.ivmSampling,\n        () => rowIterator.next(),\n        this.#logConfig.slowRowThreshold,\n        () =>\n          `table-source.next took too long for ${query}. Are you missing an index?`,\n      );\n      if (result.done) {\n        break;\n      }\n      const row = fromSQLiteTypes(valueTypes, result.value, this.#table);\n      debug?.rowVended(this.#table, query, row);\n      yield row;\n    } while (!result.done);\n  }\n\n  *push(change: SourceChange): Stream<'yield'> {\n    for (const result of this.genPush(change)) {\n      if (result === 'yield') {\n        yield result;\n      }\n    }\n  }\n\n  *genPush(change: SourceChange) {\n    const exists = (row: Row) =>\n      this.#stmts.checkExists.get<{exists: number} | undefined>(\n        ...toSQLiteTypes(this.#primaryKey, row, this.#columns),\n      )?.exists === 1;\n    const setOverlay = (o: Overlay | undefined) => (this.#overlay = o);\n    const writeChange = (c: SourceChange) => this.#writeChange(c);\n\n    yield* genPushAndWriteWithSplitEdit(\n      this.#connections,\n      change,\n      exists,\n      setOverlay,\n      writeChange,\n      () => ++this.#pushEpoch,\n    );\n  }\n\n  #writeChange(change: SourceChange) {\n    switch (change[SourceChangeIndex.TYPE]) {\n      case ChangeType.ADD:\n        this.#stmts.insert.run(\n          ...toSQLiteTypes(\n            // TODO(arv): Compute this once!\n            Object.keys(this.#columns),\n            change[SourceChangeIndex.ROW],\n            this.#columns,\n          ),\n        );\n        break;\n      case ChangeType.REMOVE:\n        this.#stmts.delete.run(\n          ...toSQLiteTypes(\n            this.#primaryKey,\n            change[SourceChangeIndex.ROW],\n            this.#columns,\n          ),\n        );\n        break;\n      case ChangeType.EDIT: {\n        // If the PK is the same, use UPDATE.\n        if (\n          canUseUpdate(\n            change[SourceChangeIndex.OLD_ROW],\n            change[SourceChangeIndex.ROW],\n            this.#columns,\n            this.#primaryKey,\n          )\n        ) {\n          const mergedRow = {\n            ...change[SourceChangeIndex.OLD_ROW],\n            ...change[SourceChangeIndex.ROW],\n          };\n          const params = [\n            ...nonPrimaryValues(this.#columns, this.#primaryKey, mergedRow),\n            ...toSQLiteTypes(this.#primaryKey, mergedRow, this.#columns),\n          ];\n          must(this.#stmts.update).run(params);\n        } else {\n          this.#stmts.delete.run(\n            ...toSQLiteTypes(\n              this.#primaryKey,\n              change[SourceChangeIndex.OLD_ROW],\n              this.#columns,\n            ),\n          );\n          this.#stmts.insert.run(\n            ...toSQLiteTypes(\n              Object.keys(this.#columns),\n              change[SourceChangeIndex.ROW],\n              this.#columns,\n            ),\n          );\n        }\n\n        break;\n      }\n      default:\n        unreachable(change);\n    }\n  }\n\n  #getRowStmtCache = new Map<string, string>();\n\n  #getRowStmt(keyCols: string[]): string {\n    const keyString = JSON.stringify(keyCols);\n    let stmt = this.#getRowStmtCache.get(keyString);\n    if (!stmt) {\n      stmt = compile(\n        sql`SELECT ${this.#allColumns} FROM ${sql.ident(\n          this.#table,\n        )} WHERE ${sql.join(\n          keyCols.map(k => sql`${sql.ident(k)}=?`),\n          sql` AND`,\n        )}`,\n      );\n      this.#getRowStmtCache.set(keyString, stmt);\n    }\n    return stmt;\n  }\n\n  /**\n   * Retrieves a row from the backing DB by a unique key, or `undefined` if such a\n   * row does not exist. This is not used in the IVM pipeline but is useful\n   * for retrieving data that is consistent with the state (and type\n   * semantics) of the pipeline. Note that this key may not necessarily correspond\n   * to the `primaryKey` with which this TableSource.\n   */\n  getRow(rowKey: Row): Row | undefined {\n    const keyCols = Object.keys(rowKey);\n\n    const stmt = this.#getRowStmt(keyCols);\n    const row = this.#stmts.cache.use(stmt, cached =>\n      cached.statement\n        .safeIntegers(true)\n        .get<Row>(...toSQLiteTypes(keyCols, rowKey, this.#columns)),\n    );\n    if (row) {\n      return fromSQLiteTypes(this.#columns, row, this.#table);\n    }\n    return row;\n  }\n\n  #requestToSQL(\n    request: FetchRequest,\n    filters: NoSubqueryCondition | undefined,\n    order: Ordering | undefined,\n  ): SQLQuery {\n    return buildSelectQuery(\n      this.#table,\n      this.#columns,\n      request.constraint,\n      filters,\n      order,\n      request.reverse,\n      request.start,\n      request.multiConstraints,\n    );\n  }\n}\n\nfunction getUniqueIndexes(\n  db: Database,\n  tableName: string,\n): Map<string, Set<string>> {\n  const sqlAndBindings = format(\n    sql`\n    SELECT idx.name, json_group_array(col.name) as columnsJSON\n      FROM sqlite_master as idx\n      JOIN pragma_index_list(idx.tbl_name) AS info ON info.name = idx.name\n      JOIN pragma_index_info(idx.name) as col\n      WHERE idx.tbl_name = ${tableName} AND\n            idx.type = 'index' AND \n            info.\"unique\" != 0\n      GROUP BY idx.name\n      ORDER BY idx.name`,\n  );\n  const stmt = db.prepare(sqlAndBindings.text);\n  const indexes = stmt.all<{columnsJSON: string}>(...sqlAndBindings.values);\n  return new Map(\n    indexes.map(({columnsJSON}) => {\n      const columns = JSON.parse(columnsJSON);\n      const set = new Set<string>(columns);\n      return [JSON.stringify(columns.sort()), set];\n    }),\n  );\n}\n\nexport function toSQLiteTypes(\n  columns: readonly string[],\n  row: Row,\n  columnTypes: Record<string, SchemaValue>,\n): readonly unknown[] {\n  return columns.map(col => toSQLiteType(row[col], columnTypes[col].type));\n}\n\nexport function toSQLiteTypeName(type: ValueType) {\n  switch (type) {\n    case 'boolean':\n      return 'INTEGER';\n    case 'number':\n      return 'REAL';\n    case 'string':\n      return 'TEXT';\n    case 'null':\n      return 'NULL';\n    case 'json':\n      return 'TEXT';\n  }\n}\n\nexport function fromSQLiteTypes(\n  valueTypes: Record<string, SchemaValue>,\n  row: Row,\n  tableName: string,\n): Row {\n  const newRow: Writable<Row> = {};\n  for (const key of Object.keys(row)) {\n    const valueType = valueTypes[key];\n    if (valueType === undefined) {\n      const columnList = Object.keys(valueTypes).sort().join(', ');\n      throw new Error(\n        `Invalid column \"${key}\" for table \"${tableName}\". Synced columns include ${columnList}`,\n      );\n    }\n    newRow[key] = fromSQLiteType(valueType.type, row[key], key, tableName);\n  }\n  return newRow;\n}\n\nfunction fromSQLiteType(\n  valueType: ValueType,\n  v: Value,\n  column: string,\n  tableName: string,\n): Value {\n  if (v === null) {\n    return null;\n  }\n  switch (valueType) {\n    case 'boolean':\n      return !!v;\n    case 'number':\n    case 'string':\n    case 'null':\n      if (typeof v === 'bigint') {\n        if (v > Number.MAX_SAFE_INTEGER || v < Number.MIN_SAFE_INTEGER) {\n          throw new UnsupportedValueError(\n            `value ${v} (in ${tableName}.${column}) is outside of supported bounds`,\n          );\n        }\n        return Number(v);\n      }\n      return v;\n    case 'json':\n      try {\n        return JSON.parse(v as string);\n      } catch (error) {\n        const errorMessage =\n          error instanceof Error ? error.message : String(error);\n        throw new UnsupportedValueError(\n          `Failed to parse JSON for ${tableName}.${column}: ${errorMessage}`,\n          {cause: error},\n        );\n      }\n  }\n}\n\nexport class UnsupportedValueError extends Error {}\n\nfunction canUseUpdate(\n  oldRow: Row,\n  row: Row,\n  columns: Record<string, SchemaValue>,\n  primaryKey: PrimaryKey,\n): boolean {\n  for (const pk of primaryKey) {\n    if (oldRow[pk] !== row[pk]) {\n      return false;\n    }\n  }\n  return Object.keys(columns).length > primaryKey.length;\n}\n\nfunction nonPrimaryValues(\n  columns: Record<string, SchemaValue>,\n  primaryKey: PrimaryKey,\n  row: Row,\n): Iterable<unknown> {\n  return nonPrimaryKeys(columns, primaryKey).map(c =>\n    toSQLiteType(row[c], columns[c].type),\n  );\n}\n\nfunction nonPrimaryKeys(\n  columns: Record<string, SchemaValue>,\n  primaryKey: PrimaryKey,\n) {\n  return Object.keys(columns).filter(c => !primaryKey.includes(c));\n}\n\nfunction* generateWithYields(stream: Stream<Node>, shouldYield: () => boolean) {\n  for (const n of stream) {\n    if (shouldYield()) {\n      yield 'yield';\n    }\n    yield n;\n  }\n}\n"],"mappings":";;;;;;;;;;;;AA0DA,IAAI,aAAa;;;;;;;;;;;;;;;AAgBjB,IAAa,cAAb,MAA2C;CACzC,2BAAoB,IAAI,SAA+B;CACvD,eAAsC,EAAE;CACxC;CACA;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,aAAa;;;;;;;CAQb,YACE,YACA,WACA,IACA,WACA,SACA,YACA,oBAAoB,OACpB;AACA,QAAA,KAAW;AACX,QAAA,YAAkB;AAClB,QAAA,QAAc;AACd,QAAA,UAAgB;AAChB,QAAA,gBAAsB,iBAAiB,IAAI,UAAU;AAGrD,QAAA,qBAA2B,MAAM,KAC/B,MAAA,cAAoB,QAAQ,GAC5B,QAAO,CAAC,GAAG,IAAI,CAAC,UAAU,CAC3B;AACD,QAAA,aAAmB;AACnB,QAAA,QAAc,MAAA,iBAAuB,GAAG;AACxC,QAAA,cAAoB;AAEpB,SACE,MAAA,cAAoB,IAAI,KAAK,UAAU,WAAW,UAAU,CAAC,CAAC,EAC9D,eAAe,WAAW,+BAC3B;;CAGH,IAAI,cAAc;AAChB,SAAO;GACL,MAAM,MAAA;GACN,SAAS,MAAA;GACT,YAAY,MAAA;GACb;;;;;;CAOH,MAAM,IAAc;AAClB,QAAA,QAAc,MAAA,iBAAuB,GAAG;;CAG1C,kBAAkB,IAAc;EAC9B,MAAM,SAAS,MAAA,QAAc,IAAI,GAAG;AACpC,MAAI,OACF,QAAO;EAGT,MAAM,QAAQ;GACZ,OAAO,IAAI,eAAe,GAAG;GAC7B,QAAQ,GAAG,QACT,QACE,GAAG,eAAe,IAAI,MAAM,MAAA,MAAY,CAAC,IAAI,IAAI,KAC/C,OAAO,KAAK,MAAA,QAAc,CAAC,KAAI,MAAK,IAAI,MAAM,EAAE,CAAC,EACjD,KACD,CAAC,YAAY,IAAI,sBAChB,MAAM,KAAK,EAAC,QAAQ,OAAO,KAAK,MAAA,QAAc,CAAC,QAAO,CAAC,CACpD,KAAK,IAAI,CACT,KAAK,IAAI,CACb,CAAC,GACH,CACF;GACD,QAAQ,GAAG,QACT,QACE,GAAG,eAAe,IAAI,MAAM,MAAA,MAAY,CAAC,SAAS,IAAI,KACpD,MAAA,WAAiB,KAAI,MAAK,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC,IAAI,EACjD,QACD,GACF,CACF;GAED,QACE,OAAO,KAAK,MAAA,QAAc,CAAC,SAAS,MAAA,WAAiB,SACjD,GAAG,QACD,QACE,GAAG,UAAU,IAAI,MAAM,MAAA,MAAY,CAAC,OAAO,IAAI,KAC7C,eAAe,MAAA,SAAe,MAAA,WAAiB,CAAC,KAC9C,MAAK,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC,IACzB,EACD,IACD,CAAC,SAAS,IAAI,KACb,MAAA,WAAiB,KAAI,MAAK,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC,IAAI,EACjD,QACD,GACF,CACF,GACD,KAAA;GACN,aAAa,GAAG,QACd,QACE,GAAG,6BAA6B,IAAI,MAClC,MAAA,MACD,CAAC,SAAS,IAAI,KACb,MAAA,WAAiB,KAAI,MAAK,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC,IAAI,EACjD,QACD,CAAC,UACH,CACF;GACD,aAAa,GAAG,QACd,QACE,GAAG,iBAAiB,IAAI,MAAM,MAAA,MAAY,CAAC,SAAS,IAAI,KACtD,MAAA,WAAiB,KAAI,MAAK,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC,IAAI,EACjD,QACD,GACF,CACF;GACF;AACD,QAAA,QAAc,IAAI,IAAI,MAAM;AAC5B,SAAO;;CAGT,KAAA,aAAkB;AAChB,SAAO,IAAI,KACT,OAAO,KAAK,MAAA,QAAc,CAAC,KAAI,MAAK,IAAI,MAAM,EAAE,CAAC,EACjD,GAAG,IACJ;;CAGH,WAAW,YAAwB,WAAkC;AACnE,SAAO;GACL,WAAW,MAAA;GACX,SAAS,MAAA;GACT,YAAY,MAAA;GACZ,eAAe,MAAA;GACf,MAAM,YAAY,KAAA,IAAY,WAAW;GACzC,eAAe,EAAE;GACjB,UAAU;GACV,QAAQ;GACR,aAAa,WAAW;GACzB;;CAGH,QACE,MACA,SACA,eACA,OACA;EACA,MAAM,qBAAqB,iBAAiB,QAAQ;EACpD,MAAM,YAAY,SAAS,KAAA;EAG3B,MAAM,iBAA2B,MAAA,WAAiB,KAAI,MAAK,CAAC,GAAG,MAAM,CAAC;EAEtE,MAAM,QAAqB;GACzB,iBAAiB;GACjB,QAAO,QAAO,MAAA,MAAY,KAAK,WAAW;GAC1C,YAAW,WAAU;AACnB,eAAW,SAAS;;GAEtB,eAAe;IACb,MAAM,MAAM,MAAA,YAAkB,QAAQ,WAAW;AACjD,WAAO,QAAQ,IAAI,uBAAuB;AAC1C,UAAA,YAAkB,OAAO,KAAK,EAAE;;GAElC,qBAAqB,CAAC,mBAAmB;GAC1C;EAED,MAAM,aAAyB;GAC7B;GACA;GACA,QAAQ,KAAA;GACR;GACA;GACA,SAAS,mBAAmB,UACxB;IACE,WAAW,mBAAmB;IAC9B,WAAW,gBAAgB,mBAAmB,QAAQ;IACvD,GACD,KAAA;GACJ,aAAa,OAAO,eAAe,KAAK,GAAG,eAAe,eAAe;GACzE,iBAAiB;GAClB;EACD,MAAM,SAAS,MAAA,UAAgB,YAAY,UAAU;AACrD,MAAI,CAAC,UACH,0BAAyB,MAAM,MAAA,WAAiB;AAGlD,QAAA,YAAkB,KAAK,WAAW;AAClC,SAAO;;CAGT,YAAY,KAAe;AACzB,SAAO,OAAO,YACZ,OAAO,QAAQ,IAAI,CAAC,KAAK,CAAC,KAAK,WAAW,CACxC,KACA,aAAa,OAAO,MAAA,QAAc,KAAK,KAAK,CAC7C,CAAC,CACH;;CAGH,EAAA,MAAQ,KAAmB,YAAgD;EACzE,MAAM,EAAC,MAAM,UAAS;EAGtB,MAAM,iBAAiB,OADT,MAAA,aAAmB,KAAK,WAAW,SAAS,WAAW,KAAK,CACtC;EAEpC,MAAM,kBAAkB,MAAA,MAAY,MAAM,IAAI,eAAe,KAAK;AAClE,kBAAgB,UAAU,aAAa,KAAK;EAC5C,MAAM,cAAc,gBAAgB,UAAU,QAC5C,GAAG,eAAe,OACnB;AACD,MAAI;AACF,UAAO,UAAU,MAAA,OAAa,eAAe,KAAK;AAElD,OAAI,MAAM;IACR,MAAM,aAAa,eAAe,MAAM,IAAI,QAAQ;AACpD,WAAO,kBACL,mBACE,oBACE,IAAI,OAAO,KACX,MAAA,mBACE,MAAA,SACA,aACA,eAAe,MACf,MACD,EACD,IAAI,YACJ,MAAA,SACA,WAAW,iBACX,YACA,WAAW,SAAS,WACpB,IAAI,iBACL,EACD,MAAA,YACD,EACD,IAAI,OACJ,WACD;SAED,QAAO,mBACL,6BACE,MAAA,mBACE,MAAA,SACA,aACA,eAAe,MACf,MACD,EACD,IAAI,YACJ,MAAA,SACA,WAAW,iBACX,MAAA,YACA,WAAW,SAAS,WACpB,IAAI,iBACL,EACD,MAAA,YACD;YAEK;AAER,eAAY,UAAU;AACtB,OAAI,OAAO;IACT,IAAI,cAAc;IAClB,IAAI,IAAI;AACR,WAAO,MAAM;KACX,MAAM,SAAS,gBAAgB,UAAU,WACvC,KACA,gBAAgB,wBAChB,EACD;AACD,SAAI,WAAW,KAAA,EACb;AAEF,oBAAe,OAAO,OAAO;;AAE/B,QAAI,gBAAgB,EAClB,OAAM,aAAa,MAAA,OAAa,eAAe,MAAM,YAAY;AAEnE,oBAAgB,UAAU,iBAAiB;;AAE7C,SAAA,MAAY,MAAM,OAAO,gBAAgB;;;CAI7C,EAAA,mBACE,YACA,aACA,OACA,OACuB;EACvB,IAAI;AACJ,KAAG;AACD,YAAS,YACP,MAAA,IACA,EAAE,YACF,MAAA,UAAgB,mBACV,YAAY,MAAM,EACxB,MAAA,UAAgB,wBAEd,uCAAuC,MAAM,6BAChD;AACD,OAAI,OAAO,KACT;GAEF,MAAM,MAAM,gBAAgB,YAAY,OAAO,OAAO,MAAA,MAAY;AAClE,UAAO,UAAU,MAAA,OAAa,OAAO,IAAI;AACzC,SAAM;WACC,CAAC,OAAO;;CAGnB,CAAC,KAAK,QAAuC;AAC3C,OAAK,MAAM,UAAU,KAAK,QAAQ,OAAO,CACvC,KAAI,WAAW,QACb,OAAM;;CAKZ,CAAC,QAAQ,QAAsB;EAC7B,MAAM,UAAU,QACd,MAAA,MAAY,YAAY,IACtB,GAAG,cAAc,MAAA,YAAkB,KAAK,MAAA,QAAc,CACvD,EAAE,WAAW;EAChB,MAAM,cAAc,MAA4B,MAAA,UAAgB;EAChE,MAAM,eAAe,MAAoB,MAAA,YAAkB,EAAE;AAE7D,SAAO,6BACL,MAAA,aACA,QACA,QACA,YACA,mBACM,EAAE,MAAA,UACT;;CAGH,aAAa,QAAsB;AACjC,UAAQ,OAAO,IAAf;GACE,KAAK;AACH,UAAA,MAAY,OAAO,IACjB,GAAG,cAED,OAAO,KAAK,MAAA,QAAc,EAC1B,OAAO,IACP,MAAA,QACD,CACF;AACD;GACF,KAAK;AACH,UAAA,MAAY,OAAO,IACjB,GAAG,cACD,MAAA,YACA,OAAO,IACP,MAAA,QACD,CACF;AACD;GACF,KAAK;AAEH,QACE,aACE,OAAO,IACP,OAAO,IACP,MAAA,SACA,MAAA,WACD,EACD;KACA,MAAM,YAAY;MAChB,GAAG,OAAO;MACV,GAAG,OAAO;MACX;KACD,MAAM,SAAS,CACb,GAAG,iBAAiB,MAAA,SAAe,MAAA,YAAkB,UAAU,EAC/D,GAAG,cAAc,MAAA,YAAkB,WAAW,MAAA,QAAc,CAC7D;AACD,UAAK,MAAA,MAAY,OAAO,CAAC,IAAI,OAAO;WAC/B;AACL,WAAA,MAAY,OAAO,IACjB,GAAG,cACD,MAAA,YACA,OAAO,IACP,MAAA,QACD,CACF;AACD,WAAA,MAAY,OAAO,IACjB,GAAG,cACD,OAAO,KAAK,MAAA,QAAc,EAC1B,OAAO,IACP,MAAA,QACD,CACF;;AAGH;GAEF,QACE,aAAY,OAAO;;;CAIzB,mCAAmB,IAAI,KAAqB;CAE5C,YAAY,SAA2B;EACrC,MAAM,YAAY,KAAK,UAAU,QAAQ;EACzC,IAAI,OAAO,MAAA,gBAAsB,IAAI,UAAU;AAC/C,MAAI,CAAC,MAAM;AACT,UAAO,QACL,GAAG,UAAU,MAAA,WAAiB,QAAQ,IAAI,MACxC,MAAA,MACD,CAAC,SAAS,IAAI,KACb,QAAQ,KAAI,MAAK,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC,IAAI,EACxC,GAAG,OACJ,GACF;AACD,SAAA,gBAAsB,IAAI,WAAW,KAAK;;AAE5C,SAAO;;;;;;;;;CAUT,OAAO,QAA8B;EACnC,MAAM,UAAU,OAAO,KAAK,OAAO;EAEnC,MAAM,OAAO,MAAA,WAAiB,QAAQ;EACtC,MAAM,MAAM,MAAA,MAAY,MAAM,IAAI,OAAM,WACtC,OAAO,UACJ,aAAa,KAAK,CAClB,IAAS,GAAG,cAAc,SAAS,QAAQ,MAAA,QAAc,CAAC,CAC9D;AACD,MAAI,IACF,QAAO,gBAAgB,MAAA,SAAe,KAAK,MAAA,MAAY;AAEzD,SAAO;;CAGT,cACE,SACA,SACA,OACU;AACV,SAAO,iBACL,MAAA,OACA,MAAA,SACA,QAAQ,YACR,SACA,OACA,QAAQ,SACR,QAAQ,OACR,QAAQ,iBACT;;;AAIL,SAAS,iBACP,IACA,WAC0B;CAC1B,MAAM,iBAAiB,OACrB,GAAG;;;;;6BAKsB,UAAU;;;;yBAKpC;CAED,MAAM,UADO,GAAG,QAAQ,eAAe,KAAK,CACvB,IAA2B,GAAG,eAAe,OAAO;AACzE,QAAO,IAAI,IACT,QAAQ,KAAK,EAAC,kBAAiB;EAC7B,MAAM,UAAU,KAAK,MAAM,YAAY;EACvC,MAAM,MAAM,IAAI,IAAY,QAAQ;AACpC,SAAO,CAAC,KAAK,UAAU,QAAQ,MAAM,CAAC,EAAE,IAAI;GAC5C,CACH;;AAGH,SAAgB,cACd,SACA,KACA,aACoB;AACpB,QAAO,QAAQ,KAAI,QAAO,aAAa,IAAI,MAAM,YAAY,KAAK,KAAK,CAAC;;AAkB1E,SAAgB,gBACd,YACA,KACA,WACK;CACL,MAAM,SAAwB,EAAE;AAChC,MAAK,MAAM,OAAO,OAAO,KAAK,IAAI,EAAE;EAClC,MAAM,YAAY,WAAW;AAC7B,MAAI,cAAc,KAAA,GAAW;GAC3B,MAAM,aAAa,OAAO,KAAK,WAAW,CAAC,MAAM,CAAC,KAAK,KAAK;AAC5D,SAAM,IAAI,MACR,mBAAmB,IAAI,eAAe,UAAU,4BAA4B,aAC7E;;AAEH,SAAO,OAAO,eAAe,UAAU,MAAM,IAAI,MAAM,KAAK,UAAU;;AAExE,QAAO;;AAGT,SAAS,eACP,WACA,GACA,QACA,WACO;AACP,KAAI,MAAM,KACR,QAAO;AAET,SAAQ,WAAR;EACE,KAAK,UACH,QAAO,CAAC,CAAC;EACX,KAAK;EACL,KAAK;EACL,KAAK;AACH,OAAI,OAAO,MAAM,UAAU;AACzB,QAAI,IAAI,OAAO,oBAAoB,IAAI,OAAO,iBAC5C,OAAM,IAAI,sBACR,SAAS,EAAE,OAAO,UAAU,GAAG,OAAO,kCACvC;AAEH,WAAO,OAAO,EAAE;;AAElB,UAAO;EACT,KAAK,OACH,KAAI;AACF,UAAO,KAAK,MAAM,EAAY;WACvB,OAAO;AAGd,SAAM,IAAI,sBACR,4BAA4B,UAAU,GAAG,OAAO,IAFhD,iBAAiB,QAAQ,MAAM,UAAU,OAAO,MAAM,IAGtD,EAAC,OAAO,OAAM,CACf;;;;AAKT,IAAa,wBAAb,cAA2C,MAAM;AAEjD,SAAS,aACP,QACA,KACA,SACA,YACS;AACT,MAAK,MAAM,MAAM,WACf,KAAI,OAAO,QAAQ,IAAI,IACrB,QAAO;AAGX,QAAO,OAAO,KAAK,QAAQ,CAAC,SAAS,WAAW;;AAGlD,SAAS,iBACP,SACA,YACA,KACmB;AACnB,QAAO,eAAe,SAAS,WAAW,CAAC,KAAI,MAC7C,aAAa,IAAI,IAAI,QAAQ,GAAG,KAAK,CACtC;;AAGH,SAAS,eACP,SACA,YACA;AACA,QAAO,OAAO,KAAK,QAAQ,CAAC,QAAO,MAAK,CAAC,WAAW,SAAS,EAAE,CAAC;;AAGlE,UAAU,mBAAmB,QAAsB,aAA4B;AAC7E,MAAK,MAAM,KAAK,QAAQ;AACtB,MAAI,aAAa,CACf,OAAM;AAER,QAAM"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@rocicorp/zero",
-  "version": "1.6.0-canary.12",
+  "version": "1.6.0-canary.13",
   "description": "Zero is a web framework for serverless web development.",
   "homepage": "https://zero.rocicorp.dev",
   "bugs": {
@@ -129,14 +129,13 @@
     "@fastify/websocket": "^11.0.0",
     "@google-cloud/precise-date": "^4.0.0",
     "@opentelemetry/api": "^1.9.0",
-    "@opentelemetry/api-logs": "^0.218.0",
-    "@opentelemetry/auto-instrumentations-node": "^0.76.0",
-    "@opentelemetry/exporter-metrics-otlp-http": "^0.218.0",
-    "@opentelemetry/resources": "^2.7.1",
-    "@opentelemetry/sdk-metrics": "^2.7.1",
-    "@opentelemetry/sdk-node": "^0.218.0",
-    "@opentelemetry/sdk-trace-node": "^2.7.1",
-    "@opentelemetry/semantic-conventions": "^1.41.1",
+    "@opentelemetry/api-logs": "^0.203.0",
+    "@opentelemetry/auto-instrumentations-node": "^0.62.0",
+    "@opentelemetry/exporter-metrics-otlp-http": "^0.203.0",
+    "@opentelemetry/resources": "^2.0.1",
+    "@opentelemetry/sdk-metrics": "^2.0.1",
+    "@opentelemetry/sdk-node": "^0.203.0",
+    "@opentelemetry/sdk-trace-node": "^2.0.1",
     "@postgresql-typed/oids": "^0.2.0",
     "@rocicorp/lock": "^1.0.4",
     "@rocicorp/logger": "^5.4.0",
@@ -166,61 +165,46 @@
     "pg-format": "npm:pg-format-fix@^1.0.5",
     "postgres": "3.4.7",
     "semver": "^7.5.4",
+    "tsx": "^4.21.0",
     "url-pattern": "^1.0.3",
     "urlpattern-polyfill": "^10.1.0",
     "ws": "^8.18.1"
   },
   "devDependencies": {
     "@op-engineering/op-sqlite": ">=15",
-    "@vitest/runner": "^4.1.6",
-    "analyze-query": "workspace:*",
-    "ast-to-zql": "workspace:*",
+    "@vitest/runner": "^4.1.5",
+    "analyze-query": "0.0.0",
+    "ast-to-zql": "0.0.0",
     "expo-sqlite": ">=15",
-    "replicache": "workspace:*",
-    "shared": "workspace:*",
+    "replicache": "15.2.1",
+    "shared": "0.0.0",
     "syncpack": "^14.3.0",
     "typedoc": "^0.28.17",
     "typedoc-plugin-markdown": "^4.10.0",
     "typescript": "~6.0.2",
-    "vite": "^8.0.13",
-    "vitest": "^4.1.6",
-    "zero-cache": "workspace:*",
-    "zero-client": "workspace:*",
-    "zero-pg": "workspace:*",
-    "zero-react": "workspace:*",
-    "zero-server": "workspace:*",
-    "zero-solid": "workspace:*",
-    "zqlite": "workspace:*"
+    "vite": "8.0.3",
+    "vitest": "^4.1.5",
+    "zero-cache": "0.0.0",
+    "zero-client": "0.0.0",
+    "zero-pg": "0.0.0",
+    "zero-react": "0.0.0",
+    "zero-server": "0.0.0",
+    "zero-solid": "0.0.0",
+    "zqlite": "0.0.0"
   },
   "peerDependencies": {
     "@op-engineering/op-sqlite": ">=15",
-    "drizzle-orm": "^0.45.2",
     "expo-sqlite": ">=15",
-    "kysely": "^0.28.17",
-    "pg": "^8.16.3",
-    "react": "^18.3.1",
-    "solid-js": "^1.9.4"
+    "kysely": "^0.28.16"
   },
   "peerDependenciesMeta": {
-    "@op-engineering/op-sqlite": {
-      "optional": true
-    },
-    "drizzle-orm": {
-      "optional": true
-    },
-    "expo-sqlite": {
-      "optional": true
-    },
     "kysely": {
       "optional": true
     },
-    "pg": {
-      "optional": true
-    },
-    "react": {
+    "expo-sqlite": {
       "optional": true
     },
-    "solid-js": {
+    "@op-engineering/op-sqlite": {
       "optional": true
     }
   },

package/out/shared/src/ring-buffer.d.ts

@@ -1,32 +0,0 @@
-/**
- * A FIFO ring buffer backed by a circular array. Provides:
- *
- * - `push()` — O(1) amortized (O(n) on resize)
- * - `shift()` — O(1)
- * - `size`    — O(1)
- * - `drain()` — O(n)
- *
- * The buffer grows (doubles) when full and shrinks (halves) when
- * utilization drops below 25%, bounded by {@link MIN_CAPACITY}.
- */
-export declare class RingBuffer<T> {
-    #private;
-    constructor(initialCapacity?: number);
-    get size(): number;
-    push(value: T): void;
-    /** Removes and returns the front element, or `undefined` if empty. */
-    shift(): T | undefined;
-    /**
-     * Removes all elements matching `value` (by identity `===`).
-     *
-     * This is O(n) — suitable for rare operations like cancellation.
-     *
-     * @returns The number of elements removed.
-     */
-    delete(value: T): number;
-    /**
-     * Removes and returns all elements in FIFO order, resetting the buffer.
-     */
-    drain(): T[];
-}
-//# sourceMappingURL=ring-buffer.d.ts.map

package/out/shared/src/ring-buffer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"ring-buffer.d.ts","sourceRoot":"","sources":["../../../../shared/src/ring-buffer.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;GAUG;AACH,qBAAa,UAAU,CAAC,CAAC;;gBAMX,eAAe,SAA2B;IAKtD,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAQpB,sEAAsE;IACtE,KAAK,IAAI,CAAC,GAAG,SAAS;IAqBtB;;;;;;OAMG;IACH,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM;IAsBxB;;OAEG;IACH,KAAK,IAAI,CAAC,EAAE;CAmDb"}

package/out/shared/src/ring-buffer.js

@@ -1,109 +0,0 @@
-//#region ../shared/src/ring-buffer.ts
-var DEFAULT_INITIAL_CAPACITY = 16;
-var MIN_CAPACITY = 16;
-/**
-* A FIFO ring buffer backed by a circular array. Provides:
-*
-* - `push()` — O(1) amortized (O(n) on resize)
-* - `shift()` — O(1)
-* - `size`    — O(1)
-* - `drain()` — O(n)
-*
-* The buffer grows (doubles) when full and shrinks (halves) when
-* utilization drops below 25%, bounded by {@link MIN_CAPACITY}.
-*/
-var RingBuffer = class {
-	#buffer;
-	#head = 0;
-	#size = 0;
-	#capacity;
-	constructor(initialCapacity = DEFAULT_INITIAL_CAPACITY) {
-		this.#capacity = Math.max(MIN_CAPACITY, initialCapacity);
-		this.#buffer = Array.from({ length: initialCapacity });
-	}
-	get size() {
-		return this.#size;
-	}
-	push(value) {
-		if (this.#size === this.#capacity) this.#grow();
-		this.#buffer[(this.#head + this.#size) % this.#capacity] = value;
-		this.#size++;
-	}
-	/** Removes and returns the front element, or `undefined` if empty. */
-	shift() {
-		if (this.#size === 0) return;
-		const value = this.#buffer[this.#head];
-		this.#buffer[this.#head] = void 0;
-		this.#head = (this.#head + 1) % this.#capacity;
-		this.#size--;
-		if (this.#size > 0 && this.#size < this.#capacity >> 2 && this.#capacity > MIN_CAPACITY) this.#shrink();
-		return value;
-	}
-	/**
-	* Removes all elements matching `value` (by identity `===`).
-	*
-	* This is O(n) — suitable for rare operations like cancellation.
-	*
-	* @returns The number of elements removed.
-	*/
-	delete(value) {
-		if (this.#size === 0) return 0;
-		const newBuffer = Array.from({ length: this.#capacity });
-		let newSize = 0;
-		let count = 0;
-		for (let i = 0; i < this.#size; i++) {
-			const item = this.#buffer[(this.#head + i) % this.#capacity];
-			if (item === value) count++;
-			else newBuffer[newSize++] = item;
-		}
-		this.#buffer = newBuffer;
-		this.#head = 0;
-		this.#size = newSize;
-		return count;
-	}
-	/**
-	* Removes and returns all elements in FIFO order, resetting the buffer.
-	*/
-	drain() {
-		const result = Array.from({ length: this.#size });
-		for (let i = 0; i < this.#size; i++) result[i] = this.#buffer[(this.#head + i) % this.#capacity];
-		this.#head = 0;
-		this.#size = 0;
-		this.#buffer = Array.from({ length: this.#capacity });
-		return result;
-	}
-	/**
-	* Grows the buffer in place by doubling its length and relocating
-	* only the wrapped-around elements (those before #head) into the
-	* newly available space. No new array is allocated.
-	*/
-	#grow() {
-		const oldLen = this.#buffer.length;
-		const newLen = oldLen * 2;
-		this.#buffer.length = newLen;
-		this.#capacity = newLen;
-		for (let i = 0; i < this.#head; i++) {
-			this.#buffer[oldLen + i] = this.#buffer[i];
-			this.#buffer[i] = void 0;
-		}
-	}
-	/**
-	* Shrinks the buffer in place by halving its length. Elements whose
-	* indices fall in the removed half are relocated into the lower half,
-	* then the array is truncated.
-	*/
-	#shrink() {
-		const oldLen = this.#buffer.length;
-		const newLen = Math.max(MIN_CAPACITY, oldLen >> 1);
-		const left = Math.max(newLen, this.#head);
-		const right = Math.min(this.#head + this.#size, oldLen);
-		for (let i = left; i < right; i++) this.#buffer[i - newLen] = this.#buffer[i];
-		if (this.#head >= newLen) this.#head -= newLen;
-		this.#buffer.length = newLen;
-		this.#capacity = newLen;
-	}
-};
-//#endregion
-export { RingBuffer };
-
-//# sourceMappingURL=ring-buffer.js.map

package/out/shared/src/ring-buffer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ring-buffer.js","names":["#capacity","#buffer","#size","#grow","#head","#shrink"],"sources":["../../../../shared/src/ring-buffer.ts"],"sourcesContent":["const DEFAULT_INITIAL_CAPACITY = 16;\nconst MIN_CAPACITY = 16;\n\n/**\n * A FIFO ring buffer backed by a circular array. Provides:\n *\n * - `push()` — O(1) amortized (O(n) on resize)\n * - `shift()` — O(1)\n * - `size`    — O(1)\n * - `drain()` — O(n)\n *\n * The buffer grows (doubles) when full and shrinks (halves) when\n * utilization drops below 25%, bounded by {@link MIN_CAPACITY}.\n */\nexport class RingBuffer<T> {\n  #buffer: (T | undefined)[];\n  #head = 0;\n  #size = 0;\n  #capacity: number;\n\n  constructor(initialCapacity = DEFAULT_INITIAL_CAPACITY) {\n    this.#capacity = Math.max(MIN_CAPACITY, initialCapacity);\n    this.#buffer = Array.from({length: initialCapacity});\n  }\n\n  get size(): number {\n    return this.#size;\n  }\n\n  push(value: T): void {\n    if (this.#size === this.#capacity) {\n      this.#grow();\n    }\n    this.#buffer[(this.#head + this.#size) % this.#capacity] = value;\n    this.#size++;\n  }\n\n  /** Removes and returns the front element, or `undefined` if empty. */\n  shift(): T | undefined {\n    if (this.#size === 0) {\n      return undefined;\n    }\n    const value = this.#buffer[this.#head];\n    this.#buffer[this.#head] = undefined; // allow GC of removed element\n    this.#head = (this.#head + 1) % this.#capacity;\n    this.#size--;\n\n    // Shrink when utilization drops below 25%, keeping a minimum capacity.\n    if (\n      this.#size > 0 &&\n      this.#size < this.#capacity >> 2 &&\n      this.#capacity > MIN_CAPACITY\n    ) {\n      this.#shrink();\n    }\n\n    return value;\n  }\n\n  /**\n   * Removes all elements matching `value` (by identity `===`).\n   *\n   * This is O(n) — suitable for rare operations like cancellation.\n   *\n   * @returns The number of elements removed.\n   */\n  delete(value: T): number {\n    if (this.#size === 0) {\n      return 0;\n    }\n    // Rebuild the buffer without matching elements.\n    const newBuffer: (T | undefined)[] = Array.from({length: this.#capacity});\n    let newSize = 0;\n    let count = 0;\n    for (let i = 0; i < this.#size; i++) {\n      const item = this.#buffer[(this.#head + i) % this.#capacity];\n      if (item === value) {\n        count++;\n      } else {\n        newBuffer[newSize++] = item;\n      }\n    }\n    this.#buffer = newBuffer;\n    this.#head = 0;\n    this.#size = newSize;\n    return count;\n  }\n\n  /**\n   * Removes and returns all elements in FIFO order, resetting the buffer.\n   */\n  drain(): T[] {\n    const result = Array.from<T>({length: this.#size});\n    for (let i = 0; i < this.#size; i++) {\n      result[i] = this.#buffer[(this.#head + i) % this.#capacity] as T;\n    }\n    this.#head = 0;\n    this.#size = 0;\n    this.#buffer = Array.from({length: this.#capacity});\n    return result;\n  }\n\n  /**\n   * Grows the buffer in place by doubling its length and relocating\n   * only the wrapped-around elements (those before #head) into the\n   * newly available space. No new array is allocated.\n   */\n  #grow(): void {\n    const oldLen = this.#buffer.length;\n    const newLen = oldLen * 2;\n    this.#buffer.length = newLen;\n    this.#capacity = newLen;\n\n    // Copy wrapped-around elements (indices 0..head-1) into the new space.\n    for (let i = 0; i < this.#head; i++) {\n      this.#buffer[oldLen + i] = this.#buffer[i];\n      this.#buffer[i] = undefined; // ensure gc when the element is removed\n    }\n  }\n\n  /**\n   * Shrinks the buffer in place by halving its length. Elements whose\n   * indices fall in the removed half are relocated into the lower half,\n   * then the array is truncated.\n   */\n  #shrink(): void {\n    const oldLen = this.#buffer.length;\n    const newLen = Math.max(MIN_CAPACITY, oldLen >> 1);\n\n    // Move elements that sit in the upper half down by newLen.\n    const left = Math.max(newLen, this.#head);\n    const right = Math.min(this.#head + this.#size, oldLen);\n    for (let i = left; i < right; i++) {\n      this.#buffer[i - newLen] = this.#buffer[i];\n    }\n\n    if (this.#head >= newLen) {\n      this.#head -= newLen;\n    }\n    this.#buffer.length = newLen;\n    this.#capacity = newLen;\n  }\n}\n"],"mappings":";AAAA,IAAM,2BAA2B;AACjC,IAAM,eAAe;;;;;;;;;;;;AAarB,IAAa,aAAb,MAA2B;CACzB;CACA,QAAQ;CACR,QAAQ;CACR;CAEA,YAAY,kBAAkB,0BAA0B;EACtD,KAAKA,YAAY,KAAK,IAAI,cAAc,eAAe;EACvD,KAAKC,UAAU,MAAM,KAAK,EAAC,QAAQ,gBAAe,CAAC;CACrD;CAEA,IAAI,OAAe;EACjB,OAAO,KAAKC;CACd;CAEA,KAAK,OAAgB;EACnB,IAAI,KAAKA,UAAU,KAAKF,WACtB,KAAKG,MAAM;EAEb,KAAKF,SAAS,KAAKG,QAAQ,KAAKF,SAAS,KAAKF,aAAa;EAC3D,KAAKE;CACP;;CAGA,QAAuB;EACrB,IAAI,KAAKA,UAAU,GACjB;EAEF,MAAM,QAAQ,KAAKD,QAAQ,KAAKG;EAChC,KAAKH,QAAQ,KAAKG,SAAS,KAAA;EAC3B,KAAKA,SAAS,KAAKA,QAAQ,KAAK,KAAKJ;EACrC,KAAKE;EAGL,IACE,KAAKA,QAAQ,KACb,KAAKA,QAAQ,KAAKF,aAAa,KAC/B,KAAKA,YAAY,cAEjB,KAAKK,QAAQ;EAGf,OAAO;CACT;;;;;;;;CASA,OAAO,OAAkB;EACvB,IAAI,KAAKH,UAAU,GACjB,OAAO;EAGT,MAAM,YAA+B,MAAM,KAAK,EAAC,QAAQ,KAAKF,UAAS,CAAC;EACxE,IAAI,UAAU;EACd,IAAI,QAAQ;EACZ,KAAK,IAAI,IAAI,GAAG,IAAI,KAAKE,OAAO,KAAK;GACnC,MAAM,OAAO,KAAKD,SAAS,KAAKG,QAAQ,KAAK,KAAKJ;GAClD,IAAI,SAAS,OACX;QAEA,UAAU,aAAa;EAE3B;EACA,KAAKC,UAAU;EACf,KAAKG,QAAQ;EACb,KAAKF,QAAQ;EACb,OAAO;CACT;;;;CAKA,QAAa;EACX,MAAM,SAAS,MAAM,KAAQ,EAAC,QAAQ,KAAKA,MAAK,CAAC;EACjD,KAAK,IAAI,IAAI,GAAG,IAAI,KAAKA,OAAO,KAC9B,OAAO,KAAK,KAAKD,SAAS,KAAKG,QAAQ,KAAK,KAAKJ;EAEnD,KAAKI,QAAQ;EACb,KAAKF,QAAQ;EACb,KAAKD,UAAU,MAAM,KAAK,EAAC,QAAQ,KAAKD,UAAS,CAAC;EAClD,OAAO;CACT;;;;;;CAOA,QAAc;EACZ,MAAM,SAAS,KAAKC,QAAQ;EAC5B,MAAM,SAAS,SAAS;EACxB,KAAKA,QAAQ,SAAS;EACtB,KAAKD,YAAY;EAGjB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAKI,OAAO,KAAK;GACnC,KAAKH,QAAQ,SAAS,KAAK,KAAKA,QAAQ;GACxC,KAAKA,QAAQ,KAAK,KAAA;EACpB;CACF;;;;;;CAOA,UAAgB;EACd,MAAM,SAAS,KAAKA,QAAQ;EAC5B,MAAM,SAAS,KAAK,IAAI,cAAc,UAAU,CAAC;EAGjD,MAAM,OAAO,KAAK,IAAI,QAAQ,KAAKG,KAAK;EACxC,MAAM,QAAQ,KAAK,IAAI,KAAKA,QAAQ,KAAKF,OAAO,MAAM;EACtD,KAAK,IAAI,IAAI,MAAM,IAAI,OAAO,KAC5B,KAAKD,QAAQ,IAAI,UAAU,KAAKA,QAAQ;EAG1C,IAAI,KAAKG,SAAS,QAChB,KAAKA,SAAS;EAEhB,KAAKH,QAAQ,SAAS;EACtB,KAAKD,YAAY;CACnB;AACF"}