@rocicorp/zero 1.12.0-canary.2 → 1.12.0-canary.4

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","#isPrefixMatch"],"sources":["../../../../zqlite/src/sqlite-stat-fanout.ts"],"sourcesContent":["import {newArray} from '../../shared/src/arrays.ts';\nimport {getOrInsertComputed} from '../../shared/src/map.ts';\nimport type {Database} from './db.ts';\nimport {isSampleNull} from './sqlite-stat4-sample.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      WHERE il.partial = 0\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: isSampleNull(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        getOrInsertComputed(indexMap, row.index_name, newArray).push(\n          row.column_name,\n        );\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"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2FA,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;;;;;;KAMlC;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,aAAa,EAAE,MAAM;IAC/B;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,KAAKK,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,MAChB,oBAAoB,UAAU,IAAI,YAAY,QAAQ,EAAE,KACtD,IAAI,WACN;GAIF,KAAK,MAAM,CAAC,WAAW,iBAAiB,UACtC,IAAI,KAAKI,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;AACF"}
+{"version":3,"file":"sqlite-stat-fanout.js","names":[],"sources":["../../../../zqlite/src/sqlite-stat-fanout.ts"],"sourcesContent":["import {newArray} from '../../shared/src/arrays.ts';\nimport {getOrInsertComputed} from '../../shared/src/map.ts';\nimport type {Database} from './db.ts';\nimport {isSampleNull} from './sqlite-stat4-sample.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      WHERE il.partial = 0\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: isSampleNull(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        getOrInsertComputed(indexMap, row.index_name, newArray).push(\n          row.column_name,\n        );\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"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2FA,IAAa,mBAAb,MAA8B;CAC5B;CACA;;;;;CAMA,yBAAkB,IAAI,IAA0B;;;;;CAMhD;CACA;CACA;;;;;;;;;;CAWA,YAAY,IAAc,gBAAgB,GAAG;EAC3C,KAAK,MAAM;EACX,KAAK,iBAAiB;EAGtB,KAAK,aAAa,KAAK,IAAI,QAAQ;;;;;KAKlC;EAED,KAAK,aAAa,KAAK,IAAI,QAAQ;;;;KAIlC;EAED,KAAK,aAAa,KAAK,IAAI,QAAQ;;;;;;KAMlC;CACH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAgCA,UAAU,WAAmB,SAAiC;EAE5D,MAAM,WAAW,GAAG,UAAU,GAAG,QAAQ,SAAS,CAAC,CAAC,KAAK,GAAG;EAC5D,MAAM,SAAS,KAAK,OAAO,IAAI,QAAQ;EACvC,IAAI,QACF,OAAO;EAMT,MAAM,cAAc,KAAK,oBAAoB,WAAW,OAAO;EAC/D,IAAI,aAAa;GACf,KAAK,OAAO,IAAI,UAAU,WAAW;GACrC,OAAO;EACT;EAGA,MAAM,cAAc,KAAK,oBAAoB,WAAW,OAAO;EAC/D,IAAI,aAAa;GACf,KAAK,OAAO,IAAI,UAAU,WAAW;GACrC,OAAO;EACT;EAGA,MAAM,gBAA8B;GAClC,QAAQ,KAAK;GACb,YAAY;GACZ,QAAQ;EACV;EACA,KAAK,OAAO,IAAI,UAAU,aAAa;EACvC,OAAO;CACT;;;;;CAMA,aAAmB;EACjB,KAAK,OAAO,MAAM;CACpB;;;;;;;;;;;;CAaA,oBACE,WACA,SAC0B;EAC1B,IAAI;GAEF,MAAM,YAAY,KAAK,qBAAqB,WAAW,OAAO;GAC9D,IAAI,CAAC,WACH;GAIF,MAAM,UAAU,KAAK,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,aAAa,EAAE,MAAM;IAC/B;GACF,CAEuB,CAAA,CAAe,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,CAAC,CAAC,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,KAAK,qBAAqB,WAAW,OAAO;GAC9D,IAAI,CAAC,WACH;GAIF,MAAM,SAAS,KAAK,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,KAAK,WAAW,IAAI,SAAS;GAO1C,MAAM,2BAAW,IAAI,IAAsB;GAC3C,KAAK,MAAM,OAAO,MAChB,oBAAoB,UAAU,IAAI,YAAY,QAAQ,CAAC,CAAC,KACtD,IAAI,WACN;GAIF,KAAK,MAAM,CAAC,WAAW,iBAAiB,UACtC,IAAI,KAAK,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,CAAA,CAAkB,OAAM,aAAY,iBAAiB,IAAI,QAAQ,CAAC;CAC3E;AACF"}

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

@@ -129,7 +129,7 @@ export declare class TableSource implements Source {
      * Returns `base` untouched when derivation is not deferred, which is what
      * makes this a no-op for the write-through path.
      */
-    reconcilePendingConflicts(base: readonly Row[], next: Row | null, rowKey: Row, uniqueKeys: readonly (readonly string[])[]): readonly Row[];
+    reconcilePendingConflicts(base: readonly Row[], next: Row | null, rowKey: SQLiteRow, uniqueKeys: readonly (readonly string[])[]): readonly Row[];
     /**
      * Retrieves a row from the backing DB by a unique key, or `undefined` if such a
      * row does not exist. This is not used in the IVM pipeline but is useful
@@ -141,7 +141,25 @@ export declare class TableSource implements Source {
 }
 export declare function toSQLiteTypes(columns: readonly string[], row: Row, columnTypes: Record<string, SchemaValue>): readonly unknown[];
 export declare function toSQLiteTypeName(type: ValueType): "INTEGER" | "NULL" | "REAL" | "TEXT";
-export declare function fromSQLiteTypes(valueTypes: Record<string, SchemaValue>, row: Row, tableName: string): Row;
+/**
+ * A column value as read from SQLite with `safeIntegers(true)`, i.e. before
+ * {@link fromSQLiteTypes} converts it to a {@link Value}.
+ */
+export type SQLiteValue = bigint | number | string | null;
+/** A row as read from SQLite, before {@link fromSQLiteTypes}. */
+export type SQLiteRow = Readonly<Record<string, SQLiteValue>>;
+export declare function fromSQLiteTypes(valueTypes: Record<string, SchemaValue>, row: SQLiteRow, tableName: string): Row;
+/** A result column of a raw row and the type it converts to. */
+export type RawColumn = {
+    readonly name: string;
+    readonly type: ValueType;
+};
+export declare function rawColumn(valueTypes: Record<string, SchemaValue>, name: string, tableName: string): RawColumn;
+/**
+ * Like {@link fromSQLiteTypes}, for a row read with `raw(true)`: the row's
+ * values are `values[offset]` up to `values[offset + columns.length - 1]`.
+ */
+export declare function fromSQLiteRawRow(columns: readonly RawColumn[], values: readonly SQLiteValue[], tableName: string, offset?: number): Row;
 export declare class UnsupportedValueError extends Error {
 }
 //# sourceMappingURL=table-source.d.ts.map

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;AAM7D,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;AAuB3E,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;AAyBjD,MAAM,MAAM,kBAAkB,GAAG;IAC/B;;;;;;;;OAQG;IACH,uBAAuB,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;IAE9C;;;;;OAKG;IACH,WAAW,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;CACnC,CAAC;AAEF;;;;;;;;;;;;;GAaG;AACH,qBAAa,WAAY,YAAW,MAAM;;IAwBxC;;;;;OAKG;IACH,YACE,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,EACzB,OAAO,GAAE,kBAAuB,EAqBjC;IAED;;;OAGG;IACH,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED,IAAI,WAAW;QAEX,IAAI;QACJ,OAAO;QACP,UAAU;MAEb;IAED;;;OAGG;IACH,KAAK,CAAC,EAAE,EAAE,QAAQ,QAKjB;IAED;;;;;;OAMG;IACH,cAAc,CAAC,WAAW,EAAE,OAAO,QAUlC;IAED;;;;;OAKG;IACH,qBAAqB,IAAI,IAAI,CAE5B;IAED;;;;;;OAMG;IACF,mBAAmB,IAAI,MAAM,CAAC,OAAO,CAAC,CAwBtC;IAwED,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,eA4CtB;IAED,WAAW,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG,CAOzB;IAmMA,IAAI,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,CAM3C;IAED;;;OAGG;IACH,IAAI,WAAW,IAAI,MAAM,CAExB;IAED,sEAAsE;IACtE,IAAI,YAAY,IAAI,MAAM,CAEzB;IAED;;;OAGG;IACH,YAAY,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO,CAU9B;IAmBA,OAAO,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,CAAC,OAAO,GAAG,SAAS,CAAC,CA6C1D;IAuED;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACH,yBAAyB,CACvB,IAAI,EAAE,SAAS,GAAG,EAAE,EACpB,IAAI,EAAE,GAAG,GAAG,IAAI,EAChB,MAAM,EAAE,GAAG,EACX,UAAU,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,GACzC,SAAS,GAAG,EAAE,CAoChB;IA6DD;;;;;;OAMG;IACH,MAAM,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS,CAkCnC;CAmBF;AAoFD,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;AAyCD,qBAAa,qBAAsB,SAAQ,KAAK;CAAG"}
+{"version":3,"file":"table-source.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/table-source.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAEjD,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,+BAA+B,CAAC;AAM7D,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;AAuB3E,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;AA6B9D,MAAM,MAAM,kBAAkB,GAAG;IAC/B;;;;;;;;OAQG;IACH,uBAAuB,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;IAE9C;;;;;OAKG;IACH,WAAW,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;CACnC,CAAC;AAEF;;;;;;;;;;;;;GAaG;AACH,qBAAa,WAAY,YAAW,MAAM;;IAyBxC;;;;;OAKG;IACH,YACE,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,EACzB,OAAO,GAAE,kBAAuB,EAqBjC;IAED;;;OAGG;IACH,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED,IAAI,WAAW;QAEX,IAAI;QACJ,OAAO;QACP,UAAU;MAEb;IAED;;;OAGG;IACH,KAAK,CAAC,EAAE,EAAE,QAAQ,QAKjB;IAED;;;;;;OAMG;IACH,cAAc,CAAC,WAAW,EAAE,OAAO,QAUlC;IAED;;;;;OAKG;IACH,qBAAqB,IAAI,IAAI,CAE5B;IAED;;;;;;OAMG;IACF,mBAAmB,IAAI,MAAM,CAAC,OAAO,CAAC,CAwBtC;IAwED,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,eAkDtB;IAED,WAAW,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG,CAOzB;IAwNA,IAAI,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,CAM3C;IAED;;;OAGG;IACH,IAAI,WAAW,IAAI,MAAM,CAExB;IAED,sEAAsE;IACtE,IAAI,YAAY,IAAI,MAAM,CAEzB;IAED;;;OAGG;IACH,YAAY,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO,CAU9B;IAmBA,OAAO,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,CAAC,OAAO,GAAG,SAAS,CAAC,CA6C1D;IAuED;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACH,yBAAyB,CACvB,IAAI,EAAE,SAAS,GAAG,EAAE,EACpB,IAAI,EAAE,GAAG,GAAG,IAAI,EAChB,MAAM,EAAE,SAAS,EACjB,UAAU,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,GACzC,SAAS,GAAG,EAAE,CAoChB;IA6DD;;;;;;OAMG;IACH,MAAM,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS,CAsCnC;CACF;AAoFD,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;;;GAGG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;AAE1D,iEAAiE;AACjE,MAAM,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC;AAE9D,wBAAgB,eAAe,CAC7B,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACvC,GAAG,EAAE,SAAS,EACd,SAAS,EAAE,MAAM,GAChB,GAAG,CAUL;AAED,gEAAgE;AAChE,MAAM,MAAM,SAAS,GAAG;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;CAC1B,CAAC;AAEF,wBAAgB,SAAS,CACvB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACvC,IAAI,EAAE,MAAM,EACZ,SAAS,EAAE,MAAM,GAChB,SAAS,CASX;AAaD;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,OAAO,EAAE,SAAS,SAAS,EAAE,EAC7B,MAAM,EAAE,SAAS,WAAW,EAAE,EAC9B,SAAS,EAAE,MAAM,EACjB,MAAM,SAAI,GACT,GAAG,CAaL;AAwCD,qBAAa,qBAAsB,SAAQ,KAAK;CAAG"}

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

@@ -1,19 +1,22 @@
 import { assert, unreachable } from "../../shared/src/asserts.js";
 import { getOrInsertComputed } from "../../shared/src/map.js";
 import { must } from "../../shared/src/must.js";
+import { assignProperty } from "../../shared/src/objects.js";
 import { assertOrderingIncludesPK } from "../../zql/src/query/complete-ordering.js";
 import { makeComparator } from "../../zql/src/ivm/data.js";
 import { createPredicate, transformFilters } from "../../zql/src/builder/filter.js";
 import { genPushAndWriteWithSplitEdit, generateWithOverlay, generateWithOverlayUnordered, generateWithStart } from "../../zql/src/ivm/memory-source.js";
-import { timeSampled } from "../../otel/src/maybe-time.js";
-import { recordIndexUsage } from "./index-usage.js";
 import { compile, format, sql } from "./internal/sql.js";
+import { toSQLiteType } from "./query-builder.js";
+import { FetchSQLCache } from "./fetch-sql.js";
+import { recordIndexUsage } from "./index-usage.js";
 import { StatementCache } from "./internal/statement-cache.js";
 import { NOT_OVERRIDDEN, PendingDelta, generateWithPendingDelta, generateWithPendingDeltaUnordered } from "./pending-delta.js";
-import { buildSelectQueries, toSQLiteType } from "./query-builder.js";
 import SQLite3Database from "@rocicorp/zero-sqlite3";
 //#region ../zqlite/src/table-source.ts
 var eventCount = 0;
+var FIRST_BATCH_ROWS = 1;
+var MAX_BATCH_ROWS = 128;
 /**
 * A source that is backed by a SQLite table.
 *
@@ -30,6 +33,7 @@ var eventCount = 0;
 */
 var TableSource = class {
 	#dbCache = /* @__PURE__ */ new WeakMap();
+	#rawColumns = /* @__PURE__ */ new WeakMap();
 	#connections = [];
 	#table;
 	#columns;
@@ -166,9 +170,10 @@ var TableSource = class {
 		const transformedFilters = transformFilters(filters);
 		const unordered = sort === void 0;
 		const primaryKeySort = this.#primaryKeySort;
+		const fetchSQL = new FetchSQLCache(this.#table, this.#columns, transformedFilters.filters, sort);
 		const input = {
 			getSchema: () => schema,
-			fetch: (req) => this.#fetch(req, connection),
+			fetch: (req) => this.#fetch(req, connection, fetchSQL),
 			setOutput: (output) => {
 				connection.output = output;
 			},
@@ -200,9 +205,9 @@ var TableSource = class {
 	toSQLiteRow(row) {
 		return Object.fromEntries(Object.entries(row).map(([key, value]) => [key, toSQLiteType(value, this.#columns[key].type)]));
 	}
-	*#fetch(req, connection) {
+	*#fetch(req, connection, fetchSQL) {
 		const { sort, debug } = connection;
-		const rows = this.#queryRows(this.#requestToSQL(req, connection.filters?.condition, sort), debug);
+		const rows = this.#queryRows(fetchSQL.get(req), debug);
 		const overlayPredicate = mergeOverlayPredicate(connection.filters?.predicate, req.filter);
 		try {
 			if (sort) {
@@ -214,22 +219,20 @@ var TableSource = class {
 		}
 	}
 	/**
-	* The rows of `queries`, run one after another as {@link buildSelectQueries}
+	* The rows of `queries`, run one after another as `buildSelectQueries`
 	* requires. Each statement is run only once the previous one is exhausted,
 	* so a fetch that stops early never runs the rest.
 	*/
 	*#queryRows(queries, debug) {
 		const { cache } = this.#stmts;
-		for (const query of queries) {
-			const sqlAndBindings = format(query);
-			const cachedStatement = cache.get(sqlAndBindings.text);
-			cachedStatement.statement.safeIntegers(true);
-			const rowIterator = cachedStatement.statement.iterate(...sqlAndBindings.values);
+		for (const sqlAndBindings of queries) {
+			const cachedStatement = cache.getExact(sqlAndBindings.text);
+			const cursor = cachedStatement.statement.batches(sqlAndBindings.values);
 			try {
 				debug?.initQuery(this.#table, sqlAndBindings.text);
-				yield* this.#mapFromSQLiteTypes(this.#columns, rowIterator, sqlAndBindings.text, debug);
+				yield* this.#readRows(cursor, this.#rawColumnsFor(cachedStatement.statement), sqlAndBindings.text, debug);
 			} finally {
-				rowIterator.return?.();
+				cursor.close();
 				recordIndexUsage(cachedStatement.statement, this.#table);
 				if (debug) {
 					let totalNvisit = 0;
@@ -265,16 +268,29 @@ var TableSource = class {
 		const deltaRows = delta.rowsFor(sort ?? this.#primaryKeySort, req.constraint, sort ? req.reverse : false, predicate, req.multiConstraints, sort ? req.start?.row : void 0);
 		return compare ? generateWithPendingDelta(baseRows, deltaRows, delta, compare) : generateWithPendingDeltaUnordered(baseRows, deltaRows, delta);
 	}
-	*#mapFromSQLiteTypes(valueTypes, rowIterator, query, debug) {
-		let result;
-		do {
-			result = timeSampled(this.#lc, ++eventCount, this.#logConfig.ivmSampling, () => rowIterator.next(), this.#logConfig.slowRowThreshold, () => `table-source.next took too long for ${query}. Are you missing an index?`);
-			if (result.done) break;
-			this.#rowsRead++;
-			const row = fromSQLiteTypes(valueTypes, result.value, this.#table);
-			debug?.rowVended(this.#table, query, row);
-			yield row;
-		} while (!result.done);
+	#rawColumnsFor(statement) {
+		return getOrInsertComputed(this.#rawColumns, statement, () => statement.columns().map(({ name }) => rawColumn(this.#columns, name, this.#table)));
+	}
+	*#readRows(cursor, columns, query, debug) {
+		for (let capacity = FIRST_BATCH_ROWS;;) {
+			const { ivmSampling, slowRowThreshold } = this.#logConfig;
+			const sampled = ivmSampling > 0 && ++eventCount % ivmSampling === 0;
+			const start = sampled ? performance.now() : 0;
+			const values = cursor.next(capacity);
+			const n = values.length / columns.length;
+			if (sampled) {
+				const duration = performance.now() - start;
+				if (duration > slowRowThreshold * Math.max(n, 1)) this.#lc.warn?.(`table-source.next took too long for ${query}. Are you missing an index? duration: ${duration}ms`);
+			}
+			if (n === 0) return;
+			for (let r = 0; r < n; r++) {
+				const row = fromSQLiteRawRow(columns, values, this.#table, r * columns.length);
+				this.#rowsRead++;
+				debug?.rowVended(this.#table, query, row);
+				yield row;
+			}
+			capacity = Math.min(capacity * 2, MAX_BATCH_ROWS);
+		}
 	}
 	*push(change) {
 		for (const result of this.genPush(change)) if (result === "yield") yield result;
@@ -437,12 +453,11 @@ var TableSource = class {
 	getRow(rowKey) {
 		const keyCols = Object.keys(rowKey);
 		const stmt = this.#getRowStmt(keyCols);
-		const raw = this.#stmts.cache.use(stmt, ({ statement }) => {
-			const row = statement.safeIntegers(true).get(...toSQLiteTypes(keyCols, rowKey, this.#columns));
+		const row = this.#stmts.cache.use(stmt, ({ statement }) => {
+			const values = statement.safeIntegers(true).raw(true).get(...toSQLiteTypes(keyCols, rowKey, this.#columns));
 			recordIndexUsage(statement, this.#table);
-			return row;
+			return values === void 0 ? void 0 : fromSQLiteRawRow(this.#rawColumnsFor(statement), values, this.#table);
 		});
-		const row = raw ? fromSQLiteTypes(this.#columns, raw, this.#table) : raw;
 		const delta = this.#delta;
 		if (delta === void 0 || delta.isEmpty) return row;
 		if (row !== void 0) {
@@ -452,9 +467,6 @@ var TableSource = class {
 		}
 		return delta.getByColumns(keyCols, rowKey);
 	}
-	#requestToSQL(request, filters, order) {
-		return buildSelectQueries(this.#table, this.#columns, request.constraint, filters, order, request.reverse, request.start, request.multiConstraints, request.filter);
-	}
 };
 function mergeOverlayPredicate(connPredicate, reqFilter) {
 	if (!reqFilter) return connPredicate;
@@ -504,14 +516,37 @@ function fromSQLiteTypes(valueTypes, row, tableName) {
 	const newRow = {};
 	for (const key of Object.keys(row)) {
 		const valueType = valueTypes[key];
-		if (valueType === void 0) {
-			const columnList = Object.keys(valueTypes).sort().join(", ");
-			throw new Error(`Invalid column "${key}" for table "${tableName}". Synced columns include ${columnList}`);
-		}
+		if (valueType === void 0) throw invalidColumnError(valueTypes, key, tableName);
 		newRow[key] = fromSQLiteType(valueType.type, row[key], key, tableName);
 	}
 	return newRow;
 }
+function rawColumn(valueTypes, name, tableName) {
+	const valueType = Object.hasOwn(valueTypes, name) ? valueTypes[name] : void 0;
+	if (valueType === void 0) throw invalidColumnError(valueTypes, name, tableName);
+	return {
+		name,
+		type: valueType.type
+	};
+}
+function invalidColumnError(valueTypes, name, tableName) {
+	const columnList = Object.keys(valueTypes).sort().join(", ");
+	return /* @__PURE__ */ new Error(`Invalid column "${name}" for table "${tableName}". Synced columns include ${columnList}`);
+}
+/**
+* Like {@link fromSQLiteTypes}, for a row read with `raw(true)`: the row's
+* values are `values[offset]` up to `values[offset + columns.length - 1]`.
+*/
+function fromSQLiteRawRow(columns, values, tableName, offset = 0) {
+	const newRow = {};
+	for (let i = 0; i < columns.length; i++) {
+		const { name, type } = columns[i];
+		const value = fromSQLiteType(type, values[offset + i], name, tableName);
+		if (name === "__proto__") assignProperty(newRow, name, value);
+		else newRow[name] = value;
+	}
+	return newRow;
+}
 function fromSQLiteType(valueType, v, column, tableName) {
 	if (v === null) return null;
 	switch (valueType) {
@@ -520,9 +555,8 @@ function fromSQLiteType(valueType, v, column, tableName) {
 		case "string":
 		case "null":
 			if (typeof v === "bigint") {
-				const bi = v;
-				if (bi > Number.MAX_SAFE_INTEGER || bi < Number.MIN_SAFE_INTEGER) throw new UnsupportedValueError(`value ${bi} (in ${tableName}.${column}) is outside of supported bounds`);
-				return Number(bi);
+				if (v > Number.MAX_SAFE_INTEGER || v < Number.MIN_SAFE_INTEGER) throw new UnsupportedValueError(`value ${v} (in ${tableName}.${column}) is outside of supported bounds`);
+				return Number(v);
 			}
 			return v;
 		case "json": try {
@@ -550,6 +584,6 @@ function* generateWithYields(stream, shouldYield) {
 	}
 }
 //#endregion
-export { TableSource, fromSQLiteTypes };
+export { TableSource, UnsupportedValueError, fromSQLiteRawRow, fromSQLiteTypes, rawColumn, toSQLiteTypes };
 
 //# sourceMappingURL=table-source.js.map

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","#skipUnobservableChanges","#primaryKeySort","#stmts","#getStatementsFor","#delta","#rowsRead","#allColumns","#fetch","#getSchema","#queryRows","#requestToSQL","#withPendingDelta","#overlay","#mapFromSQLiteTypes","#mayAcceptChange","#writeChange","#pushEpoch","#writeChangeToDelta","#syncedDeleteKey","#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 {getOrInsertComputed} from '../../shared/src/map.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  type NoSubqueryCondition as StrictNoSubqueryCondition,\n} from '../../zql/src/builder/filter.ts';\nimport {ChangeType} from '../../zql/src/ivm/change-type.ts';\nimport {\n  makeComparator,\n  type Comparator,\n  type Node,\n} 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 {recordIndexUsage} from './index-usage.ts';\nimport {compile, format, sql} from './internal/sql.ts';\nimport {StatementCache} from './internal/statement-cache.ts';\nimport {\n  generateWithPendingDelta,\n  generateWithPendingDeltaUnordered,\n  NOT_OVERRIDDEN,\n  PendingDelta,\n} from './pending-delta.ts';\nimport {\n  buildSelectQueries,\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};\n\nlet eventCount = 0;\n\nexport type TableSourceOptions = {\n  /**\n   * When set, a pushed change that the filters of every connection reject\n   * is neither pushed nor applied to the backing table, on the grounds that\n   * no connection can observe it. This departs from the `Source.push`\n   * contract (a push commits the change to the source), so it is only\n   * appropriate when the caller does not read the table through any other\n   * path and replaces the table's contents afterwards, as the view-syncer's\n   * pipeline driver does when it advances to the next snapshot.\n   */\n  skipUnobservableChanges?: boolean | undefined;\n\n  /**\n   * When set, pushed changes are held in an in-memory {@link PendingDelta}\n   * merged into every read instead of being written to the backing table.\n   * The delta is dropped when the source moves to the next snapshot. This is\n   * the initial mode; see {@link TableSource.setDeferWrites}.\n   */\n  deferWrites?: boolean | undefined;\n};\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  readonly #skipUnobservableChanges: boolean;\n  readonly #primaryKeySort: Ordering;\n  #stmts: Statements;\n  #overlay?: Overlay | undefined;\n  #pushEpoch = 0;\n  /**\n   * When present, derivation is read-only: changes accumulate here instead of\n   * being written to (and later rolled back out of) the backing snapshot. See\n   * {@link PendingDelta}.\n   */\n  #delta: PendingDelta | undefined;\n  #rowsRead = 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    options: TableSourceOptions = {},\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.#primaryKeySort = primaryKey.map(k => [k, 'asc']);\n    this.#stmts = this.#getStatementsFor(db);\n    this.#shouldYield = shouldYield;\n    this.#skipUnobservableChanges = options.skipUnobservableChanges ?? false;\n    this.#delta = options.deferWrites\n      ? new PendingDelta(primaryKey)\n      : undefined;\n\n    const primaryKeyStr = JSON.stringify(primaryKey.toSorted());\n    assert(\n      this.#uniqueIndexes.has(primaryKeyStr),\n      `primary key ${primaryKeyStr} does not have a UNIQUE index`,\n    );\n  }\n\n  /**\n   * The number of rows read from SQLite by fetches, over the lifetime of this\n   * source. Rows that SQLite scans and filters out itself are not counted.\n   */\n  get rowsRead(): number {\n    return this.#rowsRead;\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    // The new snapshot already contains everything the batch was standing in\n    // for, so the batch is done.\n    this.#delta?.clear();\n  }\n\n  /**\n   * Sets whether the changes pushed from now on are held in memory (see\n   * {@link TableSourceOptions.deferWrites}) or written to the backing\n   * snapshot. The two must not be mixed within one snapshot, so this may only\n   * be called before the first push after construction or {@link setDB}. To\n   * switch to writing through partway, see {@link writePendingChanges}.\n   */\n  setDeferWrites(deferWrites: boolean) {\n    assert(\n      this.#delta === undefined || this.#delta.isEmpty,\n      'Cannot change how writes are applied while changes are pending',\n    );\n    if (!deferWrites) {\n      this.#delta = undefined;\n    } else {\n      this.#delta ??= new PendingDelta(this.#primaryKey);\n    }\n  }\n\n  /**\n   * Drops the changes held in memory (see {@link setDeferWrites}), for an\n   * advancement that has been abandoned. The source then no longer reflects\n   * the changes pushed to it, so it must not be read again until it has moved\n   * to another snapshot ({@link setDB}), if it is used again at all.\n   */\n  discardPendingChanges(): void {\n    this.#delta?.clear();\n  }\n\n  /**\n   * Writes the changes held in memory (see {@link setDeferWrites}) to the\n   * backing snapshot, which is left as if they had been written through (in\n   * the source's columns), and writes the changes pushed from then on through\n   * to it. Yields when the\n   * source's `shouldYield` says to, and must not be interleaved with a push.\n   */\n  *writePendingChanges(): Stream<'yield'> {\n    const delta = this.#delta;\n    if (delta === undefined) {\n      return;\n    }\n    // The rows the delta holds satisfy the table's unique keys, but one may\n    // take a unique value from another row that the delta also changed. So\n    // every row it touched is deleted before any is inserted.\n    for (const key of delta.touchedKeys()) {\n      this.#stmts.delete.run(\n        ...toSQLiteTypes(this.#primaryKey, key, this.#columns),\n      );\n      if (this.#shouldYield()) {\n        yield 'yield';\n      }\n    }\n    const columns = Object.keys(this.#columns);\n    for (const row of delta.liveRows()) {\n      this.#stmts.insert.run(...toSQLiteTypes(columns, row, this.#columns));\n      if (this.#shouldYield()) {\n        yield 'yield';\n      }\n    }\n    this.#delta = undefined;\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    };\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.#primaryKeySort;\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 rows = this.#queryRows(\n      this.#requestToSQL(req, connection.filters?.condition, sort),\n      debug,\n    );\n    const overlayPredicate = mergeOverlayPredicate(\n      connection.filters?.predicate,\n      req.filter,\n    );\n    try {\n      if (sort) {\n        const comparator = makeComparator(sort, req.reverse);\n        yield* generateWithStart(\n          generateWithYields(\n            generateWithOverlay(\n              req.start?.row,\n              this.#withPendingDelta(\n                rows,\n                req,\n                overlayPredicate,\n                sort,\n                comparator,\n              ),\n              req.constraint,\n              this.#overlay,\n              connection.lastPushedEpoch,\n              comparator,\n              // SQL does the ordering and constraining, so the row stream is\n              // already in the connection's sort order: the splice comparator\n              // and the `startAt` comparator coincide here.\n              comparator,\n              overlayPredicate,\n              req.multiConstraints,\n            ),\n            this.#shouldYield,\n          ),\n          req.start,\n          comparator,\n        );\n      } else {\n        yield* generateWithYields(\n          generateWithOverlayUnordered(\n            this.#withPendingDelta(\n              rows,\n              req,\n              overlayPredicate,\n              undefined,\n              undefined,\n            ),\n            req.constraint,\n            this.#overlay,\n            connection.lastPushedEpoch,\n            this.#primaryKey,\n            overlayPredicate,\n            req.multiConstraints,\n          ),\n          this.#shouldYield,\n        );\n      }\n    } finally {\n      // The generators above do not close `rows` when they are abandoned\n      // partway, which leaves its statement open.\n      rows.return();\n    }\n  }\n\n  /**\n   * The rows of `queries`, run one after another as {@link buildSelectQueries}\n   * requires. Each statement is run only once the previous one is exhausted,\n   * so a fetch that stops early never runs the rest.\n   */\n  *#queryRows(\n    queries: readonly SQLQuery[],\n    debug: DebugDelegate | undefined,\n  ): Generator<Row, void, undefined> {\n    const {cache} = this.#stmts;\n    for (const query of queries) {\n      const sqlAndBindings = format(query);\n      const cachedStatement = 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        yield* this.#mapFromSQLiteTypes(\n          this.#columns,\n          rowIterator,\n          sqlAndBindings.text,\n          debug,\n        );\n      } finally {\n        // Ensure the SQLite iterate() is closed.\n        rowIterator.return?.();\n        recordIndexUsage(cachedStatement.statement, this.#table);\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        cache.return(cachedStatement);\n      }\n    }\n  }\n\n  /**\n   * Splices the batch overlay into a base row stream, if there is one. When\n   * derivation is not deferred, or the batch is empty -- every fetch during\n   * hydration, and every fetch before the first change of a pass -- this is\n   * the identity and the source behaves exactly as it did before.\n   *\n   * `predicate` is the connection's filters ANDed with `req.filter`, which\n   * SQL applies to the base rows. `sort` and `compare` are absent for\n   * unordered fetches, where nothing downstream depends on position.\n   */\n  #withPendingDelta(\n    baseRows: IterableIterator<Row>,\n    req: FetchRequest,\n    predicate: ((row: Row) => boolean) | undefined,\n    sort: Ordering | undefined,\n    compare: Comparator | undefined,\n  ): IterableIterator<Row> {\n    const delta = this.#delta;\n    if (delta === undefined || delta.isEmpty) {\n      return baseRows;\n    }\n    const deltaRows = delta.rowsFor(\n      sort ?? this.#primaryKeySort,\n      req.constraint,\n      sort ? req.reverse : false,\n      predicate,\n      req.multiConstraints,\n      sort ? req.start?.row : undefined,\n    );\n    return compare\n      ? generateWithPendingDelta(baseRows, deltaRows, delta, compare)\n      : generateWithPendingDeltaUnordered(baseRows, deltaRows, delta);\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      this.#rowsRead++;\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  /**\n   * The number of rows held in memory for changes that have been pushed but\n   * not written, i.e. with `deferWrites`, since the last {@link setDB}.\n   */\n  get pendingRows(): number {\n    return this.#delta?.size ?? 0;\n  }\n\n  /** Estimated bytes retained by deferred changes and their indexes. */\n  get pendingBytes(): number {\n    return this.#delta?.estimatedBytes ?? 0;\n  }\n\n  /**\n   * Returns whether any connected pipeline could observe the given row.\n   * If false, this row is completely invisible to this TableSource's connections.\n   */\n  mayAcceptRow(row: Row): boolean {\n    if (!this.#skipUnobservableChanges || this.#connections.length === 0) {\n      return true;\n    }\n    for (const conn of this.#connections) {\n      if (!conn.filters || conn.filters.predicate(row)) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  #mayAcceptChange(change: SourceChange): boolean {\n    if (!this.#skipUnobservableChanges || this.#connections.length === 0) {\n      return true;\n    }\n    const row = change[SourceChangeIndex.ROW];\n    if (this.mayAcceptRow(row)) {\n      return true;\n    }\n    if (change[SourceChangeIndex.TYPE] === ChangeType.EDIT) {\n      const oldRow = change[SourceChangeIndex.OLD_ROW];\n      if (oldRow && this.mayAcceptRow(oldRow)) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  *genPush(change: SourceChange): Stream<'yield' | undefined> {\n    if (this.#skipUnobservableChanges && !this.#mayAcceptChange(change)) {\n      // No connection can observe this row, so only a REMOVE needs to be\n      // applied to the snapshot.\n      if (change[SourceChangeIndex.TYPE] === ChangeType.REMOVE) {\n        this.#writeChange(change);\n      }\n      return;\n    }\n\n    const setOverlay = (o: Overlay | undefined) => (this.#overlay = o);\n    const writeChange = (c: SourceChange) => this.#writeChange(c);\n\n    // Note: TableSource intentionally does not implement checkExists (which MemorySource\n    // uses for defensive asserts like \"Row already exists\" and \"Row not found\"):\n    //\n    // 1. Edit detection does not rely on checkExists:\n    //    Edits are detected upstream in PipelineDriver by matching row primary keys\n    //    against prevValues (via deepEqual on PK columns) and emitting SourceChangeEdit.\n    //\n    // 2. Upstream guarantees and error handling:\n    //    - Replicated streams from Postgres WAL / SnapshotDiff guarantee transactional\n    //      consistency, ordering, and row existence.\n    //    - PipelineDriver.#advance reconciles incoming row keys against both the prev\n    //      snapshot and pending delta, guaranteeing that any existing primary key is\n    //      emitted as an EDIT rather than an ADD.\n    //    - In write-through mode, SQLite's native PRIMARY KEY or UNIQUE constraints\n    //      immediately fail if a duplicate INSERT is attempted.\n    //    - In deferred-writes mode, writePendingChanges() deletes touched primary keys\n    //      before inserting (to handle unique-index permutations), meaning an erroneous\n    //      duplicate ADD would act as a replacement. We intentionally do not execute a\n    //      synchronous SQLite SELECT existence probe on every ADD to catch a theoretical\n    //      upstream bug, which is instead guarded by unit tests.\n    //    - Deletes of non-existent rows in SQLite are safe no-ops (0 rows affected).\n    //\n    // Omitting checkExists avoids executing expensive synchronous SQLite SELECT queries on every\n    // pushed row change, eliminating a major bottleneck in push advancement.\n    yield* genPushAndWriteWithSplitEdit(\n      this.#connections,\n      change,\n      undefined,\n      setOverlay,\n      writeChange,\n      () => ++this.#pushEpoch,\n    );\n  }\n\n  #writeChange(change: SourceChange) {\n    const delta = this.#delta;\n    if (delta !== undefined) {\n      this.#writeChangeToDelta(delta, change);\n      return;\n    }\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  /**\n   * Reconciles a set of rows that the caller found in the *backing snapshot*\n   * with the changes this source has applied but not written.\n   *\n   * A view-syncer computes the rows a replicated change collides with -- by\n   * change-log key for a delete, by every unique key for a set -- against the\n   * snapshot it is reading. When derivation writes through, that snapshot has\n   * already absorbed the earlier changes of the same advancement, so the\n   * probe sees them. When derivation is deferred they live here instead, and\n   * the probe has to be brought up to date or the source is pushed a change\n   * that contradicts its own state (a delete of a row the batch already\n   * removed, an edit whose old row is stale).\n   *\n   * Two ways the batch can disagree with the probe, both handled here: a\n   * probed row may have been removed, or may have been edited (so the\n   * caller's copy is stale, or it no longer collides at all).\n   *\n   * The batch cannot have edited a row the probe missed *into* collision. The\n   * change log keeps one entry per row key, so every row the batch holds is\n   * that row's value at the advancement's target version, as is `next`, and\n   * two distinct rows of one version cannot share a non-null unique key.\n   *\n   * Returns `base` untouched when derivation is not deferred, which is what\n   * makes this a no-op for the write-through path.\n   */\n  reconcilePendingConflicts(\n    base: readonly Row[],\n    next: Row | null,\n    rowKey: Row,\n    uniqueKeys: readonly (readonly string[])[],\n  ): readonly Row[] {\n    const delta = this.#delta;\n    if (delta === undefined || delta.isEmpty) {\n      return base;\n    }\n\n    // The change-log key uses SQLite values, while pending rows use ZQL\n    // values. It is the upstream replica identity, which may include columns\n    // the source does not sync. The batch cannot have changed those (nor can a\n    // write-through `UPDATE`), so only the synced columns are compared.\n    const deleteKey = next === null ? this.#syncedDeleteKey(rowKey) : undefined;\n    const out: Row[] = [];\n    for (const row of base) {\n      const pending = delta.get(row);\n      const current = pending === NOT_OVERRIDDEN ? row : pending;\n      if (current === undefined) {\n        continue; // the batch removed it\n      }\n      if (\n        deleteKey !== undefined\n          ? !deleteKey.every(([col, value]) =>\n              sqliteValuesEqual(current[col], value, this.#columns[col].type),\n            )\n          : !collides(\n              current,\n              must(next),\n              uniqueKeys,\n              this.#primaryKey,\n              this.#columns,\n            )\n      ) {\n        continue; // the batch edited it out of collision\n      }\n      out.push(current);\n    }\n    return out;\n  }\n\n  #syncedDeleteKey(rowKey: Row): [string, Value][] {\n    const synced: Writable<Row> = {};\n    for (const [col, value] of Object.entries(rowKey)) {\n      if (Object.hasOwn(this.#columns, col)) {\n        synced[col] = value;\n      }\n    }\n    return Object.entries(fromSQLiteTypes(this.#columns, synced, this.#table));\n  }\n\n  /**\n   * The batch-overlay counterpart of {@link #writeChange}. It must reproduce\n   * that method's semantics exactly, including its treatment of an edit that\n   * cannot be expressed as an `UPDATE` -- a changed primary key, or a table\n   * whose columns are all part of the key -- as a delete followed by an\n   * insert.\n   */\n  #writeChangeToDelta(delta: PendingDelta, change: SourceChange) {\n    switch (change[SourceChangeIndex.TYPE]) {\n      case ChangeType.ADD:\n        delta.set(change[SourceChangeIndex.ROW]);\n        break;\n      case ChangeType.REMOVE:\n        delta.delete(change[SourceChangeIndex.ROW]);\n        break;\n      case ChangeType.EDIT: {\n        const oldRow = change[SourceChangeIndex.OLD_ROW];\n        const row = change[SourceChangeIndex.ROW];\n        if (canUseUpdate(oldRow, row, this.#columns, this.#primaryKey)) {\n          // `UPDATE` sets only the non-primary columns, so the row keeps any\n          // column the change did not mention.\n          delta.set({...oldRow, ...row});\n        } else {\n          delta.delete(oldRow);\n          delta.set(row);\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    return getOrInsertComputed(this.#getRowStmtCache, keyString, () =>\n      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    );\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 raw = this.#stmts.cache.use(stmt, ({statement}) => {\n      const row = statement\n        .safeIntegers(true)\n        .get<Row>(...toSQLiteTypes(keyCols, rowKey, this.#columns));\n      recordIndexUsage(statement, this.#table);\n      return row;\n    });\n    const row = raw ? fromSQLiteTypes(this.#columns, raw, this.#table) : raw;\n\n    const delta = this.#delta;\n    if (delta === undefined || delta.isEmpty) {\n      return row;\n    }\n    if (row !== undefined) {\n      // The batch may have edited or removed the base row out from under this\n      // lookup. Its own primary key is what identifies it in the batch.\n      const overridden = delta.get(row);\n      if (overridden === NOT_OVERRIDDEN) {\n        return row;\n      }\n      if (\n        overridden !== undefined &&\n        keyCols.every(c => overridden[c] === rowKey[c])\n      ) {\n        return overridden;\n      }\n    }\n    // The base match is absent, removed, or no longer matches this key. Another\n    // pending row may now own the key.\n    return delta.getByColumns(keyCols, rowKey);\n  }\n\n  #requestToSQL(\n    request: FetchRequest,\n    filters: NoSubqueryCondition | undefined,\n    order: Ordering | undefined,\n  ): readonly SQLQuery[] {\n    return buildSelectQueries(\n      this.#table,\n      this.#columns,\n      request.constraint,\n      filters,\n      order,\n      request.reverse,\n      request.start,\n      request.multiConstraints,\n      request.filter,\n    );\n  }\n}\n\nfunction mergeOverlayPredicate(\n  connPredicate: ((row: Row) => boolean) | undefined,\n  reqFilter: StrictNoSubqueryCondition | undefined,\n): ((row: Row) => boolean) | undefined {\n  if (!reqFilter) {\n    return connPredicate;\n  }\n  const reqPredicate = createPredicate(reqFilter);\n  if (!connPredicate) {\n    return reqPredicate;\n  }\n  return row => connPredicate(row) && reqPredicate(row);\n}\n\n/**\n * Whether `a` occupies the same row identity as `b` -- the same primary key,\n * or the same value on any unique key, which is what a replicated write\n * conflicts on.\n */\nfunction collides(\n  a: Row,\n  b: Row,\n  uniqueKeys: readonly (readonly string[])[],\n  primaryKey: PrimaryKey,\n  columns: Record<string, SchemaValue>,\n): boolean {\n  if (\n    primaryKey.every(col =>\n      sqliteValuesEqual(a[col], b[col], columns[col].type),\n    )\n  ) {\n    return true;\n  }\n  for (const key of uniqueKeys) {\n    if (key.some(col => b[col] === null || b[col] === undefined)) {\n      continue;\n    }\n    if (\n      key.every(col => sqliteValuesEqual(a[col], b[col], columns[col].type))\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n\nfunction sqliteValuesEqual(\n  a: Value | undefined,\n  b: Value | undefined,\n  type: ValueType,\n) {\n  return toSQLiteType(a, type) === toSQLiteType(b, type);\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 AND\n            info.partial = 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        const bi = v as bigint;\n        if (bi > Number.MAX_SAFE_INTEGER || bi < Number.MIN_SAFE_INTEGER) {\n          throw new UnsupportedValueError(\n            `value ${bi} (in ${tableName}.${column}) is outside of supported bounds`,\n          );\n        }\n        return Number(bi);\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":";;;;;;;;;;;;;;;AAqEA,IAAI,aAAa;;;;;;;;;;;;;;;AAqCjB,IAAa,cAAb,MAA2C;CACzC,2BAAoB,IAAI,QAA8B;CACtD,eAAsC,CAAC;CACvC;CACA;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,aAAa;;;;;;CAMb;CACA,YAAY;;;;;;;CAQZ,YACE,YACA,WACA,IACA,WACA,SACA,YACA,oBAAoB,OACpB,UAA8B,CAAC,GAC/B;EACA,KAAKO,MAAM;EACX,KAAKD,aAAa;EAClB,KAAKJ,SAAS;EACd,KAAKC,WAAW;EAChB,KAAKC,iBAAiB,iBAAiB,IAAI,SAAS;EACpD,KAAKC,cAAc;EACnB,KAAKK,kBAAkB,WAAW,KAAI,MAAK,CAAC,GAAG,KAAK,CAAC;EACrD,KAAKC,SAAS,KAAKC,kBAAkB,EAAE;EACvC,KAAKJ,eAAe;EACpB,KAAKC,2BAA2B,QAAQ,2BAA2B;EACnE,KAAKI,SAAS,QAAQ,cAClB,IAAI,aAAa,UAAU,IAC3B,KAAA;EAEJ,MAAM,gBAAgB,KAAK,UAAU,WAAW,SAAS,CAAC;EAC1D,OACE,KAAKT,eAAe,IAAI,aAAa,GACrC,eAAe,cAAc,8BAC/B;CACF;;;;;CAMA,IAAI,WAAmB;EACrB,OAAO,KAAKU;CACd;CAEA,IAAI,cAAc;EAChB,OAAO;GACL,MAAM,KAAKZ;GACX,SAAS,KAAKC;GACd,YAAY,KAAKE;EACnB;CACF;;;;;CAMA,MAAM,IAAc;EAClB,KAAKM,SAAS,KAAKC,kBAAkB,EAAE;EAGvC,KAAKC,QAAQ,MAAM;CACrB;;;;;;;;CASA,eAAe,aAAsB;EACnC,OACE,KAAKA,WAAW,KAAA,KAAa,KAAKA,OAAO,SACzC,gEACF;EACA,IAAI,CAAC,aACH,KAAKA,SAAS,KAAA;OAEd,KAAKA,WAAW,IAAI,aAAa,KAAKR,WAAW;CAErD;;;;;;;CAQA,wBAA8B;EAC5B,KAAKQ,QAAQ,MAAM;CACrB;;;;;;;;CASA,CAAC,sBAAuC;EACtC,MAAM,QAAQ,KAAKA;EACnB,IAAI,UAAU,KAAA,GACZ;EAKF,KAAK,MAAM,OAAO,MAAM,YAAY,GAAG;GACrC,KAAKF,OAAO,OAAO,IACjB,GAAG,cAAc,KAAKN,aAAa,KAAK,KAAKF,QAAQ,CACvD;GACA,IAAI,KAAKK,aAAa,GACpB,MAAM;EAEV;EACA,MAAM,UAAU,OAAO,KAAK,KAAKL,QAAQ;EACzC,KAAK,MAAM,OAAO,MAAM,SAAS,GAAG;GAClC,KAAKQ,OAAO,OAAO,IAAI,GAAG,cAAc,SAAS,KAAK,KAAKR,QAAQ,CAAC;GACpE,IAAI,KAAKK,aAAa,GACpB,MAAM;EAEV;EACA,KAAKK,SAAS,KAAA;CAChB;CAEA,kBAAkB,IAAc;EAC9B,MAAM,SAAS,KAAKb,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;EACR;EACA,KAAKL,SAAS,IAAI,IAAI,KAAK;EAC3B,OAAO;CACT;CAEA,IAAIe,cAAc;EAChB,OAAO,IAAI,KACT,OAAO,KAAK,KAAKZ,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,KAAKK;EAEtC,MAAM,QAAqB;GACzB,iBAAiB;GACjB,QAAO,QAAO,KAAKM,OAAO,KAAK,UAAU;GACzC,YAAW,WAAU;IACnB,WAAW,SAAS;GACtB;GACA,eAAe;IACb,MAAM,MAAM,KAAKf,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,KAAKgB,WAAW,YAAY,SAAS;EACpD,IAAI,CAAC,WACH,yBAAyB,MAAM,KAAKZ,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,CAACa,OAAO,KAAmB,YAAgD;EACzE,MAAM,EAAC,MAAM,UAAS;EAEtB,MAAM,OAAO,KAAKE,WAChB,KAAKC,cAAc,KAAK,WAAW,SAAS,WAAW,IAAI,GAC3D,KACF;EACA,MAAM,mBAAmB,sBACvB,WAAW,SAAS,WACpB,IAAI,MACN;EACA,IAAI;GACF,IAAI,MAAM;IACR,MAAM,aAAa,eAAe,MAAM,IAAI,OAAO;IACnD,OAAO,kBACL,mBACE,oBACE,IAAI,OAAO,KACX,KAAKC,kBACH,MACA,KACA,kBACA,MACA,UACF,GACA,IAAI,YACJ,KAAKC,UACL,WAAW,iBACX,YAIA,YACA,kBACA,IAAI,gBACN,GACA,KAAKb,YACP,GACA,IAAI,OACJ,UACF;GACF,OACE,OAAO,mBACL,6BACE,KAAKY,kBACH,MACA,KACA,kBACA,KAAA,GACA,KAAA,CACF,GACA,IAAI,YACJ,KAAKC,UACL,WAAW,iBACX,KAAKhB,aACL,kBACA,IAAI,gBACN,GACA,KAAKG,YACP;EAEJ,UAAU;GAGR,KAAK,OAAO;EACd;CACF;;;;;;CAOA,CAACU,WACC,SACA,OACiC;EACjC,MAAM,EAAC,UAAS,KAAKP;EACrB,KAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,iBAAiB,OAAO,KAAK;GACnC,MAAM,kBAAkB,MAAM,IAAI,eAAe,IAAI;GACrD,gBAAgB,UAAU,aAAa,IAAI;GAC3C,MAAM,cAAc,gBAAgB,UAAU,QAC5C,GAAG,eAAe,MACpB;GACA,IAAI;IACF,OAAO,UAAU,KAAKT,QAAQ,eAAe,IAAI;IACjD,OAAO,KAAKoB,oBACV,KAAKnB,UACL,aACA,eAAe,MACf,KACF;GACF,UAAU;IAER,YAAY,SAAS;IACrB,iBAAiB,gBAAgB,WAAW,KAAKD,MAAM;IACvD,IAAI,OAAO;KACT,IAAI,cAAc;KAClB,MAAM,YAAsB,CAAC;KAC7B,KAAK,IAAI,IAAI,IAAK,KAAK;MACrB,MAAM,SAAS,gBAAgB,UAAU,WACvC,GACA,gBAAgB,wBAChB,CACF;MACA,IAAI,WAAW,KAAA,GACb;MAEF,eAAe,OAAO,MAAM;MAC5B,MAAM,UAAU,gBAAgB,UAAU,WACxC,GACA,gBAAgB,yBAChB,CACF;MACA,IAAI,OAAO,YAAY,YAAY,QAAQ,SAAS,GAClD,UAAU,KAAK,OAAO;KAE1B;KACA,IAAI,gBAAgB,GAClB,MAAM,aAAa,KAAKA,QAAQ,eAAe,MAAM,WAAW;KAElE,IAAI,UAAU,SAAS,GACrB,MAAM,cAAc,KAAKA,QAAQ,eAAe,MAAM,SAAS;KAEjE,gBAAgB,UAAU,gBAAgB;IAC5C;IACA,MAAM,OAAO,eAAe;GAC9B;EACF;CACF;;;;;;;;;;;CAYA,kBACE,UACA,KACA,WACA,MACA,SACuB;EACvB,MAAM,QAAQ,KAAKW;EACnB,IAAI,UAAU,KAAA,KAAa,MAAM,SAC/B,OAAO;EAET,MAAM,YAAY,MAAM,QACtB,QAAQ,KAAKH,iBACb,IAAI,YACJ,OAAO,IAAI,UAAU,OACrB,WACA,IAAI,kBACJ,OAAO,IAAI,OAAO,MAAM,KAAA,CAC1B;EACA,OAAO,UACH,yBAAyB,UAAU,WAAW,OAAO,OAAO,IAC5D,kCAAkC,UAAU,WAAW,KAAK;CAClE;CAEA,CAACY,oBACC,YACA,aACA,OACA,OACuB;EACvB,IAAI;EACJ,GAAG;GACD,SAAS,YACP,KAAKf,KACL,EAAE,YACF,KAAKD,WAAW,mBACV,YAAY,KAAK,GACvB,KAAKA,WAAW,wBAEd,uCAAuC,MAAM,4BACjD;GACA,IAAI,OAAO,MACT;GAEF,KAAKQ;GACL,MAAM,MAAM,gBAAgB,YAAY,OAAO,OAAO,KAAKZ,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;;;;;CAMA,IAAI,cAAsB;EACxB,OAAO,KAAKW,QAAQ,QAAQ;CAC9B;;CAGA,IAAI,eAAuB;EACzB,OAAO,KAAKA,QAAQ,kBAAkB;CACxC;;;;;CAMA,aAAa,KAAmB;EAC9B,IAAI,CAAC,KAAKJ,4BAA4B,KAAKR,aAAa,WAAW,GACjE,OAAO;EAET,KAAK,MAAM,QAAQ,KAAKA,cACtB,IAAI,CAAC,KAAK,WAAW,KAAK,QAAQ,UAAU,GAAG,GAC7C,OAAO;EAGX,OAAO;CACT;CAEA,iBAAiB,QAA+B;EAC9C,IAAI,CAAC,KAAKQ,4BAA4B,KAAKR,aAAa,WAAW,GACjE,OAAO;EAET,MAAM,MAAM,OAAO;EACnB,IAAI,KAAK,aAAa,GAAG,GACvB,OAAO;EAET,IAAI,OAAO,OAA4B,GAAiB;GACtD,MAAM,SAAS,OAAO;GACtB,IAAI,UAAU,KAAK,aAAa,MAAM,GACpC,OAAO;EAEX;EACA,OAAO;CACT;CAEA,CAAC,QAAQ,QAAmD;EAC1D,IAAI,KAAKQ,4BAA4B,CAAC,KAAKc,iBAAiB,MAAM,GAAG;GAGnE,IAAI,OAAO,OAA4B,GACrC,KAAKC,aAAa,MAAM;GAE1B;EACF;EAEA,MAAM,cAAc,MAA4B,KAAKH,WAAW;EAChE,MAAM,eAAe,MAAoB,KAAKG,aAAa,CAAC;EA0B5D,OAAO,6BACL,KAAKvB,cACL,QACA,KAAA,GACA,YACA,mBACM,EAAE,KAAKwB,UACf;CACF;CAEA,aAAa,QAAsB;EACjC,MAAM,QAAQ,KAAKZ;EACnB,IAAI,UAAU,KAAA,GAAW;GACvB,KAAKa,oBAAoB,OAAO,MAAM;GACtC;EACF;EACA,QAAQ,OAAO,IAAf;GACE,KAAK;IACH,KAAKf,OAAO,OAAO,IACjB,GAAG,cAED,OAAO,KAAK,KAAKR,QAAQ,GACzB,OAAO,IACP,KAAKA,QACP,CACF;IACA;GACF,KAAK;IACH,KAAKQ,OAAO,OAAO,IACjB,GAAG,cACD,KAAKN,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,KAAKQ,OAAO,MAAM,EAAE,IAAI,MAAM;IACrC,OAAO;KACL,KAAKA,OAAO,OAAO,IACjB,GAAG,cACD,KAAKN,aACL,OAAO,IACP,KAAKF,QACP,CACF;KACA,KAAKQ,OAAO,OAAO,IACjB,GAAG,cACD,OAAO,KAAK,KAAKR,QAAQ,GACzB,OAAO,IACP,KAAKA,QACP,CACF;IACF;IAEA;GAEF,SACE,YAAY,MAAM;EACtB;CACF;;;;;;;;;;;;;;;;;;;;;;;;;;CA2BA,0BACE,MACA,MACA,QACA,YACgB;EAChB,MAAM,QAAQ,KAAKU;EACnB,IAAI,UAAU,KAAA,KAAa,MAAM,SAC/B,OAAO;EAOT,MAAM,YAAY,SAAS,OAAO,KAAKc,iBAAiB,MAAM,IAAI,KAAA;EAClE,MAAM,MAAa,CAAC;EACpB,KAAK,MAAM,OAAO,MAAM;GACtB,MAAM,UAAU,MAAM,IAAI,GAAG;GAC7B,MAAM,UAAU,YAAY,iBAAiB,MAAM;GACnD,IAAI,YAAY,KAAA,GACd;GAEF,IACE,cAAc,KAAA,IACV,CAAC,UAAU,OAAO,CAAC,KAAK,WACtB,kBAAkB,QAAQ,MAAM,OAAO,KAAKxB,SAAS,KAAK,IAAI,CAChE,IACA,CAAC,SACC,SACA,KAAK,IAAI,GACT,YACA,KAAKE,aACL,KAAKF,QACP,GAEJ;GAEF,IAAI,KAAK,OAAO;EAClB;EACA,OAAO;CACT;CAEA,iBAAiB,QAAgC;EAC/C,MAAM,SAAwB,CAAC;EAC/B,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,GAC9C,IAAI,OAAO,OAAO,KAAKA,UAAU,GAAG,GAClC,OAAO,OAAO;EAGlB,OAAO,OAAO,QAAQ,gBAAgB,KAAKA,UAAU,QAAQ,KAAKD,MAAM,CAAC;CAC3E;;;;;;;;CASA,oBAAoB,OAAqB,QAAsB;EAC7D,QAAQ,OAAO,IAAf;GACE,KAAK;IACH,MAAM,IAAI,OAAO,EAAsB;IACvC;GACF,KAAK;IACH,MAAM,OAAO,OAAO,EAAsB;IAC1C;GACF,KAAK,GAAiB;IACpB,MAAM,SAAS,OAAO;IACtB,MAAM,MAAM,OAAO;IACnB,IAAI,aAAa,QAAQ,KAAK,KAAKC,UAAU,KAAKE,WAAW,GAG3D,MAAM,IAAI;KAAC,GAAG;KAAQ,GAAG;IAAG,CAAC;SACxB;KACL,MAAM,OAAO,MAAM;KACnB,MAAM,IAAI,GAAG;IACf;IACA;GACF;GACA,SACE,YAAY,MAAM;EACtB;CACF;CAEA,mCAAmB,IAAI,IAAoB;CAE3C,YAAY,SAA2B;EACrC,MAAM,YAAY,KAAK,UAAU,OAAO;EACxC,OAAO,oBAAoB,KAAKuB,kBAAkB,iBAChD,QACE,GAAG,UAAU,KAAKb,YAAY,QAAQ,IAAI,MACxC,KAAKb,MACP,EAAE,SAAS,IAAI,KACb,QAAQ,KAAI,MAAK,GAAG,GAAG,IAAI,MAAM,CAAC,EAAE,GAAG,GACvC,GAAG,MACL,GACF,CACF;CACF;;;;;;;;CASA,OAAO,QAA8B;EACnC,MAAM,UAAU,OAAO,KAAK,MAAM;EAElC,MAAM,OAAO,KAAK2B,YAAY,OAAO;EACrC,MAAM,MAAM,KAAKlB,OAAO,MAAM,IAAI,OAAO,EAAC,gBAAe;GACvD,MAAM,MAAM,UACT,aAAa,IAAI,EACjB,IAAS,GAAG,cAAc,SAAS,QAAQ,KAAKR,QAAQ,CAAC;GAC5D,iBAAiB,WAAW,KAAKD,MAAM;GACvC,OAAO;EACT,CAAC;EACD,MAAM,MAAM,MAAM,gBAAgB,KAAKC,UAAU,KAAK,KAAKD,MAAM,IAAI;EAErE,MAAM,QAAQ,KAAKW;EACnB,IAAI,UAAU,KAAA,KAAa,MAAM,SAC/B,OAAO;EAET,IAAI,QAAQ,KAAA,GAAW;GAGrB,MAAM,aAAa,MAAM,IAAI,GAAG;GAChC,IAAI,eAAe,gBACjB,OAAO;GAET,IACE,eAAe,KAAA,KACf,QAAQ,OAAM,MAAK,WAAW,OAAO,OAAO,EAAE,GAE9C,OAAO;EAEX;EAGA,OAAO,MAAM,aAAa,SAAS,MAAM;CAC3C;CAEA,cACE,SACA,SACA,OACqB;EACrB,OAAO,mBACL,KAAKX,QACL,KAAKC,UACL,QAAQ,YACR,SACA,OACA,QAAQ,SACR,QAAQ,OACR,QAAQ,kBACR,QAAQ,MACV;CACF;AACF;AAEA,SAAS,sBACP,eACA,WACqC;CACrC,IAAI,CAAC,WACH,OAAO;CAET,MAAM,eAAe,gBAAgB,SAAS;CAC9C,IAAI,CAAC,eACH,OAAO;CAET,QAAO,QAAO,cAAc,GAAG,KAAK,aAAa,GAAG;AACtD;;;;;;AAOA,SAAS,SACP,GACA,GACA,YACA,YACA,SACS;CACT,IACE,WAAW,OAAM,QACf,kBAAkB,EAAE,MAAM,EAAE,MAAM,QAAQ,KAAK,IAAI,CACrD,GAEA,OAAO;CAET,KAAK,MAAM,OAAO,YAAY;EAC5B,IAAI,IAAI,MAAK,QAAO,EAAE,SAAS,QAAQ,EAAE,SAAS,KAAA,CAAS,GACzD;EAEF,IACE,IAAI,OAAM,QAAO,kBAAkB,EAAE,MAAM,EAAE,MAAM,QAAQ,KAAK,IAAI,CAAC,GAErE,OAAO;CAEX;CACA,OAAO;AACT;AAEA,SAAS,kBACP,GACA,GACA,MACA;CACA,OAAO,aAAa,GAAG,IAAI,MAAM,aAAa,GAAG,IAAI;AACvD;AAEA,SAAS,iBACP,IACA,WAC0B;CAC1B,MAAM,iBAAiB,OACrB,GAAG;;;;;6BAKsB,UAAU;;;;;wBAMrC;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,MAAM,KAAK;IACX,IAAI,KAAK,OAAO,oBAAoB,KAAK,OAAO,kBAC9C,MAAM,IAAI,sBACR,SAAS,GAAG,OAAO,UAAU,GAAG,OAAO,iCACzC;IAEF,OAAO,OAAO,EAAE;GAClB;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":[],"sources":["../../../../zqlite/src/table-source.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport SQLite3Database from '@rocicorp/zero-sqlite3';\nimport type {LogConfig} from '../../otel/src/log-options.ts';\nimport {assert, unreachable} from '../../shared/src/asserts.ts';\nimport {getOrInsertComputed} from '../../shared/src/map.ts';\nimport {must} from '../../shared/src/must.ts';\nimport {assignProperty} from '../../shared/src/objects.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  type NoSubqueryCondition as StrictNoSubqueryCondition,\n} from '../../zql/src/builder/filter.ts';\nimport {ChangeType} from '../../zql/src/ivm/change-type.ts';\nimport {\n  makeComparator,\n  type Comparator,\n  type Node,\n} 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 {BatchCursor, Database, Statement} from './db.ts';\nimport {FetchSQLCache, type FetchSQL} from './fetch-sql.ts';\nimport {recordIndexUsage} from './index-usage.ts';\nimport {compile, format, sql} from './internal/sql.ts';\nimport {StatementCache} from './internal/statement-cache.ts';\nimport {\n  generateWithPendingDelta,\n  generateWithPendingDeltaUnordered,\n  NOT_OVERRIDDEN,\n  PendingDelta,\n} from './pending-delta.ts';\nimport {toSQLiteType} 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};\n\nlet eventCount = 0;\n\n// A fetch reads its rows in batches that start at one row and double up to the\n// maximum. Take, Cap and EXISTS often stop after a row or two, and the rows a\n// batch reads ahead are work SQLite does for nothing; doubling keeps them\n// fewer than the rows consumed.\nconst FIRST_BATCH_ROWS = 1;\nconst MAX_BATCH_ROWS = 128;\n\nexport type TableSourceOptions = {\n  /**\n   * When set, a pushed change that the filters of every connection reject\n   * is neither pushed nor applied to the backing table, on the grounds that\n   * no connection can observe it. This departs from the `Source.push`\n   * contract (a push commits the change to the source), so it is only\n   * appropriate when the caller does not read the table through any other\n   * path and replaces the table's contents afterwards, as the view-syncer's\n   * pipeline driver does when it advances to the next snapshot.\n   */\n  skipUnobservableChanges?: boolean | undefined;\n\n  /**\n   * When set, pushed changes are held in an in-memory {@link PendingDelta}\n   * merged into every read instead of being written to the backing table.\n   * The delta is dropped when the source moves to the next snapshot. This is\n   * the initial mode; see {@link TableSource.setDeferWrites}.\n   */\n  deferWrites?: boolean | undefined;\n};\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 #rawColumns = new WeakMap<Statement, readonly RawColumn[]>();\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  readonly #skipUnobservableChanges: boolean;\n  readonly #primaryKeySort: Ordering;\n  #stmts: Statements;\n  #overlay?: Overlay | undefined;\n  #pushEpoch = 0;\n  /**\n   * When present, derivation is read-only: changes accumulate here instead of\n   * being written to (and later rolled back out of) the backing snapshot. See\n   * {@link PendingDelta}.\n   */\n  #delta: PendingDelta | undefined;\n  #rowsRead = 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    options: TableSourceOptions = {},\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.#primaryKeySort = primaryKey.map(k => [k, 'asc']);\n    this.#stmts = this.#getStatementsFor(db);\n    this.#shouldYield = shouldYield;\n    this.#skipUnobservableChanges = options.skipUnobservableChanges ?? false;\n    this.#delta = options.deferWrites\n      ? new PendingDelta(primaryKey)\n      : undefined;\n\n    const primaryKeyStr = JSON.stringify(primaryKey.toSorted());\n    assert(\n      this.#uniqueIndexes.has(primaryKeyStr),\n      `primary key ${primaryKeyStr} does not have a UNIQUE index`,\n    );\n  }\n\n  /**\n   * The number of rows read from SQLite by fetches, over the lifetime of this\n   * source. Rows that SQLite scans and filters out itself are not counted.\n   */\n  get rowsRead(): number {\n    return this.#rowsRead;\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    // The new snapshot already contains everything the batch was standing in\n    // for, so the batch is done.\n    this.#delta?.clear();\n  }\n\n  /**\n   * Sets whether the changes pushed from now on are held in memory (see\n   * {@link TableSourceOptions.deferWrites}) or written to the backing\n   * snapshot. The two must not be mixed within one snapshot, so this may only\n   * be called before the first push after construction or {@link setDB}. To\n   * switch to writing through partway, see {@link writePendingChanges}.\n   */\n  setDeferWrites(deferWrites: boolean) {\n    assert(\n      this.#delta === undefined || this.#delta.isEmpty,\n      'Cannot change how writes are applied while changes are pending',\n    );\n    if (!deferWrites) {\n      this.#delta = undefined;\n    } else {\n      this.#delta ??= new PendingDelta(this.#primaryKey);\n    }\n  }\n\n  /**\n   * Drops the changes held in memory (see {@link setDeferWrites}), for an\n   * advancement that has been abandoned. The source then no longer reflects\n   * the changes pushed to it, so it must not be read again until it has moved\n   * to another snapshot ({@link setDB}), if it is used again at all.\n   */\n  discardPendingChanges(): void {\n    this.#delta?.clear();\n  }\n\n  /**\n   * Writes the changes held in memory (see {@link setDeferWrites}) to the\n   * backing snapshot, which is left as if they had been written through (in\n   * the source's columns), and writes the changes pushed from then on through\n   * to it. Yields when the\n   * source's `shouldYield` says to, and must not be interleaved with a push.\n   */\n  *writePendingChanges(): Stream<'yield'> {\n    const delta = this.#delta;\n    if (delta === undefined) {\n      return;\n    }\n    // The rows the delta holds satisfy the table's unique keys, but one may\n    // take a unique value from another row that the delta also changed. So\n    // every row it touched is deleted before any is inserted.\n    for (const key of delta.touchedKeys()) {\n      this.#stmts.delete.run(\n        ...toSQLiteTypes(this.#primaryKey, key, this.#columns),\n      );\n      if (this.#shouldYield()) {\n        yield 'yield';\n      }\n    }\n    const columns = Object.keys(this.#columns);\n    for (const row of delta.liveRows()) {\n      this.#stmts.insert.run(...toSQLiteTypes(columns, row, this.#columns));\n      if (this.#shouldYield()) {\n        yield 'yield';\n      }\n    }\n    this.#delta = undefined;\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    };\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.#primaryKeySort;\n\n    const fetchSQL = new FetchSQLCache(\n      this.#table,\n      this.#columns,\n      transformedFilters.filters,\n      sort,\n    );\n    const input: SourceInput = {\n      getSchema: () => schema,\n      fetch: req => this.#fetch(req, connection, fetchSQL),\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(\n    req: FetchRequest,\n    connection: Connection,\n    fetchSQL: FetchSQLCache,\n  ): Stream<Node | 'yield'> {\n    const {sort, debug} = connection;\n\n    const rows = this.#queryRows(fetchSQL.get(req), debug);\n    const overlayPredicate = mergeOverlayPredicate(\n      connection.filters?.predicate,\n      req.filter,\n    );\n    try {\n      if (sort) {\n        const comparator = makeComparator(sort, req.reverse);\n        yield* generateWithStart(\n          generateWithYields(\n            generateWithOverlay(\n              req.start?.row,\n              this.#withPendingDelta(\n                rows,\n                req,\n                overlayPredicate,\n                sort,\n                comparator,\n              ),\n              req.constraint,\n              this.#overlay,\n              connection.lastPushedEpoch,\n              comparator,\n              // SQL does the ordering and constraining, so the row stream is\n              // already in the connection's sort order: the splice comparator\n              // and the `startAt` comparator coincide here.\n              comparator,\n              overlayPredicate,\n              req.multiConstraints,\n            ),\n            this.#shouldYield,\n          ),\n          req.start,\n          comparator,\n        );\n      } else {\n        yield* generateWithYields(\n          generateWithOverlayUnordered(\n            this.#withPendingDelta(\n              rows,\n              req,\n              overlayPredicate,\n              undefined,\n              undefined,\n            ),\n            req.constraint,\n            this.#overlay,\n            connection.lastPushedEpoch,\n            this.#primaryKey,\n            overlayPredicate,\n            req.multiConstraints,\n          ),\n          this.#shouldYield,\n        );\n      }\n    } finally {\n      // The generators above do not close `rows` when they are abandoned\n      // partway, which leaves its statement open.\n      rows.return();\n    }\n  }\n\n  /**\n   * The rows of `queries`, run one after another as `buildSelectQueries`\n   * requires. Each statement is run only once the previous one is exhausted,\n   * so a fetch that stops early never runs the rest.\n   */\n  *#queryRows(\n    queries: readonly FetchSQL[],\n    debug: DebugDelegate | undefined,\n  ): Generator<Row, void, undefined> {\n    const {cache} = this.#stmts;\n    for (const sqlAndBindings of queries) {\n      // The text of a fetch shape is the same string every time, so it needs\n      // no normalizing.\n      const cachedStatement = cache.getExact(sqlAndBindings.text);\n      const cursor = cachedStatement.statement.batches(sqlAndBindings.values);\n      try {\n        debug?.initQuery(this.#table, sqlAndBindings.text);\n        yield* this.#readRows(\n          cursor,\n          this.#rawColumnsFor(cachedStatement.statement),\n          sqlAndBindings.text,\n          debug,\n        );\n      } finally {\n        // Ensure the SQLite cursor is closed.\n        cursor.close();\n        recordIndexUsage(cachedStatement.statement, this.#table);\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        cache.return(cachedStatement);\n      }\n    }\n  }\n\n  /**\n   * Splices the batch overlay into a base row stream, if there is one. When\n   * derivation is not deferred, or the batch is empty -- every fetch during\n   * hydration, and every fetch before the first change of a pass -- this is\n   * the identity and the source behaves exactly as it did before.\n   *\n   * `predicate` is the connection's filters ANDed with `req.filter`, which\n   * SQL applies to the base rows. `sort` and `compare` are absent for\n   * unordered fetches, where nothing downstream depends on position.\n   */\n  #withPendingDelta(\n    baseRows: IterableIterator<Row>,\n    req: FetchRequest,\n    predicate: ((row: Row) => boolean) | undefined,\n    sort: Ordering | undefined,\n    compare: Comparator | undefined,\n  ): IterableIterator<Row> {\n    const delta = this.#delta;\n    if (delta === undefined || delta.isEmpty) {\n      return baseRows;\n    }\n    const deltaRows = delta.rowsFor(\n      sort ?? this.#primaryKeySort,\n      req.constraint,\n      sort ? req.reverse : false,\n      predicate,\n      req.multiConstraints,\n      sort ? req.start?.row : undefined,\n    );\n    return compare\n      ? generateWithPendingDelta(baseRows, deltaRows, delta, compare)\n      : generateWithPendingDeltaUnordered(baseRows, deltaRows, delta);\n  }\n\n  #rawColumnsFor(statement: Statement): readonly RawColumn[] {\n    return getOrInsertComputed(this.#rawColumns, statement, () =>\n      statement\n        .columns()\n        .map(({name}) => rawColumn(this.#columns, name, this.#table)),\n    );\n  }\n\n  *#readRows(\n    cursor: BatchCursor,\n    columns: readonly RawColumn[],\n    query: string,\n    debug: DebugDelegate | undefined,\n  ): IterableIterator<Row> {\n    for (let capacity = FIRST_BATCH_ROWS; ;) {\n      const {ivmSampling, slowRowThreshold} = this.#logConfig;\n      const sampled = ivmSampling > 0 && ++eventCount % ivmSampling === 0;\n      const start = sampled ? performance.now() : 0;\n      const values = cursor.next(capacity);\n      const n = values.length / columns.length;\n      if (sampled) {\n        const duration = performance.now() - start;\n        // slowRowThreshold is per row: scale it by the rows actually read.\n        if (duration > slowRowThreshold * Math.max(n, 1)) {\n          this.#lc.warn?.(\n            `table-source.next took too long for ${query}. Are you missing an index? duration: ${duration}ms`,\n          );\n        }\n      }\n      if (n === 0) {\n        return;\n      }\n      // Rows are converted only when they are consumed, so rows read ahead\n      // and never used cost no conversion and cannot fail the fetch.\n      for (let r = 0; r < n; r++) {\n        const row = fromSQLiteRawRow(\n          columns,\n          values,\n          this.#table,\n          r * columns.length,\n        );\n        this.#rowsRead++;\n        debug?.rowVended(this.#table, query, row);\n        yield row;\n      }\n      capacity = Math.min(capacity * 2, MAX_BATCH_ROWS);\n    }\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  /**\n   * The number of rows held in memory for changes that have been pushed but\n   * not written, i.e. with `deferWrites`, since the last {@link setDB}.\n   */\n  get pendingRows(): number {\n    return this.#delta?.size ?? 0;\n  }\n\n  /** Estimated bytes retained by deferred changes and their indexes. */\n  get pendingBytes(): number {\n    return this.#delta?.estimatedBytes ?? 0;\n  }\n\n  /**\n   * Returns whether any connected pipeline could observe the given row.\n   * If false, this row is completely invisible to this TableSource's connections.\n   */\n  mayAcceptRow(row: Row): boolean {\n    if (!this.#skipUnobservableChanges || this.#connections.length === 0) {\n      return true;\n    }\n    for (const conn of this.#connections) {\n      if (!conn.filters || conn.filters.predicate(row)) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  #mayAcceptChange(change: SourceChange): boolean {\n    if (!this.#skipUnobservableChanges || this.#connections.length === 0) {\n      return true;\n    }\n    const row = change[SourceChangeIndex.ROW];\n    if (this.mayAcceptRow(row)) {\n      return true;\n    }\n    if (change[SourceChangeIndex.TYPE] === ChangeType.EDIT) {\n      const oldRow = change[SourceChangeIndex.OLD_ROW];\n      if (oldRow && this.mayAcceptRow(oldRow)) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  *genPush(change: SourceChange): Stream<'yield' | undefined> {\n    if (this.#skipUnobservableChanges && !this.#mayAcceptChange(change)) {\n      // No connection can observe this row, so only a REMOVE needs to be\n      // applied to the snapshot.\n      if (change[SourceChangeIndex.TYPE] === ChangeType.REMOVE) {\n        this.#writeChange(change);\n      }\n      return;\n    }\n\n    const setOverlay = (o: Overlay | undefined) => (this.#overlay = o);\n    const writeChange = (c: SourceChange) => this.#writeChange(c);\n\n    // Note: TableSource intentionally does not implement checkExists (which MemorySource\n    // uses for defensive asserts like \"Row already exists\" and \"Row not found\"):\n    //\n    // 1. Edit detection does not rely on checkExists:\n    //    Edits are detected upstream in PipelineDriver by matching row primary keys\n    //    against prevValues (via deepEqual on PK columns) and emitting SourceChangeEdit.\n    //\n    // 2. Upstream guarantees and error handling:\n    //    - Replicated streams from Postgres WAL / SnapshotDiff guarantee transactional\n    //      consistency, ordering, and row existence.\n    //    - PipelineDriver.#advance reconciles incoming row keys against both the prev\n    //      snapshot and pending delta, guaranteeing that any existing primary key is\n    //      emitted as an EDIT rather than an ADD.\n    //    - In write-through mode, SQLite's native PRIMARY KEY or UNIQUE constraints\n    //      immediately fail if a duplicate INSERT is attempted.\n    //    - In deferred-writes mode, writePendingChanges() deletes touched primary keys\n    //      before inserting (to handle unique-index permutations), meaning an erroneous\n    //      duplicate ADD would act as a replacement. We intentionally do not execute a\n    //      synchronous SQLite SELECT existence probe on every ADD to catch a theoretical\n    //      upstream bug, which is instead guarded by unit tests.\n    //    - Deletes of non-existent rows in SQLite are safe no-ops (0 rows affected).\n    //\n    // Omitting checkExists avoids executing expensive synchronous SQLite SELECT queries on every\n    // pushed row change, eliminating a major bottleneck in push advancement.\n    yield* genPushAndWriteWithSplitEdit(\n      this.#connections,\n      change,\n      undefined,\n      setOverlay,\n      writeChange,\n      () => ++this.#pushEpoch,\n    );\n  }\n\n  #writeChange(change: SourceChange) {\n    const delta = this.#delta;\n    if (delta !== undefined) {\n      this.#writeChangeToDelta(delta, change);\n      return;\n    }\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  /**\n   * Reconciles a set of rows that the caller found in the *backing snapshot*\n   * with the changes this source has applied but not written.\n   *\n   * A view-syncer computes the rows a replicated change collides with -- by\n   * change-log key for a delete, by every unique key for a set -- against the\n   * snapshot it is reading. When derivation writes through, that snapshot has\n   * already absorbed the earlier changes of the same advancement, so the\n   * probe sees them. When derivation is deferred they live here instead, and\n   * the probe has to be brought up to date or the source is pushed a change\n   * that contradicts its own state (a delete of a row the batch already\n   * removed, an edit whose old row is stale).\n   *\n   * Two ways the batch can disagree with the probe, both handled here: a\n   * probed row may have been removed, or may have been edited (so the\n   * caller's copy is stale, or it no longer collides at all).\n   *\n   * The batch cannot have edited a row the probe missed *into* collision. The\n   * change log keeps one entry per row key, so every row the batch holds is\n   * that row's value at the advancement's target version, as is `next`, and\n   * two distinct rows of one version cannot share a non-null unique key.\n   *\n   * Returns `base` untouched when derivation is not deferred, which is what\n   * makes this a no-op for the write-through path.\n   */\n  reconcilePendingConflicts(\n    base: readonly Row[],\n    next: Row | null,\n    rowKey: SQLiteRow,\n    uniqueKeys: readonly (readonly string[])[],\n  ): readonly Row[] {\n    const delta = this.#delta;\n    if (delta === undefined || delta.isEmpty) {\n      return base;\n    }\n\n    // The change-log key uses SQLite values, while pending rows use ZQL\n    // values. It is the upstream replica identity, which may include columns\n    // the source does not sync. The batch cannot have changed those (nor can a\n    // write-through `UPDATE`), so only the synced columns are compared.\n    const deleteKey = next === null ? this.#syncedDeleteKey(rowKey) : undefined;\n    const out: Row[] = [];\n    for (const row of base) {\n      const pending = delta.get(row);\n      const current = pending === NOT_OVERRIDDEN ? row : pending;\n      if (current === undefined) {\n        continue; // the batch removed it\n      }\n      if (\n        deleteKey !== undefined\n          ? !deleteKey.every(([col, value]) =>\n              sqliteValuesEqual(current[col], value, this.#columns[col].type),\n            )\n          : !collides(\n              current,\n              must(next),\n              uniqueKeys,\n              this.#primaryKey,\n              this.#columns,\n            )\n      ) {\n        continue; // the batch edited it out of collision\n      }\n      out.push(current);\n    }\n    return out;\n  }\n\n  #syncedDeleteKey(rowKey: SQLiteRow): [string, Value][] {\n    const synced: Writable<SQLiteRow> = {};\n    for (const [col, value] of Object.entries(rowKey)) {\n      if (Object.hasOwn(this.#columns, col)) {\n        synced[col] = value;\n      }\n    }\n    return Object.entries(fromSQLiteTypes(this.#columns, synced, this.#table));\n  }\n\n  /**\n   * The batch-overlay counterpart of {@link #writeChange}. It must reproduce\n   * that method's semantics exactly, including its treatment of an edit that\n   * cannot be expressed as an `UPDATE` -- a changed primary key, or a table\n   * whose columns are all part of the key -- as a delete followed by an\n   * insert.\n   */\n  #writeChangeToDelta(delta: PendingDelta, change: SourceChange) {\n    switch (change[SourceChangeIndex.TYPE]) {\n      case ChangeType.ADD:\n        delta.set(change[SourceChangeIndex.ROW]);\n        break;\n      case ChangeType.REMOVE:\n        delta.delete(change[SourceChangeIndex.ROW]);\n        break;\n      case ChangeType.EDIT: {\n        const oldRow = change[SourceChangeIndex.OLD_ROW];\n        const row = change[SourceChangeIndex.ROW];\n        if (canUseUpdate(oldRow, row, this.#columns, this.#primaryKey)) {\n          // `UPDATE` sets only the non-primary columns, so the row keeps any\n          // column the change did not mention.\n          delta.set({...oldRow, ...row});\n        } else {\n          delta.delete(oldRow);\n          delta.set(row);\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    return getOrInsertComputed(this.#getRowStmtCache, keyString, () =>\n      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    );\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, ({statement}) => {\n      const values = statement\n        .safeIntegers(true)\n        .raw(true)\n        .get<SQLiteValue[] | undefined>(\n          ...toSQLiteTypes(keyCols, rowKey, this.#columns),\n        );\n      recordIndexUsage(statement, this.#table);\n      return values === undefined\n        ? undefined\n        : fromSQLiteRawRow(this.#rawColumnsFor(statement), values, this.#table);\n    });\n\n    const delta = this.#delta;\n    if (delta === undefined || delta.isEmpty) {\n      return row;\n    }\n    if (row !== undefined) {\n      // The batch may have edited or removed the base row out from under this\n      // lookup. Its own primary key is what identifies it in the batch.\n      const overridden = delta.get(row);\n      if (overridden === NOT_OVERRIDDEN) {\n        return row;\n      }\n      if (\n        overridden !== undefined &&\n        keyCols.every(c => overridden[c] === rowKey[c])\n      ) {\n        return overridden;\n      }\n    }\n    // The base match is absent, removed, or no longer matches this key. Another\n    // pending row may now own the key.\n    return delta.getByColumns(keyCols, rowKey);\n  }\n}\n\nfunction mergeOverlayPredicate(\n  connPredicate: ((row: Row) => boolean) | undefined,\n  reqFilter: StrictNoSubqueryCondition | undefined,\n): ((row: Row) => boolean) | undefined {\n  if (!reqFilter) {\n    return connPredicate;\n  }\n  const reqPredicate = createPredicate(reqFilter);\n  if (!connPredicate) {\n    return reqPredicate;\n  }\n  return row => connPredicate(row) && reqPredicate(row);\n}\n\n/**\n * Whether `a` occupies the same row identity as `b` -- the same primary key,\n * or the same value on any unique key, which is what a replicated write\n * conflicts on.\n */\nfunction collides(\n  a: Row,\n  b: Row,\n  uniqueKeys: readonly (readonly string[])[],\n  primaryKey: PrimaryKey,\n  columns: Record<string, SchemaValue>,\n): boolean {\n  if (\n    primaryKey.every(col =>\n      sqliteValuesEqual(a[col], b[col], columns[col].type),\n    )\n  ) {\n    return true;\n  }\n  for (const key of uniqueKeys) {\n    if (key.some(col => b[col] === null || b[col] === undefined)) {\n      continue;\n    }\n    if (\n      key.every(col => sqliteValuesEqual(a[col], b[col], columns[col].type))\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n\nfunction sqliteValuesEqual(\n  a: Value | undefined,\n  b: Value | undefined,\n  type: ValueType,\n) {\n  return toSQLiteType(a, type) === toSQLiteType(b, type);\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 AND\n            info.partial = 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\n/**\n * A column value as read from SQLite with `safeIntegers(true)`, i.e. before\n * {@link fromSQLiteTypes} converts it to a {@link Value}.\n */\nexport type SQLiteValue = bigint | number | string | null;\n\n/** A row as read from SQLite, before {@link fromSQLiteTypes}. */\nexport type SQLiteRow = Readonly<Record<string, SQLiteValue>>;\n\nexport function fromSQLiteTypes(\n  valueTypes: Record<string, SchemaValue>,\n  row: SQLiteRow,\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      throw invalidColumnError(valueTypes, key, tableName);\n    }\n    newRow[key] = fromSQLiteType(valueType.type, row[key], key, tableName);\n  }\n  return newRow;\n}\n\n/** A result column of a raw row and the type it converts to. */\nexport type RawColumn = {\n  readonly name: string;\n  readonly type: ValueType;\n};\n\nexport function rawColumn(\n  valueTypes: Record<string, SchemaValue>,\n  name: string,\n  tableName: string,\n): RawColumn {\n  // Not a column that `valueTypes` merely inherits, e.g. `toString`.\n  const valueType = Object.hasOwn(valueTypes, name)\n    ? valueTypes[name]\n    : undefined;\n  if (valueType === undefined) {\n    throw invalidColumnError(valueTypes, name, tableName);\n  }\n  return {name, type: valueType.type};\n}\n\nfunction invalidColumnError(\n  valueTypes: Record<string, SchemaValue>,\n  name: string,\n  tableName: string,\n): Error {\n  const columnList = Object.keys(valueTypes).sort().join(', ');\n  return new Error(\n    `Invalid column \"${name}\" for table \"${tableName}\". Synced columns include ${columnList}`,\n  );\n}\n\n/**\n * Like {@link fromSQLiteTypes}, for a row read with `raw(true)`: the row's\n * values are `values[offset]` up to `values[offset + columns.length - 1]`.\n */\nexport function fromSQLiteRawRow(\n  columns: readonly RawColumn[],\n  values: readonly SQLiteValue[],\n  tableName: string,\n  offset = 0,\n): Row {\n  const newRow: Writable<Row> = {};\n  for (let i = 0; i < columns.length; i++) {\n    const {name, type} = columns[i];\n    const value = fromSQLiteType(type, values[offset + i], name, tableName);\n    if (name === '__proto__') {\n      // An own property, not the legacy setter.\n      assignProperty<string, Value>(newRow, name, value);\n    } else {\n      newRow[name] = value;\n    }\n  }\n  return newRow;\n}\n\nfunction fromSQLiteType(\n  valueType: ValueType,\n  v: SQLiteValue,\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":";;;;;;;;;;;;;;;;AAiEA,IAAI,aAAa;AAMjB,IAAM,mBAAmB;AACzB,IAAM,iBAAiB;;;;;;;;;;;;;;;AAqCvB,IAAa,cAAb,MAA2C;CACzC,2BAAoB,IAAI,QAA8B;CACtD,8BAAuB,IAAI,QAAyC;CACpE,eAAsC,CAAC;CACvC;CACA;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,aAAa;;;;;;CAMb;CACA,YAAY;;;;;;;CAQZ,YACE,YACA,WACA,IACA,WACA,SACA,YACA,oBAAoB,OACpB,UAA8B,CAAC,GAC/B;EACA,KAAK,MAAM;EACX,KAAK,aAAa;EAClB,KAAK,SAAS;EACd,KAAK,WAAW;EAChB,KAAK,iBAAiB,iBAAiB,IAAI,SAAS;EACpD,KAAK,cAAc;EACnB,KAAK,kBAAkB,WAAW,KAAI,MAAK,CAAC,GAAG,KAAK,CAAC;EACrD,KAAK,SAAS,KAAK,kBAAkB,EAAE;EACvC,KAAK,eAAe;EACpB,KAAK,2BAA2B,QAAQ,2BAA2B;EACnE,KAAK,SAAS,QAAQ,cAClB,IAAI,aAAa,UAAU,IAC3B,KAAA;EAEJ,MAAM,gBAAgB,KAAK,UAAU,WAAW,SAAS,CAAC;EAC1D,OACE,KAAK,eAAe,IAAI,aAAa,GACrC,eAAe,cAAc,8BAC/B;CACF;;;;;CAMA,IAAI,WAAmB;EACrB,OAAO,KAAK;CACd;CAEA,IAAI,cAAc;EAChB,OAAO;GACL,MAAM,KAAK;GACX,SAAS,KAAK;GACd,YAAY,KAAK;EACnB;CACF;;;;;CAMA,MAAM,IAAc;EAClB,KAAK,SAAS,KAAK,kBAAkB,EAAE;EAGvC,KAAK,QAAQ,MAAM;CACrB;;;;;;;;CASA,eAAe,aAAsB;EACnC,OACE,KAAK,WAAW,KAAA,KAAa,KAAK,OAAO,SACzC,gEACF;EACA,IAAI,CAAC,aACH,KAAK,SAAS,KAAA;OAEd,KAAK,WAAW,IAAI,aAAa,KAAK,WAAW;CAErD;;;;;;;CAQA,wBAA8B;EAC5B,KAAK,QAAQ,MAAM;CACrB;;;;;;;;CASA,CAAC,sBAAuC;EACtC,MAAM,QAAQ,KAAK;EACnB,IAAI,UAAU,KAAA,GACZ;EAKF,KAAK,MAAM,OAAO,MAAM,YAAY,GAAG;GACrC,KAAK,OAAO,OAAO,IACjB,GAAG,cAAc,KAAK,aAAa,KAAK,KAAK,QAAQ,CACvD;GACA,IAAI,KAAK,aAAa,GACpB,MAAM;EAEV;EACA,MAAM,UAAU,OAAO,KAAK,KAAK,QAAQ;EACzC,KAAK,MAAM,OAAO,MAAM,SAAS,GAAG;GAClC,KAAK,OAAO,OAAO,IAAI,GAAG,cAAc,SAAS,KAAK,KAAK,QAAQ,CAAC;GACpE,IAAI,KAAK,aAAa,GACpB,MAAM;EAEV;EACA,KAAK,SAAS,KAAA;CAChB;CAEA,kBAAkB,IAAc;EAC9B,MAAM,SAAS,KAAK,SAAS,IAAI,EAAE;EACnC,IAAI,QACF,OAAO;EAGT,MAAM,QAAQ;GACZ,OAAO,IAAI,eAAe,EAAE;GAC5B,QAAQ,GAAG,QACT,QACE,GAAG,eAAe,IAAI,MAAM,KAAK,MAAM,EAAE,IAAI,IAAI,KAC/C,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,KAAI,MAAK,IAAI,MAAM,CAAC,CAAC,GAChD,IACF,EAAE,YAAY,IAAI,sBAChB,MAAM,KAAK,EAAC,QAAQ,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,OAAM,CAAC,CAAC,CACpD,KAAK,GAAG,CAAC,CACT,KAAK,GAAG,CACb,EAAE,EACJ,CACF;GACA,QAAQ,GAAG,QACT,QACE,GAAG,eAAe,IAAI,MAAM,KAAK,MAAM,EAAE,SAAS,IAAI,KACpD,KAAK,YAAY,KAAI,MAAK,GAAG,GAAG,IAAI,MAAM,CAAC,EAAE,GAAG,GAChD,OACF,GACF,CACF;GAEA,QACE,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,SAAS,KAAK,YAAY,SACjD,GAAG,QACD,QACE,GAAG,UAAU,IAAI,MAAM,KAAK,MAAM,EAAE,OAAO,IAAI,KAC7C,eAAe,KAAK,UAAU,KAAK,WAAW,CAAC,CAAC,KAC9C,MAAK,GAAG,GAAG,IAAI,MAAM,CAAC,EAAE,GAC1B,GACA,GACF,EAAE,SAAS,IAAI,KACb,KAAK,YAAY,KAAI,MAAK,GAAG,GAAG,IAAI,MAAM,CAAC,EAAE,GAAG,GAChD,OACF,GACF,CACF,IACA,KAAA;EACR;EACA,KAAK,SAAS,IAAI,IAAI,KAAK;EAC3B,OAAO;CACT;CAEA,IAAI,cAAc;EAChB,OAAO,IAAI,KACT,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,KAAI,MAAK,IAAI,MAAM,CAAC,CAAC,GAChD,GAAG,GACL;CACF;CAEA,WAAW,YAAwB,WAAkC;EACnE,OAAO;GACL,WAAW,KAAK;GAChB,SAAS,KAAK;GACd,YAAY,KAAK;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,KAAK;EAEtC,MAAM,WAAW,IAAI,cACnB,KAAK,QACL,KAAK,UACL,mBAAmB,SACnB,IACF;EACA,MAAM,QAAqB;GACzB,iBAAiB;GACjB,QAAO,QAAO,KAAK,OAAO,KAAK,YAAY,QAAQ;GACnD,YAAW,WAAU;IACnB,WAAW,SAAS;GACtB;GACA,eAAe;IACb,MAAM,MAAM,KAAK,aAAa,QAAQ,UAAU;IAChD,OAAO,QAAQ,IAAI,sBAAsB;IACzC,KAAK,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,KAAK,WAAW,YAAY,SAAS;EACpD,IAAI,CAAC,WACH,yBAAyB,MAAM,KAAK,WAAW;EAGjD,KAAK,aAAa,KAAK,UAAU;EACjC,OAAO;CACT;CAEA,YAAY,KAAe;EACzB,OAAO,OAAO,YACZ,OAAO,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,WAAW,CACxC,KACA,aAAa,OAAO,KAAK,SAAS,IAAI,CAAC,IAAI,CAC7C,CAAC,CACH;CACF;CAEA,CAAC,OACC,KACA,YACA,UACwB;EACxB,MAAM,EAAC,MAAM,UAAS;EAEtB,MAAM,OAAO,KAAK,WAAW,SAAS,IAAI,GAAG,GAAG,KAAK;EACrD,MAAM,mBAAmB,sBACvB,WAAW,SAAS,WACpB,IAAI,MACN;EACA,IAAI;GACF,IAAI,MAAM;IACR,MAAM,aAAa,eAAe,MAAM,IAAI,OAAO;IACnD,OAAO,kBACL,mBACE,oBACE,IAAI,OAAO,KACX,KAAK,kBACH,MACA,KACA,kBACA,MACA,UACF,GACA,IAAI,YACJ,KAAK,UACL,WAAW,iBACX,YAIA,YACA,kBACA,IAAI,gBACN,GACA,KAAK,YACP,GACA,IAAI,OACJ,UACF;GACF,OACE,OAAO,mBACL,6BACE,KAAK,kBACH,MACA,KACA,kBACA,KAAA,GACA,KAAA,CACF,GACA,IAAI,YACJ,KAAK,UACL,WAAW,iBACX,KAAK,aACL,kBACA,IAAI,gBACN,GACA,KAAK,YACP;EAEJ,UAAU;GAGR,KAAK,OAAO;EACd;CACF;;;;;;CAOA,CAAC,WACC,SACA,OACiC;EACjC,MAAM,EAAC,UAAS,KAAK;EACrB,KAAK,MAAM,kBAAkB,SAAS;GAGpC,MAAM,kBAAkB,MAAM,SAAS,eAAe,IAAI;GAC1D,MAAM,SAAS,gBAAgB,UAAU,QAAQ,eAAe,MAAM;GACtE,IAAI;IACF,OAAO,UAAU,KAAK,QAAQ,eAAe,IAAI;IACjD,OAAO,KAAK,UACV,QACA,KAAK,eAAe,gBAAgB,SAAS,GAC7C,eAAe,MACf,KACF;GACF,UAAU;IAER,OAAO,MAAM;IACb,iBAAiB,gBAAgB,WAAW,KAAK,MAAM;IACvD,IAAI,OAAO;KACT,IAAI,cAAc;KAClB,MAAM,YAAsB,CAAC;KAC7B,KAAK,IAAI,IAAI,IAAK,KAAK;MACrB,MAAM,SAAS,gBAAgB,UAAU,WACvC,GACA,gBAAgB,wBAChB,CACF;MACA,IAAI,WAAW,KAAA,GACb;MAEF,eAAe,OAAO,MAAM;MAC5B,MAAM,UAAU,gBAAgB,UAAU,WACxC,GACA,gBAAgB,yBAChB,CACF;MACA,IAAI,OAAO,YAAY,YAAY,QAAQ,SAAS,GAClD,UAAU,KAAK,OAAO;KAE1B;KACA,IAAI,gBAAgB,GAClB,MAAM,aAAa,KAAK,QAAQ,eAAe,MAAM,WAAW;KAElE,IAAI,UAAU,SAAS,GACrB,MAAM,cAAc,KAAK,QAAQ,eAAe,MAAM,SAAS;KAEjE,gBAAgB,UAAU,gBAAgB;IAC5C;IACA,MAAM,OAAO,eAAe;GAC9B;EACF;CACF;;;;;;;;;;;CAYA,kBACE,UACA,KACA,WACA,MACA,SACuB;EACvB,MAAM,QAAQ,KAAK;EACnB,IAAI,UAAU,KAAA,KAAa,MAAM,SAC/B,OAAO;EAET,MAAM,YAAY,MAAM,QACtB,QAAQ,KAAK,iBACb,IAAI,YACJ,OAAO,IAAI,UAAU,OACrB,WACA,IAAI,kBACJ,OAAO,IAAI,OAAO,MAAM,KAAA,CAC1B;EACA,OAAO,UACH,yBAAyB,UAAU,WAAW,OAAO,OAAO,IAC5D,kCAAkC,UAAU,WAAW,KAAK;CAClE;CAEA,eAAe,WAA4C;EACzD,OAAO,oBAAoB,KAAK,aAAa,iBAC3C,UACG,QAAQ,CAAC,CACT,KAAK,EAAC,WAAU,UAAU,KAAK,UAAU,MAAM,KAAK,MAAM,CAAC,CAChE;CACF;CAEA,CAAC,UACC,QACA,SACA,OACA,OACuB;EACvB,KAAK,IAAI,WAAW,oBAAqB;GACvC,MAAM,EAAC,aAAa,qBAAoB,KAAK;GAC7C,MAAM,UAAU,cAAc,KAAK,EAAE,aAAa,gBAAgB;GAClE,MAAM,QAAQ,UAAU,YAAY,IAAI,IAAI;GAC5C,MAAM,SAAS,OAAO,KAAK,QAAQ;GACnC,MAAM,IAAI,OAAO,SAAS,QAAQ;GAClC,IAAI,SAAS;IACX,MAAM,WAAW,YAAY,IAAI,IAAI;IAErC,IAAI,WAAW,mBAAmB,KAAK,IAAI,GAAG,CAAC,GAC7C,KAAK,IAAI,OACP,uCAAuC,MAAM,wCAAwC,SAAS,GAChG;GAEJ;GACA,IAAI,MAAM,GACR;GAIF,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;IAC1B,MAAM,MAAM,iBACV,SACA,QACA,KAAK,QACL,IAAI,QAAQ,MACd;IACA,KAAK;IACL,OAAO,UAAU,KAAK,QAAQ,OAAO,GAAG;IACxC,MAAM;GACR;GACA,WAAW,KAAK,IAAI,WAAW,GAAG,cAAc;EAClD;CACF;CAEA,CAAC,KAAK,QAAuC;EAC3C,KAAK,MAAM,UAAU,KAAK,QAAQ,MAAM,GACtC,IAAI,WAAW,SACb,MAAM;CAGZ;;;;;CAMA,IAAI,cAAsB;EACxB,OAAO,KAAK,QAAQ,QAAQ;CAC9B;;CAGA,IAAI,eAAuB;EACzB,OAAO,KAAK,QAAQ,kBAAkB;CACxC;;;;;CAMA,aAAa,KAAmB;EAC9B,IAAI,CAAC,KAAK,4BAA4B,KAAK,aAAa,WAAW,GACjE,OAAO;EAET,KAAK,MAAM,QAAQ,KAAK,cACtB,IAAI,CAAC,KAAK,WAAW,KAAK,QAAQ,UAAU,GAAG,GAC7C,OAAO;EAGX,OAAO;CACT;CAEA,iBAAiB,QAA+B;EAC9C,IAAI,CAAC,KAAK,4BAA4B,KAAK,aAAa,WAAW,GACjE,OAAO;EAET,MAAM,MAAM,OAAO;EACnB,IAAI,KAAK,aAAa,GAAG,GACvB,OAAO;EAET,IAAI,OAAO,OAA4B,GAAiB;GACtD,MAAM,SAAS,OAAO;GACtB,IAAI,UAAU,KAAK,aAAa,MAAM,GACpC,OAAO;EAEX;EACA,OAAO;CACT;CAEA,CAAC,QAAQ,QAAmD;EAC1D,IAAI,KAAK,4BAA4B,CAAC,KAAK,iBAAiB,MAAM,GAAG;GAGnE,IAAI,OAAO,OAA4B,GACrC,KAAK,aAAa,MAAM;GAE1B;EACF;EAEA,MAAM,cAAc,MAA4B,KAAK,WAAW;EAChE,MAAM,eAAe,MAAoB,KAAK,aAAa,CAAC;EA0B5D,OAAO,6BACL,KAAK,cACL,QACA,KAAA,GACA,YACA,mBACM,EAAE,KAAK,UACf;CACF;CAEA,aAAa,QAAsB;EACjC,MAAM,QAAQ,KAAK;EACnB,IAAI,UAAU,KAAA,GAAW;GACvB,KAAK,oBAAoB,OAAO,MAAM;GACtC;EACF;EACA,QAAQ,OAAO,IAAf;GACE,KAAK;IACH,KAAK,OAAO,OAAO,IACjB,GAAG,cAED,OAAO,KAAK,KAAK,QAAQ,GACzB,OAAO,IACP,KAAK,QACP,CACF;IACA;GACF,KAAK;IACH,KAAK,OAAO,OAAO,IACjB,GAAG,cACD,KAAK,aACL,OAAO,IACP,KAAK,QACP,CACF;IACA;GACF,KAAK;IAEH,IACE,aACE,OAAO,IACP,OAAO,IACP,KAAK,UACL,KAAK,WACP,GACA;KACA,MAAM,YAAY;MAChB,GAAG,OAAO;MACV,GAAG,OAAO;KACZ;KACA,MAAM,SAAS,CACb,GAAG,iBAAiB,KAAK,UAAU,KAAK,aAAa,SAAS,GAC9D,GAAG,cAAc,KAAK,aAAa,WAAW,KAAK,QAAQ,CAC7D;KACA,KAAK,KAAK,OAAO,MAAM,CAAC,CAAC,IAAI,MAAM;IACrC,OAAO;KACL,KAAK,OAAO,OAAO,IACjB,GAAG,cACD,KAAK,aACL,OAAO,IACP,KAAK,QACP,CACF;KACA,KAAK,OAAO,OAAO,IACjB,GAAG,cACD,OAAO,KAAK,KAAK,QAAQ,GACzB,OAAO,IACP,KAAK,QACP,CACF;IACF;IAEA;GAEF,SACE,YAAY,MAAM;EACtB;CACF;;;;;;;;;;;;;;;;;;;;;;;;;;CA2BA,0BACE,MACA,MACA,QACA,YACgB;EAChB,MAAM,QAAQ,KAAK;EACnB,IAAI,UAAU,KAAA,KAAa,MAAM,SAC/B,OAAO;EAOT,MAAM,YAAY,SAAS,OAAO,KAAK,iBAAiB,MAAM,IAAI,KAAA;EAClE,MAAM,MAAa,CAAC;EACpB,KAAK,MAAM,OAAO,MAAM;GACtB,MAAM,UAAU,MAAM,IAAI,GAAG;GAC7B,MAAM,UAAU,YAAY,iBAAiB,MAAM;GACnD,IAAI,YAAY,KAAA,GACd;GAEF,IACE,cAAc,KAAA,IACV,CAAC,UAAU,OAAO,CAAC,KAAK,WACtB,kBAAkB,QAAQ,MAAM,OAAO,KAAK,SAAS,IAAI,CAAC,IAAI,CAChE,IACA,CAAC,SACC,SACA,KAAK,IAAI,GACT,YACA,KAAK,aACL,KAAK,QACP,GAEJ;GAEF,IAAI,KAAK,OAAO;EAClB;EACA,OAAO;CACT;CAEA,iBAAiB,QAAsC;EACrD,MAAM,SAA8B,CAAC;EACrC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,GAC9C,IAAI,OAAO,OAAO,KAAK,UAAU,GAAG,GAClC,OAAO,OAAO;EAGlB,OAAO,OAAO,QAAQ,gBAAgB,KAAK,UAAU,QAAQ,KAAK,MAAM,CAAC;CAC3E;;;;;;;;CASA,oBAAoB,OAAqB,QAAsB;EAC7D,QAAQ,OAAO,IAAf;GACE,KAAK;IACH,MAAM,IAAI,OAAO,EAAsB;IACvC;GACF,KAAK;IACH,MAAM,OAAO,OAAO,EAAsB;IAC1C;GACF,KAAK,GAAiB;IACpB,MAAM,SAAS,OAAO;IACtB,MAAM,MAAM,OAAO;IACnB,IAAI,aAAa,QAAQ,KAAK,KAAK,UAAU,KAAK,WAAW,GAG3D,MAAM,IAAI;KAAC,GAAG;KAAQ,GAAG;IAAG,CAAC;SACxB;KACL,MAAM,OAAO,MAAM;KACnB,MAAM,IAAI,GAAG;IACf;IACA;GACF;GACA,SACE,YAAY,MAAM;EACtB;CACF;CAEA,mCAAmB,IAAI,IAAoB;CAE3C,YAAY,SAA2B;EACrC,MAAM,YAAY,KAAK,UAAU,OAAO;EACxC,OAAO,oBAAoB,KAAK,kBAAkB,iBAChD,QACE,GAAG,UAAU,KAAK,YAAY,QAAQ,IAAI,MACxC,KAAK,MACP,EAAE,SAAS,IAAI,KACb,QAAQ,KAAI,MAAK,GAAG,GAAG,IAAI,MAAM,CAAC,EAAE,GAAG,GACvC,GAAG,MACL,GACF,CACF;CACF;;;;;;;;CASA,OAAO,QAA8B;EACnC,MAAM,UAAU,OAAO,KAAK,MAAM;EAElC,MAAM,OAAO,KAAK,YAAY,OAAO;EACrC,MAAM,MAAM,KAAK,OAAO,MAAM,IAAI,OAAO,EAAC,gBAAe;GACvD,MAAM,SAAS,UACZ,aAAa,IAAI,CAAC,CAClB,IAAI,IAAI,CAAC,CACT,IACC,GAAG,cAAc,SAAS,QAAQ,KAAK,QAAQ,CACjD;GACF,iBAAiB,WAAW,KAAK,MAAM;GACvC,OAAO,WAAW,KAAA,IACd,KAAA,IACA,iBAAiB,KAAK,eAAe,SAAS,GAAG,QAAQ,KAAK,MAAM;EAC1E,CAAC;EAED,MAAM,QAAQ,KAAK;EACnB,IAAI,UAAU,KAAA,KAAa,MAAM,SAC/B,OAAO;EAET,IAAI,QAAQ,KAAA,GAAW;GAGrB,MAAM,aAAa,MAAM,IAAI,GAAG;GAChC,IAAI,eAAe,gBACjB,OAAO;GAET,IACE,eAAe,KAAA,KACf,QAAQ,OAAM,MAAK,WAAW,OAAO,OAAO,EAAE,GAE9C,OAAO;EAEX;EAGA,OAAO,MAAM,aAAa,SAAS,MAAM;CAC3C;AACF;AAEA,SAAS,sBACP,eACA,WACqC;CACrC,IAAI,CAAC,WACH,OAAO;CAET,MAAM,eAAe,gBAAgB,SAAS;CAC9C,IAAI,CAAC,eACH,OAAO;CAET,QAAO,QAAO,cAAc,GAAG,KAAK,aAAa,GAAG;AACtD;;;;;;AAOA,SAAS,SACP,GACA,GACA,YACA,YACA,SACS;CACT,IACE,WAAW,OAAM,QACf,kBAAkB,EAAE,MAAM,EAAE,MAAM,QAAQ,IAAI,CAAC,IAAI,CACrD,GAEA,OAAO;CAET,KAAK,MAAM,OAAO,YAAY;EAC5B,IAAI,IAAI,MAAK,QAAO,EAAE,SAAS,QAAQ,EAAE,SAAS,KAAA,CAAS,GACzD;EAEF,IACE,IAAI,OAAM,QAAO,kBAAkB,EAAE,MAAM,EAAE,MAAM,QAAQ,IAAI,CAAC,IAAI,CAAC,GAErE,OAAO;CAEX;CACA,OAAO;AACT;AAEA,SAAS,kBACP,GACA,GACA,MACA;CACA,OAAO,aAAa,GAAG,IAAI,MAAM,aAAa,GAAG,IAAI;AACvD;AAEA,SAAS,iBACP,IACA,WAC0B;CAC1B,MAAM,iBAAiB,OACrB,GAAG;;;;;6BAKsB,UAAU;;;;;wBAMrC;CAEA,MAAM,UADO,GAAG,QAAQ,eAAe,IACvB,CAAA,CAAK,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,IAAI,CAAC,IAAI,CAAC;AACzE;AA0BA,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,GAChB,MAAM,mBAAmB,YAAY,KAAK,SAAS;EAErD,OAAO,OAAO,eAAe,UAAU,MAAM,IAAI,MAAM,KAAK,SAAS;CACvE;CACA,OAAO;AACT;AAQA,SAAgB,UACd,YACA,MACA,WACW;CAEX,MAAM,YAAY,OAAO,OAAO,YAAY,IAAI,IAC5C,WAAW,QACX,KAAA;CACJ,IAAI,cAAc,KAAA,GAChB,MAAM,mBAAmB,YAAY,MAAM,SAAS;CAEtD,OAAO;EAAC;EAAM,MAAM,UAAU;CAAI;AACpC;AAEA,SAAS,mBACP,YACA,MACA,WACO;CACP,MAAM,aAAa,OAAO,KAAK,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI;CAC3D,uBAAO,IAAI,MACT,mBAAmB,KAAK,eAAe,UAAU,4BAA4B,YAC/E;AACF;;;;;AAMA,SAAgB,iBACd,SACA,QACA,WACA,SAAS,GACJ;CACL,MAAM,SAAwB,CAAC;CAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;EACvC,MAAM,EAAC,MAAM,SAAQ,QAAQ;EAC7B,MAAM,QAAQ,eAAe,MAAM,OAAO,SAAS,IAAI,MAAM,SAAS;EACtE,IAAI,SAAS,aAEX,eAA8B,QAAQ,MAAM,KAAK;OAEjD,OAAO,QAAQ;CAEnB;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,CAAC,CAAC,SAAS,WAAW;AAClD;AAEA,SAAS,iBACP,SACA,YACA,KACmB;CACnB,OAAO,eAAe,SAAS,UAAU,CAAC,CAAC,KAAI,MAC7C,aAAa,IAAI,IAAI,QAAQ,EAAE,CAAC,IAAI,CACtC;AACF;AAEA,SAAS,eACP,SACA,YACA;CACA,OAAO,OAAO,KAAK,OAAO,CAAC,CAAC,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"}